1 //===--- HeaderIncludes.cpp - Insert/Delete #includes --*- C++ -*----------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 #include "clang/Tooling/Inclusions/HeaderIncludes.h" 10 #include "clang/Basic/FileManager.h" 11 #include "clang/Basic/SourceManager.h" 12 #include "clang/Lex/Lexer.h" 13 #include "llvm/ADT/Optional.h" 14 #include "llvm/Support/FormatVariadic.h" 15 #include "llvm/Support/Path.h" 16 17 namespace clang { 18 namespace tooling { 19 namespace { 20 21 LangOptions createLangOpts() { 22 LangOptions LangOpts; 23 LangOpts.CPlusPlus = 1; 24 LangOpts.CPlusPlus11 = 1; 25 LangOpts.CPlusPlus14 = 1; 26 LangOpts.LineComment = 1; 27 LangOpts.CXXOperatorNames = 1; 28 LangOpts.Bool = 1; 29 LangOpts.ObjC = 1; 30 LangOpts.MicrosoftExt = 1; // To get kw___try, kw___finally. 31 LangOpts.DeclSpecKeyword = 1; // To get __declspec. 32 LangOpts.WChar = 1; // To get wchar_t 33 return LangOpts; 34 } 35 36 // Returns the offset after skipping a sequence of tokens, matched by \p 37 // GetOffsetAfterSequence, from the start of the code. 38 // \p GetOffsetAfterSequence should be a function that matches a sequence of 39 // tokens and returns an offset after the sequence. 40 unsigned getOffsetAfterTokenSequence( 41 StringRef FileName, StringRef Code, const IncludeStyle &Style, 42 llvm::function_ref<unsigned(const SourceManager &, Lexer &, Token &)> 43 GetOffsetAfterSequence) { 44 SourceManagerForFile VirtualSM(FileName, Code); 45 SourceManager &SM = VirtualSM.get(); 46 Lexer Lex(SM.getMainFileID(), SM.getBuffer(SM.getMainFileID()), SM, 47 createLangOpts()); 48 Token Tok; 49 // Get the first token. 50 Lex.LexFromRawLexer(Tok); 51 return GetOffsetAfterSequence(SM, Lex, Tok); 52 } 53 54 // Check if a sequence of tokens is like "#<Name> <raw_identifier>". If it is, 55 // \p Tok will be the token after this directive; otherwise, it can be any token 56 // after the given \p Tok (including \p Tok). If \p RawIDName is provided, the 57 // (second) raw_identifier name is checked. 58 bool checkAndConsumeDirectiveWithName( 59 Lexer &Lex, StringRef Name, Token &Tok, 60 llvm::Optional<StringRef> RawIDName = llvm::None) { 61 bool Matched = Tok.is(tok::hash) && !Lex.LexFromRawLexer(Tok) && 62 Tok.is(tok::raw_identifier) && 63 Tok.getRawIdentifier() == Name && !Lex.LexFromRawLexer(Tok) && 64 Tok.is(tok::raw_identifier) && 65 (!RawIDName || Tok.getRawIdentifier() == *RawIDName); 66 if (Matched) 67 Lex.LexFromRawLexer(Tok); 68 return Matched; 69 } 70 71 void skipComments(Lexer &Lex, Token &Tok) { 72 while (Tok.is(tok::comment)) 73 if (Lex.LexFromRawLexer(Tok)) 74 return; 75 } 76 77 // Returns the offset after header guard directives and any comments 78 // before/after header guards (e.g. #ifndef/#define pair, #pragma once). If no 79 // header guard is present in the code, this will return the offset after 80 // skipping all comments from the start of the code. 81 unsigned getOffsetAfterHeaderGuardsAndComments(StringRef FileName, 82 StringRef Code, 83 const IncludeStyle &Style) { 84 // \p Consume returns location after header guard or 0 if no header guard is 85 // found. 86 auto ConsumeHeaderGuardAndComment = 87 [&](std::function<unsigned(const SourceManager &SM, Lexer &Lex, 88 Token Tok)> 89 Consume) { 90 return getOffsetAfterTokenSequence( 91 FileName, Code, Style, 92 [&Consume](const SourceManager &SM, Lexer &Lex, Token Tok) { 93 skipComments(Lex, Tok); 94 unsigned InitialOffset = SM.getFileOffset(Tok.getLocation()); 95 return std::max(InitialOffset, Consume(SM, Lex, Tok)); 96 }); 97 }; 98 return std::max( 99 // #ifndef/#define 100 ConsumeHeaderGuardAndComment( 101 [](const SourceManager &SM, Lexer &Lex, Token Tok) -> unsigned { 102 if (checkAndConsumeDirectiveWithName(Lex, "ifndef", Tok)) { 103 skipComments(Lex, Tok); 104 if (checkAndConsumeDirectiveWithName(Lex, "define", Tok) && 105 Tok.isAtStartOfLine()) 106 return SM.getFileOffset(Tok.getLocation()); 107 } 108 return 0; 109 }), 110 // #pragma once 111 ConsumeHeaderGuardAndComment( 112 [](const SourceManager &SM, Lexer &Lex, Token Tok) -> unsigned { 113 if (checkAndConsumeDirectiveWithName(Lex, "pragma", Tok, 114 StringRef("once"))) 115 return SM.getFileOffset(Tok.getLocation()); 116 return 0; 117 })); 118 } 119 120 // Check if a sequence of tokens is like 121 // "#include ("header.h" | <header.h>)". 122 // If it is, \p Tok will be the token after this directive; otherwise, it can be 123 // any token after the given \p Tok (including \p Tok). 124 bool checkAndConsumeInclusiveDirective(Lexer &Lex, Token &Tok) { 125 auto Matched = [&]() { 126 Lex.LexFromRawLexer(Tok); 127 return true; 128 }; 129 if (Tok.is(tok::hash) && !Lex.LexFromRawLexer(Tok) && 130 Tok.is(tok::raw_identifier) && Tok.getRawIdentifier() == "include") { 131 if (Lex.LexFromRawLexer(Tok)) 132 return false; 133 if (Tok.is(tok::string_literal)) 134 return Matched(); 135 if (Tok.is(tok::less)) { 136 while (!Lex.LexFromRawLexer(Tok) && Tok.isNot(tok::greater)) { 137 } 138 if (Tok.is(tok::greater)) 139 return Matched(); 140 } 141 } 142 return false; 143 } 144 145 // Returns the offset of the last #include directive after which a new 146 // #include can be inserted. This ignores #include's after the #include block(s) 147 // in the beginning of a file to avoid inserting headers into code sections 148 // where new #include's should not be added by default. 149 // These code sections include: 150 // - raw string literals (containing #include). 151 // - #if blocks. 152 // - Special #include's among declarations (e.g. functions). 153 // 154 // If no #include after which a new #include can be inserted, this returns the 155 // offset after skipping all comments from the start of the code. 156 // Inserting after an #include is not allowed if it comes after code that is not 157 // #include (e.g. pre-processing directive that is not #include, declarations). 158 unsigned getMaxHeaderInsertionOffset(StringRef FileName, StringRef Code, 159 const IncludeStyle &Style) { 160 return getOffsetAfterTokenSequence( 161 FileName, Code, Style, 162 [](const SourceManager &SM, Lexer &Lex, Token Tok) { 163 skipComments(Lex, Tok); 164 unsigned MaxOffset = SM.getFileOffset(Tok.getLocation()); 165 while (checkAndConsumeInclusiveDirective(Lex, Tok)) 166 MaxOffset = SM.getFileOffset(Tok.getLocation()); 167 return MaxOffset; 168 }); 169 } 170 171 inline StringRef trimInclude(StringRef IncludeName) { 172 return IncludeName.trim("\"<>"); 173 } 174 175 const char IncludeRegexPattern[] = 176 R"(^[\t\ ]*#[\t\ ]*(import|include)[^"<]*(["<][^">]*[">]))"; 177 178 // The filename of Path excluding extension. 179 // Used to match implementation with headers, this differs from sys::path::stem: 180 // - in names with multiple dots (foo.cu.cc) it terminates at the *first* 181 // - an empty stem is never returned: /foo/.bar.x => .bar 182 // - we don't bother to handle . and .. specially 183 StringRef matchingStem(llvm::StringRef Path) { 184 StringRef Name = llvm::sys::path::filename(Path); 185 return Name.substr(0, Name.find('.', 1)); 186 } 187 188 } // anonymous namespace 189 190 IncludeCategoryManager::IncludeCategoryManager(const IncludeStyle &Style, 191 StringRef FileName) 192 : Style(Style), FileName(FileName) { 193 FileStem = matchingStem(FileName); 194 for (const auto &Category : Style.IncludeCategories) 195 CategoryRegexs.emplace_back(Category.Regex, llvm::Regex::IgnoreCase); 196 IsMainFile = FileName.endswith(".c") || FileName.endswith(".cc") || 197 FileName.endswith(".cpp") || FileName.endswith(".c++") || 198 FileName.endswith(".cxx") || FileName.endswith(".m") || 199 FileName.endswith(".mm"); 200 if (!Style.IncludeIsMainSourceRegex.empty()) { 201 llvm::Regex MainFileRegex(Style.IncludeIsMainSourceRegex); 202 IsMainFile |= MainFileRegex.match(FileName); 203 } 204 } 205 206 int IncludeCategoryManager::getIncludePriority(StringRef IncludeName, 207 bool CheckMainHeader) const { 208 int Ret = INT_MAX; 209 for (unsigned i = 0, e = CategoryRegexs.size(); i != e; ++i) 210 if (CategoryRegexs[i].match(IncludeName)) { 211 Ret = Style.IncludeCategories[i].Priority; 212 break; 213 } 214 if (CheckMainHeader && IsMainFile && Ret > 0 && isMainHeader(IncludeName)) 215 Ret = 0; 216 return Ret; 217 } 218 219 int IncludeCategoryManager::getSortIncludePriority(StringRef IncludeName, 220 bool CheckMainHeader) const { 221 int Ret = INT_MAX; 222 for (unsigned i = 0, e = CategoryRegexs.size(); i != e; ++i) 223 if (CategoryRegexs[i].match(IncludeName)) { 224 Ret = Style.IncludeCategories[i].SortPriority; 225 if (Ret == 0) 226 Ret = Style.IncludeCategories[i].Priority; 227 break; 228 } 229 if (CheckMainHeader && IsMainFile && Ret > 0 && isMainHeader(IncludeName)) 230 Ret = 0; 231 return Ret; 232 } 233 bool IncludeCategoryManager::isMainHeader(StringRef IncludeName) const { 234 if (!IncludeName.startswith("\"")) 235 return false; 236 StringRef HeaderStem = matchingStem(IncludeName.drop_front(1).drop_back(1)); 237 if (FileStem.startswith(HeaderStem) || 238 FileStem.startswith_lower(HeaderStem)) { 239 llvm::Regex MainIncludeRegex(HeaderStem.str() + Style.IncludeIsMainRegex, 240 llvm::Regex::IgnoreCase); 241 if (MainIncludeRegex.match(FileStem)) 242 return true; 243 } 244 return false; 245 } 246 247 HeaderIncludes::HeaderIncludes(StringRef FileName, StringRef Code, 248 const IncludeStyle &Style) 249 : FileName(FileName), Code(Code), FirstIncludeOffset(-1), 250 MinInsertOffset( 251 getOffsetAfterHeaderGuardsAndComments(FileName, Code, Style)), 252 MaxInsertOffset(MinInsertOffset + 253 getMaxHeaderInsertionOffset( 254 FileName, Code.drop_front(MinInsertOffset), Style)), 255 Categories(Style, FileName), 256 IncludeRegex(llvm::Regex(IncludeRegexPattern)) { 257 // Add 0 for main header and INT_MAX for headers that are not in any 258 // category. 259 Priorities = {0, INT_MAX}; 260 for (const auto &Category : Style.IncludeCategories) 261 Priorities.insert(Category.Priority); 262 SmallVector<StringRef, 32> Lines; 263 Code.drop_front(MinInsertOffset).split(Lines, "\n"); 264 265 unsigned Offset = MinInsertOffset; 266 unsigned NextLineOffset; 267 SmallVector<StringRef, 4> Matches; 268 for (auto Line : Lines) { 269 NextLineOffset = std::min(Code.size(), Offset + Line.size() + 1); 270 if (IncludeRegex.match(Line, &Matches)) { 271 // If this is the last line without trailing newline, we need to make 272 // sure we don't delete across the file boundary. 273 addExistingInclude( 274 Include(Matches[2], 275 tooling::Range( 276 Offset, std::min(Line.size() + 1, Code.size() - Offset))), 277 NextLineOffset); 278 } 279 Offset = NextLineOffset; 280 } 281 282 // Populate CategoryEndOfssets: 283 // - Ensure that CategoryEndOffset[Highest] is always populated. 284 // - If CategoryEndOffset[Priority] isn't set, use the next higher value 285 // that is set, up to CategoryEndOffset[Highest]. 286 auto Highest = Priorities.begin(); 287 if (CategoryEndOffsets.find(*Highest) == CategoryEndOffsets.end()) { 288 if (FirstIncludeOffset >= 0) 289 CategoryEndOffsets[*Highest] = FirstIncludeOffset; 290 else 291 CategoryEndOffsets[*Highest] = MinInsertOffset; 292 } 293 // By this point, CategoryEndOffset[Highest] is always set appropriately: 294 // - to an appropriate location before/after existing #includes, or 295 // - to right after the header guard, or 296 // - to the beginning of the file. 297 for (auto I = ++Priorities.begin(), E = Priorities.end(); I != E; ++I) 298 if (CategoryEndOffsets.find(*I) == CategoryEndOffsets.end()) 299 CategoryEndOffsets[*I] = CategoryEndOffsets[*std::prev(I)]; 300 } 301 302 // \p Offset: the start of the line following this include directive. 303 void HeaderIncludes::addExistingInclude(Include IncludeToAdd, 304 unsigned NextLineOffset) { 305 auto Iter = 306 ExistingIncludes.try_emplace(trimInclude(IncludeToAdd.Name)).first; 307 Iter->second.push_back(std::move(IncludeToAdd)); 308 auto &CurInclude = Iter->second.back(); 309 // The header name with quotes or angle brackets. 310 // Only record the offset of current #include if we can insert after it. 311 if (CurInclude.R.getOffset() <= MaxInsertOffset) { 312 int Priority = Categories.getIncludePriority( 313 CurInclude.Name, /*CheckMainHeader=*/FirstIncludeOffset < 0); 314 CategoryEndOffsets[Priority] = NextLineOffset; 315 IncludesByPriority[Priority].push_back(&CurInclude); 316 if (FirstIncludeOffset < 0) 317 FirstIncludeOffset = CurInclude.R.getOffset(); 318 } 319 } 320 321 llvm::Optional<tooling::Replacement> 322 HeaderIncludes::insert(llvm::StringRef IncludeName, bool IsAngled) const { 323 assert(IncludeName == trimInclude(IncludeName)); 324 // If a <header> ("header") already exists in code, "header" (<header>) with 325 // different quotation will still be inserted. 326 // FIXME: figure out if this is the best behavior. 327 auto It = ExistingIncludes.find(IncludeName); 328 if (It != ExistingIncludes.end()) 329 for (const auto &Inc : It->second) 330 if ((IsAngled && StringRef(Inc.Name).startswith("<")) || 331 (!IsAngled && StringRef(Inc.Name).startswith("\""))) 332 return llvm::None; 333 std::string Quoted = 334 std::string(llvm::formatv(IsAngled ? "<{0}>" : "\"{0}\"", IncludeName)); 335 StringRef QuotedName = Quoted; 336 int Priority = Categories.getIncludePriority( 337 QuotedName, /*CheckMainHeader=*/FirstIncludeOffset < 0); 338 auto CatOffset = CategoryEndOffsets.find(Priority); 339 assert(CatOffset != CategoryEndOffsets.end()); 340 unsigned InsertOffset = CatOffset->second; // Fall back offset 341 auto Iter = IncludesByPriority.find(Priority); 342 if (Iter != IncludesByPriority.end()) { 343 for (const auto *Inc : Iter->second) { 344 if (QuotedName < Inc->Name) { 345 InsertOffset = Inc->R.getOffset(); 346 break; 347 } 348 } 349 } 350 assert(InsertOffset <= Code.size()); 351 std::string NewInclude = 352 std::string(llvm::formatv("#include {0}\n", QuotedName)); 353 // When inserting headers at end of the code, also append '\n' to the code 354 // if it does not end with '\n'. 355 // FIXME: when inserting multiple #includes at the end of code, only one 356 // newline should be added. 357 if (InsertOffset == Code.size() && (!Code.empty() && Code.back() != '\n')) 358 NewInclude = "\n" + NewInclude; 359 return tooling::Replacement(FileName, InsertOffset, 0, NewInclude); 360 } 361 362 tooling::Replacements HeaderIncludes::remove(llvm::StringRef IncludeName, 363 bool IsAngled) const { 364 assert(IncludeName == trimInclude(IncludeName)); 365 tooling::Replacements Result; 366 auto Iter = ExistingIncludes.find(IncludeName); 367 if (Iter == ExistingIncludes.end()) 368 return Result; 369 for (const auto &Inc : Iter->second) { 370 if ((IsAngled && StringRef(Inc.Name).startswith("\"")) || 371 (!IsAngled && StringRef(Inc.Name).startswith("<"))) 372 continue; 373 llvm::Error Err = Result.add(tooling::Replacement( 374 FileName, Inc.R.getOffset(), Inc.R.getLength(), "")); 375 if (Err) { 376 auto ErrMsg = "Unexpected conflicts in #include deletions: " + 377 llvm::toString(std::move(Err)); 378 llvm_unreachable(ErrMsg.c_str()); 379 } 380 } 381 return Result; 382 } 383 384 } // namespace tooling 385 } // namespace clang 386