/usr/src/gnu/usr.bin/clang/libLLVMTableGen/../../../llvm/llvm/lib/TableGen/Record.cpp

Bug Summary

File:	src/gnu/usr.bin/clang/libLLVMTableGen/../../../llvm/llvm/lib/TableGen/Record.cpp
Warning:	line 817, column 25 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 Record.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/libLLVMTableGen/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/gnu/usr.bin/clang/libLLVMTableGen/../../../llvm/llvm/include/llvm/TableGen -I /usr/src/gnu/usr.bin/clang/libLLVMTableGen/../../../llvm/llvm/include -I /usr/src/gnu/usr.bin/clang/libLLVMTableGen/../include -I /usr/src/gnu/usr.bin/clang/libLLVMTableGen/obj -I /usr/src/gnu/usr.bin/clang/libLLVMTableGen/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/libLLVMTableGen/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/libLLVMTableGen/../../../llvm/llvm/lib/TableGen/Record.cpp
1//===- Record.cpp - Record implementation ---------------------------------===//
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// Implement the tablegen record classes.
10//
11//===----------------------------------------------------------------------===//

13#include "llvm/ADT/ArrayRef.h"
14#include "llvm/ADT/DenseMap.h"
15#include "llvm/ADT/FoldingSet.h"
16#include "llvm/ADT/SmallString.h"
17#include "llvm/ADT/SmallVector.h"
18#include "llvm/ADT/Statistic.h"
19#include "llvm/ADT/StringExtras.h"
20#include "llvm/ADT/StringMap.h"
21#include "llvm/ADT/StringRef.h"
22#include "llvm/ADT/StringSet.h"
23#include "llvm/Config/llvm-config.h"
24#include "llvm/Support/Allocator.h"
25#include "llvm/Support/Casting.h"
26#include "llvm/Support/Compiler.h"
27#include "llvm/Support/ErrorHandling.h"
28#include "llvm/Support/SMLoc.h"
29#include "llvm/Support/raw_ostream.h"
30#include "llvm/TableGen/Error.h"
31#include "llvm/TableGen/Record.h"
32#include <cassert>
33#include <cstdint>
34#include <memory>
35#include <map>
36#include <string>
37#include <utility>
38#include <vector>

40using namespace llvm;

42#define DEBUG_TYPE"tblgen-records" "tblgen-records"

44static BumpPtrAllocator Allocator;

46//===----------------------------------------------------------------------===//
47//    Type implementations
48//===----------------------------------------------------------------------===//

50BitRecTy BitRecTy::Shared;
51IntRecTy IntRecTy::Shared;
52StringRecTy StringRecTy::Shared;
53DagRecTy DagRecTy::Shared;

55#if !defined(NDEBUG1) || defined(LLVM_ENABLE_DUMP)
56LLVM_DUMP_METHOD__attribute__((noinline)) void RecTy::dump() const { print(errs()); }
57#endif

59ListRecTy *RecTy::getListTy() {
if (!ListTy)
  ListTy = new(Allocator) ListRecTy(this);
return ListTy;
63}

65bool RecTy::typeIsConvertibleTo(const RecTy *RHS) const {
assert(RHS && "NULL pointer")((void)0);
return Kind == RHS->getRecTyKind();
68}

70bool RecTy::typeIsA(const RecTy *RHS) const { return this == RHS; }

72bool BitRecTy::typeIsConvertibleTo(const RecTy *RHS) const{
if (RecTy::typeIsConvertibleTo(RHS) || RHS->getRecTyKind() == IntRecTyKind)
  return true;
if (const BitsRecTy *BitsTy = dyn_cast<BitsRecTy>(RHS))
  return BitsTy->getNumBits() == 1;
return false;
78}

80BitsRecTy *BitsRecTy::get(unsigned Sz) {
static std::vector<BitsRecTy*> Shared;
if (Sz >= Shared.size())
  Shared.resize(Sz + 1);
BitsRecTy *&Ty = Shared[Sz];
if (!Ty)
  Ty = new(Allocator) BitsRecTy(Sz);
return Ty;
88}

90std::string BitsRecTy::getAsString() const {
return "bits<" + utostr(Size) + ">";
92}

94bool BitsRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
if (RecTy::typeIsConvertibleTo(RHS)) //argument and the sender are same type
  return cast<BitsRecTy>(RHS)->Size == Size;
RecTyKind kind = RHS->getRecTyKind();
return (kind == BitRecTyKind && Size == 1) || (kind == IntRecTyKind);
99}

101bool BitsRecTy::typeIsA(const RecTy *RHS) const {
if (const BitsRecTy *RHSb = dyn_cast<BitsRecTy>(RHS))
  return RHSb->Size == Size;
return false;
105}

107bool IntRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
RecTyKind kind = RHS->getRecTyKind();
return kind==BitRecTyKind || kind==BitsRecTyKind || kind==IntRecTyKind;
110}

112std::string StringRecTy::getAsString() const {
return "string";
114}

116bool StringRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
RecTyKind Kind = RHS->getRecTyKind();
return Kind == StringRecTyKind;
119}

121std::string ListRecTy::getAsString() const {
return "list<" + ElementTy->getAsString() + ">";
123}

125bool ListRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
if (const auto *ListTy = dyn_cast<ListRecTy>(RHS))
  return ElementTy->typeIsConvertibleTo(ListTy->getElementType());
return false;
129}

131bool ListRecTy::typeIsA(const RecTy *RHS) const {
if (const ListRecTy *RHSl = dyn_cast<ListRecTy>(RHS))
  return getElementType()->typeIsA(RHSl->getElementType());
return false;
135}

137std::string DagRecTy::getAsString() const {
return "dag";
139}

141static void ProfileRecordRecTy(FoldingSetNodeID &ID,
                             ArrayRef<Record *> Classes) {
ID.AddInteger(Classes.size());
for (Record *R : Classes)
  ID.AddPointer(R);
146}

148RecordRecTy *RecordRecTy::get(ArrayRef<Record *> UnsortedClasses) {
if (UnsortedClasses.empty()) {
  static RecordRecTy AnyRecord(0);
  return &AnyRecord;
}

FoldingSet<RecordRecTy> &ThePool =
    UnsortedClasses[0]->getRecords().RecordTypePool;

SmallVector<Record *, 4> Classes(UnsortedClasses.begin(),
                                 UnsortedClasses.end());
llvm::sort(Classes, [](Record *LHS, Record *RHS) {
  return LHS->getNameInitAsString() < RHS->getNameInitAsString();
});

FoldingSetNodeID ID;
ProfileRecordRecTy(ID, Classes);

void *IP = nullptr;
if (RecordRecTy *Ty = ThePool.FindNodeOrInsertPos(ID, IP))
  return Ty;

170#ifndef NDEBUG1
// Check for redundancy.
for (unsigned i = 0; i < Classes.size(); ++i) {
  for (unsigned j = 0; j < Classes.size(); ++j) {
    assert(i == j || !Classes[i]->isSubClassOf(Classes[j]))((void)0);
  }
  assert(&Classes[0]->getRecords() == &Classes[i]->getRecords())((void)0);
}
178#endif

void *Mem = Allocator.Allocate(totalSizeToAlloc<Record *>(Classes.size()),
                               alignof(RecordRecTy));
RecordRecTy *Ty = new(Mem) RecordRecTy(Classes.size());
std::uninitialized_copy(Classes.begin(), Classes.end(),
                        Ty->getTrailingObjects<Record *>());
ThePool.InsertNode(Ty, IP);
return Ty;
187}

189void RecordRecTy::Profile(FoldingSetNodeID &ID) const {
ProfileRecordRecTy(ID, getClasses());
191}

193std::string RecordRecTy::getAsString() const {
if (NumClasses == 1)
  return getClasses()[0]->getNameInitAsString();

std::string Str = "{";
bool First = true;
for (Record *R : getClasses()) {
  if (!First)
    Str += ", ";
  First = false;
  Str += R->getNameInitAsString();
}
Str += "}";
return Str;
207}

209bool RecordRecTy::isSubClassOf(Record *Class) const {
return llvm::any_of(getClasses(), [Class](Record *MySuperClass) {
                                    return MySuperClass == Class ||
                                           MySuperClass->isSubClassOf(Class);
                                  });
214}

216bool RecordRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
if (this == RHS)
  return true;

const RecordRecTy *RTy = dyn_cast<RecordRecTy>(RHS);
if (!RTy)
  return false;

return llvm::all_of(RTy->getClasses(), [this](Record *TargetClass) {
                                         return isSubClassOf(TargetClass);
                                       });
227}

229bool RecordRecTy::typeIsA(const RecTy *RHS) const {
return typeIsConvertibleTo(RHS);
231}

233static RecordRecTy *resolveRecordTypes(RecordRecTy *T1, RecordRecTy *T2) {
SmallVector<Record *, 4> CommonSuperClasses;
SmallVector<Record *, 4> Stack(T1->classes_begin(), T1->classes_end());

while (!Stack.empty()) {
  Record *R = Stack.pop_back_val();

  if (T2->isSubClassOf(R)) {
    CommonSuperClasses.push_back(R);
  } else {
    R->getDirectSuperClasses(Stack);
  }
}

return RecordRecTy::get(CommonSuperClasses);
248}

250RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) {
if (T1 == T2)
  return T1;

if (RecordRecTy *RecTy1 = dyn_cast<RecordRecTy>(T1)) {
  if (RecordRecTy *RecTy2 = dyn_cast<RecordRecTy>(T2))
    return resolveRecordTypes(RecTy1, RecTy2);
}

if (T1->typeIsConvertibleTo(T2))
  return T2;
if (T2->typeIsConvertibleTo(T1))
  return T1;

if (ListRecTy *ListTy1 = dyn_cast<ListRecTy>(T1)) {
  if (ListRecTy *ListTy2 = dyn_cast<ListRecTy>(T2)) {
    RecTy* NewType = resolveTypes(ListTy1->getElementType(),
                                  ListTy2->getElementType());
    if (NewType)
      return NewType->getListTy();
  }
}

return nullptr;
274}

276//===----------------------------------------------------------------------===//
277//    Initializer implementations
278//===----------------------------------------------------------------------===//

280void Init::anchor() {}

282#if !defined(NDEBUG1) || defined(LLVM_ENABLE_DUMP)
283LLVM_DUMP_METHOD__attribute__((noinline)) void Init::dump() const { return print(errs()); }
284#endif

286UnsetInit *UnsetInit::get() {
static UnsetInit TheInit;
return &TheInit;
289}

291Init *UnsetInit::getCastTo(RecTy *Ty) const {
return const_cast<UnsetInit *>(this);
293}

295Init *UnsetInit::convertInitializerTo(RecTy *Ty) const {
return const_cast<UnsetInit *>(this);
297}

299BitInit *BitInit::get(bool V) {
static BitInit True(true);
static BitInit False(false);

return V ? &True : &False;
304}

306Init *BitInit::convertInitializerTo(RecTy *Ty) const {
if (isa<BitRecTy>(Ty))
  return const_cast<BitInit *>(this);

if (isa<IntRecTy>(Ty))
  return IntInit::get(getValue());

if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) {
  // Can only convert single bit.
  if (BRT->getNumBits() == 1)
    return BitsInit::get(const_cast<BitInit *>(this));
}

return nullptr;
320}

322static void
323ProfileBitsInit(FoldingSetNodeID &ID, ArrayRef<Init *> Range) {
ID.AddInteger(Range.size());

for (Init *I : Range)
  ID.AddPointer(I);
328}

330BitsInit *BitsInit::get(ArrayRef<Init *> Range) {
static FoldingSet<BitsInit> ThePool;

FoldingSetNodeID ID;
ProfileBitsInit(ID, Range);

void *IP = nullptr;
if (BitsInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Range.size()),
                               alignof(BitsInit));
BitsInit *I = new(Mem) BitsInit(Range.size());
std::uninitialized_copy(Range.begin(), Range.end(),
                        I->getTrailingObjects<Init *>());
ThePool.InsertNode(I, IP);
return I;
347}

349void BitsInit::Profile(FoldingSetNodeID &ID) const {
ProfileBitsInit(ID, makeArrayRef(getTrailingObjects<Init *>(), NumBits));
351}

353Init *BitsInit::convertInitializerTo(RecTy *Ty) const {
if (isa<BitRecTy>(Ty)) {
  if (getNumBits() != 1) return nullptr; // Only accept if just one bit!
  return getBit(0);
}

if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) {
  // If the number of bits is right, return it.  Otherwise we need to expand
  // or truncate.
  if (getNumBits() != BRT->getNumBits()) return nullptr;
  return const_cast<BitsInit *>(this);
}

if (isa<IntRecTy>(Ty)) {
  int64_t Result = 0;
  for (unsigned i = 0, e = getNumBits(); i != e; ++i)
    if (auto *Bit = dyn_cast<BitInit>(getBit(i)))
      Result |= static_cast<int64_t>(Bit->getValue()) << i;
    else
      return nullptr;
  return IntInit::get(Result);
}

return nullptr;
377}

379Init *
380BitsInit::convertInitializerBitRange(ArrayRef<unsigned> Bits) const {
SmallVector<Init *, 16> NewBits(Bits.size());

for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
  if (Bits[i] >= getNumBits())
    return nullptr;
  NewBits[i] = getBit(Bits[i]);
}
return BitsInit::get(NewBits);
389}

391bool BitsInit::isConcrete() const {
for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
  if (!getBit(i)->isConcrete())
    return false;
}
return true;
397}

399std::string BitsInit::getAsString() const {
std::string Result = "{ ";
for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
  if (i) Result += ", ";
  if (Init *Bit = getBit(e-i-1))
    Result += Bit->getAsString();
  else
    Result += "*";
}
return Result + " }";
409}

411// resolveReferences - If there are any field references that refer to fields
412// that have been filled in, we can propagate the values now.
413Init *BitsInit::resolveReferences(Resolver &R) const {
bool Changed = false;
SmallVector<Init *, 16> NewBits(getNumBits());

Init *CachedBitVarRef = nullptr;
Init *CachedBitVarResolved = nullptr;

for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
  Init *CurBit = getBit(i);
  Init *NewBit = CurBit;

  if (VarBitInit *CurBitVar = dyn_cast<VarBitInit>(CurBit)) {
    if (CurBitVar->getBitVar() != CachedBitVarRef) {
      CachedBitVarRef = CurBitVar->getBitVar();
      CachedBitVarResolved = CachedBitVarRef->resolveReferences(R);
    }
    assert(CachedBitVarResolved && "Unresolved bitvar reference")((void)0);
    NewBit = CachedBitVarResolved->getBit(CurBitVar->getBitNum());
  } else {
    // getBit(0) implicitly converts int and bits<1> values to bit.
    NewBit = CurBit->resolveReferences(R)->getBit(0);
  }

  if (isa<UnsetInit>(NewBit) && R.keepUnsetBits())
    NewBit = CurBit;
  NewBits[i] = NewBit;
  Changed |= CurBit != NewBit;
}

if (Changed)
  return BitsInit::get(NewBits);

return const_cast<BitsInit *>(this);
446}

448IntInit *IntInit::get(int64_t V) {
static std::map<int64_t, IntInit*> ThePool;

IntInit *&I = ThePool[V];
if (!I) I = new(Allocator) IntInit(V);
return I;
454}

456std::string IntInit::getAsString() const {
return itostr(Value);
458}

460static bool canFitInBitfield(int64_t Value, unsigned NumBits) {
// For example, with NumBits == 4, we permit Values from [-7 .. 15].
return (NumBits >= sizeof(Value) * 8) ||
       (Value >> NumBits == 0) || (Value >> (NumBits-1) == -1);
464}

466Init *IntInit::convertInitializerTo(RecTy *Ty) const {
if (isa<IntRecTy>(Ty))
  return const_cast<IntInit *>(this);

if (isa<BitRecTy>(Ty)) {
  int64_t Val = getValue();
  if (Val != 0 && Val != 1) return nullptr;  // Only accept 0 or 1 for a bit!
  return BitInit::get(Val != 0);
}

if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) {
  int64_t Value = getValue();
  // Make sure this bitfield is large enough to hold the integer value.
  if (!canFitInBitfield(Value, BRT->getNumBits()))
    return nullptr;

  SmallVector<Init *, 16> NewBits(BRT->getNumBits());
  for (unsigned i = 0; i != BRT->getNumBits(); ++i)
    NewBits[i] = BitInit::get(Value & ((i < 64) ? (1LL << i) : 0));

  return BitsInit::get(NewBits);
}

return nullptr;
490}

492Init *
493IntInit::convertInitializerBitRange(ArrayRef<unsigned> Bits) const {
SmallVector<Init *, 16> NewBits(Bits.size());

for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
  if (Bits[i] >= 64)
    return nullptr;

  NewBits[i] = BitInit::get(Value & (INT64_C(1)1LL << Bits[i]));
}
return BitsInit::get(NewBits);
503}

505AnonymousNameInit *AnonymousNameInit::get(unsigned V) {
return new (Allocator) AnonymousNameInit(V);
507}

509StringInit *AnonymousNameInit::getNameInit() const {
return StringInit::get(getAsString());
511}

513std::string AnonymousNameInit::getAsString() const {
return "anonymous_" + utostr(Value);
515}

517Init *AnonymousNameInit::resolveReferences(Resolver &R) const {
auto *Old = const_cast<Init *>(static_cast<const Init *>(this));
auto *New = R.resolve(Old);
New = New ? New : Old;
if (R.isFinal())
  if (auto *Anonymous = dyn_cast<AnonymousNameInit>(New))
    return Anonymous->getNameInit();
return New;
525}

527StringInit *StringInit::get(StringRef V, StringFormat Fmt) {
static StringMap<StringInit*, BumpPtrAllocator &> StringPool(Allocator);
static StringMap<StringInit*, BumpPtrAllocator &> CodePool(Allocator);

if (Fmt == SF_String) {
  auto &Entry = *StringPool.insert(std::make_pair(V, nullptr)).first;
  if (!Entry.second)
    Entry.second = new (Allocator) StringInit(Entry.getKey(), Fmt);
  return Entry.second;
} else {
  auto &Entry = *CodePool.insert(std::make_pair(V, nullptr)).first;
  if (!Entry.second)
    Entry.second = new (Allocator) StringInit(Entry.getKey(), Fmt);
  return Entry.second;
}
542}

544Init *StringInit::convertInitializerTo(RecTy *Ty) const {
if (isa<StringRecTy>(Ty))
  return const_cast<StringInit *>(this);

return nullptr;
549}

551static void ProfileListInit(FoldingSetNodeID &ID,
                          ArrayRef<Init *> Range,
                          RecTy *EltTy) {
ID.AddInteger(Range.size());
ID.AddPointer(EltTy);

for (Init *I : Range)
  ID.AddPointer(I);
559}

561ListInit *ListInit::get(ArrayRef<Init *> Range, RecTy *EltTy) {
static FoldingSet<ListInit> ThePool;

FoldingSetNodeID ID;
ProfileListInit(ID, Range, EltTy);

void *IP = nullptr;
if (ListInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

assert(Range.empty() || !isa<TypedInit>(Range[0]) ||((void)0)
       cast<TypedInit>(Range[0])->getType()->typeIsConvertibleTo(EltTy))((void)0);

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Range.size()),
                               alignof(ListInit));
ListInit *I = new(Mem) ListInit(Range.size(), EltTy);
std::uninitialized_copy(Range.begin(), Range.end(),
                        I->getTrailingObjects<Init *>());
ThePool.InsertNode(I, IP);
return I;
581}

583void ListInit::Profile(FoldingSetNodeID &ID) const {
RecTy *EltTy = cast<ListRecTy>(getType())->getElementType();

ProfileListInit(ID, getValues(), EltTy);
587}

589Init *ListInit::convertInitializerTo(RecTy *Ty) const {
if (getType() == Ty)
  return const_cast<ListInit*>(this);

if (auto *LRT = dyn_cast<ListRecTy>(Ty)) {
  SmallVector<Init*, 8> Elements;
  Elements.reserve(getValues().size());

  // Verify that all of the elements of the list are subclasses of the
  // appropriate class!
  bool Changed = false;
  RecTy *ElementType = LRT->getElementType();
  for (Init *I : getValues())
    if (Init *CI = I->convertInitializerTo(ElementType)) {
      Elements.push_back(CI);
      if (CI != I)
        Changed = true;
    } else
      return nullptr;

  if (!Changed)
    return const_cast<ListInit*>(this);
  return ListInit::get(Elements, ElementType);
}

return nullptr;
615}

617Init *ListInit::convertInitListSlice(ArrayRef<unsigned> Elements) const {
if (Elements.size() == 1) {
  if (Elements[0] >= size())
    return nullptr;
  return getElement(Elements[0]);
}

SmallVector<Init*, 8> Vals;
Vals.reserve(Elements.size());
for (unsigned Element : Elements) {
  if (Element >= size())
    return nullptr;
  Vals.push_back(getElement(Element));
}
return ListInit::get(Vals, getElementType());
632}

634Record *ListInit::getElementAsRecord(unsigned i) const {
assert(i < NumValues && "List element index out of range!")((void)0);
DefInit *DI = dyn_cast<DefInit>(getElement(i));
if (!DI)
  PrintFatalError("Expected record in list!");
return DI->getDef();
640}

642Init *ListInit::resolveReferences(Resolver &R) const {
SmallVector<Init*, 8> Resolved;
Resolved.reserve(size());
bool Changed = false;

for (Init *CurElt : getValues()) {
  Init *E = CurElt->resolveReferences(R);
  Changed |= E != CurElt;
  Resolved.push_back(E);
}

if (Changed)
  return ListInit::get(Resolved, getElementType());
return const_cast<ListInit *>(this);
656}

658bool ListInit::isComplete() const {
for (Init *Element : *this) {
  if (!Element->isComplete())
    return false;
}
return true;
664}

666bool ListInit::isConcrete() const {
for (Init *Element : *this) {
  if (!Element->isConcrete())
    return false;
}
return true;
672}

674std::string ListInit::getAsString() const {
std::string Result = "[";
const char *sep = "";
for (Init *Element : *this) {
  Result += sep;
  sep = ", ";
  Result += Element->getAsString();
}
return Result + "]";
683}

685Init *OpInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<OpInit*>(this);
return VarBitInit::get(const_cast<OpInit*>(this), Bit);
689}

691static void
692ProfileUnOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *Op, RecTy *Type) {
ID.AddInteger(Opcode);
ID.AddPointer(Op);
ID.AddPointer(Type);
696}

698UnOpInit *UnOpInit::get(UnaryOp Opc, Init *LHS, RecTy *Type) {
static FoldingSet<UnOpInit> ThePool;

FoldingSetNodeID ID;
ProfileUnOpInit(ID, Opc, LHS, Type);

void *IP = nullptr;
if (UnOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

UnOpInit *I = new(Allocator) UnOpInit(Opc, LHS, Type);
ThePool.InsertNode(I, IP);
return I;
711}

713void UnOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileUnOpInit(ID, getOpcode(), getOperand(), getType());
715}

717Init *UnOpInit::Fold(Record *CurRec, bool IsFinal) const {
switch (getOpcode()) {
10
←
Control jumps to 'case GETDAGOP:'  at line 813→
case CAST:
  if (isa<StringRecTy>(getType())) {
    if (StringInit *LHSs = dyn_cast<StringInit>(LHS))
      return LHSs;

    if (DefInit *LHSd = dyn_cast<DefInit>(LHS))
      return StringInit::get(LHSd->getAsString());

    if (IntInit *LHSi =
            dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get())))
      return StringInit::get(LHSi->getAsString());

  } else if (isa<RecordRecTy>(getType())) {
    if (StringInit *Name = dyn_cast<StringInit>(LHS)) {
      if (!CurRec && !IsFinal)
        break;
      assert(CurRec && "NULL pointer")((void)0);
      Record *D;

      // Self-references are allowed, but their resolution is delayed until
      // the final resolve to ensure that we get the correct type for them.
      auto *Anonymous = dyn_cast<AnonymousNameInit>(CurRec->getNameInit());
      if (Name == CurRec->getNameInit() ||
          (Anonymous && Name == Anonymous->getNameInit())) {
        if (!IsFinal)
          break;
        D = CurRec;
      } else {
        D = CurRec->getRecords().getDef(Name->getValue());
        if (!D) {
          if (IsFinal)
            PrintFatalError(CurRec->getLoc(),
                            Twine("Undefined reference to record: '") +
                            Name->getValue() + "'\n");
          break;
        }
      }

      DefInit *DI = DefInit::get(D);
      if (!DI->getType()->typeIsA(getType())) {
        PrintFatalError(CurRec->getLoc(),
                        Twine("Expected type '") +
                        getType()->getAsString() + "', got '" +
                        DI->getType()->getAsString() + "' in: " +
                        getAsString() + "\n");
      }
      return DI;
    }
  }

  if (Init *NewInit = LHS->convertInitializerTo(getType()))
    return NewInit;
  break;

case NOT:
  if (IntInit *LHSi =
          dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get())))
    return IntInit::get(LHSi->getValue() ? 0 : 1);
  break;

case HEAD:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) {
    assert(!LHSl->empty() && "Empty list in head")((void)0);
    return LHSl->getElement(0);
  }
  break;

case TAIL:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) {
    assert(!LHSl->empty() && "Empty list in tail")((void)0);
    // Note the +1.  We can't just pass the result of getValues()
    // directly.
    return ListInit::get(LHSl->getValues().slice(1), LHSl->getElementType());
  }
  break;

case SIZE:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS))
    return IntInit::get(LHSl->size());
  if (DagInit *LHSd = dyn_cast<DagInit>(LHS))
    return IntInit::get(LHSd->arg_size());
  if (StringInit *LHSs = dyn_cast<StringInit>(LHS))
    return IntInit::get(LHSs->getValue().size());
  break;

case EMPTY:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS))
    return IntInit::get(LHSl->empty());
  if (DagInit *LHSd = dyn_cast<DagInit>(LHS))
    return IntInit::get(LHSd->arg_empty());
  if (StringInit *LHSs = dyn_cast<StringInit>(LHS))
    return IntInit::get(LHSs->getValue().empty());
  break;

case GETDAGOP:
  if (DagInit *Dag11.1
'Dag' is non-null
 = dyn_cast<DagInit>(LHS)) {
11
←
Assuming field 'LHS' is a 'DagInit'→
12
←
Taking true branch→
    DefInit *DI = DefInit::get(Dag->getOperatorAsDef({}));
    if (!DI->getType()->typeIsA(getType())) {
13
←
Assuming the condition is true→
14
←
Taking true branch→
      PrintFatalError(CurRec->getLoc(),
15
←
Called C++ object pointer is null
                      Twine("Expected type '") +
                      getType()->getAsString() + "', got '" +
                      DI->getType()->getAsString() + "' in: " +
                      getAsString() + "\n");
    } else {
      return DI;
    }
  }
  break;
}
return const_cast<UnOpInit *>(this);
829}

831Init *UnOpInit::resolveReferences(Resolver &R) const {
Init *lhs = LHS->resolveReferences(R);

if (LHS != lhs || (R.isFinal() && getOpcode() == CAST))
  return (UnOpInit::get(getOpcode(), lhs, getType()))
      ->Fold(R.getCurrentRecord(), R.isFinal());
return const_cast<UnOpInit *>(this);
838}

840std::string UnOpInit::getAsString() const {
std::string Result;
switch (getOpcode()) {
case CAST: Result = "!cast<" + getType()->getAsString() + ">"; break;
case NOT: Result = "!not"; break;
case HEAD: Result = "!head"; break;
case TAIL: Result = "!tail"; break;
case SIZE: Result = "!size"; break;
case EMPTY: Result = "!empty"; break;
case GETDAGOP: Result = "!getdagop"; break;
}
return Result + "(" + LHS->getAsString() + ")";
852}

854static void
855ProfileBinOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *LHS, Init *RHS,
               RecTy *Type) {
ID.AddInteger(Opcode);
ID.AddPointer(LHS);
ID.AddPointer(RHS);
ID.AddPointer(Type);
861}

863BinOpInit *BinOpInit::get(BinaryOp Opc, Init *LHS,
                        Init *RHS, RecTy *Type) {
static FoldingSet<BinOpInit> ThePool;

FoldingSetNodeID ID;
ProfileBinOpInit(ID, Opc, LHS, RHS, Type);

void *IP = nullptr;
if (BinOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

BinOpInit *I = new(Allocator) BinOpInit(Opc, LHS, RHS, Type);
ThePool.InsertNode(I, IP);
return I;
877}

879void BinOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileBinOpInit(ID, getOpcode(), getLHS(), getRHS(), getType());
881}

883static StringInit *ConcatStringInits(const StringInit *I0,
                                   const StringInit *I1) {
SmallString<80> Concat(I0->getValue());
Concat.append(I1->getValue());
return StringInit::get(Concat, 
                       StringInit::determineFormat(I0->getFormat(),
                                                   I1->getFormat()));
890}

892static StringInit *interleaveStringList(const ListInit *List,
                                      const StringInit *Delim) {
if (List->size() == 0)
  return StringInit::get("");
StringInit *Element = dyn_cast<StringInit>(List->getElement(0));
if (!Element)
  return nullptr;
SmallString<80> Result(Element->getValue());
StringInit::StringFormat Fmt = StringInit::SF_String;

for (unsigned I = 1, E = List->size(); I < E; ++I) {
  Result.append(Delim->getValue());
  StringInit *Element = dyn_cast<StringInit>(List->getElement(I));
  if (!Element)
    return nullptr;
  Result.append(Element->getValue());
  Fmt = StringInit::determineFormat(Fmt, Element->getFormat());
}
return StringInit::get(Result, Fmt);
911}

913static StringInit *interleaveIntList(const ListInit *List,
                                   const StringInit *Delim) {
if (List->size() == 0)
  return StringInit::get("");
IntInit *Element =
    dyn_cast_or_null<IntInit>(List->getElement(0)
                                  ->convertInitializerTo(IntRecTy::get()));
if (!Element)
  return nullptr;
SmallString<80> Result(Element->getAsString());

for (unsigned I = 1, E = List->size(); I < E; ++I) {
  Result.append(Delim->getValue());
  IntInit *Element =
      dyn_cast_or_null<IntInit>(List->getElement(I)
                                    ->convertInitializerTo(IntRecTy::get()));
  if (!Element)
    return nullptr;
  Result.append(Element->getAsString());
}
return StringInit::get(Result);
934}

936Init *BinOpInit::getStrConcat(Init *I0, Init *I1) {
// Shortcut for the common case of concatenating two strings.
if (const StringInit *I0s = dyn_cast<StringInit>(I0))
  if (const StringInit *I1s = dyn_cast<StringInit>(I1))
    return ConcatStringInits(I0s, I1s);
return BinOpInit::get(BinOpInit::STRCONCAT, I0, I1, StringRecTy::get());
942}

944static ListInit *ConcatListInits(const ListInit *LHS,
                               const ListInit *RHS) {
SmallVector<Init *, 8> Args;
llvm::append_range(Args, *LHS);
llvm::append_range(Args, *RHS);
return ListInit::get(Args, LHS->getElementType());
950}

952Init *BinOpInit::getListConcat(TypedInit *LHS, Init *RHS) {
assert(isa<ListRecTy>(LHS->getType()) && "First arg must be a list")((void)0);

// Shortcut for the common case of concatenating two lists.
 if (const ListInit *LHSList = dyn_cast<ListInit>(LHS))
   if (const ListInit *RHSList = dyn_cast<ListInit>(RHS))
     return ConcatListInits(LHSList, RHSList);
 return BinOpInit::get(BinOpInit::LISTCONCAT, LHS, RHS, LHS->getType());
960}

962Init *BinOpInit::Fold(Record *CurRec) const {
switch (getOpcode()) {
case CONCAT: {
  DagInit *LHSs = dyn_cast<DagInit>(LHS);
  DagInit *RHSs = dyn_cast<DagInit>(RHS);
  if (LHSs && RHSs) {
    DefInit *LOp = dyn_cast<DefInit>(LHSs->getOperator());
    DefInit *ROp = dyn_cast<DefInit>(RHSs->getOperator());
    if ((!LOp && !isa<UnsetInit>(LHSs->getOperator())) ||
        (!ROp && !isa<UnsetInit>(RHSs->getOperator())))
      break;
    if (LOp && ROp && LOp->getDef() != ROp->getDef()) {
      PrintFatalError(Twine("Concatenated Dag operators do not match: '") +
                      LHSs->getAsString() + "' vs. '" + RHSs->getAsString() +
                      "'");
    }
    Init *Op = LOp ? LOp : ROp;
    if (!Op)
      Op = UnsetInit::get();

    SmallVector<Init*, 8> Args;
    SmallVector<StringInit*, 8> ArgNames;
    for (unsigned i = 0, e = LHSs->getNumArgs(); i != e; ++i) {
      Args.push_back(LHSs->getArg(i));
      ArgNames.push_back(LHSs->getArgName(i));
    }
    for (unsigned i = 0, e = RHSs->getNumArgs(); i != e; ++i) {
      Args.push_back(RHSs->getArg(i));
      ArgNames.push_back(RHSs->getArgName(i));
    }
    return DagInit::get(Op, nullptr, Args, ArgNames);
  }
  break;
}
case LISTCONCAT: {
  ListInit *LHSs = dyn_cast<ListInit>(LHS);
  ListInit *RHSs = dyn_cast<ListInit>(RHS);
  if (LHSs && RHSs) {
    SmallVector<Init *, 8> Args;
    llvm::append_range(Args, *LHSs);
    llvm::append_range(Args, *RHSs);
    return ListInit::get(Args, LHSs->getElementType());
  }
  break;
}
case LISTSPLAT: {
  TypedInit *Value = dyn_cast<TypedInit>(LHS);
  IntInit *Size = dyn_cast<IntInit>(RHS);
  if (Value && Size) {
    SmallVector<Init *, 8> Args(Size->getValue(), Value);
    return ListInit::get(Args, Value->getType());
  }
  break;
}
case STRCONCAT: {
  StringInit *LHSs = dyn_cast<StringInit>(LHS);
  StringInit *RHSs = dyn_cast<StringInit>(RHS);
  if (LHSs && RHSs)
    return ConcatStringInits(LHSs, RHSs);
  break;
}
case INTERLEAVE: {
  ListInit *List = dyn_cast<ListInit>(LHS);
  StringInit *Delim = dyn_cast<StringInit>(RHS);
  if (List && Delim) {
    StringInit *Result;
    if (isa<StringRecTy>(List->getElementType()))
      Result = interleaveStringList(List, Delim);
    else
      Result = interleaveIntList(List, Delim);
    if (Result)
      return Result;
  }
  break;
}
case EQ:
case NE:
case LE:
case LT:
case GE:
case GT: {
  // First see if we have two bit, bits, or int.
  IntInit *LHSi =
      dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get()));
  IntInit *RHSi =
      dyn_cast_or_null<IntInit>(RHS->convertInitializerTo(IntRecTy::get()));

  if (LHSi && RHSi) {
    bool Result;
    switch (getOpcode()) {
    case EQ: Result = LHSi->getValue() == RHSi->getValue(); break;
    case NE: Result = LHSi->getValue() != RHSi->getValue(); break;
    case LE: Result = LHSi->getValue() <= RHSi->getValue(); break;
    case LT: Result = LHSi->getValue() <  RHSi->getValue(); break;
    case GE: Result = LHSi->getValue() >= RHSi->getValue(); break;
    case GT: Result = LHSi->getValue() >  RHSi->getValue(); break;
    default: llvm_unreachable("unhandled comparison")__builtin_unreachable();
    }
    return BitInit::get(Result);
  }

  // Next try strings.
  StringInit *LHSs = dyn_cast<StringInit>(LHS);
  StringInit *RHSs = dyn_cast<StringInit>(RHS);

  if (LHSs && RHSs) {
    bool Result;
    switch (getOpcode()) {
    case EQ: Result = LHSs->getValue() == RHSs->getValue(); break;
    case NE: Result = LHSs->getValue() != RHSs->getValue(); break;
    case LE: Result = LHSs->getValue() <= RHSs->getValue(); break;
    case LT: Result = LHSs->getValue() <  RHSs->getValue(); break;
    case GE: Result = LHSs->getValue() >= RHSs->getValue(); break;
    case GT: Result = LHSs->getValue() >  RHSs->getValue(); break;
    default: llvm_unreachable("unhandled comparison")__builtin_unreachable();
    }
    return BitInit::get(Result);
  }

  // Finally, !eq and !ne can be used with records.
  if (getOpcode() == EQ || getOpcode() == NE) {
    DefInit *LHSd = dyn_cast<DefInit>(LHS);
    DefInit *RHSd = dyn_cast<DefInit>(RHS);
    if (LHSd && RHSd)
      return BitInit::get((getOpcode() == EQ) ? LHSd == RHSd
                                              : LHSd != RHSd);
  }

  break;
}
case SETDAGOP: {
  DagInit *Dag = dyn_cast<DagInit>(LHS);
  DefInit *Op = dyn_cast<DefInit>(RHS);
  if (Dag && Op) {
    SmallVector<Init*, 8> Args;
    SmallVector<StringInit*, 8> ArgNames;
    for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
      Args.push_back(Dag->getArg(i));
      ArgNames.push_back(Dag->getArgName(i));
    }
    return DagInit::get(Op, nullptr, Args, ArgNames);
  }
  break;
}
case ADD:
case SUB:
case MUL:
case AND:
case OR:
case XOR:
case SHL:
case SRA:
case SRL: {
  IntInit *LHSi =
    dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get()));
  IntInit *RHSi =
    dyn_cast_or_null<IntInit>(RHS->convertInitializerTo(IntRecTy::get()));
  if (LHSi && RHSi) {
    int64_t LHSv = LHSi->getValue(), RHSv = RHSi->getValue();
    int64_t Result;
    switch (getOpcode()) {
    default: llvm_unreachable("Bad opcode!")__builtin_unreachable();
    case ADD: Result = LHSv + RHSv; break;
    case SUB: Result = LHSv - RHSv; break;
    case MUL: Result = LHSv * RHSv; break;
    case AND: Result = LHSv & RHSv; break;
    case OR:  Result = LHSv | RHSv; break;
    case XOR: Result = LHSv ^ RHSv; break;
    case SHL: Result = (uint64_t)LHSv << (uint64_t)RHSv; break;
    case SRA: Result = LHSv >> RHSv; break;
    case SRL: Result = (uint64_t)LHSv >> (uint64_t)RHSv; break;
    }
    return IntInit::get(Result);
  }
  break;
}
}
return const_cast<BinOpInit *>(this);
1140}

1142Init *BinOpInit::resolveReferences(Resolver &R) const {
Init *lhs = LHS->resolveReferences(R);
Init *rhs = RHS->resolveReferences(R);

if (LHS != lhs || RHS != rhs)
  return (BinOpInit::get(getOpcode(), lhs, rhs, getType()))
      ->Fold(R.getCurrentRecord());
return const_cast<BinOpInit *>(this);
1150}

1152std::string BinOpInit::getAsString() const {
std::string Result;
switch (getOpcode()) {
case CONCAT: Result = "!con"; break;
case ADD: Result = "!add"; break;
case SUB: Result = "!sub"; break;
case MUL: Result = "!mul"; break;
case AND: Result = "!and"; break;
case OR: Result = "!or"; break;
case XOR: Result = "!xor"; break;
case SHL: Result = "!shl"; break;
case SRA: Result = "!sra"; break;
case SRL: Result = "!srl"; break;
case EQ: Result = "!eq"; break;
case NE: Result = "!ne"; break;
case LE: Result = "!le"; break;
case LT: Result = "!lt"; break;
case GE: Result = "!ge"; break;
case GT: Result = "!gt"; break;
case LISTCONCAT: Result = "!listconcat"; break;
case LISTSPLAT: Result = "!listsplat"; break;
case STRCONCAT: Result = "!strconcat"; break;
case INTERLEAVE: Result = "!interleave"; break;
case SETDAGOP: Result = "!setdagop"; break;
}
return Result + "(" + LHS->getAsString() + ", " + RHS->getAsString() + ")";
1178}

1180static void
1181ProfileTernOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *LHS, Init *MHS,
                Init *RHS, RecTy *Type) {
ID.AddInteger(Opcode);
ID.AddPointer(LHS);
ID.AddPointer(MHS);
ID.AddPointer(RHS);
ID.AddPointer(Type);
1188}

1190TernOpInit *TernOpInit::get(TernaryOp Opc, Init *LHS, Init *MHS, Init *RHS,
                          RecTy *Type) {
static FoldingSet<TernOpInit> ThePool;

FoldingSetNodeID ID;
ProfileTernOpInit(ID, Opc, LHS, MHS, RHS, Type);

void *IP = nullptr;
if (TernOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

TernOpInit *I = new(Allocator) TernOpInit(Opc, LHS, MHS, RHS, Type);
ThePool.InsertNode(I, IP);
return I;
1204}

1206void TernOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileTernOpInit(ID, getOpcode(), getLHS(), getMHS(), getRHS(), getType());
1208}

1210static Init *ItemApply(Init *LHS, Init *MHSe, Init *RHS, Record *CurRec) {
MapResolver R(CurRec);
R.set(LHS, MHSe);
return RHS->resolveReferences(R);
1214}

1216static Init *ForeachDagApply(Init *LHS, DagInit *MHSd, Init *RHS,
                           Record *CurRec) {
bool Change = false;
Init *Val = ItemApply(LHS, MHSd->getOperator(), RHS, CurRec);
if (Val != MHSd->getOperator())
  Change = true;

SmallVector<std::pair<Init *, StringInit *>, 8> NewArgs;
for (unsigned int i = 0; i < MHSd->getNumArgs(); ++i) {
  Init *Arg = MHSd->getArg(i);
  Init *NewArg;
  StringInit *ArgName = MHSd->getArgName(i);

  if (DagInit *Argd = dyn_cast<DagInit>(Arg))
    NewArg = ForeachDagApply(LHS, Argd, RHS, CurRec);
  else
    NewArg = ItemApply(LHS, Arg, RHS, CurRec);

  NewArgs.push_back(std::make_pair(NewArg, ArgName));
  if (Arg != NewArg)
    Change = true;
}

if (Change)
  return DagInit::get(Val, nullptr, NewArgs);
return MHSd;
1242}

1244// Applies RHS to all elements of MHS, using LHS as a temp variable.
1245static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type,
                         Record *CurRec) {
if (DagInit *MHSd = dyn_cast<DagInit>(MHS))
  return ForeachDagApply(LHS, MHSd, RHS, CurRec);

if (ListInit *MHSl = dyn_cast<ListInit>(MHS)) {
  SmallVector<Init *, 8> NewList(MHSl->begin(), MHSl->end());

  for (Init *&Item : NewList) {
    Init *NewItem = ItemApply(LHS, Item, RHS, CurRec);
    if (NewItem != Item)
      Item = NewItem;
  }
  return ListInit::get(NewList, cast<ListRecTy>(Type)->getElementType());
}

return nullptr;
1262}

1264// Evaluates RHS for all elements of MHS, using LHS as a temp variable.
1265// Creates a new list with the elements that evaluated to true.
1266static Init *FilterHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type,
                        Record *CurRec) {
if (ListInit *MHSl = dyn_cast<ListInit>(MHS)) {
  SmallVector<Init *, 8> NewList;

  for (Init *Item : MHSl->getValues()) {
    Init *Include = ItemApply(LHS, Item, RHS, CurRec);
    if (!Include)
      return nullptr;
    if (IntInit *IncludeInt = dyn_cast_or_null<IntInit>(
                                  Include->convertInitializerTo(IntRecTy::get()))) {
      if (IncludeInt->getValue())          
        NewList.push_back(Item);
    } else {
      return nullptr;
    }
  }
  return ListInit::get(NewList, cast<ListRecTy>(Type)->getElementType());
}

return nullptr;
1287}

1289Init *TernOpInit::Fold(Record *CurRec) const {
switch (getOpcode()) {
case SUBST: {
  DefInit *LHSd = dyn_cast<DefInit>(LHS);
  VarInit *LHSv = dyn_cast<VarInit>(LHS);
  StringInit *LHSs = dyn_cast<StringInit>(LHS);

  DefInit *MHSd = dyn_cast<DefInit>(MHS);
  VarInit *MHSv = dyn_cast<VarInit>(MHS);
  StringInit *MHSs = dyn_cast<StringInit>(MHS);

  DefInit *RHSd = dyn_cast<DefInit>(RHS);
  VarInit *RHSv = dyn_cast<VarInit>(RHS);
  StringInit *RHSs = dyn_cast<StringInit>(RHS);

  if (LHSd && MHSd && RHSd) {
    Record *Val = RHSd->getDef();
    if (LHSd->getAsString() == RHSd->getAsString())
      Val = MHSd->getDef();
    return DefInit::get(Val);
  }
  if (LHSv && MHSv && RHSv) {
    std::string Val = std::string(RHSv->getName());
    if (LHSv->getAsString() == RHSv->getAsString())
      Val = std::string(MHSv->getName());
    return VarInit::get(Val, getType());
  }
  if (LHSs && MHSs && RHSs) {
    std::string Val = std::string(RHSs->getValue());

    std::string::size_type found;
    std::string::size_type idx = 0;
    while (true) {
      found = Val.find(std::string(LHSs->getValue()), idx);
      if (found == std::string::npos)
        break;
      Val.replace(found, LHSs->getValue().size(),
                  std::string(MHSs->getValue()));
      idx = found + MHSs->getValue().size();
    }

    return StringInit::get(Val);
  }
  break;
}

case FOREACH: {
  if (Init *Result = ForeachHelper(LHS, MHS, RHS, getType(), CurRec))
    return Result;
  break;
}

case FILTER: {
  if (Init *Result = FilterHelper(LHS, MHS, RHS, getType(), CurRec))
    return Result;
  break;
}

case IF: {
  if (IntInit *LHSi = dyn_cast_or_null<IntInit>(
                          LHS->convertInitializerTo(IntRecTy::get()))) {
    if (LHSi->getValue())
      return MHS;
    return RHS;
  }
  break;
}

case DAG: {
  ListInit *MHSl = dyn_cast<ListInit>(MHS);
  ListInit *RHSl = dyn_cast<ListInit>(RHS);
  bool MHSok = MHSl || isa<UnsetInit>(MHS);
  bool RHSok = RHSl || isa<UnsetInit>(RHS);

  if (isa<UnsetInit>(MHS) && isa<UnsetInit>(RHS))
    break; // Typically prevented by the parser, but might happen with template args

  if (MHSok && RHSok && (!MHSl || !RHSl || MHSl->size() == RHSl->size())) {
    SmallVector<std::pair<Init *, StringInit *>, 8> Children;
    unsigned Size = MHSl ? MHSl->size() : RHSl->size();
    for (unsigned i = 0; i != Size; ++i) {
      Init *Node = MHSl ? MHSl->getElement(i) : UnsetInit::get();
      Init *Name = RHSl ? RHSl->getElement(i) : UnsetInit::get();
      if (!isa<StringInit>(Name) && !isa<UnsetInit>(Name))
        return const_cast<TernOpInit *>(this);
      Children.emplace_back(Node, dyn_cast<StringInit>(Name));
    }
    return DagInit::get(LHS, nullptr, Children);
  }
  break;
}

case SUBSTR: {
  StringInit *LHSs = dyn_cast<StringInit>(LHS);
  IntInit *MHSi = dyn_cast<IntInit>(MHS);
  IntInit *RHSi = dyn_cast<IntInit>(RHS);
  if (LHSs && MHSi && RHSi) {
    int64_t StringSize = LHSs->getValue().size();
    int64_t Start = MHSi->getValue();
    int64_t Length = RHSi->getValue();
    if (Start < 0 || Start > StringSize)
      PrintError(CurRec->getLoc(),
                 Twine("!substr start position is out of range 0...") +
                     std::to_string(StringSize) + ": " +
                     std::to_string(Start));
    if (Length < 0)
      PrintError(CurRec->getLoc(), "!substr length must be nonnegative");
    return StringInit::get(LHSs->getValue().substr(Start, Length),
                           LHSs->getFormat());
  }
  break;
}

case FIND: {
  StringInit *LHSs = dyn_cast<StringInit>(LHS);
  StringInit *MHSs = dyn_cast<StringInit>(MHS);
  IntInit *RHSi = dyn_cast<IntInit>(RHS);
  if (LHSs && MHSs && RHSi) {
    int64_t SourceSize = LHSs->getValue().size();
    int64_t Start = RHSi->getValue();
    if (Start < 0 || Start > SourceSize)
      PrintError(CurRec->getLoc(),
                 Twine("!find start position is out of range 0...") +
                     std::to_string(SourceSize) + ": " +
                     std::to_string(Start));
    auto I = LHSs->getValue().find(MHSs->getValue(), Start);
    if (I == std::string::npos)
      return IntInit::get(-1);
    return IntInit::get(I);
  }
  break;
}
}

return const_cast<TernOpInit *>(this);
1424}

1426Init *TernOpInit::resolveReferences(Resolver &R) const {
Init *lhs = LHS->resolveReferences(R);

if (getOpcode() == IF && lhs != LHS) {
  if (IntInit *Value = dyn_cast_or_null<IntInit>(
                           lhs->convertInitializerTo(IntRecTy::get()))) {
    // Short-circuit
    if (Value->getValue())
      return MHS->resolveReferences(R);
    return RHS->resolveReferences(R);
  }
}

Init *mhs = MHS->resolveReferences(R);
Init *rhs;

if (getOpcode() == FOREACH || getOpcode() == FILTER) {
  ShadowResolver SR(R);
  SR.addShadow(lhs);
  rhs = RHS->resolveReferences(SR);
} else {
  rhs = RHS->resolveReferences(R);
}

if (LHS != lhs || MHS != mhs || RHS != rhs)
  return (TernOpInit::get(getOpcode(), lhs, mhs, rhs, getType()))
      ->Fold(R.getCurrentRecord());
return const_cast<TernOpInit *>(this);
1454}

1456std::string TernOpInit::getAsString() const {
std::string Result;
bool UnquotedLHS = false;
switch (getOpcode()) {
case DAG: Result = "!dag"; break;
case FILTER: Result = "!filter"; UnquotedLHS = true; break;
case FOREACH: Result = "!foreach"; UnquotedLHS = true; break;
case IF: Result = "!if"; break;
case SUBST: Result = "!subst"; break;
case SUBSTR: Result = "!substr"; break;
case FIND: Result = "!find"; break;
}
return (Result + "(" +
        (UnquotedLHS ? LHS->getAsUnquotedString() : LHS->getAsString()) +
        ", " + MHS->getAsString() + ", " + RHS->getAsString() + ")");
1471}

1473static void ProfileFoldOpInit(FoldingSetNodeID &ID, Init *Start, Init *List,
                            Init *A, Init *B, Init *Expr, RecTy *Type) {
ID.AddPointer(Start);
ID.AddPointer(List);
ID.AddPointer(A);
ID.AddPointer(B);
ID.AddPointer(Expr);
ID.AddPointer(Type);
1481}

1483FoldOpInit *FoldOpInit::get(Init *Start, Init *List, Init *A, Init *B,
                          Init *Expr, RecTy *Type) {
static FoldingSet<FoldOpInit> ThePool;

FoldingSetNodeID ID;
ProfileFoldOpInit(ID, Start, List, A, B, Expr, Type);

void *IP = nullptr;
if (FoldOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

FoldOpInit *I = new (Allocator) FoldOpInit(Start, List, A, B, Expr, Type);
ThePool.InsertNode(I, IP);
return I;
1497}

1499void FoldOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileFoldOpInit(ID, Start, List, A, B, Expr, getType());
1501}

1503Init *FoldOpInit::Fold(Record *CurRec) const {
if (ListInit *LI = dyn_cast<ListInit>(List)) {
  Init *Accum = Start;
  for (Init *Elt : *LI) {
    MapResolver R(CurRec);
    R.set(A, Accum);
    R.set(B, Elt);
    Accum = Expr->resolveReferences(R);
  }
  return Accum;
}
return const_cast<FoldOpInit *>(this);
1515}

1517Init *FoldOpInit::resolveReferences(Resolver &R) const {
Init *NewStart = Start->resolveReferences(R);
Init *NewList = List->resolveReferences(R);
ShadowResolver SR(R);
SR.addShadow(A);
SR.addShadow(B);
Init *NewExpr = Expr->resolveReferences(SR);

if (Start == NewStart && List == NewList && Expr == NewExpr)
  return const_cast<FoldOpInit *>(this);

return get(NewStart, NewList, A, B, NewExpr, getType())
    ->Fold(R.getCurrentRecord());
1530}

1532Init *FoldOpInit::getBit(unsigned Bit) const {
return VarBitInit::get(const_cast<FoldOpInit *>(this), Bit);
1534}

1536std::string FoldOpInit::getAsString() const {
return (Twine("!foldl(") + Start->getAsString() + ", " + List->getAsString() +
        ", " + A->getAsUnquotedString() + ", " + B->getAsUnquotedString() +
        ", " + Expr->getAsString() + ")")
    .str();
1541}

1543static void ProfileIsAOpInit(FoldingSetNodeID &ID, RecTy *CheckType,
                           Init *Expr) {
ID.AddPointer(CheckType);
ID.AddPointer(Expr);
1547}

1549IsAOpInit *IsAOpInit::get(RecTy *CheckType, Init *Expr) {
static FoldingSet<IsAOpInit> ThePool;

FoldingSetNodeID ID;
ProfileIsAOpInit(ID, CheckType, Expr);

void *IP = nullptr;
if (IsAOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

IsAOpInit *I = new (Allocator) IsAOpInit(CheckType, Expr);
ThePool.InsertNode(I, IP);
return I;
1562}

1564void IsAOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileIsAOpInit(ID, CheckType, Expr);
1566}

1568Init *IsAOpInit::Fold() const {
if (TypedInit *TI = dyn_cast<TypedInit>(Expr)) {
  // Is the expression type known to be (a subclass of) the desired type?
  if (TI->getType()->typeIsConvertibleTo(CheckType))
    return IntInit::get(1);

  if (isa<RecordRecTy>(CheckType)) {
    // If the target type is not a subclass of the expression type, or if
    // the expression has fully resolved to a record, we know that it can't
    // be of the required type.
    if (!CheckType->typeIsConvertibleTo(TI->getType()) || isa<DefInit>(Expr))
      return IntInit::get(0);
  } else {
    // We treat non-record types as not castable.
    return IntInit::get(0);
  }
}
return const_cast<IsAOpInit *>(this);
1586}

1588Init *IsAOpInit::resolveReferences(Resolver &R) const {
Init *NewExpr = Expr->resolveReferences(R);
if (Expr != NewExpr)
  return get(CheckType, NewExpr)->Fold();
return const_cast<IsAOpInit *>(this);
1593}

1595Init *IsAOpInit::getBit(unsigned Bit) const {
return VarBitInit::get(const_cast<IsAOpInit *>(this), Bit);
1597}

1599std::string IsAOpInit::getAsString() const {
return (Twine("!isa<") + CheckType->getAsString() + ">(" +
        Expr->getAsString() + ")")
    .str();
1603}

1605RecTy *TypedInit::getFieldType(StringInit *FieldName) const {
if (RecordRecTy *RecordType = dyn_cast<RecordRecTy>(getType())) {
  for (Record *Rec : RecordType->getClasses()) {
    if (RecordVal *Field = Rec->getValue(FieldName))
      return Field->getType();
  }
}
return nullptr;
1613}

1615Init *
1616TypedInit::convertInitializerTo(RecTy *Ty) const {
if (getType() == Ty || getType()->typeIsA(Ty))
  return const_cast<TypedInit *>(this);

if (isa<BitRecTy>(getType()) && isa<BitsRecTy>(Ty) &&
    cast<BitsRecTy>(Ty)->getNumBits() == 1)
  return BitsInit::get({const_cast<TypedInit *>(this)});

return nullptr;
1625}

1627Init *TypedInit::convertInitializerBitRange(ArrayRef<unsigned> Bits) const {
BitsRecTy *T = dyn_cast<BitsRecTy>(getType());
if (!T) return nullptr;  // Cannot subscript a non-bits variable.
unsigned NumBits = T->getNumBits();

SmallVector<Init *, 16> NewBits;
NewBits.reserve(Bits.size());
for (unsigned Bit : Bits) {
  if (Bit >= NumBits)
    return nullptr;

  NewBits.push_back(VarBitInit::get(const_cast<TypedInit *>(this), Bit));
}
return BitsInit::get(NewBits);
1641}

1643Init *TypedInit::getCastTo(RecTy *Ty) const {
// Handle the common case quickly
if (getType() == Ty || getType()->typeIsA(Ty))
1
Assuming the condition is false→
2
←
Assuming the condition is false→
3
←
Taking false branch→
  return const_cast<TypedInit *>(this);

if (Init *Converted = convertInitializerTo(Ty)) {
4
←
Assuming 'Converted' is null→
5
←
Taking false branch→
  assert(!isa<TypedInit>(Converted) ||((void)0)
         cast<TypedInit>(Converted)->getType()->typeIsA(Ty))((void)0);
  return Converted;
}

if (!getType()->typeIsConvertibleTo(Ty))
6
←
Assuming the condition is false→
7
←
Taking false branch→
  return nullptr;

return UnOpInit::get(UnOpInit::CAST, const_cast<TypedInit *>(this), Ty)
9
←
Calling 'UnOpInit::Fold'→
    ->Fold(nullptr);
8
←
Passing null pointer value via 1st parameter 'CurRec'→
1659}

1661Init *TypedInit::convertInitListSlice(ArrayRef<unsigned> Elements) const {
ListRecTy *T = dyn_cast<ListRecTy>(getType());
if (!T) return nullptr;  // Cannot subscript a non-list variable.

if (Elements.size() == 1)
  return VarListElementInit::get(const_cast<TypedInit *>(this), Elements[0]);

SmallVector<Init*, 8> ListInits;
ListInits.reserve(Elements.size());
for (unsigned Element : Elements)
  ListInits.push_back(VarListElementInit::get(const_cast<TypedInit *>(this),
                                              Element));
return ListInit::get(ListInits, T->getElementType());
1674}


1677VarInit *VarInit::get(StringRef VN, RecTy *T) {
Init *Value = StringInit::get(VN);
return VarInit::get(Value, T);
1680}

1682VarInit *VarInit::get(Init *VN, RecTy *T) {
using Key = std::pair<RecTy *, Init *>;
static DenseMap<Key, VarInit*> ThePool;

Key TheKey(std::make_pair(T, VN));

VarInit *&I = ThePool[TheKey];
if (!I)
  I = new(Allocator) VarInit(VN, T);
return I;
1692}

1694StringRef VarInit::getName() const {
StringInit *NameString = cast<StringInit>(getNameInit());
return NameString->getValue();
1697}

1699Init *VarInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<VarInit*>(this);
return VarBitInit::get(const_cast<VarInit*>(this), Bit);
1703}

1705Init *VarInit::resolveReferences(Resolver &R) const {
if (Init *Val = R.resolve(VarName))
  return Val;
return const_cast<VarInit *>(this);
1709}

1711VarBitInit *VarBitInit::get(TypedInit *T, unsigned B) {
using Key = std::pair<TypedInit *, unsigned>;
static DenseMap<Key, VarBitInit*> ThePool;

Key TheKey(std::make_pair(T, B));

VarBitInit *&I = ThePool[TheKey];
if (!I)
  I = new(Allocator) VarBitInit(T, B);
return I;
1721}

1723std::string VarBitInit::getAsString() const {
return TI->getAsString() + "{" + utostr(Bit) + "}";
1725}

1727Init *VarBitInit::resolveReferences(Resolver &R) const {
Init *I = TI->resolveReferences(R);
if (TI != I)
  return I->getBit(getBitNum());

return const_cast<VarBitInit*>(this);
1733}

1735VarListElementInit *VarListElementInit::get(TypedInit *T,
                                          unsigned E) {
using Key = std::pair<TypedInit *, unsigned>;
static DenseMap<Key, VarListElementInit*> ThePool;

Key TheKey(std::make_pair(T, E));

VarListElementInit *&I = ThePool[TheKey];
if (!I) I = new(Allocator) VarListElementInit(T, E);
return I;
1745}

1747std::string VarListElementInit::getAsString() const {
return TI->getAsString() + "[" + utostr(Element) + "]";
1749}

1751Init *VarListElementInit::resolveReferences(Resolver &R) const {
Init *NewTI = TI->resolveReferences(R);
if (ListInit *List = dyn_cast<ListInit>(NewTI)) {
  // Leave out-of-bounds array references as-is. This can happen without
  // being an error, e.g. in the untaken "branch" of an !if expression.
  if (getElementNum() < List->size())
    return List->getElement(getElementNum());
}
if (NewTI != TI && isa<TypedInit>(NewTI))
  return VarListElementInit::get(cast<TypedInit>(NewTI), getElementNum());
return const_cast<VarListElementInit *>(this);
1762}

1764Init *VarListElementInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<VarListElementInit*>(this);
return VarBitInit::get(const_cast<VarListElementInit*>(this), Bit);
1768}

1770DefInit::DefInit(Record *D)
  : TypedInit(IK_DefInit, D->getType()), Def(D) {}

1773DefInit *DefInit::get(Record *R) {
return R->getDefInit();
1775}

1777Init *DefInit::convertInitializerTo(RecTy *Ty) const {
if (auto *RRT = dyn_cast<RecordRecTy>(Ty))
  if (getType()->typeIsConvertibleTo(RRT))
    return const_cast<DefInit *>(this);
return nullptr;
1782}

1784RecTy *DefInit::getFieldType(StringInit *FieldName) const {
if (const RecordVal *RV = Def->getValue(FieldName))
  return RV->getType();
return nullptr;
1788}

1790std::string DefInit::getAsString() const { return std::string(Def->getName()); }

1792static void ProfileVarDefInit(FoldingSetNodeID &ID,
                            Record *Class,
                            ArrayRef<Init *> Args) {
ID.AddInteger(Args.size());
ID.AddPointer(Class);

for (Init *I : Args)
  ID.AddPointer(I);
1800}

1802VarDefInit *VarDefInit::get(Record *Class, ArrayRef<Init *> Args) {
static FoldingSet<VarDefInit> ThePool;

FoldingSetNodeID ID;
ProfileVarDefInit(ID, Class, Args);

void *IP = nullptr;
if (VarDefInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Args.size()),
                               alignof(VarDefInit));
VarDefInit *I = new(Mem) VarDefInit(Class, Args.size());
std::uninitialized_copy(Args.begin(), Args.end(),
                        I->getTrailingObjects<Init *>());
ThePool.InsertNode(I, IP);
return I;
1819}

1821void VarDefInit::Profile(FoldingSetNodeID &ID) const {
ProfileVarDefInit(ID, Class, args());
1823}

1825DefInit *VarDefInit::instantiate() {
if (!Def) {
  RecordKeeper &Records = Class->getRecords();
  auto NewRecOwner = std::make_unique<Record>(Records.getNewAnonymousName(),
                                         Class->getLoc(), Records,
                                         /*IsAnonymous=*/true);
  Record *NewRec = NewRecOwner.get();

  // Copy values from class to instance
  for (const RecordVal &Val : Class->getValues())
    NewRec->addValue(Val);

  // Copy assertions from class to instance.
  NewRec->appendAssertions(Class);

  // Substitute and resolve template arguments
  ArrayRef<Init *> TArgs = Class->getTemplateArgs();
  MapResolver R(NewRec);

  for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
    if (i < args_size())
      R.set(TArgs[i], getArg(i));
    else
      R.set(TArgs[i], NewRec->getValue(TArgs[i])->getValue());

    NewRec->removeValue(TArgs[i]);
  }

  NewRec->resolveReferences(R);

  // Add superclasses.
  ArrayRef<std::pair<Record *, SMRange>> SCs = Class->getSuperClasses();
  for (const auto &SCPair : SCs)
    NewRec->addSuperClass(SCPair.first, SCPair.second);

  NewRec->addSuperClass(Class,
                        SMRange(Class->getLoc().back(),
                                Class->getLoc().back()));

  // Resolve internal references and store in record keeper
  NewRec->resolveReferences();
  Records.addDef(std::move(NewRecOwner));

  // Check the assertions.
  NewRec->checkRecordAssertions();

  Def = DefInit::get(NewRec);
}

return Def;
1875}

1877Init *VarDefInit::resolveReferences(Resolver &R) const {
TrackUnresolvedResolver UR(&R);
bool Changed = false;
SmallVector<Init *, 8> NewArgs;
NewArgs.reserve(args_size());

for (Init *Arg : args()) {
  Init *NewArg = Arg->resolveReferences(UR);
  NewArgs.push_back(NewArg);
  Changed |= NewArg != Arg;
}

if (Changed) {
  auto New = VarDefInit::get(Class, NewArgs);
  if (!UR.foundUnresolved())
    return New->instantiate();
  return New;
}
return const_cast<VarDefInit *>(this);
1896}

1898Init *VarDefInit::Fold() const {
if (Def)
  return Def;

TrackUnresolvedResolver R;
for (Init *Arg : args())
  Arg->resolveReferences(R);

if (!R.foundUnresolved())
  return const_cast<VarDefInit *>(this)->instantiate();
return const_cast<VarDefInit *>(this);
1909}

1911std::string VarDefInit::getAsString() const {
std::string Result = Class->getNameInitAsString() + "<";
const char *sep = "";
for (Init *Arg : args()) {
  Result += sep;
  sep = ", ";
  Result += Arg->getAsString();
}
return Result + ">";
1920}

1922FieldInit *FieldInit::get(Init *R, StringInit *FN) {
using Key = std::pair<Init *, StringInit *>;
static DenseMap<Key, FieldInit*> ThePool;

Key TheKey(std::make_pair(R, FN));

FieldInit *&I = ThePool[TheKey];
if (!I) I = new(Allocator) FieldInit(R, FN);
return I;
1931}

1933Init *FieldInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<FieldInit*>(this);
return VarBitInit::get(const_cast<FieldInit*>(this), Bit);
1937}

1939Init *FieldInit::resolveReferences(Resolver &R) const {
Init *NewRec = Rec->resolveReferences(R);
if (NewRec != Rec)
  return FieldInit::get(NewRec, FieldName)->Fold(R.getCurrentRecord());
return const_cast<FieldInit *>(this);
1944}

1946Init *FieldInit::Fold(Record *CurRec) const {
if (DefInit *DI = dyn_cast<DefInit>(Rec)) {
  Record *Def = DI->getDef();
  if (Def == CurRec)
    PrintFatalError(CurRec->getLoc(),
                    Twine("Attempting to access field '") +
                    FieldName->getAsUnquotedString() + "' of '" +
                    Rec->getAsString() + "' is a forbidden self-reference");
  Init *FieldVal = Def->getValue(FieldName)->getValue();
  if (FieldVal->isConcrete())
    return FieldVal;
}
return const_cast<FieldInit *>(this);
1959}

1961bool FieldInit::isConcrete() const {
if (DefInit *DI = dyn_cast<DefInit>(Rec)) {
  Init *FieldVal = DI->getDef()->getValue(FieldName)->getValue();
  return FieldVal->isConcrete();
}
return false;
1967}

1969static void ProfileCondOpInit(FoldingSetNodeID &ID,
                           ArrayRef<Init *> CondRange,
                           ArrayRef<Init *> ValRange,
                           const RecTy *ValType) {
assert(CondRange.size() == ValRange.size() &&((void)0)
       "Number of conditions and values must match!")((void)0);
ID.AddPointer(ValType);
ArrayRef<Init *>::iterator Case = CondRange.begin();
ArrayRef<Init *>::iterator Val = ValRange.begin();

while (Case != CondRange.end()) {
  ID.AddPointer(*Case++);
  ID.AddPointer(*Val++);
}
1983}

1985void CondOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileCondOpInit(ID,
    makeArrayRef(getTrailingObjects<Init *>(), NumConds),
    makeArrayRef(getTrailingObjects<Init *>() + NumConds, NumConds),
    ValType);
1990}

1992CondOpInit *
1993CondOpInit::get(ArrayRef<Init *> CondRange,
              ArrayRef<Init *> ValRange, RecTy *Ty) {
assert(CondRange.size() == ValRange.size() &&((void)0)
       "Number of conditions and values must match!")((void)0);

static FoldingSet<CondOpInit> ThePool;
FoldingSetNodeID ID;
ProfileCondOpInit(ID, CondRange, ValRange, Ty);

void *IP = nullptr;
if (CondOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(2*CondRange.size()),
                               alignof(BitsInit));
CondOpInit *I = new(Mem) CondOpInit(CondRange.size(), Ty);

std::uninitialized_copy(CondRange.begin(), CondRange.end(),
                        I->getTrailingObjects<Init *>());
std::uninitialized_copy(ValRange.begin(), ValRange.end(),
                        I->getTrailingObjects<Init *>()+CondRange.size());
ThePool.InsertNode(I, IP);
return I;
2016}

2018Init *CondOpInit::resolveReferences(Resolver &R) const {
SmallVector<Init*, 4> NewConds;
bool Changed = false;
for (const Init *Case : getConds()) {
  Init *NewCase = Case->resolveReferences(R);
  NewConds.push_back(NewCase);
  Changed |= NewCase != Case;
}

SmallVector<Init*, 4> NewVals;
for (const Init *Val : getVals()) {
  Init *NewVal = Val->resolveReferences(R);
  NewVals.push_back(NewVal);
  Changed |= NewVal != Val;
}

if (Changed)
  return (CondOpInit::get(NewConds, NewVals,
          getValType()))->Fold(R.getCurrentRecord());

return const_cast<CondOpInit *>(this);
2039}

2041Init *CondOpInit::Fold(Record *CurRec) const {
for ( unsigned i = 0; i < NumConds; ++i) {
  Init *Cond = getCond(i);
  Init *Val = getVal(i);

  if (IntInit *CondI = dyn_cast_or_null<IntInit>(
          Cond->convertInitializerTo(IntRecTy::get()))) {
    if (CondI->getValue())
      return Val->convertInitializerTo(getValType());
  } else
   return const_cast<CondOpInit *>(this);
}

PrintFatalError(CurRec->getLoc(),
                CurRec->getName() +
                " does not have any true condition in:" +
                this->getAsString());
return nullptr;
2059}

2061bool CondOpInit::isConcrete() const {
for (const Init *Case : getConds())
  if (!Case->isConcrete())
    return false;

for (const Init *Val : getVals())
  if (!Val->isConcrete())
    return false;

return true;
2071}

2073bool CondOpInit::isComplete() const {
for (const Init *Case : getConds())
  if (!Case->isComplete())
    return false;

for (const Init *Val : getVals())
  if (!Val->isConcrete())
    return false;

return true;
2083}

2085std::string CondOpInit::getAsString() const {
std::string Result = "!cond(";
for (unsigned i = 0; i < getNumConds(); i++) {
  Result += getCond(i)->getAsString() + ": ";
  Result += getVal(i)->getAsString();
  if (i != getNumConds()-1)
    Result += ", ";
}
return Result + ")";
2094}

2096Init *CondOpInit::getBit(unsigned Bit) const {
return VarBitInit::get(const_cast<CondOpInit *>(this), Bit);
2098}

2100static void ProfileDagInit(FoldingSetNodeID &ID, Init *V, StringInit *VN,
                         ArrayRef<Init *> ArgRange,
                         ArrayRef<StringInit *> NameRange) {
ID.AddPointer(V);
ID.AddPointer(VN);

ArrayRef<Init *>::iterator Arg = ArgRange.begin();
ArrayRef<StringInit *>::iterator Name = NameRange.begin();
while (Arg != ArgRange.end()) {
  assert(Name != NameRange.end() && "Arg name underflow!")((void)0);
  ID.AddPointer(*Arg++);
  ID.AddPointer(*Name++);
}
assert(Name == NameRange.end() && "Arg name overflow!")((void)0);
2114}

2116DagInit *
2117DagInit::get(Init *V, StringInit *VN, ArrayRef<Init *> ArgRange,
           ArrayRef<StringInit *> NameRange) {
static FoldingSet<DagInit> ThePool;

FoldingSetNodeID ID;
ProfileDagInit(ID, V, VN, ArgRange, NameRange);

void *IP = nullptr;
if (DagInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *, StringInit *>(ArgRange.size(), NameRange.size()), alignof(BitsInit));
DagInit *I = new(Mem) DagInit(V, VN, ArgRange.size(), NameRange.size());
std::uninitialized_copy(ArgRange.begin(), ArgRange.end(),
                        I->getTrailingObjects<Init *>());
std::uninitialized_copy(NameRange.begin(), NameRange.end(),
                        I->getTrailingObjects<StringInit *>());
ThePool.InsertNode(I, IP);
return I;
2136}

2138DagInit *
2139DagInit::get(Init *V, StringInit *VN,
           ArrayRef<std::pair<Init*, StringInit*>> args) {
SmallVector<Init *, 8> Args;
SmallVector<StringInit *, 8> Names;

for (const auto &Arg : args) {
  Args.push_back(Arg.first);
  Names.push_back(Arg.second);
}

return DagInit::get(V, VN, Args, Names);
2150}

2152void DagInit::Profile(FoldingSetNodeID &ID) const {
ProfileDagInit(ID, Val, ValName, makeArrayRef(getTrailingObjects<Init *>(), NumArgs), makeArrayRef(getTrailingObjects<StringInit *>(), NumArgNames));
2154}

2156Record *DagInit::getOperatorAsDef(ArrayRef<SMLoc> Loc) const {
if (DefInit *DefI = dyn_cast<DefInit>(Val))
  return DefI->getDef();
PrintFatalError(Loc, "Expected record as operator");
return nullptr;
2161}

2163Init *DagInit::resolveReferences(Resolver &R) const {
SmallVector<Init*, 8> NewArgs;
NewArgs.reserve(arg_size());
bool ArgsChanged = false;
for (const Init *Arg : getArgs()) {
  Init *NewArg = Arg->resolveReferences(R);
  NewArgs.push_back(NewArg);
  ArgsChanged |= NewArg != Arg;
}

Init *Op = Val->resolveReferences(R);
if (Op != Val || ArgsChanged)
  return DagInit::get(Op, ValName, NewArgs, getArgNames());

return const_cast<DagInit *>(this);
2178}

2180bool DagInit::isConcrete() const {
if (!Val->isConcrete())
  return false;
for (const Init *Elt : getArgs()) {
  if (!Elt->isConcrete())
    return false;
}
return true;
2188}

2190std::string DagInit::getAsString() const {
std::string Result = "(" + Val->getAsString();
if (ValName)
  Result += ":" + ValName->getAsUnquotedString();
if (!arg_empty()) {
  Result += " " + getArg(0)->getAsString();
  if (getArgName(0)) Result += ":$" + getArgName(0)->getAsUnquotedString();
  for (unsigned i = 1, e = getNumArgs(); i != e; ++i) {
    Result += ", " + getArg(i)->getAsString();
    if (getArgName(i)) Result += ":$" + getArgName(i)->getAsUnquotedString();
  }
}
return Result + ")";
2203}

2205//===----------------------------------------------------------------------===//
2206//    Other implementations
2207//===----------------------------------------------------------------------===//

2209RecordVal::RecordVal(Init *N, RecTy *T, FieldKind K)
  : Name(N), TyAndKind(T, K) {
setValue(UnsetInit::get());
assert(Value && "Cannot create unset value for current type!")((void)0);
2213}

2215// This constructor accepts the same arguments as the above, but also
2216// a source location.
2217RecordVal::RecordVal(Init *N, SMLoc Loc, RecTy *T, FieldKind K)
  : Name(N), Loc(Loc), TyAndKind(T, K) {
setValue(UnsetInit::get());
assert(Value && "Cannot create unset value for current type!")((void)0);
2221}

2223StringRef RecordVal::getName() const {
return cast<StringInit>(getNameInit())->getValue();
2225}

2227std::string RecordVal::getPrintType() const {
if (getType() == StringRecTy::get()) {
  if (auto *StrInit = dyn_cast<StringInit>(Value)) {
    if (StrInit->hasCodeFormat())
      return "code";
    else
      return "string";
  } else {
    return "string";
  }
} else {
  return TyAndKind.getPointer()->getAsString();
}
2240}

2242bool RecordVal::setValue(Init *V) {
if (V) {
  Value = V->getCastTo(getType());
  if (Value) {
    assert(!isa<TypedInit>(Value) ||((void)0)
           cast<TypedInit>(Value)->getType()->typeIsA(getType()))((void)0);
    if (BitsRecTy *BTy = dyn_cast<BitsRecTy>(getType())) {
      if (!isa<BitsInit>(Value)) {
        SmallVector<Init *, 64> Bits;
        Bits.reserve(BTy->getNumBits());
        for (unsigned I = 0, E = BTy->getNumBits(); I < E; ++I)
          Bits.push_back(Value->getBit(I));
        Value = BitsInit::get(Bits);
      }
    }
  }
  return Value == nullptr;
}
Value = nullptr;
return false;
2262}

2264// This version of setValue takes a source location and resets the
2265// location in the RecordVal.
2266bool RecordVal::setValue(Init *V, SMLoc NewLoc) {
Loc = NewLoc;
if (V) {
  Value = V->getCastTo(getType());
  if (Value) {
    assert(!isa<TypedInit>(Value) ||((void)0)
           cast<TypedInit>(Value)->getType()->typeIsA(getType()))((void)0);
    if (BitsRecTy *BTy = dyn_cast<BitsRecTy>(getType())) {
      if (!isa<BitsInit>(Value)) {
        SmallVector<Init *, 64> Bits;
        Bits.reserve(BTy->getNumBits());
        for (unsigned I = 0, E = BTy->getNumBits(); I < E; ++I)
          Bits.push_back(Value->getBit(I));
        Value = BitsInit::get(Bits);
      }
    }
  }
  return Value == nullptr;
}
Value = nullptr;
return false;
2287}

2289#include "llvm/TableGen/Record.h"
2290#if !defined(NDEBUG1) || defined(LLVM_ENABLE_DUMP)
2291LLVM_DUMP_METHOD__attribute__((noinline)) void RecordVal::dump() const { errs() << *this; }
2292#endif

2294void RecordVal::print(raw_ostream &OS, bool PrintSem) const {
if (isNonconcreteOK()) OS << "field ";
OS << getPrintType() << " " << getNameInitAsString();

if (getValue())
  OS << " = " << *getValue();

if (PrintSem) OS << ";\n";
2302}

2304unsigned Record::LastID = 0;

2306void Record::checkName() {
// Ensure the record name has string type.
const TypedInit *TypedName = cast<const TypedInit>(Name);
if (!isa<StringRecTy>(TypedName->getType()))
  PrintFatalError(getLoc(), Twine("Record name '") + Name->getAsString() +
                                "' is not a string!");
2312}

2314RecordRecTy *Record::getType() {
SmallVector<Record *, 4> DirectSCs;
getDirectSuperClasses(DirectSCs);
return RecordRecTy::get(DirectSCs);
2318}

2320DefInit *Record::getDefInit() {
if (!CorrespondingDefInit)
  CorrespondingDefInit = new (Allocator) DefInit(this);
return CorrespondingDefInit;
2324}

2326void Record::setName(Init *NewName) {
Name = NewName;
checkName();
// DO NOT resolve record values to the name at this point because
// there might be default values for arguments of this def.  Those
// arguments might not have been resolved yet so we don't want to
// prematurely assume values for those arguments were not passed to
// this def.
//
// Nonetheless, it may be that some of this Record's values
// reference the record name.  Indeed, the reason for having the
// record name be an Init is to provide this flexibility.  The extra
// resolve steps after completely instantiating defs takes care of
// this.  See TGParser::ParseDef and TGParser::ParseDefm.
2340}

2342// NOTE for the next two functions:
2343// Superclasses are in post-order, so the final one is a direct
2344// superclass. All of its transitive superclases immediately precede it,
2345// so we can step through the direct superclasses in reverse order.

2347bool Record::hasDirectSuperClass(const Record *Superclass) const {
ArrayRef<std::pair<Record *, SMRange>> SCs = getSuperClasses();

for (int I = SCs.size() - 1; I >= 0; --I) {
  const Record *SC = SCs[I].first;
  if (SC == Superclass)
    return true;
  I -= SC->getSuperClasses().size();
}

return false;
2358}

2360void Record::getDirectSuperClasses(SmallVectorImpl<Record *> &Classes) const {
ArrayRef<std::pair<Record *, SMRange>> SCs = getSuperClasses();

while (!SCs.empty()) {
  Record *SC = SCs.back().first;
  SCs = SCs.drop_back(1 + SC->getSuperClasses().size());
  Classes.push_back(SC);
}
2368}

2370void Record::resolveReferences(Resolver &R, const RecordVal *SkipVal) {
Init *OldName = getNameInit();
Init *NewName = Name->resolveReferences(R);
if (NewName != OldName) {
  // Re-register with RecordKeeper.
  setName(NewName);
}

// Resolve the field values.
for (RecordVal &Value : Values) {
  if (SkipVal == &Value) // Skip resolve the same field as the given one
    continue;
  if (Init *V = Value.getValue()) {
    Init *VR = V->resolveReferences(R);
    if (Value.setValue(VR)) {
      std::string Type;
      if (TypedInit *VRT = dyn_cast<TypedInit>(VR))
        Type =
            (Twine("of type '") + VRT->getType()->getAsString() + "' ").str();
      PrintFatalError(
          getLoc(),
          Twine("Invalid value ") + Type + "found when setting field '" +
              Value.getNameInitAsString() + "' of type '" +
              Value.getType()->getAsString() +
              "' after resolving references: " + VR->getAsUnquotedString() +
              "\n");
    }
  }
}

// Resolve the assertion expressions.
for (auto &Assertion : Assertions) {
  Init *Value = Assertion.Condition->resolveReferences(R);
  Assertion.Condition = Value;
  Value = Assertion.Message->resolveReferences(R);
  Assertion.Message = Value;
}
2407}

2409void Record::resolveReferences(Init *NewName) {
RecordResolver R(*this);
R.setName(NewName);
R.setFinal(true);
resolveReferences(R);
2414}

2416#if !defined(NDEBUG1) || defined(LLVM_ENABLE_DUMP)
2417LLVM_DUMP_METHOD__attribute__((noinline)) void Record::dump() const { errs() << *this; }
2418#endif

2420raw_ostream &llvm::operator<<(raw_ostream &OS, const Record &R) {
OS << R.getNameInitAsString();

ArrayRef<Init *> TArgs = R.getTemplateArgs();
if (!TArgs.empty()) {
  OS << "<";
  bool NeedComma = false;
  for (const Init *TA : TArgs) {
    if (NeedComma) OS << ", ";
    NeedComma = true;
    const RecordVal *RV = R.getValue(TA);
    assert(RV && "Template argument record not found??")((void)0);
    RV->print(OS, false);
  }
  OS << ">";
}

OS << " {";
ArrayRef<std::pair<Record *, SMRange>> SC = R.getSuperClasses();
if (!SC.empty()) {
  OS << "\t//";
  for (const auto &SuperPair : SC)
    OS << " " << SuperPair.first->getNameInitAsString();
}
OS << "\n";

for (const RecordVal &Val : R.getValues())
  if (Val.isNonconcreteOK() && !R.isTemplateArg(Val.getNameInit()))
    OS << Val;
for (const RecordVal &Val : R.getValues())
  if (!Val.isNonconcreteOK() && !R.isTemplateArg(Val.getNameInit()))
    OS << Val;

return OS << "}\n";
2454}

2456SMLoc Record::getFieldLoc(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R)
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");
return R->getLoc();
2462}

2464Init *Record::getValueInit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");
return R->getValue();
2470}

2472StringRef Record::getValueAsString(StringRef FieldName) const {
llvm::Optional<StringRef> S = getValueAsOptionalString(FieldName);
if (!S.hasValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");
return S.getValue();
2478}

2480llvm::Optional<StringRef>
2481Record::getValueAsOptionalString(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  return llvm::Optional<StringRef>();
if (isa<UnsetInit>(R->getValue()))
  return llvm::Optional<StringRef>();

if (StringInit *SI = dyn_cast<StringInit>(R->getValue()))
  return SI->getValue();

PrintFatalError(getLoc(),
                "Record `" + getName() + "', ` field `" + FieldName +
                    "' exists but does not have a string initializer!");
2494}

2496BitsInit *Record::getValueAsBitsInit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (BitsInit *BI = dyn_cast<BitsInit>(R->getValue()))
  return BI;
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" + FieldName + 
                              "' exists but does not have a bits value");
2506}

2508ListInit *Record::getValueAsListInit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (ListInit *LI = dyn_cast<ListInit>(R->getValue()))
  return LI;
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" + FieldName + 
                              "' exists but does not have a list value");
2518}

2520std::vector<Record*>
2521Record::getValueAsListOfDefs(StringRef FieldName) const {
ListInit *List = getValueAsListInit(FieldName);
std::vector<Record*> Defs;
for (Init *I : List->getValues()) {
  if (DefInit *DI = dyn_cast<DefInit>(I))
    Defs.push_back(DI->getDef());
  else
    PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
      FieldName + "' list is not entirely DefInit!");
}
return Defs;
2532}

2534int64_t Record::getValueAsInt(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (IntInit *II = dyn_cast<IntInit>(R->getValue()))
  return II->getValue();
PrintFatalError(getLoc(), Twine("Record `") + getName() + "', field `" +
                              FieldName +
                              "' exists but does not have an int value: " +
                              R->getValue()->getAsString());
2546}

2548std::vector<int64_t>
2549Record::getValueAsListOfInts(StringRef FieldName) const {
ListInit *List = getValueAsListInit(FieldName);
std::vector<int64_t> Ints;
for (Init *I : List->getValues()) {
  if (IntInit *II = dyn_cast<IntInit>(I))
    Ints.push_back(II->getValue());
  else
    PrintFatalError(getLoc(),
                    Twine("Record `") + getName() + "', field `" + FieldName +
                        "' exists but does not have a list of ints value: " +
                        I->getAsString());
}
return Ints;
2562}

2564std::vector<StringRef>
2565Record::getValueAsListOfStrings(StringRef FieldName) const {
ListInit *List = getValueAsListInit(FieldName);
std::vector<StringRef> Strings;
for (Init *I : List->getValues()) {
  if (StringInit *SI = dyn_cast<StringInit>(I))
    Strings.push_back(SI->getValue());
  else
    PrintFatalError(getLoc(),
                    Twine("Record `") + getName() + "', field `" + FieldName +
                        "' exists but does not have a list of strings value: " +
                        I->getAsString());
}
return Strings;
2578}

2580Record *Record::getValueAsDef(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (DefInit *DI = dyn_cast<DefInit>(R->getValue()))
  return DI->getDef();
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a def initializer!");
2590}

2592Record *Record::getValueAsOptionalDef(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (DefInit *DI = dyn_cast<DefInit>(R->getValue()))
  return DI->getDef();
if (isa<UnsetInit>(R->getValue()))
  return nullptr;
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have either a def initializer or '?'!");
2604}


2607bool Record::getValueAsBit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (BitInit *BI = dyn_cast<BitInit>(R->getValue()))
  return BI->getValue();
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a bit initializer!");
2617}

2619bool Record::getValueAsBitOrUnset(StringRef FieldName, bool &Unset) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName.str() + "'!\n");

if (isa<UnsetInit>(R->getValue())) {
  Unset = true;
  return false;
}
Unset = false;
if (BitInit *BI = dyn_cast<BitInit>(R->getValue()))
  return BI->getValue();
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a bit initializer!");
2634}

2636DagInit *Record::getValueAsDag(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (DagInit *DI = dyn_cast<DagInit>(R->getValue()))
  return DI;
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a dag initializer!");
2646}

2648// Check all record assertions: For each one, resolve the condition
2649// and message, then call CheckAssert().
2650// Note: The condition and message are probably already resolved,
2651//       but resolving again allows calls before records are resolved.
2652void Record::checkRecordAssertions() {
RecordResolver R(*this);
R.setFinal(true);

for (auto Assertion : getAssertions()) {
  Init *Condition = Assertion.Condition->resolveReferences(R);
  Init *Message = Assertion.Message->resolveReferences(R);
  CheckAssert(Assertion.Loc, Condition, Message);
}
2661}

2663#if !defined(NDEBUG1) || defined(LLVM_ENABLE_DUMP)
2664LLVM_DUMP_METHOD__attribute__((noinline)) void RecordKeeper::dump() const { errs() << *this; }
2665#endif

2667raw_ostream &llvm::operator<<(raw_ostream &OS, const RecordKeeper &RK) {
OS << "------------- Classes -----------------\n";
for (const auto &C : RK.getClasses())
  OS << "class " << *C.second;

OS << "------------- Defs -----------------\n";
for (const auto &D : RK.getDefs())
  OS << "def " << *D.second;
return OS;
2676}

2678/// GetNewAnonymousName - Generate a unique anonymous name that can be used as
2679/// an identifier.
2680Init *RecordKeeper::getNewAnonymousName() {
return AnonymousNameInit::get(AnonCounter++);
2682}

2684// These functions implement the phase timing facility. Starting a timer
2685// when one is already running stops the running one.

2687void RecordKeeper::startTimer(StringRef Name) {
if (TimingGroup) {
  if (LastTimer && LastTimer->isRunning()) {
    LastTimer->stopTimer();
    if (BackendTimer) {
      LastTimer->clear();
      BackendTimer = false;
    }
  }

  LastTimer = new Timer("", Name, *TimingGroup);
  LastTimer->startTimer();
}
2700}

2702void RecordKeeper::stopTimer() {
if (TimingGroup) {
  assert(LastTimer && "No phase timer was started")((void)0);
  LastTimer->stopTimer();
}
2707}

2709void RecordKeeper::startBackendTimer(StringRef Name) {
if (TimingGroup) {
  startTimer(Name);
  BackendTimer = true;
}
2714}

2716void RecordKeeper::stopBackendTimer() {
if (TimingGroup) {
  if (BackendTimer) {
    stopTimer();
    BackendTimer = false;
  }
}
2723}

2725// We cache the record vectors for single classes. Many backends request
2726// the same vectors multiple times.
2727std::vector<Record *> RecordKeeper::getAllDerivedDefinitions(
  StringRef ClassName) const {

auto Pair = ClassRecordsMap.try_emplace(ClassName);
if (Pair.second)
  Pair.first->second = getAllDerivedDefinitions(makeArrayRef(ClassName));

return Pair.first->second;
2735}

2737std::vector<Record *> RecordKeeper::getAllDerivedDefinitions(
  ArrayRef<StringRef> ClassNames) const {
SmallVector<Record *, 2> ClassRecs;
std::vector<Record *> Defs;

assert(ClassNames.size() > 0 && "At least one class must be passed.")((void)0);
for (const auto &ClassName : ClassNames) {
  Record *Class = getClass(ClassName);
  if (!Class)
    PrintFatalError("The class '" + ClassName + "' is not defined\n");
  ClassRecs.push_back(Class);
}

for (const auto &OneDef : getDefs()) {
  if (all_of(ClassRecs, [&OneDef](const Record *Class) {
                          return OneDef.second->isSubClassOf(Class);
                        }))
    Defs.push_back(OneDef.second.get());
}

return Defs;
2758}

2760Init *MapResolver::resolve(Init *VarName) {
auto It = Map.find(VarName);
if (It == Map.end())
  return nullptr;

Init *I = It->second.V;

if (!It->second.Resolved && Map.size() > 1) {
  // Resolve mutual references among the mapped variables, but prevent
  // infinite recursion.
  Map.erase(It);
  I = I->resolveReferences(*this);
  Map[VarName] = {I, true};
}

return I;
2776}

2778Init *RecordResolver::resolve(Init *VarName) {
Init *Val = Cache.lookup(VarName);
if (Val)
  return Val;

if (llvm::is_contained(Stack, VarName))
  return nullptr; // prevent infinite recursion

if (RecordVal *RV = getCurrentRecord()->getValue(VarName)) {
  if (!isa<UnsetInit>(RV->getValue())) {
    Val = RV->getValue();
    Stack.push_back(VarName);
    Val = Val->resolveReferences(*this);
    Stack.pop_back();
  }
} else if (Name && VarName == getCurrentRecord()->getNameInit()) {
  Stack.push_back(VarName);
  Val = Name->resolveReferences(*this);
  Stack.pop_back();
}

Cache[VarName] = Val;
return Val;
2801}

2803Init *TrackUnresolvedResolver::resolve(Init *VarName) {
Init *I = nullptr;

if (R) {
  I = R->resolve(VarName);
  if (I && !FoundUnresolved) {
    // Do not recurse into the resolved initializer, as that would change
    // the behavior of the resolver we're delegating, but do check to see
    // if there are unresolved variables remaining.
    TrackUnresolvedResolver Sub;
    I->resolveReferences(Sub);
    FoundUnresolved |= Sub.FoundUnresolved;
  }
}

if (!I)
  FoundUnresolved = true;
return I;
2821}

2823Init *HasReferenceResolver::resolve(Init *VarName)
2824{
if (VarName == VarNameToTrack)
  Found = true;
return nullptr;
2828}