1 //===--- SourceCode.h - Manipulating source code as strings -----*- 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 #include "SourceCode.h" 9 10 #include "FuzzyMatch.h" 11 #include "Preamble.h" 12 #include "Protocol.h" 13 #include "refactor/Tweak.h" 14 #include "support/Context.h" 15 #include "support/Logger.h" 16 #include "support/Threading.h" 17 #include "clang/AST/ASTContext.h" 18 #include "clang/Basic/LangOptions.h" 19 #include "clang/Basic/SourceLocation.h" 20 #include "clang/Basic/SourceManager.h" 21 #include "clang/Basic/TokenKinds.h" 22 #include "clang/Driver/Types.h" 23 #include "clang/Format/Format.h" 24 #include "clang/Lex/Lexer.h" 25 #include "clang/Lex/Preprocessor.h" 26 #include "clang/Lex/Token.h" 27 #include "clang/Tooling/Core/Replacement.h" 28 #include "clang/Tooling/Syntax/Tokens.h" 29 #include "llvm/ADT/ArrayRef.h" 30 #include "llvm/ADT/None.h" 31 #include "llvm/ADT/STLExtras.h" 32 #include "llvm/ADT/StringExtras.h" 33 #include "llvm/ADT/StringMap.h" 34 #include "llvm/ADT/StringRef.h" 35 #include "llvm/Support/Compiler.h" 36 #include "llvm/Support/Errc.h" 37 #include "llvm/Support/Error.h" 38 #include "llvm/Support/ErrorHandling.h" 39 #include "llvm/Support/LineIterator.h" 40 #include "llvm/Support/MemoryBuffer.h" 41 #include "llvm/Support/Path.h" 42 #include "llvm/Support/SHA1.h" 43 #include "llvm/Support/VirtualFileSystem.h" 44 #include "llvm/Support/xxhash.h" 45 #include <algorithm> 46 #include <cstddef> 47 #include <string> 48 #include <vector> 49 50 namespace clang { 51 namespace clangd { 52 53 // Here be dragons. LSP positions use columns measured in *UTF-16 code units*! 54 // Clangd uses UTF-8 and byte-offsets internally, so conversion is nontrivial. 55 56 // Iterates over unicode codepoints in the (UTF-8) string. For each, 57 // invokes CB(UTF-8 length, UTF-16 length), and breaks if it returns true. 58 // Returns true if CB returned true, false if we hit the end of string. 59 // 60 // If the string is not valid UTF-8, we log this error and "decode" the 61 // text in some arbitrary way. This is pretty sad, but this tends to happen deep 62 // within indexing of headers where clang misdetected the encoding, and 63 // propagating the error all the way back up is (probably?) not be worth it. 64 template <typename Callback> 65 static bool iterateCodepoints(llvm::StringRef U8, const Callback &CB) { 66 bool LoggedInvalid = false; 67 // A codepoint takes two UTF-16 code unit if it's astral (outside BMP). 68 // Astral codepoints are encoded as 4 bytes in UTF-8, starting with 11110xxx. 69 for (size_t I = 0; I < U8.size();) { 70 unsigned char C = static_cast<unsigned char>(U8[I]); 71 if (LLVM_LIKELY(!(C & 0x80))) { // ASCII character. 72 if (CB(1, 1)) 73 return true; 74 ++I; 75 continue; 76 } 77 // This convenient property of UTF-8 holds for all non-ASCII characters. 78 size_t UTF8Length = llvm::countLeadingOnes(C); 79 // 0xxx is ASCII, handled above. 10xxx is a trailing byte, invalid here. 80 // 11111xxx is not valid UTF-8 at all, maybe some ISO-8859-*. 81 if (LLVM_UNLIKELY(UTF8Length < 2 || UTF8Length > 4)) { 82 if (!LoggedInvalid) { 83 elog("File has invalid UTF-8 near offset {0}: {1}", I, llvm::toHex(U8)); 84 LoggedInvalid = true; 85 } 86 // We can't give a correct result, but avoid returning something wild. 87 // Pretend this is a valid ASCII byte, for lack of better options. 88 // (Too late to get ISO-8859-* right, we've skipped some bytes already). 89 if (CB(1, 1)) 90 return true; 91 ++I; 92 continue; 93 } 94 I += UTF8Length; // Skip over all trailing bytes. 95 // A codepoint takes two UTF-16 code unit if it's astral (outside BMP). 96 // Astral codepoints are encoded as 4 bytes in UTF-8 (11110xxx ...) 97 if (CB(UTF8Length, UTF8Length == 4 ? 2 : 1)) 98 return true; 99 } 100 return false; 101 } 102 103 // Returns the byte offset into the string that is an offset of \p Units in 104 // the specified encoding. 105 // Conceptually, this converts to the encoding, truncates to CodeUnits, 106 // converts back to UTF-8, and returns the length in bytes. 107 static size_t measureUnits(llvm::StringRef U8, int Units, OffsetEncoding Enc, 108 bool &Valid) { 109 Valid = Units >= 0; 110 if (Units <= 0) 111 return 0; 112 size_t Result = 0; 113 switch (Enc) { 114 case OffsetEncoding::UTF8: 115 Result = Units; 116 break; 117 case OffsetEncoding::UTF16: 118 Valid = iterateCodepoints(U8, [&](int U8Len, int U16Len) { 119 Result += U8Len; 120 Units -= U16Len; 121 return Units <= 0; 122 }); 123 if (Units < 0) // Offset in the middle of a surrogate pair. 124 Valid = false; 125 break; 126 case OffsetEncoding::UTF32: 127 Valid = iterateCodepoints(U8, [&](int U8Len, int U16Len) { 128 Result += U8Len; 129 Units--; 130 return Units <= 0; 131 }); 132 break; 133 case OffsetEncoding::UnsupportedEncoding: 134 llvm_unreachable("unsupported encoding"); 135 } 136 // Don't return an out-of-range index if we overran. 137 if (Result > U8.size()) { 138 Valid = false; 139 return U8.size(); 140 } 141 return Result; 142 } 143 144 Key<OffsetEncoding> kCurrentOffsetEncoding; 145 static OffsetEncoding lspEncoding() { 146 auto *Enc = Context::current().get(kCurrentOffsetEncoding); 147 return Enc ? *Enc : OffsetEncoding::UTF16; 148 } 149 150 // Like most strings in clangd, the input is UTF-8 encoded. 151 size_t lspLength(llvm::StringRef Code) { 152 size_t Count = 0; 153 switch (lspEncoding()) { 154 case OffsetEncoding::UTF8: 155 Count = Code.size(); 156 break; 157 case OffsetEncoding::UTF16: 158 iterateCodepoints(Code, [&](int U8Len, int U16Len) { 159 Count += U16Len; 160 return false; 161 }); 162 break; 163 case OffsetEncoding::UTF32: 164 iterateCodepoints(Code, [&](int U8Len, int U16Len) { 165 ++Count; 166 return false; 167 }); 168 break; 169 case OffsetEncoding::UnsupportedEncoding: 170 llvm_unreachable("unsupported encoding"); 171 } 172 return Count; 173 } 174 175 llvm::Expected<size_t> positionToOffset(llvm::StringRef Code, Position P, 176 bool AllowColumnsBeyondLineLength) { 177 if (P.line < 0) 178 return error(llvm::errc::invalid_argument, 179 "Line value can't be negative ({0})", P.line); 180 if (P.character < 0) 181 return error(llvm::errc::invalid_argument, 182 "Character value can't be negative ({0})", P.character); 183 size_t StartOfLine = 0; 184 for (int I = 0; I != P.line; ++I) { 185 size_t NextNL = Code.find('\n', StartOfLine); 186 if (NextNL == llvm::StringRef::npos) 187 return error(llvm::errc::invalid_argument, 188 "Line value is out of range ({0})", P.line); 189 StartOfLine = NextNL + 1; 190 } 191 StringRef Line = 192 Code.substr(StartOfLine).take_until([](char C) { return C == '\n'; }); 193 194 // P.character may be in UTF-16, transcode if necessary. 195 bool Valid; 196 size_t ByteInLine = measureUnits(Line, P.character, lspEncoding(), Valid); 197 if (!Valid && !AllowColumnsBeyondLineLength) 198 return error(llvm::errc::invalid_argument, 199 "{0} offset {1} is invalid for line {2}", lspEncoding(), 200 P.character, P.line); 201 return StartOfLine + ByteInLine; 202 } 203 204 Position offsetToPosition(llvm::StringRef Code, size_t Offset) { 205 Offset = std::min(Code.size(), Offset); 206 llvm::StringRef Before = Code.substr(0, Offset); 207 int Lines = Before.count('\n'); 208 size_t PrevNL = Before.rfind('\n'); 209 size_t StartOfLine = (PrevNL == llvm::StringRef::npos) ? 0 : (PrevNL + 1); 210 Position Pos; 211 Pos.line = Lines; 212 Pos.character = lspLength(Before.substr(StartOfLine)); 213 return Pos; 214 } 215 216 Position sourceLocToPosition(const SourceManager &SM, SourceLocation Loc) { 217 // We use the SourceManager's line tables, but its column number is in bytes. 218 FileID FID; 219 unsigned Offset; 220 std::tie(FID, Offset) = SM.getDecomposedSpellingLoc(Loc); 221 Position P; 222 P.line = static_cast<int>(SM.getLineNumber(FID, Offset)) - 1; 223 bool Invalid = false; 224 llvm::StringRef Code = SM.getBufferData(FID, &Invalid); 225 if (!Invalid) { 226 auto ColumnInBytes = SM.getColumnNumber(FID, Offset) - 1; 227 auto LineSoFar = Code.substr(Offset - ColumnInBytes, ColumnInBytes); 228 P.character = lspLength(LineSoFar); 229 } 230 return P; 231 } 232 233 bool isSpelledInSource(SourceLocation Loc, const SourceManager &SM) { 234 if (Loc.isMacroID()) { 235 std::string PrintLoc = SM.getSpellingLoc(Loc).printToString(SM); 236 if (llvm::StringRef(PrintLoc).startswith("<scratch") || 237 llvm::StringRef(PrintLoc).startswith("<command line>")) 238 return false; 239 } 240 return true; 241 } 242 243 bool isValidFileRange(const SourceManager &Mgr, SourceRange R) { 244 if (!R.getBegin().isValid() || !R.getEnd().isValid()) 245 return false; 246 247 FileID BeginFID; 248 size_t BeginOffset = 0; 249 std::tie(BeginFID, BeginOffset) = Mgr.getDecomposedLoc(R.getBegin()); 250 251 FileID EndFID; 252 size_t EndOffset = 0; 253 std::tie(EndFID, EndOffset) = Mgr.getDecomposedLoc(R.getEnd()); 254 255 return BeginFID.isValid() && BeginFID == EndFID && BeginOffset <= EndOffset; 256 } 257 258 SourceLocation includeHashLoc(FileID IncludedFile, const SourceManager &SM) { 259 assert(SM.getLocForEndOfFile(IncludedFile).isFileID()); 260 FileID IncludingFile; 261 unsigned Offset; 262 std::tie(IncludingFile, Offset) = 263 SM.getDecomposedExpansionLoc(SM.getIncludeLoc(IncludedFile)); 264 bool Invalid = false; 265 llvm::StringRef Buf = SM.getBufferData(IncludingFile, &Invalid); 266 if (Invalid) 267 return SourceLocation(); 268 // Now buf is "...\n#include <foo>\n..." 269 // and Offset points here: ^ 270 // Rewind to the preceding # on the line. 271 assert(Offset < Buf.size()); 272 for (;; --Offset) { 273 if (Buf[Offset] == '#') 274 return SM.getComposedLoc(IncludingFile, Offset); 275 if (Buf[Offset] == '\n' || Offset == 0) // no hash, what's going on? 276 return SourceLocation(); 277 } 278 } 279 280 static unsigned getTokenLengthAtLoc(SourceLocation Loc, const SourceManager &SM, 281 const LangOptions &LangOpts) { 282 Token TheTok; 283 if (Lexer::getRawToken(Loc, TheTok, SM, LangOpts)) 284 return 0; 285 // FIXME: Here we check whether the token at the location is a greatergreater 286 // (>>) token and consider it as a single greater (>). This is to get it 287 // working for templates but it isn't correct for the right shift operator. We 288 // can avoid this by using half open char ranges in getFileRange() but getting 289 // token ending is not well supported in macroIDs. 290 if (TheTok.is(tok::greatergreater)) 291 return 1; 292 return TheTok.getLength(); 293 } 294 295 // Returns location of the last character of the token at a given loc 296 static SourceLocation getLocForTokenEnd(SourceLocation BeginLoc, 297 const SourceManager &SM, 298 const LangOptions &LangOpts) { 299 unsigned Len = getTokenLengthAtLoc(BeginLoc, SM, LangOpts); 300 return BeginLoc.getLocWithOffset(Len ? Len - 1 : 0); 301 } 302 303 // Returns location of the starting of the token at a given EndLoc 304 static SourceLocation getLocForTokenBegin(SourceLocation EndLoc, 305 const SourceManager &SM, 306 const LangOptions &LangOpts) { 307 return EndLoc.getLocWithOffset( 308 -(signed)getTokenLengthAtLoc(EndLoc, SM, LangOpts)); 309 } 310 311 // Converts a char source range to a token range. 312 static SourceRange toTokenRange(CharSourceRange Range, const SourceManager &SM, 313 const LangOptions &LangOpts) { 314 if (!Range.isTokenRange()) 315 Range.setEnd(getLocForTokenBegin(Range.getEnd(), SM, LangOpts)); 316 return Range.getAsRange(); 317 } 318 // Returns the union of two token ranges. 319 // To find the maximum of the Ends of the ranges, we compare the location of the 320 // last character of the token. 321 static SourceRange unionTokenRange(SourceRange R1, SourceRange R2, 322 const SourceManager &SM, 323 const LangOptions &LangOpts) { 324 SourceLocation Begin = 325 SM.isBeforeInTranslationUnit(R1.getBegin(), R2.getBegin()) 326 ? R1.getBegin() 327 : R2.getBegin(); 328 SourceLocation End = 329 SM.isBeforeInTranslationUnit(getLocForTokenEnd(R1.getEnd(), SM, LangOpts), 330 getLocForTokenEnd(R2.getEnd(), SM, LangOpts)) 331 ? R2.getEnd() 332 : R1.getEnd(); 333 return SourceRange(Begin, End); 334 } 335 336 // Given a range whose endpoints may be in different expansions or files, 337 // tries to find a range within a common file by following up the expansion and 338 // include location in each. 339 static SourceRange rangeInCommonFile(SourceRange R, const SourceManager &SM, 340 const LangOptions &LangOpts) { 341 // Fast path for most common cases. 342 if (SM.isWrittenInSameFile(R.getBegin(), R.getEnd())) 343 return R; 344 // Record the stack of expansion locations for the beginning, keyed by FileID. 345 llvm::DenseMap<FileID, SourceLocation> BeginExpansions; 346 for (SourceLocation Begin = R.getBegin(); Begin.isValid(); 347 Begin = Begin.isFileID() 348 ? includeHashLoc(SM.getFileID(Begin), SM) 349 : SM.getImmediateExpansionRange(Begin).getBegin()) { 350 BeginExpansions[SM.getFileID(Begin)] = Begin; 351 } 352 // Move up the stack of expansion locations for the end until we find the 353 // location in BeginExpansions with that has the same file id. 354 for (SourceLocation End = R.getEnd(); End.isValid(); 355 End = End.isFileID() ? includeHashLoc(SM.getFileID(End), SM) 356 : toTokenRange(SM.getImmediateExpansionRange(End), 357 SM, LangOpts) 358 .getEnd()) { 359 auto It = BeginExpansions.find(SM.getFileID(End)); 360 if (It != BeginExpansions.end()) { 361 if (SM.getFileOffset(It->second) > SM.getFileOffset(End)) 362 return SourceLocation(); 363 return {It->second, End}; 364 } 365 } 366 return SourceRange(); 367 } 368 369 // Find an expansion range (not necessarily immediate) the ends of which are in 370 // the same file id. 371 static SourceRange 372 getExpansionTokenRangeInSameFile(SourceLocation Loc, const SourceManager &SM, 373 const LangOptions &LangOpts) { 374 return rangeInCommonFile( 375 toTokenRange(SM.getImmediateExpansionRange(Loc), SM, LangOpts), SM, 376 LangOpts); 377 } 378 379 // Returns the file range for a given Location as a Token Range 380 // This is quite similar to getFileLoc in SourceManager as both use 381 // getImmediateExpansionRange and getImmediateSpellingLoc (for macro IDs). 382 // However: 383 // - We want to maintain the full range information as we move from one file to 384 // the next. getFileLoc only uses the BeginLoc of getImmediateExpansionRange. 385 // - We want to split '>>' tokens as the lexer parses the '>>' in nested 386 // template instantiations as a '>>' instead of two '>'s. 387 // There is also getExpansionRange but it simply calls 388 // getImmediateExpansionRange on the begin and ends separately which is wrong. 389 static SourceRange getTokenFileRange(SourceLocation Loc, 390 const SourceManager &SM, 391 const LangOptions &LangOpts) { 392 SourceRange FileRange = Loc; 393 while (!FileRange.getBegin().isFileID()) { 394 if (SM.isMacroArgExpansion(FileRange.getBegin())) { 395 FileRange = unionTokenRange( 396 SM.getImmediateSpellingLoc(FileRange.getBegin()), 397 SM.getImmediateSpellingLoc(FileRange.getEnd()), SM, LangOpts); 398 assert(SM.isWrittenInSameFile(FileRange.getBegin(), FileRange.getEnd())); 399 } else { 400 SourceRange ExpansionRangeForBegin = 401 getExpansionTokenRangeInSameFile(FileRange.getBegin(), SM, LangOpts); 402 SourceRange ExpansionRangeForEnd = 403 getExpansionTokenRangeInSameFile(FileRange.getEnd(), SM, LangOpts); 404 if (ExpansionRangeForBegin.isInvalid() || 405 ExpansionRangeForEnd.isInvalid()) 406 return SourceRange(); 407 assert(SM.isWrittenInSameFile(ExpansionRangeForBegin.getBegin(), 408 ExpansionRangeForEnd.getBegin()) && 409 "Both Expansion ranges should be in same file."); 410 FileRange = unionTokenRange(ExpansionRangeForBegin, ExpansionRangeForEnd, 411 SM, LangOpts); 412 } 413 } 414 return FileRange; 415 } 416 417 bool isInsideMainFile(SourceLocation Loc, const SourceManager &SM) { 418 if (!Loc.isValid()) 419 return false; 420 FileID FID = SM.getFileID(SM.getExpansionLoc(Loc)); 421 return FID == SM.getMainFileID() || FID == SM.getPreambleFileID(); 422 } 423 424 llvm::Optional<SourceRange> toHalfOpenFileRange(const SourceManager &SM, 425 const LangOptions &LangOpts, 426 SourceRange R) { 427 SourceRange R1 = getTokenFileRange(R.getBegin(), SM, LangOpts); 428 if (!isValidFileRange(SM, R1)) 429 return llvm::None; 430 431 SourceRange R2 = getTokenFileRange(R.getEnd(), SM, LangOpts); 432 if (!isValidFileRange(SM, R2)) 433 return llvm::None; 434 435 SourceRange Result = 436 rangeInCommonFile(unionTokenRange(R1, R2, SM, LangOpts), SM, LangOpts); 437 unsigned TokLen = getTokenLengthAtLoc(Result.getEnd(), SM, LangOpts); 438 // Convert from closed token range to half-open (char) range 439 Result.setEnd(Result.getEnd().getLocWithOffset(TokLen)); 440 if (!isValidFileRange(SM, Result)) 441 return llvm::None; 442 443 return Result; 444 } 445 446 llvm::StringRef toSourceCode(const SourceManager &SM, SourceRange R) { 447 assert(isValidFileRange(SM, R)); 448 bool Invalid = false; 449 auto *Buf = SM.getBuffer(SM.getFileID(R.getBegin()), &Invalid); 450 assert(!Invalid); 451 452 size_t BeginOffset = SM.getFileOffset(R.getBegin()); 453 size_t EndOffset = SM.getFileOffset(R.getEnd()); 454 return Buf->getBuffer().substr(BeginOffset, EndOffset - BeginOffset); 455 } 456 457 llvm::Expected<SourceLocation> sourceLocationInMainFile(const SourceManager &SM, 458 Position P) { 459 llvm::StringRef Code = SM.getBuffer(SM.getMainFileID())->getBuffer(); 460 auto Offset = 461 positionToOffset(Code, P, /*AllowColumnBeyondLineLength=*/false); 462 if (!Offset) 463 return Offset.takeError(); 464 return SM.getLocForStartOfFile(SM.getMainFileID()).getLocWithOffset(*Offset); 465 } 466 467 Range halfOpenToRange(const SourceManager &SM, CharSourceRange R) { 468 // Clang is 1-based, LSP uses 0-based indexes. 469 Position Begin = sourceLocToPosition(SM, R.getBegin()); 470 Position End = sourceLocToPosition(SM, R.getEnd()); 471 472 return {Begin, End}; 473 } 474 475 std::pair<size_t, size_t> offsetToClangLineColumn(llvm::StringRef Code, 476 size_t Offset) { 477 Offset = std::min(Code.size(), Offset); 478 llvm::StringRef Before = Code.substr(0, Offset); 479 int Lines = Before.count('\n'); 480 size_t PrevNL = Before.rfind('\n'); 481 size_t StartOfLine = (PrevNL == llvm::StringRef::npos) ? 0 : (PrevNL + 1); 482 return {Lines + 1, Offset - StartOfLine + 1}; 483 } 484 485 std::pair<StringRef, StringRef> splitQualifiedName(StringRef QName) { 486 size_t Pos = QName.rfind("::"); 487 if (Pos == llvm::StringRef::npos) 488 return {llvm::StringRef(), QName}; 489 return {QName.substr(0, Pos + 2), QName.substr(Pos + 2)}; 490 } 491 492 TextEdit replacementToEdit(llvm::StringRef Code, 493 const tooling::Replacement &R) { 494 Range ReplacementRange = { 495 offsetToPosition(Code, R.getOffset()), 496 offsetToPosition(Code, R.getOffset() + R.getLength())}; 497 return {ReplacementRange, std::string(R.getReplacementText())}; 498 } 499 500 std::vector<TextEdit> replacementsToEdits(llvm::StringRef Code, 501 const tooling::Replacements &Repls) { 502 std::vector<TextEdit> Edits; 503 for (const auto &R : Repls) 504 Edits.push_back(replacementToEdit(Code, R)); 505 return Edits; 506 } 507 508 llvm::Optional<std::string> getCanonicalPath(const FileEntry *F, 509 const SourceManager &SourceMgr) { 510 if (!F) 511 return None; 512 513 llvm::SmallString<128> FilePath = F->getName(); 514 if (!llvm::sys::path::is_absolute(FilePath)) { 515 if (auto EC = 516 SourceMgr.getFileManager().getVirtualFileSystem().makeAbsolute( 517 FilePath)) { 518 elog("Could not turn relative path '{0}' to absolute: {1}", FilePath, 519 EC.message()); 520 return None; 521 } 522 } 523 524 // Handle the symbolic link path case where the current working directory 525 // (getCurrentWorkingDirectory) is a symlink. We always want to the real 526 // file path (instead of the symlink path) for the C++ symbols. 527 // 528 // Consider the following example: 529 // 530 // src dir: /project/src/foo.h 531 // current working directory (symlink): /tmp/build -> /project/src/ 532 // 533 // The file path of Symbol is "/project/src/foo.h" instead of 534 // "/tmp/build/foo.h" 535 if (auto Dir = SourceMgr.getFileManager().getDirectory( 536 llvm::sys::path::parent_path(FilePath))) { 537 llvm::SmallString<128> RealPath; 538 llvm::StringRef DirName = SourceMgr.getFileManager().getCanonicalName(*Dir); 539 llvm::sys::path::append(RealPath, DirName, 540 llvm::sys::path::filename(FilePath)); 541 return RealPath.str().str(); 542 } 543 544 return FilePath.str().str(); 545 } 546 547 TextEdit toTextEdit(const FixItHint &FixIt, const SourceManager &M, 548 const LangOptions &L) { 549 TextEdit Result; 550 Result.range = 551 halfOpenToRange(M, Lexer::makeFileCharRange(FixIt.RemoveRange, M, L)); 552 Result.newText = FixIt.CodeToInsert; 553 return Result; 554 } 555 556 FileDigest digest(llvm::StringRef Content) { 557 uint64_t Hash{llvm::xxHash64(Content)}; 558 FileDigest Result; 559 for (unsigned I = 0; I < Result.size(); ++I) { 560 Result[I] = uint8_t(Hash); 561 Hash >>= 8; 562 } 563 return Result; 564 } 565 566 llvm::Optional<FileDigest> digestFile(const SourceManager &SM, FileID FID) { 567 bool Invalid = false; 568 llvm::StringRef Content = SM.getBufferData(FID, &Invalid); 569 if (Invalid) 570 return None; 571 return digest(Content); 572 } 573 574 format::FormatStyle getFormatStyleForFile(llvm::StringRef File, 575 llvm::StringRef Content, 576 const ThreadsafeFS &TFS) { 577 auto Style = format::getStyle(format::DefaultFormatStyle, File, 578 format::DefaultFallbackStyle, Content, 579 TFS.view(/*CWD=*/llvm::None).get()); 580 if (!Style) { 581 log("getStyle() failed for file {0}: {1}. Fallback is LLVM style.", File, 582 Style.takeError()); 583 return format::getLLVMStyle(); 584 } 585 return *Style; 586 } 587 588 llvm::Expected<tooling::Replacements> 589 cleanupAndFormat(StringRef Code, const tooling::Replacements &Replaces, 590 const format::FormatStyle &Style) { 591 auto CleanReplaces = cleanupAroundReplacements(Code, Replaces, Style); 592 if (!CleanReplaces) 593 return CleanReplaces; 594 return formatReplacements(Code, std::move(*CleanReplaces), Style); 595 } 596 597 static void 598 lex(llvm::StringRef Code, const LangOptions &LangOpts, 599 llvm::function_ref<void(const syntax::Token &, const SourceManager &SM)> 600 Action) { 601 // FIXME: InMemoryFileAdapter crashes unless the buffer is null terminated! 602 std::string NullTerminatedCode = Code.str(); 603 SourceManagerForFile FileSM("dummy.cpp", NullTerminatedCode); 604 auto &SM = FileSM.get(); 605 for (const auto &Tok : syntax::tokenize(SM.getMainFileID(), SM, LangOpts)) 606 Action(Tok, SM); 607 } 608 609 llvm::StringMap<unsigned> collectIdentifiers(llvm::StringRef Content, 610 const format::FormatStyle &Style) { 611 llvm::StringMap<unsigned> Identifiers; 612 auto LangOpt = format::getFormattingLangOpts(Style); 613 lex(Content, LangOpt, [&](const syntax::Token &Tok, const SourceManager &SM) { 614 if (Tok.kind() == tok::identifier) 615 ++Identifiers[Tok.text(SM)]; 616 // FIXME: Should this function really return keywords too ? 617 else if (const auto *Keyword = tok::getKeywordSpelling(Tok.kind())) 618 ++Identifiers[Keyword]; 619 }); 620 return Identifiers; 621 } 622 623 std::vector<Range> collectIdentifierRanges(llvm::StringRef Identifier, 624 llvm::StringRef Content, 625 const LangOptions &LangOpts) { 626 std::vector<Range> Ranges; 627 lex(Content, LangOpts, 628 [&](const syntax::Token &Tok, const SourceManager &SM) { 629 if (Tok.kind() != tok::identifier || Tok.text(SM) != Identifier) 630 return; 631 Ranges.push_back(halfOpenToRange(SM, Tok.range(SM).toCharRange(SM))); 632 }); 633 return Ranges; 634 } 635 636 namespace { 637 struct NamespaceEvent { 638 enum { 639 BeginNamespace, // namespace <ns> {. Payload is resolved <ns>. 640 EndNamespace, // } // namespace <ns>. Payload is resolved *outer* 641 // namespace. 642 UsingDirective // using namespace <ns>. Payload is unresolved <ns>. 643 } Trigger; 644 std::string Payload; 645 Position Pos; 646 }; 647 // Scans C++ source code for constructs that change the visible namespaces. 648 void parseNamespaceEvents(llvm::StringRef Code, const LangOptions &LangOpts, 649 llvm::function_ref<void(NamespaceEvent)> Callback) { 650 651 // Stack of enclosing namespaces, e.g. {"clang", "clangd"} 652 std::vector<std::string> Enclosing; // Contains e.g. "clang", "clangd" 653 // Stack counts open braces. true if the brace opened a namespace. 654 std::vector<bool> BraceStack; 655 656 enum { 657 Default, 658 Namespace, // just saw 'namespace' 659 NamespaceName, // just saw 'namespace' NSName 660 Using, // just saw 'using' 661 UsingNamespace, // just saw 'using namespace' 662 UsingNamespaceName, // just saw 'using namespace' NSName 663 } State = Default; 664 std::string NSName; 665 666 NamespaceEvent Event; 667 lex(Code, LangOpts, [&](const syntax::Token &Tok, const SourceManager &SM) { 668 Event.Pos = sourceLocToPosition(SM, Tok.location()); 669 switch (Tok.kind()) { 670 case tok::kw_using: 671 State = State == Default ? Using : Default; 672 break; 673 case tok::kw_namespace: 674 switch (State) { 675 case Using: 676 State = UsingNamespace; 677 break; 678 case Default: 679 State = Namespace; 680 break; 681 default: 682 State = Default; 683 break; 684 } 685 break; 686 case tok::identifier: 687 switch (State) { 688 case UsingNamespace: 689 NSName.clear(); 690 LLVM_FALLTHROUGH; 691 case UsingNamespaceName: 692 NSName.append(Tok.text(SM).str()); 693 State = UsingNamespaceName; 694 break; 695 case Namespace: 696 NSName.clear(); 697 LLVM_FALLTHROUGH; 698 case NamespaceName: 699 NSName.append(Tok.text(SM).str()); 700 State = NamespaceName; 701 break; 702 case Using: 703 case Default: 704 State = Default; 705 break; 706 } 707 break; 708 case tok::coloncolon: 709 // This can come at the beginning or in the middle of a namespace 710 // name. 711 switch (State) { 712 case UsingNamespace: 713 NSName.clear(); 714 LLVM_FALLTHROUGH; 715 case UsingNamespaceName: 716 NSName.append("::"); 717 State = UsingNamespaceName; 718 break; 719 case NamespaceName: 720 NSName.append("::"); 721 State = NamespaceName; 722 break; 723 case Namespace: // Not legal here. 724 case Using: 725 case Default: 726 State = Default; 727 break; 728 } 729 break; 730 case tok::l_brace: 731 // Record which { started a namespace, so we know when } ends one. 732 if (State == NamespaceName) { 733 // Parsed: namespace <name> { 734 BraceStack.push_back(true); 735 Enclosing.push_back(NSName); 736 Event.Trigger = NamespaceEvent::BeginNamespace; 737 Event.Payload = llvm::join(Enclosing, "::"); 738 Callback(Event); 739 } else { 740 // This case includes anonymous namespaces (State = Namespace). 741 // For our purposes, they're not namespaces and we ignore them. 742 BraceStack.push_back(false); 743 } 744 State = Default; 745 break; 746 case tok::r_brace: 747 // If braces are unmatched, we're going to be confused, but don't 748 // crash. 749 if (!BraceStack.empty()) { 750 if (BraceStack.back()) { 751 // Parsed: } // namespace 752 Enclosing.pop_back(); 753 Event.Trigger = NamespaceEvent::EndNamespace; 754 Event.Payload = llvm::join(Enclosing, "::"); 755 Callback(Event); 756 } 757 BraceStack.pop_back(); 758 } 759 break; 760 case tok::semi: 761 if (State == UsingNamespaceName) { 762 // Parsed: using namespace <name> ; 763 Event.Trigger = NamespaceEvent::UsingDirective; 764 Event.Payload = std::move(NSName); 765 Callback(Event); 766 } 767 State = Default; 768 break; 769 default: 770 State = Default; 771 break; 772 } 773 }); 774 } 775 776 // Returns the prefix namespaces of NS: {"" ... NS}. 777 llvm::SmallVector<llvm::StringRef, 8> ancestorNamespaces(llvm::StringRef NS) { 778 llvm::SmallVector<llvm::StringRef, 8> Results; 779 Results.push_back(NS.take_front(0)); 780 NS.split(Results, "::", /*MaxSplit=*/-1, /*KeepEmpty=*/false); 781 for (llvm::StringRef &R : Results) 782 R = NS.take_front(R.end() - NS.begin()); 783 return Results; 784 } 785 786 } // namespace 787 788 std::vector<std::string> visibleNamespaces(llvm::StringRef Code, 789 const LangOptions &LangOpts) { 790 std::string Current; 791 // Map from namespace to (resolved) namespaces introduced via using directive. 792 llvm::StringMap<llvm::StringSet<>> UsingDirectives; 793 794 parseNamespaceEvents(Code, LangOpts, [&](NamespaceEvent Event) { 795 llvm::StringRef NS = Event.Payload; 796 switch (Event.Trigger) { 797 case NamespaceEvent::BeginNamespace: 798 case NamespaceEvent::EndNamespace: 799 Current = std::move(Event.Payload); 800 break; 801 case NamespaceEvent::UsingDirective: 802 if (NS.consume_front("::")) 803 UsingDirectives[Current].insert(NS); 804 else { 805 for (llvm::StringRef Enclosing : ancestorNamespaces(Current)) { 806 if (Enclosing.empty()) 807 UsingDirectives[Current].insert(NS); 808 else 809 UsingDirectives[Current].insert((Enclosing + "::" + NS).str()); 810 } 811 } 812 break; 813 } 814 }); 815 816 std::vector<std::string> Found; 817 for (llvm::StringRef Enclosing : ancestorNamespaces(Current)) { 818 Found.push_back(std::string(Enclosing)); 819 auto It = UsingDirectives.find(Enclosing); 820 if (It != UsingDirectives.end()) 821 for (const auto &Used : It->second) 822 Found.push_back(std::string(Used.getKey())); 823 } 824 825 llvm::sort(Found, [&](const std::string &LHS, const std::string &RHS) { 826 if (Current == RHS) 827 return false; 828 if (Current == LHS) 829 return true; 830 return LHS < RHS; 831 }); 832 Found.erase(std::unique(Found.begin(), Found.end()), Found.end()); 833 return Found; 834 } 835 836 llvm::StringSet<> collectWords(llvm::StringRef Content) { 837 // We assume short words are not significant. 838 // We may want to consider other stopwords, e.g. language keywords. 839 // (A very naive implementation showed no benefit, but lexing might do better) 840 static constexpr int MinWordLength = 4; 841 842 std::vector<CharRole> Roles(Content.size()); 843 calculateRoles(Content, Roles); 844 845 llvm::StringSet<> Result; 846 llvm::SmallString<256> Word; 847 auto Flush = [&] { 848 if (Word.size() >= MinWordLength) { 849 for (char &C : Word) 850 C = llvm::toLower(C); 851 Result.insert(Word); 852 } 853 Word.clear(); 854 }; 855 for (unsigned I = 0; I < Content.size(); ++I) { 856 switch (Roles[I]) { 857 case Head: 858 Flush(); 859 LLVM_FALLTHROUGH; 860 case Tail: 861 Word.push_back(Content[I]); 862 break; 863 case Unknown: 864 case Separator: 865 Flush(); 866 break; 867 } 868 } 869 Flush(); 870 871 return Result; 872 } 873 874 static bool isLikelyIdentifier(llvm::StringRef Word, llvm::StringRef Before, 875 llvm::StringRef After) { 876 // `foo` is an identifier. 877 if (Before.endswith("`") && After.startswith("`")) 878 return true; 879 // In foo::bar, both foo and bar are identifiers. 880 if (Before.endswith("::") || After.startswith("::")) 881 return true; 882 // Doxygen tags like \c foo indicate identifiers. 883 // Don't search too far back. 884 // This duplicates clang's doxygen parser, revisit if it gets complicated. 885 Before = Before.take_back(100); // Don't search too far back. 886 auto Pos = Before.find_last_of("\\@"); 887 if (Pos != llvm::StringRef::npos) { 888 llvm::StringRef Tag = Before.substr(Pos + 1).rtrim(' '); 889 if (Tag == "p" || Tag == "c" || Tag == "class" || Tag == "tparam" || 890 Tag == "param" || Tag == "param[in]" || Tag == "param[out]" || 891 Tag == "param[in,out]" || Tag == "retval" || Tag == "throw" || 892 Tag == "throws" || Tag == "link") 893 return true; 894 } 895 896 // Word contains underscore. 897 // This handles things like snake_case and MACRO_CASE. 898 if (Word.contains('_')) { 899 return true; 900 } 901 // Word contains capital letter other than at beginning. 902 // This handles things like lowerCamel and UpperCamel. 903 // The check for also containing a lowercase letter is to rule out 904 // initialisms like "HTTP". 905 bool HasLower = Word.find_if(clang::isLowercase) != StringRef::npos; 906 bool HasUpper = Word.substr(1).find_if(clang::isUppercase) != StringRef::npos; 907 if (HasLower && HasUpper) { 908 return true; 909 } 910 // FIXME: consider mid-sentence Capitalization? 911 return false; 912 } 913 914 llvm::Optional<SpelledWord> SpelledWord::touching(SourceLocation SpelledLoc, 915 const syntax::TokenBuffer &TB, 916 const LangOptions &LangOpts) { 917 const auto &SM = TB.sourceManager(); 918 auto Touching = syntax::spelledTokensTouching(SpelledLoc, TB); 919 for (const auto &T : Touching) { 920 // If the token is an identifier or a keyword, don't use any heuristics. 921 if (tok::isAnyIdentifier(T.kind()) || tok::getKeywordSpelling(T.kind())) { 922 SpelledWord Result; 923 Result.Location = T.location(); 924 Result.Text = T.text(SM); 925 Result.LikelyIdentifier = tok::isAnyIdentifier(T.kind()); 926 Result.PartOfSpelledToken = &T; 927 Result.SpelledToken = &T; 928 auto Expanded = 929 TB.expandedTokens(SM.getMacroArgExpandedLocation(T.location())); 930 if (Expanded.size() == 1 && Expanded.front().text(SM) == Result.Text) 931 Result.ExpandedToken = &Expanded.front(); 932 return Result; 933 } 934 } 935 FileID File; 936 unsigned Offset; 937 std::tie(File, Offset) = SM.getDecomposedLoc(SpelledLoc); 938 bool Invalid = false; 939 llvm::StringRef Code = SM.getBufferData(File, &Invalid); 940 if (Invalid) 941 return llvm::None; 942 unsigned B = Offset, E = Offset; 943 while (B > 0 && isIdentifierBody(Code[B - 1])) 944 --B; 945 while (E < Code.size() && isIdentifierBody(Code[E])) 946 ++E; 947 if (B == E) 948 return llvm::None; 949 950 SpelledWord Result; 951 Result.Location = SM.getComposedLoc(File, B); 952 Result.Text = Code.slice(B, E); 953 Result.LikelyIdentifier = 954 isLikelyIdentifier(Result.Text, Code.substr(0, B), Code.substr(E)) && 955 // should not be a keyword 956 tok::isAnyIdentifier( 957 IdentifierTable(LangOpts).get(Result.Text).getTokenID()); 958 for (const auto &T : Touching) 959 if (T.location() <= Result.Location) 960 Result.PartOfSpelledToken = &T; 961 return Result; 962 } 963 964 llvm::Optional<DefinedMacro> locateMacroAt(const syntax::Token &SpelledTok, 965 Preprocessor &PP) { 966 SourceLocation Loc = SpelledTok.location(); 967 assert(Loc.isFileID()); 968 const auto &SM = PP.getSourceManager(); 969 IdentifierInfo *IdentifierInfo = PP.getIdentifierInfo(SpelledTok.text(SM)); 970 if (!IdentifierInfo || !IdentifierInfo->hadMacroDefinition()) 971 return None; 972 973 // Get the definition just before the searched location so that a macro 974 // referenced in a '#undef MACRO' can still be found. Note that we only do 975 // that if Loc is not pointing at start of file. 976 if (SM.getLocForStartOfFile(SM.getFileID(Loc)) != Loc) 977 Loc = Loc.getLocWithOffset(-1); 978 MacroDefinition MacroDef = PP.getMacroDefinitionAtLoc(IdentifierInfo, Loc); 979 if (auto *MI = MacroDef.getMacroInfo()) 980 return DefinedMacro{ 981 IdentifierInfo->getName(), MI, 982 translatePreamblePatchLocation(MI->getDefinitionLoc(), SM)}; 983 return None; 984 } 985 986 llvm::Expected<std::string> Edit::apply() const { 987 return tooling::applyAllReplacements(InitialCode, Replacements); 988 } 989 990 std::vector<TextEdit> Edit::asTextEdits() const { 991 return replacementsToEdits(InitialCode, Replacements); 992 } 993 994 bool Edit::canApplyTo(llvm::StringRef Code) const { 995 // Create line iterators, since line numbers are important while applying our 996 // edit we cannot skip blank lines. 997 auto LHS = llvm::MemoryBuffer::getMemBuffer(Code); 998 llvm::line_iterator LHSIt(*LHS, /*SkipBlanks=*/false); 999 1000 auto RHS = llvm::MemoryBuffer::getMemBuffer(InitialCode); 1001 llvm::line_iterator RHSIt(*RHS, /*SkipBlanks=*/false); 1002 1003 // Compare the InitialCode we prepared the edit for with the Code we received 1004 // line by line to make sure there are no differences. 1005 // FIXME: This check is too conservative now, it should be enough to only 1006 // check lines around the replacements contained inside the Edit. 1007 while (!LHSIt.is_at_eof() && !RHSIt.is_at_eof()) { 1008 if (*LHSIt != *RHSIt) 1009 return false; 1010 ++LHSIt; 1011 ++RHSIt; 1012 } 1013 1014 // After we reach EOF for any of the files we make sure the other one doesn't 1015 // contain any additional content except empty lines, they should not 1016 // interfere with the edit we produced. 1017 while (!LHSIt.is_at_eof()) { 1018 if (!LHSIt->empty()) 1019 return false; 1020 ++LHSIt; 1021 } 1022 while (!RHSIt.is_at_eof()) { 1023 if (!RHSIt->empty()) 1024 return false; 1025 ++RHSIt; 1026 } 1027 return true; 1028 } 1029 1030 llvm::Error reformatEdit(Edit &E, const format::FormatStyle &Style) { 1031 if (auto NewEdits = cleanupAndFormat(E.InitialCode, E.Replacements, Style)) 1032 E.Replacements = std::move(*NewEdits); 1033 else 1034 return NewEdits.takeError(); 1035 return llvm::Error::success(); 1036 } 1037 1038 EligibleRegion getEligiblePoints(llvm::StringRef Code, 1039 llvm::StringRef FullyQualifiedName, 1040 const LangOptions &LangOpts) { 1041 EligibleRegion ER; 1042 // Start with global namespace. 1043 std::vector<std::string> Enclosing = {""}; 1044 // FIXME: In addition to namespaces try to generate events for function 1045 // definitions as well. One might use a closing parantheses(")" followed by an 1046 // opening brace "{" to trigger the start. 1047 parseNamespaceEvents(Code, LangOpts, [&](NamespaceEvent Event) { 1048 // Using Directives only introduces declarations to current scope, they do 1049 // not change the current namespace, so skip them. 1050 if (Event.Trigger == NamespaceEvent::UsingDirective) 1051 return; 1052 // Do not qualify the global namespace. 1053 if (!Event.Payload.empty()) 1054 Event.Payload.append("::"); 1055 1056 std::string CurrentNamespace; 1057 if (Event.Trigger == NamespaceEvent::BeginNamespace) { 1058 Enclosing.emplace_back(std::move(Event.Payload)); 1059 CurrentNamespace = Enclosing.back(); 1060 // parseNameSpaceEvents reports the beginning position of a token; we want 1061 // to insert after '{', so increment by one. 1062 ++Event.Pos.character; 1063 } else { 1064 // Event.Payload points to outer namespace when exiting a scope, so use 1065 // the namespace we've last entered instead. 1066 CurrentNamespace = std::move(Enclosing.back()); 1067 Enclosing.pop_back(); 1068 assert(Enclosing.back() == Event.Payload); 1069 } 1070 1071 // Ignore namespaces that are not a prefix of the target. 1072 if (!FullyQualifiedName.startswith(CurrentNamespace)) 1073 return; 1074 1075 // Prefer the namespace that shares the longest prefix with target. 1076 if (CurrentNamespace.size() > ER.EnclosingNamespace.size()) { 1077 ER.EligiblePoints.clear(); 1078 ER.EnclosingNamespace = CurrentNamespace; 1079 } 1080 if (CurrentNamespace.size() == ER.EnclosingNamespace.size()) 1081 ER.EligiblePoints.emplace_back(std::move(Event.Pos)); 1082 }); 1083 // If there were no shared namespaces just return EOF. 1084 if (ER.EligiblePoints.empty()) { 1085 assert(ER.EnclosingNamespace.empty()); 1086 ER.EligiblePoints.emplace_back(offsetToPosition(Code, Code.size())); 1087 } 1088 return ER; 1089 } 1090 1091 bool isHeaderFile(llvm::StringRef FileName, 1092 llvm::Optional<LangOptions> LangOpts) { 1093 // Respect the langOpts, for non-file-extension cases, e.g. standard library 1094 // files. 1095 if (LangOpts && LangOpts->IsHeaderFile) 1096 return true; 1097 namespace types = clang::driver::types; 1098 auto Lang = types::lookupTypeForExtension( 1099 llvm::sys::path::extension(FileName).substr(1)); 1100 return Lang != types::TY_INVALID && types::onlyPrecompileType(Lang); 1101 } 1102 1103 bool isProtoFile(SourceLocation Loc, const SourceManager &SM) { 1104 auto FileName = SM.getFilename(Loc); 1105 if (!FileName.endswith(".proto.h") && !FileName.endswith(".pb.h")) 1106 return false; 1107 auto FID = SM.getFileID(Loc); 1108 // All proto generated headers should start with this line. 1109 static const char *PROTO_HEADER_COMMENT = 1110 "// Generated by the protocol buffer compiler. DO NOT EDIT!"; 1111 // Double check that this is an actual protobuf header. 1112 return SM.getBufferData(FID).startswith(PROTO_HEADER_COMMENT); 1113 } 1114 1115 } // namespace clangd 1116 } // namespace clang 1117