/usr/src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/clang/include/clang/AST/OpenMPClause.h

Bug Summary

File:	src/gnu/usr.bin/clang/libclangSerialization/../../../llvm/clang/include/clang/AST/OpenMPClause.h
Warning:	line 8423, column 13 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)
  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 =
            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;
}

// 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) {
  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) {
  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) {
  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 ||
    (Type != MK_ImplicitModule && Type != MK_ExplicitModule &&
     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) {
  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)
  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)
  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)
  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) {
  if (unsigned String = SpecialTypes[SPECIAL_TYPE_CF_CONSTANT_STRING]) {
    if (!Context.CFConstantStringTypeDecl)
      Context.setCFConstantStringType(GetType(String));
  }

  if (unsigned File = SpecialTypes[SPECIAL_TYPE_FILE]) {
    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]) {
    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]) {
    QualType Sigjmp_bufType = GetType(Sigjmp_buf);
    if (Sigjmp_bufType.isNull()) {
      Error("sigjmp_buf type is NULL");
      return;
    }

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

  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();
8
←
Calling 'OMPClauseReader::readClause'→
11727}

11729OMPClause *OMPClauseReader::readClause() {
OMPClause *C = nullptr;
9
←
'C' initialized to a null pointer value→
switch (llvm::omp::Clause(Record.readInt())) {
10
←
Control jumps to the 'default' case at line 12011→
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;
11
←
 Execution continues on line 12014→
}
assert(C && "Unknown OMPClause type")((void)0);

Visit(C);
12
←
Passing null pointer value via 1st parameter 'S'→
13
←
Calling 'OMPClauseVisitorBase::Visit'→
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)
1
Assuming 'Data' is non-null→
2
←
Taking false branch→
  return;
if (Reader->ReadingKind == ASTReader::Read_Stmt) {
3
←
Assuming field 'ReadingKind' is not equal to Read_Stmt→
4
←
Taking false branch→
  // Skip NumClauses, NumChildren and HasAssociatedStmt fields.
  skipInts(3);
}
SmallVector<OMPClause *, 4> Clauses(Data->getNumClauses());
for (unsigned I = 0, E = Data->getNumClauses(); I < E; ++I)
5
←
Assuming 'I' is < 'E'→
6
←
Loop condition is true.  Entering loop body→
  Clauses[I] = readOMPClause();
7
←
Calling 'ASTRecordReader::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/OpenMPClause.h

1//===- OpenMPClause.h - Classes for OpenMP clauses --------------*- 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/// This file defines OpenMP AST classes for clauses.
11/// There are clauses for executable directives, clauses for declarative
12/// directives and clauses which can be used in both kinds of directives.
13//
14//===----------------------------------------------------------------------===//

16#ifndef LLVM_CLANG_AST_OPENMPCLAUSE_H
17#define LLVM_CLANG_AST_OPENMPCLAUSE_H

19#include "clang/AST/ASTFwd.h"
20#include "clang/AST/Decl.h"
21#include "clang/AST/DeclarationName.h"
22#include "clang/AST/Expr.h"
23#include "clang/AST/NestedNameSpecifier.h"
24#include "clang/AST/Stmt.h"
25#include "clang/AST/StmtIterator.h"
26#include "clang/Basic/LLVM.h"
27#include "clang/Basic/OpenMPKinds.h"
28#include "clang/Basic/SourceLocation.h"
29#include "llvm/ADT/ArrayRef.h"
30#include "llvm/ADT/MapVector.h"
31#include "llvm/ADT/PointerIntPair.h"
32#include "llvm/ADT/SmallVector.h"
33#include "llvm/ADT/iterator.h"
34#include "llvm/ADT/iterator_range.h"
35#include "llvm/Frontend/OpenMP/OMPConstants.h"
36#include "llvm/Frontend/OpenMP/OMPContext.h"
37#include "llvm/Support/Casting.h"
38#include "llvm/Support/Compiler.h"
39#include "llvm/Support/TrailingObjects.h"
40#include <cassert>
41#include <cstddef>
42#include <iterator>
43#include <utility>

45namespace clang {

47class ASTContext;

49//===----------------------------------------------------------------------===//
50// AST classes for clauses.
51//===----------------------------------------------------------------------===//

53/// This is a basic class for representing single OpenMP clause.
54class OMPClause {
/// Starting location of the clause (the clause keyword).
SourceLocation StartLoc;

/// Ending location of the clause.
SourceLocation EndLoc;

/// Kind of the clause.
OpenMPClauseKind Kind;

64protected:
OMPClause(OpenMPClauseKind K, SourceLocation StartLoc, SourceLocation EndLoc)
    : StartLoc(StartLoc), EndLoc(EndLoc), Kind(K) {}

68public:
/// Returns the starting location of the clause.
SourceLocation getBeginLoc() const { return StartLoc; }

/// Returns the ending location of the clause.
SourceLocation getEndLoc() const { return EndLoc; }

/// Sets the starting location of the clause.
void setLocStart(SourceLocation Loc) { StartLoc = Loc; }

/// Sets the ending location of the clause.
void setLocEnd(SourceLocation Loc) { EndLoc = Loc; }

/// Returns kind of OpenMP clause (private, shared, reduction, etc.).
OpenMPClauseKind getClauseKind() const { return Kind; }

bool isImplicit() const { return StartLoc.isInvalid(); }

using child_iterator = StmtIterator;
using const_child_iterator = ConstStmtIterator;
using child_range = llvm::iterator_range<child_iterator>;
using const_child_range = llvm::iterator_range<const_child_iterator>;

child_range children();
const_child_range children() const {
  auto Children = const_cast<OMPClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

/// Get the iterator range for the expressions used in the clauses. Used
/// expressions include only the children that must be evaluated at the
/// runtime before entering the construct.
child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *) { return true; }
107};

109/// Class that handles pre-initialization statement for some clauses, like
110/// 'shedule', 'firstprivate' etc.
111class OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Pre-initialization statement for the clause.
Stmt *PreInit = nullptr;

/// Region that captures the associated stmt.
OpenMPDirectiveKind CaptureRegion = llvm::omp::OMPD_unknown;

120protected:
OMPClauseWithPreInit(const OMPClause *This) {
  assert(get(This) && "get is not tuned for pre-init.")((void)0);
}

/// Set pre-initialization statement for the clause.
void
setPreInitStmt(Stmt *S,
               OpenMPDirectiveKind ThisRegion = llvm::omp::OMPD_unknown) {
  PreInit = S;
  CaptureRegion = ThisRegion;
}

133public:
/// Get pre-initialization statement for the clause.
const Stmt *getPreInitStmt() const { return PreInit; }

/// Get pre-initialization statement for the clause.
Stmt *getPreInitStmt() { return PreInit; }

/// Get capture region for the stmt in the clause.
OpenMPDirectiveKind getCaptureRegion() const { return CaptureRegion; }

static OMPClauseWithPreInit *get(OMPClause *C);
static const OMPClauseWithPreInit *get(const OMPClause *C);
145};

147/// Class that handles post-update expression for some clauses, like
148/// 'lastprivate', 'reduction' etc.
149class OMPClauseWithPostUpdate : public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Post-update expression for the clause.
Expr *PostUpdate = nullptr;

155protected:
OMPClauseWithPostUpdate(const OMPClause *This) : OMPClauseWithPreInit(This) {
  assert(get(This) && "get is not tuned for post-update.")((void)0);
}

/// Set pre-initialization statement for the clause.
void setPostUpdateExpr(Expr *S) { PostUpdate = S; }

163public:
/// Get post-update expression for the clause.
const Expr *getPostUpdateExpr() const { return PostUpdate; }

/// Get post-update expression for the clause.
Expr *getPostUpdateExpr() { return PostUpdate; }

static OMPClauseWithPostUpdate *get(OMPClause *C);
static const OMPClauseWithPostUpdate *get(const OMPClause *C);
172};

174/// This structure contains most locations needed for by an OMPVarListClause.
175struct OMPVarListLocTy {
/// Starting location of the clause (the clause keyword).
SourceLocation StartLoc;
/// Location of '('.
SourceLocation LParenLoc;
/// Ending location of the clause.
SourceLocation EndLoc;
OMPVarListLocTy() = default;
OMPVarListLocTy(SourceLocation StartLoc, SourceLocation LParenLoc,
                SourceLocation EndLoc)
    : StartLoc(StartLoc), LParenLoc(LParenLoc), EndLoc(EndLoc) {}
186};

188/// This represents clauses with the list of variables like 'private',
189/// 'firstprivate', 'copyin', 'shared', or 'reduction' clauses in the
190/// '#pragma omp ...' directives.
191template <class T> class OMPVarListClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Number of variables in the list.
unsigned NumVars;

200protected:
/// Build a clause with \a N variables
///
/// \param K Kind of the clause.
/// \param StartLoc Starting location of the clause (the clause keyword).
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPVarListClause(OpenMPClauseKind K, SourceLocation StartLoc,
                 SourceLocation LParenLoc, SourceLocation EndLoc, unsigned N)
    : OMPClause(K, StartLoc, EndLoc), LParenLoc(LParenLoc), NumVars(N) {}

/// Fetches list of variables associated with this clause.
MutableArrayRef<Expr *> getVarRefs() {
  return MutableArrayRef<Expr *>(
      static_cast<T *>(this)->template getTrailingObjects<Expr *>(), NumVars);
}

/// Sets the list of variables for this clause.
void setVarRefs(ArrayRef<Expr *> VL) {
  assert(VL.size() == NumVars &&((void)0)
         "Number of variables is not the same as the preallocated buffer")((void)0);
  std::copy(VL.begin(), VL.end(),
            static_cast<T *>(this)->template getTrailingObjects<Expr *>());
}

226public:
using varlist_iterator = MutableArrayRef<Expr *>::iterator;
using varlist_const_iterator = ArrayRef<const Expr *>::iterator;
using varlist_range = llvm::iterator_range<varlist_iterator>;
using varlist_const_range = llvm::iterator_range<varlist_const_iterator>;

unsigned varlist_size() const { return NumVars; }
bool varlist_empty() const { return NumVars == 0; }

varlist_range varlists() {
  return varlist_range(varlist_begin(), varlist_end());
}
varlist_const_range varlists() const {
  return varlist_const_range(varlist_begin(), varlist_end());
}

varlist_iterator varlist_begin() { return getVarRefs().begin(); }
varlist_iterator varlist_end() { return getVarRefs().end(); }
varlist_const_iterator varlist_begin() const { return getVarRefs().begin(); }
varlist_const_iterator varlist_end() const { return getVarRefs().end(); }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Fetches list of all variables in the clause.
ArrayRef<const Expr *> getVarRefs() const {
  return llvm::makeArrayRef(
      static_cast<const T *>(this)->template getTrailingObjects<Expr *>(),
      NumVars);
}
259};

261/// This represents 'allocator' clause in the '#pragma omp ...'
262/// directive.
263///
264/// \code
265/// #pragma omp allocate(a) allocator(omp_default_mem_alloc)
266/// \endcode
267/// In this example directive '#pragma omp allocate' has simple 'allocator'
268/// clause with the allocator 'omp_default_mem_alloc'.
269class OMPAllocatorClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Expression with the allocator.
Stmt *Allocator = nullptr;

/// Set allocator.
void setAllocator(Expr *A) { Allocator = A; }

281public:
/// Build 'allocator' clause with the given allocator.
///
/// \param A Allocator.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPAllocatorClause(Expr *A, SourceLocation StartLoc, SourceLocation LParenLoc,
                   SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_allocator, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Allocator(A) {}

/// Build an empty clause.
OMPAllocatorClause()
    : OMPClause(llvm::omp::OMPC_allocator, SourceLocation(),
                SourceLocation()) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns allocator.
Expr *getAllocator() const { return cast_or_null<Expr>(Allocator); }

child_range children() { return child_range(&Allocator, &Allocator + 1); }

const_child_range children() const {
  return const_child_range(&Allocator, &Allocator + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_allocator;
}
323};

325/// This represents clause 'allocate' in the '#pragma omp ...' directives.
326///
327/// \code
328/// #pragma omp parallel private(a) allocate(omp_default_mem_alloc :a)
329/// \endcode
330/// In this example directive '#pragma omp parallel' has clause 'private'
331/// and clause 'allocate' for the variable 'a'.
332class OMPAllocateClause final
  : public OMPVarListClause<OMPAllocateClause>,
    private llvm::TrailingObjects<OMPAllocateClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Allocator specified in the clause, or 'nullptr' if the default one is
/// used.
Expr *Allocator = nullptr;
/// Position of the ':' delimiter in the clause;
SourceLocation ColonLoc;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param Allocator Allocator expression.
/// \param ColonLoc Location of ':' delimiter.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPAllocateClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                  Expr *Allocator, SourceLocation ColonLoc,
                  SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPAllocateClause>(llvm::omp::OMPC_allocate, StartLoc,
                                          LParenLoc, EndLoc, N),
      Allocator(Allocator), ColonLoc(ColonLoc) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPAllocateClause(unsigned N)
    : OMPVarListClause<OMPAllocateClause>(llvm::omp::OMPC_allocate,
                                          SourceLocation(), SourceLocation(),
                                          SourceLocation(), N) {}

/// Sets location of ':' symbol in clause.
void setColonLoc(SourceLocation CL) { ColonLoc = CL; }

void setAllocator(Expr *A) { Allocator = A; }

373public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param Allocator Allocator expression.
/// \param ColonLoc Location of ':' delimiter.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
static OMPAllocateClause *Create(const ASTContext &C, SourceLocation StartLoc,
                                 SourceLocation LParenLoc, Expr *Allocator,
                                 SourceLocation ColonLoc,
                                 SourceLocation EndLoc, ArrayRef<Expr *> VL);

/// Returns the allocator expression or nullptr, if no allocator is specified.
Expr *getAllocator() const { return Allocator; }

/// Returns the location of the ':' delimiter.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPAllocateClause *CreateEmpty(const ASTContext &C, unsigned N);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPAllocateClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_allocate;
}
420};

422/// This represents 'if' clause in the '#pragma omp ...' directive.
423///
424/// \code
425/// #pragma omp parallel if(parallel:a > 5)
426/// \endcode
427/// In this example directive '#pragma omp parallel' has simple 'if' clause with
428/// condition 'a > 5' and directive name modifier 'parallel'.
429class OMPIfClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Condition of the 'if' clause.
Stmt *Condition = nullptr;

/// Location of ':' (if any).
SourceLocation ColonLoc;

/// Directive name modifier for the clause.
OpenMPDirectiveKind NameModifier = llvm::omp::OMPD_unknown;

/// Name modifier location.
SourceLocation NameModifierLoc;

/// Set condition.
void setCondition(Expr *Cond) { Condition = Cond; }

/// Set directive name modifier for the clause.
void setNameModifier(OpenMPDirectiveKind NM) { NameModifier = NM; }

/// Set location of directive name modifier for the clause.
void setNameModifierLoc(SourceLocation Loc) { NameModifierLoc = Loc; }

/// Set location of ':'.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

459public:
/// Build 'if' clause with condition \a Cond.
///
/// \param NameModifier [OpenMP 4.1] Directive name modifier of clause.
/// \param Cond Condition of the clause.
/// \param HelperCond Helper condition for the clause.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param NameModifierLoc Location of directive name modifier.
/// \param ColonLoc [OpenMP 4.1] Location of ':'.
/// \param EndLoc Ending location of the clause.
OMPIfClause(OpenMPDirectiveKind NameModifier, Expr *Cond, Stmt *HelperCond,
            OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
            SourceLocation LParenLoc, SourceLocation NameModifierLoc,
            SourceLocation ColonLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_if, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Condition(Cond),
      ColonLoc(ColonLoc), NameModifier(NameModifier),
      NameModifierLoc(NameModifierLoc) {
  setPreInitStmt(HelperCond, CaptureRegion);
}

/// Build an empty clause.
OMPIfClause()
    : OMPClause(llvm::omp::OMPC_if, SourceLocation(), SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return the location of ':'.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Returns condition.
Expr *getCondition() const { return cast_or_null<Expr>(Condition); }

/// Return directive name modifier associated with the clause.
OpenMPDirectiveKind getNameModifier() const { return NameModifier; }

/// Return the location of directive name modifier.
SourceLocation getNameModifierLoc() const { return NameModifierLoc; }

child_range children() { return child_range(&Condition, &Condition + 1); }

const_child_range children() const {
  return const_child_range(&Condition, &Condition + 1);
}

child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPIfClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_if;
}
521};

523/// This represents 'final' clause in the '#pragma omp ...' directive.
524///
525/// \code
526/// #pragma omp task final(a > 5)
527/// \endcode
528/// In this example directive '#pragma omp task' has simple 'final'
529/// clause with condition 'a > 5'.
530class OMPFinalClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Condition of the 'if' clause.
Stmt *Condition = nullptr;

/// Set condition.
void setCondition(Expr *Cond) { Condition = Cond; }

542public:
/// Build 'final' clause with condition \a Cond.
///
/// \param Cond Condition of the clause.
/// \param HelperCond Helper condition for the construct.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPFinalClause(Expr *Cond, Stmt *HelperCond,
               OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
               SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_final, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Condition(Cond) {
  setPreInitStmt(HelperCond, CaptureRegion);
}

/// Build an empty clause.
OMPFinalClause()
    : OMPClause(llvm::omp::OMPC_final, SourceLocation(), SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns condition.
Expr *getCondition() const { return cast_or_null<Expr>(Condition); }

child_range children() { return child_range(&Condition, &Condition + 1); }

const_child_range children() const {
  return const_child_range(&Condition, &Condition + 1);
}

child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPFinalClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_final;
}
589};

591/// This represents 'num_threads' clause in the '#pragma omp ...'
592/// directive.
593///
594/// \code
595/// #pragma omp parallel num_threads(6)
596/// \endcode
597/// In this example directive '#pragma omp parallel' has simple 'num_threads'
598/// clause with number of threads '6'.
599class OMPNumThreadsClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Condition of the 'num_threads' clause.
Stmt *NumThreads = nullptr;

/// Set condition.
void setNumThreads(Expr *NThreads) { NumThreads = NThreads; }

611public:
/// Build 'num_threads' clause with condition \a NumThreads.
///
/// \param NumThreads Number of threads for the construct.
/// \param HelperNumThreads Helper Number of threads for the construct.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPNumThreadsClause(Expr *NumThreads, Stmt *HelperNumThreads,
                    OpenMPDirectiveKind CaptureRegion,
                    SourceLocation StartLoc, SourceLocation LParenLoc,
                    SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_num_threads, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc),
      NumThreads(NumThreads) {
  setPreInitStmt(HelperNumThreads, CaptureRegion);
}

/// Build an empty clause.
OMPNumThreadsClause()
    : OMPClause(llvm::omp::OMPC_num_threads, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns number of threads.
Expr *getNumThreads() const { return cast_or_null<Expr>(NumThreads); }

child_range children() { return child_range(&NumThreads, &NumThreads + 1); }

const_child_range children() const {
  return const_child_range(&NumThreads, &NumThreads + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_num_threads;
}
662};

664/// This represents 'safelen' clause in the '#pragma omp ...'
665/// directive.
666///
667/// \code
668/// #pragma omp simd safelen(4)
669/// \endcode
670/// In this example directive '#pragma omp simd' has clause 'safelen'
671/// with single expression '4'.
672/// If the safelen clause is used then no two iterations executed
673/// concurrently with SIMD instructions can have a greater distance
674/// in the logical iteration space than its value. The parameter of
675/// the safelen clause must be a constant positive integer expression.
676class OMPSafelenClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Safe iteration space distance.
Stmt *Safelen = nullptr;

/// Set safelen.
void setSafelen(Expr *Len) { Safelen = Len; }

688public:
/// Build 'safelen' clause.
///
/// \param Len Expression associated with this clause.
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPSafelenClause(Expr *Len, SourceLocation StartLoc, SourceLocation LParenLoc,
                 SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_safelen, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Safelen(Len) {}

/// Build an empty clause.
explicit OMPSafelenClause()
    : OMPClause(llvm::omp::OMPC_safelen, SourceLocation(), SourceLocation()) {
}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return safe iteration space distance.
Expr *getSafelen() const { return cast_or_null<Expr>(Safelen); }

child_range children() { return child_range(&Safelen, &Safelen + 1); }

const_child_range children() const {
  return const_child_range(&Safelen, &Safelen + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_safelen;
}
729};

731/// This represents 'simdlen' clause in the '#pragma omp ...'
732/// directive.
733///
734/// \code
735/// #pragma omp simd simdlen(4)
736/// \endcode
737/// In this example directive '#pragma omp simd' has clause 'simdlen'
738/// with single expression '4'.
739/// If the 'simdlen' clause is used then it specifies the preferred number of
740/// iterations to be executed concurrently. The parameter of the 'simdlen'
741/// clause must be a constant positive integer expression.
742class OMPSimdlenClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Safe iteration space distance.
Stmt *Simdlen = nullptr;

/// Set simdlen.
void setSimdlen(Expr *Len) { Simdlen = Len; }

754public:
/// Build 'simdlen' clause.
///
/// \param Len Expression associated with this clause.
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPSimdlenClause(Expr *Len, SourceLocation StartLoc, SourceLocation LParenLoc,
                 SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_simdlen, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Simdlen(Len) {}

/// Build an empty clause.
explicit OMPSimdlenClause()
    : OMPClause(llvm::omp::OMPC_simdlen, SourceLocation(), SourceLocation()) {
}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return safe iteration space distance.
Expr *getSimdlen() const { return cast_or_null<Expr>(Simdlen); }

child_range children() { return child_range(&Simdlen, &Simdlen + 1); }

const_child_range children() const {
  return const_child_range(&Simdlen, &Simdlen + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_simdlen;
}
795};

797/// This represents the 'sizes' clause in the '#pragma omp tile' directive.
798///
799/// \code
800/// #pragma omp tile sizes(5,5)
801/// for (int i = 0; i < 64; ++i)
802///   for (int j = 0; j < 64; ++j)
803/// \endcode
804class OMPSizesClause final
  : public OMPClause,
    private llvm::TrailingObjects<OMPSizesClause, Expr *> {
friend class OMPClauseReader;
friend class llvm::TrailingObjects<OMPSizesClause, Expr *>;

/// Location of '('.
SourceLocation LParenLoc;

/// Number of tile sizes in the clause.
unsigned NumSizes;

/// Build an empty clause.
explicit OMPSizesClause(int NumSizes)
    : OMPClause(llvm::omp::OMPC_sizes, SourceLocation(), SourceLocation()),
      NumSizes(NumSizes) {}

821public:
/// Build a 'sizes' AST node.
///
/// \param C         Context of the AST.
/// \param StartLoc  Location of the 'sizes' identifier.
/// \param LParenLoc Location of '('.
/// \param EndLoc    Location of ')'.
/// \param Sizes     Content of the clause.
static OMPSizesClause *Create(const ASTContext &C, SourceLocation StartLoc,
                              SourceLocation LParenLoc, SourceLocation EndLoc,
                              ArrayRef<Expr *> Sizes);

/// Build an empty 'sizes' AST node for deserialization.
///
/// \param C     Context of the AST.
/// \param NumSizes Number of items in the clause.
static OMPSizesClause *CreateEmpty(const ASTContext &C, unsigned NumSizes);

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns the number of list items.
unsigned getNumSizes() const { return NumSizes; }

/// Returns the tile size expressions.
MutableArrayRef<Expr *> getSizesRefs() {
  return MutableArrayRef<Expr *>(static_cast<OMPSizesClause *>(this)
                                     ->template getTrailingObjects<Expr *>(),
                                 NumSizes);
}
ArrayRef<Expr *> getSizesRefs() const {
  return ArrayRef<Expr *>(static_cast<const OMPSizesClause *>(this)
                              ->template getTrailingObjects<Expr *>(),
                          NumSizes);
}

/// Sets the tile size expressions.
void setSizesRefs(ArrayRef<Expr *> VL) {
  assert(VL.size() == NumSizes)((void)0);
  std::copy(VL.begin(), VL.end(),
            static_cast<OMPSizesClause *>(this)
                ->template getTrailingObjects<Expr *>());
}

child_range children() {
  MutableArrayRef<Expr *> Sizes = getSizesRefs();
  return child_range(reinterpret_cast<Stmt **>(Sizes.begin()),
                     reinterpret_cast<Stmt **>(Sizes.end()));
}
const_child_range children() const {
  ArrayRef<Expr *> Sizes = getSizesRefs();
  return const_child_range(reinterpret_cast<Stmt *const *>(Sizes.begin()),
                           reinterpret_cast<Stmt *const *>(Sizes.end()));
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_sizes;
}
889};

891/// Representation of the 'full' clause of the '#pragma omp unroll' directive.
892///
893/// \code
894/// #pragma omp unroll full
895/// for (int i = 0; i < 64; ++i)
896/// \endcode
897class OMPFullClause final : public OMPClause {
friend class OMPClauseReader;

/// Build an empty clause.
explicit OMPFullClause() : OMPClause(llvm::omp::OMPC_full, {}, {}) {}

903public:
/// Build an AST node for a 'full' clause.
///
/// \param C        Context of the AST.
/// \param StartLoc Starting location of the clause.
/// \param EndLoc   Ending location of the clause.
static OMPFullClause *Create(const ASTContext &C, SourceLocation StartLoc,
                             SourceLocation EndLoc);

/// Build an empty 'full' AST node for deserialization.
///
/// \param C Context of the AST.
static OMPFullClause *CreateEmpty(const ASTContext &C);

child_range children() { return {child_iterator(), child_iterator()}; }
const_child_range children() const {
  return {const_child_iterator(), const_child_iterator()};
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_full;
}
932};

934/// Representation of the 'partial' clause of the '#pragma omp unroll'
935/// directive.
936///
937/// \code
938/// #pragma omp unroll partial(4)
939/// for (int i = start; i < end; ++i)
940/// \endcode
941class OMPPartialClause final : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Optional argument to the clause (unroll factor).
Stmt *Factor;

/// Build an empty clause.
explicit OMPPartialClause() : OMPClause(llvm::omp::OMPC_partial, {}, {}) {}

/// Set the unroll factor.
void setFactor(Expr *E) { Factor = E; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

959public:
/// Build an AST node for a 'partial' clause.
///
/// \param C         Context of the AST.
/// \param StartLoc  Location of the 'partial' identifier.
/// \param LParenLoc Location of '('.
/// \param EndLoc    Location of ')'.
/// \param Factor    Clause argument.
static OMPPartialClause *Create(const ASTContext &C, SourceLocation StartLoc,
                                SourceLocation LParenLoc,
                                SourceLocation EndLoc, Expr *Factor);

/// Build an empty 'partial' AST node for deserialization.
///
/// \param C     Context of the AST.
static OMPPartialClause *CreateEmpty(const ASTContext &C);

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns the argument of the clause or nullptr if not set.
Expr *getFactor() const { return cast_or_null<Expr>(Factor); }

child_range children() { return child_range(&Factor, &Factor + 1); }
const_child_range children() const {
  return const_child_range(&Factor, &Factor + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_partial;
}
997};

999/// This represents 'collapse' clause in the '#pragma omp ...'
1000/// directive.
1001///
1002/// \code
1003/// #pragma omp simd collapse(3)
1004/// \endcode
1005/// In this example directive '#pragma omp simd' has clause 'collapse'
1006/// with single expression '3'.
1007/// The parameter must be a constant positive integer expression, it specifies
1008/// the number of nested loops that should be collapsed into a single iteration
1009/// space.
1010class OMPCollapseClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Number of for-loops.
Stmt *NumForLoops = nullptr;

/// Set the number of associated for-loops.
void setNumForLoops(Expr *Num) { NumForLoops = Num; }

1022public:
/// Build 'collapse' clause.
///
/// \param Num Expression associated with this clause.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPCollapseClause(Expr *Num, SourceLocation StartLoc,
                  SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_collapse, StartLoc, EndLoc),
      LParenLoc(LParenLoc), NumForLoops(Num) {}

/// Build an empty clause.
explicit OMPCollapseClause()
    : OMPClause(llvm::omp::OMPC_collapse, SourceLocation(),
                SourceLocation()) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return the number of associated for-loops.
Expr *getNumForLoops() const { return cast_or_null<Expr>(NumForLoops); }

child_range children() { return child_range(&NumForLoops, &NumForLoops + 1); }

const_child_range children() const {
  return const_child_range(&NumForLoops, &NumForLoops + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_collapse;
}
1064};

1066/// This represents 'default' clause in the '#pragma omp ...' directive.
1067///
1068/// \code
1069/// #pragma omp parallel default(shared)
1070/// \endcode
1071/// In this example directive '#pragma omp parallel' has simple 'default'
1072/// clause with kind 'shared'.
1073class OMPDefaultClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// A kind of the 'default' clause.
llvm::omp::DefaultKind Kind = llvm::omp::OMP_DEFAULT_unknown;

/// Start location of the kind in source code.
SourceLocation KindKwLoc;

/// Set kind of the clauses.
///
/// \param K Argument of clause.
void setDefaultKind(llvm::omp::DefaultKind K) { Kind = K; }

/// Set argument location.
///
/// \param KLoc Argument location.
void setDefaultKindKwLoc(SourceLocation KLoc) { KindKwLoc = KLoc; }

1095public:
/// Build 'default' clause with argument \a A ('none' or 'shared').
///
/// \param A Argument of the clause ('none' or 'shared').
/// \param ALoc Starting location of the argument.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPDefaultClause(llvm::omp::DefaultKind A, SourceLocation ALoc,
                 SourceLocation StartLoc, SourceLocation LParenLoc,
                 SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_default, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Kind(A), KindKwLoc(ALoc) {}

/// Build an empty clause.
OMPDefaultClause()
    : OMPClause(llvm::omp::OMPC_default, SourceLocation(), SourceLocation()) {
}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns kind of the clause.
llvm::omp::DefaultKind getDefaultKind() const { return Kind; }

/// Returns location of clause kind.
SourceLocation getDefaultKindKwLoc() const { return KindKwLoc; }

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_default;
}
1144};

1146/// This represents 'proc_bind' clause in the '#pragma omp ...'
1147/// directive.
1148///
1149/// \code
1150/// #pragma omp parallel proc_bind(master)
1151/// \endcode
1152/// In this example directive '#pragma omp parallel' has simple 'proc_bind'
1153/// clause with kind 'master'.
1154class OMPProcBindClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// A kind of the 'proc_bind' clause.
llvm::omp::ProcBindKind Kind = llvm::omp::OMP_PROC_BIND_unknown;

/// Start location of the kind in source code.
SourceLocation KindKwLoc;

/// Set kind of the clause.
///
/// \param K Kind of clause.
void setProcBindKind(llvm::omp::ProcBindKind K) { Kind = K; }

/// Set clause kind location.
///
/// \param KLoc Kind location.
void setProcBindKindKwLoc(SourceLocation KLoc) { KindKwLoc = KLoc; }

1176public:
/// Build 'proc_bind' clause with argument \a A ('master', 'close' or
///        'spread').
///
/// \param A Argument of the clause ('master', 'close' or 'spread').
/// \param ALoc Starting location of the argument.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPProcBindClause(llvm::omp::ProcBindKind A, SourceLocation ALoc,
                  SourceLocation StartLoc, SourceLocation LParenLoc,
                  SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_proc_bind, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Kind(A), KindKwLoc(ALoc) {}

/// Build an empty clause.
OMPProcBindClause()
    : OMPClause(llvm::omp::OMPC_proc_bind, SourceLocation(),
                SourceLocation()) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns kind of the clause.
llvm::omp::ProcBindKind getProcBindKind() const { return Kind; }

/// Returns location of clause kind.
SourceLocation getProcBindKindKwLoc() const { return KindKwLoc; }

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_proc_bind;
}
1226};

1228/// This represents 'unified_address' clause in the '#pragma omp requires'
1229/// directive.
1230///
1231/// \code
1232/// #pragma omp requires unified_address
1233/// \endcode
1234/// In this example directive '#pragma omp requires' has 'unified_address'
1235/// clause.
1236class OMPUnifiedAddressClause final : public OMPClause {
1237public:
friend class OMPClauseReader;
/// Build 'unified_address' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPUnifiedAddressClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_unified_address, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPUnifiedAddressClause()
    : OMPClause(llvm::omp::OMPC_unified_address, SourceLocation(),
                SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_unified_address;
}
1269};

1271/// This represents 'unified_shared_memory' clause in the '#pragma omp requires'
1272/// directive.
1273///
1274/// \code
1275/// #pragma omp requires unified_shared_memory
1276/// \endcode
1277/// In this example directive '#pragma omp requires' has 'unified_shared_memory'
1278/// clause.
1279class OMPUnifiedSharedMemoryClause final : public OMPClause {
1280public:
friend class OMPClauseReader;
/// Build 'unified_shared_memory' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPUnifiedSharedMemoryClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_unified_shared_memory, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPUnifiedSharedMemoryClause()
    : OMPClause(llvm::omp::OMPC_unified_shared_memory, SourceLocation(),
                SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_unified_shared_memory;
}
1312};

1314/// This represents 'reverse_offload' clause in the '#pragma omp requires'
1315/// directive.
1316///
1317/// \code
1318/// #pragma omp requires reverse_offload
1319/// \endcode
1320/// In this example directive '#pragma omp requires' has 'reverse_offload'
1321/// clause.
1322class OMPReverseOffloadClause final : public OMPClause {
1323public:
friend class OMPClauseReader;
/// Build 'reverse_offload' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPReverseOffloadClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_reverse_offload, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPReverseOffloadClause()
    : OMPClause(llvm::omp::OMPC_reverse_offload, SourceLocation(),
                SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_reverse_offload;
}
1355};

1357/// This represents 'dynamic_allocators' clause in the '#pragma omp requires'
1358/// directive.
1359///
1360/// \code
1361/// #pragma omp requires dynamic_allocators
1362/// \endcode
1363/// In this example directive '#pragma omp requires' has 'dynamic_allocators'
1364/// clause.
1365class OMPDynamicAllocatorsClause final : public OMPClause {
1366public:
friend class OMPClauseReader;
/// Build 'dynamic_allocators' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPDynamicAllocatorsClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_dynamic_allocators, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPDynamicAllocatorsClause()
    : OMPClause(llvm::omp::OMPC_dynamic_allocators, SourceLocation(),
                SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_dynamic_allocators;
}
1398};

1400/// This represents 'atomic_default_mem_order' clause in the '#pragma omp
1401/// requires'  directive.
1402///
1403/// \code
1404/// #pragma omp requires atomic_default_mem_order(seq_cst)
1405/// \endcode
1406/// In this example directive '#pragma omp requires' has simple
1407/// atomic_default_mem_order' clause with kind 'seq_cst'.
1408class OMPAtomicDefaultMemOrderClause final : public OMPClause {
friend class OMPClauseReader;

/// Location of '('
SourceLocation LParenLoc;

/// A kind of the 'atomic_default_mem_order' clause.
OpenMPAtomicDefaultMemOrderClauseKind Kind =
    OMPC_ATOMIC_DEFAULT_MEM_ORDER_unknown;

/// Start location of the kind in source code.
SourceLocation KindKwLoc;

/// Set kind of the clause.
///
/// \param K Kind of clause.
void setAtomicDefaultMemOrderKind(OpenMPAtomicDefaultMemOrderClauseKind K) {
  Kind = K;
}

/// Set clause kind location.
///
/// \param KLoc Kind location.
void setAtomicDefaultMemOrderKindKwLoc(SourceLocation KLoc) {
  KindKwLoc = KLoc;
}

1435public:
/// Build 'atomic_default_mem_order' clause with argument \a A ('seq_cst',
/// 'acq_rel' or 'relaxed').
///
/// \param A Argument of the clause ('seq_cst', 'acq_rel' or 'relaxed').
/// \param ALoc Starting location of the argument.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPAtomicDefaultMemOrderClause(OpenMPAtomicDefaultMemOrderClauseKind A,
                               SourceLocation ALoc, SourceLocation StartLoc,
                               SourceLocation LParenLoc,
                               SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_atomic_default_mem_order, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Kind(A), KindKwLoc(ALoc) {}

/// Build an empty clause.
OMPAtomicDefaultMemOrderClause()
    : OMPClause(llvm::omp::OMPC_atomic_default_mem_order, SourceLocation(),
                SourceLocation()) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the locaiton of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns kind of the clause.
OpenMPAtomicDefaultMemOrderClauseKind getAtomicDefaultMemOrderKind() const {
  return Kind;
}

/// Returns location of clause kind.
SourceLocation getAtomicDefaultMemOrderKindKwLoc() const { return KindKwLoc; }

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_atomic_default_mem_order;
}
1488};

1490/// This represents 'schedule' clause in the '#pragma omp ...' directive.
1491///
1492/// \code
1493/// #pragma omp for schedule(static, 3)
1494/// \endcode
1495/// In this example directive '#pragma omp for' has 'schedule' clause with
1496/// arguments 'static' and '3'.
1497class OMPScheduleClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// A kind of the 'schedule' clause.
OpenMPScheduleClauseKind Kind = OMPC_SCHEDULE_unknown;

/// Modifiers for 'schedule' clause.
enum {FIRST, SECOND, NUM_MODIFIERS};
OpenMPScheduleClauseModifier Modifiers[NUM_MODIFIERS];

/// Locations of modifiers.
SourceLocation ModifiersLoc[NUM_MODIFIERS];

/// Start location of the schedule ind in source code.
SourceLocation KindLoc;

/// Location of ',' (if any).
SourceLocation CommaLoc;

/// Chunk size.
Expr *ChunkSize = nullptr;

/// Set schedule kind.
///
/// \param K Schedule kind.
void setScheduleKind(OpenMPScheduleClauseKind K) { Kind = K; }

/// Set the first schedule modifier.
///
/// \param M Schedule modifier.
void setFirstScheduleModifier(OpenMPScheduleClauseModifier M) {
  Modifiers[FIRST] = M;
}

/// Set the second schedule modifier.
///
/// \param M Schedule modifier.
void setSecondScheduleModifier(OpenMPScheduleClauseModifier M) {
  Modifiers[SECOND] = M;
}

/// Set location of the first schedule modifier.
void setFirstScheduleModifierLoc(SourceLocation Loc) {
  ModifiersLoc[FIRST] = Loc;
}

/// Set location of the second schedule modifier.
void setSecondScheduleModifierLoc(SourceLocation Loc) {
  ModifiersLoc[SECOND] = Loc;
}

/// Set schedule modifier location.
///
/// \param M Schedule modifier location.
void setScheduleModifer(OpenMPScheduleClauseModifier M) {
  if (Modifiers[FIRST] == OMPC_SCHEDULE_MODIFIER_unknown)
    Modifiers[FIRST] = M;
  else {
    assert(Modifiers[SECOND] == OMPC_SCHEDULE_MODIFIER_unknown)((void)0);
    Modifiers[SECOND] = M;
  }
}

/// Sets the location of '('.
///
/// \param Loc Location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Set schedule kind start location.
///
/// \param KLoc Schedule kind location.
void setScheduleKindLoc(SourceLocation KLoc) { KindLoc = KLoc; }

/// Set location of ','.
///
/// \param Loc Location of ','.
void setCommaLoc(SourceLocation Loc) { CommaLoc = Loc; }

/// Set chunk size.
///
/// \param E Chunk size.
void setChunkSize(Expr *E) { ChunkSize = E; }

1583public:
/// Build 'schedule' clause with schedule kind \a Kind and chunk size
/// expression \a ChunkSize.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param KLoc Starting location of the argument.
/// \param CommaLoc Location of ','.
/// \param EndLoc Ending location of the clause.
/// \param Kind Schedule kind.
/// \param ChunkSize Chunk size.
/// \param HelperChunkSize Helper chunk size for combined directives.
/// \param M1 The first modifier applied to 'schedule' clause.
/// \param M1Loc Location of the first modifier
/// \param M2 The second modifier applied to 'schedule' clause.
/// \param M2Loc Location of the second modifier
OMPScheduleClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                  SourceLocation KLoc, SourceLocation CommaLoc,
                  SourceLocation EndLoc, OpenMPScheduleClauseKind Kind,
                  Expr *ChunkSize, Stmt *HelperChunkSize,
                  OpenMPScheduleClauseModifier M1, SourceLocation M1Loc,
                  OpenMPScheduleClauseModifier M2, SourceLocation M2Loc)
    : OMPClause(llvm::omp::OMPC_schedule, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Kind(Kind),
      KindLoc(KLoc), CommaLoc(CommaLoc), ChunkSize(ChunkSize) {
  setPreInitStmt(HelperChunkSize);
  Modifiers[FIRST] = M1;
  Modifiers[SECOND] = M2;
  ModifiersLoc[FIRST] = M1Loc;
  ModifiersLoc[SECOND] = M2Loc;
}

/// Build an empty clause.
explicit OMPScheduleClause()
    : OMPClause(llvm::omp::OMPC_schedule, SourceLocation(), SourceLocation()),
      OMPClauseWithPreInit(this) {
  Modifiers[FIRST] = OMPC_SCHEDULE_MODIFIER_unknown;
  Modifiers[SECOND] = OMPC_SCHEDULE_MODIFIER_unknown;
}

/// Get kind of the clause.
OpenMPScheduleClauseKind getScheduleKind() const { return Kind; }

/// Get the first modifier of the clause.
OpenMPScheduleClauseModifier getFirstScheduleModifier() const {
  return Modifiers[FIRST];
}

/// Get the second modifier of the clause.
OpenMPScheduleClauseModifier getSecondScheduleModifier() const {
  return Modifiers[SECOND];
}

/// Get location of '('.
SourceLocation getLParenLoc() { return LParenLoc; }

/// Get kind location.
SourceLocation getScheduleKindLoc() { return KindLoc; }

/// Get the first modifier location.
SourceLocation getFirstScheduleModifierLoc() const {
  return ModifiersLoc[FIRST];
}

/// Get the second modifier location.
SourceLocation getSecondScheduleModifierLoc() const {
  return ModifiersLoc[SECOND];
}

/// Get location of ','.
SourceLocation getCommaLoc() { return CommaLoc; }

/// Get chunk size.
Expr *getChunkSize() { return ChunkSize; }

/// Get chunk size.
const Expr *getChunkSize() const { return ChunkSize; }

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(&ChunkSize),
                     reinterpret_cast<Stmt **>(&ChunkSize) + 1);
}

const_child_range children() const {
  auto Children = const_cast<OMPScheduleClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_schedule;
}
1681};

1683/// This represents 'ordered' clause in the '#pragma omp ...' directive.
1684///
1685/// \code
1686/// #pragma omp for ordered (2)
1687/// \endcode
1688/// In this example directive '#pragma omp for' has 'ordered' clause with
1689/// parameter 2.
1690class OMPOrderedClause final
  : public OMPClause,
    private llvm::TrailingObjects<OMPOrderedClause, Expr *> {
friend class OMPClauseReader;
friend TrailingObjects;

/// Location of '('.
SourceLocation LParenLoc;

/// Number of for-loops.
Stmt *NumForLoops = nullptr;

/// Real number of loops.
unsigned NumberOfLoops = 0;

/// Build 'ordered' clause.
///
/// \param Num Expression, possibly associated with this clause.
/// \param NumLoops Number of loops, associated with this clause.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPOrderedClause(Expr *Num, unsigned NumLoops, SourceLocation StartLoc,
                 SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_ordered, StartLoc, EndLoc),
      LParenLoc(LParenLoc), NumForLoops(Num), NumberOfLoops(NumLoops) {}

/// Build an empty clause.
explicit OMPOrderedClause(unsigned NumLoops)
    : OMPClause(llvm::omp::OMPC_ordered, SourceLocation(), SourceLocation()),
      NumberOfLoops(NumLoops) {}

/// Set the number of associated for-loops.
void setNumForLoops(Expr *Num) { NumForLoops = Num; }

1725public:
/// Build 'ordered' clause.
///
/// \param Num Expression, possibly associated with this clause.
/// \param NumLoops Number of loops, associated with this clause.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
static OMPOrderedClause *Create(const ASTContext &C, Expr *Num,
                                unsigned NumLoops, SourceLocation StartLoc,
                                SourceLocation LParenLoc,
                                SourceLocation EndLoc);

/// Build an empty clause.
static OMPOrderedClause* CreateEmpty(const ASTContext &C, unsigned NumLoops);

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return the number of associated for-loops.
Expr *getNumForLoops() const { return cast_or_null<Expr>(NumForLoops); }

/// Set number of iterations for the specified loop.
void setLoopNumIterations(unsigned NumLoop, Expr *NumIterations);
/// Get number of iterations for all the loops.
ArrayRef<Expr *> getLoopNumIterations() const;

/// Set loop counter for the specified loop.
void setLoopCounter(unsigned NumLoop, Expr *Counter);
/// Get loops counter for the specified loop.
Expr *getLoopCounter(unsigned NumLoop);
const Expr *getLoopCounter(unsigned NumLoop) const;

child_range children() { return child_range(&NumForLoops, &NumForLoops + 1); }

const_child_range children() const {
  return const_child_range(&NumForLoops, &NumForLoops + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_ordered;
}
1777};

1779/// This represents 'nowait' clause in the '#pragma omp ...' directive.
1780///
1781/// \code
1782/// #pragma omp for nowait
1783/// \endcode
1784/// In this example directive '#pragma omp for' has 'nowait' clause.
1785class OMPNowaitClause : public OMPClause {
1786public:
/// Build 'nowait' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPNowaitClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_nowait, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPNowaitClause()
    : OMPClause(llvm::omp::OMPC_nowait, SourceLocation(), SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_nowait;
}
1816};

1818/// This represents 'untied' clause in the '#pragma omp ...' directive.
1819///
1820/// \code
1821/// #pragma omp task untied
1822/// \endcode
1823/// In this example directive '#pragma omp task' has 'untied' clause.
1824class OMPUntiedClause : public OMPClause {
1825public:
/// Build 'untied' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPUntiedClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_untied, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPUntiedClause()
    : OMPClause(llvm::omp::OMPC_untied, SourceLocation(), SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_untied;
}
1855};

1857/// This represents 'mergeable' clause in the '#pragma omp ...'
1858/// directive.
1859///
1860/// \code
1861/// #pragma omp task mergeable
1862/// \endcode
1863/// In this example directive '#pragma omp task' has 'mergeable' clause.
1864class OMPMergeableClause : public OMPClause {
1865public:
/// Build 'mergeable' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPMergeableClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_mergeable, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPMergeableClause()
    : OMPClause(llvm::omp::OMPC_mergeable, SourceLocation(),
                SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_mergeable;
}
1896};

1898/// This represents 'read' clause in the '#pragma omp atomic' directive.
1899///
1900/// \code
1901/// #pragma omp atomic read
1902/// \endcode
1903/// In this example directive '#pragma omp atomic' has 'read' clause.
1904class OMPReadClause : public OMPClause {
1905public:
/// Build 'read' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPReadClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_read, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPReadClause()
    : OMPClause(llvm::omp::OMPC_read, SourceLocation(), SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_read;
}
1935};

1937/// This represents 'write' clause in the '#pragma omp atomic' directive.
1938///
1939/// \code
1940/// #pragma omp atomic write
1941/// \endcode
1942/// In this example directive '#pragma omp atomic' has 'write' clause.
1943class OMPWriteClause : public OMPClause {
1944public:
/// Build 'write' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPWriteClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_write, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPWriteClause()
    : OMPClause(llvm::omp::OMPC_write, SourceLocation(), SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_write;
}
1974};

1976/// This represents 'update' clause in the '#pragma omp atomic'
1977/// directive.
1978///
1979/// \code
1980/// #pragma omp atomic update
1981/// \endcode
1982/// In this example directive '#pragma omp atomic' has 'update' clause.
1983/// Also, this class represents 'update' clause in  '#pragma omp depobj'
1984/// directive.
1985///
1986/// \code
1987/// #pragma omp depobj(a) update(in)
1988/// \endcode
1989/// In this example directive '#pragma omp depobj' has 'update' clause with 'in'
1990/// dependence kind.
1991class OMPUpdateClause final
  : public OMPClause,
    private llvm::TrailingObjects<OMPUpdateClause, SourceLocation,
                                  OpenMPDependClauseKind> {
friend class OMPClauseReader;
friend TrailingObjects;

/// true if extended version of the clause for 'depobj' directive.
bool IsExtended = false;

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<SourceLocation>) const {
  // 2 locations: for '(' and argument location.
  return IsExtended ? 2 : 0;
}

/// Sets the the location of '(' in clause for 'depobj' directive.
void setLParenLoc(SourceLocation Loc) {
  assert(IsExtended && "Expected extended clause.")((void)0);
  *getTrailingObjects<SourceLocation>() = Loc;
}

/// Sets the the location of '(' in clause for 'depobj' directive.
void setArgumentLoc(SourceLocation Loc) {
  assert(IsExtended && "Expected extended clause.")((void)0);
  *std::next(getTrailingObjects<SourceLocation>(), 1) = Loc;
}

/// Sets the dependence kind for the clause for 'depobj' directive.
void setDependencyKind(OpenMPDependClauseKind DK) {
  assert(IsExtended && "Expected extended clause.")((void)0);
  *getTrailingObjects<OpenMPDependClauseKind>() = DK;
}

/// Build 'update' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPUpdateClause(SourceLocation StartLoc, SourceLocation EndLoc,
                bool IsExtended)
    : OMPClause(llvm::omp::OMPC_update, StartLoc, EndLoc),
      IsExtended(IsExtended) {}

/// Build an empty clause.
OMPUpdateClause(bool IsExtended)
    : OMPClause(llvm::omp::OMPC_update, SourceLocation(), SourceLocation()),
      IsExtended(IsExtended) {}

2040public:
/// Creates clause for 'atomic' directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
static OMPUpdateClause *Create(const ASTContext &C, SourceLocation StartLoc,
                               SourceLocation EndLoc);

/// Creates clause for 'depobj' directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ArgumentLoc Location of the argument.
/// \param DK Dependence kind.
/// \param EndLoc Ending location of the clause.
static OMPUpdateClause *Create(const ASTContext &C, SourceLocation StartLoc,
                               SourceLocation LParenLoc,
                               SourceLocation ArgumentLoc,
                               OpenMPDependClauseKind DK,
                               SourceLocation EndLoc);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param IsExtended true if extended clause for 'depobj' directive must be
/// created.
static OMPUpdateClause *CreateEmpty(const ASTContext &C, bool IsExtended);

/// Checks if the clause is the extended clauses for 'depobj' directive.
bool isExtended() const { return IsExtended; }

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

/// Gets the the location of '(' in clause for 'depobj' directive.
SourceLocation getLParenLoc() const {
  assert(IsExtended && "Expected extended clause.")((void)0);
  return *getTrailingObjects<SourceLocation>();
}

/// Gets the the location of argument in clause for 'depobj' directive.
SourceLocation getArgumentLoc() const {
  assert(IsExtended && "Expected extended clause.")((void)0);
  return *std::next(getTrailingObjects<SourceLocation>(), 1);
}

/// Gets the dependence kind in clause for 'depobj' directive.
OpenMPDependClauseKind getDependencyKind() const {
  assert(IsExtended && "Expected extended clause.")((void)0);
  return *getTrailingObjects<OpenMPDependClauseKind>();
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_update;
}
2109};

2111/// This represents 'capture' clause in the '#pragma omp atomic'
2112/// directive.
2113///
2114/// \code
2115/// #pragma omp atomic capture
2116/// \endcode
2117/// In this example directive '#pragma omp atomic' has 'capture' clause.
2118class OMPCaptureClause : public OMPClause {
2119public:
/// Build 'capture' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPCaptureClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_capture, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPCaptureClause()
    : OMPClause(llvm::omp::OMPC_capture, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_capture;
}
2150};

2152/// This represents 'seq_cst' clause in the '#pragma omp atomic'
2153/// directive.
2154///
2155/// \code
2156/// #pragma omp atomic seq_cst
2157/// \endcode
2158/// In this example directive '#pragma omp atomic' has 'seq_cst' clause.
2159class OMPSeqCstClause : public OMPClause {
2160public:
/// Build 'seq_cst' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPSeqCstClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_seq_cst, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPSeqCstClause()
    : OMPClause(llvm::omp::OMPC_seq_cst, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_seq_cst;
}
2191};

2193/// This represents 'acq_rel' clause in the '#pragma omp atomic|flush'
2194/// directives.
2195///
2196/// \code
2197/// #pragma omp flush acq_rel
2198/// \endcode
2199/// In this example directive '#pragma omp flush' has 'acq_rel' clause.
2200class OMPAcqRelClause final : public OMPClause {
2201public:
/// Build 'ack_rel' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPAcqRelClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_acq_rel, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPAcqRelClause()
    : OMPClause(llvm::omp::OMPC_acq_rel, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_acq_rel;
}
2232};

2234/// This represents 'acquire' clause in the '#pragma omp atomic|flush'
2235/// directives.
2236///
2237/// \code
2238/// #pragma omp flush acquire
2239/// \endcode
2240/// In this example directive '#pragma omp flush' has 'acquire' clause.
2241class OMPAcquireClause final : public OMPClause {
2242public:
/// Build 'acquire' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPAcquireClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_acquire, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPAcquireClause()
    : OMPClause(llvm::omp::OMPC_acquire, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_acquire;
}
2273};

2275/// This represents 'release' clause in the '#pragma omp atomic|flush'
2276/// directives.
2277///
2278/// \code
2279/// #pragma omp flush release
2280/// \endcode
2281/// In this example directive '#pragma omp flush' has 'release' clause.
2282class OMPReleaseClause final : public OMPClause {
2283public:
/// Build 'release' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPReleaseClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_release, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPReleaseClause()
    : OMPClause(llvm::omp::OMPC_release, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_release;
}
2314};

2316/// This represents 'relaxed' clause in the '#pragma omp atomic'
2317/// directives.
2318///
2319/// \code
2320/// #pragma omp atomic relaxed
2321/// \endcode
2322/// In this example directive '#pragma omp atomic' has 'relaxed' clause.
2323class OMPRelaxedClause final : public OMPClause {
2324public:
/// Build 'relaxed' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPRelaxedClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_relaxed, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPRelaxedClause()
    : OMPClause(llvm::omp::OMPC_relaxed, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_relaxed;
}
2355};

2357/// This represents clause 'private' in the '#pragma omp ...' directives.
2358///
2359/// \code
2360/// #pragma omp parallel private(a,b)
2361/// \endcode
2362/// In this example directive '#pragma omp parallel' has clause 'private'
2363/// with the variables 'a' and 'b'.
2364class OMPPrivateClause final
  : public OMPVarListClause<OMPPrivateClause>,
    private llvm::TrailingObjects<OMPPrivateClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPPrivateClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                 SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPPrivateClause>(llvm::omp::OMPC_private, StartLoc,
                                         LParenLoc, EndLoc, N) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPPrivateClause(unsigned N)
    : OMPVarListClause<OMPPrivateClause>(llvm::omp::OMPC_private,
                                         SourceLocation(), SourceLocation(),
                                         SourceLocation(), N) {}

/// Sets the list of references to private copies with initializers for
/// new private variables.
/// \param VL List of references.
void setPrivateCopies(ArrayRef<Expr *> VL);

/// Gets the list of references to private copies with initializers for
/// new private variables.
MutableArrayRef<Expr *> getPrivateCopies() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivateCopies() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

2404public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
/// \param PrivateVL List of references to private copies with initializers.
static OMPPrivateClause *Create(const ASTContext &C, SourceLocation StartLoc,
                                SourceLocation LParenLoc,
                                SourceLocation EndLoc, ArrayRef<Expr *> VL,
                                ArrayRef<Expr *> PrivateVL);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPPrivateClause *CreateEmpty(const ASTContext &C, unsigned N);

using private_copies_iterator = MutableArrayRef<Expr *>::iterator;
using private_copies_const_iterator = ArrayRef<const Expr *>::iterator;
using private_copies_range = llvm::iterator_range<private_copies_iterator>;
using private_copies_const_range =
    llvm::iterator_range<private_copies_const_iterator>;

private_copies_range private_copies() {
  return private_copies_range(getPrivateCopies().begin(),
                              getPrivateCopies().end());
}

private_copies_const_range private_copies() const {
  return private_copies_const_range(getPrivateCopies().begin(),
                                    getPrivateCopies().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPPrivateClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_private;
}
2460};

2462/// This represents clause 'firstprivate' in the '#pragma omp ...'
2463/// directives.
2464///
2465/// \code
2466/// #pragma omp parallel firstprivate(a,b)
2467/// \endcode
2468/// In this example directive '#pragma omp parallel' has clause 'firstprivate'
2469/// with the variables 'a' and 'b'.
2470class OMPFirstprivateClause final
  : public OMPVarListClause<OMPFirstprivateClause>,
    public OMPClauseWithPreInit,
    private llvm::TrailingObjects<OMPFirstprivateClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPFirstprivateClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                      SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPFirstprivateClause>(llvm::omp::OMPC_firstprivate,
                                              StartLoc, LParenLoc, EndLoc, N),
      OMPClauseWithPreInit(this) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPFirstprivateClause(unsigned N)
    : OMPVarListClause<OMPFirstprivateClause>(
          llvm::omp::OMPC_firstprivate, SourceLocation(), SourceLocation(),
          SourceLocation(), N),
      OMPClauseWithPreInit(this) {}

/// Sets the list of references to private copies with initializers for
/// new private variables.
/// \param VL List of references.
void setPrivateCopies(ArrayRef<Expr *> VL);

/// Gets the list of references to private copies with initializers for
/// new private variables.
MutableArrayRef<Expr *> getPrivateCopies() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivateCopies() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Sets the list of references to initializer variables for new
/// private variables.
/// \param VL List of references.
void setInits(ArrayRef<Expr *> VL);

/// Gets the list of references to initializer variables for new
/// private variables.
MutableArrayRef<Expr *> getInits() {
  return MutableArrayRef<Expr *>(getPrivateCopies().end(), varlist_size());
}
ArrayRef<const Expr *> getInits() const {
  return llvm::makeArrayRef(getPrivateCopies().end(), varlist_size());
}

2527public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the original variables.
/// \param PrivateVL List of references to private copies with initializers.
/// \param InitVL List of references to auto generated variables used for
/// initialization of a single array element. Used if firstprivate variable is
/// of array type.
/// \param PreInit Statement that must be executed before entering the OpenMP
/// region with this clause.
static OMPFirstprivateClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation EndLoc, ArrayRef<Expr *> VL, ArrayRef<Expr *> PrivateVL,
       ArrayRef<Expr *> InitVL, Stmt *PreInit);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPFirstprivateClause *CreateEmpty(const ASTContext &C, unsigned N);

using private_copies_iterator = MutableArrayRef<Expr *>::iterator;
using private_copies_const_iterator = ArrayRef<const Expr *>::iterator;
using private_copies_range = llvm::iterator_range<private_copies_iterator>;
using private_copies_const_range =
    llvm::iterator_range<private_copies_const_iterator>;

private_copies_range private_copies() {
  return private_copies_range(getPrivateCopies().begin(),
                              getPrivateCopies().end());
}
private_copies_const_range private_copies() const {
  return private_copies_const_range(getPrivateCopies().begin(),
                                    getPrivateCopies().end());
}

using inits_iterator = MutableArrayRef<Expr *>::iterator;
using inits_const_iterator = ArrayRef<const Expr *>::iterator;
using inits_range = llvm::iterator_range<inits_iterator>;
using inits_const_range = llvm::iterator_range<inits_const_iterator>;

inits_range inits() {
  return inits_range(getInits().begin(), getInits().end());
}
inits_const_range inits() const {
  return inits_const_range(getInits().begin(), getInits().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPFirstprivateClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}
const_child_range used_children() const {
  auto Children = const_cast<OMPFirstprivateClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_firstprivate;
}
2601};

2603/// This represents clause 'lastprivate' in the '#pragma omp ...'
2604/// directives.
2605///
2606/// \code
2607/// #pragma omp simd lastprivate(a,b)
2608/// \endcode
2609/// In this example directive '#pragma omp simd' has clause 'lastprivate'
2610/// with the variables 'a' and 'b'.
2611class OMPLastprivateClause final
  : public OMPVarListClause<OMPLastprivateClause>,
    public OMPClauseWithPostUpdate,
    private llvm::TrailingObjects<OMPLastprivateClause, Expr *> {
// There are 4 additional tail-allocated arrays at the end of the class:
// 1. Contains list of pseudo variables with the default initialization for
// each non-firstprivate variables. Used in codegen for initialization of
// lastprivate copies.
// 2. List of helper expressions for proper generation of assignment operation
// required for lastprivate clause. This list represents private variables
// (for arrays, single array element).
// 3. List of helper expressions for proper generation of assignment operation
// required for lastprivate clause. This list represents original variables
// (for arrays, single array element).
// 4. List of helper expressions that represents assignment operation:
// \code
// DstExprs = SrcExprs;
// \endcode
// Required for proper codegen of final assignment performed by the
// lastprivate clause.
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Optional lastprivate kind, e.g. 'conditional', if specified by user.
OpenMPLastprivateModifier LPKind;
/// Optional location of the lasptrivate kind, if specified by user.
SourceLocation LPKindLoc;
/// Optional colon location, if specified by user.
SourceLocation ColonLoc;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPLastprivateClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                     SourceLocation EndLoc, OpenMPLastprivateModifier LPKind,
                     SourceLocation LPKindLoc, SourceLocation ColonLoc,
                     unsigned N)
    : OMPVarListClause<OMPLastprivateClause>(llvm::omp::OMPC_lastprivate,
                                             StartLoc, LParenLoc, EndLoc, N),
      OMPClauseWithPostUpdate(this), LPKind(LPKind), LPKindLoc(LPKindLoc),
      ColonLoc(ColonLoc) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPLastprivateClause(unsigned N)
    : OMPVarListClause<OMPLastprivateClause>(
          llvm::omp::OMPC_lastprivate, SourceLocation(), SourceLocation(),
          SourceLocation(), N),
      OMPClauseWithPostUpdate(this) {}

/// Get the list of helper expressions for initialization of private
/// copies for lastprivate variables.
MutableArrayRef<Expr *> getPrivateCopies() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivateCopies() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent private variables (for arrays, single
/// array element) in the final assignment statement performed by the
/// lastprivate clause.
void setSourceExprs(ArrayRef<Expr *> SrcExprs);

/// Get the list of helper source expressions.
MutableArrayRef<Expr *> getSourceExprs() {
  return MutableArrayRef<Expr *>(getPrivateCopies().end(), varlist_size());
}
ArrayRef<const Expr *> getSourceExprs() const {
  return llvm::makeArrayRef(getPrivateCopies().end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent original variables (for arrays, single
/// array element) in the final assignment statement performed by the
/// lastprivate clause.
void setDestinationExprs(ArrayRef<Expr *> DstExprs);

/// Get the list of helper destination expressions.
MutableArrayRef<Expr *> getDestinationExprs() {
  return MutableArrayRef<Expr *>(getSourceExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getDestinationExprs() const {
  return llvm::makeArrayRef(getSourceExprs().end(), varlist_size());
}

/// Set list of helper assignment expressions, required for proper
/// codegen of the clause. These expressions are assignment expressions that
/// assign private copy of the variable to original variable.
void setAssignmentOps(ArrayRef<Expr *> AssignmentOps);

/// Get the list of helper assignment expressions.
MutableArrayRef<Expr *> getAssignmentOps() {
  return MutableArrayRef<Expr *>(getDestinationExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getAssignmentOps() const {
  return llvm::makeArrayRef(getDestinationExprs().end(), varlist_size());
}

/// Sets lastprivate kind.
void setKind(OpenMPLastprivateModifier Kind) { LPKind = Kind; }
/// Sets location of the lastprivate kind.
void setKindLoc(SourceLocation Loc) { LPKindLoc = Loc; }
/// Sets colon symbol location.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

2723public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
/// \param SrcExprs List of helper expressions for proper generation of
/// assignment operation required for lastprivate clause. This list represents
/// private variables (for arrays, single array element).
/// \param DstExprs List of helper expressions for proper generation of
/// assignment operation required for lastprivate clause. This list represents
/// original variables (for arrays, single array element).
/// \param AssignmentOps List of helper expressions that represents assignment
/// operation:
/// \code
/// DstExprs = SrcExprs;
/// \endcode
/// Required for proper codegen of final assignment performed by the
/// lastprivate clause.
/// \param LPKind Lastprivate kind, e.g. 'conditional'.
/// \param LPKindLoc Location of the lastprivate kind.
/// \param ColonLoc Location of the ':' symbol if lastprivate kind is used.
/// \param PreInit Statement that must be executed before entering the OpenMP
/// region with this clause.
/// \param PostUpdate Expression that must be executed after exit from the
/// OpenMP region with this clause.
static OMPLastprivateClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation EndLoc, ArrayRef<Expr *> VL, ArrayRef<Expr *> SrcExprs,
       ArrayRef<Expr *> DstExprs, ArrayRef<Expr *> AssignmentOps,
       OpenMPLastprivateModifier LPKind, SourceLocation LPKindLoc,
       SourceLocation ColonLoc, Stmt *PreInit, Expr *PostUpdate);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPLastprivateClause *CreateEmpty(const ASTContext &C, unsigned N);

/// Lastprivate kind.
OpenMPLastprivateModifier getKind() const { return LPKind; }
/// Returns the location of the lastprivate kind.
SourceLocation getKindLoc() const { return LPKindLoc; }
/// Returns the location of the ':' symbol, if any.
SourceLocation getColonLoc() const { return ColonLoc; }

using helper_expr_iterator = MutableArrayRef<Expr *>::iterator;
using helper_expr_const_iterator = ArrayRef<const Expr *>::iterator;
using helper_expr_range = llvm::iterator_range<helper_expr_iterator>;
using helper_expr_const_range =
    llvm::iterator_range<helper_expr_const_iterator>;

/// Set list of helper expressions, required for generation of private
/// copies of original lastprivate variables.
void setPrivateCopies(ArrayRef<Expr *> PrivateCopies);

helper_expr_const_range private_copies() const {
  return helper_expr_const_range(getPrivateCopies().begin(),
                                 getPrivateCopies().end());
}

helper_expr_range private_copies() {
  return helper_expr_range(getPrivateCopies().begin(),
                           getPrivateCopies().end());
}

helper_expr_const_range source_exprs() const {
  return helper_expr_const_range(getSourceExprs().begin(),
                                 getSourceExprs().end());
}

helper_expr_range source_exprs() {
  return helper_expr_range(getSourceExprs().begin(), getSourceExprs().end());
}

helper_expr_const_range destination_exprs() const {
  return helper_expr_const_range(getDestinationExprs().begin(),
                                 getDestinationExprs().end());
}

helper_expr_range destination_exprs() {
  return helper_expr_range(getDestinationExprs().begin(),
                           getDestinationExprs().end());
}

helper_expr_const_range assignment_ops() const {
  return helper_expr_const_range(getAssignmentOps().begin(),
                                 getAssignmentOps().end());
}

helper_expr_range assignment_ops() {
  return helper_expr_range(getAssignmentOps().begin(),
                           getAssignmentOps().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPLastprivateClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_lastprivate;
}
2840};

2842/// This represents clause 'shared' in the '#pragma omp ...' directives.
2843///
2844/// \code
2845/// #pragma omp parallel shared(a,b)
2846/// \endcode
2847/// In this example directive '#pragma omp parallel' has clause 'shared'
2848/// with the variables 'a' and 'b'.
2849class OMPSharedClause final
  : public OMPVarListClause<OMPSharedClause>,
    private llvm::TrailingObjects<OMPSharedClause, Expr *> {
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPSharedClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPSharedClause>(llvm::omp::OMPC_shared, StartLoc,
                                        LParenLoc, EndLoc, N) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPSharedClause(unsigned N)
    : OMPVarListClause<OMPSharedClause>(llvm::omp::OMPC_shared,
                                        SourceLocation(), SourceLocation(),
                                        SourceLocation(), N) {}

2874public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
static OMPSharedClause *Create(const ASTContext &C, SourceLocation StartLoc,
                               SourceLocation LParenLoc,
                               SourceLocation EndLoc, ArrayRef<Expr *> VL);

/// Creates an empty clause with \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPSharedClause *CreateEmpty(const ASTContext &C, unsigned N);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPSharedClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_shared;
}
2912};

2914/// This represents clause 'reduction' in the '#pragma omp ...'
2915/// directives.
2916///
2917/// \code
2918/// #pragma omp parallel reduction(+:a,b)
2919/// \endcode
2920/// In this example directive '#pragma omp parallel' has clause 'reduction'
2921/// with operator '+' and the variables 'a' and 'b'.
2922class OMPReductionClause final
  : public OMPVarListClause<OMPReductionClause>,
    public OMPClauseWithPostUpdate,
    private llvm::TrailingObjects<OMPReductionClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Reduction modifier.
OpenMPReductionClauseModifier Modifier = OMPC_REDUCTION_unknown;

/// Reduction modifier location.
SourceLocation ModifierLoc;

/// Location of ':'.
SourceLocation ColonLoc;

/// Nested name specifier for C++.
NestedNameSpecifierLoc QualifierLoc;

/// Name of custom operator.
DeclarationNameInfo NameInfo;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ModifierLoc Modifier location.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
/// \param QualifierLoc The nested-name qualifier with location information
/// \param NameInfo The full name info for reduction identifier.
OMPReductionClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                   SourceLocation ModifierLoc, SourceLocation ColonLoc,
                   SourceLocation EndLoc,
                   OpenMPReductionClauseModifier Modifier, unsigned N,
                   NestedNameSpecifierLoc QualifierLoc,
                   const DeclarationNameInfo &NameInfo)
    : OMPVarListClause<OMPReductionClause>(llvm::omp::OMPC_reduction,
                                           StartLoc, LParenLoc, EndLoc, N),
      OMPClauseWithPostUpdate(this), Modifier(Modifier),
      ModifierLoc(ModifierLoc), ColonLoc(ColonLoc),
      QualifierLoc(QualifierLoc), NameInfo(NameInfo) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPReductionClause(unsigned N)
    : OMPVarListClause<OMPReductionClause>(llvm::omp::OMPC_reduction,
                                           SourceLocation(), SourceLocation(),
                                           SourceLocation(), N),
      OMPClauseWithPostUpdate(this) {}

/// Sets reduction modifier.
void setModifier(OpenMPReductionClauseModifier M) { Modifier = M; }

/// Sets location of the modifier.
void setModifierLoc(SourceLocation Loc) { ModifierLoc = Loc; }

/// Sets location of ':' symbol in clause.
void setColonLoc(SourceLocation CL) { ColonLoc = CL; }

/// Sets the name info for specified reduction identifier.
void setNameInfo(DeclarationNameInfo DNI) { NameInfo = DNI; }

/// Sets the nested name specifier.
void setQualifierLoc(NestedNameSpecifierLoc NSL) { QualifierLoc = NSL; }

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent private copy of the reduction
/// variable.
void setPrivates(ArrayRef<Expr *> Privates);

/// Get the list of helper privates.
MutableArrayRef<Expr *> getPrivates() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivates() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent LHS expression in the final
/// reduction expression performed by the reduction clause.
void setLHSExprs(ArrayRef<Expr *> LHSExprs);

/// Get the list of helper LHS expressions.
MutableArrayRef<Expr *> getLHSExprs() {
  return MutableArrayRef<Expr *>(getPrivates().end(), varlist_size());
}
ArrayRef<const Expr *> getLHSExprs() const {
  return llvm::makeArrayRef(getPrivates().end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent RHS expression in the final
/// reduction expression performed by the reduction clause.
/// Also, variables in these expressions are used for proper initialization of
/// reduction copies.
void setRHSExprs(ArrayRef<Expr *> RHSExprs);

/// Get the list of helper destination expressions.
MutableArrayRef<Expr *> getRHSExprs() {
  return MutableArrayRef<Expr *>(getLHSExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getRHSExprs() const {
  return llvm::makeArrayRef(getLHSExprs().end(), varlist_size());
}

/// Set list of helper reduction expressions, required for proper
/// codegen of the clause. These expressions are binary expressions or
/// operator/custom reduction call that calculates new value from source
/// helper expressions to destination helper expressions.
void setReductionOps(ArrayRef<Expr *> ReductionOps);

/// Get the list of helper reduction expressions.
MutableArrayRef<Expr *> getReductionOps() {
  return MutableArrayRef<Expr *>(getRHSExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getReductionOps() const {
  return llvm::makeArrayRef(getRHSExprs().end(), varlist_size());
}

/// Set list of helper copy operations for inscan reductions.
/// The form is: Temps[i] = LHS[i];
void setInscanCopyOps(ArrayRef<Expr *> Ops);

/// Get the list of helper inscan copy operations.
MutableArrayRef<Expr *> getInscanCopyOps() {
  return MutableArrayRef<Expr *>(getReductionOps().end(), varlist_size());
}
ArrayRef<const Expr *> getInscanCopyOps() const {
  return llvm::makeArrayRef(getReductionOps().end(), varlist_size());
}

/// Set list of helper temp vars for inscan copy array operations.
void setInscanCopyArrayTemps(ArrayRef<Expr *> CopyArrayTemps);

/// Get the list of helper inscan copy temps.
MutableArrayRef<Expr *> getInscanCopyArrayTemps() {
  return MutableArrayRef<Expr *>(getInscanCopyOps().end(), varlist_size());
}
ArrayRef<const Expr *> getInscanCopyArrayTemps() const {
  return llvm::makeArrayRef(getInscanCopyOps().end(), varlist_size());
}

/// Set list of helper temp elements vars for inscan copy array operations.
void setInscanCopyArrayElems(ArrayRef<Expr *> CopyArrayElems);

/// Get the list of helper inscan copy temps.
MutableArrayRef<Expr *> getInscanCopyArrayElems() {
  return MutableArrayRef<Expr *>(getInscanCopyArrayTemps().end(),
                                 varlist_size());
}
ArrayRef<const Expr *> getInscanCopyArrayElems() const {
  return llvm::makeArrayRef(getInscanCopyArrayTemps().end(), varlist_size());
}

3081public:
/// Creates clause with a list of variables \a VL.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ModifierLoc Modifier location.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param VL The variables in the clause.
/// \param QualifierLoc The nested-name qualifier with location information
/// \param NameInfo The full name info for reduction identifier.
/// \param Privates List of helper expressions for proper generation of
/// private copies.
/// \param LHSExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// LHSs of the reduction expressions.
/// \param RHSExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// RHSs of the reduction expressions.
/// Also, variables in these expressions are used for proper initialization of
/// reduction copies.
/// \param ReductionOps List of helper expressions that represents reduction
/// expressions:
/// \code
/// LHSExprs binop RHSExprs;
/// operator binop(LHSExpr, RHSExpr);
/// <CutomReduction>(LHSExpr, RHSExpr);
/// \endcode
/// Required for proper codegen of final reduction operation performed by the
/// reduction clause.
/// \param CopyOps List of copy operations for inscan reductions:
/// \code
/// TempExprs = LHSExprs;
/// \endcode
/// \param CopyArrayTemps Temp arrays for prefix sums.
/// \param CopyArrayElems Temp arrays for prefix sums.
/// \param PreInit Statement that must be executed before entering the OpenMP
/// region with this clause.
/// \param PostUpdate Expression that must be executed after exit from the
/// OpenMP region with this clause.
static OMPReductionClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation ModifierLoc, SourceLocation ColonLoc,
       SourceLocation EndLoc, OpenMPReductionClauseModifier Modifier,
       ArrayRef<Expr *> VL, NestedNameSpecifierLoc QualifierLoc,
       const DeclarationNameInfo &NameInfo, ArrayRef<Expr *> Privates,
       ArrayRef<Expr *> LHSExprs, ArrayRef<Expr *> RHSExprs,
       ArrayRef<Expr *> ReductionOps, ArrayRef<Expr *> CopyOps,
       ArrayRef<Expr *> CopyArrayTemps, ArrayRef<Expr *> CopyArrayElems,
       Stmt *PreInit, Expr *PostUpdate);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
/// \param Modifier Reduction modifier.
static OMPReductionClause *
CreateEmpty(const ASTContext &C, unsigned N,
            OpenMPReductionClauseModifier Modifier);

/// Returns modifier.
OpenMPReductionClauseModifier getModifier() const { return Modifier; }

/// Returns modifier location.
SourceLocation getModifierLoc() const { return ModifierLoc; }

/// Gets location of ':' symbol in clause.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Gets the name info for specified reduction identifier.
const DeclarationNameInfo &getNameInfo() const { return NameInfo; }

/// Gets the nested name specifier.
NestedNameSpecifierLoc getQualifierLoc() const { return QualifierLoc; }

using helper_expr_iterator = MutableArrayRef<Expr *>::iterator;
using helper_expr_const_iterator = ArrayRef<const Expr *>::iterator;
using helper_expr_range = llvm::iterator_range<helper_expr_iterator>;
using helper_expr_const_range =
    llvm::iterator_range<helper_expr_const_iterator>;

helper_expr_const_range privates() const {
  return helper_expr_const_range(getPrivates().begin(), getPrivates().end());
}

helper_expr_range privates() {
  return helper_expr_range(getPrivates().begin(), getPrivates().end());
}

helper_expr_const_range lhs_exprs() const {
  return helper_expr_const_range(getLHSExprs().begin(), getLHSExprs().end());
}

helper_expr_range lhs_exprs() {
  return helper_expr_range(getLHSExprs().begin(), getLHSExprs().end());
}

helper_expr_const_range rhs_exprs() const {
  return helper_expr_const_range(getRHSExprs().begin(), getRHSExprs().end());
}

helper_expr_range rhs_exprs() {
  return helper_expr_range(getRHSExprs().begin(), getRHSExprs().end());
}

helper_expr_const_range reduction_ops() const {
  return helper_expr_const_range(getReductionOps().begin(),
                                 getReductionOps().end());
}

helper_expr_range reduction_ops() {
  return helper_expr_range(getReductionOps().begin(),
                           getReductionOps().end());
}

helper_expr_const_range copy_ops() const {
  return helper_expr_const_range(getInscanCopyOps().begin(),
                                 getInscanCopyOps().end());
}

helper_expr_range copy_ops() {
  return helper_expr_range(getInscanCopyOps().begin(),
                           getInscanCopyOps().end());
}

helper_expr_const_range copy_array_temps() const {
  return helper_expr_const_range(getInscanCopyArrayTemps().begin(),
                                 getInscanCopyArrayTemps().end());
}

helper_expr_range copy_array_temps() {
  return helper_expr_range(getInscanCopyArrayTemps().begin(),
                           getInscanCopyArrayTemps().end());
}

helper_expr_const_range copy_array_elems() const {
  return helper_expr_const_range(getInscanCopyArrayElems().begin(),
                                 getInscanCopyArrayElems().end());
}

helper_expr_range copy_array_elems() {
  return helper_expr_range(getInscanCopyArrayElems().begin(),
                           getInscanCopyArrayElems().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPReductionClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}
const_child_range used_children() const {
  auto Children = const_cast<OMPReductionClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_reduction;
}
3248};

3250/// This represents clause 'task_reduction' in the '#pragma omp taskgroup'
3251/// directives.
3252///
3253/// \code
3254/// #pragma omp taskgroup task_reduction(+:a,b)
3255/// \endcode
3256/// In this example directive '#pragma omp taskgroup' has clause
3257/// 'task_reduction' with operator '+' and the variables 'a' and 'b'.
3258class OMPTaskReductionClause final
  : public OMPVarListClause<OMPTaskReductionClause>,
    public OMPClauseWithPostUpdate,
    private llvm::TrailingObjects<OMPTaskReductionClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Location of ':'.
SourceLocation ColonLoc;

/// Nested name specifier for C++.
NestedNameSpecifierLoc QualifierLoc;

/// Name of custom operator.
DeclarationNameInfo NameInfo;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param ColonLoc Location of ':'.
/// \param N Number of the variables in the clause.
/// \param QualifierLoc The nested-name qualifier with location information
/// \param NameInfo The full name info for reduction identifier.
OMPTaskReductionClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                       SourceLocation ColonLoc, SourceLocation EndLoc,
                       unsigned N, NestedNameSpecifierLoc QualifierLoc,
                       const DeclarationNameInfo &NameInfo)
    : OMPVarListClause<OMPTaskReductionClause>(
          llvm::omp::OMPC_task_reduction, StartLoc, LParenLoc, EndLoc, N),
      OMPClauseWithPostUpdate(this), ColonLoc(ColonLoc),
      QualifierLoc(QualifierLoc), NameInfo(NameInfo) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPTaskReductionClause(unsigned N)
    : OMPVarListClause<OMPTaskReductionClause>(
          llvm::omp::OMPC_task_reduction, SourceLocation(), SourceLocation(),
          SourceLocation(), N),
      OMPClauseWithPostUpdate(this) {}

/// Sets location of ':' symbol in clause.
void setColonLoc(SourceLocation CL) { ColonLoc = CL; }

/// Sets the name info for specified reduction identifier.
void setNameInfo(DeclarationNameInfo DNI) { NameInfo = DNI; }

/// Sets the nested name specifier.
void setQualifierLoc(NestedNameSpecifierLoc NSL) { QualifierLoc = NSL; }

/// Set list of helper expressions, required for proper codegen of the clause.
/// These expressions represent private copy of the reduction variable.
void setPrivates(ArrayRef<Expr *> Privates);

/// Get the list of helper privates.
MutableArrayRef<Expr *> getPrivates() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivates() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the clause.
/// These expressions represent LHS expression in the final reduction
/// expression performed by the reduction clause.
void setLHSExprs(ArrayRef<Expr *> LHSExprs);

/// Get the list of helper LHS expressions.
MutableArrayRef<Expr *> getLHSExprs() {
  return MutableArrayRef<Expr *>(getPrivates().end(), varlist_size());
}
ArrayRef<const Expr *> getLHSExprs() const {
  return llvm::makeArrayRef(getPrivates().end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the clause.
/// These expressions represent RHS expression in the final reduction
/// expression performed by the reduction clause. Also, variables in these
/// expressions are used for proper initialization of reduction copies.
void setRHSExprs(ArrayRef<Expr *> RHSExprs);

///  Get the list of helper destination expressions.
MutableArrayRef<Expr *> getRHSExprs() {
  return MutableArrayRef<Expr *>(getLHSExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getRHSExprs() const {
  return llvm::makeArrayRef(getLHSExprs().end(), varlist_size());
}

/// Set list of helper reduction expressions, required for proper
/// codegen of the clause. These expressions are binary expressions or
/// operator/custom reduction call that calculates new value from source
/// helper expressions to destination helper expressions.
void setReductionOps(ArrayRef<Expr *> ReductionOps);

///  Get the list of helper reduction expressions.
MutableArrayRef<Expr *> getReductionOps() {
  return MutableArrayRef<Expr *>(getRHSExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getReductionOps() const {
  return llvm::makeArrayRef(getRHSExprs().end(), varlist_size());
}

3364public:
/// Creates clause with a list of variables \a VL.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param VL The variables in the clause.
/// \param QualifierLoc The nested-name qualifier with location information
/// \param NameInfo The full name info for reduction identifier.
/// \param Privates List of helper expressions for proper generation of
/// private copies.
/// \param LHSExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// LHSs of the reduction expressions.
/// \param RHSExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// RHSs of the reduction expressions.
/// Also, variables in these expressions are used for proper initialization of
/// reduction copies.
/// \param ReductionOps List of helper expressions that represents reduction
/// expressions:
/// \code
/// LHSExprs binop RHSExprs;
/// operator binop(LHSExpr, RHSExpr);
/// <CutomReduction>(LHSExpr, RHSExpr);
/// \endcode
/// Required for proper codegen of final reduction operation performed by the
/// reduction clause.
/// \param PreInit Statement that must be executed before entering the OpenMP
/// region with this clause.
/// \param PostUpdate Expression that must be executed after exit from the
/// OpenMP region with this clause.
static OMPTaskReductionClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation ColonLoc, SourceLocation EndLoc, ArrayRef<Expr *> VL,
       NestedNameSpecifierLoc QualifierLoc,
       const DeclarationNameInfo &NameInfo, ArrayRef<Expr *> Privates,
       ArrayRef<Expr *> LHSExprs, ArrayRef<Expr *> RHSExprs,
       ArrayRef<Expr *> ReductionOps, Stmt *PreInit, Expr *PostUpdate);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPTaskReductionClause *CreateEmpty(const ASTContext &C, unsigned N);

/// Gets location of ':' symbol in clause.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Gets the name info for specified reduction identifier.
const DeclarationNameInfo &getNameInfo() const { return NameInfo; }

/// Gets the nested name specifier.
NestedNameSpecifierLoc getQualifierLoc() const { return QualifierLoc; }

using helper_expr_iterator = MutableArrayRef<Expr *>::iterator;
using helper_expr_const_iterator = ArrayRef<const Expr *>::iterator;
using helper_expr_range = llvm::iterator_range<helper_expr_iterator>;
using helper_expr_const_range =
    llvm::iterator_range<helper_expr_const_iterator>;

helper_expr_const_range privates() const {
  return helper_expr_const_range(getPrivates().begin(), getPrivates().end());
}

helper_expr_range privates() {
  return helper_expr_range(getPrivates().begin(), getPrivates().end());
}

helper_expr_const_range lhs_exprs() const {
  return helper_expr_const_range(getLHSExprs().begin(), getLHSExprs().end());
}

helper_expr_range lhs_exprs() {
  return helper_expr_range(getLHSExprs().begin(), getLHSExprs().end());
}

helper_expr_const_range rhs_exprs() const {
  return helper_expr_const_range(getRHSExprs().begin(), getRHSExprs().end());
}

helper_expr_range rhs_exprs() {
  return helper_expr_range(getRHSExprs().begin(), getRHSExprs().end());
}

helper_expr_const_range reduction_ops() const {
  return helper_expr_const_range(getReductionOps().begin(),
                                 getReductionOps().end());
}

helper_expr_range reduction_ops() {
  return helper_expr_range(getReductionOps().begin(),
                           getReductionOps().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPTaskReductionClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_task_reduction;
}
3480};

3482/// This represents clause 'in_reduction' in the '#pragma omp task' directives.
3483///
3484/// \code
3485/// #pragma omp task in_reduction(+:a,b)
3486/// \endcode
3487/// In this example directive '#pragma omp task' has clause 'in_reduction' with
3488/// operator '+' and the variables 'a' and 'b'.
3489class OMPInReductionClause final
  : public OMPVarListClause<OMPInReductionClause>,
    public OMPClauseWithPostUpdate,
    private llvm::TrailingObjects<OMPInReductionClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Location of ':'.
SourceLocation ColonLoc;

/// Nested name specifier for C++.
NestedNameSpecifierLoc QualifierLoc;

/// Name of custom operator.
DeclarationNameInfo NameInfo;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param ColonLoc Location of ':'.
/// \param N Number of the variables in the clause.
/// \param QualifierLoc The nested-name qualifier with location information
/// \param NameInfo The full name info for reduction identifier.
OMPInReductionClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                     SourceLocation ColonLoc, SourceLocation EndLoc,
                     unsigned N, NestedNameSpecifierLoc QualifierLoc,
                     const DeclarationNameInfo &NameInfo)
    : OMPVarListClause<OMPInReductionClause>(llvm::omp::OMPC_in_reduction,
                                             StartLoc, LParenLoc, EndLoc, N),
      OMPClauseWithPostUpdate(this), ColonLoc(ColonLoc),
      QualifierLoc(QualifierLoc), NameInfo(NameInfo) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPInReductionClause(unsigned N)
    : OMPVarListClause<OMPInReductionClause>(
          llvm::omp::OMPC_in_reduction, SourceLocation(), SourceLocation(),
          SourceLocation(), N),
      OMPClauseWithPostUpdate(this) {}

/// Sets location of ':' symbol in clause.
void setColonLoc(SourceLocation CL) { ColonLoc = CL; }

/// Sets the name info for specified reduction identifier.
void setNameInfo(DeclarationNameInfo DNI) { NameInfo = DNI; }

/// Sets the nested name specifier.
void setQualifierLoc(NestedNameSpecifierLoc NSL) { QualifierLoc = NSL; }

/// Set list of helper expressions, required for proper codegen of the clause.
/// These expressions represent private copy of the reduction variable.
void setPrivates(ArrayRef<Expr *> Privates);

/// Get the list of helper privates.
MutableArrayRef<Expr *> getPrivates() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivates() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the clause.
/// These expressions represent LHS expression in the final reduction
/// expression performed by the reduction clause.
void setLHSExprs(ArrayRef<Expr *> LHSExprs);

/// Get the list of helper LHS expressions.
MutableArrayRef<Expr *> getLHSExprs() {
  return MutableArrayRef<Expr *>(getPrivates().end(), varlist_size());
}
ArrayRef<const Expr *> getLHSExprs() const {
  return llvm::makeArrayRef(getPrivates().end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the clause.
/// These expressions represent RHS expression in the final reduction
/// expression performed by the reduction clause. Also, variables in these
/// expressions are used for proper initialization of reduction copies.
void setRHSExprs(ArrayRef<Expr *> RHSExprs);

///  Get the list of helper destination expressions.
MutableArrayRef<Expr *> getRHSExprs() {
  return MutableArrayRef<Expr *>(getLHSExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getRHSExprs() const {
  return llvm::makeArrayRef(getLHSExprs().end(), varlist_size());
}

/// Set list of helper reduction expressions, required for proper
/// codegen of the clause. These expressions are binary expressions or
/// operator/custom reduction call that calculates new value from source
/// helper expressions to destination helper expressions.
void setReductionOps(ArrayRef<Expr *> ReductionOps);

///  Get the list of helper reduction expressions.
MutableArrayRef<Expr *> getReductionOps() {
  return MutableArrayRef<Expr *>(getRHSExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getReductionOps() const {
  return llvm::makeArrayRef(getRHSExprs().end(), varlist_size());
}

/// Set list of helper reduction taskgroup descriptors.
void setTaskgroupDescriptors(ArrayRef<Expr *> ReductionOps);

///  Get the list of helper reduction taskgroup descriptors.
MutableArrayRef<Expr *> getTaskgroupDescriptors() {
  return MutableArrayRef<Expr *>(getReductionOps().end(), varlist_size());
}
ArrayRef<const Expr *> getTaskgroupDescriptors() const {
  return llvm::makeArrayRef(getReductionOps().end(), varlist_size());
}

3606public:
/// Creates clause with a list of variables \a VL.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param VL The variables in the clause.
/// \param QualifierLoc The nested-name qualifier with location information
/// \param NameInfo The full name info for reduction identifier.
/// \param Privates List of helper expressions for proper generation of
/// private copies.
/// \param LHSExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// LHSs of the reduction expressions.
/// \param RHSExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// RHSs of the reduction expressions.
/// Also, variables in these expressions are used for proper initialization of
/// reduction copies.
/// \param ReductionOps List of helper expressions that represents reduction
/// expressions:
/// \code
/// LHSExprs binop RHSExprs;
/// operator binop(LHSExpr, RHSExpr);
/// <CutomReduction>(LHSExpr, RHSExpr);
/// \endcode
/// Required for proper codegen of final reduction operation performed by the
/// reduction clause.
/// \param TaskgroupDescriptors List of helper taskgroup descriptors for
/// corresponding items in parent taskgroup task_reduction clause.
/// \param PreInit Statement that must be executed before entering the OpenMP
/// region with this clause.
/// \param PostUpdate Expression that must be executed after exit from the
/// OpenMP region with this clause.
static OMPInReductionClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation ColonLoc, SourceLocation EndLoc, ArrayRef<Expr *> VL,
       NestedNameSpecifierLoc QualifierLoc,
       const DeclarationNameInfo &NameInfo, ArrayRef<Expr *> Privates,
       ArrayRef<Expr *> LHSExprs, ArrayRef<Expr *> RHSExprs,
       ArrayRef<Expr *> ReductionOps, ArrayRef<Expr *> TaskgroupDescriptors,
       Stmt *PreInit, Expr *PostUpdate);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPInReductionClause *CreateEmpty(const ASTContext &C, unsigned N);

/// Gets location of ':' symbol in clause.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Gets the name info for specified reduction identifier.
const DeclarationNameInfo &getNameInfo() const { return NameInfo; }

/// Gets the nested name specifier.
NestedNameSpecifierLoc getQualifierLoc() const { return QualifierLoc; }

using helper_expr_iterator = MutableArrayRef<Expr *>::iterator;
using helper_expr_const_iterator = ArrayRef<const Expr *>::iterator;
using helper_expr_range = llvm::iterator_range<helper_expr_iterator>;
using helper_expr_const_range =
    llvm::iterator_range<helper_expr_const_iterator>;

helper_expr_const_range privates() const {
  return helper_expr_const_range(getPrivates().begin(), getPrivates().end());
}

helper_expr_range privates() {
  return helper_expr_range(getPrivates().begin(), getPrivates().end());
}

helper_expr_const_range lhs_exprs() const {
  return helper_expr_const_range(getLHSExprs().begin(), getLHSExprs().end());
}

helper_expr_range lhs_exprs() {
  return helper_expr_range(getLHSExprs().begin(), getLHSExprs().end());
}

helper_expr_const_range rhs_exprs() const {
  return helper_expr_const_range(getRHSExprs().begin(), getRHSExprs().end());
}

helper_expr_range rhs_exprs() {
  return helper_expr_range(getRHSExprs().begin(), getRHSExprs().end());
}

helper_expr_const_range reduction_ops() const {
  return helper_expr_const_range(getReductionOps().begin(),
                                 getReductionOps().end());
}

helper_expr_range reduction_ops() {
  return helper_expr_range(getReductionOps().begin(),
                           getReductionOps().end());
}

helper_expr_const_range taskgroup_descriptors() const {
  return helper_expr_const_range(getTaskgroupDescriptors().begin(),
                                 getTaskgroupDescriptors().end());
}

helper_expr_range taskgroup_descriptors() {
  return helper_expr_range(getTaskgroupDescriptors().begin(),
                           getTaskgroupDescriptors().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPInReductionClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_in_reduction;
}
3735};

3737/// This represents clause 'linear' in the '#pragma omp ...'
3738/// directives.
3739///
3740/// \code
3741/// #pragma omp simd linear(a,b : 2)
3742/// \endcode
3743/// In this example directive '#pragma omp simd' has clause 'linear'
3744/// with variables 'a', 'b' and linear step '2'.
3745class OMPLinearClause final
  : public OMPVarListClause<OMPLinearClause>,
    public OMPClauseWithPostUpdate,
    private llvm::TrailingObjects<OMPLinearClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Modifier of 'linear' clause.
OpenMPLinearClauseKind Modifier = OMPC_LINEAR_val;

/// Location of linear modifier if any.
SourceLocation ModifierLoc;

/// Location of ':'.
SourceLocation ColonLoc;

/// Sets the linear step for clause.
void setStep(Expr *Step) { *(getFinals().end()) = Step; }

/// Sets the expression to calculate linear step for clause.
void setCalcStep(Expr *CalcStep) { *(getFinals().end() + 1) = CalcStep; }

/// Build 'linear' clause with given number of variables \a NumVars.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param NumVars Number of variables.
OMPLinearClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                OpenMPLinearClauseKind Modifier, SourceLocation ModifierLoc,
                SourceLocation ColonLoc, SourceLocation EndLoc,
                unsigned NumVars)
    : OMPVarListClause<OMPLinearClause>(llvm::omp::OMPC_linear, StartLoc,
                                        LParenLoc, EndLoc, NumVars),
      OMPClauseWithPostUpdate(this), Modifier(Modifier),
      ModifierLoc(ModifierLoc), ColonLoc(ColonLoc) {}

/// Build an empty clause.
///
/// \param NumVars Number of variables.
explicit OMPLinearClause(unsigned NumVars)
    : OMPVarListClause<OMPLinearClause>(llvm::omp::OMPC_linear,
                                        SourceLocation(), SourceLocation(),
                                        SourceLocation(), NumVars),
      OMPClauseWithPostUpdate(this) {}

/// Gets the list of initial values for linear variables.
///
/// There are NumVars expressions with initial values allocated after the
/// varlist, they are followed by NumVars update expressions (used to update
/// the linear variable's value on current iteration) and they are followed by
/// NumVars final expressions (used to calculate the linear variable's
/// value after the loop body). After these lists, there are 2 helper
/// expressions - linear step and a helper to calculate it before the
/// loop body (used when the linear step is not constant):
///
/// { Vars[] /* in OMPVarListClause */; Privates[]; Inits[]; Updates[];
/// Finals[]; Step; CalcStep; }
MutableArrayRef<Expr *> getPrivates() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivates() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

MutableArrayRef<Expr *> getInits() {
  return MutableArrayRef<Expr *>(getPrivates().end(), varlist_size());
}
ArrayRef<const Expr *> getInits() const {
  return llvm::makeArrayRef(getPrivates().end(), varlist_size());
}

/// Sets the list of update expressions for linear variables.
MutableArrayRef<Expr *> getUpdates() {
  return MutableArrayRef<Expr *>(getInits().end(), varlist_size());
}
ArrayRef<const Expr *> getUpdates() const {
  return llvm::makeArrayRef(getInits().end(), varlist_size());
}

/// Sets the list of final update expressions for linear variables.
MutableArrayRef<Expr *> getFinals() {
  return MutableArrayRef<Expr *>(getUpdates().end(), varlist_size());
}
ArrayRef<const Expr *> getFinals() const {
  return llvm::makeArrayRef(getUpdates().end(), varlist_size());
}

/// Gets the list of used expressions for linear variables.
MutableArrayRef<Expr *> getUsedExprs() {
  return MutableArrayRef<Expr *>(getFinals().end() + 2, varlist_size() + 1);
}
ArrayRef<const Expr *> getUsedExprs() const {
  return llvm::makeArrayRef(getFinals().end() + 2, varlist_size() + 1);
}

/// Sets the list of the copies of original linear variables.
/// \param PL List of expressions.
void setPrivates(ArrayRef<Expr *> PL);

/// Sets the list of the initial values for linear variables.
/// \param IL List of expressions.
void setInits(ArrayRef<Expr *> IL);

3851public:
/// Creates clause with a list of variables \a VL and a linear step
/// \a Step.
///
/// \param C AST Context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param Modifier Modifier of 'linear' clause.
/// \param ModifierLoc Modifier location.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
/// \param PL List of private copies of original variables.
/// \param IL List of initial values for the variables.
/// \param Step Linear step.
/// \param CalcStep Calculation of the linear step.
/// \param PreInit Statement that must be executed before entering the OpenMP
/// region with this clause.
/// \param PostUpdate Expression that must be executed after exit from the
/// OpenMP region with this clause.
static OMPLinearClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       OpenMPLinearClauseKind Modifier, SourceLocation ModifierLoc,
       SourceLocation ColonLoc, SourceLocation EndLoc, ArrayRef<Expr *> VL,
       ArrayRef<Expr *> PL, ArrayRef<Expr *> IL, Expr *Step, Expr *CalcStep,
       Stmt *PreInit, Expr *PostUpdate);

/// Creates an empty clause with the place for \a NumVars variables.
///
/// \param C AST context.
/// \param NumVars Number of variables.
static OMPLinearClause *CreateEmpty(const ASTContext &C, unsigned NumVars);

/// Set modifier.
void setModifier(OpenMPLinearClauseKind Kind) { Modifier = Kind; }

/// Return modifier.
OpenMPLinearClauseKind getModifier() const { return Modifier; }

/// Set modifier location.
void setModifierLoc(SourceLocation Loc) { ModifierLoc = Loc; }

/// Return modifier location.
SourceLocation getModifierLoc() const { return ModifierLoc; }

/// Sets the location of ':'.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

/// Returns the location of ':'.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Returns linear step.
Expr *getStep() { return *(getFinals().end()); }

/// Returns linear step.
const Expr *getStep() const { return *(getFinals().end()); }

/// Returns expression to calculate linear step.
Expr *getCalcStep() { return *(getFinals().end() + 1); }

/// Returns expression to calculate linear step.
const Expr *getCalcStep() const { return *(getFinals().end() + 1); }

/// Sets the list of update expressions for linear variables.
/// \param UL List of expressions.
void setUpdates(ArrayRef<Expr *> UL);

/// Sets the list of final update expressions for linear variables.
/// \param FL List of expressions.
void setFinals(ArrayRef<Expr *> FL);

/// Sets the list of used expressions for the linear clause.
void setUsedExprs(ArrayRef<Expr *> UE);

using privates_iterator = MutableArrayRef<Expr *>::iterator;
using privates_const_iterator = ArrayRef<const Expr *>::iterator;
using privates_range = llvm::iterator_range<privates_iterator>;
using privates_const_range = llvm::iterator_range<privates_const_iterator>;

privates_range privates() {
  return privates_range(getPrivates().begin(), getPrivates().end());
}

privates_const_range privates() const {
  return privates_const_range(getPrivates().begin(), getPrivates().end());
}

using inits_iterator = MutableArrayRef<Expr *>::iterator;
using inits_const_iterator = ArrayRef<const Expr *>::iterator;
using inits_range = llvm::iterator_range<inits_iterator>;
using inits_const_range = llvm::iterator_range<inits_const_iterator>;

inits_range inits() {
  return inits_range(getInits().begin(), getInits().end());
}

inits_const_range inits() const {
  return inits_const_range(getInits().begin(), getInits().end());
}

using updates_iterator = MutableArrayRef<Expr *>::iterator;
using updates_const_iterator = ArrayRef<const Expr *>::iterator;
using updates_range = llvm::iterator_range<updates_iterator>;
using updates_const_range = llvm::iterator_range<updates_const_iterator>;

updates_range updates() {
  return updates_range(getUpdates().begin(), getUpdates().end());
}

updates_const_range updates() const {
  return updates_const_range(getUpdates().begin(), getUpdates().end());
}

using finals_iterator = MutableArrayRef<Expr *>::iterator;
using finals_const_iterator = ArrayRef<const Expr *>::iterator;
using finals_range = llvm::iterator_range<finals_iterator>;
using finals_const_range = llvm::iterator_range<finals_const_iterator>;

finals_range finals() {
  return finals_range(getFinals().begin(), getFinals().end());
}

finals_const_range finals() const {
  return finals_const_range(getFinals().begin(), getFinals().end());
}

using used_expressions_iterator = MutableArrayRef<Expr *>::iterator;
using used_expressions_const_iterator = ArrayRef<const Expr *>::iterator;
using used_expressions_range =
    llvm::iterator_range<used_expressions_iterator>;
using used_expressions_const_range =
    llvm::iterator_range<used_expressions_const_iterator>;

used_expressions_range used_expressions() {
  return finals_range(getUsedExprs().begin(), getUsedExprs().end());
}

used_expressions_const_range used_expressions() const {
  return finals_const_range(getUsedExprs().begin(), getUsedExprs().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPLinearClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children();

const_child_range used_children() const {
  auto Children = const_cast<OMPLinearClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_linear;
}
4012};

4014/// This represents clause 'aligned' in the '#pragma omp ...'
4015/// directives.
4016///
4017/// \code
4018/// #pragma omp simd aligned(a,b : 8)
4019/// \endcode
4020/// In this example directive '#pragma omp simd' has clause 'aligned'
4021/// with variables 'a', 'b' and alignment '8'.
4022class OMPAlignedClause final
  : public OMPVarListClause<OMPAlignedClause>,
    private llvm::TrailingObjects<OMPAlignedClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Location of ':'.
SourceLocation ColonLoc;

/// Sets the alignment for clause.
void setAlignment(Expr *A) { *varlist_end() = A; }

/// Build 'aligned' clause with given number of variables \a NumVars.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param NumVars Number of variables.
OMPAlignedClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                 SourceLocation ColonLoc, SourceLocation EndLoc,
                 unsigned NumVars)
    : OMPVarListClause<OMPAlignedClause>(llvm::omp::OMPC_aligned, StartLoc,
                                         LParenLoc, EndLoc, NumVars),
      ColonLoc(ColonLoc) {}

/// Build an empty clause.
///
/// \param NumVars Number of variables.
explicit OMPAlignedClause(unsigned NumVars)
    : OMPVarListClause<OMPAlignedClause>(llvm::omp::OMPC_aligned,
                                         SourceLocation(), SourceLocation(),
                                         SourceLocation(), NumVars) {}

4057public:
/// Creates clause with a list of variables \a VL and alignment \a A.
///
/// \param C AST Context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
/// \param A Alignment.
static OMPAlignedClause *Create(const ASTContext &C, SourceLocation StartLoc,
                                SourceLocation LParenLoc,
                                SourceLocation ColonLoc,
                                SourceLocation EndLoc, ArrayRef<Expr *> VL,
                                Expr *A);

/// Creates an empty clause with the place for \a NumVars variables.
///
/// \param C AST context.
/// \param NumVars Number of variables.
static OMPAlignedClause *CreateEmpty(const ASTContext &C, unsigned NumVars);

/// Sets the location of ':'.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

/// Returns the location of ':'.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Returns alignment.
Expr *getAlignment() { return *varlist_end(); }

/// Returns alignment.
const Expr *getAlignment() const { return *varlist_end(); }

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPAlignedClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_aligned;
}
4111};

4113/// This represents clause 'copyin' in the '#pragma omp ...' directives.
4114///
4115/// \code
4116/// #pragma omp parallel copyin(a,b)
4117/// \endcode
4118/// In this example directive '#pragma omp parallel' has clause 'copyin'
4119/// with the variables 'a' and 'b'.
4120class OMPCopyinClause final
  : public OMPVarListClause<OMPCopyinClause>,
    private llvm::TrailingObjects<OMPCopyinClause, Expr *> {
// Class has 3 additional tail allocated arrays:
// 1. List of helper expressions for proper generation of assignment operation
// required for copyin clause. This list represents sources.
// 2. List of helper expressions for proper generation of assignment operation
// required for copyin clause. This list represents destinations.
// 3. List of helper expressions that represents assignment operation:
// \code
// DstExprs = SrcExprs;
// \endcode
// Required for proper codegen of propagation of master's thread values of
// threadprivate variables to local instances of that variables in other
// implicit threads.

friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPCopyinClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPCopyinClause>(llvm::omp::OMPC_copyin, StartLoc,
                                        LParenLoc, EndLoc, N) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPCopyinClause(unsigned N)
    : OMPVarListClause<OMPCopyinClause>(llvm::omp::OMPC_copyin,
                                        SourceLocation(), SourceLocation(),
                                        SourceLocation(), N) {}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent source expression in the final
/// assignment statement performed by the copyin clause.
void setSourceExprs(ArrayRef<Expr *> SrcExprs);

/// Get the list of helper source expressions.
MutableArrayRef<Expr *> getSourceExprs() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getSourceExprs() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent destination expression in the final
/// assignment statement performed by the copyin clause.
void setDestinationExprs(ArrayRef<Expr *> DstExprs);

/// Get the list of helper destination expressions.
MutableArrayRef<Expr *> getDestinationExprs() {
  return MutableArrayRef<Expr *>(getSourceExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getDestinationExprs() const {
  return llvm::makeArrayRef(getSourceExprs().end(), varlist_size());
}

/// Set list of helper assignment expressions, required for proper
/// codegen of the clause. These expressions are assignment expressions that
/// assign source helper expressions to destination helper expressions
/// correspondingly.
void setAssignmentOps(ArrayRef<Expr *> AssignmentOps);

/// Get the list of helper assignment expressions.
MutableArrayRef<Expr *> getAssignmentOps() {
  return MutableArrayRef<Expr *>(getDestinationExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getAssignmentOps() const {
  return llvm::makeArrayRef(getDestinationExprs().end(), varlist_size());
}

4199public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
/// \param SrcExprs List of helper expressions for proper generation of
/// assignment operation required for copyin clause. This list represents
/// sources.
/// \param DstExprs List of helper expressions for proper generation of
/// assignment operation required for copyin clause. This list represents
/// destinations.
/// \param AssignmentOps List of helper expressions that represents assignment
/// operation:
/// \code
/// DstExprs = SrcExprs;
/// \endcode
/// Required for proper codegen of propagation of master's thread values of
/// threadprivate variables to local instances of that variables in other
/// implicit threads.
static OMPCopyinClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation EndLoc, ArrayRef<Expr *> VL, ArrayRef<Expr *> SrcExprs,
       ArrayRef<Expr *> DstExprs, ArrayRef<Expr *> AssignmentOps);

/// Creates an empty clause with \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPCopyinClause *CreateEmpty(const ASTContext &C, unsigned N);

using helper_expr_iterator = MutableArrayRef<Expr *>::iterator;
using helper_expr_const_iterator = ArrayRef<const Expr *>::iterator;
using helper_expr_range = llvm::iterator_range<helper_expr_iterator>;
using helper_expr_const_range =
    llvm::iterator_range<helper_expr_const_iterator>;

helper_expr_const_range source_exprs() const {
  return helper_expr_const_range(getSourceExprs().begin(),
                                 getSourceExprs().end());
}

helper_expr_range source_exprs() {
  return helper_expr_range(getSourceExprs().begin(), getSourceExprs().end());
}

helper_expr_const_range destination_exprs() const {
  return helper_expr_const_range(getDestinationExprs().begin(),
                                 getDestinationExprs().end());
}

helper_expr_range destination_exprs() {
  return helper_expr_range(getDestinationExprs().begin(),
                           getDestinationExprs().end());
}

helper_expr_const_range assignment_ops() const {
  return helper_expr_const_range(getAssignmentOps().begin(),
                                 getAssignmentOps().end());
}

helper_expr_range assignment_ops() {
  return helper_expr_range(getAssignmentOps().begin(),
                           getAssignmentOps().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPCopyinClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_copyin;
}
4287};

4289/// This represents clause 'copyprivate' in the '#pragma omp ...'
4290/// directives.
4291///
4292/// \code
4293/// #pragma omp single copyprivate(a,b)
4294/// \endcode
4295/// In this example directive '#pragma omp single' has clause 'copyprivate'
4296/// with the variables 'a' and 'b'.
4297class OMPCopyprivateClause final
  : public OMPVarListClause<OMPCopyprivateClause>,
    private llvm::TrailingObjects<OMPCopyprivateClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPCopyprivateClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                     SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPCopyprivateClause>(llvm::omp::OMPC_copyprivate,
                                             StartLoc, LParenLoc, EndLoc, N) {
}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPCopyprivateClause(unsigned N)
    : OMPVarListClause<OMPCopyprivateClause>(
          llvm::omp::OMPC_copyprivate, SourceLocation(), SourceLocation(),
          SourceLocation(), N) {}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent source expression in the final
/// assignment statement performed by the copyprivate clause.
void setSourceExprs(ArrayRef<Expr *> SrcExprs);

/// Get the list of helper source expressions.
MutableArrayRef<Expr *> getSourceExprs() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getSourceExprs() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Set list of helper expressions, required for proper codegen of the
/// clause. These expressions represent destination expression in the final
/// assignment statement performed by the copyprivate clause.
void setDestinationExprs(ArrayRef<Expr *> DstExprs);

/// Get the list of helper destination expressions.
MutableArrayRef<Expr *> getDestinationExprs() {
  return MutableArrayRef<Expr *>(getSourceExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getDestinationExprs() const {
  return llvm::makeArrayRef(getSourceExprs().end(), varlist_size());
}

/// Set list of helper assignment expressions, required for proper
/// codegen of the clause. These expressions are assignment expressions that
/// assign source helper expressions to destination helper expressions
/// correspondingly.
void setAssignmentOps(ArrayRef<Expr *> AssignmentOps);

/// Get the list of helper assignment expressions.
MutableArrayRef<Expr *> getAssignmentOps() {
  return MutableArrayRef<Expr *>(getDestinationExprs().end(), varlist_size());
}
ArrayRef<const Expr *> getAssignmentOps() const {
  return llvm::makeArrayRef(getDestinationExprs().end(), varlist_size());
}

4364public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
/// \param SrcExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// sources.
/// \param DstExprs List of helper expressions for proper generation of
/// assignment operation required for copyprivate clause. This list represents
/// destinations.
/// \param AssignmentOps List of helper expressions that represents assignment
/// operation:
/// \code
/// DstExprs = SrcExprs;
/// \endcode
/// Required for proper codegen of final assignment performed by the
/// copyprivate clause.
static OMPCopyprivateClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation EndLoc, ArrayRef<Expr *> VL, ArrayRef<Expr *> SrcExprs,
       ArrayRef<Expr *> DstExprs, ArrayRef<Expr *> AssignmentOps);

/// Creates an empty clause with \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPCopyprivateClause *CreateEmpty(const ASTContext &C, unsigned N);

using helper_expr_iterator = MutableArrayRef<Expr *>::iterator;
using helper_expr_const_iterator = ArrayRef<const Expr *>::iterator;
using helper_expr_range = llvm::iterator_range<helper_expr_iterator>;
using helper_expr_const_range =
    llvm::iterator_range<helper_expr_const_iterator>;

helper_expr_const_range source_exprs() const {
  return helper_expr_const_range(getSourceExprs().begin(),
                                 getSourceExprs().end());
}

helper_expr_range source_exprs() {
  return helper_expr_range(getSourceExprs().begin(), getSourceExprs().end());
}

helper_expr_const_range destination_exprs() const {
  return helper_expr_const_range(getDestinationExprs().begin(),
                                 getDestinationExprs().end());
}

helper_expr_range destination_exprs() {
  return helper_expr_range(getDestinationExprs().begin(),
                           getDestinationExprs().end());
}

helper_expr_const_range assignment_ops() const {
  return helper_expr_const_range(getAssignmentOps().begin(),
                                 getAssignmentOps().end());
}

helper_expr_range assignment_ops() {
  return helper_expr_range(getAssignmentOps().begin(),
                           getAssignmentOps().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPCopyprivateClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_copyprivate;
}
4451};

4453/// This represents implicit clause 'flush' for the '#pragma omp flush'
4454/// directive.
4455/// This clause does not exist by itself, it can be only as a part of 'omp
4456/// flush' directive. This clause is introduced to keep the original structure
4457/// of \a OMPExecutableDirective class and its derivatives and to use the
4458/// existing infrastructure of clauses with the list of variables.
4459///
4460/// \code
4461/// #pragma omp flush(a,b)
4462/// \endcode
4463/// In this example directive '#pragma omp flush' has implicit clause 'flush'
4464/// with the variables 'a' and 'b'.
4465class OMPFlushClause final
  : public OMPVarListClause<OMPFlushClause>,
    private llvm::TrailingObjects<OMPFlushClause, Expr *> {
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPFlushClause(SourceLocation StartLoc, SourceLocation LParenLoc,
               SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPFlushClause>(llvm::omp::OMPC_flush, StartLoc,
                                       LParenLoc, EndLoc, N) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPFlushClause(unsigned N)
    : OMPVarListClause<OMPFlushClause>(llvm::omp::OMPC_flush,
                                       SourceLocation(), SourceLocation(),
                                       SourceLocation(), N) {}

4490public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
static OMPFlushClause *Create(const ASTContext &C, SourceLocation StartLoc,
                              SourceLocation LParenLoc, SourceLocation EndLoc,
                              ArrayRef<Expr *> VL);

/// Creates an empty clause with \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPFlushClause *CreateEmpty(const ASTContext &C, unsigned N);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPFlushClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_flush;
}
4528};

4530/// This represents implicit clause 'depobj' for the '#pragma omp depobj'
4531/// directive.
4532/// This clause does not exist by itself, it can be only as a part of 'omp
4533/// depobj' directive. This clause is introduced to keep the original structure
4534/// of \a OMPExecutableDirective class and its derivatives and to use the
4535/// existing infrastructure of clauses with the list of variables.
4536///
4537/// \code
4538/// #pragma omp depobj(a) destroy
4539/// \endcode
4540/// In this example directive '#pragma omp depobj' has implicit clause 'depobj'
4541/// with the depobj 'a'.
4542class OMPDepobjClause final : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Chunk size.
Expr *Depobj = nullptr;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPDepobjClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_depobj, StartLoc, EndLoc),
      LParenLoc(LParenLoc) {}

/// Build an empty clause.
///
explicit OMPDepobjClause()
    : OMPClause(llvm::omp::OMPC_depobj, SourceLocation(), SourceLocation()) {}

void setDepobj(Expr *E) { Depobj = E; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

4571public:
/// Creates clause.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param Depobj depobj expression associated with the 'depobj' directive.
static OMPDepobjClause *Create(const ASTContext &C, SourceLocation StartLoc,
                               SourceLocation LParenLoc,
                               SourceLocation EndLoc, Expr *Depobj);

/// Creates an empty clause.
///
/// \param C AST context.
static OMPDepobjClause *CreateEmpty(const ASTContext &C);

/// Returns depobj expression associated with the clause.
Expr *getDepobj() { return Depobj; }
const Expr *getDepobj() const { return Depobj; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(&Depobj),
                     reinterpret_cast<Stmt **>(&Depobj) + 1);
}

const_child_range children() const {
  auto Children = const_cast<OMPDepobjClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_depobj;
}
4615};

4617/// This represents implicit clause 'depend' for the '#pragma omp task'
4618/// directive.
4619///
4620/// \code
4621/// #pragma omp task depend(in:a,b)
4622/// \endcode
4623/// In this example directive '#pragma omp task' with clause 'depend' with the
4624/// variables 'a' and 'b' with dependency 'in'.
4625class OMPDependClause final
  : public OMPVarListClause<OMPDependClause>,
    private llvm::TrailingObjects<OMPDependClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Dependency type (one of in, out, inout).
OpenMPDependClauseKind DepKind = OMPC_DEPEND_unknown;

/// Dependency type location.
SourceLocation DepLoc;

/// Colon location.
SourceLocation ColonLoc;

/// Number of loops, associated with the depend clause.
unsigned NumLoops = 0;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
/// \param NumLoops Number of loops that is associated with this depend
/// clause.
OMPDependClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                SourceLocation EndLoc, unsigned N, unsigned NumLoops)
    : OMPVarListClause<OMPDependClause>(llvm::omp::OMPC_depend, StartLoc,
                                        LParenLoc, EndLoc, N),
      NumLoops(NumLoops) {}

/// Build an empty clause.
///
/// \param N Number of variables.
/// \param NumLoops Number of loops that is associated with this depend
/// clause.
explicit OMPDependClause(unsigned N, unsigned NumLoops)
    : OMPVarListClause<OMPDependClause>(llvm::omp::OMPC_depend,
                                        SourceLocation(), SourceLocation(),
                                        SourceLocation(), N),
      NumLoops(NumLoops) {}

/// Set dependency kind.
void setDependencyKind(OpenMPDependClauseKind K) { DepKind = K; }

/// Set dependency kind and its location.
void setDependencyLoc(SourceLocation Loc) { DepLoc = Loc; }

/// Set colon location.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

/// Sets optional dependency modifier.
void setModifier(Expr *DepModifier);

4681public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param DepKind Dependency type.
/// \param DepLoc Location of the dependency type.
/// \param ColonLoc Colon location.
/// \param VL List of references to the variables.
/// \param NumLoops Number of loops that is associated with this depend
/// clause.
static OMPDependClause *Create(const ASTContext &C, SourceLocation StartLoc,
                               SourceLocation LParenLoc,
                               SourceLocation EndLoc, Expr *DepModifier,
                               OpenMPDependClauseKind DepKind,
                               SourceLocation DepLoc, SourceLocation ColonLoc,
                               ArrayRef<Expr *> VL, unsigned NumLoops);

/// Creates an empty clause with \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
/// \param NumLoops Number of loops that is associated with this depend
/// clause.
static OMPDependClause *CreateEmpty(const ASTContext &C, unsigned N,
                                    unsigned NumLoops);

/// Get dependency type.
OpenMPDependClauseKind getDependencyKind() const { return DepKind; }

/// Return optional depend modifier.
Expr *getModifier();
const Expr *getModifier() const {
  return const_cast<OMPDependClause *>(this)->getModifier();
}

/// Get dependency type location.
SourceLocation getDependencyLoc() const { return DepLoc; }

/// Get colon location.
SourceLocation getColonLoc() const { return ColonLoc; }

/// Get number of loops associated with the clause.
unsigned getNumLoops() const { return NumLoops; }

/// Set the loop data for the depend clauses with 'sink|source' kind of
/// dependency.
void setLoopData(unsigned NumLoop, Expr *Cnt);

/// Get the loop data.
Expr *getLoopData(unsigned NumLoop);
const Expr *getLoopData(unsigned NumLoop) const;

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPDependClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_depend;
}
4756};

4758/// This represents 'device' clause in the '#pragma omp ...'
4759/// directive.
4760///
4761/// \code
4762/// #pragma omp target device(a)
4763/// \endcode
4764/// In this example directive '#pragma omp target' has clause 'device'
4765/// with single expression 'a'.
4766class OMPDeviceClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Device clause modifier.
OpenMPDeviceClauseModifier Modifier = OMPC_DEVICE_unknown;

/// Location of the modifier.
SourceLocation ModifierLoc;

/// Device number.
Stmt *Device = nullptr;

/// Set the device number.
///
/// \param E Device number.
void setDevice(Expr *E) { Device = E; }

/// Sets modifier.
void setModifier(OpenMPDeviceClauseModifier M) { Modifier = M; }

/// Setst modifier location.
void setModifierLoc(SourceLocation Loc) { ModifierLoc = Loc; }

4792public:
/// Build 'device' clause.
///
/// \param Modifier Clause modifier.
/// \param E Expression associated with this clause.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param ModifierLoc Modifier location.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPDeviceClause(OpenMPDeviceClauseModifier Modifier, Expr *E, Stmt *HelperE,
                OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
                SourceLocation LParenLoc, SourceLocation ModifierLoc,
                SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_device, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Modifier(Modifier),
      ModifierLoc(ModifierLoc), Device(E) {
  setPreInitStmt(HelperE, CaptureRegion);
}

/// Build an empty clause.
OMPDeviceClause()
    : OMPClause(llvm::omp::OMPC_device, SourceLocation(), SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return device number.
Expr *getDevice() { return cast<Expr>(Device); }

/// Return device number.
Expr *getDevice() const { return cast<Expr>(Device); }

/// Gets modifier.
OpenMPDeviceClauseModifier getModifier() const { return Modifier; }

/// Gets modifier location.
SourceLocation getModifierLoc() const { return ModifierLoc; }

child_range children() { return child_range(&Device, &Device + 1); }

const_child_range children() const {
  return const_child_range(&Device, &Device + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_device;
}
4852};

4854/// This represents 'threads' clause in the '#pragma omp ...' directive.
4855///
4856/// \code
4857/// #pragma omp ordered threads
4858/// \endcode
4859/// In this example directive '#pragma omp ordered' has simple 'threads' clause.
4860class OMPThreadsClause : public OMPClause {
4861public:
/// Build 'threads' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPThreadsClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_threads, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPThreadsClause()
    : OMPClause(llvm::omp::OMPC_threads, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_threads;
}
4892};

4894/// This represents 'simd' clause in the '#pragma omp ...' directive.
4895///
4896/// \code
4897/// #pragma omp ordered simd
4898/// \endcode
4899/// In this example directive '#pragma omp ordered' has simple 'simd' clause.
4900class OMPSIMDClause : public OMPClause {
4901public:
/// Build 'simd' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPSIMDClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_simd, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPSIMDClause()
    : OMPClause(llvm::omp::OMPC_simd, SourceLocation(), SourceLocation()) {}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_simd;
}
4931};

4933/// Struct that defines common infrastructure to handle mappable
4934/// expressions used in OpenMP clauses.
4935class OMPClauseMappableExprCommon {
4936public:
/// Class that represents a component of a mappable expression. E.g.
/// for an expression S.a, the first component is a declaration reference
/// expression associated with 'S' and the second is a member expression
/// associated with the field declaration 'a'. If the expression is an array
/// subscript it may not have any associated declaration. In that case the
/// associated declaration is set to nullptr.
class MappableComponent {
  /// Pair of Expression and Non-contiguous pair  associated with the
  /// component.
  llvm::PointerIntPair<Expr *, 1, bool> AssociatedExpressionNonContiguousPr;

  /// Declaration associated with the declaration. If the component does
  /// not have a declaration (e.g. array subscripts or section), this is set
  /// to nullptr.
  ValueDecl *AssociatedDeclaration = nullptr;

public:
  explicit MappableComponent() = default;
  explicit MappableComponent(Expr *AssociatedExpression,
                             ValueDecl *AssociatedDeclaration,
                             bool IsNonContiguous)
      : AssociatedExpressionNonContiguousPr(AssociatedExpression,
                                            IsNonContiguous),
        AssociatedDeclaration(
            AssociatedDeclaration
                ? cast<ValueDecl>(AssociatedDeclaration->getCanonicalDecl())
                : nullptr) {}

  Expr *getAssociatedExpression() const {
    return AssociatedExpressionNonContiguousPr.getPointer();
  }

  bool isNonContiguous() const {
    return AssociatedExpressionNonContiguousPr.getInt();
  }

  ValueDecl *getAssociatedDeclaration() const {
    return AssociatedDeclaration;
  }
};

// List of components of an expression. This first one is the whole
// expression and the last one is the base expression.
using MappableExprComponentList = SmallVector<MappableComponent, 8>;
using MappableExprComponentListRef = ArrayRef<MappableComponent>;

// List of all component lists associated to the same base declaration.
// E.g. if both 'S.a' and 'S.b' are a mappable expressions, each will have
// their component list but the same base declaration 'S'.
using MappableExprComponentLists = SmallVector<MappableExprComponentList, 8>;
using MappableExprComponentListsRef = ArrayRef<MappableExprComponentList>;

4989protected:
// Return the total number of elements in a list of component lists.
static unsigned
getComponentsTotalNumber(MappableExprComponentListsRef ComponentLists);

// Return the total number of elements in a list of declarations. All
// declarations are expected to be canonical.
static unsigned
getUniqueDeclarationsTotalNumber(ArrayRef<const ValueDecl *> Declarations);
4998};

5000/// This structure contains all sizes needed for by an
5001/// OMPMappableExprListClause.
5002struct OMPMappableExprListSizeTy {
/// Number of expressions listed.
unsigned NumVars;
/// Number of unique base declarations.
unsigned NumUniqueDeclarations;
/// Number of component lists.
unsigned NumComponentLists;
/// Total number of expression components.
unsigned NumComponents;
OMPMappableExprListSizeTy() = default;
OMPMappableExprListSizeTy(unsigned NumVars, unsigned NumUniqueDeclarations,
                          unsigned NumComponentLists, unsigned NumComponents)
    : NumVars(NumVars), NumUniqueDeclarations(NumUniqueDeclarations),
      NumComponentLists(NumComponentLists), NumComponents(NumComponents) {}
5016};

5018/// This represents clauses with a list of expressions that are mappable.
5019/// Examples of these clauses are 'map' in
5020/// '#pragma omp target [enter|exit] [data]...' directives, and  'to' and 'from
5021/// in '#pragma omp target update...' directives.
5022template <class T>
5023class OMPMappableExprListClause : public OMPVarListClause<T>,
                                public OMPClauseMappableExprCommon {
friend class OMPClauseReader;

/// Number of unique declarations in this clause.
unsigned NumUniqueDeclarations;

/// Number of component lists in this clause.
unsigned NumComponentLists;

/// Total number of components in this clause.
unsigned NumComponents;

/// Whether this clause is possible to have user-defined mappers associated.
/// It should be true for map, to, and from clauses, and false for
/// use_device_ptr and is_device_ptr.
const bool SupportsMapper;

/// C++ nested name specifier for the associated user-defined mapper.
NestedNameSpecifierLoc MapperQualifierLoc;

/// The associated user-defined mapper identifier information.
DeclarationNameInfo MapperIdInfo;

5047protected:
/// Build a clause for \a NumUniqueDeclarations declarations, \a
/// NumComponentLists total component lists, and \a NumComponents total
/// components.
///
/// \param K Kind of the clause.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
/// \param SupportsMapper Indicates whether this clause is possible to have
/// user-defined mappers associated.
/// \param MapperQualifierLocPtr C++ nested name specifier for the associated
/// user-defined mapper.
/// \param MapperIdInfoPtr The identifier of associated user-defined mapper.
OMPMappableExprListClause(
    OpenMPClauseKind K, const OMPVarListLocTy &Locs,
    const OMPMappableExprListSizeTy &Sizes, bool SupportsMapper = false,
    NestedNameSpecifierLoc *MapperQualifierLocPtr = nullptr,
    DeclarationNameInfo *MapperIdInfoPtr = nullptr)
    : OMPVarListClause<T>(K, Locs.StartLoc, Locs.LParenLoc, Locs.EndLoc,
                          Sizes.NumVars),
      NumUniqueDeclarations(Sizes.NumUniqueDeclarations),
      NumComponentLists(Sizes.NumComponentLists),
      NumComponents(Sizes.NumComponents), SupportsMapper(SupportsMapper) {
  if (MapperQualifierLocPtr)
    MapperQualifierLoc = *MapperQualifierLocPtr;
  if (MapperIdInfoPtr)
    MapperIdInfo = *MapperIdInfoPtr;
}

/// Get the unique declarations that are in the trailing objects of the
/// class.
MutableArrayRef<ValueDecl *> getUniqueDeclsRef() {
  return MutableArrayRef<ValueDecl *>(
      static_cast<T *>(this)->template getTrailingObjects<ValueDecl *>(),
      NumUniqueDeclarations);
}

/// Get the unique declarations that are in the trailing objects of the
/// class.
ArrayRef<ValueDecl *> getUniqueDeclsRef() const {
  return ArrayRef<ValueDecl *>(
      static_cast<const T *>(this)
          ->template getTrailingObjects<ValueDecl *>(),
      NumUniqueDeclarations);
}

/// Set the unique declarations that are in the trailing objects of the
/// class.
void setUniqueDecls(ArrayRef<ValueDecl *> UDs) {
  assert(UDs.size() == NumUniqueDeclarations &&((void)0)
         "Unexpected amount of unique declarations.")((void)0);
  std::copy(UDs.begin(), UDs.end(), getUniqueDeclsRef().begin());
}

/// Get the number of lists per declaration that are in the trailing
/// objects of the class.
MutableArrayRef<unsigned> getDeclNumListsRef() {
  return MutableArrayRef<unsigned>(
      static_cast<T *>(this)->template getTrailingObjects<unsigned>(),
      NumUniqueDeclarations);
}

/// Get the number of lists per declaration that are in the trailing
/// objects of the class.
ArrayRef<unsigned> getDeclNumListsRef() const {
  return ArrayRef<unsigned>(
      static_cast<const T *>(this)->template getTrailingObjects<unsigned>(),
      NumUniqueDeclarations);
}

/// Set the number of lists per declaration that are in the trailing
/// objects of the class.
void setDeclNumLists(ArrayRef<unsigned> DNLs) {
  assert(DNLs.size() == NumUniqueDeclarations &&((void)0)
         "Unexpected amount of list numbers.")((void)0);
  std::copy(DNLs.begin(), DNLs.end(), getDeclNumListsRef().begin());
}

/// Get the cumulative component lists sizes that are in the trailing
/// objects of the class. They are appended after the number of lists.
MutableArrayRef<unsigned> getComponentListSizesRef() {
  return MutableArrayRef<unsigned>(
      static_cast<T *>(this)->template getTrailingObjects<unsigned>() +
          NumUniqueDeclarations,
      NumComponentLists);
}

/// Get the cumulative component lists sizes that are in the trailing
/// objects of the class. They are appended after the number of lists.
ArrayRef<unsigned> getComponentListSizesRef() const {
  return ArrayRef<unsigned>(
      static_cast<const T *>(this)->template getTrailingObjects<unsigned>() +
          NumUniqueDeclarations,
      NumComponentLists);
}

/// Set the cumulative component lists sizes that are in the trailing
/// objects of the class.
void setComponentListSizes(ArrayRef<unsigned> CLSs) {
  assert(CLSs.size() == NumComponentLists &&((void)0)
         "Unexpected amount of component lists.")((void)0);
  std::copy(CLSs.begin(), CLSs.end(), getComponentListSizesRef().begin());
}

/// Get the components that are in the trailing objects of the class.
MutableArrayRef<MappableComponent> getComponentsRef() {
  return MutableArrayRef<MappableComponent>(
      static_cast<T *>(this)
          ->template getTrailingObjects<MappableComponent>(),
      NumComponents);
}

/// Get the components that are in the trailing objects of the class.
ArrayRef<MappableComponent> getComponentsRef() const {
  return ArrayRef<MappableComponent>(
      static_cast<const T *>(this)
          ->template getTrailingObjects<MappableComponent>(),
      NumComponents);
}

/// Set the components that are in the trailing objects of the class.
/// This requires the list sizes so that it can also fill the original
/// expressions, which are the first component of each list.
void setComponents(ArrayRef<MappableComponent> Components,
                   ArrayRef<unsigned> CLSs) {
  assert(Components.size() == NumComponents &&((void)0)
         "Unexpected amount of component lists.")((void)0);
  assert(CLSs.size() == NumComponentLists &&((void)0)
         "Unexpected amount of list sizes.")((void)0);
  std::copy(Components.begin(), Components.end(), getComponentsRef().begin());
}

/// Fill the clause information from the list of declarations and
/// associated component lists.
void setClauseInfo(ArrayRef<ValueDecl *> Declarations,
                   MappableExprComponentListsRef ComponentLists) {
  // Perform some checks to make sure the data sizes are consistent with the
  // information available when the clause was created.
  assert(getUniqueDeclarationsTotalNumber(Declarations) ==((void)0)
             NumUniqueDeclarations &&((void)0)
         "Unexpected number of mappable expression info entries!")((void)0);
  assert(getComponentsTotalNumber(ComponentLists) == NumComponents &&((void)0)
         "Unexpected total number of components!")((void)0);
  assert(Declarations.size() == ComponentLists.size() &&((void)0)
         "Declaration and component lists size is not consistent!")((void)0);
  assert(Declarations.size() == NumComponentLists &&((void)0)
         "Unexpected declaration and component lists size!")((void)0);

  // Organize the components by declaration and retrieve the original
  // expression. Original expressions are always the first component of the
  // mappable component list.
  llvm::MapVector<ValueDecl *, SmallVector<MappableExprComponentListRef, 8>>
      ComponentListMap;
  {
    auto CI = ComponentLists.begin();
    for (auto DI = Declarations.begin(), DE = Declarations.end(); DI != DE;
         ++DI, ++CI) {
      assert(!CI->empty() && "Invalid component list!")((void)0);
      ComponentListMap[*DI].push_back(*CI);
    }
  }

  // Iterators of the target storage.
  auto UniqueDeclarations = getUniqueDeclsRef();
  auto UDI = UniqueDeclarations.begin();

  auto DeclNumLists = getDeclNumListsRef();
  auto DNLI = DeclNumLists.begin();

  auto ComponentListSizes = getComponentListSizesRef();
  auto CLSI = ComponentListSizes.begin();

  auto Components = getComponentsRef();
  auto CI = Components.begin();

  // Variable to compute the accumulation of the number of components.
  unsigned PrevSize = 0u;

  // Scan all the declarations and associated component lists.
  for (auto &M : ComponentListMap) {
    // The declaration.
    auto *D = M.first;
    // The component lists.
    auto CL = M.second;

    // Initialize the entry.
    *UDI = D;
    ++UDI;

    *DNLI = CL.size();
    ++DNLI;

    // Obtain the cumulative sizes and concatenate all the components in the
    // reserved storage.
    for (auto C : CL) {
      // Accumulate with the previous size.
      PrevSize += C.size();

      // Save the size.
      *CLSI = PrevSize;
      ++CLSI;

      // Append components after the current components iterator.
      CI = std::copy(C.begin(), C.end(), CI);
    }
  }
}

/// Set the nested name specifier of associated user-defined mapper.
void setMapperQualifierLoc(NestedNameSpecifierLoc NNSL) {
  MapperQualifierLoc = NNSL;
}

/// Set the name of associated user-defined mapper.
void setMapperIdInfo(DeclarationNameInfo MapperId) {
  MapperIdInfo = MapperId;
}

/// Get the user-defined mapper references that are in the trailing objects of
/// the class.
MutableArrayRef<Expr *> getUDMapperRefs() {
  assert(SupportsMapper &&((void)0)
         "Must be a clause that is possible to have user-defined mappers")((void)0);
  return llvm::makeMutableArrayRef<Expr *>(
      static_cast<T *>(this)->template getTrailingObjects<Expr *>() +
          OMPVarListClause<T>::varlist_size(),
      OMPVarListClause<T>::varlist_size());
}

/// Get the user-defined mappers references that are in the trailing objects
/// of the class.
ArrayRef<Expr *> getUDMapperRefs() const {
  assert(SupportsMapper &&((void)0)
         "Must be a clause that is possible to have user-defined mappers")((void)0);
  return llvm::makeArrayRef<Expr *>(
      static_cast<const T *>(this)->template getTrailingObjects<Expr *>() +
          OMPVarListClause<T>::varlist_size(),
      OMPVarListClause<T>::varlist_size());
}

/// Set the user-defined mappers that are in the trailing objects of the
/// class.
void setUDMapperRefs(ArrayRef<Expr *> DMDs) {
  assert(DMDs.size() == OMPVarListClause<T>::varlist_size() &&((void)0)
         "Unexpected number of user-defined mappers.")((void)0);
  assert(SupportsMapper &&((void)0)
         "Must be a clause that is possible to have user-defined mappers")((void)0);
  std::copy(DMDs.begin(), DMDs.end(), getUDMapperRefs().begin());
}

5303public:
/// Return the number of unique base declarations in this clause.
unsigned getUniqueDeclarationsNum() const { return NumUniqueDeclarations; }

/// Return the number of lists derived from the clause expressions.
unsigned getTotalComponentListNum() const { return NumComponentLists; }

/// Return the total number of components in all lists derived from the
/// clause.
unsigned getTotalComponentsNum() const { return NumComponents; }

/// Gets the nested name specifier for associated user-defined mapper.
NestedNameSpecifierLoc getMapperQualifierLoc() const {
  return MapperQualifierLoc;
}

/// Gets the name info for associated user-defined mapper.
const DeclarationNameInfo &getMapperIdInfo() const { return MapperIdInfo; }

/// Iterator that browse the components by lists. It also allows
/// browsing components of a single declaration.
class const_component_lists_iterator
    : public llvm::iterator_adaptor_base<
          const_component_lists_iterator,
          MappableExprComponentListRef::const_iterator,
          std::forward_iterator_tag, MappableComponent, ptrdiff_t,
          MappableComponent, MappableComponent> {
  // The declaration the iterator currently refers to.
  ArrayRef<ValueDecl *>::iterator DeclCur;

  // The list number associated with the current declaration.
  ArrayRef<unsigned>::iterator NumListsCur;

  // Whether this clause is possible to have user-defined mappers associated.
  const bool SupportsMapper;

  // The user-defined mapper associated with the current declaration.
  ArrayRef<Expr *>::iterator MapperCur;

  // Remaining lists for the current declaration.
  unsigned RemainingLists = 0;

  // The cumulative size of the previous list, or zero if there is no previous
  // list.
  unsigned PrevListSize = 0;

  // The cumulative sizes of the current list - it will delimit the remaining
  // range of interest.
  ArrayRef<unsigned>::const_iterator ListSizeCur;
  ArrayRef<unsigned>::const_iterator ListSizeEnd;

  // Iterator to the end of the components storage.
  MappableExprComponentListRef::const_iterator End;

public:
  /// Construct an iterator that scans all lists.
  explicit const_component_lists_iterator(
      ArrayRef<ValueDecl *> UniqueDecls, ArrayRef<unsigned> DeclsListNum,
      ArrayRef<unsigned> CumulativeListSizes,
      MappableExprComponentListRef Components, bool SupportsMapper,
      ArrayRef<Expr *> Mappers)
      : const_component_lists_iterator::iterator_adaptor_base(
            Components.begin()),
        DeclCur(UniqueDecls.begin()), NumListsCur(DeclsListNum.begin()),
        SupportsMapper(SupportsMapper),
        ListSizeCur(CumulativeListSizes.begin()),
        ListSizeEnd(CumulativeListSizes.end()), End(Components.end()) {
    assert(UniqueDecls.size() == DeclsListNum.size() &&((void)0)
           "Inconsistent number of declarations and list sizes!")((void)0);
    if (!DeclsListNum.empty())
      RemainingLists = *NumListsCur;
    if (SupportsMapper)
      MapperCur = Mappers.begin();
  }

  /// Construct an iterator that scan lists for a given declaration \a
  /// Declaration.
  explicit const_component_lists_iterator(
      const ValueDecl *Declaration, ArrayRef<ValueDecl *> UniqueDecls,
      ArrayRef<unsigned> DeclsListNum, ArrayRef<unsigned> CumulativeListSizes,
      MappableExprComponentListRef Components, bool SupportsMapper,
      ArrayRef<Expr *> Mappers)
      : const_component_lists_iterator(UniqueDecls, DeclsListNum,
                                       CumulativeListSizes, Components,
                                       SupportsMapper, Mappers) {
    // Look for the desired declaration. While we are looking for it, we
    // update the state so that we know the component where a given list
    // starts.
    for (; DeclCur != UniqueDecls.end(); ++DeclCur, ++NumListsCur) {
      if (*DeclCur == Declaration)
        break;

      assert(*NumListsCur > 0 && "No lists associated with declaration??")((void)0);

      // Skip the lists associated with the current declaration, but save the
      // last list size that was skipped.
      std::advance(ListSizeCur, *NumListsCur - 1);
      PrevListSize = *ListSizeCur;
      ++ListSizeCur;

      if (SupportsMapper)
        ++MapperCur;
    }

    // If we didn't find any declaration, advance the iterator to after the
    // last component and set remaining lists to zero.
    if (ListSizeCur == CumulativeListSizes.end()) {
      this->I = End;
      RemainingLists = 0u;
      return;
    }

    // Set the remaining lists with the total number of lists of the current
    // declaration.
    RemainingLists = *NumListsCur;

    // Adjust the list size end iterator to the end of the relevant range.
    ListSizeEnd = ListSizeCur;
    std::advance(ListSizeEnd, RemainingLists);

    // Given that the list sizes are cumulative, the index of the component
    // that start the list is the size of the previous list.
    std::advance(this->I, PrevListSize);
  }

  // Return the array with the current list. The sizes are cumulative, so the
  // array size is the difference between the current size and previous one.
  std::tuple<const ValueDecl *, MappableExprComponentListRef,
             const ValueDecl *>
  operator*() const {
    assert(ListSizeCur != ListSizeEnd && "Invalid iterator!")((void)0);
    const ValueDecl *Mapper = nullptr;
    if (SupportsMapper && *MapperCur)
      Mapper = cast<ValueDecl>(cast<DeclRefExpr>(*MapperCur)->getDecl());
    return std::make_tuple(
        *DeclCur,
        MappableExprComponentListRef(&*this->I, *ListSizeCur - PrevListSize),
        Mapper);
  }
  std::tuple<const ValueDecl *, MappableExprComponentListRef,
             const ValueDecl *>
  operator->() const {
    return **this;
  }

  // Skip the components of the current list.
  const_component_lists_iterator &operator++() {
    assert(ListSizeCur != ListSizeEnd && RemainingLists &&((void)0)
           "Invalid iterator!")((void)0);

    // If we don't have more lists just skip all the components. Otherwise,
    // advance the iterator by the number of components in the current list.
    if (std::next(ListSizeCur) == ListSizeEnd) {
      this->I = End;
      RemainingLists = 0;
    } else {
      std::advance(this->I, *ListSizeCur - PrevListSize);
      PrevListSize = *ListSizeCur;

      // We are done with a declaration, move to the next one.
      if (!(--RemainingLists)) {
        ++DeclCur;
        ++NumListsCur;
        RemainingLists = *NumListsCur;
        assert(RemainingLists && "No lists in the following declaration??")((void)0);
      }
    }

    ++ListSizeCur;
    if (SupportsMapper)
      ++MapperCur;
    return *this;
  }
};

using const_component_lists_range =
    llvm::iterator_range<const_component_lists_iterator>;

/// Iterators for all component lists.
const_component_lists_iterator component_lists_begin() const {
  return const_component_lists_iterator(
      getUniqueDeclsRef(), getDeclNumListsRef(), getComponentListSizesRef(),
      getComponentsRef(), SupportsMapper,
      SupportsMapper ? getUDMapperRefs() : llvm::None);
}
const_component_lists_iterator component_lists_end() const {
  return const_component_lists_iterator(
      ArrayRef<ValueDecl *>(), ArrayRef<unsigned>(), ArrayRef<unsigned>(),
      MappableExprComponentListRef(getComponentsRef().end(),
                                   getComponentsRef().end()),
      SupportsMapper, llvm::None);
}
const_component_lists_range component_lists() const {
  return {component_lists_begin(), component_lists_end()};
}

/// Iterators for component lists associated with the provided
/// declaration.
const_component_lists_iterator
decl_component_lists_begin(const ValueDecl *VD) const {
  return const_component_lists_iterator(
      VD, getUniqueDeclsRef(), getDeclNumListsRef(),
      getComponentListSizesRef(), getComponentsRef(), SupportsMapper,
      SupportsMapper ? getUDMapperRefs() : llvm::None);
}
const_component_lists_iterator decl_component_lists_end() const {
  return component_lists_end();
}
const_component_lists_range decl_component_lists(const ValueDecl *VD) const {
  return {decl_component_lists_begin(VD), decl_component_lists_end()};
}

/// Iterators to access all the declarations, number of lists, list sizes, and
/// components.
using const_all_decls_iterator = ArrayRef<ValueDecl *>::iterator;
using const_all_decls_range = llvm::iterator_range<const_all_decls_iterator>;

const_all_decls_range all_decls() const {
  auto A = getUniqueDeclsRef();
  return const_all_decls_range(A.begin(), A.end());
}

using const_all_num_lists_iterator = ArrayRef<unsigned>::iterator;
using const_all_num_lists_range =
    llvm::iterator_range<const_all_num_lists_iterator>;

const_all_num_lists_range all_num_lists() const {
  auto A = getDeclNumListsRef();
  return const_all_num_lists_range(A.begin(), A.end());
}

using const_all_lists_sizes_iterator = ArrayRef<unsigned>::iterator;
using const_all_lists_sizes_range =
    llvm::iterator_range<const_all_lists_sizes_iterator>;

const_all_lists_sizes_range all_lists_sizes() const {
  auto A = getComponentListSizesRef();
  return const_all_lists_sizes_range(A.begin(), A.end());
}

using const_all_components_iterator = ArrayRef<MappableComponent>::iterator;
using const_all_components_range =
    llvm::iterator_range<const_all_components_iterator>;

const_all_components_range all_components() const {
  auto A = getComponentsRef();
  return const_all_components_range(A.begin(), A.end());
}

using mapperlist_iterator = MutableArrayRef<Expr *>::iterator;
using mapperlist_const_iterator = ArrayRef<const Expr *>::iterator;
using mapperlist_range = llvm::iterator_range<mapperlist_iterator>;
using mapperlist_const_range =
    llvm::iterator_range<mapperlist_const_iterator>;

mapperlist_iterator mapperlist_begin() { return getUDMapperRefs().begin(); }
mapperlist_iterator mapperlist_end() { return getUDMapperRefs().end(); }
mapperlist_const_iterator mapperlist_begin() const {
  return getUDMapperRefs().begin();
}
mapperlist_const_iterator mapperlist_end() const {
  return getUDMapperRefs().end();
}
mapperlist_range mapperlists() {
  return mapperlist_range(mapperlist_begin(), mapperlist_end());
}
mapperlist_const_range mapperlists() const {
  return mapperlist_const_range(mapperlist_begin(), mapperlist_end());
}
5572};

5574/// This represents clause 'map' in the '#pragma omp ...'
5575/// directives.
5576///
5577/// \code
5578/// #pragma omp target map(a,b)
5579/// \endcode
5580/// In this example directive '#pragma omp target' has clause 'map'
5581/// with the variables 'a' and 'b'.
5582class OMPMapClause final : public OMPMappableExprListClause<OMPMapClause>,
                         private llvm::TrailingObjects<
                             OMPMapClause, Expr *, ValueDecl *, unsigned,
                             OMPClauseMappableExprCommon::MappableComponent> {
friend class OMPClauseReader;
friend OMPMappableExprListClause;
friend OMPVarListClause;
friend TrailingObjects;

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<Expr *>) const {
  // There are varlist_size() of expressions, and varlist_size() of
  // user-defined mappers.
  return 2 * varlist_size();
}
size_t numTrailingObjects(OverloadToken<ValueDecl *>) const {
  return getUniqueDeclarationsNum();
}
size_t numTrailingObjects(OverloadToken<unsigned>) const {
  return getUniqueDeclarationsNum() + getTotalComponentListNum();
}

5605private:
/// Map-type-modifiers for the 'map' clause.
OpenMPMapModifierKind MapTypeModifiers[NumberOfOMPMapClauseModifiers] = {
    OMPC_MAP_MODIFIER_unknown, OMPC_MAP_MODIFIER_unknown,
    OMPC_MAP_MODIFIER_unknown, OMPC_MAP_MODIFIER_unknown};

/// Location of map-type-modifiers for the 'map' clause.
SourceLocation MapTypeModifiersLoc[NumberOfOMPMapClauseModifiers];

/// Map type for the 'map' clause.
OpenMPMapClauseKind MapType = OMPC_MAP_unknown;

/// Is this an implicit map type or not.
bool MapTypeIsImplicit = false;

/// Location of the map type.
SourceLocation MapLoc;

/// Colon location.
SourceLocation ColonLoc;

/// Build a clause for \a NumVars listed expressions, \a
/// NumUniqueDeclarations declarations, \a NumComponentLists total component
/// lists, and \a NumComponents total expression components.
///
/// \param MapModifiers Map-type-modifiers.
/// \param MapModifiersLoc Locations of map-type-modifiers.
/// \param MapperQualifierLoc C++ nested name specifier for the associated
/// user-defined mapper.
/// \param MapperIdInfo The identifier of associated user-defined mapper.
/// \param MapType Map type.
/// \param MapTypeIsImplicit Map type is inferred implicitly.
/// \param MapLoc Location of the map type.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPMapClause(ArrayRef<OpenMPMapModifierKind> MapModifiers,
                      ArrayRef<SourceLocation> MapModifiersLoc,
                      NestedNameSpecifierLoc MapperQualifierLoc,
                      DeclarationNameInfo MapperIdInfo,
                      OpenMPMapClauseKind MapType, bool MapTypeIsImplicit,
                      SourceLocation MapLoc, const OMPVarListLocTy &Locs,
                      const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_map, Locs, Sizes,
                                /*SupportsMapper=*/true, &MapperQualifierLoc,
                                &MapperIdInfo),
      MapType(MapType), MapTypeIsImplicit(MapTypeIsImplicit), MapLoc(MapLoc) {
  assert(llvm::array_lengthof(MapTypeModifiers) == MapModifiers.size() &&((void)0)
         "Unexpected number of map type modifiers.")((void)0);
  llvm::copy(MapModifiers, std::begin(MapTypeModifiers));

  assert(llvm::array_lengthof(MapTypeModifiersLoc) ==((void)0)
             MapModifiersLoc.size() &&((void)0)
         "Unexpected number of map type modifier locations.")((void)0);
  llvm::copy(MapModifiersLoc, std::begin(MapTypeModifiersLoc));
}

/// Build an empty clause.
///
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPMapClause(const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_map, OMPVarListLocTy(), Sizes,
                                /*SupportsMapper=*/true) {}

/// Set map-type-modifier for the clause.
///
/// \param I index for map-type-modifier.
/// \param T map-type-modifier for the clause.
void setMapTypeModifier(unsigned I, OpenMPMapModifierKind T) {
  assert(I < NumberOfOMPMapClauseModifiers &&((void)0)
         "Unexpected index to store map type modifier, exceeds array size.")((void)0);
  MapTypeModifiers[I] = T;
}

/// Set location for the map-type-modifier.
///
/// \param I index for map-type-modifier location.
/// \param TLoc map-type-modifier location.
void setMapTypeModifierLoc(unsigned I, SourceLocation TLoc) {
  assert(I < NumberOfOMPMapClauseModifiers &&((void)0)
         "Index to store map type modifier location exceeds array size.")((void)0);
  MapTypeModifiersLoc[I] = TLoc;
}

/// Set type for the clause.
///
/// \param T Type for the clause.
void setMapType(OpenMPMapClauseKind T) { MapType = T; }

/// Set type location.
///
/// \param TLoc Type location.
void setMapLoc(SourceLocation TLoc) { MapLoc = TLoc; }

/// Set colon location.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

5711public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Vars The original expression used in the clause.
/// \param Declarations Declarations used in the clause.
/// \param ComponentLists Component lists used in the clause.
/// \param UDMapperRefs References to user-defined mappers associated with
/// expressions used in the clause.
/// \param MapModifiers Map-type-modifiers.
/// \param MapModifiersLoc Location of map-type-modifiers.
/// \param UDMQualifierLoc C++ nested name specifier for the associated
/// user-defined mapper.
/// \param MapperId The identifier of associated user-defined mapper.
/// \param Type Map type.
/// \param TypeIsImplicit Map type is inferred implicitly.
/// \param TypeLoc Location of the map type.
static OMPMapClause *
Create(const ASTContext &C, const OMPVarListLocTy &Locs,
       ArrayRef<Expr *> Vars, ArrayRef<ValueDecl *> Declarations,
       MappableExprComponentListsRef ComponentLists,
       ArrayRef<Expr *> UDMapperRefs,
       ArrayRef<OpenMPMapModifierKind> MapModifiers,
       ArrayRef<SourceLocation> MapModifiersLoc,
       NestedNameSpecifierLoc UDMQualifierLoc, DeclarationNameInfo MapperId,
       OpenMPMapClauseKind Type, bool TypeIsImplicit, SourceLocation TypeLoc);

/// Creates an empty clause with the place for \a NumVars original
/// expressions, \a NumUniqueDeclarations declarations, \NumComponentLists
/// lists, and \a NumComponents expression components.
///
/// \param C AST context.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
static OMPMapClause *CreateEmpty(const ASTContext &C,
                                 const OMPMappableExprListSizeTy &Sizes);

/// Fetches mapping kind for the clause.
OpenMPMapClauseKind getMapType() const LLVM_READONLY__attribute__((__pure__)) { return MapType; }

/// Is this an implicit map type?
/// We have to capture 'IsMapTypeImplicit' from the parser for more
/// informative error messages.  It helps distinguish map(r) from
/// map(tofrom: r), which is important to print more helpful error
/// messages for some target directives.
bool isImplicitMapType() const LLVM_READONLY__attribute__((__pure__)) { return MapTypeIsImplicit; }

/// Fetches the map-type-modifier at 'Cnt' index of array of modifiers.
///
/// \param Cnt index for map-type-modifier.
OpenMPMapModifierKind getMapTypeModifier(unsigned Cnt) const LLVM_READONLY__attribute__((__pure__)) {
  assert(Cnt < NumberOfOMPMapClauseModifiers &&((void)0)
         "Requested modifier exceeds the total number of modifiers.")((void)0);
  return MapTypeModifiers[Cnt];
}

/// Fetches the map-type-modifier location at 'Cnt' index of array of
/// modifiers' locations.
///
/// \param Cnt index for map-type-modifier location.
SourceLocation getMapTypeModifierLoc(unsigned Cnt) const LLVM_READONLY__attribute__((__pure__)) {
  assert(Cnt < NumberOfOMPMapClauseModifiers &&((void)0)
         "Requested modifier location exceeds total number of modifiers.")((void)0);
  return MapTypeModifiersLoc[Cnt];
}

/// Fetches ArrayRef of map-type-modifiers.
ArrayRef<OpenMPMapModifierKind> getMapTypeModifiers() const LLVM_READONLY__attribute__((__pure__)) {
  return llvm::makeArrayRef(MapTypeModifiers);
}

/// Fetches ArrayRef of location of map-type-modifiers.
ArrayRef<SourceLocation> getMapTypeModifiersLoc() const LLVM_READONLY__attribute__((__pure__)) {
  return llvm::makeArrayRef(MapTypeModifiersLoc);
}

/// Fetches location of clause mapping kind.
SourceLocation getMapLoc() const LLVM_READONLY__attribute__((__pure__)) { return MapLoc; }

/// Get colon location.
SourceLocation getColonLoc() const { return ColonLoc; }

child_range children() {
  return child_range(
      reinterpret_cast<Stmt **>(varlist_begin()),
      reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPMapClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  if (MapType == OMPC_MAP_to || MapType == OMPC_MAP_tofrom)
    return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                       reinterpret_cast<Stmt **>(varlist_end()));
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  auto Children = const_cast<OMPMapClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}


static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_map;
}
5825};

5827/// This represents 'num_teams' clause in the '#pragma omp ...'
5828/// directive.
5829///
5830/// \code
5831/// #pragma omp teams num_teams(n)
5832/// \endcode
5833/// In this example directive '#pragma omp teams' has clause 'num_teams'
5834/// with single expression 'n'.
5835class OMPNumTeamsClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// NumTeams number.
Stmt *NumTeams = nullptr;

/// Set the NumTeams number.
///
/// \param E NumTeams number.
void setNumTeams(Expr *E) { NumTeams = E; }

5849public:
/// Build 'num_teams' clause.
///
/// \param E Expression associated with this clause.
/// \param HelperE Helper Expression associated with this clause.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPNumTeamsClause(Expr *E, Stmt *HelperE, OpenMPDirectiveKind CaptureRegion,
                  SourceLocation StartLoc, SourceLocation LParenLoc,
                  SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_num_teams, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), NumTeams(E) {
  setPreInitStmt(HelperE, CaptureRegion);
}

/// Build an empty clause.
OMPNumTeamsClause()
    : OMPClause(llvm::omp::OMPC_num_teams, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return NumTeams number.
Expr *getNumTeams() { return cast<Expr>(NumTeams); }

/// Return NumTeams number.
Expr *getNumTeams() const { return cast<Expr>(NumTeams); }

child_range children() { return child_range(&NumTeams, &NumTeams + 1); }

const_child_range children() const {
  return const_child_range(&NumTeams, &NumTeams + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_num_teams;
}
5901};

5903/// This represents 'thread_limit' clause in the '#pragma omp ...'
5904/// directive.
5905///
5906/// \code
5907/// #pragma omp teams thread_limit(n)
5908/// \endcode
5909/// In this example directive '#pragma omp teams' has clause 'thread_limit'
5910/// with single expression 'n'.
5911class OMPThreadLimitClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// ThreadLimit number.
Stmt *ThreadLimit = nullptr;

/// Set the ThreadLimit number.
///
/// \param E ThreadLimit number.
void setThreadLimit(Expr *E) { ThreadLimit = E; }

5925public:
/// Build 'thread_limit' clause.
///
/// \param E Expression associated with this clause.
/// \param HelperE Helper Expression associated with this clause.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPThreadLimitClause(Expr *E, Stmt *HelperE,
                     OpenMPDirectiveKind CaptureRegion,
                     SourceLocation StartLoc, SourceLocation LParenLoc,
                     SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_thread_limit, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), ThreadLimit(E) {
  setPreInitStmt(HelperE, CaptureRegion);
}

/// Build an empty clause.
OMPThreadLimitClause()
    : OMPClause(llvm::omp::OMPC_thread_limit, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return ThreadLimit number.
Expr *getThreadLimit() { return cast<Expr>(ThreadLimit); }

/// Return ThreadLimit number.
Expr *getThreadLimit() const { return cast<Expr>(ThreadLimit); }

child_range children() { return child_range(&ThreadLimit, &ThreadLimit + 1); }

const_child_range children() const {
  return const_child_range(&ThreadLimit, &ThreadLimit + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_thread_limit;
}
5978};

5980/// This represents 'priority' clause in the '#pragma omp ...'
5981/// directive.
5982///
5983/// \code
5984/// #pragma omp task priority(n)
5985/// \endcode
5986/// In this example directive '#pragma omp teams' has clause 'priority' with
5987/// single expression 'n'.
5988class OMPPriorityClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Priority number.
Stmt *Priority = nullptr;

/// Set the Priority number.
///
/// \param E Priority number.
void setPriority(Expr *E) { Priority = E; }

6002public:
/// Build 'priority' clause.
///
/// \param Priority Expression associated with this clause.
/// \param HelperPriority Helper priority for the construct.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPPriorityClause(Expr *Priority, Stmt *HelperPriority,
                  OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
                  SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_priority, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Priority(Priority) {
  setPreInitStmt(HelperPriority, CaptureRegion);
}

/// Build an empty clause.
OMPPriorityClause()
    : OMPClause(llvm::omp::OMPC_priority, SourceLocation(), SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return Priority number.
Expr *getPriority() { return cast<Expr>(Priority); }

/// Return Priority number.
Expr *getPriority() const { return cast<Expr>(Priority); }

child_range children() { return child_range(&Priority, &Priority + 1); }

const_child_range children() const {
  return const_child_range(&Priority, &Priority + 1);
}

child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPPriorityClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_priority;
}
6052};

6054/// This represents 'grainsize' clause in the '#pragma omp ...'
6055/// directive.
6056///
6057/// \code
6058/// #pragma omp taskloop grainsize(4)
6059/// \endcode
6060/// In this example directive '#pragma omp taskloop' has clause 'grainsize'
6061/// with single expression '4'.
6062class OMPGrainsizeClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Safe iteration space distance.
Stmt *Grainsize = nullptr;

/// Set safelen.
void setGrainsize(Expr *Size) { Grainsize = Size; }

6074public:
/// Build 'grainsize' clause.
///
/// \param Size Expression associated with this clause.
/// \param HelperSize Helper grainsize for the construct.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPGrainsizeClause(Expr *Size, Stmt *HelperSize,
                   OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
                   SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_grainsize, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Grainsize(Size) {
  setPreInitStmt(HelperSize, CaptureRegion);
}

/// Build an empty clause.
explicit OMPGrainsizeClause()
    : OMPClause(llvm::omp::OMPC_grainsize, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return safe iteration space distance.
Expr *getGrainsize() const { return cast_or_null<Expr>(Grainsize); }

child_range children() { return child_range(&Grainsize, &Grainsize + 1); }

const_child_range children() const {
  return const_child_range(&Grainsize, &Grainsize + 1);
}

child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPGrainsizeClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_grainsize;
}
6121};

6123/// This represents 'nogroup' clause in the '#pragma omp ...' directive.
6124///
6125/// \code
6126/// #pragma omp taskloop nogroup
6127/// \endcode
6128/// In this example directive '#pragma omp taskloop' has 'nogroup' clause.
6129class OMPNogroupClause : public OMPClause {
6130public:
/// Build 'nogroup' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPNogroupClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_nogroup, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPNogroupClause()
    : OMPClause(llvm::omp::OMPC_nogroup, SourceLocation(), SourceLocation()) {
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_nogroup;
}
6161};

6163/// This represents 'num_tasks' clause in the '#pragma omp ...'
6164/// directive.
6165///
6166/// \code
6167/// #pragma omp taskloop num_tasks(4)
6168/// \endcode
6169/// In this example directive '#pragma omp taskloop' has clause 'num_tasks'
6170/// with single expression '4'.
6171class OMPNumTasksClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Safe iteration space distance.
Stmt *NumTasks = nullptr;

/// Set safelen.
void setNumTasks(Expr *Size) { NumTasks = Size; }

6183public:
/// Build 'num_tasks' clause.
///
/// \param Size Expression associated with this clause.
/// \param HelperSize Helper grainsize for the construct.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPNumTasksClause(Expr *Size, Stmt *HelperSize,
                  OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
                  SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_num_tasks, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), NumTasks(Size) {
  setPreInitStmt(HelperSize, CaptureRegion);
}

/// Build an empty clause.
explicit OMPNumTasksClause()
    : OMPClause(llvm::omp::OMPC_num_tasks, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return safe iteration space distance.
Expr *getNumTasks() const { return cast_or_null<Expr>(NumTasks); }

child_range children() { return child_range(&NumTasks, &NumTasks + 1); }

const_child_range children() const {
  return const_child_range(&NumTasks, &NumTasks + 1);
}

child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPNumTasksClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_num_tasks;
}
6230};

6232/// This represents 'hint' clause in the '#pragma omp ...' directive.
6233///
6234/// \code
6235/// #pragma omp critical (name) hint(6)
6236/// \endcode
6237/// In this example directive '#pragma omp critical' has name 'name' and clause
6238/// 'hint' with argument '6'.
6239class OMPHintClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Hint expression of the 'hint' clause.
Stmt *Hint = nullptr;

/// Set hint expression.
void setHint(Expr *H) { Hint = H; }

6251public:
/// Build 'hint' clause with expression \a Hint.
///
/// \param Hint Hint expression.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPHintClause(Expr *Hint, SourceLocation StartLoc, SourceLocation LParenLoc,
              SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_hint, StartLoc, EndLoc), LParenLoc(LParenLoc),
      Hint(Hint) {}

/// Build an empty clause.
OMPHintClause()
    : OMPClause(llvm::omp::OMPC_hint, SourceLocation(), SourceLocation()) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns number of threads.
Expr *getHint() const { return cast_or_null<Expr>(Hint); }

child_range children() { return child_range(&Hint, &Hint + 1); }

const_child_range children() const {
  return const_child_range(&Hint, &Hint + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_hint;
}
6292};

6294/// This represents 'dist_schedule' clause in the '#pragma omp ...'
6295/// directive.
6296///
6297/// \code
6298/// #pragma omp distribute dist_schedule(static, 3)
6299/// \endcode
6300/// In this example directive '#pragma omp distribute' has 'dist_schedule'
6301/// clause with arguments 'static' and '3'.
6302class OMPDistScheduleClause : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// A kind of the 'schedule' clause.
OpenMPDistScheduleClauseKind Kind = OMPC_DIST_SCHEDULE_unknown;

/// Start location of the schedule kind in source code.
SourceLocation KindLoc;

/// Location of ',' (if any).
SourceLocation CommaLoc;

/// Chunk size.
Expr *ChunkSize = nullptr;

/// Set schedule kind.
///
/// \param K Schedule kind.
void setDistScheduleKind(OpenMPDistScheduleClauseKind K) { Kind = K; }

/// Sets the location of '('.
///
/// \param Loc Location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Set schedule kind start location.
///
/// \param KLoc Schedule kind location.
void setDistScheduleKindLoc(SourceLocation KLoc) { KindLoc = KLoc; }

/// Set location of ','.
///
/// \param Loc Location of ','.
void setCommaLoc(SourceLocation Loc) { CommaLoc = Loc; }

/// Set chunk size.
///
/// \param E Chunk size.
void setChunkSize(Expr *E) { ChunkSize = E; }

6345public:
/// Build 'dist_schedule' clause with schedule kind \a Kind and chunk
/// size expression \a ChunkSize.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param KLoc Starting location of the argument.
/// \param CommaLoc Location of ','.
/// \param EndLoc Ending location of the clause.
/// \param Kind DistSchedule kind.
/// \param ChunkSize Chunk size.
/// \param HelperChunkSize Helper chunk size for combined directives.
OMPDistScheduleClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                      SourceLocation KLoc, SourceLocation CommaLoc,
                      SourceLocation EndLoc,
                      OpenMPDistScheduleClauseKind Kind, Expr *ChunkSize,
                      Stmt *HelperChunkSize)
    : OMPClause(llvm::omp::OMPC_dist_schedule, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Kind(Kind),
      KindLoc(KLoc), CommaLoc(CommaLoc), ChunkSize(ChunkSize) {
  setPreInitStmt(HelperChunkSize);
}

/// Build an empty clause.
explicit OMPDistScheduleClause()
    : OMPClause(llvm::omp::OMPC_dist_schedule, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Get kind of the clause.
OpenMPDistScheduleClauseKind getDistScheduleKind() const { return Kind; }

/// Get location of '('.
SourceLocation getLParenLoc() { return LParenLoc; }

/// Get kind location.
SourceLocation getDistScheduleKindLoc() { return KindLoc; }

/// Get location of ','.
SourceLocation getCommaLoc() { return CommaLoc; }

/// Get chunk size.
Expr *getChunkSize() { return ChunkSize; }

/// Get chunk size.
const Expr *getChunkSize() const { return ChunkSize; }

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(&ChunkSize),
                     reinterpret_cast<Stmt **>(&ChunkSize) + 1);
}

const_child_range children() const {
  auto Children = const_cast<OMPDistScheduleClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_dist_schedule;
}
6412};

6414/// This represents 'defaultmap' clause in the '#pragma omp ...' directive.
6415///
6416/// \code
6417/// #pragma omp target defaultmap(tofrom: scalar)
6418/// \endcode
6419/// In this example directive '#pragma omp target' has 'defaultmap' clause of kind
6420/// 'scalar' with modifier 'tofrom'.
6421class OMPDefaultmapClause : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Modifiers for 'defaultmap' clause.
OpenMPDefaultmapClauseModifier Modifier = OMPC_DEFAULTMAP_MODIFIER_unknown;

/// Locations of modifiers.
SourceLocation ModifierLoc;

/// A kind of the 'defaultmap' clause.
OpenMPDefaultmapClauseKind Kind = OMPC_DEFAULTMAP_unknown;

/// Start location of the defaultmap kind in source code.
SourceLocation KindLoc;

/// Set defaultmap kind.
///
/// \param K Defaultmap kind.
void setDefaultmapKind(OpenMPDefaultmapClauseKind K) { Kind = K; }

/// Set the defaultmap modifier.
///
/// \param M Defaultmap modifier.
void setDefaultmapModifier(OpenMPDefaultmapClauseModifier M) {
  Modifier = M;
}

/// Set location of the defaultmap modifier.
void setDefaultmapModifierLoc(SourceLocation Loc) {
  ModifierLoc = Loc;
}

/// Sets the location of '('.
///
/// \param Loc Location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Set defaultmap kind start location.
///
/// \param KLoc Defaultmap kind location.
void setDefaultmapKindLoc(SourceLocation KLoc) { KindLoc = KLoc; }

6466public:
/// Build 'defaultmap' clause with defaultmap kind \a Kind
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param KLoc Starting location of the argument.
/// \param EndLoc Ending location of the clause.
/// \param Kind Defaultmap kind.
/// \param M The modifier applied to 'defaultmap' clause.
/// \param MLoc Location of the modifier
OMPDefaultmapClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                    SourceLocation MLoc, SourceLocation KLoc,
                    SourceLocation EndLoc, OpenMPDefaultmapClauseKind Kind,
                    OpenMPDefaultmapClauseModifier M)
    : OMPClause(llvm::omp::OMPC_defaultmap, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Modifier(M), ModifierLoc(MLoc), Kind(Kind),
      KindLoc(KLoc) {}

/// Build an empty clause.
explicit OMPDefaultmapClause()
    : OMPClause(llvm::omp::OMPC_defaultmap, SourceLocation(),
                SourceLocation()) {}

/// Get kind of the clause.
OpenMPDefaultmapClauseKind getDefaultmapKind() const { return Kind; }

/// Get the modifier of the clause.
OpenMPDefaultmapClauseModifier getDefaultmapModifier() const {
  return Modifier;
}

/// Get location of '('.
SourceLocation getLParenLoc() { return LParenLoc; }

/// Get kind location.
SourceLocation getDefaultmapKindLoc() { return KindLoc; }

/// Get the modifier location.
SourceLocation getDefaultmapModifierLoc() const {
  return ModifierLoc;
}

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_defaultmap;
}
6526};

6528/// This represents clause 'to' in the '#pragma omp ...'
6529/// directives.
6530///
6531/// \code
6532/// #pragma omp target update to(a,b)
6533/// \endcode
6534/// In this example directive '#pragma omp target update' has clause 'to'
6535/// with the variables 'a' and 'b'.
6536class OMPToClause final : public OMPMappableExprListClause<OMPToClause>,
                        private llvm::TrailingObjects<
                            OMPToClause, Expr *, ValueDecl *, unsigned,
                            OMPClauseMappableExprCommon::MappableComponent> {
friend class OMPClauseReader;
friend OMPMappableExprListClause;
friend OMPVarListClause;
friend TrailingObjects;

/// Motion-modifiers for the 'to' clause.
OpenMPMotionModifierKind MotionModifiers[NumberOfOMPMotionModifiers] = {
    OMPC_MOTION_MODIFIER_unknown, OMPC_MOTION_MODIFIER_unknown};

/// Location of motion-modifiers for the 'to' clause.
SourceLocation MotionModifiersLoc[NumberOfOMPMotionModifiers];

/// Colon location.
SourceLocation ColonLoc;

/// Build clause with number of variables \a NumVars.
///
/// \param TheMotionModifiers Motion-modifiers.
/// \param TheMotionModifiersLoc Locations of motion-modifiers.
/// \param MapperQualifierLoc C++ nested name specifier for the associated
/// user-defined mapper.
/// \param MapperIdInfo The identifier of associated user-defined mapper.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPToClause(ArrayRef<OpenMPMotionModifierKind> TheMotionModifiers,
                     ArrayRef<SourceLocation> TheMotionModifiersLoc,
                     NestedNameSpecifierLoc MapperQualifierLoc,
                     DeclarationNameInfo MapperIdInfo,
                     const OMPVarListLocTy &Locs,
                     const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_to, Locs, Sizes,
                                /*SupportsMapper=*/true, &MapperQualifierLoc,
                                &MapperIdInfo) {
  assert(llvm::array_lengthof(MotionModifiers) == TheMotionModifiers.size() &&((void)0)
         "Unexpected number of motion modifiers.")((void)0);
  llvm::copy(TheMotionModifiers, std::begin(MotionModifiers));

  assert(llvm::array_lengthof(MotionModifiersLoc) ==((void)0)
             TheMotionModifiersLoc.size() &&((void)0)
         "Unexpected number of motion modifier locations.")((void)0);
  llvm::copy(TheMotionModifiersLoc, std::begin(MotionModifiersLoc));
}

/// Build an empty clause.
///
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPToClause(const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_to, OMPVarListLocTy(), Sizes,
                                /*SupportsMapper=*/true) {}

/// Set motion-modifier for the clause.
///
/// \param I index for motion-modifier.
/// \param T motion-modifier for the clause.
void setMotionModifier(unsigned I, OpenMPMotionModifierKind T) {
  assert(I < NumberOfOMPMotionModifiers &&((void)0)
         "Unexpected index to store motion modifier, exceeds array size.")((void)0);
  MotionModifiers[I] = T;
}

/// Set location for the motion-modifier.
///
/// \param I index for motion-modifier location.
/// \param TLoc motion-modifier location.
void setMotionModifierLoc(unsigned I, SourceLocation TLoc) {
  assert(I < NumberOfOMPMotionModifiers &&((void)0)
         "Index to store motion modifier location exceeds array size.")((void)0);
  MotionModifiersLoc[I] = TLoc;
}

/// Set colon location.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<Expr *>) const {
  // There are varlist_size() of expressions, and varlist_size() of
  // user-defined mappers.
  return 2 * varlist_size();
}
size_t numTrailingObjects(OverloadToken<ValueDecl *>) const {
  return getUniqueDeclarationsNum();
}
size_t numTrailingObjects(OverloadToken<unsigned>) const {
  return getUniqueDeclarationsNum() + getTotalComponentListNum();
}

6637public:
/// Creates clause with a list of variables \a Vars.
///
/// \param C AST context.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Vars The original expression used in the clause.
/// \param Declarations Declarations used in the clause.
/// \param ComponentLists Component lists used in the clause.
/// \param MotionModifiers Motion-modifiers.
/// \param MotionModifiersLoc Location of motion-modifiers.
/// \param UDMapperRefs References to user-defined mappers associated with
/// expressions used in the clause.
/// \param UDMQualifierLoc C++ nested name specifier for the associated
/// user-defined mapper.
/// \param MapperId The identifier of associated user-defined mapper.
static OMPToClause *Create(const ASTContext &C, const OMPVarListLocTy &Locs,
                           ArrayRef<Expr *> Vars,
                           ArrayRef<ValueDecl *> Declarations,
                           MappableExprComponentListsRef ComponentLists,
                           ArrayRef<Expr *> UDMapperRefs,
                           ArrayRef<OpenMPMotionModifierKind> MotionModifiers,
                           ArrayRef<SourceLocation> MotionModifiersLoc,
                           NestedNameSpecifierLoc UDMQualifierLoc,
                           DeclarationNameInfo MapperId);

/// Creates an empty clause with the place for \a NumVars variables.
///
/// \param C AST context.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
static OMPToClause *CreateEmpty(const ASTContext &C,
                                const OMPMappableExprListSizeTy &Sizes);

/// Fetches the motion-modifier at 'Cnt' index of array of modifiers.
///
/// \param Cnt index for motion-modifier.
OpenMPMotionModifierKind getMotionModifier(unsigned Cnt) const LLVM_READONLY__attribute__((__pure__)) {
  assert(Cnt < NumberOfOMPMotionModifiers &&((void)0)
         "Requested modifier exceeds the total number of modifiers.")((void)0);
  return MotionModifiers[Cnt];
}

/// Fetches the motion-modifier location at 'Cnt' index of array of modifiers'
/// locations.
///
/// \param Cnt index for motion-modifier location.
SourceLocation getMotionModifierLoc(unsigned Cnt) const LLVM_READONLY__attribute__((__pure__)) {
  assert(Cnt < NumberOfOMPMotionModifiers &&((void)0)
         "Requested modifier location exceeds total number of modifiers.")((void)0);
  return MotionModifiersLoc[Cnt];
}

/// Fetches ArrayRef of motion-modifiers.
ArrayRef<OpenMPMotionModifierKind> getMotionModifiers() const LLVM_READONLY__attribute__((__pure__)) {
  return llvm::makeArrayRef(MotionModifiers);
}

/// Fetches ArrayRef of location of motion-modifiers.
ArrayRef<SourceLocation> getMotionModifiersLoc() const LLVM_READONLY__attribute__((__pure__)) {
  return llvm::makeArrayRef(MotionModifiersLoc);
}

/// Get colon location.
SourceLocation getColonLoc() const { return ColonLoc; }

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPToClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_to;
}
6727};

6729/// This represents clause 'from' in the '#pragma omp ...'
6730/// directives.
6731///
6732/// \code
6733/// #pragma omp target update from(a,b)
6734/// \endcode
6735/// In this example directive '#pragma omp target update' has clause 'from'
6736/// with the variables 'a' and 'b'.
6737class OMPFromClause final
  : public OMPMappableExprListClause<OMPFromClause>,
    private llvm::TrailingObjects<
        OMPFromClause, Expr *, ValueDecl *, unsigned,
        OMPClauseMappableExprCommon::MappableComponent> {
friend class OMPClauseReader;
friend OMPMappableExprListClause;
friend OMPVarListClause;
friend TrailingObjects;

/// Motion-modifiers for the 'from' clause.
OpenMPMotionModifierKind MotionModifiers[NumberOfOMPMotionModifiers] = {
    OMPC_MOTION_MODIFIER_unknown, OMPC_MOTION_MODIFIER_unknown};

/// Location of motion-modifiers for the 'from' clause.
SourceLocation MotionModifiersLoc[NumberOfOMPMotionModifiers];

/// Colon location.
SourceLocation ColonLoc;

/// Build clause with number of variables \a NumVars.
///
/// \param TheMotionModifiers Motion-modifiers.
/// \param TheMotionModifiersLoc Locations of motion-modifiers.
/// \param MapperQualifierLoc C++ nested name specifier for the associated
/// user-defined mapper.
/// \param MapperIdInfo The identifier of associated user-defined mapper.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPFromClause(ArrayRef<OpenMPMotionModifierKind> TheMotionModifiers,
                       ArrayRef<SourceLocation> TheMotionModifiersLoc,
                       NestedNameSpecifierLoc MapperQualifierLoc,
                       DeclarationNameInfo MapperIdInfo,
                       const OMPVarListLocTy &Locs,
                       const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_from, Locs, Sizes,
                                /*SupportsMapper=*/true, &MapperQualifierLoc,
                                &MapperIdInfo) {
  assert(llvm::array_lengthof(MotionModifiers) == TheMotionModifiers.size() &&((void)0)
         "Unexpected number of motion modifiers.")((void)0);
  llvm::copy(TheMotionModifiers, std::begin(MotionModifiers));

  assert(llvm::array_lengthof(MotionModifiersLoc) ==((void)0)
             TheMotionModifiersLoc.size() &&((void)0)
         "Unexpected number of motion modifier locations.")((void)0);
  llvm::copy(TheMotionModifiersLoc, std::begin(MotionModifiersLoc));
}

/// Build an empty clause.
///
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPFromClause(const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_from, OMPVarListLocTy(),
                                Sizes, /*SupportsMapper=*/true) {}

/// Set motion-modifier for the clause.
///
/// \param I index for motion-modifier.
/// \param T motion-modifier for the clause.
void setMotionModifier(unsigned I, OpenMPMotionModifierKind T) {
  assert(I < NumberOfOMPMotionModifiers &&((void)0)
         "Unexpected index to store motion modifier, exceeds array size.")((void)0);
  MotionModifiers[I] = T;
}

/// Set location for the motion-modifier.
///
/// \param I index for motion-modifier location.
/// \param TLoc motion-modifier location.
void setMotionModifierLoc(unsigned I, SourceLocation TLoc) {
  assert(I < NumberOfOMPMotionModifiers &&((void)0)
         "Index to store motion modifier location exceeds array size.")((void)0);
  MotionModifiersLoc[I] = TLoc;
}

/// Set colon location.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<Expr *>) const {
  // There are varlist_size() of expressions, and varlist_size() of
  // user-defined mappers.
  return 2 * varlist_size();
}
size_t numTrailingObjects(OverloadToken<ValueDecl *>) const {
  return getUniqueDeclarationsNum();
}
size_t numTrailingObjects(OverloadToken<unsigned>) const {
  return getUniqueDeclarationsNum() + getTotalComponentListNum();
}

6839public:
/// Creates clause with a list of variables \a Vars.
///
/// \param C AST context.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Vars The original expression used in the clause.
/// \param Declarations Declarations used in the clause.
/// \param ComponentLists Component lists used in the clause.
/// \param MotionModifiers Motion-modifiers.
/// \param MotionModifiersLoc Location of motion-modifiers.
/// \param UDMapperRefs References to user-defined mappers associated with
/// expressions used in the clause.
/// \param UDMQualifierLoc C++ nested name specifier for the associated
/// user-defined mapper.
/// \param MapperId The identifier of associated user-defined mapper.
static OMPFromClause *
Create(const ASTContext &C, const OMPVarListLocTy &Locs,
       ArrayRef<Expr *> Vars, ArrayRef<ValueDecl *> Declarations,
       MappableExprComponentListsRef ComponentLists,
       ArrayRef<Expr *> UDMapperRefs,
       ArrayRef<OpenMPMotionModifierKind> MotionModifiers,
       ArrayRef<SourceLocation> MotionModifiersLoc,
       NestedNameSpecifierLoc UDMQualifierLoc, DeclarationNameInfo MapperId);

/// Creates an empty clause with the place for \a NumVars variables.
///
/// \param C AST context.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
static OMPFromClause *CreateEmpty(const ASTContext &C,
                                  const OMPMappableExprListSizeTy &Sizes);

/// Fetches the motion-modifier at 'Cnt' index of array of modifiers.
///
/// \param Cnt index for motion-modifier.
OpenMPMotionModifierKind getMotionModifier(unsigned Cnt) const LLVM_READONLY__attribute__((__pure__)) {
  assert(Cnt < NumberOfOMPMotionModifiers &&((void)0)
         "Requested modifier exceeds the total number of modifiers.")((void)0);
  return MotionModifiers[Cnt];
}

/// Fetches the motion-modifier location at 'Cnt' index of array of modifiers'
/// locations.
///
/// \param Cnt index for motion-modifier location.
SourceLocation getMotionModifierLoc(unsigned Cnt) const LLVM_READONLY__attribute__((__pure__)) {
  assert(Cnt < NumberOfOMPMotionModifiers &&((void)0)
         "Requested modifier location exceeds total number of modifiers.")((void)0);
  return MotionModifiersLoc[Cnt];
}

/// Fetches ArrayRef of motion-modifiers.
ArrayRef<OpenMPMotionModifierKind> getMotionModifiers() const LLVM_READONLY__attribute__((__pure__)) {
  return llvm::makeArrayRef(MotionModifiers);
}

/// Fetches ArrayRef of location of motion-modifiers.
ArrayRef<SourceLocation> getMotionModifiersLoc() const LLVM_READONLY__attribute__((__pure__)) {
  return llvm::makeArrayRef(MotionModifiersLoc);
}

/// Get colon location.
SourceLocation getColonLoc() const { return ColonLoc; }

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPFromClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_from;
}
6928};

6930/// This represents clause 'use_device_ptr' in the '#pragma omp ...'
6931/// directives.
6932///
6933/// \code
6934/// #pragma omp target data use_device_ptr(a,b)
6935/// \endcode
6936/// In this example directive '#pragma omp target data' has clause
6937/// 'use_device_ptr' with the variables 'a' and 'b'.
6938class OMPUseDevicePtrClause final
  : public OMPMappableExprListClause<OMPUseDevicePtrClause>,
    private llvm::TrailingObjects<
        OMPUseDevicePtrClause, Expr *, ValueDecl *, unsigned,
        OMPClauseMappableExprCommon::MappableComponent> {
friend class OMPClauseReader;
friend OMPMappableExprListClause;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a NumVars.
///
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPUseDevicePtrClause(const OMPVarListLocTy &Locs,
                               const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_use_device_ptr, Locs, Sizes) {
}

/// Build an empty clause.
///
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPUseDevicePtrClause(const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_use_device_ptr,
                                OMPVarListLocTy(), Sizes) {}

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<Expr *>) const {
  return 3 * varlist_size();
}
size_t numTrailingObjects(OverloadToken<ValueDecl *>) const {
  return getUniqueDeclarationsNum();
}
size_t numTrailingObjects(OverloadToken<unsigned>) const {
  return getUniqueDeclarationsNum() + getTotalComponentListNum();
}

/// Sets the list of references to private copies with initializers for new
/// private variables.
/// \param VL List of references.
void setPrivateCopies(ArrayRef<Expr *> VL);

/// Gets the list of references to private copies with initializers for new
/// private variables.
MutableArrayRef<Expr *> getPrivateCopies() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivateCopies() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

/// Sets the list of references to initializer variables for new private
/// variables.
/// \param VL List of references.
void setInits(ArrayRef<Expr *> VL);

/// Gets the list of references to initializer variables for new private
/// variables.
MutableArrayRef<Expr *> getInits() {
  return MutableArrayRef<Expr *>(getPrivateCopies().end(), varlist_size());
}
ArrayRef<const Expr *> getInits() const {
  return llvm::makeArrayRef(getPrivateCopies().end(), varlist_size());
}

7014public:
/// Creates clause with a list of variables \a Vars.
///
/// \param C AST context.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Vars The original expression used in the clause.
/// \param PrivateVars Expressions referring to private copies.
/// \param Inits Expressions referring to private copy initializers.
/// \param Declarations Declarations used in the clause.
/// \param ComponentLists Component lists used in the clause.
static OMPUseDevicePtrClause *
Create(const ASTContext &C, const OMPVarListLocTy &Locs,
       ArrayRef<Expr *> Vars, ArrayRef<Expr *> PrivateVars,
       ArrayRef<Expr *> Inits, ArrayRef<ValueDecl *> Declarations,
       MappableExprComponentListsRef ComponentLists);

/// Creates an empty clause with the place for \a NumVars variables.
///
/// \param C AST context.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
static OMPUseDevicePtrClause *
CreateEmpty(const ASTContext &C, const OMPMappableExprListSizeTy &Sizes);

using private_copies_iterator = MutableArrayRef<Expr *>::iterator;
using private_copies_const_iterator = ArrayRef<const Expr *>::iterator;
using private_copies_range = llvm::iterator_range<private_copies_iterator>;
using private_copies_const_range =
    llvm::iterator_range<private_copies_const_iterator>;

private_copies_range private_copies() {
  return private_copies_range(getPrivateCopies().begin(),
                              getPrivateCopies().end());
}

private_copies_const_range private_copies() const {
  return private_copies_const_range(getPrivateCopies().begin(),
                                    getPrivateCopies().end());
}

using inits_iterator = MutableArrayRef<Expr *>::iterator;
using inits_const_iterator = ArrayRef<const Expr *>::iterator;
using inits_range = llvm::iterator_range<inits_iterator>;
using inits_const_range = llvm::iterator_range<inits_const_iterator>;

inits_range inits() {
  return inits_range(getInits().begin(), getInits().end());
}

inits_const_range inits() const {
  return inits_const_range(getInits().begin(), getInits().end());
}

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPUseDevicePtrClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_use_device_ptr;
}
7092};

7094/// This represents clause 'use_device_addr' in the '#pragma omp ...'
7095/// directives.
7096///
7097/// \code
7098/// #pragma omp target data use_device_addr(a,b)
7099/// \endcode
7100/// In this example directive '#pragma omp target data' has clause
7101/// 'use_device_addr' with the variables 'a' and 'b'.
7102class OMPUseDeviceAddrClause final
  : public OMPMappableExprListClause<OMPUseDeviceAddrClause>,
    private llvm::TrailingObjects<
        OMPUseDeviceAddrClause, Expr *, ValueDecl *, unsigned,
        OMPClauseMappableExprCommon::MappableComponent> {
friend class OMPClauseReader;
friend OMPMappableExprListClause;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a NumVars.
///
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPUseDeviceAddrClause(const OMPVarListLocTy &Locs,
                                const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_use_device_addr, Locs,
                                Sizes) {}

/// Build an empty clause.
///
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPUseDeviceAddrClause(const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_use_device_addr,
                                OMPVarListLocTy(), Sizes) {}

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<Expr *>) const {
  return varlist_size();
}
size_t numTrailingObjects(OverloadToken<ValueDecl *>) const {
  return getUniqueDeclarationsNum();
}
size_t numTrailingObjects(OverloadToken<unsigned>) const {
  return getUniqueDeclarationsNum() + getTotalComponentListNum();
}

7150public:
/// Creates clause with a list of variables \a Vars.
///
/// \param C AST context.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Vars The original expression used in the clause.
/// \param Declarations Declarations used in the clause.
/// \param ComponentLists Component lists used in the clause.
static OMPUseDeviceAddrClause *
Create(const ASTContext &C, const OMPVarListLocTy &Locs,
       ArrayRef<Expr *> Vars, ArrayRef<ValueDecl *> Declarations,
       MappableExprComponentListsRef ComponentLists);

/// Creates an empty clause with the place for \a NumVars variables.
///
/// \param C AST context.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
static OMPUseDeviceAddrClause *
CreateEmpty(const ASTContext &C, const OMPMappableExprListSizeTy &Sizes);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPUseDeviceAddrClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_use_device_addr;
}
7196};

7198/// This represents clause 'is_device_ptr' in the '#pragma omp ...'
7199/// directives.
7200///
7201/// \code
7202/// #pragma omp target is_device_ptr(a,b)
7203/// \endcode
7204/// In this example directive '#pragma omp target' has clause
7205/// 'is_device_ptr' with the variables 'a' and 'b'.
7206class OMPIsDevicePtrClause final
  : public OMPMappableExprListClause<OMPIsDevicePtrClause>,
    private llvm::TrailingObjects<
        OMPIsDevicePtrClause, Expr *, ValueDecl *, unsigned,
        OMPClauseMappableExprCommon::MappableComponent> {
friend class OMPClauseReader;
friend OMPMappableExprListClause;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a NumVars.
///
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPIsDevicePtrClause(const OMPVarListLocTy &Locs,
                              const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_is_device_ptr, Locs, Sizes) {}

/// Build an empty clause.
///
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
explicit OMPIsDevicePtrClause(const OMPMappableExprListSizeTy &Sizes)
    : OMPMappableExprListClause(llvm::omp::OMPC_is_device_ptr,
                                OMPVarListLocTy(), Sizes) {}

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<Expr *>) const {
  return varlist_size();
}
size_t numTrailingObjects(OverloadToken<ValueDecl *>) const {
  return getUniqueDeclarationsNum();
}
size_t numTrailingObjects(OverloadToken<unsigned>) const {
  return getUniqueDeclarationsNum() + getTotalComponentListNum();
}

7253public:
/// Creates clause with a list of variables \a Vars.
///
/// \param C AST context.
/// \param Locs Locations needed to build a mappable clause. It includes 1)
/// StartLoc: starting location of the clause (the clause keyword); 2)
/// LParenLoc: location of '('; 3) EndLoc: ending location of the clause.
/// \param Vars The original expression used in the clause.
/// \param Declarations Declarations used in the clause.
/// \param ComponentLists Component lists used in the clause.
static OMPIsDevicePtrClause *
Create(const ASTContext &C, const OMPVarListLocTy &Locs,
       ArrayRef<Expr *> Vars, ArrayRef<ValueDecl *> Declarations,
       MappableExprComponentListsRef ComponentLists);

/// Creates an empty clause with the place for \a NumVars variables.
///
/// \param C AST context.
/// \param Sizes All required sizes to build a mappable clause. It includes 1)
/// NumVars: number of expressions listed in this clause; 2)
/// NumUniqueDeclarations: number of unique base declarations in this clause;
/// 3) NumComponentLists: number of component lists in this clause; and 4)
/// NumComponents: total number of expression components in the clause.
static OMPIsDevicePtrClause *
CreateEmpty(const ASTContext &C, const OMPMappableExprListSizeTy &Sizes);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPIsDevicePtrClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_is_device_ptr;
}
7299};

7301/// This represents clause 'nontemporal' in the '#pragma omp ...' directives.
7302///
7303/// \code
7304/// #pragma omp simd nontemporal(a)
7305/// \endcode
7306/// In this example directive '#pragma omp simd' has clause 'nontemporal' for
7307/// the variable 'a'.
7308class OMPNontemporalClause final
  : public OMPVarListClause<OMPNontemporalClause>,
    private llvm::TrailingObjects<OMPNontemporalClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPNontemporalClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                     SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPNontemporalClause>(llvm::omp::OMPC_nontemporal,
                                             StartLoc, LParenLoc, EndLoc, N) {
}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPNontemporalClause(unsigned N)
    : OMPVarListClause<OMPNontemporalClause>(
          llvm::omp::OMPC_nontemporal, SourceLocation(), SourceLocation(),
          SourceLocation(), N) {}

/// Get the list of privatied copies if the member expression was captured by
/// one of the privatization clauses.
MutableArrayRef<Expr *> getPrivateRefs() {
  return MutableArrayRef<Expr *>(varlist_end(), varlist_size());
}
ArrayRef<const Expr *> getPrivateRefs() const {
  return llvm::makeArrayRef(varlist_end(), varlist_size());
}

7344public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the variables.
static OMPNontemporalClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation EndLoc, ArrayRef<Expr *> VL);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPNontemporalClause *CreateEmpty(const ASTContext &C, unsigned N);

/// Sets the list of references to private copies created in private clauses.
/// \param VL List of references.
void setPrivateRefs(ArrayRef<Expr *> VL);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPNontemporalClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range private_refs() {
  return child_range(reinterpret_cast<Stmt **>(getPrivateRefs().begin()),
                     reinterpret_cast<Stmt **>(getPrivateRefs().end()));
}

const_child_range private_refs() const {
  auto Children = const_cast<OMPNontemporalClause *>(this)->private_refs();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_nontemporal;
}
7396};

7398/// This represents 'order' clause in the '#pragma omp ...' directive.
7399///
7400/// \code
7401/// #pragma omp simd order(concurrent)
7402/// \endcode
7403/// In this example directive '#pragma omp parallel' has simple 'order'
7404/// clause with kind 'concurrent'.
7405class OMPOrderClause final : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// A kind of the 'default' clause.
OpenMPOrderClauseKind Kind = OMPC_ORDER_unknown;

/// Start location of the kind in source code.
SourceLocation KindKwLoc;

/// Set kind of the clause.
///
/// \param K Argument of clause.
void setKind(OpenMPOrderClauseKind K) { Kind = K; }

/// Set argument location.
///
/// \param KLoc Argument location.
void setKindKwLoc(SourceLocation KLoc) { KindKwLoc = KLoc; }

7427public:
/// Build 'order' clause with argument \p A ('concurrent').
///
/// \param A Argument of the clause ('concurrent').
/// \param ALoc Starting location of the argument.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPOrderClause(OpenMPOrderClauseKind A, SourceLocation ALoc,
               SourceLocation StartLoc, SourceLocation LParenLoc,
               SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_order, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Kind(A), KindKwLoc(ALoc) {}

/// Build an empty clause.
OMPOrderClause()
    : OMPClause(llvm::omp::OMPC_order, SourceLocation(), SourceLocation()) {}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns kind of the clause.
OpenMPOrderClauseKind getKind() const { return Kind; }

/// Returns location of clause kind.
SourceLocation getKindKwLoc() const { return KindKwLoc; }

child_range children() {
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_order;
}
7475};

7477/// This represents the 'init' clause in '#pragma omp ...' directives.
7478///
7479/// \code
7480/// #pragma omp interop init(target:obj)
7481/// \endcode
7482class OMPInitClause final
  : public OMPVarListClause<OMPInitClause>,
    private llvm::TrailingObjects<OMPInitClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Location of interop variable.
SourceLocation VarLoc;

bool IsTarget = false;
bool IsTargetSync = false;

void setInteropVar(Expr *E) { varlist_begin()[0] = E; }

void setIsTarget(bool V) { IsTarget = V; }

void setIsTargetSync(bool V) { IsTargetSync = V; }

/// Sets the location of the interop variable.
void setVarLoc(SourceLocation Loc) { VarLoc = Loc; }

/// Build 'init' clause.
///
/// \param IsTarget Uses the 'target' interop-type.
/// \param IsTargetSync Uses the 'targetsync' interop-type.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param VarLoc Location of the interop variable.
/// \param EndLoc Ending location of the clause.
/// \param N Number of expressions.
OMPInitClause(bool IsTarget, bool IsTargetSync, SourceLocation StartLoc,
              SourceLocation LParenLoc, SourceLocation VarLoc,
              SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPInitClause>(llvm::omp::OMPC_init, StartLoc,
                                      LParenLoc, EndLoc, N),
      VarLoc(VarLoc), IsTarget(IsTarget), IsTargetSync(IsTargetSync) {}

/// Build an empty clause.
OMPInitClause(unsigned N)
    : OMPVarListClause<OMPInitClause>(llvm::omp::OMPC_init, SourceLocation(),
                                      SourceLocation(), SourceLocation(), N) {
}

7526public:
/// Creates a fully specified clause.
///
/// \param C AST context.
/// \param InteropVar The interop variable.
/// \param PrefExprs The list of preference expressions.
/// \param IsTarget Uses the 'target' interop-type.
/// \param IsTargetSync Uses the 'targetsync' interop-type.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param VarLoc Location of the interop variable.
/// \param EndLoc Ending location of the clause.
static OMPInitClause *Create(const ASTContext &C, Expr *InteropVar,
                             ArrayRef<Expr *> PrefExprs, bool IsTarget,
                             bool IsTargetSync, SourceLocation StartLoc,
                             SourceLocation LParenLoc, SourceLocation VarLoc,
                             SourceLocation EndLoc);

/// Creates an empty clause with \a N expressions.
///
/// \param C AST context.
/// \param N Number of expression items.
static OMPInitClause *CreateEmpty(const ASTContext &C, unsigned N);

/// Returns the location of the interop variable.
SourceLocation getVarLoc() const { return VarLoc; }

/// Returns the interop variable.
Expr *getInteropVar() { return varlist_begin()[0]; }
const Expr *getInteropVar() const { return varlist_begin()[0]; }

/// Returns true is interop-type 'target' is used.
bool getIsTarget() const { return IsTarget; }

/// Returns true is interop-type 'targetsync' is used.
bool getIsTargetSync() const { return IsTargetSync; }

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPInitClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

using prefs_iterator = MutableArrayRef<Expr *>::iterator;
using const_prefs_iterator = ArrayRef<const Expr *>::iterator;
using prefs_range = llvm::iterator_range<prefs_iterator>;
using const_prefs_range = llvm::iterator_range<const_prefs_iterator>;

prefs_range prefs() {
  return prefs_range(reinterpret_cast<Expr **>(std::next(varlist_begin())),
                     reinterpret_cast<Expr **>(varlist_end()));
}

const_prefs_range prefs() const {
  auto Prefs = const_cast<OMPInitClause *>(this)->prefs();
  return const_prefs_range(Prefs.begin(), Prefs.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_init;
}
7598};

7600/// This represents the 'use' clause in '#pragma omp ...' directives.
7601///
7602/// \code
7603/// #pragma omp interop use(obj)
7604/// \endcode
7605class OMPUseClause final : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Location of interop variable.
SourceLocation VarLoc;

/// The interop variable.
Stmt *InteropVar = nullptr;

/// Set the interop variable.
void setInteropVar(Expr *E) { InteropVar = E; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Sets the location of the interop variable.
void setVarLoc(SourceLocation Loc) { VarLoc = Loc; }

7626public:
/// Build 'use' clause with and interop variable expression \a InteropVar.
///
/// \param InteropVar The interop variable.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param VarLoc Location of the interop variable.
/// \param EndLoc Ending location of the clause.
OMPUseClause(Expr *InteropVar, SourceLocation StartLoc,
             SourceLocation LParenLoc, SourceLocation VarLoc,
             SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_use, StartLoc, EndLoc), LParenLoc(LParenLoc),
      VarLoc(VarLoc), InteropVar(InteropVar) {}

/// Build an empty clause.
OMPUseClause()
    : OMPClause(llvm::omp::OMPC_use, SourceLocation(), SourceLocation()) {}

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns the location of the interop variable.
SourceLocation getVarLoc() const { return VarLoc; }

/// Returns the interop variable.
Expr *getInteropVar() const { return cast<Expr>(InteropVar); }

child_range children() { return child_range(&InteropVar, &InteropVar + 1); }

const_child_range children() const {
  return const_child_range(&InteropVar, &InteropVar + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_use;
}
7669};

7671/// This represents 'destroy' clause in the '#pragma omp depobj'
7672/// directive or the '#pragma omp interop' directive..
7673///
7674/// \code
7675/// #pragma omp depobj(a) destroy
7676/// #pragma omp interop destroy(obj)
7677/// \endcode
7678/// In these examples directive '#pragma omp depobj' and '#pragma omp interop'
7679/// have a 'destroy' clause. The 'interop' directive includes an object.
7680class OMPDestroyClause final : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Location of interop variable.
SourceLocation VarLoc;

/// The interop variable.
Stmt *InteropVar = nullptr;

/// Set the interop variable.
void setInteropVar(Expr *E) { InteropVar = E; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Sets the location of the interop variable.
void setVarLoc(SourceLocation Loc) { VarLoc = Loc; }

7701public:
/// Build 'destroy' clause with an interop variable expression \a InteropVar.
///
/// \param InteropVar The interop variable.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param VarLoc Location of the interop variable.
/// \param EndLoc Ending location of the clause.
OMPDestroyClause(Expr *InteropVar, SourceLocation StartLoc,
                 SourceLocation LParenLoc, SourceLocation VarLoc,
                 SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_destroy, StartLoc, EndLoc),
      LParenLoc(LParenLoc), VarLoc(VarLoc), InteropVar(InteropVar) {}

/// Build 'destroy' clause.
///
/// \param StartLoc Starting location of the clause.
/// \param EndLoc Ending location of the clause.
OMPDestroyClause(SourceLocation StartLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_destroy, StartLoc, EndLoc) {}

/// Build an empty clause.
OMPDestroyClause()
    : OMPClause(llvm::omp::OMPC_destroy, SourceLocation(), SourceLocation()) {
}

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns the location of the interop variable.
SourceLocation getVarLoc() const { return VarLoc; }

/// Returns the interop variable.
Expr *getInteropVar() const { return cast_or_null<Expr>(InteropVar); }

child_range children() {
  if (InteropVar)
    return child_range(&InteropVar, &InteropVar + 1);
  return child_range(child_iterator(), child_iterator());
}

const_child_range children() const {
  if (InteropVar)
    return const_child_range(&InteropVar, &InteropVar + 1);
  return const_child_range(const_child_iterator(), const_child_iterator());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_destroy;
}
7758};

7760/// This represents 'novariants' clause in the '#pragma omp ...' directive.
7761///
7762/// \code
7763/// #pragma omp dispatch novariants(a > 5)
7764/// \endcode
7765/// In this example directive '#pragma omp dispatch' has simple 'novariants'
7766/// clause with condition 'a > 5'.
7767class OMPNovariantsClause final : public OMPClause,
                                public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Condition of the 'if' clause.
Stmt *Condition = nullptr;

/// Set condition.
void setCondition(Expr *Cond) { Condition = Cond; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

7783public:
/// Build 'novariants' clause with condition \a Cond.
///
/// \param Cond Condition of the clause.
/// \param HelperCond Helper condition for the construct.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPNovariantsClause(Expr *Cond, Stmt *HelperCond,
                    OpenMPDirectiveKind CaptureRegion,
                    SourceLocation StartLoc, SourceLocation LParenLoc,
                    SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_novariants, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Condition(Cond) {
  setPreInitStmt(HelperCond, CaptureRegion);
}

/// Build an empty clause.
OMPNovariantsClause()
    : OMPClause(llvm::omp::OMPC_novariants, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns condition.
Expr *getCondition() const { return cast_or_null<Expr>(Condition); }

child_range children() { return child_range(&Condition, &Condition + 1); }

const_child_range children() const {
  return const_child_range(&Condition, &Condition + 1);
}

child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPNovariantsClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_novariants;
}
7829};

7831/// This represents 'nocontext' clause in the '#pragma omp ...' directive.
7832///
7833/// \code
7834/// #pragma omp dispatch nocontext(a > 5)
7835/// \endcode
7836/// In this example directive '#pragma omp dispatch' has simple 'nocontext'
7837/// clause with condition 'a > 5'.
7838class OMPNocontextClause final : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Condition of the 'if' clause.
Stmt *Condition = nullptr;

/// Set condition.
void setCondition(Expr *Cond) { Condition = Cond; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

7853public:
/// Build 'nocontext' clause with condition \a Cond.
///
/// \param Cond Condition of the clause.
/// \param HelperCond Helper condition for the construct.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPNocontextClause(Expr *Cond, Stmt *HelperCond,
                   OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
                   SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_nocontext, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), Condition(Cond) {
  setPreInitStmt(HelperCond, CaptureRegion);
}

/// Build an empty clause.
OMPNocontextClause()
    : OMPClause(llvm::omp::OMPC_nocontext, SourceLocation(),
                SourceLocation()),
      OMPClauseWithPreInit(this) {}

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns condition.
Expr *getCondition() const { return cast_or_null<Expr>(Condition); }

child_range children() { return child_range(&Condition, &Condition + 1); }

const_child_range children() const {
  return const_child_range(&Condition, &Condition + 1);
}

child_range used_children();
const_child_range used_children() const {
  auto Children = const_cast<OMPNocontextClause *>(this)->used_children();
  return const_child_range(Children.begin(), Children.end());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_nocontext;
}
7898};

7900/// This represents 'detach' clause in the '#pragma omp task' directive.
7901///
7902/// \code
7903/// #pragma omp task detach(evt)
7904/// \endcode
7905/// In this example directive '#pragma omp detach' has simple 'detach' clause
7906/// with the variable 'evt'.
7907class OMPDetachClause final : public OMPClause {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Expression of the 'detach' clause.
Stmt *Evt = nullptr;

/// Set condition.
void setEventHandler(Expr *E) { Evt = E; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

7922public:
/// Build 'detach' clause with event-handler \a Evt.
///
/// \param Evt Event handler expression.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPDetachClause(Expr *Evt, SourceLocation StartLoc, SourceLocation LParenLoc,
                SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_detach, StartLoc, EndLoc),
      LParenLoc(LParenLoc), Evt(Evt) {}

/// Build an empty clause.
OMPDetachClause()
    : OMPClause(llvm::omp::OMPC_detach, SourceLocation(), SourceLocation()) {}

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns event-handler expression.
Expr *getEventHandler() const { return cast_or_null<Expr>(Evt); }

child_range children() { return child_range(&Evt, &Evt + 1); }

const_child_range children() const {
  return const_child_range(&Evt, &Evt + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_detach;
}
7960};

7962/// This represents clause 'inclusive' in the '#pragma omp scan' directive.
7963///
7964/// \code
7965/// #pragma omp scan inclusive(a,b)
7966/// \endcode
7967/// In this example directive '#pragma omp scan' has clause 'inclusive'
7968/// with the variables 'a' and 'b'.
7969class OMPInclusiveClause final
  : public OMPVarListClause<OMPInclusiveClause>,
    private llvm::TrailingObjects<OMPInclusiveClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPInclusiveClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                   SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPInclusiveClause>(llvm::omp::OMPC_inclusive,
                                           StartLoc, LParenLoc, EndLoc, N) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPInclusiveClause(unsigned N)
    : OMPVarListClause<OMPInclusiveClause>(llvm::omp::OMPC_inclusive,
                                           SourceLocation(), SourceLocation(),
                                           SourceLocation(), N) {}

7995public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the original variables.
static OMPInclusiveClause *Create(const ASTContext &C,
                                  SourceLocation StartLoc,
                                  SourceLocation LParenLoc,
                                  SourceLocation EndLoc, ArrayRef<Expr *> VL);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPInclusiveClause *CreateEmpty(const ASTContext &C, unsigned N);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPInclusiveClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_inclusive;
}
8034};

8036/// This represents clause 'exclusive' in the '#pragma omp scan' directive.
8037///
8038/// \code
8039/// #pragma omp scan exclusive(a,b)
8040/// \endcode
8041/// In this example directive '#pragma omp scan' has clause 'exclusive'
8042/// with the variables 'a' and 'b'.
8043class OMPExclusiveClause final
  : public OMPVarListClause<OMPExclusiveClause>,
    private llvm::TrailingObjects<OMPExclusiveClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Build clause with number of variables \a N.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of the variables in the clause.
OMPExclusiveClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                   SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPExclusiveClause>(llvm::omp::OMPC_exclusive,
                                           StartLoc, LParenLoc, EndLoc, N) {}

/// Build an empty clause.
///
/// \param N Number of variables.
explicit OMPExclusiveClause(unsigned N)
    : OMPVarListClause<OMPExclusiveClause>(llvm::omp::OMPC_exclusive,
                                           SourceLocation(), SourceLocation(),
                                           SourceLocation(), N) {}

8069public:
/// Creates clause with a list of variables \a VL.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param VL List of references to the original variables.
static OMPExclusiveClause *Create(const ASTContext &C,
                                  SourceLocation StartLoc,
                                  SourceLocation LParenLoc,
                                  SourceLocation EndLoc, ArrayRef<Expr *> VL);

/// Creates an empty clause with the place for \a N variables.
///
/// \param C AST context.
/// \param N The number of variables.
static OMPExclusiveClause *CreateEmpty(const ASTContext &C, unsigned N);

child_range children() {
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end()));
}

const_child_range children() const {
  auto Children = const_cast<OMPExclusiveClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_exclusive;
}
8108};

8110/// This represents clause 'uses_allocators' in the '#pragma omp target'-based
8111/// directives.
8112///
8113/// \code
8114/// #pragma omp target uses_allocators(default_allocator, my_allocator(traits))
8115/// \endcode
8116/// In this example directive '#pragma omp target' has clause 'uses_allocators'
8117/// with the allocators 'default_allocator' and user-defined 'my_allocator'.
8118class OMPUsesAllocatorsClause final
  : public OMPClause,
    private llvm::TrailingObjects<OMPUsesAllocatorsClause, Expr *,
                                  SourceLocation> {
8122public:
/// Data for list of allocators.
struct Data {
  /// Allocator.
  Expr *Allocator = nullptr;
  /// Allocator traits.
  Expr *AllocatorTraits = nullptr;
  /// Locations of '(' and ')' symbols.
  SourceLocation LParenLoc, RParenLoc;
};

8133private:
friend class OMPClauseReader;
friend TrailingObjects;

enum class ExprOffsets {
  Allocator,
  AllocatorTraits,
  Total,
};

enum class ParenLocsOffsets {
  LParen,
  RParen,
  Total,
};

/// Location of '('.
SourceLocation LParenLoc;
/// Total number of allocators in the clause.
unsigned NumOfAllocators = 0;

/// Build clause.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param N Number of allocators asssociated with the clause.
OMPUsesAllocatorsClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                        SourceLocation EndLoc, unsigned N)
    : OMPClause(llvm::omp::OMPC_uses_allocators, StartLoc, EndLoc),
      LParenLoc(LParenLoc), NumOfAllocators(N) {}

/// Build an empty clause.
/// \param N Number of allocators asssociated with the clause.
///
explicit OMPUsesAllocatorsClause(unsigned N)
    : OMPClause(llvm::omp::OMPC_uses_allocators, SourceLocation(),
                SourceLocation()),
      NumOfAllocators(N) {}

unsigned numTrailingObjects(OverloadToken<Expr *>) const {
  return NumOfAllocators * static_cast<int>(ExprOffsets::Total);
}

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

/// Sets the allocators data for the clause.
void setAllocatorsData(ArrayRef<OMPUsesAllocatorsClause::Data> Data);

8183public:
/// Creates clause with a list of allocators \p Data.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
/// \param Data List of allocators.
static OMPUsesAllocatorsClause *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc,
       SourceLocation EndLoc, ArrayRef<OMPUsesAllocatorsClause::Data> Data);

/// Creates an empty clause with the place for \p N allocators.
///
/// \param C AST context.
/// \param N The number of allocators.
static OMPUsesAllocatorsClause *CreateEmpty(const ASTContext &C, unsigned N);

/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Returns number of allocators associated with the clause.
unsigned getNumberOfAllocators() const { return NumOfAllocators; }

/// Returns data for the specified allocator.
OMPUsesAllocatorsClause::Data getAllocatorData(unsigned I) const;

// Iterators
child_range children() {
  Stmt **Begin = reinterpret_cast<Stmt **>(getTrailingObjects<Expr *>());
  return child_range(Begin, Begin + NumOfAllocators *
                                        static_cast<int>(ExprOffsets::Total));
}
const_child_range children() const {
  Stmt *const *Begin =
      reinterpret_cast<Stmt *const *>(getTrailingObjects<Expr *>());
  return const_child_range(
      Begin, Begin + NumOfAllocators * static_cast<int>(ExprOffsets::Total));
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_uses_allocators;
}
8233};

8235/// This represents clause 'affinity' in the '#pragma omp task'-based
8236/// directives.
8237///
8238/// \code
8239/// #pragma omp task affinity(iterator(i = 0:n) : ([3][n])a, b[:n], c[i])
8240/// \endcode
8241/// In this example directive '#pragma omp task' has clause 'affinity' with the
8242/// affinity modifer 'iterator(i = 0:n)' and locator items '([3][n])a', 'b[:n]'
8243/// and 'c[i]'.
8244class OMPAffinityClause final
  : public OMPVarListClause<OMPAffinityClause>,
    private llvm::TrailingObjects<OMPAffinityClause, Expr *> {
friend class OMPClauseReader;
friend OMPVarListClause;
friend TrailingObjects;

/// Location of ':' symbol.
SourceLocation ColonLoc;

/// Build clause.
///
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param N Number of locators asssociated with the clause.
OMPAffinityClause(SourceLocation StartLoc, SourceLocation LParenLoc,
                  SourceLocation ColonLoc, SourceLocation EndLoc, unsigned N)
    : OMPVarListClause<OMPAffinityClause>(llvm::omp::OMPC_affinity, StartLoc,
                                          LParenLoc, EndLoc, N) {}

/// Build an empty clause.
/// \param N Number of locators asssociated with the clause.
///
explicit OMPAffinityClause(unsigned N)
    : OMPVarListClause<OMPAffinityClause>(llvm::omp::OMPC_affinity,
                                          SourceLocation(), SourceLocation(),
                                          SourceLocation(), N) {}

/// Sets the affinity modifier for the clause, if any.
void setModifier(Expr *E) {
  getTrailingObjects<Expr *>()[varlist_size()] = E;
}

/// Sets the location of ':' symbol.
void setColonLoc(SourceLocation Loc) { ColonLoc = Loc; }

8282public:
/// Creates clause with a modifier a list of locator items.
///
/// \param C AST context.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param ColonLoc Location of ':'.
/// \param EndLoc Ending location of the clause.
/// \param Locators List of locator items.
static OMPAffinityClause *Create(const ASTContext &C, SourceLocation StartLoc,
                                 SourceLocation LParenLoc,
                                 SourceLocation ColonLoc,
                                 SourceLocation EndLoc, Expr *Modifier,
                                 ArrayRef<Expr *> Locators);

/// Creates an empty clause with the place for \p N locator items.
///
/// \param C AST context.
/// \param N The number of locator items.
static OMPAffinityClause *CreateEmpty(const ASTContext &C, unsigned N);

/// Gets affinity modifier.
Expr *getModifier() { return getTrailingObjects<Expr *>()[varlist_size()]; }
Expr *getModifier() const {
  return getTrailingObjects<Expr *>()[varlist_size()];
}

/// Gets the location of ':' symbol.
SourceLocation getColonLoc() const { return ColonLoc; }

// Iterators
child_range children() {
  int Offset = getModifier() ? 1 : 0;
  return child_range(reinterpret_cast<Stmt **>(varlist_begin()),
                     reinterpret_cast<Stmt **>(varlist_end() + Offset));
}

const_child_range children() const {
  auto Children = const_cast<OMPAffinityClause *>(this)->children();
  return const_child_range(Children.begin(), Children.end());
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_affinity;
}
8334};

8336/// This represents 'filter' clause in the '#pragma omp ...' directive.
8337///
8338/// \code
8339/// #pragma omp masked filter(tid)
8340/// \endcode
8341/// In this example directive '#pragma omp masked' has 'filter' clause with
8342/// thread id.
8343class OMPFilterClause final : public OMPClause, public OMPClauseWithPreInit {
friend class OMPClauseReader;

/// Location of '('.
SourceLocation LParenLoc;

/// Express of the 'filter' clause.
Stmt *ThreadID = nullptr;

/// Sets the thread identifier.
void setThreadID(Expr *TID) { ThreadID = TID; }

/// Sets the location of '('.
void setLParenLoc(SourceLocation Loc) { LParenLoc = Loc; }

8358public:
/// Build 'filter' clause with thread-id \a ThreadID.
///
/// \param ThreadID Thread identifier.
/// \param HelperE Helper expression associated with this clause.
/// \param CaptureRegion Innermost OpenMP region where expressions in this
/// clause must be captured.
/// \param StartLoc Starting location of the clause.
/// \param LParenLoc Location of '('.
/// \param EndLoc Ending location of the clause.
OMPFilterClause(Expr *ThreadID, Stmt *HelperE,
                OpenMPDirectiveKind CaptureRegion, SourceLocation StartLoc,
                SourceLocation LParenLoc, SourceLocation EndLoc)
    : OMPClause(llvm::omp::OMPC_filter, StartLoc, EndLoc),
      OMPClauseWithPreInit(this), LParenLoc(LParenLoc), ThreadID(ThreadID) {
  setPreInitStmt(HelperE, CaptureRegion);
}

/// Build an empty clause.
OMPFilterClause()
    : OMPClause(llvm::omp::OMPC_filter, SourceLocation(), SourceLocation()),
      OMPClauseWithPreInit(this) {}
/// Returns the location of '('.
SourceLocation getLParenLoc() const { return LParenLoc; }

/// Return thread identifier.
Expr *getThreadID() { return cast<Expr>(ThreadID); }

/// Return thread identifier.
Expr *getThreadID() const { return cast<Expr>(ThreadID); }

child_range children() { return child_range(&ThreadID, &ThreadID + 1); }

const_child_range children() const {
  return const_child_range(&ThreadID, &ThreadID + 1);
}

child_range used_children() {
  return child_range(child_iterator(), child_iterator());
}
const_child_range used_children() const {
  return const_child_range(const_child_iterator(), const_child_iterator());
}

static bool classof(const OMPClause *T) {
  return T->getClauseKind() == llvm::omp::OMPC_filter;
}
8405};

8407/// This class implements a simple visitor for OMPClause
8408/// subclasses.
8409template<class ImplClass, template <typename> class Ptr, typename RetTy>
8410class OMPClauseVisitorBase {
8411public:
8412#define PTR(CLASS) Ptr<CLASS>
8413#define DISPATCH(CLASS) \
return static_cast<ImplClass*>(this)->Visit##CLASS(static_cast<PTR(CLASS)>(S))

8416#define GEN_CLANG_CLAUSE_CLASS
8417#define CLAUSE_CLASS(Enum, Str, Class)                                         \
RetTy Visit##Class(PTR(Class) S) { DISPATCH(Class); }
8419#include "llvm/Frontend/OpenMP/OMP.inc"

RetTy Visit(PTR(OMPClause) S) {
  // Top switch clause: visit each OMPClause.
  switch (S->getClauseKind()) {
14
←
Called C++ object pointer is null
8424#define GEN_CLANG_CLAUSE_CLASS
8425#define CLAUSE_CLASS(Enum, Str, Class)                                         \
case llvm::omp::Clause::Enum:                                                \
  return Visit##Class(static_cast<PTR(Class)>(S));
8428#define CLAUSE_NO_CLASS(Enum, Str)                                             \
case llvm::omp::Clause::Enum:                                                \
  break;
8431#include "llvm/Frontend/OpenMP/OMP.inc"
  }
}
// Base case, ignore it. :)
RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
8436#undef PTR
8437#undef DISPATCH
8438};

8440template <typename T> using const_ptr = std::add_pointer_t<std::add_const_t<T>>;

8442template <class ImplClass, typename RetTy = void>
8443class OMPClauseVisitor
  : public OMPClauseVisitorBase<ImplClass, std::add_pointer_t, RetTy> {};
8445template<class ImplClass, typename RetTy = void>
8446class ConstOMPClauseVisitor :
    public OMPClauseVisitorBase <ImplClass, const_ptr, RetTy> {};

8449class OMPClausePrinter final : public OMPClauseVisitor<OMPClausePrinter> {
raw_ostream &OS;
const PrintingPolicy &Policy;

/// Process clauses with list of variables.
template <typename T> void VisitOMPClauseList(T *Node, char StartSym);
/// Process motion clauses.
template <typename T> void VisitOMPMotionClause(T *Node);

8458public:
OMPClausePrinter(raw_ostream &OS, const PrintingPolicy &Policy)
    : OS(OS), Policy(Policy) {}

8462#define GEN_CLANG_CLAUSE_CLASS
8463#define CLAUSE_CLASS(Enum, Str, Class) void Visit##Class(Class *S);
8464#include "llvm/Frontend/OpenMP/OMP.inc"
8465};

8467struct OMPTraitProperty {
llvm::omp::TraitProperty Kind = llvm::omp::TraitProperty::invalid;

/// The raw string as we parsed it. This is needed for the `isa` trait set
/// (which accepts anything) and (later) extensions.
StringRef RawString;
8473};
8474struct OMPTraitSelector {
Expr *ScoreOrCondition = nullptr;
llvm::omp::TraitSelector Kind = llvm::omp::TraitSelector::invalid;
llvm::SmallVector<OMPTraitProperty, 1> Properties;
8478};
8479struct OMPTraitSet {
llvm::omp::TraitSet Kind = llvm::omp::TraitSet::invalid;
llvm::SmallVector<OMPTraitSelector, 2> Selectors;
8482};

8484/// Helper data structure representing the traits in a match clause of an
8485/// `declare variant` or `metadirective`. The outer level is an ordered
8486/// collection of selector sets, each with an associated kind and an ordered
8487/// collection of selectors. A selector has a kind, an optional score/condition,
8488/// and an ordered collection of properties.
8489class OMPTraitInfo {
/// Private constructor accesible only by ASTContext.
OMPTraitInfo() {}
friend class ASTContext;

8494public:
/// Reconstruct a (partial) OMPTraitInfo object from a mangled name.
OMPTraitInfo(StringRef MangledName);

/// The outermost level of selector sets.
llvm::SmallVector<OMPTraitSet, 2> Sets;

bool anyScoreOrCondition(
    llvm::function_ref<bool(Expr *&, bool /* IsScore */)> Cond) {
  return llvm::any_of(Sets, [&](OMPTraitSet &Set) {
    return llvm::any_of(
        Set.Selectors, [&](OMPTraitSelector &Selector) {
          return Cond(Selector.ScoreOrCondition,
                      /* IsScore */ Selector.Kind !=
                          llvm::omp::TraitSelector::user_condition);
        });
  });
}

/// Create a variant match info object from this trait info object. While the
/// former is a flat representation the actual main difference is that the
/// latter uses clang::Expr to store the score/condition while the former is
/// independent of clang. Thus, expressions and conditions are evaluated in
/// this method.
void getAsVariantMatchInfo(ASTContext &ASTCtx,
                           llvm::omp::VariantMatchInfo &VMI) const;

/// Return a string representation identifying this context selector.
std::string getMangledName() const;

/// Check the extension trait \p TP is active.
bool isExtensionActive(llvm::omp::TraitProperty TP) {
  for (const OMPTraitSet &Set : Sets) {
    if (Set.Kind != llvm::omp::TraitSet::implementation)
      continue;
    for (const OMPTraitSelector &Selector : Set.Selectors) {
      if (Selector.Kind != llvm::omp::TraitSelector::implementation_extension)
        continue;
      for (const OMPTraitProperty &Property : Selector.Properties) {
        if (Property.Kind == TP)
          return true;
      }
    }
  }
  return false;
}

/// Print a human readable representation into \p OS.
void print(llvm::raw_ostream &OS, const PrintingPolicy &Policy) const;
8543};
8544llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, const OMPTraitInfo &TI);
8545llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, const OMPTraitInfo *TI);

8547/// Clang specific specialization of the OMPContext to lookup target features.
8548struct TargetOMPContext final : public llvm::omp::OMPContext {

TargetOMPContext(ASTContext &ASTCtx,
                 std::function<void(StringRef)> &&DiagUnknownTrait,
                 const FunctionDecl *CurrentFunctionDecl);
virtual ~TargetOMPContext() = default;

/// See llvm::omp::OMPContext::matchesISATrait
bool matchesISATrait(StringRef RawString) const override;

8558private:
std::function<bool(StringRef)> FeatureValidityCheck;
std::function<void(StringRef)> DiagUnknownTrait;
llvm::StringMap<bool> FeatureMap;
8562};

8564/// Contains data for OpenMP directives: clauses, children
8565/// expressions/statements (helpers for codegen) and associated statement, if
8566/// any.
8567class OMPChildren final
  : private llvm::TrailingObjects<OMPChildren, OMPClause *, Stmt *> {
friend TrailingObjects;
friend class OMPClauseReader;
friend class OMPExecutableDirective;
template <typename T> friend class OMPDeclarativeDirective;

/// Numbers of clauses.
unsigned NumClauses = 0;
/// Number of child expressions/stmts.
unsigned NumChildren = 0;
/// true if the directive has associated statement.
bool HasAssociatedStmt = false;

/// Define the sizes of each trailing object array except the last one. This
/// is required for TrailingObjects to work properly.
size_t numTrailingObjects(OverloadToken<OMPClause *>) const {
  return NumClauses;
}

OMPChildren() = delete;

OMPChildren(unsigned NumClauses, unsigned NumChildren, bool HasAssociatedStmt)
    : NumClauses(NumClauses), NumChildren(NumChildren),
      HasAssociatedStmt(HasAssociatedStmt) {}

static size_t size(unsigned NumClauses, bool HasAssociatedStmt,
                   unsigned NumChildren);

static OMPChildren *Create(void *Mem, ArrayRef<OMPClause *> Clauses);
static OMPChildren *Create(void *Mem, ArrayRef<OMPClause *> Clauses, Stmt *S,
                           unsigned NumChildren = 0);
static OMPChildren *CreateEmpty(void *Mem, unsigned NumClauses,
                                bool HasAssociatedStmt = false,
                                unsigned NumChildren = 0);

8603public:
unsigned getNumClauses() const { return NumClauses; }
unsigned getNumChildren() const { return NumChildren; }
bool hasAssociatedStmt() const { return HasAssociatedStmt; }

/// Set associated statement.
void setAssociatedStmt(Stmt *S) {
  getTrailingObjects<Stmt *>()[NumChildren] = S;
}

void setChildren(ArrayRef<Stmt *> Children);

/// Sets the list of variables for this clause.
///
/// \param Clauses The list of clauses for the directive.
///
void setClauses(ArrayRef<OMPClause *> Clauses);

/// Returns statement associated with the directive.
const Stmt *getAssociatedStmt() const {
  return const_cast<OMPChildren *>(this)->getAssociatedStmt();
}
Stmt *getAssociatedStmt() {
  assert(HasAssociatedStmt &&((void)0)
         "Expected directive with the associated statement.")((void)0);
  return getTrailingObjects<Stmt *>()[NumChildren];
}

/// Get the clauses storage.
MutableArrayRef<OMPClause *> getClauses() {
  return llvm::makeMutableArrayRef(getTrailingObjects<OMPClause *>(),
                                   NumClauses);
}
ArrayRef<OMPClause *> getClauses() const {
  return const_cast<OMPChildren *>(this)->getClauses();
}

/// Returns the captured statement associated with the
/// component region within the (combined) directive.
///
/// \param RegionKind Component region kind.
const CapturedStmt *
getCapturedStmt(OpenMPDirectiveKind RegionKind,
                ArrayRef<OpenMPDirectiveKind> CaptureRegions) const {
  assert(llvm::any_of(((void)0)
             CaptureRegions,((void)0)
             [=](const OpenMPDirectiveKind K) { return K == RegionKind; }) &&((void)0)
         "RegionKind not found in OpenMP CaptureRegions.")((void)0);
  auto *CS = cast<CapturedStmt>(getAssociatedStmt());
  for (auto ThisCaptureRegion : CaptureRegions) {
    if (ThisCaptureRegion == RegionKind)
      return CS;
    CS = cast<CapturedStmt>(CS->getCapturedStmt());
  }
  llvm_unreachable("Incorrect RegionKind specified for directive.")__builtin_unreachable();
}

/// Get innermost captured statement for the construct.
CapturedStmt *
getInnermostCapturedStmt(ArrayRef<OpenMPDirectiveKind> CaptureRegions) {
  assert(hasAssociatedStmt() && "Must have associated captured statement.")((void)0);
  assert(!CaptureRegions.empty() &&((void)0)
         "At least one captured statement must be provided.")((void)0);
  auto *CS = cast<CapturedStmt>(getAssociatedStmt());
  for (unsigned Level = CaptureRegions.size(); Level > 1; --Level)
    CS = cast<CapturedStmt>(CS->getCapturedStmt());
  return CS;
}

const CapturedStmt *
getInnermostCapturedStmt(ArrayRef<OpenMPDirectiveKind> CaptureRegions) const {
  return const_cast<OMPChildren *>(this)->getInnermostCapturedStmt(
      CaptureRegions);
}

MutableArrayRef<Stmt *> getChildren();
ArrayRef<Stmt *> getChildren() const {
  return const_cast<OMPChildren *>(this)->getChildren();
}

Stmt *getRawStmt() {
  assert(HasAssociatedStmt &&((void)0)
         "Expected directive with the associated statement.")((void)0);
  if (auto *CS = dyn_cast<CapturedStmt>(getAssociatedStmt())) {
    Stmt *S = nullptr;
    do {
      S = CS->getCapturedStmt();
      CS = dyn_cast<CapturedStmt>(S);
    } while (CS);
    return S;
  }
  return getAssociatedStmt();
}
const Stmt *getRawStmt() const {
  return const_cast<OMPChildren *>(this)->getRawStmt();
}

Stmt::child_range getAssociatedStmtAsRange() {
  if (!HasAssociatedStmt)
    return Stmt::child_range(Stmt::child_iterator(), Stmt::child_iterator());
  return Stmt::child_range(&getTrailingObjects<Stmt *>()[NumChildren],
                           &getTrailingObjects<Stmt *>()[NumChildren + 1]);
}
8706};

8708} // namespace clang

8710#endif // LLVM_CLANG_AST_OPENMPCLAUSE_H