diff --git a/include/clang/ASTMatchers/ASTMatchersInternal.h b/include/clang/ASTMatchers/ASTMatchersInternal.h index ae7b9e7c3ee..46e47a3100b 100644 --- a/include/clang/ASTMatchers/ASTMatchersInternal.h +++ b/include/clang/ASTMatchers/ASTMatchersInternal.h @@ -1334,14 +1334,14 @@ template class VariadicOperatorMatcher { template operator Matcher() const { return DynTypedMatcher::constructVariadic( Op, ast_type_traits::ASTNodeKind::getFromNodeKind(), - getMatchers(std::index_sequence_for())) + getMatchers(llvm::index_sequence_for())) .template unconditionalConvertTo(); } private: // Helper method to unpack the tuple into a vector. template - std::vector getMatchers(std::index_sequence) const { + std::vector getMatchers(llvm::index_sequence) const { return {Matcher(std::get(Params))...}; } diff --git a/include/clang/Sema/Sema.h b/include/clang/Sema/Sema.h index b51f8cb2f8b..0c6b9284705 100644 --- a/include/clang/Sema/Sema.h +++ b/include/clang/Sema/Sema.h @@ -1622,7 +1622,7 @@ class Sema { template void emit(const SemaDiagnosticBuilder &DB, - std::index_sequence) const { + llvm::index_sequence) const { // Apply all tuple elements to the builder in order. bool Dummy[] = {false, (DB << getPrintable(std::get(Args)))...}; (void)Dummy; @@ -1636,7 +1636,7 @@ class Sema { void diagnose(Sema &S, SourceLocation Loc, QualType T) override { const SemaDiagnosticBuilder &DB = S.Diag(Loc, DiagID); - emit(DB, std::index_sequence_for()); + emit(DB, llvm::index_sequence_for()); DB << T; } }; diff --git a/include/clang/Tooling/Refactoring/RefactoringActionRulesInternal.h b/include/clang/Tooling/Refactoring/RefactoringActionRulesInternal.h index 176dcf7bb8a..cc6ae83202f 100644 --- a/include/clang/Tooling/Refactoring/RefactoringActionRulesInternal.h +++ b/include/clang/Tooling/Refactoring/RefactoringActionRulesInternal.h @@ -47,7 +47,7 @@ template void invokeRuleAfterValidatingRequirements( RefactoringResultConsumer &Consumer, RefactoringRuleContext &Context, const std::tuple &Requirements, - std::index_sequence) { + llvm::index_sequence) { // Check if the requirements we're interested in can be evaluated. auto Values = std::make_tuple(std::get(Requirements).evaluate(Context)...); @@ -87,7 +87,7 @@ template void visitRefactoringOptions( RefactoringOptionVisitor &Visitor, const std::tuple &Requirements, - std::index_sequence) { + llvm::index_sequence) { visitRefactoringOptionsImpl(Visitor, std::get(Requirements)...); } @@ -131,7 +131,7 @@ createRefactoringActionRule(const RequirementTypes &... Requirements) { RefactoringRuleContext &Context) override { internal::invokeRuleAfterValidatingRequirements( Consumer, Context, Requirements, - std::index_sequence_for()); + llvm::index_sequence_for()); } bool hasSelectionRequirement() override { @@ -142,7 +142,7 @@ createRefactoringActionRule(const RequirementTypes &... Requirements) { void visitRefactoringOptions(RefactoringOptionVisitor &Visitor) override { internal::visitRefactoringOptions( Visitor, Requirements, - std::index_sequence_for()); + llvm::index_sequence_for()); } private: std::tuple Requirements; diff --git a/lib/CodeGen/EHScopeStack.h b/lib/CodeGen/EHScopeStack.h index 0ed67aabcd6..3b0db35d982 100644 --- a/lib/CodeGen/EHScopeStack.h +++ b/lib/CodeGen/EHScopeStack.h @@ -199,14 +199,14 @@ class EHScopeStack { SavedTuple Saved; template - T restore(CodeGenFunction &CGF, std::index_sequence) { + T restore(CodeGenFunction &CGF, llvm::index_sequence) { // It's important that the restores are emitted in order. The braced init // list guarantees that. return T{DominatingValue::restore(CGF, std::get(Saved))...}; } void Emit(CodeGenFunction &CGF, Flags flags) override { - restore(CGF, std::index_sequence_for()).Emit(CGF, flags); + restore(CGF, llvm::index_sequence_for()).Emit(CGF, flags); } public: