Index: clang/include/clang/AST/ASTConcept.h =================================================================== --- clang/include/clang/AST/ASTConcept.h +++ clang/include/clang/AST/ASTConcept.h @@ -29,16 +29,24 @@ // The template-like entity that 'owns' the constraint checked here (can be a // constrained entity or a concept). const NamedDecl *ConstraintOwner = nullptr; + // Multi-dimensional template args, all flattened. llvm::SmallVector TemplateArgs; + void PopulateTemplateArgs(ArrayRef> TemplArgs) { + llvm::for_each(TemplArgs, [this](ArrayRef Args) { + TemplateArgs.append(Args.begin(), Args.end()); + }); + } + public: ConstraintSatisfaction() = default; ConstraintSatisfaction(const NamedDecl *ConstraintOwner, - ArrayRef TemplateArgs) : - ConstraintOwner(ConstraintOwner), TemplateArgs(TemplateArgs.begin(), - TemplateArgs.end()) { } + ArrayRef> TemplArgs) + : ConstraintOwner(ConstraintOwner) { + PopulateTemplateArgs(TemplArgs); + } using SubstitutionDiagnostic = std::pair; using Detail = llvm::PointerUnion; @@ -52,12 +60,14 @@ llvm::SmallVector, 4> Details; void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &C) { - Profile(ID, C, ConstraintOwner, TemplateArgs); + llvm::SmallVector> Args; + Args.push_back(TemplateArgs); + Profile(ID, C, ConstraintOwner, Args); } static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &C, const NamedDecl *ConstraintOwner, - ArrayRef TemplateArgs); + ArrayRef> TemplateArgs); }; /// Pairs of unsatisfied atomic constraint expressions along with the Index: clang/include/clang/Sema/Sema.h =================================================================== --- clang/include/clang/Sema/Sema.h +++ clang/include/clang/Sema/Sema.h @@ -6889,6 +6889,8 @@ SourceLocation ConvLocation, CXXConversionDecl *Conv, Expr *Src); + // TODO: ERICH: Probably a better way to do this? + unsigned CheckingConstraintExpression = 0; /// Check whether the given expression is a valid constraint expression. /// A diagnostic is emitted if it is not, false is returned, and @@ -6954,9 +6956,16 @@ /// false otherwise. bool CheckConstraintSatisfaction( const NamedDecl *Template, ArrayRef ConstraintExprs, - ArrayRef TemplateArgs, + /* ArrayRef TemplateArgs,*/ + MultiLevelTemplateArgumentList MLTAL, SourceRange TemplateIDRange, ConstraintSatisfaction &Satisfaction); + bool CheckConstraintSatisfaction(const NamedDecl *Template, + ArrayRef ConstraintExprs, + ArrayRef TemplateArgs, + SourceRange TemplateIDRange, + ConstraintSatisfaction &Satisfaction); + /// \brief Check whether the given non-dependent constraint expression is /// satisfied. Returns false and updates Satisfaction with the satisfaction /// verdict if successful, emits a diagnostic and returns true if an error @@ -6990,9 +6999,10 @@ /// /// \returns true if the constrains are not satisfied or could not be checked /// for satisfaction, false if the constraints are satisfied. - bool EnsureTemplateArgumentListConstraints(TemplateDecl *Template, - ArrayRef TemplateArgs, - SourceRange TemplateIDRange); + bool + EnsureTemplateArgumentListConstraints(TemplateDecl *Template, + MultiLevelTemplateArgumentList MLTAL, + SourceRange TemplateIDRange); /// \brief Emit diagnostics explaining why a constraint expression was deemed /// unsatisfied. @@ -8729,7 +8739,8 @@ getTemplateInstantiationArgs(NamedDecl *D, const TemplateArgumentList *Innermost = nullptr, bool RelativeToPrimary = false, - const FunctionDecl *Pattern = nullptr); + const FunctionDecl *Pattern = nullptr, + bool LookBeyondLambda = false); /// A context in which code is being synthesized (where a source location /// alone is not sufficient to identify the context). This covers template Index: clang/include/clang/Sema/Template.h =================================================================== --- clang/include/clang/Sema/Template.h +++ clang/include/clang/Sema/Template.h @@ -76,9 +76,12 @@ /// The template argument list at a certain template depth using ArgList = ArrayRef; + public: + // TODO: ERICH: should we make an accessor for this of some sort? /// The template argument lists, stored from the innermost template /// argument list (first) to the outermost template argument list (last). SmallVector TemplateArgumentLists; + private: /// The number of outer levels of template arguments that are not /// being substituted. Index: clang/lib/AST/ASTConcept.cpp =================================================================== --- clang/lib/AST/ASTConcept.cpp +++ clang/lib/AST/ASTConcept.cpp @@ -17,6 +17,7 @@ #include "clang/AST/TemplateBase.h" #include "llvm/ADT/ArrayRef.h" #include "llvm/ADT/FoldingSet.h" +#include using namespace clang; ASTConstraintSatisfaction::ASTConstraintSatisfaction(const ASTContext &C, @@ -59,9 +60,18 @@ void ConstraintSatisfaction::Profile( llvm::FoldingSetNodeID &ID, const ASTContext &C, - const NamedDecl *ConstraintOwner, ArrayRef TemplateArgs) { + const NamedDecl *ConstraintOwner, + llvm::ArrayRef> TemplateArgs) { ID.AddPointer(ConstraintOwner); - ID.AddInteger(TemplateArgs.size()); - for (auto &Arg : TemplateArgs) - Arg.Profile(ID, C); + // TODO ERICH: This depends on the 'depth substituting', which I think is + // insufficient here. Do we need to keep ALL the arguments, or does NamedDecl + // contain those? + ID.AddInteger( + std::accumulate(TemplateArgs.begin(), TemplateArgs.end(), 0, + [](int Acc, ArrayRef SubArgs) { + return Acc + SubArgs.size(); + })); + for (ArrayRef SubList : TemplateArgs) + for (auto &Arg : SubList) + Arg.Profile(ID, C); } Index: clang/lib/Parse/ParseTemplate.cpp =================================================================== --- clang/lib/Parse/ParseTemplate.cpp +++ clang/lib/Parse/ParseTemplate.cpp @@ -159,6 +159,11 @@ TemplateParams, RAngleLoc, OptionalRequiresClauseConstraintER.get())); } while (Tok.isOneOf(tok::kw_export, tok::kw_template)); + // TODO: ERICH: At one point this was valuable to move outside of the + // TemplateParameterDepthRAII scope above (by creating a new scope, and + // inverting this condition and the return after). However, I believe that + // caused other issues along the way, and was not particularly fruitful in the + // end. Marking this to remind you/perhaps be useful later. // Parse the actual template declaration. if (Tok.is(tok::kw_concept)) return ParseConceptDefinition( Index: clang/lib/Sema/SemaConcept.cpp =================================================================== --- clang/lib/Sema/SemaConcept.cpp +++ clang/lib/Sema/SemaConcept.cpp @@ -199,7 +199,7 @@ } static bool calculateConstraintSatisfaction( - Sema &S, const NamedDecl *Template, ArrayRef TemplateArgs, + Sema &S, const NamedDecl *Template, //ArrayRef TemplateArgs, SourceLocation TemplateNameLoc, MultiLevelTemplateArgumentList &MLTAL, const Expr *ConstraintExpr, ConstraintSatisfaction &Satisfaction) { return calculateConstraintSatisfaction( @@ -219,8 +219,13 @@ return ExprError(); // We do not want error diagnostics escaping here. Sema::SFINAETrap Trap(S); + // TODO: ERICH: These are of course pretty hacky, hopefully we can + // come up iwth a way for Sema to just 'know' this during + // substitution. + ++S.CheckingConstraintExpression; SubstitutedExpression = S.SubstExpr(const_cast(AtomicExpr), MLTAL); + --S.CheckingConstraintExpression; // Substitution might have stripped off a contextual conversion to // bool if this is the operand of an '&&' or '||'. For example, we // might lose an lvalue-to-rvalue conversion here. If so, put it back @@ -270,7 +275,8 @@ static bool CheckConstraintSatisfaction(Sema &S, const NamedDecl *Template, ArrayRef ConstraintExprs, - ArrayRef TemplateArgs, + // ArrayRef TemplateArgs, + MultiLevelTemplateArgumentList MLTAL, SourceRange TemplateIDRange, ConstraintSatisfaction &Satisfaction) { if (ConstraintExprs.empty()) { @@ -278,24 +284,33 @@ return false; } - for (auto& Arg : TemplateArgs) - if (Arg.isInstantiationDependent()) { - // No need to check satisfaction for dependent constraint expressions. - Satisfaction.IsSatisfied = true; - return false; - } + for (auto &TemplateArgs: MLTAL.TemplateArgumentLists) + for (auto& Arg : TemplateArgs) + if (Arg.isInstantiationDependent()) { + // No need to check satisfaction for dependent constraint expressions. + Satisfaction.IsSatisfied = true; + return false; + } - Sema::InstantiatingTemplate Inst(S, TemplateIDRange.getBegin(), + // TODO: ERICH: I have no idea what this does, but it seems to work ok with + // just the base-level? Do we need to create new ones of these to handle the + // multi-level version? + Sema::InstantiatingTemplate Inst( + S, TemplateIDRange.getBegin(), Sema::InstantiatingTemplate::ConstraintsCheck{}, - const_cast(Template), TemplateArgs, TemplateIDRange); + const_cast(Template), + (MLTAL.TemplateArgumentLists.size() + ? MLTAL.TemplateArgumentLists[MLTAL.TemplateArgumentLists.size() - 1] + : ArrayRef{}), + TemplateIDRange); if (Inst.isInvalid()) return true; - MultiLevelTemplateArgumentList MLTAL; - MLTAL.addOuterTemplateArguments(TemplateArgs); + //MultiLevelTemplateArgumentList MLTAL; + //MLTAL.addOuterTemplateArguments(TemplateArgs); for (const Expr *ConstraintExpr : ConstraintExprs) { - if (calculateConstraintSatisfaction(S, Template, TemplateArgs, + if (calculateConstraintSatisfaction(S, Template,// TemplateArgs, TemplateIDRange.getBegin(), MLTAL, ConstraintExpr, Satisfaction)) return true; @@ -311,7 +326,20 @@ bool Sema::CheckConstraintSatisfaction( const NamedDecl *Template, ArrayRef ConstraintExprs, - ArrayRef TemplateArgs, SourceRange TemplateIDRange, + ArrayRef TemplateArgs, + SourceRange TemplateIDRange, + ConstraintSatisfaction &OutSatisfaction) { + MultiLevelTemplateArgumentList MLTAL; + MLTAL.addOuterTemplateArguments(TemplateArgs); + return CheckConstraintSatisfaction(Template, ConstraintExprs, MLTAL, + TemplateIDRange, OutSatisfaction); +} + +bool Sema::CheckConstraintSatisfaction( + const NamedDecl *Template, ArrayRef ConstraintExprs, + /*ArrayRef TemplateArgs,*/ + MultiLevelTemplateArgumentList MLTAL, + SourceRange TemplateIDRange, ConstraintSatisfaction &OutSatisfaction) { if (ConstraintExprs.empty()) { OutSatisfaction.IsSatisfied = true; @@ -323,18 +351,18 @@ ConstraintSatisfaction *Satisfaction = nullptr; bool ShouldCache = LangOpts.ConceptSatisfactionCaching && Template; if (ShouldCache) { - ConstraintSatisfaction::Profile(ID, Context, Template, TemplateArgs); + ConstraintSatisfaction::Profile(ID, Context, Template, MLTAL.TemplateArgumentLists); Satisfaction = SatisfactionCache.FindNodeOrInsertPos(ID, InsertPos); if (Satisfaction) { OutSatisfaction = *Satisfaction; return false; } - Satisfaction = new ConstraintSatisfaction(Template, TemplateArgs); + Satisfaction = new ConstraintSatisfaction(Template, MLTAL.TemplateArgumentLists); } else { Satisfaction = &OutSatisfaction; } if (::CheckConstraintSatisfaction(*this, Template, ConstraintExprs, - TemplateArgs, TemplateIDRange, + MLTAL, TemplateIDRange, *Satisfaction)) { if (ShouldCache) delete Satisfaction; @@ -378,26 +406,29 @@ // constraint in a constant-evaluated context. // FIXME: Should this be a dedicated TreeTransform? return CheckConstraintSatisfaction( - FD, {RC}, /*TemplateArgs=*/{}, + FD, {RC}, /*TemplateArgs=*/ArrayRef{}, SourceRange(UsageLoc.isValid() ? UsageLoc : FD->getLocation()), Satisfaction); } bool Sema::EnsureTemplateArgumentListConstraints( - TemplateDecl *TD, ArrayRef TemplateArgs, + TemplateDecl *TD, MultiLevelTemplateArgumentList MLTAL, SourceRange TemplateIDRange) { ConstraintSatisfaction Satisfaction; llvm::SmallVector AssociatedConstraints; TD->getAssociatedConstraints(AssociatedConstraints); - if (CheckConstraintSatisfaction(TD, AssociatedConstraints, TemplateArgs, + if (CheckConstraintSatisfaction(TD, AssociatedConstraints, MLTAL, TemplateIDRange, Satisfaction)) return true; if (!Satisfaction.IsSatisfied) { SmallString<128> TemplateArgString; TemplateArgString = " "; + // TODO: ERICH: Is this acceptable? Should we be printing more than just the + // bottom level? TemplateArgString += getTemplateArgumentBindingsText( - TD->getTemplateParameters(), TemplateArgs.data(), TemplateArgs.size()); + TD->getTemplateParameters(), MLTAL.getInnermost().data(), + MLTAL.getInnermost().size()); Diag(TemplateIDRange.getBegin(), diag::err_template_arg_list_constraints_not_satisfied) Index: clang/lib/Sema/SemaExprCXX.cpp =================================================================== --- clang/lib/Sema/SemaExprCXX.cpp +++ clang/lib/Sema/SemaExprCXX.cpp @@ -8843,7 +8843,8 @@ Sema::BuildNestedRequirement(Expr *Constraint) { ConstraintSatisfaction Satisfaction; if (!Constraint->isInstantiationDependent() && - CheckConstraintSatisfaction(nullptr, {Constraint}, /*TemplateArgs=*/{}, + CheckConstraintSatisfaction(nullptr, {Constraint}, + /*TemplateArgs=*/ArrayRef{}, Constraint->getSourceRange(), Satisfaction)) return nullptr; return new (Context) concepts::NestedRequirement(Context, Constraint, Index: clang/lib/Sema/SemaTemplate.cpp =================================================================== --- clang/lib/Sema/SemaTemplate.cpp +++ clang/lib/Sema/SemaTemplate.cpp @@ -3670,6 +3670,8 @@ // Check that the template argument list is well-formed for this // template. SmallVector Converted; + // TODO: ERICH: This is the e ntry point, but I think the info below sets up + // the template arguments. if (CheckTemplateArgumentList(Template, TemplateLoc, TemplateArgs, false, Converted, /*UpdateArgsWithConversions=*/true)) @@ -3693,6 +3695,7 @@ TemplateArgLists.addOuterTemplateArguments(&StackTemplateArgs); TemplateArgLists.addOuterRetainedLevels( AliasTemplate->getTemplateParameters()->getDepth()); + // TODO: Can we use the bit above? LocalInstantiationScope Scope(*this); InstantiatingTemplate Inst(*this, TemplateLoc, Template); @@ -5903,13 +5906,21 @@ if (UpdateArgsWithConversions) TemplateArgs = std::move(NewArgs); - if (!PartialTemplateArgs && - EnsureTemplateArgumentListConstraints( - Template, Converted, SourceRange(TemplateLoc, - TemplateArgs.getRAngleLoc()))) { - if (ConstraintsNotSatisfied) - *ConstraintsNotSatisfied = true; - return true; + if (!PartialTemplateArgs) { + MultiLevelTemplateArgumentList MLTAL = getTemplateInstantiationArgs( + Template, nullptr, /*RelativeToPrimary*/ true); + TemplateArgumentList StackTemplateArgs(TemplateArgumentList::OnStack, + Converted); + MLTAL.addOuterTemplateArguments(&StackTemplateArgs); + // TODO: ERICH: Do we need to set up the + // 'LocalInstantiationScope/InstantiationgTemplate things? + if (EnsureTemplateArgumentListConstraints( + Template, MLTAL, + SourceRange(TemplateLoc, TemplateArgs.getRAngleLoc()))) { + if (ConstraintsNotSatisfied) + *ConstraintsNotSatisfied = true; + return true; + } } return false; Index: clang/lib/Sema/SemaTemplateDeduction.cpp =================================================================== --- clang/lib/Sema/SemaTemplateDeduction.cpp +++ clang/lib/Sema/SemaTemplateDeduction.cpp @@ -4572,6 +4572,7 @@ if (S.CheckTemplateArgumentList(Concept, SourceLocation(), TemplateArgs, /*PartialTemplateArgs=*/false, Converted)) return Sema::DAR_FailedAlreadyDiagnosed; + if (S.CheckConstraintSatisfaction(Concept, {Concept->getConstraintExpr()}, Converted, TypeLoc.getLocalSourceRange(), Satisfaction)) Index: clang/lib/Sema/SemaTemplateInstantiate.cpp =================================================================== --- clang/lib/Sema/SemaTemplateInstantiate.cpp +++ clang/lib/Sema/SemaTemplateInstantiate.cpp @@ -55,11 +55,9 @@ /// instantiating the definition of the given declaration, \p D. This is /// used to determine the proper set of template instantiation arguments for /// friend function template specializations. -MultiLevelTemplateArgumentList -Sema::getTemplateInstantiationArgs(NamedDecl *D, - const TemplateArgumentList *Innermost, - bool RelativeToPrimary, - const FunctionDecl *Pattern) { +MultiLevelTemplateArgumentList Sema::getTemplateInstantiationArgs( + NamedDecl *D, const TemplateArgumentList *Innermost, bool RelativeToPrimary, + const FunctionDecl *Pattern, bool LookBeyondLambda) { // Accumulate the set of template argument lists in this structure. MultiLevelTemplateArgumentList Result; @@ -158,7 +156,8 @@ break; // If this function is a generic lambda specialization, we are done. - if (isGenericLambdaCallOperatorOrStaticInvokerSpecialization(Function)) + if (!LookBeyondLambda && + isGenericLambdaCallOperatorOrStaticInvokerSpecialization(Function)) break; } else if (Function->getDescribedFunctionTemplate()) { @@ -2312,15 +2311,22 @@ const MultiLevelTemplateArgumentList &TemplateArgs) { const ASTTemplateArgumentListInfo *TemplArgInfo = TC->getTemplateArgsAsWritten(); + TemplateArgumentListInfo InstArgs; if (TemplArgInfo) { InstArgs.setLAngleLoc(TemplArgInfo->LAngleLoc); InstArgs.setRAngleLoc(TemplArgInfo->RAngleLoc); + + // TODO: ERICH: Still do this if we skip it before? on SemaTemplateInstantiateDecl.cpp:2724? + // // ERICH: We don't want to substitute these until checked. +// for(const TemplateArgumentLoc &TAL : TemplArgInfo->arguments()) + // InstArgs.addArgument(TAL); if (SubstTemplateArguments(TemplArgInfo->arguments(), TemplateArgs, InstArgs)) return true; } + return AttachTypeConstraint( TC->getNestedNameSpecifierLoc(), TC->getConceptNameInfo(), TC->getNamedConcept(), &InstArgs, Inst, @@ -2394,8 +2400,18 @@ if (Inst && !Inst->getTypeConstraint()) { // TODO: Concepts: do not instantiate the constraint (delayed constraint // substitution) - if (SubstTypeConstraint(Inst, TC, TemplateArgs)) - return nullptr; + // TODO: ERICH: Is this condition right? This SEEMS like the right thing + // to do? + if (CheckingConstraintExpression) { + if (SubstTypeConstraint(Inst, TC, TemplateArgs)) + return nullptr; + } else { + Inst->setTypeConstraint(TC->getNestedNameSpecifierLoc(), + TC->getConceptNameInfo(), + TC->getNamedConcept(), TC->getNamedConcept(), + TC->getTemplateArgsAsWritten(), + TC->getImmediatelyDeclaredConstraint()); + } } } } Index: clang/lib/Sema/SemaTemplateInstantiateDecl.cpp =================================================================== --- clang/lib/Sema/SemaTemplateInstantiateDecl.cpp +++ clang/lib/Sema/SemaTemplateInstantiateDecl.cpp @@ -2034,6 +2034,7 @@ // FIXME: Concepts: Do not substitute into constraint expressions Expr *TrailingRequiresClause = D->getTrailingRequiresClause(); + /* if (TrailingRequiresClause) { EnterExpressionEvaluationContext ConstantEvaluated( SemaRef, Sema::ExpressionEvaluationContext::Unevaluated); @@ -2045,6 +2046,7 @@ if (!SemaRef.CheckConstraintExpression(TrailingRequiresClause)) return nullptr; } + */ // If we're instantiating a local function declaration, put the result // in the enclosing namespace; otherwise we need to find the instantiated @@ -2391,6 +2393,7 @@ // FIXME: Concepts: Do not substitute into constraint expressions Expr *TrailingRequiresClause = D->getTrailingRequiresClause(); +/* if (TrailingRequiresClause) { EnterExpressionEvaluationContext ConstantEvaluated( SemaRef, Sema::ExpressionEvaluationContext::Unevaluated); @@ -2405,6 +2408,7 @@ if (!SemaRef.CheckConstraintExpression(TrailingRequiresClause)) return nullptr; } + */ DeclContext *DC = Owner; if (isFriend) { @@ -2736,11 +2740,23 @@ // Invented template parameter type constraints will be instantiated with // the corresponding auto-typed parameter as it might reference other // parameters. - - // TODO: Concepts: do not instantiate the constraint (delayed constraint - // substitution) - if (SemaRef.SubstTypeConstraint(Inst, TC, TemplateArgs)) - return nullptr; + const ASTTemplateArgumentListInfo *ArgsAsWritten = + TC->getTemplateArgsAsWritten(); + + // TODO: ERICH: Can we come up with a somewhat less hacky way of doing + // this? Would be nice if this was some sort of state of the + // TemplatedeclInstantiator. + if (SemaRef.CheckingConstraintExpression > 0) { + if (SemaRef.SubstTypeConstraint(Inst, TC, TemplateArgs)) + return nullptr; + } else { + // TODO: ERICH: probably want to find a way to duplicate the args + // rather than reusing them? + Inst->setTypeConstraint(TC->getNestedNameSpecifierLoc(), + TC->getConceptNameInfo(), TC->getNamedConcept(), + TC->getNamedConcept(), ArgsAsWritten, + TC->getImmediatelyDeclaredConstraint()); + } } } if (D->hasDefaultArgument() && !D->defaultArgumentWasInherited()) { @@ -3983,6 +3999,7 @@ // FIXME: Concepts: Substitution into requires clause should only happen when // checking satisfaction. + /* Expr *InstRequiresClause = nullptr; if (Expr *E = L->getRequiresClause()) { EnterExpressionEvaluationContext ConstantEvaluated( @@ -3992,7 +4009,9 @@ return nullptr; } InstRequiresClause = Res.get(); - } + }*/ + + Expr *InstRequiresClause = L->getRequiresClause(); TemplateParameterList *InstL = TemplateParameterList::Create(SemaRef.Context, L->getTemplateLoc(), @@ -4590,6 +4609,7 @@ // PushDeclContext because we don't have a scope. Sema::ContextRAII savedContext(*this, Decl); LocalInstantiationScope Scope(*this); + MultiLevelTemplateArgumentList MLTAL; // If this is not an explicit specialization - we need to get the instantiated // version of the template arguments and add them to scope for the @@ -4600,13 +4620,28 @@ TemplateArgs, SourceRange()); if (Inst.isInvalid()) return true; - MultiLevelTemplateArgumentList MLTAL( - *Decl->getTemplateSpecializationArgs()); + + // TODO: ERICH: Wonder if we could move this to the CheckConstraintSatisfaacton wrapper? + // TODO: ERICH: Should pattern be the PrimaryTemplate below? + MLTAL = getTemplateInstantiationArgs( + Decl, nullptr, /*RelativeToPrimary*/ true, /*Pattern*/ nullptr, + /*LookBeyondLambda*/ true); + if (addInstantiatedParametersToScope( - *this, Decl, Decl->getPrimaryTemplate()->getTemplatedDecl(), - Scope, MLTAL)) + *this, Decl, Decl->getPrimaryTemplate()->getTemplatedDecl(), Scope, + MLTAL)) return true; + const FunctionTemplateDecl *PrimaryTemplate = Decl->getPrimaryTemplate(); + if (const auto *FromMemTempl = + PrimaryTemplate->getInstantiatedFromMemberTemplate()) + if (addInstantiatedParametersToScope( + *this, Decl, FromMemTempl->getTemplatedDecl(), Scope, MLTAL)) + return true; + + } else { + MLTAL.addOuterTemplateArguments(TemplateArgs); } + Qualifiers ThisQuals; CXXRecordDecl *Record = nullptr; if (auto *Method = dyn_cast(Decl)) { @@ -4614,7 +4649,7 @@ Record = Method->getParent(); } CXXThisScopeRAII ThisScope(*this, Record, ThisQuals, Record != nullptr); - return CheckConstraintSatisfaction(Template, TemplateAC, TemplateArgs, + return CheckConstraintSatisfaction(Template, TemplateAC, MLTAL, PointOfInstantiation, Satisfaction); } Index: clang/lib/Sema/TreeTransform.h =================================================================== --- clang/lib/Sema/TreeTransform.h +++ clang/lib/Sema/TreeTransform.h @@ -12926,11 +12926,13 @@ } // Transform the trailing requires clause - ExprResult NewTrailingRequiresClause; + ExprResult NewTrailingRequiresClause = E->getCallOperator()->getTrailingRequiresClause();; + /* if (Expr *TRC = E->getCallOperator()->getTrailingRequiresClause()) // FIXME: Concepts: Substitution into requires clause should only happen // when checking satisfaction. NewTrailingRequiresClause = getDerived().TransformExpr(TRC); + */ // Create the local class that will describe the lambda. // FIXME: KnownDependent below is wrong when substituting inside a templated Index: clang/test/SemaTemplate/instantiate-requires-clause.cpp =================================================================== --- clang/test/SemaTemplate/instantiate-requires-clause.cpp +++ clang/test/SemaTemplate/instantiate-requires-clause.cpp @@ -1,5 +1,5 @@ // RUN: %clang_cc1 -std=c++2a -x c++ %s -verify - +/* template requires ((sizeof(Args) == 1), ...) // expected-note@-1 {{because '(sizeof(int) == 1) , (sizeof(char) == 1) , (sizeof(int) == 1)' evaluated to false}} void f1(Args&&... args) { } @@ -29,17 +29,18 @@ using f32 = decltype(f3(1, 'b')); using f33 = decltype(f3(1, 'b', 2)); // expected-error@-1 {{no matching function for call to 'f3'}} - +*/ template struct S { template - static constexpr auto f(U const index) requires(index, true) { + static constexpr auto f(U const index) requires(index, U::foo, true) + { return true; } }; static_assert(S::f(1)); - +/* constexpr auto value = 0; template @@ -67,3 +68,4 @@ }; static_assert((S4{}.foo(), S4{}.goo(), true)); +*/ Index: clang/test/SemaTemplate/trailing-return-short-circuit.cpp =================================================================== --- /dev/null +++ clang/test/SemaTemplate/trailing-return-short-circuit.cpp @@ -0,0 +1,61 @@ +// RUN: %clang_cc1 -std=c++20 -verify %s + +template +requires(sizeof(T) > 2) || T::value // #FOO_REQ +void Foo(T){}; // #FOO + +template +void TrailingReturn(T) // #TRAILING +requires(sizeof(T) > 2) || T::value // #TRAILING_REQ +{}; +template +struct HasValue { + static constexpr bool value = B; +}; +static_assert(sizeof(HasValue) <= 2); + +template +struct HasValueLarge { + static constexpr bool value = B; + int I; +}; +static_assert(sizeof(HasValueLarge) > 2); + +void usage() { + // Passes the 1st check, short-circuit so the 2nd ::value is not evaluated. + Foo(1.0); + TrailingReturn(1.0); + + // Fails the 1st check, but has a ::value, so the check happens correctly. + Foo(HasValue{}); + TrailingReturn(HasValue{}); + + // Passes the 1st check, but would have passed the 2nd one. + Foo(HasValueLarge{}); + TrailingReturn(HasValueLarge{}); + + // Fails the 1st check, fails 2nd because there is no ::value. + Foo(true); + // expected-error@-1{{no matching function for call to 'Foo'}} + // expected-note@#FOO{{candidate template ignored: constraints not satisfied [with T = bool]}} + // expected-note@#FOO_REQ{{because 'sizeof(_Bool) > 2' (1 > 2) evaluated to false}} + // expected-note@#FOO_REQ{{because substituted constraint expression is ill-formed: type 'bool' cannot be used prior to '::' because it has no members}} + + TrailingReturn(true); + // expected-error@-1{{no matching function for call to 'TrailingReturn'}} + // expected-note@#TRAILING{{candidate template ignored: constraints not satisfied [with T = bool]}} + // expected-note@#TRAILING_REQ{{because 'sizeof(_Bool) > 2' (1 > 2) evaluated to false}} + // expected-note@#TRAILING_REQ{{because substituted constraint expression is ill-formed: type 'bool' cannot be used prior to '::' because it has no members}} + + // Fails the 1st check, fails 2nd because ::value is false. + Foo(HasValue{}); + // expected-error@-1 {{no matching function for call to 'Foo'}} + // expected-note@#FOO{{candidate template ignored: constraints not satisfied [with T = HasValue]}} + // expected-note@#FOO_REQ{{because 'sizeof(HasValue) > 2' (1 > 2) evaluated to false}} + // expected-note@#FOO_REQ{{and 'HasValue::value' evaluated to false}} + TrailingReturn(HasValue{}); + // expected-error@-1 {{no matching function for call to 'TrailingReturn'}} + // expected-note@#TRAILING{{candidate template ignored: constraints not satisfied [with T = HasValue]}} + // expected-note@#TRAILING_REQ{{because 'sizeof(HasValue) > 2' (1 > 2) evaluated to false}} + // expected-note@#TRAILING_REQ{{and 'HasValue::value' evaluated to false}} +}