Author: Eduardo Caldas Date: 2020-09-11T18:39:02Z New Revision: 238ae4eee05187758e42c00af237592612d585c2
URL: https://github.com/llvm/llvm-project/commit/238ae4eee05187758e42c00af237592612d585c2 DIFF: https://github.com/llvm/llvm-project/commit/238ae4eee05187758e42c00af237592612d585c2.diff LOG: [SyntaxTree] Add const qualifiers, from [llvm-qualified-auto] Differential Revision: https://reviews.llvm.org/D87522 Added: Modified: clang/lib/Tooling/Syntax/BuildTree.cpp clang/lib/Tooling/Syntax/ComputeReplacements.cpp clang/lib/Tooling/Syntax/Tree.cpp Removed: ################################################################################ diff --git a/clang/lib/Tooling/Syntax/BuildTree.cpp b/clang/lib/Tooling/Syntax/BuildTree.cpp index 8de50dd02162..dab1457fbdba 100644 --- a/clang/lib/Tooling/Syntax/BuildTree.cpp +++ b/clang/lib/Tooling/Syntax/BuildTree.cpp @@ -558,7 +558,7 @@ class syntax::TreeBuilder { assert(A.getTokenBuffer().expandedTokens().back().kind() == tok::eof); // Create all leaf nodes. // Note that we do not have 'eof' in the tree. - for (auto &T : A.getTokenBuffer().expandedTokens().drop_back()) { + for (const auto &T : A.getTokenBuffer().expandedTokens().drop_back()) { auto *L = new (A.getAllocator()) syntax::Leaf(&T); L->Original = true; L->CanModify = A.getTokenBuffer().spelledForExpanded(T).hasValue(); diff --git a/clang/lib/Tooling/Syntax/ComputeReplacements.cpp b/clang/lib/Tooling/Syntax/ComputeReplacements.cpp index 93b1c4416bf4..31e1a40c74b6 100644 --- a/clang/lib/Tooling/Syntax/ComputeReplacements.cpp +++ b/clang/lib/Tooling/Syntax/ComputeReplacements.cpp @@ -32,7 +32,7 @@ void enumerateTokenSpans(const syntax::Tree *Root, ProcessTokensFn Callback) { private: void process(const syntax::Node *N) { if (auto *T = dyn_cast<syntax::Tree>(N)) { - for (auto *C = T->getFirstChild(); C != nullptr; + for (const auto *C = T->getFirstChild(); C != nullptr; C = C->getNextSibling()) process(C); return; @@ -64,8 +64,8 @@ void enumerateTokenSpans(const syntax::Tree *Root, ProcessTokensFn Callback) { syntax::FileRange rangeOfExpanded(const syntax::Arena &A, llvm::ArrayRef<syntax::Token> Expanded) { - auto &Buffer = A.getTokenBuffer(); - auto &SM = A.getSourceManager(); + const auto &Buffer = A.getTokenBuffer(); + const auto &SM = A.getSourceManager(); // Check that \p Expanded actually points into expanded tokens. assert(Buffer.expandedTokens().begin() <= Expanded.begin()); @@ -85,8 +85,8 @@ syntax::FileRange rangeOfExpanded(const syntax::Arena &A, tooling::Replacements syntax::computeReplacements(const syntax::Arena &A, const syntax::TranslationUnit &TU) { - auto &Buffer = A.getTokenBuffer(); - auto &SM = A.getSourceManager(); + const auto &Buffer = A.getTokenBuffer(); + const auto &SM = A.getSourceManager(); tooling::Replacements Replacements; // Text inserted by the replacement we are building now. diff --git a/clang/lib/Tooling/Syntax/Tree.cpp b/clang/lib/Tooling/Syntax/Tree.cpp index f9d1fa6110ff..ca1e2880af9f 100644 --- a/clang/lib/Tooling/Syntax/Tree.cpp +++ b/clang/lib/Tooling/Syntax/Tree.cpp @@ -19,7 +19,7 @@ namespace { static void traverse(const syntax::Node *N, llvm::function_ref<void(const syntax::Node *)> Visit) { if (auto *T = dyn_cast<syntax::Tree>(N)) { - for (auto *C = T->getFirstChild(); C; C = C->getNextSibling()) + for (const auto *C = T->getFirstChild(); C; C = C->getNextSibling()) traverse(C, Visit); } Visit(N); @@ -226,7 +226,7 @@ void syntax::Node::assertInvariants() const { auto *T = dyn_cast<Tree>(this); if (!T) return; - for (auto *C = T->getFirstChild(); C; C = C->getNextSibling()) { + for (const auto *C = T->getFirstChild(); C; C = C->getNextSibling()) { if (T->isOriginal()) assert(C->isOriginal()); assert(!C->isDetached()); _______________________________________________ cfe-commits mailing list cfe-commits@lists.llvm.org https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
