/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp

Bug Summary

File:	clang/lib/Sema/SemaTemplateDeduction.cpp
Warning:	line 3923, column 31 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name SemaTemplateDeduction.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -fhalf-no-semantic-interposition -mframe-pointer=none -relaxed-aliasing -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/build-llvm/tools/clang/lib/Sema -resource-dir /usr/lib/llvm-13/lib/clang/13.0.0 -D CLANG_ROUND_TRIP_CC1_ARGS=ON -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/build-llvm/tools/clang/lib/Sema -I /build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema -I /build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include -I /build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/build-llvm/tools/clang/include -I /build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/build-llvm/include -I /build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/x86_64-linux-gnu/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0/backward -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../x86_64-linux-gnu/include -internal-isystem /usr/lib/llvm-13/lib/clang/13.0.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/build-llvm/tools/clang/lib/Sema -fdebug-prefix-map=/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4=. -ferror-limit 19 -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2021-04-05-202135-9119-1 -x c++ /build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp

/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp

→

1//===- SemaTemplateDeduction.cpp - Template Argument Deduction ------------===//
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// This file implements C++ template argument deduction.
10//
11//===----------------------------------------------------------------------===//

13#include "clang/Sema/TemplateDeduction.h"
14#include "TreeTransform.h"
15#include "TypeLocBuilder.h"
16#include "clang/AST/ASTContext.h"
17#include "clang/AST/ASTLambda.h"
18#include "clang/AST/Decl.h"
19#include "clang/AST/DeclAccessPair.h"
20#include "clang/AST/DeclBase.h"
21#include "clang/AST/DeclCXX.h"
22#include "clang/AST/DeclTemplate.h"
23#include "clang/AST/DeclarationName.h"
24#include "clang/AST/Expr.h"
25#include "clang/AST/ExprCXX.h"
26#include "clang/AST/NestedNameSpecifier.h"
27#include "clang/AST/RecursiveASTVisitor.h"
28#include "clang/AST/TemplateBase.h"
29#include "clang/AST/TemplateName.h"
30#include "clang/AST/Type.h"
31#include "clang/AST/TypeLoc.h"
32#include "clang/AST/UnresolvedSet.h"
33#include "clang/Basic/AddressSpaces.h"
34#include "clang/Basic/ExceptionSpecificationType.h"
35#include "clang/Basic/LLVM.h"
36#include "clang/Basic/LangOptions.h"
37#include "clang/Basic/PartialDiagnostic.h"
38#include "clang/Basic/SourceLocation.h"
39#include "clang/Basic/Specifiers.h"
40#include "clang/Sema/Ownership.h"
41#include "clang/Sema/Sema.h"
42#include "clang/Sema/Template.h"
43#include "llvm/ADT/APInt.h"
44#include "llvm/ADT/APSInt.h"
45#include "llvm/ADT/ArrayRef.h"
46#include "llvm/ADT/DenseMap.h"
47#include "llvm/ADT/FoldingSet.h"
48#include "llvm/ADT/Optional.h"
49#include "llvm/ADT/SmallBitVector.h"
50#include "llvm/ADT/SmallPtrSet.h"
51#include "llvm/ADT/SmallVector.h"
52#include "llvm/Support/Casting.h"
53#include "llvm/Support/Compiler.h"
54#include "llvm/Support/ErrorHandling.h"
55#include <algorithm>
56#include <cassert>
57#include <tuple>
58#include <utility>

60namespace clang {

/// Various flags that control template argument deduction.
///
/// These flags can be bitwise-OR'd together.
enum TemplateDeductionFlags {
  /// No template argument deduction flags, which indicates the
  /// strictest results for template argument deduction (as used for, e.g.,
  /// matching class template partial specializations).
  TDF_None = 0,

  /// Within template argument deduction from a function call, we are
  /// matching with a parameter type for which the original parameter was
  /// a reference.
  TDF_ParamWithReferenceType = 0x1,

  /// Within template argument deduction from a function call, we
  /// are matching in a case where we ignore cv-qualifiers.
  TDF_IgnoreQualifiers = 0x02,

  /// Within template argument deduction from a function call,
  /// we are matching in a case where we can perform template argument
  /// deduction from a template-id of a derived class of the argument type.
  TDF_DerivedClass = 0x04,

  /// Allow non-dependent types to differ, e.g., when performing
  /// template argument deduction from a function call where conversions
  /// may apply.
  TDF_SkipNonDependent = 0x08,

  /// Whether we are performing template argument deduction for
  /// parameters and arguments in a top-level template argument
  TDF_TopLevelParameterTypeList = 0x10,

  /// Within template argument deduction from overload resolution per
  /// C++ [over.over] allow matching function types that are compatible in
  /// terms of noreturn and default calling convention adjustments, or
  /// similarly matching a declared template specialization against a
  /// possible template, per C++ [temp.deduct.decl]. In either case, permit
  /// deduction where the parameter is a function type that can be converted
  /// to the argument type.
  TDF_AllowCompatibleFunctionType = 0x20,

  /// Within template argument deduction for a conversion function, we are
  /// matching with an argument type for which the original argument was
  /// a reference.
  TDF_ArgWithReferenceType = 0x40,
};
108}

110using namespace clang;
111using namespace sema;

113/// Compare two APSInts, extending and switching the sign as
114/// necessary to compare their values regardless of underlying type.
115static bool hasSameExtendedValue(llvm::APSInt X, llvm::APSInt Y) {
if (Y.getBitWidth() > X.getBitWidth())
  X = X.extend(Y.getBitWidth());
else if (Y.getBitWidth() < X.getBitWidth())
  Y = Y.extend(X.getBitWidth());

// If there is a signedness mismatch, correct it.
if (X.isSigned() != Y.isSigned()) {
  // If the signed value is negative, then the values cannot be the same.
  if ((Y.isSigned() && Y.isNegative()) || (X.isSigned() && X.isNegative()))
    return false;

  Y.setIsSigned(true);
  X.setIsSigned(true);
}

return X == Y;
132}

134static Sema::TemplateDeductionResult
135DeduceTemplateArguments(Sema &S,
                      TemplateParameterList *TemplateParams,
                      const TemplateArgument &Param,
                      TemplateArgument Arg,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced);

142static Sema::TemplateDeductionResult
143DeduceTemplateArgumentsByTypeMatch(Sema &S,
                                 TemplateParameterList *TemplateParams,
                                 QualType Param,
                                 QualType Arg,
                                 TemplateDeductionInfo &Info,
                                 SmallVectorImpl<DeducedTemplateArgument> &
                                                    Deduced,
                                 unsigned TDF,
                                 bool PartialOrdering = false,
                                 bool DeducedFromArrayBound = false);

154static Sema::TemplateDeductionResult
155DeduceTemplateArguments(Sema &S, TemplateParameterList *TemplateParams,
                      ArrayRef<TemplateArgument> Params,
                      ArrayRef<TemplateArgument> Args,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced,
                      bool NumberOfArgumentsMustMatch);

162static void MarkUsedTemplateParameters(ASTContext &Ctx,
                                     const TemplateArgument &TemplateArg,
                                     bool OnlyDeduced, unsigned Depth,
                                     llvm::SmallBitVector &Used);

167static void MarkUsedTemplateParameters(ASTContext &Ctx, QualType T,
                                     bool OnlyDeduced, unsigned Level,
                                     llvm::SmallBitVector &Deduced);

171/// If the given expression is of a form that permits the deduction
172/// of a non-type template parameter, return the declaration of that
173/// non-type template parameter.
174static const NonTypeTemplateParmDecl *
175getDeducedParameterFromExpr(const Expr *E, unsigned Depth) {
// If we are within an alias template, the expression may have undergone
// any number of parameter substitutions already.
while (true) {
  if (const auto *IC = dyn_cast<ImplicitCastExpr>(E))
    E = IC->getSubExpr();
  else if (const auto *CE = dyn_cast<ConstantExpr>(E))
    E = CE->getSubExpr();
  else if (const auto *Subst = dyn_cast<SubstNonTypeTemplateParmExpr>(E))
    E = Subst->getReplacement();
  else if (const auto *CCE = dyn_cast<CXXConstructExpr>(E)) {
    // Look through implicit copy construction from an lvalue of the same type.
    if (CCE->getParenOrBraceRange().isValid())
      break;
    // Note, there could be default arguments.
    assert(CCE->getNumArgs() >= 1 && "implicit construct expr should have 1 arg")((CCE->getNumArgs() >= 1 && "implicit construct expr should have 1 arg"
) ? static_cast<void> (0) : __assert_fail ("CCE->getNumArgs() >= 1 && \"implicit construct expr should have 1 arg\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 190, __PRETTY_FUNCTION__));
    E = CCE->getArg(0);
  } else
    break;
}

if (const auto *DRE = dyn_cast<DeclRefExpr>(E))
  if (const auto *NTTP = dyn_cast<NonTypeTemplateParmDecl>(DRE->getDecl()))
    if (NTTP->getDepth() == Depth)
      return NTTP;

return nullptr;
202}

204static const NonTypeTemplateParmDecl *
205getDeducedParameterFromExpr(TemplateDeductionInfo &Info, Expr *E) {
return getDeducedParameterFromExpr(E, Info.getDeducedDepth());
207}

209/// Determine whether two declaration pointers refer to the same
210/// declaration.
211static bool isSameDeclaration(Decl *X, Decl *Y) {
if (NamedDecl *NX = dyn_cast<NamedDecl>(X))
  X = NX->getUnderlyingDecl();
if (NamedDecl *NY = dyn_cast<NamedDecl>(Y))
  Y = NY->getUnderlyingDecl();

return X->getCanonicalDecl() == Y->getCanonicalDecl();
218}

220/// Verify that the given, deduced template arguments are compatible.
221///
222/// \returns The deduced template argument, or a NULL template argument if
223/// the deduced template arguments were incompatible.
224static DeducedTemplateArgument
225checkDeducedTemplateArguments(ASTContext &Context,
                            const DeducedTemplateArgument &X,
                            const DeducedTemplateArgument &Y) {
// We have no deduction for one or both of the arguments; they're compatible.
if (X.isNull())
  return Y;
if (Y.isNull())
  return X;

// If we have two non-type template argument values deduced for the same
// parameter, they must both match the type of the parameter, and thus must
// match each other's type. As we're only keeping one of them, we must check
// for that now. The exception is that if either was deduced from an array
// bound, the type is permitted to differ.
if (!X.wasDeducedFromArrayBound() && !Y.wasDeducedFromArrayBound()) {
  QualType XType = X.getNonTypeTemplateArgumentType();
  if (!XType.isNull()) {
    QualType YType = Y.getNonTypeTemplateArgumentType();
    if (YType.isNull() || !Context.hasSameType(XType, YType))
      return DeducedTemplateArgument();
  }
}

switch (X.getKind()) {
case TemplateArgument::Null:
  llvm_unreachable("Non-deduced template arguments handled above")::llvm::llvm_unreachable_internal("Non-deduced template arguments handled above"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 250);

case TemplateArgument::Type:
  // If two template type arguments have the same type, they're compatible.
  if (Y.getKind() == TemplateArgument::Type &&
      Context.hasSameType(X.getAsType(), Y.getAsType()))
    return X;

  // If one of the two arguments was deduced from an array bound, the other
  // supersedes it.
  if (X.wasDeducedFromArrayBound() != Y.wasDeducedFromArrayBound())
    return X.wasDeducedFromArrayBound() ? Y : X;

  // The arguments are not compatible.
  return DeducedTemplateArgument();

case TemplateArgument::Integral:
  // If we deduced a constant in one case and either a dependent expression or
  // declaration in another case, keep the integral constant.
  // If both are integral constants with the same value, keep that value.
  if (Y.getKind() == TemplateArgument::Expression ||
      Y.getKind() == TemplateArgument::Declaration ||
      (Y.getKind() == TemplateArgument::Integral &&
       hasSameExtendedValue(X.getAsIntegral(), Y.getAsIntegral())))
    return X.wasDeducedFromArrayBound() ? Y : X;

  // All other combinations are incompatible.
  return DeducedTemplateArgument();

case TemplateArgument::Template:
  if (Y.getKind() == TemplateArgument::Template &&
      Context.hasSameTemplateName(X.getAsTemplate(), Y.getAsTemplate()))
    return X;

  // All other combinations are incompatible.
  return DeducedTemplateArgument();

case TemplateArgument::TemplateExpansion:
  if (Y.getKind() == TemplateArgument::TemplateExpansion &&
      Context.hasSameTemplateName(X.getAsTemplateOrTemplatePattern(),
                                  Y.getAsTemplateOrTemplatePattern()))
    return X;

  // All other combinations are incompatible.
  return DeducedTemplateArgument();

case TemplateArgument::Expression: {
  if (Y.getKind() != TemplateArgument::Expression)
    return checkDeducedTemplateArguments(Context, Y, X);

  // Compare the expressions for equality
  llvm::FoldingSetNodeID ID1, ID2;
  X.getAsExpr()->Profile(ID1, Context, true);
  Y.getAsExpr()->Profile(ID2, Context, true);
  if (ID1 == ID2)
    return X.wasDeducedFromArrayBound() ? Y : X;

  // Differing dependent expressions are incompatible.
  return DeducedTemplateArgument();
}

case TemplateArgument::Declaration:
  assert(!X.wasDeducedFromArrayBound())((!X.wasDeducedFromArrayBound()) ? static_cast<void> (0
) : __assert_fail ("!X.wasDeducedFromArrayBound()", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 312, __PRETTY_FUNCTION__));

  // If we deduced a declaration and a dependent expression, keep the
  // declaration.
  if (Y.getKind() == TemplateArgument::Expression)
    return X;

  // If we deduced a declaration and an integral constant, keep the
  // integral constant and whichever type did not come from an array
  // bound.
  if (Y.getKind() == TemplateArgument::Integral) {
    if (Y.wasDeducedFromArrayBound())
      return TemplateArgument(Context, Y.getAsIntegral(),
                              X.getParamTypeForDecl());
    return Y;
  }

  // If we deduced two declarations, make sure that they refer to the
  // same declaration.
  if (Y.getKind() == TemplateArgument::Declaration &&
      isSameDeclaration(X.getAsDecl(), Y.getAsDecl()))
    return X;

  // All other combinations are incompatible.
  return DeducedTemplateArgument();

case TemplateArgument::NullPtr:
  // If we deduced a null pointer and a dependent expression, keep the
  // null pointer.
  if (Y.getKind() == TemplateArgument::Expression)
    return X;

  // If we deduced a null pointer and an integral constant, keep the
  // integral constant.
  if (Y.getKind() == TemplateArgument::Integral)
    return Y;

  // If we deduced two null pointers, they are the same.
  if (Y.getKind() == TemplateArgument::NullPtr)
    return X;

  // All other combinations are incompatible.
  return DeducedTemplateArgument();

case TemplateArgument::Pack: {
  if (Y.getKind() != TemplateArgument::Pack ||
      X.pack_size() != Y.pack_size())
    return DeducedTemplateArgument();

  llvm::SmallVector<TemplateArgument, 8> NewPack;
  for (TemplateArgument::pack_iterator XA = X.pack_begin(),
                                    XAEnd = X.pack_end(),
                                       YA = Y.pack_begin();
       XA != XAEnd; ++XA, ++YA) {
    TemplateArgument Merged = checkDeducedTemplateArguments(
        Context, DeducedTemplateArgument(*XA, X.wasDeducedFromArrayBound()),
        DeducedTemplateArgument(*YA, Y.wasDeducedFromArrayBound()));
    if (Merged.isNull() && !(XA->isNull() && YA->isNull()))
      return DeducedTemplateArgument();
    NewPack.push_back(Merged);
  }

  return DeducedTemplateArgument(
      TemplateArgument::CreatePackCopy(Context, NewPack),
      X.wasDeducedFromArrayBound() && Y.wasDeducedFromArrayBound());
}
}

llvm_unreachable("Invalid TemplateArgument Kind!")::llvm::llvm_unreachable_internal("Invalid TemplateArgument Kind!"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 380);
381}

383/// Deduce the value of the given non-type template parameter
384/// as the given deduced template argument. All non-type template parameter
385/// deduction is funneled through here.
386static Sema::TemplateDeductionResult DeduceNonTypeTemplateArgument(
  Sema &S, TemplateParameterList *TemplateParams,
  const NonTypeTemplateParmDecl *NTTP, const DeducedTemplateArgument &NewDeduced,
  QualType ValueType, TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
assert(NTTP->getDepth() == Info.getDeducedDepth() &&((NTTP->getDepth() == Info.getDeducedDepth() && "deducing non-type template argument with wrong depth"
) ? static_cast<void> (0) : __assert_fail ("NTTP->getDepth() == Info.getDeducedDepth() && \"deducing non-type template argument with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 392, __PRETTY_FUNCTION__))
       "deducing non-type template argument with wrong depth")((NTTP->getDepth() == Info.getDeducedDepth() && "deducing non-type template argument with wrong depth"
) ? static_cast<void> (0) : __assert_fail ("NTTP->getDepth() == Info.getDeducedDepth() && \"deducing non-type template argument with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 392, __PRETTY_FUNCTION__));

DeducedTemplateArgument Result = checkDeducedTemplateArguments(
    S.Context, Deduced[NTTP->getIndex()], NewDeduced);
if (Result.isNull()) {
  Info.Param = const_cast<NonTypeTemplateParmDecl*>(NTTP);
  Info.FirstArg = Deduced[NTTP->getIndex()];
  Info.SecondArg = NewDeduced;
  return Sema::TDK_Inconsistent;
}

Deduced[NTTP->getIndex()] = Result;
if (!S.getLangOpts().CPlusPlus17)
  return Sema::TDK_Success;

if (NTTP->isExpandedParameterPack())
  // FIXME: We may still need to deduce parts of the type here! But we
  // don't have any way to find which slice of the type to use, and the
  // type stored on the NTTP itself is nonsense. Perhaps the type of an
  // expanded NTTP should be a pack expansion type?
  return Sema::TDK_Success;

// Get the type of the parameter for deduction. If it's a (dependent) array
// or function type, we will not have decayed it yet, so do that now.
QualType ParamType = S.Context.getAdjustedParameterType(NTTP->getType());
if (auto *Expansion = dyn_cast<PackExpansionType>(ParamType))
  ParamType = Expansion->getPattern();

// FIXME: It's not clear how deduction of a parameter of reference
// type from an argument (of non-reference type) should be performed.
// For now, we just remove reference types from both sides and let
// the final check for matching types sort out the mess.
ValueType = ValueType.getNonReferenceType();
if (ParamType->isReferenceType())
  ParamType = ParamType.getNonReferenceType();
else
  // Top-level cv-qualifiers are irrelevant for a non-reference type.
  ValueType = ValueType.getUnqualifiedType();

return DeduceTemplateArgumentsByTypeMatch(
    S, TemplateParams, ParamType, ValueType, Info, Deduced,
    TDF_SkipNonDependent, /*PartialOrdering=*/false,
    /*ArrayBound=*/NewDeduced.wasDeducedFromArrayBound());
435}

437/// Deduce the value of the given non-type template parameter
438/// from the given integral constant.
439static Sema::TemplateDeductionResult DeduceNonTypeTemplateArgument(
  Sema &S, TemplateParameterList *TemplateParams,
  const NonTypeTemplateParmDecl *NTTP, const llvm::APSInt &Value,
  QualType ValueType, bool DeducedFromArrayBound, TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
return DeduceNonTypeTemplateArgument(
    S, TemplateParams, NTTP,
    DeducedTemplateArgument(S.Context, Value, ValueType,
                            DeducedFromArrayBound),
    ValueType, Info, Deduced);
449}

451/// Deduce the value of the given non-type template parameter
452/// from the given null pointer template argument type.
453static Sema::TemplateDeductionResult DeduceNullPtrTemplateArgument(
  Sema &S, TemplateParameterList *TemplateParams,
  const NonTypeTemplateParmDecl *NTTP, QualType NullPtrType,
  TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
Expr *Value = S.ImpCastExprToType(
                   new (S.Context) CXXNullPtrLiteralExpr(S.Context.NullPtrTy,
                                                         NTTP->getLocation()),
                   NullPtrType,
                   NullPtrType->isMemberPointerType() ? CK_NullToMemberPointer
                                                      : CK_NullToPointer)
                  .get();
return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                     DeducedTemplateArgument(Value),
                                     Value->getType(), Info, Deduced);
468}

470/// Deduce the value of the given non-type template parameter
471/// from the given type- or value-dependent expression.
472///
473/// \returns true if deduction succeeded, false otherwise.
474static Sema::TemplateDeductionResult DeduceNonTypeTemplateArgument(
  Sema &S, TemplateParameterList *TemplateParams,
  const NonTypeTemplateParmDecl *NTTP, Expr *Value, TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                     DeducedTemplateArgument(Value),
                                     Value->getType(), Info, Deduced);
481}

483/// Deduce the value of the given non-type template parameter
484/// from the given declaration.
485///
486/// \returns true if deduction succeeded, false otherwise.
487static Sema::TemplateDeductionResult DeduceNonTypeTemplateArgument(
  Sema &S, TemplateParameterList *TemplateParams,
  const NonTypeTemplateParmDecl *NTTP, ValueDecl *D, QualType T,
  TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
D = D ? cast<ValueDecl>(D->getCanonicalDecl()) : nullptr;
TemplateArgument New(D, T);
return DeduceNonTypeTemplateArgument(
    S, TemplateParams, NTTP, DeducedTemplateArgument(New), T, Info, Deduced);
496}

498static Sema::TemplateDeductionResult
499DeduceTemplateArguments(Sema &S,
                      TemplateParameterList *TemplateParams,
                      TemplateName Param,
                      TemplateName Arg,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
TemplateDecl *ParamDecl = Param.getAsTemplateDecl();
if (!ParamDecl) {
  // The parameter type is dependent and is not a template template parameter,
  // so there is nothing that we can deduce.
  return Sema::TDK_Success;
}

if (TemplateTemplateParmDecl *TempParam
      = dyn_cast<TemplateTemplateParmDecl>(ParamDecl)) {
  // If we're not deducing at this depth, there's nothing to deduce.
  if (TempParam->getDepth() != Info.getDeducedDepth())
    return Sema::TDK_Success;

  DeducedTemplateArgument NewDeduced(S.Context.getCanonicalTemplateName(Arg));
  DeducedTemplateArgument Result = checkDeducedTemplateArguments(S.Context,
                                               Deduced[TempParam->getIndex()],
                                                                 NewDeduced);
  if (Result.isNull()) {
    Info.Param = TempParam;
    Info.FirstArg = Deduced[TempParam->getIndex()];
    Info.SecondArg = NewDeduced;
    return Sema::TDK_Inconsistent;
  }

  Deduced[TempParam->getIndex()] = Result;
  return Sema::TDK_Success;
}

// Verify that the two template names are equivalent.
if (S.Context.hasSameTemplateName(Param, Arg))
  return Sema::TDK_Success;

// Mismatch of non-dependent template parameter to argument.
Info.FirstArg = TemplateArgument(Param);
Info.SecondArg = TemplateArgument(Arg);
return Sema::TDK_NonDeducedMismatch;
541}

543/// Deduce the template arguments by comparing the template parameter
544/// type (which is a template-id) with the template argument type.
545///
546/// \param S the Sema
547///
548/// \param TemplateParams the template parameters that we are deducing
549///
550/// \param Param the parameter type
551///
552/// \param Arg the argument type
553///
554/// \param Info information about the template argument deduction itself
555///
556/// \param Deduced the deduced template arguments
557///
558/// \returns the result of template argument deduction so far. Note that a
559/// "success" result means that template argument deduction has not yet failed,
560/// but it may still fail, later, for other reasons.
561static Sema::TemplateDeductionResult
562DeduceTemplateArguments(Sema &S,
                      TemplateParameterList *TemplateParams,
                      const TemplateSpecializationType *Param,
                      QualType Arg,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
assert(Arg.isCanonical() && "Argument type must be canonical")((Arg.isCanonical() && "Argument type must be canonical"
) ? static_cast<void> (0) : __assert_fail ("Arg.isCanonical() && \"Argument type must be canonical\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 568, __PRETTY_FUNCTION__));

// Treat an injected-class-name as its underlying template-id.
if (auto *Injected = dyn_cast<InjectedClassNameType>(Arg))
  Arg = Injected->getInjectedSpecializationType();

// Check whether the template argument is a dependent template-id.
if (const TemplateSpecializationType *SpecArg
      = dyn_cast<TemplateSpecializationType>(Arg)) {
  // Perform template argument deduction for the template name.
  if (Sema::TemplateDeductionResult Result
        = DeduceTemplateArguments(S, TemplateParams,
                                  Param->getTemplateName(),
                                  SpecArg->getTemplateName(),
                                  Info, Deduced))
    return Result;


  // Perform template argument deduction on each template
  // argument. Ignore any missing/extra arguments, since they could be
  // filled in by default arguments.
  return DeduceTemplateArguments(S, TemplateParams,
                                 Param->template_arguments(),
                                 SpecArg->template_arguments(), Info, Deduced,
                                 /*NumberOfArgumentsMustMatch=*/false);
}

// If the argument type is a class template specialization, we
// perform template argument deduction using its template
// arguments.
const RecordType *RecordArg = dyn_cast<RecordType>(Arg);
if (!RecordArg) {
  Info.FirstArg = TemplateArgument(QualType(Param, 0));
  Info.SecondArg = TemplateArgument(Arg);
  return Sema::TDK_NonDeducedMismatch;
}

ClassTemplateSpecializationDecl *SpecArg
  = dyn_cast<ClassTemplateSpecializationDecl>(RecordArg->getDecl());
if (!SpecArg) {
  Info.FirstArg = TemplateArgument(QualType(Param, 0));
  Info.SecondArg = TemplateArgument(Arg);
  return Sema::TDK_NonDeducedMismatch;
}

// Perform template argument deduction for the template name.
if (Sema::TemplateDeductionResult Result
      = DeduceTemplateArguments(S,
                                TemplateParams,
                                Param->getTemplateName(),
                             TemplateName(SpecArg->getSpecializedTemplate()),
                                Info, Deduced))
  return Result;

// Perform template argument deduction for the template arguments.
return DeduceTemplateArguments(S, TemplateParams, Param->template_arguments(),
                               SpecArg->getTemplateArgs().asArray(), Info,
                               Deduced, /*NumberOfArgumentsMustMatch=*/true);
626}

628/// Determines whether the given type is an opaque type that
629/// might be more qualified when instantiated.
630static bool IsPossiblyOpaquelyQualifiedType(QualType T) {
switch (T->getTypeClass()) {
case Type::TypeOfExpr:
case Type::TypeOf:
case Type::DependentName:
case Type::Decltype:
case Type::UnresolvedUsing:
case Type::TemplateTypeParm:
  return true;

case Type::ConstantArray:
case Type::IncompleteArray:
case Type::VariableArray:
case Type::DependentSizedArray:
  return IsPossiblyOpaquelyQualifiedType(
                                    cast<ArrayType>(T)->getElementType());

default:
  return false;
}
650}

652/// Helper function to build a TemplateParameter when we don't
653/// know its type statically.
654static TemplateParameter makeTemplateParameter(Decl *D) {
if (TemplateTypeParmDecl *TTP = dyn_cast<TemplateTypeParmDecl>(D))
  return TemplateParameter(TTP);
if (NonTypeTemplateParmDecl *NTTP = dyn_cast<NonTypeTemplateParmDecl>(D))
  return TemplateParameter(NTTP);

return TemplateParameter(cast<TemplateTemplateParmDecl>(D));
661}

663/// A pack that we're currently deducing.
664struct clang::DeducedPack {
// The index of the pack.
unsigned Index;

// The old value of the pack before we started deducing it.
DeducedTemplateArgument Saved;

// A deferred value of this pack from an inner deduction, that couldn't be
// deduced because this deduction hadn't happened yet.
DeducedTemplateArgument DeferredDeduction;

// The new value of the pack.
SmallVector<DeducedTemplateArgument, 4> New;

// The outer deduction for this pack, if any.
DeducedPack *Outer = nullptr;

DeducedPack(unsigned Index) : Index(Index) {}
682};

684namespace {

686/// A scope in which we're performing pack deduction.
687class PackDeductionScope {
688public:
/// Prepare to deduce the packs named within Pattern.
PackDeductionScope(Sema &S, TemplateParameterList *TemplateParams,
                   SmallVectorImpl<DeducedTemplateArgument> &Deduced,
                   TemplateDeductionInfo &Info, TemplateArgument Pattern)
    : S(S), TemplateParams(TemplateParams), Deduced(Deduced), Info(Info) {
  unsigned NumNamedPacks = addPacks(Pattern);
  finishConstruction(NumNamedPacks);
}

/// Prepare to directly deduce arguments of the parameter with index \p Index.
PackDeductionScope(Sema &S, TemplateParameterList *TemplateParams,
                   SmallVectorImpl<DeducedTemplateArgument> &Deduced,
                   TemplateDeductionInfo &Info, unsigned Index)
    : S(S), TemplateParams(TemplateParams), Deduced(Deduced), Info(Info) {
  addPack(Index);
  finishConstruction(1);
}

707private:
void addPack(unsigned Index) {
  // Save the deduced template argument for the parameter pack expanded
  // by this pack expansion, then clear out the deduction.
  DeducedPack Pack(Index);
  Pack.Saved = Deduced[Index];
  Deduced[Index] = TemplateArgument();

  // FIXME: What if we encounter multiple packs with different numbers of
  // pre-expanded expansions? (This should already have been diagnosed
  // during substitution.)
  if (Optional<unsigned> ExpandedPackExpansions =
          getExpandedPackSize(TemplateParams->getParam(Index)))
    FixedNumExpansions = ExpandedPackExpansions;

  Packs.push_back(Pack);
}

unsigned addPacks(TemplateArgument Pattern) {
  // Compute the set of template parameter indices that correspond to
  // parameter packs expanded by the pack expansion.
  llvm::SmallBitVector SawIndices(TemplateParams->size());
  llvm::SmallVector<TemplateArgument, 4> ExtraDeductions;

  auto AddPack = [&](unsigned Index) {
    if (SawIndices[Index])
      return;
    SawIndices[Index] = true;
    addPack(Index);

    // Deducing a parameter pack that is a pack expansion also constrains the
    // packs appearing in that parameter to have the same deduced arity. Also,
    // in C++17 onwards, deducing a non-type template parameter deduces its
    // type, so we need to collect the pending deduced values for those packs.
    if (auto *NTTP = dyn_cast<NonTypeTemplateParmDecl>(
            TemplateParams->getParam(Index))) {
      if (!NTTP->isExpandedParameterPack())
        if (auto *Expansion = dyn_cast<PackExpansionType>(NTTP->getType()))
          ExtraDeductions.push_back(Expansion->getPattern());
    }
    // FIXME: Also collect the unexpanded packs in any type and template
    // parameter packs that are pack expansions.
  };

  auto Collect = [&](TemplateArgument Pattern) {
    SmallVector<UnexpandedParameterPack, 2> Unexpanded;
    S.collectUnexpandedParameterPacks(Pattern, Unexpanded);
    for (unsigned I = 0, N = Unexpanded.size(); I != N; ++I) {
      unsigned Depth, Index;
      std::tie(Depth, Index) = getDepthAndIndex(Unexpanded[I]);
      if (Depth == Info.getDeducedDepth())
        AddPack(Index);
    }
  };

  // Look for unexpanded packs in the pattern.
  Collect(Pattern);
  assert(!Packs.empty() && "Pack expansion without unexpanded packs?")((!Packs.empty() && "Pack expansion without unexpanded packs?"
) ? static_cast<void> (0) : __assert_fail ("!Packs.empty() && \"Pack expansion without unexpanded packs?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 764, __PRETTY_FUNCTION__));

  unsigned NumNamedPacks = Packs.size();

  // Also look for unexpanded packs that are indirectly deduced by deducing
  // the sizes of the packs in this pattern.
  while (!ExtraDeductions.empty())
    Collect(ExtraDeductions.pop_back_val());

  return NumNamedPacks;
}

void finishConstruction(unsigned NumNamedPacks) {
  // Dig out the partially-substituted pack, if there is one.
  const TemplateArgument *PartialPackArgs = nullptr;
  unsigned NumPartialPackArgs = 0;
  std::pair<unsigned, unsigned> PartialPackDepthIndex(-1u, -1u);
  if (auto *Scope = S.CurrentInstantiationScope)
    if (auto *Partial = Scope->getPartiallySubstitutedPack(
            &PartialPackArgs, &NumPartialPackArgs))
      PartialPackDepthIndex = getDepthAndIndex(Partial);

  // This pack expansion will have been partially or fully expanded if
  // it only names explicitly-specified parameter packs (including the
  // partially-substituted one, if any).
  bool IsExpanded = true;
  for (unsigned I = 0; I != NumNamedPacks; ++I) {
    if (Packs[I].Index >= Info.getNumExplicitArgs()) {
      IsExpanded = false;
      IsPartiallyExpanded = false;
      break;
    }
    if (PartialPackDepthIndex ==
          std::make_pair(Info.getDeducedDepth(), Packs[I].Index)) {
      IsPartiallyExpanded = true;
    }
  }

  // Skip over the pack elements that were expanded into separate arguments.
  // If we partially expanded, this is the number of partial arguments.
  if (IsPartiallyExpanded)
    PackElements += NumPartialPackArgs;
  else if (IsExpanded)
    PackElements += *FixedNumExpansions;

  for (auto &Pack : Packs) {
    if (Info.PendingDeducedPacks.size() > Pack.Index)
      Pack.Outer = Info.PendingDeducedPacks[Pack.Index];
    else
      Info.PendingDeducedPacks.resize(Pack.Index + 1);
    Info.PendingDeducedPacks[Pack.Index] = &Pack;

    if (PartialPackDepthIndex ==
          std::make_pair(Info.getDeducedDepth(), Pack.Index)) {
      Pack.New.append(PartialPackArgs, PartialPackArgs + NumPartialPackArgs);
      // We pre-populate the deduced value of the partially-substituted
      // pack with the specified value. This is not entirely correct: the
      // value is supposed to have been substituted, not deduced, but the
      // cases where this is observable require an exact type match anyway.
      //
      // FIXME: If we could represent a "depth i, index j, pack elem k"
      // parameter, we could substitute the partially-substituted pack
      // everywhere and avoid this.
      if (!IsPartiallyExpanded)
        Deduced[Pack.Index] = Pack.New[PackElements];
    }
  }
}

833public:
~PackDeductionScope() {
  for (auto &Pack : Packs)
    Info.PendingDeducedPacks[Pack.Index] = Pack.Outer;
}

/// Determine whether this pack has already been partially expanded into a
/// sequence of (prior) function parameters / template arguments.
bool isPartiallyExpanded() { return IsPartiallyExpanded; }

/// Determine whether this pack expansion scope has a known, fixed arity.
/// This happens if it involves a pack from an outer template that has
/// (notionally) already been expanded.
bool hasFixedArity() { return FixedNumExpansions.hasValue(); }

/// Determine whether the next element of the argument is still part of this
/// pack. This is the case unless the pack is already expanded to a fixed
/// length.
bool hasNextElement() {
  return !FixedNumExpansions || *FixedNumExpansions > PackElements;
}

/// Move to deducing the next element in each pack that is being deduced.
void nextPackElement() {
  // Capture the deduced template arguments for each parameter pack expanded
  // by this pack expansion, add them to the list of arguments we've deduced
  // for that pack, then clear out the deduced argument.
  for (auto &Pack : Packs) {
    DeducedTemplateArgument &DeducedArg = Deduced[Pack.Index];
    if (!Pack.New.empty() || !DeducedArg.isNull()) {
      while (Pack.New.size() < PackElements)
        Pack.New.push_back(DeducedTemplateArgument());
      if (Pack.New.size() == PackElements)
        Pack.New.push_back(DeducedArg);
      else
        Pack.New[PackElements] = DeducedArg;
      DeducedArg = Pack.New.size() > PackElements + 1
                       ? Pack.New[PackElements + 1]
                       : DeducedTemplateArgument();
    }
  }
  ++PackElements;
}

/// Finish template argument deduction for a set of argument packs,
/// producing the argument packs and checking for consistency with prior
/// deductions.
Sema::TemplateDeductionResult finish() {
  // Build argument packs for each of the parameter packs expanded by this
  // pack expansion.
  for (auto &Pack : Packs) {
    // Put back the old value for this pack.
    Deduced[Pack.Index] = Pack.Saved;

    // Always make sure the size of this pack is correct, even if we didn't
    // deduce any values for it.
    //
    // FIXME: This isn't required by the normative wording, but substitution
    // and post-substitution checking will always fail if the arity of any
    // pack is not equal to the number of elements we processed. (Either that
    // or something else has gone *very* wrong.) We're permitted to skip any
    // hard errors from those follow-on steps by the intent (but not the
    // wording) of C++ [temp.inst]p8:
    //
    //   If the function selected by overload resolution can be determined
    //   without instantiating a class template definition, it is unspecified
    //   whether that instantiation actually takes place
    Pack.New.resize(PackElements);

    // Build or find a new value for this pack.
    DeducedTemplateArgument NewPack;
    if (Pack.New.empty()) {
      // If we deduced an empty argument pack, create it now.
      NewPack = DeducedTemplateArgument(TemplateArgument::getEmptyPack());
    } else {
      TemplateArgument *ArgumentPack =
          new (S.Context) TemplateArgument[Pack.New.size()];
      std::copy(Pack.New.begin(), Pack.New.end(), ArgumentPack);
      NewPack = DeducedTemplateArgument(
          TemplateArgument(llvm::makeArrayRef(ArgumentPack, Pack.New.size())),
          // FIXME: This is wrong, it's possible that some pack elements are
          // deduced from an array bound and others are not:
          //   template<typename ...T, T ...V> void g(const T (&...p)[V]);
          //   g({1, 2, 3}, {{}, {}});
          // ... should deduce T = {int, size_t (from array bound)}.
          Pack.New[0].wasDeducedFromArrayBound());
    }

    // Pick where we're going to put the merged pack.
    DeducedTemplateArgument *Loc;
    if (Pack.Outer) {
      if (Pack.Outer->DeferredDeduction.isNull()) {
        // Defer checking this pack until we have a complete pack to compare
        // it against.
        Pack.Outer->DeferredDeduction = NewPack;
        continue;
      }
      Loc = &Pack.Outer->DeferredDeduction;
    } else {
      Loc = &Deduced[Pack.Index];
    }

    // Check the new pack matches any previous value.
    DeducedTemplateArgument OldPack = *Loc;
    DeducedTemplateArgument Result =
        checkDeducedTemplateArguments(S.Context, OldPack, NewPack);

    // If we deferred a deduction of this pack, check that one now too.
    if (!Result.isNull() && !Pack.DeferredDeduction.isNull()) {
      OldPack = Result;
      NewPack = Pack.DeferredDeduction;
      Result = checkDeducedTemplateArguments(S.Context, OldPack, NewPack);
    }

    NamedDecl *Param = TemplateParams->getParam(Pack.Index);
    if (Result.isNull()) {
      Info.Param = makeTemplateParameter(Param);
      Info.FirstArg = OldPack;
      Info.SecondArg = NewPack;
      return Sema::TDK_Inconsistent;
    }

    // If we have a pre-expanded pack and we didn't deduce enough elements
    // for it, fail deduction.
    if (Optional<unsigned> Expansions = getExpandedPackSize(Param)) {
      if (*Expansions != PackElements) {
        Info.Param = makeTemplateParameter(Param);
        Info.FirstArg = Result;
        return Sema::TDK_IncompletePack;
      }
    }

    *Loc = Result;
  }

  return Sema::TDK_Success;
}

971private:
Sema &S;
TemplateParameterList *TemplateParams;
SmallVectorImpl<DeducedTemplateArgument> &Deduced;
TemplateDeductionInfo &Info;
unsigned PackElements = 0;
bool IsPartiallyExpanded = false;
/// The number of expansions, if we have a fully-expanded pack in this scope.
Optional<unsigned> FixedNumExpansions;

SmallVector<DeducedPack, 2> Packs;
982};

984} // namespace

986/// Deduce the template arguments by comparing the list of parameter
987/// types to the list of argument types, as in the parameter-type-lists of
988/// function types (C++ [temp.deduct.type]p10).
989///
990/// \param S The semantic analysis object within which we are deducing
991///
992/// \param TemplateParams The template parameters that we are deducing
993///
994/// \param Params The list of parameter types
995///
996/// \param NumParams The number of types in \c Params
997///
998/// \param Args The list of argument types
999///
1000/// \param NumArgs The number of types in \c Args
1001///
1002/// \param Info information about the template argument deduction itself
1003///
1004/// \param Deduced the deduced template arguments
1005///
1006/// \param TDF bitwise OR of the TemplateDeductionFlags bits that describe
1007/// how template argument deduction is performed.
1008///
1009/// \param PartialOrdering If true, we are performing template argument
1010/// deduction for during partial ordering for a call
1011/// (C++0x [temp.deduct.partial]).
1012///
1013/// \returns the result of template argument deduction so far. Note that a
1014/// "success" result means that template argument deduction has not yet failed,
1015/// but it may still fail, later, for other reasons.
1016static Sema::TemplateDeductionResult
1017DeduceTemplateArguments(Sema &S,
                      TemplateParameterList *TemplateParams,
                      const QualType *Params, unsigned NumParams,
                      const QualType *Args, unsigned NumArgs,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced,
                      unsigned TDF,
                      bool PartialOrdering = false) {
// C++0x [temp.deduct.type]p10:
//   Similarly, if P has a form that contains (T), then each parameter type
//   Pi of the respective parameter-type- list of P is compared with the
//   corresponding parameter type Ai of the corresponding parameter-type-list
//   of A. [...]
unsigned ArgIdx = 0, ParamIdx = 0;
for (; ParamIdx != NumParams; ++ParamIdx) {
  // Check argument types.
  const PackExpansionType *Expansion
                              = dyn_cast<PackExpansionType>(Params[ParamIdx]);
  if (!Expansion) {
    // Simple case: compare the parameter and argument types at this point.

    // Make sure we have an argument.
    if (ArgIdx >= NumArgs)
      return Sema::TDK_MiscellaneousDeductionFailure;

    if (isa<PackExpansionType>(Args[ArgIdx])) {
      // C++0x [temp.deduct.type]p22:
      //   If the original function parameter associated with A is a function
      //   parameter pack and the function parameter associated with P is not
      //   a function parameter pack, then template argument deduction fails.
      return Sema::TDK_MiscellaneousDeductionFailure;
    }

    if (Sema::TemplateDeductionResult Result
          = DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                               Params[ParamIdx], Args[ArgIdx],
                                               Info, Deduced, TDF,
                                               PartialOrdering))
      return Result;

    ++ArgIdx;
    continue;
  }

  // C++0x [temp.deduct.type]p10:
  //   If the parameter-declaration corresponding to Pi is a function
  //   parameter pack, then the type of its declarator- id is compared with
  //   each remaining parameter type in the parameter-type-list of A. Each
  //   comparison deduces template arguments for subsequent positions in the
  //   template parameter packs expanded by the function parameter pack.

  QualType Pattern = Expansion->getPattern();
  PackDeductionScope PackScope(S, TemplateParams, Deduced, Info, Pattern);

  // A pack scope with fixed arity is not really a pack any more, so is not
  // a non-deduced context.
  if (ParamIdx + 1 == NumParams || PackScope.hasFixedArity()) {
    for (; ArgIdx < NumArgs && PackScope.hasNextElement(); ++ArgIdx) {
      // Deduce template arguments from the pattern.
      if (Sema::TemplateDeductionResult Result
            = DeduceTemplateArgumentsByTypeMatch(S, TemplateParams, Pattern,
                                                 Args[ArgIdx], Info, Deduced,
                                                 TDF, PartialOrdering))
        return Result;

      PackScope.nextPackElement();
    }
  } else {
    // C++0x [temp.deduct.type]p5:
    //   The non-deduced contexts are:
    //     - A function parameter pack that does not occur at the end of the
    //       parameter-declaration-clause.
    //
    // FIXME: There is no wording to say what we should do in this case. We
    // choose to resolve this by applying the same rule that is applied for a
    // function call: that is, deduce all contained packs to their
    // explicitly-specified values (or to <> if there is no such value).
    //
    // This is seemingly-arbitrarily different from the case of a template-id
    // with a non-trailing pack-expansion in its arguments, which renders the
    // entire template-argument-list a non-deduced context.

    // If the parameter type contains an explicitly-specified pack that we
    // could not expand, skip the number of parameters notionally created
    // by the expansion.
    Optional<unsigned> NumExpansions = Expansion->getNumExpansions();
    if (NumExpansions && !PackScope.isPartiallyExpanded()) {
      for (unsigned I = 0; I != *NumExpansions && ArgIdx < NumArgs;
           ++I, ++ArgIdx)
        PackScope.nextPackElement();
    }
  }

  // Build argument packs for each of the parameter packs expanded by this
  // pack expansion.
  if (auto Result = PackScope.finish())
    return Result;
}

// Make sure we don't have any extra arguments.
if (ArgIdx < NumArgs)
  return Sema::TDK_MiscellaneousDeductionFailure;

return Sema::TDK_Success;
1121}

1123/// Determine whether the parameter has qualifiers that the argument
1124/// lacks. Put another way, determine whether there is no way to add
1125/// a deduced set of qualifiers to the ParamType that would result in
1126/// its qualifiers matching those of the ArgType.
1127static bool hasInconsistentOrSupersetQualifiersOf(QualType ParamType,
                                                QualType ArgType) {
Qualifiers ParamQs = ParamType.getQualifiers();
Qualifiers ArgQs = ArgType.getQualifiers();

if (ParamQs == ArgQs)
  return false;

// Mismatched (but not missing) Objective-C GC attributes.
if (ParamQs.getObjCGCAttr() != ArgQs.getObjCGCAttr() &&
    ParamQs.hasObjCGCAttr())
  return true;

// Mismatched (but not missing) address spaces.
if (ParamQs.getAddressSpace() != ArgQs.getAddressSpace() &&
    ParamQs.hasAddressSpace())
  return true;

// Mismatched (but not missing) Objective-C lifetime qualifiers.
if (ParamQs.getObjCLifetime() != ArgQs.getObjCLifetime() &&
    ParamQs.hasObjCLifetime())
  return true;

// CVR qualifiers inconsistent or a superset.
return (ParamQs.getCVRQualifiers() & ~ArgQs.getCVRQualifiers()) != 0;
1152}

1154/// Compare types for equality with respect to possibly compatible
1155/// function types (noreturn adjustment, implicit calling conventions). If any
1156/// of parameter and argument is not a function, just perform type comparison.
1157///
1158/// \param Param the template parameter type.
1159///
1160/// \param Arg the argument type.
1161bool Sema::isSameOrCompatibleFunctionType(CanQualType Param,
                                        CanQualType Arg) {
const FunctionType *ParamFunction = Param->getAs<FunctionType>(),
                   *ArgFunction   = Arg->getAs<FunctionType>();

// Just compare if not functions.
if (!ParamFunction || !ArgFunction)
  return Param == Arg;

// Noreturn and noexcept adjustment.
QualType AdjustedParam;
if (IsFunctionConversion(Param, Arg, AdjustedParam))
  return Arg == Context.getCanonicalType(AdjustedParam);

// FIXME: Compatible calling conventions.

return Param == Arg;
1178}

1180/// Get the index of the first template parameter that was originally from the
1181/// innermost template-parameter-list. This is 0 except when we concatenate
1182/// the template parameter lists of a class template and a constructor template
1183/// when forming an implicit deduction guide.
1184static unsigned getFirstInnerIndex(FunctionTemplateDecl *FTD) {
auto *Guide = dyn_cast<CXXDeductionGuideDecl>(FTD->getTemplatedDecl());
if (!Guide || !Guide->isImplicit())
  return 0;
return Guide->getDeducedTemplate()->getTemplateParameters()->size();
1189}

1191/// Determine whether a type denotes a forwarding reference.
1192static bool isForwardingReference(QualType Param, unsigned FirstInnerIndex) {
// C++1z [temp.deduct.call]p3:
//   A forwarding reference is an rvalue reference to a cv-unqualified
//   template parameter that does not represent a template parameter of a
//   class template.
if (auto *ParamRef = Param->getAs<RValueReferenceType>()) {
  if (ParamRef->getPointeeType().getQualifiers())
    return false;
  auto *TypeParm = ParamRef->getPointeeType()->getAs<TemplateTypeParmType>();
  return TypeParm && TypeParm->getIndex() >= FirstInnerIndex;
}
return false;
1204}

1206///  Attempt to deduce the template arguments by checking the base types
1207///  according to (C++20 [temp.deduct.call] p4b3.
1208///
1209/// \param S the semantic analysis object within which we are deducing.
1210///
1211/// \param RecordT the top level record object we are deducing against.
1212///
1213/// \param TemplateParams the template parameters that we are deducing.
1214///
1215/// \param SpecParam the template specialization parameter type.
1216///
1217/// \param Info information about the template argument deduction itself.
1218///
1219/// \param Deduced the deduced template arguments.
1220///
1221/// \returns the result of template argument deduction with the bases. "invalid"
1222/// means no matches, "success" found a single item, and the
1223/// "MiscellaneousDeductionFailure" result happens when the match is ambiguous.
1224static Sema::TemplateDeductionResult DeduceTemplateBases(
  Sema &S, const RecordType *RecordT, TemplateParameterList *TemplateParams,
  const TemplateSpecializationType *SpecParam, TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
// C++14 [temp.deduct.call] p4b3:
//   If P is a class and P has the form simple-template-id, then the
//   transformed A can be a derived class of the deduced A. Likewise if
//   P is a pointer to a class of the form simple-template-id, the
//   transformed A can be a pointer to a derived class pointed to by the
//   deduced A. However, if there is a class C that is a (direct or
//   indirect) base class of D and derived (directly or indirectly) from a
//   class B and that would be a valid deduced A, the deduced A cannot be
//   B or pointer to B, respectively.
//
//   These alternatives are considered only if type deduction would
//   otherwise fail. If they yield more than one possible deduced A, the
//   type deduction fails.

// Use a breadth-first search through the bases to collect the set of
// successful matches. Visited contains the set of nodes we have already
// visited, while ToVisit is our stack of records that we still need to
// visit.  Matches contains a list of matches that have yet to be
// disqualified.
llvm::SmallPtrSet<const RecordType *, 8> Visited;
SmallVector<const RecordType *, 8> ToVisit;
// We iterate over this later, so we have to use MapVector to ensure
// determinism.
llvm::MapVector<const RecordType *, SmallVector<DeducedTemplateArgument, 8>>
    Matches;

auto AddBases = [&Visited, &ToVisit](const RecordType *RT) {
  CXXRecordDecl *RD = cast<CXXRecordDecl>(RT->getDecl());
  for (const auto &Base : RD->bases()) {
    assert(Base.getType()->isRecordType() &&((Base.getType()->isRecordType() && "Base class that isn't a record?"
) ? static_cast<void> (0) : __assert_fail ("Base.getType()->isRecordType() && \"Base class that isn't a record?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1258, __PRETTY_FUNCTION__))
           "Base class that isn't a record?")((Base.getType()->isRecordType() && "Base class that isn't a record?"
) ? static_cast<void> (0) : __assert_fail ("Base.getType()->isRecordType() && \"Base class that isn't a record?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1258, __PRETTY_FUNCTION__));
    const RecordType *RT = Base.getType()->getAs<RecordType>();
    if (Visited.insert(RT).second)
      ToVisit.push_back(Base.getType()->getAs<RecordType>());
  }
};

// Set up the loop by adding all the bases.
AddBases(RecordT);

// Search each path of bases until we either run into a successful match
// (where all bases of it are invalid), or we run out of bases.
while (!ToVisit.empty()) {
  const RecordType *NextT = ToVisit.pop_back_val();

  SmallVector<DeducedTemplateArgument, 8> DeducedCopy(Deduced.begin(),
                                                      Deduced.end());
  TemplateDeductionInfo BaseInfo(TemplateDeductionInfo::ForBase, Info);
  Sema::TemplateDeductionResult BaseResult =
      DeduceTemplateArguments(S, TemplateParams, SpecParam,
                              QualType(NextT, 0), BaseInfo, DeducedCopy);

  // If this was a successful deduction, add it to the list of matches,
  // otherwise we need to continue searching its bases.
  if (BaseResult == Sema::TDK_Success)
    Matches.insert({NextT, DeducedCopy});
  else
    AddBases(NextT);
}

// At this point, 'Matches' contains a list of seemingly valid bases, however
// in the event that we have more than 1 match, it is possible that the base
// of one of the matches might be disqualified for being a base of another
// valid match. We can count on cyclical instantiations being invalid to
// simplify the disqualifications.  That is, if A & B are both matches, and B
// inherits from A (disqualifying A), we know that A cannot inherit from B.
if (Matches.size() > 1) {
  Visited.clear();
  for (const auto &Match : Matches)
    AddBases(Match.first);

  // We can give up once we have a single item (or have run out of things to
  // search) since cyclical inheritence isn't valid.
  while (Matches.size() > 1 && !ToVisit.empty()) {
    const RecordType *NextT = ToVisit.pop_back_val();
    Matches.erase(NextT);

    // Always add all bases, since the inheritence tree can contain
    // disqualifications for multiple matches.
    AddBases(NextT);
  }
}

if (Matches.empty())
  return Sema::TDK_Invalid;
if (Matches.size() > 1)
  return Sema::TDK_MiscellaneousDeductionFailure;

std::swap(Matches.front().second, Deduced);
return Sema::TDK_Success;
1318}

1320/// Deduce the template arguments by comparing the parameter type and
1321/// the argument type (C++ [temp.deduct.type]).
1322///
1323/// \param S the semantic analysis object within which we are deducing
1324///
1325/// \param TemplateParams the template parameters that we are deducing
1326///
1327/// \param ParamIn the parameter type
1328///
1329/// \param ArgIn the argument type
1330///
1331/// \param Info information about the template argument deduction itself
1332///
1333/// \param Deduced the deduced template arguments
1334///
1335/// \param TDF bitwise OR of the TemplateDeductionFlags bits that describe
1336/// how template argument deduction is performed.
1337///
1338/// \param PartialOrdering Whether we're performing template argument deduction
1339/// in the context of partial ordering (C++0x [temp.deduct.partial]).
1340///
1341/// \returns the result of template argument deduction so far. Note that a
1342/// "success" result means that template argument deduction has not yet failed,
1343/// but it may still fail, later, for other reasons.
1344static Sema::TemplateDeductionResult
1345DeduceTemplateArgumentsByTypeMatch(Sema &S,
                                 TemplateParameterList *TemplateParams,
                                 QualType ParamIn, QualType ArgIn,
                                 TemplateDeductionInfo &Info,
                          SmallVectorImpl<DeducedTemplateArgument> &Deduced,
                                 unsigned TDF,
                                 bool PartialOrdering,
                                 bool DeducedFromArrayBound) {
// We only want to look at the canonical types, since typedefs and
// sugar are not part of template argument deduction.
QualType Param = S.Context.getCanonicalType(ParamIn);
QualType Arg = S.Context.getCanonicalType(ArgIn);

// If the argument type is a pack expansion, look at its pattern.
// This isn't explicitly called out
if (const PackExpansionType *ArgExpansion
                                          = dyn_cast<PackExpansionType>(Arg))
  Arg = ArgExpansion->getPattern();

if (PartialOrdering) {
  // C++11 [temp.deduct.partial]p5:
  //   Before the partial ordering is done, certain transformations are
  //   performed on the types used for partial ordering:
  //     - If P is a reference type, P is replaced by the type referred to.
  const ReferenceType *ParamRef = Param->getAs<ReferenceType>();
  if (ParamRef)
    Param = ParamRef->getPointeeType();

  //     - If A is a reference type, A is replaced by the type referred to.
  const ReferenceType *ArgRef = Arg->getAs<ReferenceType>();
  if (ArgRef)
    Arg = ArgRef->getPointeeType();

  if (ParamRef && ArgRef && S.Context.hasSameUnqualifiedType(Param, Arg)) {
    // C++11 [temp.deduct.partial]p9:
    //   If, for a given type, deduction succeeds in both directions (i.e.,
    //   the types are identical after the transformations above) and both
    //   P and A were reference types [...]:
    //     - if [one type] was an lvalue reference and [the other type] was
    //       not, [the other type] is not considered to be at least as
    //       specialized as [the first type]
    //     - if [one type] is more cv-qualified than [the other type],
    //       [the other type] is not considered to be at least as specialized
    //       as [the first type]
    // Objective-C ARC adds:
    //     - [one type] has non-trivial lifetime, [the other type] has
    //       __unsafe_unretained lifetime, and the types are otherwise
    //       identical
    //
    // A is "considered to be at least as specialized" as P iff deduction
    // succeeds, so we model this as a deduction failure. Note that
    // [the first type] is P and [the other type] is A here; the standard
    // gets this backwards.
    Qualifiers ParamQuals = Param.getQualifiers();
    Qualifiers ArgQuals = Arg.getQualifiers();
    if ((ParamRef->isLValueReferenceType() &&
         !ArgRef->isLValueReferenceType()) ||
        ParamQuals.isStrictSupersetOf(ArgQuals) ||
        (ParamQuals.hasNonTrivialObjCLifetime() &&
         ArgQuals.getObjCLifetime() == Qualifiers::OCL_ExplicitNone &&
         ParamQuals.withoutObjCLifetime() ==
             ArgQuals.withoutObjCLifetime())) {
      Info.FirstArg = TemplateArgument(ParamIn);
      Info.SecondArg = TemplateArgument(ArgIn);
      return Sema::TDK_NonDeducedMismatch;
    }
  }

  // C++11 [temp.deduct.partial]p7:
  //   Remove any top-level cv-qualifiers:
  //     - If P is a cv-qualified type, P is replaced by the cv-unqualified
  //       version of P.
  Param = Param.getUnqualifiedType();
  //     - If A is a cv-qualified type, A is replaced by the cv-unqualified
  //       version of A.
  Arg = Arg.getUnqualifiedType();
} else {
  // C++0x [temp.deduct.call]p4 bullet 1:
  //   - If the original P is a reference type, the deduced A (i.e., the type
  //     referred to by the reference) can be more cv-qualified than the
  //     transformed A.
  if (TDF & TDF_ParamWithReferenceType) {
    Qualifiers Quals;
    QualType UnqualParam = S.Context.getUnqualifiedArrayType(Param, Quals);
    Quals.setCVRQualifiers(Quals.getCVRQualifiers() &
                           Arg.getCVRQualifiers());
    Param = S.Context.getQualifiedType(UnqualParam, Quals);
  }

  if ((TDF & TDF_TopLevelParameterTypeList) && !Param->isFunctionType()) {
    // C++0x [temp.deduct.type]p10:
    //   If P and A are function types that originated from deduction when
    //   taking the address of a function template (14.8.2.2) or when deducing
    //   template arguments from a function declaration (14.8.2.6) and Pi and
    //   Ai are parameters of the top-level parameter-type-list of P and A,
    //   respectively, Pi is adjusted if it is a forwarding reference and Ai
    //   is an lvalue reference, in
    //   which case the type of Pi is changed to be the template parameter
    //   type (i.e., T&& is changed to simply T). [ Note: As a result, when
    //   Pi is T&& and Ai is X&, the adjusted Pi will be T, causing T to be
    //   deduced as X&. - end note ]
    TDF &= ~TDF_TopLevelParameterTypeList;
    if (isForwardingReference(Param, 0) && Arg->isLValueReferenceType())
      Param = Param->getPointeeType();
  }
}

// C++ [temp.deduct.type]p9:
//   A template type argument T, a template template argument TT or a
//   template non-type argument i can be deduced if P and A have one of
//   the following forms:
//
//     T
//     cv-list T
if (const TemplateTypeParmType *TemplateTypeParm
      = Param->getAs<TemplateTypeParmType>()) {
  // Just skip any attempts to deduce from a placeholder type or a parameter
  // at a different depth.
  if (Arg->isPlaceholderType() ||
      Info.getDeducedDepth() != TemplateTypeParm->getDepth())
    return Sema::TDK_Success;

  unsigned Index = TemplateTypeParm->getIndex();
  bool RecanonicalizeArg = false;

  // If the argument type is an array type, move the qualifiers up to the
  // top level, so they can be matched with the qualifiers on the parameter.
  if (isa<ArrayType>(Arg)) {
    Qualifiers Quals;
    Arg = S.Context.getUnqualifiedArrayType(Arg, Quals);
    if (Quals) {
      Arg = S.Context.getQualifiedType(Arg, Quals);
      RecanonicalizeArg = true;
    }
  }

  // The argument type can not be less qualified than the parameter
  // type.
  if (!(TDF & TDF_IgnoreQualifiers) &&
      hasInconsistentOrSupersetQualifiersOf(Param, Arg)) {
    Info.Param = cast<TemplateTypeParmDecl>(TemplateParams->getParam(Index));
    Info.FirstArg = TemplateArgument(Param);
    Info.SecondArg = TemplateArgument(Arg);
    return Sema::TDK_Underqualified;
  }

  // Do not match a function type with a cv-qualified type.
  // http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#1584
  if (Arg->isFunctionType() && Param.hasQualifiers()) {
    return Sema::TDK_NonDeducedMismatch;
  }

  assert(TemplateTypeParm->getDepth() == Info.getDeducedDepth() &&((TemplateTypeParm->getDepth() == Info.getDeducedDepth() &&
 "saw template type parameter with wrong depth") ? static_cast
<void> (0) : __assert_fail ("TemplateTypeParm->getDepth() == Info.getDeducedDepth() && \"saw template type parameter with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1498, __PRETTY_FUNCTION__))
         "saw template type parameter with wrong depth")((TemplateTypeParm->getDepth() == Info.getDeducedDepth() &&
 "saw template type parameter with wrong depth") ? static_cast
<void> (0) : __assert_fail ("TemplateTypeParm->getDepth() == Info.getDeducedDepth() && \"saw template type parameter with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1498, __PRETTY_FUNCTION__));
  assert(Arg != S.Context.OverloadTy && "Unresolved overloaded function")((Arg != S.Context.OverloadTy && "Unresolved overloaded function"
) ? static_cast<void> (0) : __assert_fail ("Arg != S.Context.OverloadTy && \"Unresolved overloaded function\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1499, __PRETTY_FUNCTION__));
  QualType DeducedType = Arg;

  // Remove any qualifiers on the parameter from the deduced type.
  // We checked the qualifiers for consistency above.
  Qualifiers DeducedQs = DeducedType.getQualifiers();
  Qualifiers ParamQs = Param.getQualifiers();
  DeducedQs.removeCVRQualifiers(ParamQs.getCVRQualifiers());
  if (ParamQs.hasObjCGCAttr())
    DeducedQs.removeObjCGCAttr();
  if (ParamQs.hasAddressSpace())
    DeducedQs.removeAddressSpace();
  if (ParamQs.hasObjCLifetime())
    DeducedQs.removeObjCLifetime();

  // Objective-C ARC:
  //   If template deduction would produce a lifetime qualifier on a type
  //   that is not a lifetime type, template argument deduction fails.
  if (ParamQs.hasObjCLifetime() && !DeducedType->isObjCLifetimeType() &&
      !DeducedType->isDependentType()) {
    Info.Param = cast<TemplateTypeParmDecl>(TemplateParams->getParam(Index));
    Info.FirstArg = TemplateArgument(Param);
    Info.SecondArg = TemplateArgument(Arg);
    return Sema::TDK_Underqualified;
  }

  // Objective-C ARC:
  //   If template deduction would produce an argument type with lifetime type
  //   but no lifetime qualifier, the __strong lifetime qualifier is inferred.
  if (S.getLangOpts().ObjCAutoRefCount &&
      DeducedType->isObjCLifetimeType() &&
      !DeducedQs.hasObjCLifetime())
    DeducedQs.setObjCLifetime(Qualifiers::OCL_Strong);

  DeducedType = S.Context.getQualifiedType(DeducedType.getUnqualifiedType(),
                                           DeducedQs);

  if (RecanonicalizeArg)
    DeducedType = S.Context.getCanonicalType(DeducedType);

  DeducedTemplateArgument NewDeduced(DeducedType, DeducedFromArrayBound);
  DeducedTemplateArgument Result = checkDeducedTemplateArguments(S.Context,
                                                               Deduced[Index],
                                                                 NewDeduced);
  if (Result.isNull()) {
    Info.Param = cast<TemplateTypeParmDecl>(TemplateParams->getParam(Index));
    Info.FirstArg = Deduced[Index];
    Info.SecondArg = NewDeduced;
    return Sema::TDK_Inconsistent;
  }

  Deduced[Index] = Result;
  return Sema::TDK_Success;
}

// Set up the template argument deduction information for a failure.
Info.FirstArg = TemplateArgument(ParamIn);
Info.SecondArg = TemplateArgument(ArgIn);

// If the parameter is an already-substituted template parameter
// pack, do nothing: we don't know which of its arguments to look
// at, so we have to wait until all of the parameter packs in this
// expansion have arguments.
if (isa<SubstTemplateTypeParmPackType>(Param))
  return Sema::TDK_Success;

// Check the cv-qualifiers on the parameter and argument types.
CanQualType CanParam = S.Context.getCanonicalType(Param);
CanQualType CanArg = S.Context.getCanonicalType(Arg);
if (!(TDF & TDF_IgnoreQualifiers)) {
  if (TDF & TDF_ParamWithReferenceType) {
    if (hasInconsistentOrSupersetQualifiersOf(Param, Arg))
      return Sema::TDK_NonDeducedMismatch;
  } else if (TDF & TDF_ArgWithReferenceType) {
    // C++ [temp.deduct.conv]p4:
    //   If the original A is a reference type, A can be more cv-qualified
    //   than the deduced A
    if (!Arg.getQualifiers().compatiblyIncludes(Param.getQualifiers()))
      return Sema::TDK_NonDeducedMismatch;

    // Strip out all extra qualifiers from the argument to figure out the
    // type we're converting to, prior to the qualification conversion.
    Qualifiers Quals;
    Arg = S.Context.getUnqualifiedArrayType(Arg, Quals);
    Arg = S.Context.getQualifiedType(Arg, Param.getQualifiers());
  } else if (!IsPossiblyOpaquelyQualifiedType(Param)) {
    if (Param.getCVRQualifiers() != Arg.getCVRQualifiers())
      return Sema::TDK_NonDeducedMismatch;
  }

  // If the parameter type is not dependent, there is nothing to deduce.
  if (!Param->isDependentType()) {
    if (!(TDF & TDF_SkipNonDependent)) {
      bool NonDeduced =
          (TDF & TDF_AllowCompatibleFunctionType)
              ? !S.isSameOrCompatibleFunctionType(CanParam, CanArg)
              : Param != Arg;
      if (NonDeduced) {
        return Sema::TDK_NonDeducedMismatch;
      }
    }
    return Sema::TDK_Success;
  }
} else if (!Param->isDependentType()) {
  if (!(TDF & TDF_SkipNonDependent)) {
    CanQualType ParamUnqualType = CanParam.getUnqualifiedType(),
                ArgUnqualType = CanArg.getUnqualifiedType();
    bool Success =
        (TDF & TDF_AllowCompatibleFunctionType)
            ? S.isSameOrCompatibleFunctionType(ParamUnqualType, ArgUnqualType)
            : ParamUnqualType == ArgUnqualType;
    if (Success)
      return Sema::TDK_Success;
  } else {
    return Sema::TDK_Success;
  }
}

switch (Param->getTypeClass()) {
  // Non-canonical types cannot appear here.
1619#define NON_CANONICAL_TYPE(Class, Base) \
case Type::Class: llvm_unreachable("deducing non-canonical type: " #Class)::llvm::llvm_unreachable_internal("deducing non-canonical type: "
 #Class, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1620);
1621#define TYPE(Class, Base)
1622#include "clang/AST/TypeNodes.inc"

  case Type::TemplateTypeParm:
  case Type::SubstTemplateTypeParmPack:
    llvm_unreachable("Type nodes handled above")::llvm::llvm_unreachable_internal("Type nodes handled above",
 "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1626);

  // These types cannot be dependent, so simply check whether the types are
  // the same.
  case Type::Builtin:
  case Type::VariableArray:
  case Type::Vector:
  case Type::FunctionNoProto:
  case Type::Record:
  case Type::Enum:
  case Type::ObjCObject:
  case Type::ObjCInterface:
  case Type::ObjCObjectPointer:
  case Type::ExtInt:
    if (TDF & TDF_SkipNonDependent)
      return Sema::TDK_Success;

    if (TDF & TDF_IgnoreQualifiers) {
      Param = Param.getUnqualifiedType();
      Arg = Arg.getUnqualifiedType();
    }

    return Param == Arg? Sema::TDK_Success : Sema::TDK_NonDeducedMismatch;

  //     _Complex T   [placeholder extension]
  case Type::Complex:
    if (const ComplexType *ComplexArg = Arg->getAs<ComplexType>())
      return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                  cast<ComplexType>(Param)->getElementType(),
                                  ComplexArg->getElementType(),
                                  Info, Deduced, TDF);

    return Sema::TDK_NonDeducedMismatch;

  //     _Atomic T   [extension]
  case Type::Atomic:
    if (const AtomicType *AtomicArg = Arg->getAs<AtomicType>())
      return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                     cast<AtomicType>(Param)->getValueType(),
                                     AtomicArg->getValueType(),
                                     Info, Deduced, TDF);

    return Sema::TDK_NonDeducedMismatch;

  //     T *
  case Type::Pointer: {
    QualType PointeeType;
    if (const PointerType *PointerArg = Arg->getAs<PointerType>()) {
      PointeeType = PointerArg->getPointeeType();
    } else if (const ObjCObjectPointerType *PointerArg
                 = Arg->getAs<ObjCObjectPointerType>()) {
      PointeeType = PointerArg->getPointeeType();
    } else {
      return Sema::TDK_NonDeducedMismatch;
    }

    unsigned SubTDF = TDF & (TDF_IgnoreQualifiers | TDF_DerivedClass);
    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                   cast<PointerType>(Param)->getPointeeType(),
                                   PointeeType,
                                   Info, Deduced, SubTDF);
  }

  //     T &
  case Type::LValueReference: {
    const LValueReferenceType *ReferenceArg =
        Arg->getAs<LValueReferenceType>();
    if (!ReferenceArg)
      return Sema::TDK_NonDeducedMismatch;

    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                         cast<LValueReferenceType>(Param)->getPointeeType(),
                         ReferenceArg->getPointeeType(), Info, Deduced, 0);
  }

  //     T && [C++0x]
  case Type::RValueReference: {
    const RValueReferenceType *ReferenceArg =
        Arg->getAs<RValueReferenceType>();
    if (!ReferenceArg)
      return Sema::TDK_NonDeducedMismatch;

    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                           cast<RValueReferenceType>(Param)->getPointeeType(),
                           ReferenceArg->getPointeeType(),
                           Info, Deduced, 0);
  }

  //     T [] (implied, but not stated explicitly)
  case Type::IncompleteArray: {
    const IncompleteArrayType *IncompleteArrayArg =
      S.Context.getAsIncompleteArrayType(Arg);
    if (!IncompleteArrayArg)
      return Sema::TDK_NonDeducedMismatch;

    unsigned SubTDF = TDF & TDF_IgnoreQualifiers;
    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                  S.Context.getAsIncompleteArrayType(Param)->getElementType(),
                  IncompleteArrayArg->getElementType(),
                  Info, Deduced, SubTDF);
  }

  //     T [integer-constant]
  case Type::ConstantArray: {
    const ConstantArrayType *ConstantArrayArg =
      S.Context.getAsConstantArrayType(Arg);
    if (!ConstantArrayArg)
      return Sema::TDK_NonDeducedMismatch;

    const ConstantArrayType *ConstantArrayParm =
      S.Context.getAsConstantArrayType(Param);
    if (ConstantArrayArg->getSize() != ConstantArrayParm->getSize())
      return Sema::TDK_NonDeducedMismatch;

    unsigned SubTDF = TDF & TDF_IgnoreQualifiers;
    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                         ConstantArrayParm->getElementType(),
                                         ConstantArrayArg->getElementType(),
                                         Info, Deduced, SubTDF);
  }

  //     type [i]
  case Type::DependentSizedArray: {
    const ArrayType *ArrayArg = S.Context.getAsArrayType(Arg);
    if (!ArrayArg)
      return Sema::TDK_NonDeducedMismatch;

    unsigned SubTDF = TDF & TDF_IgnoreQualifiers;

    // Check the element type of the arrays
    const DependentSizedArrayType *DependentArrayParm
      = S.Context.getAsDependentSizedArrayType(Param);
    if (Sema::TemplateDeductionResult Result
          = DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                        DependentArrayParm->getElementType(),
                                        ArrayArg->getElementType(),
                                        Info, Deduced, SubTDF))
      return Result;

    // Determine the array bound is something we can deduce.
    const NonTypeTemplateParmDecl *NTTP
      = getDeducedParameterFromExpr(Info, DependentArrayParm->getSizeExpr());
    if (!NTTP)
      return Sema::TDK_Success;

    // We can perform template argument deduction for the given non-type
    // template parameter.
    assert(NTTP->getDepth() == Info.getDeducedDepth() &&((NTTP->getDepth() == Info.getDeducedDepth() && "saw non-type template parameter with wrong depth"
) ? static_cast<void> (0) : __assert_fail ("NTTP->getDepth() == Info.getDeducedDepth() && \"saw non-type template parameter with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1774, __PRETTY_FUNCTION__))
           "saw non-type template parameter with wrong depth")((NTTP->getDepth() == Info.getDeducedDepth() && "saw non-type template parameter with wrong depth"
) ? static_cast<void> (0) : __assert_fail ("NTTP->getDepth() == Info.getDeducedDepth() && \"saw non-type template parameter with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1774, __PRETTY_FUNCTION__));
    if (const ConstantArrayType *ConstantArrayArg
          = dyn_cast<ConstantArrayType>(ArrayArg)) {
      llvm::APSInt Size(ConstantArrayArg->getSize());
      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP, Size,
                                           S.Context.getSizeType(),
                                           /*ArrayBound=*/true,
                                           Info, Deduced);
    }
    if (const DependentSizedArrayType *DependentArrayArg
          = dyn_cast<DependentSizedArrayType>(ArrayArg))
      if (DependentArrayArg->getSizeExpr())
        return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                             DependentArrayArg->getSizeExpr(),
                                             Info, Deduced);

    // Incomplete type does not match a dependently-sized array type
    return Sema::TDK_NonDeducedMismatch;
  }

  //     type(*)(T)
  //     T(*)()
  //     T(*)(T)
  case Type::FunctionProto: {
    unsigned SubTDF = TDF & TDF_TopLevelParameterTypeList;
    const FunctionProtoType *FunctionProtoArg =
      dyn_cast<FunctionProtoType>(Arg);
    if (!FunctionProtoArg)
      return Sema::TDK_NonDeducedMismatch;

    const FunctionProtoType *FunctionProtoParam =
      cast<FunctionProtoType>(Param);

    if (FunctionProtoParam->getMethodQuals()
          != FunctionProtoArg->getMethodQuals() ||
        FunctionProtoParam->getRefQualifier()
          != FunctionProtoArg->getRefQualifier() ||
        FunctionProtoParam->isVariadic() != FunctionProtoArg->isVariadic())
      return Sema::TDK_NonDeducedMismatch;

    // Check return types.
    if (auto Result = DeduceTemplateArgumentsByTypeMatch(
            S, TemplateParams, FunctionProtoParam->getReturnType(),
            FunctionProtoArg->getReturnType(), Info, Deduced, 0))
      return Result;

    // Check parameter types.
    if (auto Result = DeduceTemplateArguments(
            S, TemplateParams, FunctionProtoParam->param_type_begin(),
            FunctionProtoParam->getNumParams(),
            FunctionProtoArg->param_type_begin(),
            FunctionProtoArg->getNumParams(), Info, Deduced, SubTDF))
      return Result;

    if (TDF & TDF_AllowCompatibleFunctionType)
      return Sema::TDK_Success;

    // FIXME: Per core-2016/10/1019 (no corresponding core issue yet), permit
    // deducing through the noexcept-specifier if it's part of the canonical
    // type. libstdc++ relies on this.
    Expr *NoexceptExpr = FunctionProtoParam->getNoexceptExpr();
    if (const NonTypeTemplateParmDecl *NTTP =
        NoexceptExpr ? getDeducedParameterFromExpr(Info, NoexceptExpr)
                     : nullptr) {
      assert(NTTP->getDepth() == Info.getDeducedDepth() &&((NTTP->getDepth() == Info.getDeducedDepth() && "saw non-type template parameter with wrong depth"
) ? static_cast<void> (0) : __assert_fail ("NTTP->getDepth() == Info.getDeducedDepth() && \"saw non-type template parameter with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1839, __PRETTY_FUNCTION__))
             "saw non-type template parameter with wrong depth")((NTTP->getDepth() == Info.getDeducedDepth() && "saw non-type template parameter with wrong depth"
) ? static_cast<void> (0) : __assert_fail ("NTTP->getDepth() == Info.getDeducedDepth() && \"saw non-type template parameter with wrong depth\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1839, __PRETTY_FUNCTION__));

      llvm::APSInt Noexcept(1);
      switch (FunctionProtoArg->canThrow()) {
      case CT_Cannot:
        Noexcept = 1;
        LLVM_FALLTHROUGH[[gnu::fallthrough]];

      case CT_Can:
        // We give E in noexcept(E) the "deduced from array bound" treatment.
        // FIXME: Should we?
        return DeduceNonTypeTemplateArgument(
            S, TemplateParams, NTTP, Noexcept, S.Context.BoolTy,
            /*ArrayBound*/true, Info, Deduced);

      case CT_Dependent:
        if (Expr *ArgNoexceptExpr = FunctionProtoArg->getNoexceptExpr())
          return DeduceNonTypeTemplateArgument(
              S, TemplateParams, NTTP, ArgNoexceptExpr, Info, Deduced);
        // Can't deduce anything from throw(T...).
        break;
      }
    }
    // FIXME: Detect non-deduced exception specification mismatches?
    //
    // Careful about [temp.deduct.call] and [temp.deduct.conv], which allow
    // top-level differences in noexcept-specifications.

    return Sema::TDK_Success;
  }

  case Type::InjectedClassName:
    // Treat a template's injected-class-name as if the template
    // specialization type had been used.
    Param = cast<InjectedClassNameType>(Param)
      ->getInjectedSpecializationType();
    assert(isa<TemplateSpecializationType>(Param) &&((isa<TemplateSpecializationType>(Param) && "injected class name is not a template specialization type"
) ? static_cast<void> (0) : __assert_fail ("isa<TemplateSpecializationType>(Param) && \"injected class name is not a template specialization type\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1876, __PRETTY_FUNCTION__))
           "injected class name is not a template specialization type")((isa<TemplateSpecializationType>(Param) && "injected class name is not a template specialization type"
) ? static_cast<void> (0) : __assert_fail ("isa<TemplateSpecializationType>(Param) && \"injected class name is not a template specialization type\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 1876, __PRETTY_FUNCTION__));
    LLVM_FALLTHROUGH[[gnu::fallthrough]];

  //     template-name<T> (where template-name refers to a class template)
  //     template-name<i>
  //     TT<T>
  //     TT<i>
  //     TT<>
  case Type::TemplateSpecialization: {
    const TemplateSpecializationType *SpecParam =
        cast<TemplateSpecializationType>(Param);

    // When Arg cannot be a derived class, we can just try to deduce template
    // arguments from the template-id.
    const RecordType *RecordT = Arg->getAs<RecordType>();
    if (!(TDF & TDF_DerivedClass) || !RecordT)
      return DeduceTemplateArguments(S, TemplateParams, SpecParam, Arg, Info,
                                     Deduced);

    SmallVector<DeducedTemplateArgument, 8> DeducedOrig(Deduced.begin(),
                                                        Deduced.end());

    Sema::TemplateDeductionResult Result = DeduceTemplateArguments(
        S, TemplateParams, SpecParam, Arg, Info, Deduced);

    if (Result == Sema::TDK_Success)
      return Result;

    // We cannot inspect base classes as part of deduction when the type
    // is incomplete, so either instantiate any templates necessary to
    // complete the type, or skip over it if it cannot be completed.
    if (!S.isCompleteType(Info.getLocation(), Arg))
      return Result;

    // Reset the incorrectly deduced argument from above.
    Deduced = DeducedOrig;

    // Check bases according to C++14 [temp.deduct.call] p4b3:
    Sema::TemplateDeductionResult BaseResult = DeduceTemplateBases(
        S, RecordT, TemplateParams, SpecParam, Info, Deduced);

    if (BaseResult != Sema::TDK_Invalid)
      return BaseResult;
    return Result;
  }

  //     T type::*
  //     T T::*
  //     T (type::*)()
  //     type (T::*)()
  //     type (type::*)(T)
  //     type (T::*)(T)
  //     T (type::*)(T)
  //     T (T::*)()
  //     T (T::*)(T)
  case Type::MemberPointer: {
    const MemberPointerType *MemPtrParam = cast<MemberPointerType>(Param);
    const MemberPointerType *MemPtrArg = dyn_cast<MemberPointerType>(Arg);
    if (!MemPtrArg)
      return Sema::TDK_NonDeducedMismatch;

    QualType ParamPointeeType = MemPtrParam->getPointeeType();
    if (ParamPointeeType->isFunctionType())
      S.adjustMemberFunctionCC(ParamPointeeType, /*IsStatic=*/true,
                               /*IsCtorOrDtor=*/false, Info.getLocation());
    QualType ArgPointeeType = MemPtrArg->getPointeeType();
    if (ArgPointeeType->isFunctionType())
      S.adjustMemberFunctionCC(ArgPointeeType, /*IsStatic=*/true,
                               /*IsCtorOrDtor=*/false, Info.getLocation());

    if (Sema::TemplateDeductionResult Result
          = DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                               ParamPointeeType,
                                               ArgPointeeType,
                                               Info, Deduced,
                                               TDF & TDF_IgnoreQualifiers))
      return Result;

    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                         QualType(MemPtrParam->getClass(), 0),
                                         QualType(MemPtrArg->getClass(), 0),
                                         Info, Deduced,
                                         TDF & TDF_IgnoreQualifiers);
  }

  //     (clang extension)
  //
  //     type(^)(T)
  //     T(^)()
  //     T(^)(T)
  case Type::BlockPointer: {
    const BlockPointerType *BlockPtrParam = cast<BlockPointerType>(Param);
    const BlockPointerType *BlockPtrArg = dyn_cast<BlockPointerType>(Arg);

    if (!BlockPtrArg)
      return Sema::TDK_NonDeducedMismatch;

    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                              BlockPtrParam->getPointeeType(),
                                              BlockPtrArg->getPointeeType(),
                                              Info, Deduced, 0);
  }

  //     (clang extension)
  //
  //     T __attribute__(((ext_vector_type(<integral constant>))))
  case Type::ExtVector: {
    const ExtVectorType *VectorParam = cast<ExtVectorType>(Param);
    if (const ExtVectorType *VectorArg = dyn_cast<ExtVectorType>(Arg)) {
      // Make sure that the vectors have the same number of elements.
      if (VectorParam->getNumElements() != VectorArg->getNumElements())
        return Sema::TDK_NonDeducedMismatch;

      // Perform deduction on the element types.
      return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                                VectorParam->getElementType(),
                                                VectorArg->getElementType(),
                                                Info, Deduced, TDF);
    }

    if (const DependentSizedExtVectorType *VectorArg
                              = dyn_cast<DependentSizedExtVectorType>(Arg)) {
      // We can't check the number of elements, since the argument has a
      // dependent number of elements. This can only occur during partial
      // ordering.

      // Perform deduction on the element types.
      return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                                VectorParam->getElementType(),
                                                VectorArg->getElementType(),
                                                Info, Deduced, TDF);
    }

    return Sema::TDK_NonDeducedMismatch;
  }

  case Type::DependentVector: {
    const auto *VectorParam = cast<DependentVectorType>(Param);

    if (const auto *VectorArg = dyn_cast<VectorType>(Arg)) {
      // Perform deduction on the element types.
      if (Sema::TemplateDeductionResult Result =
              DeduceTemplateArgumentsByTypeMatch(
                  S, TemplateParams, VectorParam->getElementType(),
                  VectorArg->getElementType(), Info, Deduced, TDF))
        return Result;

      // Perform deduction on the vector size, if we can.
      const NonTypeTemplateParmDecl *NTTP =
          getDeducedParameterFromExpr(Info, VectorParam->getSizeExpr());
      if (!NTTP)
        return Sema::TDK_Success;

      llvm::APSInt ArgSize(S.Context.getTypeSize(S.Context.IntTy), false);
      ArgSize = VectorArg->getNumElements();
      // Note that we use the "array bound" rules here; just like in that
      // case, we don't have any particular type for the vector size, but
      // we can provide one if necessary.
      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP, ArgSize,
                                           S.Context.UnsignedIntTy, true,
                                           Info, Deduced);
    }

    if (const auto *VectorArg = dyn_cast<DependentVectorType>(Arg)) {
      // Perform deduction on the element types.
      if (Sema::TemplateDeductionResult Result =
              DeduceTemplateArgumentsByTypeMatch(
                  S, TemplateParams, VectorParam->getElementType(),
                  VectorArg->getElementType(), Info, Deduced, TDF))
        return Result;

      // Perform deduction on the vector size, if we can.
      const NonTypeTemplateParmDecl *NTTP = getDeducedParameterFromExpr(
          Info, VectorParam->getSizeExpr());
      if (!NTTP)
        return Sema::TDK_Success;

      return DeduceNonTypeTemplateArgument(
          S, TemplateParams, NTTP, VectorArg->getSizeExpr(), Info, Deduced);
    }

    return Sema::TDK_NonDeducedMismatch;
  }

  //     (clang extension)
  //
  //     T __attribute__(((ext_vector_type(N))))
  case Type::DependentSizedExtVector: {
    const DependentSizedExtVectorType *VectorParam
      = cast<DependentSizedExtVectorType>(Param);

    if (const ExtVectorType *VectorArg = dyn_cast<ExtVectorType>(Arg)) {
      // Perform deduction on the element types.
      if (Sema::TemplateDeductionResult Result
            = DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                                VectorParam->getElementType(),
                                                 VectorArg->getElementType(),
                                                 Info, Deduced, TDF))
        return Result;

      // Perform deduction on the vector size, if we can.
      const NonTypeTemplateParmDecl *NTTP =
          getDeducedParameterFromExpr(Info, VectorParam->getSizeExpr());
      if (!NTTP)
        return Sema::TDK_Success;

      llvm::APSInt ArgSize(S.Context.getTypeSize(S.Context.IntTy), false);
      ArgSize = VectorArg->getNumElements();
      // Note that we use the "array bound" rules here; just like in that
      // case, we don't have any particular type for the vector size, but
      // we can provide one if necessary.
      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP, ArgSize,
                                           S.Context.IntTy, true, Info,
                                           Deduced);
    }

    if (const DependentSizedExtVectorType *VectorArg
                              = dyn_cast<DependentSizedExtVectorType>(Arg)) {
      // Perform deduction on the element types.
      if (Sema::TemplateDeductionResult Result
          = DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                               VectorParam->getElementType(),
                                               VectorArg->getElementType(),
                                               Info, Deduced, TDF))
        return Result;

      // Perform deduction on the vector size, if we can.
      const NonTypeTemplateParmDecl *NTTP =
          getDeducedParameterFromExpr(Info, VectorParam->getSizeExpr());
      if (!NTTP)
        return Sema::TDK_Success;

      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                           VectorArg->getSizeExpr(),
                                           Info, Deduced);
    }

    return Sema::TDK_NonDeducedMismatch;
  }

  //     (clang extension)
  //
  //     T __attribute__((matrix_type(<integral constant>,
  //                                  <integral constant>)))
  case Type::ConstantMatrix: {
    const ConstantMatrixType *MatrixArg = dyn_cast<ConstantMatrixType>(Arg);
    if (!MatrixArg)
      return Sema::TDK_NonDeducedMismatch;

    const ConstantMatrixType *MatrixParam = cast<ConstantMatrixType>(Param);
    // Check that the dimensions are the same
    if (MatrixParam->getNumRows() != MatrixArg->getNumRows() ||
        MatrixParam->getNumColumns() != MatrixArg->getNumColumns()) {
      return Sema::TDK_NonDeducedMismatch;
    }
    // Perform deduction on element types.
    return DeduceTemplateArgumentsByTypeMatch(
        S, TemplateParams, MatrixParam->getElementType(),
        MatrixArg->getElementType(), Info, Deduced, TDF);
  }

  case Type::DependentSizedMatrix: {
    const MatrixType *MatrixArg = dyn_cast<MatrixType>(Arg);
    if (!MatrixArg)
      return Sema::TDK_NonDeducedMismatch;

    // Check the element type of the matrixes.
    const DependentSizedMatrixType *MatrixParam =
        cast<DependentSizedMatrixType>(Param);
    if (Sema::TemplateDeductionResult Result =
            DeduceTemplateArgumentsByTypeMatch(
                S, TemplateParams, MatrixParam->getElementType(),
                MatrixArg->getElementType(), Info, Deduced, TDF))
      return Result;

    // Try to deduce a matrix dimension.
    auto DeduceMatrixArg =
        [&S, &Info, &Deduced, &TemplateParams](
            Expr *ParamExpr, const MatrixType *Arg,
            unsigned (ConstantMatrixType::*GetArgDimension)() const,
            Expr *(DependentSizedMatrixType::*GetArgDimensionExpr)() const) {
          const auto *ArgConstMatrix = dyn_cast<ConstantMatrixType>(Arg);
          const auto *ArgDepMatrix = dyn_cast<DependentSizedMatrixType>(Arg);
          if (!ParamExpr->isValueDependent()) {
            Optional<llvm::APSInt> ParamConst =
                ParamExpr->getIntegerConstantExpr(S.Context);
            if (!ParamConst)
              return Sema::TDK_NonDeducedMismatch;

            if (ArgConstMatrix) {
              if ((ArgConstMatrix->*GetArgDimension)() == *ParamConst)
                return Sema::TDK_Success;
              return Sema::TDK_NonDeducedMismatch;
            }

            Expr *ArgExpr = (ArgDepMatrix->*GetArgDimensionExpr)();
            if (!ArgExpr->isValueDependent())
              if (Optional<llvm::APSInt> ArgConst =
                      ArgExpr->getIntegerConstantExpr(S.Context))
                if (*ArgConst == *ParamConst)
                  return Sema::TDK_Success;
            return Sema::TDK_NonDeducedMismatch;
          }

          const NonTypeTemplateParmDecl *NTTP =
              getDeducedParameterFromExpr(Info, ParamExpr);
          if (!NTTP)
            return Sema::TDK_Success;

          if (ArgConstMatrix) {
            llvm::APSInt ArgConst(
                S.Context.getTypeSize(S.Context.getSizeType()));
            ArgConst = (ArgConstMatrix->*GetArgDimension)();
            return DeduceNonTypeTemplateArgument(
                S, TemplateParams, NTTP, ArgConst, S.Context.getSizeType(),
                /*ArrayBound=*/true, Info, Deduced);
          }

          return DeduceNonTypeTemplateArgument(
              S, TemplateParams, NTTP, (ArgDepMatrix->*GetArgDimensionExpr)(),
              Info, Deduced);
        };

    auto Result = DeduceMatrixArg(MatrixParam->getRowExpr(), MatrixArg,
                                  &ConstantMatrixType::getNumRows,
                                  &DependentSizedMatrixType::getRowExpr);
    if (Result)
      return Result;

    return DeduceMatrixArg(MatrixParam->getColumnExpr(), MatrixArg,
                           &ConstantMatrixType::getNumColumns,
                           &DependentSizedMatrixType::getColumnExpr);
  }

  //     (clang extension)
  //
  //     T __attribute__(((address_space(N))))
  case Type::DependentAddressSpace: {
    const DependentAddressSpaceType *AddressSpaceParam =
        cast<DependentAddressSpaceType>(Param);

    if (const DependentAddressSpaceType *AddressSpaceArg =
            dyn_cast<DependentAddressSpaceType>(Arg)) {
      // Perform deduction on the pointer type.
      if (Sema::TemplateDeductionResult Result =
              DeduceTemplateArgumentsByTypeMatch(
                  S, TemplateParams, AddressSpaceParam->getPointeeType(),
                  AddressSpaceArg->getPointeeType(), Info, Deduced, TDF))
        return Result;

      // Perform deduction on the address space, if we can.
      const NonTypeTemplateParmDecl *NTTP = getDeducedParameterFromExpr(
          Info, AddressSpaceParam->getAddrSpaceExpr());
      if (!NTTP)
        return Sema::TDK_Success;

      return DeduceNonTypeTemplateArgument(
          S, TemplateParams, NTTP, AddressSpaceArg->getAddrSpaceExpr(), Info,
          Deduced);
    }

    if (isTargetAddressSpace(Arg.getAddressSpace())) {
      llvm::APSInt ArgAddressSpace(S.Context.getTypeSize(S.Context.IntTy),
                                   false);
      ArgAddressSpace = toTargetAddressSpace(Arg.getAddressSpace());

      // Perform deduction on the pointer types.
      if (Sema::TemplateDeductionResult Result =
              DeduceTemplateArgumentsByTypeMatch(
                  S, TemplateParams, AddressSpaceParam->getPointeeType(),
                  S.Context.removeAddrSpaceQualType(Arg), Info, Deduced, TDF))
        return Result;

      // Perform deduction on the address space, if we can.
      const NonTypeTemplateParmDecl *NTTP = getDeducedParameterFromExpr(
          Info, AddressSpaceParam->getAddrSpaceExpr());
      if (!NTTP)
        return Sema::TDK_Success;

      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                           ArgAddressSpace, S.Context.IntTy,
                                           true, Info, Deduced);
    }

    return Sema::TDK_NonDeducedMismatch;
  }
  case Type::DependentExtInt: {
    const auto *IntParam = cast<DependentExtIntType>(Param);

    if (const auto *IntArg = dyn_cast<ExtIntType>(Arg)){
      if (IntParam->isUnsigned() != IntArg->isUnsigned())
        return Sema::TDK_NonDeducedMismatch;

      const NonTypeTemplateParmDecl *NTTP =
          getDeducedParameterFromExpr(Info, IntParam->getNumBitsExpr());
      if (!NTTP)
        return Sema::TDK_Success;

      llvm::APSInt ArgSize(S.Context.getTypeSize(S.Context.IntTy), false);
      ArgSize = IntArg->getNumBits();

      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP, ArgSize,
                                           S.Context.IntTy, true, Info,
                                           Deduced);
    }

    if (const auto *IntArg = dyn_cast<DependentExtIntType>(Arg)) {
      if (IntParam->isUnsigned() != IntArg->isUnsigned())
        return Sema::TDK_NonDeducedMismatch;
      return Sema::TDK_Success;
    }
    return Sema::TDK_NonDeducedMismatch;
  }

  case Type::TypeOfExpr:
  case Type::TypeOf:
  case Type::DependentName:
  case Type::UnresolvedUsing:
  case Type::Decltype:
  case Type::UnaryTransform:
  case Type::Auto:
  case Type::DeducedTemplateSpecialization:
  case Type::DependentTemplateSpecialization:
  case Type::PackExpansion:
  case Type::Pipe:
    // No template argument deduction for these types
    return Sema::TDK_Success;
}

llvm_unreachable("Invalid Type Class!")::llvm::llvm_unreachable_internal("Invalid Type Class!", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2305);
2306}

2308static Sema::TemplateDeductionResult
2309DeduceTemplateArguments(Sema &S,
                      TemplateParameterList *TemplateParams,
                      const TemplateArgument &Param,
                      TemplateArgument Arg,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
// If the template argument is a pack expansion, perform template argument
// deduction against the pattern of that expansion. This only occurs during
// partial ordering.
if (Arg.isPackExpansion())
  Arg = Arg.getPackExpansionPattern();

switch (Param.getKind()) {
case TemplateArgument::Null:
  llvm_unreachable("Null template argument in parameter list")::llvm::llvm_unreachable_internal("Null template argument in parameter list"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2323);

case TemplateArgument::Type:
  if (Arg.getKind() == TemplateArgument::Type)
    return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                              Param.getAsType(),
                                              Arg.getAsType(),
                                              Info, Deduced, 0);
  Info.FirstArg = Param;
  Info.SecondArg = Arg;
  return Sema::TDK_NonDeducedMismatch;

case TemplateArgument::Template:
  if (Arg.getKind() == TemplateArgument::Template)
    return DeduceTemplateArguments(S, TemplateParams,
                                   Param.getAsTemplate(),
                                   Arg.getAsTemplate(), Info, Deduced);
  Info.FirstArg = Param;
  Info.SecondArg = Arg;
  return Sema::TDK_NonDeducedMismatch;

case TemplateArgument::TemplateExpansion:
  llvm_unreachable("caller should handle pack expansions")::llvm::llvm_unreachable_internal("caller should handle pack expansions"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2345);

case TemplateArgument::Declaration:
  if (Arg.getKind() == TemplateArgument::Declaration &&
      isSameDeclaration(Param.getAsDecl(), Arg.getAsDecl()))
    return Sema::TDK_Success;

  Info.FirstArg = Param;
  Info.SecondArg = Arg;
  return Sema::TDK_NonDeducedMismatch;

case TemplateArgument::NullPtr:
  if (Arg.getKind() == TemplateArgument::NullPtr &&
      S.Context.hasSameType(Param.getNullPtrType(), Arg.getNullPtrType()))
    return Sema::TDK_Success;

  Info.FirstArg = Param;
  Info.SecondArg = Arg;
  return Sema::TDK_NonDeducedMismatch;

case TemplateArgument::Integral:
  if (Arg.getKind() == TemplateArgument::Integral) {
    if (hasSameExtendedValue(Param.getAsIntegral(), Arg.getAsIntegral()))
      return Sema::TDK_Success;

    Info.FirstArg = Param;
    Info.SecondArg = Arg;
    return Sema::TDK_NonDeducedMismatch;
  }

  if (Arg.getKind() == TemplateArgument::Expression) {
    Info.FirstArg = Param;
    Info.SecondArg = Arg;
    return Sema::TDK_NonDeducedMismatch;
  }

  Info.FirstArg = Param;
  Info.SecondArg = Arg;
  return Sema::TDK_NonDeducedMismatch;

case TemplateArgument::Expression:
  if (const NonTypeTemplateParmDecl *NTTP =
          getDeducedParameterFromExpr(Info, Param.getAsExpr())) {
    if (Arg.getKind() == TemplateArgument::Integral)
      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                           Arg.getAsIntegral(),
                                           Arg.getIntegralType(),
                                           /*ArrayBound=*/false,
                                           Info, Deduced);
    if (Arg.getKind() == TemplateArgument::NullPtr)
      return DeduceNullPtrTemplateArgument(S, TemplateParams, NTTP,
                                           Arg.getNullPtrType(),
                                           Info, Deduced);
    if (Arg.getKind() == TemplateArgument::Expression)
      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                           Arg.getAsExpr(), Info, Deduced);
    if (Arg.getKind() == TemplateArgument::Declaration)
      return DeduceNonTypeTemplateArgument(S, TemplateParams, NTTP,
                                           Arg.getAsDecl(),
                                           Arg.getParamTypeForDecl(),
                                           Info, Deduced);

    Info.FirstArg = Param;
    Info.SecondArg = Arg;
    return Sema::TDK_NonDeducedMismatch;
  }

  // Can't deduce anything, but that's okay.
  return Sema::TDK_Success;

case TemplateArgument::Pack:
  llvm_unreachable("Argument packs should be expanded by the caller!")::llvm::llvm_unreachable_internal("Argument packs should be expanded by the caller!"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2416);
}

llvm_unreachable("Invalid TemplateArgument Kind!")::llvm::llvm_unreachable_internal("Invalid TemplateArgument Kind!"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2419);
2420}

2422/// Determine whether there is a template argument to be used for
2423/// deduction.
2424///
2425/// This routine "expands" argument packs in-place, overriding its input
2426/// parameters so that \c Args[ArgIdx] will be the available template argument.
2427///
2428/// \returns true if there is another template argument (which will be at
2429/// \c Args[ArgIdx]), false otherwise.
2430static bool hasTemplateArgumentForDeduction(ArrayRef<TemplateArgument> &Args,
                                          unsigned &ArgIdx) {
if (ArgIdx == Args.size())
  return false;

const TemplateArgument &Arg = Args[ArgIdx];
if (Arg.getKind() != TemplateArgument::Pack)
  return true;

assert(ArgIdx == Args.size() - 1 && "Pack not at the end of argument list?")((ArgIdx == Args.size() - 1 && "Pack not at the end of argument list?"
) ? static_cast<void> (0) : __assert_fail ("ArgIdx == Args.size() - 1 && \"Pack not at the end of argument list?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2439, __PRETTY_FUNCTION__));
Args = Arg.pack_elements();
ArgIdx = 0;
return ArgIdx < Args.size();
2443}

2445/// Determine whether the given set of template arguments has a pack
2446/// expansion that is not the last template argument.
2447static bool hasPackExpansionBeforeEnd(ArrayRef<TemplateArgument> Args) {
bool FoundPackExpansion = false;
for (const auto &A : Args) {
  if (FoundPackExpansion)
    return true;

  if (A.getKind() == TemplateArgument::Pack)
    return hasPackExpansionBeforeEnd(A.pack_elements());

  // FIXME: If this is a fixed-arity pack expansion from an outer level of
  // templates, it should not be treated as a pack expansion.
  if (A.isPackExpansion())
    FoundPackExpansion = true;
}

return false;
2463}

2465static Sema::TemplateDeductionResult
2466DeduceTemplateArguments(Sema &S, TemplateParameterList *TemplateParams,
                      ArrayRef<TemplateArgument> Params,
                      ArrayRef<TemplateArgument> Args,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced,
                      bool NumberOfArgumentsMustMatch) {
// C++0x [temp.deduct.type]p9:
//   If the template argument list of P contains a pack expansion that is not
//   the last template argument, the entire template argument list is a
//   non-deduced context.
if (hasPackExpansionBeforeEnd(Params))
  return Sema::TDK_Success;

// C++0x [temp.deduct.type]p9:
//   If P has a form that contains <T> or <i>, then each argument Pi of the
//   respective template argument list P is compared with the corresponding
//   argument Ai of the corresponding template argument list of A.
unsigned ArgIdx = 0, ParamIdx = 0;
for (; hasTemplateArgumentForDeduction(Params, ParamIdx); ++ParamIdx) {
  if (!Params[ParamIdx].isPackExpansion()) {
    // The simple case: deduce template arguments by matching Pi and Ai.

    // Check whether we have enough arguments.
    if (!hasTemplateArgumentForDeduction(Args, ArgIdx))
      return NumberOfArgumentsMustMatch
                 ? Sema::TDK_MiscellaneousDeductionFailure
                 : Sema::TDK_Success;

    // C++1z [temp.deduct.type]p9:
    //   During partial ordering, if Ai was originally a pack expansion [and]
    //   Pi is not a pack expansion, template argument deduction fails.
    if (Args[ArgIdx].isPackExpansion())
      return Sema::TDK_MiscellaneousDeductionFailure;

    // Perform deduction for this Pi/Ai pair.
    if (Sema::TemplateDeductionResult Result
          = DeduceTemplateArguments(S, TemplateParams,
                                    Params[ParamIdx], Args[ArgIdx],
                                    Info, Deduced))
      return Result;

    // Move to the next argument.
    ++ArgIdx;
    continue;
  }

  // The parameter is a pack expansion.

  // C++0x [temp.deduct.type]p9:
  //   If Pi is a pack expansion, then the pattern of Pi is compared with
  //   each remaining argument in the template argument list of A. Each
  //   comparison deduces template arguments for subsequent positions in the
  //   template parameter packs expanded by Pi.
  TemplateArgument Pattern = Params[ParamIdx].getPackExpansionPattern();

  // Prepare to deduce the packs within the pattern.
  PackDeductionScope PackScope(S, TemplateParams, Deduced, Info, Pattern);

  // Keep track of the deduced template arguments for each parameter pack
  // expanded by this pack expansion (the outer index) and for each
  // template argument (the inner SmallVectors).
  for (; hasTemplateArgumentForDeduction(Args, ArgIdx) &&
         PackScope.hasNextElement();
       ++ArgIdx) {
    // Deduce template arguments from the pattern.
    if (Sema::TemplateDeductionResult Result
          = DeduceTemplateArguments(S, TemplateParams, Pattern, Args[ArgIdx],
                                    Info, Deduced))
      return Result;

    PackScope.nextPackElement();
  }

  // Build argument packs for each of the parameter packs expanded by this
  // pack expansion.
  if (auto Result = PackScope.finish())
    return Result;
}

return Sema::TDK_Success;
2546}

2548static Sema::TemplateDeductionResult
2549DeduceTemplateArguments(Sema &S,
                      TemplateParameterList *TemplateParams,
                      const TemplateArgumentList &ParamList,
                      const TemplateArgumentList &ArgList,
                      TemplateDeductionInfo &Info,
                      SmallVectorImpl<DeducedTemplateArgument> &Deduced) {
return DeduceTemplateArguments(S, TemplateParams, ParamList.asArray(),
                               ArgList.asArray(), Info, Deduced,
                               /*NumberOfArgumentsMustMatch*/false);
2558}

2560/// Determine whether two template arguments are the same.
2561static bool isSameTemplateArg(ASTContext &Context,
                            TemplateArgument X,
                            const TemplateArgument &Y,
                            bool PackExpansionMatchesPack = false) {
// If we're checking deduced arguments (X) against original arguments (Y),
// we will have flattened packs to non-expansions in X.
if (PackExpansionMatchesPack && X.isPackExpansion() && !Y.isPackExpansion())
  X = X.getPackExpansionPattern();

if (X.getKind() != Y.getKind())
  return false;

switch (X.getKind()) {
  case TemplateArgument::Null:
    llvm_unreachable("Comparing NULL template argument")::llvm::llvm_unreachable_internal("Comparing NULL template argument"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2575);

  case TemplateArgument::Type:
    return Context.getCanonicalType(X.getAsType()) ==
           Context.getCanonicalType(Y.getAsType());

  case TemplateArgument::Declaration:
    return isSameDeclaration(X.getAsDecl(), Y.getAsDecl());

  case TemplateArgument::NullPtr:
    return Context.hasSameType(X.getNullPtrType(), Y.getNullPtrType());

  case TemplateArgument::Template:
  case TemplateArgument::TemplateExpansion:
    return Context.getCanonicalTemplateName(
                  X.getAsTemplateOrTemplatePattern()).getAsVoidPointer() ==
           Context.getCanonicalTemplateName(
                  Y.getAsTemplateOrTemplatePattern()).getAsVoidPointer();

  case TemplateArgument::Integral:
    return hasSameExtendedValue(X.getAsIntegral(), Y.getAsIntegral());

  case TemplateArgument::Expression: {
    llvm::FoldingSetNodeID XID, YID;
    X.getAsExpr()->Profile(XID, Context, true);
    Y.getAsExpr()->Profile(YID, Context, true);
    return XID == YID;
  }

  case TemplateArgument::Pack:
    if (X.pack_size() != Y.pack_size())
      return false;

    for (TemplateArgument::pack_iterator XP = X.pack_begin(),
                                      XPEnd = X.pack_end(),
                                         YP = Y.pack_begin();
         XP != XPEnd; ++XP, ++YP)
      if (!isSameTemplateArg(Context, *XP, *YP, PackExpansionMatchesPack))
        return false;

    return true;
}

llvm_unreachable("Invalid TemplateArgument Kind!")::llvm::llvm_unreachable_internal("Invalid TemplateArgument Kind!"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2618);
2619}

2621/// Allocate a TemplateArgumentLoc where all locations have
2622/// been initialized to the given location.
2623///
2624/// \param Arg The template argument we are producing template argument
2625/// location information for.
2626///
2627/// \param NTTPType For a declaration template argument, the type of
2628/// the non-type template parameter that corresponds to this template
2629/// argument. Can be null if no type sugar is available to add to the
2630/// type from the template argument.
2631///
2632/// \param Loc The source location to use for the resulting template
2633/// argument.
2634TemplateArgumentLoc
2635Sema::getTrivialTemplateArgumentLoc(const TemplateArgument &Arg,
                                  QualType NTTPType, SourceLocation Loc) {
switch (Arg.getKind()) {
case TemplateArgument::Null:
  llvm_unreachable("Can't get a NULL template argument here")::llvm::llvm_unreachable_internal("Can't get a NULL template argument here"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2639);

case TemplateArgument::Type:
  return TemplateArgumentLoc(
      Arg, Context.getTrivialTypeSourceInfo(Arg.getAsType(), Loc));

case TemplateArgument::Declaration: {
  if (NTTPType.isNull())
    NTTPType = Arg.getParamTypeForDecl();
  Expr *E = BuildExpressionFromDeclTemplateArgument(Arg, NTTPType, Loc)
                .getAs<Expr>();
  return TemplateArgumentLoc(TemplateArgument(E), E);
}

case TemplateArgument::NullPtr: {
  if (NTTPType.isNull())
    NTTPType = Arg.getNullPtrType();
  Expr *E = BuildExpressionFromDeclTemplateArgument(Arg, NTTPType, Loc)
                .getAs<Expr>();
  return TemplateArgumentLoc(TemplateArgument(NTTPType, /*isNullPtr*/true),
                             E);
}

case TemplateArgument::Integral: {
  Expr *E =
      BuildExpressionFromIntegralTemplateArgument(Arg, Loc).getAs<Expr>();
  return TemplateArgumentLoc(TemplateArgument(E), E);
}

  case TemplateArgument::Template:
  case TemplateArgument::TemplateExpansion: {
    NestedNameSpecifierLocBuilder Builder;
    TemplateName Template = Arg.getAsTemplateOrTemplatePattern();
    if (DependentTemplateName *DTN = Template.getAsDependentTemplateName())
      Builder.MakeTrivial(Context, DTN->getQualifier(), Loc);
    else if (QualifiedTemplateName *QTN =
                 Template.getAsQualifiedTemplateName())
      Builder.MakeTrivial(Context, QTN->getQualifier(), Loc);

    if (Arg.getKind() == TemplateArgument::Template)
      return TemplateArgumentLoc(Context, Arg,
                                 Builder.getWithLocInContext(Context), Loc);

    return TemplateArgumentLoc(
        Context, Arg, Builder.getWithLocInContext(Context), Loc, Loc);
  }

case TemplateArgument::Expression:
  return TemplateArgumentLoc(Arg, Arg.getAsExpr());

case TemplateArgument::Pack:
  return TemplateArgumentLoc(Arg, TemplateArgumentLocInfo());
}

llvm_unreachable("Invalid TemplateArgument Kind!")::llvm::llvm_unreachable_internal("Invalid TemplateArgument Kind!"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2693);
2694}

2696TemplateArgumentLoc
2697Sema::getIdentityTemplateArgumentLoc(NamedDecl *TemplateParm,
                                   SourceLocation Location) {
return getTrivialTemplateArgumentLoc(
    Context.getInjectedTemplateArg(TemplateParm), QualType(), Location);
2701}

2703/// Convert the given deduced template argument and add it to the set of
2704/// fully-converted template arguments.
2705static bool
2706ConvertDeducedTemplateArgument(Sema &S, NamedDecl *Param,
                             DeducedTemplateArgument Arg,
                             NamedDecl *Template,
                             TemplateDeductionInfo &Info,
                             bool IsDeduced,
                             SmallVectorImpl<TemplateArgument> &Output) {
auto ConvertArg = [&](DeducedTemplateArgument Arg,
                      unsigned ArgumentPackIndex) {
  // Convert the deduced template argument into a template
  // argument that we can check, almost as if the user had written
  // the template argument explicitly.
  TemplateArgumentLoc ArgLoc =
      S.getTrivialTemplateArgumentLoc(Arg, QualType(), Info.getLocation());

  // Check the template argument, converting it as necessary.
  return S.CheckTemplateArgument(
      Param, ArgLoc, Template, Template->getLocation(),
      Template->getSourceRange().getEnd(), ArgumentPackIndex, Output,
      IsDeduced
          ? (Arg.wasDeducedFromArrayBound() ? Sema::CTAK_DeducedFromArrayBound
                                            : Sema::CTAK_Deduced)
          : Sema::CTAK_Specified);
};

if (Arg.getKind() == TemplateArgument::Pack) {
  // This is a template argument pack, so check each of its arguments against
  // the template parameter.
  SmallVector<TemplateArgument, 2> PackedArgsBuilder;
  for (const auto &P : Arg.pack_elements()) {
    // When converting the deduced template argument, append it to the
    // general output list. We need to do this so that the template argument
    // checking logic has all of the prior template arguments available.
    DeducedTemplateArgument InnerArg(P);
    InnerArg.setDeducedFromArrayBound(Arg.wasDeducedFromArrayBound());
    assert(InnerArg.getKind() != TemplateArgument::Pack &&((InnerArg.getKind() != TemplateArgument::Pack && "deduced nested pack"
) ? static_cast<void> (0) : __assert_fail ("InnerArg.getKind() != TemplateArgument::Pack && \"deduced nested pack\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2741, __PRETTY_FUNCTION__))
           "deduced nested pack")((InnerArg.getKind() != TemplateArgument::Pack && "deduced nested pack"
) ? static_cast<void> (0) : __assert_fail ("InnerArg.getKind() != TemplateArgument::Pack && \"deduced nested pack\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2741, __PRETTY_FUNCTION__));
    if (P.isNull()) {
      // We deduced arguments for some elements of this pack, but not for
      // all of them. This happens if we get a conditionally-non-deduced
      // context in a pack expansion (such as an overload set in one of the
      // arguments).
      S.Diag(Param->getLocation(),
             diag::err_template_arg_deduced_incomplete_pack)
        << Arg << Param;
      return true;
    }
    if (ConvertArg(InnerArg, PackedArgsBuilder.size()))
      return true;

    // Move the converted template argument into our argument pack.
    PackedArgsBuilder.push_back(Output.pop_back_val());
  }

  // If the pack is empty, we still need to substitute into the parameter
  // itself, in case that substitution fails.
  if (PackedArgsBuilder.empty()) {
    LocalInstantiationScope Scope(S);
    TemplateArgumentList TemplateArgs(TemplateArgumentList::OnStack, Output);
    MultiLevelTemplateArgumentList Args(TemplateArgs);

    if (auto *NTTP = dyn_cast<NonTypeTemplateParmDecl>(Param)) {
      Sema::InstantiatingTemplate Inst(S, Template->getLocation(), Template,
                                       NTTP, Output,
                                       Template->getSourceRange());
      if (Inst.isInvalid() ||
          S.SubstType(NTTP->getType(), Args, NTTP->getLocation(),
                      NTTP->getDeclName()).isNull())
        return true;
    } else if (auto *TTP = dyn_cast<TemplateTemplateParmDecl>(Param)) {
      Sema::InstantiatingTemplate Inst(S, Template->getLocation(), Template,
                                       TTP, Output,
                                       Template->getSourceRange());
      if (Inst.isInvalid() || !S.SubstDecl(TTP, S.CurContext, Args))
        return true;
    }
    // For type parameters, no substitution is ever required.
  }

  // Create the resulting argument pack.
  Output.push_back(
      TemplateArgument::CreatePackCopy(S.Context, PackedArgsBuilder));
  return false;
}

return ConvertArg(Arg, 0);
2791}

2793// FIXME: This should not be a template, but
2794// ClassTemplatePartialSpecializationDecl sadly does not derive from
2795// TemplateDecl.
2796template<typename TemplateDeclT>
2797static Sema::TemplateDeductionResult ConvertDeducedTemplateArguments(
  Sema &S, TemplateDeclT *Template, bool IsDeduced,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced,
  TemplateDeductionInfo &Info, SmallVectorImpl<TemplateArgument> &Builder,
  LocalInstantiationScope *CurrentInstantiationScope = nullptr,
  unsigned NumAlreadyConverted = 0, bool PartialOverloading = false) {
TemplateParameterList *TemplateParams = Template->getTemplateParameters();

for (unsigned I = 0, N = TemplateParams->size(); I != N; ++I) {
  NamedDecl *Param = TemplateParams->getParam(I);

  // C++0x [temp.arg.explicit]p3:
  //    A trailing template parameter pack (14.5.3) not otherwise deduced will
  //    be deduced to an empty sequence of template arguments.
  // FIXME: Where did the word "trailing" come from?
  if (Deduced[I].isNull() && Param->isTemplateParameterPack()) {
    if (auto Result =
            PackDeductionScope(S, TemplateParams, Deduced, Info, I).finish())
      return Result;
  }

  if (!Deduced[I].isNull()) {
    if (I < NumAlreadyConverted) {
      // We may have had explicitly-specified template arguments for a
      // template parameter pack (that may or may not have been extended
      // via additional deduced arguments).
      if (Param->isParameterPack() && CurrentInstantiationScope &&
          CurrentInstantiationScope->getPartiallySubstitutedPack() == Param) {
        // Forget the partially-substituted pack; its substitution is now
        // complete.
        CurrentInstantiationScope->ResetPartiallySubstitutedPack();
        // We still need to check the argument in case it was extended by
        // deduction.
      } else {
        // We have already fully type-checked and converted this
        // argument, because it was explicitly-specified. Just record the
        // presence of this argument.
        Builder.push_back(Deduced[I]);
        continue;
      }
    }

    // We may have deduced this argument, so it still needs to be
    // checked and converted.
    if (ConvertDeducedTemplateArgument(S, Param, Deduced[I], Template, Info,
                                       IsDeduced, Builder)) {
      Info.Param = makeTemplateParameter(Param);
      // FIXME: These template arguments are temporary. Free them!
      Info.reset(TemplateArgumentList::CreateCopy(S.Context, Builder));
      return Sema::TDK_SubstitutionFailure;
    }

    continue;
  }

  // Substitute into the default template argument, if available.
  bool HasDefaultArg = false;
  TemplateDecl *TD = dyn_cast<TemplateDecl>(Template);
  if (!TD) {
    assert(isa<ClassTemplatePartialSpecializationDecl>(Template) ||((isa<ClassTemplatePartialSpecializationDecl>(Template)
 || isa<VarTemplatePartialSpecializationDecl>(Template)
) ? static_cast<void> (0) : __assert_fail ("isa<ClassTemplatePartialSpecializationDecl>(Template) || isa<VarTemplatePartialSpecializationDecl>(Template)"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2857, __PRETTY_FUNCTION__))
           isa<VarTemplatePartialSpecializationDecl>(Template))((isa<ClassTemplatePartialSpecializationDecl>(Template)
 || isa<VarTemplatePartialSpecializationDecl>(Template)
) ? static_cast<void> (0) : __assert_fail ("isa<ClassTemplatePartialSpecializationDecl>(Template) || isa<VarTemplatePartialSpecializationDecl>(Template)"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 2857, __PRETTY_FUNCTION__));
    return Sema::TDK_Incomplete;
  }

  TemplateArgumentLoc DefArg = S.SubstDefaultTemplateArgumentIfAvailable(
      TD, TD->getLocation(), TD->getSourceRange().getEnd(), Param, Builder,
      HasDefaultArg);

  // If there was no default argument, deduction is incomplete.
  if (DefArg.getArgument().isNull()) {
    Info.Param = makeTemplateParameter(
        const_cast<NamedDecl *>(TemplateParams->getParam(I)));
    Info.reset(TemplateArgumentList::CreateCopy(S.Context, Builder));
    if (PartialOverloading) break;

    return HasDefaultArg ? Sema::TDK_SubstitutionFailure
                         : Sema::TDK_Incomplete;
  }

  // Check whether we can actually use the default argument.
  if (S.CheckTemplateArgument(Param, DefArg, TD, TD->getLocation(),
                              TD->getSourceRange().getEnd(), 0, Builder,
                              Sema::CTAK_Specified)) {
    Info.Param = makeTemplateParameter(
                       const_cast<NamedDecl *>(TemplateParams->getParam(I)));
    // FIXME: These template arguments are temporary. Free them!
    Info.reset(TemplateArgumentList::CreateCopy(S.Context, Builder));
    return Sema::TDK_SubstitutionFailure;
  }

  // If we get here, we successfully used the default template argument.
}

return Sema::TDK_Success;
2891}

2893static DeclContext *getAsDeclContextOrEnclosing(Decl *D) {
if (auto *DC = dyn_cast<DeclContext>(D))
  return DC;
return D->getDeclContext();
2897}

2899template<typename T> struct IsPartialSpecialization {
static constexpr bool value = false;
2901};
2902template<>
2903struct IsPartialSpecialization<ClassTemplatePartialSpecializationDecl> {
static constexpr bool value = true;
2905};
2906template<>
2907struct IsPartialSpecialization<VarTemplatePartialSpecializationDecl> {
static constexpr bool value = true;
2909};

2911template<typename TemplateDeclT>
2912static Sema::TemplateDeductionResult
2913CheckDeducedArgumentConstraints(Sema& S, TemplateDeclT *Template,
                              ArrayRef<TemplateArgument> DeducedArgs,
                              TemplateDeductionInfo& Info) {
llvm::SmallVector<const Expr *, 3> AssociatedConstraints;
Template->getAssociatedConstraints(AssociatedConstraints);
if (S.CheckConstraintSatisfaction(Template, AssociatedConstraints,
                                  DeducedArgs, Info.getLocation(),
                                  Info.AssociatedConstraintsSatisfaction) ||
    !Info.AssociatedConstraintsSatisfaction.IsSatisfied) {
  Info.reset(TemplateArgumentList::CreateCopy(S.Context, DeducedArgs));
  return Sema::TDK_ConstraintsNotSatisfied;
}
return Sema::TDK_Success;
2926}

2928/// Complete template argument deduction for a partial specialization.
2929template <typename T>
2930static std::enable_if_t<IsPartialSpecialization<T>::value,
                      Sema::TemplateDeductionResult>
2932FinishTemplateArgumentDeduction(
  Sema &S, T *Partial, bool IsPartialOrdering,
  const TemplateArgumentList &TemplateArgs,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced,
  TemplateDeductionInfo &Info) {
// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    S, Sema::ExpressionEvaluationContext::Unevaluated);
Sema::SFINAETrap Trap(S);

Sema::ContextRAII SavedContext(S, getAsDeclContextOrEnclosing(Partial));

// C++ [temp.deduct.type]p2:
//   [...] or if any template argument remains neither deduced nor
//   explicitly specified, template argument deduction fails.
SmallVector<TemplateArgument, 4> Builder;
if (auto Result = ConvertDeducedTemplateArguments(
        S, Partial, IsPartialOrdering, Deduced, Info, Builder))
  return Result;

// Form the template argument list from the deduced template arguments.
TemplateArgumentList *DeducedArgumentList
  = TemplateArgumentList::CreateCopy(S.Context, Builder);

Info.reset(DeducedArgumentList);

// Substitute the deduced template arguments into the template
// arguments of the class template partial specialization, and
// verify that the instantiated template arguments are both valid
// and are equivalent to the template arguments originally provided
// to the class template.
LocalInstantiationScope InstScope(S);
auto *Template = Partial->getSpecializedTemplate();
const ASTTemplateArgumentListInfo *PartialTemplArgInfo =
    Partial->getTemplateArgsAsWritten();
const TemplateArgumentLoc *PartialTemplateArgs =
    PartialTemplArgInfo->getTemplateArgs();

TemplateArgumentListInfo InstArgs(PartialTemplArgInfo->LAngleLoc,
                                  PartialTemplArgInfo->RAngleLoc);

if (S.Subst(PartialTemplateArgs, PartialTemplArgInfo->NumTemplateArgs,
            InstArgs, MultiLevelTemplateArgumentList(*DeducedArgumentList))) {
  unsigned ArgIdx = InstArgs.size(), ParamIdx = ArgIdx;
  if (ParamIdx >= Partial->getTemplateParameters()->size())
    ParamIdx = Partial->getTemplateParameters()->size() - 1;

  Decl *Param = const_cast<NamedDecl *>(
      Partial->getTemplateParameters()->getParam(ParamIdx));
  Info.Param = makeTemplateParameter(Param);
  Info.FirstArg = PartialTemplateArgs[ArgIdx].getArgument();
  return Sema::TDK_SubstitutionFailure;
}

bool ConstraintsNotSatisfied;
SmallVector<TemplateArgument, 4> ConvertedInstArgs;
if (S.CheckTemplateArgumentList(Template, Partial->getLocation(), InstArgs,
                                false, ConvertedInstArgs,
                                /*UpdateArgsWithConversions=*/true,
                                &ConstraintsNotSatisfied))
  return ConstraintsNotSatisfied ? Sema::TDK_ConstraintsNotSatisfied :
                                   Sema::TDK_SubstitutionFailure;

TemplateParameterList *TemplateParams = Template->getTemplateParameters();
for (unsigned I = 0, E = TemplateParams->size(); I != E; ++I) {
  TemplateArgument InstArg = ConvertedInstArgs.data()[I];
  if (!isSameTemplateArg(S.Context, TemplateArgs[I], InstArg)) {
    Info.Param = makeTemplateParameter(TemplateParams->getParam(I));
    Info.FirstArg = TemplateArgs[I];
    Info.SecondArg = InstArg;
    return Sema::TDK_NonDeducedMismatch;
  }
}

if (Trap.hasErrorOccurred())
  return Sema::TDK_SubstitutionFailure;

if (auto Result = CheckDeducedArgumentConstraints(S, Partial, Builder, Info))
  return Result;

return Sema::TDK_Success;
3013}

3015/// Complete template argument deduction for a class or variable template,
3016/// when partial ordering against a partial specialization.
3017// FIXME: Factor out duplication with partial specialization version above.
3018static Sema::TemplateDeductionResult FinishTemplateArgumentDeduction(
  Sema &S, TemplateDecl *Template, bool PartialOrdering,
  const TemplateArgumentList &TemplateArgs,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced,
  TemplateDeductionInfo &Info) {
// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    S, Sema::ExpressionEvaluationContext::Unevaluated);
Sema::SFINAETrap Trap(S);

Sema::ContextRAII SavedContext(S, getAsDeclContextOrEnclosing(Template));

// C++ [temp.deduct.type]p2:
//   [...] or if any template argument remains neither deduced nor
//   explicitly specified, template argument deduction fails.
SmallVector<TemplateArgument, 4> Builder;
if (auto Result = ConvertDeducedTemplateArguments(
        S, Template, /*IsDeduced*/PartialOrdering, Deduced, Info, Builder))
  return Result;

// Check that we produced the correct argument list.
TemplateParameterList *TemplateParams = Template->getTemplateParameters();
for (unsigned I = 0, E = TemplateParams->size(); I != E; ++I) {
  TemplateArgument InstArg = Builder[I];
  if (!isSameTemplateArg(S.Context, TemplateArgs[I], InstArg,
                         /*PackExpansionMatchesPack*/true)) {
    Info.Param = makeTemplateParameter(TemplateParams->getParam(I));
    Info.FirstArg = TemplateArgs[I];
    Info.SecondArg = InstArg;
    return Sema::TDK_NonDeducedMismatch;
  }
}

if (Trap.hasErrorOccurred())
  return Sema::TDK_SubstitutionFailure;

if (auto Result = CheckDeducedArgumentConstraints(S, Template, Builder,
                                                  Info))
  return Result;

return Sema::TDK_Success;
3059}

3061/// Perform template argument deduction to determine whether
3062/// the given template arguments match the given class template
3063/// partial specialization per C++ [temp.class.spec.match].
3064Sema::TemplateDeductionResult
3065Sema::DeduceTemplateArguments(ClassTemplatePartialSpecializationDecl *Partial,
                            const TemplateArgumentList &TemplateArgs,
                            TemplateDeductionInfo &Info) {
if (Partial->isInvalidDecl())
  return TDK_Invalid;

// C++ [temp.class.spec.match]p2:
//   A partial specialization matches a given actual template
//   argument list if the template arguments of the partial
//   specialization can be deduced from the actual template argument
//   list (14.8.2).

// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    *this, Sema::ExpressionEvaluationContext::Unevaluated);
SFINAETrap Trap(*this);

SmallVector<DeducedTemplateArgument, 4> Deduced;
Deduced.resize(Partial->getTemplateParameters()->size());
if (TemplateDeductionResult Result
      = ::DeduceTemplateArguments(*this,
                                  Partial->getTemplateParameters(),
                                  Partial->getTemplateArgs(),
                                  TemplateArgs, Info, Deduced))
  return Result;

SmallVector<TemplateArgument, 4> DeducedArgs(Deduced.begin(), Deduced.end());
InstantiatingTemplate Inst(*this, Info.getLocation(), Partial, DeducedArgs,
                           Info);
if (Inst.isInvalid())
  return TDK_InstantiationDepth;

if (Trap.hasErrorOccurred())
  return Sema::TDK_SubstitutionFailure;

TemplateDeductionResult Result;
runWithSufficientStackSpace(Info.getLocation(), [&] {
  Result = ::FinishTemplateArgumentDeduction(*this, Partial,
                                             /*IsPartialOrdering=*/false,
                                             TemplateArgs, Deduced, Info);
});
return Result;
3107}

3109/// Perform template argument deduction to determine whether
3110/// the given template arguments match the given variable template
3111/// partial specialization per C++ [temp.class.spec.match].
3112Sema::TemplateDeductionResult
3113Sema::DeduceTemplateArguments(VarTemplatePartialSpecializationDecl *Partial,
                            const TemplateArgumentList &TemplateArgs,
                            TemplateDeductionInfo &Info) {
if (Partial->isInvalidDecl())
  return TDK_Invalid;

// C++ [temp.class.spec.match]p2:
//   A partial specialization matches a given actual template
//   argument list if the template arguments of the partial
//   specialization can be deduced from the actual template argument
//   list (14.8.2).

// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    *this, Sema::ExpressionEvaluationContext::Unevaluated);
SFINAETrap Trap(*this);

SmallVector<DeducedTemplateArgument, 4> Deduced;
Deduced.resize(Partial->getTemplateParameters()->size());
if (TemplateDeductionResult Result = ::DeduceTemplateArguments(
        *this, Partial->getTemplateParameters(), Partial->getTemplateArgs(),
        TemplateArgs, Info, Deduced))
  return Result;

SmallVector<TemplateArgument, 4> DeducedArgs(Deduced.begin(), Deduced.end());
InstantiatingTemplate Inst(*this, Info.getLocation(), Partial, DeducedArgs,
                           Info);
if (Inst.isInvalid())
  return TDK_InstantiationDepth;

if (Trap.hasErrorOccurred())
  return Sema::TDK_SubstitutionFailure;

TemplateDeductionResult Result;
runWithSufficientStackSpace(Info.getLocation(), [&] {
  Result = ::FinishTemplateArgumentDeduction(*this, Partial,
                                             /*IsPartialOrdering=*/false,
                                             TemplateArgs, Deduced, Info);
});
return Result;
3153}

3155/// Determine whether the given type T is a simple-template-id type.
3156static bool isSimpleTemplateIdType(QualType T) {
if (const TemplateSpecializationType *Spec
34
←
Assuming 'Spec' is non-null→
35
←
Taking true branch→
      = T->getAs<TemplateSpecializationType>())
33
←
Assuming the object is a 'TemplateSpecializationType'→
  return Spec->getTemplateName().getAsTemplateDecl() != nullptr;
36
←
Assuming the condition is false→
37
←
Returning zero, which participates in a condition later→

// C++17 [temp.local]p2:
//   the injected-class-name [...] is equivalent to the template-name followed
//   by the template-arguments of the class template specialization or partial
//   specialization enclosed in <>
// ... which means it's equivalent to a simple-template-id.
//
// This only arises during class template argument deduction for a copy
// deduction candidate, where it permits slicing.
if (T->getAs<InjectedClassNameType>())
  return true;

return false;
3173}

3175/// Substitute the explicitly-provided template arguments into the
3176/// given function template according to C++ [temp.arg.explicit].
3177///
3178/// \param FunctionTemplate the function template into which the explicit
3179/// template arguments will be substituted.
3180///
3181/// \param ExplicitTemplateArgs the explicitly-specified template
3182/// arguments.
3183///
3184/// \param Deduced the deduced template arguments, which will be populated
3185/// with the converted and checked explicit template arguments.
3186///
3187/// \param ParamTypes will be populated with the instantiated function
3188/// parameters.
3189///
3190/// \param FunctionType if non-NULL, the result type of the function template
3191/// will also be instantiated and the pointed-to value will be updated with
3192/// the instantiated function type.
3193///
3194/// \param Info if substitution fails for any reason, this object will be
3195/// populated with more information about the failure.
3196///
3197/// \returns TDK_Success if substitution was successful, or some failure
3198/// condition.
3199Sema::TemplateDeductionResult
3200Sema::SubstituteExplicitTemplateArguments(
                                    FunctionTemplateDecl *FunctionTemplate,
                             TemplateArgumentListInfo &ExplicitTemplateArgs,
                     SmallVectorImpl<DeducedTemplateArgument> &Deduced,
                               SmallVectorImpl<QualType> &ParamTypes,
                                        QualType *FunctionType,
                                        TemplateDeductionInfo &Info) {
FunctionDecl *Function = FunctionTemplate->getTemplatedDecl();
TemplateParameterList *TemplateParams
  = FunctionTemplate->getTemplateParameters();

if (ExplicitTemplateArgs.size() == 0) {
  // No arguments to substitute; just copy over the parameter types and
  // fill in the function type.
  for (auto P : Function->parameters())
    ParamTypes.push_back(P->getType());

  if (FunctionType)
    *FunctionType = Function->getType();
  return TDK_Success;
}

// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    *this, Sema::ExpressionEvaluationContext::Unevaluated);
SFINAETrap Trap(*this);

// C++ [temp.arg.explicit]p3:
//   Template arguments that are present shall be specified in the
//   declaration order of their corresponding template-parameters. The
//   template argument list shall not specify more template-arguments than
//   there are corresponding template-parameters.
SmallVector<TemplateArgument, 4> Builder;

// Enter a new template instantiation context where we check the
// explicitly-specified template arguments against this function template,
// and then substitute them into the function parameter types.
SmallVector<TemplateArgument, 4> DeducedArgs;
InstantiatingTemplate Inst(
    *this, Info.getLocation(), FunctionTemplate, DeducedArgs,
    CodeSynthesisContext::ExplicitTemplateArgumentSubstitution, Info);
if (Inst.isInvalid())
  return TDK_InstantiationDepth;

if (CheckTemplateArgumentList(FunctionTemplate, SourceLocation(),
                              ExplicitTemplateArgs, true, Builder, false) ||
    Trap.hasErrorOccurred()) {
  unsigned Index = Builder.size();
  if (Index >= TemplateParams->size())
    return TDK_SubstitutionFailure;
  Info.Param = makeTemplateParameter(TemplateParams->getParam(Index));
  return TDK_InvalidExplicitArguments;
}

// Form the template argument list from the explicitly-specified
// template arguments.
TemplateArgumentList *ExplicitArgumentList
  = TemplateArgumentList::CreateCopy(Context, Builder);
Info.setExplicitArgs(ExplicitArgumentList);

// Template argument deduction and the final substitution should be
// done in the context of the templated declaration.  Explicit
// argument substitution, on the other hand, needs to happen in the
// calling context.
ContextRAII SavedContext(*this, FunctionTemplate->getTemplatedDecl());

// If we deduced template arguments for a template parameter pack,
// note that the template argument pack is partially substituted and record
// the explicit template arguments. They'll be used as part of deduction
// for this template parameter pack.
unsigned PartiallySubstitutedPackIndex = -1u;
if (!Builder.empty()) {
  const TemplateArgument &Arg = Builder.back();
  if (Arg.getKind() == TemplateArgument::Pack) {
    auto *Param = TemplateParams->getParam(Builder.size() - 1);
    // If this is a fully-saturated fixed-size pack, it should be
    // fully-substituted, not partially-substituted.
    Optional<unsigned> Expansions = getExpandedPackSize(Param);
    if (!Expansions || Arg.pack_size() < *Expansions) {
      PartiallySubstitutedPackIndex = Builder.size() - 1;
      CurrentInstantiationScope->SetPartiallySubstitutedPack(
          Param, Arg.pack_begin(), Arg.pack_size());
    }
  }
}

const FunctionProtoType *Proto
  = Function->getType()->getAs<FunctionProtoType>();
assert(Proto && "Function template does not have a prototype?")((Proto && "Function template does not have a prototype?"
) ? static_cast<void> (0) : __assert_fail ("Proto && \"Function template does not have a prototype?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 3288, __PRETTY_FUNCTION__));

// Isolate our substituted parameters from our caller.
LocalInstantiationScope InstScope(*this, /*MergeWithOuterScope*/true);

ExtParameterInfoBuilder ExtParamInfos;

// Instantiate the types of each of the function parameters given the
// explicitly-specified template arguments. If the function has a trailing
// return type, substitute it after the arguments to ensure we substitute
// in lexical order.
if (Proto->hasTrailingReturn()) {
  if (SubstParmTypes(Function->getLocation(), Function->parameters(),
                     Proto->getExtParameterInfosOrNull(),
                     MultiLevelTemplateArgumentList(*ExplicitArgumentList),
                     ParamTypes, /*params*/ nullptr, ExtParamInfos))
    return TDK_SubstitutionFailure;
}

// Instantiate the return type.
QualType ResultType;
{
  // C++11 [expr.prim.general]p3:
  //   If a declaration declares a member function or member function
  //   template of a class X, the expression this is a prvalue of type
  //   "pointer to cv-qualifier-seq X" between the optional cv-qualifer-seq
  //   and the end of the function-definition, member-declarator, or
  //   declarator.
  Qualifiers ThisTypeQuals;
  CXXRecordDecl *ThisContext = nullptr;
  if (CXXMethodDecl *Method = dyn_cast<CXXMethodDecl>(Function)) {
    ThisContext = Method->getParent();
    ThisTypeQuals = Method->getMethodQualifiers();
  }

  CXXThisScopeRAII ThisScope(*this, ThisContext, ThisTypeQuals,
                             getLangOpts().CPlusPlus11);

  ResultType =
      SubstType(Proto->getReturnType(),
                MultiLevelTemplateArgumentList(*ExplicitArgumentList),
                Function->getTypeSpecStartLoc(), Function->getDeclName());
  if (ResultType.isNull() || Trap.hasErrorOccurred())
    return TDK_SubstitutionFailure;
  // CUDA: Kernel function must have 'void' return type.
  if (getLangOpts().CUDA)
    if (Function->hasAttr<CUDAGlobalAttr>() && !ResultType->isVoidType()) {
      Diag(Function->getLocation(), diag::err_kern_type_not_void_return)
          << Function->getType() << Function->getSourceRange();
      return TDK_SubstitutionFailure;
    }
}

// Instantiate the types of each of the function parameters given the
// explicitly-specified template arguments if we didn't do so earlier.
if (!Proto->hasTrailingReturn() &&
    SubstParmTypes(Function->getLocation(), Function->parameters(),
                   Proto->getExtParameterInfosOrNull(),
                   MultiLevelTemplateArgumentList(*ExplicitArgumentList),
                   ParamTypes, /*params*/ nullptr, ExtParamInfos))
  return TDK_SubstitutionFailure;

if (FunctionType) {
  auto EPI = Proto->getExtProtoInfo();
  EPI.ExtParameterInfos = ExtParamInfos.getPointerOrNull(ParamTypes.size());

  // In C++1z onwards, exception specifications are part of the function type,
  // so substitution into the type must also substitute into the exception
  // specification.
  SmallVector<QualType, 4> ExceptionStorage;
  if (getLangOpts().CPlusPlus17 &&
      SubstExceptionSpec(
          Function->getLocation(), EPI.ExceptionSpec, ExceptionStorage,
          MultiLevelTemplateArgumentList(*ExplicitArgumentList)))
    return TDK_SubstitutionFailure;

  *FunctionType = BuildFunctionType(ResultType, ParamTypes,
                                    Function->getLocation(),
                                    Function->getDeclName(),
                                    EPI);
  if (FunctionType->isNull() || Trap.hasErrorOccurred())
    return TDK_SubstitutionFailure;
}

// C++ [temp.arg.explicit]p2:
//   Trailing template arguments that can be deduced (14.8.2) may be
//   omitted from the list of explicit template-arguments. If all of the
//   template arguments can be deduced, they may all be omitted; in this
//   case, the empty template argument list <> itself may also be omitted.
//
// Take all of the explicitly-specified arguments and put them into
// the set of deduced template arguments. The partially-substituted
// parameter pack, however, will be set to NULL since the deduction
// mechanism handles the partially-substituted argument pack directly.
Deduced.reserve(TemplateParams->size());
for (unsigned I = 0, N = ExplicitArgumentList->size(); I != N; ++I) {
  const TemplateArgument &Arg = ExplicitArgumentList->get(I);
  if (I == PartiallySubstitutedPackIndex)
    Deduced.push_back(DeducedTemplateArgument());
  else
    Deduced.push_back(Arg);
}

return TDK_Success;
3392}

3394/// Check whether the deduced argument type for a call to a function
3395/// template matches the actual argument type per C++ [temp.deduct.call]p4.
3396static Sema::TemplateDeductionResult
3397CheckOriginalCallArgDeduction(Sema &S, TemplateDeductionInfo &Info,
                            Sema::OriginalCallArg OriginalArg,
                            QualType DeducedA) {
ASTContext &Context = S.Context;

auto Failed = [&]() -> Sema::TemplateDeductionResult {
  Info.FirstArg = TemplateArgument(DeducedA);
  Info.SecondArg = TemplateArgument(OriginalArg.OriginalArgType);
  Info.CallArgIndex = OriginalArg.ArgIdx;
  return OriginalArg.DecomposedParam ? Sema::TDK_DeducedMismatchNested
                                     : Sema::TDK_DeducedMismatch;
};

QualType A = OriginalArg.OriginalArgType;
QualType OriginalParamType = OriginalArg.OriginalParamType;

// Check for type equality (top-level cv-qualifiers are ignored).
if (Context.hasSameUnqualifiedType(A, DeducedA))
  return Sema::TDK_Success;

// Strip off references on the argument types; they aren't needed for
// the following checks.
if (const ReferenceType *DeducedARef = DeducedA->getAs<ReferenceType>())
  DeducedA = DeducedARef->getPointeeType();
if (const ReferenceType *ARef = A->getAs<ReferenceType>())
  A = ARef->getPointeeType();

// C++ [temp.deduct.call]p4:
//   [...] However, there are three cases that allow a difference:
//     - If the original P is a reference type, the deduced A (i.e., the
//       type referred to by the reference) can be more cv-qualified than
//       the transformed A.
if (const ReferenceType *OriginalParamRef
    = OriginalParamType->getAs<ReferenceType>()) {
  // We don't want to keep the reference around any more.
  OriginalParamType = OriginalParamRef->getPointeeType();

  // FIXME: Resolve core issue (no number yet): if the original P is a
  // reference type and the transformed A is function type "noexcept F",
  // the deduced A can be F.
  QualType Tmp;
  if (A->isFunctionType() && S.IsFunctionConversion(A, DeducedA, Tmp))
    return Sema::TDK_Success;

  Qualifiers AQuals = A.getQualifiers();
  Qualifiers DeducedAQuals = DeducedA.getQualifiers();

  // Under Objective-C++ ARC, the deduced type may have implicitly
  // been given strong or (when dealing with a const reference)
  // unsafe_unretained lifetime. If so, update the original
  // qualifiers to include this lifetime.
  if (S.getLangOpts().ObjCAutoRefCount &&
      ((DeducedAQuals.getObjCLifetime() == Qualifiers::OCL_Strong &&
        AQuals.getObjCLifetime() == Qualifiers::OCL_None) ||
       (DeducedAQuals.hasConst() &&
        DeducedAQuals.getObjCLifetime() == Qualifiers::OCL_ExplicitNone))) {
    AQuals.setObjCLifetime(DeducedAQuals.getObjCLifetime());
  }

  if (AQuals == DeducedAQuals) {
    // Qualifiers match; there's nothing to do.
  } else if (!DeducedAQuals.compatiblyIncludes(AQuals)) {
    return Failed();
  } else {
    // Qualifiers are compatible, so have the argument type adopt the
    // deduced argument type's qualifiers as if we had performed the
    // qualification conversion.
    A = Context.getQualifiedType(A.getUnqualifiedType(), DeducedAQuals);
  }
}

//    - The transformed A can be another pointer or pointer to member
//      type that can be converted to the deduced A via a function pointer
//      conversion and/or a qualification conversion.
//
// Also allow conversions which merely strip __attribute__((noreturn)) from
// function types (recursively).
bool ObjCLifetimeConversion = false;
QualType ResultTy;
if ((A->isAnyPointerType() || A->isMemberPointerType()) &&
    (S.IsQualificationConversion(A, DeducedA, false,
                                 ObjCLifetimeConversion) ||
     S.IsFunctionConversion(A, DeducedA, ResultTy)))
  return Sema::TDK_Success;

//    - If P is a class and P has the form simple-template-id, then the
//      transformed A can be a derived class of the deduced A. [...]
//     [...] Likewise, if P is a pointer to a class of the form
//      simple-template-id, the transformed A can be a pointer to a
//      derived class pointed to by the deduced A.
if (const PointerType *OriginalParamPtr
    = OriginalParamType->getAs<PointerType>()) {
  if (const PointerType *DeducedAPtr = DeducedA->getAs<PointerType>()) {
    if (const PointerType *APtr = A->getAs<PointerType>()) {
      if (A->getPointeeType()->isRecordType()) {
        OriginalParamType = OriginalParamPtr->getPointeeType();
        DeducedA = DeducedAPtr->getPointeeType();
        A = APtr->getPointeeType();
      }
    }
  }
}

if (Context.hasSameUnqualifiedType(A, DeducedA))
  return Sema::TDK_Success;

if (A->isRecordType() && isSimpleTemplateIdType(OriginalParamType) &&
    S.IsDerivedFrom(Info.getLocation(), A, DeducedA))
  return Sema::TDK_Success;

return Failed();
3508}

3510/// Find the pack index for a particular parameter index in an instantiation of
3511/// a function template with specific arguments.
3512///
3513/// \return The pack index for whichever pack produced this parameter, or -1
3514///         if this was not produced by a parameter. Intended to be used as the
3515///         ArgumentPackSubstitutionIndex for further substitutions.
3516// FIXME: We should track this in OriginalCallArgs so we don't need to
3517// reconstruct it here.
3518static unsigned getPackIndexForParam(Sema &S,
                                   FunctionTemplateDecl *FunctionTemplate,
                                   const MultiLevelTemplateArgumentList &Args,
                                   unsigned ParamIdx) {
unsigned Idx = 0;
for (auto *PD : FunctionTemplate->getTemplatedDecl()->parameters()) {
  if (PD->isParameterPack()) {
    unsigned NumExpansions =
        S.getNumArgumentsInExpansion(PD->getType(), Args).getValueOr(1);
    if (Idx + NumExpansions > ParamIdx)
      return ParamIdx - Idx;
    Idx += NumExpansions;
  } else {
    if (Idx == ParamIdx)
      return -1; // Not a pack expansion
    ++Idx;
  }
}

llvm_unreachable("parameter index would not be produced from template")::llvm::llvm_unreachable_internal("parameter index would not be produced from template"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 3537);
3538}

3540/// Finish template argument deduction for a function template,
3541/// checking the deduced template arguments for completeness and forming
3542/// the function template specialization.
3543///
3544/// \param OriginalCallArgs If non-NULL, the original call arguments against
3545/// which the deduced argument types should be compared.
3546Sema::TemplateDeductionResult Sema::FinishTemplateArgumentDeduction(
  FunctionTemplateDecl *FunctionTemplate,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced,
  unsigned NumExplicitlySpecified, FunctionDecl *&Specialization,
  TemplateDeductionInfo &Info,
  SmallVectorImpl<OriginalCallArg> const *OriginalCallArgs,
  bool PartialOverloading, llvm::function_ref<bool()> CheckNonDependent) {
// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    *this, Sema::ExpressionEvaluationContext::Unevaluated);
SFINAETrap Trap(*this);

// Enter a new template instantiation context while we instantiate the
// actual function declaration.
SmallVector<TemplateArgument, 4> DeducedArgs(Deduced.begin(), Deduced.end());
InstantiatingTemplate Inst(
    *this, Info.getLocation(), FunctionTemplate, DeducedArgs,
    CodeSynthesisContext::DeducedTemplateArgumentSubstitution, Info);
if (Inst.isInvalid())
  return TDK_InstantiationDepth;

ContextRAII SavedContext(*this, FunctionTemplate->getTemplatedDecl());

// C++ [temp.deduct.type]p2:
//   [...] or if any template argument remains neither deduced nor
//   explicitly specified, template argument deduction fails.
SmallVector<TemplateArgument, 4> Builder;
if (auto Result = ConvertDeducedTemplateArguments(
        *this, FunctionTemplate, /*IsDeduced*/true, Deduced, Info, Builder,
        CurrentInstantiationScope, NumExplicitlySpecified,
        PartialOverloading))
  return Result;

// C++ [temp.deduct.call]p10: [DR1391]
//   If deduction succeeds for all parameters that contain
//   template-parameters that participate in template argument deduction,
//   and all template arguments are explicitly specified, deduced, or
//   obtained from default template arguments, remaining parameters are then
//   compared with the corresponding arguments. For each remaining parameter
//   P with a type that was non-dependent before substitution of any
//   explicitly-specified template arguments, if the corresponding argument
//   A cannot be implicitly converted to P, deduction fails.
if (CheckNonDependent())
  return TDK_NonDependentConversionFailure;

// Form the template argument list from the deduced template arguments.
TemplateArgumentList *DeducedArgumentList
  = TemplateArgumentList::CreateCopy(Context, Builder);
Info.reset(DeducedArgumentList);

// Substitute the deduced template arguments into the function template
// declaration to produce the function template specialization.
DeclContext *Owner = FunctionTemplate->getDeclContext();
if (FunctionTemplate->getFriendObjectKind())
  Owner = FunctionTemplate->getLexicalDeclContext();
MultiLevelTemplateArgumentList SubstArgs(*DeducedArgumentList);
Specialization = cast_or_null<FunctionDecl>(
    SubstDecl(FunctionTemplate->getTemplatedDecl(), Owner, SubstArgs));
if (!Specialization || Specialization->isInvalidDecl())
  return TDK_SubstitutionFailure;

assert(Specialization->getPrimaryTemplate()->getCanonicalDecl() ==((Specialization->getPrimaryTemplate()->getCanonicalDecl
() == FunctionTemplate->getCanonicalDecl()) ? static_cast<
void> (0) : __assert_fail ("Specialization->getPrimaryTemplate()->getCanonicalDecl() == FunctionTemplate->getCanonicalDecl()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 3608, __PRETTY_FUNCTION__))
       FunctionTemplate->getCanonicalDecl())((Specialization->getPrimaryTemplate()->getCanonicalDecl
() == FunctionTemplate->getCanonicalDecl()) ? static_cast<
void> (0) : __assert_fail ("Specialization->getPrimaryTemplate()->getCanonicalDecl() == FunctionTemplate->getCanonicalDecl()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 3608, __PRETTY_FUNCTION__));

// If the template argument list is owned by the function template
// specialization, release it.
if (Specialization->getTemplateSpecializationArgs() == DeducedArgumentList &&
    !Trap.hasErrorOccurred())
  Info.take();

// There may have been an error that did not prevent us from constructing a
// declaration. Mark the declaration invalid and return with a substitution
// failure.
if (Trap.hasErrorOccurred()) {
  Specialization->setInvalidDecl(true);
  return TDK_SubstitutionFailure;
}

// C++2a [temp.deduct]p5
//   [...] When all template arguments have been deduced [...] all uses of
//   template parameters [...] are replaced with the corresponding deduced
//   or default argument values.
//   [...] If the function template has associated constraints
//   ([temp.constr.decl]), those constraints are checked for satisfaction
//   ([temp.constr.constr]). If the constraints are not satisfied, type
//   deduction fails.
if (!PartialOverloading ||
    (Builder.size() == FunctionTemplate->getTemplateParameters()->size())) {
  if (CheckInstantiatedFunctionTemplateConstraints(Info.getLocation(),
          Specialization, Builder, Info.AssociatedConstraintsSatisfaction))
    return TDK_MiscellaneousDeductionFailure;

  if (!Info.AssociatedConstraintsSatisfaction.IsSatisfied) {
    Info.reset(TemplateArgumentList::CreateCopy(Context, Builder));
    return TDK_ConstraintsNotSatisfied;
  }
}

if (OriginalCallArgs) {
  // C++ [temp.deduct.call]p4:
  //   In general, the deduction process attempts to find template argument
  //   values that will make the deduced A identical to A (after the type A
  //   is transformed as described above). [...]
  llvm::SmallDenseMap<std::pair<unsigned, QualType>, QualType> DeducedATypes;
  for (unsigned I = 0, N = OriginalCallArgs->size(); I != N; ++I) {
    OriginalCallArg OriginalArg = (*OriginalCallArgs)[I];

    auto ParamIdx = OriginalArg.ArgIdx;
    if (ParamIdx >= Specialization->getNumParams())
      // FIXME: This presumably means a pack ended up smaller than we
      // expected while deducing. Should this not result in deduction
      // failure? Can it even happen?
      continue;

    QualType DeducedA;
    if (!OriginalArg.DecomposedParam) {
      // P is one of the function parameters, just look up its substituted
      // type.
      DeducedA = Specialization->getParamDecl(ParamIdx)->getType();
    } else {
      // P is a decomposed element of a parameter corresponding to a
      // braced-init-list argument. Substitute back into P to find the
      // deduced A.
      QualType &CacheEntry =
          DeducedATypes[{ParamIdx, OriginalArg.OriginalParamType}];
      if (CacheEntry.isNull()) {
        ArgumentPackSubstitutionIndexRAII PackIndex(
            *this, getPackIndexForParam(*this, FunctionTemplate, SubstArgs,
                                        ParamIdx));
        CacheEntry =
            SubstType(OriginalArg.OriginalParamType, SubstArgs,
                      Specialization->getTypeSpecStartLoc(),
                      Specialization->getDeclName());
      }
      DeducedA = CacheEntry;
    }

    if (auto TDK =
            CheckOriginalCallArgDeduction(*this, Info, OriginalArg, DeducedA))
      return TDK;
  }
}

// If we suppressed any diagnostics while performing template argument
// deduction, and if we haven't already instantiated this declaration,
// keep track of these diagnostics. They'll be emitted if this specialization
// is actually used.
if (Info.diag_begin() != Info.diag_end()) {
  SuppressedDiagnosticsMap::iterator
    Pos = SuppressedDiagnostics.find(Specialization->getCanonicalDecl());
  if (Pos == SuppressedDiagnostics.end())
      SuppressedDiagnostics[Specialization->getCanonicalDecl()]
        .append(Info.diag_begin(), Info.diag_end());
}

return TDK_Success;
3702}

3704/// Gets the type of a function for template-argument-deducton
3705/// purposes when it's considered as part of an overload set.
3706static QualType GetTypeOfFunction(Sema &S, const OverloadExpr::FindResult &R,
                                FunctionDecl *Fn) {
// We may need to deduce the return type of the function now.
if (S.getLangOpts().CPlusPlus14 && Fn->getReturnType()->isUndeducedType() &&
    S.DeduceReturnType(Fn, R.Expression->getExprLoc(), /*Diagnose*/ false))
  return {};

if (CXXMethodDecl *Method = dyn_cast<CXXMethodDecl>(Fn))
  if (Method->isInstance()) {
    // An instance method that's referenced in a form that doesn't
    // look like a member pointer is just invalid.
    if (!R.HasFormOfMemberPointer)
      return {};

    return S.Context.getMemberPointerType(Fn->getType(),
             S.Context.getTypeDeclType(Method->getParent()).getTypePtr());
  }

if (!R.IsAddressOfOperand) return Fn->getType();
return S.Context.getPointerType(Fn->getType());
3726}

3728/// Apply the deduction rules for overload sets.
3729///
3730/// \return the null type if this argument should be treated as an
3731/// undeduced context
3732static QualType
3733ResolveOverloadForDeduction(Sema &S, TemplateParameterList *TemplateParams,
                          Expr *Arg, QualType ParamType,
                          bool ParamWasReference) {

OverloadExpr::FindResult R = OverloadExpr::find(Arg);

OverloadExpr *Ovl = R.Expression;

// C++0x [temp.deduct.call]p4
unsigned TDF = 0;
if (ParamWasReference)
  TDF |= TDF_ParamWithReferenceType;
if (R.IsAddressOfOperand)
  TDF |= TDF_IgnoreQualifiers;

// C++0x [temp.deduct.call]p6:
//   When P is a function type, pointer to function type, or pointer
//   to member function type:

if (!ParamType->isFunctionType() &&
    !ParamType->isFunctionPointerType() &&
    !ParamType->isMemberFunctionPointerType()) {
  if (Ovl->hasExplicitTemplateArgs()) {
    // But we can still look for an explicit specialization.
    if (FunctionDecl *ExplicitSpec
          = S.ResolveSingleFunctionTemplateSpecialization(Ovl))
      return GetTypeOfFunction(S, R, ExplicitSpec);
  }

  DeclAccessPair DAP;
  if (FunctionDecl *Viable =
          S.resolveAddressOfSingleOverloadCandidate(Arg, DAP))
    return GetTypeOfFunction(S, R, Viable);

  return {};
}

// Gather the explicit template arguments, if any.
TemplateArgumentListInfo ExplicitTemplateArgs;
if (Ovl->hasExplicitTemplateArgs())
  Ovl->copyTemplateArgumentsInto(ExplicitTemplateArgs);
QualType Match;
for (UnresolvedSetIterator I = Ovl->decls_begin(),
       E = Ovl->decls_end(); I != E; ++I) {
  NamedDecl *D = (*I)->getUnderlyingDecl();

  if (FunctionTemplateDecl *FunTmpl = dyn_cast<FunctionTemplateDecl>(D)) {
    //   - If the argument is an overload set containing one or more
    //     function templates, the parameter is treated as a
    //     non-deduced context.
    if (!Ovl->hasExplicitTemplateArgs())
      return {};

    // Otherwise, see if we can resolve a function type
    FunctionDecl *Specialization = nullptr;
    TemplateDeductionInfo Info(Ovl->getNameLoc());
    if (S.DeduceTemplateArguments(FunTmpl, &ExplicitTemplateArgs,
                                  Specialization, Info))
      continue;

    D = Specialization;
  }

  FunctionDecl *Fn = cast<FunctionDecl>(D);
  QualType ArgType = GetTypeOfFunction(S, R, Fn);
  if (ArgType.isNull()) continue;

  // Function-to-pointer conversion.
  if (!ParamWasReference && ParamType->isPointerType() &&
      ArgType->isFunctionType())
    ArgType = S.Context.getPointerType(ArgType);

  //   - If the argument is an overload set (not containing function
  //     templates), trial argument deduction is attempted using each
  //     of the members of the set. If deduction succeeds for only one
  //     of the overload set members, that member is used as the
  //     argument value for the deduction. If deduction succeeds for
  //     more than one member of the overload set the parameter is
  //     treated as a non-deduced context.

  // We do all of this in a fresh context per C++0x [temp.deduct.type]p2:
  //   Type deduction is done independently for each P/A pair, and
  //   the deduced template argument values are then combined.
  // So we do not reject deductions which were made elsewhere.
  SmallVector<DeducedTemplateArgument, 8>
    Deduced(TemplateParams->size());
  TemplateDeductionInfo Info(Ovl->getNameLoc());
  Sema::TemplateDeductionResult Result
    = DeduceTemplateArgumentsByTypeMatch(S, TemplateParams, ParamType,
                                         ArgType, Info, Deduced, TDF);
  if (Result) continue;
  if (!Match.isNull())
    return {};
  Match = ArgType;
}

return Match;
3830}

3832/// Perform the adjustments to the parameter and argument types
3833/// described in C++ [temp.deduct.call].
3834///
3835/// \returns true if the caller should not attempt to perform any template
3836/// argument deduction based on this P/A pair because the argument is an
3837/// overloaded function set that could not be resolved.
3838static bool AdjustFunctionParmAndArgTypesForDeduction(
  Sema &S, TemplateParameterList *TemplateParams, unsigned FirstInnerIndex,
  QualType &ParamType, QualType &ArgType, Expr *Arg, unsigned &TDF) {
// C++0x [temp.deduct.call]p3:
//   If P is a cv-qualified type, the top level cv-qualifiers of P's type
//   are ignored for type deduction.
if (ParamType.hasQualifiers())
15
←
Assuming the condition is false→
16
←
Taking false branch→
  ParamType = ParamType.getUnqualifiedType();

//   [...] If P is a reference type, the type referred to by P is
//   used for type deduction.
const ReferenceType *ParamRefType = ParamType->getAs<ReferenceType>();
17
←
Assuming the object is not a 'ReferenceType'→
if (ParamRefType17.1
'ParamRefType' is null
1
'ParamRefType' is null
1
'ParamRefType' is null
)
18
←
Taking false branch→
  ParamType = ParamRefType->getPointeeType();

// Overload sets usually make this parameter an undeduced context,
// but there are sometimes special circumstances.  Typically
// involving a template-id-expr.
if (ArgType == S.Context.OverloadTy) {
19
←
Calling 'operator=='→
25
←
Returning from 'operator=='→
26
←
Taking false branch→
  ArgType = ResolveOverloadForDeduction(S, TemplateParams,
                                        Arg, ParamType,
                                        ParamRefType != nullptr);
  if (ArgType.isNull())
    return true;
}

if (ParamRefType26.1
'ParamRefType' is null
1
'ParamRefType' is null
1
'ParamRefType' is null
) {
27
←
Taking false branch→
  // If the argument has incomplete array type, try to complete its type.
  if (ArgType->isIncompleteArrayType())
    ArgType = S.getCompletedType(Arg);

  // C++1z [temp.deduct.call]p3:
  //   If P is a forwarding reference and the argument is an lvalue, the type
  //   "lvalue reference to A" is used in place of A for type deduction.
  if (isForwardingReference(QualType(ParamRefType, 0), FirstInnerIndex) &&
      Arg->isLValue()) {
    if (S.getLangOpts().OpenCL  && !ArgType.hasAddressSpace())
      ArgType = S.Context.getAddrSpaceQualType(ArgType, LangAS::opencl_generic);
    ArgType = S.Context.getLValueReferenceType(ArgType);
  }
} else {
  // C++ [temp.deduct.call]p2:
  //   If P is not a reference type:
  //   - If A is an array type, the pointer type produced by the
  //     array-to-pointer standard conversion (4.2) is used in place of
  //     A for type deduction; otherwise,
  if (ArgType->isArrayType())
28
←
Taking false branch→
    ArgType = S.Context.getArrayDecayedType(ArgType);
  //   - If A is a function type, the pointer type produced by the
  //     function-to-pointer standard conversion (4.3) is used in place
  //     of A for type deduction; otherwise,
  else if (ArgType->isFunctionType())
29
←
Taking false branch→
    ArgType = S.Context.getPointerType(ArgType);
  else {
    // - If A is a cv-qualified type, the top level cv-qualifiers of A's
    //   type are ignored for type deduction.
    ArgType = ArgType.getUnqualifiedType();
  }
}

// C++0x [temp.deduct.call]p4:
//   In general, the deduction process attempts to find template argument
//   values that will make the deduced A identical to A (after the type A
//   is transformed as described above). [...]
TDF = TDF_SkipNonDependent;

//     - If the original P is a reference type, the deduced A (i.e., the
//       type referred to by the reference) can be more cv-qualified than
//       the transformed A.
if (ParamRefType29.1
'ParamRefType' is null
1
'ParamRefType' is null
1
'ParamRefType' is null
)
30
←
Taking false branch→
  TDF |= TDF_ParamWithReferenceType;
//     - The transformed A can be another pointer or pointer to member
//       type that can be converted to the deduced A via a qualification
//       conversion (4.4).
if (ArgType->isPointerType() || ArgType->isMemberPointerType() ||
31
←
Taking false branch→
    ArgType->isObjCObjectPointerType())
  TDF |= TDF_IgnoreQualifiers;
//     - If P is a class and P has the form simple-template-id, then the
//       transformed A can be a derived class of the deduced A. Likewise,
//       if P is a pointer to a class of the form simple-template-id, the
//       transformed A can be a pointer to a derived class pointed to by
//       the deduced A.
if (isSimpleTemplateIdType(ParamType) ||
32
←
Calling 'isSimpleTemplateIdType'→
38
←
Returning from 'isSimpleTemplateIdType'→
    (isa<PointerType>(ParamType) &&
39
←
Assuming 'ParamType' is a 'PointerType'→
     isSimpleTemplateIdType(
                            ParamType->getAs<PointerType>()->getPointeeType())))
40
←
Assuming the object is not a 'PointerType'→
41
←
Called C++ object pointer is null
  TDF |= TDF_DerivedClass;

return false;
3927}

3929static bool
3930hasDeducibleTemplateParameters(Sema &S, FunctionTemplateDecl *FunctionTemplate,
                             QualType T);

3933static Sema::TemplateDeductionResult DeduceTemplateArgumentsFromCallArgument(
  Sema &S, TemplateParameterList *TemplateParams, unsigned FirstInnerIndex,
  QualType ParamType, Expr *Arg, TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced,
  SmallVectorImpl<Sema::OriginalCallArg> &OriginalCallArgs,
  bool DecomposedParam, unsigned ArgIdx, unsigned TDF);

3940/// Attempt template argument deduction from an initializer list
3941///        deemed to be an argument in a function call.
3942static Sema::TemplateDeductionResult DeduceFromInitializerList(
  Sema &S, TemplateParameterList *TemplateParams, QualType AdjustedParamType,
  InitListExpr *ILE, TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced,
  SmallVectorImpl<Sema::OriginalCallArg> &OriginalCallArgs, unsigned ArgIdx,
  unsigned TDF) {
// C++ [temp.deduct.call]p1: (CWG 1591)
//   If removing references and cv-qualifiers from P gives
//   std::initializer_list<P0> or P0[N] for some P0 and N and the argument is
//   a non-empty initializer list, then deduction is performed instead for
//   each element of the initializer list, taking P0 as a function template
//   parameter type and the initializer element as its argument
//
// We've already removed references and cv-qualifiers here.
if (!ILE->getNumInits())
  return Sema::TDK_Success;

QualType ElTy;
auto *ArrTy = S.Context.getAsArrayType(AdjustedParamType);
if (ArrTy)
  ElTy = ArrTy->getElementType();
else if (!S.isStdInitializerList(AdjustedParamType, &ElTy)) {
  //   Otherwise, an initializer list argument causes the parameter to be
  //   considered a non-deduced context
  return Sema::TDK_Success;
}

// Resolving a core issue: a braced-init-list containing any designators is
// a non-deduced context.
for (Expr *E : ILE->inits())
  if (isa<DesignatedInitExpr>(E))
    return Sema::TDK_Success;

// Deduction only needs to be done for dependent types.
if (ElTy->isDependentType()) {
  for (Expr *E : ILE->inits()) {
    if (auto Result = DeduceTemplateArgumentsFromCallArgument(
            S, TemplateParams, 0, ElTy, E, Info, Deduced, OriginalCallArgs, true,
            ArgIdx, TDF))
      return Result;
  }
}

//   in the P0[N] case, if N is a non-type template parameter, N is deduced
//   from the length of the initializer list.
if (auto *DependentArrTy = dyn_cast_or_null<DependentSizedArrayType>(ArrTy)) {
  // Determine the array bound is something we can deduce.
  if (const NonTypeTemplateParmDecl *NTTP =
          getDeducedParameterFromExpr(Info, DependentArrTy->getSizeExpr())) {
    // We can perform template argument deduction for the given non-type
    // template parameter.
    // C++ [temp.deduct.type]p13:
    //   The type of N in the type T[N] is std::size_t.
    QualType T = S.Context.getSizeType();
    llvm::APInt Size(S.Context.getIntWidth(T), ILE->getNumInits());
    if (auto Result = DeduceNonTypeTemplateArgument(
            S, TemplateParams, NTTP, llvm::APSInt(Size), T,
            /*ArrayBound=*/true, Info, Deduced))
      return Result;
  }
}

return Sema::TDK_Success;
4005}

4007/// Perform template argument deduction per [temp.deduct.call] for a
4008///        single parameter / argument pair.
4009static Sema::TemplateDeductionResult DeduceTemplateArgumentsFromCallArgument(
  Sema &S, TemplateParameterList *TemplateParams, unsigned FirstInnerIndex,
  QualType ParamType, Expr *Arg, TemplateDeductionInfo &Info,
  SmallVectorImpl<DeducedTemplateArgument> &Deduced,
  SmallVectorImpl<Sema::OriginalCallArg> &OriginalCallArgs,
  bool DecomposedParam, unsigned ArgIdx, unsigned TDF) {
QualType ArgType = Arg->getType();
QualType OrigParamType = ParamType;

//   If P is a reference type [...]
//   If P is a cv-qualified type [...]
if (AdjustFunctionParmAndArgTypesForDeduction(
14
←
Calling 'AdjustFunctionParmAndArgTypesForDeduction'→
        S, TemplateParams, FirstInnerIndex, ParamType, ArgType, Arg, TDF))
  return Sema::TDK_Success;

//   If [...] the argument is a non-empty initializer list [...]
if (InitListExpr *ILE = dyn_cast<InitListExpr>(Arg))
  return DeduceFromInitializerList(S, TemplateParams, ParamType, ILE, Info,
                                   Deduced, OriginalCallArgs, ArgIdx, TDF);

//   [...] the deduction process attempts to find template argument values
//   that will make the deduced A identical to A
//
// Keep track of the argument type and corresponding parameter index,
// so we can check for compatibility between the deduced A and A.
OriginalCallArgs.push_back(
    Sema::OriginalCallArg(OrigParamType, DecomposedParam, ArgIdx, ArgType));
return DeduceTemplateArgumentsByTypeMatch(S, TemplateParams, ParamType,
                                          ArgType, Info, Deduced, TDF);
4038}

4040/// Perform template argument deduction from a function call
4041/// (C++ [temp.deduct.call]).
4042///
4043/// \param FunctionTemplate the function template for which we are performing
4044/// template argument deduction.
4045///
4046/// \param ExplicitTemplateArgs the explicit template arguments provided
4047/// for this call.
4048///
4049/// \param Args the function call arguments
4050///
4051/// \param Specialization if template argument deduction was successful,
4052/// this will be set to the function template specialization produced by
4053/// template argument deduction.
4054///
4055/// \param Info the argument will be updated to provide additional information
4056/// about template argument deduction.
4057///
4058/// \param CheckNonDependent A callback to invoke to check conversions for
4059/// non-dependent parameters, between deduction and substitution, per DR1391.
4060/// If this returns true, substitution will be skipped and we return
4061/// TDK_NonDependentConversionFailure. The callback is passed the parameter
4062/// types (after substituting explicit template arguments).
4063///
4064/// \returns the result of template argument deduction.
4065Sema::TemplateDeductionResult Sema::DeduceTemplateArguments(
  FunctionTemplateDecl *FunctionTemplate,
  TemplateArgumentListInfo *ExplicitTemplateArgs, ArrayRef<Expr *> Args,
  FunctionDecl *&Specialization, TemplateDeductionInfo &Info,
  bool PartialOverloading,
  llvm::function_ref<bool(ArrayRef<QualType>)> CheckNonDependent) {
if (FunctionTemplate->isInvalidDecl())
  return TDK_Invalid;

FunctionDecl *Function = FunctionTemplate->getTemplatedDecl();
unsigned NumParams = Function->getNumParams();

unsigned FirstInnerIndex = getFirstInnerIndex(FunctionTemplate);

// C++ [temp.deduct.call]p1:
//   Template argument deduction is done by comparing each function template
//   parameter type (call it P) with the type of the corresponding argument
//   of the call (call it A) as described below.
if (Args.size() < Function->getMinRequiredArguments() && !PartialOverloading)
  return TDK_TooFewArguments;
else if (TooManyArguments(NumParams, Args.size(), PartialOverloading)) {
  const auto *Proto = Function->getType()->castAs<FunctionProtoType>();
  if (Proto->isTemplateVariadic())
    /* Do nothing */;
  else if (!Proto->isVariadic())
    return TDK_TooManyArguments;
}

// The types of the parameters from which we will perform template argument
// deduction.
LocalInstantiationScope InstScope(*this);
TemplateParameterList *TemplateParams
  = FunctionTemplate->getTemplateParameters();
SmallVector<DeducedTemplateArgument, 4> Deduced;
SmallVector<QualType, 8> ParamTypes;
unsigned NumExplicitlySpecified = 0;
if (ExplicitTemplateArgs) {
  TemplateDeductionResult Result;
  runWithSufficientStackSpace(Info.getLocation(), [&] {
    Result = SubstituteExplicitTemplateArguments(
        FunctionTemplate, *ExplicitTemplateArgs, Deduced, ParamTypes, nullptr,
        Info);
  });
  if (Result)
    return Result;

  NumExplicitlySpecified = Deduced.size();
} else {
  // Just fill in the parameter types from the function declaration.
  for (unsigned I = 0; I != NumParams; ++I)
    ParamTypes.push_back(Function->getParamDecl(I)->getType());
}

SmallVector<OriginalCallArg, 8> OriginalCallArgs;

// Deduce an argument of type ParamType from an expression with index ArgIdx.
auto DeduceCallArgument = [&](QualType ParamType, unsigned ArgIdx) {
  // C++ [demp.deduct.call]p1: (DR1391)
  //   Template argument deduction is done by comparing each function template
  //   parameter that contains template-parameters that participate in
  //   template argument deduction ...
  if (!hasDeducibleTemplateParameters(*this, FunctionTemplate, ParamType))
    return Sema::TDK_Success;

  //   ... with the type of the corresponding argument
  return DeduceTemplateArgumentsFromCallArgument(
      *this, TemplateParams, FirstInnerIndex, ParamType, Args[ArgIdx], Info, Deduced,
      OriginalCallArgs, /*Decomposed*/false, ArgIdx, /*TDF*/ 0);
};

// Deduce template arguments from the function parameters.
Deduced.resize(TemplateParams->size());
SmallVector<QualType, 8> ParamTypesForArgChecking;
for (unsigned ParamIdx = 0, NumParamTypes = ParamTypes.size(), ArgIdx = 0;
     ParamIdx != NumParamTypes; ++ParamIdx) {
  QualType ParamType = ParamTypes[ParamIdx];

  const PackExpansionType *ParamExpansion =
      dyn_cast<PackExpansionType>(ParamType);
  if (!ParamExpansion) {
    // Simple case: matching a function parameter to a function argument.
    if (ArgIdx >= Args.size())
      break;

    ParamTypesForArgChecking.push_back(ParamType);
    if (auto Result = DeduceCallArgument(ParamType, ArgIdx++))
      return Result;

    continue;
  }

  QualType ParamPattern = ParamExpansion->getPattern();
  PackDeductionScope PackScope(*this, TemplateParams, Deduced, Info,
                               ParamPattern);

  // C++0x [temp.deduct.call]p1:
  //   For a function parameter pack that occurs at the end of the
  //   parameter-declaration-list, the type A of each remaining argument of
  //   the call is compared with the type P of the declarator-id of the
  //   function parameter pack. Each comparison deduces template arguments
  //   for subsequent positions in the template parameter packs expanded by
  //   the function parameter pack. When a function parameter pack appears
  //   in a non-deduced context [not at the end of the list], the type of
  //   that parameter pack is never deduced.
  //
  // FIXME: The above rule allows the size of the parameter pack to change
  // after we skip it (in the non-deduced case). That makes no sense, so
  // we instead notionally deduce the pack against N arguments, where N is
  // the length of the explicitly-specified pack if it's expanded by the
  // parameter pack and 0 otherwise, and we treat each deduction as a
  // non-deduced context.
  if (ParamIdx + 1 == NumParamTypes || PackScope.hasFixedArity()) {
    for (; ArgIdx < Args.size() && PackScope.hasNextElement();
         PackScope.nextPackElement(), ++ArgIdx) {
      ParamTypesForArgChecking.push_back(ParamPattern);
      if (auto Result = DeduceCallArgument(ParamPattern, ArgIdx))
        return Result;
    }
  } else {
    // If the parameter type contains an explicitly-specified pack that we
    // could not expand, skip the number of parameters notionally created
    // by the expansion.
    Optional<unsigned> NumExpansions = ParamExpansion->getNumExpansions();
    if (NumExpansions && !PackScope.isPartiallyExpanded()) {
      for (unsigned I = 0; I != *NumExpansions && ArgIdx < Args.size();
           ++I, ++ArgIdx) {
        ParamTypesForArgChecking.push_back(ParamPattern);
        // FIXME: Should we add OriginalCallArgs for these? What if the
        // corresponding argument is a list?
        PackScope.nextPackElement();
      }
    }
  }

  // Build argument packs for each of the parameter packs expanded by this
  // pack expansion.
  if (auto Result = PackScope.finish())
    return Result;
}

// Capture the context in which the function call is made. This is the context
// that is needed when the accessibility of template arguments is checked.
DeclContext *CallingCtx = CurContext;

TemplateDeductionResult Result;
runWithSufficientStackSpace(Info.getLocation(), [&] {
  Result = FinishTemplateArgumentDeduction(
      FunctionTemplate, Deduced, NumExplicitlySpecified, Specialization, Info,
      &OriginalCallArgs, PartialOverloading, [&, CallingCtx]() {
        ContextRAII SavedContext(*this, CallingCtx);
        return CheckNonDependent(ParamTypesForArgChecking);
      });
});
return Result;
4219}

4221QualType Sema::adjustCCAndNoReturn(QualType ArgFunctionType,
                                 QualType FunctionType,
                                 bool AdjustExceptionSpec) {
if (ArgFunctionType.isNull())
  return ArgFunctionType;

const auto *FunctionTypeP = FunctionType->castAs<FunctionProtoType>();
const auto *ArgFunctionTypeP = ArgFunctionType->castAs<FunctionProtoType>();
FunctionProtoType::ExtProtoInfo EPI = ArgFunctionTypeP->getExtProtoInfo();
bool Rebuild = false;

CallingConv CC = FunctionTypeP->getCallConv();
if (EPI.ExtInfo.getCC() != CC) {
  EPI.ExtInfo = EPI.ExtInfo.withCallingConv(CC);
  Rebuild = true;
}

bool NoReturn = FunctionTypeP->getNoReturnAttr();
if (EPI.ExtInfo.getNoReturn() != NoReturn) {
  EPI.ExtInfo = EPI.ExtInfo.withNoReturn(NoReturn);
  Rebuild = true;
}

if (AdjustExceptionSpec && (FunctionTypeP->hasExceptionSpec() ||
                            ArgFunctionTypeP->hasExceptionSpec())) {
  EPI.ExceptionSpec = FunctionTypeP->getExtProtoInfo().ExceptionSpec;
  Rebuild = true;
}

if (!Rebuild)
  return ArgFunctionType;

return Context.getFunctionType(ArgFunctionTypeP->getReturnType(),
                               ArgFunctionTypeP->getParamTypes(), EPI);
4255}

4257/// Deduce template arguments when taking the address of a function
4258/// template (C++ [temp.deduct.funcaddr]) or matching a specialization to
4259/// a template.
4260///
4261/// \param FunctionTemplate the function template for which we are performing
4262/// template argument deduction.
4263///
4264/// \param ExplicitTemplateArgs the explicitly-specified template
4265/// arguments.
4266///
4267/// \param ArgFunctionType the function type that will be used as the
4268/// "argument" type (A) when performing template argument deduction from the
4269/// function template's function type. This type may be NULL, if there is no
4270/// argument type to compare against, in C++0x [temp.arg.explicit]p3.
4271///
4272/// \param Specialization if template argument deduction was successful,
4273/// this will be set to the function template specialization produced by
4274/// template argument deduction.
4275///
4276/// \param Info the argument will be updated to provide additional information
4277/// about template argument deduction.
4278///
4279/// \param IsAddressOfFunction If \c true, we are deducing as part of taking
4280/// the address of a function template per [temp.deduct.funcaddr] and
4281/// [over.over]. If \c false, we are looking up a function template
4282/// specialization based on its signature, per [temp.deduct.decl].
4283///
4284/// \returns the result of template argument deduction.
4285Sema::TemplateDeductionResult Sema::DeduceTemplateArguments(
  FunctionTemplateDecl *FunctionTemplate,
  TemplateArgumentListInfo *ExplicitTemplateArgs, QualType ArgFunctionType,
  FunctionDecl *&Specialization, TemplateDeductionInfo &Info,
  bool IsAddressOfFunction) {
if (FunctionTemplate->isInvalidDecl())
  return TDK_Invalid;

FunctionDecl *Function = FunctionTemplate->getTemplatedDecl();
TemplateParameterList *TemplateParams
  = FunctionTemplate->getTemplateParameters();
QualType FunctionType = Function->getType();

// Substitute any explicit template arguments.
LocalInstantiationScope InstScope(*this);
SmallVector<DeducedTemplateArgument, 4> Deduced;
unsigned NumExplicitlySpecified = 0;
SmallVector<QualType, 4> ParamTypes;
if (ExplicitTemplateArgs) {
  TemplateDeductionResult Result;
  runWithSufficientStackSpace(Info.getLocation(), [&] {
    Result = SubstituteExplicitTemplateArguments(
        FunctionTemplate, *ExplicitTemplateArgs, Deduced, ParamTypes,
        &FunctionType, Info);
  });
  if (Result)
    return Result;

  NumExplicitlySpecified = Deduced.size();
}

// When taking the address of a function, we require convertibility of
// the resulting function type. Otherwise, we allow arbitrary mismatches
// of calling convention and noreturn.
if (!IsAddressOfFunction)
  ArgFunctionType = adjustCCAndNoReturn(ArgFunctionType, FunctionType,
                                        /*AdjustExceptionSpec*/false);

// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    *this, Sema::ExpressionEvaluationContext::Unevaluated);
SFINAETrap Trap(*this);

Deduced.resize(TemplateParams->size());

// If the function has a deduced return type, substitute it for a dependent
// type so that we treat it as a non-deduced context in what follows. If we
// are looking up by signature, the signature type should also have a deduced
// return type, which we instead expect to exactly match.
bool HasDeducedReturnType = false;
if (getLangOpts().CPlusPlus14 && IsAddressOfFunction &&
    Function->getReturnType()->getContainedAutoType()) {
  FunctionType = SubstAutoType(FunctionType, Context.DependentTy);
  HasDeducedReturnType = true;
}

if (!ArgFunctionType.isNull()) {
  unsigned TDF =
      TDF_TopLevelParameterTypeList | TDF_AllowCompatibleFunctionType;
  // Deduce template arguments from the function type.
  if (TemplateDeductionResult Result
        = DeduceTemplateArgumentsByTypeMatch(*this, TemplateParams,
                                             FunctionType, ArgFunctionType,
                                             Info, Deduced, TDF))
    return Result;
}

TemplateDeductionResult Result;
runWithSufficientStackSpace(Info.getLocation(), [&] {
  Result = FinishTemplateArgumentDeduction(FunctionTemplate, Deduced,
                                           NumExplicitlySpecified,
                                           Specialization, Info);
});
if (Result)
  return Result;

// If the function has a deduced return type, deduce it now, so we can check
// that the deduced function type matches the requested type.
if (HasDeducedReturnType &&
    Specialization->getReturnType()->isUndeducedType() &&
    DeduceReturnType(Specialization, Info.getLocation(), false))
  return TDK_MiscellaneousDeductionFailure;

// If the function has a dependent exception specification, resolve it now,
// so we can check that the exception specification matches.
auto *SpecializationFPT =
    Specialization->getType()->castAs<FunctionProtoType>();
if (getLangOpts().CPlusPlus17 &&
    isUnresolvedExceptionSpec(SpecializationFPT->getExceptionSpecType()) &&
    !ResolveExceptionSpec(Info.getLocation(), SpecializationFPT))
  return TDK_MiscellaneousDeductionFailure;

// Adjust the exception specification of the argument to match the
// substituted and resolved type we just formed. (Calling convention and
// noreturn can't be dependent, so we don't actually need this for them
// right now.)
QualType SpecializationType = Specialization->getType();
if (!IsAddressOfFunction)
  ArgFunctionType = adjustCCAndNoReturn(ArgFunctionType, SpecializationType,
                                        /*AdjustExceptionSpec*/true);

// If the requested function type does not match the actual type of the
// specialization with respect to arguments of compatible pointer to function
// types, template argument deduction fails.
if (!ArgFunctionType.isNull()) {
  if (IsAddressOfFunction &&
      !isSameOrCompatibleFunctionType(
          Context.getCanonicalType(SpecializationType),
          Context.getCanonicalType(ArgFunctionType)))
    return TDK_MiscellaneousDeductionFailure;

  if (!IsAddressOfFunction &&
      !Context.hasSameType(SpecializationType, ArgFunctionType))
    return TDK_MiscellaneousDeductionFailure;
}

return TDK_Success;
4402}

4404/// Deduce template arguments for a templated conversion
4405/// function (C++ [temp.deduct.conv]) and, if successful, produce a
4406/// conversion function template specialization.
4407Sema::TemplateDeductionResult
4408Sema::DeduceTemplateArguments(FunctionTemplateDecl *ConversionTemplate,
                            QualType ToType,
                            CXXConversionDecl *&Specialization,
                            TemplateDeductionInfo &Info) {
if (ConversionTemplate->isInvalidDecl())
  return TDK_Invalid;

CXXConversionDecl *ConversionGeneric
  = cast<CXXConversionDecl>(ConversionTemplate->getTemplatedDecl());

QualType FromType = ConversionGeneric->getConversionType();

// Canonicalize the types for deduction.
QualType P = Context.getCanonicalType(FromType);
QualType A = Context.getCanonicalType(ToType);

// C++0x [temp.deduct.conv]p2:
//   If P is a reference type, the type referred to by P is used for
//   type deduction.
if (const ReferenceType *PRef = P->getAs<ReferenceType>())
  P = PRef->getPointeeType();

// C++0x [temp.deduct.conv]p4:
//   [...] If A is a reference type, the type referred to by A is used
//   for type deduction.
if (const ReferenceType *ARef = A->getAs<ReferenceType>()) {
  A = ARef->getPointeeType();
  // We work around a defect in the standard here: cv-qualifiers are also
  // removed from P and A in this case, unless P was a reference type. This
  // seems to mostly match what other compilers are doing.
  if (!FromType->getAs<ReferenceType>()) {
    A = A.getUnqualifiedType();
    P = P.getUnqualifiedType();
  }

// C++ [temp.deduct.conv]p3:
//
//   If A is not a reference type:
} else {
  assert(!A->isReferenceType() && "Reference types were handled above")((!A->isReferenceType() && "Reference types were handled above"
) ? static_cast<void> (0) : __assert_fail ("!A->isReferenceType() && \"Reference types were handled above\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4447, __PRETTY_FUNCTION__));

  //   - If P is an array type, the pointer type produced by the
  //     array-to-pointer standard conversion (4.2) is used in place
  //     of P for type deduction; otherwise,
  if (P->isArrayType())
    P = Context.getArrayDecayedType(P);
  //   - If P is a function type, the pointer type produced by the
  //     function-to-pointer standard conversion (4.3) is used in
  //     place of P for type deduction; otherwise,
  else if (P->isFunctionType())
    P = Context.getPointerType(P);
  //   - If P is a cv-qualified type, the top level cv-qualifiers of
  //     P's type are ignored for type deduction.
  else
    P = P.getUnqualifiedType();

  // C++0x [temp.deduct.conv]p4:
  //   If A is a cv-qualified type, the top level cv-qualifiers of A's
  //   type are ignored for type deduction. If A is a reference type, the type
  //   referred to by A is used for type deduction.
  A = A.getUnqualifiedType();
}

// Unevaluated SFINAE context.
EnterExpressionEvaluationContext Unevaluated(
    *this, Sema::ExpressionEvaluationContext::Unevaluated);
SFINAETrap Trap(*this);

// C++ [temp.deduct.conv]p1:
//   Template argument deduction is done by comparing the return
//   type of the template conversion function (call it P) with the
//   type that is required as the result of the conversion (call it
//   A) as described in 14.8.2.4.
TemplateParameterList *TemplateParams
  = ConversionTemplate->getTemplateParameters();
SmallVector<DeducedTemplateArgument, 4> Deduced;
Deduced.resize(TemplateParams->size());

// C++0x [temp.deduct.conv]p4:
//   In general, the deduction process attempts to find template
//   argument values that will make the deduced A identical to
//   A. However, there are two cases that allow a difference:
unsigned TDF = 0;
//     - If the original A is a reference type, A can be more
//       cv-qualified than the deduced A (i.e., the type referred to
//       by the reference)
if (ToType->isReferenceType())
  TDF |= TDF_ArgWithReferenceType;
//     - The deduced A can be another pointer or pointer to member
//       type that can be converted to A via a qualification
//       conversion.
//
// (C++0x [temp.deduct.conv]p6 clarifies that this only happens when
// both P and A are pointers or member pointers. In this case, we
// just ignore cv-qualifiers completely).
if ((P->isPointerType() && A->isPointerType()) ||
    (P->isMemberPointerType() && A->isMemberPointerType()))
  TDF |= TDF_IgnoreQualifiers;
if (TemplateDeductionResult Result
      = DeduceTemplateArgumentsByTypeMatch(*this, TemplateParams,
                                           P, A, Info, Deduced, TDF))
  return Result;

// Create an Instantiation Scope for finalizing the operator.
LocalInstantiationScope InstScope(*this);
// Finish template argument deduction.
FunctionDecl *ConversionSpecialized = nullptr;
TemplateDeductionResult Result;
runWithSufficientStackSpace(Info.getLocation(), [&] {
  Result = FinishTemplateArgumentDeduction(ConversionTemplate, Deduced, 0,
                                           ConversionSpecialized, Info);
});
Specialization = cast_or_null<CXXConversionDecl>(ConversionSpecialized);
return Result;
4522}

4524/// Deduce template arguments for a function template when there is
4525/// nothing to deduce against (C++0x [temp.arg.explicit]p3).
4526///
4527/// \param FunctionTemplate the function template for which we are performing
4528/// template argument deduction.
4529///
4530/// \param ExplicitTemplateArgs the explicitly-specified template
4531/// arguments.
4532///
4533/// \param Specialization if template argument deduction was successful,
4534/// this will be set to the function template specialization produced by
4535/// template argument deduction.
4536///
4537/// \param Info the argument will be updated to provide additional information
4538/// about template argument deduction.
4539///
4540/// \param IsAddressOfFunction If \c true, we are deducing as part of taking
4541/// the address of a function template in a context where we do not have a
4542/// target type, per [over.over]. If \c false, we are looking up a function
4543/// template specialization based on its signature, which only happens when
4544/// deducing a function parameter type from an argument that is a template-id
4545/// naming a function template specialization.
4546///
4547/// \returns the result of template argument deduction.
4548Sema::TemplateDeductionResult Sema::DeduceTemplateArguments(
  FunctionTemplateDecl *FunctionTemplate,
  TemplateArgumentListInfo *ExplicitTemplateArgs,
  FunctionDecl *&Specialization, TemplateDeductionInfo &Info,
  bool IsAddressOfFunction) {
return DeduceTemplateArguments(FunctionTemplate, ExplicitTemplateArgs,
                               QualType(), Specialization, Info,
                               IsAddressOfFunction);
4556}

4558namespace {
struct DependentAuto { bool IsPack; };

/// Substitute the 'auto' specifier or deduced template specialization type
/// specifier within a type for a given replacement type.
class SubstituteDeducedTypeTransform :
    public TreeTransform<SubstituteDeducedTypeTransform> {
  QualType Replacement;
  bool ReplacementIsPack;
  bool UseTypeSugar;

public:
  SubstituteDeducedTypeTransform(Sema &SemaRef, DependentAuto DA)
      : TreeTransform<SubstituteDeducedTypeTransform>(SemaRef), Replacement(),
        ReplacementIsPack(DA.IsPack), UseTypeSugar(true) {}

  SubstituteDeducedTypeTransform(Sema &SemaRef, QualType Replacement,
                                 bool UseTypeSugar = true)
      : TreeTransform<SubstituteDeducedTypeTransform>(SemaRef),
        Replacement(Replacement), ReplacementIsPack(false),
        UseTypeSugar(UseTypeSugar) {}

  QualType TransformDesugared(TypeLocBuilder &TLB, DeducedTypeLoc TL) {
    assert(isa<TemplateTypeParmType>(Replacement) &&((isa<TemplateTypeParmType>(Replacement) && "unexpected unsugared replacement kind"
) ? static_cast<void> (0) : __assert_fail ("isa<TemplateTypeParmType>(Replacement) && \"unexpected unsugared replacement kind\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4582, __PRETTY_FUNCTION__))
           "unexpected unsugared replacement kind")((isa<TemplateTypeParmType>(Replacement) && "unexpected unsugared replacement kind"
) ? static_cast<void> (0) : __assert_fail ("isa<TemplateTypeParmType>(Replacement) && \"unexpected unsugared replacement kind\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4582, __PRETTY_FUNCTION__));
    QualType Result = Replacement;
    TemplateTypeParmTypeLoc NewTL = TLB.push<TemplateTypeParmTypeLoc>(Result);
    NewTL.setNameLoc(TL.getNameLoc());
    return Result;
  }

  QualType TransformAutoType(TypeLocBuilder &TLB, AutoTypeLoc TL) {
    // If we're building the type pattern to deduce against, don't wrap the
    // substituted type in an AutoType. Certain template deduction rules
    // apply only when a template type parameter appears directly (and not if
    // the parameter is found through desugaring). For instance:
    //   auto &&lref = lvalue;
    // must transform into "rvalue reference to T" not "rvalue reference to
    // auto type deduced as T" in order for [temp.deduct.call]p3 to apply.
    //
    // FIXME: Is this still necessary?
    if (!UseTypeSugar)
      return TransformDesugared(TLB, TL);

    QualType Result = SemaRef.Context.getAutoType(
        Replacement, TL.getTypePtr()->getKeyword(), Replacement.isNull(),
        ReplacementIsPack, TL.getTypePtr()->getTypeConstraintConcept(),
        TL.getTypePtr()->getTypeConstraintArguments());
    auto NewTL = TLB.push<AutoTypeLoc>(Result);
    NewTL.copy(TL);
    return Result;
  }

  QualType TransformDeducedTemplateSpecializationType(
      TypeLocBuilder &TLB, DeducedTemplateSpecializationTypeLoc TL) {
    if (!UseTypeSugar)
      return TransformDesugared(TLB, TL);

    QualType Result = SemaRef.Context.getDeducedTemplateSpecializationType(
        TL.getTypePtr()->getTemplateName(),
        Replacement, Replacement.isNull());
    auto NewTL = TLB.push<DeducedTemplateSpecializationTypeLoc>(Result);
    NewTL.setNameLoc(TL.getNameLoc());
    return Result;
  }

  ExprResult TransformLambdaExpr(LambdaExpr *E) {
    // Lambdas never need to be transformed.
    return E;
  }

  QualType Apply(TypeLoc TL) {
    // Create some scratch storage for the transformed type locations.
    // FIXME: We're just going to throw this information away. Don't build it.
    TypeLocBuilder TLB;
    TLB.reserve(TL.getFullDataSize());
    return TransformType(TLB, TL);
  }
};

4638} // namespace

4640Sema::DeduceAutoResult
4641Sema::DeduceAutoType(TypeSourceInfo *Type, Expr *&Init, QualType &Result,
                   Optional<unsigned> DependentDeductionDepth,
                   bool IgnoreConstraints) {
return DeduceAutoType(Type->getTypeLoc(), Init, Result,
1
Calling 'Sema::DeduceAutoType'→
                      DependentDeductionDepth, IgnoreConstraints);
4646}

4648/// Attempt to produce an informative diagostic explaining why auto deduction
4649/// failed.
4650/// \return \c true if diagnosed, \c false if not.
4651static bool diagnoseAutoDeductionFailure(Sema &S,
                                       Sema::TemplateDeductionResult TDK,
                                       TemplateDeductionInfo &Info,
                                       ArrayRef<SourceRange> Ranges) {
switch (TDK) {
case Sema::TDK_Inconsistent: {
  // Inconsistent deduction means we were deducing from an initializer list.
  auto D = S.Diag(Info.getLocation(), diag::err_auto_inconsistent_deduction);
  D << Info.FirstArg << Info.SecondArg;
  for (auto R : Ranges)
    D << R;
  return true;
}

// FIXME: Are there other cases for which a custom diagnostic is more useful
// than the basic "types don't match" diagnostic?

default:
  return false;
}
4671}

4673static Sema::DeduceAutoResult
4674CheckDeducedPlaceholderConstraints(Sema &S, const AutoType &Type,
                                 AutoTypeLoc TypeLoc, QualType Deduced) {
ConstraintSatisfaction Satisfaction;
ConceptDecl *Concept = Type.getTypeConstraintConcept();
TemplateArgumentListInfo TemplateArgs(TypeLoc.getLAngleLoc(),
                                      TypeLoc.getRAngleLoc());
TemplateArgs.addArgument(
    TemplateArgumentLoc(TemplateArgument(Deduced),
                        S.Context.getTrivialTypeSourceInfo(
                            Deduced, TypeLoc.getNameLoc())));
for (unsigned I = 0, C = TypeLoc.getNumArgs(); I != C; ++I)
  TemplateArgs.addArgument(TypeLoc.getArgLoc(I));

llvm::SmallVector<TemplateArgument, 4> Converted;
if (S.CheckTemplateArgumentList(Concept, SourceLocation(), TemplateArgs,
                                /*PartialTemplateArgs=*/false, Converted))
  return Sema::DAR_FailedAlreadyDiagnosed;
if (S.CheckConstraintSatisfaction(Concept, {Concept->getConstraintExpr()},
                                  Converted, TypeLoc.getLocalSourceRange(),
                                  Satisfaction))
  return Sema::DAR_FailedAlreadyDiagnosed;
if (!Satisfaction.IsSatisfied) {
  std::string Buf;
  llvm::raw_string_ostream OS(Buf);
  OS << "'" << Concept->getName();
  if (TypeLoc.hasExplicitTemplateArgs()) {
    OS << "<";
    for (const auto &Arg : Type.getTypeConstraintArguments())
      Arg.print(S.getPrintingPolicy(), OS);
    OS << ">";
  }
  OS << "'";
  OS.flush();
  S.Diag(TypeLoc.getConceptNameLoc(),
         diag::err_placeholder_constraints_not_satisfied)
       << Deduced << Buf << TypeLoc.getLocalSourceRange();
  S.DiagnoseUnsatisfiedConstraint(Satisfaction);
  return Sema::DAR_FailedAlreadyDiagnosed;
}
return Sema::DAR_Succeeded;
4714}

4716/// Deduce the type for an auto type-specifier (C++11 [dcl.spec.auto]p6)
4717///
4718/// Note that this is done even if the initializer is dependent. (This is
4719/// necessary to support partial ordering of templates using 'auto'.)
4720/// A dependent type will be produced when deducing from a dependent type.
4721///
4722/// \param Type the type pattern using the auto type-specifier.
4723/// \param Init the initializer for the variable whose type is to be deduced.
4724/// \param Result if type deduction was successful, this will be set to the
4725///        deduced type.
4726/// \param DependentDeductionDepth Set if we should permit deduction in
4727///        dependent cases. This is necessary for template partial ordering with
4728///        'auto' template parameters. The value specified is the template
4729///        parameter depth at which we should perform 'auto' deduction.
4730/// \param IgnoreConstraints Set if we should not fail if the deduced type does
4731///                          not satisfy the type-constraint in the auto type.
4732Sema::DeduceAutoResult
4733Sema::DeduceAutoType(TypeLoc Type, Expr *&Init, QualType &Result,
                   Optional<unsigned> DependentDeductionDepth,
                   bool IgnoreConstraints) {
if (Init->containsErrors())
2
←
Assuming the condition is false→
3
←
Taking false branch→
  return DAR_FailedAlreadyDiagnosed;
if (Init->getType()->isNonOverloadPlaceholderType()) {
4
←
Taking false branch→
  ExprResult NonPlaceholder = CheckPlaceholderExpr(Init);
  if (NonPlaceholder.isInvalid())
    return DAR_FailedAlreadyDiagnosed;
  Init = NonPlaceholder.get();
}

DependentAuto DependentResult = {
    /*.IsPack = */ (bool)Type.getAs<PackExpansionTypeLoc>()};

if (!DependentDeductionDepth &&
5
←
Assuming the condition is false→
6
←
Taking false branch→
    (Type.getType()->isDependentType() || Init->isTypeDependent() ||
     Init->containsUnexpandedParameterPack())) {
  Result = SubstituteDeducedTypeTransform(*this, DependentResult).Apply(Type);
  assert(!Result.isNull() && "substituting DependentTy can't fail")((!Result.isNull() && "substituting DependentTy can't fail"
) ? static_cast<void> (0) : __assert_fail ("!Result.isNull() && \"substituting DependentTy can't fail\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4752, __PRETTY_FUNCTION__));
  return DAR_Succeeded;
}

// Find the depth of template parameter to synthesize.
unsigned Depth = DependentDeductionDepth.getValueOr(0);

// If this is a 'decltype(auto)' specifier, do the decltype dance.
// Since 'decltype(auto)' can only occur at the top of the type, we
// don't need to go digging for it.
if (const AutoType *AT7.1
'AT' is null
1
'AT' is null
1
'AT' is null
 = Type.getType()->getAs<AutoType>()) {
7
←
Assuming the object is not a 'AutoType'→
8
←
Taking false branch→
  if (AT->isDecltypeAuto()) {
    if (isa<InitListExpr>(Init)) {
      Diag(Init->getBeginLoc(), diag::err_decltype_auto_initializer_list);
      return DAR_FailedAlreadyDiagnosed;
    }

    ExprResult ER = CheckPlaceholderExpr(Init);
    if (ER.isInvalid())
      return DAR_FailedAlreadyDiagnosed;
    Init = ER.get();
    QualType Deduced = BuildDecltypeType(Init, Init->getBeginLoc(), false);
    if (Deduced.isNull())
      return DAR_FailedAlreadyDiagnosed;
    // FIXME: Support a non-canonical deduced type for 'auto'.
    Deduced = Context.getCanonicalType(Deduced);
    if (AT->isConstrained() && !IgnoreConstraints) {
      auto ConstraintsResult =
          CheckDeducedPlaceholderConstraints(*this, *AT,
                                             Type.getContainedAutoTypeLoc(),
                                             Deduced);
      if (ConstraintsResult != DAR_Succeeded)
        return ConstraintsResult;
    }
    Result = SubstituteDeducedTypeTransform(*this, Deduced).Apply(Type);
    if (Result.isNull())
      return DAR_FailedAlreadyDiagnosed;
    return DAR_Succeeded;
  } else if (!getLangOpts().CPlusPlus) {
    if (isa<InitListExpr>(Init)) {
      Diag(Init->getBeginLoc(), diag::err_auto_init_list_from_c);
      return DAR_FailedAlreadyDiagnosed;
    }
  }
}

SourceLocation Loc = Init->getExprLoc();

LocalInstantiationScope InstScope(*this);

// Build template<class TemplParam> void Func(FuncParam);
TemplateTypeParmDecl *TemplParam = TemplateTypeParmDecl::Create(
    Context, nullptr, SourceLocation(), Loc, Depth, 0, nullptr, false, false,
    false);
QualType TemplArg = QualType(TemplParam->getTypeForDecl(), 0);
NamedDecl *TemplParamPtr = TemplParam;
FixedSizeTemplateParameterListStorage<1, false> TemplateParamsSt(
    Context, Loc, Loc, TemplParamPtr, Loc, nullptr);

QualType FuncParam =
    SubstituteDeducedTypeTransform(*this, TemplArg, /*UseTypeSugar*/false)
        .Apply(Type);
assert(!FuncParam.isNull() &&((!FuncParam.isNull() && "substituting template parameter for 'auto' failed"
) ? static_cast<void> (0) : __assert_fail ("!FuncParam.isNull() && \"substituting template parameter for 'auto' failed\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4815, __PRETTY_FUNCTION__))
9
←
'?' condition is true→
       "substituting template parameter for 'auto' failed")((!FuncParam.isNull() && "substituting template parameter for 'auto' failed"
) ? static_cast<void> (0) : __assert_fail ("!FuncParam.isNull() && \"substituting template parameter for 'auto' failed\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4815, __PRETTY_FUNCTION__));

// Deduce type of TemplParam in Func(Init)
SmallVector<DeducedTemplateArgument, 1> Deduced;
Deduced.resize(1);

TemplateDeductionInfo Info(Loc, Depth);

// If deduction failed, don't diagnose if the initializer is dependent; it
// might acquire a matching type in the instantiation.
auto DeductionFailed = [&](TemplateDeductionResult TDK,
                           ArrayRef<SourceRange> Ranges) -> DeduceAutoResult {
  if (Init->isTypeDependent()) {
    Result =
        SubstituteDeducedTypeTransform(*this, DependentResult).Apply(Type);
    assert(!Result.isNull() && "substituting DependentTy can't fail")((!Result.isNull() && "substituting DependentTy can't fail"
) ? static_cast<void> (0) : __assert_fail ("!Result.isNull() && \"substituting DependentTy can't fail\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4830, __PRETTY_FUNCTION__));
    return DAR_Succeeded;
  }
  if (diagnoseAutoDeductionFailure(*this, TDK, Info, Ranges))
    return DAR_FailedAlreadyDiagnosed;
  return DAR_Failed;
};

SmallVector<OriginalCallArg, 4> OriginalCallArgs;

InitListExpr *InitList = dyn_cast<InitListExpr>(Init);
10
←
Assuming 'Init' is not a 'InitListExpr'→
if (InitList10.1
'InitList' is null
1
'InitList' is null
1
'InitList' is null
) {
11
←
Taking false branch→
  // Notionally, we substitute std::initializer_list<T> for 'auto' and deduce
  // against that. Such deduction only succeeds if removing cv-qualifiers and
  // references results in std::initializer_list<T>.
  if (!Type.getType().getNonReferenceType()->getAs<AutoType>())
    return DAR_Failed;

  // Resolving a core issue: a braced-init-list containing any designators is
  // a non-deduced context.
  for (Expr *E : InitList->inits())
    if (isa<DesignatedInitExpr>(E))
      return DAR_Failed;

  SourceRange DeducedFromInitRange;
  for (unsigned i = 0, e = InitList->getNumInits(); i < e; ++i) {
    Expr *Init = InitList->getInit(i);

    if (auto TDK = DeduceTemplateArgumentsFromCallArgument(
            *this, TemplateParamsSt.get(), 0, TemplArg, Init,
            Info, Deduced, OriginalCallArgs, /*Decomposed*/ true,
            /*ArgIdx*/ 0, /*TDF*/ 0))
      return DeductionFailed(TDK, {DeducedFromInitRange,
                                   Init->getSourceRange()});

    if (DeducedFromInitRange.isInvalid() &&
        Deduced[0].getKind() != TemplateArgument::Null)
      DeducedFromInitRange = Init->getSourceRange();
  }
} else {
  if (!getLangOpts().CPlusPlus && Init->refersToBitField()) {
12
←
Assuming field 'CPlusPlus' is not equal to 0→
    Diag(Loc, diag::err_auto_bitfield);
    return DAR_FailedAlreadyDiagnosed;
  }

  if (auto TDK = DeduceTemplateArgumentsFromCallArgument(
13
←
Calling 'DeduceTemplateArgumentsFromCallArgument'→
          *this, TemplateParamsSt.get(), 0, FuncParam, Init, Info, Deduced,
          OriginalCallArgs, /*Decomposed*/ false, /*ArgIdx*/ 0, /*TDF*/ 0))
    return DeductionFailed(TDK, {});
}

// Could be null if somehow 'auto' appears in a non-deduced context.
if (Deduced[0].getKind() != TemplateArgument::Type)
  return DeductionFailed(TDK_Incomplete, {});

QualType DeducedType = Deduced[0].getAsType();

if (InitList) {
  DeducedType = BuildStdInitializerList(DeducedType, Loc);
  if (DeducedType.isNull())
    return DAR_FailedAlreadyDiagnosed;
}

if (const auto *AT = Type.getType()->getAs<AutoType>()) {
  if (AT->isConstrained() && !IgnoreConstraints) {
    auto ConstraintsResult =
        CheckDeducedPlaceholderConstraints(*this, *AT,
                                           Type.getContainedAutoTypeLoc(),
                                           DeducedType);
    if (ConstraintsResult != DAR_Succeeded)
      return ConstraintsResult;
  }
}

Result = SubstituteDeducedTypeTransform(*this, DeducedType).Apply(Type);
if (Result.isNull())
  return DAR_FailedAlreadyDiagnosed;

// Check that the deduced argument type is compatible with the original
// argument type per C++ [temp.deduct.call]p4.
QualType DeducedA = InitList ? Deduced[0].getAsType() : Result;
for (const OriginalCallArg &OriginalArg : OriginalCallArgs) {
  assert((bool)InitList == OriginalArg.DecomposedParam &&(((bool)InitList == OriginalArg.DecomposedParam && "decomposed non-init-list in auto deduction?"
) ? static_cast<void> (0) : __assert_fail ("(bool)InitList == OriginalArg.DecomposedParam && \"decomposed non-init-list in auto deduction?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4913, __PRETTY_FUNCTION__))
         "decomposed non-init-list in auto deduction?")(((bool)InitList == OriginalArg.DecomposedParam && "decomposed non-init-list in auto deduction?"
) ? static_cast<void> (0) : __assert_fail ("(bool)InitList == OriginalArg.DecomposedParam && \"decomposed non-init-list in auto deduction?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4913, __PRETTY_FUNCTION__));
  if (auto TDK =
          CheckOriginalCallArgDeduction(*this, Info, OriginalArg, DeducedA)) {
    Result = QualType();
    return DeductionFailed(TDK, {});
  }
}

return DAR_Succeeded;
4922}

4924QualType Sema::SubstAutoType(QualType TypeWithAuto,
                           QualType TypeToReplaceAuto) {
if (TypeToReplaceAuto->isDependentType())
  return SubstituteDeducedTypeTransform(
             *this, DependentAuto{
                        TypeToReplaceAuto->containsUnexpandedParameterPack()})
      .TransformType(TypeWithAuto);
return SubstituteDeducedTypeTransform(*this, TypeToReplaceAuto)
    .TransformType(TypeWithAuto);
4933}

4935TypeSourceInfo *Sema::SubstAutoTypeSourceInfo(TypeSourceInfo *TypeWithAuto,
                                            QualType TypeToReplaceAuto) {
if (TypeToReplaceAuto->isDependentType())
  return SubstituteDeducedTypeTransform(
             *this,
             DependentAuto{
                 TypeToReplaceAuto->containsUnexpandedParameterPack()})
      .TransformType(TypeWithAuto);
return SubstituteDeducedTypeTransform(*this, TypeToReplaceAuto)
    .TransformType(TypeWithAuto);
4945}

4947QualType Sema::ReplaceAutoType(QualType TypeWithAuto,
                             QualType TypeToReplaceAuto) {
return SubstituteDeducedTypeTransform(*this, TypeToReplaceAuto,
                                      /*UseTypeSugar*/ false)
    .TransformType(TypeWithAuto);
4952}

4954TypeSourceInfo *Sema::ReplaceAutoTypeSourceInfo(TypeSourceInfo *TypeWithAuto,
                                              QualType TypeToReplaceAuto) {
return SubstituteDeducedTypeTransform(*this, TypeToReplaceAuto,
                                      /*UseTypeSugar*/ false)
    .TransformType(TypeWithAuto);
4959}

4961void Sema::DiagnoseAutoDeductionFailure(VarDecl *VDecl, Expr *Init) {
if (isa<InitListExpr>(Init))
  Diag(VDecl->getLocation(),
       VDecl->isInitCapture()
           ? diag::err_init_capture_deduction_failure_from_init_list
           : diag::err_auto_var_deduction_failure_from_init_list)
    << VDecl->getDeclName() << VDecl->getType() << Init->getSourceRange();
else
  Diag(VDecl->getLocation(),
       VDecl->isInitCapture() ? diag::err_init_capture_deduction_failure
                              : diag::err_auto_var_deduction_failure)
    << VDecl->getDeclName() << VDecl->getType() << Init->getType()
    << Init->getSourceRange();
4974}

4976bool Sema::DeduceReturnType(FunctionDecl *FD, SourceLocation Loc,
                          bool Diagnose) {
assert(FD->getReturnType()->isUndeducedType())((FD->getReturnType()->isUndeducedType()) ? static_cast
<void> (0) : __assert_fail ("FD->getReturnType()->isUndeducedType()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 4978, __PRETTY_FUNCTION__));

// For a lambda's conversion operator, deduce any 'auto' or 'decltype(auto)'
// within the return type from the call operator's type.
if (isLambdaConversionOperator(FD)) {
  CXXRecordDecl *Lambda = cast<CXXMethodDecl>(FD)->getParent();
  FunctionDecl *CallOp = Lambda->getLambdaCallOperator();

  // For a generic lambda, instantiate the call operator if needed.
  if (auto *Args = FD->getTemplateSpecializationArgs()) {
    CallOp = InstantiateFunctionDeclaration(
        CallOp->getDescribedFunctionTemplate(), Args, Loc);
    if (!CallOp || CallOp->isInvalidDecl())
      return true;

    // We might need to deduce the return type by instantiating the definition
    // of the operator() function.
    if (CallOp->getReturnType()->isUndeducedType()) {
      runWithSufficientStackSpace(Loc, [&] {
        InstantiateFunctionDefinition(Loc, CallOp);
      });
    }
  }

  if (CallOp->isInvalidDecl())
    return true;
  assert(!CallOp->getReturnType()->isUndeducedType() &&((!CallOp->getReturnType()->isUndeducedType() &&
 "failed to deduce lambda return type") ? static_cast<void
> (0) : __assert_fail ("!CallOp->getReturnType()->isUndeducedType() && \"failed to deduce lambda return type\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5005, __PRETTY_FUNCTION__))
         "failed to deduce lambda return type")((!CallOp->getReturnType()->isUndeducedType() &&
 "failed to deduce lambda return type") ? static_cast<void
> (0) : __assert_fail ("!CallOp->getReturnType()->isUndeducedType() && \"failed to deduce lambda return type\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5005, __PRETTY_FUNCTION__));

  // Build the new return type from scratch.
  CallingConv RetTyCC = FD->getReturnType()
                            ->getPointeeType()
                            ->castAs<FunctionType>()
                            ->getCallConv();
  QualType RetType = getLambdaConversionFunctionResultType(
      CallOp->getType()->castAs<FunctionProtoType>(), RetTyCC);
  if (FD->getReturnType()->getAs<PointerType>())
    RetType = Context.getPointerType(RetType);
  else {
    assert(FD->getReturnType()->getAs<BlockPointerType>())((FD->getReturnType()->getAs<BlockPointerType>())
 ? static_cast<void> (0) : __assert_fail ("FD->getReturnType()->getAs<BlockPointerType>()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5017, __PRETTY_FUNCTION__));
    RetType = Context.getBlockPointerType(RetType);
  }
  Context.adjustDeducedFunctionResultType(FD, RetType);
  return false;
}

if (FD->getTemplateInstantiationPattern()) {
  runWithSufficientStackSpace(Loc, [&] {
    InstantiateFunctionDefinition(Loc, FD);
  });
}

bool StillUndeduced = FD->getReturnType()->isUndeducedType();
if (StillUndeduced && Diagnose && !FD->isInvalidDecl()) {
  Diag(Loc, diag::err_auto_fn_used_before_defined) << FD;
  Diag(FD->getLocation(), diag::note_callee_decl) << FD;
}

return StillUndeduced;
5037}

5039/// If this is a non-static member function,
5040static void
5041AddImplicitObjectParameterType(ASTContext &Context,
                             CXXMethodDecl *Method,
                             SmallVectorImpl<QualType> &ArgTypes) {
// C++11 [temp.func.order]p3:
//   [...] The new parameter is of type "reference to cv A," where cv are
//   the cv-qualifiers of the function template (if any) and A is
//   the class of which the function template is a member.
//
// The standard doesn't say explicitly, but we pick the appropriate kind of
// reference type based on [over.match.funcs]p4.
QualType ArgTy = Context.getTypeDeclType(Method->getParent());
ArgTy = Context.getQualifiedType(ArgTy, Method->getMethodQualifiers());
if (Method->getRefQualifier() == RQ_RValue)
  ArgTy = Context.getRValueReferenceType(ArgTy);
else
  ArgTy = Context.getLValueReferenceType(ArgTy);
ArgTypes.push_back(ArgTy);
5058}

5060/// Determine whether the function template \p FT1 is at least as
5061/// specialized as \p FT2.
5062static bool isAtLeastAsSpecializedAs(Sema &S,
                                   SourceLocation Loc,
                                   FunctionTemplateDecl *FT1,
                                   FunctionTemplateDecl *FT2,
                                   TemplatePartialOrderingContext TPOC,
                                   unsigned NumCallArguments1,
                                   bool Reversed) {
assert(!Reversed || TPOC == TPOC_Call)((!Reversed || TPOC == TPOC_Call) ? static_cast<void> (
0) : __assert_fail ("!Reversed || TPOC == TPOC_Call", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5069, __PRETTY_FUNCTION__));

FunctionDecl *FD1 = FT1->getTemplatedDecl();
FunctionDecl *FD2 = FT2->getTemplatedDecl();
const FunctionProtoType *Proto1 = FD1->getType()->getAs<FunctionProtoType>();
const FunctionProtoType *Proto2 = FD2->getType()->getAs<FunctionProtoType>();

assert(Proto1 && Proto2 && "Function templates must have prototypes")((Proto1 && Proto2 && "Function templates must have prototypes"
) ? static_cast<void> (0) : __assert_fail ("Proto1 && Proto2 && \"Function templates must have prototypes\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5076, __PRETTY_FUNCTION__));
TemplateParameterList *TemplateParams = FT2->getTemplateParameters();
SmallVector<DeducedTemplateArgument, 4> Deduced;
Deduced.resize(TemplateParams->size());

// C++0x [temp.deduct.partial]p3:
//   The types used to determine the ordering depend on the context in which
//   the partial ordering is done:
TemplateDeductionInfo Info(Loc);
SmallVector<QualType, 4> Args2;
switch (TPOC) {
case TPOC_Call: {
  //   - In the context of a function call, the function parameter types are
  //     used.
  CXXMethodDecl *Method1 = dyn_cast<CXXMethodDecl>(FD1);
  CXXMethodDecl *Method2 = dyn_cast<CXXMethodDecl>(FD2);

  // C++11 [temp.func.order]p3:
  //   [...] If only one of the function templates is a non-static
  //   member, that function template is considered to have a new
  //   first parameter inserted in its function parameter list. The
  //   new parameter is of type "reference to cv A," where cv are
  //   the cv-qualifiers of the function template (if any) and A is
  //   the class of which the function template is a member.
  //
  // Note that we interpret this to mean "if one of the function
  // templates is a non-static member and the other is a non-member";
  // otherwise, the ordering rules for static functions against non-static
  // functions don't make any sense.
  //
  // C++98/03 doesn't have this provision but we've extended DR532 to cover
  // it as wording was broken prior to it.
  SmallVector<QualType, 4> Args1;

  unsigned NumComparedArguments = NumCallArguments1;

  if (!Method2 && Method1 && !Method1->isStatic()) {
    // Compare 'this' from Method1 against first parameter from Method2.
    AddImplicitObjectParameterType(S.Context, Method1, Args1);
    ++NumComparedArguments;
  } else if (!Method1 && Method2 && !Method2->isStatic()) {
    // Compare 'this' from Method2 against first parameter from Method1.
    AddImplicitObjectParameterType(S.Context, Method2, Args2);
  } else if (Method1 && Method2 && Reversed) {
    // Compare 'this' from Method1 against second parameter from Method2
    // and 'this' from Method2 against second parameter from Method1.
    AddImplicitObjectParameterType(S.Context, Method1, Args1);
    AddImplicitObjectParameterType(S.Context, Method2, Args2);
    ++NumComparedArguments;
  }

  Args1.insert(Args1.end(), Proto1->param_type_begin(),
               Proto1->param_type_end());
  Args2.insert(Args2.end(), Proto2->param_type_begin(),
               Proto2->param_type_end());

  // C++ [temp.func.order]p5:
  //   The presence of unused ellipsis and default arguments has no effect on
  //   the partial ordering of function templates.
  if (Args1.size() > NumComparedArguments)
    Args1.resize(NumComparedArguments);
  if (Args2.size() > NumComparedArguments)
    Args2.resize(NumComparedArguments);
  if (Reversed)
    std::reverse(Args2.begin(), Args2.end());
  if (DeduceTemplateArguments(S, TemplateParams, Args2.data(), Args2.size(),
                              Args1.data(), Args1.size(), Info, Deduced,
                              TDF_None, /*PartialOrdering=*/true))
    return false;

  break;
}

case TPOC_Conversion:
  //   - In the context of a call to a conversion operator, the return types
  //     of the conversion function templates are used.
  if (DeduceTemplateArgumentsByTypeMatch(
          S, TemplateParams, Proto2->getReturnType(), Proto1->getReturnType(),
          Info, Deduced, TDF_None,
          /*PartialOrdering=*/true))
    return false;
  break;

case TPOC_Other:
  //   - In other contexts (14.6.6.2) the function template's function type
  //     is used.
  if (DeduceTemplateArgumentsByTypeMatch(S, TemplateParams,
                                         FD2->getType(), FD1->getType(),
                                         Info, Deduced, TDF_None,
                                         /*PartialOrdering=*/true))
    return false;
  break;
}

// C++0x [temp.deduct.partial]p11:
//   In most cases, all template parameters must have values in order for
//   deduction to succeed, but for partial ordering purposes a template
//   parameter may remain without a value provided it is not used in the
//   types being used for partial ordering. [ Note: a template parameter used
//   in a non-deduced context is considered used. -end note]
unsigned ArgIdx = 0, NumArgs = Deduced.size();
for (; ArgIdx != NumArgs; ++ArgIdx)
  if (Deduced[ArgIdx].isNull())
    break;

// FIXME: We fail to implement [temp.deduct.type]p1 along this path. We need
// to substitute the deduced arguments back into the template and check that
// we get the right type.

if (ArgIdx == NumArgs) {
  // All template arguments were deduced. FT1 is at least as specialized
  // as FT2.
  return true;
}

// Figure out which template parameters were used.
llvm::SmallBitVector UsedParameters(TemplateParams->size());
switch (TPOC) {
case TPOC_Call:
  for (unsigned I = 0, N = Args2.size(); I != N; ++I)
    ::MarkUsedTemplateParameters(S.Context, Args2[I], false,
                                 TemplateParams->getDepth(),
                                 UsedParameters);
  break;

case TPOC_Conversion:
  ::MarkUsedTemplateParameters(S.Context, Proto2->getReturnType(), false,
                               TemplateParams->getDepth(), UsedParameters);
  break;

case TPOC_Other:
  ::MarkUsedTemplateParameters(S.Context, FD2->getType(), false,
                               TemplateParams->getDepth(),
                               UsedParameters);
  break;
}

for (; ArgIdx != NumArgs; ++ArgIdx)
  // If this argument had no value deduced but was used in one of the types
  // used for partial ordering, then deduction fails.
  if (Deduced[ArgIdx].isNull() && UsedParameters[ArgIdx])
    return false;

return true;
5220}

5222/// Determine whether this a function template whose parameter-type-list
5223/// ends with a function parameter pack.
5224static bool isVariadicFunctionTemplate(FunctionTemplateDecl *FunTmpl) {
FunctionDecl *Function = FunTmpl->getTemplatedDecl();
unsigned NumParams = Function->getNumParams();
if (NumParams == 0)
  return false;

ParmVarDecl *Last = Function->getParamDecl(NumParams - 1);
if (!Last->isParameterPack())
  return false;

// Make sure that no previous parameter is a parameter pack.
while (--NumParams > 0) {
  if (Function->getParamDecl(NumParams - 1)->isParameterPack())
    return false;
}

return true;
5241}

5243/// Returns the more specialized function template according
5244/// to the rules of function template partial ordering (C++ [temp.func.order]).
5245///
5246/// \param FT1 the first function template
5247///
5248/// \param FT2 the second function template
5249///
5250/// \param TPOC the context in which we are performing partial ordering of
5251/// function templates.
5252///
5253/// \param NumCallArguments1 The number of arguments in the call to FT1, used
5254/// only when \c TPOC is \c TPOC_Call.
5255///
5256/// \param NumCallArguments2 The number of arguments in the call to FT2, used
5257/// only when \c TPOC is \c TPOC_Call.
5258///
5259/// \param Reversed If \c true, exactly one of FT1 and FT2 is an overload
5260/// candidate with a reversed parameter order. In this case, the corresponding
5261/// P/A pairs between FT1 and FT2 are reversed.
5262///
5263/// \returns the more specialized function template. If neither
5264/// template is more specialized, returns NULL.
5265FunctionTemplateDecl *
5266Sema::getMoreSpecializedTemplate(FunctionTemplateDecl *FT1,
                               FunctionTemplateDecl *FT2,
                               SourceLocation Loc,
                               TemplatePartialOrderingContext TPOC,
                               unsigned NumCallArguments1,
                               unsigned NumCallArguments2,
                               bool Reversed) {

auto JudgeByConstraints = [&] () -> FunctionTemplateDecl * {
  llvm::SmallVector<const Expr *, 3> AC1, AC2;
  FT1->getAssociatedConstraints(AC1);
  FT2->getAssociatedConstraints(AC2);
  bool AtLeastAsConstrained1, AtLeastAsConstrained2;
  if (IsAtLeastAsConstrained(FT1, AC1, FT2, AC2, AtLeastAsConstrained1))
    return nullptr;
  if (IsAtLeastAsConstrained(FT2, AC2, FT1, AC1, AtLeastAsConstrained2))
    return nullptr;
  if (AtLeastAsConstrained1 == AtLeastAsConstrained2)
    return nullptr;
  return AtLeastAsConstrained1 ? FT1 : FT2;
};

bool Better1 = isAtLeastAsSpecializedAs(*this, Loc, FT1, FT2, TPOC,
                                        NumCallArguments1, Reversed);
bool Better2 = isAtLeastAsSpecializedAs(*this, Loc, FT2, FT1, TPOC,
                                        NumCallArguments2, Reversed);

if (Better1 != Better2) // We have a clear winner
  return Better1 ? FT1 : FT2;

if (!Better1 && !Better2) // Neither is better than the other
  return JudgeByConstraints();

// FIXME: This mimics what GCC implements, but doesn't match up with the
// proposed resolution for core issue 692. This area needs to be sorted out,
// but for now we attempt to maintain compatibility.
bool Variadic1 = isVariadicFunctionTemplate(FT1);
bool Variadic2 = isVariadicFunctionTemplate(FT2);
if (Variadic1 != Variadic2)
  return Variadic1? FT2 : FT1;

return JudgeByConstraints();
5308}

5310/// Determine if the two templates are equivalent.
5311static bool isSameTemplate(TemplateDecl *T1, TemplateDecl *T2) {
if (T1 == T2)
  return true;

if (!T1 || !T2)
  return false;

return T1->getCanonicalDecl() == T2->getCanonicalDecl();
5319}

5321/// Retrieve the most specialized of the given function template
5322/// specializations.
5323///
5324/// \param SpecBegin the start iterator of the function template
5325/// specializations that we will be comparing.
5326///
5327/// \param SpecEnd the end iterator of the function template
5328/// specializations, paired with \p SpecBegin.
5329///
5330/// \param Loc the location where the ambiguity or no-specializations
5331/// diagnostic should occur.
5332///
5333/// \param NoneDiag partial diagnostic used to diagnose cases where there are
5334/// no matching candidates.
5335///
5336/// \param AmbigDiag partial diagnostic used to diagnose an ambiguity, if one
5337/// occurs.
5338///
5339/// \param CandidateDiag partial diagnostic used for each function template
5340/// specialization that is a candidate in the ambiguous ordering. One parameter
5341/// in this diagnostic should be unbound, which will correspond to the string
5342/// describing the template arguments for the function template specialization.
5343///
5344/// \returns the most specialized function template specialization, if
5345/// found. Otherwise, returns SpecEnd.
5346UnresolvedSetIterator Sema::getMostSpecialized(
  UnresolvedSetIterator SpecBegin, UnresolvedSetIterator SpecEnd,
  TemplateSpecCandidateSet &FailedCandidates,
  SourceLocation Loc, const PartialDiagnostic &NoneDiag,
  const PartialDiagnostic &AmbigDiag, const PartialDiagnostic &CandidateDiag,
  bool Complain, QualType TargetType) {
if (SpecBegin == SpecEnd) {
  if (Complain) {
    Diag(Loc, NoneDiag);
    FailedCandidates.NoteCandidates(*this, Loc);
  }
  return SpecEnd;
}

if (SpecBegin + 1 == SpecEnd)
  return SpecBegin;

// Find the function template that is better than all of the templates it
// has been compared to.
UnresolvedSetIterator Best = SpecBegin;
FunctionTemplateDecl *BestTemplate
  = cast<FunctionDecl>(*Best)->getPrimaryTemplate();
assert(BestTemplate && "Not a function template specialization?")((BestTemplate && "Not a function template specialization?"
) ? static_cast<void> (0) : __assert_fail ("BestTemplate && \"Not a function template specialization?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5368, __PRETTY_FUNCTION__));
for (UnresolvedSetIterator I = SpecBegin + 1; I != SpecEnd; ++I) {
  FunctionTemplateDecl *Challenger
    = cast<FunctionDecl>(*I)->getPrimaryTemplate();
  assert(Challenger && "Not a function template specialization?")((Challenger && "Not a function template specialization?"
) ? static_cast<void> (0) : __assert_fail ("Challenger && \"Not a function template specialization?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5372, __PRETTY_FUNCTION__));
  if (isSameTemplate(getMoreSpecializedTemplate(BestTemplate, Challenger,
                                                Loc, TPOC_Other, 0, 0),
                     Challenger)) {
    Best = I;
    BestTemplate = Challenger;
  }
}

// Make sure that the "best" function template is more specialized than all
// of the others.
bool Ambiguous = false;
for (UnresolvedSetIterator I = SpecBegin; I != SpecEnd; ++I) {
  FunctionTemplateDecl *Challenger
    = cast<FunctionDecl>(*I)->getPrimaryTemplate();
  if (I != Best &&
      !isSameTemplate(getMoreSpecializedTemplate(BestTemplate, Challenger,
                                                 Loc, TPOC_Other, 0, 0),
                      BestTemplate)) {
    Ambiguous = true;
    break;
  }
}

if (!Ambiguous) {
  // We found an answer. Return it.
  return Best;
}

// Diagnose the ambiguity.
if (Complain) {
  Diag(Loc, AmbigDiag);

  // FIXME: Can we order the candidates in some sane way?
  for (UnresolvedSetIterator I = SpecBegin; I != SpecEnd; ++I) {
    PartialDiagnostic PD = CandidateDiag;
    const auto *FD = cast<FunctionDecl>(*I);
    PD << FD << getTemplateArgumentBindingsText(
                    FD->getPrimaryTemplate()->getTemplateParameters(),
                    *FD->getTemplateSpecializationArgs());
    if (!TargetType.isNull())
      HandleFunctionTypeMismatch(PD, FD->getType(), TargetType);
    Diag((*I)->getLocation(), PD);
  }
}

return SpecEnd;
5419}

5421/// Determine whether one partial specialization, P1, is at least as
5422/// specialized than another, P2.
5423///
5424/// \tparam TemplateLikeDecl The kind of P2, which must be a
5425/// TemplateDecl or {Class,Var}TemplatePartialSpecializationDecl.
5426/// \param T1 The injected-class-name of P1 (faked for a variable template).
5427/// \param T2 The injected-class-name of P2 (faked for a variable template).
5428template<typename TemplateLikeDecl>
5429static bool isAtLeastAsSpecializedAs(Sema &S, QualType T1, QualType T2,
                                   TemplateLikeDecl *P2,
                                   TemplateDeductionInfo &Info) {
// C++ [temp.class.order]p1:
//   For two class template partial specializations, the first is at least as
//   specialized as the second if, given the following rewrite to two
//   function templates, the first function template is at least as
//   specialized as the second according to the ordering rules for function
//   templates (14.6.6.2):
//     - the first function template has the same template parameters as the
//       first partial specialization and has a single function parameter
//       whose type is a class template specialization with the template
//       arguments of the first partial specialization, and
//     - the second function template has the same template parameters as the
//       second partial specialization and has a single function parameter
//       whose type is a class template specialization with the template
//       arguments of the second partial specialization.
//
// Rather than synthesize function templates, we merely perform the
// equivalent partial ordering by performing deduction directly on
// the template arguments of the class template partial
// specializations. This computation is slightly simpler than the
// general problem of function template partial ordering, because
// class template partial specializations are more constrained. We
// know that every template parameter is deducible from the class
// template partial specialization's template arguments, for
// example.
SmallVector<DeducedTemplateArgument, 4> Deduced;

// Determine whether P1 is at least as specialized as P2.
Deduced.resize(P2->getTemplateParameters()->size());
if (DeduceTemplateArgumentsByTypeMatch(S, P2->getTemplateParameters(),
                                       T2, T1, Info, Deduced, TDF_None,
                                       /*PartialOrdering=*/true))
  return false;

SmallVector<TemplateArgument, 4> DeducedArgs(Deduced.begin(),
                                             Deduced.end());
Sema::InstantiatingTemplate Inst(S, Info.getLocation(), P2, DeducedArgs,
                                 Info);
auto *TST1 = T1->castAs<TemplateSpecializationType>();
bool AtLeastAsSpecialized;
S.runWithSufficientStackSpace(Info.getLocation(), [&] {
  AtLeastAsSpecialized = !FinishTemplateArgumentDeduction(
      S, P2, /*IsPartialOrdering=*/true,
      TemplateArgumentList(TemplateArgumentList::OnStack,
                           TST1->template_arguments()),
      Deduced, Info);
});
return AtLeastAsSpecialized;
5479}

5481/// Returns the more specialized class template partial specialization
5482/// according to the rules of partial ordering of class template partial
5483/// specializations (C++ [temp.class.order]).
5484///
5485/// \param PS1 the first class template partial specialization
5486///
5487/// \param PS2 the second class template partial specialization
5488///
5489/// \returns the more specialized class template partial specialization. If
5490/// neither partial specialization is more specialized, returns NULL.
5491ClassTemplatePartialSpecializationDecl *
5492Sema::getMoreSpecializedPartialSpecialization(
                                ClassTemplatePartialSpecializationDecl *PS1,
                                ClassTemplatePartialSpecializationDecl *PS2,
                                            SourceLocation Loc) {
QualType PT1 = PS1->getInjectedSpecializationType();
QualType PT2 = PS2->getInjectedSpecializationType();

TemplateDeductionInfo Info(Loc);
bool Better1 = isAtLeastAsSpecializedAs(*this, PT1, PT2, PS2, Info);
bool Better2 = isAtLeastAsSpecializedAs(*this, PT2, PT1, PS1, Info);

if (!Better1 && !Better2)
    return nullptr;
if (Better1 && Better2) {
  llvm::SmallVector<const Expr *, 3> AC1, AC2;
  PS1->getAssociatedConstraints(AC1);
  PS2->getAssociatedConstraints(AC2);
  bool AtLeastAsConstrained1, AtLeastAsConstrained2;
  if (IsAtLeastAsConstrained(PS1, AC1, PS2, AC2, AtLeastAsConstrained1))
    return nullptr;
  if (IsAtLeastAsConstrained(PS2, AC2, PS1, AC1, AtLeastAsConstrained2))
    return nullptr;
  if (AtLeastAsConstrained1 == AtLeastAsConstrained2)
    return nullptr;
  return AtLeastAsConstrained1 ? PS1 : PS2;
}

return Better1 ? PS1 : PS2;
5520}

5522bool Sema::isMoreSpecializedThanPrimary(
  ClassTemplatePartialSpecializationDecl *Spec, TemplateDeductionInfo &Info) {
ClassTemplateDecl *Primary = Spec->getSpecializedTemplate();
QualType PrimaryT = Primary->getInjectedClassNameSpecialization();
QualType PartialT = Spec->getInjectedSpecializationType();
if (!isAtLeastAsSpecializedAs(*this, PartialT, PrimaryT, Primary, Info))
  return false;
if (!isAtLeastAsSpecializedAs(*this, PrimaryT, PartialT, Spec, Info))
  return true;
Info.clearSFINAEDiagnostic();
llvm::SmallVector<const Expr *, 3> PrimaryAC, SpecAC;
Primary->getAssociatedConstraints(PrimaryAC);
Spec->getAssociatedConstraints(SpecAC);
bool AtLeastAsConstrainedPrimary, AtLeastAsConstrainedSpec;
if (IsAtLeastAsConstrained(Spec, SpecAC, Primary, PrimaryAC,
                           AtLeastAsConstrainedSpec))
  return false;
if (!AtLeastAsConstrainedSpec)
  return false;
if (IsAtLeastAsConstrained(Primary, PrimaryAC, Spec, SpecAC,
                           AtLeastAsConstrainedPrimary))
  return false;
return !AtLeastAsConstrainedPrimary;
5545}

5547VarTemplatePartialSpecializationDecl *
5548Sema::getMoreSpecializedPartialSpecialization(
  VarTemplatePartialSpecializationDecl *PS1,
  VarTemplatePartialSpecializationDecl *PS2, SourceLocation Loc) {
// Pretend the variable template specializations are class template
// specializations and form a fake injected class name type for comparison.
assert(PS1->getSpecializedTemplate() == PS2->getSpecializedTemplate() &&((PS1->getSpecializedTemplate() == PS2->getSpecializedTemplate
() && "the partial specializations being compared should specialize"
 " the same template.") ? static_cast<void> (0) : __assert_fail
 ("PS1->getSpecializedTemplate() == PS2->getSpecializedTemplate() && \"the partial specializations being compared should specialize\" \" the same template.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5555, __PRETTY_FUNCTION__))
       "the partial specializations being compared should specialize"((PS1->getSpecializedTemplate() == PS2->getSpecializedTemplate
() && "the partial specializations being compared should specialize"
 " the same template.") ? static_cast<void> (0) : __assert_fail
 ("PS1->getSpecializedTemplate() == PS2->getSpecializedTemplate() && \"the partial specializations being compared should specialize\" \" the same template.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5555, __PRETTY_FUNCTION__))
       " the same template.")((PS1->getSpecializedTemplate() == PS2->getSpecializedTemplate
() && "the partial specializations being compared should specialize"
 " the same template.") ? static_cast<void> (0) : __assert_fail
 ("PS1->getSpecializedTemplate() == PS2->getSpecializedTemplate() && \"the partial specializations being compared should specialize\" \" the same template.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5555, __PRETTY_FUNCTION__));
TemplateName Name(PS1->getSpecializedTemplate());
TemplateName CanonTemplate = Context.getCanonicalTemplateName(Name);
QualType PT1 = Context.getTemplateSpecializationType(
    CanonTemplate, PS1->getTemplateArgs().asArray());
QualType PT2 = Context.getTemplateSpecializationType(
    CanonTemplate, PS2->getTemplateArgs().asArray());

TemplateDeductionInfo Info(Loc);
bool Better1 = isAtLeastAsSpecializedAs(*this, PT1, PT2, PS2, Info);
bool Better2 = isAtLeastAsSpecializedAs(*this, PT2, PT1, PS1, Info);

if (!Better1 && !Better2)
  return nullptr;
if (Better1 && Better2) {
  llvm::SmallVector<const Expr *, 3> AC1, AC2;
  PS1->getAssociatedConstraints(AC1);
  PS2->getAssociatedConstraints(AC2);
  bool AtLeastAsConstrained1, AtLeastAsConstrained2;
  if (IsAtLeastAsConstrained(PS1, AC1, PS2, AC2, AtLeastAsConstrained1))
    return nullptr;
  if (IsAtLeastAsConstrained(PS2, AC2, PS1, AC1, AtLeastAsConstrained2))
    return nullptr;
  if (AtLeastAsConstrained1 == AtLeastAsConstrained2)
    return nullptr;
  return AtLeastAsConstrained1 ? PS1 : PS2;
}

return Better1 ? PS1 : PS2;
5584}

5586bool Sema::isMoreSpecializedThanPrimary(
  VarTemplatePartialSpecializationDecl *Spec, TemplateDeductionInfo &Info) {
TemplateDecl *Primary = Spec->getSpecializedTemplate();
// FIXME: Cache the injected template arguments rather than recomputing
// them for each partial specialization.
SmallVector<TemplateArgument, 8> PrimaryArgs;
Context.getInjectedTemplateArgs(Primary->getTemplateParameters(),
                                PrimaryArgs);

TemplateName CanonTemplate =
    Context.getCanonicalTemplateName(TemplateName(Primary));
QualType PrimaryT = Context.getTemplateSpecializationType(
    CanonTemplate, PrimaryArgs);
QualType PartialT = Context.getTemplateSpecializationType(
    CanonTemplate, Spec->getTemplateArgs().asArray());

if (!isAtLeastAsSpecializedAs(*this, PartialT, PrimaryT, Primary, Info))
  return false;
if (!isAtLeastAsSpecializedAs(*this, PrimaryT, PartialT, Spec, Info))
  return true;
Info.clearSFINAEDiagnostic();
llvm::SmallVector<const Expr *, 3> PrimaryAC, SpecAC;
Primary->getAssociatedConstraints(PrimaryAC);
Spec->getAssociatedConstraints(SpecAC);
bool AtLeastAsConstrainedPrimary, AtLeastAsConstrainedSpec;
if (IsAtLeastAsConstrained(Spec, SpecAC, Primary, PrimaryAC,
                           AtLeastAsConstrainedSpec))
  return false;
if (!AtLeastAsConstrainedSpec)
  return false;
if (IsAtLeastAsConstrained(Primary, PrimaryAC, Spec, SpecAC,
                           AtLeastAsConstrainedPrimary))
  return false;
return !AtLeastAsConstrainedPrimary;
5620}

5622bool Sema::isTemplateTemplateParameterAtLeastAsSpecializedAs(
   TemplateParameterList *P, TemplateDecl *AArg, SourceLocation Loc) {
// C++1z [temp.arg.template]p4: (DR 150)
//   A template template-parameter P is at least as specialized as a
//   template template-argument A if, given the following rewrite to two
//   function templates...

// Rather than synthesize function templates, we merely perform the
// equivalent partial ordering by performing deduction directly on
// the template parameter lists of the template template parameters.
//
//   Given an invented class template X with the template parameter list of
//   A (including default arguments):
TemplateName X = Context.getCanonicalTemplateName(TemplateName(AArg));
TemplateParameterList *A = AArg->getTemplateParameters();

//    - Each function template has a single function parameter whose type is
//      a specialization of X with template arguments corresponding to the
//      template parameters from the respective function template
SmallVector<TemplateArgument, 8> AArgs;
Context.getInjectedTemplateArgs(A, AArgs);

// Check P's arguments against A's parameter list. This will fill in default
// template arguments as needed. AArgs are already correct by construction.
// We can't just use CheckTemplateIdType because that will expand alias
// templates.
SmallVector<TemplateArgument, 4> PArgs;
{
  SFINAETrap Trap(*this);

  Context.getInjectedTemplateArgs(P, PArgs);
  TemplateArgumentListInfo PArgList(P->getLAngleLoc(),
                                    P->getRAngleLoc());
  for (unsigned I = 0, N = P->size(); I != N; ++I) {
    // Unwrap packs that getInjectedTemplateArgs wrapped around pack
    // expansions, to form an "as written" argument list.
    TemplateArgument Arg = PArgs[I];
    if (Arg.getKind() == TemplateArgument::Pack) {
      assert(Arg.pack_size() == 1 && Arg.pack_begin()->isPackExpansion())((Arg.pack_size() == 1 && Arg.pack_begin()->isPackExpansion
()) ? static_cast<void> (0) : __assert_fail ("Arg.pack_size() == 1 && Arg.pack_begin()->isPackExpansion()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/lib/Sema/SemaTemplateDeduction.cpp"
, 5660, __PRETTY_FUNCTION__));
      Arg = *Arg.pack_begin();
    }
    PArgList.addArgument(getTrivialTemplateArgumentLoc(
        Arg, QualType(), P->getParam(I)->getLocation()));
  }
  PArgs.clear();

  // C++1z [temp.arg.template]p3:
  //   If the rewrite produces an invalid type, then P is not at least as
  //   specialized as A.
  if (CheckTemplateArgumentList(AArg, Loc, PArgList, false, PArgs) ||
      Trap.hasErrorOccurred())
    return false;
}

QualType AType = Context.getTemplateSpecializationType(X, AArgs);
QualType PType = Context.getTemplateSpecializationType(X, PArgs);

//   ... the function template corresponding to P is at least as specialized
//   as the function template corresponding to A according to the partial
//   ordering rules for function templates.
TemplateDeductionInfo Info(Loc, A->getDepth());
return isAtLeastAsSpecializedAs(*this, PType, AType, AArg, Info);
5684}

5686namespace {
5687struct MarkUsedTemplateParameterVisitor :
  RecursiveASTVisitor<MarkUsedTemplateParameterVisitor> {
llvm::SmallBitVector &Used;
unsigned Depth;

MarkUsedTemplateParameterVisitor(llvm::SmallBitVector &Used,
                                 unsigned Depth)
    : Used(Used), Depth(Depth) { }

bool VisitTemplateTypeParmType(TemplateTypeParmType *T) {
  if (T->getDepth() == Depth)
    Used[T->getIndex()] = true;
  return true;
}

bool TraverseTemplateName(TemplateName Template) {
  if (auto *TTP =
          dyn_cast<TemplateTemplateParmDecl>(Template.getAsTemplateDecl()))
    if (TTP->getDepth() == Depth)
      Used[TTP->getIndex()] = true;
  RecursiveASTVisitor<MarkUsedTemplateParameterVisitor>::
      TraverseTemplateName(Template);
  return true;
}

bool VisitDeclRefExpr(DeclRefExpr *E) {
  if (auto *NTTP = dyn_cast<NonTypeTemplateParmDecl>(E->getDecl()))
    if (NTTP->getDepth() == Depth)
      Used[NTTP->getIndex()] = true;
  return true;
}
5718};
5719}

5721/// Mark the template parameters that are used by the given
5722/// expression.
5723static void
5724MarkUsedTemplateParameters(ASTContext &Ctx,
                         const Expr *E,
                         bool OnlyDeduced,
                         unsigned Depth,
                         llvm::SmallBitVector &Used) {
if (!OnlyDeduced) {
  MarkUsedTemplateParameterVisitor(Used, Depth)
      .TraverseStmt(const_cast<Expr *>(E));
  return;
}

// We can deduce from a pack expansion.
if (const PackExpansionExpr *Expansion = dyn_cast<PackExpansionExpr>(E))
  E = Expansion->getPattern();

const NonTypeTemplateParmDecl *NTTP = getDeducedParameterFromExpr(E, Depth);
if (!NTTP)
  return;

if (NTTP->getDepth() == Depth)
  Used[NTTP->getIndex()] = true;

// In C++17 mode, additional arguments may be deduced from the type of a
// non-type argument.
if (Ctx.getLangOpts().CPlusPlus17)
  MarkUsedTemplateParameters(Ctx, NTTP->getType(), OnlyDeduced, Depth, Used);
5750}

5752/// Mark the template parameters that are used by the given
5753/// nested name specifier.
5754static void
5755MarkUsedTemplateParameters(ASTContext &Ctx,
                         NestedNameSpecifier *NNS,
                         bool OnlyDeduced,
                         unsigned Depth,
                         llvm::SmallBitVector &Used) {
if (!NNS)
  return;

MarkUsedTemplateParameters(Ctx, NNS->getPrefix(), OnlyDeduced, Depth,
                           Used);
MarkUsedTemplateParameters(Ctx, QualType(NNS->getAsType(), 0),
                           OnlyDeduced, Depth, Used);
5767}

5769/// Mark the template parameters that are used by the given
5770/// template name.
5771static void
5772MarkUsedTemplateParameters(ASTContext &Ctx,
                         TemplateName Name,
                         bool OnlyDeduced,
                         unsigned Depth,
                         llvm::SmallBitVector &Used) {
if (TemplateDecl *Template = Name.getAsTemplateDecl()) {
  if (TemplateTemplateParmDecl *TTP
        = dyn_cast<TemplateTemplateParmDecl>(Template)) {
    if (TTP->getDepth() == Depth)
      Used[TTP->getIndex()] = true;
  }
  return;
}

if (QualifiedTemplateName *QTN = Name.getAsQualifiedTemplateName())
  MarkUsedTemplateParameters(Ctx, QTN->getQualifier(), OnlyDeduced,
                             Depth, Used);
if (DependentTemplateName *DTN = Name.getAsDependentTemplateName())
  MarkUsedTemplateParameters(Ctx, DTN->getQualifier(), OnlyDeduced,
                             Depth, Used);
5792}

5794/// Mark the template parameters that are used by the given
5795/// type.
5796static void
5797MarkUsedTemplateParameters(ASTContext &Ctx, QualType T,
                         bool OnlyDeduced,
                         unsigned Depth,
                         llvm::SmallBitVector &Used) {
if (T.isNull())
  return;

// Non-dependent types have nothing deducible
if (!T->isDependentType())
  return;

T = Ctx.getCanonicalType(T);
switch (T->getTypeClass()) {
case Type::Pointer:
  MarkUsedTemplateParameters(Ctx,
                             cast<PointerType>(T)->getPointeeType(),
                             OnlyDeduced,
                             Depth,
                             Used);
  break;

case Type::BlockPointer:
  MarkUsedTemplateParameters(Ctx,
                             cast<BlockPointerType>(T)->getPointeeType(),
                             OnlyDeduced,
                             Depth,
                             Used);
  break;

case Type::LValueReference:
case Type::RValueReference:
  MarkUsedTemplateParameters(Ctx,
                             cast<ReferenceType>(T)->getPointeeType(),
                             OnlyDeduced,
                             Depth,
                             Used);
  break;

case Type::MemberPointer: {
  const MemberPointerType *MemPtr = cast<MemberPointerType>(T.getTypePtr());
  MarkUsedTemplateParameters(Ctx, MemPtr->getPointeeType(), OnlyDeduced,
                             Depth, Used);
  MarkUsedTemplateParameters(Ctx, QualType(MemPtr->getClass(), 0),
                             OnlyDeduced, Depth, Used);
  break;
}

case Type::DependentSizedArray:
  MarkUsedTemplateParameters(Ctx,
                             cast<DependentSizedArrayType>(T)->getSizeExpr(),
                             OnlyDeduced, Depth, Used);
  // Fall through to check the element type
  LLVM_FALLTHROUGH[[gnu::fallthrough]];

case Type::ConstantArray:
case Type::IncompleteArray:
  MarkUsedTemplateParameters(Ctx,
                             cast<ArrayType>(T)->getElementType(),
                             OnlyDeduced, Depth, Used);
  break;

case Type::Vector:
case Type::ExtVector:
  MarkUsedTemplateParameters(Ctx,
                             cast<VectorType>(T)->getElementType(),
                             OnlyDeduced, Depth, Used);
  break;

case Type::DependentVector: {
  const auto *VecType = cast<DependentVectorType>(T);
  MarkUsedTemplateParameters(Ctx, VecType->getElementType(), OnlyDeduced,
                             Depth, Used);
  MarkUsedTemplateParameters(Ctx, VecType->getSizeExpr(), OnlyDeduced, Depth,
                             Used);
  break;
}
case Type::DependentSizedExtVector: {
  const DependentSizedExtVectorType *VecType
    = cast<DependentSizedExtVectorType>(T);
  MarkUsedTemplateParameters(Ctx, VecType->getElementType(), OnlyDeduced,
                             Depth, Used);
  MarkUsedTemplateParameters(Ctx, VecType->getSizeExpr(), OnlyDeduced,
                             Depth, Used);
  break;
}

case Type::DependentAddressSpace: {
  const DependentAddressSpaceType *DependentASType =
      cast<DependentAddressSpaceType>(T);
  MarkUsedTemplateParameters(Ctx, DependentASType->getPointeeType(),
                             OnlyDeduced, Depth, Used);
  MarkUsedTemplateParameters(Ctx,
                             DependentASType->getAddrSpaceExpr(),
                             OnlyDeduced, Depth, Used);
  break;
}

case Type::ConstantMatrix: {
  const ConstantMatrixType *MatType = cast<ConstantMatrixType>(T);
  MarkUsedTemplateParameters(Ctx, MatType->getElementType(), OnlyDeduced,
                             Depth, Used);
  break;
}

case Type::DependentSizedMatrix: {
  const DependentSizedMatrixType *MatType = cast<DependentSizedMatrixType>(T);
  MarkUsedTemplateParameters(Ctx, MatType->getElementType(), OnlyDeduced,
                             Depth, Used);
  MarkUsedTemplateParameters(Ctx, MatType->getRowExpr(), OnlyDeduced, Depth,
                             Used);
  MarkUsedTemplateParameters(Ctx, MatType->getColumnExpr(), OnlyDeduced,
                             Depth, Used);
  break;
}

case Type::FunctionProto: {
  const FunctionProtoType *Proto = cast<FunctionProtoType>(T);
  MarkUsedTemplateParameters(Ctx, Proto->getReturnType(), OnlyDeduced, Depth,
                             Used);
  for (unsigned I = 0, N = Proto->getNumParams(); I != N; ++I) {
    // C++17 [temp.deduct.type]p5:
    //   The non-deduced contexts are: [...]
    //   -- A function parameter pack that does not occur at the end of the
    //      parameter-declaration-list.
    if (!OnlyDeduced || I + 1 == N ||
        !Proto->getParamType(I)->getAs<PackExpansionType>()) {
      MarkUsedTemplateParameters(Ctx, Proto->getParamType(I), OnlyDeduced,
                                 Depth, Used);
    } else {
      // FIXME: C++17 [temp.deduct.call]p1:
      //   When a function parameter pack appears in a non-deduced context,
      //   the type of that pack is never deduced.
      //
      // We should also track a set of "never deduced" parameters, and
      // subtract that from the list of deduced parameters after marking.
    }
  }
  if (auto *E = Proto->getNoexceptExpr())
    MarkUsedTemplateParameters(Ctx, E, OnlyDeduced, Depth, Used);
  break;
}

case Type::TemplateTypeParm: {
  const TemplateTypeParmType *TTP = cast<TemplateTypeParmType>(T);
  if (TTP->getDepth() == Depth)
    Used[TTP->getIndex()] = true;
  break;
}

case Type::SubstTemplateTypeParmPack: {
  const SubstTemplateTypeParmPackType *Subst
    = cast<SubstTemplateTypeParmPackType>(T);
  MarkUsedTemplateParameters(Ctx,
                             QualType(Subst->getReplacedParameter(), 0),
                             OnlyDeduced, Depth, Used);
  MarkUsedTemplateParameters(Ctx, Subst->getArgumentPack(),
                             OnlyDeduced, Depth, Used);
  break;
}

case Type::InjectedClassName:
  T = cast<InjectedClassNameType>(T)->getInjectedSpecializationType();
  LLVM_FALLTHROUGH[[gnu::fallthrough]];

case Type::TemplateSpecialization: {
  const TemplateSpecializationType *Spec
    = cast<TemplateSpecializationType>(T);
  MarkUsedTemplateParameters(Ctx, Spec->getTemplateName(), OnlyDeduced,
                             Depth, Used);

  // C++0x [temp.deduct.type]p9:
  //   If the template argument list of P contains a pack expansion that is
  //   not the last template argument, the entire template argument list is a
  //   non-deduced context.
  if (OnlyDeduced &&
      hasPackExpansionBeforeEnd(Spec->template_arguments()))
    break;

  for (unsigned I = 0, N = Spec->getNumArgs(); I != N; ++I)
    MarkUsedTemplateParameters(Ctx, Spec->getArg(I), OnlyDeduced, Depth,
                               Used);
  break;
}

case Type::Complex:
  if (!OnlyDeduced)
    MarkUsedTemplateParameters(Ctx,
                               cast<ComplexType>(T)->getElementType(),
                               OnlyDeduced, Depth, Used);
  break;

case Type::Atomic:
  if (!OnlyDeduced)
    MarkUsedTemplateParameters(Ctx,
                               cast<AtomicType>(T)->getValueType(),
                               OnlyDeduced, Depth, Used);
  break;

case Type::DependentName:
  if (!OnlyDeduced)
    MarkUsedTemplateParameters(Ctx,
                               cast<DependentNameType>(T)->getQualifier(),
                               OnlyDeduced, Depth, Used);
  break;

case Type::DependentTemplateSpecialization: {
  // C++14 [temp.deduct.type]p5:
  //   The non-deduced contexts are:
  //     -- The nested-name-specifier of a type that was specified using a
  //        qualified-id
  //
  // C++14 [temp.deduct.type]p6:
  //   When a type name is specified in a way that includes a non-deduced
  //   context, all of the types that comprise that type name are also
  //   non-deduced.
  if (OnlyDeduced)
    break;

  const DependentTemplateSpecializationType *Spec
    = cast<DependentTemplateSpecializationType>(T);

  MarkUsedTemplateParameters(Ctx, Spec->getQualifier(),
                             OnlyDeduced, Depth, Used);

  for (unsigned I = 0, N = Spec->getNumArgs(); I != N; ++I)
    MarkUsedTemplateParameters(Ctx, Spec->getArg(I), OnlyDeduced, Depth,
                               Used);
  break;
}

case Type::TypeOf:
  if (!OnlyDeduced)
    MarkUsedTemplateParameters(Ctx,
                               cast<TypeOfType>(T)->getUnderlyingType(),
                               OnlyDeduced, Depth, Used);
  break;

case Type::TypeOfExpr:
  if (!OnlyDeduced)
    MarkUsedTemplateParameters(Ctx,
                               cast<TypeOfExprType>(T)->getUnderlyingExpr(),
                               OnlyDeduced, Depth, Used);
  break;

case Type::Decltype:
  if (!OnlyDeduced)
    MarkUsedTemplateParameters(Ctx,
                               cast<DecltypeType>(T)->getUnderlyingExpr(),
                               OnlyDeduced, Depth, Used);
  break;

case Type::UnaryTransform:
  if (!OnlyDeduced)
    MarkUsedTemplateParameters(Ctx,
                               cast<UnaryTransformType>(T)->getUnderlyingType(),
                               OnlyDeduced, Depth, Used);
  break;

case Type::PackExpansion:
  MarkUsedTemplateParameters(Ctx,
                             cast<PackExpansionType>(T)->getPattern(),
                             OnlyDeduced, Depth, Used);
  break;

case Type::Auto:
case Type::DeducedTemplateSpecialization:
  MarkUsedTemplateParameters(Ctx,
                             cast<DeducedType>(T)->getDeducedType(),
                             OnlyDeduced, Depth, Used);
  break;
case Type::DependentExtInt:
  MarkUsedTemplateParameters(Ctx,
                             cast<DependentExtIntType>(T)->getNumBitsExpr(),
                             OnlyDeduced, Depth, Used);
  break;

// None of these types have any template parameters in them.
case Type::Builtin:
case Type::VariableArray:
case Type::FunctionNoProto:
case Type::Record:
case Type::Enum:
case Type::ObjCInterface:
case Type::ObjCObject:
case Type::ObjCObjectPointer:
case Type::UnresolvedUsing:
case Type::Pipe:
case Type::ExtInt:
6085#define TYPE(Class, Base)
6086#define ABSTRACT_TYPE(Class, Base)
6087#define DEPENDENT_TYPE(Class, Base)
6088#define NON_CANONICAL_TYPE(Class, Base) case Type::Class:
6089#include "clang/AST/TypeNodes.inc"
  break;
}
6092}

6094/// Mark the template parameters that are used by this
6095/// template argument.
6096static void
6097MarkUsedTemplateParameters(ASTContext &Ctx,
                         const TemplateArgument &TemplateArg,
                         bool OnlyDeduced,
                         unsigned Depth,
                         llvm::SmallBitVector &Used) {
switch (TemplateArg.getKind()) {
case TemplateArgument::Null:
case TemplateArgument::Integral:
case TemplateArgument::Declaration:
  break;

case TemplateArgument::NullPtr:
  MarkUsedTemplateParameters(Ctx, TemplateArg.getNullPtrType(), OnlyDeduced,
                             Depth, Used);
  break;

case TemplateArgument::Type:
  MarkUsedTemplateParameters(Ctx, TemplateArg.getAsType(), OnlyDeduced,
                             Depth, Used);
  break;

case TemplateArgument::Template:
case TemplateArgument::TemplateExpansion:
  MarkUsedTemplateParameters(Ctx,
                             TemplateArg.getAsTemplateOrTemplatePattern(),
                             OnlyDeduced, Depth, Used);
  break;

case TemplateArgument::Expression:
  MarkUsedTemplateParameters(Ctx, TemplateArg.getAsExpr(), OnlyDeduced,
                             Depth, Used);
  break;

case TemplateArgument::Pack:
  for (const auto &P : TemplateArg.pack_elements())
    MarkUsedTemplateParameters(Ctx, P, OnlyDeduced, Depth, Used);
  break;
}
6135}

6137/// Mark which template parameters are used in a given expression.
6138///
6139/// \param E the expression from which template parameters will be deduced.
6140///
6141/// \param Used a bit vector whose elements will be set to \c true
6142/// to indicate when the corresponding template parameter will be
6143/// deduced.
6144void
6145Sema::MarkUsedTemplateParameters(const Expr *E, bool OnlyDeduced,
                               unsigned Depth,
                               llvm::SmallBitVector &Used) {
::MarkUsedTemplateParameters(Context, E, OnlyDeduced, Depth, Used);
6149}

6151/// Mark which template parameters can be deduced from a given
6152/// template argument list.
6153///
6154/// \param TemplateArgs the template argument list from which template
6155/// parameters will be deduced.
6156///
6157/// \param Used a bit vector whose elements will be set to \c true
6158/// to indicate when the corresponding template parameter will be
6159/// deduced.
6160void
6161Sema::MarkUsedTemplateParameters(const TemplateArgumentList &TemplateArgs,
                               bool OnlyDeduced, unsigned Depth,
                               llvm::SmallBitVector &Used) {
// C++0x [temp.deduct.type]p9:
//   If the template argument list of P contains a pack expansion that is not
//   the last template argument, the entire template argument list is a
//   non-deduced context.
if (OnlyDeduced &&
    hasPackExpansionBeforeEnd(TemplateArgs.asArray()))
  return;

for (unsigned I = 0, N = TemplateArgs.size(); I != N; ++I)
  ::MarkUsedTemplateParameters(Context, TemplateArgs[I], OnlyDeduced,
                               Depth, Used);
6175}

6177/// Marks all of the template parameters that will be deduced by a
6178/// call to the given function template.
6179void Sema::MarkDeducedTemplateParameters(
  ASTContext &Ctx, const FunctionTemplateDecl *FunctionTemplate,
  llvm::SmallBitVector &Deduced) {
TemplateParameterList *TemplateParams
  = FunctionTemplate->getTemplateParameters();
Deduced.clear();
Deduced.resize(TemplateParams->size());

FunctionDecl *Function = FunctionTemplate->getTemplatedDecl();
for (unsigned I = 0, N = Function->getNumParams(); I != N; ++I)
  ::MarkUsedTemplateParameters(Ctx, Function->getParamDecl(I)->getType(),
                               true, TemplateParams->getDepth(), Deduced);
6191}

6193bool hasDeducibleTemplateParameters(Sema &S,
                                  FunctionTemplateDecl *FunctionTemplate,
                                  QualType T) {
if (!T->isDependentType())
  return false;

TemplateParameterList *TemplateParams
  = FunctionTemplate->getTemplateParameters();
llvm::SmallBitVector Deduced(TemplateParams->size());
::MarkUsedTemplateParameters(S.Context, T, true, TemplateParams->getDepth(),
                             Deduced);

return Deduced.any();
6206}

←

/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h

→

1//===- Type.h - C Language Family Type Representation -----------*- 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/// \file
10/// C Language Family Type Representation
11///
12/// This file defines the clang::Type interface and subclasses, used to
13/// represent types for languages in the C family.
14//
15//===----------------------------------------------------------------------===//

17#ifndef LLVM_CLANG_AST_TYPE_H
18#define LLVM_CLANG_AST_TYPE_H

20#include "clang/AST/DependenceFlags.h"
21#include "clang/AST/NestedNameSpecifier.h"
22#include "clang/AST/TemplateName.h"
23#include "clang/Basic/AddressSpaces.h"
24#include "clang/Basic/AttrKinds.h"
25#include "clang/Basic/Diagnostic.h"
26#include "clang/Basic/ExceptionSpecificationType.h"
27#include "clang/Basic/LLVM.h"
28#include "clang/Basic/Linkage.h"
29#include "clang/Basic/PartialDiagnostic.h"
30#include "clang/Basic/SourceLocation.h"
31#include "clang/Basic/Specifiers.h"
32#include "clang/Basic/Visibility.h"
33#include "llvm/ADT/APInt.h"
34#include "llvm/ADT/APSInt.h"
35#include "llvm/ADT/ArrayRef.h"
36#include "llvm/ADT/FoldingSet.h"
37#include "llvm/ADT/None.h"
38#include "llvm/ADT/Optional.h"
39#include "llvm/ADT/PointerIntPair.h"
40#include "llvm/ADT/PointerUnion.h"
41#include "llvm/ADT/StringRef.h"
42#include "llvm/ADT/Twine.h"
43#include "llvm/ADT/iterator_range.h"
44#include "llvm/Support/Casting.h"
45#include "llvm/Support/Compiler.h"
46#include "llvm/Support/ErrorHandling.h"
47#include "llvm/Support/PointerLikeTypeTraits.h"
48#include "llvm/Support/TrailingObjects.h"
49#include "llvm/Support/type_traits.h"
50#include <cassert>
51#include <cstddef>
52#include <cstdint>
53#include <cstring>
54#include <string>
55#include <type_traits>
56#include <utility>

58namespace clang {

60class ExtQuals;
61class QualType;
62class ConceptDecl;
63class TagDecl;
64class TemplateParameterList;
65class Type;

67enum {
TypeAlignmentInBits = 4,
TypeAlignment = 1 << TypeAlignmentInBits
70};

72namespace serialization {
template <class T> class AbstractTypeReader;
template <class T> class AbstractTypeWriter;
75}

77} // namespace clang

79namespace llvm {

template <typename T>
struct PointerLikeTypeTraits;
template<>
struct PointerLikeTypeTraits< ::clang::Type*> {
  static inline void *getAsVoidPointer(::clang::Type *P) { return P; }

  static inline ::clang::Type *getFromVoidPointer(void *P) {
    return static_cast< ::clang::Type*>(P);
  }

  static constexpr int NumLowBitsAvailable = clang::TypeAlignmentInBits;
};

template<>
struct PointerLikeTypeTraits< ::clang::ExtQuals*> {
  static inline void *getAsVoidPointer(::clang::ExtQuals *P) { return P; }

  static inline ::clang::ExtQuals *getFromVoidPointer(void *P) {
    return static_cast< ::clang::ExtQuals*>(P);
  }

  static constexpr int NumLowBitsAvailable = clang::TypeAlignmentInBits;
};

105} // namespace llvm

107namespace clang {

109class ASTContext;
110template <typename> class CanQual;
111class CXXRecordDecl;
112class DeclContext;
113class EnumDecl;
114class Expr;
115class ExtQualsTypeCommonBase;
116class FunctionDecl;
117class IdentifierInfo;
118class NamedDecl;
119class ObjCInterfaceDecl;
120class ObjCProtocolDecl;
121class ObjCTypeParamDecl;
122struct PrintingPolicy;
123class RecordDecl;
124class Stmt;
125class TagDecl;
126class TemplateArgument;
127class TemplateArgumentListInfo;
128class TemplateArgumentLoc;
129class TemplateTypeParmDecl;
130class TypedefNameDecl;
131class UnresolvedUsingTypenameDecl;

133using CanQualType = CanQual<Type>;

135// Provide forward declarations for all of the *Type classes.
136#define TYPE(Class, Base) class Class##Type;
137#include "clang/AST/TypeNodes.inc"

139/// The collection of all-type qualifiers we support.
140/// Clang supports five independent qualifiers:
141/// * C99: const, volatile, and restrict
142/// * MS: __unaligned
143/// * Embedded C (TR18037): address spaces
144/// * Objective C: the GC attributes (none, weak, or strong)
145class Qualifiers {
146public:
enum TQ { // NOTE: These flags must be kept in sync with DeclSpec::TQ.
  Const    = 0x1,
  Restrict = 0x2,
  Volatile = 0x4,
  CVRMask = Const | Volatile | Restrict
};

enum GC {
  GCNone = 0,
  Weak,
  Strong
};

enum ObjCLifetime {
  /// There is no lifetime qualification on this type.
  OCL_None,

  /// This object can be modified without requiring retains or
  /// releases.
  OCL_ExplicitNone,

  /// Assigning into this object requires the old value to be
  /// released and the new value to be retained.  The timing of the
  /// release of the old value is inexact: it may be moved to
  /// immediately after the last known point where the value is
  /// live.
  OCL_Strong,

  /// Reading or writing from this object requires a barrier call.
  OCL_Weak,

  /// Assigning into this object requires a lifetime extension.
  OCL_Autoreleasing
};

enum {
  /// The maximum supported address space number.
  /// 23 bits should be enough for anyone.
  MaxAddressSpace = 0x7fffffu,

  /// The width of the "fast" qualifier mask.
  FastWidth = 3,

  /// The fast qualifier mask.
  FastMask = (1 << FastWidth) - 1
};

/// Returns the common set of qualifiers while removing them from
/// the given sets.
static Qualifiers removeCommonQualifiers(Qualifiers &L, Qualifiers &R) {
  // If both are only CVR-qualified, bit operations are sufficient.
  if (!(L.Mask & ~CVRMask) && !(R.Mask & ~CVRMask)) {
    Qualifiers Q;
    Q.Mask = L.Mask & R.Mask;
    L.Mask &= ~Q.Mask;
    R.Mask &= ~Q.Mask;
    return Q;
  }

  Qualifiers Q;
  unsigned CommonCRV = L.getCVRQualifiers() & R.getCVRQualifiers();
  Q.addCVRQualifiers(CommonCRV);
  L.removeCVRQualifiers(CommonCRV);
  R.removeCVRQualifiers(CommonCRV);

  if (L.getObjCGCAttr() == R.getObjCGCAttr()) {
    Q.setObjCGCAttr(L.getObjCGCAttr());
    L.removeObjCGCAttr();
    R.removeObjCGCAttr();
  }

  if (L.getObjCLifetime() == R.getObjCLifetime()) {
    Q.setObjCLifetime(L.getObjCLifetime());
    L.removeObjCLifetime();
    R.removeObjCLifetime();
  }

  if (L.getAddressSpace() == R.getAddressSpace()) {
    Q.setAddressSpace(L.getAddressSpace());
    L.removeAddressSpace();
    R.removeAddressSpace();
  }
  return Q;
}

static Qualifiers fromFastMask(unsigned Mask) {
  Qualifiers Qs;
  Qs.addFastQualifiers(Mask);
  return Qs;
}

static Qualifiers fromCVRMask(unsigned CVR) {
  Qualifiers Qs;
  Qs.addCVRQualifiers(CVR);
  return Qs;
}

static Qualifiers fromCVRUMask(unsigned CVRU) {
  Qualifiers Qs;
  Qs.addCVRUQualifiers(CVRU);
  return Qs;
}

// Deserialize qualifiers from an opaque representation.
static Qualifiers fromOpaqueValue(unsigned opaque) {
  Qualifiers Qs;
  Qs.Mask = opaque;
  return Qs;
}

// Serialize these qualifiers into an opaque representation.
unsigned getAsOpaqueValue() const {
  return Mask;
}

bool hasConst() const { return Mask & Const; }
bool hasOnlyConst() const { return Mask == Const; }
void removeConst() { Mask &= ~Const; }
void addConst() { Mask |= Const; }

bool hasVolatile() const { return Mask & Volatile; }
bool hasOnlyVolatile() const { return Mask == Volatile; }
void removeVolatile() { Mask &= ~Volatile; }
void addVolatile() { Mask |= Volatile; }

bool hasRestrict() const { return Mask & Restrict; }
bool hasOnlyRestrict() const { return Mask == Restrict; }
void removeRestrict() { Mask &= ~Restrict; }
void addRestrict() { Mask |= Restrict; }

bool hasCVRQualifiers() const { return getCVRQualifiers(); }
unsigned getCVRQualifiers() const { return Mask & CVRMask; }
unsigned getCVRUQualifiers() const { return Mask & (CVRMask | UMask); }

void setCVRQualifiers(unsigned mask) {
  assert(!(mask & ~CVRMask) && "bitmask contains non-CVR bits")((!(mask & ~CVRMask) && "bitmask contains non-CVR bits"
) ? static_cast<void> (0) : __assert_fail ("!(mask & ~CVRMask) && \"bitmask contains non-CVR bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 282, __PRETTY_FUNCTION__));
  Mask = (Mask & ~CVRMask) | mask;
}
void removeCVRQualifiers(unsigned mask) {
  assert(!(mask & ~CVRMask) && "bitmask contains non-CVR bits")((!(mask & ~CVRMask) && "bitmask contains non-CVR bits"
) ? static_cast<void> (0) : __assert_fail ("!(mask & ~CVRMask) && \"bitmask contains non-CVR bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 286, __PRETTY_FUNCTION__));
  Mask &= ~mask;
}
void removeCVRQualifiers() {
  removeCVRQualifiers(CVRMask);
}
void addCVRQualifiers(unsigned mask) {
  assert(!(mask & ~CVRMask) && "bitmask contains non-CVR bits")((!(mask & ~CVRMask) && "bitmask contains non-CVR bits"
) ? static_cast<void> (0) : __assert_fail ("!(mask & ~CVRMask) && \"bitmask contains non-CVR bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 293, __PRETTY_FUNCTION__));
  Mask |= mask;
}
void addCVRUQualifiers(unsigned mask) {
  assert(!(mask & ~CVRMask & ~UMask) && "bitmask contains non-CVRU bits")((!(mask & ~CVRMask & ~UMask) && "bitmask contains non-CVRU bits"
) ? static_cast<void> (0) : __assert_fail ("!(mask & ~CVRMask & ~UMask) && \"bitmask contains non-CVRU bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 297, __PRETTY_FUNCTION__));
  Mask |= mask;
}

bool hasUnaligned() const { return Mask & UMask; }
void setUnaligned(bool flag) {
  Mask = (Mask & ~UMask) | (flag ? UMask : 0);
}
void removeUnaligned() { Mask &= ~UMask; }
void addUnaligned() { Mask |= UMask; }

bool hasObjCGCAttr() const { return Mask & GCAttrMask; }
GC getObjCGCAttr() const { return GC((Mask & GCAttrMask) >> GCAttrShift); }
void setObjCGCAttr(GC type) {
  Mask = (Mask & ~GCAttrMask) | (type << GCAttrShift);
}
void removeObjCGCAttr() { setObjCGCAttr(GCNone); }
void addObjCGCAttr(GC type) {
  assert(type)((type) ? static_cast<void> (0) : __assert_fail ("type"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 315, __PRETTY_FUNCTION__));
  setObjCGCAttr(type);
}
Qualifiers withoutObjCGCAttr() const {
  Qualifiers qs = *this;
  qs.removeObjCGCAttr();
  return qs;
}
Qualifiers withoutObjCLifetime() const {
  Qualifiers qs = *this;
  qs.removeObjCLifetime();
  return qs;
}
Qualifiers withoutAddressSpace() const {
  Qualifiers qs = *this;
  qs.removeAddressSpace();
  return qs;
}

bool hasObjCLifetime() const { return Mask & LifetimeMask; }
ObjCLifetime getObjCLifetime() const {
  return ObjCLifetime((Mask & LifetimeMask) >> LifetimeShift);
}
void setObjCLifetime(ObjCLifetime type) {
  Mask = (Mask & ~LifetimeMask) | (type << LifetimeShift);
}
void removeObjCLifetime() { setObjCLifetime(OCL_None); }
void addObjCLifetime(ObjCLifetime type) {
  assert(type)((type) ? static_cast<void> (0) : __assert_fail ("type"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 343, __PRETTY_FUNCTION__));
  assert(!hasObjCLifetime())((!hasObjCLifetime()) ? static_cast<void> (0) : __assert_fail
 ("!hasObjCLifetime()", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 344, __PRETTY_FUNCTION__));
  Mask |= (type << LifetimeShift);
}

/// True if the lifetime is neither None or ExplicitNone.
bool hasNonTrivialObjCLifetime() const {
  ObjCLifetime lifetime = getObjCLifetime();
  return (lifetime > OCL_ExplicitNone);
}

/// True if the lifetime is either strong or weak.
bool hasStrongOrWeakObjCLifetime() const {
  ObjCLifetime lifetime = getObjCLifetime();
  return (lifetime == OCL_Strong || lifetime == OCL_Weak);
}

bool hasAddressSpace() const { return Mask & AddressSpaceMask; }
LangAS getAddressSpace() const {
  return static_cast<LangAS>(Mask >> AddressSpaceShift);
}
bool hasTargetSpecificAddressSpace() const {
  return isTargetAddressSpace(getAddressSpace());
}
/// Get the address space attribute value to be printed by diagnostics.
unsigned getAddressSpaceAttributePrintValue() const {
  auto Addr = getAddressSpace();
  // This function is not supposed to be used with language specific
  // address spaces. If that happens, the diagnostic message should consider
  // printing the QualType instead of the address space value.
  assert(Addr == LangAS::Default || hasTargetSpecificAddressSpace())((Addr == LangAS::Default || hasTargetSpecificAddressSpace())
 ? static_cast<void> (0) : __assert_fail ("Addr == LangAS::Default || hasTargetSpecificAddressSpace()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 373, __PRETTY_FUNCTION__));
  if (Addr != LangAS::Default)
    return toTargetAddressSpace(Addr);
  // TODO: The diagnostic messages where Addr may be 0 should be fixed
  // since it cannot differentiate the situation where 0 denotes the default
  // address space or user specified __attribute__((address_space(0))).
  return 0;
}
void setAddressSpace(LangAS space) {
  assert((unsigned)space <= MaxAddressSpace)(((unsigned)space <= MaxAddressSpace) ? static_cast<void
> (0) : __assert_fail ("(unsigned)space <= MaxAddressSpace"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 382, __PRETTY_FUNCTION__));
  Mask = (Mask & ~AddressSpaceMask)
       | (((uint32_t) space) << AddressSpaceShift);
}
void removeAddressSpace() { setAddressSpace(LangAS::Default); }
void addAddressSpace(LangAS space) {
  assert(space != LangAS::Default)((space != LangAS::Default) ? static_cast<void> (0) : __assert_fail
 ("space != LangAS::Default", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 388, __PRETTY_FUNCTION__));
  setAddressSpace(space);
}

// Fast qualifiers are those that can be allocated directly
// on a QualType object.
bool hasFastQualifiers() const { return getFastQualifiers(); }
unsigned getFastQualifiers() const { return Mask & FastMask; }
void setFastQualifiers(unsigned mask) {
  assert(!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits")((!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits"
) ? static_cast<void> (0) : __assert_fail ("!(mask & ~FastMask) && \"bitmask contains non-fast qualifier bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 397, __PRETTY_FUNCTION__));
  Mask = (Mask & ~FastMask) | mask;
}
void removeFastQualifiers(unsigned mask) {
  assert(!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits")((!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits"
) ? static_cast<void> (0) : __assert_fail ("!(mask & ~FastMask) && \"bitmask contains non-fast qualifier bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 401, __PRETTY_FUNCTION__));
  Mask &= ~mask;
}
void removeFastQualifiers() {
  removeFastQualifiers(FastMask);
}
void addFastQualifiers(unsigned mask) {
  assert(!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits")((!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits"
) ? static_cast<void> (0) : __assert_fail ("!(mask & ~FastMask) && \"bitmask contains non-fast qualifier bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 408, __PRETTY_FUNCTION__));
  Mask |= mask;
}

/// Return true if the set contains any qualifiers which require an ExtQuals
/// node to be allocated.
bool hasNonFastQualifiers() const { return Mask & ~FastMask; }
Qualifiers getNonFastQualifiers() const {
  Qualifiers Quals = *this;
  Quals.setFastQualifiers(0);
  return Quals;
}

/// Return true if the set contains any qualifiers.
bool hasQualifiers() const { return Mask; }
bool empty() const { return !Mask; }

/// Add the qualifiers from the given set to this set.
void addQualifiers(Qualifiers Q) {
  // If the other set doesn't have any non-boolean qualifiers, just
  // bit-or it in.
  if (!(Q.Mask & ~CVRMask))
    Mask |= Q.Mask;
  else {
    Mask |= (Q.Mask & CVRMask);
    if (Q.hasAddressSpace())
      addAddressSpace(Q.getAddressSpace());
    if (Q.hasObjCGCAttr())
      addObjCGCAttr(Q.getObjCGCAttr());
    if (Q.hasObjCLifetime())
      addObjCLifetime(Q.getObjCLifetime());
  }
}

/// Remove the qualifiers from the given set from this set.
void removeQualifiers(Qualifiers Q) {
  // If the other set doesn't have any non-boolean qualifiers, just
  // bit-and the inverse in.
  if (!(Q.Mask & ~CVRMask))
    Mask &= ~Q.Mask;
  else {
    Mask &= ~(Q.Mask & CVRMask);
    if (getObjCGCAttr() == Q.getObjCGCAttr())
      removeObjCGCAttr();
    if (getObjCLifetime() == Q.getObjCLifetime())
      removeObjCLifetime();
    if (getAddressSpace() == Q.getAddressSpace())
      removeAddressSpace();
  }
}

/// Add the qualifiers from the given set to this set, given that
/// they don't conflict.
void addConsistentQualifiers(Qualifiers qs) {
  assert(getAddressSpace() == qs.getAddressSpace() ||((getAddressSpace() == qs.getAddressSpace() || !hasAddressSpace
() || !qs.hasAddressSpace()) ? static_cast<void> (0) : __assert_fail
 ("getAddressSpace() == qs.getAddressSpace() || !hasAddressSpace() || !qs.hasAddressSpace()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 463, __PRETTY_FUNCTION__))
         !hasAddressSpace() || !qs.hasAddressSpace())((getAddressSpace() == qs.getAddressSpace() || !hasAddressSpace
() || !qs.hasAddressSpace()) ? static_cast<void> (0) : __assert_fail
 ("getAddressSpace() == qs.getAddressSpace() || !hasAddressSpace() || !qs.hasAddressSpace()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 463, __PRETTY_FUNCTION__));
  assert(getObjCGCAttr() == qs.getObjCGCAttr() ||((getObjCGCAttr() == qs.getObjCGCAttr() || !hasObjCGCAttr() ||
 !qs.hasObjCGCAttr()) ? static_cast<void> (0) : __assert_fail
 ("getObjCGCAttr() == qs.getObjCGCAttr() || !hasObjCGCAttr() || !qs.hasObjCGCAttr()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 465, __PRETTY_FUNCTION__))
         !hasObjCGCAttr() || !qs.hasObjCGCAttr())((getObjCGCAttr() == qs.getObjCGCAttr() || !hasObjCGCAttr() ||
 !qs.hasObjCGCAttr()) ? static_cast<void> (0) : __assert_fail
 ("getObjCGCAttr() == qs.getObjCGCAttr() || !hasObjCGCAttr() || !qs.hasObjCGCAttr()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 465, __PRETTY_FUNCTION__));
  assert(getObjCLifetime() == qs.getObjCLifetime() ||((getObjCLifetime() == qs.getObjCLifetime() || !hasObjCLifetime
() || !qs.hasObjCLifetime()) ? static_cast<void> (0) : __assert_fail
 ("getObjCLifetime() == qs.getObjCLifetime() || !hasObjCLifetime() || !qs.hasObjCLifetime()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 467, __PRETTY_FUNCTION__))
         !hasObjCLifetime() || !qs.hasObjCLifetime())((getObjCLifetime() == qs.getObjCLifetime() || !hasObjCLifetime
() || !qs.hasObjCLifetime()) ? static_cast<void> (0) : __assert_fail
 ("getObjCLifetime() == qs.getObjCLifetime() || !hasObjCLifetime() || !qs.hasObjCLifetime()"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 467, __PRETTY_FUNCTION__));
  Mask |= qs.Mask;
}

/// Returns true if address space A is equal to or a superset of B.
/// OpenCL v2.0 defines conversion rules (OpenCLC v2.0 s6.5.5) and notion of
/// overlapping address spaces.
/// CL1.1 or CL1.2:
///   every address space is a superset of itself.
/// CL2.0 adds:
///   __generic is a superset of any address space except for __constant.
static bool isAddressSpaceSupersetOf(LangAS A, LangAS B) {
  // Address spaces must match exactly.
  return A == B ||
         // Otherwise in OpenCLC v2.0 s6.5.5: every address space except
         // for __constant can be used as __generic.
         (A == LangAS::opencl_generic && B != LangAS::opencl_constant) ||
         // We also define global_device and global_host address spaces,
         // to distinguish global pointers allocated on host from pointers
         // allocated on device, which are a subset of __global.
         (A == LangAS::opencl_global && (B == LangAS::opencl_global_device ||
                                         B == LangAS::opencl_global_host)) ||
         // Consider pointer size address spaces to be equivalent to default.
         ((isPtrSizeAddressSpace(A) || A == LangAS::Default) &&
          (isPtrSizeAddressSpace(B) || B == LangAS::Default));
}

/// Returns true if the address space in these qualifiers is equal to or
/// a superset of the address space in the argument qualifiers.
bool isAddressSpaceSupersetOf(Qualifiers other) const {
  return isAddressSpaceSupersetOf(getAddressSpace(), other.getAddressSpace());
}

/// Determines if these qualifiers compatibly include another set.
/// Generally this answers the question of whether an object with the other
/// qualifiers can be safely used as an object with these qualifiers.
bool compatiblyIncludes(Qualifiers other) const {
  return isAddressSpaceSupersetOf(other) &&
         // ObjC GC qualifiers can match, be added, or be removed, but can't
         // be changed.
         (getObjCGCAttr() == other.getObjCGCAttr() || !hasObjCGCAttr() ||
          !other.hasObjCGCAttr()) &&
         // ObjC lifetime qualifiers must match exactly.
         getObjCLifetime() == other.getObjCLifetime() &&
         // CVR qualifiers may subset.
         (((Mask & CVRMask) | (other.Mask & CVRMask)) == (Mask & CVRMask)) &&
         // U qualifier may superset.
         (!other.hasUnaligned() || hasUnaligned());
}

/// Determines if these qualifiers compatibly include another set of
/// qualifiers from the narrow perspective of Objective-C ARC lifetime.
///
/// One set of Objective-C lifetime qualifiers compatibly includes the other
/// if the lifetime qualifiers match, or if both are non-__weak and the
/// including set also contains the 'const' qualifier, or both are non-__weak
/// and one is None (which can only happen in non-ARC modes).
bool compatiblyIncludesObjCLifetime(Qualifiers other) const {
  if (getObjCLifetime() == other.getObjCLifetime())
    return true;

  if (getObjCLifetime() == OCL_Weak || other.getObjCLifetime() == OCL_Weak)
    return false;

  if (getObjCLifetime() == OCL_None || other.getObjCLifetime() == OCL_None)
    return true;

  return hasConst();
}

/// Determine whether this set of qualifiers is a strict superset of
/// another set of qualifiers, not considering qualifier compatibility.
bool isStrictSupersetOf(Qualifiers Other) const;

bool operator==(Qualifiers Other) const { return Mask == Other.Mask; }
bool operator!=(Qualifiers Other) const { return Mask != Other.Mask; }

explicit operator bool() const { return hasQualifiers(); }

Qualifiers &operator+=(Qualifiers R) {
  addQualifiers(R);
  return *this;
}

// Union two qualifier sets.  If an enumerated qualifier appears
// in both sets, use the one from the right.
friend Qualifiers operator+(Qualifiers L, Qualifiers R) {
  L += R;
  return L;
}

Qualifiers &operator-=(Qualifiers R) {
  removeQualifiers(R);
  return *this;
}

/// Compute the difference between two qualifier sets.
friend Qualifiers operator-(Qualifiers L, Qualifiers R) {
  L -= R;
  return L;
}

std::string getAsString() const;
std::string getAsString(const PrintingPolicy &Policy) const;

static std::string getAddrSpaceAsString(LangAS AS);

bool isEmptyWhenPrinted(const PrintingPolicy &Policy) const;
void print(raw_ostream &OS, const PrintingPolicy &Policy,
           bool appendSpaceIfNonEmpty = false) const;

void Profile(llvm::FoldingSetNodeID &ID) const {
  ID.AddInteger(Mask);
}

582private:
// bits:     |0 1 2|3|4 .. 5|6  ..  8|9   ...   31|
//           |C R V|U|GCAttr|Lifetime|AddressSpace|
uint32_t Mask = 0;

static const uint32_t UMask = 0x8;
static const uint32_t UShift = 3;
static const uint32_t GCAttrMask = 0x30;
static const uint32_t GCAttrShift = 4;
static const uint32_t LifetimeMask = 0x1C0;
static const uint32_t LifetimeShift = 6;
static const uint32_t AddressSpaceMask =
    ~(CVRMask | UMask | GCAttrMask | LifetimeMask);
static const uint32_t AddressSpaceShift = 9;
596};

598/// A std::pair-like structure for storing a qualified type split
599/// into its local qualifiers and its locally-unqualified type.
600struct SplitQualType {
/// The locally-unqualified type.
const Type *Ty = nullptr;

/// The local qualifiers.
Qualifiers Quals;

SplitQualType() = default;
SplitQualType(const Type *ty, Qualifiers qs) : Ty(ty), Quals(qs) {}

SplitQualType getSingleStepDesugaredType() const; // end of this file

// Make std::tie work.
std::pair<const Type *,Qualifiers> asPair() const {
  return std::pair<const Type *, Qualifiers>(Ty, Quals);
}

friend bool operator==(SplitQualType a, SplitQualType b) {
  return a.Ty == b.Ty && a.Quals == b.Quals;
}
friend bool operator!=(SplitQualType a, SplitQualType b) {
  return a.Ty != b.Ty || a.Quals != b.Quals;
}
623};

625/// The kind of type we are substituting Objective-C type arguments into.
626///
627/// The kind of substitution affects the replacement of type parameters when
628/// no concrete type information is provided, e.g., when dealing with an
629/// unspecialized type.
630enum class ObjCSubstitutionContext {
/// An ordinary type.
Ordinary,

/// The result type of a method or function.
Result,

/// The parameter type of a method or function.
Parameter,

/// The type of a property.
Property,

/// The superclass of a type.
Superclass,
645};

647/// A (possibly-)qualified type.
648///
649/// For efficiency, we don't store CV-qualified types as nodes on their
650/// own: instead each reference to a type stores the qualifiers.  This
651/// greatly reduces the number of nodes we need to allocate for types (for
652/// example we only need one for 'int', 'const int', 'volatile int',
653/// 'const volatile int', etc).
654///
655/// As an added efficiency bonus, instead of making this a pair, we
656/// just store the two bits we care about in the low bits of the
657/// pointer.  To handle the packing/unpacking, we make QualType be a
658/// simple wrapper class that acts like a smart pointer.  A third bit
659/// indicates whether there are extended qualifiers present, in which
660/// case the pointer points to a special structure.
661class QualType {
friend class QualifierCollector;

// Thankfully, these are efficiently composable.
llvm::PointerIntPair<llvm::PointerUnion<const Type *, const ExtQuals *>,
                     Qualifiers::FastWidth> Value;

const ExtQuals *getExtQualsUnsafe() const {
  return Value.getPointer().get<const ExtQuals*>();
}

const Type *getTypePtrUnsafe() const {
  return Value.getPointer().get<const Type*>();
}

const ExtQualsTypeCommonBase *getCommonPtr() const {
  assert(!isNull() && "Cannot retrieve a NULL type pointer")((!isNull() && "Cannot retrieve a NULL type pointer")
 ? static_cast<void> (0) : __assert_fail ("!isNull() && \"Cannot retrieve a NULL type pointer\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 677, __PRETTY_FUNCTION__));
  auto CommonPtrVal = reinterpret_cast<uintptr_t>(Value.getOpaqueValue());
  CommonPtrVal &= ~(uintptr_t)((1 << TypeAlignmentInBits) - 1);
  return reinterpret_cast<ExtQualsTypeCommonBase*>(CommonPtrVal);
}

683public:
QualType() = default;
QualType(const Type *Ptr, unsigned Quals) : Value(Ptr, Quals) {}
QualType(const ExtQuals *Ptr, unsigned Quals) : Value(Ptr, Quals) {}

unsigned getLocalFastQualifiers() const { return Value.getInt(); }
void setLocalFastQualifiers(unsigned Quals) { Value.setInt(Quals); }

/// Retrieves a pointer to the underlying (unqualified) type.
///
/// This function requires that the type not be NULL. If the type might be
/// NULL, use the (slightly less efficient) \c getTypePtrOrNull().
const Type *getTypePtr() const;

const Type *getTypePtrOrNull() const;

/// Retrieves a pointer to the name of the base type.
const IdentifierInfo *getBaseTypeIdentifier() const;

/// Divides a QualType into its unqualified type and a set of local
/// qualifiers.
SplitQualType split() const;

void *getAsOpaquePtr() const { return Value.getOpaqueValue(); }

static QualType getFromOpaquePtr(const void *Ptr) {
  QualType T;
  T.Value.setFromOpaqueValue(const_cast<void*>(Ptr));
  return T;
}

const Type &operator*() const {
  return *getTypePtr();
}

const Type *operator->() const {
  return getTypePtr();
}

bool isCanonical() const;
bool isCanonicalAsParam() const;

/// Return true if this QualType doesn't point to a type yet.
bool isNull() const {
  return Value.getPointer().isNull();
}

/// Determine whether this particular QualType instance has the
/// "const" qualifier set, without looking through typedefs that may have
/// added "const" at a different level.
bool isLocalConstQualified() const {
  return (getLocalFastQualifiers() & Qualifiers::Const);
}

/// Determine whether this type is const-qualified.
bool isConstQualified() const;

/// Determine whether this particular QualType instance has the
/// "restrict" qualifier set, without looking through typedefs that may have
/// added "restrict" at a different level.
bool isLocalRestrictQualified() const {
  return (getLocalFastQualifiers() & Qualifiers::Restrict);
}

/// Determine whether this type is restrict-qualified.
bool isRestrictQualified() const;

/// Determine whether this particular QualType instance has the
/// "volatile" qualifier set, without looking through typedefs that may have
/// added "volatile" at a different level.
bool isLocalVolatileQualified() const {
  return (getLocalFastQualifiers() & Qualifiers::Volatile);
}

/// Determine whether this type is volatile-qualified.
bool isVolatileQualified() const;

/// Determine whether this particular QualType instance has any
/// qualifiers, without looking through any typedefs that might add
/// qualifiers at a different level.
bool hasLocalQualifiers() const {
  return getLocalFastQualifiers() || hasLocalNonFastQualifiers();
}

/// Determine whether this type has any qualifiers.
bool hasQualifiers() const;

/// Determine whether this particular QualType instance has any
/// "non-fast" qualifiers, e.g., those that are stored in an ExtQualType
/// instance.
bool hasLocalNonFastQualifiers() const {
  return Value.getPointer().is<const ExtQuals*>();
}

/// Retrieve the set of qualifiers local to this particular QualType
/// instance, not including any qualifiers acquired through typedefs or
/// other sugar.
Qualifiers getLocalQualifiers() const;

/// Retrieve the set of qualifiers applied to this type.
Qualifiers getQualifiers() const;

/// Retrieve the set of CVR (const-volatile-restrict) qualifiers
/// local to this particular QualType instance, not including any qualifiers
/// acquired through typedefs or other sugar.
unsigned getLocalCVRQualifiers() const {
  return getLocalFastQualifiers();
}

/// Retrieve the set of CVR (const-volatile-restrict) qualifiers
/// applied to this type.
unsigned getCVRQualifiers() const;

bool isConstant(const ASTContext& Ctx) const {
  return QualType::isConstant(*this, Ctx);
}

/// Determine whether this is a Plain Old Data (POD) type (C++ 3.9p10).
bool isPODType(const ASTContext &Context) const;

/// Return true if this is a POD type according to the rules of the C++98
/// standard, regardless of the current compilation's language.
bool isCXX98PODType(const ASTContext &Context) const;

/// Return true if this is a POD type according to the more relaxed rules
/// of the C++11 standard, regardless of the current compilation's language.
/// (C++0x [basic.types]p9). Note that, unlike
/// CXXRecordDecl::isCXX11StandardLayout, this takes DRs into account.
bool isCXX11PODType(const ASTContext &Context) const;

/// Return true if this is a trivial type per (C++0x [basic.types]p9)
bool isTrivialType(const ASTContext &Context) const;

/// Return true if this is a trivially copyable type (C++0x [basic.types]p9)
bool isTriviallyCopyableType(const ASTContext &Context) const;


/// Returns true if it is a class and it might be dynamic.
bool mayBeDynamicClass() const;

/// Returns true if it is not a class or if the class might not be dynamic.
bool mayBeNotDynamicClass() const;

// Don't promise in the API that anything besides 'const' can be
// easily added.

/// Add the `const` type qualifier to this QualType.
void addConst() {
  addFastQualifiers(Qualifiers::Const);
}
QualType withConst() const {
  return withFastQualifiers(Qualifiers::Const);
}

/// Add the `volatile` type qualifier to this QualType.
void addVolatile() {
  addFastQualifiers(Qualifiers::Volatile);
}
QualType withVolatile() const {
  return withFastQualifiers(Qualifiers::Volatile);
}

/// Add the `restrict` qualifier to this QualType.
void addRestrict() {
  addFastQualifiers(Qualifiers::Restrict);
}
QualType withRestrict() const {
  return withFastQualifiers(Qualifiers::Restrict);
}

QualType withCVRQualifiers(unsigned CVR) const {
  return withFastQualifiers(CVR);
}

void addFastQualifiers(unsigned TQs) {
  assert(!(TQs & ~Qualifiers::FastMask)((!(TQs & ~Qualifiers::FastMask) && "non-fast qualifier bits set in mask!"
) ? static_cast<void> (0) : __assert_fail ("!(TQs & ~Qualifiers::FastMask) && \"non-fast qualifier bits set in mask!\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 859, __PRETTY_FUNCTION__))
         && "non-fast qualifier bits set in mask!")((!(TQs & ~Qualifiers::FastMask) && "non-fast qualifier bits set in mask!"
) ? static_cast<void> (0) : __assert_fail ("!(TQs & ~Qualifiers::FastMask) && \"non-fast qualifier bits set in mask!\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 859, __PRETTY_FUNCTION__));
  Value.setInt(Value.getInt() | TQs);
}

void removeLocalConst();
void removeLocalVolatile();
void removeLocalRestrict();
void removeLocalCVRQualifiers(unsigned Mask);

void removeLocalFastQualifiers() { Value.setInt(0); }
void removeLocalFastQualifiers(unsigned Mask) {
  assert(!(Mask & ~Qualifiers::FastMask) && "mask has non-fast qualifiers")((!(Mask & ~Qualifiers::FastMask) && "mask has non-fast qualifiers"
) ? static_cast<void> (0) : __assert_fail ("!(Mask & ~Qualifiers::FastMask) && \"mask has non-fast qualifiers\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 870, __PRETTY_FUNCTION__));
  Value.setInt(Value.getInt() & ~Mask);
}

// Creates a type with the given qualifiers in addition to any
// qualifiers already on this type.
QualType withFastQualifiers(unsigned TQs) const {
  QualType T = *this;
  T.addFastQualifiers(TQs);
  return T;
}

// Creates a type with exactly the given fast qualifiers, removing
// any existing fast qualifiers.
QualType withExactLocalFastQualifiers(unsigned TQs) const {
  return withoutLocalFastQualifiers().withFastQualifiers(TQs);
}

// Removes fast qualifiers, but leaves any extended qualifiers in place.
QualType withoutLocalFastQualifiers() const {
  QualType T = *this;
  T.removeLocalFastQualifiers();
  return T;
}

QualType getCanonicalType() const;

/// Return this type with all of the instance-specific qualifiers
/// removed, but without removing any qualifiers that may have been applied
/// through typedefs.
QualType getLocalUnqualifiedType() const { return QualType(getTypePtr(), 0); }

/// Retrieve the unqualified variant of the given type,
/// removing as little sugar as possible.
///
/// This routine looks through various kinds of sugar to find the
/// least-desugared type that is unqualified. For example, given:
///
/// \code
/// typedef int Integer;
/// typedef const Integer CInteger;
/// typedef CInteger DifferenceType;
/// \endcode
///
/// Executing \c getUnqualifiedType() on the type \c DifferenceType will
/// desugar until we hit the type \c Integer, which has no qualifiers on it.
///
/// The resulting type might still be qualified if it's sugar for an array
/// type.  To strip qualifiers even from within a sugared array type, use
/// ASTContext::getUnqualifiedArrayType.
inline QualType getUnqualifiedType() const;

/// Retrieve the unqualified variant of the given type, removing as little
/// sugar as possible.
///
/// Like getUnqualifiedType(), but also returns the set of
/// qualifiers that were built up.
///
/// The resulting type might still be qualified if it's sugar for an array
/// type.  To strip qualifiers even from within a sugared array type, use
/// ASTContext::getUnqualifiedArrayType.
inline SplitQualType getSplitUnqualifiedType() const;

/// Determine whether this type is more qualified than the other
/// given type, requiring exact equality for non-CVR qualifiers.
bool isMoreQualifiedThan(QualType Other) const;

/// Determine whether this type is at least as qualified as the other
/// given type, requiring exact equality for non-CVR qualifiers.
bool isAtLeastAsQualifiedAs(QualType Other) const;

QualType getNonReferenceType() const;

/// Determine the type of a (typically non-lvalue) expression with the
/// specified result type.
///
/// This routine should be used for expressions for which the return type is
/// explicitly specified (e.g., in a cast or call) and isn't necessarily
/// an lvalue. It removes a top-level reference (since there are no
/// expressions of reference type) and deletes top-level cvr-qualifiers
/// from non-class types (in C++) or all types (in C).
QualType getNonLValueExprType(const ASTContext &Context) const;

/// Remove an outer pack expansion type (if any) from this type. Used as part
/// of converting the type of a declaration to the type of an expression that
/// references that expression. It's meaningless for an expression to have a
/// pack expansion type.
QualType getNonPackExpansionType() const;

/// Return the specified type with any "sugar" removed from
/// the type.  This takes off typedefs, typeof's etc.  If the outer level of
/// the type is already concrete, it returns it unmodified.  This is similar
/// to getting the canonical type, but it doesn't remove *all* typedefs.  For
/// example, it returns "T*" as "T*", (not as "int*"), because the pointer is
/// concrete.
///
/// Qualifiers are left in place.
QualType getDesugaredType(const ASTContext &Context) const {
  return getDesugaredType(*this, Context);
}

SplitQualType getSplitDesugaredType() const {
  return getSplitDesugaredType(*this);
}

/// Return the specified type with one level of "sugar" removed from
/// the type.
///
/// This routine takes off the first typedef, typeof, etc. If the outer level
/// of the type is already concrete, it returns it unmodified.
QualType getSingleStepDesugaredType(const ASTContext &Context) const {
  return getSingleStepDesugaredTypeImpl(*this, Context);
}

/// Returns the specified type after dropping any
/// outer-level parentheses.
QualType IgnoreParens() const {
  if (isa<ParenType>(*this))
    return QualType::IgnoreParens(*this);
  return *this;
}

/// Indicate whether the specified types and qualifiers are identical.
friend bool operator==(const QualType &LHS, const QualType &RHS) {
  return LHS.Value == RHS.Value;
20
←
Calling 'PointerIntPair::operator=='→
23
←
Returning from 'PointerIntPair::operator=='→
24
←
Returning zero, which participates in a condition later→
}
friend bool operator!=(const QualType &LHS, const QualType &RHS) {
  return LHS.Value != RHS.Value;
}
friend bool operator<(const QualType &LHS, const QualType &RHS) {
  return LHS.Value < RHS.Value;
}

static std::string getAsString(SplitQualType split,
                               const PrintingPolicy &Policy) {
  return getAsString(split.Ty, split.Quals, Policy);
}
static std::string getAsString(const Type *ty, Qualifiers qs,
                               const PrintingPolicy &Policy);

std::string getAsString() const;
std::string getAsString(const PrintingPolicy &Policy) const;

void print(raw_ostream &OS, const PrintingPolicy &Policy,
           const Twine &PlaceHolder = Twine(),
           unsigned Indentation = 0) const;

static void print(SplitQualType split, raw_ostream &OS,
                  const PrintingPolicy &policy, const Twine &PlaceHolder,
                  unsigned Indentation = 0) {
  return print(split.Ty, split.Quals, OS, policy, PlaceHolder, Indentation);
}

static void print(const Type *ty, Qualifiers qs,
                  raw_ostream &OS, const PrintingPolicy &policy,
                  const Twine &PlaceHolder,
                  unsigned Indentation = 0);

void getAsStringInternal(std::string &Str,
                         const PrintingPolicy &Policy) const;

static void getAsStringInternal(SplitQualType split, std::string &out,
                                const PrintingPolicy &policy) {
  return getAsStringInternal(split.Ty, split.Quals, out, policy);
}

static void getAsStringInternal(const Type *ty, Qualifiers qs,
                                std::string &out,
                                const PrintingPolicy &policy);

class StreamedQualTypeHelper {
  const QualType &T;
  const PrintingPolicy &Policy;
  const Twine &PlaceHolder;
  unsigned Indentation;

public:
  StreamedQualTypeHelper(const QualType &T, const PrintingPolicy &Policy,
                         const Twine &PlaceHolder, unsigned Indentation)
      : T(T), Policy(Policy), PlaceHolder(PlaceHolder),
        Indentation(Indentation) {}

  friend raw_ostream &operator<<(raw_ostream &OS,
                                 const StreamedQualTypeHelper &SQT) {
    SQT.T.print(OS, SQT.Policy, SQT.PlaceHolder, SQT.Indentation);
    return OS;
  }
};

StreamedQualTypeHelper stream(const PrintingPolicy &Policy,
                              const Twine &PlaceHolder = Twine(),
                              unsigned Indentation = 0) const {
  return StreamedQualTypeHelper(*this, Policy, PlaceHolder, Indentation);
}

void dump(const char *s) const;
void dump() const;
void dump(llvm::raw_ostream &OS, const ASTContext &Context) const;

void Profile(llvm::FoldingSetNodeID &ID) const {
  ID.AddPointer(getAsOpaquePtr());
}

/// Check if this type has any address space qualifier.
inline bool hasAddressSpace() const;

/// Return the address space of this type.
inline LangAS getAddressSpace() const;

/// Returns true if address space qualifiers overlap with T address space
/// qualifiers.
/// OpenCL C defines conversion rules for pointers to different address spaces
/// and notion of overlapping address spaces.
/// CL1.1 or CL1.2:
///   address spaces overlap iff they are they same.
/// OpenCL C v2.0 s6.5.5 adds:
///   __generic overlaps with any address space except for __constant.
bool isAddressSpaceOverlapping(QualType T) const {
  Qualifiers Q = getQualifiers();
  Qualifiers TQ = T.getQualifiers();
  // Address spaces overlap if at least one of them is a superset of another
  return Q.isAddressSpaceSupersetOf(TQ) || TQ.isAddressSpaceSupersetOf(Q);
}

/// Returns gc attribute of this type.
inline Qualifiers::GC getObjCGCAttr() const;

/// true when Type is objc's weak.
bool isObjCGCWeak() const {
  return getObjCGCAttr() == Qualifiers::Weak;
}

/// true when Type is objc's strong.
bool isObjCGCStrong() const {
  return getObjCGCAttr() == Qualifiers::Strong;
}

/// Returns lifetime attribute of this type.
Qualifiers::ObjCLifetime getObjCLifetime() const {
  return getQualifiers().getObjCLifetime();
}

bool hasNonTrivialObjCLifetime() const {
  return getQualifiers().hasNonTrivialObjCLifetime();
}

bool hasStrongOrWeakObjCLifetime() const {
  return getQualifiers().hasStrongOrWeakObjCLifetime();
}

// true when Type is objc's weak and weak is enabled but ARC isn't.
bool isNonWeakInMRRWithObjCWeak(const ASTContext &Context) const;

enum PrimitiveDefaultInitializeKind {
  /// The type does not fall into any of the following categories. Note that
  /// this case is zero-valued so that values of this enum can be used as a
  /// boolean condition for non-triviality.
  PDIK_Trivial,

  /// The type is an Objective-C retainable pointer type that is qualified
  /// with the ARC __strong qualifier.
  PDIK_ARCStrong,

  /// The type is an Objective-C retainable pointer type that is qualified
  /// with the ARC __weak qualifier.
  PDIK_ARCWeak,

  /// The type is a struct containing a field whose type is not PCK_Trivial.
  PDIK_Struct
};

/// Functions to query basic properties of non-trivial C struct types.

/// Check if this is a non-trivial type that would cause a C struct
/// transitively containing this type to be non-trivial to default initialize
/// and return the kind.
PrimitiveDefaultInitializeKind
isNonTrivialToPrimitiveDefaultInitialize() const;

enum PrimitiveCopyKind {
  /// The type does not fall into any of the following categories. Note that
  /// this case is zero-valued so that values of this enum can be used as a
  /// boolean condition for non-triviality.
  PCK_Trivial,

  /// The type would be trivial except that it is volatile-qualified. Types
  /// that fall into one of the other non-trivial cases may additionally be
  /// volatile-qualified.
  PCK_VolatileTrivial,

  /// The type is an Objective-C retainable pointer type that is qualified
  /// with the ARC __strong qualifier.
  PCK_ARCStrong,

  /// The type is an Objective-C retainable pointer type that is qualified
  /// with the ARC __weak qualifier.
  PCK_ARCWeak,

  /// The type is a struct containing a field whose type is neither
  /// PCK_Trivial nor PCK_VolatileTrivial.
  /// Note that a C++ struct type does not necessarily match this; C++ copying
  /// semantics are too complex to express here, in part because they depend
  /// on the exact constructor or assignment operator that is chosen by
  /// overload resolution to do the copy.
  PCK_Struct
};

/// Check if this is a non-trivial type that would cause a C struct
/// transitively containing this type to be non-trivial to copy and return the
/// kind.
PrimitiveCopyKind isNonTrivialToPrimitiveCopy() const;

/// Check if this is a non-trivial type that would cause a C struct
/// transitively containing this type to be non-trivial to destructively
/// move and return the kind. Destructive move in this context is a C++-style
/// move in which the source object is placed in a valid but unspecified state
/// after it is moved, as opposed to a truly destructive move in which the
/// source object is placed in an uninitialized state.
PrimitiveCopyKind isNonTrivialToPrimitiveDestructiveMove() const;

enum DestructionKind {
  DK_none,
  DK_cxx_destructor,
  DK_objc_strong_lifetime,
  DK_objc_weak_lifetime,
  DK_nontrivial_c_struct
};

/// Returns a nonzero value if objects of this type require
/// non-trivial work to clean up after.  Non-zero because it's
/// conceivable that qualifiers (objc_gc(weak)?) could make
/// something require destruction.
DestructionKind isDestructedType() const {
  return isDestructedTypeImpl(*this);
}

/// Check if this is or contains a C union that is non-trivial to
/// default-initialize, which is a union that has a member that is non-trivial
/// to default-initialize. If this returns true,
/// isNonTrivialToPrimitiveDefaultInitialize returns PDIK_Struct.
bool hasNonTrivialToPrimitiveDefaultInitializeCUnion() const;

/// Check if this is or contains a C union that is non-trivial to destruct,
/// which is a union that has a member that is non-trivial to destruct. If
/// this returns true, isDestructedType returns DK_nontrivial_c_struct.
bool hasNonTrivialToPrimitiveDestructCUnion() const;

/// Check if this is or contains a C union that is non-trivial to copy, which
/// is a union that has a member that is non-trivial to copy. If this returns
/// true, isNonTrivialToPrimitiveCopy returns PCK_Struct.
bool hasNonTrivialToPrimitiveCopyCUnion() const;

/// Determine whether expressions of the given type are forbidden
/// from being lvalues in C.
///
/// The expression types that are forbidden to be lvalues are:
///   - 'void', but not qualified void
///   - function types
///
/// The exact rule here is C99 6.3.2.1:
///   An lvalue is an expression with an object type or an incomplete
///   type other than void.
bool isCForbiddenLValueType() const;

/// Substitute type arguments for the Objective-C type parameters used in the
/// subject type.
///
/// \param ctx ASTContext in which the type exists.
///
/// \param typeArgs The type arguments that will be substituted for the
/// Objective-C type parameters in the subject type, which are generally
/// computed via \c Type::getObjCSubstitutions. If empty, the type
/// parameters will be replaced with their bounds or id/Class, as appropriate
/// for the context.
///
/// \param context The context in which the subject type was written.
///
/// \returns the resulting type.
QualType substObjCTypeArgs(ASTContext &ctx,
                           ArrayRef<QualType> typeArgs,
                           ObjCSubstitutionContext context) const;

/// Substitute type arguments from an object type for the Objective-C type
/// parameters used in the subject type.
///
/// This operation combines the computation of type arguments for
/// substitution (\c Type::getObjCSubstitutions) with the actual process of
/// substitution (\c QualType::substObjCTypeArgs) for the convenience of
/// callers that need to perform a single substitution in isolation.
///
/// \param objectType The type of the object whose member type we're
/// substituting into. For example, this might be the receiver of a message
/// or the base of a property access.
///
/// \param dc The declaration context from which the subject type was
/// retrieved, which indicates (for example) which type parameters should
/// be substituted.
///
/// \param context The context in which the subject type was written.
///
/// \returns the subject type after replacing all of the Objective-C type
/// parameters with their corresponding arguments.
QualType substObjCMemberType(QualType objectType,
                             const DeclContext *dc,
                             ObjCSubstitutionContext context) const;

/// Strip Objective-C "__kindof" types from the given type.
QualType stripObjCKindOfType(const ASTContext &ctx) const;

/// Remove all qualifiers including _Atomic.
QualType getAtomicUnqualifiedType() const;

1282private:
// These methods are implemented in a separate translation unit;
// "static"-ize them to avoid creating temporary QualTypes in the
// caller.
static bool isConstant(QualType T, const ASTContext& Ctx);
static QualType getDesugaredType(QualType T, const ASTContext &Context);
static SplitQualType getSplitDesugaredType(QualType T);
static SplitQualType getSplitUnqualifiedTypeImpl(QualType type);
static QualType getSingleStepDesugaredTypeImpl(QualType type,
                                               const ASTContext &C);
static QualType IgnoreParens(QualType T);
static DestructionKind isDestructedTypeImpl(QualType type);

/// Check if \param RD is or contains a non-trivial C union.
static bool hasNonTrivialToPrimitiveDefaultInitializeCUnion(const RecordDecl *RD);
static bool hasNonTrivialToPrimitiveDestructCUnion(const RecordDecl *RD);
static bool hasNonTrivialToPrimitiveCopyCUnion(const RecordDecl *RD);
1299};

1301} // namespace clang

1303namespace llvm {

1305/// Implement simplify_type for QualType, so that we can dyn_cast from QualType
1306/// to a specific Type class.
1307template<> struct simplify_type< ::clang::QualType> {
using SimpleType = const ::clang::Type *;

static SimpleType getSimplifiedValue(::clang::QualType Val) {
  return Val.getTypePtr();
}
1313};

1315// Teach SmallPtrSet that QualType is "basically a pointer".
1316template<>
1317struct PointerLikeTypeTraits<clang::QualType> {
static inline void *getAsVoidPointer(clang::QualType P) {
  return P.getAsOpaquePtr();
}

static inline clang::QualType getFromVoidPointer(void *P) {
  return clang::QualType::getFromOpaquePtr(P);
}

// Various qualifiers go in low bits.
static constexpr int NumLowBitsAvailable = 0;
1328};

1330} // namespace llvm

1332namespace clang {

1334/// Base class that is common to both the \c ExtQuals and \c Type
1335/// classes, which allows \c QualType to access the common fields between the
1336/// two.
1337class ExtQualsTypeCommonBase {
friend class ExtQuals;
friend class QualType;
friend class Type;

/// The "base" type of an extended qualifiers type (\c ExtQuals) or
/// a self-referential pointer (for \c Type).
///
/// This pointer allows an efficient mapping from a QualType to its
/// underlying type pointer.
const Type *const BaseType;

/// The canonical type of this type.  A QualType.
QualType CanonicalType;

ExtQualsTypeCommonBase(const Type *baseType, QualType canon)
    : BaseType(baseType), CanonicalType(canon) {}
1354};

1356/// We can encode up to four bits in the low bits of a
1357/// type pointer, but there are many more type qualifiers that we want
1358/// to be able to apply to an arbitrary type.  Therefore we have this
1359/// struct, intended to be heap-allocated and used by QualType to
1360/// store qualifiers.
1361///
1362/// The current design tags the 'const', 'restrict', and 'volatile' qualifiers
1363/// in three low bits on the QualType pointer; a fourth bit records whether
1364/// the pointer is an ExtQuals node. The extended qualifiers (address spaces,
1365/// Objective-C GC attributes) are much more rare.
1366class ExtQuals : public ExtQualsTypeCommonBase, public llvm::FoldingSetNode {
// NOTE: changing the fast qualifiers should be straightforward as
// long as you don't make 'const' non-fast.
// 1. Qualifiers:
//    a) Modify the bitmasks (Qualifiers::TQ and DeclSpec::TQ).
//       Fast qualifiers must occupy the low-order bits.
//    b) Update Qualifiers::FastWidth and FastMask.
// 2. QualType:
//    a) Update is{Volatile,Restrict}Qualified(), defined inline.
//    b) Update remove{Volatile,Restrict}, defined near the end of
//       this header.
// 3. ASTContext:
//    a) Update get{Volatile,Restrict}Type.

/// The immutable set of qualifiers applied by this node. Always contains
/// extended qualifiers.
Qualifiers Quals;

ExtQuals *this_() { return this; }

1386public:
ExtQuals(const Type *baseType, QualType canon, Qualifiers quals)
    : ExtQualsTypeCommonBase(baseType,
                             canon.isNull() ? QualType(this_(), 0) : canon),
      Quals(quals) {
  assert(Quals.hasNonFastQualifiers()((Quals.hasNonFastQualifiers() && "ExtQuals created with no fast qualifiers"
) ? static_cast<void> (0) : __assert_fail ("Quals.hasNonFastQualifiers() && \"ExtQuals created with no fast qualifiers\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 1392, __PRETTY_FUNCTION__))
         && "ExtQuals created with no fast qualifiers")((Quals.hasNonFastQualifiers() && "ExtQuals created with no fast qualifiers"
) ? static_cast<void> (0) : __assert_fail ("Quals.hasNonFastQualifiers() && \"ExtQuals created with no fast qualifiers\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 1392, __PRETTY_FUNCTION__));
  assert(!Quals.hasFastQualifiers()((!Quals.hasFastQualifiers() && "ExtQuals created with fast qualifiers"
) ? static_cast<void> (0) : __assert_fail ("!Quals.hasFastQualifiers() && \"ExtQuals created with fast qualifiers\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 1394, __PRETTY_FUNCTION__))
         && "ExtQuals created with fast qualifiers")((!Quals.hasFastQualifiers() && "ExtQuals created with fast qualifiers"
) ? static_cast<void> (0) : __assert_fail ("!Quals.hasFastQualifiers() && \"ExtQuals created with fast qualifiers\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 1394, __PRETTY_FUNCTION__));
}

Qualifiers getQualifiers() const { return Quals; }

bool hasObjCGCAttr() const { return Quals.hasObjCGCAttr(); }
Qualifiers::GC getObjCGCAttr() const { return Quals.getObjCGCAttr(); }

bool hasObjCLifetime() const { return Quals.hasObjCLifetime(); }
Qualifiers::ObjCLifetime getObjCLifetime() const {
  return Quals.getObjCLifetime();
}

bool hasAddressSpace() const { return Quals.hasAddressSpace(); }
LangAS getAddressSpace() const { return Quals.getAddressSpace(); }

const Type *getBaseType() const { return BaseType; }

1412public:
void Profile(llvm::FoldingSetNodeID &ID) const {
  Profile(ID, getBaseType(), Quals);
}

static void Profile(llvm::FoldingSetNodeID &ID,
                    const Type *BaseType,
                    Qualifiers Quals) {
  assert(!Quals.hasFastQualifiers() && "fast qualifiers in ExtQuals hash!")((!Quals.hasFastQualifiers() && "fast qualifiers in ExtQuals hash!"
) ? static_cast<void> (0) : __assert_fail ("!Quals.hasFastQualifiers() && \"fast qualifiers in ExtQuals hash!\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 1420, __PRETTY_FUNCTION__));
  ID.AddPointer(BaseType);
  Quals.Profile(ID);
}
1424};

1426/// The kind of C++11 ref-qualifier associated with a function type.
1427/// This determines whether a member function's "this" object can be an
1428/// lvalue, rvalue, or neither.
1429enum RefQualifierKind {
/// No ref-qualifier was provided.
RQ_None = 0,

/// An lvalue ref-qualifier was provided (\c &).
RQ_LValue,

/// An rvalue ref-qualifier was provided (\c &&).
RQ_RValue
1438};

1440/// Which keyword(s) were used to create an AutoType.
1441enum class AutoTypeKeyword {
/// auto
Auto,

/// decltype(auto)
DecltypeAuto,

/// __auto_type (GNU extension)
GNUAutoType
1450};

1452/// The base class of the type hierarchy.
1453///
1454/// A central concept with types is that each type always has a canonical
1455/// type.  A canonical type is the type with any typedef names stripped out
1456/// of it or the types it references.  For example, consider:
1457///
1458///  typedef int  foo;
1459///  typedef foo* bar;
1460///    'int *'    'foo *'    'bar'
1461///
1462/// There will be a Type object created for 'int'.  Since int is canonical, its
1463/// CanonicalType pointer points to itself.  There is also a Type for 'foo' (a
1464/// TypedefType).  Its CanonicalType pointer points to the 'int' Type.  Next
1465/// there is a PointerType that represents 'int*', which, like 'int', is
1466/// canonical.  Finally, there is a PointerType type for 'foo*' whose canonical
1467/// type is 'int*', and there is a TypedefType for 'bar', whose canonical type
1468/// is also 'int*'.
1469///
1470/// Non-canonical types are useful for emitting diagnostics, without losing
1471/// information about typedefs being used.  Canonical types are useful for type
1472/// comparisons (they allow by-pointer equality tests) and useful for reasoning
1473/// about whether something has a particular form (e.g. is a function type),
1474/// because they implicitly, recursively, strip all typedefs out of a type.
1475///
1476/// Types, once created, are immutable.
1477///
1478class alignas(8) Type : public ExtQualsTypeCommonBase {
1479public:
enum TypeClass {
1481#define TYPE(Class, Base) Class,
1482#define LAST_TYPE(Class) TypeLast = Class
1483#define ABSTRACT_TYPE(Class, Base)
1484#include "clang/AST/TypeNodes.inc"
};

1487private:
/// Bitfields required by the Type class.
class TypeBitfields {
  friend class Type;
  template <class T> friend class TypePropertyCache;

  /// TypeClass bitfield - Enum that specifies what subclass this belongs to.
  unsigned TC : 8;

  /// Store information on the type dependency.
  unsigned Dependence : llvm::BitWidth<TypeDependence>;

  /// True if the cache (i.e. the bitfields here starting with
  /// 'Cache') is valid.
  mutable unsigned CacheValid : 1;

  /// Linkage of this type.
  mutable unsigned CachedLinkage : 3;

  /// Whether this type involves and local or unnamed types.
  mutable unsigned CachedLocalOrUnnamed : 1;

  /// Whether this type comes from an AST file.
  mutable unsigned FromAST : 1;

  bool isCacheValid() const {
    return CacheValid;
  }

  Linkage getLinkage() const {
    assert(isCacheValid() && "getting linkage from invalid cache")((isCacheValid() && "getting linkage from invalid cache"
) ? static_cast<void> (0) : __assert_fail ("isCacheValid() && \"getting linkage from invalid cache\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 1517, __PRETTY_FUNCTION__));
    return static_cast<Linkage>(CachedLinkage);
  }

  bool hasLocalOrUnnamedType() const {
    assert(isCacheValid() && "getting linkage from invalid cache")((isCacheValid() && "getting linkage from invalid cache"
) ? static_cast<void> (0) : __assert_fail ("isCacheValid() && \"getting linkage from invalid cache\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 1522, __PRETTY_FUNCTION__));
    return CachedLocalOrUnnamed;
  }
};
enum { NumTypeBits = 8 + llvm::BitWidth<TypeDependence> + 6 };

1528protected:
// These classes allow subclasses to somewhat cleanly pack bitfields
// into Type.

class ArrayTypeBitfields {
  friend class ArrayType;

  unsigned : NumTypeBits;

  /// CVR qualifiers from declarations like
  /// 'int X[static restrict 4]'. For function parameters only.
  unsigned IndexTypeQuals : 3;

  /// Storage class qualifiers from declarations like
  /// 'int X[static restrict 4]'. For function parameters only.
  /// Actually an ArrayType::ArraySizeModifier.
  unsigned SizeModifier : 3;
};

class ConstantArrayTypeBitfields {
  friend class ConstantArrayType;

  unsigned : NumTypeBits + 3 + 3;

  /// Whether we have a stored size expression.
  unsigned HasStoredSizeExpr : 1;
};

class BuiltinTypeBitfields {
  friend class BuiltinType;

  unsigned : NumTypeBits;

  /// The kind (BuiltinType::Kind) of builtin type this is.
  unsigned Kind : 8;
};

/// FunctionTypeBitfields store various bits belonging to FunctionProtoType.
/// Only common bits are stored here. Additional uncommon bits are stored
/// in a trailing object after FunctionProtoType.
class FunctionTypeBitfields {
  friend class FunctionProtoType;
  friend class FunctionType;

  unsigned : NumTypeBits;

  /// Extra information which affects how the function is called, like
  /// regparm and the calling convention.
  unsigned ExtInfo : 13;

  /// The ref-qualifier associated with a \c FunctionProtoType.
  ///
  /// This is a value of type \c RefQualifierKind.
  unsigned RefQualifier : 2;

  /// Used only by FunctionProtoType, put here to pack with the
  /// other bitfields.
  /// The qualifiers are part of FunctionProtoType because...
  ///
  /// C++ 8.3.5p4: The return type, the parameter type list and the
  /// cv-qualifier-seq, [...], are part of the function type.
  unsigned FastTypeQuals : Qualifiers::FastWidth;
  /// Whether this function has extended Qualifiers.
  unsigned HasExtQuals : 1;

  /// The number of parameters this function has, not counting '...'.
  /// According to [implimits] 8 bits should be enough here but this is
  /// somewhat easy to exceed with metaprogramming and so we would like to
  /// keep NumParams as wide as reasonably possible.
  unsigned NumParams : 16;

  /// The type of exception specification this function has.
  unsigned ExceptionSpecType : 4;

  /// Whether this function has extended parameter information.
  unsigned HasExtParameterInfos : 1;

  /// Whether the function is variadic.
  unsigned Variadic : 1;

  /// Whether this function has a trailing return type.
  unsigned HasTrailingReturn : 1;
};

class ObjCObjectTypeBitfields {
  friend class ObjCObjectType;

  unsigned : NumTypeBits;

  /// The number of type arguments stored directly on this object type.
  unsigned NumTypeArgs : 7;

  /// The number of protocols stored directly on this object type.
  unsigned NumProtocols : 6;

  /// Whether this is a "kindof" type.
  unsigned IsKindOf : 1;
};

class ReferenceTypeBitfields {
  friend class ReferenceType;

  unsigned : NumTypeBits;

  /// True if the type was originally spelled with an lvalue sigil.
  /// This is never true of rvalue references but can also be false
  /// on lvalue references because of C++0x [dcl.typedef]p9,
  /// as follows:
  ///
  ///   typedef int &ref;    // lvalue, spelled lvalue
  ///   typedef int &&rvref; // rvalue
  ///   ref &a;              // lvalue, inner ref, spelled lvalue
  ///   ref &&a;             // lvalue, inner ref
  ///   rvref &a;            // lvalue, inner ref, spelled lvalue
  ///   rvref &&a;           // rvalue, inner ref
  unsigned SpelledAsLValue : 1;

  /// True if the inner type is a reference type.  This only happens
  /// in non-canonical forms.
  unsigned InnerRef : 1;
};

class TypeWithKeywordBitfields {
  friend class TypeWithKeyword;

  unsigned : NumTypeBits;

  /// An ElaboratedTypeKeyword.  8 bits for efficient access.
  unsigned Keyword : 8;
};

enum { NumTypeWithKeywordBits = 8 };

class ElaboratedTypeBitfields {
  friend class ElaboratedType;

  unsigned : NumTypeBits;
  unsigned : NumTypeWithKeywordBits;

  /// Whether the ElaboratedType has a trailing OwnedTagDecl.
  unsigned HasOwnedTagDecl : 1;
};

class VectorTypeBitfields {
  friend class VectorType;
  friend class DependentVectorType;

  unsigned : NumTypeBits;

  /// The kind of vector, either a generic vector type or some
  /// target-specific vector type such as for AltiVec or Neon.
  unsigned VecKind : 3;
  /// The number of elements in the vector.
  uint32_t NumElements;
};

class AttributedTypeBitfields {
  friend class AttributedType;

  unsigned : NumTypeBits;

  /// An AttributedType::Kind
  unsigned AttrKind : 32 - NumTypeBits;
};

class AutoTypeBitfields {
  friend class AutoType;

  unsigned : NumTypeBits;

  /// Was this placeholder type spelled as 'auto', 'decltype(auto)',
  /// or '__auto_type'?  AutoTypeKeyword value.
  unsigned Keyword : 2;

  /// The number of template arguments in the type-constraints, which is
  /// expected to be able to hold at least 1024 according to [implimits].
  /// However as this limit is somewhat easy to hit with template
  /// metaprogramming we'd prefer to keep it as large as possible.
  /// At the moment it has been left as a non-bitfield since this type
  /// safely fits in 64 bits as an unsigned, so there is no reason to
  /// introduce the performance impact of a bitfield.
  unsigned NumArgs;
};

class SubstTemplateTypeParmPackTypeBitfields {
  friend class SubstTemplateTypeParmPackType;

  unsigned : NumTypeBits;

  /// The number of template arguments in \c Arguments, which is
  /// expected to be able to hold at least 1024 according to [implimits].
  /// However as this limit is somewhat easy to hit with template
  /// metaprogramming we'd prefer to keep it as large as possible.
  /// At the moment it has been left as a non-bitfield since this type
  /// safely fits in 64 bits as an unsigned, so there is no reason to
  /// introduce the performance impact of a bitfield.
  unsigned NumArgs;
};

class TemplateSpecializationTypeBitfields {
  friend class TemplateSpecializationType;

  unsigned : NumTypeBits;

  /// Whether this template specialization type is a substituted type alias.
  unsigned TypeAlias : 1;

  /// The number of template arguments named in this class template
  /// specialization, which is expected to be able to hold at least 1024
  /// according to [implimits]. However, as this limit is somewhat easy to
  /// hit with template metaprogramming we'd prefer to keep it as large
  /// as possible. At the moment it has been left as a non-bitfield since
  /// this type safely fits in 64 bits as an unsigned, so there is no reason
  /// to introduce the performance impact of a bitfield.
  unsigned NumArgs;
};

class DependentTemplateSpecializationTypeBitfields {
  friend class DependentTemplateSpecializationType;

  unsigned : NumTypeBits;
  unsigned : NumTypeWithKeywordBits;

  /// The number of template arguments named in this class template
  /// specialization, which is expected to be able to hold at least 1024
  /// according to [implimits]. However, as this limit is somewhat easy to
  /// hit with template metaprogramming we'd prefer to keep it as large
  /// as possible. At the moment it has been left as a non-bitfield since
  /// this type safely fits in 64 bits as an unsigned, so there is no reason
  /// to introduce the performance impact of a bitfield.
  unsigned NumArgs;
};

class PackExpansionTypeBitfields {
  friend class PackExpansionType;

  unsigned : NumTypeBits;

  /// The number of expansions that this pack expansion will
  /// generate when substituted (+1), which is expected to be able to
  /// hold at least 1024 according to [implimits]. However, as this limit
  /// is somewhat easy to hit with template metaprogramming we'd prefer to
  /// keep it as large as possible. At the moment it has been left as a
  /// non-bitfield since this type safely fits in 64 bits as an unsigned, so
  /// there is no reason to introduce the performance impact of a bitfield.
  ///
  /// This field will only have a non-zero value when some of the parameter
  /// packs that occur within the pattern have been substituted but others
  /// have not.
  unsigned NumExpansions;
};

union {
  TypeBitfields TypeBits;
  ArrayTypeBitfields ArrayTypeBits;
  ConstantArrayTypeBitfields ConstantArrayTypeBits;
  AttributedTypeBitfields AttributedTypeBits;
  AutoTypeBitfields AutoTypeBits;
  BuiltinTypeBitfields BuiltinTypeBits;
  FunctionTypeBitfields FunctionTypeBits;
  ObjCObjectTypeBitfields ObjCObjectTypeBits;
  ReferenceTypeBitfields ReferenceTypeBits;
  TypeWithKeywordBitfields TypeWithKeywordBits;
  ElaboratedTypeBitfields ElaboratedTypeBits;
  VectorTypeBitfields VectorTypeBits;
  SubstTemplateTypeParmPackTypeBitfields SubstTemplateTypeParmPackTypeBits;
  TemplateSpecializationTypeBitfields TemplateSpecializationTypeBits;
  DependentTemplateSpecializationTypeBitfields
    DependentTemplateSpecializationTypeBits;
  PackExpansionTypeBitfields PackExpansionTypeBits;
};

1800private:
template <class T> friend class TypePropertyCache;

/// Set whether this type comes from an AST file.
void setFromAST(bool V = true) const {
  TypeBits.FromAST = V;
}

1808protected:
friend class ASTContext;

Type(TypeClass tc, QualType canon, TypeDependence Dependence)
    : ExtQualsTypeCommonBase(this,
                             canon.isNull() ? QualType(this_(), 0) : canon) {
  static_assert(sizeof(*this) <= 8 + sizeof(ExtQualsTypeCommonBase),
                "changing bitfields changed sizeof(Type)!");
  static_assert(alignof(decltype(*this)) % sizeof(void *) == 0,
                "Insufficient alignment!");
  TypeBits.TC = tc;
  TypeBits.Dependence = static_cast<unsigned>(Dependence);
  TypeBits.CacheValid = false;
  TypeBits.CachedLocalOrUnnamed = false;
  TypeBits.CachedLinkage = NoLinkage;
  TypeBits.FromAST = false;
}

// silence VC++ warning C4355: 'this' : used in base member initializer list
Type *this_() { return this; }

void setDependence(TypeDependence D) {
  TypeBits.Dependence = static_cast<unsigned>(D);
}

void addDependence(TypeDependence D) { setDependence(getDependence() | D); }

1835public:
friend class ASTReader;
friend class ASTWriter;
template <class T> friend class serialization::AbstractTypeReader;
template <class T> friend class serialization::AbstractTypeWriter;

Type(const Type &) = delete;
Type(Type &&) = delete;
Type &operator=(const Type &) = delete;
Type &operator=(Type &&) = delete;

TypeClass getTypeClass() const { return static_cast<TypeClass>(TypeBits.TC); }

/// Whether this type comes from an AST file.
bool isFromAST() const { return TypeBits.FromAST; }

/// Whether this type is or contains an unexpanded parameter
/// pack, used to support C++0x variadic templates.
///
/// A type that contains a parameter pack shall be expanded by the
/// ellipsis operator at some point. For example, the typedef in the
/// following example contains an unexpanded parameter pack 'T':
///
/// \code
/// template<typename ...T>
/// struct X {
///   typedef T* pointer_types; // ill-formed; T is a parameter pack.
/// };
/// \endcode
///
/// Note that this routine does not specify which
bool containsUnexpandedParameterPack() const {
  return getDependence() & TypeDependence::UnexpandedPack;
}

/// Determines if this type would be canonical if it had no further
/// qualification.
bool isCanonicalUnqualified() const {
  return CanonicalType == QualType(this, 0);
}

/// Pull a single level of sugar off of this locally-unqualified type.
/// Users should generally prefer SplitQualType::getSingleStepDesugaredType()
/// or QualType::getSingleStepDesugaredType(const ASTContext&).
QualType getLocallyUnqualifiedSingleStepDesugaredType() const;

/// As an extension, we classify types as one of "sized" or "sizeless";
/// every type is one or the other.  Standard types are all sized;
/// sizeless types are purely an extension.
///
/// Sizeless types contain data with no specified size, alignment,
/// or layout.
bool isSizelessType() const;
bool isSizelessBuiltinType() const;

/// Determines if this is a sizeless type supported by the
/// 'arm_sve_vector_bits' type attribute, which can be applied to a single
/// SVE vector or predicate, excluding tuple types such as svint32x4_t.
bool isVLSTBuiltinType() const;

/// Returns the representative type for the element of an SVE builtin type.
/// This is used to represent fixed-length SVE vectors created with the
/// 'arm_sve_vector_bits' type attribute as VectorType.
QualType getSveEltType(const ASTContext &Ctx) const;

/// Types are partitioned into 3 broad categories (C99 6.2.5p1):
/// object types, function types, and incomplete types.

/// Return true if this is an incomplete type.
/// A type that can describe objects, but which lacks information needed to
/// determine its size (e.g. void, or a fwd declared struct). Clients of this
/// routine will need to determine if the size is actually required.
///
/// Def If non-null, and the type refers to some kind of declaration
/// that can be completed (such as a C struct, C++ class, or Objective-C
/// class), will be set to the declaration.
bool isIncompleteType(NamedDecl **Def = nullptr) const;

/// Return true if this is an incomplete or object
/// type, in other words, not a function type.
bool isIncompleteOrObjectType() const {
  return !isFunctionType();
}

/// Determine whether this type is an object type.
bool isObjectType() const {
  // C++ [basic.types]p8:
  //   An object type is a (possibly cv-qualified) type that is not a
  //   function type, not a reference type, and not a void type.
  return !isReferenceType() && !isFunctionType() && !isVoidType();
}

/// Return true if this is a literal type
/// (C++11 [basic.types]p10)
bool isLiteralType(const ASTContext &Ctx) const;

/// Determine if this type is a structural type, per C++20 [temp.param]p7.
bool isStructuralType() const;

/// Test if this type is a standard-layout type.
/// (C++0x [basic.type]p9)
bool isStandardLayoutType() const;

/// Helper methods to distinguish type categories. All type predicates
/// operate on the canonical type, ignoring typedefs and qualifiers.

/// Returns true if the type is a builtin type.
bool isBuiltinType() const;

/// Test for a particular builtin type.
bool isSpecificBuiltinType(unsigned K) const;

/// Test for a type which does not represent an actual type-system type but
/// is instead used as a placeholder for various convenient purposes within
/// Clang.  All such types are BuiltinTypes.
bool isPlaceholderType() const;
const BuiltinType *getAsPlaceholderType() const;

/// Test for a specific placeholder type.
bool isSpecificPlaceholderType(unsigned K) const;

/// Test for a placeholder type other than Overload; see
/// BuiltinType::isNonOverloadPlaceholderType.
bool isNonOverloadPlaceholderType() const;

/// isIntegerType() does *not* include complex integers (a GCC extension).
/// isComplexIntegerType() can be used to test for complex integers.
bool isIntegerType() const;     // C99 6.2.5p17 (int, char, bool, enum)
bool isEnumeralType() const;

/// Determine whether this type is a scoped enumeration type.
bool isScopedEnumeralType() const;
bool isBooleanType() const;
bool isCharType() const;
bool isWideCharType() const;
bool isChar8Type() const;
bool isChar16Type() const;
bool isChar32Type() const;
bool isAnyCharacterType() const;
bool isIntegralType(const ASTContext &Ctx) const;

/// Determine whether this type is an integral or enumeration type.
bool isIntegralOrEnumerationType() const;

/// Determine whether this type is an integral or unscoped enumeration type.
bool isIntegralOrUnscopedEnumerationType() const;
bool isUnscopedEnumerationType() const;

/// Floating point categories.
bool isRealFloatingType() const; // C99 6.2.5p10 (float, double, long double)
/// isComplexType() does *not* include complex integers (a GCC extension).
/// isComplexIntegerType() can be used to test for complex integers.
bool isComplexType() const;      // C99 6.2.5p11 (complex)
bool isAnyComplexType() const;   // C99 6.2.5p11 (complex) + Complex Int.
bool isFloatingType() const;     // C99 6.2.5p11 (real floating + complex)
bool isHalfType() const;         // OpenCL 6.1.1.1, NEON (IEEE 754-2008 half)
bool isFloat16Type() const;      // C11 extension ISO/IEC TS 18661
bool isBFloat16Type() const;
bool isFloat128Type() const;
bool isRealType() const;         // C99 6.2.5p17 (real floating + integer)
bool isArithmeticType() const;   // C99 6.2.5p18 (integer + floating)
bool isVoidType() const;         // C99 6.2.5p19
bool isScalarType() const;       // C99 6.2.5p21 (arithmetic + pointers)
bool isAggregateType() const;
bool isFundamentalType() const;
bool isCompoundType() const;

// Type Predicates: Check to see if this type is structurally the specified
// type, ignoring typedefs and qualifiers.
bool isFunctionType() const;
bool isFunctionNoProtoType() const { return getAs<FunctionNoProtoType>(); }
bool isFunctionProtoType() const { return getAs<FunctionProtoType>(); }
bool isPointerType() const;
bool isAnyPointerType() const;   // Any C pointer or ObjC object pointer
bool isBlockPointerType() const;
bool isVoidPointerType() const;
bool isReferenceType() const;
bool isLValueReferenceType() const;
bool isRValueReferenceType() const;
bool isObjectPointerType() const;
bool isFunctionPointerType() const;
bool isFunctionReferenceType() const;
bool isMemberPointerType() const;
bool isMemberFunctionPointerType() const;
bool isMemberDataPointerType() const;
bool isArrayType() const;
bool isConstantArrayType() const;
bool isIncompleteArrayType() const;
bool isVariableArrayType() const;
bool isDependentSizedArrayType() const;
bool isRecordType() const;
bool isClassType() const;
bool isStructureType() const;
bool isObjCBoxableRecordType() const;
bool isInterfaceType() const;
bool isStructureOrClassType() const;
bool isUnionType() const;
bool isComplexIntegerType() const;            // GCC _Complex integer type.
bool isVectorType() const;                    // GCC vector type.
bool isExtVectorType() const;                 // Extended vector type.
bool isMatrixType() const;                    // Matrix type.
bool isConstantMatrixType() const;            // Constant matrix type.
bool isDependentAddressSpaceType() const;     // value-dependent address space qualifier
bool isObjCObjectPointerType() const;         // pointer to ObjC object
bool isObjCRetainableType() const;            // ObjC object or block pointer
bool isObjCLifetimeType() const;              // (array of)* retainable type
bool isObjCIndirectLifetimeType() const;      // (pointer to)* lifetime type
bool isObjCNSObjectType() const;              // __attribute__((NSObject))
bool isObjCIndependentClassType() const;      // __attribute__((objc_independent_class))
// FIXME: change this to 'raw' interface type, so we can used 'interface' type
// for the common case.
bool isObjCObjectType() const;                // NSString or typeof(*(id)0)
bool isObjCQualifiedInterfaceType() const;    // NSString<foo>
bool isObjCQualifiedIdType() const;           // id<foo>
bool isObjCQualifiedClassType() const;        // Class<foo>
bool isObjCObjectOrInterfaceType() const;
bool isObjCIdType() const;                    // id
bool isDecltypeType() const;
/// Was this type written with the special inert-in-ARC __unsafe_unretained
/// qualifier?
///
/// This approximates the answer to the following question: if this
/// translation unit were compiled in ARC, would this type be qualified
/// with __unsafe_unretained?
bool isObjCInertUnsafeUnretainedType() const {
  return hasAttr(attr::ObjCInertUnsafeUnretained);
}

/// Whether the type is Objective-C 'id' or a __kindof type of an
/// object type, e.g., __kindof NSView * or __kindof id
/// <NSCopying>.
///
/// \param bound Will be set to the bound on non-id subtype types,
/// which will be (possibly specialized) Objective-C class type, or
/// null for 'id.
bool isObjCIdOrObjectKindOfType(const ASTContext &ctx,
                                const ObjCObjectType *&bound) const;

bool isObjCClassType() const;                 // Class

/// Whether the type is Objective-C 'Class' or a __kindof type of an
/// Class type, e.g., __kindof Class <NSCopying>.
///
/// Unlike \c isObjCIdOrObjectKindOfType, there is no relevant bound
/// here because Objective-C's type system cannot express "a class
/// object for a subclass of NSFoo".
bool isObjCClassOrClassKindOfType() const;

bool isBlockCompatibleObjCPointerType(ASTContext &ctx) const;
bool isObjCSelType() const;                 // Class
bool isObjCBuiltinType() const;               // 'id' or 'Class'
bool isObjCARCBridgableType() const;
bool isCARCBridgableType() const;
bool isTemplateTypeParmType() const;          // C++ template type parameter
bool isNullPtrType() const;                   // C++11 std::nullptr_t
bool isNothrowT() const;                      // C++   std::nothrow_t
bool isAlignValT() const;                     // C++17 std::align_val_t
bool isStdByteType() const;                   // C++17 std::byte
bool isAtomicType() const;                    // C11 _Atomic()
bool isUndeducedAutoType() const;             // C++11 auto or
                                              // C++14 decltype(auto)
bool isTypedefNameType() const;               // typedef or alias template

2098#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) \
bool is##Id##Type() const;
2100#include "clang/Basic/OpenCLImageTypes.def"

bool isImageType() const;                     // Any OpenCL image type

bool isSamplerT() const;                      // OpenCL sampler_t
bool isEventT() const;                        // OpenCL event_t
bool isClkEventT() const;                     // OpenCL clk_event_t
bool isQueueT() const;                        // OpenCL queue_t
bool isReserveIDT() const;                    // OpenCL reserve_id_t

2110#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) \
bool is##Id##Type() const;
2112#include "clang/Basic/OpenCLExtensionTypes.def"
// Type defined in cl_intel_device_side_avc_motion_estimation OpenCL extension
bool isOCLIntelSubgroupAVCType() const;
bool isOCLExtOpaqueType() const;              // Any OpenCL extension type

bool isPipeType() const;                      // OpenCL pipe type
bool isExtIntType() const;                    // Extended Int Type
bool isOpenCLSpecificType() const;            // Any OpenCL specific type

/// Determines if this type, which must satisfy
/// isObjCLifetimeType(), is implicitly __unsafe_unretained rather
/// than implicitly __strong.
bool isObjCARCImplicitlyUnretainedType() const;

/// Check if the type is the CUDA device builtin surface type.
bool isCUDADeviceBuiltinSurfaceType() const;
/// Check if the type is the CUDA device builtin texture type.
bool isCUDADeviceBuiltinTextureType() const;

/// Return the implicit lifetime for this type, which must not be dependent.
Qualifiers::ObjCLifetime getObjCARCImplicitLifetime() const;

enum ScalarTypeKind {
  STK_CPointer,
  STK_BlockPointer,
  STK_ObjCObjectPointer,
  STK_MemberPointer,
  STK_Bool,
  STK_Integral,
  STK_Floating,
  STK_IntegralComplex,
  STK_FloatingComplex,
  STK_FixedPoint
};

/// Given that this is a scalar type, classify it.
ScalarTypeKind getScalarTypeKind() const;

TypeDependence getDependence() const {
  return static_cast<TypeDependence>(TypeBits.Dependence);
}

/// Whether this type is an error type.
bool containsErrors() const {
  return getDependence() & TypeDependence::Error;
}

/// Whether this type is a dependent type, meaning that its definition
/// somehow depends on a template parameter (C++ [temp.dep.type]).
bool isDependentType() const {
  return getDependence() & TypeDependence::Dependent;
}

/// Determine whether this type is an instantiation-dependent type,
/// meaning that the type involves a template parameter (even if the
/// definition does not actually depend on the type substituted for that
/// template parameter).
bool isInstantiationDependentType() const {
  return getDependence() & TypeDependence::Instantiation;
}

/// Determine whether this type is an undeduced type, meaning that
/// it somehow involves a C++11 'auto' type or similar which has not yet been
/// deduced.
bool isUndeducedType() const;

/// Whether this type is a variably-modified type (C99 6.7.5).
bool isVariablyModifiedType() const {
  return getDependence() & TypeDependence::VariablyModified;
}

/// Whether this type involves a variable-length array type
/// with a definite size.
bool hasSizedVLAType() const;

/// Whether this type is or contains a local or unnamed type.
bool hasUnnamedOrLocalType() const;

bool isOverloadableType() const;

/// Determine wither this type is a C++ elaborated-type-specifier.
bool isElaboratedTypeSpecifier() const;

bool canDecayToPointerType() const;

/// Whether this type is represented natively as a pointer.  This includes
/// pointers, references, block pointers, and Objective-C interface,
/// qualified id, and qualified interface types, as well as nullptr_t.
bool hasPointerRepresentation() const;

/// Whether this type can represent an objective pointer type for the
/// purpose of GC'ability
bool hasObjCPointerRepresentation() const;

/// Determine whether this type has an integer representation
/// of some sort, e.g., it is an integer type or a vector.
bool hasIntegerRepresentation() const;

/// Determine whether this type has an signed integer representation
/// of some sort, e.g., it is an signed integer type or a vector.
bool hasSignedIntegerRepresentation() const;

/// Determine whether this type has an unsigned integer representation
/// of some sort, e.g., it is an unsigned integer type or a vector.
bool hasUnsignedIntegerRepresentation() const;

/// Determine whether this type has a floating-point representation
/// of some sort, e.g., it is a floating-point type or a vector thereof.
bool hasFloatingRepresentation() const;

// Type Checking Functions: Check to see if this type is structurally the
// specified type, ignoring typedefs and qualifiers, and return a pointer to
// the best type we can.
const RecordType *getAsStructureType() const;
/// NOTE: getAs*ArrayType are methods on ASTContext.
const RecordType *getAsUnionType() const;
const ComplexType *getAsComplexIntegerType() const; // GCC complex int type.
const ObjCObjectType *getAsObjCInterfaceType() const;

// The following is a convenience method that returns an ObjCObjectPointerType
// for object declared using an interface.
const ObjCObjectPointerType *getAsObjCInterfacePointerType() const;
const ObjCObjectPointerType *getAsObjCQualifiedIdType() const;
const ObjCObjectPointerType *getAsObjCQualifiedClassType() const;
const ObjCObjectType *getAsObjCQualifiedInterfaceType() const;

/// Retrieves the CXXRecordDecl that this type refers to, either
/// because the type is a RecordType or because it is the injected-class-name
/// type of a class template or class template partial specialization.
CXXRecordDecl *getAsCXXRecordDecl() const;

/// Retrieves the RecordDecl this type refers to.
RecordDecl *getAsRecordDecl() const;

/// Retrieves the TagDecl that this type refers to, either
/// because the type is a TagType or because it is the injected-class-name
/// type of a class template or class template partial specialization.
TagDecl *getAsTagDecl() const;

/// If this is a pointer or reference to a RecordType, return the
/// CXXRecordDecl that the type refers to.
///
/// If this is not a pointer or reference, or the type being pointed to does
/// not refer to a CXXRecordDecl, returns NULL.
const CXXRecordDecl *getPointeeCXXRecordDecl() const;

/// Get the DeducedType whose type will be deduced for a variable with
/// an initializer of this type. This looks through declarators like pointer
/// types, but not through decltype or typedefs.
DeducedType *getContainedDeducedType() const;

/// Get the AutoType whose type will be deduced for a variable with
/// an initializer of this type. This looks through declarators like pointer
/// types, but not through decltype or typedefs.
AutoType *getContainedAutoType() const {
  return dyn_cast_or_null<AutoType>(getContainedDeducedType());
}

/// Determine whether this type was written with a leading 'auto'
/// corresponding to a trailing return type (possibly for a nested
/// function type within a pointer to function type or similar).
bool hasAutoForTrailingReturnType() const;

/// Member-template getAs<specific type>'.  Look through sugar for
/// an instance of \<specific type>.   This scheme will eventually
/// replace the specific getAsXXXX methods above.
///
/// There are some specializations of this member template listed
/// immediately following this class.
template <typename T> const T *getAs() const;

/// Member-template getAsAdjusted<specific type>. Look through specific kinds
/// of sugar (parens, attributes, etc) for an instance of \<specific type>.
/// This is used when you need to walk over sugar nodes that represent some
/// kind of type adjustment from a type that was written as a \<specific type>
/// to another type that is still canonically a \<specific type>.
template <typename T> const T *getAsAdjusted() const;

/// A variant of getAs<> for array types which silently discards
/// qualifiers from the outermost type.
const ArrayType *getAsArrayTypeUnsafe() const;

/// Member-template castAs<specific type>.  Look through sugar for
/// the underlying instance of \<specific type>.
///
/// This method has the same relationship to getAs<T> as cast<T> has
/// to dyn_cast<T>; which is to say, the underlying type *must*
/// have the intended type, and this method will never return null.
template <typename T> const T *castAs() const;

/// A variant of castAs<> for array type which silently discards
/// qualifiers from the outermost type.
const ArrayType *castAsArrayTypeUnsafe() const;

/// Determine whether this type had the specified attribute applied to it
/// (looking through top-level type sugar).
bool hasAttr(attr::Kind AK) const;

/// Get the base element type of this type, potentially discarding type
/// qualifiers.  This should never be used when type qualifiers
/// are meaningful.
const Type *getBaseElementTypeUnsafe() const;

/// If this is an array type, return the element type of the array,
/// potentially with type qualifiers missing.
/// This should never be used when type qualifiers are meaningful.
const Type *getArrayElementTypeNoTypeQual() const;

/// If this is a pointer type, return the pointee type.
/// If this is an array type, return the array element type.
/// This should never be used when type qualifiers are meaningful.
const Type *getPointeeOrArrayElementType() const;

/// If this is a pointer, ObjC object pointer, or block
/// pointer, this returns the respective pointee.
QualType getPointeeType() const;

/// Return the specified type with any "sugar" removed from the type,
/// removing any typedefs, typeofs, etc., as well as any qualifiers.
const Type *getUnqualifiedDesugaredType() const;

/// More type predicates useful for type checking/promotion
bool isPromotableIntegerType() const; // C99 6.3.1.1p2

/// Return true if this is an integer type that is
/// signed, according to C99 6.2.5p4 [char, signed char, short, int, long..],
/// or an enum decl which has a signed representation.
bool isSignedIntegerType() const;

/// Return true if this is an integer type that is
/// unsigned, according to C99 6.2.5p6 [which returns true for _Bool],
/// or an enum decl which has an unsigned representation.
bool isUnsignedIntegerType() const;

/// Determines whether this is an integer type that is signed or an
/// enumeration types whose underlying type is a signed integer type.
bool isSignedIntegerOrEnumerationType() const;

/// Determines whether this is an integer type that is unsigned or an
/// enumeration types whose underlying type is a unsigned integer type.
bool isUnsignedIntegerOrEnumerationType() const;

/// Return true if this is a fixed point type according to
/// ISO/IEC JTC1 SC22 WG14 N1169.
bool isFixedPointType() const;

/// Return true if this is a fixed point or integer type.
bool isFixedPointOrIntegerType() const;

/// Return true if this is a saturated fixed point type according to
/// ISO/IEC JTC1 SC22 WG14 N1169. This type can be signed or unsigned.
bool isSaturatedFixedPointType() const;

/// Return true if this is a saturated fixed point type according to
/// ISO/IEC JTC1 SC22 WG14 N1169. This type can be signed or unsigned.
bool isUnsaturatedFixedPointType() const;

/// Return true if this is a fixed point type that is signed according
/// to ISO/IEC JTC1 SC22 WG14 N1169. This type can also be saturated.
bool isSignedFixedPointType() const;

/// Return true if this is a fixed point type that is unsigned according
/// to ISO/IEC JTC1 SC22 WG14 N1169. This type can also be saturated.
bool isUnsignedFixedPointType() const;

/// Return true if this is not a variable sized type,
/// according to the rules of C99 6.7.5p3.  It is not legal to call this on
/// incomplete types.
bool isConstantSizeType() const;

/// Returns true if this type can be represented by some
/// set of type specifiers.
bool isSpecifierType() const;

/// Determine the linkage of this type.
Linkage getLinkage() const;

/// Determine the visibility of this type.
Visibility getVisibility() const {
  return getLinkageAndVisibility().getVisibility();
}

/// Return true if the visibility was explicitly set is the code.
bool isVisibilityExplicit() const {
  return getLinkageAndVisibility().isVisibilityExplicit();
}

/// Determine the linkage and visibility of this type.
LinkageInfo getLinkageAndVisibility() const;

/// True if the computed linkage is valid. Used for consistency
/// checking. Should always return true.
bool isLinkageValid() const;

/// Determine the nullability of the given type.
///
/// Note that nullability is only captured as sugar within the type
/// system, not as part of the canonical type, so nullability will
/// be lost by canonicalization and desugaring.
Optional<NullabilityKind> getNullability(const ASTContext &context) const;

/// Determine whether the given type can have a nullability
/// specifier applied to it, i.e., if it is any kind of pointer type.
///
/// \param ResultIfUnknown The value to return if we don't yet know whether
///        this type can have nullability because it is dependent.
bool canHaveNullability(bool ResultIfUnknown = true) const;

/// Retrieve the set of substitutions required when accessing a member
/// of the Objective-C receiver type that is declared in the given context.
///
/// \c *this is the type of the object we're operating on, e.g., the
/// receiver for a message send or the base of a property access, and is
/// expected to be of some object or object pointer type.
///
/// \param dc The declaration context for which we are building up a
/// substitution mapping, which should be an Objective-C class, extension,
/// category, or method within.
///
/// \returns an array of type arguments that can be substituted for
/// the type parameters of the given declaration context in any type described
/// within that context, or an empty optional to indicate that no
/// substitution is required.
Optional<ArrayRef<QualType>>
getObjCSubstitutions(const DeclContext *dc) const;

/// Determines if this is an ObjC interface type that may accept type
/// parameters.
bool acceptsObjCTypeParams() const;

const char *getTypeClassName() const;

QualType getCanonicalTypeInternal() const {
  return CanonicalType;
}

CanQualType getCanonicalTypeUnqualified() const; // in CanonicalType.h
void dump() const;
void dump(llvm::raw_ostream &OS, const ASTContext &Context) const;
2451};

2453/// This will check for a TypedefType by removing any existing sugar
2454/// until it reaches a TypedefType or a non-sugared type.
2455template <> const TypedefType *Type::getAs() const;

2457/// This will check for a TemplateSpecializationType by removing any
2458/// existing sugar until it reaches a TemplateSpecializationType or a
2459/// non-sugared type.
2460template <> const TemplateSpecializationType *Type::getAs() const;

2462/// This will check for an AttributedType by removing any existing sugar
2463/// until it reaches an AttributedType or a non-sugared type.
2464template <> const AttributedType *Type::getAs() const;

2466// We can do canonical leaf types faster, because we don't have to
2467// worry about preserving child type decoration.
2468#define TYPE(Class, Base)
2469#define LEAF_TYPE(Class) \
2470template <> inline const Class##Type *Type::getAs() const { \
return dyn_cast<Class##Type>(CanonicalType); \
2472} \
2473template <> inline const Class##Type *Type::castAs() const { \
return cast<Class##Type>(CanonicalType); \
2475}
2476#include "clang/AST/TypeNodes.inc"

2478/// This class is used for builtin types like 'int'.  Builtin
2479/// types are always canonical and have a literal name field.
2480class BuiltinType : public Type {
2481public:
enum Kind {
2483// OpenCL image types
2484#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) Id,
2485#include "clang/Basic/OpenCLImageTypes.def"
2486// OpenCL extension types
2487#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) Id,
2488#include "clang/Basic/OpenCLExtensionTypes.def"
2489// SVE Types
2490#define SVE_TYPE(Name, Id, SingletonId) Id,
2491#include "clang/Basic/AArch64SVEACLETypes.def"
2492// PPC MMA Types
2493#define PPC_VECTOR_TYPE(Name, Id, Size) Id,
2494#include "clang/Basic/PPCTypes.def"
2495// RVV Types
2496#define RVV_TYPE(Name, Id, SingletonId) Id,
2497#include "clang/Basic/RISCVVTypes.def"
2498// All other builtin types
2499#define BUILTIN_TYPE(Id, SingletonId) Id,
2500#define LAST_BUILTIN_TYPE(Id) LastKind = Id
2501#include "clang/AST/BuiltinTypes.def"
};

2504private:
friend class ASTContext; // ASTContext creates these.

BuiltinType(Kind K)
    : Type(Builtin, QualType(),
           K == Dependent ? TypeDependence::DependentInstantiation
                          : TypeDependence::None) {
  BuiltinTypeBits.Kind = K;
}

2514public:
Kind getKind() const { return static_cast<Kind>(BuiltinTypeBits.Kind); }
StringRef getName(const PrintingPolicy &Policy) const;

const char *getNameAsCString(const PrintingPolicy &Policy) const {
  // The StringRef is null-terminated.
  StringRef str = getName(Policy);
  assert(!str.empty() && str.data()[str.size()] == '\0')((!str.empty() && str.data()[str.size()] == '\0') ? static_cast
<void> (0) : __assert_fail ("!str.empty() && str.data()[str.size()] == '\\0'"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 2521, __PRETTY_FUNCTION__));
  return str.data();
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

bool isInteger() const {
  return getKind() >= Bool && getKind() <= Int128;
}

bool isSignedInteger() const {
  return getKind() >= Char_S && getKind() <= Int128;
}

bool isUnsignedInteger() const {
  return getKind() >= Bool && getKind() <= UInt128;
}

bool isFloatingPoint() const {
  return getKind() >= Half && getKind() <= Float128;
}

/// Determines whether the given kind corresponds to a placeholder type.
static bool isPlaceholderTypeKind(Kind K) {
  return K >= Overload;
}

/// Determines whether this type is a placeholder type, i.e. a type
/// which cannot appear in arbitrary positions in a fully-formed
/// expression.
bool isPlaceholderType() const {
  return isPlaceholderTypeKind(getKind());
}

/// Determines whether this type is a placeholder type other than
/// Overload.  Most placeholder types require only syntactic
/// information about their context in order to be resolved (e.g.
/// whether it is a call expression), which means they can (and
/// should) be resolved in an earlier "phase" of analysis.
/// Overload expressions sometimes pick up further information
/// from their context, like whether the context expects a
/// specific function-pointer type, and so frequently need
/// special treatment.
bool isNonOverloadPlaceholderType() const {
  return getKind() > Overload;
}

static bool classof(const Type *T) { return T->getTypeClass() == Builtin; }
2570};

2572/// Complex values, per C99 6.2.5p11.  This supports the C99 complex
2573/// types (_Complex float etc) as well as the GCC integer complex extensions.
2574class ComplexType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

QualType ElementType;

ComplexType(QualType Element, QualType CanonicalPtr)
    : Type(Complex, CanonicalPtr, Element->getDependence()),
      ElementType(Element) {}

2583public:
QualType getElementType() const { return ElementType; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getElementType());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType Element) {
  ID.AddPointer(Element.getAsOpaquePtr());
}

static bool classof(const Type *T) { return T->getTypeClass() == Complex; }
2598};

2600/// Sugar for parentheses used when specifying types.
2601class ParenType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

QualType Inner;

ParenType(QualType InnerType, QualType CanonType)
    : Type(Paren, CanonType, InnerType->getDependence()), Inner(InnerType) {}

2609public:
QualType getInnerType() const { return Inner; }

bool isSugared() const { return true; }
QualType desugar() const { return getInnerType(); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getInnerType());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType Inner) {
  Inner.Profile(ID);
}

static bool classof(const Type *T) { return T->getTypeClass() == Paren; }
2624};

2626/// PointerType - C99 6.7.5.1 - Pointer Declarators.
2627class PointerType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

QualType PointeeType;

PointerType(QualType Pointee, QualType CanonicalPtr)
    : Type(Pointer, CanonicalPtr, Pointee->getDependence()),
      PointeeType(Pointee) {}

2636public:
QualType getPointeeType() const { return PointeeType; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getPointeeType());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType Pointee) {
  ID.AddPointer(Pointee.getAsOpaquePtr());
}

static bool classof(const Type *T) { return T->getTypeClass() == Pointer; }
2651};

2653/// Represents a type which was implicitly adjusted by the semantic
2654/// engine for arbitrary reasons.  For example, array and function types can
2655/// decay, and function types can have their calling conventions adjusted.
2656class AdjustedType : public Type, public llvm::FoldingSetNode {
QualType OriginalTy;
QualType AdjustedTy;

2660protected:
friend class ASTContext; // ASTContext creates these.

AdjustedType(TypeClass TC, QualType OriginalTy, QualType AdjustedTy,
             QualType CanonicalPtr)
    : Type(TC, CanonicalPtr, OriginalTy->getDependence()),
      OriginalTy(OriginalTy), AdjustedTy(AdjustedTy) {}

2668public:
QualType getOriginalType() const { return OriginalTy; }
QualType getAdjustedType() const { return AdjustedTy; }

bool isSugared() const { return true; }
QualType desugar() const { return AdjustedTy; }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, OriginalTy, AdjustedTy);
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType Orig, QualType New) {
  ID.AddPointer(Orig.getAsOpaquePtr());
  ID.AddPointer(New.getAsOpaquePtr());
}

static bool classof(const Type *T) {
  return T->getTypeClass() == Adjusted || T->getTypeClass() == Decayed;
}
2687};

2689/// Represents a pointer type decayed from an array or function type.
2690class DecayedType : public AdjustedType {
friend class ASTContext; // ASTContext creates these.

inline
DecayedType(QualType OriginalType, QualType Decayed, QualType Canonical);

2696public:
QualType getDecayedType() const { return getAdjustedType(); }

inline QualType getPointeeType() const;

static bool classof(const Type *T) { return T->getTypeClass() == Decayed; }
2702};

2704/// Pointer to a block type.
2705/// This type is to represent types syntactically represented as
2706/// "void (^)(int)", etc. Pointee is required to always be a function type.
2707class BlockPointerType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

// Block is some kind of pointer type
QualType PointeeType;

BlockPointerType(QualType Pointee, QualType CanonicalCls)
    : Type(BlockPointer, CanonicalCls, Pointee->getDependence()),
      PointeeType(Pointee) {}

2717public:
// Get the pointee type. Pointee is required to always be a function type.
QualType getPointeeType() const { return PointeeType; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
    Profile(ID, getPointeeType());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType Pointee) {
    ID.AddPointer(Pointee.getAsOpaquePtr());
}

static bool classof(const Type *T) {
  return T->getTypeClass() == BlockPointer;
}
2735};

2737/// Base for LValueReferenceType and RValueReferenceType
2738class ReferenceType : public Type, public llvm::FoldingSetNode {
QualType PointeeType;

2741protected:
ReferenceType(TypeClass tc, QualType Referencee, QualType CanonicalRef,
              bool SpelledAsLValue)
    : Type(tc, CanonicalRef, Referencee->getDependence()),
      PointeeType(Referencee) {
  ReferenceTypeBits.SpelledAsLValue = SpelledAsLValue;
  ReferenceTypeBits.InnerRef = Referencee->isReferenceType();
}

2750public:
bool isSpelledAsLValue() const { return ReferenceTypeBits.SpelledAsLValue; }
bool isInnerRef() const { return ReferenceTypeBits.InnerRef; }

QualType getPointeeTypeAsWritten() const { return PointeeType; }

QualType getPointeeType() const {
  // FIXME: this might strip inner qualifiers; okay?
  const ReferenceType *T = this;
  while (T->isInnerRef())
    T = T->PointeeType->castAs<ReferenceType>();
  return T->PointeeType;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, PointeeType, isSpelledAsLValue());
}

static void Profile(llvm::FoldingSetNodeID &ID,
                    QualType Referencee,
                    bool SpelledAsLValue) {
  ID.AddPointer(Referencee.getAsOpaquePtr());
  ID.AddBoolean(SpelledAsLValue);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == LValueReference ||
         T->getTypeClass() == RValueReference;
}
2779};

2781/// An lvalue reference type, per C++11 [dcl.ref].
2782class LValueReferenceType : public ReferenceType {
friend class ASTContext; // ASTContext creates these

LValueReferenceType(QualType Referencee, QualType CanonicalRef,
                    bool SpelledAsLValue)
    : ReferenceType(LValueReference, Referencee, CanonicalRef,
                    SpelledAsLValue) {}

2790public:
bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == LValueReference;
}
2797};

2799/// An rvalue reference type, per C++11 [dcl.ref].
2800class RValueReferenceType : public ReferenceType {
friend class ASTContext; // ASTContext creates these

RValueReferenceType(QualType Referencee, QualType CanonicalRef)
     : ReferenceType(RValueReference, Referencee, CanonicalRef, false) {}

2806public:
bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == RValueReference;
}
2813};

2815/// A pointer to member type per C++ 8.3.3 - Pointers to members.
2816///
2817/// This includes both pointers to data members and pointer to member functions.
2818class MemberPointerType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

QualType PointeeType;

/// The class of which the pointee is a member. Must ultimately be a
/// RecordType, but could be a typedef or a template parameter too.
const Type *Class;

MemberPointerType(QualType Pointee, const Type *Cls, QualType CanonicalPtr)
    : Type(MemberPointer, CanonicalPtr,
           (Cls->getDependence() & ~TypeDependence::VariablyModified) |
               Pointee->getDependence()),
      PointeeType(Pointee), Class(Cls) {}

2833public:
QualType getPointeeType() const { return PointeeType; }

/// Returns true if the member type (i.e. the pointee type) is a
/// function type rather than a data-member type.
bool isMemberFunctionPointer() const {
  return PointeeType->isFunctionProtoType();
}

/// Returns true if the member type (i.e. the pointee type) is a
/// data type rather than a function type.
bool isMemberDataPointer() const {
  return !PointeeType->isFunctionProtoType();
}

const Type *getClass() const { return Class; }
CXXRecordDecl *getMostRecentCXXRecordDecl() const;

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getPointeeType(), getClass());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType Pointee,
                    const Type *Class) {
  ID.AddPointer(Pointee.getAsOpaquePtr());
  ID.AddPointer(Class);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == MemberPointer;
}
2867};

2869/// Represents an array type, per C99 6.7.5.2 - Array Declarators.
2870class ArrayType : public Type, public llvm::FoldingSetNode {
2871public:
/// Capture whether this is a normal array (e.g. int X[4])
/// an array with a static size (e.g. int X[static 4]), or an array
/// with a star size (e.g. int X[*]).
/// 'static' is only allowed on function parameters.
enum ArraySizeModifier {
  Normal, Static, Star
};

2880private:
/// The element type of the array.
QualType ElementType;

2884protected:
friend class ASTContext; // ASTContext creates these.

ArrayType(TypeClass tc, QualType et, QualType can, ArraySizeModifier sm,
          unsigned tq, const Expr *sz = nullptr);

2890public:
QualType getElementType() const { return ElementType; }

ArraySizeModifier getSizeModifier() const {
  return ArraySizeModifier(ArrayTypeBits.SizeModifier);
}

Qualifiers getIndexTypeQualifiers() const {
  return Qualifiers::fromCVRMask(getIndexTypeCVRQualifiers());
}

unsigned getIndexTypeCVRQualifiers() const {
  return ArrayTypeBits.IndexTypeQuals;
}

static bool classof(const Type *T) {
  return T->getTypeClass() == ConstantArray ||
         T->getTypeClass() == VariableArray ||
         T->getTypeClass() == IncompleteArray ||
         T->getTypeClass() == DependentSizedArray;
}
2911};

2913/// Represents the canonical version of C arrays with a specified constant size.
2914/// For example, the canonical type for 'int A[4 + 4*100]' is a
2915/// ConstantArrayType where the element type is 'int' and the size is 404.
2916class ConstantArrayType final
  : public ArrayType,
    private llvm::TrailingObjects<ConstantArrayType, const Expr *> {
friend class ASTContext; // ASTContext creates these.
friend TrailingObjects;

llvm::APInt Size; // Allows us to unique the type.

ConstantArrayType(QualType et, QualType can, const llvm::APInt &size,
                  const Expr *sz, ArraySizeModifier sm, unsigned tq)
    : ArrayType(ConstantArray, et, can, sm, tq, sz), Size(size) {
  ConstantArrayTypeBits.HasStoredSizeExpr = sz != nullptr;
  if (ConstantArrayTypeBits.HasStoredSizeExpr) {
    assert(!can.isNull() && "canonical constant array should not have size")((!can.isNull() && "canonical constant array should not have size"
) ? static_cast<void> (0) : __assert_fail ("!can.isNull() && \"canonical constant array should not have size\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 2929, __PRETTY_FUNCTION__));
    *getTrailingObjects<const Expr*>() = sz;
  }
}

unsigned numTrailingObjects(OverloadToken<const Expr*>) const {
  return ConstantArrayTypeBits.HasStoredSizeExpr;
}

2938public:
const llvm::APInt &getSize() const { return Size; }
const Expr *getSizeExpr() const {
  return ConstantArrayTypeBits.HasStoredSizeExpr
             ? *getTrailingObjects<const Expr *>()
             : nullptr;
}
bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

/// Determine the number of bits required to address a member of
// an array with the given element type and number of elements.
static unsigned getNumAddressingBits(const ASTContext &Context,
                                     QualType ElementType,
                                     const llvm::APInt &NumElements);

/// Determine the maximum number of active bits that an array's size
/// can require, which limits the maximum size of the array.
static unsigned getMaxSizeBits(const ASTContext &Context);

void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Ctx) {
  Profile(ID, Ctx, getElementType(), getSize(), getSizeExpr(),
          getSizeModifier(), getIndexTypeCVRQualifiers());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Ctx,
                    QualType ET, const llvm::APInt &ArraySize,
                    const Expr *SizeExpr, ArraySizeModifier SizeMod,
                    unsigned TypeQuals);

static bool classof(const Type *T) {
  return T->getTypeClass() == ConstantArray;
}
2971};

2973/// Represents a C array with an unspecified size.  For example 'int A[]' has
2974/// an IncompleteArrayType where the element type is 'int' and the size is
2975/// unspecified.
2976class IncompleteArrayType : public ArrayType {
friend class ASTContext; // ASTContext creates these.

IncompleteArrayType(QualType et, QualType can,
                    ArraySizeModifier sm, unsigned tq)
    : ArrayType(IncompleteArray, et, can, sm, tq) {}

2983public:
friend class StmtIteratorBase;

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == IncompleteArray;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getElementType(), getSizeModifier(),
          getIndexTypeCVRQualifiers());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType ET,
                    ArraySizeModifier SizeMod, unsigned TypeQuals) {
  ID.AddPointer(ET.getAsOpaquePtr());
  ID.AddInteger(SizeMod);
  ID.AddInteger(TypeQuals);
}
3004};

3006/// Represents a C array with a specified size that is not an
3007/// integer-constant-expression.  For example, 'int s[x+foo()]'.
3008/// Since the size expression is an arbitrary expression, we store it as such.
3009///
3010/// Note: VariableArrayType's aren't uniqued (since the expressions aren't) and
3011/// should not be: two lexically equivalent variable array types could mean
3012/// different things, for example, these variables do not have the same type
3013/// dynamically:
3014///
3015/// void foo(int x) {
3016///   int Y[x];
3017///   ++x;
3018///   int Z[x];
3019/// }
3020class VariableArrayType : public ArrayType {
friend class ASTContext; // ASTContext creates these.

/// An assignment-expression. VLA's are only permitted within
/// a function block.
Stmt *SizeExpr;

/// The range spanned by the left and right array brackets.
SourceRange Brackets;

VariableArrayType(QualType et, QualType can, Expr *e,
                  ArraySizeModifier sm, unsigned tq,
                  SourceRange brackets)
    : ArrayType(VariableArray, et, can, sm, tq, e),
      SizeExpr((Stmt*) e), Brackets(brackets) {}

3036public:
friend class StmtIteratorBase;

Expr *getSizeExpr() const {
  // We use C-style casts instead of cast<> here because we do not wish
  // to have a dependency of Type.h on Stmt.h/Expr.h.
  return (Expr*) SizeExpr;
}

SourceRange getBracketsRange() const { return Brackets; }
SourceLocation getLBracketLoc() const { return Brackets.getBegin(); }
SourceLocation getRBracketLoc() const { return Brackets.getEnd(); }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == VariableArray;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  llvm_unreachable("Cannot unique VariableArrayTypes.")::llvm::llvm_unreachable_internal("Cannot unique VariableArrayTypes."
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 3057);
}
3059};

3061/// Represents an array type in C++ whose size is a value-dependent expression.
3062///
3063/// For example:
3064/// \code
3065/// template<typename T, int Size>
3066/// class array {
3067///   T data[Size];
3068/// };
3069/// \endcode
3070///
3071/// For these types, we won't actually know what the array bound is
3072/// until template instantiation occurs, at which point this will
3073/// become either a ConstantArrayType or a VariableArrayType.
3074class DependentSizedArrayType : public ArrayType {
friend class ASTContext; // ASTContext creates these.

const ASTContext &Context;

/// An assignment expression that will instantiate to the
/// size of the array.
///
/// The expression itself might be null, in which case the array
/// type will have its size deduced from an initializer.
Stmt *SizeExpr;

/// The range spanned by the left and right array brackets.
SourceRange Brackets;

DependentSizedArrayType(const ASTContext &Context, QualType et, QualType can,
                        Expr *e, ArraySizeModifier sm, unsigned tq,
                        SourceRange brackets);

3093public:
friend class StmtIteratorBase;

Expr *getSizeExpr() const {
  // We use C-style casts instead of cast<> here because we do not wish
  // to have a dependency of Type.h on Stmt.h/Expr.h.
  return (Expr*) SizeExpr;
}

SourceRange getBracketsRange() const { return Brackets; }
SourceLocation getLBracketLoc() const { return Brackets.getBegin(); }
SourceLocation getRBracketLoc() const { return Brackets.getEnd(); }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentSizedArray;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, getElementType(),
          getSizeModifier(), getIndexTypeCVRQualifiers(), getSizeExpr());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    QualType ET, ArraySizeModifier SizeMod,
                    unsigned TypeQuals, Expr *E);
3121};

3123/// Represents an extended address space qualifier where the input address space
3124/// value is dependent. Non-dependent address spaces are not represented with a
3125/// special Type subclass; they are stored on an ExtQuals node as part of a QualType.
3126///
3127/// For example:
3128/// \code
3129/// template<typename T, int AddrSpace>
3130/// class AddressSpace {
3131///   typedef T __attribute__((address_space(AddrSpace))) type;
3132/// }
3133/// \endcode
3134class DependentAddressSpaceType : public Type, public llvm::FoldingSetNode {
friend class ASTContext;

const ASTContext &Context;
Expr *AddrSpaceExpr;
QualType PointeeType;
SourceLocation loc;

DependentAddressSpaceType(const ASTContext &Context, QualType PointeeType,
                          QualType can, Expr *AddrSpaceExpr,
                          SourceLocation loc);

3146public:
Expr *getAddrSpaceExpr() const { return AddrSpaceExpr; }
QualType getPointeeType() const { return PointeeType; }
SourceLocation getAttributeLoc() const { return loc; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentAddressSpace;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, getPointeeType(), getAddrSpaceExpr());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    QualType PointeeType, Expr *AddrSpaceExpr);
3164};

3166/// Represents an extended vector type where either the type or size is
3167/// dependent.
3168///
3169/// For example:
3170/// \code
3171/// template<typename T, int Size>
3172/// class vector {
3173///   typedef T __attribute__((ext_vector_type(Size))) type;
3174/// }
3175/// \endcode
3176class DependentSizedExtVectorType : public Type, public llvm::FoldingSetNode {
friend class ASTContext;

const ASTContext &Context;
Expr *SizeExpr;

/// The element type of the array.
QualType ElementType;

SourceLocation loc;

DependentSizedExtVectorType(const ASTContext &Context, QualType ElementType,
                            QualType can, Expr *SizeExpr, SourceLocation loc);

3190public:
Expr *getSizeExpr() const { return SizeExpr; }
QualType getElementType() const { return ElementType; }
SourceLocation getAttributeLoc() const { return loc; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentSizedExtVector;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, getElementType(), getSizeExpr());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    QualType ElementType, Expr *SizeExpr);
3208};


3211/// Represents a GCC generic vector type. This type is created using
3212/// __attribute__((vector_size(n)), where "n" specifies the vector size in
3213/// bytes; or from an Altivec __vector or vector declaration.
3214/// Since the constructor takes the number of vector elements, the
3215/// client is responsible for converting the size into the number of elements.
3216class VectorType : public Type, public llvm::FoldingSetNode {
3217public:
enum VectorKind {
  /// not a target-specific vector type
  GenericVector,

  /// is AltiVec vector
  AltiVecVector,

  /// is AltiVec 'vector Pixel'
  AltiVecPixel,

  /// is AltiVec 'vector bool ...'
  AltiVecBool,

  /// is ARM Neon vector
  NeonVector,

  /// is ARM Neon polynomial vector
  NeonPolyVector,

  /// is AArch64 SVE fixed-length data vector
  SveFixedLengthDataVector,

  /// is AArch64 SVE fixed-length predicate vector
  SveFixedLengthPredicateVector
};

3244protected:
friend class ASTContext; // ASTContext creates these.

/// The element type of the vector.
QualType ElementType;

VectorType(QualType vecType, unsigned nElements, QualType canonType,
           VectorKind vecKind);

VectorType(TypeClass tc, QualType vecType, unsigned nElements,
           QualType canonType, VectorKind vecKind);

3256public:
QualType getElementType() const { return ElementType; }
unsigned getNumElements() const { return VectorTypeBits.NumElements; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

VectorKind getVectorKind() const {
  return VectorKind(VectorTypeBits.VecKind);
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getElementType(), getNumElements(),
          getTypeClass(), getVectorKind());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType ElementType,
                    unsigned NumElements, TypeClass TypeClass,
                    VectorKind VecKind) {
  ID.AddPointer(ElementType.getAsOpaquePtr());
  ID.AddInteger(NumElements);
  ID.AddInteger(TypeClass);
  ID.AddInteger(VecKind);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == Vector || T->getTypeClass() == ExtVector;
}
3284};

3286/// Represents a vector type where either the type or size is dependent.
3287////
3288/// For example:
3289/// \code
3290/// template<typename T, int Size>
3291/// class vector {
3292///   typedef T __attribute__((vector_size(Size))) type;
3293/// }
3294/// \endcode
3295class DependentVectorType : public Type, public llvm::FoldingSetNode {
friend class ASTContext;

const ASTContext &Context;
QualType ElementType;
Expr *SizeExpr;
SourceLocation Loc;

DependentVectorType(const ASTContext &Context, QualType ElementType,
                         QualType CanonType, Expr *SizeExpr,
                         SourceLocation Loc, VectorType::VectorKind vecKind);

3307public:
Expr *getSizeExpr() const { return SizeExpr; }
QualType getElementType() const { return ElementType; }
SourceLocation getAttributeLoc() const { return Loc; }
VectorType::VectorKind getVectorKind() const {
  return VectorType::VectorKind(VectorTypeBits.VecKind);
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentVector;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, getElementType(), getSizeExpr(), getVectorKind());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    QualType ElementType, const Expr *SizeExpr,
                    VectorType::VectorKind VecKind);
3329};

3331/// ExtVectorType - Extended vector type. This type is created using
3332/// __attribute__((ext_vector_type(n)), where "n" is the number of elements.
3333/// Unlike vector_size, ext_vector_type is only allowed on typedef's. This
3334/// class enables syntactic extensions, like Vector Components for accessing
3335/// points (as .xyzw), colors (as .rgba), and textures (modeled after OpenGL
3336/// Shading Language).
3337class ExtVectorType : public VectorType {
friend class ASTContext; // ASTContext creates these.

ExtVectorType(QualType vecType, unsigned nElements, QualType canonType)
    : VectorType(ExtVector, vecType, nElements, canonType, GenericVector) {}

3343public:
static int getPointAccessorIdx(char c) {
  switch (c) {
  default: return -1;
  case 'x': case 'r': return 0;
  case 'y': case 'g': return 1;
  case 'z': case 'b': return 2;
  case 'w': case 'a': return 3;
  }
}

static int getNumericAccessorIdx(char c) {
  switch (c) {
    default: return -1;
    case '0': return 0;
    case '1': return 1;
    case '2': return 2;
    case '3': return 3;
    case '4': return 4;
    case '5': return 5;
    case '6': return 6;
    case '7': return 7;
    case '8': return 8;
    case '9': return 9;
    case 'A':
    case 'a': return 10;
    case 'B':
    case 'b': return 11;
    case 'C':
    case 'c': return 12;
    case 'D':
    case 'd': return 13;
    case 'E':
    case 'e': return 14;
    case 'F':
    case 'f': return 15;
  }
}

static int getAccessorIdx(char c, bool isNumericAccessor) {
  if (isNumericAccessor)
    return getNumericAccessorIdx(c);
  else
    return getPointAccessorIdx(c);
}

bool isAccessorWithinNumElements(char c, bool isNumericAccessor) const {
  if (int idx = getAccessorIdx(c, isNumericAccessor)+1)
    return unsigned(idx-1) < getNumElements();
  return false;
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == ExtVector;
}
3401};

3403/// Represents a matrix type, as defined in the Matrix Types clang extensions.
3404/// __attribute__((matrix_type(rows, columns))), where "rows" specifies
3405/// number of rows and "columns" specifies the number of columns.
3406class MatrixType : public Type, public llvm::FoldingSetNode {
3407protected:
friend class ASTContext;

/// The element type of the matrix.
QualType ElementType;

MatrixType(QualType ElementTy, QualType CanonElementTy);

MatrixType(TypeClass TypeClass, QualType ElementTy, QualType CanonElementTy,
           const Expr *RowExpr = nullptr, const Expr *ColumnExpr = nullptr);

3418public:
/// Returns type of the elements being stored in the matrix
QualType getElementType() const { return ElementType; }

/// Valid elements types are the following:
/// * an integer type (as in C2x 6.2.5p19), but excluding enumerated types
///   and _Bool
/// * the standard floating types float or double
/// * a half-precision floating point type, if one is supported on the target
static bool isValidElementType(QualType T) {
  return T->isDependentType() ||
         (T->isRealType() && !T->isBooleanType() && !T->isEnumeralType());
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == ConstantMatrix ||
         T->getTypeClass() == DependentSizedMatrix;
}
3439};

3441/// Represents a concrete matrix type with constant number of rows and columns
3442class ConstantMatrixType final : public MatrixType {
3443protected:
friend class ASTContext;

/// The element type of the matrix.
// FIXME: Appears to be unused? There is also MatrixType::ElementType...
QualType ElementType;

/// Number of rows and columns.
unsigned NumRows;
unsigned NumColumns;

static constexpr unsigned MaxElementsPerDimension = (1 << 20) - 1;

ConstantMatrixType(QualType MatrixElementType, unsigned NRows,
                   unsigned NColumns, QualType CanonElementType);

ConstantMatrixType(TypeClass typeClass, QualType MatrixType, unsigned NRows,
                   unsigned NColumns, QualType CanonElementType);

3462public:
/// Returns the number of rows in the matrix.
unsigned getNumRows() const { return NumRows; }

/// Returns the number of columns in the matrix.
unsigned getNumColumns() const { return NumColumns; }

/// Returns the number of elements required to embed the matrix into a vector.
unsigned getNumElementsFlattened() const {
  return getNumRows() * getNumColumns();
}

/// Returns true if \p NumElements is a valid matrix dimension.
static constexpr bool isDimensionValid(size_t NumElements) {
  return NumElements > 0 && NumElements <= MaxElementsPerDimension;
}

/// Returns the maximum number of elements per dimension.
static constexpr unsigned getMaxElementsPerDimension() {
  return MaxElementsPerDimension;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getElementType(), getNumRows(), getNumColumns(),
          getTypeClass());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType ElementType,
                    unsigned NumRows, unsigned NumColumns,
                    TypeClass TypeClass) {
  ID.AddPointer(ElementType.getAsOpaquePtr());
  ID.AddInteger(NumRows);
  ID.AddInteger(NumColumns);
  ID.AddInteger(TypeClass);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == ConstantMatrix;
}
3501};

3503/// Represents a matrix type where the type and the number of rows and columns
3504/// is dependent on a template.
3505class DependentSizedMatrixType final : public MatrixType {
friend class ASTContext;

const ASTContext &Context;
Expr *RowExpr;
Expr *ColumnExpr;

SourceLocation loc;

DependentSizedMatrixType(const ASTContext &Context, QualType ElementType,
                         QualType CanonicalType, Expr *RowExpr,
                         Expr *ColumnExpr, SourceLocation loc);

3518public:
QualType getElementType() const { return ElementType; }
Expr *getRowExpr() const { return RowExpr; }
Expr *getColumnExpr() const { return ColumnExpr; }
SourceLocation getAttributeLoc() const { return loc; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentSizedMatrix;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, getElementType(), getRowExpr(), getColumnExpr());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    QualType ElementType, Expr *RowExpr, Expr *ColumnExpr);
3537};

3539/// FunctionType - C99 6.7.5.3 - Function Declarators.  This is the common base
3540/// class of FunctionNoProtoType and FunctionProtoType.
3541class FunctionType : public Type {
// The type returned by the function.
QualType ResultType;

3545public:
/// Interesting information about a specific parameter that can't simply
/// be reflected in parameter's type. This is only used by FunctionProtoType
/// but is in FunctionType to make this class available during the
/// specification of the bases of FunctionProtoType.
///
/// It makes sense to model language features this way when there's some
/// sort of parameter-specific override (such as an attribute) that
/// affects how the function is called.  For example, the ARC ns_consumed
/// attribute changes whether a parameter is passed at +0 (the default)
/// or +1 (ns_consumed).  This must be reflected in the function type,
/// but isn't really a change to the parameter type.
///
/// One serious disadvantage of modelling language features this way is
/// that they generally do not work with language features that attempt
/// to destructure types.  For example, template argument deduction will
/// not be able to match a parameter declared as
///   T (*)(U)
/// against an argument of type
///   void (*)(__attribute__((ns_consumed)) id)
/// because the substitution of T=void, U=id into the former will
/// not produce the latter.
class ExtParameterInfo {
  enum {
    ABIMask = 0x0F,
    IsConsumed = 0x10,
    HasPassObjSize = 0x20,
    IsNoEscape = 0x40,
  };
  unsigned char Data = 0;

public:
  ExtParameterInfo() = default;

  /// Return the ABI treatment of this parameter.
  ParameterABI getABI() const { return ParameterABI(Data & ABIMask); }
  ExtParameterInfo withABI(ParameterABI kind) const {
    ExtParameterInfo copy = *this;
    copy.Data = (copy.Data & ~ABIMask) | unsigned(kind);
    return copy;
  }

  /// Is this parameter considered "consumed" by Objective-C ARC?
  /// Consumed parameters must have retainable object type.
  bool isConsumed() const { return (Data & IsConsumed); }
  ExtParameterInfo withIsConsumed(bool consumed) const {
    ExtParameterInfo copy = *this;
    if (consumed)
      copy.Data |= IsConsumed;
    else
      copy.Data &= ~IsConsumed;
    return copy;
  }

  bool hasPassObjectSize() const { return Data & HasPassObjSize; }
  ExtParameterInfo withHasPassObjectSize() const {
    ExtParameterInfo Copy = *this;
    Copy.Data |= HasPassObjSize;
    return Copy;
  }

  bool isNoEscape() const { return Data & IsNoEscape; }
  ExtParameterInfo withIsNoEscape(bool NoEscape) const {
    ExtParameterInfo Copy = *this;
    if (NoEscape)
      Copy.Data |= IsNoEscape;
    else
      Copy.Data &= ~IsNoEscape;
    return Copy;
  }

  unsigned char getOpaqueValue() const { return Data; }
  static ExtParameterInfo getFromOpaqueValue(unsigned char data) {
    ExtParameterInfo result;
    result.Data = data;
    return result;
  }

  friend bool operator==(ExtParameterInfo lhs, ExtParameterInfo rhs) {
    return lhs.Data == rhs.Data;
  }

  friend bool operator!=(ExtParameterInfo lhs, ExtParameterInfo rhs) {
    return lhs.Data != rhs.Data;
  }
};

/// A class which abstracts out some details necessary for
/// making a call.
///
/// It is not actually used directly for storing this information in
/// a FunctionType, although FunctionType does currently use the
/// same bit-pattern.
///
// If you add a field (say Foo), other than the obvious places (both,
// constructors, compile failures), what you need to update is
// * Operator==
// * getFoo
// * withFoo
// * functionType. Add Foo, getFoo.
// * ASTContext::getFooType
// * ASTContext::mergeFunctionTypes
// * FunctionNoProtoType::Profile
// * FunctionProtoType::Profile
// * TypePrinter::PrintFunctionProto
// * AST read and write
// * Codegen
class ExtInfo {
  friend class FunctionType;

  // Feel free to rearrange or add bits, but if you go over 16, you'll need to
  // adjust the Bits field below, and if you add bits, you'll need to adjust
  // Type::FunctionTypeBitfields::ExtInfo as well.

  // |  CC  |noreturn|produces|nocallersavedregs|regparm|nocfcheck|cmsenscall|
  // |0 .. 4|   5    |    6   |       7         |8 .. 10|    11   |    12    |
  //
  // regparm is either 0 (no regparm attribute) or the regparm value+1.
  enum { CallConvMask = 0x1F };
  enum { NoReturnMask = 0x20 };
  enum { ProducesResultMask = 0x40 };
  enum { NoCallerSavedRegsMask = 0x80 };
  enum {
    RegParmMask =  0x700,
    RegParmOffset = 8
  };
  enum { NoCfCheckMask = 0x800 };
  enum { CmseNSCallMask = 0x1000 };
  uint16_t Bits = CC_C;

  ExtInfo(unsigned Bits) : Bits(static_cast<uint16_t>(Bits)) {}

public:
  // Constructor with no defaults. Use this when you know that you
  // have all the elements (when reading an AST file for example).
  ExtInfo(bool noReturn, bool hasRegParm, unsigned regParm, CallingConv cc,
          bool producesResult, bool noCallerSavedRegs, bool NoCfCheck,
          bool cmseNSCall) {
    assert((!hasRegParm || regParm < 7) && "Invalid regparm value")(((!hasRegParm || regParm < 7) && "Invalid regparm value"
) ? static_cast<void> (0) : __assert_fail ("(!hasRegParm || regParm < 7) && \"Invalid regparm value\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 3683, __PRETTY_FUNCTION__));
    Bits = ((unsigned)cc) | (noReturn ? NoReturnMask : 0) |
           (producesResult ? ProducesResultMask : 0) |
           (noCallerSavedRegs ? NoCallerSavedRegsMask : 0) |
           (hasRegParm ? ((regParm + 1) << RegParmOffset) : 0) |
           (NoCfCheck ? NoCfCheckMask : 0) |
           (cmseNSCall ? CmseNSCallMask : 0);
  }

  // Constructor with all defaults. Use when for example creating a
  // function known to use defaults.
  ExtInfo() = default;

  // Constructor with just the calling convention, which is an important part
  // of the canonical type.
  ExtInfo(CallingConv CC) : Bits(CC) {}

  bool getNoReturn() const { return Bits & NoReturnMask; }
  bool getProducesResult() const { return Bits & ProducesResultMask; }
  bool getCmseNSCall() const { return Bits & CmseNSCallMask; }
  bool getNoCallerSavedRegs() const { return Bits & NoCallerSavedRegsMask; }
  bool getNoCfCheck() const { return Bits & NoCfCheckMask; }
  bool getHasRegParm() const { return ((Bits & RegParmMask) >> RegParmOffset) != 0; }

  unsigned getRegParm() const {
    unsigned RegParm = (Bits & RegParmMask) >> RegParmOffset;
    if (RegParm > 0)
      --RegParm;
    return RegParm;
  }

  CallingConv getCC() const { return CallingConv(Bits & CallConvMask); }

  bool operator==(ExtInfo Other) const {
    return Bits == Other.Bits;
  }
  bool operator!=(ExtInfo Other) const {
    return Bits != Other.Bits;
  }

  // Note that we don't have setters. That is by design, use
  // the following with methods instead of mutating these objects.

  ExtInfo withNoReturn(bool noReturn) const {
    if (noReturn)
      return ExtInfo(Bits | NoReturnMask);
    else
      return ExtInfo(Bits & ~NoReturnMask);
  }

  ExtInfo withProducesResult(bool producesResult) const {
    if (producesResult)
      return ExtInfo(Bits | ProducesResultMask);
    else
      return ExtInfo(Bits & ~ProducesResultMask);
  }

  ExtInfo withCmseNSCall(bool cmseNSCall) const {
    if (cmseNSCall)
      return ExtInfo(Bits | CmseNSCallMask);
    else
      return ExtInfo(Bits & ~CmseNSCallMask);
  }

  ExtInfo withNoCallerSavedRegs(bool noCallerSavedRegs) const {
    if (noCallerSavedRegs)
      return ExtInfo(Bits | NoCallerSavedRegsMask);
    else
      return ExtInfo(Bits & ~NoCallerSavedRegsMask);
  }

  ExtInfo withNoCfCheck(bool noCfCheck) const {
    if (noCfCheck)
      return ExtInfo(Bits | NoCfCheckMask);
    else
      return ExtInfo(Bits & ~NoCfCheckMask);
  }

  ExtInfo withRegParm(unsigned RegParm) const {
    assert(RegParm < 7 && "Invalid regparm value")((RegParm < 7 && "Invalid regparm value") ? static_cast
<void> (0) : __assert_fail ("RegParm < 7 && \"Invalid regparm value\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 3762, __PRETTY_FUNCTION__));
    return ExtInfo((Bits & ~RegParmMask) |
                   ((RegParm + 1) << RegParmOffset));
  }

  ExtInfo withCallingConv(CallingConv cc) const {
    return ExtInfo((Bits & ~CallConvMask) | (unsigned) cc);
  }

  void Profile(llvm::FoldingSetNodeID &ID) const {
    ID.AddInteger(Bits);
  }
};

/// A simple holder for a QualType representing a type in an
/// exception specification. Unfortunately needed by FunctionProtoType
/// because TrailingObjects cannot handle repeated types.
struct ExceptionType { QualType Type; };

/// A simple holder for various uncommon bits which do not fit in
/// FunctionTypeBitfields. Aligned to alignof(void *) to maintain the
/// alignment of subsequent objects in TrailingObjects. You must update
/// hasExtraBitfields in FunctionProtoType after adding extra data here.
struct alignas(void *) FunctionTypeExtraBitfields {
  /// The number of types in the exception specification.
  /// A whole unsigned is not needed here and according to
  /// [implimits] 8 bits would be enough here.
  unsigned NumExceptionType;
};

3792protected:
FunctionType(TypeClass tc, QualType res, QualType Canonical,
             TypeDependence Dependence, ExtInfo Info)
    : Type(tc, Canonical, Dependence), ResultType(res) {
  FunctionTypeBits.ExtInfo = Info.Bits;
}

Qualifiers getFastTypeQuals() const {
  return Qualifiers::fromFastMask(FunctionTypeBits.FastTypeQuals);
}

3803public:
QualType getReturnType() const { return ResultType; }

bool getHasRegParm() const { return getExtInfo().getHasRegParm(); }
unsigned getRegParmType() const { return getExtInfo().getRegParm(); }

/// Determine whether this function type includes the GNU noreturn
/// attribute. The C++11 [[noreturn]] attribute does not affect the function
/// type.
bool getNoReturnAttr() const { return getExtInfo().getNoReturn(); }

bool getCmseNSCallAttr() const { return getExtInfo().getCmseNSCall(); }
CallingConv getCallConv() const { return getExtInfo().getCC(); }
ExtInfo getExtInfo() const { return ExtInfo(FunctionTypeBits.ExtInfo); }

static_assert((~Qualifiers::FastMask & Qualifiers::CVRMask) == 0,
              "Const, volatile and restrict are assumed to be a subset of "
              "the fast qualifiers.");

bool isConst() const { return getFastTypeQuals().hasConst(); }
bool isVolatile() const { return getFastTypeQuals().hasVolatile(); }
bool isRestrict() const { return getFastTypeQuals().hasRestrict(); }

/// Determine the type of an expression that calls a function of
/// this type.
QualType getCallResultType(const ASTContext &Context) const {
  return getReturnType().getNonLValueExprType(Context);
}

static StringRef getNameForCallConv(CallingConv CC);

static bool classof(const Type *T) {
  return T->getTypeClass() == FunctionNoProto ||
         T->getTypeClass() == FunctionProto;
}
3838};

3840/// Represents a K&R-style 'int foo()' function, which has
3841/// no information available about its arguments.
3842class FunctionNoProtoType : public FunctionType, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

FunctionNoProtoType(QualType Result, QualType Canonical, ExtInfo Info)
    : FunctionType(FunctionNoProto, Result, Canonical,
                   Result->getDependence() &
                       ~(TypeDependence::DependentInstantiation |
                         TypeDependence::UnexpandedPack),
                   Info) {}

3852public:
// No additional state past what FunctionType provides.

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getReturnType(), getExtInfo());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType ResultType,
                    ExtInfo Info) {
  Info.Profile(ID);
  ID.AddPointer(ResultType.getAsOpaquePtr());
}

static bool classof(const Type *T) {
  return T->getTypeClass() == FunctionNoProto;
}
3871};

3873/// Represents a prototype with parameter type info, e.g.
3874/// 'int foo(int)' or 'int foo(void)'.  'void' is represented as having no
3875/// parameters, not as having a single void parameter. Such a type can have
3876/// an exception specification, but this specification is not part of the
3877/// canonical type. FunctionProtoType has several trailing objects, some of
3878/// which optional. For more information about the trailing objects see
3879/// the first comment inside FunctionProtoType.
3880class FunctionProtoType final
  : public FunctionType,
    public llvm::FoldingSetNode,
    private llvm::TrailingObjects<
        FunctionProtoType, QualType, SourceLocation,
        FunctionType::FunctionTypeExtraBitfields, FunctionType::ExceptionType,
        Expr *, FunctionDecl *, FunctionType::ExtParameterInfo, Qualifiers> {
friend class ASTContext; // ASTContext creates these.
friend TrailingObjects;

// FunctionProtoType is followed by several trailing objects, some of
// which optional. They are in order:
//
// * An array of getNumParams() QualType holding the parameter types.
//   Always present. Note that for the vast majority of FunctionProtoType,
//   these will be the only trailing objects.
//
// * Optionally if the function is variadic, the SourceLocation of the
//   ellipsis.
//
// * Optionally if some extra data is stored in FunctionTypeExtraBitfields
//   (see FunctionTypeExtraBitfields and FunctionTypeBitfields):
//   a single FunctionTypeExtraBitfields. Present if and only if
//   hasExtraBitfields() is true.
//
// * Optionally exactly one of:
//   * an array of getNumExceptions() ExceptionType,
//   * a single Expr *,
//   * a pair of FunctionDecl *,
//   * a single FunctionDecl *
//   used to store information about the various types of exception
//   specification. See getExceptionSpecSize for the details.
//
// * Optionally an array of getNumParams() ExtParameterInfo holding
//   an ExtParameterInfo for each of the parameters. Present if and
//   only if hasExtParameterInfos() is true.
//
// * Optionally a Qualifiers object to represent extra qualifiers that can't
//   be represented by FunctionTypeBitfields.FastTypeQuals. Present if and only
//   if hasExtQualifiers() is true.
//
// The optional FunctionTypeExtraBitfields has to be before the data
// related to the exception specification since it contains the number
// of exception types.
//
// We put the ExtParameterInfos last.  If all were equal, it would make
// more sense to put these before the exception specification, because
// it's much easier to skip past them compared to the elaborate switch
// required to skip the exception specification.  However, all is not
// equal; ExtParameterInfos are used to model very uncommon features,
// and it's better not to burden the more common paths.

3932public:
/// Holds information about the various types of exception specification.
/// ExceptionSpecInfo is not stored as such in FunctionProtoType but is
/// used to group together the various bits of information about the
/// exception specification.
struct ExceptionSpecInfo {
  /// The kind of exception specification this is.
  ExceptionSpecificationType Type = EST_None;

  /// Explicitly-specified list of exception types.
  ArrayRef<QualType> Exceptions;

  /// Noexcept expression, if this is a computed noexcept specification.
  Expr *NoexceptExpr = nullptr;

  /// The function whose exception specification this is, for
  /// EST_Unevaluated and EST_Uninstantiated.
  FunctionDecl *SourceDecl = nullptr;

  /// The function template whose exception specification this is instantiated
  /// from, for EST_Uninstantiated.
  FunctionDecl *SourceTemplate = nullptr;

  ExceptionSpecInfo() = default;

  ExceptionSpecInfo(ExceptionSpecificationType EST) : Type(EST) {}
};

/// Extra information about a function prototype. ExtProtoInfo is not
/// stored as such in FunctionProtoType but is used to group together
/// the various bits of extra information about a function prototype.
struct ExtProtoInfo {
  FunctionType::ExtInfo ExtInfo;
  bool Variadic : 1;
  bool HasTrailingReturn : 1;
  Qualifiers TypeQuals;
  RefQualifierKind RefQualifier = RQ_None;
  ExceptionSpecInfo ExceptionSpec;
  const ExtParameterInfo *ExtParameterInfos = nullptr;
  SourceLocation EllipsisLoc;

  ExtProtoInfo() : Variadic(false), HasTrailingReturn(false) {}

  ExtProtoInfo(CallingConv CC)
      : ExtInfo(CC), Variadic(false), HasTrailingReturn(false) {}

  ExtProtoInfo withExceptionSpec(const ExceptionSpecInfo &ESI) {
    ExtProtoInfo Result(*this);
    Result.ExceptionSpec = ESI;
    return Result;
  }
};

3985private:
unsigned numTrailingObjects(OverloadToken<QualType>) const {
  return getNumParams();
}

unsigned numTrailingObjects(OverloadToken<SourceLocation>) const {
  return isVariadic();
}

unsigned numTrailingObjects(OverloadToken<FunctionTypeExtraBitfields>) const {
  return hasExtraBitfields();
}

unsigned numTrailingObjects(OverloadToken<ExceptionType>) const {
  return getExceptionSpecSize().NumExceptionType;
}

unsigned numTrailingObjects(OverloadToken<Expr *>) const {
  return getExceptionSpecSize().NumExprPtr;
}

unsigned numTrailingObjects(OverloadToken<FunctionDecl *>) const {
  return getExceptionSpecSize().NumFunctionDeclPtr;
}

unsigned numTrailingObjects(OverloadToken<ExtParameterInfo>) const {
  return hasExtParameterInfos() ? getNumParams() : 0;
}

/// Determine whether there are any argument types that
/// contain an unexpanded parameter pack.
static bool containsAnyUnexpandedParameterPack(const QualType *ArgArray,
                                               unsigned numArgs) {
  for (unsigned Idx = 0; Idx < numArgs; ++Idx)
    if (ArgArray[Idx]->containsUnexpandedParameterPack())
      return true;

  return false;
}

FunctionProtoType(QualType result, ArrayRef<QualType> params,
                  QualType canonical, const ExtProtoInfo &epi);

/// This struct is returned by getExceptionSpecSize and is used to
/// translate an ExceptionSpecificationType to the number and kind
/// of trailing objects related to the exception specification.
struct ExceptionSpecSizeHolder {
  unsigned NumExceptionType;
  unsigned NumExprPtr;
  unsigned NumFunctionDeclPtr;
};

/// Return the number and kind of trailing objects
/// related to the exception specification.
static ExceptionSpecSizeHolder
getExceptionSpecSize(ExceptionSpecificationType EST, unsigned NumExceptions) {
  switch (EST) {
  case EST_None:
  case EST_DynamicNone:
  case EST_MSAny:
  case EST_BasicNoexcept:
  case EST_Unparsed:
  case EST_NoThrow:
    return {0, 0, 0};

  case EST_Dynamic:
    return {NumExceptions, 0, 0};

  case EST_DependentNoexcept:
  case EST_NoexceptFalse:
  case EST_NoexceptTrue:
    return {0, 1, 0};

  case EST_Uninstantiated:
    return {0, 0, 2};

  case EST_Unevaluated:
    return {0, 0, 1};
  }
  llvm_unreachable("bad exception specification kind")::llvm::llvm_unreachable_internal("bad exception specification kind"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4064);
}

/// Return the number and kind of trailing objects
/// related to the exception specification.
ExceptionSpecSizeHolder getExceptionSpecSize() const {
  return getExceptionSpecSize(getExceptionSpecType(), getNumExceptions());
}

/// Whether the trailing FunctionTypeExtraBitfields is present.
static bool hasExtraBitfields(ExceptionSpecificationType EST) {
  // If the exception spec type is EST_Dynamic then we have > 0 exception
  // types and the exact number is stored in FunctionTypeExtraBitfields.
  return EST == EST_Dynamic;
}

/// Whether the trailing FunctionTypeExtraBitfields is present.
bool hasExtraBitfields() const {
  return hasExtraBitfields(getExceptionSpecType());
}

bool hasExtQualifiers() const {
  return FunctionTypeBits.HasExtQuals;
}

4089public:
unsigned getNumParams() const { return FunctionTypeBits.NumParams; }

QualType getParamType(unsigned i) const {
  assert(i < getNumParams() && "invalid parameter index")((i < getNumParams() && "invalid parameter index")
 ? static_cast<void> (0) : __assert_fail ("i < getNumParams() && \"invalid parameter index\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4093, __PRETTY_FUNCTION__));
  return param_type_begin()[i];
}

ArrayRef<QualType> getParamTypes() const {
  return llvm::makeArrayRef(param_type_begin(), param_type_end());
}

ExtProtoInfo getExtProtoInfo() const {
  ExtProtoInfo EPI;
  EPI.ExtInfo = getExtInfo();
  EPI.Variadic = isVariadic();
  EPI.EllipsisLoc = getEllipsisLoc();
  EPI.HasTrailingReturn = hasTrailingReturn();
  EPI.ExceptionSpec = getExceptionSpecInfo();
  EPI.TypeQuals = getMethodQuals();
  EPI.RefQualifier = getRefQualifier();
  EPI.ExtParameterInfos = getExtParameterInfosOrNull();
  return EPI;
}

/// Get the kind of exception specification on this function.
ExceptionSpecificationType getExceptionSpecType() const {
  return static_cast<ExceptionSpecificationType>(
      FunctionTypeBits.ExceptionSpecType);
}

/// Return whether this function has any kind of exception spec.
bool hasExceptionSpec() const { return getExceptionSpecType() != EST_None; }

/// Return whether this function has a dynamic (throw) exception spec.
bool hasDynamicExceptionSpec() const {
  return isDynamicExceptionSpec(getExceptionSpecType());
}

/// Return whether this function has a noexcept exception spec.
bool hasNoexceptExceptionSpec() const {
  return isNoexceptExceptionSpec(getExceptionSpecType());
}

/// Return whether this function has a dependent exception spec.
bool hasDependentExceptionSpec() const;

/// Return whether this function has an instantiation-dependent exception
/// spec.
bool hasInstantiationDependentExceptionSpec() const;

/// Return all the available information about this type's exception spec.
ExceptionSpecInfo getExceptionSpecInfo() const {
  ExceptionSpecInfo Result;
  Result.Type = getExceptionSpecType();
  if (Result.Type == EST_Dynamic) {
    Result.Exceptions = exceptions();
  } else if (isComputedNoexcept(Result.Type)) {
    Result.NoexceptExpr = getNoexceptExpr();
  } else if (Result.Type == EST_Uninstantiated) {
    Result.SourceDecl = getExceptionSpecDecl();
    Result.SourceTemplate = getExceptionSpecTemplate();
  } else if (Result.Type == EST_Unevaluated) {
    Result.SourceDecl = getExceptionSpecDecl();
  }
  return Result;
}

/// Return the number of types in the exception specification.
unsigned getNumExceptions() const {
  return getExceptionSpecType() == EST_Dynamic
             ? getTrailingObjects<FunctionTypeExtraBitfields>()
                   ->NumExceptionType
             : 0;
}

/// Return the ith exception type, where 0 <= i < getNumExceptions().
QualType getExceptionType(unsigned i) const {
  assert(i < getNumExceptions() && "Invalid exception number!")((i < getNumExceptions() && "Invalid exception number!"
) ? static_cast<void> (0) : __assert_fail ("i < getNumExceptions() && \"Invalid exception number!\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4167, __PRETTY_FUNCTION__));
  return exception_begin()[i];
}

/// Return the expression inside noexcept(expression), or a null pointer
/// if there is none (because the exception spec is not of this form).
Expr *getNoexceptExpr() const {
  if (!isComputedNoexcept(getExceptionSpecType()))
    return nullptr;
  return *getTrailingObjects<Expr *>();
}

/// If this function type has an exception specification which hasn't
/// been determined yet (either because it has not been evaluated or because
/// it has not been instantiated), this is the function whose exception
/// specification is represented by this type.
FunctionDecl *getExceptionSpecDecl() const {
  if (getExceptionSpecType() != EST_Uninstantiated &&
      getExceptionSpecType() != EST_Unevaluated)
    return nullptr;
  return getTrailingObjects<FunctionDecl *>()[0];
}

/// If this function type has an uninstantiated exception
/// specification, this is the function whose exception specification
/// should be instantiated to find the exception specification for
/// this type.
FunctionDecl *getExceptionSpecTemplate() const {
  if (getExceptionSpecType() != EST_Uninstantiated)
    return nullptr;
  return getTrailingObjects<FunctionDecl *>()[1];
}

/// Determine whether this function type has a non-throwing exception
/// specification.
CanThrowResult canThrow() const;

/// Determine whether this function type has a non-throwing exception
/// specification. If this depends on template arguments, returns
/// \c ResultIfDependent.
bool isNothrow(bool ResultIfDependent = false) const {
  return ResultIfDependent ? canThrow() != CT_Can : canThrow() == CT_Cannot;
}

/// Whether this function prototype is variadic.
bool isVariadic() const { return FunctionTypeBits.Variadic; }

SourceLocation getEllipsisLoc() const {
  return isVariadic() ? *getTrailingObjects<SourceLocation>()
                      : SourceLocation();
}

/// Determines whether this function prototype contains a
/// parameter pack at the end.
///
/// A function template whose last parameter is a parameter pack can be
/// called with an arbitrary number of arguments, much like a variadic
/// function.
bool isTemplateVariadic() const;

/// Whether this function prototype has a trailing return type.
bool hasTrailingReturn() const { return FunctionTypeBits.HasTrailingReturn; }

Qualifiers getMethodQuals() const {
  if (hasExtQualifiers())
    return *getTrailingObjects<Qualifiers>();
  else
    return getFastTypeQuals();
}

/// Retrieve the ref-qualifier associated with this function type.
RefQualifierKind getRefQualifier() const {
  return static_cast<RefQualifierKind>(FunctionTypeBits.RefQualifier);
}

using param_type_iterator = const QualType *;
using param_type_range = llvm::iterator_range<param_type_iterator>;

param_type_range param_types() const {
  return param_type_range(param_type_begin(), param_type_end());
}

param_type_iterator param_type_begin() const {
  return getTrailingObjects<QualType>();
}

param_type_iterator param_type_end() const {
  return param_type_begin() + getNumParams();
}

using exception_iterator = const QualType *;

ArrayRef<QualType> exceptions() const {
  return llvm::makeArrayRef(exception_begin(), exception_end());
}

exception_iterator exception_begin() const {
  return reinterpret_cast<exception_iterator>(
      getTrailingObjects<ExceptionType>());
}

exception_iterator exception_end() const {
  return exception_begin() + getNumExceptions();
}

/// Is there any interesting extra information for any of the parameters
/// of this function type?
bool hasExtParameterInfos() const {
  return FunctionTypeBits.HasExtParameterInfos;
}

ArrayRef<ExtParameterInfo> getExtParameterInfos() const {
  assert(hasExtParameterInfos())((hasExtParameterInfos()) ? static_cast<void> (0) : __assert_fail
 ("hasExtParameterInfos()", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4279, __PRETTY_FUNCTION__));
  return ArrayRef<ExtParameterInfo>(getTrailingObjects<ExtParameterInfo>(),
                                    getNumParams());
}

/// Return a pointer to the beginning of the array of extra parameter
/// information, if present, or else null if none of the parameters
/// carry it.  This is equivalent to getExtProtoInfo().ExtParameterInfos.
const ExtParameterInfo *getExtParameterInfosOrNull() const {
  if (!hasExtParameterInfos())
    return nullptr;
  return getTrailingObjects<ExtParameterInfo>();
}

ExtParameterInfo getExtParameterInfo(unsigned I) const {
  assert(I < getNumParams() && "parameter index out of range")((I < getNumParams() && "parameter index out of range"
) ? static_cast<void> (0) : __assert_fail ("I < getNumParams() && \"parameter index out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4294, __PRETTY_FUNCTION__));
  if (hasExtParameterInfos())
    return getTrailingObjects<ExtParameterInfo>()[I];
  return ExtParameterInfo();
}

ParameterABI getParameterABI(unsigned I) const {
  assert(I < getNumParams() && "parameter index out of range")((I < getNumParams() && "parameter index out of range"
) ? static_cast<void> (0) : __assert_fail ("I < getNumParams() && \"parameter index out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4301, __PRETTY_FUNCTION__));
  if (hasExtParameterInfos())
    return getTrailingObjects<ExtParameterInfo>()[I].getABI();
  return ParameterABI::Ordinary;
}

bool isParamConsumed(unsigned I) const {
  assert(I < getNumParams() && "parameter index out of range")((I < getNumParams() && "parameter index out of range"
) ? static_cast<void> (0) : __assert_fail ("I < getNumParams() && \"parameter index out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4308, __PRETTY_FUNCTION__));
  if (hasExtParameterInfos())
    return getTrailingObjects<ExtParameterInfo>()[I].isConsumed();
  return false;
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void printExceptionSpecification(raw_ostream &OS,
                                 const PrintingPolicy &Policy) const;

static bool classof(const Type *T) {
  return T->getTypeClass() == FunctionProto;
}

void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Ctx);
static void Profile(llvm::FoldingSetNodeID &ID, QualType Result,
                    param_type_iterator ArgTys, unsigned NumArgs,
                    const ExtProtoInfo &EPI, const ASTContext &Context,
                    bool Canonical);
4329};

4331/// Represents the dependent type named by a dependently-scoped
4332/// typename using declaration, e.g.
4333///   using typename Base<T>::foo;
4334///
4335/// Template instantiation turns these into the underlying type.
4336class UnresolvedUsingType : public Type {
friend class ASTContext; // ASTContext creates these.

UnresolvedUsingTypenameDecl *Decl;

UnresolvedUsingType(const UnresolvedUsingTypenameDecl *D)
    : Type(UnresolvedUsing, QualType(),
           TypeDependence::DependentInstantiation),
      Decl(const_cast<UnresolvedUsingTypenameDecl *>(D)) {}

4346public:
UnresolvedUsingTypenameDecl *getDecl() const { return Decl; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == UnresolvedUsing;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  return Profile(ID, Decl);
}

static void Profile(llvm::FoldingSetNodeID &ID,
                    UnresolvedUsingTypenameDecl *D) {
  ID.AddPointer(D);
}
4364};

4366class TypedefType : public Type {
TypedefNameDecl *Decl;

4369private:
friend class ASTContext; // ASTContext creates these.

TypedefType(TypeClass tc, const TypedefNameDecl *D, QualType underlying,
            QualType can);

4375public:
TypedefNameDecl *getDecl() const { return Decl; }

bool isSugared() const { return true; }
QualType desugar() const;

static bool classof(const Type *T) { return T->getTypeClass() == Typedef; }
4382};

4384/// Sugar type that represents a type that was qualified by a qualifier written
4385/// as a macro invocation.
4386class MacroQualifiedType : public Type {
friend class ASTContext; // ASTContext creates these.

QualType UnderlyingTy;
const IdentifierInfo *MacroII;

MacroQualifiedType(QualType UnderlyingTy, QualType CanonTy,
                   const IdentifierInfo *MacroII)
    : Type(MacroQualified, CanonTy, UnderlyingTy->getDependence()),
      UnderlyingTy(UnderlyingTy), MacroII(MacroII) {
  assert(isa<AttributedType>(UnderlyingTy) &&((isa<AttributedType>(UnderlyingTy) && "Expected a macro qualified type to only wrap attributed types."
) ? static_cast<void> (0) : __assert_fail ("isa<AttributedType>(UnderlyingTy) && \"Expected a macro qualified type to only wrap attributed types.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4397, __PRETTY_FUNCTION__))
         "Expected a macro qualified type to only wrap attributed types.")((isa<AttributedType>(UnderlyingTy) && "Expected a macro qualified type to only wrap attributed types."
) ? static_cast<void> (0) : __assert_fail ("isa<AttributedType>(UnderlyingTy) && \"Expected a macro qualified type to only wrap attributed types.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4397, __PRETTY_FUNCTION__));
}

4400public:
const IdentifierInfo *getMacroIdentifier() const { return MacroII; }
QualType getUnderlyingType() const { return UnderlyingTy; }

/// Return this attributed type's modified type with no qualifiers attached to
/// it.
QualType getModifiedType() const;

bool isSugared() const { return true; }
QualType desugar() const;

static bool classof(const Type *T) {
  return T->getTypeClass() == MacroQualified;
}
4414};

4416/// Represents a `typeof` (or __typeof__) expression (a GCC extension).
4417class TypeOfExprType : public Type {
Expr *TOExpr;

4420protected:
friend class ASTContext; // ASTContext creates these.

TypeOfExprType(Expr *E, QualType can = QualType());

4425public:
Expr *getUnderlyingExpr() const { return TOExpr; }

/// Remove a single level of sugar.
QualType desugar() const;

/// Returns whether this type directly provides sugar.
bool isSugared() const;

static bool classof(const Type *T) { return T->getTypeClass() == TypeOfExpr; }
4435};

4437/// Internal representation of canonical, dependent
4438/// `typeof(expr)` types.
4439///
4440/// This class is used internally by the ASTContext to manage
4441/// canonical, dependent types, only. Clients will only see instances
4442/// of this class via TypeOfExprType nodes.
4443class DependentTypeOfExprType
: public TypeOfExprType, public llvm::FoldingSetNode {
const ASTContext &Context;

4447public:
DependentTypeOfExprType(const ASTContext &Context, Expr *E)
    : TypeOfExprType(E), Context(Context) {}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, getUnderlyingExpr());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    Expr *E);
4457};

4459/// Represents `typeof(type)`, a GCC extension.
4460class TypeOfType : public Type {
friend class ASTContext; // ASTContext creates these.

QualType TOType;

TypeOfType(QualType T, QualType can)
    : Type(TypeOf, can, T->getDependence()), TOType(T) {
  assert(!isa<TypedefType>(can) && "Invalid canonical type")((!isa<TypedefType>(can) && "Invalid canonical type"
) ? static_cast<void> (0) : __assert_fail ("!isa<TypedefType>(can) && \"Invalid canonical type\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4467, __PRETTY_FUNCTION__));
}

4470public:
QualType getUnderlyingType() const { return TOType; }

/// Remove a single level of sugar.
QualType desugar() const { return getUnderlyingType(); }

/// Returns whether this type directly provides sugar.
bool isSugared() const { return true; }

static bool classof(const Type *T) { return T->getTypeClass() == TypeOf; }
4480};

4482/// Represents the type `decltype(expr)` (C++11).
4483class DecltypeType : public Type {
Expr *E;
QualType UnderlyingType;

4487protected:
friend class ASTContext; // ASTContext creates these.

DecltypeType(Expr *E, QualType underlyingType, QualType can = QualType());

4492public:
Expr *getUnderlyingExpr() const { return E; }
QualType getUnderlyingType() const { return UnderlyingType; }

/// Remove a single level of sugar.
QualType desugar() const;

/// Returns whether this type directly provides sugar.
bool isSugared() const;

static bool classof(const Type *T) { return T->getTypeClass() == Decltype; }
4503};

4505/// Internal representation of canonical, dependent
4506/// decltype(expr) types.
4507///
4508/// This class is used internally by the ASTContext to manage
4509/// canonical, dependent types, only. Clients will only see instances
4510/// of this class via DecltypeType nodes.
4511class DependentDecltypeType : public DecltypeType, public llvm::FoldingSetNode {
const ASTContext &Context;

4514public:
DependentDecltypeType(const ASTContext &Context, Expr *E);

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, getUnderlyingExpr());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    Expr *E);
4523};

4525/// A unary type transform, which is a type constructed from another.
4526class UnaryTransformType : public Type {
4527public:
enum UTTKind {
  EnumUnderlyingType
};

4532private:
/// The untransformed type.
QualType BaseType;

/// The transformed type if not dependent, otherwise the same as BaseType.
QualType UnderlyingType;

UTTKind UKind;

4541protected:
friend class ASTContext;

UnaryTransformType(QualType BaseTy, QualType UnderlyingTy, UTTKind UKind,
                   QualType CanonicalTy);

4547public:
bool isSugared() const { return !isDependentType(); }
QualType desugar() const { return UnderlyingType; }

QualType getUnderlyingType() const { return UnderlyingType; }
QualType getBaseType() const { return BaseType; }

UTTKind getUTTKind() const { return UKind; }

static bool classof(const Type *T) {
  return T->getTypeClass() == UnaryTransform;
}
4559};

4561/// Internal representation of canonical, dependent
4562/// __underlying_type(type) types.
4563///
4564/// This class is used internally by the ASTContext to manage
4565/// canonical, dependent types, only. Clients will only see instances
4566/// of this class via UnaryTransformType nodes.
4567class DependentUnaryTransformType : public UnaryTransformType,
                                  public llvm::FoldingSetNode {
4569public:
DependentUnaryTransformType(const ASTContext &C, QualType BaseType,
                            UTTKind UKind);

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getBaseType(), getUTTKind());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType BaseType,
                    UTTKind UKind) {
  ID.AddPointer(BaseType.getAsOpaquePtr());
  ID.AddInteger((unsigned)UKind);
}
4582};

4584class TagType : public Type {
friend class ASTReader;
template <class T> friend class serialization::AbstractTypeReader;

/// Stores the TagDecl associated with this type. The decl may point to any
/// TagDecl that declares the entity.
TagDecl *decl;

4592protected:
TagType(TypeClass TC, const TagDecl *D, QualType can);

4595public:
TagDecl *getDecl() const;

/// Determines whether this type is in the process of being defined.
bool isBeingDefined() const;

static bool classof(const Type *T) {
  return T->getTypeClass() == Enum || T->getTypeClass() == Record;
}
4604};

4606/// A helper class that allows the use of isa/cast/dyncast
4607/// to detect TagType objects of structs/unions/classes.
4608class RecordType : public TagType {
4609protected:
friend class ASTContext; // ASTContext creates these.

explicit RecordType(const RecordDecl *D)
    : TagType(Record, reinterpret_cast<const TagDecl*>(D), QualType()) {}
explicit RecordType(TypeClass TC, RecordDecl *D)
    : TagType(TC, reinterpret_cast<const TagDecl*>(D), QualType()) {}

4617public:
RecordDecl *getDecl() const {
  return reinterpret_cast<RecordDecl*>(TagType::getDecl());
}

/// Recursively check all fields in the record for const-ness. If any field
/// is declared const, return true. Otherwise, return false.
bool hasConstFields() const;

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) { return T->getTypeClass() == Record; }
4630};

4632/// A helper class that allows the use of isa/cast/dyncast
4633/// to detect TagType objects of enums.
4634class EnumType : public TagType {
friend class ASTContext; // ASTContext creates these.

explicit EnumType(const EnumDecl *D)
    : TagType(Enum, reinterpret_cast<const TagDecl*>(D), QualType()) {}

4640public:
EnumDecl *getDecl() const {
  return reinterpret_cast<EnumDecl*>(TagType::getDecl());
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) { return T->getTypeClass() == Enum; }
4649};

4651/// An attributed type is a type to which a type attribute has been applied.
4652///
4653/// The "modified type" is the fully-sugared type to which the attributed
4654/// type was applied; generally it is not canonically equivalent to the
4655/// attributed type. The "equivalent type" is the minimally-desugared type
4656/// which the type is canonically equivalent to.
4657///
4658/// For example, in the following attributed type:
4659///     int32_t __attribute__((vector_size(16)))
4660///   - the modified type is the TypedefType for int32_t
4661///   - the equivalent type is VectorType(16, int32_t)
4662///   - the canonical type is VectorType(16, int)
4663class AttributedType : public Type, public llvm::FoldingSetNode {
4664public:
using Kind = attr::Kind;

4667private:
friend class ASTContext; // ASTContext creates these

QualType ModifiedType;
QualType EquivalentType;

AttributedType(QualType canon, attr::Kind attrKind, QualType modified,
               QualType equivalent)
    : Type(Attributed, canon, equivalent->getDependence()),
      ModifiedType(modified), EquivalentType(equivalent) {
  AttributedTypeBits.AttrKind = attrKind;
}

4680public:
Kind getAttrKind() const {
  return static_cast<Kind>(AttributedTypeBits.AttrKind);
}

QualType getModifiedType() const { return ModifiedType; }
QualType getEquivalentType() const { return EquivalentType; }

bool isSugared() const { return true; }
QualType desugar() const { return getEquivalentType(); }

/// Does this attribute behave like a type qualifier?
///
/// A type qualifier adjusts a type to provide specialized rules for
/// a specific object, like the standard const and volatile qualifiers.
/// This includes attributes controlling things like nullability,
/// address spaces, and ARC ownership.  The value of the object is still
/// largely described by the modified type.
///
/// In contrast, many type attributes "rewrite" their modified type to
/// produce a fundamentally different type, not necessarily related in any
/// formalizable way to the original type.  For example, calling convention
/// and vector attributes are not simple type qualifiers.
///
/// Type qualifiers are often, but not always, reflected in the canonical
/// type.
bool isQualifier() const;

bool isMSTypeSpec() const;

bool isCallingConv() const;

llvm::Optional<NullabilityKind> getImmediateNullability() const;

/// Retrieve the attribute kind corresponding to the given
/// nullability kind.
static Kind getNullabilityAttrKind(NullabilityKind kind) {
  switch (kind) {
  case NullabilityKind::NonNull:
    return attr::TypeNonNull;

  case NullabilityKind::Nullable:
    return attr::TypeNullable;

  case NullabilityKind::NullableResult:
    return attr::TypeNullableResult;

  case NullabilityKind::Unspecified:
    return attr::TypeNullUnspecified;
  }
  llvm_unreachable("Unknown nullability kind.")::llvm::llvm_unreachable_internal("Unknown nullability kind."
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 4730);
}

/// Strip off the top-level nullability annotation on the given
/// type, if it's there.
///
/// \param T The type to strip. If the type is exactly an
/// AttributedType specifying nullability (without looking through
/// type sugar), the nullability is returned and this type changed
/// to the underlying modified type.
///
/// \returns the top-level nullability, if present.
static Optional<NullabilityKind> stripOuterNullability(QualType &T);

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getAttrKind(), ModifiedType, EquivalentType);
}

static void Profile(llvm::FoldingSetNodeID &ID, Kind attrKind,
                    QualType modified, QualType equivalent) {
  ID.AddInteger(attrKind);
  ID.AddPointer(modified.getAsOpaquePtr());
  ID.AddPointer(equivalent.getAsOpaquePtr());
}

static bool classof(const Type *T) {
  return T->getTypeClass() == Attributed;
}
4758};

4760class TemplateTypeParmType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these

// Helper data collector for canonical types.
struct CanonicalTTPTInfo {
  unsigned Depth : 15;
  unsigned ParameterPack : 1;
  unsigned Index : 16;
};

union {
  // Info for the canonical type.
  CanonicalTTPTInfo CanTTPTInfo;

  // Info for the non-canonical type.
  TemplateTypeParmDecl *TTPDecl;
};

/// Build a non-canonical type.
TemplateTypeParmType(TemplateTypeParmDecl *TTPDecl, QualType Canon)
    : Type(TemplateTypeParm, Canon,
           TypeDependence::DependentInstantiation |
               (Canon->getDependence() & TypeDependence::UnexpandedPack)),
      TTPDecl(TTPDecl) {}

/// Build the canonical type.
TemplateTypeParmType(unsigned D, unsigned I, bool PP)
    : Type(TemplateTypeParm, QualType(this, 0),
           TypeDependence::DependentInstantiation |
               (PP ? TypeDependence::UnexpandedPack : TypeDependence::None)) {
  CanTTPTInfo.Depth = D;
  CanTTPTInfo.Index = I;
  CanTTPTInfo.ParameterPack = PP;
}

const CanonicalTTPTInfo& getCanTTPTInfo() const {
  QualType Can = getCanonicalTypeInternal();
  return Can->castAs<TemplateTypeParmType>()->CanTTPTInfo;
}

4800public:
unsigned getDepth() const { return getCanTTPTInfo().Depth; }
unsigned getIndex() const { return getCanTTPTInfo().Index; }
bool isParameterPack() const { return getCanTTPTInfo().ParameterPack; }

TemplateTypeParmDecl *getDecl() const {
  return isCanonicalUnqualified() ? nullptr : TTPDecl;
}

IdentifierInfo *getIdentifier() const;

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getDepth(), getIndex(), isParameterPack(), getDecl());
}

static void Profile(llvm::FoldingSetNodeID &ID, unsigned Depth,
                    unsigned Index, bool ParameterPack,
                    TemplateTypeParmDecl *TTPDecl) {
  ID.AddInteger(Depth);
  ID.AddInteger(Index);
  ID.AddBoolean(ParameterPack);
  ID.AddPointer(TTPDecl);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == TemplateTypeParm;
}
4830};

4832/// Represents the result of substituting a type for a template
4833/// type parameter.
4834///
4835/// Within an instantiated template, all template type parameters have
4836/// been replaced with these.  They are used solely to record that a
4837/// type was originally written as a template type parameter;
4838/// therefore they are never canonical.
4839class SubstTemplateTypeParmType : public Type, public llvm::FoldingSetNode {
friend class ASTContext;

// The original type parameter.
const TemplateTypeParmType *Replaced;

SubstTemplateTypeParmType(const TemplateTypeParmType *Param, QualType Canon)
    : Type(SubstTemplateTypeParm, Canon, Canon->getDependence()),
      Replaced(Param) {}

4849public:
/// Gets the template parameter that was substituted for.
const TemplateTypeParmType *getReplacedParameter() const {
  return Replaced;
}

/// Gets the type that was substituted for the template
/// parameter.
QualType getReplacementType() const {
  return getCanonicalTypeInternal();
}

bool isSugared() const { return true; }
QualType desugar() const { return getReplacementType(); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getReplacedParameter(), getReplacementType());
}

static void Profile(llvm::FoldingSetNodeID &ID,
                    const TemplateTypeParmType *Replaced,
                    QualType Replacement) {
  ID.AddPointer(Replaced);
  ID.AddPointer(Replacement.getAsOpaquePtr());
}

static bool classof(const Type *T) {
  return T->getTypeClass() == SubstTemplateTypeParm;
}
4878};

4880/// Represents the result of substituting a set of types for a template
4881/// type parameter pack.
4882///
4883/// When a pack expansion in the source code contains multiple parameter packs
4884/// and those parameter packs correspond to different levels of template
4885/// parameter lists, this type node is used to represent a template type
4886/// parameter pack from an outer level, which has already had its argument pack
4887/// substituted but that still lives within a pack expansion that itself
4888/// could not be instantiated. When actually performing a substitution into
4889/// that pack expansion (e.g., when all template parameters have corresponding
4890/// arguments), this type will be replaced with the \c SubstTemplateTypeParmType
4891/// at the current pack substitution index.
4892class SubstTemplateTypeParmPackType : public Type, public llvm::FoldingSetNode {
friend class ASTContext;

/// The original type parameter.
const TemplateTypeParmType *Replaced;

/// A pointer to the set of template arguments that this
/// parameter pack is instantiated with.
const TemplateArgument *Arguments;

SubstTemplateTypeParmPackType(const TemplateTypeParmType *Param,
                              QualType Canon,
                              const TemplateArgument &ArgPack);

4906public:
IdentifierInfo *getIdentifier() const { return Replaced->getIdentifier(); }

/// Gets the template parameter that was substituted for.
const TemplateTypeParmType *getReplacedParameter() const {
  return Replaced;
}

unsigned getNumArgs() const {
  return SubstTemplateTypeParmPackTypeBits.NumArgs;
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

TemplateArgument getArgumentPack() const;

void Profile(llvm::FoldingSetNodeID &ID);
static void Profile(llvm::FoldingSetNodeID &ID,
                    const TemplateTypeParmType *Replaced,
                    const TemplateArgument &ArgPack);

static bool classof(const Type *T) {
  return T->getTypeClass() == SubstTemplateTypeParmPack;
}
4931};

4933/// Common base class for placeholders for types that get replaced by
4934/// placeholder type deduction: C++11 auto, C++14 decltype(auto), C++17 deduced
4935/// class template types, and constrained type names.
4936///
4937/// These types are usually a placeholder for a deduced type. However, before
4938/// the initializer is attached, or (usually) if the initializer is
4939/// type-dependent, there is no deduced type and the type is canonical. In
4940/// the latter case, it is also a dependent type.
4941class DeducedType : public Type {
4942protected:
DeducedType(TypeClass TC, QualType DeducedAsType,
            TypeDependence ExtraDependence)
    : Type(TC,
           // FIXME: Retain the sugared deduced type?
           DeducedAsType.isNull() ? QualType(this, 0)
                                  : DeducedAsType.getCanonicalType(),
           ExtraDependence | (DeducedAsType.isNull()
                                  ? TypeDependence::None
                                  : DeducedAsType->getDependence() &
                                        ~TypeDependence::VariablyModified)) {}

4954public:
bool isSugared() const { return !isCanonicalUnqualified(); }
QualType desugar() const { return getCanonicalTypeInternal(); }

/// Get the type deduced for this placeholder type, or null if it's
/// either not been deduced or was deduced to a dependent type.
QualType getDeducedType() const {
  return !isCanonicalUnqualified() ? getCanonicalTypeInternal() : QualType();
}
bool isDeduced() const {
  return !isCanonicalUnqualified() || isDependentType();
}

static bool classof(const Type *T) {
  return T->getTypeClass() == Auto ||
         T->getTypeClass() == DeducedTemplateSpecialization;
}
4971};

4973/// Represents a C++11 auto or C++14 decltype(auto) type, possibly constrained
4974/// by a type-constraint.
4975class alignas(8) AutoType : public DeducedType, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these

ConceptDecl *TypeConstraintConcept;

AutoType(QualType DeducedAsType, AutoTypeKeyword Keyword,
         TypeDependence ExtraDependence, ConceptDecl *CD,
         ArrayRef<TemplateArgument> TypeConstraintArgs);

const TemplateArgument *getArgBuffer() const {
  return reinterpret_cast<const TemplateArgument*>(this+1);
}

TemplateArgument *getArgBuffer() {
  return reinterpret_cast<TemplateArgument*>(this+1);
}

4992public:
/// Retrieve the template arguments.
const TemplateArgument *getArgs() const {
  return getArgBuffer();
}

/// Retrieve the number of template arguments.
unsigned getNumArgs() const {
  return AutoTypeBits.NumArgs;
}

const TemplateArgument &getArg(unsigned Idx) const; // in TemplateBase.h

ArrayRef<TemplateArgument> getTypeConstraintArguments() const {
  return {getArgs(), getNumArgs()};
}

ConceptDecl *getTypeConstraintConcept() const {
  return TypeConstraintConcept;
}

bool isConstrained() const {
  return TypeConstraintConcept != nullptr;
}

bool isDecltypeAuto() const {
  return getKeyword() == AutoTypeKeyword::DecltypeAuto;
}

AutoTypeKeyword getKeyword() const {
  return (AutoTypeKeyword)AutoTypeBits.Keyword;
}

void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context) {
  Profile(ID, Context, getDeducedType(), getKeyword(), isDependentType(),
          getTypeConstraintConcept(), getTypeConstraintArguments());
}

static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    QualType Deduced, AutoTypeKeyword Keyword,
                    bool IsDependent, ConceptDecl *CD,
                    ArrayRef<TemplateArgument> Arguments);

static bool classof(const Type *T) {
  return T->getTypeClass() == Auto;
}
5038};

5040/// Represents a C++17 deduced template specialization type.
5041class DeducedTemplateSpecializationType : public DeducedType,
                                        public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these

/// The name of the template whose arguments will be deduced.
TemplateName Template;

DeducedTemplateSpecializationType(TemplateName Template,
                                  QualType DeducedAsType,
                                  bool IsDeducedAsDependent)
    : DeducedType(DeducedTemplateSpecialization, DeducedAsType,
                  toTypeDependence(Template.getDependence()) |
                      (IsDeducedAsDependent
                           ? TypeDependence::DependentInstantiation
                           : TypeDependence::None)),
      Template(Template) {}

5058public:
/// Retrieve the name of the template that we are deducing.
TemplateName getTemplateName() const { return Template;}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getTemplateName(), getDeducedType(), isDependentType());
}

static void Profile(llvm::FoldingSetNodeID &ID, TemplateName Template,
                    QualType Deduced, bool IsDependent) {
  Template.Profile(ID);
  ID.AddPointer(Deduced.getAsOpaquePtr());
  ID.AddBoolean(IsDependent);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == DeducedTemplateSpecialization;
}
5076};

5078/// Represents a type template specialization; the template
5079/// must be a class template, a type alias template, or a template
5080/// template parameter.  A template which cannot be resolved to one of
5081/// these, e.g. because it is written with a dependent scope
5082/// specifier, is instead represented as a
5083/// @c DependentTemplateSpecializationType.
5084///
5085/// A non-dependent template specialization type is always "sugar",
5086/// typically for a \c RecordType.  For example, a class template
5087/// specialization type of \c vector<int> will refer to a tag type for
5088/// the instantiation \c std::vector<int, std::allocator<int>>
5089///
5090/// Template specializations are dependent if either the template or
5091/// any of the template arguments are dependent, in which case the
5092/// type may also be canonical.
5093///
5094/// Instances of this type are allocated with a trailing array of
5095/// TemplateArguments, followed by a QualType representing the
5096/// non-canonical aliased type when the template is a type alias
5097/// template.
5098class alignas(8) TemplateSpecializationType
  : public Type,
    public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these

/// The name of the template being specialized.  This is
/// either a TemplateName::Template (in which case it is a
/// ClassTemplateDecl*, a TemplateTemplateParmDecl*, or a
/// TypeAliasTemplateDecl*), a
/// TemplateName::SubstTemplateTemplateParmPack, or a
/// TemplateName::SubstTemplateTemplateParm (in which case the
/// replacement must, recursively, be one of these).
TemplateName Template;

TemplateSpecializationType(TemplateName T,
                           ArrayRef<TemplateArgument> Args,
                           QualType Canon,
                           QualType Aliased);

5117public:
/// Determine whether any of the given template arguments are dependent.
///
/// The converted arguments should be supplied when known; whether an
/// argument is dependent can depend on the conversions performed on it
/// (for example, a 'const int' passed as a template argument might be
/// dependent if the parameter is a reference but non-dependent if the
/// parameter is an int).
///
/// Note that the \p Args parameter is unused: this is intentional, to remind
/// the caller that they need to pass in the converted arguments, not the
/// specified arguments.
static bool
anyDependentTemplateArguments(ArrayRef<TemplateArgumentLoc> Args,
                              ArrayRef<TemplateArgument> Converted);
static bool
anyDependentTemplateArguments(const TemplateArgumentListInfo &,
                              ArrayRef<TemplateArgument> Converted);
static bool anyInstantiationDependentTemplateArguments(
    ArrayRef<TemplateArgumentLoc> Args);

/// True if this template specialization type matches a current
/// instantiation in the context in which it is found.
bool isCurrentInstantiation() const {
  return isa<InjectedClassNameType>(getCanonicalTypeInternal());
}

/// Determine if this template specialization type is for a type alias
/// template that has been substituted.
///
/// Nearly every template specialization type whose template is an alias
/// template will be substituted. However, this is not the case when
/// the specialization contains a pack expansion but the template alias
/// does not have a corresponding parameter pack, e.g.,
///
/// \code
/// template<typename T, typename U, typename V> struct S;
/// template<typename T, typename U> using A = S<T, int, U>;
/// template<typename... Ts> struct X {
///   typedef A<Ts...> type; // not a type alias
/// };
/// \endcode
bool isTypeAlias() const { return TemplateSpecializationTypeBits.TypeAlias; }

/// Get the aliased type, if this is a specialization of a type alias
/// template.
QualType getAliasedType() const {
  assert(isTypeAlias() && "not a type alias template specialization")((isTypeAlias() && "not a type alias template specialization"
) ? static_cast<void> (0) : __assert_fail ("isTypeAlias() && \"not a type alias template specialization\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5164, __PRETTY_FUNCTION__));
  return *reinterpret_cast<const QualType*>(end());
}

using iterator = const TemplateArgument *;

iterator begin() const { return getArgs(); }
iterator end() const; // defined inline in TemplateBase.h

/// Retrieve the name of the template that we are specializing.
TemplateName getTemplateName() const { return Template; }

/// Retrieve the template arguments.
const TemplateArgument *getArgs() const {
  return reinterpret_cast<const TemplateArgument *>(this + 1);
}

/// Retrieve the number of template arguments.
unsigned getNumArgs() const {
  return TemplateSpecializationTypeBits.NumArgs;
}

/// Retrieve a specific template argument as a type.
/// \pre \c isArgType(Arg)
const TemplateArgument &getArg(unsigned Idx) const; // in TemplateBase.h

ArrayRef<TemplateArgument> template_arguments() const {
  return {getArgs(), getNumArgs()};
}

bool isSugared() const {
  return !isDependentType() || isCurrentInstantiation() || isTypeAlias();
}

QualType desugar() const {
  return isTypeAlias() ? getAliasedType() : getCanonicalTypeInternal();
}

void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Ctx) {
  Profile(ID, Template, template_arguments(), Ctx);
  if (isTypeAlias())
    getAliasedType().Profile(ID);
}

static void Profile(llvm::FoldingSetNodeID &ID, TemplateName T,
                    ArrayRef<TemplateArgument> Args,
                    const ASTContext &Context);

static bool classof(const Type *T) {
  return T->getTypeClass() == TemplateSpecialization;
}
5215};

5217/// Print a template argument list, including the '<' and '>'
5218/// enclosing the template arguments.
5219void printTemplateArgumentList(raw_ostream &OS,
                             ArrayRef<TemplateArgument> Args,
                             const PrintingPolicy &Policy,
                             const TemplateParameterList *TPL = nullptr);

5224void printTemplateArgumentList(raw_ostream &OS,
                             ArrayRef<TemplateArgumentLoc> Args,
                             const PrintingPolicy &Policy,
                             const TemplateParameterList *TPL = nullptr);

5229void printTemplateArgumentList(raw_ostream &OS,
                             const TemplateArgumentListInfo &Args,
                             const PrintingPolicy &Policy,
                             const TemplateParameterList *TPL = nullptr);

5234/// The injected class name of a C++ class template or class
5235/// template partial specialization.  Used to record that a type was
5236/// spelled with a bare identifier rather than as a template-id; the
5237/// equivalent for non-templated classes is just RecordType.
5238///
5239/// Injected class name types are always dependent.  Template
5240/// instantiation turns these into RecordTypes.
5241///
5242/// Injected class name types are always canonical.  This works
5243/// because it is impossible to compare an injected class name type
5244/// with the corresponding non-injected template type, for the same
5245/// reason that it is impossible to directly compare template
5246/// parameters from different dependent contexts: injected class name
5247/// types can only occur within the scope of a particular templated
5248/// declaration, and within that scope every template specialization
5249/// will canonicalize to the injected class name (when appropriate
5250/// according to the rules of the language).
5251class InjectedClassNameType : public Type {
friend class ASTContext; // ASTContext creates these.
friend class ASTNodeImporter;
friend class ASTReader; // FIXME: ASTContext::getInjectedClassNameType is not
                        // currently suitable for AST reading, too much
                        // interdependencies.
template <class T> friend class serialization::AbstractTypeReader;

CXXRecordDecl *Decl;

/// The template specialization which this type represents.
/// For example, in
///   template <class T> class A { ... };
/// this is A<T>, whereas in
///   template <class X, class Y> class A<B<X,Y> > { ... };
/// this is A<B<X,Y> >.
///
/// It is always unqualified, always a template specialization type,
/// and always dependent.
QualType InjectedType;

InjectedClassNameType(CXXRecordDecl *D, QualType TST)
    : Type(InjectedClassName, QualType(),
           TypeDependence::DependentInstantiation),
      Decl(D), InjectedType(TST) {
  assert(isa<TemplateSpecializationType>(TST))((isa<TemplateSpecializationType>(TST)) ? static_cast<
void> (0) : __assert_fail ("isa<TemplateSpecializationType>(TST)"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5276, __PRETTY_FUNCTION__));
  assert(!TST.hasQualifiers())((!TST.hasQualifiers()) ? static_cast<void> (0) : __assert_fail
 ("!TST.hasQualifiers()", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5277, __PRETTY_FUNCTION__));
  assert(TST->isDependentType())((TST->isDependentType()) ? static_cast<void> (0) : __assert_fail
 ("TST->isDependentType()", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5278, __PRETTY_FUNCTION__));
}

5281public:
QualType getInjectedSpecializationType() const { return InjectedType; }

const TemplateSpecializationType *getInjectedTST() const {
  return cast<TemplateSpecializationType>(InjectedType.getTypePtr());
}

TemplateName getTemplateName() const {
  return getInjectedTST()->getTemplateName();
}

CXXRecordDecl *getDecl() const;

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == InjectedClassName;
}
5300};

5302/// The kind of a tag type.
5303enum TagTypeKind {
/// The "struct" keyword.
TTK_Struct,

/// The "__interface" keyword.
TTK_Interface,

/// The "union" keyword.
TTK_Union,

/// The "class" keyword.
TTK_Class,

/// The "enum" keyword.
TTK_Enum
5318};

5320/// The elaboration keyword that precedes a qualified type name or
5321/// introduces an elaborated-type-specifier.
5322enum ElaboratedTypeKeyword {
/// The "struct" keyword introduces the elaborated-type-specifier.
ETK_Struct,

/// The "__interface" keyword introduces the elaborated-type-specifier.
ETK_Interface,

/// The "union" keyword introduces the elaborated-type-specifier.
ETK_Union,

/// The "class" keyword introduces the elaborated-type-specifier.
ETK_Class,

/// The "enum" keyword introduces the elaborated-type-specifier.
ETK_Enum,

/// The "typename" keyword precedes the qualified type name, e.g.,
/// \c typename T::type.
ETK_Typename,

/// No keyword precedes the qualified type name.
ETK_None
5344};

5346/// A helper class for Type nodes having an ElaboratedTypeKeyword.
5347/// The keyword in stored in the free bits of the base class.
5348/// Also provides a few static helpers for converting and printing
5349/// elaborated type keyword and tag type kind enumerations.
5350class TypeWithKeyword : public Type {
5351protected:
TypeWithKeyword(ElaboratedTypeKeyword Keyword, TypeClass tc,
                QualType Canonical, TypeDependence Dependence)
    : Type(tc, Canonical, Dependence) {
  TypeWithKeywordBits.Keyword = Keyword;
}

5358public:
ElaboratedTypeKeyword getKeyword() const {
  return static_cast<ElaboratedTypeKeyword>(TypeWithKeywordBits.Keyword);
}

/// Converts a type specifier (DeclSpec::TST) into an elaborated type keyword.
static ElaboratedTypeKeyword getKeywordForTypeSpec(unsigned TypeSpec);

/// Converts a type specifier (DeclSpec::TST) into a tag type kind.
/// It is an error to provide a type specifier which *isn't* a tag kind here.
static TagTypeKind getTagTypeKindForTypeSpec(unsigned TypeSpec);

/// Converts a TagTypeKind into an elaborated type keyword.
static ElaboratedTypeKeyword getKeywordForTagTypeKind(TagTypeKind Tag);

/// Converts an elaborated type keyword into a TagTypeKind.
/// It is an error to provide an elaborated type keyword
/// which *isn't* a tag kind here.
static TagTypeKind getTagTypeKindForKeyword(ElaboratedTypeKeyword Keyword);

static bool KeywordIsTagTypeKind(ElaboratedTypeKeyword Keyword);

static StringRef getKeywordName(ElaboratedTypeKeyword Keyword);

static StringRef getTagTypeKindName(TagTypeKind Kind) {
  return getKeywordName(getKeywordForTagTypeKind(Kind));
}

class CannotCastToThisType {};
static CannotCastToThisType classof(const Type *);
5388};

5390/// Represents a type that was referred to using an elaborated type
5391/// keyword, e.g., struct S, or via a qualified name, e.g., N::M::type,
5392/// or both.
5393///
5394/// This type is used to keep track of a type name as written in the
5395/// source code, including tag keywords and any nested-name-specifiers.
5396/// The type itself is always "sugar", used to express what was written
5397/// in the source code but containing no additional semantic information.
5398class ElaboratedType final
  : public TypeWithKeyword,
    public llvm::FoldingSetNode,
    private llvm::TrailingObjects<ElaboratedType, TagDecl *> {
friend class ASTContext; // ASTContext creates these
friend TrailingObjects;

/// The nested name specifier containing the qualifier.
NestedNameSpecifier *NNS;

/// The type that this qualified name refers to.
QualType NamedType;

/// The (re)declaration of this tag type owned by this occurrence is stored
/// as a trailing object if there is one. Use getOwnedTagDecl to obtain
/// it, or obtain a null pointer if there is none.

ElaboratedType(ElaboratedTypeKeyword Keyword, NestedNameSpecifier *NNS,
               QualType NamedType, QualType CanonType, TagDecl *OwnedTagDecl)
    : TypeWithKeyword(Keyword, Elaborated, CanonType,
                      // Any semantic dependence on the qualifier will have
                      // been incorporated into NamedType. We still need to
                      // track syntactic (instantiation / error / pack)
                      // dependence on the qualifier.
                      NamedType->getDependence() |
                          (NNS ? toSyntacticDependence(
                                     toTypeDependence(NNS->getDependence()))
                               : TypeDependence::None)),
      NNS(NNS), NamedType(NamedType) {
  ElaboratedTypeBits.HasOwnedTagDecl = false;
  if (OwnedTagDecl) {
    ElaboratedTypeBits.HasOwnedTagDecl = true;
    *getTrailingObjects<TagDecl *>() = OwnedTagDecl;
  }
  assert(!(Keyword == ETK_None && NNS == nullptr) &&((!(Keyword == ETK_None && NNS == nullptr) &&
 "ElaboratedType cannot have elaborated type keyword " "and name qualifier both null."
) ? static_cast<void> (0) : __assert_fail ("!(Keyword == ETK_None && NNS == nullptr) && \"ElaboratedType cannot have elaborated type keyword \" \"and name qualifier both null.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5434, __PRETTY_FUNCTION__))
         "ElaboratedType cannot have elaborated type keyword "((!(Keyword == ETK_None && NNS == nullptr) &&
 "ElaboratedType cannot have elaborated type keyword " "and name qualifier both null."
) ? static_cast<void> (0) : __assert_fail ("!(Keyword == ETK_None && NNS == nullptr) && \"ElaboratedType cannot have elaborated type keyword \" \"and name qualifier both null.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5434, __PRETTY_FUNCTION__))
         "and name qualifier both null.")((!(Keyword == ETK_None && NNS == nullptr) &&
 "ElaboratedType cannot have elaborated type keyword " "and name qualifier both null."
) ? static_cast<void> (0) : __assert_fail ("!(Keyword == ETK_None && NNS == nullptr) && \"ElaboratedType cannot have elaborated type keyword \" \"and name qualifier both null.\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5434, __PRETTY_FUNCTION__));
}

5437public:
/// Retrieve the qualification on this type.
NestedNameSpecifier *getQualifier() const { return NNS; }

/// Retrieve the type named by the qualified-id.
QualType getNamedType() const { return NamedType; }

/// Remove a single level of sugar.
QualType desugar() const { return getNamedType(); }

/// Returns whether this type directly provides sugar.
bool isSugared() const { return true; }

/// Return the (re)declaration of this type owned by this occurrence of this
/// type, or nullptr if there is none.
TagDecl *getOwnedTagDecl() const {
  return ElaboratedTypeBits.HasOwnedTagDecl ? *getTrailingObjects<TagDecl *>()
                                            : nullptr;
}

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getKeyword(), NNS, NamedType, getOwnedTagDecl());
}

static void Profile(llvm::FoldingSetNodeID &ID, ElaboratedTypeKeyword Keyword,
                    NestedNameSpecifier *NNS, QualType NamedType,
                    TagDecl *OwnedTagDecl) {
  ID.AddInteger(Keyword);
  ID.AddPointer(NNS);
  NamedType.Profile(ID);
  ID.AddPointer(OwnedTagDecl);
}

static bool classof(const Type *T) { return T->getTypeClass() == Elaborated; }
5471};

5473/// Represents a qualified type name for which the type name is
5474/// dependent.
5475///
5476/// DependentNameType represents a class of dependent types that involve a
5477/// possibly dependent nested-name-specifier (e.g., "T::") followed by a
5478/// name of a type. The DependentNameType may start with a "typename" (for a
5479/// typename-specifier), "class", "struct", "union", or "enum" (for a
5480/// dependent elaborated-type-specifier), or nothing (in contexts where we
5481/// know that we must be referring to a type, e.g., in a base class specifier).
5482/// Typically the nested-name-specifier is dependent, but in MSVC compatibility
5483/// mode, this type is used with non-dependent names to delay name lookup until
5484/// instantiation.
5485class DependentNameType : public TypeWithKeyword, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these

/// The nested name specifier containing the qualifier.
NestedNameSpecifier *NNS;

/// The type that this typename specifier refers to.
const IdentifierInfo *Name;

DependentNameType(ElaboratedTypeKeyword Keyword, NestedNameSpecifier *NNS,
                  const IdentifierInfo *Name, QualType CanonType)
    : TypeWithKeyword(Keyword, DependentName, CanonType,
                      TypeDependence::DependentInstantiation |
                          toTypeDependence(NNS->getDependence())),
      NNS(NNS), Name(Name) {}

5501public:
/// Retrieve the qualification on this type.
NestedNameSpecifier *getQualifier() const { return NNS; }

/// Retrieve the type named by the typename specifier as an identifier.
///
/// This routine will return a non-NULL identifier pointer when the
/// form of the original typename was terminated by an identifier,
/// e.g., "typename T::type".
const IdentifierInfo *getIdentifier() const {
  return Name;
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getKeyword(), NNS, Name);
}

static void Profile(llvm::FoldingSetNodeID &ID, ElaboratedTypeKeyword Keyword,
                    NestedNameSpecifier *NNS, const IdentifierInfo *Name) {
  ID.AddInteger(Keyword);
  ID.AddPointer(NNS);
  ID.AddPointer(Name);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentName;
}
5531};

5533/// Represents a template specialization type whose template cannot be
5534/// resolved, e.g.
5535///   A<T>::template B<T>
5536class alignas(8) DependentTemplateSpecializationType
  : public TypeWithKeyword,
    public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these

/// The nested name specifier containing the qualifier.
NestedNameSpecifier *NNS;

/// The identifier of the template.
const IdentifierInfo *Name;

DependentTemplateSpecializationType(ElaboratedTypeKeyword Keyword,
                                    NestedNameSpecifier *NNS,
                                    const IdentifierInfo *Name,
                                    ArrayRef<TemplateArgument> Args,
                                    QualType Canon);

const TemplateArgument *getArgBuffer() const {
  return reinterpret_cast<const TemplateArgument*>(this+1);
}

TemplateArgument *getArgBuffer() {
  return reinterpret_cast<TemplateArgument*>(this+1);
}

5561public:
NestedNameSpecifier *getQualifier() const { return NNS; }
const IdentifierInfo *getIdentifier() const { return Name; }

/// Retrieve the template arguments.
const TemplateArgument *getArgs() const {
  return getArgBuffer();
}

/// Retrieve the number of template arguments.
unsigned getNumArgs() const {
  return DependentTemplateSpecializationTypeBits.NumArgs;
}

const TemplateArgument &getArg(unsigned Idx) const; // in TemplateBase.h

ArrayRef<TemplateArgument> template_arguments() const {
  return {getArgs(), getNumArgs()};
}

using iterator = const TemplateArgument *;

iterator begin() const { return getArgs(); }
iterator end() const; // inline in TemplateBase.h

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context) {
  Profile(ID, Context, getKeyword(), NNS, Name, {getArgs(), getNumArgs()});
}

static void Profile(llvm::FoldingSetNodeID &ID,
                    const ASTContext &Context,
                    ElaboratedTypeKeyword Keyword,
                    NestedNameSpecifier *Qualifier,
                    const IdentifierInfo *Name,
                    ArrayRef<TemplateArgument> Args);

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentTemplateSpecialization;
}
5603};

5605/// Represents a pack expansion of types.
5606///
5607/// Pack expansions are part of C++11 variadic templates. A pack
5608/// expansion contains a pattern, which itself contains one or more
5609/// "unexpanded" parameter packs. When instantiated, a pack expansion
5610/// produces a series of types, each instantiated from the pattern of
5611/// the expansion, where the Ith instantiation of the pattern uses the
5612/// Ith arguments bound to each of the unexpanded parameter packs. The
5613/// pack expansion is considered to "expand" these unexpanded
5614/// parameter packs.
5615///
5616/// \code
5617/// template<typename ...Types> struct tuple;
5618///
5619/// template<typename ...Types>
5620/// struct tuple_of_references {
5621///   typedef tuple<Types&...> type;
5622/// };
5623/// \endcode
5624///
5625/// Here, the pack expansion \c Types&... is represented via a
5626/// PackExpansionType whose pattern is Types&.
5627class PackExpansionType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these

/// The pattern of the pack expansion.
QualType Pattern;

PackExpansionType(QualType Pattern, QualType Canon,
                  Optional<unsigned> NumExpansions)
    : Type(PackExpansion, Canon,
           (Pattern->getDependence() | TypeDependence::Dependent |
            TypeDependence::Instantiation) &
               ~TypeDependence::UnexpandedPack),
      Pattern(Pattern) {
  PackExpansionTypeBits.NumExpansions =
      NumExpansions ? *NumExpansions + 1 : 0;
}

5644public:
/// Retrieve the pattern of this pack expansion, which is the
/// type that will be repeatedly instantiated when instantiating the
/// pack expansion itself.
QualType getPattern() const { return Pattern; }

/// Retrieve the number of expansions that this pack expansion will
/// generate, if known.
Optional<unsigned> getNumExpansions() const {
  if (PackExpansionTypeBits.NumExpansions)
    return PackExpansionTypeBits.NumExpansions - 1;
  return None;
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getPattern(), getNumExpansions());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType Pattern,
                    Optional<unsigned> NumExpansions) {
  ID.AddPointer(Pattern.getAsOpaquePtr());
  ID.AddBoolean(NumExpansions.hasValue());
  if (NumExpansions)
    ID.AddInteger(*NumExpansions);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == PackExpansion;
}
5676};

5678/// This class wraps the list of protocol qualifiers. For types that can
5679/// take ObjC protocol qualifers, they can subclass this class.
5680template <class T>
5681class ObjCProtocolQualifiers {
5682protected:
ObjCProtocolQualifiers() = default;

ObjCProtocolDecl * const *getProtocolStorage() const {
  return const_cast<ObjCProtocolQualifiers*>(this)->getProtocolStorage();
}

ObjCProtocolDecl **getProtocolStorage() {
  return static_cast<T*>(this)->getProtocolStorageImpl();
}

void setNumProtocols(unsigned N) {
  static_cast<T*>(this)->setNumProtocolsImpl(N);
}

void initialize(ArrayRef<ObjCProtocolDecl *> protocols) {
  setNumProtocols(protocols.size());
  assert(getNumProtocols() == protocols.size() &&((getNumProtocols() == protocols.size() && "bitfield overflow in protocol count"
) ? static_cast<void> (0) : __assert_fail ("getNumProtocols() == protocols.size() && \"bitfield overflow in protocol count\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5700, __PRETTY_FUNCTION__))
         "bitfield overflow in protocol count")((getNumProtocols() == protocols.size() && "bitfield overflow in protocol count"
) ? static_cast<void> (0) : __assert_fail ("getNumProtocols() == protocols.size() && \"bitfield overflow in protocol count\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5700, __PRETTY_FUNCTION__));
  if (!protocols.empty())
    memcpy(getProtocolStorage(), protocols.data(),
           protocols.size() * sizeof(ObjCProtocolDecl*));
}

5706public:
using qual_iterator = ObjCProtocolDecl * const *;
using qual_range = llvm::iterator_range<qual_iterator>;

qual_range quals() const { return qual_range(qual_begin(), qual_end()); }
qual_iterator qual_begin() const { return getProtocolStorage(); }
qual_iterator qual_end() const { return qual_begin() + getNumProtocols(); }

bool qual_empty() const { return getNumProtocols() == 0; }

/// Return the number of qualifying protocols in this type, or 0 if
/// there are none.
unsigned getNumProtocols() const {
  return static_cast<const T*>(this)->getNumProtocolsImpl();
}

/// Fetch a protocol by index.
ObjCProtocolDecl *getProtocol(unsigned I) const {
  assert(I < getNumProtocols() && "Out-of-range protocol access")((I < getNumProtocols() && "Out-of-range protocol access"
) ? static_cast<void> (0) : __assert_fail ("I < getNumProtocols() && \"Out-of-range protocol access\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5724, __PRETTY_FUNCTION__));
  return qual_begin()[I];
}

/// Retrieve all of the protocol qualifiers.
ArrayRef<ObjCProtocolDecl *> getProtocols() const {
  return ArrayRef<ObjCProtocolDecl *>(qual_begin(), getNumProtocols());
}
5732};

5734/// Represents a type parameter type in Objective C. It can take
5735/// a list of protocols.
5736class ObjCTypeParamType : public Type,
                        public ObjCProtocolQualifiers<ObjCTypeParamType>,
                        public llvm::FoldingSetNode {
friend class ASTContext;
friend class ObjCProtocolQualifiers<ObjCTypeParamType>;

/// The number of protocols stored on this type.
unsigned NumProtocols : 6;

ObjCTypeParamDecl *OTPDecl;

/// The protocols are stored after the ObjCTypeParamType node. In the
/// canonical type, the list of protocols are sorted alphabetically
/// and uniqued.
ObjCProtocolDecl **getProtocolStorageImpl();

/// Return the number of qualifying protocols in this interface type,
/// or 0 if there are none.
unsigned getNumProtocolsImpl() const {
  return NumProtocols;
}

void setNumProtocolsImpl(unsigned N) {
  NumProtocols = N;
}

ObjCTypeParamType(const ObjCTypeParamDecl *D,
                  QualType can,
                  ArrayRef<ObjCProtocolDecl *> protocols);

5766public:
bool isSugared() const { return true; }
QualType desugar() const { return getCanonicalTypeInternal(); }

static bool classof(const Type *T) {
  return T->getTypeClass() == ObjCTypeParam;
}

void Profile(llvm::FoldingSetNodeID &ID);
static void Profile(llvm::FoldingSetNodeID &ID,
                    const ObjCTypeParamDecl *OTPDecl,
                    QualType CanonicalType,
                    ArrayRef<ObjCProtocolDecl *> protocols);

ObjCTypeParamDecl *getDecl() const { return OTPDecl; }
5781};

5783/// Represents a class type in Objective C.
5784///
5785/// Every Objective C type is a combination of a base type, a set of
5786/// type arguments (optional, for parameterized classes) and a list of
5787/// protocols.
5788///
5789/// Given the following declarations:
5790/// \code
5791///   \@class C<T>;
5792///   \@protocol P;
5793/// \endcode
5794///
5795/// 'C' is an ObjCInterfaceType C.  It is sugar for an ObjCObjectType
5796/// with base C and no protocols.
5797///
5798/// 'C<P>' is an unspecialized ObjCObjectType with base C and protocol list [P].
5799/// 'C<C*>' is a specialized ObjCObjectType with type arguments 'C*' and no
5800/// protocol list.
5801/// 'C<C*><P>' is a specialized ObjCObjectType with base C, type arguments 'C*',
5802/// and protocol list [P].
5803///
5804/// 'id' is a TypedefType which is sugar for an ObjCObjectPointerType whose
5805/// pointee is an ObjCObjectType with base BuiltinType::ObjCIdType
5806/// and no protocols.
5807///
5808/// 'id<P>' is an ObjCObjectPointerType whose pointee is an ObjCObjectType
5809/// with base BuiltinType::ObjCIdType and protocol list [P].  Eventually
5810/// this should get its own sugar class to better represent the source.
5811class ObjCObjectType : public Type,
                     public ObjCProtocolQualifiers<ObjCObjectType> {
friend class ObjCProtocolQualifiers<ObjCObjectType>;

// ObjCObjectType.NumTypeArgs - the number of type arguments stored
// after the ObjCObjectPointerType node.
// ObjCObjectType.NumProtocols - the number of protocols stored
// after the type arguments of ObjCObjectPointerType node.
//
// These protocols are those written directly on the type.  If
// protocol qualifiers ever become additive, the iterators will need
// to get kindof complicated.
//
// In the canonical object type, these are sorted alphabetically
// and uniqued.

/// Either a BuiltinType or an InterfaceType or sugar for either.
QualType BaseType;

/// Cached superclass type.
mutable llvm::PointerIntPair<const ObjCObjectType *, 1, bool>
  CachedSuperClassType;

QualType *getTypeArgStorage();
const QualType *getTypeArgStorage() const {
  return const_cast<ObjCObjectType *>(this)->getTypeArgStorage();
}

ObjCProtocolDecl **getProtocolStorageImpl();
/// Return the number of qualifying protocols in this interface type,
/// or 0 if there are none.
unsigned getNumProtocolsImpl() const {
  return ObjCObjectTypeBits.NumProtocols;
}
void setNumProtocolsImpl(unsigned N) {
  ObjCObjectTypeBits.NumProtocols = N;
}

5849protected:
enum Nonce_ObjCInterface { Nonce_ObjCInterface };

ObjCObjectType(QualType Canonical, QualType Base,
               ArrayRef<QualType> typeArgs,
               ArrayRef<ObjCProtocolDecl *> protocols,
               bool isKindOf);

ObjCObjectType(enum Nonce_ObjCInterface)
    : Type(ObjCInterface, QualType(), TypeDependence::None),
      BaseType(QualType(this_(), 0)) {
  ObjCObjectTypeBits.NumProtocols = 0;
  ObjCObjectTypeBits.NumTypeArgs = 0;
  ObjCObjectTypeBits.IsKindOf = 0;
}

void computeSuperClassTypeSlow() const;

5867public:
/// Gets the base type of this object type.  This is always (possibly
/// sugar for) one of:
///  - the 'id' builtin type (as opposed to the 'id' type visible to the
///    user, which is a typedef for an ObjCObjectPointerType)
///  - the 'Class' builtin type (same caveat)
///  - an ObjCObjectType (currently always an ObjCInterfaceType)
QualType getBaseType() const { return BaseType; }

bool isObjCId() const {
  return getBaseType()->isSpecificBuiltinType(BuiltinType::ObjCId);
}

bool isObjCClass() const {
  return getBaseType()->isSpecificBuiltinType(BuiltinType::ObjCClass);
}

bool isObjCUnqualifiedId() const { return qual_empty() && isObjCId(); }
bool isObjCUnqualifiedClass() const { return qual_empty() && isObjCClass(); }
bool isObjCUnqualifiedIdOrClass() const {
  if (!qual_empty()) return false;
  if (const BuiltinType *T = getBaseType()->getAs<BuiltinType>())
    return T->getKind() == BuiltinType::ObjCId ||
           T->getKind() == BuiltinType::ObjCClass;
  return false;
}
bool isObjCQualifiedId() const { return !qual_empty() && isObjCId(); }
bool isObjCQualifiedClass() const { return !qual_empty() && isObjCClass(); }

/// Gets the interface declaration for this object type, if the base type
/// really is an interface.
ObjCInterfaceDecl *getInterface() const;

/// Determine whether this object type is "specialized", meaning
/// that it has type arguments.
bool isSpecialized() const;

/// Determine whether this object type was written with type arguments.
bool isSpecializedAsWritten() const {
  return ObjCObjectTypeBits.NumTypeArgs > 0;
}

/// Determine whether this object type is "unspecialized", meaning
/// that it has no type arguments.
bool isUnspecialized() const { return !isSpecialized(); }

/// Determine whether this object type is "unspecialized" as
/// written, meaning that it has no type arguments.
bool isUnspecializedAsWritten() const { return !isSpecializedAsWritten(); }

/// Retrieve the type arguments of this object type (semantically).
ArrayRef<QualType> getTypeArgs() const;

/// Retrieve the type arguments of this object type as they were
/// written.
ArrayRef<QualType> getTypeArgsAsWritten() const {
  return llvm::makeArrayRef(getTypeArgStorage(),
                            ObjCObjectTypeBits.NumTypeArgs);
}

/// Whether this is a "__kindof" type as written.
bool isKindOfTypeAsWritten() const { return ObjCObjectTypeBits.IsKindOf; }

/// Whether this ia a "__kindof" type (semantically).
bool isKindOfType() const;

/// Retrieve the type of the superclass of this object type.
///
/// This operation substitutes any type arguments into the
/// superclass of the current class type, potentially producing a
/// specialization of the superclass type. Produces a null type if
/// there is no superclass.
QualType getSuperClassType() const {
  if (!CachedSuperClassType.getInt())
    computeSuperClassTypeSlow();

  assert(CachedSuperClassType.getInt() && "Superclass not set?")((CachedSuperClassType.getInt() && "Superclass not set?"
) ? static_cast<void> (0) : __assert_fail ("CachedSuperClassType.getInt() && \"Superclass not set?\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 5943, __PRETTY_FUNCTION__));
  return QualType(CachedSuperClassType.getPointer(), 0);
}

/// Strip off the Objective-C "kindof" type and (with it) any
/// protocol qualifiers.
QualType stripObjCKindOfTypeAndQuals(const ASTContext &ctx) const;

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == ObjCObject ||
         T->getTypeClass() == ObjCInterface;
}
5958};

5960/// A class providing a concrete implementation
5961/// of ObjCObjectType, so as to not increase the footprint of
5962/// ObjCInterfaceType.  Code outside of ASTContext and the core type
5963/// system should not reference this type.
5964class ObjCObjectTypeImpl : public ObjCObjectType, public llvm::FoldingSetNode {
friend class ASTContext;

// If anyone adds fields here, ObjCObjectType::getProtocolStorage()
// will need to be modified.

ObjCObjectTypeImpl(QualType Canonical, QualType Base,
                   ArrayRef<QualType> typeArgs,
                   ArrayRef<ObjCProtocolDecl *> protocols,
                   bool isKindOf)
    : ObjCObjectType(Canonical, Base, typeArgs, protocols, isKindOf) {}

5976public:
void Profile(llvm::FoldingSetNodeID &ID);
static void Profile(llvm::FoldingSetNodeID &ID,
                    QualType Base,
                    ArrayRef<QualType> typeArgs,
                    ArrayRef<ObjCProtocolDecl *> protocols,
                    bool isKindOf);
5983};

5985inline QualType *ObjCObjectType::getTypeArgStorage() {
return reinterpret_cast<QualType *>(static_cast<ObjCObjectTypeImpl*>(this)+1);
5987}

5989inline ObjCProtocolDecl **ObjCObjectType::getProtocolStorageImpl() {
  return reinterpret_cast<ObjCProtocolDecl**>(
           getTypeArgStorage() + ObjCObjectTypeBits.NumTypeArgs);
5992}

5994inline ObjCProtocolDecl **ObjCTypeParamType::getProtocolStorageImpl() {
  return reinterpret_cast<ObjCProtocolDecl**>(
           static_cast<ObjCTypeParamType*>(this)+1);
5997}

5999/// Interfaces are the core concept in Objective-C for object oriented design.
6000/// They basically correspond to C++ classes.  There are two kinds of interface
6001/// types: normal interfaces like `NSString`, and qualified interfaces, which
6002/// are qualified with a protocol list like `NSString<NSCopyable, NSAmazing>`.
6003///
6004/// ObjCInterfaceType guarantees the following properties when considered
6005/// as a subtype of its superclass, ObjCObjectType:
6006///   - There are no protocol qualifiers.  To reinforce this, code which
6007///     tries to invoke the protocol methods via an ObjCInterfaceType will
6008///     fail to compile.
6009///   - It is its own base type.  That is, if T is an ObjCInterfaceType*,
6010///     T->getBaseType() == QualType(T, 0).
6011class ObjCInterfaceType : public ObjCObjectType {
friend class ASTContext; // ASTContext creates these.
friend class ASTReader;
friend class ObjCInterfaceDecl;
template <class T> friend class serialization::AbstractTypeReader;

mutable ObjCInterfaceDecl *Decl;

ObjCInterfaceType(const ObjCInterfaceDecl *D)
    : ObjCObjectType(Nonce_ObjCInterface),
      Decl(const_cast<ObjCInterfaceDecl*>(D)) {}

6023public:
/// Get the declaration of this interface.
ObjCInterfaceDecl *getDecl() const { return Decl; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == ObjCInterface;
}

// Nonsense to "hide" certain members of ObjCObjectType within this
// class.  People asking for protocols on an ObjCInterfaceType are
// not going to get what they want: ObjCInterfaceTypes are
// guaranteed to have no protocols.
enum {
  qual_iterator,
  qual_begin,
  qual_end,
  getNumProtocols,
  getProtocol
};
6045};

6047inline ObjCInterfaceDecl *ObjCObjectType::getInterface() const {
QualType baseType = getBaseType();
while (const auto *ObjT = baseType->getAs<ObjCObjectType>()) {
  if (const auto *T = dyn_cast<ObjCInterfaceType>(ObjT))
    return T->getDecl();

  baseType = ObjT->getBaseType();
}

return nullptr;
6057}

6059/// Represents a pointer to an Objective C object.
6060///
6061/// These are constructed from pointer declarators when the pointee type is
6062/// an ObjCObjectType (or sugar for one).  In addition, the 'id' and 'Class'
6063/// types are typedefs for these, and the protocol-qualified types 'id<P>'
6064/// and 'Class<P>' are translated into these.
6065///
6066/// Pointers to pointers to Objective C objects are still PointerTypes;
6067/// only the first level of pointer gets it own type implementation.
6068class ObjCObjectPointerType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

QualType PointeeType;

ObjCObjectPointerType(QualType Canonical, QualType Pointee)
    : Type(ObjCObjectPointer, Canonical, Pointee->getDependence()),
      PointeeType(Pointee) {}

6077public:
/// Gets the type pointed to by this ObjC pointer.
/// The result will always be an ObjCObjectType or sugar thereof.
QualType getPointeeType() const { return PointeeType; }

/// Gets the type pointed to by this ObjC pointer.  Always returns non-null.
///
/// This method is equivalent to getPointeeType() except that
/// it discards any typedefs (or other sugar) between this
/// type and the "outermost" object type.  So for:
/// \code
///   \@class A; \@protocol P; \@protocol Q;
///   typedef A<P> AP;
///   typedef A A1;
///   typedef A1<P> A1P;
///   typedef A1P<Q> A1PQ;
/// \endcode
/// For 'A*', getObjectType() will return 'A'.
/// For 'A<P>*', getObjectType() will return 'A<P>'.
/// For 'AP*', getObjectType() will return 'A<P>'.
/// For 'A1*', getObjectType() will return 'A'.
/// For 'A1<P>*', getObjectType() will return 'A1<P>'.
/// For 'A1P*', getObjectType() will return 'A1<P>'.
/// For 'A1PQ*', getObjectType() will return 'A1<Q>', because
///   adding protocols to a protocol-qualified base discards the
///   old qualifiers (for now).  But if it didn't, getObjectType()
///   would return 'A1P<Q>' (and we'd have to make iterating over
///   qualifiers more complicated).
const ObjCObjectType *getObjectType() const {
  return PointeeType->castAs<ObjCObjectType>();
}

/// If this pointer points to an Objective C
/// \@interface type, gets the type for that interface.  Any protocol
/// qualifiers on the interface are ignored.
///
/// \return null if the base type for this pointer is 'id' or 'Class'
const ObjCInterfaceType *getInterfaceType() const;

/// If this pointer points to an Objective \@interface
/// type, gets the declaration for that interface.
///
/// \return null if the base type for this pointer is 'id' or 'Class'
ObjCInterfaceDecl *getInterfaceDecl() const {
  return getObjectType()->getInterface();
}

/// True if this is equivalent to the 'id' type, i.e. if
/// its object type is the primitive 'id' type with no protocols.
bool isObjCIdType() const {
  return getObjectType()->isObjCUnqualifiedId();
}

/// True if this is equivalent to the 'Class' type,
/// i.e. if its object tive is the primitive 'Class' type with no protocols.
bool isObjCClassType() const {
  return getObjectType()->isObjCUnqualifiedClass();
}

/// True if this is equivalent to the 'id' or 'Class' type,
bool isObjCIdOrClassType() const {
  return getObjectType()->isObjCUnqualifiedIdOrClass();
}

/// True if this is equivalent to 'id<P>' for some non-empty set of
/// protocols.
bool isObjCQualifiedIdType() const {
  return getObjectType()->isObjCQualifiedId();
}

/// True if this is equivalent to 'Class<P>' for some non-empty set of
/// protocols.
bool isObjCQualifiedClassType() const {
  return getObjectType()->isObjCQualifiedClass();
}

/// Whether this is a "__kindof" type.
bool isKindOfType() const { return getObjectType()->isKindOfType(); }

/// Whether this type is specialized, meaning that it has type arguments.
bool isSpecialized() const { return getObjectType()->isSpecialized(); }

/// Whether this type is specialized, meaning that it has type arguments.
bool isSpecializedAsWritten() const {
  return getObjectType()->isSpecializedAsWritten();
}

/// Whether this type is unspecialized, meaning that is has no type arguments.
bool isUnspecialized() const { return getObjectType()->isUnspecialized(); }

/// Determine whether this object type is "unspecialized" as
/// written, meaning that it has no type arguments.
bool isUnspecializedAsWritten() const { return !isSpecializedAsWritten(); }

/// Retrieve the type arguments for this type.
ArrayRef<QualType> getTypeArgs() const {
  return getObjectType()->getTypeArgs();
}

/// Retrieve the type arguments for this type.
ArrayRef<QualType> getTypeArgsAsWritten() const {
  return getObjectType()->getTypeArgsAsWritten();
}

/// An iterator over the qualifiers on the object type.  Provided
/// for convenience.  This will always iterate over the full set of
/// protocols on a type, not just those provided directly.
using qual_iterator = ObjCObjectType::qual_iterator;
using qual_range = llvm::iterator_range<qual_iterator>;

qual_range quals() const { return qual_range(qual_begin(), qual_end()); }

qual_iterator qual_begin() const {
  return getObjectType()->qual_begin();
}

qual_iterator qual_end() const {
  return getObjectType()->qual_end();
}

bool qual_empty() const { return getObjectType()->qual_empty(); }

/// Return the number of qualifying protocols on the object type.
unsigned getNumProtocols() const {
  return getObjectType()->getNumProtocols();
}

/// Retrieve a qualifying protocol by index on the object type.
ObjCProtocolDecl *getProtocol(unsigned I) const {
  return getObjectType()->getProtocol(I);
}

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

/// Retrieve the type of the superclass of this object pointer type.
///
/// This operation substitutes any type arguments into the
/// superclass of the current class type, potentially producing a
/// pointer to a specialization of the superclass type. Produces a
/// null type if there is no superclass.
QualType getSuperClassType() const;

/// Strip off the Objective-C "kindof" type and (with it) any
/// protocol qualifiers.
const ObjCObjectPointerType *stripObjCKindOfTypeAndQuals(
                               const ASTContext &ctx) const;

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getPointeeType());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType T) {
  ID.AddPointer(T.getAsOpaquePtr());
}

static bool classof(const Type *T) {
  return T->getTypeClass() == ObjCObjectPointer;
}
6236};

6238class AtomicType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

QualType ValueType;

AtomicType(QualType ValTy, QualType Canonical)
    : Type(Atomic, Canonical, ValTy->getDependence()), ValueType(ValTy) {}

6246public:
/// Gets the type contained by this atomic type, i.e.
/// the type returned by performing an atomic load of this atomic type.
QualType getValueType() const { return ValueType; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getValueType());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType T) {
  ID.AddPointer(T.getAsOpaquePtr());
}

static bool classof(const Type *T) {
  return T->getTypeClass() == Atomic;
}
6265};

6267/// PipeType - OpenCL20.
6268class PipeType : public Type, public llvm::FoldingSetNode {
friend class ASTContext; // ASTContext creates these.

QualType ElementType;
bool isRead;

PipeType(QualType elemType, QualType CanonicalPtr, bool isRead)
    : Type(Pipe, CanonicalPtr, elemType->getDependence()),
      ElementType(elemType), isRead(isRead) {}

6278public:
QualType getElementType() const { return ElementType; }

bool isSugared() const { return false; }

QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, getElementType(), isReadOnly());
}

static void Profile(llvm::FoldingSetNodeID &ID, QualType T, bool isRead) {
  ID.AddPointer(T.getAsOpaquePtr());
  ID.AddBoolean(isRead);
}

static bool classof(const Type *T) {
  return T->getTypeClass() == Pipe;
}

bool isReadOnly() const { return isRead; }
6299};

6301/// A fixed int type of a specified bitwidth.
6302class ExtIntType final : public Type, public llvm::FoldingSetNode {
friend class ASTContext;
unsigned IsUnsigned : 1;
unsigned NumBits : 24;

6307protected:
ExtIntType(bool isUnsigned, unsigned NumBits);

6310public:
bool isUnsigned() const { return IsUnsigned; }
bool isSigned() const { return !IsUnsigned; }
unsigned getNumBits() const { return NumBits; }

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, isUnsigned(), getNumBits());
}

static void Profile(llvm::FoldingSetNodeID &ID, bool IsUnsigned,
                    unsigned NumBits) {
  ID.AddBoolean(IsUnsigned);
  ID.AddInteger(NumBits);
}

static bool classof(const Type *T) { return T->getTypeClass() == ExtInt; }
6329};

6331class DependentExtIntType final : public Type, public llvm::FoldingSetNode {
friend class ASTContext;
const ASTContext &Context;
llvm::PointerIntPair<Expr*, 1, bool> ExprAndUnsigned;

6336protected:
DependentExtIntType(const ASTContext &Context, bool IsUnsigned,
                    Expr *NumBits);

6340public:
bool isUnsigned() const;
bool isSigned() const { return !isUnsigned(); }
Expr *getNumBitsExpr() const;

bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

void Profile(llvm::FoldingSetNodeID &ID) {
  Profile(ID, Context, isUnsigned(), getNumBitsExpr());
}
static void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
                    bool IsUnsigned, Expr *NumBitsExpr);

static bool classof(const Type *T) {
  return T->getTypeClass() == DependentExtInt;
}
6357};

6359/// A qualifier set is used to build a set of qualifiers.
6360class QualifierCollector : public Qualifiers {
6361public:
QualifierCollector(Qualifiers Qs = Qualifiers()) : Qualifiers(Qs) {}

/// Collect any qualifiers on the given type and return an
/// unqualified type.  The qualifiers are assumed to be consistent
/// with those already in the type.
const Type *strip(QualType type) {
  addFastQualifiers(type.getLocalFastQualifiers());
  if (!type.hasLocalNonFastQualifiers())
    return type.getTypePtrUnsafe();

  const ExtQuals *extQuals = type.getExtQualsUnsafe();
  addConsistentQualifiers(extQuals->getQualifiers());
  return extQuals->getBaseType();
}

/// Apply the collected qualifiers to the given type.
QualType apply(const ASTContext &Context, QualType QT) const;

/// Apply the collected qualifiers to the given type.
QualType apply(const ASTContext &Context, const Type* T) const;
6382};

6384/// A container of type source information.
6385///
6386/// A client can read the relevant info using TypeLoc wrappers, e.g:
6387/// @code
6388/// TypeLoc TL = TypeSourceInfo->getTypeLoc();
6389/// TL.getBeginLoc().print(OS, SrcMgr);
6390/// @endcode
6391class alignas(8) TypeSourceInfo {
// Contains a memory block after the class, used for type source information,
// allocated by ASTContext.
friend class ASTContext;

QualType Ty;

TypeSourceInfo(QualType ty) : Ty(ty) {}

6400public:
/// Return the type wrapped by this type source info.
QualType getType() const { return Ty; }

/// Return the TypeLoc wrapper for the type source info.
TypeLoc getTypeLoc() const; // implemented in TypeLoc.h

/// Override the type stored in this TypeSourceInfo. Use with caution!
void overrideType(QualType T) { Ty = T; }
6409};

6411// Inline function definitions.

6413inline SplitQualType SplitQualType::getSingleStepDesugaredType() const {
SplitQualType desugar =
  Ty->getLocallyUnqualifiedSingleStepDesugaredType().split();
desugar.Quals.addConsistentQualifiers(Quals);
return desugar;
6418}

6420inline const Type *QualType::getTypePtr() const {
return getCommonPtr()->BaseType;
6422}

6424inline const Type *QualType::getTypePtrOrNull() const {
return (isNull() ? nullptr : getCommonPtr()->BaseType);
6426}

6428inline SplitQualType QualType::split() const {
if (!hasLocalNonFastQualifiers())
  return SplitQualType(getTypePtrUnsafe(),
                       Qualifiers::fromFastMask(getLocalFastQualifiers()));

const ExtQuals *eq = getExtQualsUnsafe();
Qualifiers qs = eq->getQualifiers();
qs.addFastQualifiers(getLocalFastQualifiers());
return SplitQualType(eq->getBaseType(), qs);
6437}

6439inline Qualifiers QualType::getLocalQualifiers() const {
Qualifiers Quals;
if (hasLocalNonFastQualifiers())
  Quals = getExtQualsUnsafe()->getQualifiers();
Quals.addFastQualifiers(getLocalFastQualifiers());
return Quals;
6445}

6447inline Qualifiers QualType::getQualifiers() const {
Qualifiers quals = getCommonPtr()->CanonicalType.getLocalQualifiers();
quals.addFastQualifiers(getLocalFastQualifiers());
return quals;
6451}

6453inline unsigned QualType::getCVRQualifiers() const {
unsigned cvr = getCommonPtr()->CanonicalType.getLocalCVRQualifiers();
cvr |= getLocalCVRQualifiers();
return cvr;
6457}

6459inline QualType QualType::getCanonicalType() const {
QualType canon = getCommonPtr()->CanonicalType;
return canon.withFastQualifiers(getLocalFastQualifiers());
6462}

6464inline bool QualType::isCanonical() const {
return getTypePtr()->isCanonicalUnqualified();
6466}

6468inline bool QualType::isCanonicalAsParam() const {
if (!isCanonical()) return false;
if (hasLocalQualifiers()) return false;

const Type *T = getTypePtr();
if (T->isVariablyModifiedType() && T->hasSizedVLAType())
  return false;

return !isa<FunctionType>(T) && !isa<ArrayType>(T);
6477}

6479inline bool QualType::isConstQualified() const {
return isLocalConstQualified() ||
       getCommonPtr()->CanonicalType.isLocalConstQualified();
6482}

6484inline bool QualType::isRestrictQualified() const {
return isLocalRestrictQualified() ||
       getCommonPtr()->CanonicalType.isLocalRestrictQualified();
6487}


6490inline bool QualType::isVolatileQualified() const {
return isLocalVolatileQualified() ||
       getCommonPtr()->CanonicalType.isLocalVolatileQualified();
6493}

6495inline bool QualType::hasQualifiers() const {
return hasLocalQualifiers() ||
       getCommonPtr()->CanonicalType.hasLocalQualifiers();
6498}

6500inline QualType QualType::getUnqualifiedType() const {
if (!getTypePtr()->getCanonicalTypeInternal().hasLocalQualifiers())
  return QualType(getTypePtr(), 0);

return QualType(getSplitUnqualifiedTypeImpl(*this).Ty, 0);
6505}

6507inline SplitQualType QualType::getSplitUnqualifiedType() const {
if (!getTypePtr()->getCanonicalTypeInternal().hasLocalQualifiers())
  return split();

return getSplitUnqualifiedTypeImpl(*this);
6512}

6514inline void QualType::removeLocalConst() {
removeLocalFastQualifiers(Qualifiers::Const);
6516}

6518inline void QualType::removeLocalRestrict() {
removeLocalFastQualifiers(Qualifiers::Restrict);
6520}

6522inline void QualType::removeLocalVolatile() {
removeLocalFastQualifiers(Qualifiers::Volatile);
6524}

6526inline void QualType::removeLocalCVRQualifiers(unsigned Mask) {
assert(!(Mask & ~Qualifiers::CVRMask) && "mask has non-CVR bits")((!(Mask & ~Qualifiers::CVRMask) && "mask has non-CVR bits"
) ? static_cast<void> (0) : __assert_fail ("!(Mask & ~Qualifiers::CVRMask) && \"mask has non-CVR bits\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 6527, __PRETTY_FUNCTION__));
static_assert((int)Qualifiers::CVRMask == (int)Qualifiers::FastMask,
              "Fast bits differ from CVR bits!");

// Fast path: we don't need to touch the slow qualifiers.
removeLocalFastQualifiers(Mask);
6533}

6535/// Check if this type has any address space qualifier.
6536inline bool QualType::hasAddressSpace() const {
return getQualifiers().hasAddressSpace();
6538}

6540/// Return the address space of this type.
6541inline LangAS QualType::getAddressSpace() const {
return getQualifiers().getAddressSpace();
6543}

6545/// Return the gc attribute of this type.
6546inline Qualifiers::GC QualType::getObjCGCAttr() const {
return getQualifiers().getObjCGCAttr();
6548}

6550inline bool QualType::hasNonTrivialToPrimitiveDefaultInitializeCUnion() const {
if (auto *RD = getTypePtr()->getBaseElementTypeUnsafe()->getAsRecordDecl())
  return hasNonTrivialToPrimitiveDefaultInitializeCUnion(RD);
return false;
6554}

6556inline bool QualType::hasNonTrivialToPrimitiveDestructCUnion() const {
if (auto *RD = getTypePtr()->getBaseElementTypeUnsafe()->getAsRecordDecl())
  return hasNonTrivialToPrimitiveDestructCUnion(RD);
return false;
6560}

6562inline bool QualType::hasNonTrivialToPrimitiveCopyCUnion() const {
if (auto *RD = getTypePtr()->getBaseElementTypeUnsafe()->getAsRecordDecl())
  return hasNonTrivialToPrimitiveCopyCUnion(RD);
return false;
6566}

6568inline FunctionType::ExtInfo getFunctionExtInfo(const Type &t) {
if (const auto *PT = t.getAs<PointerType>()) {
  if (const auto *FT = PT->getPointeeType()->getAs<FunctionType>())
    return FT->getExtInfo();
} else if (const auto *FT = t.getAs<FunctionType>())
  return FT->getExtInfo();

return FunctionType::ExtInfo();
6576}

6578inline FunctionType::ExtInfo getFunctionExtInfo(QualType t) {
return getFunctionExtInfo(*t);
6580}

6582/// Determine whether this type is more
6583/// qualified than the Other type. For example, "const volatile int"
6584/// is more qualified than "const int", "volatile int", and
6585/// "int". However, it is not more qualified than "const volatile
6586/// int".
6587inline bool QualType::isMoreQualifiedThan(QualType other) const {
Qualifiers MyQuals = getQualifiers();
Qualifiers OtherQuals = other.getQualifiers();
return (MyQuals != OtherQuals && MyQuals.compatiblyIncludes(OtherQuals));
6591}

6593/// Determine whether this type is at last
6594/// as qualified as the Other type. For example, "const volatile
6595/// int" is at least as qualified as "const int", "volatile int",
6596/// "int", and "const volatile int".
6597inline bool QualType::isAtLeastAsQualifiedAs(QualType other) const {
Qualifiers OtherQuals = other.getQualifiers();

// Ignore __unaligned qualifier if this type is a void.
if (getUnqualifiedType()->isVoidType())
  OtherQuals.removeUnaligned();

return getQualifiers().compatiblyIncludes(OtherQuals);
6605}

6607/// If Type is a reference type (e.g., const
6608/// int&), returns the type that the reference refers to ("const
6609/// int"). Otherwise, returns the type itself. This routine is used
6610/// throughout Sema to implement C++ 5p6:
6611///
6612///   If an expression initially has the type "reference to T" (8.3.2,
6613///   8.5.3), the type is adjusted to "T" prior to any further
6614///   analysis, the expression designates the object or function
6615///   denoted by the reference, and the expression is an lvalue.
6616inline QualType QualType::getNonReferenceType() const {
if (const auto *RefType = (*this)->getAs<ReferenceType>())
  return RefType->getPointeeType();
else
  return *this;
6621}

6623inline bool QualType::isCForbiddenLValueType() const {
return ((getTypePtr()->isVoidType() && !hasQualifiers()) ||
        getTypePtr()->isFunctionType());
6626}

6628/// Tests whether the type is categorized as a fundamental type.
6629///
6630/// \returns True for types specified in C++0x [basic.fundamental].
6631inline bool Type::isFundamentalType() const {
return isVoidType() ||
       isNullPtrType() ||
       // FIXME: It's really annoying that we don't have an
       // 'isArithmeticType()' which agrees with the standard definition.
       (isArithmeticType() && !isEnumeralType());
6637}

6639/// Tests whether the type is categorized as a compound type.
6640///
6641/// \returns True for types specified in C++0x [basic.compound].
6642inline bool Type::isCompoundType() const {
// C++0x [basic.compound]p1:
//   Compound types can be constructed in the following ways:
//    -- arrays of objects of a given type [...];
return isArrayType() ||
//    -- functions, which have parameters of given types [...];
       isFunctionType() ||
//    -- pointers to void or objects or functions [...];
       isPointerType() ||
//    -- references to objects or functions of a given type. [...]
       isReferenceType() ||
//    -- classes containing a sequence of objects of various types, [...];
       isRecordType() ||
//    -- unions, which are classes capable of containing objects of different
//               types at different times;
       isUnionType() ||
//    -- enumerations, which comprise a set of named constant values. [...];
       isEnumeralType() ||
//    -- pointers to non-static class members, [...].
       isMemberPointerType();
6662}

6664inline bool Type::isFunctionType() const {
return isa<FunctionType>(CanonicalType);
6666}

6668inline bool Type::isPointerType() const {
return isa<PointerType>(CanonicalType);
6670}

6672inline bool Type::isAnyPointerType() const {
return isPointerType() || isObjCObjectPointerType();
6674}

6676inline bool Type::isBlockPointerType() const {
return isa<BlockPointerType>(CanonicalType);
6678}

6680inline bool Type::isReferenceType() const {
return isa<ReferenceType>(CanonicalType);
6682}

6684inline bool Type::isLValueReferenceType() const {
return isa<LValueReferenceType>(CanonicalType);
6686}

6688inline bool Type::isRValueReferenceType() const {
return isa<RValueReferenceType>(CanonicalType);
6690}

6692inline bool Type::isObjectPointerType() const {
// Note: an "object pointer type" is not the same thing as a pointer to an
// object type; rather, it is a pointer to an object type or a pointer to cv
// void.
if (const auto *T = getAs<PointerType>())
  return !T->getPointeeType()->isFunctionType();
else
  return false;
6700}

6702inline bool Type::isFunctionPointerType() const {
if (const auto *T = getAs<PointerType>())
  return T->getPointeeType()->isFunctionType();
else
  return false;
6707}

6709inline bool Type::isFunctionReferenceType() const {
if (const auto *T = getAs<ReferenceType>())
  return T->getPointeeType()->isFunctionType();
else
  return false;
6714}

6716inline bool Type::isMemberPointerType() const {
return isa<MemberPointerType>(CanonicalType);
6718}

6720inline bool Type::isMemberFunctionPointerType() const {
if (const auto *T = getAs<MemberPointerType>())
  return T->isMemberFunctionPointer();
else
  return false;
6725}

6727inline bool Type::isMemberDataPointerType() const {
if (const auto *T = getAs<MemberPointerType>())
  return T->isMemberDataPointer();
else
  return false;
6732}

6734inline bool Type::isArrayType() const {
return isa<ArrayType>(CanonicalType);
6736}

6738inline bool Type::isConstantArrayType() const {
return isa<ConstantArrayType>(CanonicalType);
6740}

6742inline bool Type::isIncompleteArrayType() const {
return isa<IncompleteArrayType>(CanonicalType);
6744}

6746inline bool Type::isVariableArrayType() const {
return isa<VariableArrayType>(CanonicalType);
6748}

6750inline bool Type::isDependentSizedArrayType() const {
return isa<DependentSizedArrayType>(CanonicalType);
6752}

6754inline bool Type::isBuiltinType() const {
return isa<BuiltinType>(CanonicalType);
6756}

6758inline bool Type::isRecordType() const {
return isa<RecordType>(CanonicalType);
6760}

6762inline bool Type::isEnumeralType() const {
return isa<EnumType>(CanonicalType);
6764}

6766inline bool Type::isAnyComplexType() const {
return isa<ComplexType>(CanonicalType);
6768}

6770inline bool Type::isVectorType() const {
return isa<VectorType>(CanonicalType);
6772}

6774inline bool Type::isExtVectorType() const {
return isa<ExtVectorType>(CanonicalType);
6776}

6778inline bool Type::isMatrixType() const {
return isa<MatrixType>(CanonicalType);
6780}

6782inline bool Type::isConstantMatrixType() const {
return isa<ConstantMatrixType>(CanonicalType);
6784}

6786inline bool Type::isDependentAddressSpaceType() const {
return isa<DependentAddressSpaceType>(CanonicalType);
6788}

6790inline bool Type::isObjCObjectPointerType() const {
return isa<ObjCObjectPointerType>(CanonicalType);
6792}

6794inline bool Type::isObjCObjectType() const {
return isa<ObjCObjectType>(CanonicalType);
6796}

6798inline bool Type::isObjCObjectOrInterfaceType() const {
return isa<ObjCInterfaceType>(CanonicalType) ||
  isa<ObjCObjectType>(CanonicalType);
6801}

6803inline bool Type::isAtomicType() const {
return isa<AtomicType>(CanonicalType);
6805}

6807inline bool Type::isUndeducedAutoType() const {
return isa<AutoType>(CanonicalType);
6809}

6811inline bool Type::isObjCQualifiedIdType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCQualifiedIdType();
return false;
6815}

6817inline bool Type::isObjCQualifiedClassType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCQualifiedClassType();
return false;
6821}

6823inline bool Type::isObjCIdType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCIdType();
return false;
6827}

6829inline bool Type::isObjCClassType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCClassType();
return false;
6833}

6835inline bool Type::isObjCSelType() const {
if (const auto *OPT = getAs<PointerType>())
  return OPT->getPointeeType()->isSpecificBuiltinType(BuiltinType::ObjCSel);
return false;
6839}

6841inline bool Type::isObjCBuiltinType() const {
return isObjCIdType() || isObjCClassType() || isObjCSelType();
6843}

6845inline bool Type::isDecltypeType() const {
return isa<DecltypeType>(this);
6847}

6849#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) \
inline bool Type::is##Id##Type() const { \
  return isSpecificBuiltinType(BuiltinType::Id); \
}
6853#include "clang/Basic/OpenCLImageTypes.def"

6855inline bool Type::isSamplerT() const {
return isSpecificBuiltinType(BuiltinType::OCLSampler);
6857}

6859inline bool Type::isEventT() const {
return isSpecificBuiltinType(BuiltinType::OCLEvent);
6861}

6863inline bool Type::isClkEventT() const {
return isSpecificBuiltinType(BuiltinType::OCLClkEvent);
6865}

6867inline bool Type::isQueueT() const {
return isSpecificBuiltinType(BuiltinType::OCLQueue);
6869}

6871inline bool Type::isReserveIDT() const {
return isSpecificBuiltinType(BuiltinType::OCLReserveID);
6873}

6875inline bool Type::isImageType() const {
6876#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) is##Id##Type() ||
return
6878#include "clang/Basic/OpenCLImageTypes.def"
    false; // end boolean or operation
6880}

6882inline bool Type::isPipeType() const {
return isa<PipeType>(CanonicalType);
6884}

6886inline bool Type::isExtIntType() const {
return isa<ExtIntType>(CanonicalType);
6888}

6890#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) \
inline bool Type::is##Id##Type() const { \
  return isSpecificBuiltinType(BuiltinType::Id); \
}
6894#include "clang/Basic/OpenCLExtensionTypes.def"

6896inline bool Type::isOCLIntelSubgroupAVCType() const {
6897#define INTEL_SUBGROUP_AVC_TYPE(ExtType, Id) \
isOCLIntelSubgroupAVC##Id##Type() ||
return
6900#include "clang/Basic/OpenCLExtensionTypes.def"
  false; // end of boolean or operation
6902}

6904inline bool Type::isOCLExtOpaqueType() const {
6905#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) is##Id##Type() ||
return
6907#include "clang/Basic/OpenCLExtensionTypes.def"
  false; // end of boolean or operation
6909}

6911inline bool Type::isOpenCLSpecificType() const {
return isSamplerT() || isEventT() || isImageType() || isClkEventT() ||
       isQueueT() || isReserveIDT() || isPipeType() || isOCLExtOpaqueType();
6914}

6916inline bool Type::isTemplateTypeParmType() const {
return isa<TemplateTypeParmType>(CanonicalType);
6918}

6920inline bool Type::isSpecificBuiltinType(unsigned K) const {
if (const BuiltinType *BT = getAs<BuiltinType>()) {
  return BT->getKind() == static_cast<BuiltinType::Kind>(K);
}
return false;
6925}

6927inline bool Type::isPlaceholderType() const {
if (const auto *BT = dyn_cast<BuiltinType>(this))
  return BT->isPlaceholderType();
return false;
6931}

6933inline const BuiltinType *Type::getAsPlaceholderType() const {
if (const auto *BT = dyn_cast<BuiltinType>(this))
  if (BT->isPlaceholderType())
    return BT;
return nullptr;
6938}

6940inline bool Type::isSpecificPlaceholderType(unsigned K) const {
assert(BuiltinType::isPlaceholderTypeKind((BuiltinType::Kind) K))((BuiltinType::isPlaceholderTypeKind((BuiltinType::Kind) K)) ?
 static_cast<void> (0) : __assert_fail ("BuiltinType::isPlaceholderTypeKind((BuiltinType::Kind) K)"
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 6941, __PRETTY_FUNCTION__));
return isSpecificBuiltinType(K);
6943}

6945inline bool Type::isNonOverloadPlaceholderType() const {
if (const auto *BT = dyn_cast<BuiltinType>(this))
  return BT->isNonOverloadPlaceholderType();
return false;
6949}

6951inline bool Type::isVoidType() const {
return isSpecificBuiltinType(BuiltinType::Void);
6953}

6955inline bool Type::isHalfType() const {
// FIXME: Should we allow complex __fp16? Probably not.
return isSpecificBuiltinType(BuiltinType::Half);
6958}

6960inline bool Type::isFloat16Type() const {
return isSpecificBuiltinType(BuiltinType::Float16);
6962}

6964inline bool Type::isBFloat16Type() const {
return isSpecificBuiltinType(BuiltinType::BFloat16);
6966}

6968inline bool Type::isFloat128Type() const {
return isSpecificBuiltinType(BuiltinType::Float128);
6970}

6972inline bool Type::isNullPtrType() const {
return isSpecificBuiltinType(BuiltinType::NullPtr);
6974}

6976bool IsEnumDeclComplete(EnumDecl *);
6977bool IsEnumDeclScoped(EnumDecl *);

6979inline bool Type::isIntegerType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType))
  return BT->getKind() >= BuiltinType::Bool &&
         BT->getKind() <= BuiltinType::Int128;
if (const EnumType *ET = dyn_cast<EnumType>(CanonicalType)) {
  // Incomplete enum types are not treated as integer types.
  // FIXME: In C++, enum types are never integer types.
  return IsEnumDeclComplete(ET->getDecl()) &&
    !IsEnumDeclScoped(ET->getDecl());
}
return isExtIntType();
6990}

6992inline bool Type::isFixedPointType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) {
  return BT->getKind() >= BuiltinType::ShortAccum &&
         BT->getKind() <= BuiltinType::SatULongFract;
}
return false;
6998}

7000inline bool Type::isFixedPointOrIntegerType() const {
return isFixedPointType() || isIntegerType();
7002}

7004inline bool Type::isSaturatedFixedPointType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) {
  return BT->getKind() >= BuiltinType::SatShortAccum &&
         BT->getKind() <= BuiltinType::SatULongFract;
}
return false;
7010}

7012inline bool Type::isUnsaturatedFixedPointType() const {
return isFixedPointType() && !isSaturatedFixedPointType();
7014}

7016inline bool Type::isSignedFixedPointType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) {
  return ((BT->getKind() >= BuiltinType::ShortAccum &&
           BT->getKind() <= BuiltinType::LongAccum) ||
          (BT->getKind() >= BuiltinType::ShortFract &&
           BT->getKind() <= BuiltinType::LongFract) ||
          (BT->getKind() >= BuiltinType::SatShortAccum &&
           BT->getKind() <= BuiltinType::SatLongAccum) ||
          (BT->getKind() >= BuiltinType::SatShortFract &&
           BT->getKind() <= BuiltinType::SatLongFract));
}
return false;
7028}

7030inline bool Type::isUnsignedFixedPointType() const {
return isFixedPointType() && !isSignedFixedPointType();
7032}

7034inline bool Type::isScalarType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType))
  return BT->getKind() > BuiltinType::Void &&
         BT->getKind() <= BuiltinType::NullPtr;
if (const EnumType *ET = dyn_cast<EnumType>(CanonicalType))
  // Enums are scalar types, but only if they are defined.  Incomplete enums
  // are not treated as scalar types.
  return IsEnumDeclComplete(ET->getDecl());
return isa<PointerType>(CanonicalType) ||
       isa<BlockPointerType>(CanonicalType) ||
       isa<MemberPointerType>(CanonicalType) ||
       isa<ComplexType>(CanonicalType) ||
       isa<ObjCObjectPointerType>(CanonicalType) ||
       isExtIntType();
7048}

7050inline bool Type::isIntegralOrEnumerationType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType))
  return BT->getKind() >= BuiltinType::Bool &&
         BT->getKind() <= BuiltinType::Int128;

// Check for a complete enum type; incomplete enum types are not properly an
// enumeration type in the sense required here.
if (const auto *ET = dyn_cast<EnumType>(CanonicalType))
  return IsEnumDeclComplete(ET->getDecl());

return isExtIntType();
7061}

7063inline bool Type::isBooleanType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType))
  return BT->getKind() == BuiltinType::Bool;
return false;
7067}

7069inline bool Type::isUndeducedType() const {
auto *DT = getContainedDeducedType();
return DT && !DT->isDeduced();
7072}

7074/// Determines whether this is a type for which one can define
7075/// an overloaded operator.
7076inline bool Type::isOverloadableType() const {
return isDependentType() || isRecordType() || isEnumeralType();
7078}

7080/// Determines whether this type is written as a typedef-name.
7081inline bool Type::isTypedefNameType() const {
if (getAs<TypedefType>())
  return true;
if (auto *TST = getAs<TemplateSpecializationType>())
  return TST->isTypeAlias();
return false;
7087}

7089/// Determines whether this type can decay to a pointer type.
7090inline bool Type::canDecayToPointerType() const {
return isFunctionType() || isArrayType();
7092}

7094inline bool Type::hasPointerRepresentation() const {
return (isPointerType() || isReferenceType() || isBlockPointerType() ||
        isObjCObjectPointerType() || isNullPtrType());
7097}

7099inline bool Type::hasObjCPointerRepresentation() const {
return isObjCObjectPointerType();
7101}

7103inline const Type *Type::getBaseElementTypeUnsafe() const {
const Type *type = this;
while (const ArrayType *arrayType = type->getAsArrayTypeUnsafe())
  type = arrayType->getElementType().getTypePtr();
return type;
7108}

7110inline const Type *Type::getPointeeOrArrayElementType() const {
const Type *type = this;
if (type->isAnyPointerType())
  return type->getPointeeType().getTypePtr();
else if (type->isArrayType())
  return type->getBaseElementTypeUnsafe();
return type;
7117}
7118/// Insertion operator for partial diagnostics. This allows sending adress
7119/// spaces into a diagnostic with <<.
7120inline const StreamingDiagnostic &operator<<(const StreamingDiagnostic &PD,
                                           LangAS AS) {
PD.AddTaggedVal(static_cast<std::underlying_type_t<LangAS>>(AS),
                DiagnosticsEngine::ArgumentKind::ak_addrspace);
return PD;
7125}

7127/// Insertion operator for partial diagnostics. This allows sending Qualifiers
7128/// into a diagnostic with <<.
7129inline const StreamingDiagnostic &operator<<(const StreamingDiagnostic &PD,
                                           Qualifiers Q) {
PD.AddTaggedVal(Q.getAsOpaqueValue(),
                DiagnosticsEngine::ArgumentKind::ak_qual);
return PD;
7134}

7136/// Insertion operator for partial diagnostics.  This allows sending QualType's
7137/// into a diagnostic with <<.
7138inline const StreamingDiagnostic &operator<<(const StreamingDiagnostic &PD,
                                           QualType T) {
PD.AddTaggedVal(reinterpret_cast<intptr_t>(T.getAsOpaquePtr()),
                DiagnosticsEngine::ak_qualtype);
return PD;
7143}

7145// Helper class template that is used by Type::getAs to ensure that one does
7146// not try to look through a qualified type to get to an array type.
7147template <typename T>
7148using TypeIsArrayType =
  std::integral_constant<bool, std::is_same<T, ArrayType>::value ||
                                   std::is_base_of<ArrayType, T>::value>;

7152// Member-template getAs<specific type>'.
7153template <typename T> const T *Type::getAs() const {
static_assert(!TypeIsArrayType<T>::value,
              "ArrayType cannot be used with getAs!");

// If this is directly a T type, return it.
if (const auto *Ty = dyn_cast<T>(this))
  return Ty;

// If the canonical form of this type isn't the right kind, reject it.
if (!isa<T>(CanonicalType))
  return nullptr;

// If this is a typedef for the type, strip the typedef off without
// losing all typedef information.
return cast<T>(getUnqualifiedDesugaredType());
7168}

7170template <typename T> const T *Type::getAsAdjusted() const {
static_assert(!TypeIsArrayType<T>::value, "ArrayType cannot be used with getAsAdjusted!");

// If this is directly a T type, return it.
if (const auto *Ty = dyn_cast<T>(this))
  return Ty;

// If the canonical form of this type isn't the right kind, reject it.
if (!isa<T>(CanonicalType))
  return nullptr;

// Strip off type adjustments that do not modify the underlying nature of the
// type.
const Type *Ty = this;
while (Ty) {
  if (const auto *A = dyn_cast<AttributedType>(Ty))
    Ty = A->getModifiedType().getTypePtr();
  else if (const auto *E = dyn_cast<ElaboratedType>(Ty))
    Ty = E->desugar().getTypePtr();
  else if (const auto *P = dyn_cast<ParenType>(Ty))
    Ty = P->desugar().getTypePtr();
  else if (const auto *A = dyn_cast<AdjustedType>(Ty))
    Ty = A->desugar().getTypePtr();
  else if (const auto *M = dyn_cast<MacroQualifiedType>(Ty))
    Ty = M->desugar().getTypePtr();
  else
    break;
}

// Just because the canonical type is correct does not mean we can use cast<>,
// since we may not have stripped off all the sugar down to the base type.
return dyn_cast<T>(Ty);
7202}

7204inline const ArrayType *Type::getAsArrayTypeUnsafe() const {
// If this is directly an array type, return it.
if (const auto *arr = dyn_cast<ArrayType>(this))
  return arr;

// If the canonical form of this type isn't the right kind, reject it.
if (!isa<ArrayType>(CanonicalType))
  return nullptr;

// If this is a typedef for the type, strip the typedef off without
// losing all typedef information.
return cast<ArrayType>(getUnqualifiedDesugaredType());
7216}

7218template <typename T> const T *Type::castAs() const {
static_assert(!TypeIsArrayType<T>::value,
              "ArrayType cannot be used with castAs!");

if (const auto *ty = dyn_cast<T>(this)) return ty;
assert(isa<T>(CanonicalType))((isa<T>(CanonicalType)) ? static_cast<void> (0) :
 __assert_fail ("isa<T>(CanonicalType)", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 7223, __PRETTY_FUNCTION__));
return cast<T>(getUnqualifiedDesugaredType());
7225}

7227inline const ArrayType *Type::castAsArrayTypeUnsafe() const {
assert(isa<ArrayType>(CanonicalType))((isa<ArrayType>(CanonicalType)) ? static_cast<void>
 (0) : __assert_fail ("isa<ArrayType>(CanonicalType)", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 7228, __PRETTY_FUNCTION__));
if (const auto *arr = dyn_cast<ArrayType>(this)) return arr;
return cast<ArrayType>(getUnqualifiedDesugaredType());
7231}

7233DecayedType::DecayedType(QualType OriginalType, QualType DecayedPtr,
                       QualType CanonicalPtr)
  : AdjustedType(Decayed, OriginalType, DecayedPtr, CanonicalPtr) {
7236#ifndef NDEBUG
QualType Adjusted = getAdjustedType();
(void)AttributedType::stripOuterNullability(Adjusted);
assert(isa<PointerType>(Adjusted))((isa<PointerType>(Adjusted)) ? static_cast<void>
 (0) : __assert_fail ("isa<PointerType>(Adjusted)", "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/clang/include/clang/AST/Type.h"
, 7239, __PRETTY_FUNCTION__));
7240#endif
7241}

7243QualType DecayedType::getPointeeType() const {
QualType Decayed = getDecayedType();
(void)AttributedType::stripOuterNullability(Decayed);
return cast<PointerType>(Decayed)->getPointeeType();
7247}

7249// Get the decimal string representation of a fixed point type, represented
7250// as a scaled integer.
7251// TODO: At some point, we should change the arguments to instead just accept an
7252// APFixedPoint instead of APSInt and scale.
7253void FixedPointValueToString(SmallVectorImpl<char> &Str, llvm::APSInt Val,
                           unsigned Scale);

7256} // namespace clang

7258#endif // LLVM_CLANG_AST_TYPE_H

←

/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include/llvm/ADT/PointerIntPair.h

1//===- llvm/ADT/PointerIntPair.h - Pair for pointer and int -----*- 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// This file defines the PointerIntPair class.
10//
11//===----------------------------------------------------------------------===//
12 
13#ifndef LLVM_ADT_POINTERINTPAIR_H
14#define LLVM_ADT_POINTERINTPAIR_H
15 
16#include "llvm/Support/Compiler.h"
17#include "llvm/Support/PointerLikeTypeTraits.h"
18#include "llvm/Support/type_traits.h"
19#include <cassert>
20#include <cstdint>
21#include <limits>
22 
23namespace llvm {
24 
25template <typename T> struct DenseMapInfo;
26template <typename PointerT, unsigned IntBits, typename PtrTraits>
27struct PointerIntPairInfo;
28 
29/// PointerIntPair - This class implements a pair of a pointer and small
30/// integer.  It is designed to represent this in the space required by one
31/// pointer by bitmangling the integer into the low part of the pointer.  This
32/// can only be done for small integers: typically up to 3 bits, but it depends
33/// on the number of bits available according to PointerLikeTypeTraits for the
34/// type.
35///
36/// Note that PointerIntPair always puts the IntVal part in the highest bits
37/// possible.  For example, PointerIntPair<void*, 1, bool> will put the bit for
38/// the bool into bit #2, not bit #0, which allows the low two bits to be used
39/// for something else.  For example, this allows:
40///   PointerIntPair<PointerIntPair<void*, 1, bool>, 1, bool>
41/// ... and the two bools will land in different bits.
42template <typename PointerTy, unsigned IntBits, typename IntType = unsigned,
43          typename PtrTraits = PointerLikeTypeTraits<PointerTy>,
44          typename Info = PointerIntPairInfo<PointerTy, IntBits, PtrTraits>>
45class PointerIntPair {
46  // Used by MSVC visualizer and generally helpful for debugging/visualizing.
47  using InfoTy = Info;
48  intptr_t Value = 0;
49 
50public:
51  constexpr PointerIntPair() = default;
52 
53  PointerIntPair(PointerTy PtrVal, IntType IntVal) {
54    setPointerAndInt(PtrVal, IntVal);
55  }
56 
57  explicit PointerIntPair(PointerTy PtrVal) { initWithPointer(PtrVal); }
58 
59  PointerTy getPointer() const { return Info::getPointer(Value); }
60 
61  IntType getInt() const { return (IntType)Info::getInt(Value); }
62 
63  void setPointer(PointerTy PtrVal) LLVM_LVALUE_FUNCTION& {
64    Value = Info::updatePointer(Value, PtrVal);
65  }
66 
67  void setInt(IntType IntVal) LLVM_LVALUE_FUNCTION& {
68    Value = Info::updateInt(Value, static_cast<intptr_t>(IntVal));
69  }
70 
71  void initWithPointer(PointerTy PtrVal) LLVM_LVALUE_FUNCTION& {
72    Value = Info::updatePointer(0, PtrVal);
73  }
74 
75  void setPointerAndInt(PointerTy PtrVal, IntType IntVal) LLVM_LVALUE_FUNCTION& {
76    Value = Info::updateInt(Info::updatePointer(0, PtrVal),
77                            static_cast<intptr_t>(IntVal));
78  }
79 
80  PointerTy const *getAddrOfPointer() const {
81    return const_cast<PointerIntPair *>(this)->getAddrOfPointer();
82  }
83 
84  PointerTy *getAddrOfPointer() {
85    assert(Value == reinterpret_cast<intptr_t>(getPointer()) &&((Value == reinterpret_cast<intptr_t>(getPointer()) &&
 "Can only return the address if IntBits is cleared and " "PtrTraits doesn't change the pointer"
) ? static_cast<void> (0) : __assert_fail ("Value == reinterpret_cast<intptr_t>(getPointer()) && \"Can only return the address if IntBits is cleared and \" \"PtrTraits doesn't change the pointer\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include/llvm/ADT/PointerIntPair.h"
, 87, __PRETTY_FUNCTION__))
86           "Can only return the address if IntBits is cleared and "((Value == reinterpret_cast<intptr_t>(getPointer()) &&
 "Can only return the address if IntBits is cleared and " "PtrTraits doesn't change the pointer"
) ? static_cast<void> (0) : __assert_fail ("Value == reinterpret_cast<intptr_t>(getPointer()) && \"Can only return the address if IntBits is cleared and \" \"PtrTraits doesn't change the pointer\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include/llvm/ADT/PointerIntPair.h"
, 87, __PRETTY_FUNCTION__))
87           "PtrTraits doesn't change the pointer")((Value == reinterpret_cast<intptr_t>(getPointer()) &&
 "Can only return the address if IntBits is cleared and " "PtrTraits doesn't change the pointer"
) ? static_cast<void> (0) : __assert_fail ("Value == reinterpret_cast<intptr_t>(getPointer()) && \"Can only return the address if IntBits is cleared and \" \"PtrTraits doesn't change the pointer\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include/llvm/ADT/PointerIntPair.h"
, 87, __PRETTY_FUNCTION__));
88    return reinterpret_cast<PointerTy *>(&Value);
89  }
90 
91  void *getOpaqueValue() const { return reinterpret_cast<void *>(Value); }
92 
93  void setFromOpaqueValue(void *Val) LLVM_LVALUE_FUNCTION& {
94    Value = reinterpret_cast<intptr_t>(Val);
95  }
96 
97  static PointerIntPair getFromOpaqueValue(void *V) {
98    PointerIntPair P;
99    P.setFromOpaqueValue(V);
100    return P;
101  }
102 
103  // Allow PointerIntPairs to be created from const void * if and only if the
104  // pointer type could be created from a const void *.
105  static PointerIntPair getFromOpaqueValue(const void *V) {
106    (void)PtrTraits::getFromVoidPointer(V);
107    return getFromOpaqueValue(const_cast<void *>(V));
108  }
109 
110  bool operator==(const PointerIntPair &RHS) const {
111    return Value == RHS.Value;
21
←
Assuming 'Value' is not equal to 'RHS.Value'→
22
←
Returning zero, which participates in a condition later→
112  }
113 
114  bool operator!=(const PointerIntPair &RHS) const {
115    return Value != RHS.Value;
116  }
117 
118  bool operator<(const PointerIntPair &RHS) const { return Value < RHS.Value; }
119  bool operator>(const PointerIntPair &RHS) const { return Value > RHS.Value; }
120 
121  bool operator<=(const PointerIntPair &RHS) const {
122    return Value <= RHS.Value;
123  }
124 
125  bool operator>=(const PointerIntPair &RHS) const {
126    return Value >= RHS.Value;
127  }
128};
129 
130// Specialize is_trivially_copyable to avoid limitation of llvm::is_trivially_copyable
131// when compiled with gcc 4.9.
132template <typename PointerTy, unsigned IntBits, typename IntType,
133          typename PtrTraits,
134          typename Info>
135struct is_trivially_copyable<PointerIntPair<PointerTy, IntBits, IntType, PtrTraits, Info>> : std::true_type {
136#ifdef HAVE_STD_IS_TRIVIALLY_COPYABLE
137  static_assert(std::is_trivially_copyable<PointerIntPair<PointerTy, IntBits, IntType, PtrTraits, Info>>::value,
138                "inconsistent behavior between llvm:: and std:: implementation of is_trivially_copyable");
139#endif
140};
141 
142 
143template <typename PointerT, unsigned IntBits, typename PtrTraits>
144struct PointerIntPairInfo {
145  static_assert(PtrTraits::NumLowBitsAvailable <
146                    std::numeric_limits<uintptr_t>::digits,
147                "cannot use a pointer type that has all bits free");
148  static_assert(IntBits <= PtrTraits::NumLowBitsAvailable,
149                "PointerIntPair with integer size too large for pointer");
150  enum MaskAndShiftConstants : uintptr_t {
151    /// PointerBitMask - The bits that come from the pointer.
152    PointerBitMask =
153        ~(uintptr_t)(((intptr_t)1 << PtrTraits::NumLowBitsAvailable) - 1),
154 
155    /// IntShift - The number of low bits that we reserve for other uses, and
156    /// keep zero.
157    IntShift = (uintptr_t)PtrTraits::NumLowBitsAvailable - IntBits,
158 
159    /// IntMask - This is the unshifted mask for valid bits of the int type.
160    IntMask = (uintptr_t)(((intptr_t)1 << IntBits) - 1),
161 
162    // ShiftedIntMask - This is the bits for the integer shifted in place.
163    ShiftedIntMask = (uintptr_t)(IntMask << IntShift)
164  };
165 
166  static PointerT getPointer(intptr_t Value) {
167    return PtrTraits::getFromVoidPointer(
168        reinterpret_cast<void *>(Value & PointerBitMask));
169  }
170 
171  static intptr_t getInt(intptr_t Value) {
172    return (Value >> IntShift) & IntMask;
173  }
174 
175  static intptr_t updatePointer(intptr_t OrigValue, PointerT Ptr) {
176    intptr_t PtrWord =
177        reinterpret_cast<intptr_t>(PtrTraits::getAsVoidPointer(Ptr));
178    assert((PtrWord & ~PointerBitMask) == 0 &&(((PtrWord & ~PointerBitMask) == 0 && "Pointer is not sufficiently aligned"
) ? static_cast<void> (0) : __assert_fail ("(PtrWord & ~PointerBitMask) == 0 && \"Pointer is not sufficiently aligned\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include/llvm/ADT/PointerIntPair.h"
, 179, __PRETTY_FUNCTION__))
179           "Pointer is not sufficiently aligned")(((PtrWord & ~PointerBitMask) == 0 && "Pointer is not sufficiently aligned"
) ? static_cast<void> (0) : __assert_fail ("(PtrWord & ~PointerBitMask) == 0 && \"Pointer is not sufficiently aligned\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include/llvm/ADT/PointerIntPair.h"
, 179, __PRETTY_FUNCTION__));
180    // Preserve all low bits, just update the pointer.
181    return PtrWord | (OrigValue & ~PointerBitMask);
182  }
183 
184  static intptr_t updateInt(intptr_t OrigValue, intptr_t Int) {
185    intptr_t IntWord = static_cast<intptr_t>(Int);
186    assert((IntWord & ~IntMask) == 0 && "Integer too large for field")(((IntWord & ~IntMask) == 0 && "Integer too large for field"
) ? static_cast<void> (0) : __assert_fail ("(IntWord & ~IntMask) == 0 && \"Integer too large for field\""
, "/build/llvm-toolchain-snapshot-13~++20210405022414+5f57793c4fe4/llvm/include/llvm/ADT/PointerIntPair.h"
, 186, __PRETTY_FUNCTION__));
187 
188    // Preserve all bits other than the ones we are updating.
189    return (OrigValue & ~ShiftedIntMask) | IntWord << IntShift;
190  }
191};
192 
193// Provide specialization of DenseMapInfo for PointerIntPair.
194template <typename PointerTy, unsigned IntBits, typename IntType>
195struct DenseMapInfo<PointerIntPair<PointerTy, IntBits, IntType>> {
196  using Ty = PointerIntPair<PointerTy, IntBits, IntType>;
197 
198  static Ty getEmptyKey() {
199    uintptr_t Val = static_cast<uintptr_t>(-1);
200    Val <<= PointerLikeTypeTraits<Ty>::NumLowBitsAvailable;
201    return Ty::getFromOpaqueValue(reinterpret_cast<void *>(Val));
202  }
203 
204  static Ty getTombstoneKey() {
205    uintptr_t Val = static_cast<uintptr_t>(-2);
206    Val <<= PointerLikeTypeTraits<PointerTy>::NumLowBitsAvailable;
207    return Ty::getFromOpaqueValue(reinterpret_cast<void *>(Val));
208  }
209 
210  static unsigned getHashValue(Ty V) {
211    uintptr_t IV = reinterpret_cast<uintptr_t>(V.getOpaqueValue());
212    return unsigned(IV) ^ unsigned(IV >> 9);
213  }
214 
215  static bool isEqual(const Ty &LHS, const Ty &RHS) { return LHS == RHS; }
216};
217 
218// Teach SmallPtrSet that PointerIntPair is "basically a pointer".
219template <typename PointerTy, unsigned IntBits, typename IntType,
220          typename PtrTraits>
221struct PointerLikeTypeTraits<
222    PointerIntPair<PointerTy, IntBits, IntType, PtrTraits>> {
223  static inline void *
224  getAsVoidPointer(const PointerIntPair<PointerTy, IntBits, IntType> &P) {
225    return P.getOpaqueValue();
226  }
227 
228  static inline PointerIntPair<PointerTy, IntBits, IntType>
229  getFromVoidPointer(void *P) {
230    return PointerIntPair<PointerTy, IntBits, IntType>::getFromOpaqueValue(P);
231  }
232 
233  static inline PointerIntPair<PointerTy, IntBits, IntType>
234  getFromVoidPointer(const void *P) {
235    return PointerIntPair<PointerTy, IntBits, IntType>::getFromOpaqueValue(P);
236  }
237 
238  static constexpr int NumLowBitsAvailable =
239      PtrTraits::NumLowBitsAvailable - IntBits;
240};
241 
242} // end namespace llvm
243 
244#endif // LLVM_ADT_POINTERINTPAIR_H