/usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/clang/lib/Serialization/ASTReader.cpp

Bug Summary

File:	src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/clang/lib/Serialization/ASTReader.cpp
Warning:	line 4952, column 37 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name ASTReader.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 -mrelocation-model static -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/gnu/usr.bin/clang/libclangSerialization/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/clang/include -I /usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/llvm/include -I /usr/src/gnu/usr.bin/clang/libclangSerialization/../include -I /usr/src/gnu/usr.bin/clang/libclangSerialization/obj -I /usr/src/gnu/usr.bin/clang/libclangSerialization/obj/../include -D NDEBUG -D __STDC_LIMIT_MACROS -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D LLVM_PREFIX="/usr" -internal-isystem /usr/include/c++/v1 -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/usr/src/gnu/usr.bin/clang/libclangSerialization/obj -ferror-limit 19 -fvisibility-inlines-hidden -fwrapv -stack-protector 2 -fno-rtti -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c++ /usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/clang/lib/Serialization/ASTReader.cpp

/usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/clang/lib/Serialization/ASTReader.cpp

→

1//===- ASTReader.cpp - AST File Reader ------------------------------------===//
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 ASTReader class, which reads AST files.
10//
11//===----------------------------------------------------------------------===//

13#include "clang/Basic/OpenMPKinds.h"
14#include "clang/Serialization/ASTRecordReader.h"
15#include "ASTCommon.h"
16#include "ASTReaderInternals.h"
17#include "clang/AST/AbstractTypeReader.h"
18#include "clang/AST/ASTConsumer.h"
19#include "clang/AST/ASTContext.h"
20#include "clang/AST/ASTMutationListener.h"
21#include "clang/AST/ASTUnresolvedSet.h"
22#include "clang/AST/Decl.h"
23#include "clang/AST/DeclBase.h"
24#include "clang/AST/DeclCXX.h"
25#include "clang/AST/DeclFriend.h"
26#include "clang/AST/DeclGroup.h"
27#include "clang/AST/DeclObjC.h"
28#include "clang/AST/DeclTemplate.h"
29#include "clang/AST/DeclarationName.h"
30#include "clang/AST/Expr.h"
31#include "clang/AST/ExprCXX.h"
32#include "clang/AST/ExternalASTSource.h"
33#include "clang/AST/NestedNameSpecifier.h"
34#include "clang/AST/OpenMPClause.h"
35#include "clang/AST/ODRHash.h"
36#include "clang/AST/RawCommentList.h"
37#include "clang/AST/TemplateBase.h"
38#include "clang/AST/TemplateName.h"
39#include "clang/AST/Type.h"
40#include "clang/AST/TypeLoc.h"
41#include "clang/AST/TypeLocVisitor.h"
42#include "clang/AST/UnresolvedSet.h"
43#include "clang/Basic/CommentOptions.h"
44#include "clang/Basic/Diagnostic.h"
45#include "clang/Basic/DiagnosticOptions.h"
46#include "clang/Basic/ExceptionSpecificationType.h"
47#include "clang/Basic/FileManager.h"
48#include "clang/Basic/FileSystemOptions.h"
49#include "clang/Basic/IdentifierTable.h"
50#include "clang/Basic/LLVM.h"
51#include "clang/Basic/LangOptions.h"
52#include "clang/Basic/Module.h"
53#include "clang/Basic/ObjCRuntime.h"
54#include "clang/Basic/OperatorKinds.h"
55#include "clang/Basic/PragmaKinds.h"
56#include "clang/Basic/Sanitizers.h"
57#include "clang/Basic/SourceLocation.h"
58#include "clang/Basic/SourceManager.h"
59#include "clang/Basic/SourceManagerInternals.h"
60#include "clang/Basic/Specifiers.h"
61#include "clang/Basic/TargetInfo.h"
62#include "clang/Basic/TargetOptions.h"
63#include "clang/Basic/TokenKinds.h"
64#include "clang/Basic/Version.h"
65#include "clang/Lex/HeaderSearch.h"
66#include "clang/Lex/HeaderSearchOptions.h"
67#include "clang/Lex/MacroInfo.h"
68#include "clang/Lex/ModuleMap.h"
69#include "clang/Lex/PreprocessingRecord.h"
70#include "clang/Lex/Preprocessor.h"
71#include "clang/Lex/PreprocessorOptions.h"
72#include "clang/Lex/Token.h"
73#include "clang/Sema/ObjCMethodList.h"
74#include "clang/Sema/Scope.h"
75#include "clang/Sema/Sema.h"
76#include "clang/Sema/Weak.h"
77#include "clang/Serialization/ASTBitCodes.h"
78#include "clang/Serialization/ASTDeserializationListener.h"
79#include "clang/Serialization/ContinuousRangeMap.h"
80#include "clang/Serialization/GlobalModuleIndex.h"
81#include "clang/Serialization/InMemoryModuleCache.h"
82#include "clang/Serialization/ModuleFile.h"
83#include "clang/Serialization/ModuleFileExtension.h"
84#include "clang/Serialization/ModuleManager.h"
85#include "clang/Serialization/PCHContainerOperations.h"
86#include "clang/Serialization/SerializationDiagnostic.h"
87#include "llvm/ADT/APFloat.h"
88#include "llvm/ADT/APInt.h"
89#include "llvm/ADT/APSInt.h"
90#include "llvm/ADT/ArrayRef.h"
91#include "llvm/ADT/DenseMap.h"
92#include "llvm/ADT/FloatingPointMode.h"
93#include "llvm/ADT/FoldingSet.h"
94#include "llvm/ADT/Hashing.h"
95#include "llvm/ADT/IntrusiveRefCntPtr.h"
96#include "llvm/ADT/None.h"
97#include "llvm/ADT/Optional.h"
98#include "llvm/ADT/STLExtras.h"
99#include "llvm/ADT/ScopeExit.h"
100#include "llvm/ADT/SmallPtrSet.h"
101#include "llvm/ADT/SmallString.h"
102#include "llvm/ADT/SmallVector.h"
103#include "llvm/ADT/StringExtras.h"
104#include "llvm/ADT/StringMap.h"
105#include "llvm/ADT/StringRef.h"
106#include "llvm/ADT/Triple.h"
107#include "llvm/ADT/iterator_range.h"
108#include "llvm/Bitstream/BitstreamReader.h"
109#include "llvm/Support/Casting.h"
110#include "llvm/Support/Compiler.h"
111#include "llvm/Support/Compression.h"
112#include "llvm/Support/DJB.h"
113#include "llvm/Support/Endian.h"
114#include "llvm/Support/Error.h"
115#include "llvm/Support/ErrorHandling.h"
116#include "llvm/Support/FileSystem.h"
117#include "llvm/Support/LEB128.h"
118#include "llvm/Support/MemoryBuffer.h"
119#include "llvm/Support/Path.h"
120#include "llvm/Support/SaveAndRestore.h"
121#include "llvm/Support/Timer.h"
122#include "llvm/Support/VersionTuple.h"
123#include "llvm/Support/raw_ostream.h"
124#include <algorithm>
125#include <cassert>
126#include <cstddef>
127#include <cstdint>
128#include <cstdio>
129#include <ctime>
130#include <iterator>
131#include <limits>
132#include <map>
133#include <memory>
134#include <string>
135#include <system_error>
136#include <tuple>
137#include <utility>
138#include <vector>

140using namespace clang;
141using namespace clang::serialization;
142using namespace clang::serialization::reader;
143using llvm::BitstreamCursor;
144using llvm::RoundingMode;

146//===----------------------------------------------------------------------===//
147// ChainedASTReaderListener implementation
148//===----------------------------------------------------------------------===//

150bool
151ChainedASTReaderListener::ReadFullVersionInformation(StringRef FullVersion) {
return First->ReadFullVersionInformation(FullVersion) ||
       Second->ReadFullVersionInformation(FullVersion);
154}

156void ChainedASTReaderListener::ReadModuleName(StringRef ModuleName) {
First->ReadModuleName(ModuleName);
Second->ReadModuleName(ModuleName);
159}

161void ChainedASTReaderListener::ReadModuleMapFile(StringRef ModuleMapPath) {
First->ReadModuleMapFile(ModuleMapPath);
Second->ReadModuleMapFile(ModuleMapPath);
164}

166bool
167ChainedASTReaderListener::ReadLanguageOptions(const LangOptions &LangOpts,
                                            bool Complain,
                                            bool AllowCompatibleDifferences) {
return First->ReadLanguageOptions(LangOpts, Complain,
                                  AllowCompatibleDifferences) ||
       Second->ReadLanguageOptions(LangOpts, Complain,
                                   AllowCompatibleDifferences);
174}

176bool ChainedASTReaderListener::ReadTargetOptions(
  const TargetOptions &TargetOpts, bool Complain,
  bool AllowCompatibleDifferences) {
return First->ReadTargetOptions(TargetOpts, Complain,
                                AllowCompatibleDifferences) ||
       Second->ReadTargetOptions(TargetOpts, Complain,
                                 AllowCompatibleDifferences);
183}

185bool ChainedASTReaderListener::ReadDiagnosticOptions(
  IntrusiveRefCntPtr<DiagnosticOptions> DiagOpts, bool Complain) {
return First->ReadDiagnosticOptions(DiagOpts, Complain) ||
       Second->ReadDiagnosticOptions(DiagOpts, Complain);
189}

191bool
192ChainedASTReaderListener::ReadFileSystemOptions(const FileSystemOptions &FSOpts,
                                              bool Complain) {
return First->ReadFileSystemOptions(FSOpts, Complain) ||
       Second->ReadFileSystemOptions(FSOpts, Complain);
196}

198bool ChainedASTReaderListener::ReadHeaderSearchOptions(
  const HeaderSearchOptions &HSOpts, StringRef SpecificModuleCachePath,
  bool Complain) {
return First->ReadHeaderSearchOptions(HSOpts, SpecificModuleCachePath,
                                      Complain) ||
       Second->ReadHeaderSearchOptions(HSOpts, SpecificModuleCachePath,
                                       Complain);
205}

207bool ChainedASTReaderListener::ReadPreprocessorOptions(
  const PreprocessorOptions &PPOpts, bool Complain,
  std::string &SuggestedPredefines) {
return First->ReadPreprocessorOptions(PPOpts, Complain,
                                      SuggestedPredefines) ||
       Second->ReadPreprocessorOptions(PPOpts, Complain, SuggestedPredefines);
213}

215void ChainedASTReaderListener::ReadCounter(const serialization::ModuleFile &M,
                                         unsigned Value) {
First->ReadCounter(M, Value);
Second->ReadCounter(M, Value);
219}

221bool ChainedASTReaderListener::needsInputFileVisitation() {
return First->needsInputFileVisitation() ||
       Second->needsInputFileVisitation();
224}

226bool ChainedASTReaderListener::needsSystemInputFileVisitation() {
return First->needsSystemInputFileVisitation() ||
Second->needsSystemInputFileVisitation();
229}

231void ChainedASTReaderListener::visitModuleFile(StringRef Filename,
                                             ModuleKind Kind) {
First->visitModuleFile(Filename, Kind);
Second->visitModuleFile(Filename, Kind);
235}

237bool ChainedASTReaderListener::visitInputFile(StringRef Filename,
                                            bool isSystem,
                                            bool isOverridden,
                                            bool isExplicitModule) {
bool Continue = false;
if (First->needsInputFileVisitation() &&
    (!isSystem || First->needsSystemInputFileVisitation()))
  Continue |= First->visitInputFile(Filename, isSystem, isOverridden,
                                    isExplicitModule);
if (Second->needsInputFileVisitation() &&
    (!isSystem || Second->needsSystemInputFileVisitation()))
  Continue |= Second->visitInputFile(Filename, isSystem, isOverridden,
                                     isExplicitModule);
return Continue;
251}

253void ChainedASTReaderListener::readModuleFileExtension(
     const ModuleFileExtensionMetadata &Metadata) {
First->readModuleFileExtension(Metadata);
Second->readModuleFileExtension(Metadata);
257}

259//===----------------------------------------------------------------------===//
260// PCH validator implementation
261//===----------------------------------------------------------------------===//

263ASTReaderListener::~ASTReaderListener() = default;

265/// Compare the given set of language options against an existing set of
266/// language options.
267///
268/// \param Diags If non-NULL, diagnostics will be emitted via this engine.
269/// \param AllowCompatibleDifferences If true, differences between compatible
270///        language options will be permitted.
271///
272/// \returns true if the languagae options mis-match, false otherwise.
273static bool checkLanguageOptions(const LangOptions &LangOpts,
                               const LangOptions &ExistingLangOpts,
                               DiagnosticsEngine *Diags,
                               bool AllowCompatibleDifferences = true) {
277#define LANGOPT(Name, Bits, Default, Description)                 \
if (ExistingLangOpts.Name != LangOpts.Name) {                   \
  if (Diags)                                                    \
    Diags->Report(diag::err_pch_langopt_mismatch)               \
      << Description << LangOpts.Name << ExistingLangOpts.Name; \
  return true;                                                  \
}

285#define VALUE_LANGOPT(Name, Bits, Default, Description)   \
if (ExistingLangOpts.Name != LangOpts.Name) {           \
  if (Diags)                                            \
    Diags->Report(diag::err_pch_langopt_value_mismatch) \
      << Description;                                   \
  return true;                                          \
}

293#define ENUM_LANGOPT(Name, Type, Bits, Default, Description)   \
if (ExistingLangOpts.get##Name() != LangOpts.get##Name()) {  \
  if (Diags)                                                 \
    Diags->Report(diag::err_pch_langopt_value_mismatch)      \
      << Description;                                        \
  return true;                                               \
}

301#define COMPATIBLE_LANGOPT(Name, Bits, Default, Description)  \
if (!AllowCompatibleDifferences)                            \
  LANGOPT(Name, Bits, Default, Description)

305#define COMPATIBLE_ENUM_LANGOPT(Name, Bits, Default, Description)  \
if (!AllowCompatibleDifferences)                                 \
  ENUM_LANGOPT(Name, Bits, Default, Description)

309#define COMPATIBLE_VALUE_LANGOPT(Name, Bits, Default, Description) \
if (!AllowCompatibleDifferences)                                 \
  VALUE_LANGOPT(Name, Bits, Default, Description)

313#define BENIGN_LANGOPT(Name, Bits, Default, Description)
314#define BENIGN_ENUM_LANGOPT(Name, Type, Bits, Default, Description)
315#define BENIGN_VALUE_LANGOPT(Name, Type, Bits, Default, Description)
316#include "clang/Basic/LangOptions.def"

if (ExistingLangOpts.ModuleFeatures != LangOpts.ModuleFeatures) {
  if (Diags)
    Diags->Report(diag::err_pch_langopt_value_mismatch) << "module features";
  return true;
}

if (ExistingLangOpts.ObjCRuntime != LangOpts.ObjCRuntime) {
  if (Diags)
    Diags->Report(diag::err_pch_langopt_value_mismatch)
    << "target Objective-C runtime";
  return true;
}

if (ExistingLangOpts.CommentOpts.BlockCommandNames !=
    LangOpts.CommentOpts.BlockCommandNames) {
  if (Diags)
    Diags->Report(diag::err_pch_langopt_value_mismatch)
      << "block command names";
  return true;
}

// Sanitizer feature mismatches are treated as compatible differences. If
// compatible differences aren't allowed, we still only want to check for
// mismatches of non-modular sanitizers (the only ones which can affect AST
// generation).
if (!AllowCompatibleDifferences) {
  SanitizerMask ModularSanitizers = getPPTransparentSanitizers();
  SanitizerSet ExistingSanitizers = ExistingLangOpts.Sanitize;
  SanitizerSet ImportedSanitizers = LangOpts.Sanitize;
  ExistingSanitizers.clear(ModularSanitizers);
  ImportedSanitizers.clear(ModularSanitizers);
  if (ExistingSanitizers.Mask != ImportedSanitizers.Mask) {
    const std::string Flag = "-fsanitize=";
    if (Diags) {
352#define SANITIZER(NAME, ID)                                                    \
{                                                                            \
  bool InExistingModule = ExistingSanitizers.has(SanitizerKind::ID);         \
  bool InImportedModule = ImportedSanitizers.has(SanitizerKind::ID);         \
  if (InExistingModule != InImportedModule)                                  \
    Diags->Report(diag::err_pch_targetopt_feature_mismatch)                  \
        << InExistingModule << (Flag + NAME);                                \
}
360#include "clang/Basic/Sanitizers.def"
    }
    return true;
  }
}

return false;
367}

369/// Compare the given set of target options against an existing set of
370/// target options.
371///
372/// \param Diags If non-NULL, diagnostics will be emitted via this engine.
373///
374/// \returns true if the target options mis-match, false otherwise.
375static bool checkTargetOptions(const TargetOptions &TargetOpts,
                             const TargetOptions &ExistingTargetOpts,
                             DiagnosticsEngine *Diags,
                             bool AllowCompatibleDifferences = true) {
379#define CHECK_TARGET_OPT(Field, Name)                             \
if (TargetOpts.Field != ExistingTargetOpts.Field) {             \
  if (Diags)                                                    \
    Diags->Report(diag::err_pch_targetopt_mismatch)             \
      << Name << TargetOpts.Field << ExistingTargetOpts.Field;  \
  return true;                                                  \
}

// The triple and ABI must match exactly.
CHECK_TARGET_OPT(Triple, "target");
CHECK_TARGET_OPT(ABI, "target ABI");

// We can tolerate different CPUs in many cases, notably when one CPU
// supports a strict superset of another. When allowing compatible
// differences skip this check.
if (!AllowCompatibleDifferences) {
  CHECK_TARGET_OPT(CPU, "target CPU");
  CHECK_TARGET_OPT(TuneCPU, "tune CPU");
}

399#undef CHECK_TARGET_OPT

// Compare feature sets.
SmallVector<StringRef, 4> ExistingFeatures(
                                           ExistingTargetOpts.FeaturesAsWritten.begin(),
                                           ExistingTargetOpts.FeaturesAsWritten.end());
SmallVector<StringRef, 4> ReadFeatures(TargetOpts.FeaturesAsWritten.begin(),
                                       TargetOpts.FeaturesAsWritten.end());
llvm::sort(ExistingFeatures);
llvm::sort(ReadFeatures);

// We compute the set difference in both directions explicitly so that we can
// diagnose the differences differently.
SmallVector<StringRef, 4> UnmatchedExistingFeatures, UnmatchedReadFeatures;
std::set_difference(
    ExistingFeatures.begin(), ExistingFeatures.end(), ReadFeatures.begin(),
    ReadFeatures.end(), std::back_inserter(UnmatchedExistingFeatures));
std::set_difference(ReadFeatures.begin(), ReadFeatures.end(),
                    ExistingFeatures.begin(), ExistingFeatures.end(),
                    std::back_inserter(UnmatchedReadFeatures));

// If we are allowing compatible differences and the read feature set is
// a strict subset of the existing feature set, there is nothing to diagnose.
if (AllowCompatibleDifferences && UnmatchedReadFeatures.empty())
  return false;

if (Diags) {
  for (StringRef Feature : UnmatchedReadFeatures)
    Diags->Report(diag::err_pch_targetopt_feature_mismatch)
        << /* is-existing-feature */ false << Feature;
  for (StringRef Feature : UnmatchedExistingFeatures)
    Diags->Report(diag::err_pch_targetopt_feature_mismatch)
        << /* is-existing-feature */ true << Feature;
}

return !UnmatchedReadFeatures.empty() || !UnmatchedExistingFeatures.empty();
435}

437bool
438PCHValidator::ReadLanguageOptions(const LangOptions &LangOpts,
                                bool Complain,
                                bool AllowCompatibleDifferences) {
const LangOptions &ExistingLangOpts = PP.getLangOpts();
return checkLanguageOptions(LangOpts, ExistingLangOpts,
                            Complain ? &Reader.Diags : nullptr,
                            AllowCompatibleDifferences);
445}

447bool PCHValidator::ReadTargetOptions(const TargetOptions &TargetOpts,
                                   bool Complain,
                                   bool AllowCompatibleDifferences) {
const TargetOptions &ExistingTargetOpts = PP.getTargetInfo().getTargetOpts();
return checkTargetOptions(TargetOpts, ExistingTargetOpts,
                          Complain ? &Reader.Diags : nullptr,
                          AllowCompatibleDifferences);
454}

456namespace {

458using MacroDefinitionsMap =
  llvm::StringMap<std::pair<StringRef, bool /*IsUndef*/>>;
460using DeclsMap = llvm::DenseMap<DeclarationName, SmallVector<NamedDecl *, 8>>;

462} // namespace

464static bool checkDiagnosticGroupMappings(DiagnosticsEngine &StoredDiags,
                                       DiagnosticsEngine &Diags,
                                       bool Complain) {
using Level = DiagnosticsEngine::Level;

// Check current mappings for new -Werror mappings, and the stored mappings
// for cases that were explicitly mapped to *not* be errors that are now
// errors because of options like -Werror.
DiagnosticsEngine *MappingSources[] = { &Diags, &StoredDiags };

for (DiagnosticsEngine *MappingSource : MappingSources) {
  for (auto DiagIDMappingPair : MappingSource->getDiagnosticMappings()) {
    diag::kind DiagID = DiagIDMappingPair.first;
    Level CurLevel = Diags.getDiagnosticLevel(DiagID, SourceLocation());
    if (CurLevel < DiagnosticsEngine::Error)
      continue; // not significant
    Level StoredLevel =
        StoredDiags.getDiagnosticLevel(DiagID, SourceLocation());
    if (StoredLevel < DiagnosticsEngine::Error) {
      if (Complain)
        Diags.Report(diag::err_pch_diagopt_mismatch) << "-Werror=" +
            Diags.getDiagnosticIDs()->getWarningOptionForDiag(DiagID).str();
      return true;
    }
  }
}

return false;
492}

494static bool isExtHandlingFromDiagsError(DiagnosticsEngine &Diags) {
diag::Severity Ext = Diags.getExtensionHandlingBehavior();
if (Ext == diag::Severity::Warning && Diags.getWarningsAsErrors())
  return true;
return Ext >= diag::Severity::Error;
499}

501static bool checkDiagnosticMappings(DiagnosticsEngine &StoredDiags,
                                  DiagnosticsEngine &Diags,
                                  bool IsSystem, bool Complain) {
// Top-level options
if (IsSystem) {
  if (Diags.getSuppressSystemWarnings())
    return false;
  // If -Wsystem-headers was not enabled before, be conservative
  if (StoredDiags.getSuppressSystemWarnings()) {
    if (Complain)
      Diags.Report(diag::err_pch_diagopt_mismatch) << "-Wsystem-headers";
    return true;
  }
}

if (Diags.getWarningsAsErrors() && !StoredDiags.getWarningsAsErrors()) {
  if (Complain)
    Diags.Report(diag::err_pch_diagopt_mismatch) << "-Werror";
  return true;
}

if (Diags.getWarningsAsErrors() && Diags.getEnableAllWarnings() &&
    !StoredDiags.getEnableAllWarnings()) {
  if (Complain)
    Diags.Report(diag::err_pch_diagopt_mismatch) << "-Weverything -Werror";
  return true;
}

if (isExtHandlingFromDiagsError(Diags) &&
    !isExtHandlingFromDiagsError(StoredDiags)) {
  if (Complain)
    Diags.Report(diag::err_pch_diagopt_mismatch) << "-pedantic-errors";
  return true;
}

return checkDiagnosticGroupMappings(StoredDiags, Diags, Complain);
537}

539/// Return the top import module if it is implicit, nullptr otherwise.
540static Module *getTopImportImplicitModule(ModuleManager &ModuleMgr,
                                        Preprocessor &PP) {
// If the original import came from a file explicitly generated by the user,
// don't check the diagnostic mappings.
// FIXME: currently this is approximated by checking whether this is not a
// module import of an implicitly-loaded module file.
// Note: ModuleMgr.rbegin() may not be the current module, but it must be in
// the transitive closure of its imports, since unrelated modules cannot be
// imported until after this module finishes validation.
ModuleFile *TopImport = &*ModuleMgr.rbegin();
while (!TopImport->ImportedBy.empty())
  TopImport = TopImport->ImportedBy[0];
if (TopImport->Kind != MK_ImplicitModule)
  return nullptr;

StringRef ModuleName = TopImport->ModuleName;
assert(!ModuleName.empty() && "diagnostic options read before module name")((void)0);

Module *M = PP.getHeaderSearchInfo().lookupModule(ModuleName);
assert(M && "missing module")((void)0);
return M;
561}

563bool PCHValidator::ReadDiagnosticOptions(
  IntrusiveRefCntPtr<DiagnosticOptions> DiagOpts, bool Complain) {
DiagnosticsEngine &ExistingDiags = PP.getDiagnostics();
IntrusiveRefCntPtr<DiagnosticIDs> DiagIDs(ExistingDiags.getDiagnosticIDs());
IntrusiveRefCntPtr<DiagnosticsEngine> Diags(
    new DiagnosticsEngine(DiagIDs, DiagOpts.get()));
// This should never fail, because we would have processed these options
// before writing them to an ASTFile.
ProcessWarningOptions(*Diags, *DiagOpts, /*Report*/false);

ModuleManager &ModuleMgr = Reader.getModuleManager();
assert(ModuleMgr.size() >= 1 && "what ASTFile is this then")((void)0);

Module *TopM = getTopImportImplicitModule(ModuleMgr, PP);
if (!TopM)
  return false;

// FIXME: if the diagnostics are incompatible, save a DiagnosticOptions that
// contains the union of their flags.
return checkDiagnosticMappings(*Diags, ExistingDiags, TopM->IsSystem,
                               Complain);
584}

586/// Collect the macro definitions provided by the given preprocessor
587/// options.
588static void
589collectMacroDefinitions(const PreprocessorOptions &PPOpts,
                      MacroDefinitionsMap &Macros,
                      SmallVectorImpl<StringRef> *MacroNames = nullptr) {
for (unsigned I = 0, N = PPOpts.Macros.size(); I != N; ++I) {
  StringRef Macro = PPOpts.Macros[I].first;
  bool IsUndef = PPOpts.Macros[I].second;

  std::pair<StringRef, StringRef> MacroPair = Macro.split('=');
  StringRef MacroName = MacroPair.first;
  StringRef MacroBody = MacroPair.second;

  // For an #undef'd macro, we only care about the name.
  if (IsUndef) {
    if (MacroNames && !Macros.count(MacroName))
      MacroNames->push_back(MacroName);

    Macros[MacroName] = std::make_pair("", true);
    continue;
  }

  // For a #define'd macro, figure out the actual definition.
  if (MacroName.size() == Macro.size())
    MacroBody = "1";
  else {
    // Note: GCC drops anything following an end-of-line character.
    StringRef::size_type End = MacroBody.find_first_of("\n\r");
    MacroBody = MacroBody.substr(0, End);
  }

  if (MacroNames && !Macros.count(MacroName))
    MacroNames->push_back(MacroName);
  Macros[MacroName] = std::make_pair(MacroBody, false);
}
622}

624/// Check the preprocessor options deserialized from the control block
625/// against the preprocessor options in an existing preprocessor.
626///
627/// \param Diags If non-null, produce diagnostics for any mismatches incurred.
628/// \param Validate If true, validate preprocessor options. If false, allow
629///        macros defined by \p ExistingPPOpts to override those defined by
630///        \p PPOpts in SuggestedPredefines.
631static bool checkPreprocessorOptions(const PreprocessorOptions &PPOpts,
                                   const PreprocessorOptions &ExistingPPOpts,
                                   DiagnosticsEngine *Diags,
                                   FileManager &FileMgr,
                                   std::string &SuggestedPredefines,
                                   const LangOptions &LangOpts,
                                   bool Validate = true) {
// Check macro definitions.
MacroDefinitionsMap ASTFileMacros;
collectMacroDefinitions(PPOpts, ASTFileMacros);
MacroDefinitionsMap ExistingMacros;
SmallVector<StringRef, 4> ExistingMacroNames;
collectMacroDefinitions(ExistingPPOpts, ExistingMacros, &ExistingMacroNames);

for (unsigned I = 0, N = ExistingMacroNames.size(); I != N; ++I) {
  // Dig out the macro definition in the existing preprocessor options.
  StringRef MacroName = ExistingMacroNames[I];
  std::pair<StringRef, bool> Existing = ExistingMacros[MacroName];

  // Check whether we know anything about this macro name or not.
  llvm::StringMap<std::pair<StringRef, bool /*IsUndef*/>>::iterator Known =
      ASTFileMacros.find(MacroName);
  if (!Validate || Known == ASTFileMacros.end()) {
    // FIXME: Check whether this identifier was referenced anywhere in the
    // AST file. If so, we should reject the AST file. Unfortunately, this
    // information isn't in the control block. What shall we do about it?

    if (Existing.second) {
      SuggestedPredefines += "#undef ";
      SuggestedPredefines += MacroName.str();
      SuggestedPredefines += '\n';
    } else {
      SuggestedPredefines += "#define ";
      SuggestedPredefines += MacroName.str();
      SuggestedPredefines += ' ';
      SuggestedPredefines += Existing.first.str();
      SuggestedPredefines += '\n';
    }
    continue;
  }

  // If the macro was defined in one but undef'd in the other, we have a
  // conflict.
  if (Existing.second != Known->second.second) {
    if (Diags) {
      Diags->Report(diag::err_pch_macro_def_undef)
        << MacroName << Known->second.second;
    }
    return true;
  }

  // If the macro was #undef'd in both, or if the macro bodies are identical,
  // it's fine.
  if (Existing.second || Existing.first == Known->second.first)
    continue;

  // The macro bodies differ; complain.
  if (Diags) {
    Diags->Report(diag::err_pch_macro_def_conflict)
      << MacroName << Known->second.first << Existing.first;
  }
  return true;
}

// Check whether we're using predefines.
if (PPOpts.UsePredefines != ExistingPPOpts.UsePredefines && Validate) {
  if (Diags) {
    Diags->Report(diag::err_pch_undef) << ExistingPPOpts.UsePredefines;
  }
  return true;
}

// Detailed record is important since it is used for the module cache hash.
if (LangOpts.Modules &&
    PPOpts.DetailedRecord != ExistingPPOpts.DetailedRecord && Validate) {
  if (Diags) {
    Diags->Report(diag::err_pch_pp_detailed_record) << PPOpts.DetailedRecord;
  }
  return true;
}

// Compute the #include and #include_macros lines we need.
for (unsigned I = 0, N = ExistingPPOpts.Includes.size(); I != N; ++I) {
  StringRef File = ExistingPPOpts.Includes[I];

  if (!ExistingPPOpts.ImplicitPCHInclude.empty() &&
      !ExistingPPOpts.PCHThroughHeader.empty()) {
    // In case the through header is an include, we must add all the includes
    // to the predefines so the start point can be determined.
    SuggestedPredefines += "#include \"";
    SuggestedPredefines += File;
    SuggestedPredefines += "\"\n";
    continue;
  }

  if (File == ExistingPPOpts.ImplicitPCHInclude)
    continue;

  if (std::find(PPOpts.Includes.begin(), PPOpts.Includes.end(), File)
        != PPOpts.Includes.end())
    continue;

  SuggestedPredefines += "#include \"";
  SuggestedPredefines += File;
  SuggestedPredefines += "\"\n";
}

for (unsigned I = 0, N = ExistingPPOpts.MacroIncludes.size(); I != N; ++I) {
  StringRef File = ExistingPPOpts.MacroIncludes[I];
  if (std::find(PPOpts.MacroIncludes.begin(), PPOpts.MacroIncludes.end(),
                File)
      != PPOpts.MacroIncludes.end())
    continue;

  SuggestedPredefines += "#__include_macros \"";
  SuggestedPredefines += File;
  SuggestedPredefines += "\"\n##\n";
}

return false;
751}

753bool PCHValidator::ReadPreprocessorOptions(const PreprocessorOptions &PPOpts,
                                         bool Complain,
                                         std::string &SuggestedPredefines) {
const PreprocessorOptions &ExistingPPOpts = PP.getPreprocessorOpts();

return checkPreprocessorOptions(PPOpts, ExistingPPOpts,
                                Complain? &Reader.Diags : nullptr,
                                PP.getFileManager(),
                                SuggestedPredefines,
                                PP.getLangOpts());
763}

765bool SimpleASTReaderListener::ReadPreprocessorOptions(
                                const PreprocessorOptions &PPOpts,
                                bool Complain,
                                std::string &SuggestedPredefines) {
return checkPreprocessorOptions(PPOpts,
                                PP.getPreprocessorOpts(),
                                nullptr,
                                PP.getFileManager(),
                                SuggestedPredefines,
                                PP.getLangOpts(),
                                false);
776}

778/// Check the header search options deserialized from the control block
779/// against the header search options in an existing preprocessor.
780///
781/// \param Diags If non-null, produce diagnostics for any mismatches incurred.
782static bool checkHeaderSearchOptions(const HeaderSearchOptions &HSOpts,
                                   StringRef SpecificModuleCachePath,
                                   StringRef ExistingModuleCachePath,
                                   DiagnosticsEngine *Diags,
                                   const LangOptions &LangOpts,
                                   const PreprocessorOptions &PPOpts) {
if (LangOpts.Modules) {
  if (SpecificModuleCachePath != ExistingModuleCachePath &&
      !PPOpts.AllowPCHWithDifferentModulesCachePath) {
    if (Diags)
      Diags->Report(diag::err_pch_modulecache_mismatch)
        << SpecificModuleCachePath << ExistingModuleCachePath;
    return true;
  }
}

return false;
799}

801bool PCHValidator::ReadHeaderSearchOptions(const HeaderSearchOptions &HSOpts,
                                         StringRef SpecificModuleCachePath,
                                         bool Complain) {
return checkHeaderSearchOptions(HSOpts, SpecificModuleCachePath,
                                PP.getHeaderSearchInfo().getModuleCachePath(),
                                Complain ? &Reader.Diags : nullptr,
                                PP.getLangOpts(), PP.getPreprocessorOpts());
808}

810void PCHValidator::ReadCounter(const ModuleFile &M, unsigned Value) {
PP.setCounterValue(Value);
812}

814//===----------------------------------------------------------------------===//
815// AST reader implementation
816//===----------------------------------------------------------------------===//

818static uint64_t readULEB(const unsigned char *&P) {
unsigned Length = 0;
const char *Error = nullptr;

uint64_t Val = llvm::decodeULEB128(P, &Length, nullptr, &Error);
if (Error)
  llvm::report_fatal_error(Error);
P += Length;
return Val;
827}

829/// Read ULEB-encoded key length and data length.
830static std::pair<unsigned, unsigned>
831readULEBKeyDataLength(const unsigned char *&P) {
unsigned KeyLen = readULEB(P);
if ((unsigned)KeyLen != KeyLen)
  llvm::report_fatal_error("key too large");

unsigned DataLen = readULEB(P);
if ((unsigned)DataLen != DataLen)
  llvm::report_fatal_error("data too large");

return std::make_pair(KeyLen, DataLen);
841}

843void ASTReader::setDeserializationListener(ASTDeserializationListener *Listener,
                                         bool TakeOwnership) {
DeserializationListener = Listener;
OwnsDeserializationListener = TakeOwnership;
847}

849unsigned ASTSelectorLookupTrait::ComputeHash(Selector Sel) {
return serialization::ComputeHash(Sel);
851}

853std::pair<unsigned, unsigned>
854ASTSelectorLookupTrait::ReadKeyDataLength(const unsigned char*& d) {
return readULEBKeyDataLength(d);
856}

858ASTSelectorLookupTrait::internal_key_type
859ASTSelectorLookupTrait::ReadKey(const unsigned char* d, unsigned) {
using namespace llvm::support;

SelectorTable &SelTable = Reader.getContext().Selectors;
unsigned N = endian::readNext<uint16_t, little, unaligned>(d);
IdentifierInfo *FirstII = Reader.getLocalIdentifier(
    F, endian::readNext<uint32_t, little, unaligned>(d));
if (N == 0)
  return SelTable.getNullarySelector(FirstII);
else if (N == 1)
  return SelTable.getUnarySelector(FirstII);

SmallVector<IdentifierInfo *, 16> Args;
Args.push_back(FirstII);
for (unsigned I = 1; I != N; ++I)
  Args.push_back(Reader.getLocalIdentifier(
      F, endian::readNext<uint32_t, little, unaligned>(d)));

return SelTable.getSelector(N, Args.data());
878}

880ASTSelectorLookupTrait::data_type
881ASTSelectorLookupTrait::ReadData(Selector, const unsigned char* d,
                               unsigned DataLen) {
using namespace llvm::support;

data_type Result;

Result.ID = Reader.getGlobalSelectorID(
    F, endian::readNext<uint32_t, little, unaligned>(d));
unsigned FullInstanceBits = endian::readNext<uint16_t, little, unaligned>(d);
unsigned FullFactoryBits = endian::readNext<uint16_t, little, unaligned>(d);
Result.InstanceBits = FullInstanceBits & 0x3;
Result.InstanceHasMoreThanOneDecl = (FullInstanceBits >> 2) & 0x1;
Result.FactoryBits = FullFactoryBits & 0x3;
Result.FactoryHasMoreThanOneDecl = (FullFactoryBits >> 2) & 0x1;
unsigned NumInstanceMethods = FullInstanceBits >> 3;
unsigned NumFactoryMethods = FullFactoryBits >> 3;

// Load instance methods
for (unsigned I = 0; I != NumInstanceMethods; ++I) {
  if (ObjCMethodDecl *Method = Reader.GetLocalDeclAs<ObjCMethodDecl>(
          F, endian::readNext<uint32_t, little, unaligned>(d)))
    Result.Instance.push_back(Method);
}

// Load factory methods
for (unsigned I = 0; I != NumFactoryMethods; ++I) {
  if (ObjCMethodDecl *Method = Reader.GetLocalDeclAs<ObjCMethodDecl>(
          F, endian::readNext<uint32_t, little, unaligned>(d)))
    Result.Factory.push_back(Method);
}

return Result;
913}

915unsigned ASTIdentifierLookupTraitBase::ComputeHash(const internal_key_type& a) {
return llvm::djbHash(a);
917}

919std::pair<unsigned, unsigned>
920ASTIdentifierLookupTraitBase::ReadKeyDataLength(const unsigned char*& d) {
return readULEBKeyDataLength(d);
922}

924ASTIdentifierLookupTraitBase::internal_key_type
925ASTIdentifierLookupTraitBase::ReadKey(const unsigned char* d, unsigned n) {
assert(n >= 2 && d[n-1] == '\0')((void)0);
return StringRef((const char*) d, n-1);
928}

930/// Whether the given identifier is "interesting".
931static bool isInterestingIdentifier(ASTReader &Reader, IdentifierInfo &II,
                                  bool IsModule) {
return II.hadMacroDefinition() || II.isPoisoned() ||
       (!IsModule && II.getObjCOrBuiltinID()) ||
       II.hasRevertedTokenIDToIdentifier() ||
       (!(IsModule && Reader.getPreprocessor().getLangOpts().CPlusPlus) &&
        II.getFETokenInfo());
938}

940static bool readBit(unsigned &Bits) {
bool Value = Bits & 0x1;
Bits >>= 1;
return Value;
944}

946IdentID ASTIdentifierLookupTrait::ReadIdentifierID(const unsigned char *d) {
using namespace llvm::support;

unsigned RawID = endian::readNext<uint32_t, little, unaligned>(d);
return Reader.getGlobalIdentifierID(F, RawID >> 1);
951}

953static void markIdentifierFromAST(ASTReader &Reader, IdentifierInfo &II) {
if (!II.isFromAST()) {
  II.setIsFromAST();
  bool IsModule = Reader.getPreprocessor().getCurrentModule() != nullptr;
  if (isInterestingIdentifier(Reader, II, IsModule))
    II.setChangedSinceDeserialization();
}
960}

962IdentifierInfo *ASTIdentifierLookupTrait::ReadData(const internal_key_type& k,
                                                 const unsigned char* d,
                                                 unsigned DataLen) {
using namespace llvm::support;

unsigned RawID = endian::readNext<uint32_t, little, unaligned>(d);
bool IsInteresting = RawID & 0x01;

// Wipe out the "is interesting" bit.
RawID = RawID >> 1;

// Build the IdentifierInfo and link the identifier ID with it.
IdentifierInfo *II = KnownII;
if (!II) {
  II = &Reader.getIdentifierTable().getOwn(k);
  KnownII = II;
}
markIdentifierFromAST(Reader, *II);
Reader.markIdentifierUpToDate(II);

IdentID ID = Reader.getGlobalIdentifierID(F, RawID);
if (!IsInteresting) {
  // For uninteresting identifiers, there's nothing else to do. Just notify
  // the reader that we've finished loading this identifier.
  Reader.SetIdentifierInfo(ID, II);
  return II;
}

unsigned ObjCOrBuiltinID = endian::readNext<uint16_t, little, unaligned>(d);
unsigned Bits = endian::readNext<uint16_t, little, unaligned>(d);
bool CPlusPlusOperatorKeyword = readBit(Bits);
bool HasRevertedTokenIDToIdentifier = readBit(Bits);
bool Poisoned = readBit(Bits);
bool ExtensionToken = readBit(Bits);
bool HadMacroDefinition = readBit(Bits);

assert(Bits == 0 && "Extra bits in the identifier?")((void)0);
DataLen -= 8;

// Set or check the various bits in the IdentifierInfo structure.
// Token IDs are read-only.
if (HasRevertedTokenIDToIdentifier && II->getTokenID() != tok::identifier)
  II->revertTokenIDToIdentifier();
if (!F.isModule())
  II->setObjCOrBuiltinID(ObjCOrBuiltinID);
assert(II->isExtensionToken() == ExtensionToken &&((void)0)
       "Incorrect extension token flag")((void)0);
(void)ExtensionToken;
if (Poisoned)
  II->setIsPoisoned(true);
assert(II->isCPlusPlusOperatorKeyword() == CPlusPlusOperatorKeyword &&((void)0)
       "Incorrect C++ operator keyword flag")((void)0);
(void)CPlusPlusOperatorKeyword;

// If this identifier is a macro, deserialize the macro
// definition.
if (HadMacroDefinition) {
  uint32_t MacroDirectivesOffset =
      endian::readNext<uint32_t, little, unaligned>(d);
  DataLen -= 4;

  Reader.addPendingMacro(II, &F, MacroDirectivesOffset);
}

Reader.SetIdentifierInfo(ID, II);

// Read all of the declarations visible at global scope with this
// name.
if (DataLen > 0) {
  SmallVector<uint32_t, 4> DeclIDs;
  for (; DataLen > 0; DataLen -= 4)
    DeclIDs.push_back(Reader.getGlobalDeclID(
        F, endian::readNext<uint32_t, little, unaligned>(d)));
  Reader.SetGloballyVisibleDecls(II, DeclIDs);
}

return II;
1039}

1041DeclarationNameKey::DeclarationNameKey(DeclarationName Name)
  : Kind(Name.getNameKind()) {
switch (Kind) {
case DeclarationName::Identifier:
  Data = (uint64_t)Name.getAsIdentifierInfo();
  break;
case DeclarationName::ObjCZeroArgSelector:
case DeclarationName::ObjCOneArgSelector:
case DeclarationName::ObjCMultiArgSelector:
  Data = (uint64_t)Name.getObjCSelector().getAsOpaquePtr();
  break;
case DeclarationName::CXXOperatorName:
  Data = Name.getCXXOverloadedOperator();
  break;
case DeclarationName::CXXLiteralOperatorName:
  Data = (uint64_t)Name.getCXXLiteralIdentifier();
  break;
case DeclarationName::CXXDeductionGuideName:
  Data = (uint64_t)Name.getCXXDeductionGuideTemplate()
             ->getDeclName().getAsIdentifierInfo();
  break;
case DeclarationName::CXXConstructorName:
case DeclarationName::CXXDestructorName:
case DeclarationName::CXXConversionFunctionName:
case DeclarationName::CXXUsingDirective:
  Data = 0;
  break;
}
1069}

1071unsigned DeclarationNameKey::getHash() const {
llvm::FoldingSetNodeID ID;
ID.AddInteger(Kind);

switch (Kind) {
case DeclarationName::Identifier:
case DeclarationName::CXXLiteralOperatorName:
case DeclarationName::CXXDeductionGuideName:
  ID.AddString(((IdentifierInfo*)Data)->getName());
  break;
case DeclarationName::ObjCZeroArgSelector:
case DeclarationName::ObjCOneArgSelector:
case DeclarationName::ObjCMultiArgSelector:
  ID.AddInteger(serialization::ComputeHash(Selector(Data)));
  break;
case DeclarationName::CXXOperatorName:
  ID.AddInteger((OverloadedOperatorKind)Data);
  break;
case DeclarationName::CXXConstructorName:
case DeclarationName::CXXDestructorName:
case DeclarationName::CXXConversionFunctionName:
case DeclarationName::CXXUsingDirective:
  break;
}

return ID.ComputeHash();
1097}

1099ModuleFile *
1100ASTDeclContextNameLookupTrait::ReadFileRef(const unsigned char *&d) {
using namespace llvm::support;

uint32_t ModuleFileID = endian::readNext<uint32_t, little, unaligned>(d);
return Reader.getLocalModuleFile(F, ModuleFileID);
1105}

1107std::pair<unsigned, unsigned>
1108ASTDeclContextNameLookupTrait::ReadKeyDataLength(const unsigned char *&d) {
return readULEBKeyDataLength(d);
1110}

1112ASTDeclContextNameLookupTrait::internal_key_type
1113ASTDeclContextNameLookupTrait::ReadKey(const unsigned char *d, unsigned) {
using namespace llvm::support;

auto Kind = (DeclarationName::NameKind)*d++;
uint64_t Data;
switch (Kind) {
case DeclarationName::Identifier:
case DeclarationName::CXXLiteralOperatorName:
case DeclarationName::CXXDeductionGuideName:
  Data = (uint64_t)Reader.getLocalIdentifier(
      F, endian::readNext<uint32_t, little, unaligned>(d));
  break;
case DeclarationName::ObjCZeroArgSelector:
case DeclarationName::ObjCOneArgSelector:
case DeclarationName::ObjCMultiArgSelector:
  Data =
      (uint64_t)Reader.getLocalSelector(
                           F, endian::readNext<uint32_t, little, unaligned>(
                                  d)).getAsOpaquePtr();
  break;
case DeclarationName::CXXOperatorName:
  Data = *d++; // OverloadedOperatorKind
  break;
case DeclarationName::CXXConstructorName:
case DeclarationName::CXXDestructorName:
case DeclarationName::CXXConversionFunctionName:
case DeclarationName::CXXUsingDirective:
  Data = 0;
  break;
}

return DeclarationNameKey(Kind, Data);
1145}

1147void ASTDeclContextNameLookupTrait::ReadDataInto(internal_key_type,
                                               const unsigned char *d,
                                               unsigned DataLen,
                                               data_type_builder &Val) {
using namespace llvm::support;

for (unsigned NumDecls = DataLen / 4; NumDecls; --NumDecls) {
  uint32_t LocalID = endian::readNext<uint32_t, little, unaligned>(d);
  Val.insert(Reader.getGlobalDeclID(F, LocalID));
}
1157}

1159bool ASTReader::ReadLexicalDeclContextStorage(ModuleFile &M,
                                            BitstreamCursor &Cursor,
                                            uint64_t Offset,
                                            DeclContext *DC) {
assert(Offset != 0)((void)0);

SavedStreamPosition SavedPosition(Cursor);
if (llvm::Error Err = Cursor.JumpToBit(Offset)) {
  Error(std::move(Err));
  return true;
}

RecordData Record;
StringRef Blob;
Expected<unsigned> MaybeCode = Cursor.ReadCode();
if (!MaybeCode) {
  Error(MaybeCode.takeError());
  return true;
}
unsigned Code = MaybeCode.get();

Expected<unsigned> MaybeRecCode = Cursor.readRecord(Code, Record, &Blob);
if (!MaybeRecCode) {
  Error(MaybeRecCode.takeError());
  return true;
}
unsigned RecCode = MaybeRecCode.get();
if (RecCode != DECL_CONTEXT_LEXICAL) {
  Error("Expected lexical block");
  return true;
}

assert(!isa<TranslationUnitDecl>(DC) &&((void)0)
       "expected a TU_UPDATE_LEXICAL record for TU")((void)0);
// If we are handling a C++ class template instantiation, we can see multiple
// lexical updates for the same record. It's important that we select only one
// of them, so that field numbering works properly. Just pick the first one we
// see.
auto &Lex = LexicalDecls[DC];
if (!Lex.first) {
  Lex = std::make_pair(
      &M, llvm::makeArrayRef(
              reinterpret_cast<const llvm::support::unaligned_uint32_t *>(
                  Blob.data()),
              Blob.size() / 4));
}
DC->setHasExternalLexicalStorage(true);
return false;
1207}

1209bool ASTReader::ReadVisibleDeclContextStorage(ModuleFile &M,
                                            BitstreamCursor &Cursor,
                                            uint64_t Offset,
                                            DeclID ID) {
assert(Offset != 0)((void)0);

SavedStreamPosition SavedPosition(Cursor);
if (llvm::Error Err = Cursor.JumpToBit(Offset)) {
  Error(std::move(Err));
  return true;
}

RecordData Record;
StringRef Blob;
Expected<unsigned> MaybeCode = Cursor.ReadCode();
if (!MaybeCode) {
  Error(MaybeCode.takeError());
  return true;
}
unsigned Code = MaybeCode.get();

Expected<unsigned> MaybeRecCode = Cursor.readRecord(Code, Record, &Blob);
if (!MaybeRecCode) {
  Error(MaybeRecCode.takeError());
  return true;
}
unsigned RecCode = MaybeRecCode.get();
if (RecCode != DECL_CONTEXT_VISIBLE) {
  Error("Expected visible lookup table block");
  return true;
}

// We can't safely determine the primary context yet, so delay attaching the
// lookup table until we're done with recursive deserialization.
auto *Data = (const unsigned char*)Blob.data();
PendingVisibleUpdates[ID].push_back(PendingVisibleUpdate{&M, Data});
return false;
1246}

1248void ASTReader::Error(StringRef Msg) const {
Error(diag::err_fe_pch_malformed, Msg);
if (PP.getLangOpts().Modules && !Diags.isDiagnosticInFlight() &&
    !PP.getHeaderSearchInfo().getModuleCachePath().empty()) {
  Diag(diag::note_module_cache_path)
    << PP.getHeaderSearchInfo().getModuleCachePath();
}
1255}

1257void ASTReader::Error(unsigned DiagID, StringRef Arg1, StringRef Arg2,
                    StringRef Arg3) const {
if (Diags.isDiagnosticInFlight())
  Diags.SetDelayedDiagnostic(DiagID, Arg1, Arg2, Arg3);
else
  Diag(DiagID) << Arg1 << Arg2 << Arg3;
1263}

1265void ASTReader::Error(llvm::Error &&Err) const {
Error(toString(std::move(Err)));
1267}

1269//===----------------------------------------------------------------------===//
1270// Source Manager Deserialization
1271//===----------------------------------------------------------------------===//

1273/// Read the line table in the source manager block.
1274/// \returns true if there was an error.
1275bool ASTReader::ParseLineTable(ModuleFile &F,
                             const RecordData &Record) {
unsigned Idx = 0;
LineTableInfo &LineTable = SourceMgr.getLineTable();

// Parse the file names
std::map<int, int> FileIDs;
FileIDs[-1] = -1; // For unspecified filenames.
for (unsigned I = 0; Record[Idx]; ++I) {
  // Extract the file name
  auto Filename = ReadPath(F, Record, Idx);
  FileIDs[I] = LineTable.getLineTableFilenameID(Filename);
}
++Idx;

// Parse the line entries
std::vector<LineEntry> Entries;
while (Idx < Record.size()) {
  int FID = Record[Idx++];
  assert(FID >= 0 && "Serialized line entries for non-local file.")((void)0);
  // Remap FileID from 1-based old view.
  FID += F.SLocEntryBaseID - 1;

  // Extract the line entries
  unsigned NumEntries = Record[Idx++];
  assert(NumEntries && "no line entries for file ID")((void)0);
  Entries.clear();
  Entries.reserve(NumEntries);
  for (unsigned I = 0; I != NumEntries; ++I) {
    unsigned FileOffset = Record[Idx++];
    unsigned LineNo = Record[Idx++];
    int FilenameID = FileIDs[Record[Idx++]];
    SrcMgr::CharacteristicKind FileKind
      = (SrcMgr::CharacteristicKind)Record[Idx++];
    unsigned IncludeOffset = Record[Idx++];
    Entries.push_back(LineEntry::get(FileOffset, LineNo, FilenameID,
                                     FileKind, IncludeOffset));
  }
  LineTable.AddEntry(FileID::get(FID), Entries);
}

return false;
1317}

1319/// Read a source manager block
1320bool ASTReader::ReadSourceManagerBlock(ModuleFile &F) {
using namespace SrcMgr;

BitstreamCursor &SLocEntryCursor = F.SLocEntryCursor;

// Set the source-location entry cursor to the current position in
// the stream. This cursor will be used to read the contents of the
// source manager block initially, and then lazily read
// source-location entries as needed.
SLocEntryCursor = F.Stream;

// The stream itself is going to skip over the source manager block.
if (llvm::Error Err = F.Stream.SkipBlock()) {
  Error(std::move(Err));
  return true;
}

// Enter the source manager block.
if (llvm::Error Err =
        SLocEntryCursor.EnterSubBlock(SOURCE_MANAGER_BLOCK_ID)) {
  Error(std::move(Err));
  return true;
}
F.SourceManagerBlockStartOffset = SLocEntryCursor.GetCurrentBitNo();

RecordData Record;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeE =
      SLocEntryCursor.advanceSkippingSubblocks();
  if (!MaybeE) {
    Error(MaybeE.takeError());
    return true;
  }
  llvm::BitstreamEntry E = MaybeE.get();

  switch (E.Kind) {
  case llvm::BitstreamEntry::SubBlock: // Handled for us already.
  case llvm::BitstreamEntry::Error:
    Error("malformed block record in AST file");
    return true;
  case llvm::BitstreamEntry::EndBlock:
    return false;
  case llvm::BitstreamEntry::Record:
    // The interesting case.
    break;
  }

  // Read a record.
  Record.clear();
  StringRef Blob;
  Expected<unsigned> MaybeRecord =
      SLocEntryCursor.readRecord(E.ID, Record, &Blob);
  if (!MaybeRecord) {
    Error(MaybeRecord.takeError());
    return true;
  }
  switch (MaybeRecord.get()) {
  default:  // Default behavior: ignore.
    break;

  case SM_SLOC_FILE_ENTRY:
  case SM_SLOC_BUFFER_ENTRY:
  case SM_SLOC_EXPANSION_ENTRY:
    // Once we hit one of the source location entries, we're done.
    return false;
  }
}
1387}

1389/// If a header file is not found at the path that we expect it to be
1390/// and the PCH file was moved from its original location, try to resolve the
1391/// file by assuming that header+PCH were moved together and the header is in
1392/// the same place relative to the PCH.
1393static std::string
1394resolveFileRelativeToOriginalDir(const std::string &Filename,
                               const std::string &OriginalDir,
                               const std::string &CurrDir) {
assert(OriginalDir != CurrDir &&((void)0)
       "No point trying to resolve the file if the PCH dir didn't change")((void)0);

using namespace llvm::sys;

SmallString<128> filePath(Filename);
fs::make_absolute(filePath);
assert(path::is_absolute(OriginalDir))((void)0);
SmallString<128> currPCHPath(CurrDir);

path::const_iterator fileDirI = path::begin(path::parent_path(filePath)),
                     fileDirE = path::end(path::parent_path(filePath));
path::const_iterator origDirI = path::begin(OriginalDir),
                     origDirE = path::end(OriginalDir);
// Skip the common path components from filePath and OriginalDir.
while (fileDirI != fileDirE && origDirI != origDirE &&
       *fileDirI == *origDirI) {
  ++fileDirI;
  ++origDirI;
}
for (; origDirI != origDirE; ++origDirI)
  path::append(currPCHPath, "..");
path::append(currPCHPath, fileDirI, fileDirE);
path::append(currPCHPath, path::filename(Filename));
return std::string(currPCHPath.str());
1422}

1424bool ASTReader::ReadSLocEntry(int ID) {
if (ID == 0)
  return false;

if (unsigned(-ID) - 2 >= getTotalNumSLocs() || ID > 0) {
  Error("source location entry ID out-of-range for AST file");
  return true;
}

// Local helper to read the (possibly-compressed) buffer data following the
// entry record.
auto ReadBuffer = [this](
    BitstreamCursor &SLocEntryCursor,
    StringRef Name) -> std::unique_ptr<llvm::MemoryBuffer> {
  RecordData Record;
  StringRef Blob;
  Expected<unsigned> MaybeCode = SLocEntryCursor.ReadCode();
  if (!MaybeCode) {
    Error(MaybeCode.takeError());
    return nullptr;
  }
  unsigned Code = MaybeCode.get();

  Expected<unsigned> MaybeRecCode =
      SLocEntryCursor.readRecord(Code, Record, &Blob);
  if (!MaybeRecCode) {
    Error(MaybeRecCode.takeError());
    return nullptr;
  }
  unsigned RecCode = MaybeRecCode.get();

  if (RecCode == SM_SLOC_BUFFER_BLOB_COMPRESSED) {
    if (!llvm::zlib::isAvailable()) {
      Error("zlib is not available");
      return nullptr;
    }
    SmallString<0> Uncompressed;
    if (llvm::Error E =
            llvm::zlib::uncompress(Blob, Uncompressed, Record[0])) {
      Error("could not decompress embedded file contents: " +
            llvm::toString(std::move(E)));
      return nullptr;
    }
    return llvm::MemoryBuffer::getMemBufferCopy(Uncompressed, Name);
  } else if (RecCode == SM_SLOC_BUFFER_BLOB) {
    return llvm::MemoryBuffer::getMemBuffer(Blob.drop_back(1), Name, true);
  } else {
    Error("AST record has invalid code");
    return nullptr;
  }
};

ModuleFile *F = GlobalSLocEntryMap.find(-ID)->second;
if (llvm::Error Err = F->SLocEntryCursor.JumpToBit(
        F->SLocEntryOffsetsBase +
        F->SLocEntryOffsets[ID - F->SLocEntryBaseID])) {
  Error(std::move(Err));
  return true;
}

BitstreamCursor &SLocEntryCursor = F->SLocEntryCursor;
SourceLocation::UIntTy BaseOffset = F->SLocEntryBaseOffset;

++NumSLocEntriesRead;
Expected<llvm::BitstreamEntry> MaybeEntry = SLocEntryCursor.advance();
if (!MaybeEntry) {
  Error(MaybeEntry.takeError());
  return true;
}
llvm::BitstreamEntry Entry = MaybeEntry.get();

if (Entry.Kind != llvm::BitstreamEntry::Record) {
  Error("incorrectly-formatted source location entry in AST file");
  return true;
}

RecordData Record;
StringRef Blob;
Expected<unsigned> MaybeSLOC =
    SLocEntryCursor.readRecord(Entry.ID, Record, &Blob);
if (!MaybeSLOC) {
  Error(MaybeSLOC.takeError());
  return true;
}
switch (MaybeSLOC.get()) {
default:
  Error("incorrectly-formatted source location entry in AST file");
  return true;

case SM_SLOC_FILE_ENTRY: {
  // We will detect whether a file changed and return 'Failure' for it, but
  // we will also try to fail gracefully by setting up the SLocEntry.
  unsigned InputID = Record[4];
  InputFile IF = getInputFile(*F, InputID);
  Optional<FileEntryRef> File = IF.getFile();
  bool OverriddenBuffer = IF.isOverridden();

  // Note that we only check if a File was returned. If it was out-of-date
  // we have complained but we will continue creating a FileID to recover
  // gracefully.
  if (!File)
    return true;

  SourceLocation IncludeLoc = ReadSourceLocation(*F, Record[1]);
  if (IncludeLoc.isInvalid() && F->Kind != MK_MainFile) {
    // This is the module's main file.
    IncludeLoc = getImportLocation(F);
  }
  SrcMgr::CharacteristicKind
    FileCharacter = (SrcMgr::CharacteristicKind)Record[2];
  FileID FID = SourceMgr.createFileID(*File, IncludeLoc, FileCharacter, ID,
                                      BaseOffset + Record[0]);
  SrcMgr::FileInfo &FileInfo =
        const_cast<SrcMgr::FileInfo&>(SourceMgr.getSLocEntry(FID).getFile());
  FileInfo.NumCreatedFIDs = Record[5];
  if (Record[3])
    FileInfo.setHasLineDirectives();

  unsigned NumFileDecls = Record[7];
  if (NumFileDecls && ContextObj) {
    const DeclID *FirstDecl = F->FileSortedDecls + Record[6];
    assert(F->FileSortedDecls && "FILE_SORTED_DECLS not encountered yet ?")((void)0);
    FileDeclIDs[FID] = FileDeclsInfo(F, llvm::makeArrayRef(FirstDecl,
                                                           NumFileDecls));
  }

  const SrcMgr::ContentCache &ContentCache =
      SourceMgr.getOrCreateContentCache(*File, isSystem(FileCharacter));
  if (OverriddenBuffer && !ContentCache.BufferOverridden &&
      ContentCache.ContentsEntry == ContentCache.OrigEntry &&
      !ContentCache.getBufferIfLoaded()) {
    auto Buffer = ReadBuffer(SLocEntryCursor, File->getName());
    if (!Buffer)
      return true;
    SourceMgr.overrideFileContents(*File, std::move(Buffer));
  }

  break;
}

case SM_SLOC_BUFFER_ENTRY: {
  const char *Name = Blob.data();
  unsigned Offset = Record[0];
  SrcMgr::CharacteristicKind
    FileCharacter = (SrcMgr::CharacteristicKind)Record[2];
  SourceLocation IncludeLoc = ReadSourceLocation(*F, Record[1]);
  if (IncludeLoc.isInvalid() && F->isModule()) {
    IncludeLoc = getImportLocation(F);
  }

  auto Buffer = ReadBuffer(SLocEntryCursor, Name);
  if (!Buffer)
    return true;
  SourceMgr.createFileID(std::move(Buffer), FileCharacter, ID,
                         BaseOffset + Offset, IncludeLoc);
  break;
}

case SM_SLOC_EXPANSION_ENTRY: {
  SourceLocation SpellingLoc = ReadSourceLocation(*F, Record[1]);
  SourceMgr.createExpansionLoc(SpellingLoc,
                                   ReadSourceLocation(*F, Record[2]),
                                   ReadSourceLocation(*F, Record[3]),
                                   Record[5],
                                   Record[4],
                                   ID,
                                   BaseOffset + Record[0]);
  break;
}
}

return false;
1596}

1598std::pair<SourceLocation, StringRef> ASTReader::getModuleImportLoc(int ID) {
if (ID == 0)
  return std::make_pair(SourceLocation(), "");

if (unsigned(-ID) - 2 >= getTotalNumSLocs() || ID > 0) {
  Error("source location entry ID out-of-range for AST file");
  return std::make_pair(SourceLocation(), "");
}

// Find which module file this entry lands in.
ModuleFile *M = GlobalSLocEntryMap.find(-ID)->second;
if (!M->isModule())
  return std::make_pair(SourceLocation(), "");

// FIXME: Can we map this down to a particular submodule? That would be
// ideal.
return std::make_pair(M->ImportLoc, StringRef(M->ModuleName));
1615}

1617/// Find the location where the module F is imported.
1618SourceLocation ASTReader::getImportLocation(ModuleFile *F) {
if (F->ImportLoc.isValid())
  return F->ImportLoc;

// Otherwise we have a PCH. It's considered to be "imported" at the first
// location of its includer.
if (F->ImportedBy.empty() || !F->ImportedBy[0]) {
  // Main file is the importer.
  assert(SourceMgr.getMainFileID().isValid() && "missing main file")((void)0);
  return SourceMgr.getLocForStartOfFile(SourceMgr.getMainFileID());
}
return F->ImportedBy[0]->FirstLoc;
1630}

1632/// Enter a subblock of the specified BlockID with the specified cursor. Read
1633/// the abbreviations that are at the top of the block and then leave the cursor
1634/// pointing into the block.
1635bool ASTReader::ReadBlockAbbrevs(BitstreamCursor &Cursor, unsigned BlockID,
                               uint64_t *StartOfBlockOffset) {
if (llvm::Error Err = Cursor.EnterSubBlock(BlockID)) {
  // FIXME this drops errors on the floor.
  consumeError(std::move(Err));
  return true;
}

if (StartOfBlockOffset)
  *StartOfBlockOffset = Cursor.GetCurrentBitNo();

while (true) {
  uint64_t Offset = Cursor.GetCurrentBitNo();
  Expected<unsigned> MaybeCode = Cursor.ReadCode();
  if (!MaybeCode) {
    // FIXME this drops errors on the floor.
    consumeError(MaybeCode.takeError());
    return true;
  }
  unsigned Code = MaybeCode.get();

  // We expect all abbrevs to be at the start of the block.
  if (Code != llvm::bitc::DEFINE_ABBREV) {
    if (llvm::Error Err = Cursor.JumpToBit(Offset)) {
      // FIXME this drops errors on the floor.
      consumeError(std::move(Err));
      return true;
    }
    return false;
  }
  if (llvm::Error Err = Cursor.ReadAbbrevRecord()) {
    // FIXME this drops errors on the floor.
    consumeError(std::move(Err));
    return true;
  }
}
1671}

1673Token ASTReader::ReadToken(ModuleFile &F, const RecordDataImpl &Record,
                         unsigned &Idx) {
Token Tok;
Tok.startToken();
Tok.setLocation(ReadSourceLocation(F, Record, Idx));
Tok.setLength(Record[Idx++]);
if (IdentifierInfo *II = getLocalIdentifier(F, Record[Idx++]))
  Tok.setIdentifierInfo(II);
Tok.setKind((tok::TokenKind)Record[Idx++]);
Tok.setFlag((Token::TokenFlags)Record[Idx++]);
return Tok;
1684}

1686MacroInfo *ASTReader::ReadMacroRecord(ModuleFile &F, uint64_t Offset) {
BitstreamCursor &Stream = F.MacroCursor;

// Keep track of where we are in the stream, then jump back there
// after reading this macro.
SavedStreamPosition SavedPosition(Stream);

if (llvm::Error Err = Stream.JumpToBit(Offset)) {
  // FIXME this drops errors on the floor.
  consumeError(std::move(Err));
  return nullptr;
}
RecordData Record;
SmallVector<IdentifierInfo*, 16> MacroParams;
MacroInfo *Macro = nullptr;

while (true) {
  // Advance to the next record, but if we get to the end of the block, don't
  // pop it (removing all the abbreviations from the cursor) since we want to
  // be able to reseek within the block and read entries.
  unsigned Flags = BitstreamCursor::AF_DontPopBlockAtEnd;
  Expected<llvm::BitstreamEntry> MaybeEntry =
      Stream.advanceSkippingSubblocks(Flags);
  if (!MaybeEntry) {
    Error(MaybeEntry.takeError());
    return Macro;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::SubBlock: // Handled for us already.
  case llvm::BitstreamEntry::Error:
    Error("malformed block record in AST file");
    return Macro;
  case llvm::BitstreamEntry::EndBlock:
    return Macro;
  case llvm::BitstreamEntry::Record:
    // The interesting case.
    break;
  }

  // Read a record.
  Record.clear();
  PreprocessorRecordTypes RecType;
  if (Expected<unsigned> MaybeRecType = Stream.readRecord(Entry.ID, Record))
    RecType = (PreprocessorRecordTypes)MaybeRecType.get();
  else {
    Error(MaybeRecType.takeError());
    return Macro;
  }
  switch (RecType) {
  case PP_MODULE_MACRO:
  case PP_MACRO_DIRECTIVE_HISTORY:
    return Macro;

  case PP_MACRO_OBJECT_LIKE:
  case PP_MACRO_FUNCTION_LIKE: {
    // If we already have a macro, that means that we've hit the end
    // of the definition of the macro we were looking for. We're
    // done.
    if (Macro)
      return Macro;

    unsigned NextIndex = 1; // Skip identifier ID.
    SourceLocation Loc = ReadSourceLocation(F, Record, NextIndex);
    MacroInfo *MI = PP.AllocateMacroInfo(Loc);
    MI->setDefinitionEndLoc(ReadSourceLocation(F, Record, NextIndex));
    MI->setIsUsed(Record[NextIndex++]);
    MI->setUsedForHeaderGuard(Record[NextIndex++]);

    if (RecType == PP_MACRO_FUNCTION_LIKE) {
      // Decode function-like macro info.
      bool isC99VarArgs = Record[NextIndex++];
      bool isGNUVarArgs = Record[NextIndex++];
      bool hasCommaPasting = Record[NextIndex++];
      MacroParams.clear();
      unsigned NumArgs = Record[NextIndex++];
      for (unsigned i = 0; i != NumArgs; ++i)
        MacroParams.push_back(getLocalIdentifier(F, Record[NextIndex++]));

      // Install function-like macro info.
      MI->setIsFunctionLike();
      if (isC99VarArgs) MI->setIsC99Varargs();
      if (isGNUVarArgs) MI->setIsGNUVarargs();
      if (hasCommaPasting) MI->setHasCommaPasting();
      MI->setParameterList(MacroParams, PP.getPreprocessorAllocator());
    }

    // Remember that we saw this macro last so that we add the tokens that
    // form its body to it.
    Macro = MI;

    if (NextIndex + 1 == Record.size() && PP.getPreprocessingRecord() &&
        Record[NextIndex]) {
      // We have a macro definition. Register the association
      PreprocessedEntityID
          GlobalID = getGlobalPreprocessedEntityID(F, Record[NextIndex]);
      PreprocessingRecord &PPRec = *PP.getPreprocessingRecord();
      PreprocessingRecord::PPEntityID PPID =
          PPRec.getPPEntityID(GlobalID - 1, /*isLoaded=*/true);
      MacroDefinitionRecord *PPDef = cast_or_null<MacroDefinitionRecord>(
          PPRec.getPreprocessedEntity(PPID));
      if (PPDef)
        PPRec.RegisterMacroDefinition(Macro, PPDef);
    }

    ++NumMacrosRead;
    break;
  }

  case PP_TOKEN: {
    // If we see a TOKEN before a PP_MACRO_*, then the file is
    // erroneous, just pretend we didn't see this.
    if (!Macro) break;

    unsigned Idx = 0;
    Token Tok = ReadToken(F, Record, Idx);
    Macro->AddTokenToBody(Tok);
    break;
  }
  }
}
1808}

1810PreprocessedEntityID
1811ASTReader::getGlobalPreprocessedEntityID(ModuleFile &M,
                                       unsigned LocalID) const {
if (!M.ModuleOffsetMap.empty())
  ReadModuleOffsetMap(M);

ContinuousRangeMap<uint32_t, int, 2>::const_iterator
  I = M.PreprocessedEntityRemap.find(LocalID - NUM_PREDEF_PP_ENTITY_IDS);
assert(I != M.PreprocessedEntityRemap.end()((void)0)
       && "Invalid index into preprocessed entity index remap")((void)0);

return LocalID + I->second;
1822}

1824unsigned HeaderFileInfoTrait::ComputeHash(internal_key_ref ikey) {
return llvm::hash_combine(ikey.Size, ikey.ModTime);
1826}

1828HeaderFileInfoTrait::internal_key_type
1829HeaderFileInfoTrait::GetInternalKey(const FileEntry *FE) {
internal_key_type ikey = {FE->getSize(),
                          M.HasTimestamps ? FE->getModificationTime() : 0,
                          FE->getName(), /*Imported*/ false};
return ikey;
1834}

1836bool HeaderFileInfoTrait::EqualKey(internal_key_ref a, internal_key_ref b) {
if (a.Size != b.Size || (a.ModTime && b.ModTime && a.ModTime != b.ModTime))
  return false;

if (llvm::sys::path::is_absolute(a.Filename) && a.Filename == b.Filename)
  return true;

// Determine whether the actual files are equivalent.
FileManager &FileMgr = Reader.getFileManager();
auto GetFile = [&](const internal_key_type &Key) -> const FileEntry* {
  if (!Key.Imported) {
    if (auto File = FileMgr.getFile(Key.Filename))
      return *File;
    return nullptr;
  }

  std::string Resolved = std::string(Key.Filename);
  Reader.ResolveImportedPath(M, Resolved);
  if (auto File = FileMgr.getFile(Resolved))
    return *File;
  return nullptr;
};

const FileEntry *FEA = GetFile(a);
const FileEntry *FEB = GetFile(b);
return FEA && FEA == FEB;
1862}

1864std::pair<unsigned, unsigned>
1865HeaderFileInfoTrait::ReadKeyDataLength(const unsigned char*& d) {
return readULEBKeyDataLength(d);
1867}

1869HeaderFileInfoTrait::internal_key_type
1870HeaderFileInfoTrait::ReadKey(const unsigned char *d, unsigned) {
using namespace llvm::support;

internal_key_type ikey;
ikey.Size = off_t(endian::readNext<uint64_t, little, unaligned>(d));
ikey.ModTime = time_t(endian::readNext<uint64_t, little, unaligned>(d));
ikey.Filename = (const char *)d;
ikey.Imported = true;
return ikey;
1879}

1881HeaderFileInfoTrait::data_type
1882HeaderFileInfoTrait::ReadData(internal_key_ref key, const unsigned char *d,
                            unsigned DataLen) {
using namespace llvm::support;

const unsigned char *End = d + DataLen;
HeaderFileInfo HFI;
unsigned Flags = *d++;
// FIXME: Refactor with mergeHeaderFileInfo in HeaderSearch.cpp.
HFI.isImport |= (Flags >> 5) & 0x01;
HFI.isPragmaOnce |= (Flags >> 4) & 0x01;
HFI.DirInfo = (Flags >> 1) & 0x07;
HFI.IndexHeaderMapHeader = Flags & 0x01;
// FIXME: Find a better way to handle this. Maybe just store a
// "has been included" flag?
HFI.NumIncludes = std::max(endian::readNext<uint16_t, little, unaligned>(d),
                           HFI.NumIncludes);
HFI.ControllingMacroID = Reader.getGlobalIdentifierID(
    M, endian::readNext<uint32_t, little, unaligned>(d));
if (unsigned FrameworkOffset =
        endian::readNext<uint32_t, little, unaligned>(d)) {
  // The framework offset is 1 greater than the actual offset,
  // since 0 is used as an indicator for "no framework name".
  StringRef FrameworkName(FrameworkStrings + FrameworkOffset - 1);
  HFI.Framework = HS->getUniqueFrameworkName(FrameworkName);
}

assert((End - d) % 4 == 0 &&((void)0)
       "Wrong data length in HeaderFileInfo deserialization")((void)0);
while (d != End) {
  uint32_t LocalSMID = endian::readNext<uint32_t, little, unaligned>(d);
  auto HeaderRole = static_cast<ModuleMap::ModuleHeaderRole>(LocalSMID & 3);
  LocalSMID >>= 2;

  // This header is part of a module. Associate it with the module to enable
  // implicit module import.
  SubmoduleID GlobalSMID = Reader.getGlobalSubmoduleID(M, LocalSMID);
  Module *Mod = Reader.getSubmodule(GlobalSMID);
  FileManager &FileMgr = Reader.getFileManager();
  ModuleMap &ModMap =
      Reader.getPreprocessor().getHeaderSearchInfo().getModuleMap();

  std::string Filename = std::string(key.Filename);
  if (key.Imported)
    Reader.ResolveImportedPath(M, Filename);
  // FIXME: NameAsWritten
  Module::Header H = {std::string(key.Filename), "",
                      *FileMgr.getFile(Filename)};
  ModMap.addHeader(Mod, H, HeaderRole, /*Imported*/true);
  HFI.isModuleHeader |= !(HeaderRole & ModuleMap::TextualHeader);
}

// This HeaderFileInfo was externally loaded.
HFI.External = true;
HFI.IsValid = true;
return HFI;
1937}

1939void ASTReader::addPendingMacro(IdentifierInfo *II, ModuleFile *M,
                              uint32_t MacroDirectivesOffset) {
assert(NumCurrentElementsDeserializing > 0 &&"Missing deserialization guard")((void)0);
PendingMacroIDs[II].push_back(PendingMacroInfo(M, MacroDirectivesOffset));
1943}

1945void ASTReader::ReadDefinedMacros() {
// Note that we are loading defined macros.
Deserializing Macros(this);

for (ModuleFile &I : llvm::reverse(ModuleMgr)) {
  BitstreamCursor &MacroCursor = I.MacroCursor;

  // If there was no preprocessor block, skip this file.
  if (MacroCursor.getBitcodeBytes().empty())
    continue;

  BitstreamCursor Cursor = MacroCursor;
  if (llvm::Error Err = Cursor.JumpToBit(I.MacroStartOffset)) {
    Error(std::move(Err));
    return;
  }

  RecordData Record;
  while (true) {
    Expected<llvm::BitstreamEntry> MaybeE = Cursor.advanceSkippingSubblocks();
    if (!MaybeE) {
      Error(MaybeE.takeError());
      return;
    }
    llvm::BitstreamEntry E = MaybeE.get();

    switch (E.Kind) {
    case llvm::BitstreamEntry::SubBlock: // Handled for us already.
    case llvm::BitstreamEntry::Error:
      Error("malformed block record in AST file");
      return;
    case llvm::BitstreamEntry::EndBlock:
      goto NextCursor;

    case llvm::BitstreamEntry::Record: {
      Record.clear();
      Expected<unsigned> MaybeRecord = Cursor.readRecord(E.ID, Record);
      if (!MaybeRecord) {
        Error(MaybeRecord.takeError());
        return;
      }
      switch (MaybeRecord.get()) {
      default:  // Default behavior: ignore.
        break;

      case PP_MACRO_OBJECT_LIKE:
      case PP_MACRO_FUNCTION_LIKE: {
        IdentifierInfo *II = getLocalIdentifier(I, Record[0]);
        if (II->isOutOfDate())
          updateOutOfDateIdentifier(*II);
        break;
      }

      case PP_TOKEN:
        // Ignore tokens.
        break;
      }
      break;
    }
    }
  }
  NextCursor:  ;
}
2008}

2010namespace {

/// Visitor class used to look up identifirs in an AST file.
class IdentifierLookupVisitor {
  StringRef Name;
  unsigned NameHash;
  unsigned PriorGeneration;
  unsigned &NumIdentifierLookups;
  unsigned &NumIdentifierLookupHits;
  IdentifierInfo *Found = nullptr;

public:
  IdentifierLookupVisitor(StringRef Name, unsigned PriorGeneration,
                          unsigned &NumIdentifierLookups,
                          unsigned &NumIdentifierLookupHits)
    : Name(Name), NameHash(ASTIdentifierLookupTrait::ComputeHash(Name)),
      PriorGeneration(PriorGeneration),
      NumIdentifierLookups(NumIdentifierLookups),
      NumIdentifierLookupHits(NumIdentifierLookupHits) {}

  bool operator()(ModuleFile &M) {
    // If we've already searched this module file, skip it now.
    if (M.Generation <= PriorGeneration)
      return true;

    ASTIdentifierLookupTable *IdTable
      = (ASTIdentifierLookupTable *)M.IdentifierLookupTable;
    if (!IdTable)
      return false;

    ASTIdentifierLookupTrait Trait(IdTable->getInfoObj().getReader(), M,
                                   Found);
    ++NumIdentifierLookups;
    ASTIdentifierLookupTable::iterator Pos =
        IdTable->find_hashed(Name, NameHash, &Trait);
    if (Pos == IdTable->end())
      return false;

    // Dereferencing the iterator has the effect of building the
    // IdentifierInfo node and populating it with the various
    // declarations it needs.
    ++NumIdentifierLookupHits;
    Found = *Pos;
    return true;
  }

  // Retrieve the identifier info found within the module
  // files.
  IdentifierInfo *getIdentifierInfo() const { return Found; }
};

2061} // namespace

2063void ASTReader::updateOutOfDateIdentifier(IdentifierInfo &II) {
// Note that we are loading an identifier.
Deserializing AnIdentifier(this);

unsigned PriorGeneration = 0;
if (getContext().getLangOpts().Modules)
  PriorGeneration = IdentifierGeneration[&II];

// If there is a global index, look there first to determine which modules
// provably do not have any results for this identifier.
GlobalModuleIndex::HitSet Hits;
GlobalModuleIndex::HitSet *HitsPtr = nullptr;
if (!loadGlobalIndex()) {
  if (GlobalIndex->lookupIdentifier(II.getName(), Hits)) {
    HitsPtr = &Hits;
  }
}

IdentifierLookupVisitor Visitor(II.getName(), PriorGeneration,
                                NumIdentifierLookups,
                                NumIdentifierLookupHits);
ModuleMgr.visit(Visitor, HitsPtr);
markIdentifierUpToDate(&II);
2086}

2088void ASTReader::markIdentifierUpToDate(IdentifierInfo *II) {
if (!II)
  return;

II->setOutOfDate(false);

// Update the generation for this identifier.
if (getContext().getLangOpts().Modules)
  IdentifierGeneration[II] = getGeneration();
2097}

2099void ASTReader::resolvePendingMacro(IdentifierInfo *II,
                                  const PendingMacroInfo &PMInfo) {
ModuleFile &M = *PMInfo.M;

BitstreamCursor &Cursor = M.MacroCursor;
SavedStreamPosition SavedPosition(Cursor);
if (llvm::Error Err =
        Cursor.JumpToBit(M.MacroOffsetsBase + PMInfo.MacroDirectivesOffset)) {
  Error(std::move(Err));
  return;
}

struct ModuleMacroRecord {
  SubmoduleID SubModID;
  MacroInfo *MI;
  SmallVector<SubmoduleID, 8> Overrides;
};
llvm::SmallVector<ModuleMacroRecord, 8> ModuleMacros;

// We expect to see a sequence of PP_MODULE_MACRO records listing exported
// macros, followed by a PP_MACRO_DIRECTIVE_HISTORY record with the complete
// macro histroy.
RecordData Record;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry =
      Cursor.advance(BitstreamCursor::AF_DontPopBlockAtEnd);
  if (!MaybeEntry) {
    Error(MaybeEntry.takeError());
    return;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  if (Entry.Kind != llvm::BitstreamEntry::Record) {
    Error("malformed block record in AST file");
    return;
  }

  Record.clear();
  Expected<unsigned> MaybePP = Cursor.readRecord(Entry.ID, Record);
  if (!MaybePP) {
    Error(MaybePP.takeError());
    return;
  }
  switch ((PreprocessorRecordTypes)MaybePP.get()) {
  case PP_MACRO_DIRECTIVE_HISTORY:
    break;

  case PP_MODULE_MACRO: {
    ModuleMacros.push_back(ModuleMacroRecord());
    auto &Info = ModuleMacros.back();
    Info.SubModID = getGlobalSubmoduleID(M, Record[0]);
    Info.MI = getMacro(getGlobalMacroID(M, Record[1]));
    for (int I = 2, N = Record.size(); I != N; ++I)
      Info.Overrides.push_back(getGlobalSubmoduleID(M, Record[I]));
    continue;
  }

  default:
    Error("malformed block record in AST file");
    return;
  }

  // We found the macro directive history; that's the last record
  // for this macro.
  break;
}

// Module macros are listed in reverse dependency order.
{
  std::reverse(ModuleMacros.begin(), ModuleMacros.end());
  llvm::SmallVector<ModuleMacro*, 8> Overrides;
  for (auto &MMR : ModuleMacros) {
    Overrides.clear();
    for (unsigned ModID : MMR.Overrides) {
      Module *Mod = getSubmodule(ModID);
      auto *Macro = PP.getModuleMacro(Mod, II);
      assert(Macro && "missing definition for overridden macro")((void)0);
      Overrides.push_back(Macro);
    }

    bool Inserted = false;
    Module *Owner = getSubmodule(MMR.SubModID);
    PP.addModuleMacro(Owner, II, MMR.MI, Overrides, Inserted);
  }
}

// Don't read the directive history for a module; we don't have anywhere
// to put it.
if (M.isModule())
  return;

// Deserialize the macro directives history in reverse source-order.
MacroDirective *Latest = nullptr, *Earliest = nullptr;
unsigned Idx = 0, N = Record.size();
while (Idx < N) {
  MacroDirective *MD = nullptr;
  SourceLocation Loc = ReadSourceLocation(M, Record, Idx);
  MacroDirective::Kind K = (MacroDirective::Kind)Record[Idx++];
  switch (K) {
  case MacroDirective::MD_Define: {
    MacroInfo *MI = getMacro(getGlobalMacroID(M, Record[Idx++]));
    MD = PP.AllocateDefMacroDirective(MI, Loc);
    break;
  }
  case MacroDirective::MD_Undefine:
    MD = PP.AllocateUndefMacroDirective(Loc);
    break;
  case MacroDirective::MD_Visibility:
    bool isPublic = Record[Idx++];
    MD = PP.AllocateVisibilityMacroDirective(Loc, isPublic);
    break;
  }

  if (!Latest)
    Latest = MD;
  if (Earliest)
    Earliest->setPrevious(MD);
  Earliest = MD;
}

if (Latest)
  PP.setLoadedMacroDirective(II, Earliest, Latest);
2221}

2223bool ASTReader::shouldDisableValidationForFile(
  const serialization::ModuleFile &M) const {
if (DisableValidationKind == DisableValidationForModuleKind::None)
  return false;

// If a PCH is loaded and validation is disabled for PCH then disable
// validation for the PCH and the modules it loads.
ModuleKind K = CurrentDeserializingModuleKind.getValueOr(M.Kind);

switch (K) {
case MK_MainFile:
case MK_Preamble:
case MK_PCH:
  return bool(DisableValidationKind & DisableValidationForModuleKind::PCH);
case MK_ImplicitModule:
case MK_ExplicitModule:
case MK_PrebuiltModule:
  return bool(DisableValidationKind & DisableValidationForModuleKind::Module);
}

return false;
2244}

2246ASTReader::InputFileInfo
2247ASTReader::readInputFileInfo(ModuleFile &F, unsigned ID) {
// Go find this input file.
BitstreamCursor &Cursor = F.InputFilesCursor;
SavedStreamPosition SavedPosition(Cursor);
if (llvm::Error Err = Cursor.JumpToBit(F.InputFileOffsets[ID - 1])) {
  // FIXME this drops errors on the floor.
  consumeError(std::move(Err));
}

Expected<unsigned> MaybeCode = Cursor.ReadCode();
if (!MaybeCode) {
  // FIXME this drops errors on the floor.
  consumeError(MaybeCode.takeError());
}
unsigned Code = MaybeCode.get();
RecordData Record;
StringRef Blob;

if (Expected<unsigned> Maybe = Cursor.readRecord(Code, Record, &Blob))
  assert(static_cast<InputFileRecordTypes>(Maybe.get()) == INPUT_FILE &&((void)0)
         "invalid record type for input file")((void)0);
else {
  // FIXME this drops errors on the floor.
  consumeError(Maybe.takeError());
}

assert(Record[0] == ID && "Bogus stored ID or offset")((void)0);
InputFileInfo R;
R.StoredSize = static_cast<off_t>(Record[1]);
R.StoredTime = static_cast<time_t>(Record[2]);
R.Overridden = static_cast<bool>(Record[3]);
R.Transient = static_cast<bool>(Record[4]);
R.TopLevelModuleMap = static_cast<bool>(Record[5]);
R.Filename = std::string(Blob);
ResolveImportedPath(F, R.Filename);

Expected<llvm::BitstreamEntry> MaybeEntry = Cursor.advance();
if (!MaybeEntry) // FIXME this drops errors on the floor.
  consumeError(MaybeEntry.takeError());
llvm::BitstreamEntry Entry = MaybeEntry.get();
assert(Entry.Kind == llvm::BitstreamEntry::Record &&((void)0)
       "expected record type for input file hash")((void)0);

Record.clear();
if (Expected<unsigned> Maybe = Cursor.readRecord(Entry.ID, Record))
  assert(static_cast<InputFileRecordTypes>(Maybe.get()) == INPUT_FILE_HASH &&((void)0)
         "invalid record type for input file hash")((void)0);
else {
  // FIXME this drops errors on the floor.
  consumeError(Maybe.takeError());
}
R.ContentHash = (static_cast<uint64_t>(Record[1]) << 32) |
                static_cast<uint64_t>(Record[0]);
return R;
2301}

2303static unsigned moduleKindForDiagnostic(ModuleKind Kind);
2304InputFile ASTReader::getInputFile(ModuleFile &F, unsigned ID, bool Complain) {
// If this ID is bogus, just return an empty input file.
if (ID == 0 || ID > F.InputFilesLoaded.size())
  return InputFile();

// If we've already loaded this input file, return it.
if (F.InputFilesLoaded[ID-1].getFile())
  return F.InputFilesLoaded[ID-1];

if (F.InputFilesLoaded[ID-1].isNotFound())
  return InputFile();

// Go find this input file.
BitstreamCursor &Cursor = F.InputFilesCursor;
SavedStreamPosition SavedPosition(Cursor);
if (llvm::Error Err = Cursor.JumpToBit(F.InputFileOffsets[ID - 1])) {
  // FIXME this drops errors on the floor.
  consumeError(std::move(Err));
}

InputFileInfo FI = readInputFileInfo(F, ID);
off_t StoredSize = FI.StoredSize;
time_t StoredTime = FI.StoredTime;
bool Overridden = FI.Overridden;
bool Transient = FI.Transient;
StringRef Filename = FI.Filename;
uint64_t StoredContentHash = FI.ContentHash;

OptionalFileEntryRefDegradesToFileEntryPtr File =
    expectedToOptional(FileMgr.getFileRef(Filename, /*OpenFile=*/false));

// If we didn't find the file, resolve it relative to the
// original directory from which this AST file was created.
if (!File && !F.OriginalDir.empty() && !F.BaseDirectory.empty() &&
    F.OriginalDir != F.BaseDirectory) {
  std::string Resolved = resolveFileRelativeToOriginalDir(
      std::string(Filename), F.OriginalDir, F.BaseDirectory);
  if (!Resolved.empty())
    File = expectedToOptional(FileMgr.getFileRef(Resolved));
}

// For an overridden file, create a virtual file with the stored
// size/timestamp.
if ((Overridden || Transient) && !File)
  File = FileMgr.getVirtualFileRef(Filename, StoredSize, StoredTime);

if (!File) {
  if (Complain) {
    std::string ErrorStr = "could not find file '";
    ErrorStr += Filename;
    ErrorStr += "' referenced by AST file '";
    ErrorStr += F.FileName;
    ErrorStr += "'";
    Error(ErrorStr);
  }
  // Record that we didn't find the file.
  F.InputFilesLoaded[ID-1] = InputFile::getNotFound();
  return InputFile();
}

// Check if there was a request to override the contents of the file
// that was part of the precompiled header. Overriding such a file
// can lead to problems when lexing using the source locations from the
// PCH.
SourceManager &SM = getSourceManager();
// FIXME: Reject if the overrides are different.
if ((!Overridden && !Transient) && SM.isFileOverridden(File)) {
  if (Complain)
    Error(diag::err_fe_pch_file_overridden, Filename);

  // After emitting the diagnostic, bypass the overriding file to recover
  // (this creates a separate FileEntry).
  File = SM.bypassFileContentsOverride(*File);
  if (!File) {
    F.InputFilesLoaded[ID - 1] = InputFile::getNotFound();
    return InputFile();
  }
}

enum ModificationType {
  Size,
  ModTime,
  Content,
  None,
};
auto HasInputFileChanged = [&]() {
  if (StoredSize != File->getSize())
    return ModificationType::Size;
  if (!shouldDisableValidationForFile(F) && StoredTime &&
      StoredTime != File->getModificationTime()) {
    // In case the modification time changes but not the content,
    // accept the cached file as legit.
    if (ValidateASTInputFilesContent &&
        StoredContentHash != static_cast<uint64_t>(llvm::hash_code(-1))) {
      auto MemBuffOrError = FileMgr.getBufferForFile(File);
      if (!MemBuffOrError) {
        if (!Complain)
          return ModificationType::ModTime;
        std::string ErrorStr = "could not get buffer for file '";
        ErrorStr += File->getName();
        ErrorStr += "'";
        Error(ErrorStr);
        return ModificationType::ModTime;
      }

      auto ContentHash = hash_value(MemBuffOrError.get()->getBuffer());
      if (StoredContentHash == static_cast<uint64_t>(ContentHash))
        return ModificationType::None;
      return ModificationType::Content;
    }
    return ModificationType::ModTime;
  }
  return ModificationType::None;
};

bool IsOutOfDate = false;
auto FileChange = HasInputFileChanged();
// For an overridden file, there is nothing to validate.
if (!Overridden && FileChange != ModificationType::None) {
  if (Complain && !Diags.isDiagnosticInFlight()) {
    // Build a list of the PCH imports that got us here (in reverse).
    SmallVector<ModuleFile *, 4> ImportStack(1, &F);
    while (!ImportStack.back()->ImportedBy.empty())
      ImportStack.push_back(ImportStack.back()->ImportedBy[0]);

    // The top-level PCH is stale.
    StringRef TopLevelPCHName(ImportStack.back()->FileName);
    Diag(diag::err_fe_ast_file_modified)
        << Filename << moduleKindForDiagnostic(ImportStack.back()->Kind)
        << TopLevelPCHName << FileChange;

    // Print the import stack.
    if (ImportStack.size() > 1) {
      Diag(diag::note_pch_required_by)
        << Filename << ImportStack[0]->FileName;
      for (unsigned I = 1; I < ImportStack.size(); ++I)
        Diag(diag::note_pch_required_by)
          << ImportStack[I-1]->FileName << ImportStack[I]->FileName;
    }

    Diag(diag::note_pch_rebuild_required) << TopLevelPCHName;
  }

  IsOutOfDate = true;
}
// FIXME: If the file is overridden and we've already opened it,
// issue an error (or split it into a separate FileEntry).

InputFile IF = InputFile(*File, Overridden || Transient, IsOutOfDate);

// Note that we've loaded this input file.
F.InputFilesLoaded[ID-1] = IF;
return IF;
2457}

2459/// If we are loading a relocatable PCH or module file, and the filename
2460/// is not an absolute path, add the system or module root to the beginning of
2461/// the file name.
2462void ASTReader::ResolveImportedPath(ModuleFile &M, std::string &Filename) {
// Resolve relative to the base directory, if we have one.
if (!M.BaseDirectory.empty())
  return ResolveImportedPath(Filename, M.BaseDirectory);
2466}

2468void ASTReader::ResolveImportedPath(std::string &Filename, StringRef Prefix) {
if (Filename.empty() || llvm::sys::path::is_absolute(Filename))
  return;

SmallString<128> Buffer;
llvm::sys::path::append(Buffer, Prefix, Filename);
Filename.assign(Buffer.begin(), Buffer.end());
2475}

2477static bool isDiagnosedResult(ASTReader::ASTReadResult ARR, unsigned Caps) {
switch (ARR) {
case ASTReader::Failure: return true;
case ASTReader::Missing: return !(Caps & ASTReader::ARR_Missing);
case ASTReader::OutOfDate: return !(Caps & ASTReader::ARR_OutOfDate);
case ASTReader::VersionMismatch: return !(Caps & ASTReader::ARR_VersionMismatch);
case ASTReader::ConfigurationMismatch:
  return !(Caps & ASTReader::ARR_ConfigurationMismatch);
case ASTReader::HadErrors: return true;
case ASTReader::Success: return false;
}

llvm_unreachable("unknown ASTReadResult")__builtin_unreachable();
2490}

2492ASTReader::ASTReadResult ASTReader::ReadOptionsBlock(
  BitstreamCursor &Stream, unsigned ClientLoadCapabilities,
  bool AllowCompatibleConfigurationMismatch, ASTReaderListener &Listener,
  std::string &SuggestedPredefines) {
if (llvm::Error Err = Stream.EnterSubBlock(OPTIONS_BLOCK_ID)) {
  // FIXME this drops errors on the floor.
  consumeError(std::move(Err));
  return Failure;
}

// Read all of the records in the options block.
RecordData Record;
ASTReadResult Result = Success;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
  if (!MaybeEntry) {
    // FIXME this drops errors on the floor.
    consumeError(MaybeEntry.takeError());
    return Failure;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::Error:
  case llvm::BitstreamEntry::SubBlock:
    return Failure;

  case llvm::BitstreamEntry::EndBlock:
    return Result;

  case llvm::BitstreamEntry::Record:
    // The interesting case.
    break;
  }

  // Read and process a record.
  Record.clear();
  Expected<unsigned> MaybeRecordType = Stream.readRecord(Entry.ID, Record);
  if (!MaybeRecordType) {
    // FIXME this drops errors on the floor.
    consumeError(MaybeRecordType.takeError());
    return Failure;
  }
  switch ((OptionsRecordTypes)MaybeRecordType.get()) {
  case LANGUAGE_OPTIONS: {
    bool Complain = (ClientLoadCapabilities & ARR_ConfigurationMismatch) == 0;
    if (ParseLanguageOptions(Record, Complain, Listener,
                             AllowCompatibleConfigurationMismatch))
      Result = ConfigurationMismatch;
    break;
  }

  case TARGET_OPTIONS: {
    bool Complain = (ClientLoadCapabilities & ARR_ConfigurationMismatch) == 0;
    if (ParseTargetOptions(Record, Complain, Listener,
                           AllowCompatibleConfigurationMismatch))
      Result = ConfigurationMismatch;
    break;
  }

  case FILE_SYSTEM_OPTIONS: {
    bool Complain = (ClientLoadCapabilities & ARR_ConfigurationMismatch) == 0;
    if (!AllowCompatibleConfigurationMismatch &&
        ParseFileSystemOptions(Record, Complain, Listener))
      Result = ConfigurationMismatch;
    break;
  }

  case HEADER_SEARCH_OPTIONS: {
    bool Complain = (ClientLoadCapabilities & ARR_ConfigurationMismatch) == 0;
    if (!AllowCompatibleConfigurationMismatch &&
        ParseHeaderSearchOptions(Record, Complain, Listener))
      Result = ConfigurationMismatch;
    break;
  }

  case PREPROCESSOR_OPTIONS:
    bool Complain = (ClientLoadCapabilities & ARR_ConfigurationMismatch) == 0;
    if (!AllowCompatibleConfigurationMismatch &&
        ParsePreprocessorOptions(Record, Complain, Listener,
                                 SuggestedPredefines))
      Result = ConfigurationMismatch;
    break;
  }
}
2577}

2579ASTReader::ASTReadResult
2580ASTReader::ReadControlBlock(ModuleFile &F,
                          SmallVectorImpl<ImportedModule> &Loaded,
                          const ModuleFile *ImportedBy,
                          unsigned ClientLoadCapabilities) {
BitstreamCursor &Stream = F.Stream;

if (llvm::Error Err = Stream.EnterSubBlock(CONTROL_BLOCK_ID)) {
  Error(std::move(Err));
  return Failure;
}

// Lambda to read the unhashed control block the first time it's called.
//
// For PCM files, the unhashed control block cannot be read until after the
// MODULE_NAME record.  However, PCH files have no MODULE_NAME, and yet still
// need to look ahead before reading the IMPORTS record.  For consistency,
// this block is always read somehow (see BitstreamEntry::EndBlock).
bool HasReadUnhashedControlBlock = false;
auto readUnhashedControlBlockOnce = [&]() {
  if (!HasReadUnhashedControlBlock) {
    HasReadUnhashedControlBlock = true;
    if (ASTReadResult Result =
            readUnhashedControlBlock(F, ImportedBy, ClientLoadCapabilities))
      return Result;
  }
  return Success;
};

bool DisableValidation = shouldDisableValidationForFile(F);

// Read all of the records and blocks in the control block.
RecordData Record;
unsigned NumInputs = 0;
unsigned NumUserInputs = 0;
StringRef BaseDirectoryAsWritten;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
  if (!MaybeEntry) {
    Error(MaybeEntry.takeError());
    return Failure;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::Error:
    Error("malformed block record in AST file");
    return Failure;
  case llvm::BitstreamEntry::EndBlock: {
    // Validate the module before returning.  This call catches an AST with
    // no module name and no imports.
    if (ASTReadResult Result = readUnhashedControlBlockOnce())
      return Result;

    // Validate input files.
    const HeaderSearchOptions &HSOpts =
        PP.getHeaderSearchInfo().getHeaderSearchOpts();

    // All user input files reside at the index range [0, NumUserInputs), and
    // system input files reside at [NumUserInputs, NumInputs). For explicitly
    // loaded module files, ignore missing inputs.
    if (!DisableValidation && F.Kind != MK_ExplicitModule &&
        F.Kind != MK_PrebuiltModule) {
      bool Complain = (ClientLoadCapabilities & ARR_OutOfDate) == 0;

      // If we are reading a module, we will create a verification timestamp,
      // so we verify all input files.  Otherwise, verify only user input
      // files.

      unsigned N = NumUserInputs;
      if (ValidateSystemInputs ||
          (HSOpts.ModulesValidateOncePerBuildSession &&
           F.InputFilesValidationTimestamp <= HSOpts.BuildSessionTimestamp &&
           F.Kind == MK_ImplicitModule))
        N = NumInputs;

      for (unsigned I = 0; I < N; ++I) {
        InputFile IF = getInputFile(F, I+1, Complain);
        if (!IF.getFile() || IF.isOutOfDate())
          return OutOfDate;
      }
    }

    if (Listener)
      Listener->visitModuleFile(F.FileName, F.Kind);

    if (Listener && Listener->needsInputFileVisitation()) {
      unsigned N = Listener->needsSystemInputFileVisitation() ? NumInputs
                                                              : NumUserInputs;
      for (unsigned I = 0; I < N; ++I) {
        bool IsSystem = I >= NumUserInputs;
        InputFileInfo FI = readInputFileInfo(F, I+1);
        Listener->visitInputFile(FI.Filename, IsSystem, FI.Overridden,
                                 F.Kind == MK_ExplicitModule ||
                                 F.Kind == MK_PrebuiltModule);
      }
    }

    return Success;
  }

  case llvm::BitstreamEntry::SubBlock:
    switch (Entry.ID) {
    case INPUT_FILES_BLOCK_ID:
      F.InputFilesCursor = Stream;
      if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      if (ReadBlockAbbrevs(F.InputFilesCursor, INPUT_FILES_BLOCK_ID)) {
        Error("malformed block record in AST file");
        return Failure;
      }
      continue;

    case OPTIONS_BLOCK_ID:
      // If we're reading the first module for this group, check its options
      // are compatible with ours. For modules it imports, no further checking
      // is required, because we checked them when we built it.
      if (Listener && !ImportedBy) {
        // Should we allow the configuration of the module file to differ from
        // the configuration of the current translation unit in a compatible
        // way?
        //
        // FIXME: Allow this for files explicitly specified with -include-pch.
        bool AllowCompatibleConfigurationMismatch =
            F.Kind == MK_ExplicitModule || F.Kind == MK_PrebuiltModule;

        ASTReadResult Result =
            ReadOptionsBlock(Stream, ClientLoadCapabilities,
                             AllowCompatibleConfigurationMismatch, *Listener,
                             SuggestedPredefines);
        if (Result == Failure) {
          Error("malformed block record in AST file");
          return Result;
        }

        if (DisableValidation ||
            (AllowConfigurationMismatch && Result == ConfigurationMismatch))
          Result = Success;

        // If we can't load the module, exit early since we likely
        // will rebuild the module anyway. The stream may be in the
        // middle of a block.
        if (Result != Success)
          return Result;
      } else if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      continue;

    default:
      if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      continue;
    }

  case llvm::BitstreamEntry::Record:
    // The interesting case.
    break;
  }

  // Read and process a record.
  Record.clear();
  StringRef Blob;
  Expected<unsigned> MaybeRecordType =
      Stream.readRecord(Entry.ID, Record, &Blob);
  if (!MaybeRecordType) {
    Error(MaybeRecordType.takeError());
    return Failure;
  }
  switch ((ControlRecordTypes)MaybeRecordType.get()) {
  case METADATA: {
    if (Record[0] != VERSION_MAJOR && !DisableValidation) {
      if ((ClientLoadCapabilities & ARR_VersionMismatch) == 0)
        Diag(Record[0] < VERSION_MAJOR? diag::err_pch_version_too_old
                                      : diag::err_pch_version_too_new);
      return VersionMismatch;
    }

    bool hasErrors = Record[6];
    if (hasErrors && !DisableValidation) {
      // If requested by the caller and the module hasn't already been read
      // or compiled, mark modules on error as out-of-date.
      if ((ClientLoadCapabilities & ARR_TreatModuleWithErrorsAsOutOfDate) &&
          canRecoverFromOutOfDate(F.FileName, ClientLoadCapabilities))
        return OutOfDate;

      if (!AllowASTWithCompilerErrors) {
        Diag(diag::err_pch_with_compiler_errors);
        return HadErrors;
      }
    }
    if (hasErrors) {
      Diags.ErrorOccurred = true;
      Diags.UncompilableErrorOccurred = true;
      Diags.UnrecoverableErrorOccurred = true;
    }

    F.RelocatablePCH = Record[4];
    // Relative paths in a relocatable PCH are relative to our sysroot.
    if (F.RelocatablePCH)
      F.BaseDirectory = isysroot.empty() ? "/" : isysroot;

    F.HasTimestamps = Record[5];

    const std::string &CurBranch = getClangFullRepositoryVersion();
    StringRef ASTBranch = Blob;
    if (StringRef(CurBranch) != ASTBranch && !DisableValidation) {
      if ((ClientLoadCapabilities & ARR_VersionMismatch) == 0)
        Diag(diag::err_pch_different_branch) << ASTBranch << CurBranch;
      return VersionMismatch;
    }
    break;
  }

  case IMPORTS: {
    // Validate the AST before processing any imports (otherwise, untangling
    // them can be error-prone and expensive).  A module will have a name and
    // will already have been validated, but this catches the PCH case.
    if (ASTReadResult Result = readUnhashedControlBlockOnce())
      return Result;

    // Load each of the imported PCH files.
    unsigned Idx = 0, N = Record.size();
    while (Idx < N) {
      // Read information about the AST file.
      ModuleKind ImportedKind = (ModuleKind)Record[Idx++];
      // The import location will be the local one for now; we will adjust
      // all import locations of module imports after the global source
      // location info are setup, in ReadAST.
      SourceLocation ImportLoc =
          ReadUntranslatedSourceLocation(Record[Idx++]);
      off_t StoredSize = (off_t)Record[Idx++];
      time_t StoredModTime = (time_t)Record[Idx++];
      auto FirstSignatureByte = Record.begin() + Idx;
      ASTFileSignature StoredSignature = ASTFileSignature::create(
          FirstSignatureByte, FirstSignatureByte + ASTFileSignature::size);
      Idx += ASTFileSignature::size;

      std::string ImportedName = ReadString(Record, Idx);
      std::string ImportedFile;

      // For prebuilt and explicit modules first consult the file map for
      // an override. Note that here we don't search prebuilt module
      // directories, only the explicit name to file mappings. Also, we will
      // still verify the size/signature making sure it is essentially the
      // same file but perhaps in a different location.
      if (ImportedKind == MK_PrebuiltModule || ImportedKind == MK_ExplicitModule)
        ImportedFile = PP.getHeaderSearchInfo().getPrebuiltModuleFileName(
          ImportedName, /*FileMapOnly*/ true);

      if (ImportedFile.empty())
        // Use BaseDirectoryAsWritten to ensure we use the same path in the
        // ModuleCache as when writing.
        ImportedFile = ReadPath(BaseDirectoryAsWritten, Record, Idx);
      else
        SkipPath(Record, Idx);

      // If our client can't cope with us being out of date, we can't cope with
      // our dependency being missing.
      unsigned Capabilities = ClientLoadCapabilities;
      if ((ClientLoadCapabilities & ARR_OutOfDate) == 0)
        Capabilities &= ~ARR_Missing;

      // Load the AST file.
      auto Result = ReadASTCore(ImportedFile, ImportedKind, ImportLoc, &F,
                                Loaded, StoredSize, StoredModTime,
                                StoredSignature, Capabilities);

      // If we diagnosed a problem, produce a backtrace.
      bool recompilingFinalized =
          Result == OutOfDate && (Capabilities & ARR_OutOfDate) &&
          getModuleManager().getModuleCache().isPCMFinal(F.FileName);
      if (isDiagnosedResult(Result, Capabilities) || recompilingFinalized)
        Diag(diag::note_module_file_imported_by)
            << F.FileName << !F.ModuleName.empty() << F.ModuleName;
      if (recompilingFinalized)
        Diag(diag::note_module_file_conflict);

      switch (Result) {
      case Failure: return Failure;
        // If we have to ignore the dependency, we'll have to ignore this too.
      case Missing:
      case OutOfDate: return OutOfDate;
      case VersionMismatch: return VersionMismatch;
      case ConfigurationMismatch: return ConfigurationMismatch;
      case HadErrors: return HadErrors;
      case Success: break;
      }
    }
    break;
  }

  case ORIGINAL_FILE:
    F.OriginalSourceFileID = FileID::get(Record[0]);
    F.ActualOriginalSourceFileName = std::string(Blob);
    F.OriginalSourceFileName = F.ActualOriginalSourceFileName;
    ResolveImportedPath(F, F.OriginalSourceFileName);
    break;

  case ORIGINAL_FILE_ID:
    F.OriginalSourceFileID = FileID::get(Record[0]);
    break;

  case ORIGINAL_PCH_DIR:
    F.OriginalDir = std::string(Blob);
    break;

  case MODULE_NAME:
    F.ModuleName = std::string(Blob);
    Diag(diag::remark_module_import)
        << F.ModuleName << F.FileName << (ImportedBy ? true : false)
        << (ImportedBy ? StringRef(ImportedBy->ModuleName) : StringRef());
    if (Listener)
      Listener->ReadModuleName(F.ModuleName);

    // Validate the AST as soon as we have a name so we can exit early on
    // failure.
    if (ASTReadResult Result = readUnhashedControlBlockOnce())
      return Result;

    break;

  case MODULE_DIRECTORY: {
    // Save the BaseDirectory as written in the PCM for computing the module
    // filename for the ModuleCache.
    BaseDirectoryAsWritten = Blob;
    assert(!F.ModuleName.empty() &&((void)0)
           "MODULE_DIRECTORY found before MODULE_NAME")((void)0);
    // If we've already loaded a module map file covering this module, we may
    // have a better path for it (relative to the current build).
    Module *M = PP.getHeaderSearchInfo().lookupModule(
        F.ModuleName, /*AllowSearch*/ true,
        /*AllowExtraModuleMapSearch*/ true);
    if (M && M->Directory) {
      // If we're implicitly loading a module, the base directory can't
      // change between the build and use.
      // Don't emit module relocation error if we have -fno-validate-pch
      if (!bool(PP.getPreprocessorOpts().DisablePCHOrModuleValidation &
                DisableValidationForModuleKind::Module) &&
          F.Kind != MK_ExplicitModule && F.Kind != MK_PrebuiltModule) {
        auto BuildDir = PP.getFileManager().getDirectory(Blob);
        if (!BuildDir || *BuildDir != M->Directory) {
          if (!canRecoverFromOutOfDate(F.FileName, ClientLoadCapabilities))
            Diag(diag::err_imported_module_relocated)
                << F.ModuleName << Blob << M->Directory->getName();
          return OutOfDate;
        }
      }
      F.BaseDirectory = std::string(M->Directory->getName());
    } else {
      F.BaseDirectory = std::string(Blob);
    }
    break;
  }

  case MODULE_MAP_FILE:
    if (ASTReadResult Result =
            ReadModuleMapFileBlock(Record, F, ImportedBy, ClientLoadCapabilities))
      return Result;
    break;

  case INPUT_FILE_OFFSETS:
    NumInputs = Record[0];
    NumUserInputs = Record[1];
    F.InputFileOffsets =
        (const llvm::support::unaligned_uint64_t *)Blob.data();
    F.InputFilesLoaded.resize(NumInputs);
    F.NumUserInputFiles = NumUserInputs;
    break;
  }
}
2955}

2957ASTReader::ASTReadResult
2958ASTReader::ReadASTBlock(ModuleFile &F, unsigned ClientLoadCapabilities) {
BitstreamCursor &Stream = F.Stream;

if (llvm::Error Err = Stream.EnterSubBlock(AST_BLOCK_ID)) {
  Error(std::move(Err));
  return Failure;
}
F.ASTBlockStartOffset = Stream.GetCurrentBitNo();

// Read all of the records and blocks for the AST file.
RecordData Record;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
  if (!MaybeEntry) {
    Error(MaybeEntry.takeError());
    return Failure;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::Error:
    Error("error at end of module block in AST file");
    return Failure;
  case llvm::BitstreamEntry::EndBlock:
    // Outside of C++, we do not store a lookup map for the translation unit.
    // Instead, mark it as needing a lookup map to be built if this module
    // contains any declarations lexically within it (which it always does!).
    // This usually has no cost, since we very rarely need the lookup map for
    // the translation unit outside C++.
    if (ASTContext *Ctx = ContextObj) {
      DeclContext *DC = Ctx->getTranslationUnitDecl();
      if (DC->hasExternalLexicalStorage() && !Ctx->getLangOpts().CPlusPlus)
        DC->setMustBuildLookupTable();
    }

    return Success;
  case llvm::BitstreamEntry::SubBlock:
    switch (Entry.ID) {
    case DECLTYPES_BLOCK_ID:
      // We lazily load the decls block, but we want to set up the
      // DeclsCursor cursor to point into it.  Clone our current bitcode
      // cursor to it, enter the block and read the abbrevs in that block.
      // With the main cursor, we just skip over it.
      F.DeclsCursor = Stream;
      if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      if (ReadBlockAbbrevs(F.DeclsCursor, DECLTYPES_BLOCK_ID,
                           &F.DeclsBlockStartOffset)) {
        Error("malformed block record in AST file");
        return Failure;
      }
      break;

    case PREPROCESSOR_BLOCK_ID:
      F.MacroCursor = Stream;
      if (!PP.getExternalSource())
        PP.setExternalSource(this);

      if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      if (ReadBlockAbbrevs(F.MacroCursor, PREPROCESSOR_BLOCK_ID)) {
        Error("malformed block record in AST file");
        return Failure;
      }
      F.MacroStartOffset = F.MacroCursor.GetCurrentBitNo();
      break;

    case PREPROCESSOR_DETAIL_BLOCK_ID:
      F.PreprocessorDetailCursor = Stream;

      if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      if (ReadBlockAbbrevs(F.PreprocessorDetailCursor,
                           PREPROCESSOR_DETAIL_BLOCK_ID)) {
        Error("malformed preprocessor detail record in AST file");
        return Failure;
      }
      F.PreprocessorDetailStartOffset
      = F.PreprocessorDetailCursor.GetCurrentBitNo();

      if (!PP.getPreprocessingRecord())
        PP.createPreprocessingRecord();
      if (!PP.getPreprocessingRecord()->getExternalSource())
        PP.getPreprocessingRecord()->SetExternalSource(*this);
      break;

    case SOURCE_MANAGER_BLOCK_ID:
      if (ReadSourceManagerBlock(F))
        return Failure;
      break;

    case SUBMODULE_BLOCK_ID:
      if (ASTReadResult Result =
              ReadSubmoduleBlock(F, ClientLoadCapabilities))
        return Result;
      break;

    case COMMENTS_BLOCK_ID: {
      BitstreamCursor C = Stream;

      if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      if (ReadBlockAbbrevs(C, COMMENTS_BLOCK_ID)) {
        Error("malformed comments block in AST file");
        return Failure;
      }
      CommentsCursors.push_back(std::make_pair(C, &F));
      break;
    }

    default:
      if (llvm::Error Err = Stream.SkipBlock()) {
        Error(std::move(Err));
        return Failure;
      }
      break;
    }
    continue;

  case llvm::BitstreamEntry::Record:
    // The interesting case.
    break;
  }

  // Read and process a record.
  Record.clear();
  StringRef Blob;
  Expected<unsigned> MaybeRecordType =
      Stream.readRecord(Entry.ID, Record, &Blob);
  if (!MaybeRecordType) {
    Error(MaybeRecordType.takeError());
    return Failure;
  }
  ASTRecordTypes RecordType = (ASTRecordTypes)MaybeRecordType.get();

  // If we're not loading an AST context, we don't care about most records.
  if (!ContextObj) {
    switch (RecordType) {
    case IDENTIFIER_TABLE:
    case IDENTIFIER_OFFSET:
    case INTERESTING_IDENTIFIERS:
    case STATISTICS:
    case PP_CONDITIONAL_STACK:
    case PP_COUNTER_VALUE:
    case SOURCE_LOCATION_OFFSETS:
    case MODULE_OFFSET_MAP:
    case SOURCE_MANAGER_LINE_TABLE:
    case SOURCE_LOCATION_PRELOADS:
    case PPD_ENTITIES_OFFSETS:
    case HEADER_SEARCH_TABLE:
    case IMPORTED_MODULES:
    case MACRO_OFFSET:
      break;
    default:
      continue;
    }
  }

  switch (RecordType) {
  default:  // Default behavior: ignore.
    break;

  case TYPE_OFFSET: {
    if (F.LocalNumTypes != 0) {
      Error("duplicate TYPE_OFFSET record in AST file");
      return Failure;
    }
    F.TypeOffsets = reinterpret_cast<const UnderalignedInt64 *>(Blob.data());
    F.LocalNumTypes = Record[0];
    unsigned LocalBaseTypeIndex = Record[1];
    F.BaseTypeIndex = getTotalNumTypes();

    if (F.LocalNumTypes > 0) {
      // Introduce the global -> local mapping for types within this module.
      GlobalTypeMap.insert(std::make_pair(getTotalNumTypes(), &F));

      // Introduce the local -> global mapping for types within this module.
      F.TypeRemap.insertOrReplace(
        std::make_pair(LocalBaseTypeIndex,
                       F.BaseTypeIndex - LocalBaseTypeIndex));

      TypesLoaded.resize(TypesLoaded.size() + F.LocalNumTypes);
    }
    break;
  }

  case DECL_OFFSET: {
    if (F.LocalNumDecls != 0) {
      Error("duplicate DECL_OFFSET record in AST file");
      return Failure;
    }
    F.DeclOffsets = (const DeclOffset *)Blob.data();
    F.LocalNumDecls = Record[0];
    unsigned LocalBaseDeclID = Record[1];
    F.BaseDeclID = getTotalNumDecls();

    if (F.LocalNumDecls > 0) {
      // Introduce the global -> local mapping for declarations within this
      // module.
      GlobalDeclMap.insert(
        std::make_pair(getTotalNumDecls() + NUM_PREDEF_DECL_IDS, &F));

      // Introduce the local -> global mapping for declarations within this
      // module.
      F.DeclRemap.insertOrReplace(
        std::make_pair(LocalBaseDeclID, F.BaseDeclID - LocalBaseDeclID));

      // Introduce the global -> local mapping for declarations within this
      // module.
      F.GlobalToLocalDeclIDs[&F] = LocalBaseDeclID;

      DeclsLoaded.resize(DeclsLoaded.size() + F.LocalNumDecls);
    }
    break;
  }

  case TU_UPDATE_LEXICAL: {
    DeclContext *TU = ContextObj->getTranslationUnitDecl();
    LexicalContents Contents(
        reinterpret_cast<const llvm::support::unaligned_uint32_t *>(
            Blob.data()),
        static_cast<unsigned int>(Blob.size() / 4));
    TULexicalDecls.push_back(std::make_pair(&F, Contents));
    TU->setHasExternalLexicalStorage(true);
    break;
  }

  case UPDATE_VISIBLE: {
    unsigned Idx = 0;
    serialization::DeclID ID = ReadDeclID(F, Record, Idx);
    auto *Data = (const unsigned char*)Blob.data();
    PendingVisibleUpdates[ID].push_back(PendingVisibleUpdate{&F, Data});
    // If we've already loaded the decl, perform the updates when we finish
    // loading this block.
    if (Decl *D = GetExistingDecl(ID))
      PendingUpdateRecords.push_back(
          PendingUpdateRecord(ID, D, /*JustLoaded=*/false));
    break;
  }

  case IDENTIFIER_TABLE:
    F.IdentifierTableData =
        reinterpret_cast<const unsigned char *>(Blob.data());
    if (Record[0]) {
      F.IdentifierLookupTable = ASTIdentifierLookupTable::Create(
          F.IdentifierTableData + Record[0],
          F.IdentifierTableData + sizeof(uint32_t),
          F.IdentifierTableData,
          ASTIdentifierLookupTrait(*this, F));

      PP.getIdentifierTable().setExternalIdentifierLookup(this);
    }
    break;

  case IDENTIFIER_OFFSET: {
    if (F.LocalNumIdentifiers != 0) {
      Error("duplicate IDENTIFIER_OFFSET record in AST file");
      return Failure;
    }
    F.IdentifierOffsets = (const uint32_t *)Blob.data();
    F.LocalNumIdentifiers = Record[0];
    unsigned LocalBaseIdentifierID = Record[1];
    F.BaseIdentifierID = getTotalNumIdentifiers();

    if (F.LocalNumIdentifiers > 0) {
      // Introduce the global -> local mapping for identifiers within this
      // module.
      GlobalIdentifierMap.insert(std::make_pair(getTotalNumIdentifiers() + 1,
                                                &F));

      // Introduce the local -> global mapping for identifiers within this
      // module.
      F.IdentifierRemap.insertOrReplace(
        std::make_pair(LocalBaseIdentifierID,
                       F.BaseIdentifierID - LocalBaseIdentifierID));

      IdentifiersLoaded.resize(IdentifiersLoaded.size()
                               + F.LocalNumIdentifiers);
    }
    break;
  }

  case INTERESTING_IDENTIFIERS:
    F.PreloadIdentifierOffsets.assign(Record.begin(), Record.end());
    break;

  case EAGERLY_DESERIALIZED_DECLS:
    // FIXME: Skip reading this record if our ASTConsumer doesn't care
    // about "interesting" decls (for instance, if we're building a module).
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      EagerlyDeserializedDecls.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case MODULAR_CODEGEN_DECLS:
    // FIXME: Skip reading this record if our ASTConsumer doesn't care about
    // them (ie: if we're not codegenerating this module).
    if (F.Kind == MK_MainFile ||
        getContext().getLangOpts().BuildingPCHWithObjectFile)
      for (unsigned I = 0, N = Record.size(); I != N; ++I)
        EagerlyDeserializedDecls.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case SPECIAL_TYPES:
    if (SpecialTypes.empty()) {
      for (unsigned I = 0, N = Record.size(); I != N; ++I)
        SpecialTypes.push_back(getGlobalTypeID(F, Record[I]));
      break;
    }

    if (SpecialTypes.size() != Record.size()) {
      Error("invalid special-types record");
      return Failure;
    }

    for (unsigned I = 0, N = Record.size(); I != N; ++I) {
      serialization::TypeID ID = getGlobalTypeID(F, Record[I]);
      if (!SpecialTypes[I])
        SpecialTypes[I] = ID;
      // FIXME: If ID && SpecialTypes[I] != ID, do we need a separate
      // merge step?
    }
    break;

  case STATISTICS:
    TotalNumStatements += Record[0];
    TotalNumMacros += Record[1];
    TotalLexicalDeclContexts += Record[2];
    TotalVisibleDeclContexts += Record[3];
    break;

  case UNUSED_FILESCOPED_DECLS:
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      UnusedFileScopedDecls.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case DELEGATING_CTORS:
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      DelegatingCtorDecls.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case WEAK_UNDECLARED_IDENTIFIERS:
    if (Record.size() % 4 != 0) {
      Error("invalid weak identifiers record");
      return Failure;
    }

    // FIXME: Ignore weak undeclared identifiers from non-original PCH
    // files. This isn't the way to do it :)
    WeakUndeclaredIdentifiers.clear();

    // Translate the weak, undeclared identifiers into global IDs.
    for (unsigned I = 0, N = Record.size(); I < N; /* in loop */) {
      WeakUndeclaredIdentifiers.push_back(
        getGlobalIdentifierID(F, Record[I++]));
      WeakUndeclaredIdentifiers.push_back(
        getGlobalIdentifierID(F, Record[I++]));
      WeakUndeclaredIdentifiers.push_back(
        ReadSourceLocation(F, Record, I).getRawEncoding());
      WeakUndeclaredIdentifiers.push_back(Record[I++]);
    }
    break;

  case SELECTOR_OFFSETS: {
    F.SelectorOffsets = (const uint32_t *)Blob.data();
    F.LocalNumSelectors = Record[0];
    unsigned LocalBaseSelectorID = Record[1];
    F.BaseSelectorID = getTotalNumSelectors();

    if (F.LocalNumSelectors > 0) {
      // Introduce the global -> local mapping for selectors within this
      // module.
      GlobalSelectorMap.insert(std::make_pair(getTotalNumSelectors()+1, &F));

      // Introduce the local -> global mapping for selectors within this
      // module.
      F.SelectorRemap.insertOrReplace(
        std::make_pair(LocalBaseSelectorID,
                       F.BaseSelectorID - LocalBaseSelectorID));

      SelectorsLoaded.resize(SelectorsLoaded.size() + F.LocalNumSelectors);
    }
    break;
  }

  case METHOD_POOL:
    F.SelectorLookupTableData = (const unsigned char *)Blob.data();
    if (Record[0])
      F.SelectorLookupTable
        = ASTSelectorLookupTable::Create(
                      F.SelectorLookupTableData + Record[0],
                      F.SelectorLookupTableData,
                      ASTSelectorLookupTrait(*this, F));
    TotalNumMethodPoolEntries += Record[1];
    break;

  case REFERENCED_SELECTOR_POOL:
    if (!Record.empty()) {
      for (unsigned Idx = 0, N = Record.size() - 1; Idx < N; /* in loop */) {
        ReferencedSelectorsData.push_back(getGlobalSelectorID(F,
                                                              Record[Idx++]));
        ReferencedSelectorsData.push_back(ReadSourceLocation(F, Record, Idx).
                                            getRawEncoding());
      }
    }
    break;

  case PP_CONDITIONAL_STACK:
    if (!Record.empty()) {
      unsigned Idx = 0, End = Record.size() - 1;
      bool ReachedEOFWhileSkipping = Record[Idx++];
      llvm::Optional<Preprocessor::PreambleSkipInfo> SkipInfo;
      if (ReachedEOFWhileSkipping) {
        SourceLocation HashToken = ReadSourceLocation(F, Record, Idx);
        SourceLocation IfTokenLoc = ReadSourceLocation(F, Record, Idx);
        bool FoundNonSkipPortion = Record[Idx++];
        bool FoundElse = Record[Idx++];
        SourceLocation ElseLoc = ReadSourceLocation(F, Record, Idx);
        SkipInfo.emplace(HashToken, IfTokenLoc, FoundNonSkipPortion,
                         FoundElse, ElseLoc);
      }
      SmallVector<PPConditionalInfo, 4> ConditionalStack;
      while (Idx < End) {
        auto Loc = ReadSourceLocation(F, Record, Idx);
        bool WasSkipping = Record[Idx++];
        bool FoundNonSkip = Record[Idx++];
        bool FoundElse = Record[Idx++];
        ConditionalStack.push_back(
            {Loc, WasSkipping, FoundNonSkip, FoundElse});
      }
      PP.setReplayablePreambleConditionalStack(ConditionalStack, SkipInfo);
    }
    break;

  case PP_COUNTER_VALUE:
    if (!Record.empty() && Listener)
      Listener->ReadCounter(F, Record[0]);
    break;

  case FILE_SORTED_DECLS:
    F.FileSortedDecls = (const DeclID *)Blob.data();
    F.NumFileSortedDecls = Record[0];
    break;

  case SOURCE_LOCATION_OFFSETS: {
    F.SLocEntryOffsets = (const uint32_t *)Blob.data();
    F.LocalNumSLocEntries = Record[0];
    SourceLocation::UIntTy SLocSpaceSize = Record[1];
    F.SLocEntryOffsetsBase = Record[2] + F.SourceManagerBlockStartOffset;
    std::tie(F.SLocEntryBaseID, F.SLocEntryBaseOffset) =
        SourceMgr.AllocateLoadedSLocEntries(F.LocalNumSLocEntries,
                                            SLocSpaceSize);
    if (!F.SLocEntryBaseID) {
      Error("ran out of source locations");
      break;
    }
    // Make our entry in the range map. BaseID is negative and growing, so
    // we invert it. Because we invert it, though, we need the other end of
    // the range.
    unsigned RangeStart =
        unsigned(-F.SLocEntryBaseID) - F.LocalNumSLocEntries + 1;
    GlobalSLocEntryMap.insert(std::make_pair(RangeStart, &F));
    F.FirstLoc = SourceLocation::getFromRawEncoding(F.SLocEntryBaseOffset);

    // SLocEntryBaseOffset is lower than MaxLoadedOffset and decreasing.
    assert((F.SLocEntryBaseOffset & SourceLocation::MacroIDBit) == 0)((void)0);
    GlobalSLocOffsetMap.insert(
        std::make_pair(SourceManager::MaxLoadedOffset - F.SLocEntryBaseOffset
                         - SLocSpaceSize,&F));

    // Initialize the remapping table.
    // Invalid stays invalid.
    F.SLocRemap.insertOrReplace(std::make_pair(0U, 0));
    // This module. Base was 2 when being compiled.
    F.SLocRemap.insertOrReplace(std::make_pair(
        2U, static_cast<SourceLocation::IntTy>(F.SLocEntryBaseOffset - 2)));

    TotalNumSLocEntries += F.LocalNumSLocEntries;
    break;
  }

  case MODULE_OFFSET_MAP:
    F.ModuleOffsetMap = Blob;
    break;

  case SOURCE_MANAGER_LINE_TABLE:
    if (ParseLineTable(F, Record)) {
      Error("malformed SOURCE_MANAGER_LINE_TABLE in AST file");
      return Failure;
    }
    break;

  case SOURCE_LOCATION_PRELOADS: {
    // Need to transform from the local view (1-based IDs) to the global view,
    // which is based off F.SLocEntryBaseID.
    if (!F.PreloadSLocEntries.empty()) {
      Error("Multiple SOURCE_LOCATION_PRELOADS records in AST file");
      return Failure;
    }

    F.PreloadSLocEntries.swap(Record);
    break;
  }

  case EXT_VECTOR_DECLS:
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      ExtVectorDecls.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case VTABLE_USES:
    if (Record.size() % 3 != 0) {
      Error("Invalid VTABLE_USES record");
      return Failure;
    }

    // Later tables overwrite earlier ones.
    // FIXME: Modules will have some trouble with this. This is clearly not
    // the right way to do this.
    VTableUses.clear();

    for (unsigned Idx = 0, N = Record.size(); Idx != N; /* In loop */) {
      VTableUses.push_back(getGlobalDeclID(F, Record[Idx++]));
      VTableUses.push_back(
        ReadSourceLocation(F, Record, Idx).getRawEncoding());
      VTableUses.push_back(Record[Idx++]);
    }
    break;

  case PENDING_IMPLICIT_INSTANTIATIONS:
    if (PendingInstantiations.size() % 2 != 0) {
      Error("Invalid existing PendingInstantiations");
      return Failure;
    }

    if (Record.size() % 2 != 0) {
      Error("Invalid PENDING_IMPLICIT_INSTANTIATIONS block");
      return Failure;
    }

    for (unsigned I = 0, N = Record.size(); I != N; /* in loop */) {
      PendingInstantiations.push_back(getGlobalDeclID(F, Record[I++]));
      PendingInstantiations.push_back(
        ReadSourceLocation(F, Record, I).getRawEncoding());
    }
    break;

  case SEMA_DECL_REFS:
    if (Record.size() != 3) {
      Error("Invalid SEMA_DECL_REFS block");
      return Failure;
    }
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      SemaDeclRefs.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case PPD_ENTITIES_OFFSETS: {
    F.PreprocessedEntityOffsets = (const PPEntityOffset *)Blob.data();
    assert(Blob.size() % sizeof(PPEntityOffset) == 0)((void)0);
    F.NumPreprocessedEntities = Blob.size() / sizeof(PPEntityOffset);

    unsigned LocalBasePreprocessedEntityID = Record[0];

    unsigned StartingID;
    if (!PP.getPreprocessingRecord())
      PP.createPreprocessingRecord();
    if (!PP.getPreprocessingRecord()->getExternalSource())
      PP.getPreprocessingRecord()->SetExternalSource(*this);
    StartingID
      = PP.getPreprocessingRecord()
          ->allocateLoadedEntities(F.NumPreprocessedEntities);
    F.BasePreprocessedEntityID = StartingID;

    if (F.NumPreprocessedEntities > 0) {
      // Introduce the global -> local mapping for preprocessed entities in
      // this module.
      GlobalPreprocessedEntityMap.insert(std::make_pair(StartingID, &F));

      // Introduce the local -> global mapping for preprocessed entities in
      // this module.
      F.PreprocessedEntityRemap.insertOrReplace(
        std::make_pair(LocalBasePreprocessedEntityID,
          F.BasePreprocessedEntityID - LocalBasePreprocessedEntityID));
    }

    break;
  }

  case PPD_SKIPPED_RANGES: {
    F.PreprocessedSkippedRangeOffsets = (const PPSkippedRange*)Blob.data();
    assert(Blob.size() % sizeof(PPSkippedRange) == 0)((void)0);
    F.NumPreprocessedSkippedRanges = Blob.size() / sizeof(PPSkippedRange);

    if (!PP.getPreprocessingRecord())
      PP.createPreprocessingRecord();
    if (!PP.getPreprocessingRecord()->getExternalSource())
      PP.getPreprocessingRecord()->SetExternalSource(*this);
    F.BasePreprocessedSkippedRangeID = PP.getPreprocessingRecord()
        ->allocateSkippedRanges(F.NumPreprocessedSkippedRanges);

    if (F.NumPreprocessedSkippedRanges > 0)
      GlobalSkippedRangeMap.insert(
          std::make_pair(F.BasePreprocessedSkippedRangeID, &F));
    break;
  }

  case DECL_UPDATE_OFFSETS:
    if (Record.size() % 2 != 0) {
      Error("invalid DECL_UPDATE_OFFSETS block in AST file");
      return Failure;
    }
    for (unsigned I = 0, N = Record.size(); I != N; I += 2) {
      GlobalDeclID ID = getGlobalDeclID(F, Record[I]);
      DeclUpdateOffsets[ID].push_back(std::make_pair(&F, Record[I + 1]));

      // If we've already loaded the decl, perform the updates when we finish
      // loading this block.
      if (Decl *D = GetExistingDecl(ID))
        PendingUpdateRecords.push_back(
            PendingUpdateRecord(ID, D, /*JustLoaded=*/false));
    }
    break;

  case OBJC_CATEGORIES_MAP:
    if (F.LocalNumObjCCategoriesInMap != 0) {
      Error("duplicate OBJC_CATEGORIES_MAP record in AST file");
      return Failure;
    }

    F.LocalNumObjCCategoriesInMap = Record[0];
    F.ObjCCategoriesMap = (const ObjCCategoriesInfo *)Blob.data();
    break;

  case OBJC_CATEGORIES:
    F.ObjCCategories.swap(Record);
    break;

  case CUDA_SPECIAL_DECL_REFS:
    // Later tables overwrite earlier ones.
    // FIXME: Modules will have trouble with this.
    CUDASpecialDeclRefs.clear();
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      CUDASpecialDeclRefs.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case HEADER_SEARCH_TABLE:
    F.HeaderFileInfoTableData = Blob.data();
    F.LocalNumHeaderFileInfos = Record[1];
    if (Record[0]) {
      F.HeaderFileInfoTable
        = HeaderFileInfoLookupTable::Create(
                 (const unsigned char *)F.HeaderFileInfoTableData + Record[0],
                 (const unsigned char *)F.HeaderFileInfoTableData,
                 HeaderFileInfoTrait(*this, F,
                                     &PP.getHeaderSearchInfo(),
                                     Blob.data() + Record[2]));

      PP.getHeaderSearchInfo().SetExternalSource(this);
      if (!PP.getHeaderSearchInfo().getExternalLookup())
        PP.getHeaderSearchInfo().SetExternalLookup(this);
    }
    break;

  case FP_PRAGMA_OPTIONS:
    // Later tables overwrite earlier ones.
    FPPragmaOptions.swap(Record);
    break;

  case OPENCL_EXTENSIONS:
    for (unsigned I = 0, E = Record.size(); I != E; ) {
      auto Name = ReadString(Record, I);
      auto &OptInfo = OpenCLExtensions.OptMap[Name];
      OptInfo.Supported = Record[I++] != 0;
      OptInfo.Enabled = Record[I++] != 0;
      OptInfo.WithPragma = Record[I++] != 0;
      OptInfo.Avail = Record[I++];
      OptInfo.Core = Record[I++];
      OptInfo.Opt = Record[I++];
    }
    break;

  case TENTATIVE_DEFINITIONS:
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      TentativeDefinitions.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case KNOWN_NAMESPACES:
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      KnownNamespaces.push_back(getGlobalDeclID(F, Record[I]));
    break;

  case UNDEFINED_BUT_USED:
    if (UndefinedButUsed.size() % 2 != 0) {
      Error("Invalid existing UndefinedButUsed");
      return Failure;
    }

    if (Record.size() % 2 != 0) {
      Error("invalid undefined-but-used record");
      return Failure;
    }
    for (unsigned I = 0, N = Record.size(); I != N; /* in loop */) {
      UndefinedButUsed.push_back(getGlobalDeclID(F, Record[I++]));
      UndefinedButUsed.push_back(
          ReadSourceLocation(F, Record, I).getRawEncoding());
    }
    break;

  case DELETE_EXPRS_TO_ANALYZE:
    for (unsigned I = 0, N = Record.size(); I != N;) {
      DelayedDeleteExprs.push_back(getGlobalDeclID(F, Record[I++]));
      const uint64_t Count = Record[I++];
      DelayedDeleteExprs.push_back(Count);
      for (uint64_t C = 0; C < Count; ++C) {
        DelayedDeleteExprs.push_back(ReadSourceLocation(F, Record, I).getRawEncoding());
        bool IsArrayForm = Record[I++] == 1;
        DelayedDeleteExprs.push_back(IsArrayForm);
      }
    }
    break;

  case IMPORTED_MODULES:
    if (!F.isModule()) {
      // If we aren't loading a module (which has its own exports), make
      // all of the imported modules visible.
      // FIXME: Deal with macros-only imports.
      for (unsigned I = 0, N = Record.size(); I != N; /**/) {
        unsigned GlobalID = getGlobalSubmoduleID(F, Record[I++]);
        SourceLocation Loc = ReadSourceLocation(F, Record, I);
        if (GlobalID) {
          ImportedModules.push_back(ImportedSubmodule(GlobalID, Loc));
          if (DeserializationListener)
            DeserializationListener->ModuleImportRead(GlobalID, Loc);
        }
      }
    }
    break;

  case MACRO_OFFSET: {
    if (F.LocalNumMacros != 0) {
      Error("duplicate MACRO_OFFSET record in AST file");
      return Failure;
    }
    F.MacroOffsets = (const uint32_t *)Blob.data();
    F.LocalNumMacros = Record[0];
    unsigned LocalBaseMacroID = Record[1];
    F.MacroOffsetsBase = Record[2] + F.ASTBlockStartOffset;
    F.BaseMacroID = getTotalNumMacros();

    if (F.LocalNumMacros > 0) {
      // Introduce the global -> local mapping for macros within this module.
      GlobalMacroMap.insert(std::make_pair(getTotalNumMacros() + 1, &F));

      // Introduce the local -> global mapping for macros within this module.
      F.MacroRemap.insertOrReplace(
        std::make_pair(LocalBaseMacroID,
                       F.BaseMacroID - LocalBaseMacroID));

      MacrosLoaded.resize(MacrosLoaded.size() + F.LocalNumMacros);
    }
    break;
  }

  case LATE_PARSED_TEMPLATE:
    LateParsedTemplates.emplace_back(
        std::piecewise_construct, std::forward_as_tuple(&F),
        std::forward_as_tuple(Record.begin(), Record.end()));
    break;

  case OPTIMIZE_PRAGMA_OPTIONS:
    if (Record.size() != 1) {
      Error("invalid pragma optimize record");
      return Failure;
    }
    OptimizeOffPragmaLocation = ReadSourceLocation(F, Record[0]);
    break;

  case MSSTRUCT_PRAGMA_OPTIONS:
    if (Record.size() != 1) {
      Error("invalid pragma ms_struct record");
      return Failure;
    }
    PragmaMSStructState = Record[0];
    break;

  case POINTERS_TO_MEMBERS_PRAGMA_OPTIONS:
    if (Record.size() != 2) {
      Error("invalid pragma ms_struct record");
      return Failure;
    }
    PragmaMSPointersToMembersState = Record[0];
    PointersToMembersPragmaLocation = ReadSourceLocation(F, Record[1]);
    break;

  case UNUSED_LOCAL_TYPEDEF_NAME_CANDIDATES:
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      UnusedLocalTypedefNameCandidates.push_back(
          getGlobalDeclID(F, Record[I]));
    break;

  case CUDA_PRAGMA_FORCE_HOST_DEVICE_DEPTH:
    if (Record.size() != 1) {
      Error("invalid cuda pragma options record");
      return Failure;
    }
    ForceCUDAHostDeviceDepth = Record[0];
    break;

  case ALIGN_PACK_PRAGMA_OPTIONS: {
    if (Record.size() < 3) {
      Error("invalid pragma pack record");
      return Failure;
    }
    PragmaAlignPackCurrentValue = ReadAlignPackInfo(Record[0]);
    PragmaAlignPackCurrentLocation = ReadSourceLocation(F, Record[1]);
    unsigned NumStackEntries = Record[2];
    unsigned Idx = 3;
    // Reset the stack when importing a new module.
    PragmaAlignPackStack.clear();
    for (unsigned I = 0; I < NumStackEntries; ++I) {
      PragmaAlignPackStackEntry Entry;
      Entry.Value = ReadAlignPackInfo(Record[Idx++]);
      Entry.Location = ReadSourceLocation(F, Record[Idx++]);
      Entry.PushLocation = ReadSourceLocation(F, Record[Idx++]);
      PragmaAlignPackStrings.push_back(ReadString(Record, Idx));
      Entry.SlotLabel = PragmaAlignPackStrings.back();
      PragmaAlignPackStack.push_back(Entry);
    }
    break;
  }

  case FLOAT_CONTROL_PRAGMA_OPTIONS: {
    if (Record.size() < 3) {
      Error("invalid pragma pack record");
      return Failure;
    }
    FpPragmaCurrentValue = FPOptionsOverride::getFromOpaqueInt(Record[0]);
    FpPragmaCurrentLocation = ReadSourceLocation(F, Record[1]);
    unsigned NumStackEntries = Record[2];
    unsigned Idx = 3;
    // Reset the stack when importing a new module.
    FpPragmaStack.clear();
    for (unsigned I = 0; I < NumStackEntries; ++I) {
      FpPragmaStackEntry Entry;
      Entry.Value = FPOptionsOverride::getFromOpaqueInt(Record[Idx++]);
      Entry.Location = ReadSourceLocation(F, Record[Idx++]);
      Entry.PushLocation = ReadSourceLocation(F, Record[Idx++]);
      FpPragmaStrings.push_back(ReadString(Record, Idx));
      Entry.SlotLabel = FpPragmaStrings.back();
      FpPragmaStack.push_back(Entry);
    }
    break;
  }

  case DECLS_TO_CHECK_FOR_DEFERRED_DIAGS:
    for (unsigned I = 0, N = Record.size(); I != N; ++I)
      DeclsToCheckForDeferredDiags.insert(getGlobalDeclID(F, Record[I]));
    break;
  }
}
3824}

3826void ASTReader::ReadModuleOffsetMap(ModuleFile &F) const {
assert(!F.ModuleOffsetMap.empty() && "no module offset map to read")((void)0);

// Additional remapping information.
const unsigned char *Data = (const unsigned char*)F.ModuleOffsetMap.data();
const unsigned char *DataEnd = Data + F.ModuleOffsetMap.size();
F.ModuleOffsetMap = StringRef();

// If we see this entry before SOURCE_LOCATION_OFFSETS, add placeholders.
if (F.SLocRemap.find(0) == F.SLocRemap.end()) {
  F.SLocRemap.insert(std::make_pair(0U, 0));
  F.SLocRemap.insert(std::make_pair(2U, 1));
}

// Continuous range maps we may be updating in our module.
using SLocRemapBuilder =
    ContinuousRangeMap<SourceLocation::UIntTy, SourceLocation::IntTy,
                       2>::Builder;
using RemapBuilder = ContinuousRangeMap<uint32_t, int, 2>::Builder;
SLocRemapBuilder SLocRemap(F.SLocRemap);
RemapBuilder IdentifierRemap(F.IdentifierRemap);
RemapBuilder MacroRemap(F.MacroRemap);
RemapBuilder PreprocessedEntityRemap(F.PreprocessedEntityRemap);
RemapBuilder SubmoduleRemap(F.SubmoduleRemap);
RemapBuilder SelectorRemap(F.SelectorRemap);
RemapBuilder DeclRemap(F.DeclRemap);
RemapBuilder TypeRemap(F.TypeRemap);

while (Data < DataEnd) {
  // FIXME: Looking up dependency modules by filename is horrible. Let's
  // start fixing this with prebuilt, explicit and implicit modules and see
  // how it goes...
  using namespace llvm::support;
  ModuleKind Kind = static_cast<ModuleKind>(
    endian::readNext<uint8_t, little, unaligned>(Data));
  uint16_t Len = endian::readNext<uint16_t, little, unaligned>(Data);
  StringRef Name = StringRef((const char*)Data, Len);
  Data += Len;
  ModuleFile *OM = (Kind == MK_PrebuiltModule || Kind == MK_ExplicitModule ||
                            Kind == MK_ImplicitModule
                        ? ModuleMgr.lookupByModuleName(Name)
                        : ModuleMgr.lookupByFileName(Name));
  if (!OM) {
    std::string Msg =
        "SourceLocation remap refers to unknown module, cannot find ";
    Msg.append(std::string(Name));
    Error(Msg);
    return;
  }

  SourceLocation::UIntTy SLocOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);
  uint32_t IdentifierIDOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);
  uint32_t MacroIDOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);
  uint32_t PreprocessedEntityIDOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);
  uint32_t SubmoduleIDOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);
  uint32_t SelectorIDOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);
  uint32_t DeclIDOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);
  uint32_t TypeIndexOffset =
      endian::readNext<uint32_t, little, unaligned>(Data);

  auto mapOffset = [&](uint32_t Offset, uint32_t BaseOffset,
                       RemapBuilder &Remap) {
    constexpr uint32_t None = std::numeric_limits<uint32_t>::max();
    if (Offset != None)
      Remap.insert(std::make_pair(Offset,
                                  static_cast<int>(BaseOffset - Offset)));
  };

  constexpr SourceLocation::UIntTy SLocNone =
      std::numeric_limits<SourceLocation::UIntTy>::max();
  if (SLocOffset != SLocNone)
    SLocRemap.insert(std::make_pair(
        SLocOffset, static_cast<SourceLocation::IntTy>(
                        OM->SLocEntryBaseOffset - SLocOffset)));

  mapOffset(IdentifierIDOffset, OM->BaseIdentifierID, IdentifierRemap);
  mapOffset(MacroIDOffset, OM->BaseMacroID, MacroRemap);
  mapOffset(PreprocessedEntityIDOffset, OM->BasePreprocessedEntityID,
            PreprocessedEntityRemap);
  mapOffset(SubmoduleIDOffset, OM->BaseSubmoduleID, SubmoduleRemap);
  mapOffset(SelectorIDOffset, OM->BaseSelectorID, SelectorRemap);
  mapOffset(DeclIDOffset, OM->BaseDeclID, DeclRemap);
  mapOffset(TypeIndexOffset, OM->BaseTypeIndex, TypeRemap);

  // Global -> local mappings.
  F.GlobalToLocalDeclIDs[OM] = DeclIDOffset;
}
3920}

3922ASTReader::ASTReadResult
3923ASTReader::ReadModuleMapFileBlock(RecordData &Record, ModuleFile &F,
                                const ModuleFile *ImportedBy,
                                unsigned ClientLoadCapabilities) {
unsigned Idx = 0;
F.ModuleMapPath = ReadPath(F, Record, Idx);

// Try to resolve ModuleName in the current header search context and
// verify that it is found in the same module map file as we saved. If the
// top-level AST file is a main file, skip this check because there is no
// usable header search context.
assert(!F.ModuleName.empty() &&((void)0)
       "MODULE_NAME should come before MODULE_MAP_FILE")((void)0);
if (F.Kind == MK_ImplicitModule && ModuleMgr.begin()->Kind != MK_MainFile) {
  // An implicitly-loaded module file should have its module listed in some
  // module map file that we've already loaded.
  Module *M = PP.getHeaderSearchInfo().lookupModule(F.ModuleName);
  auto &Map = PP.getHeaderSearchInfo().getModuleMap();
  const FileEntry *ModMap = M ? Map.getModuleMapFileForUniquing(M) : nullptr;
  // Don't emit module relocation error if we have -fno-validate-pch
  if (!bool(PP.getPreprocessorOpts().DisablePCHOrModuleValidation &
            DisableValidationForModuleKind::Module) &&
      !ModMap) {
    if (!canRecoverFromOutOfDate(F.FileName, ClientLoadCapabilities)) {
      if (auto ASTFE = M ? M->getASTFile() : None) {
        // This module was defined by an imported (explicit) module.
        Diag(diag::err_module_file_conflict) << F.ModuleName << F.FileName
                                             << ASTFE->getName();
      } else {
        // This module was built with a different module map.
        Diag(diag::err_imported_module_not_found)
            << F.ModuleName << F.FileName
            << (ImportedBy ? ImportedBy->FileName : "") << F.ModuleMapPath
            << !ImportedBy;
        // In case it was imported by a PCH, there's a chance the user is
        // just missing to include the search path to the directory containing
        // the modulemap.
        if (ImportedBy && ImportedBy->Kind == MK_PCH)
          Diag(diag::note_imported_by_pch_module_not_found)
              << llvm::sys::path::parent_path(F.ModuleMapPath);
      }
    }
    return OutOfDate;
  }

  assert(M && M->Name == F.ModuleName && "found module with different name")((void)0);

  // Check the primary module map file.
  auto StoredModMap = FileMgr.getFile(F.ModuleMapPath);
  if (!StoredModMap || *StoredModMap != ModMap) {
    assert(ModMap && "found module is missing module map file")((void)0);
    assert((ImportedBy || F.Kind == MK_ImplicitModule) &&((void)0)
           "top-level import should be verified")((void)0);
    bool NotImported = F.Kind == MK_ImplicitModule && !ImportedBy;
    if (!canRecoverFromOutOfDate(F.FileName, ClientLoadCapabilities))
      Diag(diag::err_imported_module_modmap_changed)
          << F.ModuleName << (NotImported ? F.FileName : ImportedBy->FileName)
          << ModMap->getName() << F.ModuleMapPath << NotImported;
    return OutOfDate;
  }

  llvm::SmallPtrSet<const FileEntry *, 1> AdditionalStoredMaps;
  for (unsigned I = 0, N = Record[Idx++]; I < N; ++I) {
    // FIXME: we should use input files rather than storing names.
    std::string Filename = ReadPath(F, Record, Idx);
    auto SF = FileMgr.getFile(Filename, false, false);
    if (!SF) {
      if (!canRecoverFromOutOfDate(F.FileName, ClientLoadCapabilities))
        Error("could not find file '" + Filename +"' referenced by AST file");
      return OutOfDate;
    }
    AdditionalStoredMaps.insert(*SF);
  }

  // Check any additional module map files (e.g. module.private.modulemap)
  // that are not in the pcm.
  if (auto *AdditionalModuleMaps = Map.getAdditionalModuleMapFiles(M)) {
    for (const FileEntry *ModMap : *AdditionalModuleMaps) {
      // Remove files that match
      // Note: SmallPtrSet::erase is really remove
      if (!AdditionalStoredMaps.erase(ModMap)) {
        if (!canRecoverFromOutOfDate(F.FileName, ClientLoadCapabilities))
          Diag(diag::err_module_different_modmap)
            << F.ModuleName << /*new*/0 << ModMap->getName();
        return OutOfDate;
      }
    }
  }

  // Check any additional module map files that are in the pcm, but not
  // found in header search. Cases that match are already removed.
  for (const FileEntry *ModMap : AdditionalStoredMaps) {
    if (!canRecoverFromOutOfDate(F.FileName, ClientLoadCapabilities))
      Diag(diag::err_module_different_modmap)
        << F.ModuleName << /*not new*/1 << ModMap->getName();
    return OutOfDate;
  }
}

if (Listener)
  Listener->ReadModuleMapFile(F.ModuleMapPath);
return Success;
4024}

4026/// Move the given method to the back of the global list of methods.
4027static void moveMethodToBackOfGlobalList(Sema &S, ObjCMethodDecl *Method) {
// Find the entry for this selector in the method pool.
Sema::GlobalMethodPool::iterator Known
  = S.MethodPool.find(Method->getSelector());
if (Known == S.MethodPool.end())
  return;

// Retrieve the appropriate method list.
ObjCMethodList &Start = Method->isInstanceMethod()? Known->second.first
                                                  : Known->second.second;
bool Found = false;
for (ObjCMethodList *List = &Start; List; List = List->getNext()) {
  if (!Found) {
    if (List->getMethod() == Method) {
      Found = true;
    } else {
      // Keep searching.
      continue;
    }
  }

  if (List->getNext())
    List->setMethod(List->getNext()->getMethod());
  else
    List->setMethod(Method);
}
4053}

4055void ASTReader::makeNamesVisible(const HiddenNames &Names, Module *Owner) {
assert(Owner->NameVisibility != Module::Hidden && "nothing to make visible?")((void)0);
for (Decl *D : Names) {
  bool wasHidden = !D->isUnconditionallyVisible();
  D->setVisibleDespiteOwningModule();

  if (wasHidden && SemaObj) {
    if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(D)) {
      moveMethodToBackOfGlobalList(*SemaObj, Method);
    }
  }
}
4067}

4069void ASTReader::makeModuleVisible(Module *Mod,
                                Module::NameVisibilityKind NameVisibility,
                                SourceLocation ImportLoc) {
llvm::SmallPtrSet<Module *, 4> Visited;
SmallVector<Module *, 4> Stack;
Stack.push_back(Mod);
while (!Stack.empty()) {
  Mod = Stack.pop_back_val();

  if (NameVisibility <= Mod->NameVisibility) {
    // This module already has this level of visibility (or greater), so
    // there is nothing more to do.
    continue;
  }

  if (Mod->isUnimportable()) {
    // Modules that aren't importable cannot be made visible.
    continue;
  }

  // Update the module's name visibility.
  Mod->NameVisibility = NameVisibility;

  // If we've already deserialized any names from this module,
  // mark them as visible.
  HiddenNamesMapType::iterator Hidden = HiddenNamesMap.find(Mod);
  if (Hidden != HiddenNamesMap.end()) {
    auto HiddenNames = std::move(*Hidden);
    HiddenNamesMap.erase(Hidden);
    makeNamesVisible(HiddenNames.second, HiddenNames.first);
    assert(HiddenNamesMap.find(Mod) == HiddenNamesMap.end() &&((void)0)
           "making names visible added hidden names")((void)0);
  }

  // Push any exported modules onto the stack to be marked as visible.
  SmallVector<Module *, 16> Exports;
  Mod->getExportedModules(Exports);
  for (SmallVectorImpl<Module *>::iterator
         I = Exports.begin(), E = Exports.end(); I != E; ++I) {
    Module *Exported = *I;
    if (Visited.insert(Exported).second)
      Stack.push_back(Exported);
  }
}
4113}

4115/// We've merged the definition \p MergedDef into the existing definition
4116/// \p Def. Ensure that \p Def is made visible whenever \p MergedDef is made
4117/// visible.
4118void ASTReader::mergeDefinitionVisibility(NamedDecl *Def,
                                        NamedDecl *MergedDef) {
if (!Def->isUnconditionallyVisible()) {
  // If MergedDef is visible or becomes visible, make the definition visible.
  if (MergedDef->isUnconditionallyVisible())
    Def->setVisibleDespiteOwningModule();
  else {
    getContext().mergeDefinitionIntoModule(
        Def, MergedDef->getImportedOwningModule(),
        /*NotifyListeners*/ false);
    PendingMergedDefinitionsToDeduplicate.insert(Def);
  }
}
4131}

4133bool ASTReader::loadGlobalIndex() {
if (GlobalIndex)
  return false;

if (TriedLoadingGlobalIndex || !UseGlobalIndex ||
    !PP.getLangOpts().Modules)
  return true;

// Try to load the global index.
TriedLoadingGlobalIndex = true;
StringRef ModuleCachePath
  = getPreprocessor().getHeaderSearchInfo().getModuleCachePath();
std::pair<GlobalModuleIndex *, llvm::Error> Result =
    GlobalModuleIndex::readIndex(ModuleCachePath);
if (llvm::Error Err = std::move(Result.second)) {
  assert(!Result.first)((void)0);
  consumeError(std::move(Err)); // FIXME this drops errors on the floor.
  return true;
}

GlobalIndex.reset(Result.first);
ModuleMgr.setGlobalIndex(GlobalIndex.get());
return false;
4156}

4158bool ASTReader::isGlobalIndexUnavailable() const {
return PP.getLangOpts().Modules && UseGlobalIndex &&
       !hasGlobalIndex() && TriedLoadingGlobalIndex;
4161}

4163static void updateModuleTimestamp(ModuleFile &MF) {
// Overwrite the timestamp file contents so that file's mtime changes.
std::string TimestampFilename = MF.getTimestampFilename();
std::error_code EC;
llvm::raw_fd_ostream OS(TimestampFilename, EC,
                        llvm::sys::fs::OF_TextWithCRLF);
if (EC)
  return;
OS << "Timestamp file\n";
OS.close();
OS.clear_error(); // Avoid triggering a fatal error.
4174}

4176/// Given a cursor at the start of an AST file, scan ahead and drop the
4177/// cursor into the start of the given block ID, returning false on success and
4178/// true on failure.
4179static bool SkipCursorToBlock(BitstreamCursor &Cursor, unsigned BlockID) {
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Cursor.advance();
  if (!MaybeEntry) {
    // FIXME this drops errors on the floor.
    consumeError(MaybeEntry.takeError());
    return true;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::Error:
  case llvm::BitstreamEntry::EndBlock:
    return true;

  case llvm::BitstreamEntry::Record:
    // Ignore top-level records.
    if (Expected<unsigned> Skipped = Cursor.skipRecord(Entry.ID))
      break;
    else {
      // FIXME this drops errors on the floor.
      consumeError(Skipped.takeError());
      return true;
    }

  case llvm::BitstreamEntry::SubBlock:
    if (Entry.ID == BlockID) {
      if (llvm::Error Err = Cursor.EnterSubBlock(BlockID)) {
        // FIXME this drops the error on the floor.
        consumeError(std::move(Err));
        return true;
      }
      // Found it!
      return false;
    }

    if (llvm::Error Err = Cursor.SkipBlock()) {
      // FIXME this drops the error on the floor.
      consumeError(std::move(Err));
      return true;
    }
  }
}
4222}

4224ASTReader::ASTReadResult ASTReader::ReadAST(StringRef FileName,
                                          ModuleKind Type,
                                          SourceLocation ImportLoc,
                                          unsigned ClientLoadCapabilities,
                                          SmallVectorImpl<ImportedSubmodule> *Imported) {
llvm::SaveAndRestore<SourceLocation>
  SetCurImportLocRAII(CurrentImportLoc, ImportLoc);
llvm::SaveAndRestore<Optional<ModuleKind>> SetCurModuleKindRAII(
    CurrentDeserializingModuleKind, Type);

// Defer any pending actions until we get to the end of reading the AST file.
Deserializing AnASTFile(this);

// Bump the generation number.
unsigned PreviousGeneration = 0;
if (ContextObj)
1
Assuming field 'ContextObj' is null→
2
←
Taking false branch→
  PreviousGeneration = incrementGeneration(*ContextObj);

unsigned NumModules = ModuleMgr.size();
auto removeModulesAndReturn = [&](ASTReadResult ReadResult) {
  assert(ReadResult && "expected to return error")((void)0);
  ModuleMgr.removeModules(ModuleMgr.begin() + NumModules,
                          PP.getLangOpts().Modules
                              ? &PP.getHeaderSearchInfo().getModuleMap()
                              : nullptr);

  // If we find that any modules are unusable, the global index is going
  // to be out-of-date. Just remove it.
  GlobalIndex.reset();
  ModuleMgr.setGlobalIndex(nullptr);
  return ReadResult;
};

SmallVector<ImportedModule, 4> Loaded;
switch (ASTReadResult ReadResult =
3
←
Control jumps to 'case Success:'  at line 4269→
            ReadASTCore(FileName, Type, ImportLoc,
                        /*ImportedBy=*/nullptr, Loaded, 0, 0,
                        ASTFileSignature(), ClientLoadCapabilities)) {
case Failure:
case Missing:
case OutOfDate:
case VersionMismatch:
case ConfigurationMismatch:
case HadErrors:
  return removeModulesAndReturn(ReadResult);
case Success:
  break;
4
←
 Execution continues on line 4277→
}

// Here comes stuff that we only do once the entire chain is loaded.

// Load the AST blocks of all of the modules that we loaded.  We can still
// hit errors parsing the ASTs at this point.
for (ImportedModule &M : Loaded) {
5
←
Assuming '__begin1' is equal to '__end1'→
  ModuleFile &F = *M.Mod;

  // Read the AST block.
  if (ASTReadResult Result = ReadASTBlock(F, ClientLoadCapabilities))
    return removeModulesAndReturn(Result);

  // The AST block should always have a definition for the main module.
  if (F.isModule() && !F.DidReadTopLevelSubmodule) {
    Error(diag::err_module_file_missing_top_level_submodule, F.FileName);
    return removeModulesAndReturn(Failure);
  }

  // Read the extension blocks.
  while (!SkipCursorToBlock(F.Stream, EXTENSION_BLOCK_ID)) {
    if (ASTReadResult Result = ReadExtensionBlock(F))
      return removeModulesAndReturn(Result);
  }

  // Once read, set the ModuleFile bit base offset and update the size in
  // bits of all files we've seen.
  F.GlobalBitOffset = TotalModulesSizeInBits;
  TotalModulesSizeInBits += F.SizeInBits;
  GlobalBitOffsetsMap.insert(std::make_pair(F.GlobalBitOffset, &F));
}

// Preload source locations and interesting indentifiers.
for (ImportedModule &M : Loaded) {
6
←
Assuming '__begin1' is equal to '__end1'→
  ModuleFile &F = *M.Mod;

  // Preload SLocEntries.
  for (unsigned I = 0, N = F.PreloadSLocEntries.size(); I != N; ++I) {
    int Index = int(F.PreloadSLocEntries[I] - 1) + F.SLocEntryBaseID;
    // Load it through the SourceManager and don't call ReadSLocEntry()
    // directly because the entry may have already been loaded in which case
    // calling ReadSLocEntry() directly would trigger an assertion in
    // SourceManager.
    SourceMgr.getLoadedSLocEntryByID(Index);
  }

  // Map the original source file ID into the ID space of the current
  // compilation.
  if (F.OriginalSourceFileID.isValid()) {
    F.OriginalSourceFileID = FileID::get(
        F.SLocEntryBaseID + F.OriginalSourceFileID.getOpaqueValue() - 1);
  }

  // Preload all the pending interesting identifiers by marking them out of
  // date.
  for (auto Offset : F.PreloadIdentifierOffsets) {
    const unsigned char *Data = F.IdentifierTableData + Offset;

    ASTIdentifierLookupTrait Trait(*this, F);
    auto KeyDataLen = Trait.ReadKeyDataLength(Data);
    auto Key = Trait.ReadKey(Data, KeyDataLen.first);
    auto &II = PP.getIdentifierTable().getOwn(Key);
    II.setOutOfDate(true);

    // Mark this identifier as being from an AST file so that we can track
    // whether we need to serialize it.
    markIdentifierFromAST(*this, II);

    // Associate the ID with the identifier so that the writer can reuse it.
    auto ID = Trait.ReadIdentifierID(Data + KeyDataLen.first);
    SetIdentifierInfo(ID, &II);
  }
}

// Setup the import locations and notify the module manager that we've
// committed to these module files.
for (ImportedModule &M : Loaded) {
7
←
Assuming '__begin1' is equal to '__end1'→
  ModuleFile &F = *M.Mod;

  ModuleMgr.moduleFileAccepted(&F);

  // Set the import location.
  F.DirectImportLoc = ImportLoc;
  // FIXME: We assume that locations from PCH / preamble do not need
  // any translation.
  if (!M.ImportedBy)
    F.ImportLoc = M.ImportLoc;
  else
    F.ImportLoc = TranslateSourceLocation(*M.ImportedBy, M.ImportLoc);
}

if (!PP.getLangOpts().CPlusPlus ||
8
←
Assuming field 'CPlusPlus' is not equal to 0→
    (Type != MK_ImplicitModule && Type != MK_ExplicitModule &&
9
←
Assuming 'Type' is equal to MK_ImplicitModule→
     Type != MK_PrebuiltModule)) {
  // Mark all of the identifiers in the identifier table as being out of date,
  // so that various accessors know to check the loaded modules when the
  // identifier is used.
  //
  // For C++ modules, we don't need information on many identifiers (just
  // those that provide macros or are poisoned), so we mark all of
  // the interesting ones via PreloadIdentifierOffsets.
  for (IdentifierTable::iterator Id = PP.getIdentifierTable().begin(),
                              IdEnd = PP.getIdentifierTable().end();
       Id != IdEnd; ++Id)
    Id->second->setOutOfDate(true);
}
// Mark selectors as out of date.
for (auto Sel : SelectorGeneration)
  SelectorOutOfDate[Sel.first] = true;

// Resolve any unresolved module exports.
for (unsigned I = 0, N = UnresolvedModuleRefs.size(); I != N; ++I) {
10
←
Assuming 'I' is equal to 'N'→
11
←
Loop condition is false. Execution continues on line 4409→
  UnresolvedModuleRef &Unresolved = UnresolvedModuleRefs[I];
  SubmoduleID GlobalID = getGlobalSubmoduleID(*Unresolved.File,Unresolved.ID);
  Module *ResolvedMod = getSubmodule(GlobalID);

  switch (Unresolved.Kind) {
  case UnresolvedModuleRef::Conflict:
    if (ResolvedMod) {
      Module::Conflict Conflict;
      Conflict.Other = ResolvedMod;
      Conflict.Message = Unresolved.String.str();
      Unresolved.Mod->Conflicts.push_back(Conflict);
    }
    continue;

  case UnresolvedModuleRef::Import:
    if (ResolvedMod)
      Unresolved.Mod->Imports.insert(ResolvedMod);
    continue;

  case UnresolvedModuleRef::Export:
    if (ResolvedMod || Unresolved.IsWildcard)
      Unresolved.Mod->Exports.push_back(
        Module::ExportDecl(ResolvedMod, Unresolved.IsWildcard));
    continue;
  }
}
UnresolvedModuleRefs.clear();

if (Imported)
12
←
Assuming 'Imported' is null→
13
←
Taking false branch→
  Imported->append(ImportedModules.begin(),
                   ImportedModules.end());

// FIXME: How do we load the 'use'd modules? They may not be submodules.
// Might be unnecessary as use declarations are only used to build the
// module itself.

if (ContextObj)
14
←
Assuming field 'ContextObj' is non-null→
15
←
Taking true branch→
  InitializeContext();
16
←
Calling 'ASTReader::InitializeContext'→

if (SemaObj)
  UpdateSema();

if (DeserializationListener)
  DeserializationListener->ReaderInitialized(this);

ModuleFile &PrimaryModule = ModuleMgr.getPrimaryModule();
if (PrimaryModule.OriginalSourceFileID.isValid()) {
  // If this AST file is a precompiled preamble, then set the
  // preamble file ID of the source manager to the file source file
  // from which the preamble was built.
  if (Type == MK_Preamble) {
    SourceMgr.setPreambleFileID(PrimaryModule.OriginalSourceFileID);
  } else if (Type == MK_MainFile) {
    SourceMgr.setMainFileID(PrimaryModule.OriginalSourceFileID);
  }
}

// For any Objective-C class definitions we have already loaded, make sure
// that we load any additional categories.
if (ContextObj) {
  for (unsigned I = 0, N = ObjCClassesLoaded.size(); I != N; ++I) {
    loadObjCCategories(ObjCClassesLoaded[I]->getGlobalID(),
                       ObjCClassesLoaded[I],
                       PreviousGeneration);
  }
}

if (PP.getHeaderSearchInfo()
        .getHeaderSearchOpts()
        .ModulesValidateOncePerBuildSession) {
  // Now we are certain that the module and all modules it depends on are
  // up to date.  Create or update timestamp files for modules that are
  // located in the module cache (not for PCH files that could be anywhere
  // in the filesystem).
  for (unsigned I = 0, N = Loaded.size(); I != N; ++I) {
    ImportedModule &M = Loaded[I];
    if (M.Mod->Kind == MK_ImplicitModule) {
      updateModuleTimestamp(*M.Mod);
    }
  }
}

return Success;
4466}

4468static ASTFileSignature readASTFileSignature(StringRef PCH);

4470/// Whether \p Stream doesn't start with the AST/PCH file magic number 'CPCH'.
4471static llvm::Error doesntStartWithASTFileMagic(BitstreamCursor &Stream) {
// FIXME checking magic headers is done in other places such as
// SerializedDiagnosticReader and GlobalModuleIndex, but error handling isn't
// always done the same. Unify it all with a helper.
if (!Stream.canSkipToPos(4))
  return llvm::createStringError(std::errc::illegal_byte_sequence,
                                 "file too small to contain AST file magic");
for (unsigned C : {'C', 'P', 'C', 'H'})
  if (Expected<llvm::SimpleBitstreamCursor::word_t> Res = Stream.Read(8)) {
    if (Res.get() != C)
      return llvm::createStringError(
          std::errc::illegal_byte_sequence,
          "file doesn't start with AST file magic");
  } else
    return Res.takeError();
return llvm::Error::success();
4487}

4489static unsigned moduleKindForDiagnostic(ModuleKind Kind) {
switch (Kind) {
case MK_PCH:
  return 0; // PCH
case MK_ImplicitModule:
case MK_ExplicitModule:
case MK_PrebuiltModule:
  return 1; // module
case MK_MainFile:
case MK_Preamble:
  return 2; // main source file
}
llvm_unreachable("unknown module kind")__builtin_unreachable();
4502}

4504ASTReader::ASTReadResult
4505ASTReader::ReadASTCore(StringRef FileName,
                     ModuleKind Type,
                     SourceLocation ImportLoc,
                     ModuleFile *ImportedBy,
                     SmallVectorImpl<ImportedModule> &Loaded,
                     off_t ExpectedSize, time_t ExpectedModTime,
                     ASTFileSignature ExpectedSignature,
                     unsigned ClientLoadCapabilities) {
ModuleFile *M;
std::string ErrorStr;
ModuleManager::AddModuleResult AddResult
  = ModuleMgr.addModule(FileName, Type, ImportLoc, ImportedBy,
                        getGeneration(), ExpectedSize, ExpectedModTime,
                        ExpectedSignature, readASTFileSignature,
                        M, ErrorStr);

switch (AddResult) {
case ModuleManager::AlreadyLoaded:
  Diag(diag::remark_module_import)
      << M->ModuleName << M->FileName << (ImportedBy ? true : false)
      << (ImportedBy ? StringRef(ImportedBy->ModuleName) : StringRef());
  return Success;

case ModuleManager::NewlyLoaded:
  // Load module file below.
  break;

case ModuleManager::Missing:
  // The module file was missing; if the client can handle that, return
  // it.
  if (ClientLoadCapabilities & ARR_Missing)
    return Missing;

  // Otherwise, return an error.
  Diag(diag::err_ast_file_not_found)
      << moduleKindForDiagnostic(Type) << FileName << !ErrorStr.empty()
      << ErrorStr;
  return Failure;

case ModuleManager::OutOfDate:
  // We couldn't load the module file because it is out-of-date. If the
  // client can handle out-of-date, return it.
  if (ClientLoadCapabilities & ARR_OutOfDate)
    return OutOfDate;

  // Otherwise, return an error.
  Diag(diag::err_ast_file_out_of_date)
      << moduleKindForDiagnostic(Type) << FileName << !ErrorStr.empty()
      << ErrorStr;
  return Failure;
}

assert(M && "Missing module file")((void)0);

bool ShouldFinalizePCM = false;
auto FinalizeOrDropPCM = llvm::make_scope_exit([&]() {
  auto &MC = getModuleManager().getModuleCache();
  if (ShouldFinalizePCM)
    MC.finalizePCM(FileName);
  else
    MC.tryToDropPCM(FileName);
});
ModuleFile &F = *M;
BitstreamCursor &Stream = F.Stream;
Stream = BitstreamCursor(PCHContainerRdr.ExtractPCH(*F.Buffer));
F.SizeInBits = F.Buffer->getBufferSize() * 8;

// Sniff for the signature.
if (llvm::Error Err = doesntStartWithASTFileMagic(Stream)) {
  Diag(diag::err_ast_file_invalid)
      << moduleKindForDiagnostic(Type) << FileName << std::move(Err);
  return Failure;
}

// This is used for compatibility with older PCH formats.
bool HaveReadControlBlock = false;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
  if (!MaybeEntry) {
    Error(MaybeEntry.takeError());
    return Failure;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::Error:
  case llvm::BitstreamEntry::Record:
  case llvm::BitstreamEntry::EndBlock:
    Error("invalid record at top-level of AST file");
    return Failure;

  case llvm::BitstreamEntry::SubBlock:
    break;
  }

  switch (Entry.ID) {
  case CONTROL_BLOCK_ID:
    HaveReadControlBlock = true;
    switch (ReadControlBlock(F, Loaded, ImportedBy, ClientLoadCapabilities)) {
    case Success:
      // Check that we didn't try to load a non-module AST file as a module.
      //
      // FIXME: Should we also perform the converse check? Loading a module as
      // a PCH file sort of works, but it's a bit wonky.
      if ((Type == MK_ImplicitModule || Type == MK_ExplicitModule ||
           Type == MK_PrebuiltModule) &&
          F.ModuleName.empty()) {
        auto Result = (Type == MK_ImplicitModule) ? OutOfDate : Failure;
        if (Result != OutOfDate ||
            (ClientLoadCapabilities & ARR_OutOfDate) == 0)
          Diag(diag::err_module_file_not_module) << FileName;
        return Result;
      }
      break;

    case Failure: return Failure;
    case Missing: return Missing;
    case OutOfDate: return OutOfDate;
    case VersionMismatch: return VersionMismatch;
    case ConfigurationMismatch: return ConfigurationMismatch;
    case HadErrors: return HadErrors;
    }
    break;

  case AST_BLOCK_ID:
    if (!HaveReadControlBlock) {
      if ((ClientLoadCapabilities & ARR_VersionMismatch) == 0)
        Diag(diag::err_pch_version_too_old);
      return VersionMismatch;
    }

    // Record that we've loaded this module.
    Loaded.push_back(ImportedModule(M, ImportedBy, ImportLoc));
    ShouldFinalizePCM = true;
    return Success;

  case UNHASHED_CONTROL_BLOCK_ID:
    // This block is handled using look-ahead during ReadControlBlock.  We
    // shouldn't get here!
    Error("malformed block record in AST file");
    return Failure;

  default:
    if (llvm::Error Err = Stream.SkipBlock()) {
      Error(std::move(Err));
      return Failure;
    }
    break;
  }
}

llvm_unreachable("unexpected break; expected return")__builtin_unreachable();
4657}

4659ASTReader::ASTReadResult
4660ASTReader::readUnhashedControlBlock(ModuleFile &F, bool WasImportedBy,
                                  unsigned ClientLoadCapabilities) {
const HeaderSearchOptions &HSOpts =
    PP.getHeaderSearchInfo().getHeaderSearchOpts();
bool AllowCompatibleConfigurationMismatch =
    F.Kind == MK_ExplicitModule || F.Kind == MK_PrebuiltModule;
bool DisableValidation = shouldDisableValidationForFile(F);

ASTReadResult Result = readUnhashedControlBlockImpl(
    &F, F.Data, ClientLoadCapabilities, AllowCompatibleConfigurationMismatch,
    Listener.get(),
    WasImportedBy ? false : HSOpts.ModulesValidateDiagnosticOptions);

// If F was directly imported by another module, it's implicitly validated by
// the importing module.
if (DisableValidation || WasImportedBy ||
    (AllowConfigurationMismatch && Result == ConfigurationMismatch))
  return Success;

if (Result == Failure) {
  Error("malformed block record in AST file");
  return Failure;
}

if (Result == OutOfDate && F.Kind == MK_ImplicitModule) {
  // If this module has already been finalized in the ModuleCache, we're stuck
  // with it; we can only load a single version of each module.
  //
  // This can happen when a module is imported in two contexts: in one, as a
  // user module; in another, as a system module (due to an import from
  // another module marked with the [system] flag).  It usually indicates a
  // bug in the module map: this module should also be marked with [system].
  //
  // If -Wno-system-headers (the default), and the first import is as a
  // system module, then validation will fail during the as-user import,
  // since -Werror flags won't have been validated.  However, it's reasonable
  // to treat this consistently as a system module.
  //
  // If -Wsystem-headers, the PCM on disk was built with
  // -Wno-system-headers, and the first import is as a user module, then
  // validation will fail during the as-system import since the PCM on disk
  // doesn't guarantee that -Werror was respected.  However, the -Werror
  // flags were checked during the initial as-user import.
  if (getModuleManager().getModuleCache().isPCMFinal(F.FileName)) {
    Diag(diag::warn_module_system_bit_conflict) << F.FileName;
    return Success;
  }
}

return Result;
4710}

4712ASTReader::ASTReadResult ASTReader::readUnhashedControlBlockImpl(
  ModuleFile *F, llvm::StringRef StreamData, unsigned ClientLoadCapabilities,
  bool AllowCompatibleConfigurationMismatch, ASTReaderListener *Listener,
  bool ValidateDiagnosticOptions) {
// Initialize a stream.
BitstreamCursor Stream(StreamData);

// Sniff for the signature.
if (llvm::Error Err = doesntStartWithASTFileMagic(Stream)) {
  // FIXME this drops the error on the floor.
  consumeError(std::move(Err));
  return Failure;
}

// Scan for the UNHASHED_CONTROL_BLOCK_ID block.
if (SkipCursorToBlock(Stream, UNHASHED_CONTROL_BLOCK_ID))
  return Failure;

// Read all of the records in the options block.
RecordData Record;
ASTReadResult Result = Success;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
  if (!MaybeEntry) {
    // FIXME this drops the error on the floor.
    consumeError(MaybeEntry.takeError());
    return Failure;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::Error:
  case llvm::BitstreamEntry::SubBlock:
    return Failure;

  case llvm::BitstreamEntry::EndBlock:
    return Result;

  case llvm::BitstreamEntry::Record:
    // The interesting case.
    break;
  }

  // Read and process a record.
  Record.clear();
  Expected<unsigned> MaybeRecordType = Stream.readRecord(Entry.ID, Record);
  if (!MaybeRecordType) {
    // FIXME this drops the error.
    return Failure;
  }
  switch ((UnhashedControlBlockRecordTypes)MaybeRecordType.get()) {
  case SIGNATURE:
    if (F)
      F->Signature = ASTFileSignature::create(Record.begin(), Record.end());
    break;
  case AST_BLOCK_HASH:
    if (F)
      F->ASTBlockHash =
          ASTFileSignature::create(Record.begin(), Record.end());
    break;
  case DIAGNOSTIC_OPTIONS: {
    bool Complain = (ClientLoadCapabilities & ARR_OutOfDate) == 0;
    if (Listener && ValidateDiagnosticOptions &&
        !AllowCompatibleConfigurationMismatch &&
        ParseDiagnosticOptions(Record, Complain, *Listener))
      Result = OutOfDate; // Don't return early.  Read the signature.
    break;
  }
  case DIAG_PRAGMA_MAPPINGS:
    if (!F)
      break;
    if (F->PragmaDiagMappings.empty())
      F->PragmaDiagMappings.swap(Record);
    else
      F->PragmaDiagMappings.insert(F->PragmaDiagMappings.end(),
                                   Record.begin(), Record.end());
    break;
  }
}
4791}

4793/// Parse a record and blob containing module file extension metadata.
4794static bool parseModuleFileExtensionMetadata(
            const SmallVectorImpl<uint64_t> &Record,
            StringRef Blob,
            ModuleFileExtensionMetadata &Metadata) {
if (Record.size() < 4) return true;

Metadata.MajorVersion = Record[0];
Metadata.MinorVersion = Record[1];

unsigned BlockNameLen = Record[2];
unsigned UserInfoLen = Record[3];

if (BlockNameLen + UserInfoLen > Blob.size()) return true;

Metadata.BlockName = std::string(Blob.data(), Blob.data() + BlockNameLen);
Metadata.UserInfo = std::string(Blob.data() + BlockNameLen,
                                Blob.data() + BlockNameLen + UserInfoLen);
return false;
4812}

4814ASTReader::ASTReadResult ASTReader::ReadExtensionBlock(ModuleFile &F) {
BitstreamCursor &Stream = F.Stream;

RecordData Record;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
  if (!MaybeEntry) {
    Error(MaybeEntry.takeError());
    return Failure;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::SubBlock:
    if (llvm::Error Err = Stream.SkipBlock()) {
      Error(std::move(Err));
      return Failure;
    }
    continue;

  case llvm::BitstreamEntry::EndBlock:
    return Success;

  case llvm::BitstreamEntry::Error:
    return HadErrors;

  case llvm::BitstreamEntry::Record:
    break;
  }

  Record.clear();
  StringRef Blob;
  Expected<unsigned> MaybeRecCode =
      Stream.readRecord(Entry.ID, Record, &Blob);
  if (!MaybeRecCode) {
    Error(MaybeRecCode.takeError());
    return Failure;
  }
  switch (MaybeRecCode.get()) {
  case EXTENSION_METADATA: {
    ModuleFileExtensionMetadata Metadata;
    if (parseModuleFileExtensionMetadata(Record, Blob, Metadata)) {
      Error("malformed EXTENSION_METADATA in AST file");
      return Failure;
    }

    // Find a module file extension with this block name.
    auto Known = ModuleFileExtensions.find(Metadata.BlockName);
    if (Known == ModuleFileExtensions.end()) break;

    // Form a reader.
    if (auto Reader = Known->second->createExtensionReader(Metadata, *this,
                                                           F, Stream)) {
      F.ExtensionReaders.push_back(std::move(Reader));
    }

    break;
  }
  }
}

return Success;
4876}

4878void ASTReader::InitializeContext() {
assert(ContextObj && "no context to initialize")((void)0);
ASTContext &Context = *ContextObj;

// If there's a listener, notify them that we "read" the translation unit.
if (DeserializationListener)
17
←
Assuming field 'DeserializationListener' is null→
18
←
Taking false branch→
  DeserializationListener->DeclRead(PREDEF_DECL_TRANSLATION_UNIT_ID,
                                    Context.getTranslationUnitDecl());

// FIXME: Find a better way to deal with collisions between these
// built-in types. Right now, we just ignore the problem.

// Load the special types.
if (SpecialTypes.size() >= NumSpecialTypeIDs) {
19
←
Assuming the condition is true→
20
←
Taking true branch→
  if (unsigned String = SpecialTypes[SPECIAL_TYPE_CF_CONSTANT_STRING]) {
21
←
Assuming 'String' is 0→
22
←
Taking false branch→
    if (!Context.CFConstantStringTypeDecl)
      Context.setCFConstantStringType(GetType(String));
  }

  if (unsigned File = SpecialTypes[SPECIAL_TYPE_FILE]) {
23
←
Assuming 'File' is 0→
24
←
Taking false branch→
    QualType FileType = GetType(File);
    if (FileType.isNull()) {
      Error("FILE type is NULL");
      return;
    }

    if (!Context.FILEDecl) {
      if (const TypedefType *Typedef = FileType->getAs<TypedefType>())
        Context.setFILEDecl(Typedef->getDecl());
      else {
        const TagType *Tag = FileType->getAs<TagType>();
        if (!Tag) {
          Error("Invalid FILE type in AST file");
          return;
        }
        Context.setFILEDecl(Tag->getDecl());
      }
    }
  }

  if (unsigned Jmp_buf = SpecialTypes[SPECIAL_TYPE_JMP_BUF]) {
25
←
Assuming 'Jmp_buf' is 0→
26
←
Taking false branch→
    QualType Jmp_bufType = GetType(Jmp_buf);
    if (Jmp_bufType.isNull()) {
      Error("jmp_buf type is NULL");
      return;
    }

    if (!Context.jmp_bufDecl) {
      if (const TypedefType *Typedef = Jmp_bufType->getAs<TypedefType>())
        Context.setjmp_bufDecl(Typedef->getDecl());
      else {
        const TagType *Tag = Jmp_bufType->getAs<TagType>();
        if (!Tag) {
          Error("Invalid jmp_buf type in AST file");
          return;
        }
        Context.setjmp_bufDecl(Tag->getDecl());
      }
    }
  }

  if (unsigned Sigjmp_buf = SpecialTypes[SPECIAL_TYPE_SIGJMP_BUF]) {
27
←
Assuming 'Sigjmp_buf' is not equal to 0→
28
←
Taking true branch→
    QualType Sigjmp_bufType = GetType(Sigjmp_buf);
    if (Sigjmp_bufType.isNull()) {
29
←
Calling 'QualType::isNull'→
35
←
Returning from 'QualType::isNull'→
36
←
Taking false branch→
      Error("sigjmp_buf type is NULL");
      return;
    }

    if (!Context.sigjmp_bufDecl) {
37
←
Assuming field 'sigjmp_bufDecl' is null→
38
←
Taking true branch→
      if (const TypedefType *Typedef39.1
'Typedef' is null
1
'Typedef' is null
1
'Typedef' is null
 = Sigjmp_bufType->getAs<TypedefType>())
39
←
Assuming the object is not a 'TypedefType'→
40
←
Taking false branch→
        Context.setsigjmp_bufDecl(Typedef->getDecl());
      else {
        const TagType *Tag = Sigjmp_bufType->getAs<TagType>();
41
←
Assuming the object is not a 'TagType'→
42
←
'Tag' initialized to a null pointer value→
        assert(Tag && "Invalid sigjmp_buf type in AST file")((void)0);
        Context.setsigjmp_bufDecl(Tag->getDecl());
43
←
Called C++ object pointer is null
      }
    }
  }

  if (unsigned ObjCIdRedef
        = SpecialTypes[SPECIAL_TYPE_OBJC_ID_REDEFINITION]) {
    if (Context.ObjCIdRedefinitionType.isNull())
      Context.ObjCIdRedefinitionType = GetType(ObjCIdRedef);
  }

  if (unsigned ObjCClassRedef
        = SpecialTypes[SPECIAL_TYPE_OBJC_CLASS_REDEFINITION]) {
    if (Context.ObjCClassRedefinitionType.isNull())
      Context.ObjCClassRedefinitionType = GetType(ObjCClassRedef);
  }

  if (unsigned ObjCSelRedef
        = SpecialTypes[SPECIAL_TYPE_OBJC_SEL_REDEFINITION]) {
    if (Context.ObjCSelRedefinitionType.isNull())
      Context.ObjCSelRedefinitionType = GetType(ObjCSelRedef);
  }

  if (unsigned Ucontext_t = SpecialTypes[SPECIAL_TYPE_UCONTEXT_T]) {
    QualType Ucontext_tType = GetType(Ucontext_t);
    if (Ucontext_tType.isNull()) {
      Error("ucontext_t type is NULL");
      return;
    }

    if (!Context.ucontext_tDecl) {
      if (const TypedefType *Typedef = Ucontext_tType->getAs<TypedefType>())
        Context.setucontext_tDecl(Typedef->getDecl());
      else {
        const TagType *Tag = Ucontext_tType->getAs<TagType>();
        assert(Tag && "Invalid ucontext_t type in AST file")((void)0);
        Context.setucontext_tDecl(Tag->getDecl());
      }
    }
  }
}

ReadPragmaDiagnosticMappings(Context.getDiagnostics());

// If there were any CUDA special declarations, deserialize them.
if (!CUDASpecialDeclRefs.empty()) {
  assert(CUDASpecialDeclRefs.size() == 1 && "More decl refs than expected!")((void)0);
  Context.setcudaConfigureCallDecl(
                         cast<FunctionDecl>(GetDecl(CUDASpecialDeclRefs[0])));
}

// Re-export any modules that were imported by a non-module AST file.
// FIXME: This does not make macro-only imports visible again.
for (auto &Import : ImportedModules) {
  if (Module *Imported = getSubmodule(Import.ID)) {
    makeModuleVisible(Imported, Module::AllVisible,
                      /*ImportLoc=*/Import.ImportLoc);
    if (Import.ImportLoc.isValid())
      PP.makeModuleVisible(Imported, Import.ImportLoc);
    // This updates visibility for Preprocessor only. For Sema, which can be
    // nullptr here, we do the same later, in UpdateSema().
  }
}
5015}

5017void ASTReader::finalizeForWriting() {
// Nothing to do for now.
5019}

5021/// Reads and return the signature record from \p PCH's control block, or
5022/// else returns 0.
5023static ASTFileSignature readASTFileSignature(StringRef PCH) {
BitstreamCursor Stream(PCH);
if (llvm::Error Err = doesntStartWithASTFileMagic(Stream)) {
  // FIXME this drops the error on the floor.
  consumeError(std::move(Err));
  return ASTFileSignature();
}

// Scan for the UNHASHED_CONTROL_BLOCK_ID block.
if (SkipCursorToBlock(Stream, UNHASHED_CONTROL_BLOCK_ID))
  return ASTFileSignature();

// Scan for SIGNATURE inside the diagnostic options block.
ASTReader::RecordData Record;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry =
      Stream.advanceSkippingSubblocks();
  if (!MaybeEntry) {
    // FIXME this drops the error on the floor.
    consumeError(MaybeEntry.takeError());
    return ASTFileSignature();
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  if (Entry.Kind != llvm::BitstreamEntry::Record)
    return ASTFileSignature();

  Record.clear();
  StringRef Blob;
  Expected<unsigned> MaybeRecord = Stream.readRecord(Entry.ID, Record, &Blob);
  if (!MaybeRecord) {
    // FIXME this drops the error on the floor.
    consumeError(MaybeRecord.takeError());
    return ASTFileSignature();
  }
  if (SIGNATURE == MaybeRecord.get())
    return ASTFileSignature::create(Record.begin(),
                                    Record.begin() + ASTFileSignature::size);
}
5062}

5064/// Retrieve the name of the original source file name
5065/// directly from the AST file, without actually loading the AST
5066/// file.
5067std::string ASTReader::getOriginalSourceFile(
  const std::string &ASTFileName, FileManager &FileMgr,
  const PCHContainerReader &PCHContainerRdr, DiagnosticsEngine &Diags) {
// Open the AST file.
auto Buffer = FileMgr.getBufferForFile(ASTFileName);
if (!Buffer) {
  Diags.Report(diag::err_fe_unable_to_read_pch_file)
      << ASTFileName << Buffer.getError().message();
  return std::string();
}

// Initialize the stream
BitstreamCursor Stream(PCHContainerRdr.ExtractPCH(**Buffer));

// Sniff for the signature.
if (llvm::Error Err = doesntStartWithASTFileMagic(Stream)) {
  Diags.Report(diag::err_fe_not_a_pch_file) << ASTFileName << std::move(Err);
  return std::string();
}

// Scan for the CONTROL_BLOCK_ID block.
if (SkipCursorToBlock(Stream, CONTROL_BLOCK_ID)) {
  Diags.Report(diag::err_fe_pch_malformed_block) << ASTFileName;
  return std::string();
}

// Scan for ORIGINAL_FILE inside the control block.
RecordData Record;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry =
      Stream.advanceSkippingSubblocks();
  if (!MaybeEntry) {
    // FIXME this drops errors on the floor.
    consumeError(MaybeEntry.takeError());
    return std::string();
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  if (Entry.Kind == llvm::BitstreamEntry::EndBlock)
    return std::string();

  if (Entry.Kind != llvm::BitstreamEntry::Record) {
    Diags.Report(diag::err_fe_pch_malformed_block) << ASTFileName;
    return std::string();
  }

  Record.clear();
  StringRef Blob;
  Expected<unsigned> MaybeRecord = Stream.readRecord(Entry.ID, Record, &Blob);
  if (!MaybeRecord) {
    // FIXME this drops the errors on the floor.
    consumeError(MaybeRecord.takeError());
    return std::string();
  }
  if (ORIGINAL_FILE == MaybeRecord.get())
    return Blob.str();
}
5124}

5126namespace {

class SimplePCHValidator : public ASTReaderListener {
  const LangOptions &ExistingLangOpts;
  const TargetOptions &ExistingTargetOpts;
  const PreprocessorOptions &ExistingPPOpts;
  std::string ExistingModuleCachePath;
  FileManager &FileMgr;

public:
  SimplePCHValidator(const LangOptions &ExistingLangOpts,
                     const TargetOptions &ExistingTargetOpts,
                     const PreprocessorOptions &ExistingPPOpts,
                     StringRef ExistingModuleCachePath, FileManager &FileMgr)
      : ExistingLangOpts(ExistingLangOpts),
        ExistingTargetOpts(ExistingTargetOpts),
        ExistingPPOpts(ExistingPPOpts),
        ExistingModuleCachePath(ExistingModuleCachePath), FileMgr(FileMgr) {}

  bool ReadLanguageOptions(const LangOptions &LangOpts, bool Complain,
                           bool AllowCompatibleDifferences) override {
    return checkLanguageOptions(ExistingLangOpts, LangOpts, nullptr,
                                AllowCompatibleDifferences);
  }

  bool ReadTargetOptions(const TargetOptions &TargetOpts, bool Complain,
                         bool AllowCompatibleDifferences) override {
    return checkTargetOptions(ExistingTargetOpts, TargetOpts, nullptr,
                              AllowCompatibleDifferences);
  }

  bool ReadHeaderSearchOptions(const HeaderSearchOptions &HSOpts,
                               StringRef SpecificModuleCachePath,
                               bool Complain) override {
    return checkHeaderSearchOptions(HSOpts, SpecificModuleCachePath,
                                    ExistingModuleCachePath, nullptr,
                                    ExistingLangOpts, ExistingPPOpts);
  }

  bool ReadPreprocessorOptions(const PreprocessorOptions &PPOpts,
                               bool Complain,
                               std::string &SuggestedPredefines) override {
    return checkPreprocessorOptions(ExistingPPOpts, PPOpts, nullptr, FileMgr,
                                    SuggestedPredefines, ExistingLangOpts);
  }
};

5173} // namespace

5175bool ASTReader::readASTFileControlBlock(
  StringRef Filename, FileManager &FileMgr,
  const PCHContainerReader &PCHContainerRdr,
  bool FindModuleFileExtensions,
  ASTReaderListener &Listener, bool ValidateDiagnosticOptions) {
// Open the AST file.
// FIXME: This allows use of the VFS; we do not allow use of the
// VFS when actually loading a module.
auto Buffer = FileMgr.getBufferForFile(Filename);
if (!Buffer) {
  return true;
}

// Initialize the stream
StringRef Bytes = PCHContainerRdr.ExtractPCH(**Buffer);
BitstreamCursor Stream(Bytes);

// Sniff for the signature.
if (llvm::Error Err = doesntStartWithASTFileMagic(Stream)) {
  consumeError(std::move(Err)); // FIXME this drops errors on the floor.
  return true;
}

// Scan for the CONTROL_BLOCK_ID block.
if (SkipCursorToBlock(Stream, CONTROL_BLOCK_ID))
  return true;

bool NeedsInputFiles = Listener.needsInputFileVisitation();
bool NeedsSystemInputFiles = Listener.needsSystemInputFileVisitation();
bool NeedsImports = Listener.needsImportVisitation();
BitstreamCursor InputFilesCursor;

RecordData Record;
std::string ModuleDir;
bool DoneWithControlBlock = false;
while (!DoneWithControlBlock) {
  Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
  if (!MaybeEntry) {
    // FIXME this drops the error on the floor.
    consumeError(MaybeEntry.takeError());
    return true;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::SubBlock: {
    switch (Entry.ID) {
    case OPTIONS_BLOCK_ID: {
      std::string IgnoredSuggestedPredefines;
      if (ReadOptionsBlock(Stream, ARR_ConfigurationMismatch | ARR_OutOfDate,
                           /*AllowCompatibleConfigurationMismatch*/ false,
                           Listener, IgnoredSuggestedPredefines) != Success)
        return true;
      break;
    }

    case INPUT_FILES_BLOCK_ID:
      InputFilesCursor = Stream;
      if (llvm::Error Err = Stream.SkipBlock()) {
        // FIXME this drops the error on the floor.
        consumeError(std::move(Err));
        return true;
      }
      if (NeedsInputFiles &&
          ReadBlockAbbrevs(InputFilesCursor, INPUT_FILES_BLOCK_ID))
        return true;
      break;

    default:
      if (llvm::Error Err = Stream.SkipBlock()) {
        // FIXME this drops the error on the floor.
        consumeError(std::move(Err));
        return true;
      }
      break;
    }

    continue;
  }

  case llvm::BitstreamEntry::EndBlock:
    DoneWithControlBlock = true;
    break;

  case llvm::BitstreamEntry::Error:
    return true;

  case llvm::BitstreamEntry::Record:
    break;
  }

  if (DoneWithControlBlock) break;

  Record.clear();
  StringRef Blob;
  Expected<unsigned> MaybeRecCode =
      Stream.readRecord(Entry.ID, Record, &Blob);
  if (!MaybeRecCode) {
    // FIXME this drops the error.
    return Failure;
  }
  switch ((ControlRecordTypes)MaybeRecCode.get()) {
  case METADATA:
    if (Record[0] != VERSION_MAJOR)
      return true;
    if (Listener.ReadFullVersionInformation(Blob))
      return true;
    break;
  case MODULE_NAME:
    Listener.ReadModuleName(Blob);
    break;
  case MODULE_DIRECTORY:
    ModuleDir = std::string(Blob);
    break;
  case MODULE_MAP_FILE: {
    unsigned Idx = 0;
    auto Path = ReadString(Record, Idx);
    ResolveImportedPath(Path, ModuleDir);
    Listener.ReadModuleMapFile(Path);
    break;
  }
  case INPUT_FILE_OFFSETS: {
    if (!NeedsInputFiles)
      break;

    unsigned NumInputFiles = Record[0];
    unsigned NumUserFiles = Record[1];
    const llvm::support::unaligned_uint64_t *InputFileOffs =
        (const llvm::support::unaligned_uint64_t *)Blob.data();
    for (unsigned I = 0; I != NumInputFiles; ++I) {
      // Go find this input file.
      bool isSystemFile = I >= NumUserFiles;

      if (isSystemFile && !NeedsSystemInputFiles)
        break; // the rest are system input files

      BitstreamCursor &Cursor = InputFilesCursor;
      SavedStreamPosition SavedPosition(Cursor);
      if (llvm::Error Err = Cursor.JumpToBit(InputFileOffs[I])) {
        // FIXME this drops errors on the floor.
        consumeError(std::move(Err));
      }

      Expected<unsigned> MaybeCode = Cursor.ReadCode();
      if (!MaybeCode) {
        // FIXME this drops errors on the floor.
        consumeError(MaybeCode.takeError());
      }
      unsigned Code = MaybeCode.get();

      RecordData Record;
      StringRef Blob;
      bool shouldContinue = false;
      Expected<unsigned> MaybeRecordType =
          Cursor.readRecord(Code, Record, &Blob);
      if (!MaybeRecordType) {
        // FIXME this drops errors on the floor.
        consumeError(MaybeRecordType.takeError());
      }
      switch ((InputFileRecordTypes)MaybeRecordType.get()) {
      case INPUT_FILE_HASH:
        break;
      case INPUT_FILE:
        bool Overridden = static_cast<bool>(Record[3]);
        std::string Filename = std::string(Blob);
        ResolveImportedPath(Filename, ModuleDir);
        shouldContinue = Listener.visitInputFile(
            Filename, isSystemFile, Overridden, /*IsExplicitModule*/false);
        break;
      }
      if (!shouldContinue)
        break;
    }
    break;
  }

  case IMPORTS: {
    if (!NeedsImports)
      break;

    unsigned Idx = 0, N = Record.size();
    while (Idx < N) {
      // Read information about the AST file.
      Idx +=
          1 + 1 + 1 + 1 +
          ASTFileSignature::size; // Kind, ImportLoc, Size, ModTime, Signature
      std::string ModuleName = ReadString(Record, Idx);
      std::string Filename = ReadString(Record, Idx);
      ResolveImportedPath(Filename, ModuleDir);
      Listener.visitImport(ModuleName, Filename);
    }
    break;
  }

  default:
    // No other validation to perform.
    break;
  }
}

// Look for module file extension blocks, if requested.
if (FindModuleFileExtensions) {
  BitstreamCursor SavedStream = Stream;
  while (!SkipCursorToBlock(Stream, EXTENSION_BLOCK_ID)) {
    bool DoneWithExtensionBlock = false;
    while (!DoneWithExtensionBlock) {
      Expected<llvm::BitstreamEntry> MaybeEntry = Stream.advance();
      if (!MaybeEntry) {
        // FIXME this drops the error.
        return true;
      }
      llvm::BitstreamEntry Entry = MaybeEntry.get();

      switch (Entry.Kind) {
      case llvm::BitstreamEntry::SubBlock:
        if (llvm::Error Err = Stream.SkipBlock()) {
          // FIXME this drops the error on the floor.
          consumeError(std::move(Err));
          return true;
        }
        continue;

      case llvm::BitstreamEntry::EndBlock:
        DoneWithExtensionBlock = true;
        continue;

      case llvm::BitstreamEntry::Error:
        return true;

      case llvm::BitstreamEntry::Record:
        break;
      }

     Record.clear();
     StringRef Blob;
     Expected<unsigned> MaybeRecCode =
         Stream.readRecord(Entry.ID, Record, &Blob);
     if (!MaybeRecCode) {
       // FIXME this drops the error.
       return true;
     }
     switch (MaybeRecCode.get()) {
     case EXTENSION_METADATA: {
       ModuleFileExtensionMetadata Metadata;
       if (parseModuleFileExtensionMetadata(Record, Blob, Metadata))
         return true;

       Listener.readModuleFileExtension(Metadata);
       break;
     }
     }
    }
  }
  Stream = SavedStream;
}

// Scan for the UNHASHED_CONTROL_BLOCK_ID block.
if (readUnhashedControlBlockImpl(
        nullptr, Bytes, ARR_ConfigurationMismatch | ARR_OutOfDate,
        /*AllowCompatibleConfigurationMismatch*/ false, &Listener,
        ValidateDiagnosticOptions) != Success)
  return true;

return false;
5439}

5441bool ASTReader::isAcceptableASTFile(StringRef Filename, FileManager &FileMgr,
                                  const PCHContainerReader &PCHContainerRdr,
                                  const LangOptions &LangOpts,
                                  const TargetOptions &TargetOpts,
                                  const PreprocessorOptions &PPOpts,
                                  StringRef ExistingModuleCachePath) {
SimplePCHValidator validator(LangOpts, TargetOpts, PPOpts,
                             ExistingModuleCachePath, FileMgr);
return !readASTFileControlBlock(Filename, FileMgr, PCHContainerRdr,
                                /*FindModuleFileExtensions=*/false,
                                validator,
                                /*ValidateDiagnosticOptions=*/true);
5453}

5455ASTReader::ASTReadResult
5456ASTReader::ReadSubmoduleBlock(ModuleFile &F, unsigned ClientLoadCapabilities) {
// Enter the submodule block.
if (llvm::Error Err = F.Stream.EnterSubBlock(SUBMODULE_BLOCK_ID)) {
  Error(std::move(Err));
  return Failure;
}

ModuleMap &ModMap = PP.getHeaderSearchInfo().getModuleMap();
bool First = true;
Module *CurrentModule = nullptr;
RecordData Record;
while (true) {
  Expected<llvm::BitstreamEntry> MaybeEntry =
      F.Stream.advanceSkippingSubblocks();
  if (!MaybeEntry) {
    Error(MaybeEntry.takeError());
    return Failure;
  }
  llvm::BitstreamEntry Entry = MaybeEntry.get();

  switch (Entry.Kind) {
  case llvm::BitstreamEntry::SubBlock: // Handled for us already.
  case llvm::BitstreamEntry::Error:
    Error("malformed block record in AST file");
    return Failure;
  case llvm::BitstreamEntry::EndBlock:
    return Success;
  case llvm::BitstreamEntry::Record:
    // The interesting case.
    break;
  }

  // Read a record.
  StringRef Blob;
  Record.clear();
  Expected<unsigned> MaybeKind = F.Stream.readRecord(Entry.ID, Record, &Blob);
  if (!MaybeKind) {
    Error(MaybeKind.takeError());
    return Failure;
  }
  unsigned Kind = MaybeKind.get();

  if ((Kind == SUBMODULE_METADATA) != First) {
    Error("submodule metadata record should be at beginning of block");
    return Failure;
  }
  First = false;

  // Submodule information is only valid if we have a current module.
  // FIXME: Should we error on these cases?
  if (!CurrentModule && Kind != SUBMODULE_METADATA &&
      Kind != SUBMODULE_DEFINITION)
    continue;

  switch (Kind) {
  default:  // Default behavior: ignore.
    break;

  case SUBMODULE_DEFINITION: {
    if (Record.size() < 12) {
      Error("malformed module definition");
      return Failure;
    }

    StringRef Name = Blob;
    unsigned Idx = 0;
    SubmoduleID GlobalID = getGlobalSubmoduleID(F, Record[Idx++]);
    SubmoduleID Parent = getGlobalSubmoduleID(F, Record[Idx++]);
    Module::ModuleKind Kind = (Module::ModuleKind)Record[Idx++];
    bool IsFramework = Record[Idx++];
    bool IsExplicit = Record[Idx++];
    bool IsSystem = Record[Idx++];
    bool IsExternC = Record[Idx++];
    bool InferSubmodules = Record[Idx++];
    bool InferExplicitSubmodules = Record[Idx++];
    bool InferExportWildcard = Record[Idx++];
    bool ConfigMacrosExhaustive = Record[Idx++];
    bool ModuleMapIsPrivate = Record[Idx++];

    Module *ParentModule = nullptr;
    if (Parent)
      ParentModule = getSubmodule(Parent);

    // Retrieve this (sub)module from the module map, creating it if
    // necessary.
    CurrentModule =
        ModMap.findOrCreateModule(Name, ParentModule, IsFramework, IsExplicit)
            .first;

    // FIXME: set the definition loc for CurrentModule, or call
    // ModMap.setInferredModuleAllowedBy()

    SubmoduleID GlobalIndex = GlobalID - NUM_PREDEF_SUBMODULE_IDS;
    if (GlobalIndex >= SubmodulesLoaded.size() ||
        SubmodulesLoaded[GlobalIndex]) {
      Error("too many submodules");
      return Failure;
    }

    if (!ParentModule) {
      if (const FileEntry *CurFile = CurrentModule->getASTFile()) {
        // Don't emit module relocation error if we have -fno-validate-pch
        if (!bool(PP.getPreprocessorOpts().DisablePCHOrModuleValidation &
                  DisableValidationForModuleKind::Module) &&
            CurFile != F.File) {
          Error(diag::err_module_file_conflict,
                CurrentModule->getTopLevelModuleName(), CurFile->getName(),
                F.File->getName());
          return Failure;
        }
      }

      F.DidReadTopLevelSubmodule = true;
      CurrentModule->setASTFile(F.File);
      CurrentModule->PresumedModuleMapFile = F.ModuleMapPath;
    }

    CurrentModule->Kind = Kind;
    CurrentModule->Signature = F.Signature;
    CurrentModule->IsFromModuleFile = true;
    CurrentModule->IsSystem = IsSystem || CurrentModule->IsSystem;
    CurrentModule->IsExternC = IsExternC;
    CurrentModule->InferSubmodules = InferSubmodules;
    CurrentModule->InferExplicitSubmodules = InferExplicitSubmodules;
    CurrentModule->InferExportWildcard = InferExportWildcard;
    CurrentModule->ConfigMacrosExhaustive = ConfigMacrosExhaustive;
    CurrentModule->ModuleMapIsPrivate = ModuleMapIsPrivate;
    if (DeserializationListener)
      DeserializationListener->ModuleRead(GlobalID, CurrentModule);

    SubmodulesLoaded[GlobalIndex] = CurrentModule;

    // Clear out data that will be replaced by what is in the module file.
    CurrentModule->LinkLibraries.clear();
    CurrentModule->ConfigMacros.clear();
    CurrentModule->UnresolvedConflicts.clear();
    CurrentModule->Conflicts.clear();

    // The module is available unless it's missing a requirement; relevant
    // requirements will be (re-)added by SUBMODULE_REQUIRES records.
    // Missing headers that were present when the module was built do not
    // make it unavailable -- if we got this far, this must be an explicitly
    // imported module file.
    CurrentModule->Requirements.clear();
    CurrentModule->MissingHeaders.clear();
    CurrentModule->IsUnimportable =
        ParentModule && ParentModule->IsUnimportable;
    CurrentModule->IsAvailable = !CurrentModule->IsUnimportable;
    break;
  }

  case SUBMODULE_UMBRELLA_HEADER: {
    std::string Filename = std::string(Blob);
    ResolveImportedPath(F, Filename);
    if (auto Umbrella = PP.getFileManager().getFile(Filename)) {
      if (!CurrentModule->getUmbrellaHeader())
        // FIXME: NameAsWritten
        ModMap.setUmbrellaHeader(CurrentModule, *Umbrella, Blob, "");
      else if (CurrentModule->getUmbrellaHeader().Entry != *Umbrella) {
        if ((ClientLoadCapabilities & ARR_OutOfDate) == 0)
          Error("mismatched umbrella headers in submodule");
        return OutOfDate;
      }
    }
    break;
  }

  case SUBMODULE_HEADER:
  case SUBMODULE_EXCLUDED_HEADER:
  case SUBMODULE_PRIVATE_HEADER:
    // We lazily associate headers with their modules via the HeaderInfo table.
    // FIXME: Re-evaluate this section; maybe only store InputFile IDs instead
    // of complete filenames or remove it entirely.
    break;

  case SUBMODULE_TEXTUAL_HEADER:
  case SUBMODULE_PRIVATE_TEXTUAL_HEADER:
    // FIXME: Textual headers are not marked in the HeaderInfo table. Load
    // them here.
    break;

  case SUBMODULE_TOPHEADER:
    CurrentModule->addTopHeaderFilename(Blob);
    break;

  case SUBMODULE_UMBRELLA_DIR: {
    std::string Dirname = std::string(Blob);
    ResolveImportedPath(F, Dirname);
    if (auto Umbrella = PP.getFileManager().getDirectory(Dirname)) {
      if (!CurrentModule->getUmbrellaDir())
        // FIXME: NameAsWritten
        ModMap.setUmbrellaDir(CurrentModule, *Umbrella, Blob, "");
      else if (CurrentModule->getUmbrellaDir().Entry != *Umbrella) {
        if ((ClientLoadCapabilities & ARR_OutOfDate) == 0)
          Error("mismatched umbrella directories in submodule");
        return OutOfDate;
      }
    }
    break;
  }

  case SUBMODULE_METADATA: {
    F.BaseSubmoduleID = getTotalNumSubmodules();
    F.LocalNumSubmodules = Record[0];
    unsigned LocalBaseSubmoduleID = Record[1];
    if (F.LocalNumSubmodules > 0) {
      // Introduce the global -> local mapping for submodules within this
      // module.
      GlobalSubmoduleMap.insert(std::make_pair(getTotalNumSubmodules()+1,&F));

      // Introduce the local -> global mapping for submodules within this
      // module.
      F.SubmoduleRemap.insertOrReplace(
        std::make_pair(LocalBaseSubmoduleID,
                       F.BaseSubmoduleID - LocalBaseSubmoduleID));

      SubmodulesLoaded.resize(SubmodulesLoaded.size() + F.LocalNumSubmodules);
    }
    break;
  }

  case SUBMODULE_IMPORTS:
    for (unsigned Idx = 0; Idx != Record.size(); ++Idx) {
      UnresolvedModuleRef Unresolved;
      Unresolved.File = &F;
      Unresolved.Mod = CurrentModule;
      Unresolved.ID = Record[Idx];
      Unresolved.Kind = UnresolvedModuleRef::Import;
      Unresolved.IsWildcard = false;
      UnresolvedModuleRefs.push_back(Unresolved);
    }
    break;

  case SUBMODULE_EXPORTS:
    for (unsigned Idx = 0; Idx + 1 < Record.size(); Idx += 2) {
      UnresolvedModuleRef Unresolved;
      Unresolved.File = &F;
      Unresolved.Mod = CurrentModule;
      Unresolved.ID = Record[Idx];
      Unresolved.Kind = UnresolvedModuleRef::Export;
      Unresolved.IsWildcard = Record[Idx + 1];
      UnresolvedModuleRefs.push_back(Unresolved);
    }

    // Once we've loaded the set of exports, there's no reason to keep
    // the parsed, unresolved exports around.
    CurrentModule->UnresolvedExports.clear();
    break;

  case SUBMODULE_REQUIRES:
    CurrentModule->addRequirement(Blob, Record[0], PP.getLangOpts(),
                                  PP.getTargetInfo());
    break;

  case SUBMODULE_LINK_LIBRARY:
    ModMap.resolveLinkAsDependencies(CurrentModule);
    CurrentModule->LinkLibraries.push_back(
        Module::LinkLibrary(std::string(Blob), Record[0]));
    break;

  case SUBMODULE_CONFIG_MACRO:
    CurrentModule->ConfigMacros.push_back(Blob.str());
    break;

  case SUBMODULE_CONFLICT: {
    UnresolvedModuleRef Unresolved;
    Unresolved.File = &F;
    Unresolved.Mod = CurrentModule;
    Unresolved.ID = Record[0];
    Unresolved.Kind = UnresolvedModuleRef::Conflict;
    Unresolved.IsWildcard = false;
    Unresolved.String = Blob;
    UnresolvedModuleRefs.push_back(Unresolved);
    break;
  }

  case SUBMODULE_INITIALIZERS: {
    if (!ContextObj)
      break;
    SmallVector<uint32_t, 16> Inits;
    for (auto &ID : Record)
      Inits.push_back(getGlobalDeclID(F, ID));
    ContextObj->addLazyModuleInitializers(CurrentModule, Inits);
    break;
  }

  case SUBMODULE_EXPORT_AS:
    CurrentModule->ExportAsModule = Blob.str();
    ModMap.addLinkAsDependency(CurrentModule);
    break;
  }
}
5748}

5750/// Parse the record that corresponds to a LangOptions data
5751/// structure.
5752///
5753/// This routine parses the language options from the AST file and then gives
5754/// them to the AST listener if one is set.
5755///
5756/// \returns true if the listener deems the file unacceptable, false otherwise.
5757bool ASTReader::ParseLanguageOptions(const RecordData &Record,
                                   bool Complain,
                                   ASTReaderListener &Listener,
                                   bool AllowCompatibleDifferences) {
LangOptions LangOpts;
unsigned Idx = 0;
5763#define LANGOPT(Name, Bits, Default, Description) \
LangOpts.Name = Record[Idx++];
5765#define ENUM_LANGOPT(Name, Type, Bits, Default, Description) \
LangOpts.set##Name(static_cast<LangOptions::Type>(Record[Idx++]));
5767#include "clang/Basic/LangOptions.def"
5768#define SANITIZER(NAME, ID)                                                    \
LangOpts.Sanitize.set(SanitizerKind::ID, Record[Idx++]);
5770#include "clang/Basic/Sanitizers.def"

for (unsigned N = Record[Idx++]; N; --N)
  LangOpts.ModuleFeatures.push_back(ReadString(Record, Idx));

ObjCRuntime::Kind runtimeKind = (ObjCRuntime::Kind) Record[Idx++];
VersionTuple runtimeVersion = ReadVersionTuple(Record, Idx);
LangOpts.ObjCRuntime = ObjCRuntime(runtimeKind, runtimeVersion);

LangOpts.CurrentModule = ReadString(Record, Idx);

// Comment options.
for (unsigned N = Record[Idx++]; N; --N) {
  LangOpts.CommentOpts.BlockCommandNames.push_back(
    ReadString(Record, Idx));
}
LangOpts.CommentOpts.ParseAllComments = Record[Idx++];

// OpenMP offloading options.
for (unsigned N = Record[Idx++]; N; --N) {
  LangOpts.OMPTargetTriples.push_back(llvm::Triple(ReadString(Record, Idx)));
}

LangOpts.OMPHostIRFile = ReadString(Record, Idx);

return Listener.ReadLanguageOptions(LangOpts, Complain,
                                    AllowCompatibleDifferences);
5797}

5799bool ASTReader::ParseTargetOptions(const RecordData &Record, bool Complain,
                                 ASTReaderListener &Listener,
                                 bool AllowCompatibleDifferences) {
unsigned Idx = 0;
TargetOptions TargetOpts;
TargetOpts.Triple = ReadString(Record, Idx);
TargetOpts.CPU = ReadString(Record, Idx);
TargetOpts.TuneCPU = ReadString(Record, Idx);
TargetOpts.ABI = ReadString(Record, Idx);
for (unsigned N = Record[Idx++]; N; --N) {
  TargetOpts.FeaturesAsWritten.push_back(ReadString(Record, Idx));
}
for (unsigned N = Record[Idx++]; N; --N) {
  TargetOpts.Features.push_back(ReadString(Record, Idx));
}

return Listener.ReadTargetOptions(TargetOpts, Complain,
                                  AllowCompatibleDifferences);
5817}

5819bool ASTReader::ParseDiagnosticOptions(const RecordData &Record, bool Complain,
                                     ASTReaderListener &Listener) {
IntrusiveRefCntPtr<DiagnosticOptions> DiagOpts(new DiagnosticOptions);
unsigned Idx = 0;
5823#define DIAGOPT(Name, Bits, Default) DiagOpts->Name = Record[Idx++];
5824#define ENUM_DIAGOPT(Name, Type, Bits, Default) \
DiagOpts->set##Name(static_cast<Type>(Record[Idx++]));
5826#include "clang/Basic/DiagnosticOptions.def"

for (unsigned N = Record[Idx++]; N; --N)
  DiagOpts->Warnings.push_back(ReadString(Record, Idx));
for (unsigned N = Record[Idx++]; N; --N)
  DiagOpts->Remarks.push_back(ReadString(Record, Idx));

return Listener.ReadDiagnosticOptions(DiagOpts, Complain);
5834}

5836bool ASTReader::ParseFileSystemOptions(const RecordData &Record, bool Complain,
                                     ASTReaderListener &Listener) {
FileSystemOptions FSOpts;
unsigned Idx = 0;
FSOpts.WorkingDir = ReadString(Record, Idx);
return Listener.ReadFileSystemOptions(FSOpts, Complain);
5842}

5844bool ASTReader::ParseHeaderSearchOptions(const RecordData &Record,
                                       bool Complain,
                                       ASTReaderListener &Listener) {
HeaderSearchOptions HSOpts;
unsigned Idx = 0;
HSOpts.Sysroot = ReadString(Record, Idx);

// Include entries.
for (unsigned N = Record[Idx++]; N; --N) {
  std::string Path = ReadString(Record, Idx);
  frontend::IncludeDirGroup Group
    = static_cast<frontend::IncludeDirGroup>(Record[Idx++]);
  bool IsFramework = Record[Idx++];
  bool IgnoreSysRoot = Record[Idx++];
  HSOpts.UserEntries.emplace_back(std::move(Path), Group, IsFramework,
                                  IgnoreSysRoot);
}

// System header prefixes.
for (unsigned N = Record[Idx++]; N; --N) {
  std::string Prefix = ReadString(Record, Idx);
  bool IsSystemHeader = Record[Idx++];
  HSOpts.SystemHeaderPrefixes.emplace_back(std::move(Prefix), IsSystemHeader);
}

HSOpts.ResourceDir = ReadString(Record, Idx);
HSOpts.ModuleCachePath = ReadString(Record, Idx);
HSOpts.ModuleUserBuildPath = ReadString(Record, Idx);
HSOpts.DisableModuleHash = Record[Idx++];
HSOpts.ImplicitModuleMaps = Record[Idx++];
HSOpts.ModuleMapFileHomeIsCwd = Record[Idx++];
HSOpts.EnablePrebuiltImplicitModules = Record[Idx++];
HSOpts.UseBuiltinIncludes = Record[Idx++];
HSOpts.UseStandardSystemIncludes = Record[Idx++];
HSOpts.UseStandardCXXIncludes = Record[Idx++];
HSOpts.UseLibcxx = Record[Idx++];
std::string SpecificModuleCachePath = ReadString(Record, Idx);

return Listener.ReadHeaderSearchOptions(HSOpts, SpecificModuleCachePath,
                                        Complain);
5884}

5886bool ASTReader::ParsePreprocessorOptions(const RecordData &Record,
                                       bool Complain,
                                       ASTReaderListener &Listener,
                                       std::string &SuggestedPredefines) {
PreprocessorOptions PPOpts;
unsigned Idx = 0;

// Macro definitions/undefs
for (unsigned N = Record[Idx++]; N; --N) {
  std::string Macro = ReadString(Record, Idx);
  bool IsUndef = Record[Idx++];
  PPOpts.Macros.push_back(std::make_pair(Macro, IsUndef));
}

// Includes
for (unsigned N = Record[Idx++]; N; --N) {
  PPOpts.Includes.push_back(ReadString(Record, Idx));
}

// Macro Includes
for (unsigned N = Record[Idx++]; N; --N) {
  PPOpts.MacroIncludes.push_back(ReadString(Record, Idx));
}

PPOpts.UsePredefines = Record[Idx++];
PPOpts.DetailedRecord = Record[Idx++];
PPOpts.ImplicitPCHInclude = ReadString(Record, Idx);
PPOpts.ObjCXXARCStandardLibrary =
  static_cast<ObjCXXARCStandardLibraryKind>(Record[Idx++]);
SuggestedPredefines.clear();
return Listener.ReadPreprocessorOptions(PPOpts, Complain,
                                        SuggestedPredefines);
5918}

5920std::pair<ModuleFile *, unsigned>
5921ASTReader::getModulePreprocessedEntity(unsigned GlobalIndex) {
GlobalPreprocessedEntityMapType::iterator
I = GlobalPreprocessedEntityMap.find(GlobalIndex);
assert(I != GlobalPreprocessedEntityMap.end() &&((void)0)
       "Corrupted global preprocessed entity map")((void)0);
ModuleFile *M = I->second;
unsigned LocalIndex = GlobalIndex - M->BasePreprocessedEntityID;
return std::make_pair(M, LocalIndex);
5929}

5931llvm::iterator_range<PreprocessingRecord::iterator>
5932ASTReader::getModulePreprocessedEntities(ModuleFile &Mod) const {
if (PreprocessingRecord *PPRec = PP.getPreprocessingRecord())
  return PPRec->getIteratorsForLoadedRange(Mod.BasePreprocessedEntityID,
                                           Mod.NumPreprocessedEntities);

return llvm::make_range(PreprocessingRecord::iterator(),
                        PreprocessingRecord::iterator());
5939}

5941bool ASTReader::canRecoverFromOutOfDate(StringRef ModuleFileName,
                                      unsigned int ClientLoadCapabilities) {
return ClientLoadCapabilities & ARR_OutOfDate &&
       !getModuleManager().getModuleCache().isPCMFinal(ModuleFileName);
5945}

5947llvm::iterator_range<ASTReader::ModuleDeclIterator>
5948ASTReader::getModuleFileLevelDecls(ModuleFile &Mod) {
return llvm::make_range(
    ModuleDeclIterator(this, &Mod, Mod.FileSortedDecls),
    ModuleDeclIterator(this, &Mod,
                       Mod.FileSortedDecls + Mod.NumFileSortedDecls));
5953}

5955SourceRange ASTReader::ReadSkippedRange(unsigned GlobalIndex) {
auto I = GlobalSkippedRangeMap.find(GlobalIndex);
assert(I != GlobalSkippedRangeMap.end() &&((void)0)
  "Corrupted global skipped range map")((void)0);
ModuleFile *M = I->second;
unsigned LocalIndex = GlobalIndex - M->BasePreprocessedSkippedRangeID;
assert(LocalIndex < M->NumPreprocessedSkippedRanges)((void)0);
PPSkippedRange RawRange = M->PreprocessedSkippedRangeOffsets[LocalIndex];
SourceRange Range(TranslateSourceLocation(*M, RawRange.getBegin()),
                  TranslateSourceLocation(*M, RawRange.getEnd()));
assert(Range.isValid())((void)0);
return Range;
5967}

5969PreprocessedEntity *ASTReader::ReadPreprocessedEntity(unsigned Index) {
PreprocessedEntityID PPID = Index+1;
std::pair<ModuleFile *, unsigned> PPInfo = getModulePreprocessedEntity(Index);
ModuleFile &M = *PPInfo.first;
unsigned LocalIndex = PPInfo.second;
const PPEntityOffset &PPOffs = M.PreprocessedEntityOffsets[LocalIndex];

if (!PP.getPreprocessingRecord()) {
  Error("no preprocessing record");
  return nullptr;
}

SavedStreamPosition SavedPosition(M.PreprocessorDetailCursor);
if (llvm::Error Err = M.PreprocessorDetailCursor.JumpToBit(
        M.MacroOffsetsBase + PPOffs.BitOffset)) {
  Error(std::move(Err));
  return nullptr;
}

Expected<llvm::BitstreamEntry> MaybeEntry =
    M.PreprocessorDetailCursor.advance(BitstreamCursor::AF_DontPopBlockAtEnd);
if (!MaybeEntry) {
  Error(MaybeEntry.takeError());
  return nullptr;
}
llvm::BitstreamEntry Entry = MaybeEntry.get();

if (Entry.Kind != llvm::BitstreamEntry::Record)
  return nullptr;

// Read the record.
SourceRange Range(TranslateSourceLocation(M, PPOffs.getBegin()),
                  TranslateSourceLocation(M, PPOffs.getEnd()));
PreprocessingRecord &PPRec = *PP.getPreprocessingRecord();
StringRef Blob;
RecordData Record;
Expected<unsigned> MaybeRecType =
    M.PreprocessorDetailCursor.readRecord(Entry.ID, Record, &Blob);
if (!MaybeRecType) {
  Error(MaybeRecType.takeError());
  return nullptr;
}
switch ((PreprocessorDetailRecordTypes)MaybeRecType.get()) {
case PPD_MACRO_EXPANSION: {
  bool isBuiltin = Record[0];
  IdentifierInfo *Name = nullptr;
  MacroDefinitionRecord *Def = nullptr;
  if (isBuiltin)
    Name = getLocalIdentifier(M, Record[1]);
  else {
    PreprocessedEntityID GlobalID =
        getGlobalPreprocessedEntityID(M, Record[1]);
    Def = cast<MacroDefinitionRecord>(
        PPRec.getLoadedPreprocessedEntity(GlobalID - 1));
  }

  MacroExpansion *ME;
  if (isBuiltin)
    ME = new (PPRec) MacroExpansion(Name, Range);
  else
    ME = new (PPRec) MacroExpansion(Def, Range);

  return ME;
}

case PPD_MACRO_DEFINITION: {
  // Decode the identifier info and then check again; if the macro is
  // still defined and associated with the identifier,
  IdentifierInfo *II = getLocalIdentifier(M, Record[0]);
  MacroDefinitionRecord *MD = new (PPRec) MacroDefinitionRecord(II, Range);

  if (DeserializationListener)
    DeserializationListener->MacroDefinitionRead(PPID, MD);

  return MD;
}

case PPD_INCLUSION_DIRECTIVE: {
  const char *FullFileNameStart = Blob.data() + Record[0];
  StringRef FullFileName(FullFileNameStart, Blob.size() - Record[0]);
  const FileEntry *File = nullptr;
  if (!FullFileName.empty())
    if (auto FE = PP.getFileManager().getFile(FullFileName))
      File = *FE;

  // FIXME: Stable encoding
  InclusionDirective::InclusionKind Kind
    = static_cast<InclusionDirective::InclusionKind>(Record[2]);
  InclusionDirective *ID
    = new (PPRec) InclusionDirective(PPRec, Kind,
                                     StringRef(Blob.data(), Record[0]),
                                     Record[1], Record[3],
                                     File,
                                     Range);
  return ID;
}
}

llvm_unreachable("Invalid PreprocessorDetailRecordTypes")__builtin_unreachable();
6068}

6070/// Find the next module that contains entities and return the ID
6071/// of the first entry.
6072///
6073/// \param SLocMapI points at a chunk of a module that contains no
6074/// preprocessed entities or the entities it contains are not the ones we are
6075/// looking for.
6076PreprocessedEntityID ASTReader::findNextPreprocessedEntity(
                     GlobalSLocOffsetMapType::const_iterator SLocMapI) const {
++SLocMapI;
for (GlobalSLocOffsetMapType::const_iterator
       EndI = GlobalSLocOffsetMap.end(); SLocMapI != EndI; ++SLocMapI) {
  ModuleFile &M = *SLocMapI->second;
  if (M.NumPreprocessedEntities)
    return M.BasePreprocessedEntityID;
}

return getTotalNumPreprocessedEntities();
6087}

6089namespace {

6091struct PPEntityComp {
const ASTReader &Reader;
ModuleFile &M;

PPEntityComp(const ASTReader &Reader, ModuleFile &M) : Reader(Reader), M(M) {}

bool operator()(const PPEntityOffset &L, const PPEntityOffset &R) const {
  SourceLocation LHS = getLoc(L);
  SourceLocation RHS = getLoc(R);
  return Reader.getSourceManager().isBeforeInTranslationUnit(LHS, RHS);
}

bool operator()(const PPEntityOffset &L, SourceLocation RHS) const {
  SourceLocation LHS = getLoc(L);
  return Reader.getSourceManager().isBeforeInTranslationUnit(LHS, RHS);
}

bool operator()(SourceLocation LHS, const PPEntityOffset &R) const {
  SourceLocation RHS = getLoc(R);
  return Reader.getSourceManager().isBeforeInTranslationUnit(LHS, RHS);
}

SourceLocation getLoc(const PPEntityOffset &PPE) const {
  return Reader.TranslateSourceLocation(M, PPE.getBegin());
}
6116};

6118} // namespace

6120PreprocessedEntityID ASTReader::findPreprocessedEntity(SourceLocation Loc,
                                                     bool EndsAfter) const {
if (SourceMgr.isLocalSourceLocation(Loc))
  return getTotalNumPreprocessedEntities();

GlobalSLocOffsetMapType::const_iterator SLocMapI = GlobalSLocOffsetMap.find(
    SourceManager::MaxLoadedOffset - Loc.getOffset() - 1);
assert(SLocMapI != GlobalSLocOffsetMap.end() &&((void)0)
       "Corrupted global sloc offset map")((void)0);

if (SLocMapI->second->NumPreprocessedEntities == 0)
  return findNextPreprocessedEntity(SLocMapI);

ModuleFile &M = *SLocMapI->second;

using pp_iterator = const PPEntityOffset *;

pp_iterator pp_begin = M.PreprocessedEntityOffsets;
pp_iterator pp_end = pp_begin + M.NumPreprocessedEntities;

size_t Count = M.NumPreprocessedEntities;
size_t Half;
pp_iterator First = pp_begin;
pp_iterator PPI;

if (EndsAfter) {
  PPI = std::upper_bound(pp_begin, pp_end, Loc,
                         PPEntityComp(*this, M));
} else {
  // Do a binary search manually instead of using std::lower_bound because
  // The end locations of entities may be unordered (when a macro expansion
  // is inside another macro argument), but for this case it is not important
  // whether we get the first macro expansion or its containing macro.
  while (Count > 0) {
    Half = Count / 2;
    PPI = First;
    std::advance(PPI, Half);
    if (SourceMgr.isBeforeInTranslationUnit(
            TranslateSourceLocation(M, PPI->getEnd()), Loc)) {
      First = PPI;
      ++First;
      Count = Count - Half - 1;
    } else
      Count = Half;
  }
}

if (PPI == pp_end)
  return findNextPreprocessedEntity(SLocMapI);

return M.BasePreprocessedEntityID + (PPI - pp_begin);
6171}

6173/// Returns a pair of [Begin, End) indices of preallocated
6174/// preprocessed entities that \arg Range encompasses.
6175std::pair<unsigned, unsigned>
  ASTReader::findPreprocessedEntitiesInRange(SourceRange Range) {
if (Range.isInvalid())
  return std::make_pair(0,0);
assert(!SourceMgr.isBeforeInTranslationUnit(Range.getEnd(),Range.getBegin()))((void)0);

PreprocessedEntityID BeginID =
    findPreprocessedEntity(Range.getBegin(), false);
PreprocessedEntityID EndID = findPreprocessedEntity(Range.getEnd(), true);
return std::make_pair(BeginID, EndID);
6185}

6187/// Optionally returns true or false if the preallocated preprocessed
6188/// entity with index \arg Index came from file \arg FID.
6189Optional<bool> ASTReader::isPreprocessedEntityInFileID(unsigned Index,
                                                           FileID FID) {
if (FID.isInvalid())
  return false;

std::pair<ModuleFile *, unsigned> PPInfo = getModulePreprocessedEntity(Index);
ModuleFile &M = *PPInfo.first;
unsigned LocalIndex = PPInfo.second;
const PPEntityOffset &PPOffs = M.PreprocessedEntityOffsets[LocalIndex];

SourceLocation Loc = TranslateSourceLocation(M, PPOffs.getBegin());
if (Loc.isInvalid())
  return false;

if (SourceMgr.isInFileID(SourceMgr.getFileLoc(Loc), FID))
  return true;
else
  return false;
6207}

6209namespace {

/// Visitor used to search for information about a header file.
class HeaderFileInfoVisitor {
  const FileEntry *FE;
  Optional<HeaderFileInfo> HFI;

public:
  explicit HeaderFileInfoVisitor(const FileEntry *FE) : FE(FE) {}

  bool operator()(ModuleFile &M) {
    HeaderFileInfoLookupTable *Table
      = static_cast<HeaderFileInfoLookupTable *>(M.HeaderFileInfoTable);
    if (!Table)
      return false;

    // Look in the on-disk hash table for an entry for this file name.
    HeaderFileInfoLookupTable::iterator Pos = Table->find(FE);
    if (Pos == Table->end())
      return false;

    HFI = *Pos;
    return true;
  }

  Optional<HeaderFileInfo> getHeaderFileInfo() const { return HFI; }
};

6237} // namespace

6239HeaderFileInfo ASTReader::GetHeaderFileInfo(const FileEntry *FE) {
HeaderFileInfoVisitor Visitor(FE);
ModuleMgr.visit(Visitor);
if (Optional<HeaderFileInfo> HFI = Visitor.getHeaderFileInfo())
  return *HFI;

return HeaderFileInfo();
6246}

6248void ASTReader::ReadPragmaDiagnosticMappings(DiagnosticsEngine &Diag) {
using DiagState = DiagnosticsEngine::DiagState;
SmallVector<DiagState *, 32> DiagStates;

for (ModuleFile &F : ModuleMgr) {
  unsigned Idx = 0;
  auto &Record = F.PragmaDiagMappings;
  if (Record.empty())
    continue;

  DiagStates.clear();

  auto ReadDiagState =
      [&](const DiagState &BasedOn, SourceLocation Loc,
          bool IncludeNonPragmaStates) -> DiagnosticsEngine::DiagState * {
    unsigned BackrefID = Record[Idx++];
    if (BackrefID != 0)
      return DiagStates[BackrefID - 1];

    // A new DiagState was created here.
    Diag.DiagStates.push_back(BasedOn);
    DiagState *NewState = &Diag.DiagStates.back();
    DiagStates.push_back(NewState);
    unsigned Size = Record[Idx++];
    assert(Idx + Size * 2 <= Record.size() &&((void)0)
           "Invalid data, not enough diag/map pairs")((void)0);
    while (Size--) {
      unsigned DiagID = Record[Idx++];
      DiagnosticMapping NewMapping =
          DiagnosticMapping::deserialize(Record[Idx++]);
      if (!NewMapping.isPragma() && !IncludeNonPragmaStates)
        continue;

      DiagnosticMapping &Mapping = NewState->getOrAddMapping(DiagID);

      // If this mapping was specified as a warning but the severity was
      // upgraded due to diagnostic settings, simulate the current diagnostic
      // settings (and use a warning).
      if (NewMapping.wasUpgradedFromWarning() && !Mapping.isErrorOrFatal()) {
        NewMapping.setSeverity(diag::Severity::Warning);
        NewMapping.setUpgradedFromWarning(false);
      }

      Mapping = NewMapping;
    }
    return NewState;
  };

  // Read the first state.
  DiagState *FirstState;
  if (F.Kind == MK_ImplicitModule) {
    // Implicitly-built modules are reused with different diagnostic
    // settings.  Use the initial diagnostic state from Diag to simulate this
    // compilation's diagnostic settings.
    FirstState = Diag.DiagStatesByLoc.FirstDiagState;
    DiagStates.push_back(FirstState);

    // Skip the initial diagnostic state from the serialized module.
    assert(Record[1] == 0 &&((void)0)
           "Invalid data, unexpected backref in initial state")((void)0);
    Idx = 3 + Record[2] * 2;
    assert(Idx < Record.size() &&((void)0)
           "Invalid data, not enough state change pairs in initial state")((void)0);
  } else if (F.isModule()) {
    // For an explicit module, preserve the flags from the module build
    // command line (-w, -Weverything, -Werror, ...) along with any explicit
    // -Wblah flags.
    unsigned Flags = Record[Idx++];
    DiagState Initial;
    Initial.SuppressSystemWarnings = Flags & 1; Flags >>= 1;
    Initial.ErrorsAsFatal = Flags & 1; Flags >>= 1;
    Initial.WarningsAsErrors = Flags & 1; Flags >>= 1;
    Initial.EnableAllWarnings = Flags & 1; Flags >>= 1;
    Initial.IgnoreAllWarnings = Flags & 1; Flags >>= 1;
    Initial.ExtBehavior = (diag::Severity)Flags;
    FirstState = ReadDiagState(Initial, SourceLocation(), true);

    assert(F.OriginalSourceFileID.isValid())((void)0);

    // Set up the root buffer of the module to start with the initial
    // diagnostic state of the module itself, to cover files that contain no
    // explicit transitions (for which we did not serialize anything).
    Diag.DiagStatesByLoc.Files[F.OriginalSourceFileID]
        .StateTransitions.push_back({FirstState, 0});
  } else {
    // For prefix ASTs, start with whatever the user configured on the
    // command line.
    Idx++; // Skip flags.
    FirstState = ReadDiagState(*Diag.DiagStatesByLoc.CurDiagState,
                               SourceLocation(), false);
  }

  // Read the state transitions.
  unsigned NumLocations = Record[Idx++];
  while (NumLocations--) {
    assert(Idx < Record.size() &&((void)0)
           "Invalid data, missing pragma diagnostic states")((void)0);
    SourceLocation Loc = ReadSourceLocation(F, Record[Idx++]);
    auto IDAndOffset = SourceMgr.getDecomposedLoc(Loc);
    assert(IDAndOffset.first.isValid() && "invalid FileID for transition")((void)0);
    assert(IDAndOffset.second == 0 && "not a start location for a FileID")((void)0);
    unsigned Transitions = Record[Idx++];

    // Note that we don't need to set up Parent/ParentOffset here, because
    // we won't be changing the diagnostic state within imported FileIDs
    // (other than perhaps appending to the main source file, which has no
    // parent).
    auto &F = Diag.DiagStatesByLoc.Files[IDAndOffset.first];
    F.StateTransitions.reserve(F.StateTransitions.size() + Transitions);
    for (unsigned I = 0; I != Transitions; ++I) {
      unsigned Offset = Record[Idx++];
      auto *State =
          ReadDiagState(*FirstState, Loc.getLocWithOffset(Offset), false);
      F.StateTransitions.push_back({State, Offset});
    }
  }

  // Read the final state.
  assert(Idx < Record.size() &&((void)0)
         "Invalid data, missing final pragma diagnostic state")((void)0);
  SourceLocation CurStateLoc =
      ReadSourceLocation(F, F.PragmaDiagMappings[Idx++]);
  auto *CurState = ReadDiagState(*FirstState, CurStateLoc, false);

  if (!F.isModule()) {
    Diag.DiagStatesByLoc.CurDiagState = CurState;
    Diag.DiagStatesByLoc.CurDiagStateLoc = CurStateLoc;

    // Preserve the property that the imaginary root file describes the
    // current state.
    FileID NullFile;
    auto &T = Diag.DiagStatesByLoc.Files[NullFile].StateTransitions;
    if (T.empty())
      T.push_back({CurState, 0});
    else
      T[0].State = CurState;
  }

  // Don't try to read these mappings again.
  Record.clear();
}
6389}

6391/// Get the correct cursor and offset for loading a type.
6392ASTReader::RecordLocation ASTReader::TypeCursorForIndex(unsigned Index) {
GlobalTypeMapType::iterator I = GlobalTypeMap.find(Index);
assert(I != GlobalTypeMap.end() && "Corrupted global type map")((void)0);
ModuleFile *M = I->second;
return RecordLocation(
    M, M->TypeOffsets[Index - M->BaseTypeIndex].getBitOffset() +
           M->DeclsBlockStartOffset);
6399}

6401static llvm::Optional<Type::TypeClass> getTypeClassForCode(TypeCode code) {
switch (code) {
6403#define TYPE_BIT_CODE(CLASS_ID, CODE_ID, CODE_VALUE) \
case TYPE_##CODE_ID: return Type::CLASS_ID;
6405#include "clang/Serialization/TypeBitCodes.def"
default: return llvm::None;
}
6408}

6410/// Read and return the type with the given index..
6411///
6412/// The index is the type ID, shifted and minus the number of predefs. This
6413/// routine actually reads the record corresponding to the type at the given
6414/// location. It is a helper routine for GetType, which deals with reading type
6415/// IDs.
6416QualType ASTReader::readTypeRecord(unsigned Index) {
assert(ContextObj && "reading type with no AST context")((void)0);
ASTContext &Context = *ContextObj;
RecordLocation Loc = TypeCursorForIndex(Index);
BitstreamCursor &DeclsCursor = Loc.F->DeclsCursor;

// Keep track of where we are in the stream, then jump back there
// after reading this type.
SavedStreamPosition SavedPosition(DeclsCursor);

ReadingKindTracker ReadingKind(Read_Type, *this);

// Note that we are loading a type record.
Deserializing AType(this);

if (llvm::Error Err = DeclsCursor.JumpToBit(Loc.Offset)) {
  Error(std::move(Err));
  return QualType();
}
Expected<unsigned> RawCode = DeclsCursor.ReadCode();
if (!RawCode) {
  Error(RawCode.takeError());
  return QualType();
}

ASTRecordReader Record(*this, *Loc.F);
Expected<unsigned> Code = Record.readRecord(DeclsCursor, RawCode.get());
if (!Code) {
  Error(Code.takeError());
  return QualType();
}
if (Code.get() == TYPE_EXT_QUAL) {
  QualType baseType = Record.readQualType();
  Qualifiers quals = Record.readQualifiers();
  return Context.getQualifiedType(baseType, quals);
}

auto maybeClass = getTypeClassForCode((TypeCode) Code.get());
if (!maybeClass) {
  Error("Unexpected code for type");
  return QualType();
}

serialization::AbstractTypeReader<ASTRecordReader> TypeReader(Record);
return TypeReader.read(*maybeClass);
6461}

6463namespace clang {

6465class TypeLocReader : public TypeLocVisitor<TypeLocReader> {
ASTRecordReader &Reader;

SourceLocation readSourceLocation() {
  return Reader.readSourceLocation();
}

TypeSourceInfo *GetTypeSourceInfo() {
  return Reader.readTypeSourceInfo();
}

NestedNameSpecifierLoc ReadNestedNameSpecifierLoc() {
  return Reader.readNestedNameSpecifierLoc();
}

Attr *ReadAttr() {
  return Reader.readAttr();
}

6484public:
TypeLocReader(ASTRecordReader &Reader) : Reader(Reader) {}

// We want compile-time assurance that we've enumerated all of
// these, so unfortunately we have to declare them first, then
// define them out-of-line.
6490#define ABSTRACT_TYPELOC(CLASS, PARENT)
6491#define TYPELOC(CLASS, PARENT) \
void Visit##CLASS##TypeLoc(CLASS##TypeLoc TyLoc);
6493#include "clang/AST/TypeLocNodes.def"

void VisitFunctionTypeLoc(FunctionTypeLoc);
void VisitArrayTypeLoc(ArrayTypeLoc);
6497};

6499} // namespace clang

6501void TypeLocReader::VisitQualifiedTypeLoc(QualifiedTypeLoc TL) {
// nothing to do
6503}

6505void TypeLocReader::VisitBuiltinTypeLoc(BuiltinTypeLoc TL) {
TL.setBuiltinLoc(readSourceLocation());
if (TL.needsExtraLocalData()) {
  TL.setWrittenTypeSpec(static_cast<DeclSpec::TST>(Reader.readInt()));
  TL.setWrittenSignSpec(static_cast<TypeSpecifierSign>(Reader.readInt()));
  TL.setWrittenWidthSpec(static_cast<TypeSpecifierWidth>(Reader.readInt()));
  TL.setModeAttr(Reader.readInt());
}
6513}

6515void TypeLocReader::VisitComplexTypeLoc(ComplexTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6517}

6519void TypeLocReader::VisitPointerTypeLoc(PointerTypeLoc TL) {
TL.setStarLoc(readSourceLocation());
6521}

6523void TypeLocReader::VisitDecayedTypeLoc(DecayedTypeLoc TL) {
// nothing to do
6525}

6527void TypeLocReader::VisitAdjustedTypeLoc(AdjustedTypeLoc TL) {
// nothing to do
6529}

6531void TypeLocReader::VisitMacroQualifiedTypeLoc(MacroQualifiedTypeLoc TL) {
TL.setExpansionLoc(readSourceLocation());
6533}

6535void TypeLocReader::VisitBlockPointerTypeLoc(BlockPointerTypeLoc TL) {
TL.setCaretLoc(readSourceLocation());
6537}

6539void TypeLocReader::VisitLValueReferenceTypeLoc(LValueReferenceTypeLoc TL) {
TL.setAmpLoc(readSourceLocation());
6541}

6543void TypeLocReader::VisitRValueReferenceTypeLoc(RValueReferenceTypeLoc TL) {
TL.setAmpAmpLoc(readSourceLocation());
6545}

6547void TypeLocReader::VisitMemberPointerTypeLoc(MemberPointerTypeLoc TL) {
TL.setStarLoc(readSourceLocation());
TL.setClassTInfo(GetTypeSourceInfo());
6550}

6552void TypeLocReader::VisitArrayTypeLoc(ArrayTypeLoc TL) {
TL.setLBracketLoc(readSourceLocation());
TL.setRBracketLoc(readSourceLocation());
if (Reader.readBool())
  TL.setSizeExpr(Reader.readExpr());
else
  TL.setSizeExpr(nullptr);
6559}

6561void TypeLocReader::VisitConstantArrayTypeLoc(ConstantArrayTypeLoc TL) {
VisitArrayTypeLoc(TL);
6563}

6565void TypeLocReader::VisitIncompleteArrayTypeLoc(IncompleteArrayTypeLoc TL) {
VisitArrayTypeLoc(TL);
6567}

6569void TypeLocReader::VisitVariableArrayTypeLoc(VariableArrayTypeLoc TL) {
VisitArrayTypeLoc(TL);
6571}

6573void TypeLocReader::VisitDependentSizedArrayTypeLoc(
                                          DependentSizedArrayTypeLoc TL) {
VisitArrayTypeLoc(TL);
6576}

6578void TypeLocReader::VisitDependentAddressSpaceTypeLoc(
  DependentAddressSpaceTypeLoc TL) {

  TL.setAttrNameLoc(readSourceLocation());
  TL.setAttrOperandParensRange(Reader.readSourceRange());
  TL.setAttrExprOperand(Reader.readExpr());
6584}

6586void TypeLocReader::VisitDependentSizedExtVectorTypeLoc(
                                      DependentSizedExtVectorTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6589}

6591void TypeLocReader::VisitVectorTypeLoc(VectorTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6593}

6595void TypeLocReader::VisitDependentVectorTypeLoc(
  DependentVectorTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6598}

6600void TypeLocReader::VisitExtVectorTypeLoc(ExtVectorTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6602}

6604void TypeLocReader::VisitConstantMatrixTypeLoc(ConstantMatrixTypeLoc TL) {
TL.setAttrNameLoc(readSourceLocation());
TL.setAttrOperandParensRange(Reader.readSourceRange());
TL.setAttrRowOperand(Reader.readExpr());
TL.setAttrColumnOperand(Reader.readExpr());
6609}

6611void TypeLocReader::VisitDependentSizedMatrixTypeLoc(
  DependentSizedMatrixTypeLoc TL) {
TL.setAttrNameLoc(readSourceLocation());
TL.setAttrOperandParensRange(Reader.readSourceRange());
TL.setAttrRowOperand(Reader.readExpr());
TL.setAttrColumnOperand(Reader.readExpr());
6617}

6619void TypeLocReader::VisitFunctionTypeLoc(FunctionTypeLoc TL) {
TL.setLocalRangeBegin(readSourceLocation());
TL.setLParenLoc(readSourceLocation());
TL.setRParenLoc(readSourceLocation());
TL.setExceptionSpecRange(Reader.readSourceRange());
TL.setLocalRangeEnd(readSourceLocation());
for (unsigned i = 0, e = TL.getNumParams(); i != e; ++i) {
  TL.setParam(i, Reader.readDeclAs<ParmVarDecl>());
}
6628}

6630void TypeLocReader::VisitFunctionProtoTypeLoc(FunctionProtoTypeLoc TL) {
VisitFunctionTypeLoc(TL);
6632}

6634void TypeLocReader::VisitFunctionNoProtoTypeLoc(FunctionNoProtoTypeLoc TL) {
VisitFunctionTypeLoc(TL);
6636}

6638void TypeLocReader::VisitUnresolvedUsingTypeLoc(UnresolvedUsingTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6640}

6642void TypeLocReader::VisitTypedefTypeLoc(TypedefTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6644}

6646void TypeLocReader::VisitTypeOfExprTypeLoc(TypeOfExprTypeLoc TL) {
TL.setTypeofLoc(readSourceLocation());
TL.setLParenLoc(readSourceLocation());
TL.setRParenLoc(readSourceLocation());
6650}

6652void TypeLocReader::VisitTypeOfTypeLoc(TypeOfTypeLoc TL) {
TL.setTypeofLoc(readSourceLocation());
TL.setLParenLoc(readSourceLocation());
TL.setRParenLoc(readSourceLocation());
TL.setUnderlyingTInfo(GetTypeSourceInfo());
6657}

6659void TypeLocReader::VisitDecltypeTypeLoc(DecltypeTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6661}

6663void TypeLocReader::VisitUnaryTransformTypeLoc(UnaryTransformTypeLoc TL) {
TL.setKWLoc(readSourceLocation());
TL.setLParenLoc(readSourceLocation());
TL.setRParenLoc(readSourceLocation());
TL.setUnderlyingTInfo(GetTypeSourceInfo());
6668}

6670void TypeLocReader::VisitAutoTypeLoc(AutoTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
if (Reader.readBool()) {
  TL.setNestedNameSpecifierLoc(ReadNestedNameSpecifierLoc());
  TL.setTemplateKWLoc(readSourceLocation());
  TL.setConceptNameLoc(readSourceLocation());
  TL.setFoundDecl(Reader.readDeclAs<NamedDecl>());
  TL.setLAngleLoc(readSourceLocation());
  TL.setRAngleLoc(readSourceLocation());
  for (unsigned i = 0, e = TL.getNumArgs(); i != e; ++i)
    TL.setArgLocInfo(i, Reader.readTemplateArgumentLocInfo(
                            TL.getTypePtr()->getArg(i).getKind()));
}
6683}

6685void TypeLocReader::VisitDeducedTemplateSpecializationTypeLoc(
  DeducedTemplateSpecializationTypeLoc TL) {
TL.setTemplateNameLoc(readSourceLocation());
6688}

6690void TypeLocReader::VisitRecordTypeLoc(RecordTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6692}

6694void TypeLocReader::VisitEnumTypeLoc(EnumTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6696}

6698void TypeLocReader::VisitAttributedTypeLoc(AttributedTypeLoc TL) {
TL.setAttr(ReadAttr());
6700}

6702void TypeLocReader::VisitTemplateTypeParmTypeLoc(TemplateTypeParmTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6704}

6706void TypeLocReader::VisitSubstTemplateTypeParmTypeLoc(
                                          SubstTemplateTypeParmTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6709}

6711void TypeLocReader::VisitSubstTemplateTypeParmPackTypeLoc(
                                        SubstTemplateTypeParmPackTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6714}

6716void TypeLocReader::VisitTemplateSpecializationTypeLoc(
                                         TemplateSpecializationTypeLoc TL) {
TL.setTemplateKeywordLoc(readSourceLocation());
TL.setTemplateNameLoc(readSourceLocation());
TL.setLAngleLoc(readSourceLocation());
TL.setRAngleLoc(readSourceLocation());
for (unsigned i = 0, e = TL.getNumArgs(); i != e; ++i)
  TL.setArgLocInfo(
      i,
      Reader.readTemplateArgumentLocInfo(
        TL.getTypePtr()->getArg(i).getKind()));
6727}

6729void TypeLocReader::VisitParenTypeLoc(ParenTypeLoc TL) {
TL.setLParenLoc(readSourceLocation());
TL.setRParenLoc(readSourceLocation());
6732}

6734void TypeLocReader::VisitElaboratedTypeLoc(ElaboratedTypeLoc TL) {
TL.setElaboratedKeywordLoc(readSourceLocation());
TL.setQualifierLoc(ReadNestedNameSpecifierLoc());
6737}

6739void TypeLocReader::VisitInjectedClassNameTypeLoc(InjectedClassNameTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6741}

6743void TypeLocReader::VisitDependentNameTypeLoc(DependentNameTypeLoc TL) {
TL.setElaboratedKeywordLoc(readSourceLocation());
TL.setQualifierLoc(ReadNestedNameSpecifierLoc());
TL.setNameLoc(readSourceLocation());
6747}

6749void TypeLocReader::VisitDependentTemplateSpecializationTypeLoc(
     DependentTemplateSpecializationTypeLoc TL) {
TL.setElaboratedKeywordLoc(readSourceLocation());
TL.setQualifierLoc(ReadNestedNameSpecifierLoc());
TL.setTemplateKeywordLoc(readSourceLocation());
TL.setTemplateNameLoc(readSourceLocation());
TL.setLAngleLoc(readSourceLocation());
TL.setRAngleLoc(readSourceLocation());
for (unsigned I = 0, E = TL.getNumArgs(); I != E; ++I)
  TL.setArgLocInfo(
      I,
      Reader.readTemplateArgumentLocInfo(
          TL.getTypePtr()->getArg(I).getKind()));
6762}

6764void TypeLocReader::VisitPackExpansionTypeLoc(PackExpansionTypeLoc TL) {
TL.setEllipsisLoc(readSourceLocation());
6766}

6768void TypeLocReader::VisitObjCInterfaceTypeLoc(ObjCInterfaceTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6770}

6772void TypeLocReader::VisitObjCTypeParamTypeLoc(ObjCTypeParamTypeLoc TL) {
if (TL.getNumProtocols()) {
  TL.setProtocolLAngleLoc(readSourceLocation());
  TL.setProtocolRAngleLoc(readSourceLocation());
}
for (unsigned i = 0, e = TL.getNumProtocols(); i != e; ++i)
  TL.setProtocolLoc(i, readSourceLocation());
6779}

6781void TypeLocReader::VisitObjCObjectTypeLoc(ObjCObjectTypeLoc TL) {
TL.setHasBaseTypeAsWritten(Reader.readBool());
TL.setTypeArgsLAngleLoc(readSourceLocation());
TL.setTypeArgsRAngleLoc(readSourceLocation());
for (unsigned i = 0, e = TL.getNumTypeArgs(); i != e; ++i)
  TL.setTypeArgTInfo(i, GetTypeSourceInfo());
TL.setProtocolLAngleLoc(readSourceLocation());
TL.setProtocolRAngleLoc(readSourceLocation());
for (unsigned i = 0, e = TL.getNumProtocols(); i != e; ++i)
  TL.setProtocolLoc(i, readSourceLocation());
6791}

6793void TypeLocReader::VisitObjCObjectPointerTypeLoc(ObjCObjectPointerTypeLoc TL) {
TL.setStarLoc(readSourceLocation());
6795}

6797void TypeLocReader::VisitAtomicTypeLoc(AtomicTypeLoc TL) {
TL.setKWLoc(readSourceLocation());
TL.setLParenLoc(readSourceLocation());
TL.setRParenLoc(readSourceLocation());
6801}

6803void TypeLocReader::VisitPipeTypeLoc(PipeTypeLoc TL) {
TL.setKWLoc(readSourceLocation());
6805}

6807void TypeLocReader::VisitExtIntTypeLoc(clang::ExtIntTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6809}
6810void TypeLocReader::VisitDependentExtIntTypeLoc(
  clang::DependentExtIntTypeLoc TL) {
TL.setNameLoc(readSourceLocation());
6813}


6816void ASTRecordReader::readTypeLoc(TypeLoc TL) {
TypeLocReader TLR(*this);
for (; !TL.isNull(); TL = TL.getNextTypeLoc())
  TLR.Visit(TL);
6820}

6822TypeSourceInfo *ASTRecordReader::readTypeSourceInfo() {
QualType InfoTy = readType();
if (InfoTy.isNull())
  return nullptr;

TypeSourceInfo *TInfo = getContext().CreateTypeSourceInfo(InfoTy);
readTypeLoc(TInfo->getTypeLoc());
return TInfo;
6830}

6832QualType ASTReader::GetType(TypeID ID) {
assert(ContextObj && "reading type with no AST context")((void)0);
ASTContext &Context = *ContextObj;

unsigned FastQuals = ID & Qualifiers::FastMask;
unsigned Index = ID >> Qualifiers::FastWidth;

if (Index < NUM_PREDEF_TYPE_IDS) {
  QualType T;
  switch ((PredefinedTypeIDs)Index) {
  case PREDEF_TYPE_NULL_ID:
    return QualType();
  case PREDEF_TYPE_VOID_ID:
    T = Context.VoidTy;
    break;
  case PREDEF_TYPE_BOOL_ID:
    T = Context.BoolTy;
    break;
  case PREDEF_TYPE_CHAR_U_ID:
  case PREDEF_TYPE_CHAR_S_ID:
    // FIXME: Check that the signedness of CharTy is correct!
    T = Context.CharTy;
    break;
  case PREDEF_TYPE_UCHAR_ID:
    T = Context.UnsignedCharTy;
    break;
  case PREDEF_TYPE_USHORT_ID:
    T = Context.UnsignedShortTy;
    break;
  case PREDEF_TYPE_UINT_ID:
    T = Context.UnsignedIntTy;
    break;
  case PREDEF_TYPE_ULONG_ID:
    T = Context.UnsignedLongTy;
    break;
  case PREDEF_TYPE_ULONGLONG_ID:
    T = Context.UnsignedLongLongTy;
    break;
  case PREDEF_TYPE_UINT128_ID:
    T = Context.UnsignedInt128Ty;
    break;
  case PREDEF_TYPE_SCHAR_ID:
    T = Context.SignedCharTy;
    break;
  case PREDEF_TYPE_WCHAR_ID:
    T = Context.WCharTy;
    break;
  case PREDEF_TYPE_SHORT_ID:
    T = Context.ShortTy;
    break;
  case PREDEF_TYPE_INT_ID:
    T = Context.IntTy;
    break;
  case PREDEF_TYPE_LONG_ID:
    T = Context.LongTy;
    break;
  case PREDEF_TYPE_LONGLONG_ID:
    T = Context.LongLongTy;
    break;
  case PREDEF_TYPE_INT128_ID:
    T = Context.Int128Ty;
    break;
  case PREDEF_TYPE_BFLOAT16_ID:
    T = Context.BFloat16Ty;
    break;
  case PREDEF_TYPE_HALF_ID:
    T = Context.HalfTy;
    break;
  case PREDEF_TYPE_FLOAT_ID:
    T = Context.FloatTy;
    break;
  case PREDEF_TYPE_DOUBLE_ID:
    T = Context.DoubleTy;
    break;
  case PREDEF_TYPE_LONGDOUBLE_ID:
    T = Context.LongDoubleTy;
    break;
  case PREDEF_TYPE_SHORT_ACCUM_ID:
    T = Context.ShortAccumTy;
    break;
  case PREDEF_TYPE_ACCUM_ID:
    T = Context.AccumTy;
    break;
  case PREDEF_TYPE_LONG_ACCUM_ID:
    T = Context.LongAccumTy;
    break;
  case PREDEF_TYPE_USHORT_ACCUM_ID:
    T = Context.UnsignedShortAccumTy;
    break;
  case PREDEF_TYPE_UACCUM_ID:
    T = Context.UnsignedAccumTy;
    break;
  case PREDEF_TYPE_ULONG_ACCUM_ID:
    T = Context.UnsignedLongAccumTy;
    break;
  case PREDEF_TYPE_SHORT_FRACT_ID:
    T = Context.ShortFractTy;
    break;
  case PREDEF_TYPE_FRACT_ID:
    T = Context.FractTy;
    break;
  case PREDEF_TYPE_LONG_FRACT_ID:
    T = Context.LongFractTy;
    break;
  case PREDEF_TYPE_USHORT_FRACT_ID:
    T = Context.UnsignedShortFractTy;
    break;
  case PREDEF_TYPE_UFRACT_ID:
    T = Context.UnsignedFractTy;
    break;
  case PREDEF_TYPE_ULONG_FRACT_ID:
    T = Context.UnsignedLongFractTy;
    break;
  case PREDEF_TYPE_SAT_SHORT_ACCUM_ID:
    T = Context.SatShortAccumTy;
    break;
  case PREDEF_TYPE_SAT_ACCUM_ID:
    T = Context.SatAccumTy;
    break;
  case PREDEF_TYPE_SAT_LONG_ACCUM_ID:
    T = Context.SatLongAccumTy;
    break;
  case PREDEF_TYPE_SAT_USHORT_ACCUM_ID:
    T = Context.SatUnsignedShortAccumTy;
    break;
  case PREDEF_TYPE_SAT_UACCUM_ID:
    T = Context.SatUnsignedAccumTy;
    break;
  case PREDEF_TYPE_SAT_ULONG_ACCUM_ID:
    T = Context.SatUnsignedLongAccumTy;
    break;
  case PREDEF_TYPE_SAT_SHORT_FRACT_ID:
    T = Context.SatShortFractTy;
    break;
  case PREDEF_TYPE_SAT_FRACT_ID:
    T = Context.SatFractTy;
    break;
  case PREDEF_TYPE_SAT_LONG_FRACT_ID:
    T = Context.SatLongFractTy;
    break;
  case PREDEF_TYPE_SAT_USHORT_FRACT_ID:
    T = Context.SatUnsignedShortFractTy;
    break;
  case PREDEF_TYPE_SAT_UFRACT_ID:
    T = Context.SatUnsignedFractTy;
    break;
  case PREDEF_TYPE_SAT_ULONG_FRACT_ID:
    T = Context.SatUnsignedLongFractTy;
    break;
  case PREDEF_TYPE_FLOAT16_ID:
    T = Context.Float16Ty;
    break;
  case PREDEF_TYPE_FLOAT128_ID:
    T = Context.Float128Ty;
    break;
  case PREDEF_TYPE_OVERLOAD_ID:
    T = Context.OverloadTy;
    break;
  case PREDEF_TYPE_BOUND_MEMBER:
    T = Context.BoundMemberTy;
    break;
  case PREDEF_TYPE_PSEUDO_OBJECT:
    T = Context.PseudoObjectTy;
    break;
  case PREDEF_TYPE_DEPENDENT_ID:
    T = Context.DependentTy;
    break;
  case PREDEF_TYPE_UNKNOWN_ANY:
    T = Context.UnknownAnyTy;
    break;
  case PREDEF_TYPE_NULLPTR_ID:
    T = Context.NullPtrTy;
    break;
  case PREDEF_TYPE_CHAR8_ID:
    T = Context.Char8Ty;
    break;
  case PREDEF_TYPE_CHAR16_ID:
    T = Context.Char16Ty;
    break;
  case PREDEF_TYPE_CHAR32_ID:
    T = Context.Char32Ty;
    break;
  case PREDEF_TYPE_OBJC_ID:
    T = Context.ObjCBuiltinIdTy;
    break;
  case PREDEF_TYPE_OBJC_CLASS:
    T = Context.ObjCBuiltinClassTy;
    break;
  case PREDEF_TYPE_OBJC_SEL:
    T = Context.ObjCBuiltinSelTy;
    break;
7023#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) \
  case PREDEF_TYPE_##Id##_ID: \
    T = Context.SingletonId; \
    break;
7027#include "clang/Basic/OpenCLImageTypes.def"
7028#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) \
  case PREDEF_TYPE_##Id##_ID: \
    T = Context.Id##Ty; \
    break;
7032#include "clang/Basic/OpenCLExtensionTypes.def"
  case PREDEF_TYPE_SAMPLER_ID:
    T = Context.OCLSamplerTy;
    break;
  case PREDEF_TYPE_EVENT_ID:
    T = Context.OCLEventTy;
    break;
  case PREDEF_TYPE_CLK_EVENT_ID:
    T = Context.OCLClkEventTy;
    break;
  case PREDEF_TYPE_QUEUE_ID:
    T = Context.OCLQueueTy;
    break;
  case PREDEF_TYPE_RESERVE_ID_ID:
    T = Context.OCLReserveIDTy;
    break;
  case PREDEF_TYPE_AUTO_DEDUCT:
    T = Context.getAutoDeductType();
    break;
  case PREDEF_TYPE_AUTO_RREF_DEDUCT:
    T = Context.getAutoRRefDeductType();
    break;
  case PREDEF_TYPE_ARC_UNBRIDGED_CAST:
    T = Context.ARCUnbridgedCastTy;
    break;
  case PREDEF_TYPE_BUILTIN_FN:
    T = Context.BuiltinFnTy;
    break;
  case PREDEF_TYPE_INCOMPLETE_MATRIX_IDX:
    T = Context.IncompleteMatrixIdxTy;
    break;
  case PREDEF_TYPE_OMP_ARRAY_SECTION:
    T = Context.OMPArraySectionTy;
    break;
  case PREDEF_TYPE_OMP_ARRAY_SHAPING:
    T = Context.OMPArraySectionTy;
    break;
  case PREDEF_TYPE_OMP_ITERATOR:
    T = Context.OMPIteratorTy;
    break;
7072#define SVE_TYPE(Name, Id, SingletonId) \
  case PREDEF_TYPE_##Id##_ID: \
    T = Context.SingletonId; \
    break;
7076#include "clang/Basic/AArch64SVEACLETypes.def"
7077#define PPC_VECTOR_TYPE(Name, Id, Size) \
  case PREDEF_TYPE_##Id##_ID: \
    T = Context.Id##Ty; \
    break;
7081#include "clang/Basic/PPCTypes.def"
7082#define RVV_TYPE(Name, Id, SingletonId) \
  case PREDEF_TYPE_##Id##_ID: \
    T = Context.SingletonId; \
    break;
7086#include "clang/Basic/RISCVVTypes.def"
  }

  assert(!T.isNull() && "Unknown predefined type")((void)0);
  return T.withFastQualifiers(FastQuals);
}

Index -= NUM_PREDEF_TYPE_IDS;
assert(Index < TypesLoaded.size() && "Type index out-of-range")((void)0);
if (TypesLoaded[Index].isNull()) {
  TypesLoaded[Index] = readTypeRecord(Index);
  if (TypesLoaded[Index].isNull())
    return QualType();

  TypesLoaded[Index]->setFromAST();
  if (DeserializationListener)
    DeserializationListener->TypeRead(TypeIdx::fromTypeID(ID),
                                      TypesLoaded[Index]);
}

return TypesLoaded[Index].withFastQualifiers(FastQuals);
7107}

7109QualType ASTReader::getLocalType(ModuleFile &F, unsigned LocalID) {
return GetType(getGlobalTypeID(F, LocalID));
7111}

7113serialization::TypeID
7114ASTReader::getGlobalTypeID(ModuleFile &F, unsigned LocalID) const {
unsigned FastQuals = LocalID & Qualifiers::FastMask;
unsigned LocalIndex = LocalID >> Qualifiers::FastWidth;

if (LocalIndex < NUM_PREDEF_TYPE_IDS)
  return LocalID;

if (!F.ModuleOffsetMap.empty())
  ReadModuleOffsetMap(F);

ContinuousRangeMap<uint32_t, int, 2>::iterator I
  = F.TypeRemap.find(LocalIndex - NUM_PREDEF_TYPE_IDS);
assert(I != F.TypeRemap.end() && "Invalid index into type index remap")((void)0);

unsigned GlobalIndex = LocalIndex + I->second;
return (GlobalIndex << Qualifiers::FastWidth) | FastQuals;
7130}

7132TemplateArgumentLocInfo
7133ASTRecordReader::readTemplateArgumentLocInfo(TemplateArgument::ArgKind Kind) {
switch (Kind) {
case TemplateArgument::Expression:
  return readExpr();
case TemplateArgument::Type:
  return readTypeSourceInfo();
case TemplateArgument::Template: {
  NestedNameSpecifierLoc QualifierLoc =
    readNestedNameSpecifierLoc();
  SourceLocation TemplateNameLoc = readSourceLocation();
  return TemplateArgumentLocInfo(getASTContext(), QualifierLoc,
                                 TemplateNameLoc, SourceLocation());
}
case TemplateArgument::TemplateExpansion: {
  NestedNameSpecifierLoc QualifierLoc = readNestedNameSpecifierLoc();
  SourceLocation TemplateNameLoc = readSourceLocation();
  SourceLocation EllipsisLoc = readSourceLocation();
  return TemplateArgumentLocInfo(getASTContext(), QualifierLoc,
                                 TemplateNameLoc, EllipsisLoc);
}
case TemplateArgument::Null:
case TemplateArgument::Integral:
case TemplateArgument::Declaration:
case TemplateArgument::NullPtr:
case TemplateArgument::Pack:
  // FIXME: Is this right?
  return TemplateArgumentLocInfo();
}
llvm_unreachable("unexpected template argument loc")__builtin_unreachable();
7162}

7164TemplateArgumentLoc ASTRecordReader::readTemplateArgumentLoc() {
TemplateArgument Arg = readTemplateArgument();

if (Arg.getKind() == TemplateArgument::Expression) {
  if (readBool()) // bool InfoHasSameExpr.
    return TemplateArgumentLoc(Arg, TemplateArgumentLocInfo(Arg.getAsExpr()));
}
return TemplateArgumentLoc(Arg, readTemplateArgumentLocInfo(Arg.getKind()));
7172}

7174const ASTTemplateArgumentListInfo *
7175ASTRecordReader::readASTTemplateArgumentListInfo() {
SourceLocation LAngleLoc = readSourceLocation();
SourceLocation RAngleLoc = readSourceLocation();
unsigned NumArgsAsWritten = readInt();
TemplateArgumentListInfo TemplArgsInfo(LAngleLoc, RAngleLoc);
for (unsigned i = 0; i != NumArgsAsWritten; ++i)
  TemplArgsInfo.addArgument(readTemplateArgumentLoc());
return ASTTemplateArgumentListInfo::Create(getContext(), TemplArgsInfo);
7183}

7185Decl *ASTReader::GetExternalDecl(uint32_t ID) {
return GetDecl(ID);
7187}

7189void ASTReader::CompleteRedeclChain(const Decl *D) {
if (NumCurrentElementsDeserializing) {
  // We arrange to not care about the complete redeclaration chain while we're
  // deserializing. Just remember that the AST has marked this one as complete
  // but that it's not actually complete yet, so we know we still need to
  // complete it later.
  PendingIncompleteDeclChains.push_back(const_cast<Decl*>(D));
  return;
}

if (!D->getDeclContext()) {
  assert(isa<TranslationUnitDecl>(D) && "Not a TU?")((void)0);
  return;
}

const DeclContext *DC = D->getDeclContext()->getRedeclContext();

// If this is a named declaration, complete it by looking it up
// within its context.
//
// FIXME: Merging a function definition should merge
// all mergeable entities within it.
if (isa<TranslationUnitDecl>(DC) || isa<NamespaceDecl>(DC) ||
    isa<CXXRecordDecl>(DC) || isa<EnumDecl>(DC)) {
  if (DeclarationName Name = cast<NamedDecl>(D)->getDeclName()) {
    if (!getContext().getLangOpts().CPlusPlus &&
        isa<TranslationUnitDecl>(DC)) {
      // Outside of C++, we don't have a lookup table for the TU, so update
      // the identifier instead. (For C++ modules, we don't store decls
      // in the serialized identifier table, so we do the lookup in the TU.)
      auto *II = Name.getAsIdentifierInfo();
      assert(II && "non-identifier name in C?")((void)0);
      if (II->isOutOfDate())
        updateOutOfDateIdentifier(*II);
    } else
      DC->lookup(Name);
  } else if (needsAnonymousDeclarationNumber(cast<NamedDecl>(D))) {
    // Find all declarations of this kind from the relevant context.
    for (auto *DCDecl : cast<Decl>(D->getLexicalDeclContext())->redecls()) {
      auto *DC = cast<DeclContext>(DCDecl);
      SmallVector<Decl*, 8> Decls;
      FindExternalLexicalDecls(
          DC, [&](Decl::Kind K) { return K == D->getKind(); }, Decls);
    }
  }
}

if (auto *CTSD = dyn_cast<ClassTemplateSpecializationDecl>(D))
  CTSD->getSpecializedTemplate()->LoadLazySpecializations();
if (auto *VTSD = dyn_cast<VarTemplateSpecializationDecl>(D))
  VTSD->getSpecializedTemplate()->LoadLazySpecializations();
if (auto *FD = dyn_cast<FunctionDecl>(D)) {
  if (auto *Template = FD->getPrimaryTemplate())
    Template->LoadLazySpecializations();
}
7244}

7246CXXCtorInitializer **
7247ASTReader::GetExternalCXXCtorInitializers(uint64_t Offset) {
RecordLocation Loc = getLocalBitOffset(Offset);
BitstreamCursor &Cursor = Loc.F->DeclsCursor;
SavedStreamPosition SavedPosition(Cursor);
if (llvm::Error Err = Cursor.JumpToBit(Loc.Offset)) {
  Error(std::move(Err));
  return nullptr;
}
ReadingKindTracker ReadingKind(Read_Decl, *this);

Expected<unsigned> MaybeCode = Cursor.ReadCode();
if (!MaybeCode) {
  Error(MaybeCode.takeError());
  return nullptr;
}
unsigned Code = MaybeCode.get();

ASTRecordReader Record(*this, *Loc.F);
Expected<unsigned> MaybeRecCode = Record.readRecord(Cursor, Code);
if (!MaybeRecCode) {
  Error(MaybeRecCode.takeError());
  return nullptr;
}
if (MaybeRecCode.get() != DECL_CXX_CTOR_INITIALIZERS) {
  Error("malformed AST file: missing C++ ctor initializers");
  return nullptr;
}

return Record.readCXXCtorInitializers();
7276}

7278CXXBaseSpecifier *ASTReader::GetExternalCXXBaseSpecifiers(uint64_t Offset) {
assert(ContextObj && "reading base specifiers with no AST context")((void)0);
ASTContext &Context = *ContextObj;

RecordLocation Loc = getLocalBitOffset(Offset);
BitstreamCursor &Cursor = Loc.F->DeclsCursor;
SavedStreamPosition SavedPosition(Cursor);
if (llvm::Error Err = Cursor.JumpToBit(Loc.Offset)) {
  Error(std::move(Err));
  return nullptr;
}
ReadingKindTracker ReadingKind(Read_Decl, *this);

Expected<unsigned> MaybeCode = Cursor.ReadCode();
if (!MaybeCode) {
  Error(MaybeCode.takeError());
  return nullptr;
}
unsigned Code = MaybeCode.get();

ASTRecordReader Record(*this, *Loc.F);
Expected<unsigned> MaybeRecCode = Record.readRecord(Cursor, Code);
if (!MaybeRecCode) {
  Error(MaybeCode.takeError());
  return nullptr;
}
unsigned RecCode = MaybeRecCode.get();

if (RecCode != DECL_CXX_BASE_SPECIFIERS) {
  Error("malformed AST file: missing C++ base specifiers");
  return nullptr;
}

unsigned NumBases = Record.readInt();
void *Mem = Context.Allocate(sizeof(CXXBaseSpecifier) * NumBases);
CXXBaseSpecifier *Bases = new (Mem) CXXBaseSpecifier [NumBases];
for (unsigned I = 0; I != NumBases; ++I)
  Bases[I] = Record.readCXXBaseSpecifier();
return Bases;
7317}

7319serialization::DeclID
7320ASTReader::getGlobalDeclID(ModuleFile &F, LocalDeclID LocalID) const {
if (LocalID < NUM_PREDEF_DECL_IDS)
  return LocalID;

if (!F.ModuleOffsetMap.empty())
  ReadModuleOffsetMap(F);

ContinuousRangeMap<uint32_t, int, 2>::iterator I
  = F.DeclRemap.find(LocalID - NUM_PREDEF_DECL_IDS);
assert(I != F.DeclRemap.end() && "Invalid index into decl index remap")((void)0);

return LocalID + I->second;
7332}

7334bool ASTReader::isDeclIDFromModule(serialization::GlobalDeclID ID,
                                 ModuleFile &M) const {
// Predefined decls aren't from any module.
if (ID < NUM_PREDEF_DECL_IDS)
  return false;

return ID - NUM_PREDEF_DECL_IDS >= M.BaseDeclID &&
       ID - NUM_PREDEF_DECL_IDS < M.BaseDeclID + M.LocalNumDecls;
7342}

7344ModuleFile *ASTReader::getOwningModuleFile(const Decl *D) {
if (!D->isFromASTFile())
  return nullptr;
GlobalDeclMapType::const_iterator I = GlobalDeclMap.find(D->getGlobalID());
assert(I != GlobalDeclMap.end() && "Corrupted global declaration map")((void)0);
return I->second;
7350}

7352SourceLocation ASTReader::getSourceLocationForDeclID(GlobalDeclID ID) {
if (ID < NUM_PREDEF_DECL_IDS)
  return SourceLocation();

unsigned Index = ID - NUM_PREDEF_DECL_IDS;

if (Index > DeclsLoaded.size()) {
  Error("declaration ID out-of-range for AST file");
  return SourceLocation();
}

if (Decl *D = DeclsLoaded[Index])
  return D->getLocation();

SourceLocation Loc;
DeclCursorForID(ID, Loc);
return Loc;
7369}

7371static Decl *getPredefinedDecl(ASTContext &Context, PredefinedDeclIDs ID) {
switch (ID) {
case PREDEF_DECL_NULL_ID:
  return nullptr;

case PREDEF_DECL_TRANSLATION_UNIT_ID:
  return Context.getTranslationUnitDecl();

case PREDEF_DECL_OBJC_ID_ID:
  return Context.getObjCIdDecl();

case PREDEF_DECL_OBJC_SEL_ID:
  return Context.getObjCSelDecl();

case PREDEF_DECL_OBJC_CLASS_ID:
  return Context.getObjCClassDecl();

case PREDEF_DECL_OBJC_PROTOCOL_ID:
  return Context.getObjCProtocolDecl();

case PREDEF_DECL_INT_128_ID:
  return Context.getInt128Decl();

case PREDEF_DECL_UNSIGNED_INT_128_ID:
  return Context.getUInt128Decl();

case PREDEF_DECL_OBJC_INSTANCETYPE_ID:
  return Context.getObjCInstanceTypeDecl();

case PREDEF_DECL_BUILTIN_VA_LIST_ID:
  return Context.getBuiltinVaListDecl();

case PREDEF_DECL_VA_LIST_TAG:
  return Context.getVaListTagDecl();

case PREDEF_DECL_BUILTIN_MS_VA_LIST_ID:
  return Context.getBuiltinMSVaListDecl();

case PREDEF_DECL_BUILTIN_MS_GUID_ID:
  return Context.getMSGuidTagDecl();

case PREDEF_DECL_EXTERN_C_CONTEXT_ID:
  return Context.getExternCContextDecl();

case PREDEF_DECL_MAKE_INTEGER_SEQ_ID:
  return Context.getMakeIntegerSeqDecl();

case PREDEF_DECL_CF_CONSTANT_STRING_ID:
  return Context.getCFConstantStringDecl();

case PREDEF_DECL_CF_CONSTANT_STRING_TAG_ID:
  return Context.getCFConstantStringTagDecl();

case PREDEF_DECL_TYPE_PACK_ELEMENT_ID:
  return Context.getTypePackElementDecl();
}
llvm_unreachable("PredefinedDeclIDs unknown enum value")__builtin_unreachable();
7428}

7430Decl *ASTReader::GetExistingDecl(DeclID ID) {
assert(ContextObj && "reading decl with no AST context")((void)0);
if (ID < NUM_PREDEF_DECL_IDS) {
  Decl *D = getPredefinedDecl(*ContextObj, (PredefinedDeclIDs)ID);
  if (D) {
    // Track that we have merged the declaration with ID \p ID into the
    // pre-existing predefined declaration \p D.
    auto &Merged = KeyDecls[D->getCanonicalDecl()];
    if (Merged.empty())
      Merged.push_back(ID);
  }
  return D;
}

unsigned Index = ID - NUM_PREDEF_DECL_IDS;

if (Index >= DeclsLoaded.size()) {
  assert(0 && "declaration ID out-of-range for AST file")((void)0);
  Error("declaration ID out-of-range for AST file");
  return nullptr;
}

return DeclsLoaded[Index];
7453}

7455Decl *ASTReader::GetDecl(DeclID ID) {
if (ID < NUM_PREDEF_DECL_IDS)
  return GetExistingDecl(ID);

unsigned Index = ID - NUM_PREDEF_DECL_IDS;

if (Index >= DeclsLoaded.size()) {
  assert(0 && "declaration ID out-of-range for AST file")((void)0);
  Error("declaration ID out-of-range for AST file");
  return nullptr;
}

if (!DeclsLoaded[Index]) {
  ReadDeclRecord(ID);
  if (DeserializationListener)
    DeserializationListener->DeclRead(ID, DeclsLoaded[Index]);
}

return DeclsLoaded[Index];
7474}

7476DeclID ASTReader::mapGlobalIDToModuleFileGlobalID(ModuleFile &M,
                                                DeclID GlobalID) {
if (GlobalID < NUM_PREDEF_DECL_IDS)
  return GlobalID;

GlobalDeclMapType::const_iterator I = GlobalDeclMap.find(GlobalID);
assert(I != GlobalDeclMap.end() && "Corrupted global declaration map")((void)0);
ModuleFile *Owner = I->second;

llvm::DenseMap<ModuleFile *, serialization::DeclID>::iterator Pos
  = M.GlobalToLocalDeclIDs.find(Owner);
if (Pos == M.GlobalToLocalDeclIDs.end())
  return 0;

return GlobalID - Owner->BaseDeclID + Pos->second;
7491}

7493serialization::DeclID ASTReader::ReadDeclID(ModuleFile &F,
                                          const RecordData &Record,
                                          unsigned &Idx) {
if (Idx >= Record.size()) {
  Error("Corrupted AST file");
  return 0;
}

return getGlobalDeclID(F, Record[Idx++]);
7502}

7504/// Resolve the offset of a statement into a statement.
7505///
7506/// This operation will read a new statement from the external
7507/// source each time it is called, and is meant to be used via a
7508/// LazyOffsetPtr (which is used by Decls for the body of functions, etc).
7509Stmt *ASTReader::GetExternalDeclStmt(uint64_t Offset) {
// Switch case IDs are per Decl.
ClearSwitchCaseIDs();

// Offset here is a global offset across the entire chain.
RecordLocation Loc = getLocalBitOffset(Offset);
if (llvm::Error Err = Loc.F->DeclsCursor.JumpToBit(Loc.Offset)) {
  Error(std::move(Err));
  return nullptr;
}
assert(NumCurrentElementsDeserializing == 0 &&((void)0)
       "should not be called while already deserializing")((void)0);
Deserializing D(this);
return ReadStmtFromStream(*Loc.F);
7523}

7525void ASTReader::FindExternalLexicalDecls(
  const DeclContext *DC, llvm::function_ref<bool(Decl::Kind)> IsKindWeWant,
  SmallVectorImpl<Decl *> &Decls) {
bool PredefsVisited[NUM_PREDEF_DECL_IDS] = {};

auto Visit = [&] (ModuleFile *M, LexicalContents LexicalDecls) {
  assert(LexicalDecls.size() % 2 == 0 && "expected an even number of entries")((void)0);
  for (int I = 0, N = LexicalDecls.size(); I != N; I += 2) {
    auto K = (Decl::Kind)+LexicalDecls[I];
    if (!IsKindWeWant(K))
      continue;

    auto ID = (serialization::DeclID)+LexicalDecls[I + 1];

    // Don't add predefined declarations to the lexical context more
    // than once.
    if (ID < NUM_PREDEF_DECL_IDS) {
      if (PredefsVisited[ID])
        continue;

      PredefsVisited[ID] = true;
    }

    if (Decl *D = GetLocalDecl(*M, ID)) {
      assert(D->getKind() == K && "wrong kind for lexical decl")((void)0);
      if (!DC->isDeclInLexicalTraversal(D))
        Decls.push_back(D);
    }
  }
};

if (isa<TranslationUnitDecl>(DC)) {
  for (auto Lexical : TULexicalDecls)
    Visit(Lexical.first, Lexical.second);
} else {
  auto I = LexicalDecls.find(DC);
  if (I != LexicalDecls.end())
    Visit(I->second.first, I->second.second);
}

++NumLexicalDeclContextsRead;
7566}

7568namespace {

7570class DeclIDComp {
ASTReader &Reader;
ModuleFile &Mod;

7574public:
DeclIDComp(ASTReader &Reader, ModuleFile &M) : Reader(Reader), Mod(M) {}

bool operator()(LocalDeclID L, LocalDeclID R) const {
  SourceLocation LHS = getLocation(L);
  SourceLocation RHS = getLocation(R);
  return Reader.getSourceManager().isBeforeInTranslationUnit(LHS, RHS);
}

bool operator()(SourceLocation LHS, LocalDeclID R) const {
  SourceLocation RHS = getLocation(R);
  return Reader.getSourceManager().isBeforeInTranslationUnit(LHS, RHS);
}

bool operator()(LocalDeclID L, SourceLocation RHS) const {
  SourceLocation LHS = getLocation(L);
  return Reader.getSourceManager().isBeforeInTranslationUnit(LHS, RHS);
}

SourceLocation getLocation(LocalDeclID ID) const {
  return Reader.getSourceManager().getFileLoc(
          Reader.getSourceLocationForDeclID(Reader.getGlobalDeclID(Mod, ID)));
}
7597};

7599} // namespace

7601void ASTReader::FindFileRegionDecls(FileID File,
                                  unsigned Offset, unsigned Length,
                                  SmallVectorImpl<Decl *> &Decls) {
SourceManager &SM = getSourceManager();

llvm::DenseMap<FileID, FileDeclsInfo>::iterator I = FileDeclIDs.find(File);
if (I == FileDeclIDs.end())
  return;

FileDeclsInfo &DInfo = I->second;
if (DInfo.Decls.empty())
  return;

SourceLocation
  BeginLoc = SM.getLocForStartOfFile(File).getLocWithOffset(Offset);
SourceLocation EndLoc = BeginLoc.getLocWithOffset(Length);

DeclIDComp DIDComp(*this, *DInfo.Mod);
ArrayRef<serialization::LocalDeclID>::iterator BeginIt =
    llvm::lower_bound(DInfo.Decls, BeginLoc, DIDComp);
if (BeginIt != DInfo.Decls.begin())
  --BeginIt;

// If we are pointing at a top-level decl inside an objc container, we need
// to backtrack until we find it otherwise we will fail to report that the
// region overlaps with an objc container.
while (BeginIt != DInfo.Decls.begin() &&
       GetDecl(getGlobalDeclID(*DInfo.Mod, *BeginIt))
           ->isTopLevelDeclInObjCContainer())
  --BeginIt;

ArrayRef<serialization::LocalDeclID>::iterator EndIt =
    llvm::upper_bound(DInfo.Decls, EndLoc, DIDComp);
if (EndIt != DInfo.Decls.end())
  ++EndIt;

for (ArrayRef<serialization::LocalDeclID>::iterator
       DIt = BeginIt; DIt != EndIt; ++DIt)
  Decls.push_back(GetDecl(getGlobalDeclID(*DInfo.Mod, *DIt)));
7640}

7642bool
7643ASTReader::FindExternalVisibleDeclsByName(const DeclContext *DC,
                                        DeclarationName Name) {
assert(DC->hasExternalVisibleStorage() && DC == DC->getPrimaryContext() &&((void)0)
       "DeclContext has no visible decls in storage")((void)0);
if (!Name)
  return false;

auto It = Lookups.find(DC);
if (It == Lookups.end())
  return false;

Deserializing LookupResults(this);

// Load the list of declarations.
SmallVector<NamedDecl *, 64> Decls;
llvm::SmallPtrSet<NamedDecl *, 8> Found;
for (DeclID ID : It->second.Table.find(Name)) {
  NamedDecl *ND = cast<NamedDecl>(GetDecl(ID));
  if (ND->getDeclName() == Name && Found.insert(ND).second)
    Decls.push_back(ND);
}

++NumVisibleDeclContextsRead;
SetExternalVisibleDeclsForName(DC, Name, Decls);
return !Decls.empty();
7668}

7670void ASTReader::completeVisibleDeclsMap(const DeclContext *DC) {
if (!DC->hasExternalVisibleStorage())
  return;

auto It = Lookups.find(DC);
assert(It != Lookups.end() &&((void)0)
       "have external visible storage but no lookup tables")((void)0);

DeclsMap Decls;

for (DeclID ID : It->second.Table.findAll()) {
  NamedDecl *ND = cast<NamedDecl>(GetDecl(ID));
  Decls[ND->getDeclName()].push_back(ND);
}

++NumVisibleDeclContextsRead;

for (DeclsMap::iterator I = Decls.begin(), E = Decls.end(); I != E; ++I) {
  SetExternalVisibleDeclsForName(DC, I->first, I->second);
}
const_cast<DeclContext *>(DC)->setHasExternalVisibleStorage(false);
7691}

7693const serialization::reader::DeclContextLookupTable *
7694ASTReader::getLoadedLookupTables(DeclContext *Primary) const {
auto I = Lookups.find(Primary);
return I == Lookups.end() ? nullptr : &I->second;
7697}

7699/// Under non-PCH compilation the consumer receives the objc methods
7700/// before receiving the implementation, and codegen depends on this.
7701/// We simulate this by deserializing and passing to consumer the methods of the
7702/// implementation before passing the deserialized implementation decl.
7703static void PassObjCImplDeclToConsumer(ObjCImplDecl *ImplD,
                                     ASTConsumer *Consumer) {
assert(ImplD && Consumer)((void)0);

for (auto *I : ImplD->methods())
  Consumer->HandleInterestingDecl(DeclGroupRef(I));

Consumer->HandleInterestingDecl(DeclGroupRef(ImplD));
7711}

7713void ASTReader::PassInterestingDeclToConsumer(Decl *D) {
if (ObjCImplDecl *ImplD = dyn_cast<ObjCImplDecl>(D))
  PassObjCImplDeclToConsumer(ImplD, Consumer);
else
  Consumer->HandleInterestingDecl(DeclGroupRef(D));
7718}

7720void ASTReader::StartTranslationUnit(ASTConsumer *Consumer) {
this->Consumer = Consumer;

if (Consumer)
  PassInterestingDeclsToConsumer();

if (DeserializationListener)
  DeserializationListener->ReaderInitialized(this);
7728}

7730void ASTReader::PrintStats() {
std::fprintf(stderr(&__sF[2]), "*** AST File Statistics:\n");

unsigned NumTypesLoaded
  = TypesLoaded.size() - std::count(TypesLoaded.begin(), TypesLoaded.end(),
                                    QualType());
unsigned NumDeclsLoaded
  = DeclsLoaded.size() - std::count(DeclsLoaded.begin(), DeclsLoaded.end(),
                                    (Decl *)nullptr);
unsigned NumIdentifiersLoaded
  = IdentifiersLoaded.size() - std::count(IdentifiersLoaded.begin(),
                                          IdentifiersLoaded.end(),
                                          (IdentifierInfo *)nullptr);
unsigned NumMacrosLoaded
  = MacrosLoaded.size() - std::count(MacrosLoaded.begin(),
                                     MacrosLoaded.end(),
                                     (MacroInfo *)nullptr);
unsigned NumSelectorsLoaded
  = SelectorsLoaded.size() - std::count(SelectorsLoaded.begin(),
                                        SelectorsLoaded.end(),
                                        Selector());

if (unsigned TotalNumSLocEntries = getTotalNumSLocs())
  std::fprintf(stderr(&__sF[2]), "  %u/%u source location entries read (%f%%)\n",
               NumSLocEntriesRead, TotalNumSLocEntries,
               ((float)NumSLocEntriesRead/TotalNumSLocEntries * 100));
if (!TypesLoaded.empty())
  std::fprintf(stderr(&__sF[2]), "  %u/%u types read (%f%%)\n",
               NumTypesLoaded, (unsigned)TypesLoaded.size(),
               ((float)NumTypesLoaded/TypesLoaded.size() * 100));
if (!DeclsLoaded.empty())
  std::fprintf(stderr(&__sF[2]), "  %u/%u declarations read (%f%%)\n",
               NumDeclsLoaded, (unsigned)DeclsLoaded.size(),
               ((float)NumDeclsLoaded/DeclsLoaded.size() * 100));
if (!IdentifiersLoaded.empty())
  std::fprintf(stderr(&__sF[2]), "  %u/%u identifiers read (%f%%)\n",
               NumIdentifiersLoaded, (unsigned)IdentifiersLoaded.size(),
               ((float)NumIdentifiersLoaded/IdentifiersLoaded.size() * 100));
if (!MacrosLoaded.empty())
  std::fprintf(stderr(&__sF[2]), "  %u/%u macros read (%f%%)\n",
               NumMacrosLoaded, (unsigned)MacrosLoaded.size(),
               ((float)NumMacrosLoaded/MacrosLoaded.size() * 100));
if (!SelectorsLoaded.empty())
  std::fprintf(stderr(&__sF[2]), "  %u/%u selectors read (%f%%)\n",
               NumSelectorsLoaded, (unsigned)SelectorsLoaded.size(),
               ((float)NumSelectorsLoaded/SelectorsLoaded.size() * 100));
if (TotalNumStatements)
  std::fprintf(stderr(&__sF[2]), "  %u/%u statements read (%f%%)\n",
               NumStatementsRead, TotalNumStatements,
               ((float)NumStatementsRead/TotalNumStatements * 100));
if (TotalNumMacros)
  std::fprintf(stderr(&__sF[2]), "  %u/%u macros read (%f%%)\n",
               NumMacrosRead, TotalNumMacros,
               ((float)NumMacrosRead/TotalNumMacros * 100));
if (TotalLexicalDeclContexts)
  std::fprintf(stderr(&__sF[2]), "  %u/%u lexical declcontexts read (%f%%)\n",
               NumLexicalDeclContextsRead, TotalLexicalDeclContexts,
               ((float)NumLexicalDeclContextsRead/TotalLexicalDeclContexts
                * 100));
if (TotalVisibleDeclContexts)
  std::fprintf(stderr(&__sF[2]), "  %u/%u visible declcontexts read (%f%%)\n",
               NumVisibleDeclContextsRead, TotalVisibleDeclContexts,
               ((float)NumVisibleDeclContextsRead/TotalVisibleDeclContexts
                * 100));
if (TotalNumMethodPoolEntries)
  std::fprintf(stderr(&__sF[2]), "  %u/%u method pool entries read (%f%%)\n",
               NumMethodPoolEntriesRead, TotalNumMethodPoolEntries,
               ((float)NumMethodPoolEntriesRead/TotalNumMethodPoolEntries
                * 100));
if (NumMethodPoolLookups)
  std::fprintf(stderr(&__sF[2]), "  %u/%u method pool lookups succeeded (%f%%)\n",
               NumMethodPoolHits, NumMethodPoolLookups,
               ((float)NumMethodPoolHits/NumMethodPoolLookups * 100.0));
if (NumMethodPoolTableLookups)
  std::fprintf(stderr(&__sF[2]), "  %u/%u method pool table lookups succeeded (%f%%)\n",
               NumMethodPoolTableHits, NumMethodPoolTableLookups,
               ((float)NumMethodPoolTableHits/NumMethodPoolTableLookups
                * 100.0));
if (NumIdentifierLookupHits)
  std::fprintf(stderr(&__sF[2]),
               "  %u / %u identifier table lookups succeeded (%f%%)\n",
               NumIdentifierLookupHits, NumIdentifierLookups,
               (double)NumIdentifierLookupHits*100.0/NumIdentifierLookups);

if (GlobalIndex) {
  std::fprintf(stderr(&__sF[2]), "\n");
  GlobalIndex->printStats();
}

std::fprintf(stderr(&__sF[2]), "\n");
dump();
std::fprintf(stderr(&__sF[2]), "\n");
7822}

7824template<typename Key, typename ModuleFile, unsigned InitialCapacity>
7825LLVM_DUMP_METHOD__attribute__((noinline)) static void
7826dumpModuleIDMap(StringRef Name,
              const ContinuousRangeMap<Key, ModuleFile *,
                                       InitialCapacity> &Map) {
if (Map.begin() == Map.end())
  return;

using MapType = ContinuousRangeMap<Key, ModuleFile *, InitialCapacity>;

llvm::errs() << Name << ":\n";
for (typename MapType::const_iterator I = Map.begin(), IEnd = Map.end();
     I != IEnd; ++I) {
  llvm::errs() << "  " << I->first << " -> " << I->second->FileName
    << "\n";
}
7840}

7842LLVM_DUMP_METHOD__attribute__((noinline)) void ASTReader::dump() {
llvm::errs() << "*** PCH/ModuleFile Remappings:\n";
dumpModuleIDMap("Global bit offset map", GlobalBitOffsetsMap);
dumpModuleIDMap("Global source location entry map", GlobalSLocEntryMap);
dumpModuleIDMap("Global type map", GlobalTypeMap);
dumpModuleIDMap("Global declaration map", GlobalDeclMap);
dumpModuleIDMap("Global identifier map", GlobalIdentifierMap);
dumpModuleIDMap("Global macro map", GlobalMacroMap);
dumpModuleIDMap("Global submodule map", GlobalSubmoduleMap);
dumpModuleIDMap("Global selector map", GlobalSelectorMap);
dumpModuleIDMap("Global preprocessed entity map",
                GlobalPreprocessedEntityMap);

llvm::errs() << "\n*** PCH/Modules Loaded:";
for (ModuleFile &M : ModuleMgr)
  M.dump();
7858}

7860/// Return the amount of memory used by memory buffers, breaking down
7861/// by heap-backed versus mmap'ed memory.
7862void ASTReader::getMemoryBufferSizes(MemoryBufferSizes &sizes) const {
for (ModuleFile &I : ModuleMgr) {
  if (llvm::MemoryBuffer *buf = I.Buffer) {
    size_t bytes = buf->getBufferSize();
    switch (buf->getBufferKind()) {
      case llvm::MemoryBuffer::MemoryBuffer_Malloc:
        sizes.malloc_bytes += bytes;
        break;
      case llvm::MemoryBuffer::MemoryBuffer_MMap:
        sizes.mmap_bytes += bytes;
        break;
    }
  }
}
7876}

7878void ASTReader::InitializeSema(Sema &S) {
SemaObj = &S;
S.addExternalSource(this);

// Makes sure any declarations that were deserialized "too early"
// still get added to the identifier's declaration chains.
for (uint64_t ID : PreloadedDeclIDs) {
  NamedDecl *D = cast<NamedDecl>(GetDecl(ID));
  pushExternalDeclIntoScope(D, D->getDeclName());
}
PreloadedDeclIDs.clear();

// FIXME: What happens if these are changed by a module import?
if (!FPPragmaOptions.empty()) {
  assert(FPPragmaOptions.size() == 1 && "Wrong number of FP_PRAGMA_OPTIONS")((void)0);
  FPOptionsOverride NewOverrides =
      FPOptionsOverride::getFromOpaqueInt(FPPragmaOptions[0]);
  SemaObj->CurFPFeatures =
      NewOverrides.applyOverrides(SemaObj->getLangOpts());
}

SemaObj->OpenCLFeatures = OpenCLExtensions;

UpdateSema();
7902}

7904void ASTReader::UpdateSema() {
assert(SemaObj && "no Sema to update")((void)0);

// Load the offsets of the declarations that Sema references.
// They will be lazily deserialized when needed.
if (!SemaDeclRefs.empty()) {
  assert(SemaDeclRefs.size() % 3 == 0)((void)0);
  for (unsigned I = 0; I != SemaDeclRefs.size(); I += 3) {
    if (!SemaObj->StdNamespace)
      SemaObj->StdNamespace = SemaDeclRefs[I];
    if (!SemaObj->StdBadAlloc)
      SemaObj->StdBadAlloc = SemaDeclRefs[I+1];
    if (!SemaObj->StdAlignValT)
      SemaObj->StdAlignValT = SemaDeclRefs[I+2];
  }
  SemaDeclRefs.clear();
}

// Update the state of pragmas. Use the same API as if we had encountered the
// pragma in the source.
if(OptimizeOffPragmaLocation.isValid())
  SemaObj->ActOnPragmaOptimize(/* On = */ false, OptimizeOffPragmaLocation);
if (PragmaMSStructState != -1)
  SemaObj->ActOnPragmaMSStruct((PragmaMSStructKind)PragmaMSStructState);
if (PointersToMembersPragmaLocation.isValid()) {
  SemaObj->ActOnPragmaMSPointersToMembers(
      (LangOptions::PragmaMSPointersToMembersKind)
          PragmaMSPointersToMembersState,
      PointersToMembersPragmaLocation);
}
SemaObj->ForceCUDAHostDeviceDepth = ForceCUDAHostDeviceDepth;

if (PragmaAlignPackCurrentValue) {
  // The bottom of the stack might have a default value. It must be adjusted
  // to the current value to ensure that the packing state is preserved after
  // popping entries that were included/imported from a PCH/module.
  bool DropFirst = false;
  if (!PragmaAlignPackStack.empty() &&
      PragmaAlignPackStack.front().Location.isInvalid()) {
    assert(PragmaAlignPackStack.front().Value ==((void)0)
               SemaObj->AlignPackStack.DefaultValue &&((void)0)
           "Expected a default alignment value")((void)0);
    SemaObj->AlignPackStack.Stack.emplace_back(
        PragmaAlignPackStack.front().SlotLabel,
        SemaObj->AlignPackStack.CurrentValue,
        SemaObj->AlignPackStack.CurrentPragmaLocation,
        PragmaAlignPackStack.front().PushLocation);
    DropFirst = true;
  }
  for (const auto &Entry : llvm::makeArrayRef(PragmaAlignPackStack)
                               .drop_front(DropFirst ? 1 : 0)) {
    SemaObj->AlignPackStack.Stack.emplace_back(
        Entry.SlotLabel, Entry.Value, Entry.Location, Entry.PushLocation);
  }
  if (PragmaAlignPackCurrentLocation.isInvalid()) {
    assert(*PragmaAlignPackCurrentValue ==((void)0)
               SemaObj->AlignPackStack.DefaultValue &&((void)0)
           "Expected a default align and pack value")((void)0);
    // Keep the current values.
  } else {
    SemaObj->AlignPackStack.CurrentValue = *PragmaAlignPackCurrentValue;
    SemaObj->AlignPackStack.CurrentPragmaLocation =
        PragmaAlignPackCurrentLocation;
  }
}
if (FpPragmaCurrentValue) {
  // The bottom of the stack might have a default value. It must be adjusted
  // to the current value to ensure that fp-pragma state is preserved after
  // popping entries that were included/imported from a PCH/module.
  bool DropFirst = false;
  if (!FpPragmaStack.empty() && FpPragmaStack.front().Location.isInvalid()) {
    assert(FpPragmaStack.front().Value ==((void)0)
               SemaObj->FpPragmaStack.DefaultValue &&((void)0)
           "Expected a default pragma float_control value")((void)0);
    SemaObj->FpPragmaStack.Stack.emplace_back(
        FpPragmaStack.front().SlotLabel, SemaObj->FpPragmaStack.CurrentValue,
        SemaObj->FpPragmaStack.CurrentPragmaLocation,
        FpPragmaStack.front().PushLocation);
    DropFirst = true;
  }
  for (const auto &Entry :
       llvm::makeArrayRef(FpPragmaStack).drop_front(DropFirst ? 1 : 0))
    SemaObj->FpPragmaStack.Stack.emplace_back(
        Entry.SlotLabel, Entry.Value, Entry.Location, Entry.PushLocation);
  if (FpPragmaCurrentLocation.isInvalid()) {
    assert(*FpPragmaCurrentValue == SemaObj->FpPragmaStack.DefaultValue &&((void)0)
           "Expected a default pragma float_control value")((void)0);
    // Keep the current values.
  } else {
    SemaObj->FpPragmaStack.CurrentValue = *FpPragmaCurrentValue;
    SemaObj->FpPragmaStack.CurrentPragmaLocation = FpPragmaCurrentLocation;
  }
}

// For non-modular AST files, restore visiblity of modules.
for (auto &Import : ImportedModules) {
  if (Import.ImportLoc.isInvalid())
    continue;
  if (Module *Imported = getSubmodule(Import.ID)) {
    SemaObj->makeModuleVisible(Imported, Import.ImportLoc);
  }
}
8006}

8008IdentifierInfo *ASTReader::get(StringRef Name) {
// Note that we are loading an identifier.
Deserializing AnIdentifier(this);

IdentifierLookupVisitor Visitor(Name, /*PriorGeneration=*/0,
                                NumIdentifierLookups,
                                NumIdentifierLookupHits);

// We don't need to do identifier table lookups in C++ modules (we preload
// all interesting declarations, and don't need to use the scope for name
// lookups). Perform the lookup in PCH files, though, since we don't build
// a complete initial identifier table if we're carrying on from a PCH.
if (PP.getLangOpts().CPlusPlus) {
  for (auto F : ModuleMgr.pch_modules())
    if (Visitor(*F))
      break;
} else {
  // If there is a global index, look there first to determine which modules
  // provably do not have any results for this identifier.
  GlobalModuleIndex::HitSet Hits;
  GlobalModuleIndex::HitSet *HitsPtr = nullptr;
  if (!loadGlobalIndex()) {
    if (GlobalIndex->lookupIdentifier(Name, Hits)) {
      HitsPtr = &Hits;
    }
  }

  ModuleMgr.visit(Visitor, HitsPtr);
}

IdentifierInfo *II = Visitor.getIdentifierInfo();
markIdentifierUpToDate(II);
return II;
8041}

8043namespace clang {

/// An identifier-lookup iterator that enumerates all of the
/// identifiers stored within a set of AST files.
class ASTIdentifierIterator : public IdentifierIterator {
  /// The AST reader whose identifiers are being enumerated.
  const ASTReader &Reader;

  /// The current index into the chain of AST files stored in
  /// the AST reader.
  unsigned Index;

  /// The current position within the identifier lookup table
  /// of the current AST file.
  ASTIdentifierLookupTable::key_iterator Current;

  /// The end position within the identifier lookup table of
  /// the current AST file.
  ASTIdentifierLookupTable::key_iterator End;

  /// Whether to skip any modules in the ASTReader.
  bool SkipModules;

public:
  explicit ASTIdentifierIterator(const ASTReader &Reader,
                                 bool SkipModules = false);

  StringRef Next() override;
};

8073} // namespace clang

8075ASTIdentifierIterator::ASTIdentifierIterator(const ASTReader &Reader,
                                           bool SkipModules)
  : Reader(Reader), Index(Reader.ModuleMgr.size()), SkipModules(SkipModules) {
8078}

8080StringRef ASTIdentifierIterator::Next() {
while (Current == End) {
  // If we have exhausted all of our AST files, we're done.
  if (Index == 0)
    return StringRef();

  --Index;
  ModuleFile &F = Reader.ModuleMgr[Index];
  if (SkipModules && F.isModule())
    continue;

  ASTIdentifierLookupTable *IdTable =
      (ASTIdentifierLookupTable *)F.IdentifierLookupTable;
  Current = IdTable->key_begin();
  End = IdTable->key_end();
}

// We have any identifiers remaining in the current AST file; return
// the next one.
StringRef Result = *Current;
++Current;
return Result;
8102}

8104namespace {

8106/// A utility for appending two IdentifierIterators.
8107class ChainedIdentifierIterator : public IdentifierIterator {
std::unique_ptr<IdentifierIterator> Current;
std::unique_ptr<IdentifierIterator> Queued;

8111public:
ChainedIdentifierIterator(std::unique_ptr<IdentifierIterator> First,
                          std::unique_ptr<IdentifierIterator> Second)
    : Current(std::move(First)), Queued(std::move(Second)) {}

StringRef Next() override {
  if (!Current)
    return StringRef();

  StringRef result = Current->Next();
  if (!result.empty())
    return result;

  // Try the queued iterator, which may itself be empty.
  Current.reset();
  std::swap(Current, Queued);
  return Next();
}
8129};

8131} // namespace

8133IdentifierIterator *ASTReader::getIdentifiers() {
if (!loadGlobalIndex()) {
  std::unique_ptr<IdentifierIterator> ReaderIter(
      new ASTIdentifierIterator(*this, /*SkipModules=*/true));
  std::unique_ptr<IdentifierIterator> ModulesIter(
      GlobalIndex->createIdentifierIterator());
  return new ChainedIdentifierIterator(std::move(ReaderIter),
                                       std::move(ModulesIter));
}

return new ASTIdentifierIterator(*this);
8144}

8146namespace clang {
8147namespace serialization {

class ReadMethodPoolVisitor {
  ASTReader &Reader;
  Selector Sel;
  unsigned PriorGeneration;
  unsigned InstanceBits = 0;
  unsigned FactoryBits = 0;
  bool InstanceHasMoreThanOneDecl = false;
  bool FactoryHasMoreThanOneDecl = false;
  SmallVector<ObjCMethodDecl *, 4> InstanceMethods;
  SmallVector<ObjCMethodDecl *, 4> FactoryMethods;

public:
  ReadMethodPoolVisitor(ASTReader &Reader, Selector Sel,
                        unsigned PriorGeneration)
      : Reader(Reader), Sel(Sel), PriorGeneration(PriorGeneration) {}

  bool operator()(ModuleFile &M) {
    if (!M.SelectorLookupTable)
      return false;

    // If we've already searched this module file, skip it now.
    if (M.Generation <= PriorGeneration)
      return true;

    ++Reader.NumMethodPoolTableLookups;
    ASTSelectorLookupTable *PoolTable
      = (ASTSelectorLookupTable*)M.SelectorLookupTable;
    ASTSelectorLookupTable::iterator Pos = PoolTable->find(Sel);
    if (Pos == PoolTable->end())
      return false;

    ++Reader.NumMethodPoolTableHits;
    ++Reader.NumSelectorsRead;
    // FIXME: Not quite happy with the statistics here. We probably should
    // disable this tracking when called via LoadSelector.
    // Also, should entries without methods count as misses?
    ++Reader.NumMethodPoolEntriesRead;
    ASTSelectorLookupTrait::data_type Data = *Pos;
    if (Reader.DeserializationListener)
      Reader.DeserializationListener->SelectorRead(Data.ID, Sel);

    InstanceMethods.append(Data.Instance.begin(), Data.Instance.end());
    FactoryMethods.append(Data.Factory.begin(), Data.Factory.end());
    InstanceBits = Data.InstanceBits;
    FactoryBits = Data.FactoryBits;
    InstanceHasMoreThanOneDecl = Data.InstanceHasMoreThanOneDecl;
    FactoryHasMoreThanOneDecl = Data.FactoryHasMoreThanOneDecl;
    return true;
  }

  /// Retrieve the instance methods found by this visitor.
  ArrayRef<ObjCMethodDecl *> getInstanceMethods() const {
    return InstanceMethods;
  }

  /// Retrieve the instance methods found by this visitor.
  ArrayRef<ObjCMethodDecl *> getFactoryMethods() const {
    return FactoryMethods;
  }

  unsigned getInstanceBits() const { return InstanceBits; }
  unsigned getFactoryBits() const { return FactoryBits; }

  bool instanceHasMoreThanOneDecl() const {
    return InstanceHasMoreThanOneDecl;
  }

  bool factoryHasMoreThanOneDecl() const { return FactoryHasMoreThanOneDecl; }
};

8219} // namespace serialization
8220} // namespace clang

8222/// Add the given set of methods to the method list.
8223static void addMethodsToPool(Sema &S, ArrayRef<ObjCMethodDecl *> Methods,
                           ObjCMethodList &List) {
for (unsigned I = 0, N = Methods.size(); I != N; ++I) {
  S.addMethodToGlobalList(&List, Methods[I]);
}
8228}

8230void ASTReader::ReadMethodPool(Selector Sel) {
// Get the selector generation and update it to the current generation.
unsigned &Generation = SelectorGeneration[Sel];
unsigned PriorGeneration = Generation;
Generation = getGeneration();
SelectorOutOfDate[Sel] = false;

// Search for methods defined with this selector.
++NumMethodPoolLookups;
ReadMethodPoolVisitor Visitor(*this, Sel, PriorGeneration);
ModuleMgr.visit(Visitor);

if (Visitor.getInstanceMethods().empty() &&
    Visitor.getFactoryMethods().empty())
  return;

++NumMethodPoolHits;

if (!getSema())
  return;

Sema &S = *getSema();
Sema::GlobalMethodPool::iterator Pos
  = S.MethodPool.insert(std::make_pair(Sel, Sema::GlobalMethods())).first;

Pos->second.first.setBits(Visitor.getInstanceBits());
Pos->second.first.setHasMoreThanOneDecl(Visitor.instanceHasMoreThanOneDecl());
Pos->second.second.setBits(Visitor.getFactoryBits());
Pos->second.second.setHasMoreThanOneDecl(Visitor.factoryHasMoreThanOneDecl());

// Add methods to the global pool *after* setting hasMoreThanOneDecl, since
// when building a module we keep every method individually and may need to
// update hasMoreThanOneDecl as we add the methods.
addMethodsToPool(S, Visitor.getInstanceMethods(), Pos->second.first);
addMethodsToPool(S, Visitor.getFactoryMethods(), Pos->second.second);
8265}

8267void ASTReader::updateOutOfDateSelector(Selector Sel) {
if (SelectorOutOfDate[Sel])
  ReadMethodPool(Sel);
8270}

8272void ASTReader::ReadKnownNamespaces(
                        SmallVectorImpl<NamespaceDecl *> &Namespaces) {
Namespaces.clear();

for (unsigned I = 0, N = KnownNamespaces.size(); I != N; ++I) {
  if (NamespaceDecl *Namespace
              = dyn_cast_or_null<NamespaceDecl>(GetDecl(KnownNamespaces[I])))
    Namespaces.push_back(Namespace);
}
8281}

8283void ASTReader::ReadUndefinedButUsed(
  llvm::MapVector<NamedDecl *, SourceLocation> &Undefined) {
for (unsigned Idx = 0, N = UndefinedButUsed.size(); Idx != N;) {
  NamedDecl *D = cast<NamedDecl>(GetDecl(UndefinedButUsed[Idx++]));
  SourceLocation Loc =
      SourceLocation::getFromRawEncoding(UndefinedButUsed[Idx++]);
  Undefined.insert(std::make_pair(D, Loc));
}
8291}

8293void ASTReader::ReadMismatchingDeleteExpressions(llvm::MapVector<
  FieldDecl *, llvm::SmallVector<std::pair<SourceLocation, bool>, 4>> &
                                                   Exprs) {
for (unsigned Idx = 0, N = DelayedDeleteExprs.size(); Idx != N;) {
  FieldDecl *FD = cast<FieldDecl>(GetDecl(DelayedDeleteExprs[Idx++]));
  uint64_t Count = DelayedDeleteExprs[Idx++];
  for (uint64_t C = 0; C < Count; ++C) {
    SourceLocation DeleteLoc =
        SourceLocation::getFromRawEncoding(DelayedDeleteExprs[Idx++]);
    const bool IsArrayForm = DelayedDeleteExprs[Idx++];
    Exprs[FD].push_back(std::make_pair(DeleteLoc, IsArrayForm));
  }
}
8306}

8308void ASTReader::ReadTentativeDefinitions(
                SmallVectorImpl<VarDecl *> &TentativeDefs) {
for (unsigned I = 0, N = TentativeDefinitions.size(); I != N; ++I) {
  VarDecl *Var = dyn_cast_or_null<VarDecl>(GetDecl(TentativeDefinitions[I]));
  if (Var)
    TentativeDefs.push_back(Var);
}
TentativeDefinitions.clear();
8316}

8318void ASTReader::ReadUnusedFileScopedDecls(
                             SmallVectorImpl<const DeclaratorDecl *> &Decls) {
for (unsigned I = 0, N = UnusedFileScopedDecls.size(); I != N; ++I) {
  DeclaratorDecl *D
    = dyn_cast_or_null<DeclaratorDecl>(GetDecl(UnusedFileScopedDecls[I]));
  if (D)
    Decls.push_back(D);
}
UnusedFileScopedDecls.clear();
8327}

8329void ASTReader::ReadDelegatingConstructors(
                               SmallVectorImpl<CXXConstructorDecl *> &Decls) {
for (unsigned I = 0, N = DelegatingCtorDecls.size(); I != N; ++I) {
  CXXConstructorDecl *D
    = dyn_cast_or_null<CXXConstructorDecl>(GetDecl(DelegatingCtorDecls[I]));
  if (D)
    Decls.push_back(D);
}
DelegatingCtorDecls.clear();
8338}

8340void ASTReader::ReadExtVectorDecls(SmallVectorImpl<TypedefNameDecl *> &Decls) {
for (unsigned I = 0, N = ExtVectorDecls.size(); I != N; ++I) {
  TypedefNameDecl *D
    = dyn_cast_or_null<TypedefNameDecl>(GetDecl(ExtVectorDecls[I]));
  if (D)
    Decls.push_back(D);
}
ExtVectorDecls.clear();
8348}

8350void ASTReader::ReadUnusedLocalTypedefNameCandidates(
  llvm::SmallSetVector<const TypedefNameDecl *, 4> &Decls) {
for (unsigned I = 0, N = UnusedLocalTypedefNameCandidates.size(); I != N;
     ++I) {
  TypedefNameDecl *D = dyn_cast_or_null<TypedefNameDecl>(
      GetDecl(UnusedLocalTypedefNameCandidates[I]));
  if (D)
    Decls.insert(D);
}
UnusedLocalTypedefNameCandidates.clear();
8360}

8362void ASTReader::ReadDeclsToCheckForDeferredDiags(
  llvm::SmallSetVector<Decl *, 4> &Decls) {
for (auto I : DeclsToCheckForDeferredDiags) {
  auto *D = dyn_cast_or_null<Decl>(GetDecl(I));
  if (D)
    Decls.insert(D);
}
DeclsToCheckForDeferredDiags.clear();
8370}

8372void ASTReader::ReadReferencedSelectors(
     SmallVectorImpl<std::pair<Selector, SourceLocation>> &Sels) {
if (ReferencedSelectorsData.empty())
  return;

// If there are @selector references added them to its pool. This is for
// implementation of -Wselector.
unsigned int DataSize = ReferencedSelectorsData.size()-1;
unsigned I = 0;
while (I < DataSize) {
  Selector Sel = DecodeSelector(ReferencedSelectorsData[I++]);
  SourceLocation SelLoc
    = SourceLocation::getFromRawEncoding(ReferencedSelectorsData[I++]);
  Sels.push_back(std::make_pair(Sel, SelLoc));
}
ReferencedSelectorsData.clear();
8388}

8390void ASTReader::ReadWeakUndeclaredIdentifiers(
     SmallVectorImpl<std::pair<IdentifierInfo *, WeakInfo>> &WeakIDs) {
if (WeakUndeclaredIdentifiers.empty())
  return;

for (unsigned I = 0, N = WeakUndeclaredIdentifiers.size(); I < N; /*none*/) {
  IdentifierInfo *WeakId
    = DecodeIdentifierInfo(WeakUndeclaredIdentifiers[I++]);
  IdentifierInfo *AliasId
    = DecodeIdentifierInfo(WeakUndeclaredIdentifiers[I++]);
  SourceLocation Loc
    = SourceLocation::getFromRawEncoding(WeakUndeclaredIdentifiers[I++]);
  bool Used = WeakUndeclaredIdentifiers[I++];
  WeakInfo WI(AliasId, Loc);
  WI.setUsed(Used);
  WeakIDs.push_back(std::make_pair(WeakId, WI));
}
WeakUndeclaredIdentifiers.clear();
8408}

8410void ASTReader::ReadUsedVTables(SmallVectorImpl<ExternalVTableUse> &VTables) {
for (unsigned Idx = 0, N = VTableUses.size(); Idx < N; /* In loop */) {
  ExternalVTableUse VT;
  VT.Record = dyn_cast_or_null<CXXRecordDecl>(GetDecl(VTableUses[Idx++]));
  VT.Location = SourceLocation::getFromRawEncoding(VTableUses[Idx++]);
  VT.DefinitionRequired = VTableUses[Idx++];
  VTables.push_back(VT);
}

VTableUses.clear();
8420}

8422void ASTReader::ReadPendingInstantiations(
     SmallVectorImpl<std::pair<ValueDecl *, SourceLocation>> &Pending) {
for (unsigned Idx = 0, N = PendingInstantiations.size(); Idx < N;) {
  ValueDecl *D = cast<ValueDecl>(GetDecl(PendingInstantiations[Idx++]));
  SourceLocation Loc
    = SourceLocation::getFromRawEncoding(PendingInstantiations[Idx++]);

  Pending.push_back(std::make_pair(D, Loc));
}
PendingInstantiations.clear();
8432}

8434void ASTReader::ReadLateParsedTemplates(
  llvm::MapVector<const FunctionDecl *, std::unique_ptr<LateParsedTemplate>>
      &LPTMap) {
for (auto &LPT : LateParsedTemplates) {
  ModuleFile *FMod = LPT.first;
  RecordDataImpl &LateParsed = LPT.second;
  for (unsigned Idx = 0, N = LateParsed.size(); Idx < N;
       /* In loop */) {
    FunctionDecl *FD =
        cast<FunctionDecl>(GetLocalDecl(*FMod, LateParsed[Idx++]));

    auto LT = std::make_unique<LateParsedTemplate>();
    LT->D = GetLocalDecl(*FMod, LateParsed[Idx++]);

    ModuleFile *F = getOwningModuleFile(LT->D);
    assert(F && "No module")((void)0);

    unsigned TokN = LateParsed[Idx++];
    LT->Toks.reserve(TokN);
    for (unsigned T = 0; T < TokN; ++T)
      LT->Toks.push_back(ReadToken(*F, LateParsed, Idx));

    LPTMap.insert(std::make_pair(FD, std::move(LT)));
  }
}

LateParsedTemplates.clear();
8461}

8463void ASTReader::LoadSelector(Selector Sel) {
// It would be complicated to avoid reading the methods anyway. So don't.
ReadMethodPool(Sel);
8466}

8468void ASTReader::SetIdentifierInfo(IdentifierID ID, IdentifierInfo *II) {
assert(ID && "Non-zero identifier ID required")((void)0);
assert(ID <= IdentifiersLoaded.size() && "identifier ID out of range")((void)0);
IdentifiersLoaded[ID - 1] = II;
if (DeserializationListener)
  DeserializationListener->IdentifierRead(ID, II);
8474}

8476/// Set the globally-visible declarations associated with the given
8477/// identifier.
8478///
8479/// If the AST reader is currently in a state where the given declaration IDs
8480/// cannot safely be resolved, they are queued until it is safe to resolve
8481/// them.
8482///
8483/// \param II an IdentifierInfo that refers to one or more globally-visible
8484/// declarations.
8485///
8486/// \param DeclIDs the set of declaration IDs with the name @p II that are
8487/// visible at global scope.
8488///
8489/// \param Decls if non-null, this vector will be populated with the set of
8490/// deserialized declarations. These declarations will not be pushed into
8491/// scope.
8492void
8493ASTReader::SetGloballyVisibleDecls(IdentifierInfo *II,
                            const SmallVectorImpl<uint32_t> &DeclIDs,
                                 SmallVectorImpl<Decl *> *Decls) {
if (NumCurrentElementsDeserializing && !Decls) {
  PendingIdentifierInfos[II].append(DeclIDs.begin(), DeclIDs.end());
  return;
}

for (unsigned I = 0, N = DeclIDs.size(); I != N; ++I) {
  if (!SemaObj) {
    // Queue this declaration so that it will be added to the
    // translation unit scope and identifier's declaration chain
    // once a Sema object is known.
    PreloadedDeclIDs.push_back(DeclIDs[I]);
    continue;
  }

  NamedDecl *D = cast<NamedDecl>(GetDecl(DeclIDs[I]));

  // If we're simply supposed to record the declarations, do so now.
  if (Decls) {
    Decls->push_back(D);
    continue;
  }

  // Introduce this declaration into the translation-unit scope
  // and add it to the declaration chain for this identifier, so
  // that (unqualified) name lookup will find it.
  pushExternalDeclIntoScope(D, II);
}
8523}

8525IdentifierInfo *ASTReader::DecodeIdentifierInfo(IdentifierID ID) {
if (ID == 0)
  return nullptr;

if (IdentifiersLoaded.empty()) {
  Error("no identifier table in AST file");
  return nullptr;
}

ID -= 1;
if (!IdentifiersLoaded[ID]) {
  GlobalIdentifierMapType::iterator I = GlobalIdentifierMap.find(ID + 1);
  assert(I != GlobalIdentifierMap.end() && "Corrupted global identifier map")((void)0);
  ModuleFile *M = I->second;
  unsigned Index = ID - M->BaseIdentifierID;
  const unsigned char *Data =
      M->IdentifierTableData + M->IdentifierOffsets[Index];

  ASTIdentifierLookupTrait Trait(*this, *M);
  auto KeyDataLen = Trait.ReadKeyDataLength(Data);
  auto Key = Trait.ReadKey(Data, KeyDataLen.first);
  auto &II = PP.getIdentifierTable().get(Key);
  IdentifiersLoaded[ID] = &II;
  markIdentifierFromAST(*this,  II);
  if (DeserializationListener)
    DeserializationListener->IdentifierRead(ID + 1, &II);
}

return IdentifiersLoaded[ID];
8554}

8556IdentifierInfo *ASTReader::getLocalIdentifier(ModuleFile &M, unsigned LocalID) {
return DecodeIdentifierInfo(getGlobalIdentifierID(M, LocalID));
8558}

8560IdentifierID ASTReader::getGlobalIdentifierID(ModuleFile &M, unsigned LocalID) {
if (LocalID < NUM_PREDEF_IDENT_IDS)
  return LocalID;

if (!M.ModuleOffsetMap.empty())
  ReadModuleOffsetMap(M);

ContinuousRangeMap<uint32_t, int, 2>::iterator I
  = M.IdentifierRemap.find(LocalID - NUM_PREDEF_IDENT_IDS);
assert(I != M.IdentifierRemap.end()((void)0)
       && "Invalid index into identifier index remap")((void)0);

return LocalID + I->second;
8573}

8575MacroInfo *ASTReader::getMacro(MacroID ID) {
if (ID == 0)
  return nullptr;

if (MacrosLoaded.empty()) {
  Error("no macro table in AST file");
  return nullptr;
}

ID -= NUM_PREDEF_MACRO_IDS;
if (!MacrosLoaded[ID]) {
  GlobalMacroMapType::iterator I
    = GlobalMacroMap.find(ID + NUM_PREDEF_MACRO_IDS);
  assert(I != GlobalMacroMap.end() && "Corrupted global macro map")((void)0);
  ModuleFile *M = I->second;
  unsigned Index = ID - M->BaseMacroID;
  MacrosLoaded[ID] =
      ReadMacroRecord(*M, M->MacroOffsetsBase + M->MacroOffsets[Index]);

  if (DeserializationListener)
    DeserializationListener->MacroRead(ID + NUM_PREDEF_MACRO_IDS,
                                       MacrosLoaded[ID]);
}

return MacrosLoaded[ID];
8600}

8602MacroID ASTReader::getGlobalMacroID(ModuleFile &M, unsigned LocalID) {
if (LocalID < NUM_PREDEF_MACRO_IDS)
  return LocalID;

if (!M.ModuleOffsetMap.empty())
  ReadModuleOffsetMap(M);

ContinuousRangeMap<uint32_t, int, 2>::iterator I
  = M.MacroRemap.find(LocalID - NUM_PREDEF_MACRO_IDS);
assert(I != M.MacroRemap.end() && "Invalid index into macro index remap")((void)0);

return LocalID + I->second;
8614}

8616serialization::SubmoduleID
8617ASTReader::getGlobalSubmoduleID(ModuleFile &M, unsigned LocalID) {
if (LocalID < NUM_PREDEF_SUBMODULE_IDS)
  return LocalID;

if (!M.ModuleOffsetMap.empty())
  ReadModuleOffsetMap(M);

ContinuousRangeMap<uint32_t, int, 2>::iterator I
  = M.SubmoduleRemap.find(LocalID - NUM_PREDEF_SUBMODULE_IDS);
assert(I != M.SubmoduleRemap.end()((void)0)
       && "Invalid index into submodule index remap")((void)0);

return LocalID + I->second;
8630}

8632Module *ASTReader::getSubmodule(SubmoduleID GlobalID) {
if (GlobalID < NUM_PREDEF_SUBMODULE_IDS) {
  assert(GlobalID == 0 && "Unhandled global submodule ID")((void)0);
  return nullptr;
}

if (GlobalID > SubmodulesLoaded.size()) {
  Error("submodule ID out of range in AST file");
  return nullptr;
}

return SubmodulesLoaded[GlobalID - NUM_PREDEF_SUBMODULE_IDS];
8644}

8646Module *ASTReader::getModule(unsigned ID) {
return getSubmodule(ID);
8648}

8650ModuleFile *ASTReader::getLocalModuleFile(ModuleFile &F, unsigned ID) {
if (ID & 1) {
  // It's a module, look it up by submodule ID.
  auto I = GlobalSubmoduleMap.find(getGlobalSubmoduleID(F, ID >> 1));
  return I == GlobalSubmoduleMap.end() ? nullptr : I->second;
} else {
  // It's a prefix (preamble, PCH, ...). Look it up by index.
  unsigned IndexFromEnd = ID >> 1;
  assert(IndexFromEnd && "got reference to unknown module file")((void)0);
  return getModuleManager().pch_modules().end()[-IndexFromEnd];
}
8661}

8663unsigned ASTReader::getModuleFileID(ModuleFile *F) {
if (!F)
  return 1;

// For a file representing a module, use the submodule ID of the top-level
// module as the file ID. For any other kind of file, the number of such
// files loaded beforehand will be the same on reload.
// FIXME: Is this true even if we have an explicit module file and a PCH?
if (F->isModule())
  return ((F->BaseSubmoduleID + NUM_PREDEF_SUBMODULE_IDS) << 1) | 1;

auto PCHModules = getModuleManager().pch_modules();
auto I = llvm::find(PCHModules, F);
assert(I != PCHModules.end() && "emitting reference to unknown file")((void)0);
return (I - PCHModules.end()) << 1;
8678}

8680llvm::Optional<ASTSourceDescriptor>
8681ASTReader::getSourceDescriptor(unsigned ID) {
if (Module *M = getSubmodule(ID))
  return ASTSourceDescriptor(*M);

// If there is only a single PCH, return it instead.
// Chained PCH are not supported.
const auto &PCHChain = ModuleMgr.pch_modules();
if (std::distance(std::begin(PCHChain), std::end(PCHChain))) {
  ModuleFile &MF = ModuleMgr.getPrimaryModule();
  StringRef ModuleName = llvm::sys::path::filename(MF.OriginalSourceFileName);
  StringRef FileName = llvm::sys::path::filename(MF.FileName);
  return ASTSourceDescriptor(ModuleName, MF.OriginalDir, FileName,
                             MF.Signature);
}
return None;
8696}

8698ExternalASTSource::ExtKind ASTReader::hasExternalDefinitions(const Decl *FD) {
auto I = DefinitionSource.find(FD);
if (I == DefinitionSource.end())
  return EK_ReplyHazy;
return I->second ? EK_Never : EK_Always;
8703}

8705Selector ASTReader::getLocalSelector(ModuleFile &M, unsigned LocalID) {
return DecodeSelector(getGlobalSelectorID(M, LocalID));
8707}

8709Selector ASTReader::DecodeSelector(serialization::SelectorID ID) {
if (ID == 0)
  return Selector();

if (ID > SelectorsLoaded.size()) {
  Error("selector ID out of range in AST file");
  return Selector();
}

if (SelectorsLoaded[ID - 1].getAsOpaquePtr() == nullptr) {
  // Load this selector from the selector table.
  GlobalSelectorMapType::iterator I = GlobalSelectorMap.find(ID);
  assert(I != GlobalSelectorMap.end() && "Corrupted global selector map")((void)0);
  ModuleFile &M = *I->second;
  ASTSelectorLookupTrait Trait(*this, M);
  unsigned Idx = ID - M.BaseSelectorID - NUM_PREDEF_SELECTOR_IDS;
  SelectorsLoaded[ID - 1] =
    Trait.ReadKey(M.SelectorLookupTableData + M.SelectorOffsets[Idx], 0);
  if (DeserializationListener)
    DeserializationListener->SelectorRead(ID, SelectorsLoaded[ID - 1]);
}

return SelectorsLoaded[ID - 1];
8732}

8734Selector ASTReader::GetExternalSelector(serialization::SelectorID ID) {
return DecodeSelector(ID);
8736}

8738uint32_t ASTReader::GetNumExternalSelectors() {
// ID 0 (the null selector) is considered an external selector.
return getTotalNumSelectors() + 1;
8741}

8743serialization::SelectorID
8744ASTReader::getGlobalSelectorID(ModuleFile &M, unsigned LocalID) const {
if (LocalID < NUM_PREDEF_SELECTOR_IDS)
  return LocalID;

if (!M.ModuleOffsetMap.empty())
  ReadModuleOffsetMap(M);

ContinuousRangeMap<uint32_t, int, 2>::iterator I
  = M.SelectorRemap.find(LocalID - NUM_PREDEF_SELECTOR_IDS);
assert(I != M.SelectorRemap.end()((void)0)
       && "Invalid index into selector index remap")((void)0);

return LocalID + I->second;
8757}

8759DeclarationNameLoc
8760ASTRecordReader::readDeclarationNameLoc(DeclarationName Name) {
switch (Name.getNameKind()) {
case DeclarationName::CXXConstructorName:
case DeclarationName::CXXDestructorName:
case DeclarationName::CXXConversionFunctionName:
  return DeclarationNameLoc::makeNamedTypeLoc(readTypeSourceInfo());

case DeclarationName::CXXOperatorName:
  return DeclarationNameLoc::makeCXXOperatorNameLoc(readSourceRange());

case DeclarationName::CXXLiteralOperatorName:
  return DeclarationNameLoc::makeCXXLiteralOperatorNameLoc(
      readSourceLocation());

case DeclarationName::Identifier:
case DeclarationName::ObjCZeroArgSelector:
case DeclarationName::ObjCOneArgSelector:
case DeclarationName::ObjCMultiArgSelector:
case DeclarationName::CXXUsingDirective:
case DeclarationName::CXXDeductionGuideName:
  break;
}
return DeclarationNameLoc();
8783}

8785DeclarationNameInfo ASTRecordReader::readDeclarationNameInfo() {
DeclarationNameInfo NameInfo;
NameInfo.setName(readDeclarationName());
NameInfo.setLoc(readSourceLocation());
NameInfo.setInfo(readDeclarationNameLoc(NameInfo.getName()));
return NameInfo;
8791}

8793void ASTRecordReader::readQualifierInfo(QualifierInfo &Info) {
Info.QualifierLoc = readNestedNameSpecifierLoc();
unsigned NumTPLists = readInt();
Info.NumTemplParamLists = NumTPLists;
if (NumTPLists) {
  Info.TemplParamLists =
      new (getContext()) TemplateParameterList *[NumTPLists];
  for (unsigned i = 0; i != NumTPLists; ++i)
    Info.TemplParamLists[i] = readTemplateParameterList();
}
8803}

8805TemplateParameterList *
8806ASTRecordReader::readTemplateParameterList() {
SourceLocation TemplateLoc = readSourceLocation();
SourceLocation LAngleLoc = readSourceLocation();
SourceLocation RAngleLoc = readSourceLocation();

unsigned NumParams = readInt();
SmallVector<NamedDecl *, 16> Params;
Params.reserve(NumParams);
while (NumParams--)
  Params.push_back(readDeclAs<NamedDecl>());

bool HasRequiresClause = readBool();
Expr *RequiresClause = HasRequiresClause ? readExpr() : nullptr;

TemplateParameterList *TemplateParams = TemplateParameterList::Create(
    getContext(), TemplateLoc, LAngleLoc, Params, RAngleLoc, RequiresClause);
return TemplateParams;
8823}

8825void ASTRecordReader::readTemplateArgumentList(
                      SmallVectorImpl<TemplateArgument> &TemplArgs,
                      bool Canonicalize) {
unsigned NumTemplateArgs = readInt();
TemplArgs.reserve(NumTemplateArgs);
while (NumTemplateArgs--)
  TemplArgs.push_back(readTemplateArgument(Canonicalize));
8832}

8834/// Read a UnresolvedSet structure.
8835void ASTRecordReader::readUnresolvedSet(LazyASTUnresolvedSet &Set) {
unsigned NumDecls = readInt();
Set.reserve(getContext(), NumDecls);
while (NumDecls--) {
  DeclID ID = readDeclID();
  AccessSpecifier AS = (AccessSpecifier) readInt();
  Set.addLazyDecl(getContext(), ID, AS);
}
8843}

8845CXXBaseSpecifier
8846ASTRecordReader::readCXXBaseSpecifier() {
bool isVirtual = readBool();
bool isBaseOfClass = readBool();
AccessSpecifier AS = static_cast<AccessSpecifier>(readInt());
bool inheritConstructors = readBool();
TypeSourceInfo *TInfo = readTypeSourceInfo();
SourceRange Range = readSourceRange();
SourceLocation EllipsisLoc = readSourceLocation();
CXXBaseSpecifier Result(Range, isVirtual, isBaseOfClass, AS, TInfo,
                        EllipsisLoc);
Result.setInheritConstructors(inheritConstructors);
return Result;
8858}

8860CXXCtorInitializer **
8861ASTRecordReader::readCXXCtorInitializers() {
ASTContext &Context = getContext();
unsigned NumInitializers = readInt();
assert(NumInitializers && "wrote ctor initializers but have no inits")((void)0);
auto **CtorInitializers = new (Context) CXXCtorInitializer*[NumInitializers];
for (unsigned i = 0; i != NumInitializers; ++i) {
  TypeSourceInfo *TInfo = nullptr;
  bool IsBaseVirtual = false;
  FieldDecl *Member = nullptr;
  IndirectFieldDecl *IndirectMember = nullptr;

  CtorInitializerType Type = (CtorInitializerType) readInt();
  switch (Type) {
  case CTOR_INITIALIZER_BASE:
    TInfo = readTypeSourceInfo();
    IsBaseVirtual = readBool();
    break;

  case CTOR_INITIALIZER_DELEGATING:
    TInfo = readTypeSourceInfo();
    break;

   case CTOR_INITIALIZER_MEMBER:
    Member = readDeclAs<FieldDecl>();
    break;

   case CTOR_INITIALIZER_INDIRECT_MEMBER:
    IndirectMember = readDeclAs<IndirectFieldDecl>();
    break;
  }

  SourceLocation MemberOrEllipsisLoc = readSourceLocation();
  Expr *Init = readExpr();
  SourceLocation LParenLoc = readSourceLocation();
  SourceLocation RParenLoc = readSourceLocation();

  CXXCtorInitializer *BOMInit;
  if (Type == CTOR_INITIALIZER_BASE)
    BOMInit = new (Context)
        CXXCtorInitializer(Context, TInfo, IsBaseVirtual, LParenLoc, Init,
                           RParenLoc, MemberOrEllipsisLoc);
  else if (Type == CTOR_INITIALIZER_DELEGATING)
    BOMInit = new (Context)
        CXXCtorInitializer(Context, TInfo, LParenLoc, Init, RParenLoc);
  else if (Member)
    BOMInit = new (Context)
        CXXCtorInitializer(Context, Member, MemberOrEllipsisLoc, LParenLoc,
                           Init, RParenLoc);
  else
    BOMInit = new (Context)
        CXXCtorInitializer(Context, IndirectMember, MemberOrEllipsisLoc,
                           LParenLoc, Init, RParenLoc);

  if (/*IsWritten*/readBool()) {
    unsigned SourceOrder = readInt();
    BOMInit->setSourceOrder(SourceOrder);
  }

  CtorInitializers[i] = BOMInit;
}

return CtorInitializers;
8923}

8925NestedNameSpecifierLoc
8926ASTRecordReader::readNestedNameSpecifierLoc() {
ASTContext &Context = getContext();
unsigned N = readInt();
NestedNameSpecifierLocBuilder Builder;
for (unsigned I = 0; I != N; ++I) {
  auto Kind = readNestedNameSpecifierKind();
  switch (Kind) {
  case NestedNameSpecifier::Identifier: {
    IdentifierInfo *II = readIdentifier();
    SourceRange Range = readSourceRange();
    Builder.Extend(Context, II, Range.getBegin(), Range.getEnd());
    break;
  }

  case NestedNameSpecifier::Namespace: {
    NamespaceDecl *NS = readDeclAs<NamespaceDecl>();
    SourceRange Range = readSourceRange();
    Builder.Extend(Context, NS, Range.getBegin(), Range.getEnd());
    break;
  }

  case NestedNameSpecifier::NamespaceAlias: {
    NamespaceAliasDecl *Alias = readDeclAs<NamespaceAliasDecl>();
    SourceRange Range = readSourceRange();
    Builder.Extend(Context, Alias, Range.getBegin(), Range.getEnd());
    break;
  }

  case NestedNameSpecifier::TypeSpec:
  case NestedNameSpecifier::TypeSpecWithTemplate: {
    bool Template = readBool();
    TypeSourceInfo *T = readTypeSourceInfo();
    if (!T)
      return NestedNameSpecifierLoc();
    SourceLocation ColonColonLoc = readSourceLocation();

    // FIXME: 'template' keyword location not saved anywhere, so we fake it.
    Builder.Extend(Context,
                   Template? T->getTypeLoc().getBeginLoc() : SourceLocation(),
                   T->getTypeLoc(), ColonColonLoc);
    break;
  }

  case NestedNameSpecifier::Global: {
    SourceLocation ColonColonLoc = readSourceLocation();
    Builder.MakeGlobal(Context, ColonColonLoc);
    break;
  }

  case NestedNameSpecifier::Super: {
    CXXRecordDecl *RD = readDeclAs<CXXRecordDecl>();
    SourceRange Range = readSourceRange();
    Builder.MakeSuper(Context, RD, Range.getBegin(), Range.getEnd());
    break;
  }
  }
}

return Builder.getWithLocInContext(Context);
8985}

8987SourceRange
8988ASTReader::ReadSourceRange(ModuleFile &F, const RecordData &Record,
                         unsigned &Idx) {
SourceLocation beg = ReadSourceLocation(F, Record, Idx);
SourceLocation end = ReadSourceLocation(F, Record, Idx);
return SourceRange(beg, end);
8993}

8995/// Read a floating-point value
8996llvm::APFloat ASTRecordReader::readAPFloat(const llvm::fltSemantics &Sem) {
return llvm::APFloat(Sem, readAPInt());
8998}

9000// Read a string
9001std::string ASTReader::ReadString(const RecordData &Record, unsigned &Idx) {
unsigned Len = Record[Idx++];
std::string Result(Record.data() + Idx, Record.data() + Idx + Len);
Idx += Len;
return Result;
9006}

9008std::string ASTReader::ReadPath(ModuleFile &F, const RecordData &Record,
                              unsigned &Idx) {
std::string Filename = ReadString(Record, Idx);
ResolveImportedPath(F, Filename);
return Filename;
9013}

9015std::string ASTReader::ReadPath(StringRef BaseDirectory,
                              const RecordData &Record, unsigned &Idx) {
std::string Filename = ReadString(Record, Idx);
if (!BaseDirectory.empty())
  ResolveImportedPath(Filename, BaseDirectory);
return Filename;
9021}

9023VersionTuple ASTReader::ReadVersionTuple(const RecordData &Record,
                                       unsigned &Idx) {
unsigned Major = Record[Idx++];
unsigned Minor = Record[Idx++];
unsigned Subminor = Record[Idx++];
if (Minor == 0)
  return VersionTuple(Major);
if (Subminor == 0)
  return VersionTuple(Major, Minor - 1);
return VersionTuple(Major, Minor - 1, Subminor - 1);
9033}

9035CXXTemporary *ASTReader::ReadCXXTemporary(ModuleFile &F,
                                        const RecordData &Record,
                                        unsigned &Idx) {
CXXDestructorDecl *Decl = ReadDeclAs<CXXDestructorDecl>(F, Record, Idx);
return CXXTemporary::Create(getContext(), Decl);
9040}

9042DiagnosticBuilder ASTReader::Diag(unsigned DiagID) const {
return Diag(CurrentImportLoc, DiagID);
9044}

9046DiagnosticBuilder ASTReader::Diag(SourceLocation Loc, unsigned DiagID) const {
return Diags.Report(Loc, DiagID);
9048}

9050/// Retrieve the identifier table associated with the
9051/// preprocessor.
9052IdentifierTable &ASTReader::getIdentifierTable() {
return PP.getIdentifierTable();
9054}

9056/// Record that the given ID maps to the given switch-case
9057/// statement.
9058void ASTReader::RecordSwitchCaseID(SwitchCase *SC, unsigned ID) {
assert((*CurrSwitchCaseStmts)[ID] == nullptr &&((void)0)
       "Already have a SwitchCase with this ID")((void)0);
(*CurrSwitchCaseStmts)[ID] = SC;
9062}

9064/// Retrieve the switch-case statement with the given ID.
9065SwitchCase *ASTReader::getSwitchCaseWithID(unsigned ID) {
assert((*CurrSwitchCaseStmts)[ID] != nullptr && "No SwitchCase with this ID")((void)0);
return (*CurrSwitchCaseStmts)[ID];
9068}

9070void ASTReader::ClearSwitchCaseIDs() {
CurrSwitchCaseStmts->clear();
9072}

9074void ASTReader::ReadComments() {
ASTContext &Context = getContext();
std::vector<RawComment *> Comments;
for (SmallVectorImpl<std::pair<BitstreamCursor,
                               serialization::ModuleFile *>>::iterator
     I = CommentsCursors.begin(),
     E = CommentsCursors.end();
     I != E; ++I) {
  Comments.clear();
  BitstreamCursor &Cursor = I->first;
  serialization::ModuleFile &F = *I->second;
  SavedStreamPosition SavedPosition(Cursor);

  RecordData Record;
  while (true) {
    Expected<llvm::BitstreamEntry> MaybeEntry =
        Cursor.advanceSkippingSubblocks(
            BitstreamCursor::AF_DontPopBlockAtEnd);
    if (!MaybeEntry) {
      Error(MaybeEntry.takeError());
      return;
    }
    llvm::BitstreamEntry Entry = MaybeEntry.get();

    switch (Entry.Kind) {
    case llvm::BitstreamEntry::SubBlock: // Handled for us already.
    case llvm::BitstreamEntry::Error:
      Error("malformed block record in AST file");
      return;
    case llvm::BitstreamEntry::EndBlock:
      goto NextCursor;
    case llvm::BitstreamEntry::Record:
      // The interesting case.
      break;
    }

    // Read a record.
    Record.clear();
    Expected<unsigned> MaybeComment = Cursor.readRecord(Entry.ID, Record);
    if (!MaybeComment) {
      Error(MaybeComment.takeError());
      return;
    }
    switch ((CommentRecordTypes)MaybeComment.get()) {
    case COMMENTS_RAW_COMMENT: {
      unsigned Idx = 0;
      SourceRange SR = ReadSourceRange(F, Record, Idx);
      RawComment::CommentKind Kind =
          (RawComment::CommentKind) Record[Idx++];
      bool IsTrailingComment = Record[Idx++];
      bool IsAlmostTrailingComment = Record[Idx++];
      Comments.push_back(new (Context) RawComment(
          SR, Kind, IsTrailingComment, IsAlmostTrailingComment));
      break;
    }
    }
  }
NextCursor:
  llvm::DenseMap<FileID, std::map<unsigned, RawComment *>>
      FileToOffsetToComment;
  for (RawComment *C : Comments) {
    SourceLocation CommentLoc = C->getBeginLoc();
    if (CommentLoc.isValid()) {
      std::pair<FileID, unsigned> Loc =
          SourceMgr.getDecomposedLoc(CommentLoc);
      if (Loc.first.isValid())
        Context.Comments.OrderedComments[Loc.first].emplace(Loc.second, C);
    }
  }
}
9144}

9146void ASTReader::visitInputFiles(serialization::ModuleFile &MF,
                              bool IncludeSystem, bool Complain,
                  llvm::function_ref<void(const serialization::InputFile &IF,
                                          bool isSystem)> Visitor) {
unsigned NumUserInputs = MF.NumUserInputFiles;
unsigned NumInputs = MF.InputFilesLoaded.size();
assert(NumUserInputs <= NumInputs)((void)0);
unsigned N = IncludeSystem ? NumInputs : NumUserInputs;
for (unsigned I = 0; I < N; ++I) {
  bool IsSystem = I >= NumUserInputs;
  InputFile IF = getInputFile(MF, I+1, Complain);
  Visitor(IF, IsSystem);
}
9159}

9161void ASTReader::visitTopLevelModuleMaps(
  serialization::ModuleFile &MF,
  llvm::function_ref<void(const FileEntry *FE)> Visitor) {
unsigned NumInputs = MF.InputFilesLoaded.size();
for (unsigned I = 0; I < NumInputs; ++I) {
  InputFileInfo IFI = readInputFileInfo(MF, I + 1);
  if (IFI.TopLevelModuleMap)
    // FIXME: This unnecessarily re-reads the InputFileInfo.
    if (auto FE = getInputFile(MF, I + 1).getFile())
      Visitor(FE);
}
9172}

9174std::string ASTReader::getOwningModuleNameForDiagnostic(const Decl *D) {
// If we know the owning module, use it.
if (Module *M = D->getImportedOwningModule())
  return M->getFullModuleName();

// Otherwise, use the name of the top-level module the decl is within.
if (ModuleFile *M = getOwningModuleFile(D))
  return M->ModuleName;

// Not from a module.
return {};
9185}

9187void ASTReader::finishPendingActions() {
while (!PendingIdentifierInfos.empty() || !PendingFunctionTypes.empty() ||
       !PendingIncompleteDeclChains.empty() || !PendingDeclChains.empty() ||
       !PendingMacroIDs.empty() || !PendingDeclContextInfos.empty() ||
       !PendingUpdateRecords.empty()) {
  // If any identifiers with corresponding top-level declarations have
  // been loaded, load those declarations now.
  using TopLevelDeclsMap =
      llvm::DenseMap<IdentifierInfo *, SmallVector<Decl *, 2>>;
  TopLevelDeclsMap TopLevelDecls;

  while (!PendingIdentifierInfos.empty()) {
    IdentifierInfo *II = PendingIdentifierInfos.back().first;
    SmallVector<uint32_t, 4> DeclIDs =
        std::move(PendingIdentifierInfos.back().second);
    PendingIdentifierInfos.pop_back();

    SetGloballyVisibleDecls(II, DeclIDs, &TopLevelDecls[II]);
  }

  // Load each function type that we deferred loading because it was a
  // deduced type that might refer to a local type declared within itself.
  for (unsigned I = 0; I != PendingFunctionTypes.size(); ++I) {
    auto *FD = PendingFunctionTypes[I].first;
    FD->setType(GetType(PendingFunctionTypes[I].second));

    // If we gave a function a deduced return type, remember that we need to
    // propagate that along the redeclaration chain.
    auto *DT = FD->getReturnType()->getContainedDeducedType();
    if (DT && DT->isDeduced())
      PendingDeducedTypeUpdates.insert(
          {FD->getCanonicalDecl(), FD->getReturnType()});
  }
  PendingFunctionTypes.clear();

  // For each decl chain that we wanted to complete while deserializing, mark
  // it as "still needs to be completed".
  for (unsigned I = 0; I != PendingIncompleteDeclChains.size(); ++I) {
    markIncompleteDeclChain(PendingIncompleteDeclChains[I]);
  }
  PendingIncompleteDeclChains.clear();

  // Load pending declaration chains.
  for (unsigned I = 0; I != PendingDeclChains.size(); ++I)
    loadPendingDeclChain(PendingDeclChains[I].first,
                         PendingDeclChains[I].second);
  PendingDeclChains.clear();

  // Make the most recent of the top-level declarations visible.
  for (TopLevelDeclsMap::iterator TLD = TopLevelDecls.begin(),
         TLDEnd = TopLevelDecls.end(); TLD != TLDEnd; ++TLD) {
    IdentifierInfo *II = TLD->first;
    for (unsigned I = 0, N = TLD->second.size(); I != N; ++I) {
      pushExternalDeclIntoScope(cast<NamedDecl>(TLD->second[I]), II);
    }
  }

  // Load any pending macro definitions.
  for (unsigned I = 0; I != PendingMacroIDs.size(); ++I) {
    IdentifierInfo *II = PendingMacroIDs.begin()[I].first;
    SmallVector<PendingMacroInfo, 2> GlobalIDs;
    GlobalIDs.swap(PendingMacroIDs.begin()[I].second);
    // Initialize the macro history from chained-PCHs ahead of module imports.
    for (unsigned IDIdx = 0, NumIDs = GlobalIDs.size(); IDIdx != NumIDs;
         ++IDIdx) {
      const PendingMacroInfo &Info = GlobalIDs[IDIdx];
      if (!Info.M->isModule())
        resolvePendingMacro(II, Info);
    }
    // Handle module imports.
    for (unsigned IDIdx = 0, NumIDs = GlobalIDs.size(); IDIdx != NumIDs;
         ++IDIdx) {
      const PendingMacroInfo &Info = GlobalIDs[IDIdx];
      if (Info.M->isModule())
        resolvePendingMacro(II, Info);
    }
  }
  PendingMacroIDs.clear();

  // Wire up the DeclContexts for Decls that we delayed setting until
  // recursive loading is completed.
  while (!PendingDeclContextInfos.empty()) {
    PendingDeclContextInfo Info = PendingDeclContextInfos.front();
    PendingDeclContextInfos.pop_front();
    DeclContext *SemaDC = cast<DeclContext>(GetDecl(Info.SemaDC));
    DeclContext *LexicalDC = cast<DeclContext>(GetDecl(Info.LexicalDC));
    Info.D->setDeclContextsImpl(SemaDC, LexicalDC, getContext());
  }

  // Perform any pending declaration updates.
  while (!PendingUpdateRecords.empty()) {
    auto Update = PendingUpdateRecords.pop_back_val();
    ReadingKindTracker ReadingKind(Read_Decl, *this);
    loadDeclUpdateRecords(Update);
  }
}

// At this point, all update records for loaded decls are in place, so any
// fake class definitions should have become real.
assert(PendingFakeDefinitionData.empty() &&((void)0)
       "faked up a class definition but never saw the real one")((void)0);

// If we deserialized any C++ or Objective-C class definitions, any
// Objective-C protocol definitions, or any redeclarable templates, make sure
// that all redeclarations point to the definitions. Note that this can only
// happen now, after the redeclaration chains have been fully wired.
for (Decl *D : PendingDefinitions) {
  if (TagDecl *TD = dyn_cast<TagDecl>(D)) {
    if (const TagType *TagT = dyn_cast<TagType>(TD->getTypeForDecl())) {
      // Make sure that the TagType points at the definition.
      const_cast<TagType*>(TagT)->decl = TD;
    }

    if (auto RD = dyn_cast<CXXRecordDecl>(D)) {
      for (auto *R = getMostRecentExistingDecl(RD); R;
           R = R->getPreviousDecl()) {
        assert((R == D) ==((void)0)
                   cast<CXXRecordDecl>(R)->isThisDeclarationADefinition() &&((void)0)
               "declaration thinks it's the definition but it isn't")((void)0);
        cast<CXXRecordDecl>(R)->DefinitionData = RD->DefinitionData;
      }
    }

    continue;
  }

  if (auto ID = dyn_cast<ObjCInterfaceDecl>(D)) {
    // Make sure that the ObjCInterfaceType points at the definition.
    const_cast<ObjCInterfaceType *>(cast<ObjCInterfaceType>(ID->TypeForDecl))
      ->Decl = ID;

    for (auto *R = getMostRecentExistingDecl(ID); R; R = R->getPreviousDecl())
      cast<ObjCInterfaceDecl>(R)->Data = ID->Data;

    continue;
  }

  if (auto PD = dyn_cast<ObjCProtocolDecl>(D)) {
    for (auto *R = getMostRecentExistingDecl(PD); R; R = R->getPreviousDecl())
      cast<ObjCProtocolDecl>(R)->Data = PD->Data;

    continue;
  }

  auto RTD = cast<RedeclarableTemplateDecl>(D)->getCanonicalDecl();
  for (auto *R = getMostRecentExistingDecl(RTD); R; R = R->getPreviousDecl())
    cast<RedeclarableTemplateDecl>(R)->Common = RTD->Common;
}
PendingDefinitions.clear();

// Load the bodies of any functions or methods we've encountered. We do
// this now (delayed) so that we can be sure that the declaration chains
// have been fully wired up (hasBody relies on this).
// FIXME: We shouldn't require complete redeclaration chains here.
for (PendingBodiesMap::iterator PB = PendingBodies.begin(),
                             PBEnd = PendingBodies.end();
     PB != PBEnd; ++PB) {
  if (FunctionDecl *FD = dyn_cast<FunctionDecl>(PB->first)) {
    // For a function defined inline within a class template, force the
    // canonical definition to be the one inside the canonical definition of
    // the template. This ensures that we instantiate from a correct view
    // of the template.
    //
    // Sadly we can't do this more generally: we can't be sure that all
    // copies of an arbitrary class definition will have the same members
    // defined (eg, some member functions may not be instantiated, and some
    // special members may or may not have been implicitly defined).
    if (auto *RD = dyn_cast<CXXRecordDecl>(FD->getLexicalParent()))
      if (RD->isDependentContext() && !RD->isThisDeclarationADefinition())
        continue;

    // FIXME: Check for =delete/=default?
    // FIXME: Complain about ODR violations here?
    const FunctionDecl *Defn = nullptr;
    if (!getContext().getLangOpts().Modules || !FD->hasBody(Defn)) {
      FD->setLazyBody(PB->second);
    } else {
      auto *NonConstDefn = const_cast<FunctionDecl*>(Defn);
      mergeDefinitionVisibility(NonConstDefn, FD);

      if (!FD->isLateTemplateParsed() &&
          !NonConstDefn->isLateTemplateParsed() &&
          FD->getODRHash() != NonConstDefn->getODRHash()) {
        if (!isa<CXXMethodDecl>(FD)) {
          PendingFunctionOdrMergeFailures[FD].push_back(NonConstDefn);
        } else if (FD->getLexicalParent()->isFileContext() &&
                   NonConstDefn->getLexicalParent()->isFileContext()) {
          // Only diagnose out-of-line method definitions.  If they are
          // in class definitions, then an error will be generated when
          // processing the class bodies.
          PendingFunctionOdrMergeFailures[FD].push_back(NonConstDefn);
        }
      }
    }
    continue;
  }

  ObjCMethodDecl *MD = cast<ObjCMethodDecl>(PB->first);
  if (!getContext().getLangOpts().Modules || !MD->hasBody())
    MD->setLazyBody(PB->second);
}
PendingBodies.clear();

// Do some cleanup.
for (auto *ND : PendingMergedDefinitionsToDeduplicate)
  getContext().deduplicateMergedDefinitonsFor(ND);
PendingMergedDefinitionsToDeduplicate.clear();
9394}

9396void ASTReader::diagnoseOdrViolations() {
if (PendingOdrMergeFailures.empty() && PendingOdrMergeChecks.empty() &&
    PendingFunctionOdrMergeFailures.empty() &&
    PendingEnumOdrMergeFailures.empty())
  return;

// Trigger the import of the full definition of each class that had any
// odr-merging problems, so we can produce better diagnostics for them.
// These updates may in turn find and diagnose some ODR failures, so take
// ownership of the set first.
auto OdrMergeFailures = std::move(PendingOdrMergeFailures);
PendingOdrMergeFailures.clear();
for (auto &Merge : OdrMergeFailures) {
  Merge.first->buildLookup();
  Merge.first->decls_begin();
  Merge.first->bases_begin();
  Merge.first->vbases_begin();
  for (auto &RecordPair : Merge.second) {
    auto *RD = RecordPair.first;
    RD->decls_begin();
    RD->bases_begin();
    RD->vbases_begin();
  }
}

// Trigger the import of functions.
auto FunctionOdrMergeFailures = std::move(PendingFunctionOdrMergeFailures);
PendingFunctionOdrMergeFailures.clear();
for (auto &Merge : FunctionOdrMergeFailures) {
  Merge.first->buildLookup();
  Merge.first->decls_begin();
  Merge.first->getBody();
  for (auto &FD : Merge.second) {
    FD->buildLookup();
    FD->decls_begin();
    FD->getBody();
  }
}

// Trigger the import of enums.
auto EnumOdrMergeFailures = std::move(PendingEnumOdrMergeFailures);
PendingEnumOdrMergeFailures.clear();
for (auto &Merge : EnumOdrMergeFailures) {
  Merge.first->decls_begin();
  for (auto &Enum : Merge.second) {
    Enum->decls_begin();
  }
}

// For each declaration from a merged context, check that the canonical
// definition of that context also contains a declaration of the same
// entity.
//
// Caution: this loop does things that might invalidate iterators into
// PendingOdrMergeChecks. Don't turn this into a range-based for loop!
while (!PendingOdrMergeChecks.empty()) {
  NamedDecl *D = PendingOdrMergeChecks.pop_back_val();

  // FIXME: Skip over implicit declarations for now. This matters for things
  // like implicitly-declared special member functions. This isn't entirely
  // correct; we can end up with multiple unmerged declarations of the same
  // implicit entity.
  if (D->isImplicit())
    continue;

  DeclContext *CanonDef = D->getDeclContext();

  bool Found = false;
  const Decl *DCanon = D->getCanonicalDecl();

  for (auto RI : D->redecls()) {
    if (RI->getLexicalDeclContext() == CanonDef) {
      Found = true;
      break;
    }
  }
  if (Found)
    continue;

  // Quick check failed, time to do the slow thing. Note, we can't just
  // look up the name of D in CanonDef here, because the member that is
  // in CanonDef might not be found by name lookup (it might have been
  // replaced by a more recent declaration in the lookup table), and we
  // can't necessarily find it in the redeclaration chain because it might
  // be merely mergeable, not redeclarable.
  llvm::SmallVector<const NamedDecl*, 4> Candidates;
  for (auto *CanonMember : CanonDef->decls()) {
    if (CanonMember->getCanonicalDecl() == DCanon) {
      // This can happen if the declaration is merely mergeable and not
      // actually redeclarable (we looked for redeclarations earlier).
      //
      // FIXME: We should be able to detect this more efficiently, without
      // pulling in all of the members of CanonDef.
      Found = true;
      break;
    }
    if (auto *ND = dyn_cast<NamedDecl>(CanonMember))
      if (ND->getDeclName() == D->getDeclName())
        Candidates.push_back(ND);
  }

  if (!Found) {
    // The AST doesn't like TagDecls becoming invalid after they've been
    // completed. We only really need to mark FieldDecls as invalid here.
    if (!isa<TagDecl>(D))
      D->setInvalidDecl();

    // Ensure we don't accidentally recursively enter deserialization while
    // we're producing our diagnostic.
    Deserializing RecursionGuard(this);

    std::string CanonDefModule =
        getOwningModuleNameForDiagnostic(cast<Decl>(CanonDef));
    Diag(D->getLocation(), diag::err_module_odr_violation_missing_decl)
      << D << getOwningModuleNameForDiagnostic(D)
      << CanonDef << CanonDefModule.empty() << CanonDefModule;

    if (Candidates.empty())
      Diag(cast<Decl>(CanonDef)->getLocation(),
           diag::note_module_odr_violation_no_possible_decls) << D;
    else {
      for (unsigned I = 0, N = Candidates.size(); I != N; ++I)
        Diag(Candidates[I]->getLocation(),
             diag::note_module_odr_violation_possible_decl)
          << Candidates[I];
    }

    DiagnosedOdrMergeFailures.insert(CanonDef);
  }
}

if (OdrMergeFailures.empty() && FunctionOdrMergeFailures.empty() &&
    EnumOdrMergeFailures.empty())
  return;

// Ensure we don't accidentally recursively enter deserialization while
// we're producing our diagnostics.
Deserializing RecursionGuard(this);

// Common code for hashing helpers.
ODRHash Hash;
auto ComputeQualTypeODRHash = [&Hash](QualType Ty) {
  Hash.clear();
  Hash.AddQualType(Ty);
  return Hash.CalculateHash();
};

auto ComputeODRHash = [&Hash](const Stmt *S) {
  assert(S)((void)0);
  Hash.clear();
  Hash.AddStmt(S);
  return Hash.CalculateHash();
};

auto ComputeSubDeclODRHash = [&Hash](const Decl *D) {
  assert(D)((void)0);
  Hash.clear();
  Hash.AddSubDecl(D);
  return Hash.CalculateHash();
};

auto ComputeTemplateArgumentODRHash = [&Hash](const TemplateArgument &TA) {
  Hash.clear();
  Hash.AddTemplateArgument(TA);
  return Hash.CalculateHash();
};

auto ComputeTemplateParameterListODRHash =
    [&Hash](const TemplateParameterList *TPL) {
      assert(TPL)((void)0);
      Hash.clear();
      Hash.AddTemplateParameterList(TPL);
      return Hash.CalculateHash();
    };

// Used with err_module_odr_violation_mismatch_decl and
// note_module_odr_violation_mismatch_decl
// This list should be the same Decl's as in ODRHash::isDeclToBeProcessed
enum ODRMismatchDecl {
  EndOfClass,
  PublicSpecifer,
  PrivateSpecifer,
  ProtectedSpecifer,
  StaticAssert,
  Field,
  CXXMethod,
  TypeAlias,
  TypeDef,
  Var,
  Friend,
  FunctionTemplate,
  Other
};

// Used with err_module_odr_violation_mismatch_decl_diff and
// note_module_odr_violation_mismatch_decl_diff
enum ODRMismatchDeclDifference {
  StaticAssertCondition,
  StaticAssertMessage,
  StaticAssertOnlyMessage,
  FieldName,
  FieldTypeName,
  FieldSingleBitField,
  FieldDifferentWidthBitField,
  FieldSingleMutable,
  FieldSingleInitializer,
  FieldDifferentInitializers,
  MethodName,
  MethodDeleted,
  MethodDefaulted,
  MethodVirtual,
  MethodStatic,
  MethodVolatile,
  MethodConst,
  MethodInline,
  MethodNumberParameters,
  MethodParameterType,
  MethodParameterName,
  MethodParameterSingleDefaultArgument,
  MethodParameterDifferentDefaultArgument,
  MethodNoTemplateArguments,
  MethodDifferentNumberTemplateArguments,
  MethodDifferentTemplateArgument,
  MethodSingleBody,
  MethodDifferentBody,
  TypedefName,
  TypedefType,
  VarName,
  VarType,
  VarSingleInitializer,
  VarDifferentInitializer,
  VarConstexpr,
  FriendTypeFunction,
  FriendType,
  FriendFunction,
  FunctionTemplateDifferentNumberParameters,
  FunctionTemplateParameterDifferentKind,
  FunctionTemplateParameterName,
  FunctionTemplateParameterSingleDefaultArgument,
  FunctionTemplateParameterDifferentDefaultArgument,
  FunctionTemplateParameterDifferentType,
  FunctionTemplatePackParameter,
};

// These lambdas have the common portions of the ODR diagnostics.  This
// has the same return as Diag(), so addition parameters can be passed
// in with operator<<
auto ODRDiagDeclError = [this](NamedDecl *FirstRecord, StringRef FirstModule,
                               SourceLocation Loc, SourceRange Range,
                               ODRMismatchDeclDifference DiffType) {
  return Diag(Loc, diag::err_module_odr_violation_mismatch_decl_diff)
         << FirstRecord << FirstModule.empty() << FirstModule << Range
         << DiffType;
};
auto ODRDiagDeclNote = [this](StringRef SecondModule, SourceLocation Loc,
                              SourceRange Range, ODRMismatchDeclDifference DiffType) {
  return Diag(Loc, diag::note_module_odr_violation_mismatch_decl_diff)
         << SecondModule << Range << DiffType;
};

auto ODRDiagField = [this, &ODRDiagDeclError, &ODRDiagDeclNote,
                     &ComputeQualTypeODRHash, &ComputeODRHash](
                        NamedDecl *FirstRecord, StringRef FirstModule,
                        StringRef SecondModule, FieldDecl *FirstField,
                        FieldDecl *SecondField) {
  IdentifierInfo *FirstII = FirstField->getIdentifier();
  IdentifierInfo *SecondII = SecondField->getIdentifier();
  if (FirstII->getName() != SecondII->getName()) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstField->getLocation(),
                     FirstField->getSourceRange(), FieldName)
        << FirstII;
    ODRDiagDeclNote(SecondModule, SecondField->getLocation(),
                    SecondField->getSourceRange(), FieldName)
        << SecondII;

    return true;
  }

  assert(getContext().hasSameType(FirstField->getType(),((void)0)
                                  SecondField->getType()))((void)0);

  QualType FirstType = FirstField->getType();
  QualType SecondType = SecondField->getType();
  if (ComputeQualTypeODRHash(FirstType) !=
      ComputeQualTypeODRHash(SecondType)) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstField->getLocation(),
                     FirstField->getSourceRange(), FieldTypeName)
        << FirstII << FirstType;
    ODRDiagDeclNote(SecondModule, SecondField->getLocation(),
                    SecondField->getSourceRange(), FieldTypeName)
        << SecondII << SecondType;

    return true;
  }

  const bool IsFirstBitField = FirstField->isBitField();
  const bool IsSecondBitField = SecondField->isBitField();
  if (IsFirstBitField != IsSecondBitField) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstField->getLocation(),
                     FirstField->getSourceRange(), FieldSingleBitField)
        << FirstII << IsFirstBitField;
    ODRDiagDeclNote(SecondModule, SecondField->getLocation(),
                    SecondField->getSourceRange(), FieldSingleBitField)
        << SecondII << IsSecondBitField;
    return true;
  }

  if (IsFirstBitField && IsSecondBitField) {
    unsigned FirstBitWidthHash =
        ComputeODRHash(FirstField->getBitWidth());
    unsigned SecondBitWidthHash =
        ComputeODRHash(SecondField->getBitWidth());
    if (FirstBitWidthHash != SecondBitWidthHash) {
      ODRDiagDeclError(FirstRecord, FirstModule, FirstField->getLocation(),
                       FirstField->getSourceRange(),
                       FieldDifferentWidthBitField)
          << FirstII << FirstField->getBitWidth()->getSourceRange();
      ODRDiagDeclNote(SecondModule, SecondField->getLocation(),
                      SecondField->getSourceRange(),
                      FieldDifferentWidthBitField)
          << SecondII << SecondField->getBitWidth()->getSourceRange();
      return true;
    }
  }

  if (!PP.getLangOpts().CPlusPlus)
    return false;

  const bool IsFirstMutable = FirstField->isMutable();
  const bool IsSecondMutable = SecondField->isMutable();
  if (IsFirstMutable != IsSecondMutable) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstField->getLocation(),
                     FirstField->getSourceRange(), FieldSingleMutable)
        << FirstII << IsFirstMutable;
    ODRDiagDeclNote(SecondModule, SecondField->getLocation(),
                    SecondField->getSourceRange(), FieldSingleMutable)
        << SecondII << IsSecondMutable;
    return true;
  }

  const Expr *FirstInitializer = FirstField->getInClassInitializer();
  const Expr *SecondInitializer = SecondField->getInClassInitializer();
  if ((!FirstInitializer && SecondInitializer) ||
      (FirstInitializer && !SecondInitializer)) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstField->getLocation(),
                     FirstField->getSourceRange(), FieldSingleInitializer)
        << FirstII << (FirstInitializer != nullptr);
    ODRDiagDeclNote(SecondModule, SecondField->getLocation(),
                    SecondField->getSourceRange(), FieldSingleInitializer)
        << SecondII << (SecondInitializer != nullptr);
    return true;
  }

  if (FirstInitializer && SecondInitializer) {
    unsigned FirstInitHash = ComputeODRHash(FirstInitializer);
    unsigned SecondInitHash = ComputeODRHash(SecondInitializer);
    if (FirstInitHash != SecondInitHash) {
      ODRDiagDeclError(FirstRecord, FirstModule, FirstField->getLocation(),
                       FirstField->getSourceRange(),
                       FieldDifferentInitializers)
          << FirstII << FirstInitializer->getSourceRange();
      ODRDiagDeclNote(SecondModule, SecondField->getLocation(),
                      SecondField->getSourceRange(),
                      FieldDifferentInitializers)
          << SecondII << SecondInitializer->getSourceRange();
      return true;
    }
  }

  return false;
};

auto ODRDiagTypeDefOrAlias =
    [&ODRDiagDeclError, &ODRDiagDeclNote, &ComputeQualTypeODRHash](
        NamedDecl *FirstRecord, StringRef FirstModule, StringRef SecondModule,
        TypedefNameDecl *FirstTD, TypedefNameDecl *SecondTD,
        bool IsTypeAlias) {
      auto FirstName = FirstTD->getDeclName();
      auto SecondName = SecondTD->getDeclName();
      if (FirstName != SecondName) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstTD->getLocation(),
                         FirstTD->getSourceRange(), TypedefName)
            << IsTypeAlias << FirstName;
        ODRDiagDeclNote(SecondModule, SecondTD->getLocation(),
                        SecondTD->getSourceRange(), TypedefName)
            << IsTypeAlias << SecondName;
        return true;
      }

      QualType FirstType = FirstTD->getUnderlyingType();
      QualType SecondType = SecondTD->getUnderlyingType();
      if (ComputeQualTypeODRHash(FirstType) !=
          ComputeQualTypeODRHash(SecondType)) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstTD->getLocation(),
                         FirstTD->getSourceRange(), TypedefType)
            << IsTypeAlias << FirstName << FirstType;
        ODRDiagDeclNote(SecondModule, SecondTD->getLocation(),
                        SecondTD->getSourceRange(), TypedefType)
            << IsTypeAlias << SecondName << SecondType;
        return true;
      }

      return false;
};

auto ODRDiagVar = [&ODRDiagDeclError, &ODRDiagDeclNote,
                   &ComputeQualTypeODRHash, &ComputeODRHash,
                   this](NamedDecl *FirstRecord, StringRef FirstModule,
                         StringRef SecondModule, VarDecl *FirstVD,
                         VarDecl *SecondVD) {
  auto FirstName = FirstVD->getDeclName();
  auto SecondName = SecondVD->getDeclName();
  if (FirstName != SecondName) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstVD->getLocation(),
                     FirstVD->getSourceRange(), VarName)
        << FirstName;
    ODRDiagDeclNote(SecondModule, SecondVD->getLocation(),
                    SecondVD->getSourceRange(), VarName)
        << SecondName;
    return true;
  }

  QualType FirstType = FirstVD->getType();
  QualType SecondType = SecondVD->getType();
  if (ComputeQualTypeODRHash(FirstType) !=
      ComputeQualTypeODRHash(SecondType)) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstVD->getLocation(),
                     FirstVD->getSourceRange(), VarType)
        << FirstName << FirstType;
    ODRDiagDeclNote(SecondModule, SecondVD->getLocation(),
                    SecondVD->getSourceRange(), VarType)
        << SecondName << SecondType;
    return true;
  }

  if (!PP.getLangOpts().CPlusPlus)
    return false;

  const Expr *FirstInit = FirstVD->getInit();
  const Expr *SecondInit = SecondVD->getInit();
  if ((FirstInit == nullptr) != (SecondInit == nullptr)) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstVD->getLocation(),
                     FirstVD->getSourceRange(), VarSingleInitializer)
        << FirstName << (FirstInit == nullptr)
        << (FirstInit ? FirstInit->getSourceRange() : SourceRange());
    ODRDiagDeclNote(SecondModule, SecondVD->getLocation(),
                    SecondVD->getSourceRange(), VarSingleInitializer)
        << SecondName << (SecondInit == nullptr)
        << (SecondInit ? SecondInit->getSourceRange() : SourceRange());
    return true;
  }

  if (FirstInit && SecondInit &&
      ComputeODRHash(FirstInit) != ComputeODRHash(SecondInit)) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstVD->getLocation(),
                     FirstVD->getSourceRange(), VarDifferentInitializer)
        << FirstName << FirstInit->getSourceRange();
    ODRDiagDeclNote(SecondModule, SecondVD->getLocation(),
                    SecondVD->getSourceRange(), VarDifferentInitializer)
        << SecondName << SecondInit->getSourceRange();
    return true;
  }

  const bool FirstIsConstexpr = FirstVD->isConstexpr();
  const bool SecondIsConstexpr = SecondVD->isConstexpr();
  if (FirstIsConstexpr != SecondIsConstexpr) {
    ODRDiagDeclError(FirstRecord, FirstModule, FirstVD->getLocation(),
                     FirstVD->getSourceRange(), VarConstexpr)
        << FirstName << FirstIsConstexpr;
    ODRDiagDeclNote(SecondModule, SecondVD->getLocation(),
                    SecondVD->getSourceRange(), VarConstexpr)
        << SecondName << SecondIsConstexpr;
    return true;
  }
  return false;
};

auto DifferenceSelector = [](Decl *D) {
  assert(D && "valid Decl required")((void)0);
  switch (D->getKind()) {
  default:
    return Other;
  case Decl::AccessSpec:
    switch (D->getAccess()) {
    case AS_public:
      return PublicSpecifer;
    case AS_private:
      return PrivateSpecifer;
    case AS_protected:
      return ProtectedSpecifer;
    case AS_none:
      break;
    }
    llvm_unreachable("Invalid access specifier")__builtin_unreachable();
  case Decl::StaticAssert:
    return StaticAssert;
  case Decl::Field:
    return Field;
  case Decl::CXXMethod:
  case Decl::CXXConstructor:
  case Decl::CXXDestructor:
    return CXXMethod;
  case Decl::TypeAlias:
    return TypeAlias;
  case Decl::Typedef:
    return TypeDef;
  case Decl::Var:
    return Var;
  case Decl::Friend:
    return Friend;
  case Decl::FunctionTemplate:
    return FunctionTemplate;
  }
};

using DeclHashes = llvm::SmallVector<std::pair<Decl *, unsigned>, 4>;
auto PopulateHashes = [&ComputeSubDeclODRHash](DeclHashes &Hashes,
                                               RecordDecl *Record,
                                               const DeclContext *DC) {
  for (auto *D : Record->decls()) {
    if (!ODRHash::isDeclToBeProcessed(D, DC))
      continue;
    Hashes.emplace_back(D, ComputeSubDeclODRHash(D));
  }
};

struct DiffResult {
  Decl *FirstDecl = nullptr, *SecondDecl = nullptr;
  ODRMismatchDecl FirstDiffType = Other, SecondDiffType = Other;
};

// If there is a diagnoseable difference, FirstDiffType and
// SecondDiffType will not be Other and FirstDecl and SecondDecl will be
// filled in if not EndOfClass.
auto FindTypeDiffs = [&DifferenceSelector](DeclHashes &FirstHashes,
                                           DeclHashes &SecondHashes) {
  DiffResult DR;
  auto FirstIt = FirstHashes.begin();
  auto SecondIt = SecondHashes.begin();
  while (FirstIt != FirstHashes.end() || SecondIt != SecondHashes.end()) {
    if (FirstIt != FirstHashes.end() && SecondIt != SecondHashes.end() &&
        FirstIt->second == SecondIt->second) {
      ++FirstIt;
      ++SecondIt;
      continue;
    }

    DR.FirstDecl = FirstIt == FirstHashes.end() ? nullptr : FirstIt->first;
    DR.SecondDecl =
        SecondIt == SecondHashes.end() ? nullptr : SecondIt->first;

    DR.FirstDiffType =
        DR.FirstDecl ? DifferenceSelector(DR.FirstDecl) : EndOfClass;
    DR.SecondDiffType =
        DR.SecondDecl ? DifferenceSelector(DR.SecondDecl) : EndOfClass;
    return DR;
  }
  return DR;
};

// Use this to diagnose that an unexpected Decl was encountered
// or no difference was detected. This causes a generic error
// message to be emitted.
auto DiagnoseODRUnexpected = [this](DiffResult &DR, NamedDecl *FirstRecord,
                                    StringRef FirstModule,
                                    NamedDecl *SecondRecord,
                                    StringRef SecondModule) {
  Diag(FirstRecord->getLocation(),
       diag::err_module_odr_violation_different_definitions)
      << FirstRecord << FirstModule.empty() << FirstModule;

  if (DR.FirstDecl) {
    Diag(DR.FirstDecl->getLocation(), diag::note_first_module_difference)
        << FirstRecord << DR.FirstDecl->getSourceRange();
  }

  Diag(SecondRecord->getLocation(),
       diag::note_module_odr_violation_different_definitions)
      << SecondModule;

  if (DR.SecondDecl) {
    Diag(DR.SecondDecl->getLocation(), diag::note_second_module_difference)
        << DR.SecondDecl->getSourceRange();
  }
};

auto DiagnoseODRMismatch =
    [this](DiffResult &DR, NamedDecl *FirstRecord, StringRef FirstModule,
           NamedDecl *SecondRecord, StringRef SecondModule) {
      SourceLocation FirstLoc;
      SourceRange FirstRange;
      auto *FirstTag = dyn_cast<TagDecl>(FirstRecord);
      if (DR.FirstDiffType == EndOfClass && FirstTag) {
        FirstLoc = FirstTag->getBraceRange().getEnd();
      } else {
        FirstLoc = DR.FirstDecl->getLocation();
        FirstRange = DR.FirstDecl->getSourceRange();
      }
      Diag(FirstLoc, diag::err_module_odr_violation_mismatch_decl)
          << FirstRecord << FirstModule.empty() << FirstModule << FirstRange
          << DR.FirstDiffType;

      SourceLocation SecondLoc;
      SourceRange SecondRange;
      auto *SecondTag = dyn_cast<TagDecl>(SecondRecord);
      if (DR.SecondDiffType == EndOfClass && SecondTag) {
        SecondLoc = SecondTag->getBraceRange().getEnd();
      } else {
        SecondLoc = DR.SecondDecl->getLocation();
        SecondRange = DR.SecondDecl->getSourceRange();
      }
      Diag(SecondLoc, diag::note_module_odr_violation_mismatch_decl)
          << SecondModule << SecondRange << DR.SecondDiffType;
    };

// Issue any pending ODR-failure diagnostics.
for (auto &Merge : OdrMergeFailures) {
  // If we've already pointed out a specific problem with this class, don't
  // bother issuing a general "something's different" diagnostic.
  if (!DiagnosedOdrMergeFailures.insert(Merge.first).second)
    continue;

  bool Diagnosed = false;
  CXXRecordDecl *FirstRecord = Merge.first;
  std::string FirstModule = getOwningModuleNameForDiagnostic(FirstRecord);
  for (auto &RecordPair : Merge.second) {
    CXXRecordDecl *SecondRecord = RecordPair.first;
    // Multiple different declarations got merged together; tell the user
    // where they came from.
    if (FirstRecord == SecondRecord)
      continue;

    std::string SecondModule = getOwningModuleNameForDiagnostic(SecondRecord);

    auto *FirstDD = FirstRecord->DefinitionData;
    auto *SecondDD = RecordPair.second;

    assert(FirstDD && SecondDD && "Definitions without DefinitionData")((void)0);

    // Diagnostics from DefinitionData are emitted here.
    if (FirstDD != SecondDD) {
      enum ODRDefinitionDataDifference {
        NumBases,
        NumVBases,
        BaseType,
        BaseVirtual,
        BaseAccess,
      };
      auto ODRDiagBaseError = [FirstRecord, &FirstModule,
                               this](SourceLocation Loc, SourceRange Range,
                                     ODRDefinitionDataDifference DiffType) {
        return Diag(Loc, diag::err_module_odr_violation_definition_data)
               << FirstRecord << FirstModule.empty() << FirstModule << Range
               << DiffType;
      };
      auto ODRDiagBaseNote = [&SecondModule,
                              this](SourceLocation Loc, SourceRange Range,
                                    ODRDefinitionDataDifference DiffType) {
        return Diag(Loc, diag::note_module_odr_violation_definition_data)
               << SecondModule << Range << DiffType;
      };

      unsigned FirstNumBases = FirstDD->NumBases;
      unsigned FirstNumVBases = FirstDD->NumVBases;
      unsigned SecondNumBases = SecondDD->NumBases;
      unsigned SecondNumVBases = SecondDD->NumVBases;

      auto GetSourceRange = [](struct CXXRecordDecl::DefinitionData *DD) {
        unsigned NumBases = DD->NumBases;
        if (NumBases == 0) return SourceRange();
        auto bases = DD->bases();
        return SourceRange(bases[0].getBeginLoc(),
                           bases[NumBases - 1].getEndLoc());
      };

      if (FirstNumBases != SecondNumBases) {
        ODRDiagBaseError(FirstRecord->getLocation(), GetSourceRange(FirstDD),
                         NumBases)
            << FirstNumBases;
        ODRDiagBaseNote(SecondRecord->getLocation(), GetSourceRange(SecondDD),
                        NumBases)
            << SecondNumBases;
        Diagnosed = true;
        break;
      }

      if (FirstNumVBases != SecondNumVBases) {
        ODRDiagBaseError(FirstRecord->getLocation(), GetSourceRange(FirstDD),
                         NumVBases)
            << FirstNumVBases;
        ODRDiagBaseNote(SecondRecord->getLocation(), GetSourceRange(SecondDD),
                        NumVBases)
            << SecondNumVBases;
        Diagnosed = true;
        break;
      }

      auto FirstBases = FirstDD->bases();
      auto SecondBases = SecondDD->bases();
      unsigned i = 0;
      for (i = 0; i < FirstNumBases; ++i) {
        auto FirstBase = FirstBases[i];
        auto SecondBase = SecondBases[i];
        if (ComputeQualTypeODRHash(FirstBase.getType()) !=
            ComputeQualTypeODRHash(SecondBase.getType())) {
          ODRDiagBaseError(FirstRecord->getLocation(),
                           FirstBase.getSourceRange(), BaseType)
              << (i + 1) << FirstBase.getType();
          ODRDiagBaseNote(SecondRecord->getLocation(),
                          SecondBase.getSourceRange(), BaseType)
              << (i + 1) << SecondBase.getType();
          break;
        }

        if (FirstBase.isVirtual() != SecondBase.isVirtual()) {
          ODRDiagBaseError(FirstRecord->getLocation(),
                           FirstBase.getSourceRange(), BaseVirtual)
              << (i + 1) << FirstBase.isVirtual() << FirstBase.getType();
          ODRDiagBaseNote(SecondRecord->getLocation(),
                          SecondBase.getSourceRange(), BaseVirtual)
              << (i + 1) << SecondBase.isVirtual() << SecondBase.getType();
          break;
        }

        if (FirstBase.getAccessSpecifierAsWritten() !=
            SecondBase.getAccessSpecifierAsWritten()) {
          ODRDiagBaseError(FirstRecord->getLocation(),
                           FirstBase.getSourceRange(), BaseAccess)
              << (i + 1) << FirstBase.getType()
              << (int)FirstBase.getAccessSpecifierAsWritten();
          ODRDiagBaseNote(SecondRecord->getLocation(),
                          SecondBase.getSourceRange(), BaseAccess)
              << (i + 1) << SecondBase.getType()
              << (int)SecondBase.getAccessSpecifierAsWritten();
          break;
        }
      }

      if (i != FirstNumBases) {
        Diagnosed = true;
        break;
      }
    }

    const ClassTemplateDecl *FirstTemplate =
        FirstRecord->getDescribedClassTemplate();
    const ClassTemplateDecl *SecondTemplate =
        SecondRecord->getDescribedClassTemplate();

    assert(!FirstTemplate == !SecondTemplate &&((void)0)
           "Both pointers should be null or non-null")((void)0);

    enum ODRTemplateDifference {
      ParamEmptyName,
      ParamName,
      ParamSingleDefaultArgument,
      ParamDifferentDefaultArgument,
    };

    if (FirstTemplate && SecondTemplate) {
      DeclHashes FirstTemplateHashes;
      DeclHashes SecondTemplateHashes;

      auto PopulateTemplateParameterHashs =
          [&ComputeSubDeclODRHash](DeclHashes &Hashes,
                                   const ClassTemplateDecl *TD) {
            for (auto *D : TD->getTemplateParameters()->asArray()) {
              Hashes.emplace_back(D, ComputeSubDeclODRHash(D));
            }
          };

      PopulateTemplateParameterHashs(FirstTemplateHashes, FirstTemplate);
      PopulateTemplateParameterHashs(SecondTemplateHashes, SecondTemplate);

      assert(FirstTemplateHashes.size() == SecondTemplateHashes.size() &&((void)0)
             "Number of template parameters should be equal.")((void)0);

      auto FirstIt = FirstTemplateHashes.begin();
      auto FirstEnd = FirstTemplateHashes.end();
      auto SecondIt = SecondTemplateHashes.begin();
      for (; FirstIt != FirstEnd; ++FirstIt, ++SecondIt) {
        if (FirstIt->second == SecondIt->second)
          continue;

        auto ODRDiagTemplateError = [FirstRecord, &FirstModule, this](
                                        SourceLocation Loc, SourceRange Range,
                                        ODRTemplateDifference DiffType) {
          return Diag(Loc, diag::err_module_odr_violation_template_parameter)
                 << FirstRecord << FirstModule.empty() << FirstModule << Range
                 << DiffType;
        };
        auto ODRDiagTemplateNote = [&SecondModule, this](
                                       SourceLocation Loc, SourceRange Range,
                                       ODRTemplateDifference DiffType) {
          return Diag(Loc, diag::note_module_odr_violation_template_parameter)
                 << SecondModule << Range << DiffType;
        };

        const NamedDecl* FirstDecl = cast<NamedDecl>(FirstIt->first);
        const NamedDecl* SecondDecl = cast<NamedDecl>(SecondIt->first);

        assert(FirstDecl->getKind() == SecondDecl->getKind() &&((void)0)
               "Parameter Decl's should be the same kind.")((void)0);

        DeclarationName FirstName = FirstDecl->getDeclName();
        DeclarationName SecondName = SecondDecl->getDeclName();

        if (FirstName != SecondName) {
          const bool FirstNameEmpty =
              FirstName.isIdentifier() && !FirstName.getAsIdentifierInfo();
          const bool SecondNameEmpty =
              SecondName.isIdentifier() && !SecondName.getAsIdentifierInfo();
          assert((!FirstNameEmpty || !SecondNameEmpty) &&((void)0)
                 "Both template parameters cannot be unnamed.")((void)0);
          ODRDiagTemplateError(FirstDecl->getLocation(),
                               FirstDecl->getSourceRange(),
                               FirstNameEmpty ? ParamEmptyName : ParamName)
              << FirstName;
          ODRDiagTemplateNote(SecondDecl->getLocation(),
                              SecondDecl->getSourceRange(),
                              SecondNameEmpty ? ParamEmptyName : ParamName)
              << SecondName;
          break;
        }

        switch (FirstDecl->getKind()) {
        default:
          llvm_unreachable("Invalid template parameter type.")__builtin_unreachable();
        case Decl::TemplateTypeParm: {
          const auto *FirstParam = cast<TemplateTypeParmDecl>(FirstDecl);
          const auto *SecondParam = cast<TemplateTypeParmDecl>(SecondDecl);
          const bool HasFirstDefaultArgument =
              FirstParam->hasDefaultArgument() &&
              !FirstParam->defaultArgumentWasInherited();
          const bool HasSecondDefaultArgument =
              SecondParam->hasDefaultArgument() &&
              !SecondParam->defaultArgumentWasInherited();

          if (HasFirstDefaultArgument != HasSecondDefaultArgument) {
            ODRDiagTemplateError(FirstDecl->getLocation(),
                                 FirstDecl->getSourceRange(),
                                 ParamSingleDefaultArgument)
                << HasFirstDefaultArgument;
            ODRDiagTemplateNote(SecondDecl->getLocation(),
                                SecondDecl->getSourceRange(),
                                ParamSingleDefaultArgument)
                << HasSecondDefaultArgument;
            break;
          }

          assert(HasFirstDefaultArgument && HasSecondDefaultArgument &&((void)0)
                 "Expecting default arguments.")((void)0);

          ODRDiagTemplateError(FirstDecl->getLocation(),
                               FirstDecl->getSourceRange(),
                               ParamDifferentDefaultArgument);
          ODRDiagTemplateNote(SecondDecl->getLocation(),
                              SecondDecl->getSourceRange(),
                              ParamDifferentDefaultArgument);

          break;
        }
        case Decl::NonTypeTemplateParm: {
          const auto *FirstParam = cast<NonTypeTemplateParmDecl>(FirstDecl);
          const auto *SecondParam = cast<NonTypeTemplateParmDecl>(SecondDecl);
          const bool HasFirstDefaultArgument =
              FirstParam->hasDefaultArgument() &&
              !FirstParam->defaultArgumentWasInherited();
          const bool HasSecondDefaultArgument =
              SecondParam->hasDefaultArgument() &&
              !SecondParam->defaultArgumentWasInherited();

          if (HasFirstDefaultArgument != HasSecondDefaultArgument) {
            ODRDiagTemplateError(FirstDecl->getLocation(),
                                 FirstDecl->getSourceRange(),
                                 ParamSingleDefaultArgument)
                << HasFirstDefaultArgument;
            ODRDiagTemplateNote(SecondDecl->getLocation(),
                                SecondDecl->getSourceRange(),
                                ParamSingleDefaultArgument)
                << HasSecondDefaultArgument;
            break;
          }

          assert(HasFirstDefaultArgument && HasSecondDefaultArgument &&((void)0)
                 "Expecting default arguments.")((void)0);

          ODRDiagTemplateError(FirstDecl->getLocation(),
                               FirstDecl->getSourceRange(),
                               ParamDifferentDefaultArgument);
          ODRDiagTemplateNote(SecondDecl->getLocation(),
                              SecondDecl->getSourceRange(),
                              ParamDifferentDefaultArgument);

          break;
        }
        case Decl::TemplateTemplateParm: {
          const auto *FirstParam = cast<TemplateTemplateParmDecl>(FirstDecl);
          const auto *SecondParam =
              cast<TemplateTemplateParmDecl>(SecondDecl);
          const bool HasFirstDefaultArgument =
              FirstParam->hasDefaultArgument() &&
              !FirstParam->defaultArgumentWasInherited();
          const bool HasSecondDefaultArgument =
              SecondParam->hasDefaultArgument() &&
              !SecondParam->defaultArgumentWasInherited();

          if (HasFirstDefaultArgument != HasSecondDefaultArgument) {
            ODRDiagTemplateError(FirstDecl->getLocation(),
                                 FirstDecl->getSourceRange(),
                                 ParamSingleDefaultArgument)
                << HasFirstDefaultArgument;
            ODRDiagTemplateNote(SecondDecl->getLocation(),
                                SecondDecl->getSourceRange(),
                                ParamSingleDefaultArgument)
                << HasSecondDefaultArgument;
            break;
          }

          assert(HasFirstDefaultArgument && HasSecondDefaultArgument &&((void)0)
                 "Expecting default arguments.")((void)0);

          ODRDiagTemplateError(FirstDecl->getLocation(),
                               FirstDecl->getSourceRange(),
                               ParamDifferentDefaultArgument);
          ODRDiagTemplateNote(SecondDecl->getLocation(),
                              SecondDecl->getSourceRange(),
                              ParamDifferentDefaultArgument);

          break;
        }
        }

        break;
      }

      if (FirstIt != FirstEnd) {
        Diagnosed = true;
        break;
      }
    }

    DeclHashes FirstHashes;
    DeclHashes SecondHashes;
    const DeclContext *DC = FirstRecord;
    PopulateHashes(FirstHashes, FirstRecord, DC);
    PopulateHashes(SecondHashes, SecondRecord, DC);

    auto DR = FindTypeDiffs(FirstHashes, SecondHashes);
    ODRMismatchDecl FirstDiffType = DR.FirstDiffType;
    ODRMismatchDecl SecondDiffType = DR.SecondDiffType;
    Decl *FirstDecl = DR.FirstDecl;
    Decl *SecondDecl = DR.SecondDecl;

    if (FirstDiffType == Other || SecondDiffType == Other) {
      DiagnoseODRUnexpected(DR, FirstRecord, FirstModule, SecondRecord,
                            SecondModule);
      Diagnosed = true;
      break;
    }

    if (FirstDiffType != SecondDiffType) {
      DiagnoseODRMismatch(DR, FirstRecord, FirstModule, SecondRecord,
                          SecondModule);
      Diagnosed = true;
      break;
    }

    assert(FirstDiffType == SecondDiffType)((void)0);

    switch (FirstDiffType) {
    case Other:
    case EndOfClass:
    case PublicSpecifer:
    case PrivateSpecifer:
    case ProtectedSpecifer:
      llvm_unreachable("Invalid diff type")__builtin_unreachable();

    case StaticAssert: {
      StaticAssertDecl *FirstSA = cast<StaticAssertDecl>(FirstDecl);
      StaticAssertDecl *SecondSA = cast<StaticAssertDecl>(SecondDecl);

      Expr *FirstExpr = FirstSA->getAssertExpr();
      Expr *SecondExpr = SecondSA->getAssertExpr();
      unsigned FirstODRHash = ComputeODRHash(FirstExpr);
      unsigned SecondODRHash = ComputeODRHash(SecondExpr);
      if (FirstODRHash != SecondODRHash) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstExpr->getBeginLoc(),
                         FirstExpr->getSourceRange(), StaticAssertCondition);
        ODRDiagDeclNote(SecondModule, SecondExpr->getBeginLoc(),
                        SecondExpr->getSourceRange(), StaticAssertCondition);
        Diagnosed = true;
        break;
      }

      StringLiteral *FirstStr = FirstSA->getMessage();
      StringLiteral *SecondStr = SecondSA->getMessage();
      assert((FirstStr || SecondStr) && "Both messages cannot be empty")((void)0);
      if ((FirstStr && !SecondStr) || (!FirstStr && SecondStr)) {
        SourceLocation FirstLoc, SecondLoc;
        SourceRange FirstRange, SecondRange;
        if (FirstStr) {
          FirstLoc = FirstStr->getBeginLoc();
          FirstRange = FirstStr->getSourceRange();
        } else {
          FirstLoc = FirstSA->getBeginLoc();
          FirstRange = FirstSA->getSourceRange();
        }
        if (SecondStr) {
          SecondLoc = SecondStr->getBeginLoc();
          SecondRange = SecondStr->getSourceRange();
        } else {
          SecondLoc = SecondSA->getBeginLoc();
          SecondRange = SecondSA->getSourceRange();
        }
        ODRDiagDeclError(FirstRecord, FirstModule, FirstLoc, FirstRange,
                         StaticAssertOnlyMessage)
            << (FirstStr == nullptr);
        ODRDiagDeclNote(SecondModule, SecondLoc, SecondRange,
                        StaticAssertOnlyMessage)
            << (SecondStr == nullptr);
        Diagnosed = true;
        break;
      }

      if (FirstStr && SecondStr &&
          FirstStr->getString() != SecondStr->getString()) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstStr->getBeginLoc(),
                         FirstStr->getSourceRange(), StaticAssertMessage);
        ODRDiagDeclNote(SecondModule, SecondStr->getBeginLoc(),
                        SecondStr->getSourceRange(), StaticAssertMessage);
        Diagnosed = true;
        break;
      }
      break;
    }
    case Field: {
      Diagnosed = ODRDiagField(FirstRecord, FirstModule, SecondModule,
                               cast<FieldDecl>(FirstDecl),
                               cast<FieldDecl>(SecondDecl));
      break;
    }
    case CXXMethod: {
      enum {
        DiagMethod,
        DiagConstructor,
        DiagDestructor,
      } FirstMethodType,
          SecondMethodType;
      auto GetMethodTypeForDiagnostics = [](const CXXMethodDecl* D) {
        if (isa<CXXConstructorDecl>(D)) return DiagConstructor;
        if (isa<CXXDestructorDecl>(D)) return DiagDestructor;
        return DiagMethod;
      };
      const CXXMethodDecl *FirstMethod = cast<CXXMethodDecl>(FirstDecl);
      const CXXMethodDecl *SecondMethod = cast<CXXMethodDecl>(SecondDecl);
      FirstMethodType = GetMethodTypeForDiagnostics(FirstMethod);
      SecondMethodType = GetMethodTypeForDiagnostics(SecondMethod);
      auto FirstName = FirstMethod->getDeclName();
      auto SecondName = SecondMethod->getDeclName();
      if (FirstMethodType != SecondMethodType || FirstName != SecondName) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodName)
            << FirstMethodType << FirstName;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodName)
            << SecondMethodType << SecondName;

        Diagnosed = true;
        break;
      }

      const bool FirstDeleted = FirstMethod->isDeletedAsWritten();
      const bool SecondDeleted = SecondMethod->isDeletedAsWritten();
      if (FirstDeleted != SecondDeleted) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodDeleted)
            << FirstMethodType << FirstName << FirstDeleted;

        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodDeleted)
            << SecondMethodType << SecondName << SecondDeleted;
        Diagnosed = true;
        break;
      }

      const bool FirstDefaulted = FirstMethod->isExplicitlyDefaulted();
      const bool SecondDefaulted = SecondMethod->isExplicitlyDefaulted();
      if (FirstDefaulted != SecondDefaulted) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodDefaulted)
            << FirstMethodType << FirstName << FirstDefaulted;

        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodDefaulted)
            << SecondMethodType << SecondName << SecondDefaulted;
        Diagnosed = true;
        break;
      }

      const bool FirstVirtual = FirstMethod->isVirtualAsWritten();
      const bool SecondVirtual = SecondMethod->isVirtualAsWritten();
      const bool FirstPure = FirstMethod->isPure();
      const bool SecondPure = SecondMethod->isPure();
      if ((FirstVirtual || SecondVirtual) &&
          (FirstVirtual != SecondVirtual || FirstPure != SecondPure)) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodVirtual)
            << FirstMethodType << FirstName << FirstPure << FirstVirtual;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodVirtual)
            << SecondMethodType << SecondName << SecondPure << SecondVirtual;
        Diagnosed = true;
        break;
      }

      // CXXMethodDecl::isStatic uses the canonical Decl.  With Decl merging,
      // FirstDecl is the canonical Decl of SecondDecl, so the storage
      // class needs to be checked instead.
      const auto FirstStorage = FirstMethod->getStorageClass();
      const auto SecondStorage = SecondMethod->getStorageClass();
      const bool FirstStatic = FirstStorage == SC_Static;
      const bool SecondStatic = SecondStorage == SC_Static;
      if (FirstStatic != SecondStatic) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodStatic)
            << FirstMethodType << FirstName << FirstStatic;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodStatic)
            << SecondMethodType << SecondName << SecondStatic;
        Diagnosed = true;
        break;
      }

      const bool FirstVolatile = FirstMethod->isVolatile();
      const bool SecondVolatile = SecondMethod->isVolatile();
      if (FirstVolatile != SecondVolatile) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodVolatile)
            << FirstMethodType << FirstName << FirstVolatile;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodVolatile)
            << SecondMethodType << SecondName << SecondVolatile;
        Diagnosed = true;
        break;
      }

      const bool FirstConst = FirstMethod->isConst();
      const bool SecondConst = SecondMethod->isConst();
      if (FirstConst != SecondConst) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodConst)
            << FirstMethodType << FirstName << FirstConst;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodConst)
            << SecondMethodType << SecondName << SecondConst;
        Diagnosed = true;
        break;
      }

      const bool FirstInline = FirstMethod->isInlineSpecified();
      const bool SecondInline = SecondMethod->isInlineSpecified();
      if (FirstInline != SecondInline) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodInline)
            << FirstMethodType << FirstName << FirstInline;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodInline)
            << SecondMethodType << SecondName << SecondInline;
        Diagnosed = true;
        break;
      }

      const unsigned FirstNumParameters = FirstMethod->param_size();
      const unsigned SecondNumParameters = SecondMethod->param_size();
      if (FirstNumParameters != SecondNumParameters) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(),
                         MethodNumberParameters)
            << FirstMethodType << FirstName << FirstNumParameters;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(),
                        MethodNumberParameters)
            << SecondMethodType << SecondName << SecondNumParameters;
        Diagnosed = true;
        break;
      }

      // Need this status boolean to know when break out of the switch.
      bool ParameterMismatch = false;
      for (unsigned I = 0; I < FirstNumParameters; ++I) {
        const ParmVarDecl *FirstParam = FirstMethod->getParamDecl(I);
        const ParmVarDecl *SecondParam = SecondMethod->getParamDecl(I);

        QualType FirstParamType = FirstParam->getType();
        QualType SecondParamType = SecondParam->getType();
        if (FirstParamType != SecondParamType &&
            ComputeQualTypeODRHash(FirstParamType) !=
                ComputeQualTypeODRHash(SecondParamType)) {
          if (const DecayedType *ParamDecayedType =
                  FirstParamType->getAs<DecayedType>()) {
            ODRDiagDeclError(
                FirstRecord, FirstModule, FirstMethod->getLocation(),
                FirstMethod->getSourceRange(), MethodParameterType)
                << FirstMethodType << FirstName << (I + 1) << FirstParamType
                << true << ParamDecayedType->getOriginalType();
          } else {
            ODRDiagDeclError(
                FirstRecord, FirstModule, FirstMethod->getLocation(),
                FirstMethod->getSourceRange(), MethodParameterType)
                << FirstMethodType << FirstName << (I + 1) << FirstParamType
                << false;
          }

          if (const DecayedType *ParamDecayedType =
                  SecondParamType->getAs<DecayedType>()) {
            ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                            SecondMethod->getSourceRange(),
                            MethodParameterType)
                << SecondMethodType << SecondName << (I + 1)
                << SecondParamType << true
                << ParamDecayedType->getOriginalType();
          } else {
            ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                            SecondMethod->getSourceRange(),
                            MethodParameterType)
                << SecondMethodType << SecondName << (I + 1)
                << SecondParamType << false;
          }
          ParameterMismatch = true;
          break;
        }

        DeclarationName FirstParamName = FirstParam->getDeclName();
        DeclarationName SecondParamName = SecondParam->getDeclName();
        if (FirstParamName != SecondParamName) {
          ODRDiagDeclError(FirstRecord, FirstModule,
                           FirstMethod->getLocation(),
                           FirstMethod->getSourceRange(), MethodParameterName)
              << FirstMethodType << FirstName << (I + 1) << FirstParamName;
          ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                          SecondMethod->getSourceRange(), MethodParameterName)
              << SecondMethodType << SecondName << (I + 1) << SecondParamName;
          ParameterMismatch = true;
          break;
        }

        const Expr *FirstInit = FirstParam->getInit();
        const Expr *SecondInit = SecondParam->getInit();
        if ((FirstInit == nullptr) != (SecondInit == nullptr)) {
          ODRDiagDeclError(FirstRecord, FirstModule,
                           FirstMethod->getLocation(),
                           FirstMethod->getSourceRange(),
                           MethodParameterSingleDefaultArgument)
              << FirstMethodType << FirstName << (I + 1)
              << (FirstInit == nullptr)
              << (FirstInit ? FirstInit->getSourceRange() : SourceRange());
          ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                          SecondMethod->getSourceRange(),
                          MethodParameterSingleDefaultArgument)
              << SecondMethodType << SecondName << (I + 1)
              << (SecondInit == nullptr)
              << (SecondInit ? SecondInit->getSourceRange() : SourceRange());
          ParameterMismatch = true;
          break;
        }

        if (FirstInit && SecondInit &&
            ComputeODRHash(FirstInit) != ComputeODRHash(SecondInit)) {
          ODRDiagDeclError(FirstRecord, FirstModule,
                           FirstMethod->getLocation(),
                           FirstMethod->getSourceRange(),
                           MethodParameterDifferentDefaultArgument)
              << FirstMethodType << FirstName << (I + 1)
              << FirstInit->getSourceRange();
          ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                          SecondMethod->getSourceRange(),
                          MethodParameterDifferentDefaultArgument)
              << SecondMethodType << SecondName << (I + 1)
              << SecondInit->getSourceRange();
          ParameterMismatch = true;
          break;

        }
      }

      if (ParameterMismatch) {
        Diagnosed = true;
        break;
      }

      const auto *FirstTemplateArgs =
          FirstMethod->getTemplateSpecializationArgs();
      const auto *SecondTemplateArgs =
          SecondMethod->getTemplateSpecializationArgs();

      if ((FirstTemplateArgs && !SecondTemplateArgs) ||
          (!FirstTemplateArgs && SecondTemplateArgs)) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(),
                         MethodNoTemplateArguments)
            << FirstMethodType << FirstName << (FirstTemplateArgs != nullptr);
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(),
                        MethodNoTemplateArguments)
            << SecondMethodType << SecondName
            << (SecondTemplateArgs != nullptr);

        Diagnosed = true;
        break;
      }

      if (FirstTemplateArgs && SecondTemplateArgs) {
        // Remove pack expansions from argument list.
        auto ExpandTemplateArgumentList =
            [](const TemplateArgumentList *TAL) {
              llvm::SmallVector<const TemplateArgument *, 8> ExpandedList;
              for (const TemplateArgument &TA : TAL->asArray()) {
                if (TA.getKind() != TemplateArgument::Pack) {
                  ExpandedList.push_back(&TA);
                  continue;
                }
                for (const TemplateArgument &PackTA : TA.getPackAsArray()) {
                  ExpandedList.push_back(&PackTA);
                }
              }
              return ExpandedList;
            };
        llvm::SmallVector<const TemplateArgument *, 8> FirstExpandedList =
            ExpandTemplateArgumentList(FirstTemplateArgs);
        llvm::SmallVector<const TemplateArgument *, 8> SecondExpandedList =
            ExpandTemplateArgumentList(SecondTemplateArgs);

        if (FirstExpandedList.size() != SecondExpandedList.size()) {
          ODRDiagDeclError(FirstRecord, FirstModule,
                           FirstMethod->getLocation(),
                           FirstMethod->getSourceRange(),
                           MethodDifferentNumberTemplateArguments)
              << FirstMethodType << FirstName
              << (unsigned)FirstExpandedList.size();
          ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                          SecondMethod->getSourceRange(),
                          MethodDifferentNumberTemplateArguments)
              << SecondMethodType << SecondName
              << (unsigned)SecondExpandedList.size();

          Diagnosed = true;
          break;
        }

        bool TemplateArgumentMismatch = false;
        for (unsigned i = 0, e = FirstExpandedList.size(); i != e; ++i) {
          const TemplateArgument &FirstTA = *FirstExpandedList[i],
                                 &SecondTA = *SecondExpandedList[i];
          if (ComputeTemplateArgumentODRHash(FirstTA) ==
              ComputeTemplateArgumentODRHash(SecondTA)) {
            continue;
          }

          ODRDiagDeclError(
              FirstRecord, FirstModule, FirstMethod->getLocation(),
              FirstMethod->getSourceRange(), MethodDifferentTemplateArgument)
              << FirstMethodType << FirstName << FirstTA << i + 1;
          ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                          SecondMethod->getSourceRange(),
                          MethodDifferentTemplateArgument)
              << SecondMethodType << SecondName << SecondTA << i + 1;

          TemplateArgumentMismatch = true;
          break;
        }

        if (TemplateArgumentMismatch) {
          Diagnosed = true;
          break;
        }
      }

      // Compute the hash of the method as if it has no body.
      auto ComputeCXXMethodODRHash = [&Hash](const CXXMethodDecl *D) {
        Hash.clear();
        Hash.AddFunctionDecl(D, true /*SkipBody*/);
        return Hash.CalculateHash();
      };

      // Compare the hash generated to the hash stored.  A difference means
      // that a body was present in the original source.  Due to merging,
      // the stardard way of detecting a body will not work.
      const bool HasFirstBody =
          ComputeCXXMethodODRHash(FirstMethod) != FirstMethod->getODRHash();
      const bool HasSecondBody =
          ComputeCXXMethodODRHash(SecondMethod) != SecondMethod->getODRHash();

      if (HasFirstBody != HasSecondBody) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodSingleBody)
            << FirstMethodType << FirstName << HasFirstBody;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodSingleBody)
            << SecondMethodType << SecondName << HasSecondBody;
        Diagnosed = true;
        break;
      }

      if (HasFirstBody && HasSecondBody) {
        ODRDiagDeclError(FirstRecord, FirstModule, FirstMethod->getLocation(),
                         FirstMethod->getSourceRange(), MethodDifferentBody)
            << FirstMethodType << FirstName;
        ODRDiagDeclNote(SecondModule, SecondMethod->getLocation(),
                        SecondMethod->getSourceRange(), MethodDifferentBody)
            << SecondMethodType << SecondName;
        Diagnosed = true;
        break;
      }

      break;
    }
    case TypeAlias:
    case TypeDef: {
      Diagnosed = ODRDiagTypeDefOrAlias(
          FirstRecord, FirstModule, SecondModule,
          cast<TypedefNameDecl>(FirstDecl), cast<TypedefNameDecl>(SecondDecl),
          FirstDiffType == TypeAlias);
      break;
    }
    case Var: {
      Diagnosed =
          ODRDiagVar(FirstRecord, FirstModule, SecondModule,
                     cast<VarDecl>(FirstDecl), cast<VarDecl>(SecondDecl));
      break;
    }
    case Friend: {
      FriendDecl *FirstFriend = cast<FriendDecl>(FirstDecl);
      FriendDecl *SecondFriend = cast<FriendDecl>(SecondDecl);

      NamedDecl *FirstND = FirstFriend->getFriendDecl();
      NamedDecl *SecondND = SecondFriend->getFriendDecl();

      TypeSourceInfo *FirstTSI = FirstFriend->getFriendType();
      TypeSourceInfo *SecondTSI = SecondFriend->getFriendType();

      if (FirstND && SecondND) {
        ODRDiagDeclError(FirstRecord, FirstModule,
                         FirstFriend->getFriendLoc(),
                         FirstFriend->getSourceRange(), FriendFunction)
            << FirstND;
        ODRDiagDeclNote(SecondModule, SecondFriend->getFriendLoc(),
                        SecondFriend->getSourceRange(), FriendFunction)
            << SecondND;

        Diagnosed = true;
        break;
      }

      if (FirstTSI && SecondTSI) {
        QualType FirstFriendType = FirstTSI->getType();
        QualType SecondFriendType = SecondTSI->getType();
        assert(ComputeQualTypeODRHash(FirstFriendType) !=((void)0)
               ComputeQualTypeODRHash(SecondFriendType))((void)0);
        ODRDiagDeclError(FirstRecord, FirstModule,
                         FirstFriend->getFriendLoc(),
                         FirstFriend->getSourceRange(), FriendType)
            << FirstFriendType;
        ODRDiagDeclNote(SecondModule, SecondFriend->getFriendLoc(),
                        SecondFriend->getSourceRange(), FriendType)
            << SecondFriendType;
        Diagnosed = true;
        break;
      }

      ODRDiagDeclError(FirstRecord, FirstModule, FirstFriend->getFriendLoc(),
                       FirstFriend->getSourceRange(), FriendTypeFunction)
          << (FirstTSI == nullptr);
      ODRDiagDeclNote(SecondModule, SecondFriend->getFriendLoc(),
                      SecondFriend->getSourceRange(), FriendTypeFunction)
          << (SecondTSI == nullptr);

      Diagnosed = true;
      break;
    }
    case FunctionTemplate: {
      FunctionTemplateDecl *FirstTemplate =
          cast<FunctionTemplateDecl>(FirstDecl);
      FunctionTemplateDecl *SecondTemplate =
          cast<FunctionTemplateDecl>(SecondDecl);

      TemplateParameterList *FirstTPL =
          FirstTemplate->getTemplateParameters();
      TemplateParameterList *SecondTPL =
          SecondTemplate->getTemplateParameters();

      if (FirstTPL->size() != SecondTPL->size()) {
        ODRDiagDeclError(FirstRecord, FirstModule,
                         FirstTemplate->getLocation(),
                         FirstTemplate->getSourceRange(),
                         FunctionTemplateDifferentNumberParameters)
            << FirstTemplate << FirstTPL->size();
        ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                        SecondTemplate->getSourceRange(),
                        FunctionTemplateDifferentNumberParameters)
            << SecondTemplate << SecondTPL->size();

        Diagnosed = true;
        break;
      }

      bool ParameterMismatch = false;
      for (unsigned i = 0, e = FirstTPL->size(); i != e; ++i) {
        NamedDecl *FirstParam = FirstTPL->getParam(i);
        NamedDecl *SecondParam = SecondTPL->getParam(i);

        if (FirstParam->getKind() != SecondParam->getKind()) {
          enum {
            TemplateTypeParameter,
            NonTypeTemplateParameter,
            TemplateTemplateParameter,
          };
          auto GetParamType = [](NamedDecl *D) {
            switch (D->getKind()) {
              default:
                llvm_unreachable("Unexpected template parameter type")__builtin_unreachable();
              case Decl::TemplateTypeParm:
                return TemplateTypeParameter;
              case Decl::NonTypeTemplateParm:
                return NonTypeTemplateParameter;
              case Decl::TemplateTemplateParm:
                return TemplateTemplateParameter;
            }
          };

          ODRDiagDeclError(FirstRecord, FirstModule,
                           FirstTemplate->getLocation(),
                           FirstTemplate->getSourceRange(),
                           FunctionTemplateParameterDifferentKind)
              << FirstTemplate << (i + 1) << GetParamType(FirstParam);
          ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                          SecondTemplate->getSourceRange(),
                          FunctionTemplateParameterDifferentKind)
              << SecondTemplate << (i + 1) << GetParamType(SecondParam);

          ParameterMismatch = true;
          break;
        }

        if (FirstParam->getName() != SecondParam->getName()) {
          ODRDiagDeclError(
              FirstRecord, FirstModule, FirstTemplate->getLocation(),
              FirstTemplate->getSourceRange(), FunctionTemplateParameterName)
              << FirstTemplate << (i + 1) << (bool)FirstParam->getIdentifier()
              << FirstParam;
          ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                          SecondTemplate->getSourceRange(),
                          FunctionTemplateParameterName)
              << SecondTemplate << (i + 1)
              << (bool)SecondParam->getIdentifier() << SecondParam;
          ParameterMismatch = true;
          break;
        }

        if (isa<TemplateTypeParmDecl>(FirstParam) &&
            isa<TemplateTypeParmDecl>(SecondParam)) {
          TemplateTypeParmDecl *FirstTTPD =
              cast<TemplateTypeParmDecl>(FirstParam);
          TemplateTypeParmDecl *SecondTTPD =
              cast<TemplateTypeParmDecl>(SecondParam);
          bool HasFirstDefaultArgument =
              FirstTTPD->hasDefaultArgument() &&
              !FirstTTPD->defaultArgumentWasInherited();
          bool HasSecondDefaultArgument =
              SecondTTPD->hasDefaultArgument() &&
              !SecondTTPD->defaultArgumentWasInherited();
          if (HasFirstDefaultArgument != HasSecondDefaultArgument) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplateParameterSingleDefaultArgument)
                << FirstTemplate << (i + 1) << HasFirstDefaultArgument;
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplateParameterSingleDefaultArgument)
                << SecondTemplate << (i + 1) << HasSecondDefaultArgument;
            ParameterMismatch = true;
            break;
          }

          if (HasFirstDefaultArgument && HasSecondDefaultArgument) {
            QualType FirstType = FirstTTPD->getDefaultArgument();
            QualType SecondType = SecondTTPD->getDefaultArgument();
            if (ComputeQualTypeODRHash(FirstType) !=
                ComputeQualTypeODRHash(SecondType)) {
              ODRDiagDeclError(
                  FirstRecord, FirstModule, FirstTemplate->getLocation(),
                  FirstTemplate->getSourceRange(),
                  FunctionTemplateParameterDifferentDefaultArgument)
                  << FirstTemplate << (i + 1) << FirstType;
              ODRDiagDeclNote(
                  SecondModule, SecondTemplate->getLocation(),
                  SecondTemplate->getSourceRange(),
                  FunctionTemplateParameterDifferentDefaultArgument)
                  << SecondTemplate << (i + 1) << SecondType;
              ParameterMismatch = true;
              break;
            }
          }

          if (FirstTTPD->isParameterPack() !=
              SecondTTPD->isParameterPack()) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplatePackParameter)
                << FirstTemplate << (i + 1) << FirstTTPD->isParameterPack();
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplatePackParameter)
                << SecondTemplate << (i + 1) << SecondTTPD->isParameterPack();
            ParameterMismatch = true;
            break;
          }
        }

        if (isa<TemplateTemplateParmDecl>(FirstParam) &&
            isa<TemplateTemplateParmDecl>(SecondParam)) {
          TemplateTemplateParmDecl *FirstTTPD =
              cast<TemplateTemplateParmDecl>(FirstParam);
          TemplateTemplateParmDecl *SecondTTPD =
              cast<TemplateTemplateParmDecl>(SecondParam);

          TemplateParameterList *FirstTPL =
              FirstTTPD->getTemplateParameters();
          TemplateParameterList *SecondTPL =
              SecondTTPD->getTemplateParameters();

          if (ComputeTemplateParameterListODRHash(FirstTPL) !=
              ComputeTemplateParameterListODRHash(SecondTPL)) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplateParameterDifferentType)
                << FirstTemplate << (i + 1);
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplateParameterDifferentType)
                << SecondTemplate << (i + 1);
            ParameterMismatch = true;
            break;
          }

          bool HasFirstDefaultArgument =
              FirstTTPD->hasDefaultArgument() &&
              !FirstTTPD->defaultArgumentWasInherited();
          bool HasSecondDefaultArgument =
              SecondTTPD->hasDefaultArgument() &&
              !SecondTTPD->defaultArgumentWasInherited();
          if (HasFirstDefaultArgument != HasSecondDefaultArgument) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplateParameterSingleDefaultArgument)
                << FirstTemplate << (i + 1) << HasFirstDefaultArgument;
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplateParameterSingleDefaultArgument)
                << SecondTemplate << (i + 1) << HasSecondDefaultArgument;
            ParameterMismatch = true;
            break;
          }

          if (HasFirstDefaultArgument && HasSecondDefaultArgument) {
            TemplateArgument FirstTA =
                FirstTTPD->getDefaultArgument().getArgument();
            TemplateArgument SecondTA =
                SecondTTPD->getDefaultArgument().getArgument();
            if (ComputeTemplateArgumentODRHash(FirstTA) !=
                ComputeTemplateArgumentODRHash(SecondTA)) {
              ODRDiagDeclError(
                  FirstRecord, FirstModule, FirstTemplate->getLocation(),
                  FirstTemplate->getSourceRange(),
                  FunctionTemplateParameterDifferentDefaultArgument)
                  << FirstTemplate << (i + 1) << FirstTA;
              ODRDiagDeclNote(
                  SecondModule, SecondTemplate->getLocation(),
                  SecondTemplate->getSourceRange(),
                  FunctionTemplateParameterDifferentDefaultArgument)
                  << SecondTemplate << (i + 1) << SecondTA;
              ParameterMismatch = true;
              break;
            }
          }

          if (FirstTTPD->isParameterPack() !=
              SecondTTPD->isParameterPack()) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplatePackParameter)
                << FirstTemplate << (i + 1) << FirstTTPD->isParameterPack();
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplatePackParameter)
                << SecondTemplate << (i + 1) << SecondTTPD->isParameterPack();
            ParameterMismatch = true;
            break;
          }
        }

        if (isa<NonTypeTemplateParmDecl>(FirstParam) &&
            isa<NonTypeTemplateParmDecl>(SecondParam)) {
          NonTypeTemplateParmDecl *FirstNTTPD =
              cast<NonTypeTemplateParmDecl>(FirstParam);
          NonTypeTemplateParmDecl *SecondNTTPD =
              cast<NonTypeTemplateParmDecl>(SecondParam);

          QualType FirstType = FirstNTTPD->getType();
          QualType SecondType = SecondNTTPD->getType();
          if (ComputeQualTypeODRHash(FirstType) !=
              ComputeQualTypeODRHash(SecondType)) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplateParameterDifferentType)
                << FirstTemplate << (i + 1);
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplateParameterDifferentType)
                << SecondTemplate << (i + 1);
            ParameterMismatch = true;
            break;
          }

          bool HasFirstDefaultArgument =
              FirstNTTPD->hasDefaultArgument() &&
              !FirstNTTPD->defaultArgumentWasInherited();
          bool HasSecondDefaultArgument =
              SecondNTTPD->hasDefaultArgument() &&
              !SecondNTTPD->defaultArgumentWasInherited();
          if (HasFirstDefaultArgument != HasSecondDefaultArgument) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplateParameterSingleDefaultArgument)
                << FirstTemplate << (i + 1) << HasFirstDefaultArgument;
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplateParameterSingleDefaultArgument)
                << SecondTemplate << (i + 1) << HasSecondDefaultArgument;
            ParameterMismatch = true;
            break;
          }

          if (HasFirstDefaultArgument && HasSecondDefaultArgument) {
            Expr *FirstDefaultArgument = FirstNTTPD->getDefaultArgument();
            Expr *SecondDefaultArgument = SecondNTTPD->getDefaultArgument();
            if (ComputeODRHash(FirstDefaultArgument) !=
                ComputeODRHash(SecondDefaultArgument)) {
              ODRDiagDeclError(
                  FirstRecord, FirstModule, FirstTemplate->getLocation(),
                  FirstTemplate->getSourceRange(),
                  FunctionTemplateParameterDifferentDefaultArgument)
                  << FirstTemplate << (i + 1) << FirstDefaultArgument;
              ODRDiagDeclNote(
                  SecondModule, SecondTemplate->getLocation(),
                  SecondTemplate->getSourceRange(),
                  FunctionTemplateParameterDifferentDefaultArgument)
                  << SecondTemplate << (i + 1) << SecondDefaultArgument;
              ParameterMismatch = true;
              break;
            }
          }

          if (FirstNTTPD->isParameterPack() !=
              SecondNTTPD->isParameterPack()) {
            ODRDiagDeclError(FirstRecord, FirstModule,
                             FirstTemplate->getLocation(),
                             FirstTemplate->getSourceRange(),
                             FunctionTemplatePackParameter)
                << FirstTemplate << (i + 1) << FirstNTTPD->isParameterPack();
            ODRDiagDeclNote(SecondModule, SecondTemplate->getLocation(),
                            SecondTemplate->getSourceRange(),
                            FunctionTemplatePackParameter)
                << SecondTemplate << (i + 1)
                << SecondNTTPD->isParameterPack();
            ParameterMismatch = true;
            break;
          }
        }
      }

      if (ParameterMismatch) {
        Diagnosed = true;
        break;
      }

      break;
    }
    }

    if (Diagnosed)
      continue;

    Diag(FirstDecl->getLocation(),
         diag::err_module_odr_violation_mismatch_decl_unknown)
        << FirstRecord << FirstModule.empty() << FirstModule << FirstDiffType
        << FirstDecl->getSourceRange();
    Diag(SecondDecl->getLocation(),
         diag::note_module_odr_violation_mismatch_decl_unknown)
        << SecondModule << FirstDiffType << SecondDecl->getSourceRange();
    Diagnosed = true;
  }

  if (!Diagnosed) {
    // All definitions are updates to the same declaration. This happens if a
    // module instantiates the declaration of a class template specialization
    // and two or more other modules instantiate its definition.
    //
    // FIXME: Indicate which modules had instantiations of this definition.
    // FIXME: How can this even happen?
    Diag(Merge.first->getLocation(),
         diag::err_module_odr_violation_different_instantiations)
      << Merge.first;
  }
}

// Issue ODR failures diagnostics for functions.
for (auto &Merge : FunctionOdrMergeFailures) {
  enum ODRFunctionDifference {
    ReturnType,
    ParameterName,
    ParameterType,
    ParameterSingleDefaultArgument,
    ParameterDifferentDefaultArgument,
    FunctionBody,
  };

  FunctionDecl *FirstFunction = Merge.first;
  std::string FirstModule = getOwningModuleNameForDiagnostic(FirstFunction);

  bool Diagnosed = false;
  for (auto &SecondFunction : Merge.second) {

    if (FirstFunction == SecondFunction)
      continue;

    std::string SecondModule =
        getOwningModuleNameForDiagnostic(SecondFunction);

    auto ODRDiagError = [FirstFunction, &FirstModule,
                         this](SourceLocation Loc, SourceRange Range,
                               ODRFunctionDifference DiffType) {
      return Diag(Loc, diag::err_module_odr_violation_function)
             << FirstFunction << FirstModule.empty() << FirstModule << Range
             << DiffType;
    };
    auto ODRDiagNote = [&SecondModule, this](SourceLocation Loc,
                                             SourceRange Range,
                                             ODRFunctionDifference DiffType) {
      return Diag(Loc, diag::note_module_odr_violation_function)
             << SecondModule << Range << DiffType;
    };

    if (ComputeQualTypeODRHash(FirstFunction->getReturnType()) !=
        ComputeQualTypeODRHash(SecondFunction->getReturnType())) {
      ODRDiagError(FirstFunction->getReturnTypeSourceRange().getBegin(),
                   FirstFunction->getReturnTypeSourceRange(), ReturnType)
          << FirstFunction->getReturnType();
      ODRDiagNote(SecondFunction->getReturnTypeSourceRange().getBegin(),
                  SecondFunction->getReturnTypeSourceRange(), ReturnType)
          << SecondFunction->getReturnType();
      Diagnosed = true;
      break;
    }

    assert(FirstFunction->param_size() == SecondFunction->param_size() &&((void)0)
           "Merged functions with different number of parameters")((void)0);

    auto ParamSize = FirstFunction->param_size();
    bool ParameterMismatch = false;
    for (unsigned I = 0; I < ParamSize; ++I) {
      auto *FirstParam = FirstFunction->getParamDecl(I);
      auto *SecondParam = SecondFunction->getParamDecl(I);

      assert(getContext().hasSameType(FirstParam->getType(),((void)0)
                                    SecondParam->getType()) &&((void)0)
             "Merged function has different parameter types.")((void)0);

      if (FirstParam->getDeclName() != SecondParam->getDeclName()) {
        ODRDiagError(FirstParam->getLocation(), FirstParam->getSourceRange(),
                     ParameterName)
            << I + 1 << FirstParam->getDeclName();
        ODRDiagNote(SecondParam->getLocation(), SecondParam->getSourceRange(),
                    ParameterName)
            << I + 1 << SecondParam->getDeclName();
        ParameterMismatch = true;
        break;
      };

      QualType FirstParamType = FirstParam->getType();
      QualType SecondParamType = SecondParam->getType();
      if (FirstParamType != SecondParamType &&
          ComputeQualTypeODRHash(FirstParamType) !=
              ComputeQualTypeODRHash(SecondParamType)) {
        if (const DecayedType *ParamDecayedType =
                FirstParamType->getAs<DecayedType>()) {
          ODRDiagError(FirstParam->getLocation(),
                       FirstParam->getSourceRange(), ParameterType)
              << (I + 1) << FirstParamType << true
              << ParamDecayedType->getOriginalType();
        } else {
          ODRDiagError(FirstParam->getLocation(),
                       FirstParam->getSourceRange(), ParameterType)
              << (I + 1) << FirstParamType << false;
        }

        if (const DecayedType *ParamDecayedType =
                SecondParamType->getAs<DecayedType>()) {
          ODRDiagNote(SecondParam->getLocation(),
                      SecondParam->getSourceRange(), ParameterType)
              << (I + 1) << SecondParamType << true
              << ParamDecayedType->getOriginalType();
        } else {
          ODRDiagNote(SecondParam->getLocation(),
                      SecondParam->getSourceRange(), ParameterType)
              << (I + 1) << SecondParamType << false;
        }
        ParameterMismatch = true;
        break;
      }

      const Expr *FirstInit = FirstParam->getInit();
      const Expr *SecondInit = SecondParam->getInit();
      if ((FirstInit == nullptr) != (SecondInit == nullptr)) {
        ODRDiagError(FirstParam->getLocation(), FirstParam->getSourceRange(),
                     ParameterSingleDefaultArgument)
            << (I + 1) << (FirstInit == nullptr)
            << (FirstInit ? FirstInit->getSourceRange() : SourceRange());
        ODRDiagNote(SecondParam->getLocation(), SecondParam->getSourceRange(),
                    ParameterSingleDefaultArgument)
            << (I + 1) << (SecondInit == nullptr)
            << (SecondInit ? SecondInit->getSourceRange() : SourceRange());
        ParameterMismatch = true;
        break;
      }

      if (FirstInit && SecondInit &&
          ComputeODRHash(FirstInit) != ComputeODRHash(SecondInit)) {
        ODRDiagError(FirstParam->getLocation(), FirstParam->getSourceRange(),
                     ParameterDifferentDefaultArgument)
            << (I + 1) << FirstInit->getSourceRange();
        ODRDiagNote(SecondParam->getLocation(), SecondParam->getSourceRange(),
                    ParameterDifferentDefaultArgument)
            << (I + 1) << SecondInit->getSourceRange();
        ParameterMismatch = true;
        break;
      }

      assert(ComputeSubDeclODRHash(FirstParam) ==((void)0)
                 ComputeSubDeclODRHash(SecondParam) &&((void)0)
             "Undiagnosed parameter difference.")((void)0);
    }

    if (ParameterMismatch) {
      Diagnosed = true;
      break;
    }

    // If no error has been generated before now, assume the problem is in
    // the body and generate a message.
    ODRDiagError(FirstFunction->getLocation(),
                 FirstFunction->getSourceRange(), FunctionBody);
    ODRDiagNote(SecondFunction->getLocation(),
                SecondFunction->getSourceRange(), FunctionBody);
    Diagnosed = true;
    break;
  }
  (void)Diagnosed;
  assert(Diagnosed && "Unable to emit ODR diagnostic.")((void)0);
}

// Issue ODR failures diagnostics for enums.
for (auto &Merge : EnumOdrMergeFailures) {
  enum ODREnumDifference {
    SingleScopedEnum,
    EnumTagKeywordMismatch,
    SingleSpecifiedType,
    DifferentSpecifiedTypes,
    DifferentNumberEnumConstants,
    EnumConstantName,
    EnumConstantSingleInitilizer,
    EnumConstantDifferentInitilizer,
  };

  // If we've already pointed out a specific problem with this enum, don't
  // bother issuing a general "something's different" diagnostic.
  if (!DiagnosedOdrMergeFailures.insert(Merge.first).second)
    continue;

  EnumDecl *FirstEnum = Merge.first;
  std::string FirstModule = getOwningModuleNameForDiagnostic(FirstEnum);

  using DeclHashes =
      llvm::SmallVector<std::pair<EnumConstantDecl *, unsigned>, 4>;
  auto PopulateHashes = [&ComputeSubDeclODRHash, FirstEnum](
                            DeclHashes &Hashes, EnumDecl *Enum) {
    for (auto *D : Enum->decls()) {
      // Due to decl merging, the first EnumDecl is the parent of
      // Decls in both records.
      if (!ODRHash::isDeclToBeProcessed(D, FirstEnum))
        continue;
      assert(isa<EnumConstantDecl>(D) && "Unexpected Decl kind")((void)0);
      Hashes.emplace_back(cast<EnumConstantDecl>(D),
                          ComputeSubDeclODRHash(D));
    }
  };
  DeclHashes FirstHashes;
  PopulateHashes(FirstHashes, FirstEnum);
  bool Diagnosed = false;
  for (auto &SecondEnum : Merge.second) {

    if (FirstEnum == SecondEnum)
      continue;

    std::string SecondModule =
        getOwningModuleNameForDiagnostic(SecondEnum);

    auto ODRDiagError = [FirstEnum, &FirstModule,
                         this](SourceLocation Loc, SourceRange Range,
                               ODREnumDifference DiffType) {
      return Diag(Loc, diag::err_module_odr_violation_enum)
             << FirstEnum << FirstModule.empty() << FirstModule << Range
             << DiffType;
    };
    auto ODRDiagNote = [&SecondModule, this](SourceLocation Loc,
                                             SourceRange Range,
                                             ODREnumDifference DiffType) {
      return Diag(Loc, diag::note_module_odr_violation_enum)
             << SecondModule << Range << DiffType;
    };

    if (FirstEnum->isScoped() != SecondEnum->isScoped()) {
      ODRDiagError(FirstEnum->getLocation(), FirstEnum->getSourceRange(),
                   SingleScopedEnum)
          << FirstEnum->isScoped();
      ODRDiagNote(SecondEnum->getLocation(), SecondEnum->getSourceRange(),
                  SingleScopedEnum)
          << SecondEnum->isScoped();
      Diagnosed = true;
      continue;
    }

    if (FirstEnum->isScoped() && SecondEnum->isScoped()) {
      if (FirstEnum->isScopedUsingClassTag() !=
          SecondEnum->isScopedUsingClassTag()) {
        ODRDiagError(FirstEnum->getLocation(), FirstEnum->getSourceRange(),
                     EnumTagKeywordMismatch)
            << FirstEnum->isScopedUsingClassTag();
        ODRDiagNote(SecondEnum->getLocation(), SecondEnum->getSourceRange(),
                    EnumTagKeywordMismatch)
            << SecondEnum->isScopedUsingClassTag();
        Diagnosed = true;
        continue;
      }
    }

    QualType FirstUnderlyingType =
        FirstEnum->getIntegerTypeSourceInfo()
            ? FirstEnum->getIntegerTypeSourceInfo()->getType()
            : QualType();
    QualType SecondUnderlyingType =
        SecondEnum->getIntegerTypeSourceInfo()
            ? SecondEnum->getIntegerTypeSourceInfo()->getType()
            : QualType();
    if (FirstUnderlyingType.isNull() != SecondUnderlyingType.isNull()) {
        ODRDiagError(FirstEnum->getLocation(), FirstEnum->getSourceRange(),
                     SingleSpecifiedType)
            << !FirstUnderlyingType.isNull();
        ODRDiagNote(SecondEnum->getLocation(), SecondEnum->getSourceRange(),
                    SingleSpecifiedType)
            << !SecondUnderlyingType.isNull();
        Diagnosed = true;
        continue;
    }

    if (!FirstUnderlyingType.isNull() && !SecondUnderlyingType.isNull()) {
      if (ComputeQualTypeODRHash(FirstUnderlyingType) !=
          ComputeQualTypeODRHash(SecondUnderlyingType)) {
        ODRDiagError(FirstEnum->getLocation(), FirstEnum->getSourceRange(),
                     DifferentSpecifiedTypes)
            << FirstUnderlyingType;
        ODRDiagNote(SecondEnum->getLocation(), SecondEnum->getSourceRange(),
                    DifferentSpecifiedTypes)
            << SecondUnderlyingType;
        Diagnosed = true;
        continue;
      }
    }

    DeclHashes SecondHashes;
    PopulateHashes(SecondHashes, SecondEnum);

    if (FirstHashes.size() != SecondHashes.size()) {
      ODRDiagError(FirstEnum->getLocation(), FirstEnum->getSourceRange(),
                   DifferentNumberEnumConstants)
          << (int)FirstHashes.size();
      ODRDiagNote(SecondEnum->getLocation(), SecondEnum->getSourceRange(),
                  DifferentNumberEnumConstants)
          << (int)SecondHashes.size();
      Diagnosed = true;
      continue;
    }

    for (unsigned I = 0; I < FirstHashes.size(); ++I) {
      if (FirstHashes[I].second == SecondHashes[I].second)
        continue;
      const EnumConstantDecl *FirstEnumConstant = FirstHashes[I].first;
      const EnumConstantDecl *SecondEnumConstant = SecondHashes[I].first;

      if (FirstEnumConstant->getDeclName() !=
          SecondEnumConstant->getDeclName()) {

        ODRDiagError(FirstEnumConstant->getLocation(),
                     FirstEnumConstant->getSourceRange(), EnumConstantName)
            << I + 1 << FirstEnumConstant;
        ODRDiagNote(SecondEnumConstant->getLocation(),
                    SecondEnumConstant->getSourceRange(), EnumConstantName)
            << I + 1 << SecondEnumConstant;
        Diagnosed = true;
        break;
      }

      const Expr *FirstInit = FirstEnumConstant->getInitExpr();
      const Expr *SecondInit = SecondEnumConstant->getInitExpr();
      if (!FirstInit && !SecondInit)
        continue;

      if (!FirstInit || !SecondInit) {
        ODRDiagError(FirstEnumConstant->getLocation(),
                     FirstEnumConstant->getSourceRange(),
                     EnumConstantSingleInitilizer)
            << I + 1 << FirstEnumConstant << (FirstInit != nullptr);
        ODRDiagNote(SecondEnumConstant->getLocation(),
                    SecondEnumConstant->getSourceRange(),
                    EnumConstantSingleInitilizer)
            << I + 1 << SecondEnumConstant << (SecondInit != nullptr);
        Diagnosed = true;
        break;
      }

      if (ComputeODRHash(FirstInit) != ComputeODRHash(SecondInit)) {
        ODRDiagError(FirstEnumConstant->getLocation(),
                     FirstEnumConstant->getSourceRange(),
                     EnumConstantDifferentInitilizer)
            << I + 1 << FirstEnumConstant;
        ODRDiagNote(SecondEnumConstant->getLocation(),
                    SecondEnumConstant->getSourceRange(),
                    EnumConstantDifferentInitilizer)
            << I + 1 << SecondEnumConstant;
        Diagnosed = true;
        break;
      }
    }
  }

  (void)Diagnosed;
  assert(Diagnosed && "Unable to emit ODR diagnostic.")((void)0);
}
11561}

11563void ASTReader::StartedDeserializing() {
if (++NumCurrentElementsDeserializing == 1 && ReadTimer.get())
  ReadTimer->startTimer();
11566}

11568void ASTReader::FinishedDeserializing() {
assert(NumCurrentElementsDeserializing &&((void)0)
       "FinishedDeserializing not paired with StartedDeserializing")((void)0);
if (NumCurrentElementsDeserializing == 1) {
  // We decrease NumCurrentElementsDeserializing only after pending actions
  // are finished, to avoid recursively re-calling finishPendingActions().
  finishPendingActions();
}
--NumCurrentElementsDeserializing;

if (NumCurrentElementsDeserializing == 0) {
  // Propagate exception specification and deduced type updates along
  // redeclaration chains.
  //
  // We do this now rather than in finishPendingActions because we want to
  // be able to walk the complete redeclaration chains of the updated decls.
  while (!PendingExceptionSpecUpdates.empty() ||
         !PendingDeducedTypeUpdates.empty()) {
    auto ESUpdates = std::move(PendingExceptionSpecUpdates);
    PendingExceptionSpecUpdates.clear();
    for (auto Update : ESUpdates) {
      ProcessingUpdatesRAIIObj ProcessingUpdates(*this);
      auto *FPT = Update.second->getType()->castAs<FunctionProtoType>();
      auto ESI = FPT->getExtProtoInfo().ExceptionSpec;
      if (auto *Listener = getContext().getASTMutationListener())
        Listener->ResolvedExceptionSpec(cast<FunctionDecl>(Update.second));
      for (auto *Redecl : Update.second->redecls())
        getContext().adjustExceptionSpec(cast<FunctionDecl>(Redecl), ESI);
    }

    auto DTUpdates = std::move(PendingDeducedTypeUpdates);
    PendingDeducedTypeUpdates.clear();
    for (auto Update : DTUpdates) {
      ProcessingUpdatesRAIIObj ProcessingUpdates(*this);
      // FIXME: If the return type is already deduced, check that it matches.
      getContext().adjustDeducedFunctionResultType(Update.first,
                                                   Update.second);
    }
  }

  if (ReadTimer)
    ReadTimer->stopTimer();

  diagnoseOdrViolations();

  // We are not in recursive loading, so it's safe to pass the "interesting"
  // decls to the consumer.
  if (Consumer)
    PassInterestingDeclsToConsumer();
}
11618}

11620void ASTReader::pushExternalDeclIntoScope(NamedDecl *D, DeclarationName Name) {
if (IdentifierInfo *II = Name.getAsIdentifierInfo()) {
  // Remove any fake results before adding any real ones.
  auto It = PendingFakeLookupResults.find(II);
  if (It != PendingFakeLookupResults.end()) {
    for (auto *ND : It->second)
      SemaObj->IdResolver.RemoveDecl(ND);
    // FIXME: this works around module+PCH performance issue.
    // Rather than erase the result from the map, which is O(n), just clear
    // the vector of NamedDecls.
    It->second.clear();
  }
}

if (SemaObj->IdResolver.tryAddTopLevelDecl(D, Name) && SemaObj->TUScope) {
  SemaObj->TUScope->AddDecl(D);
} else if (SemaObj->TUScope) {
  // Adding the decl to IdResolver may have failed because it was already in
  // (even though it was not added in scope). If it is already in, make sure
  // it gets in the scope as well.
  if (std::find(SemaObj->IdResolver.begin(Name),
                SemaObj->IdResolver.end(), D) != SemaObj->IdResolver.end())
    SemaObj->TUScope->AddDecl(D);
}
11644}

11646ASTReader::ASTReader(Preprocessor &PP, InMemoryModuleCache &ModuleCache,
                   ASTContext *Context,
                   const PCHContainerReader &PCHContainerRdr,
                   ArrayRef<std::shared_ptr<ModuleFileExtension>> Extensions,
                   StringRef isysroot,
                   DisableValidationForModuleKind DisableValidationKind,
                   bool AllowASTWithCompilerErrors,
                   bool AllowConfigurationMismatch, bool ValidateSystemInputs,
                   bool ValidateASTInputFilesContent, bool UseGlobalIndex,
                   std::unique_ptr<llvm::Timer> ReadTimer)
  : Listener(bool(DisableValidationKind &DisableValidationForModuleKind::PCH)
                 ? cast<ASTReaderListener>(new SimpleASTReaderListener(PP))
                 : cast<ASTReaderListener>(new PCHValidator(PP, *this))),
    SourceMgr(PP.getSourceManager()), FileMgr(PP.getFileManager()),
    PCHContainerRdr(PCHContainerRdr), Diags(PP.getDiagnostics()), PP(PP),
    ContextObj(Context), ModuleMgr(PP.getFileManager(), ModuleCache,
                                   PCHContainerRdr, PP.getHeaderSearchInfo()),
    DummyIdResolver(PP), ReadTimer(std::move(ReadTimer)), isysroot(isysroot),
    DisableValidationKind(DisableValidationKind),
    AllowASTWithCompilerErrors(AllowASTWithCompilerErrors),
    AllowConfigurationMismatch(AllowConfigurationMismatch),
    ValidateSystemInputs(ValidateSystemInputs),
    ValidateASTInputFilesContent(ValidateASTInputFilesContent),
    UseGlobalIndex(UseGlobalIndex), CurrSwitchCaseStmts(&SwitchCaseStmts) {
SourceMgr.setExternalSLocEntrySource(this);

for (const auto &Ext : Extensions) {
  auto BlockName = Ext->getExtensionMetadata().BlockName;
  auto Known = ModuleFileExtensions.find(BlockName);
  if (Known != ModuleFileExtensions.end()) {
    Diags.Report(diag::warn_duplicate_module_file_extension)
      << BlockName;
    continue;
  }

  ModuleFileExtensions.insert({BlockName, Ext});
}
11683}

11685ASTReader::~ASTReader() {
if (OwnsDeserializationListener)
  delete DeserializationListener;
11688}

11690IdentifierResolver &ASTReader::getIdResolver() {
return SemaObj ? SemaObj->IdResolver : DummyIdResolver;
11692}

11694Expected<unsigned> ASTRecordReader::readRecord(llvm::BitstreamCursor &Cursor,
                                             unsigned AbbrevID) {
Idx = 0;
Record.clear();
return Cursor.readRecord(AbbrevID, Record);
11699}
11700//===----------------------------------------------------------------------===//
11701//// OMPClauseReader implementation
11702////===----------------------------------------------------------------------===//

11704// This has to be in namespace clang because it's friended by all
11705// of the OMP clauses.
11706namespace clang {

11708class OMPClauseReader : public OMPClauseVisitor<OMPClauseReader> {
ASTRecordReader &Record;
ASTContext &Context;

11712public:
OMPClauseReader(ASTRecordReader &Record)
    : Record(Record), Context(Record.getContext()) {}
11715#define GEN_CLANG_CLAUSE_CLASS
11716#define CLAUSE_CLASS(Enum, Str, Class) void Visit##Class(Class *C);
11717#include "llvm/Frontend/OpenMP/OMP.inc"
OMPClause *readClause();
void VisitOMPClauseWithPreInit(OMPClauseWithPreInit *C);
void VisitOMPClauseWithPostUpdate(OMPClauseWithPostUpdate *C);
11721};

11723} // end namespace clang

11725OMPClause *ASTRecordReader::readOMPClause() {
return OMPClauseReader(*this).readClause();
11727}

11729OMPClause *OMPClauseReader::readClause() {
OMPClause *C = nullptr;
switch (llvm::omp::Clause(Record.readInt())) {
case llvm::omp::OMPC_if:
  C = new (Context) OMPIfClause();
  break;
case llvm::omp::OMPC_final:
  C = new (Context) OMPFinalClause();
  break;
case llvm::omp::OMPC_num_threads:
  C = new (Context) OMPNumThreadsClause();
  break;
case llvm::omp::OMPC_safelen:
  C = new (Context) OMPSafelenClause();
  break;
case llvm::omp::OMPC_simdlen:
  C = new (Context) OMPSimdlenClause();
  break;
case llvm::omp::OMPC_sizes: {
  unsigned NumSizes = Record.readInt();
  C = OMPSizesClause::CreateEmpty(Context, NumSizes);
  break;
}
case llvm::omp::OMPC_full:
  C = OMPFullClause::CreateEmpty(Context);
  break;
case llvm::omp::OMPC_partial:
  C = OMPPartialClause::CreateEmpty(Context);
  break;
case llvm::omp::OMPC_allocator:
  C = new (Context) OMPAllocatorClause();
  break;
case llvm::omp::OMPC_collapse:
  C = new (Context) OMPCollapseClause();
  break;
case llvm::omp::OMPC_default:
  C = new (Context) OMPDefaultClause();
  break;
case llvm::omp::OMPC_proc_bind:
  C = new (Context) OMPProcBindClause();
  break;
case llvm::omp::OMPC_schedule:
  C = new (Context) OMPScheduleClause();
  break;
case llvm::omp::OMPC_ordered:
  C = OMPOrderedClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_nowait:
  C = new (Context) OMPNowaitClause();
  break;
case llvm::omp::OMPC_untied:
  C = new (Context) OMPUntiedClause();
  break;
case llvm::omp::OMPC_mergeable:
  C = new (Context) OMPMergeableClause();
  break;
case llvm::omp::OMPC_read:
  C = new (Context) OMPReadClause();
  break;
case llvm::omp::OMPC_write:
  C = new (Context) OMPWriteClause();
  break;
case llvm::omp::OMPC_update:
  C = OMPUpdateClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_capture:
  C = new (Context) OMPCaptureClause();
  break;
case llvm::omp::OMPC_seq_cst:
  C = new (Context) OMPSeqCstClause();
  break;
case llvm::omp::OMPC_acq_rel:
  C = new (Context) OMPAcqRelClause();
  break;
case llvm::omp::OMPC_acquire:
  C = new (Context) OMPAcquireClause();
  break;
case llvm::omp::OMPC_release:
  C = new (Context) OMPReleaseClause();
  break;
case llvm::omp::OMPC_relaxed:
  C = new (Context) OMPRelaxedClause();
  break;
case llvm::omp::OMPC_threads:
  C = new (Context) OMPThreadsClause();
  break;
case llvm::omp::OMPC_simd:
  C = new (Context) OMPSIMDClause();
  break;
case llvm::omp::OMPC_nogroup:
  C = new (Context) OMPNogroupClause();
  break;
case llvm::omp::OMPC_unified_address:
  C = new (Context) OMPUnifiedAddressClause();
  break;
case llvm::omp::OMPC_unified_shared_memory:
  C = new (Context) OMPUnifiedSharedMemoryClause();
  break;
case llvm::omp::OMPC_reverse_offload:
  C = new (Context) OMPReverseOffloadClause();
  break;
case llvm::omp::OMPC_dynamic_allocators:
  C = new (Context) OMPDynamicAllocatorsClause();
  break;
case llvm::omp::OMPC_atomic_default_mem_order:
  C = new (Context) OMPAtomicDefaultMemOrderClause();
  break;
case llvm::omp::OMPC_private:
  C = OMPPrivateClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_firstprivate:
  C = OMPFirstprivateClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_lastprivate:
  C = OMPLastprivateClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_shared:
  C = OMPSharedClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_reduction: {
  unsigned N = Record.readInt();
  auto Modifier = Record.readEnum<OpenMPReductionClauseModifier>();
  C = OMPReductionClause::CreateEmpty(Context, N, Modifier);
  break;
}
case llvm::omp::OMPC_task_reduction:
  C = OMPTaskReductionClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_in_reduction:
  C = OMPInReductionClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_linear:
  C = OMPLinearClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_aligned:
  C = OMPAlignedClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_copyin:
  C = OMPCopyinClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_copyprivate:
  C = OMPCopyprivateClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_flush:
  C = OMPFlushClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_depobj:
  C = OMPDepobjClause::CreateEmpty(Context);
  break;
case llvm::omp::OMPC_depend: {
  unsigned NumVars = Record.readInt();
  unsigned NumLoops = Record.readInt();
  C = OMPDependClause::CreateEmpty(Context, NumVars, NumLoops);
  break;
}
case llvm::omp::OMPC_device:
  C = new (Context) OMPDeviceClause();
  break;
case llvm::omp::OMPC_map: {
  OMPMappableExprListSizeTy Sizes;
  Sizes.NumVars = Record.readInt();
  Sizes.NumUniqueDeclarations = Record.readInt();
  Sizes.NumComponentLists = Record.readInt();
  Sizes.NumComponents = Record.readInt();
  C = OMPMapClause::CreateEmpty(Context, Sizes);
  break;
}
case llvm::omp::OMPC_num_teams:
  C = new (Context) OMPNumTeamsClause();
  break;
case llvm::omp::OMPC_thread_limit:
  C = new (Context) OMPThreadLimitClause();
  break;
case llvm::omp::OMPC_priority:
  C = new (Context) OMPPriorityClause();
  break;
case llvm::omp::OMPC_grainsize:
  C = new (Context) OMPGrainsizeClause();
  break;
case llvm::omp::OMPC_num_tasks:
  C = new (Context) OMPNumTasksClause();
  break;
case llvm::omp::OMPC_hint:
  C = new (Context) OMPHintClause();
  break;
case llvm::omp::OMPC_dist_schedule:
  C = new (Context) OMPDistScheduleClause();
  break;
case llvm::omp::OMPC_defaultmap:
  C = new (Context) OMPDefaultmapClause();
  break;
case llvm::omp::OMPC_to: {
  OMPMappableExprListSizeTy Sizes;
  Sizes.NumVars = Record.readInt();
  Sizes.NumUniqueDeclarations = Record.readInt();
  Sizes.NumComponentLists = Record.readInt();
  Sizes.NumComponents = Record.readInt();
  C = OMPToClause::CreateEmpty(Context, Sizes);
  break;
}
case llvm::omp::OMPC_from: {
  OMPMappableExprListSizeTy Sizes;
  Sizes.NumVars = Record.readInt();
  Sizes.NumUniqueDeclarations = Record.readInt();
  Sizes.NumComponentLists = Record.readInt();
  Sizes.NumComponents = Record.readInt();
  C = OMPFromClause::CreateEmpty(Context, Sizes);
  break;
}
case llvm::omp::OMPC_use_device_ptr: {
  OMPMappableExprListSizeTy Sizes;
  Sizes.NumVars = Record.readInt();
  Sizes.NumUniqueDeclarations = Record.readInt();
  Sizes.NumComponentLists = Record.readInt();
  Sizes.NumComponents = Record.readInt();
  C = OMPUseDevicePtrClause::CreateEmpty(Context, Sizes);
  break;
}
case llvm::omp::OMPC_use_device_addr: {
  OMPMappableExprListSizeTy Sizes;
  Sizes.NumVars = Record.readInt();
  Sizes.NumUniqueDeclarations = Record.readInt();
  Sizes.NumComponentLists = Record.readInt();
  Sizes.NumComponents = Record.readInt();
  C = OMPUseDeviceAddrClause::CreateEmpty(Context, Sizes);
  break;
}
case llvm::omp::OMPC_is_device_ptr: {
  OMPMappableExprListSizeTy Sizes;
  Sizes.NumVars = Record.readInt();
  Sizes.NumUniqueDeclarations = Record.readInt();
  Sizes.NumComponentLists = Record.readInt();
  Sizes.NumComponents = Record.readInt();
  C = OMPIsDevicePtrClause::CreateEmpty(Context, Sizes);
  break;
}
case llvm::omp::OMPC_allocate:
  C = OMPAllocateClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_nontemporal:
  C = OMPNontemporalClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_inclusive:
  C = OMPInclusiveClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_exclusive:
  C = OMPExclusiveClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_order:
  C = new (Context) OMPOrderClause();
  break;
case llvm::omp::OMPC_init:
  C = OMPInitClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_use:
  C = new (Context) OMPUseClause();
  break;
case llvm::omp::OMPC_destroy:
  C = new (Context) OMPDestroyClause();
  break;
case llvm::omp::OMPC_novariants:
  C = new (Context) OMPNovariantsClause();
  break;
case llvm::omp::OMPC_nocontext:
  C = new (Context) OMPNocontextClause();
  break;
case llvm::omp::OMPC_detach:
  C = new (Context) OMPDetachClause();
  break;
case llvm::omp::OMPC_uses_allocators:
  C = OMPUsesAllocatorsClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_affinity:
  C = OMPAffinityClause::CreateEmpty(Context, Record.readInt());
  break;
case llvm::omp::OMPC_filter:
  C = new (Context) OMPFilterClause();
  break;
12007#define OMP_CLAUSE_NO_CLASS(Enum, Str)case llvm::omp::Enum: break;                                         \
case llvm::omp::Enum:                                                        \
  break;
12010#include "llvm/Frontend/OpenMP/OMPKinds.def"
default:
  break;
}
assert(C && "Unknown OMPClause type")((void)0);

Visit(C);
C->setLocStart(Record.readSourceLocation());
C->setLocEnd(Record.readSourceLocation());

return C;
12021}

12023void OMPClauseReader::VisitOMPClauseWithPreInit(OMPClauseWithPreInit *C) {
C->setPreInitStmt(Record.readSubStmt(),
                  static_cast<OpenMPDirectiveKind>(Record.readInt()));
12026}

12028void OMPClauseReader::VisitOMPClauseWithPostUpdate(OMPClauseWithPostUpdate *C) {
VisitOMPClauseWithPreInit(C);
C->setPostUpdateExpr(Record.readSubExpr());
12031}

12033void OMPClauseReader::VisitOMPIfClause(OMPIfClause *C) {
VisitOMPClauseWithPreInit(C);
C->setNameModifier(static_cast<OpenMPDirectiveKind>(Record.readInt()));
C->setNameModifierLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
C->setCondition(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12040}

12042void OMPClauseReader::VisitOMPFinalClause(OMPFinalClause *C) {
VisitOMPClauseWithPreInit(C);
C->setCondition(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12046}

12048void OMPClauseReader::VisitOMPNumThreadsClause(OMPNumThreadsClause *C) {
VisitOMPClauseWithPreInit(C);
C->setNumThreads(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12052}

12054void OMPClauseReader::VisitOMPSafelenClause(OMPSafelenClause *C) {
C->setSafelen(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12057}

12059void OMPClauseReader::VisitOMPSimdlenClause(OMPSimdlenClause *C) {
C->setSimdlen(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12062}

12064void OMPClauseReader::VisitOMPSizesClause(OMPSizesClause *C) {
for (Expr *&E : C->getSizesRefs())
  E = Record.readSubExpr();
C->setLParenLoc(Record.readSourceLocation());
12068}

12070void OMPClauseReader::VisitOMPFullClause(OMPFullClause *C) {}

12072void OMPClauseReader::VisitOMPPartialClause(OMPPartialClause *C) {
C->setFactor(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12075}

12077void OMPClauseReader::VisitOMPAllocatorClause(OMPAllocatorClause *C) {
C->setAllocator(Record.readExpr());
C->setLParenLoc(Record.readSourceLocation());
12080}

12082void OMPClauseReader::VisitOMPCollapseClause(OMPCollapseClause *C) {
C->setNumForLoops(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12085}

12087void OMPClauseReader::VisitOMPDefaultClause(OMPDefaultClause *C) {
C->setDefaultKind(static_cast<llvm::omp::DefaultKind>(Record.readInt()));
C->setLParenLoc(Record.readSourceLocation());
C->setDefaultKindKwLoc(Record.readSourceLocation());
12091}

12093void OMPClauseReader::VisitOMPProcBindClause(OMPProcBindClause *C) {
C->setProcBindKind(static_cast<llvm::omp::ProcBindKind>(Record.readInt()));
C->setLParenLoc(Record.readSourceLocation());
C->setProcBindKindKwLoc(Record.readSourceLocation());
12097}

12099void OMPClauseReader::VisitOMPScheduleClause(OMPScheduleClause *C) {
VisitOMPClauseWithPreInit(C);
C->setScheduleKind(
     static_cast<OpenMPScheduleClauseKind>(Record.readInt()));
C->setFirstScheduleModifier(
    static_cast<OpenMPScheduleClauseModifier>(Record.readInt()));
C->setSecondScheduleModifier(
    static_cast<OpenMPScheduleClauseModifier>(Record.readInt()));
C->setChunkSize(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
C->setFirstScheduleModifierLoc(Record.readSourceLocation());
C->setSecondScheduleModifierLoc(Record.readSourceLocation());
C->setScheduleKindLoc(Record.readSourceLocation());
C->setCommaLoc(Record.readSourceLocation());
12113}

12115void OMPClauseReader::VisitOMPOrderedClause(OMPOrderedClause *C) {
C->setNumForLoops(Record.readSubExpr());
for (unsigned I = 0, E = C->NumberOfLoops; I < E; ++I)
  C->setLoopNumIterations(I, Record.readSubExpr());
for (unsigned I = 0, E = C->NumberOfLoops; I < E; ++I)
  C->setLoopCounter(I, Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12122}

12124void OMPClauseReader::VisitOMPDetachClause(OMPDetachClause *C) {
C->setEventHandler(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12127}

12129void OMPClauseReader::VisitOMPNowaitClause(OMPNowaitClause *) {}

12131void OMPClauseReader::VisitOMPUntiedClause(OMPUntiedClause *) {}

12133void OMPClauseReader::VisitOMPMergeableClause(OMPMergeableClause *) {}

12135void OMPClauseReader::VisitOMPReadClause(OMPReadClause *) {}

12137void OMPClauseReader::VisitOMPWriteClause(OMPWriteClause *) {}

12139void OMPClauseReader::VisitOMPUpdateClause(OMPUpdateClause *C) {
if (C->isExtended()) {
  C->setLParenLoc(Record.readSourceLocation());
  C->setArgumentLoc(Record.readSourceLocation());
  C->setDependencyKind(Record.readEnum<OpenMPDependClauseKind>());
}
12145}

12147void OMPClauseReader::VisitOMPCaptureClause(OMPCaptureClause *) {}

12149void OMPClauseReader::VisitOMPSeqCstClause(OMPSeqCstClause *) {}

12151void OMPClauseReader::VisitOMPAcqRelClause(OMPAcqRelClause *) {}

12153void OMPClauseReader::VisitOMPAcquireClause(OMPAcquireClause *) {}

12155void OMPClauseReader::VisitOMPReleaseClause(OMPReleaseClause *) {}

12157void OMPClauseReader::VisitOMPRelaxedClause(OMPRelaxedClause *) {}

12159void OMPClauseReader::VisitOMPThreadsClause(OMPThreadsClause *) {}

12161void OMPClauseReader::VisitOMPSIMDClause(OMPSIMDClause *) {}

12163void OMPClauseReader::VisitOMPNogroupClause(OMPNogroupClause *) {}

12165void OMPClauseReader::VisitOMPInitClause(OMPInitClause *C) {
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
C->setIsTarget(Record.readBool());
C->setIsTargetSync(Record.readBool());
C->setLParenLoc(Record.readSourceLocation());
C->setVarLoc(Record.readSourceLocation());
12176}

12178void OMPClauseReader::VisitOMPUseClause(OMPUseClause *C) {
C->setInteropVar(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
C->setVarLoc(Record.readSourceLocation());
12182}

12184void OMPClauseReader::VisitOMPDestroyClause(OMPDestroyClause *C) {
C->setInteropVar(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
C->setVarLoc(Record.readSourceLocation());
12188}

12190void OMPClauseReader::VisitOMPNovariantsClause(OMPNovariantsClause *C) {
VisitOMPClauseWithPreInit(C);
C->setCondition(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12194}

12196void OMPClauseReader::VisitOMPNocontextClause(OMPNocontextClause *C) {
VisitOMPClauseWithPreInit(C);
C->setCondition(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12200}

12202void OMPClauseReader::VisitOMPUnifiedAddressClause(OMPUnifiedAddressClause *) {}

12204void OMPClauseReader::VisitOMPUnifiedSharedMemoryClause(
  OMPUnifiedSharedMemoryClause *) {}

12207void OMPClauseReader::VisitOMPReverseOffloadClause(OMPReverseOffloadClause *) {}

12209void
12210OMPClauseReader::VisitOMPDynamicAllocatorsClause(OMPDynamicAllocatorsClause *) {
12211}

12213void OMPClauseReader::VisitOMPAtomicDefaultMemOrderClause(
  OMPAtomicDefaultMemOrderClause *C) {
C->setAtomicDefaultMemOrderKind(
    static_cast<OpenMPAtomicDefaultMemOrderClauseKind>(Record.readInt()));
C->setLParenLoc(Record.readSourceLocation());
C->setAtomicDefaultMemOrderKindKwLoc(Record.readSourceLocation());
12219}

12221void OMPClauseReader::VisitOMPPrivateClause(OMPPrivateClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setPrivateCopies(Vars);
12233}

12235void OMPClauseReader::VisitOMPFirstprivateClause(OMPFirstprivateClause *C) {
VisitOMPClauseWithPreInit(C);
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setPrivateCopies(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setInits(Vars);
12252}

12254void OMPClauseReader::VisitOMPLastprivateClause(OMPLastprivateClause *C) {
VisitOMPClauseWithPostUpdate(C);
C->setLParenLoc(Record.readSourceLocation());
C->setKind(Record.readEnum<OpenMPLastprivateModifier>());
C->setKindLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setPrivateCopies(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setSourceExprs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setDestinationExprs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setAssignmentOps(Vars);
12282}

12284void OMPClauseReader::VisitOMPSharedClause(OMPSharedClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
12292}

12294void OMPClauseReader::VisitOMPReductionClause(OMPReductionClause *C) {
VisitOMPClauseWithPostUpdate(C);
C->setLParenLoc(Record.readSourceLocation());
C->setModifierLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
NestedNameSpecifierLoc NNSL = Record.readNestedNameSpecifierLoc();
DeclarationNameInfo DNI = Record.readDeclarationNameInfo();
C->setQualifierLoc(NNSL);
C->setNameInfo(DNI);

unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setPrivates(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setLHSExprs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setRHSExprs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setReductionOps(Vars);
if (C->getModifier() == OMPC_REDUCTION_inscan) {
  Vars.clear();
  for (unsigned i = 0; i != NumVars; ++i)
    Vars.push_back(Record.readSubExpr());
  C->setInscanCopyOps(Vars);
  Vars.clear();
  for (unsigned i = 0; i != NumVars; ++i)
    Vars.push_back(Record.readSubExpr());
  C->setInscanCopyArrayTemps(Vars);
  Vars.clear();
  for (unsigned i = 0; i != NumVars; ++i)
    Vars.push_back(Record.readSubExpr());
  C->setInscanCopyArrayElems(Vars);
}
12340}

12342void OMPClauseReader::VisitOMPTaskReductionClause(OMPTaskReductionClause *C) {
VisitOMPClauseWithPostUpdate(C);
C->setLParenLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
NestedNameSpecifierLoc NNSL = Record.readNestedNameSpecifierLoc();
DeclarationNameInfo DNI = Record.readDeclarationNameInfo();
C->setQualifierLoc(NNSL);
C->setNameInfo(DNI);

unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setPrivates(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setLHSExprs(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setRHSExprs(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setReductionOps(Vars);
12373}

12375void OMPClauseReader::VisitOMPInReductionClause(OMPInReductionClause *C) {
VisitOMPClauseWithPostUpdate(C);
C->setLParenLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
NestedNameSpecifierLoc NNSL = Record.readNestedNameSpecifierLoc();
DeclarationNameInfo DNI = Record.readDeclarationNameInfo();
C->setQualifierLoc(NNSL);
C->setNameInfo(DNI);

unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setPrivates(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setLHSExprs(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setRHSExprs(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setReductionOps(Vars);
Vars.clear();
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setTaskgroupDescriptors(Vars);
12410}

12412void OMPClauseReader::VisitOMPLinearClause(OMPLinearClause *C) {
VisitOMPClauseWithPostUpdate(C);
C->setLParenLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
C->setModifier(static_cast<OpenMPLinearClauseKind>(Record.readInt()));
C->setModifierLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setPrivates(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setInits(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setUpdates(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setFinals(Vars);
C->setStep(Record.readSubExpr());
C->setCalcStep(Record.readSubExpr());
Vars.clear();
for (unsigned I = 0; I != NumVars + 1; ++I)
  Vars.push_back(Record.readSubExpr());
C->setUsedExprs(Vars);
12446}

12448void OMPClauseReader::VisitOMPAlignedClause(OMPAlignedClause *C) {
C->setLParenLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
C->setAlignment(Record.readSubExpr());
12458}

12460void OMPClauseReader::VisitOMPCopyinClause(OMPCopyinClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Exprs;
Exprs.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setVarRefs(Exprs);
Exprs.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setSourceExprs(Exprs);
Exprs.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setDestinationExprs(Exprs);
Exprs.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setAssignmentOps(Exprs);
12480}

12482void OMPClauseReader::VisitOMPCopyprivateClause(OMPCopyprivateClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Exprs;
Exprs.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setVarRefs(Exprs);
Exprs.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setSourceExprs(Exprs);
Exprs.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setDestinationExprs(Exprs);
Exprs.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Exprs.push_back(Record.readSubExpr());
C->setAssignmentOps(Exprs);
12502}

12504void OMPClauseReader::VisitOMPFlushClause(OMPFlushClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
12512}

12514void OMPClauseReader::VisitOMPDepobjClause(OMPDepobjClause *C) {
C->setDepobj(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12517}

12519void OMPClauseReader::VisitOMPDependClause(OMPDependClause *C) {
C->setLParenLoc(Record.readSourceLocation());
C->setModifier(Record.readSubExpr());
C->setDependencyKind(
    static_cast<OpenMPDependClauseKind>(Record.readInt()));
C->setDependencyLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned I = 0; I != NumVars; ++I)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
for (unsigned I = 0, E = C->getNumLoops(); I < E; ++I)
  C->setLoopData(I, Record.readSubExpr());
12534}

12536void OMPClauseReader::VisitOMPDeviceClause(OMPDeviceClause *C) {
VisitOMPClauseWithPreInit(C);
C->setModifier(Record.readEnum<OpenMPDeviceClauseModifier>());
C->setDevice(Record.readSubExpr());
C->setModifierLoc(Record.readSourceLocation());
C->setLParenLoc(Record.readSourceLocation());
12542}

12544void OMPClauseReader::VisitOMPMapClause(OMPMapClause *C) {
C->setLParenLoc(Record.readSourceLocation());
for (unsigned I = 0; I < NumberOfOMPMapClauseModifiers; ++I) {
  C->setMapTypeModifier(
      I, static_cast<OpenMPMapModifierKind>(Record.readInt()));
  C->setMapTypeModifierLoc(I, Record.readSourceLocation());
}
C->setMapperQualifierLoc(Record.readNestedNameSpecifierLoc());
C->setMapperIdInfo(Record.readDeclarationNameInfo());
C->setMapType(
   static_cast<OpenMPMapClauseKind>(Record.readInt()));
C->setMapLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
auto NumVars = C->varlist_size();
auto UniqueDecls = C->getUniqueDeclarationsNum();
auto TotalLists = C->getTotalComponentListNum();
auto TotalComponents = C->getTotalComponentsNum();

SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readExpr());
C->setVarRefs(Vars);

SmallVector<Expr *, 16> UDMappers;
UDMappers.reserve(NumVars);
for (unsigned I = 0; I < NumVars; ++I)
  UDMappers.push_back(Record.readExpr());
C->setUDMapperRefs(UDMappers);

SmallVector<ValueDecl *, 16> Decls;
Decls.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  Decls.push_back(Record.readDeclAs<ValueDecl>());
C->setUniqueDecls(Decls);

SmallVector<unsigned, 16> ListsPerDecl;
ListsPerDecl.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  ListsPerDecl.push_back(Record.readInt());
C->setDeclNumLists(ListsPerDecl);

SmallVector<unsigned, 32> ListSizes;
ListSizes.reserve(TotalLists);
for (unsigned i = 0; i < TotalLists; ++i)
  ListSizes.push_back(Record.readInt());
C->setComponentListSizes(ListSizes);

SmallVector<OMPClauseMappableExprCommon::MappableComponent, 32> Components;
Components.reserve(TotalComponents);
for (unsigned i = 0; i < TotalComponents; ++i) {
  Expr *AssociatedExprPr = Record.readExpr();
  auto *AssociatedDecl = Record.readDeclAs<ValueDecl>();
  Components.emplace_back(AssociatedExprPr, AssociatedDecl,
                          /*IsNonContiguous=*/false);
}
C->setComponents(Components, ListSizes);
12601}

12603void OMPClauseReader::VisitOMPAllocateClause(OMPAllocateClause *C) {
C->setLParenLoc(Record.readSourceLocation());
C->setColonLoc(Record.readSourceLocation());
C->setAllocator(Record.readSubExpr());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
12613}

12615void OMPClauseReader::VisitOMPNumTeamsClause(OMPNumTeamsClause *C) {
VisitOMPClauseWithPreInit(C);
C->setNumTeams(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12619}

12621void OMPClauseReader::VisitOMPThreadLimitClause(OMPThreadLimitClause *C) {
VisitOMPClauseWithPreInit(C);
C->setThreadLimit(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12625}

12627void OMPClauseReader::VisitOMPPriorityClause(OMPPriorityClause *C) {
VisitOMPClauseWithPreInit(C);
C->setPriority(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12631}

12633void OMPClauseReader::VisitOMPGrainsizeClause(OMPGrainsizeClause *C) {
VisitOMPClauseWithPreInit(C);
C->setGrainsize(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12637}

12639void OMPClauseReader::VisitOMPNumTasksClause(OMPNumTasksClause *C) {
VisitOMPClauseWithPreInit(C);
C->setNumTasks(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12643}

12645void OMPClauseReader::VisitOMPHintClause(OMPHintClause *C) {
C->setHint(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12648}

12650void OMPClauseReader::VisitOMPDistScheduleClause(OMPDistScheduleClause *C) {
VisitOMPClauseWithPreInit(C);
C->setDistScheduleKind(
    static_cast<OpenMPDistScheduleClauseKind>(Record.readInt()));
C->setChunkSize(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
C->setDistScheduleKindLoc(Record.readSourceLocation());
C->setCommaLoc(Record.readSourceLocation());
12658}

12660void OMPClauseReader::VisitOMPDefaultmapClause(OMPDefaultmapClause *C) {
C->setDefaultmapKind(
     static_cast<OpenMPDefaultmapClauseKind>(Record.readInt()));
C->setDefaultmapModifier(
    static_cast<OpenMPDefaultmapClauseModifier>(Record.readInt()));
C->setLParenLoc(Record.readSourceLocation());
C->setDefaultmapModifierLoc(Record.readSourceLocation());
C->setDefaultmapKindLoc(Record.readSourceLocation());
12668}

12670void OMPClauseReader::VisitOMPToClause(OMPToClause *C) {
C->setLParenLoc(Record.readSourceLocation());
for (unsigned I = 0; I < NumberOfOMPMotionModifiers; ++I) {
  C->setMotionModifier(
      I, static_cast<OpenMPMotionModifierKind>(Record.readInt()));
  C->setMotionModifierLoc(I, Record.readSourceLocation());
}
C->setMapperQualifierLoc(Record.readNestedNameSpecifierLoc());
C->setMapperIdInfo(Record.readDeclarationNameInfo());
C->setColonLoc(Record.readSourceLocation());
auto NumVars = C->varlist_size();
auto UniqueDecls = C->getUniqueDeclarationsNum();
auto TotalLists = C->getTotalComponentListNum();
auto TotalComponents = C->getTotalComponentsNum();

SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);

SmallVector<Expr *, 16> UDMappers;
UDMappers.reserve(NumVars);
for (unsigned I = 0; I < NumVars; ++I)
  UDMappers.push_back(Record.readSubExpr());
C->setUDMapperRefs(UDMappers);

SmallVector<ValueDecl *, 16> Decls;
Decls.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  Decls.push_back(Record.readDeclAs<ValueDecl>());
C->setUniqueDecls(Decls);

SmallVector<unsigned, 16> ListsPerDecl;
ListsPerDecl.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  ListsPerDecl.push_back(Record.readInt());
C->setDeclNumLists(ListsPerDecl);

SmallVector<unsigned, 32> ListSizes;
ListSizes.reserve(TotalLists);
for (unsigned i = 0; i < TotalLists; ++i)
  ListSizes.push_back(Record.readInt());
C->setComponentListSizes(ListSizes);

SmallVector<OMPClauseMappableExprCommon::MappableComponent, 32> Components;
Components.reserve(TotalComponents);
for (unsigned i = 0; i < TotalComponents; ++i) {
  Expr *AssociatedExprPr = Record.readSubExpr();
  bool IsNonContiguous = Record.readBool();
  auto *AssociatedDecl = Record.readDeclAs<ValueDecl>();
  Components.emplace_back(AssociatedExprPr, AssociatedDecl, IsNonContiguous);
}
C->setComponents(Components, ListSizes);
12724}

12726void OMPClauseReader::VisitOMPFromClause(OMPFromClause *C) {
C->setLParenLoc(Record.readSourceLocation());
for (unsigned I = 0; I < NumberOfOMPMotionModifiers; ++I) {
  C->setMotionModifier(
      I, static_cast<OpenMPMotionModifierKind>(Record.readInt()));
  C->setMotionModifierLoc(I, Record.readSourceLocation());
}
C->setMapperQualifierLoc(Record.readNestedNameSpecifierLoc());
C->setMapperIdInfo(Record.readDeclarationNameInfo());
C->setColonLoc(Record.readSourceLocation());
auto NumVars = C->varlist_size();
auto UniqueDecls = C->getUniqueDeclarationsNum();
auto TotalLists = C->getTotalComponentListNum();
auto TotalComponents = C->getTotalComponentsNum();

SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);

SmallVector<Expr *, 16> UDMappers;
UDMappers.reserve(NumVars);
for (unsigned I = 0; I < NumVars; ++I)
  UDMappers.push_back(Record.readSubExpr());
C->setUDMapperRefs(UDMappers);

SmallVector<ValueDecl *, 16> Decls;
Decls.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  Decls.push_back(Record.readDeclAs<ValueDecl>());
C->setUniqueDecls(Decls);

SmallVector<unsigned, 16> ListsPerDecl;
ListsPerDecl.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  ListsPerDecl.push_back(Record.readInt());
C->setDeclNumLists(ListsPerDecl);

SmallVector<unsigned, 32> ListSizes;
ListSizes.reserve(TotalLists);
for (unsigned i = 0; i < TotalLists; ++i)
  ListSizes.push_back(Record.readInt());
C->setComponentListSizes(ListSizes);

SmallVector<OMPClauseMappableExprCommon::MappableComponent, 32> Components;
Components.reserve(TotalComponents);
for (unsigned i = 0; i < TotalComponents; ++i) {
  Expr *AssociatedExprPr = Record.readSubExpr();
  bool IsNonContiguous = Record.readBool();
  auto *AssociatedDecl = Record.readDeclAs<ValueDecl>();
  Components.emplace_back(AssociatedExprPr, AssociatedDecl, IsNonContiguous);
}
C->setComponents(Components, ListSizes);
12780}

12782void OMPClauseReader::VisitOMPUseDevicePtrClause(OMPUseDevicePtrClause *C) {
C->setLParenLoc(Record.readSourceLocation());
auto NumVars = C->varlist_size();
auto UniqueDecls = C->getUniqueDeclarationsNum();
auto TotalLists = C->getTotalComponentListNum();
auto TotalComponents = C->getTotalComponentsNum();

SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setPrivateCopies(Vars);
Vars.clear();
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setInits(Vars);

SmallVector<ValueDecl *, 16> Decls;
Decls.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  Decls.push_back(Record.readDeclAs<ValueDecl>());
C->setUniqueDecls(Decls);

SmallVector<unsigned, 16> ListsPerDecl;
ListsPerDecl.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  ListsPerDecl.push_back(Record.readInt());
C->setDeclNumLists(ListsPerDecl);

SmallVector<unsigned, 32> ListSizes;
ListSizes.reserve(TotalLists);
for (unsigned i = 0; i < TotalLists; ++i)
  ListSizes.push_back(Record.readInt());
C->setComponentListSizes(ListSizes);

SmallVector<OMPClauseMappableExprCommon::MappableComponent, 32> Components;
Components.reserve(TotalComponents);
for (unsigned i = 0; i < TotalComponents; ++i) {
  auto *AssociatedExprPr = Record.readSubExpr();
  auto *AssociatedDecl = Record.readDeclAs<ValueDecl>();
  Components.emplace_back(AssociatedExprPr, AssociatedDecl,
                          /*IsNonContiguous=*/false);
}
C->setComponents(Components, ListSizes);
12830}

12832void OMPClauseReader::VisitOMPUseDeviceAddrClause(OMPUseDeviceAddrClause *C) {
C->setLParenLoc(Record.readSourceLocation());
auto NumVars = C->varlist_size();
auto UniqueDecls = C->getUniqueDeclarationsNum();
auto TotalLists = C->getTotalComponentListNum();
auto TotalComponents = C->getTotalComponentsNum();

SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);

SmallVector<ValueDecl *, 16> Decls;
Decls.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  Decls.push_back(Record.readDeclAs<ValueDecl>());
C->setUniqueDecls(Decls);

SmallVector<unsigned, 16> ListsPerDecl;
ListsPerDecl.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  ListsPerDecl.push_back(Record.readInt());
C->setDeclNumLists(ListsPerDecl);

SmallVector<unsigned, 32> ListSizes;
ListSizes.reserve(TotalLists);
for (unsigned i = 0; i < TotalLists; ++i)
  ListSizes.push_back(Record.readInt());
C->setComponentListSizes(ListSizes);

SmallVector<OMPClauseMappableExprCommon::MappableComponent, 32> Components;
Components.reserve(TotalComponents);
for (unsigned i = 0; i < TotalComponents; ++i) {
  Expr *AssociatedExpr = Record.readSubExpr();
  auto *AssociatedDecl = Record.readDeclAs<ValueDecl>();
  Components.emplace_back(AssociatedExpr, AssociatedDecl,
                          /*IsNonContiguous*/ false);
}
C->setComponents(Components, ListSizes);
12872}

12874void OMPClauseReader::VisitOMPIsDevicePtrClause(OMPIsDevicePtrClause *C) {
C->setLParenLoc(Record.readSourceLocation());
auto NumVars = C->varlist_size();
auto UniqueDecls = C->getUniqueDeclarationsNum();
auto TotalLists = C->getTotalComponentListNum();
auto TotalComponents = C->getTotalComponentsNum();

SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();

SmallVector<ValueDecl *, 16> Decls;
Decls.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  Decls.push_back(Record.readDeclAs<ValueDecl>());
C->setUniqueDecls(Decls);

SmallVector<unsigned, 16> ListsPerDecl;
ListsPerDecl.reserve(UniqueDecls);
for (unsigned i = 0; i < UniqueDecls; ++i)
  ListsPerDecl.push_back(Record.readInt());
C->setDeclNumLists(ListsPerDecl);

SmallVector<unsigned, 32> ListSizes;
ListSizes.reserve(TotalLists);
for (unsigned i = 0; i < TotalLists; ++i)
  ListSizes.push_back(Record.readInt());
C->setComponentListSizes(ListSizes);

SmallVector<OMPClauseMappableExprCommon::MappableComponent, 32> Components;
Components.reserve(TotalComponents);
for (unsigned i = 0; i < TotalComponents; ++i) {
  Expr *AssociatedExpr = Record.readSubExpr();
  auto *AssociatedDecl = Record.readDeclAs<ValueDecl>();
  Components.emplace_back(AssociatedExpr, AssociatedDecl,
                          /*IsNonContiguous=*/false);
}
C->setComponents(Components, ListSizes);
12915}

12917void OMPClauseReader::VisitOMPNontemporalClause(OMPNontemporalClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
Vars.clear();
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setPrivateRefs(Vars);
12930}

12932void OMPClauseReader::VisitOMPInclusiveClause(OMPInclusiveClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
12940}

12942void OMPClauseReader::VisitOMPExclusiveClause(OMPExclusiveClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumVars = C->varlist_size();
SmallVector<Expr *, 16> Vars;
Vars.reserve(NumVars);
for (unsigned i = 0; i != NumVars; ++i)
  Vars.push_back(Record.readSubExpr());
C->setVarRefs(Vars);
12950}

12952void OMPClauseReader::VisitOMPUsesAllocatorsClause(OMPUsesAllocatorsClause *C) {
C->setLParenLoc(Record.readSourceLocation());
unsigned NumOfAllocators = C->getNumberOfAllocators();
SmallVector<OMPUsesAllocatorsClause::Data, 4> Data;
Data.reserve(NumOfAllocators);
for (unsigned I = 0; I != NumOfAllocators; ++I) {
  OMPUsesAllocatorsClause::Data &D = Data.emplace_back();
  D.Allocator = Record.readSubExpr();
  D.AllocatorTraits = Record.readSubExpr();
  D.LParenLoc = Record.readSourceLocation();
  D.RParenLoc = Record.readSourceLocation();
}
C->setAllocatorsData(Data);
12965}

12967void OMPClauseReader::VisitOMPAffinityClause(OMPAffinityClause *C) {
C->setLParenLoc(Record.readSourceLocation());
C->setModifier(Record.readSubExpr());
C->setColonLoc(Record.readSourceLocation());
unsigned NumOfLocators = C->varlist_size();
SmallVector<Expr *, 4> Locators;
Locators.reserve(NumOfLocators);
for (unsigned I = 0; I != NumOfLocators; ++I)
  Locators.push_back(Record.readSubExpr());
C->setVarRefs(Locators);
12977}

12979void OMPClauseReader::VisitOMPOrderClause(OMPOrderClause *C) {
C->setKind(Record.readEnum<OpenMPOrderClauseKind>());
C->setLParenLoc(Record.readSourceLocation());
C->setKindKwLoc(Record.readSourceLocation());
12983}

12985void OMPClauseReader::VisitOMPFilterClause(OMPFilterClause *C) {
VisitOMPClauseWithPreInit(C);
C->setThreadID(Record.readSubExpr());
C->setLParenLoc(Record.readSourceLocation());
12989}

12991OMPTraitInfo *ASTRecordReader::readOMPTraitInfo() {
OMPTraitInfo &TI = getContext().getNewOMPTraitInfo();
TI.Sets.resize(readUInt32());
for (auto &Set : TI.Sets) {
  Set.Kind = readEnum<llvm::omp::TraitSet>();
  Set.Selectors.resize(readUInt32());
  for (auto &Selector : Set.Selectors) {
    Selector.Kind = readEnum<llvm::omp::TraitSelector>();
    Selector.ScoreOrCondition = nullptr;
    if (readBool())
      Selector.ScoreOrCondition = readExprRef();
    Selector.Properties.resize(readUInt32());
    for (auto &Property : Selector.Properties)
      Property.Kind = readEnum<llvm::omp::TraitProperty>();
  }
}
return &TI;
13008}

13010void ASTRecordReader::readOMPChildren(OMPChildren *Data) {
if (!Data)
  return;
if (Reader->ReadingKind == ASTReader::Read_Stmt) {
  // Skip NumClauses, NumChildren and HasAssociatedStmt fields.
  skipInts(3);
}
SmallVector<OMPClause *, 4> Clauses(Data->getNumClauses());
for (unsigned I = 0, E = Data->getNumClauses(); I < E; ++I)
  Clauses[I] = readOMPClause();
Data->setClauses(Clauses);
if (Data->hasAssociatedStmt())
  Data->setAssociatedStmt(readStmt());
for (unsigned I = 0, E = Data->getNumChildren(); I < E; ++I)
  Data->getChildren()[I] = readStmt();
13025}

←

/usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/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")((void)0);
  Mask = (Mask & ~CVRMask) | mask;
}
void removeCVRQualifiers(unsigned mask) {
  assert(!(mask & ~CVRMask) && "bitmask contains non-CVR bits")((void)0);
  Mask &= ~mask;
}
void removeCVRQualifiers() {
  removeCVRQualifiers(CVRMask);
}
void addCVRQualifiers(unsigned mask) {
  assert(!(mask & ~CVRMask) && "bitmask contains non-CVR bits")((void)0);
  Mask |= mask;
}
void addCVRUQualifiers(unsigned mask) {
  assert(!(mask & ~CVRMask & ~UMask) && "bitmask contains non-CVRU bits")((void)0);
  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)((void)0);
  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)((void)0);
  assert(!hasObjCLifetime())((void)0);
  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())((void)0);
  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)((void)0);
  Mask = (Mask & ~AddressSpaceMask)
       | (((uint32_t) space) << AddressSpaceShift);
}
void removeAddressSpace() { setAddressSpace(LangAS::Default); }
void addAddressSpace(LangAS space) {
  assert(space != LangAS::Default)((void)0);
  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")((void)0);
  Mask = (Mask & ~FastMask) | mask;
}
void removeFastQualifiers(unsigned mask) {
  assert(!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits")((void)0);
  Mask &= ~mask;
}
void removeFastQualifiers() {
  removeFastQualifiers(FastMask);
}
void addFastQualifiers(unsigned mask) {
  assert(!(mask & ~FastMask) && "bitmask contains non-fast qualifier bits")((void)0);
  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() ||((void)0)
         !hasAddressSpace() || !qs.hasAddressSpace())((void)0);
  assert(getObjCGCAttr() == qs.getObjCGCAttr() ||((void)0)
         !hasObjCGCAttr() || !qs.hasObjCGCAttr())((void)0);
  assert(getObjCLifetime() == qs.getObjCLifetime() ||((void)0)
         !hasObjCLifetime() || !qs.hasObjCLifetime())((void)0);
  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)) ||
         (A == LangAS::sycl_global && (B == LangAS::sycl_global_device ||
                                       B == LangAS::sycl_global_host)) ||
         // Consider pointer size address spaces to be equivalent to default.
         ((isPtrSizeAddressSpace(A) || A == LangAS::Default) &&
          (isPtrSizeAddressSpace(B) || B == LangAS::Default)) ||
         // Default is a superset of SYCL address spaces.
         (A == LangAS::Default &&
          (B == LangAS::sycl_private || B == LangAS::sycl_local ||
           B == LangAS::sycl_global || B == LangAS::sycl_global_device ||
           B == LangAS::sycl_global_host));
}

/// 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);
}

589private:
// 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;
603};

605/// A std::pair-like structure for storing a qualified type split
606/// into its local qualifiers and its locally-unqualified type.
607struct 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;
}
630};

632/// The kind of type we are substituting Objective-C type arguments into.
633///
634/// The kind of substitution affects the replacement of type parameters when
635/// no concrete type information is provided, e.g., when dealing with an
636/// unspecialized type.
637enum 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,
652};

654/// A (possibly-)qualified type.
655///
656/// For efficiency, we don't store CV-qualified types as nodes on their
657/// own: instead each reference to a type stores the qualifiers.  This
658/// greatly reduces the number of nodes we need to allocate for types (for
659/// example we only need one for 'int', 'const int', 'volatile int',
660/// 'const volatile int', etc).
661///
662/// As an added efficiency bonus, instead of making this a pair, we
663/// just store the two bits we care about in the low bits of the
664/// pointer.  To handle the packing/unpacking, we make QualType be a
665/// simple wrapper class that acts like a smart pointer.  A third bit
666/// indicates whether there are extended qualifiers present, in which
667/// case the pointer points to a special structure.
668class 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")((void)0);
  auto CommonPtrVal = reinterpret_cast<uintptr_t>(Value.getOpaqueValue());
  CommonPtrVal &= ~(uintptr_t)((1 << TypeAlignmentInBits) - 1);
  return reinterpret_cast<ExtQualsTypeCommonBase*>(CommonPtrVal);
}

690public:
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();
30
←
Calling 'PointerUnion::isNull'→
33
←
Returning from 'PointerUnion::isNull'→
34
←
Returning zero, which participates in a condition later→
}

/// 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)((void)0)
         && "non-fast qualifier bits set in mask!")((void)0);
  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")((void)0);
  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;
}
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;

1289private:
// 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);
1306};

1308} // namespace clang

1310namespace llvm {

1312/// Implement simplify_type for QualType, so that we can dyn_cast from QualType
1313/// to a specific Type class.
1314template<> struct simplify_type< ::clang::QualType> {
using SimpleType = const ::clang::Type *;

static SimpleType getSimplifiedValue(::clang::QualType Val) {
  return Val.getTypePtr();
}
1320};

1322// Teach SmallPtrSet that QualType is "basically a pointer".
1323template<>
1324struct 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;
1335};

1337} // namespace llvm

1339namespace clang {

1341/// Base class that is common to both the \c ExtQuals and \c Type
1342/// classes, which allows \c QualType to access the common fields between the
1343/// two.
1344class 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) {}
1361};

1363/// We can encode up to four bits in the low bits of a
1364/// type pointer, but there are many more type qualifiers that we want
1365/// to be able to apply to an arbitrary type.  Therefore we have this
1366/// struct, intended to be heap-allocated and used by QualType to
1367/// store qualifiers.
1368///
1369/// The current design tags the 'const', 'restrict', and 'volatile' qualifiers
1370/// in three low bits on the QualType pointer; a fourth bit records whether
1371/// the pointer is an ExtQuals node. The extended qualifiers (address spaces,
1372/// Objective-C GC attributes) are much more rare.
1373class 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; }

1393public:
ExtQuals(const Type *baseType, QualType canon, Qualifiers quals)
    : ExtQualsTypeCommonBase(baseType,
                             canon.isNull() ? QualType(this_(), 0) : canon),
      Quals(quals) {
  assert(Quals.hasNonFastQualifiers()((void)0)
         && "ExtQuals created with no fast qualifiers")((void)0);
  assert(!Quals.hasFastQualifiers()((void)0)
         && "ExtQuals created with fast qualifiers")((void)0);
}

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; }

1419public:
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!")((void)0);
  ID.AddPointer(BaseType);
  Quals.Profile(ID);
}
1431};

1433/// The kind of C++11 ref-qualifier associated with a function type.
1434/// This determines whether a member function's "this" object can be an
1435/// lvalue, rvalue, or neither.
1436enum 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
1445};

1447/// Which keyword(s) were used to create an AutoType.
1448enum class AutoTypeKeyword {
/// auto
Auto,

/// decltype(auto)
DecltypeAuto,

/// __auto_type (GNU extension)
GNUAutoType
1457};

1459/// The base class of the type hierarchy.
1460///
1461/// A central concept with types is that each type always has a canonical
1462/// type.  A canonical type is the type with any typedef names stripped out
1463/// of it or the types it references.  For example, consider:
1464///
1465///  typedef int  foo;
1466///  typedef foo* bar;
1467///    'int *'    'foo *'    'bar'
1468///
1469/// There will be a Type object created for 'int'.  Since int is canonical, its
1470/// CanonicalType pointer points to itself.  There is also a Type for 'foo' (a
1471/// TypedefType).  Its CanonicalType pointer points to the 'int' Type.  Next
1472/// there is a PointerType that represents 'int*', which, like 'int', is
1473/// canonical.  Finally, there is a PointerType type for 'foo*' whose canonical
1474/// type is 'int*', and there is a TypedefType for 'bar', whose canonical type
1475/// is also 'int*'.
1476///
1477/// Non-canonical types are useful for emitting diagnostics, without losing
1478/// information about typedefs being used.  Canonical types are useful for type
1479/// comparisons (they allow by-pointer equality tests) and useful for reasoning
1480/// about whether something has a particular form (e.g. is a function type),
1481/// because they implicitly, recursively, strip all typedefs out of a type.
1482///
1483/// Types, once created, are immutable.
1484///
1485class alignas(8) Type : public ExtQualsTypeCommonBase {
1486public:
enum TypeClass {
1488#define TYPE(Class, Base) Class,
1489#define LAST_TYPE(Class) TypeLast = Class
1490#define ABSTRACT_TYPE(Class, Base)
1491#include "clang/AST/TypeNodes.inc"
};

1494private:
/// 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")((void)0);
    return static_cast<Linkage>(CachedLinkage);
  }

  bool hasLocalOrUnnamedType() const {
    assert(isCacheValid() && "getting linkage from invalid cache")((void)0);
    return CachedLocalOrUnnamed;
  }
};
enum { NumTypeBits = 8 + llvm::BitWidth<TypeDependence> + 6 };

1535protected:
// 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;
};

1807private:
template <class T> friend class TypePropertyCache;

/// Set whether this type comes from an AST file.
void setFromAST(bool V = true) const {
  TypeBits.FromAST = V;
}

1815protected:
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); }

1842public:
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

2105#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) \
bool is##Id##Type() const;
2107#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

2117#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) \
bool is##Id##Type() const;
2119#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;
2458};

2460/// This will check for a TypedefType by removing any existing sugar
2461/// until it reaches a TypedefType or a non-sugared type.
2462template <> const TypedefType *Type::getAs() const;

2464/// This will check for a TemplateSpecializationType by removing any
2465/// existing sugar until it reaches a TemplateSpecializationType or a
2466/// non-sugared type.
2467template <> const TemplateSpecializationType *Type::getAs() const;

2469/// This will check for an AttributedType by removing any existing sugar
2470/// until it reaches an AttributedType or a non-sugared type.
2471template <> const AttributedType *Type::getAs() const;

2473// We can do canonical leaf types faster, because we don't have to
2474// worry about preserving child type decoration.
2475#define TYPE(Class, Base)
2476#define LEAF_TYPE(Class) \
2477template <> inline const Class##Type *Type::getAs() const { \
return dyn_cast<Class##Type>(CanonicalType); \
2479} \
2480template <> inline const Class##Type *Type::castAs() const { \
return cast<Class##Type>(CanonicalType); \
2482}
2483#include "clang/AST/TypeNodes.inc"

2485/// This class is used for builtin types like 'int'.  Builtin
2486/// types are always canonical and have a literal name field.
2487class BuiltinType : public Type {
2488public:
enum Kind {
2490// OpenCL image types
2491#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) Id,
2492#include "clang/Basic/OpenCLImageTypes.def"
2493// OpenCL extension types
2494#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) Id,
2495#include "clang/Basic/OpenCLExtensionTypes.def"
2496// SVE Types
2497#define SVE_TYPE(Name, Id, SingletonId) Id,
2498#include "clang/Basic/AArch64SVEACLETypes.def"
2499// PPC MMA Types
2500#define PPC_VECTOR_TYPE(Name, Id, Size) Id,
2501#include "clang/Basic/PPCTypes.def"
2502// RVV Types
2503#define RVV_TYPE(Name, Id, SingletonId) Id,
2504#include "clang/Basic/RISCVVTypes.def"
2505// All other builtin types
2506#define BUILTIN_TYPE(Id, SingletonId) Id,
2507#define LAST_BUILTIN_TYPE(Id) LastKind = Id
2508#include "clang/AST/BuiltinTypes.def"
};

2511private:
friend class ASTContext; // ASTContext creates these.

BuiltinType(Kind K)
    : Type(Builtin, QualType(),
           K == Dependent ? TypeDependence::DependentInstantiation
                          : TypeDependence::None) {
  BuiltinTypeBits.Kind = K;
}

2521public:
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')((void)0);
  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; }
2577};

2579/// Complex values, per C99 6.2.5p11.  This supports the C99 complex
2580/// types (_Complex float etc) as well as the GCC integer complex extensions.
2581class 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) {}

2590public:
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; }
2605};

2607/// Sugar for parentheses used when specifying types.
2608class 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) {}

2616public:
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; }
2631};

2633/// PointerType - C99 6.7.5.1 - Pointer Declarators.
2634class 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) {}

2643public:
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; }
2658};

2660/// Represents a type which was implicitly adjusted by the semantic
2661/// engine for arbitrary reasons.  For example, array and function types can
2662/// decay, and function types can have their calling conventions adjusted.
2663class AdjustedType : public Type, public llvm::FoldingSetNode {
QualType OriginalTy;
QualType AdjustedTy;

2667protected:
friend class ASTContext; // ASTContext creates these.

AdjustedType(TypeClass TC, QualType OriginalTy, QualType AdjustedTy,
             QualType CanonicalPtr)
    : Type(TC, CanonicalPtr, OriginalTy->getDependence()),
      OriginalTy(OriginalTy), AdjustedTy(AdjustedTy) {}

2675public:
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;
}
2694};

2696/// Represents a pointer type decayed from an array or function type.
2697class DecayedType : public AdjustedType {
friend class ASTContext; // ASTContext creates these.

inline
DecayedType(QualType OriginalType, QualType Decayed, QualType Canonical);

2703public:
QualType getDecayedType() const { return getAdjustedType(); }

inline QualType getPointeeType() const;

static bool classof(const Type *T) { return T->getTypeClass() == Decayed; }
2709};

2711/// Pointer to a block type.
2712/// This type is to represent types syntactically represented as
2713/// "void (^)(int)", etc. Pointee is required to always be a function type.
2714class 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) {}

2724public:
// 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;
}
2742};

2744/// Base for LValueReferenceType and RValueReferenceType
2745class ReferenceType : public Type, public llvm::FoldingSetNode {
QualType PointeeType;

2748protected:
ReferenceType(TypeClass tc, QualType Referencee, QualType CanonicalRef,
              bool SpelledAsLValue)
    : Type(tc, CanonicalRef, Referencee->getDependence()),
      PointeeType(Referencee) {
  ReferenceTypeBits.SpelledAsLValue = SpelledAsLValue;
  ReferenceTypeBits.InnerRef = Referencee->isReferenceType();
}

2757public:
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;
}
2786};

2788/// An lvalue reference type, per C++11 [dcl.ref].
2789class LValueReferenceType : public ReferenceType {
friend class ASTContext; // ASTContext creates these

LValueReferenceType(QualType Referencee, QualType CanonicalRef,
                    bool SpelledAsLValue)
    : ReferenceType(LValueReference, Referencee, CanonicalRef,
                    SpelledAsLValue) {}

2797public:
bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == LValueReference;
}
2804};

2806/// An rvalue reference type, per C++11 [dcl.ref].
2807class RValueReferenceType : public ReferenceType {
friend class ASTContext; // ASTContext creates these

RValueReferenceType(QualType Referencee, QualType CanonicalRef)
     : ReferenceType(RValueReference, Referencee, CanonicalRef, false) {}

2813public:
bool isSugared() const { return false; }
QualType desugar() const { return QualType(this, 0); }

static bool classof(const Type *T) {
  return T->getTypeClass() == RValueReference;
}
2820};

2822/// A pointer to member type per C++ 8.3.3 - Pointers to members.
2823///
2824/// This includes both pointers to data members and pointer to member functions.
2825class 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) {}

2840public:
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;
}
2874};

2876/// Represents an array type, per C99 6.7.5.2 - Array Declarators.
2877class ArrayType : public Type, public llvm::FoldingSetNode {
2878public:
/// 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
};

2887private:
/// The element type of the array.
QualType ElementType;

2891protected:
friend class ASTContext; // ASTContext creates these.

ArrayType(TypeClass tc, QualType et, QualType can, ArraySizeModifier sm,
          unsigned tq, const Expr *sz = nullptr);

2897public:
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;
}
2918};

2920/// Represents the canonical version of C arrays with a specified constant size.
2921/// For example, the canonical type for 'int A[4 + 4*100]' is a
2922/// ConstantArrayType where the element type is 'int' and the size is 404.
2923class 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")((void)0);
    *getTrailingObjects<const Expr*>() = sz;
  }
}

unsigned numTrailingObjects(OverloadToken<const Expr*>) const {
  return ConstantArrayTypeBits.HasStoredSizeExpr;
}

2945public:
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;
}
2978};

2980/// Represents a C array with an unspecified size.  For example 'int A[]' has
2981/// an IncompleteArrayType where the element type is 'int' and the size is
2982/// unspecified.
2983class IncompleteArrayType : public ArrayType {
friend class ASTContext; // ASTContext creates these.

IncompleteArrayType(QualType et, QualType can,
                    ArraySizeModifier sm, unsigned tq)
    : ArrayType(IncompleteArray, et, can, sm, tq) {}

2990public:
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);
}
3011};

3013/// Represents a C array with a specified size that is not an
3014/// integer-constant-expression.  For example, 'int s[x+foo()]'.
3015/// Since the size expression is an arbitrary expression, we store it as such.
3016///
3017/// Note: VariableArrayType's aren't uniqued (since the expressions aren't) and
3018/// should not be: two lexically equivalent variable array types could mean
3019/// different things, for example, these variables do not have the same type
3020/// dynamically:
3021///
3022/// void foo(int x) {
3023///   int Y[x];
3024///   ++x;
3025///   int Z[x];
3026/// }
3027class 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) {}

3043public:
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.")__builtin_unreachable();
}
3066};

3068/// Represents an array type in C++ whose size is a value-dependent expression.
3069///
3070/// For example:
3071/// \code
3072/// template<typename T, int Size>
3073/// class array {
3074///   T data[Size];
3075/// };
3076/// \endcode
3077///
3078/// For these types, we won't actually know what the array bound is
3079/// until template instantiation occurs, at which point this will
3080/// become either a ConstantArrayType or a VariableArrayType.
3081class 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);

3100public:
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);
3128};

3130/// Represents an extended address space qualifier where the input address space
3131/// value is dependent. Non-dependent address spaces are not represented with a
3132/// special Type subclass; they are stored on an ExtQuals node as part of a QualType.
3133///
3134/// For example:
3135/// \code
3136/// template<typename T, int AddrSpace>
3137/// class AddressSpace {
3138///   typedef T __attribute__((address_space(AddrSpace))) type;
3139/// }
3140/// \endcode
3141class 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);

3153public:
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);
3171};

3173/// Represents an extended vector type where either the type or size is
3174/// dependent.
3175///
3176/// For example:
3177/// \code
3178/// template<typename T, int Size>
3179/// class vector {
3180///   typedef T __attribute__((ext_vector_type(Size))) type;
3181/// }
3182/// \endcode
3183class 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);

3197public:
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);
3215};


3218/// Represents a GCC generic vector type. This type is created using
3219/// __attribute__((vector_size(n)), where "n" specifies the vector size in
3220/// bytes; or from an Altivec __vector or vector declaration.
3221/// Since the constructor takes the number of vector elements, the
3222/// client is responsible for converting the size into the number of elements.
3223class VectorType : public Type, public llvm::FoldingSetNode {
3224public:
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
};

3251protected:
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);

3263public:
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;
}
3291};

3293/// Represents a vector type where either the type or size is dependent.
3294////
3295/// For example:
3296/// \code
3297/// template<typename T, int Size>
3298/// class vector {
3299///   typedef T __attribute__((vector_size(Size))) type;
3300/// }
3301/// \endcode
3302class 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);

3314public:
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);
3336};

3338/// ExtVectorType - Extended vector type. This type is created using
3339/// __attribute__((ext_vector_type(n)), where "n" is the number of elements.
3340/// Unlike vector_size, ext_vector_type is only allowed on typedef's. This
3341/// class enables syntactic extensions, like Vector Components for accessing
3342/// points (as .xyzw), colors (as .rgba), and textures (modeled after OpenGL
3343/// Shading Language).
3344class ExtVectorType : public VectorType {
friend class ASTContext; // ASTContext creates these.

ExtVectorType(QualType vecType, unsigned nElements, QualType canonType)
    : VectorType(ExtVector, vecType, nElements, canonType, GenericVector) {}

3350public:
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;
}
3408};

3410/// Represents a matrix type, as defined in the Matrix Types clang extensions.
3411/// __attribute__((matrix_type(rows, columns))), where "rows" specifies
3412/// number of rows and "columns" specifies the number of columns.
3413class MatrixType : public Type, public llvm::FoldingSetNode {
3414protected:
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);

3425public:
/// 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;
}
3446};

3448/// Represents a concrete matrix type with constant number of rows and columns
3449class ConstantMatrixType final : public MatrixType {
3450protected:
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);

3469public:
/// 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;
}
3508};

3510/// Represents a matrix type where the type and the number of rows and columns
3511/// is dependent on a template.
3512class 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);

3525public:
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);
3544};

3546/// FunctionType - C99 6.7.5.3 - Function Declarators.  This is the common base
3547/// class of FunctionNoProtoType and FunctionProtoType.
3548class FunctionType : public Type {
// The type returned by the function.
QualType ResultType;

3552public:
/// 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")((void)0);
    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")((void)0);
    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;
};

3799protected:
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);
}

3810public:
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;
}
3845};

3847/// Represents a K&R-style 'int foo()' function, which has
3848/// no information available about its arguments.
3849class 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) {}

3859public:
// 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;
}
3878};

3880/// Represents a prototype with parameter type info, e.g.
3881/// 'int foo(int)' or 'int foo(void)'.  'void' is represented as having no
3882/// parameters, not as having a single void parameter. Such a type can have
3883/// an exception specification, but this specification is not part of the
3884/// canonical type. FunctionProtoType has several trailing objects, some of
3885/// which optional. For more information about the trailing objects see
3886/// the first comment inside FunctionProtoType.
3887class 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.

3939public:
/// 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;
  }
};

3992private:
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")__builtin_unreachable();
}

/// 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;
}

4096public:
unsigned getNumParams() const { return FunctionTypeBits.NumParams; }

QualType getParamType(unsigned i) const {
  assert(i < getNumParams() && "invalid parameter index")((void)0);
  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!")((void)0);
  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())((void)0);
  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")((void)0);
  if (hasExtParameterInfos())
    return getTrailingObjects<ExtParameterInfo>()[I];
  return ExtParameterInfo();
}

ParameterABI getParameterABI(unsigned I) const {
  assert(I < getNumParams() && "parameter index out of range")((void)0);
  if (hasExtParameterInfos())
    return getTrailingObjects<ExtParameterInfo>()[I].getABI();
  return ParameterABI::Ordinary;
}

bool isParamConsumed(unsigned I) const {
  assert(I < getNumParams() && "parameter index out of range")((void)0);
  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);
4336};

4338/// Represents the dependent type named by a dependently-scoped
4339/// typename using declaration, e.g.
4340///   using typename Base<T>::foo;
4341///
4342/// Template instantiation turns these into the underlying type.
4343class 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)) {}

4353public:
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);
}
4371};

4373class TypedefType : public Type {
TypedefNameDecl *Decl;

4376private:
friend class ASTContext; // ASTContext creates these.

TypedefType(TypeClass tc, const TypedefNameDecl *D, QualType underlying,
            QualType can);

4382public:
TypedefNameDecl *getDecl() const { return Decl; }

bool isSugared() const { return true; }
QualType desugar() const;

static bool classof(const Type *T) { return T->getTypeClass() == Typedef; }
4389};

4391/// Sugar type that represents a type that was qualified by a qualifier written
4392/// as a macro invocation.
4393class 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) &&((void)0)
         "Expected a macro qualified type to only wrap attributed types.")((void)0);
}

4407public:
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;
}
4421};

4423/// Represents a `typeof` (or __typeof__) expression (a GCC extension).
4424class TypeOfExprType : public Type {
Expr *TOExpr;

4427protected:
friend class ASTContext; // ASTContext creates these.

TypeOfExprType(Expr *E, QualType can = QualType());

4432public:
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; }
4442};

4444/// Internal representation of canonical, dependent
4445/// `typeof(expr)` types.
4446///
4447/// This class is used internally by the ASTContext to manage
4448/// canonical, dependent types, only. Clients will only see instances
4449/// of this class via TypeOfExprType nodes.
4450class DependentTypeOfExprType
: public TypeOfExprType, public llvm::FoldingSetNode {
const ASTContext &Context;

4454public:
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);
4464};

4466/// Represents `typeof(type)`, a GCC extension.
4467class 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")((void)0);
}

4477public:
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; }
4487};

4489/// Represents the type `decltype(expr)` (C++11).
4490class DecltypeType : public Type {
Expr *E;
QualType UnderlyingType;

4494protected:
friend class ASTContext; // ASTContext creates these.

DecltypeType(Expr *E, QualType underlyingType, QualType can = QualType());

4499public:
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; }
4510};

4512/// Internal representation of canonical, dependent
4513/// decltype(expr) types.
4514///
4515/// This class is used internally by the ASTContext to manage
4516/// canonical, dependent types, only. Clients will only see instances
4517/// of this class via DecltypeType nodes.
4518class DependentDecltypeType : public DecltypeType, public llvm::FoldingSetNode {
const ASTContext &Context;

4521public:
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);
4530};

4532/// A unary type transform, which is a type constructed from another.
4533class UnaryTransformType : public Type {
4534public:
enum UTTKind {
  EnumUnderlyingType
};

4539private:
/// The untransformed type.
QualType BaseType;

/// The transformed type if not dependent, otherwise the same as BaseType.
QualType UnderlyingType;

UTTKind UKind;

4548protected:
friend class ASTContext;

UnaryTransformType(QualType BaseTy, QualType UnderlyingTy, UTTKind UKind,
                   QualType CanonicalTy);

4554public:
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;
}
4566};

4568/// Internal representation of canonical, dependent
4569/// __underlying_type(type) types.
4570///
4571/// This class is used internally by the ASTContext to manage
4572/// canonical, dependent types, only. Clients will only see instances
4573/// of this class via UnaryTransformType nodes.
4574class DependentUnaryTransformType : public UnaryTransformType,
                                  public llvm::FoldingSetNode {
4576public:
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);
}
4589};

4591class 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;

4599protected:
TagType(TypeClass TC, const TagDecl *D, QualType can);

4602public:
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;
}
4611};

4613/// A helper class that allows the use of isa/cast/dyncast
4614/// to detect TagType objects of structs/unions/classes.
4615class RecordType : public TagType {
4616protected:
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()) {}

4624public:
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; }
4637};

4639/// A helper class that allows the use of isa/cast/dyncast
4640/// to detect TagType objects of enums.
4641class EnumType : public TagType {
friend class ASTContext; // ASTContext creates these.

explicit EnumType(const EnumDecl *D)
    : TagType(Enum, reinterpret_cast<const TagDecl*>(D), QualType()) {}

4647public:
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; }
4656};

4658/// An attributed type is a type to which a type attribute has been applied.
4659///
4660/// The "modified type" is the fully-sugared type to which the attributed
4661/// type was applied; generally it is not canonically equivalent to the
4662/// attributed type. The "equivalent type" is the minimally-desugared type
4663/// which the type is canonically equivalent to.
4664///
4665/// For example, in the following attributed type:
4666///     int32_t __attribute__((vector_size(16)))
4667///   - the modified type is the TypedefType for int32_t
4668///   - the equivalent type is VectorType(16, int32_t)
4669///   - the canonical type is VectorType(16, int)
4670class AttributedType : public Type, public llvm::FoldingSetNode {
4671public:
using Kind = attr::Kind;

4674private:
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;
}

4687public:
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.")__builtin_unreachable();
}

/// 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;
}
4765};

4767class 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;
}

4807public:
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;
}
4837};

4839/// Represents the result of substituting a type for a template
4840/// type parameter.
4841///
4842/// Within an instantiated template, all template type parameters have
4843/// been replaced with these.  They are used solely to record that a
4844/// type was originally written as a template type parameter;
4845/// therefore they are never canonical.
4846class 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) {}

4856public:
/// 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;
}
4885};

4887/// Represents the result of substituting a set of types for a template
4888/// type parameter pack.
4889///
4890/// When a pack expansion in the source code contains multiple parameter packs
4891/// and those parameter packs correspond to different levels of template
4892/// parameter lists, this type node is used to represent a template type
4893/// parameter pack from an outer level, which has already had its argument pack
4894/// substituted but that still lives within a pack expansion that itself
4895/// could not be instantiated. When actually performing a substitution into
4896/// that pack expansion (e.g., when all template parameters have corresponding
4897/// arguments), this type will be replaced with the \c SubstTemplateTypeParmType
4898/// at the current pack substitution index.
4899class 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);

4913public:
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;
}
4938};

4940/// Common base class for placeholders for types that get replaced by
4941/// placeholder type deduction: C++11 auto, C++14 decltype(auto), C++17 deduced
4942/// class template types, and constrained type names.
4943///
4944/// These types are usually a placeholder for a deduced type. However, before
4945/// the initializer is attached, or (usually) if the initializer is
4946/// type-dependent, there is no deduced type and the type is canonical. In
4947/// the latter case, it is also a dependent type.
4948class DeducedType : public Type {
4949protected:
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)) {}

4961public:
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;
}
4978};

4980/// Represents a C++11 auto or C++14 decltype(auto) type, possibly constrained
4981/// by a type-constraint.
4982class 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);
}

4999public:
/// 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;
}
5045};

5047/// Represents a C++17 deduced template specialization type.
5048class 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) {}

5065public:
/// 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;
}
5083};

5085/// Represents a type template specialization; the template
5086/// must be a class template, a type alias template, or a template
5087/// template parameter.  A template which cannot be resolved to one of
5088/// these, e.g. because it is written with a dependent scope
5089/// specifier, is instead represented as a
5090/// @c DependentTemplateSpecializationType.
5091///
5092/// A non-dependent template specialization type is always "sugar",
5093/// typically for a \c RecordType.  For example, a class template
5094/// specialization type of \c vector<int> will refer to a tag type for
5095/// the instantiation \c std::vector<int, std::allocator<int>>
5096///
5097/// Template specializations are dependent if either the template or
5098/// any of the template arguments are dependent, in which case the
5099/// type may also be canonical.
5100///
5101/// Instances of this type are allocated with a trailing array of
5102/// TemplateArguments, followed by a QualType representing the
5103/// non-canonical aliased type when the template is a type alias
5104/// template.
5105class 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);

5124public:
/// 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")((void)0);
  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;
}
5222};

5224/// Print a template argument list, including the '<' and '>'
5225/// enclosing the template arguments.
5226void printTemplateArgumentList(raw_ostream &OS,
                             ArrayRef<TemplateArgument> Args,
                             const PrintingPolicy &Policy,
                             const TemplateParameterList *TPL = nullptr);

5231void printTemplateArgumentList(raw_ostream &OS,
                             ArrayRef<TemplateArgumentLoc> Args,
                             const PrintingPolicy &Policy,
                             const TemplateParameterList *TPL = nullptr);

5236void printTemplateArgumentList(raw_ostream &OS,
                             const TemplateArgumentListInfo &Args,
                             const PrintingPolicy &Policy,
                             const TemplateParameterList *TPL = nullptr);

5241/// The injected class name of a C++ class template or class
5242/// template partial specialization.  Used to record that a type was
5243/// spelled with a bare identifier rather than as a template-id; the
5244/// equivalent for non-templated classes is just RecordType.
5245///
5246/// Injected class name types are always dependent.  Template
5247/// instantiation turns these into RecordTypes.
5248///
5249/// Injected class name types are always canonical.  This works
5250/// because it is impossible to compare an injected class name type
5251/// with the corresponding non-injected template type, for the same
5252/// reason that it is impossible to directly compare template
5253/// parameters from different dependent contexts: injected class name
5254/// types can only occur within the scope of a particular templated
5255/// declaration, and within that scope every template specialization
5256/// will canonicalize to the injected class name (when appropriate
5257/// according to the rules of the language).
5258class 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))((void)0);
  assert(!TST.hasQualifiers())((void)0);
  assert(TST->isDependentType())((void)0);
}

5288public:
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;
}
5307};

5309/// The kind of a tag type.
5310enum 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
5325};

5327/// The elaboration keyword that precedes a qualified type name or
5328/// introduces an elaborated-type-specifier.
5329enum 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
5351};

5353/// A helper class for Type nodes having an ElaboratedTypeKeyword.
5354/// The keyword in stored in the free bits of the base class.
5355/// Also provides a few static helpers for converting and printing
5356/// elaborated type keyword and tag type kind enumerations.
5357class TypeWithKeyword : public Type {
5358protected:
TypeWithKeyword(ElaboratedTypeKeyword Keyword, TypeClass tc,
                QualType Canonical, TypeDependence Dependence)
    : Type(tc, Canonical, Dependence) {
  TypeWithKeywordBits.Keyword = Keyword;
}

5365public:
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 *);
5395};

5397/// Represents a type that was referred to using an elaborated type
5398/// keyword, e.g., struct S, or via a qualified name, e.g., N::M::type,
5399/// or both.
5400///
5401/// This type is used to keep track of a type name as written in the
5402/// source code, including tag keywords and any nested-name-specifiers.
5403/// The type itself is always "sugar", used to express what was written
5404/// in the source code but containing no additional semantic information.
5405class 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) &&((void)0)
         "ElaboratedType cannot have elaborated type keyword "((void)0)
         "and name qualifier both null.")((void)0);
}

5444public:
/// 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; }
5478};

5480/// Represents a qualified type name for which the type name is
5481/// dependent.
5482///
5483/// DependentNameType represents a class of dependent types that involve a
5484/// possibly dependent nested-name-specifier (e.g., "T::") followed by a
5485/// name of a type. The DependentNameType may start with a "typename" (for a
5486/// typename-specifier), "class", "struct", "union", or "enum" (for a
5487/// dependent elaborated-type-specifier), or nothing (in contexts where we
5488/// know that we must be referring to a type, e.g., in a base class specifier).
5489/// Typically the nested-name-specifier is dependent, but in MSVC compatibility
5490/// mode, this type is used with non-dependent names to delay name lookup until
5491/// instantiation.
5492class 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) {}

5508public:
/// 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;
}
5538};

5540/// Represents a template specialization type whose template cannot be
5541/// resolved, e.g.
5542///   A<T>::template B<T>
5543class 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);
}

5568public:
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;
}
5610};

5612/// Represents a pack expansion of types.
5613///
5614/// Pack expansions are part of C++11 variadic templates. A pack
5615/// expansion contains a pattern, which itself contains one or more
5616/// "unexpanded" parameter packs. When instantiated, a pack expansion
5617/// produces a series of types, each instantiated from the pattern of
5618/// the expansion, where the Ith instantiation of the pattern uses the
5619/// Ith arguments bound to each of the unexpanded parameter packs. The
5620/// pack expansion is considered to "expand" these unexpanded
5621/// parameter packs.
5622///
5623/// \code
5624/// template<typename ...Types> struct tuple;
5625///
5626/// template<typename ...Types>
5627/// struct tuple_of_references {
5628///   typedef tuple<Types&...> type;
5629/// };
5630/// \endcode
5631///
5632/// Here, the pack expansion \c Types&... is represented via a
5633/// PackExpansionType whose pattern is Types&.
5634class 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;
}

5651public:
/// 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;
}
5683};

5685/// This class wraps the list of protocol qualifiers. For types that can
5686/// take ObjC protocol qualifers, they can subclass this class.
5687template <class T>
5688class ObjCProtocolQualifiers {
5689protected:
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() &&((void)0)
         "bitfield overflow in protocol count")((void)0);
  if (!protocols.empty())
    memcpy(getProtocolStorage(), protocols.data(),
           protocols.size() * sizeof(ObjCProtocolDecl*));
}

5713public:
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")((void)0);
  return qual_begin()[I];
}

/// Retrieve all of the protocol qualifiers.
ArrayRef<ObjCProtocolDecl *> getProtocols() const {
  return ArrayRef<ObjCProtocolDecl *>(qual_begin(), getNumProtocols());
}
5739};

5741/// Represents a type parameter type in Objective C. It can take
5742/// a list of protocols.
5743class 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);

5773public:
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; }
5788};

5790/// Represents a class type in Objective C.
5791///
5792/// Every Objective C type is a combination of a base type, a set of
5793/// type arguments (optional, for parameterized classes) and a list of
5794/// protocols.
5795///
5796/// Given the following declarations:
5797/// \code
5798///   \@class C<T>;
5799///   \@protocol P;
5800/// \endcode
5801///
5802/// 'C' is an ObjCInterfaceType C.  It is sugar for an ObjCObjectType
5803/// with base C and no protocols.
5804///
5805/// 'C<P>' is an unspecialized ObjCObjectType with base C and protocol list [P].
5806/// 'C<C*>' is a specialized ObjCObjectType with type arguments 'C*' and no
5807/// protocol list.
5808/// 'C<C*><P>' is a specialized ObjCObjectType with base C, type arguments 'C*',
5809/// and protocol list [P].
5810///
5811/// 'id' is a TypedefType which is sugar for an ObjCObjectPointerType whose
5812/// pointee is an ObjCObjectType with base BuiltinType::ObjCIdType
5813/// and no protocols.
5814///
5815/// 'id<P>' is an ObjCObjectPointerType whose pointee is an ObjCObjectType
5816/// with base BuiltinType::ObjCIdType and protocol list [P].  Eventually
5817/// this should get its own sugar class to better represent the source.
5818class 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;
}

5856protected:
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;

5874public:
/// 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?")((void)0);
  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;
}
5965};

5967/// A class providing a concrete implementation
5968/// of ObjCObjectType, so as to not increase the footprint of
5969/// ObjCInterfaceType.  Code outside of ASTContext and the core type
5970/// system should not reference this type.
5971class 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) {}

5983public:
void Profile(llvm::FoldingSetNodeID &ID);
static void Profile(llvm::FoldingSetNodeID &ID,
                    QualType Base,
                    ArrayRef<QualType> typeArgs,
                    ArrayRef<ObjCProtocolDecl *> protocols,
                    bool isKindOf);
5990};

5992inline QualType *ObjCObjectType::getTypeArgStorage() {
return reinterpret_cast<QualType *>(static_cast<ObjCObjectTypeImpl*>(this)+1);
5994}

5996inline ObjCProtocolDecl **ObjCObjectType::getProtocolStorageImpl() {
  return reinterpret_cast<ObjCProtocolDecl**>(
           getTypeArgStorage() + ObjCObjectTypeBits.NumTypeArgs);
5999}

6001inline ObjCProtocolDecl **ObjCTypeParamType::getProtocolStorageImpl() {
  return reinterpret_cast<ObjCProtocolDecl**>(
           static_cast<ObjCTypeParamType*>(this)+1);
6004}

6006/// Interfaces are the core concept in Objective-C for object oriented design.
6007/// They basically correspond to C++ classes.  There are two kinds of interface
6008/// types: normal interfaces like `NSString`, and qualified interfaces, which
6009/// are qualified with a protocol list like `NSString<NSCopyable, NSAmazing>`.
6010///
6011/// ObjCInterfaceType guarantees the following properties when considered
6012/// as a subtype of its superclass, ObjCObjectType:
6013///   - There are no protocol qualifiers.  To reinforce this, code which
6014///     tries to invoke the protocol methods via an ObjCInterfaceType will
6015///     fail to compile.
6016///   - It is its own base type.  That is, if T is an ObjCInterfaceType*,
6017///     T->getBaseType() == QualType(T, 0).
6018class 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)) {}

6030public:
/// 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
};
6052};

6054inline 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;
6064}

6066/// Represents a pointer to an Objective C object.
6067///
6068/// These are constructed from pointer declarators when the pointee type is
6069/// an ObjCObjectType (or sugar for one).  In addition, the 'id' and 'Class'
6070/// types are typedefs for these, and the protocol-qualified types 'id<P>'
6071/// and 'Class<P>' are translated into these.
6072///
6073/// Pointers to pointers to Objective C objects are still PointerTypes;
6074/// only the first level of pointer gets it own type implementation.
6075class 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) {}

6084public:
/// 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;
}
6243};

6245class 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) {}

6253public:
/// 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;
}
6272};

6274/// PipeType - OpenCL20.
6275class 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) {}

6285public:
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; }
6306};

6308/// A fixed int type of a specified bitwidth.
6309class ExtIntType final : public Type, public llvm::FoldingSetNode {
friend class ASTContext;
unsigned IsUnsigned : 1;
unsigned NumBits : 24;

6314protected:
ExtIntType(bool isUnsigned, unsigned NumBits);

6317public:
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; }
6336};

6338class DependentExtIntType final : public Type, public llvm::FoldingSetNode {
friend class ASTContext;
const ASTContext &Context;
llvm::PointerIntPair<Expr*, 1, bool> ExprAndUnsigned;

6343protected:
DependentExtIntType(const ASTContext &Context, bool IsUnsigned,
                    Expr *NumBits);

6347public:
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;
}
6364};

6366/// A qualifier set is used to build a set of qualifiers.
6367class QualifierCollector : public Qualifiers {
6368public:
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;
6389};

6391/// A container of type source information.
6392///
6393/// A client can read the relevant info using TypeLoc wrappers, e.g:
6394/// @code
6395/// TypeLoc TL = TypeSourceInfo->getTypeLoc();
6396/// TL.getBeginLoc().print(OS, SrcMgr);
6397/// @endcode
6398class 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) {}

6407public:
/// 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; }
6416};

6418// Inline function definitions.

6420inline SplitQualType SplitQualType::getSingleStepDesugaredType() const {
SplitQualType desugar =
  Ty->getLocallyUnqualifiedSingleStepDesugaredType().split();
desugar.Quals.addConsistentQualifiers(Quals);
return desugar;
6425}

6427inline const Type *QualType::getTypePtr() const {
return getCommonPtr()->BaseType;
6429}

6431inline const Type *QualType::getTypePtrOrNull() const {
return (isNull() ? nullptr : getCommonPtr()->BaseType);
6433}

6435inline 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);
6444}

6446inline Qualifiers QualType::getLocalQualifiers() const {
Qualifiers Quals;
if (hasLocalNonFastQualifiers())
  Quals = getExtQualsUnsafe()->getQualifiers();
Quals.addFastQualifiers(getLocalFastQualifiers());
return Quals;
6452}

6454inline Qualifiers QualType::getQualifiers() const {
Qualifiers quals = getCommonPtr()->CanonicalType.getLocalQualifiers();
quals.addFastQualifiers(getLocalFastQualifiers());
return quals;
6458}

6460inline unsigned QualType::getCVRQualifiers() const {
unsigned cvr = getCommonPtr()->CanonicalType.getLocalCVRQualifiers();
cvr |= getLocalCVRQualifiers();
return cvr;
6464}

6466inline QualType QualType::getCanonicalType() const {
QualType canon = getCommonPtr()->CanonicalType;
return canon.withFastQualifiers(getLocalFastQualifiers());
6469}

6471inline bool QualType::isCanonical() const {
return getTypePtr()->isCanonicalUnqualified();
6473}

6475inline 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);
6484}

6486inline bool QualType::isConstQualified() const {
return isLocalConstQualified() ||
       getCommonPtr()->CanonicalType.isLocalConstQualified();
6489}

6491inline bool QualType::isRestrictQualified() const {
return isLocalRestrictQualified() ||
       getCommonPtr()->CanonicalType.isLocalRestrictQualified();
6494}


6497inline bool QualType::isVolatileQualified() const {
return isLocalVolatileQualified() ||
       getCommonPtr()->CanonicalType.isLocalVolatileQualified();
6500}

6502inline bool QualType::hasQualifiers() const {
return hasLocalQualifiers() ||
       getCommonPtr()->CanonicalType.hasLocalQualifiers();
6505}

6507inline QualType QualType::getUnqualifiedType() const {
if (!getTypePtr()->getCanonicalTypeInternal().hasLocalQualifiers())
  return QualType(getTypePtr(), 0);

return QualType(getSplitUnqualifiedTypeImpl(*this).Ty, 0);
6512}

6514inline SplitQualType QualType::getSplitUnqualifiedType() const {
if (!getTypePtr()->getCanonicalTypeInternal().hasLocalQualifiers())
  return split();

return getSplitUnqualifiedTypeImpl(*this);
6519}

6521inline void QualType::removeLocalConst() {
removeLocalFastQualifiers(Qualifiers::Const);
6523}

6525inline void QualType::removeLocalRestrict() {
removeLocalFastQualifiers(Qualifiers::Restrict);
6527}

6529inline void QualType::removeLocalVolatile() {
removeLocalFastQualifiers(Qualifiers::Volatile);
6531}

6533inline void QualType::removeLocalCVRQualifiers(unsigned Mask) {
assert(!(Mask & ~Qualifiers::CVRMask) && "mask has non-CVR bits")((void)0);
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);
6540}

6542/// Check if this type has any address space qualifier.
6543inline bool QualType::hasAddressSpace() const {
return getQualifiers().hasAddressSpace();
6545}

6547/// Return the address space of this type.
6548inline LangAS QualType::getAddressSpace() const {
return getQualifiers().getAddressSpace();
6550}

6552/// Return the gc attribute of this type.
6553inline Qualifiers::GC QualType::getObjCGCAttr() const {
return getQualifiers().getObjCGCAttr();
6555}

6557inline bool QualType::hasNonTrivialToPrimitiveDefaultInitializeCUnion() const {
if (auto *RD = getTypePtr()->getBaseElementTypeUnsafe()->getAsRecordDecl())
  return hasNonTrivialToPrimitiveDefaultInitializeCUnion(RD);
return false;
6561}

6563inline bool QualType::hasNonTrivialToPrimitiveDestructCUnion() const {
if (auto *RD = getTypePtr()->getBaseElementTypeUnsafe()->getAsRecordDecl())
  return hasNonTrivialToPrimitiveDestructCUnion(RD);
return false;
6567}

6569inline bool QualType::hasNonTrivialToPrimitiveCopyCUnion() const {
if (auto *RD = getTypePtr()->getBaseElementTypeUnsafe()->getAsRecordDecl())
  return hasNonTrivialToPrimitiveCopyCUnion(RD);
return false;
6573}

6575inline 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();
6583}

6585inline FunctionType::ExtInfo getFunctionExtInfo(QualType t) {
return getFunctionExtInfo(*t);
6587}

6589/// Determine whether this type is more
6590/// qualified than the Other type. For example, "const volatile int"
6591/// is more qualified than "const int", "volatile int", and
6592/// "int". However, it is not more qualified than "const volatile
6593/// int".
6594inline bool QualType::isMoreQualifiedThan(QualType other) const {
Qualifiers MyQuals = getQualifiers();
Qualifiers OtherQuals = other.getQualifiers();
return (MyQuals != OtherQuals && MyQuals.compatiblyIncludes(OtherQuals));
6598}

6600/// Determine whether this type is at last
6601/// as qualified as the Other type. For example, "const volatile
6602/// int" is at least as qualified as "const int", "volatile int",
6603/// "int", and "const volatile int".
6604inline 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);
6612}

6614/// If Type is a reference type (e.g., const
6615/// int&), returns the type that the reference refers to ("const
6616/// int"). Otherwise, returns the type itself. This routine is used
6617/// throughout Sema to implement C++ 5p6:
6618///
6619///   If an expression initially has the type "reference to T" (8.3.2,
6620///   8.5.3), the type is adjusted to "T" prior to any further
6621///   analysis, the expression designates the object or function
6622///   denoted by the reference, and the expression is an lvalue.
6623inline QualType QualType::getNonReferenceType() const {
if (const auto *RefType = (*this)->getAs<ReferenceType>())
  return RefType->getPointeeType();
else
  return *this;
6628}

6630inline bool QualType::isCForbiddenLValueType() const {
return ((getTypePtr()->isVoidType() && !hasQualifiers()) ||
        getTypePtr()->isFunctionType());
6633}

6635/// Tests whether the type is categorized as a fundamental type.
6636///
6637/// \returns True for types specified in C++0x [basic.fundamental].
6638inline 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());
6644}

6646/// Tests whether the type is categorized as a compound type.
6647///
6648/// \returns True for types specified in C++0x [basic.compound].
6649inline 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();
6669}

6671inline bool Type::isFunctionType() const {
return isa<FunctionType>(CanonicalType);
6673}

6675inline bool Type::isPointerType() const {
return isa<PointerType>(CanonicalType);
6677}

6679inline bool Type::isAnyPointerType() const {
return isPointerType() || isObjCObjectPointerType();
6681}

6683inline bool Type::isBlockPointerType() const {
return isa<BlockPointerType>(CanonicalType);
6685}

6687inline bool Type::isReferenceType() const {
return isa<ReferenceType>(CanonicalType);
6689}

6691inline bool Type::isLValueReferenceType() const {
return isa<LValueReferenceType>(CanonicalType);
6693}

6695inline bool Type::isRValueReferenceType() const {
return isa<RValueReferenceType>(CanonicalType);
6697}

6699inline 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;
6707}

6709inline bool Type::isFunctionPointerType() const {
if (const auto *T = getAs<PointerType>())
  return T->getPointeeType()->isFunctionType();
else
  return false;
6714}

6716inline bool Type::isFunctionReferenceType() const {
if (const auto *T = getAs<ReferenceType>())
  return T->getPointeeType()->isFunctionType();
else
  return false;
6721}

6723inline bool Type::isMemberPointerType() const {
return isa<MemberPointerType>(CanonicalType);
6725}

6727inline bool Type::isMemberFunctionPointerType() const {
if (const auto *T = getAs<MemberPointerType>())
  return T->isMemberFunctionPointer();
else
  return false;
6732}

6734inline bool Type::isMemberDataPointerType() const {
if (const auto *T = getAs<MemberPointerType>())
  return T->isMemberDataPointer();
else
  return false;
6739}

6741inline bool Type::isArrayType() const {
return isa<ArrayType>(CanonicalType);
6743}

6745inline bool Type::isConstantArrayType() const {
return isa<ConstantArrayType>(CanonicalType);
6747}

6749inline bool Type::isIncompleteArrayType() const {
return isa<IncompleteArrayType>(CanonicalType);
6751}

6753inline bool Type::isVariableArrayType() const {
return isa<VariableArrayType>(CanonicalType);
6755}

6757inline bool Type::isDependentSizedArrayType() const {
return isa<DependentSizedArrayType>(CanonicalType);
6759}

6761inline bool Type::isBuiltinType() const {
return isa<BuiltinType>(CanonicalType);
6763}

6765inline bool Type::isRecordType() const {
return isa<RecordType>(CanonicalType);
6767}

6769inline bool Type::isEnumeralType() const {
return isa<EnumType>(CanonicalType);
6771}

6773inline bool Type::isAnyComplexType() const {
return isa<ComplexType>(CanonicalType);
6775}

6777inline bool Type::isVectorType() const {
return isa<VectorType>(CanonicalType);
6779}

6781inline bool Type::isExtVectorType() const {
return isa<ExtVectorType>(CanonicalType);
6783}

6785inline bool Type::isMatrixType() const {
return isa<MatrixType>(CanonicalType);
6787}

6789inline bool Type::isConstantMatrixType() const {
return isa<ConstantMatrixType>(CanonicalType);
6791}

6793inline bool Type::isDependentAddressSpaceType() const {
return isa<DependentAddressSpaceType>(CanonicalType);
6795}

6797inline bool Type::isObjCObjectPointerType() const {
return isa<ObjCObjectPointerType>(CanonicalType);
6799}

6801inline bool Type::isObjCObjectType() const {
return isa<ObjCObjectType>(CanonicalType);
6803}

6805inline bool Type::isObjCObjectOrInterfaceType() const {
return isa<ObjCInterfaceType>(CanonicalType) ||
  isa<ObjCObjectType>(CanonicalType);
6808}

6810inline bool Type::isAtomicType() const {
return isa<AtomicType>(CanonicalType);
6812}

6814inline bool Type::isUndeducedAutoType() const {
return isa<AutoType>(CanonicalType);
6816}

6818inline bool Type::isObjCQualifiedIdType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCQualifiedIdType();
return false;
6822}

6824inline bool Type::isObjCQualifiedClassType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCQualifiedClassType();
return false;
6828}

6830inline bool Type::isObjCIdType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCIdType();
return false;
6834}

6836inline bool Type::isObjCClassType() const {
if (const auto *OPT = getAs<ObjCObjectPointerType>())
  return OPT->isObjCClassType();
return false;
6840}

6842inline bool Type::isObjCSelType() const {
if (const auto *OPT = getAs<PointerType>())
  return OPT->getPointeeType()->isSpecificBuiltinType(BuiltinType::ObjCSel);
return false;
6846}

6848inline bool Type::isObjCBuiltinType() const {
return isObjCIdType() || isObjCClassType() || isObjCSelType();
6850}

6852inline bool Type::isDecltypeType() const {
return isa<DecltypeType>(this);
6854}

6856#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) \
inline bool Type::is##Id##Type() const { \
  return isSpecificBuiltinType(BuiltinType::Id); \
}
6860#include "clang/Basic/OpenCLImageTypes.def"

6862inline bool Type::isSamplerT() const {
return isSpecificBuiltinType(BuiltinType::OCLSampler);
6864}

6866inline bool Type::isEventT() const {
return isSpecificBuiltinType(BuiltinType::OCLEvent);
6868}

6870inline bool Type::isClkEventT() const {
return isSpecificBuiltinType(BuiltinType::OCLClkEvent);
6872}

6874inline bool Type::isQueueT() const {
return isSpecificBuiltinType(BuiltinType::OCLQueue);
6876}

6878inline bool Type::isReserveIDT() const {
return isSpecificBuiltinType(BuiltinType::OCLReserveID);
6880}

6882inline bool Type::isImageType() const {
6883#define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) is##Id##Type() ||
return
6885#include "clang/Basic/OpenCLImageTypes.def"
    false; // end boolean or operation
6887}

6889inline bool Type::isPipeType() const {
return isa<PipeType>(CanonicalType);
6891}

6893inline bool Type::isExtIntType() const {
return isa<ExtIntType>(CanonicalType);
6895}

6897#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) \
inline bool Type::is##Id##Type() const { \
  return isSpecificBuiltinType(BuiltinType::Id); \
}
6901#include "clang/Basic/OpenCLExtensionTypes.def"

6903inline bool Type::isOCLIntelSubgroupAVCType() const {
6904#define INTEL_SUBGROUP_AVC_TYPE(ExtType, Id) \
isOCLIntelSubgroupAVC##Id##Type() ||
return
6907#include "clang/Basic/OpenCLExtensionTypes.def"
  false; // end of boolean or operation
6909}

6911inline bool Type::isOCLExtOpaqueType() const {
6912#define EXT_OPAQUE_TYPE(ExtType, Id, Ext) is##Id##Type() ||
return
6914#include "clang/Basic/OpenCLExtensionTypes.def"
  false; // end of boolean or operation
6916}

6918inline bool Type::isOpenCLSpecificType() const {
return isSamplerT() || isEventT() || isImageType() || isClkEventT() ||
       isQueueT() || isReserveIDT() || isPipeType() || isOCLExtOpaqueType();
6921}

6923inline bool Type::isTemplateTypeParmType() const {
return isa<TemplateTypeParmType>(CanonicalType);
6925}

6927inline bool Type::isSpecificBuiltinType(unsigned K) const {
if (const BuiltinType *BT = getAs<BuiltinType>()) {
  return BT->getKind() == static_cast<BuiltinType::Kind>(K);
}
return false;
6932}

6934inline bool Type::isPlaceholderType() const {
if (const auto *BT = dyn_cast<BuiltinType>(this))
  return BT->isPlaceholderType();
return false;
6938}

6940inline const BuiltinType *Type::getAsPlaceholderType() const {
if (const auto *BT = dyn_cast<BuiltinType>(this))
  if (BT->isPlaceholderType())
    return BT;
return nullptr;
6945}

6947inline bool Type::isSpecificPlaceholderType(unsigned K) const {
assert(BuiltinType::isPlaceholderTypeKind((BuiltinType::Kind) K))((void)0);
return isSpecificBuiltinType(K);
6950}

6952inline bool Type::isNonOverloadPlaceholderType() const {
if (const auto *BT = dyn_cast<BuiltinType>(this))
  return BT->isNonOverloadPlaceholderType();
return false;
6956}

6958inline bool Type::isVoidType() const {
return isSpecificBuiltinType(BuiltinType::Void);
6960}

6962inline bool Type::isHalfType() const {
// FIXME: Should we allow complex __fp16? Probably not.
return isSpecificBuiltinType(BuiltinType::Half);
6965}

6967inline bool Type::isFloat16Type() const {
return isSpecificBuiltinType(BuiltinType::Float16);
6969}

6971inline bool Type::isBFloat16Type() const {
return isSpecificBuiltinType(BuiltinType::BFloat16);
6973}

6975inline bool Type::isFloat128Type() const {
return isSpecificBuiltinType(BuiltinType::Float128);
6977}

6979inline bool Type::isNullPtrType() const {
return isSpecificBuiltinType(BuiltinType::NullPtr);
6981}

6983bool IsEnumDeclComplete(EnumDecl *);
6984bool IsEnumDeclScoped(EnumDecl *);

6986inline 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();
6997}

6999inline bool Type::isFixedPointType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) {
  return BT->getKind() >= BuiltinType::ShortAccum &&
         BT->getKind() <= BuiltinType::SatULongFract;
}
return false;
7005}

7007inline bool Type::isFixedPointOrIntegerType() const {
return isFixedPointType() || isIntegerType();
7009}

7011inline bool Type::isSaturatedFixedPointType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) {
  return BT->getKind() >= BuiltinType::SatShortAccum &&
         BT->getKind() <= BuiltinType::SatULongFract;
}
return false;
7017}

7019inline bool Type::isUnsaturatedFixedPointType() const {
return isFixedPointType() && !isSaturatedFixedPointType();
7021}

7023inline 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;
7035}

7037inline bool Type::isUnsignedFixedPointType() const {
return isFixedPointType() && !isSignedFixedPointType();
7039}

7041inline 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();
7055}

7057inline 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();
7068}

7070inline bool Type::isBooleanType() const {
if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType))
  return BT->getKind() == BuiltinType::Bool;
return false;
7074}

7076inline bool Type::isUndeducedType() const {
auto *DT = getContainedDeducedType();
return DT && !DT->isDeduced();
7079}

7081/// Determines whether this is a type for which one can define
7082/// an overloaded operator.
7083inline bool Type::isOverloadableType() const {
return isDependentType() || isRecordType() || isEnumeralType();
7085}

7087/// Determines whether this type is written as a typedef-name.
7088inline bool Type::isTypedefNameType() const {
if (getAs<TypedefType>())
  return true;
if (auto *TST = getAs<TemplateSpecializationType>())
  return TST->isTypeAlias();
return false;
7094}

7096/// Determines whether this type can decay to a pointer type.
7097inline bool Type::canDecayToPointerType() const {
return isFunctionType() || isArrayType();
7099}

7101inline bool Type::hasPointerRepresentation() const {
return (isPointerType() || isReferenceType() || isBlockPointerType() ||
        isObjCObjectPointerType() || isNullPtrType());
7104}

7106inline bool Type::hasObjCPointerRepresentation() const {
return isObjCObjectPointerType();
7108}

7110inline const Type *Type::getBaseElementTypeUnsafe() const {
const Type *type = this;
while (const ArrayType *arrayType = type->getAsArrayTypeUnsafe())
  type = arrayType->getElementType().getTypePtr();
return type;
7115}

7117inline 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;
7124}
7125/// Insertion operator for partial diagnostics. This allows sending adress
7126/// spaces into a diagnostic with <<.
7127inline const StreamingDiagnostic &operator<<(const StreamingDiagnostic &PD,
                                           LangAS AS) {
PD.AddTaggedVal(static_cast<std::underlying_type_t<LangAS>>(AS),
                DiagnosticsEngine::ArgumentKind::ak_addrspace);
return PD;
7132}

7134/// Insertion operator for partial diagnostics. This allows sending Qualifiers
7135/// into a diagnostic with <<.
7136inline const StreamingDiagnostic &operator<<(const StreamingDiagnostic &PD,
                                           Qualifiers Q) {
PD.AddTaggedVal(Q.getAsOpaqueValue(),
                DiagnosticsEngine::ArgumentKind::ak_qual);
return PD;
7141}

7143/// Insertion operator for partial diagnostics.  This allows sending QualType's
7144/// into a diagnostic with <<.
7145inline const StreamingDiagnostic &operator<<(const StreamingDiagnostic &PD,
                                           QualType T) {
PD.AddTaggedVal(reinterpret_cast<intptr_t>(T.getAsOpaquePtr()),
                DiagnosticsEngine::ak_qualtype);
return PD;
7150}

7152// Helper class template that is used by Type::getAs to ensure that one does
7153// not try to look through a qualified type to get to an array type.
7154template <typename T>
7155using TypeIsArrayType =
  std::integral_constant<bool, std::is_same<T, ArrayType>::value ||
                                   std::is_base_of<ArrayType, T>::value>;

7159// Member-template getAs<specific type>'.
7160template <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());
7175}

7177template <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);
7209}

7211inline 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());
7223}

7225template <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))((void)0);
return cast<T>(getUnqualifiedDesugaredType());
7232}

7234inline const ArrayType *Type::castAsArrayTypeUnsafe() const {
assert(isa<ArrayType>(CanonicalType))((void)0);
if (const auto *arr = dyn_cast<ArrayType>(this)) return arr;
return cast<ArrayType>(getUnqualifiedDesugaredType());
7238}

7240DecayedType::DecayedType(QualType OriginalType, QualType DecayedPtr,
                       QualType CanonicalPtr)
  : AdjustedType(Decayed, OriginalType, DecayedPtr, CanonicalPtr) {
7243#ifndef NDEBUG1
QualType Adjusted = getAdjustedType();
(void)AttributedType::stripOuterNullability(Adjusted);
assert(isa<PointerType>(Adjusted))((void)0);
7247#endif
7248}

7250QualType DecayedType::getPointeeType() const {
QualType Decayed = getDecayedType();
(void)AttributedType::stripOuterNullability(Decayed);
return cast<PointerType>(Decayed)->getPointeeType();
7254}

7256// Get the decimal string representation of a fixed point type, represented
7257// as a scaled integer.
7258// TODO: At some point, we should change the arguments to instead just accept an
7259// APFixedPoint instead of APSInt and scale.
7260void FixedPointValueToString(SmallVectorImpl<char> &Str, llvm::APSInt Val,
                           unsigned Scale);

7263} // namespace clang

7265#endif // LLVM_CLANG_AST_TYPE_H

←

/usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/llvm/include/llvm/ADT/PointerUnion.h

1//===- llvm/ADT/PointerUnion.h - Discriminated Union of 2 Ptrs --*- 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 PointerUnion class, which is a discriminated union of
10// pointer types.
11//
12//===----------------------------------------------------------------------===//

14#ifndef LLVM_ADT_POINTERUNION_H
15#define LLVM_ADT_POINTERUNION_H

17#include "llvm/ADT/DenseMapInfo.h"
18#include "llvm/ADT/PointerIntPair.h"
19#include "llvm/Support/PointerLikeTypeTraits.h"
20#include <cassert>
21#include <cstddef>
22#include <cstdint>

24namespace llvm {

26template <typename T> struct PointerUnionTypeSelectorReturn {
using Return = T;
28};

30/// Get a type based on whether two types are the same or not.
31///
32/// For:
33///
34/// \code
35///   using Ret = typename PointerUnionTypeSelector<T1, T2, EQ, NE>::Return;
36/// \endcode
37///
38/// Ret will be EQ type if T1 is same as T2 or NE type otherwise.
39template <typename T1, typename T2, typename RET_EQ, typename RET_NE>
40struct PointerUnionTypeSelector {
using Return = typename PointerUnionTypeSelectorReturn<RET_NE>::Return;
42};

44template <typename T, typename RET_EQ, typename RET_NE>
45struct PointerUnionTypeSelector<T, T, RET_EQ, RET_NE> {
using Return = typename PointerUnionTypeSelectorReturn<RET_EQ>::Return;
47};

49template <typename T1, typename T2, typename RET_EQ, typename RET_NE>
50struct PointerUnionTypeSelectorReturn<
  PointerUnionTypeSelector<T1, T2, RET_EQ, RET_NE>> {
using Return =
    typename PointerUnionTypeSelector<T1, T2, RET_EQ, RET_NE>::Return;
54};

56namespace pointer_union_detail {
/// Determine the number of bits required to store integers with values < n.
/// This is ceil(log2(n)).
constexpr int bitsRequired(unsigned n) {
  return n > 1 ? 1 + bitsRequired((n + 1) / 2) : 0;
}

template <typename... Ts> constexpr int lowBitsAvailable() {
  return std::min<int>({PointerLikeTypeTraits<Ts>::NumLowBitsAvailable...});
}

/// Find the index of a type in a list of types. TypeIndex<T, Us...>::Index
/// is the index of T in Us, or sizeof...(Us) if T does not appear in the
/// list.
template <typename T, typename ...Us> struct TypeIndex;
template <typename T, typename ...Us> struct TypeIndex<T, T, Us...> {
  static constexpr int Index = 0;
};
template <typename T, typename U, typename... Us>
struct TypeIndex<T, U, Us...> {
  static constexpr int Index = 1 + TypeIndex<T, Us...>::Index;
};
template <typename T> struct TypeIndex<T> {
  static constexpr int Index = 0;
};

/// Find the first type in a list of types.
template <typename T, typename...> struct GetFirstType {
  using type = T;
};

/// Provide PointerLikeTypeTraits for void* that is used by PointerUnion
/// for the template arguments.
template <typename ...PTs> class PointerUnionUIntTraits {
public:
  static inline void *getAsVoidPointer(void *P) { return P; }
  static inline void *getFromVoidPointer(void *P) { return P; }
  static constexpr int NumLowBitsAvailable = lowBitsAvailable<PTs...>();
};

template <typename Derived, typename ValTy, int I, typename ...Types>
class PointerUnionMembers;

template <typename Derived, typename ValTy, int I>
class PointerUnionMembers<Derived, ValTy, I> {
protected:
  ValTy Val;
  PointerUnionMembers() = default;
  PointerUnionMembers(ValTy Val) : Val(Val) {}

  friend struct PointerLikeTypeTraits<Derived>;
};

template <typename Derived, typename ValTy, int I, typename Type,
          typename ...Types>
class PointerUnionMembers<Derived, ValTy, I, Type, Types...>
    : public PointerUnionMembers<Derived, ValTy, I + 1, Types...> {
  using Base = PointerUnionMembers<Derived, ValTy, I + 1, Types...>;
public:
  using Base::Base;
  PointerUnionMembers() = default;
  PointerUnionMembers(Type V)
      : Base(ValTy(const_cast<void *>(
                       PointerLikeTypeTraits<Type>::getAsVoidPointer(V)),
                   I)) {}

  using Base::operator=;
  Derived &operator=(Type V) {
    this->Val = ValTy(
        const_cast<void *>(PointerLikeTypeTraits<Type>::getAsVoidPointer(V)),
        I);
    return static_cast<Derived &>(*this);
  };
};
130}

132/// A discriminated union of two or more pointer types, with the discriminator
133/// in the low bit of the pointer.
134///
135/// This implementation is extremely efficient in space due to leveraging the
136/// low bits of the pointer, while exposing a natural and type-safe API.
137///
138/// Common use patterns would be something like this:
139///    PointerUnion<int*, float*> P;
140///    P = (int*)0;
141///    printf("%d %d", P.is<int*>(), P.is<float*>());  // prints "1 0"
142///    X = P.get<int*>();     // ok.
143///    Y = P.get<float*>();   // runtime assertion failure.
144///    Z = P.get<double*>();  // compile time failure.
145///    P = (float*)0;
146///    Y = P.get<float*>();   // ok.
147///    X = P.get<int*>();     // runtime assertion failure.
148template <typename... PTs>
149class PointerUnion
  : public pointer_union_detail::PointerUnionMembers<
        PointerUnion<PTs...>,
        PointerIntPair<
            void *, pointer_union_detail::bitsRequired(sizeof...(PTs)), int,
            pointer_union_detail::PointerUnionUIntTraits<PTs...>>,
        0, PTs...> {
// The first type is special because we want to directly cast a pointer to a
// default-initialized union to a pointer to the first type. But we don't
// want PointerUnion to be a 'template <typename First, typename ...Rest>'
// because it's much more convenient to have a name for the whole pack. So
// split off the first type here.
using First = typename pointer_union_detail::GetFirstType<PTs...>::type;
using Base = typename PointerUnion::PointerUnionMembers;

164public:
PointerUnion() = default;

PointerUnion(std::nullptr_t) : PointerUnion() {}
using Base::Base;

/// Test if the pointer held in the union is null, regardless of
/// which type it is.
bool isNull() const { return !this->Val.getPointer(); }
31
←
Assuming the condition is false→
32
←
Returning zero, which participates in a condition later→

explicit operator bool() const { return !isNull(); }

/// Test if the Union currently holds the type matching T.
template <typename T> bool is() const {
  constexpr int Index = pointer_union_detail::TypeIndex<T, PTs...>::Index;
  static_assert(Index < sizeof...(PTs),
                "PointerUnion::is<T> given type not in the union");
  return this->Val.getInt() == Index;
}

/// Returns the value of the specified pointer type.
///
/// If the specified pointer type is incorrect, assert.
template <typename T> T get() const {
  assert(is<T>() && "Invalid accessor called")((void)0);
  return PointerLikeTypeTraits<T>::getFromVoidPointer(this->Val.getPointer());
}

/// Returns the current pointer if it is of the specified pointer type,
/// otherwise returns null.
template <typename T> T dyn_cast() const {
  if (is<T>())
    return get<T>();
  return T();
}

/// If the union is set to the first pointer type get an address pointing to
/// it.
First const *getAddrOfPtr1() const {
  return const_cast<PointerUnion *>(this)->getAddrOfPtr1();
}

/// If the union is set to the first pointer type get an address pointing to
/// it.
First *getAddrOfPtr1() {
  assert(is<First>() && "Val is not the first pointer")((void)0);
  assert(((void)0)
      PointerLikeTypeTraits<First>::getAsVoidPointer(get<First>()) ==((void)0)
          this->Val.getPointer() &&((void)0)
      "Can't get the address because PointerLikeTypeTraits changes the ptr")((void)0);
  return const_cast<First *>(
      reinterpret_cast<const First *>(this->Val.getAddrOfPointer()));
}

/// Assignment from nullptr which just clears the union.
const PointerUnion &operator=(std::nullptr_t) {
  this->Val.initWithPointer(nullptr);
  return *this;
}

/// Assignment from elements of the union.
using Base::operator=;

void *getOpaqueValue() const { return this->Val.getOpaqueValue(); }
static inline PointerUnion getFromOpaqueValue(void *VP) {
  PointerUnion V;
  V.Val = decltype(V.Val)::getFromOpaqueValue(VP);
  return V;
}
233};

235template <typename ...PTs>
236bool operator==(PointerUnion<PTs...> lhs, PointerUnion<PTs...> rhs) {
return lhs.getOpaqueValue() == rhs.getOpaqueValue();
238}

240template <typename ...PTs>
241bool operator!=(PointerUnion<PTs...> lhs, PointerUnion<PTs...> rhs) {
return lhs.getOpaqueValue() != rhs.getOpaqueValue();
243}

245template <typename ...PTs>
246bool operator<(PointerUnion<PTs...> lhs, PointerUnion<PTs...> rhs) {
return lhs.getOpaqueValue() < rhs.getOpaqueValue();
248}

250// Teach SmallPtrSet that PointerUnion is "basically a pointer", that has
251// # low bits available = min(PT1bits,PT2bits)-1.
252template <typename ...PTs>
253struct PointerLikeTypeTraits<PointerUnion<PTs...>> {
static inline void *getAsVoidPointer(const PointerUnion<PTs...> &P) {
  return P.getOpaqueValue();
}

static inline PointerUnion<PTs...> getFromVoidPointer(void *P) {
  return PointerUnion<PTs...>::getFromOpaqueValue(P);
}

// The number of bits available are the min of the pointer types minus the
// bits needed for the discriminator.
static constexpr int NumLowBitsAvailable = PointerLikeTypeTraits<decltype(
    PointerUnion<PTs...>::Val)>::NumLowBitsAvailable;
266};

268// Teach DenseMap how to use PointerUnions as keys.
269template <typename ...PTs> struct DenseMapInfo<PointerUnion<PTs...>> {
using Union = PointerUnion<PTs...>;
using FirstInfo =
    DenseMapInfo<typename pointer_union_detail::GetFirstType<PTs...>::type>;

static inline Union getEmptyKey() { return Union(FirstInfo::getEmptyKey()); }

static inline Union getTombstoneKey() {
  return Union(FirstInfo::getTombstoneKey());
}

static unsigned getHashValue(const Union &UnionVal) {
  intptr_t key = (intptr_t)UnionVal.getOpaqueValue();
  return DenseMapInfo<intptr_t>::getHashValue(key);
}

static bool isEqual(const Union &LHS, const Union &RHS) {
  return LHS == RHS;
}
288};

290} // end namespace llvm

292#endif // LLVM_ADT_POINTERUNION_H