|  | //===- Record.cpp - Record implementation ---------------------------------===// | 
|  | // | 
|  | //                     The LLVM Compiler Infrastructure | 
|  | // | 
|  | // This file is distributed under the University of Illinois Open Source | 
|  | // License. See LICENSE.TXT for details. | 
|  | // | 
|  | //===----------------------------------------------------------------------===// | 
|  | // | 
|  | // Implement the tablegen record classes. | 
|  | // | 
|  | //===----------------------------------------------------------------------===// | 
|  |  | 
|  | #include "llvm/ADT/ArrayRef.h" | 
|  | #include "llvm/ADT/DenseMap.h" | 
|  | #include "llvm/ADT/FoldingSet.h" | 
|  | #include "llvm/ADT/SmallString.h" | 
|  | #include "llvm/ADT/SmallVector.h" | 
|  | #include "llvm/ADT/StringExtras.h" | 
|  | #include "llvm/ADT/StringMap.h" | 
|  | #include "llvm/ADT/StringRef.h" | 
|  | #include "llvm/Support/Allocator.h" | 
|  | #include "llvm/Support/Casting.h" | 
|  | #include "llvm/Support/Compiler.h" | 
|  | #include "llvm/Support/ErrorHandling.h" | 
|  | #include "llvm/Support/SMLoc.h" | 
|  | #include "llvm/Support/raw_ostream.h" | 
|  | #include "llvm/TableGen/Error.h" | 
|  | #include "llvm/TableGen/Record.h" | 
|  | #include <cassert> | 
|  | #include <cstdint> | 
|  | #include <memory> | 
|  | #include <string> | 
|  | #include <utility> | 
|  | #include <vector> | 
|  |  | 
|  | using namespace llvm; | 
|  |  | 
|  | static BumpPtrAllocator Allocator; | 
|  |  | 
|  | //===----------------------------------------------------------------------===// | 
|  | //    Type implementations | 
|  | //===----------------------------------------------------------------------===// | 
|  |  | 
|  | BitRecTy BitRecTy::Shared; | 
|  | CodeRecTy CodeRecTy::Shared; | 
|  | IntRecTy IntRecTy::Shared; | 
|  | StringRecTy StringRecTy::Shared; | 
|  | DagRecTy DagRecTy::Shared; | 
|  |  | 
|  | #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) | 
|  | LLVM_DUMP_METHOD void RecTy::dump() const { print(errs()); } | 
|  | #endif | 
|  |  | 
|  | ListRecTy *RecTy::getListTy() { | 
|  | if (!ListTy) | 
|  | ListTy = new(Allocator) ListRecTy(this); | 
|  | return ListTy; | 
|  | } | 
|  |  | 
|  | bool RecTy::typeIsConvertibleTo(const RecTy *RHS) const { | 
|  | assert(RHS && "NULL pointer"); | 
|  | return Kind == RHS->getRecTyKind(); | 
|  | } | 
|  |  | 
|  | bool 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; | 
|  | } | 
|  |  | 
|  | BitsRecTy *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; | 
|  | } | 
|  |  | 
|  | std::string BitsRecTy::getAsString() const { | 
|  | return "bits<" + utostr(Size) + ">"; | 
|  | } | 
|  |  | 
|  | bool 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); | 
|  | } | 
|  |  | 
|  | bool IntRecTy::typeIsConvertibleTo(const RecTy *RHS) const { | 
|  | RecTyKind kind = RHS->getRecTyKind(); | 
|  | return kind==BitRecTyKind || kind==BitsRecTyKind || kind==IntRecTyKind; | 
|  | } | 
|  |  | 
|  | std::string StringRecTy::getAsString() const { | 
|  | return "string"; | 
|  | } | 
|  |  | 
|  | std::string ListRecTy::getAsString() const { | 
|  | return "list<" + Ty->getAsString() + ">"; | 
|  | } | 
|  |  | 
|  | bool ListRecTy::typeIsConvertibleTo(const RecTy *RHS) const { | 
|  | if (const auto *ListTy = dyn_cast<ListRecTy>(RHS)) | 
|  | return Ty->typeIsConvertibleTo(ListTy->getElementType()); | 
|  | return false; | 
|  | } | 
|  |  | 
|  | std::string DagRecTy::getAsString() const { | 
|  | return "dag"; | 
|  | } | 
|  |  | 
|  | RecordRecTy *RecordRecTy::get(Record *R) { | 
|  | return dyn_cast<RecordRecTy>(R->getDefInit()->getType()); | 
|  | } | 
|  |  | 
|  | std::string RecordRecTy::getAsString() const { | 
|  | return Rec->getName(); | 
|  | } | 
|  |  | 
|  | bool RecordRecTy::typeIsConvertibleTo(const RecTy *RHS) const { | 
|  | const RecordRecTy *RTy = dyn_cast<RecordRecTy>(RHS); | 
|  | if (!RTy) | 
|  | return false; | 
|  |  | 
|  | if (RTy->getRecord() == Rec || Rec->isSubClassOf(RTy->getRecord())) | 
|  | return true; | 
|  |  | 
|  | for (const auto &SCPair : RTy->getRecord()->getSuperClasses()) | 
|  | if (Rec->isSubClassOf(SCPair.first)) | 
|  | return true; | 
|  |  | 
|  | return false; | 
|  | } | 
|  |  | 
|  | RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) { | 
|  | if (T1->typeIsConvertibleTo(T2)) | 
|  | return T2; | 
|  | if (T2->typeIsConvertibleTo(T1)) | 
|  | return T1; | 
|  |  | 
|  | // If one is a Record type, check superclasses | 
|  | if (RecordRecTy *RecTy1 = dyn_cast<RecordRecTy>(T1)) { | 
|  | // See if T2 inherits from a type T1 also inherits from | 
|  | for (const auto &SuperPair1 : RecTy1->getRecord()->getSuperClasses()) { | 
|  | RecordRecTy *SuperRecTy1 = RecordRecTy::get(SuperPair1.first); | 
|  | RecTy *NewType1 = resolveTypes(SuperRecTy1, T2); | 
|  | if (NewType1) | 
|  | return NewType1; | 
|  | } | 
|  | } | 
|  | if (RecordRecTy *RecTy2 = dyn_cast<RecordRecTy>(T2)) { | 
|  | // See if T1 inherits from a type T2 also inherits from | 
|  | for (const auto &SuperPair2 : RecTy2->getRecord()->getSuperClasses()) { | 
|  | RecordRecTy *SuperRecTy2 = RecordRecTy::get(SuperPair2.first); | 
|  | RecTy *NewType2 = resolveTypes(T1, SuperRecTy2); | 
|  | if (NewType2) | 
|  | return NewType2; | 
|  | } | 
|  | } | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | //===----------------------------------------------------------------------===// | 
|  | //    Initializer implementations | 
|  | //===----------------------------------------------------------------------===// | 
|  |  | 
|  | void Init::anchor() {} | 
|  |  | 
|  | #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) | 
|  | LLVM_DUMP_METHOD void Init::dump() const { return print(errs()); } | 
|  | #endif | 
|  |  | 
|  | UnsetInit *UnsetInit::get() { | 
|  | static UnsetInit TheInit; | 
|  | return &TheInit; | 
|  | } | 
|  |  | 
|  | Init *UnsetInit::convertInitializerTo(RecTy *Ty) const { | 
|  | if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) { | 
|  | SmallVector<Init *, 16> NewBits(BRT->getNumBits()); | 
|  |  | 
|  | for (unsigned i = 0; i != BRT->getNumBits(); ++i) | 
|  | NewBits[i] = UnsetInit::get(); | 
|  |  | 
|  | return BitsInit::get(NewBits); | 
|  | } | 
|  |  | 
|  | // All other types can just be returned. | 
|  | return const_cast<UnsetInit *>(this); | 
|  | } | 
|  |  | 
|  | BitInit *BitInit::get(bool V) { | 
|  | static BitInit True(true); | 
|  | static BitInit False(false); | 
|  |  | 
|  | return V ? &True : &False; | 
|  | } | 
|  |  | 
|  | Init *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; | 
|  | } | 
|  |  | 
|  | static void | 
|  | ProfileBitsInit(FoldingSetNodeID &ID, ArrayRef<Init *> Range) { | 
|  | ID.AddInteger(Range.size()); | 
|  |  | 
|  | for (Init *I : Range) | 
|  | ID.AddPointer(I); | 
|  | } | 
|  |  | 
|  | BitsInit *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; | 
|  | } | 
|  |  | 
|  | void BitsInit::Profile(FoldingSetNodeID &ID) const { | 
|  | ProfileBitsInit(ID, makeArrayRef(getTrailingObjects<Init *>(), NumBits)); | 
|  | } | 
|  |  | 
|  | Init *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; | 
|  | } | 
|  |  | 
|  | Init * | 
|  | BitsInit::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); | 
|  | } | 
|  |  | 
|  | std::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 + " }"; | 
|  | } | 
|  |  | 
|  | // Fix bit initializer to preserve the behavior that bit reference from a unset | 
|  | // bits initializer will resolve into VarBitInit to keep the field name and bit | 
|  | // number used in targets with fixed insn length. | 
|  | static Init *fixBitInit(const RecordVal *RV, Init *Before, Init *After) { | 
|  | if (RV || !isa<UnsetInit>(After)) | 
|  | return After; | 
|  | return Before; | 
|  | } | 
|  |  | 
|  | // resolveReferences - If there are any field references that refer to fields | 
|  | // that have been filled in, we can propagate the values now. | 
|  | Init *BitsInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | bool Changed = false; | 
|  | SmallVector<Init *, 16> NewBits(getNumBits()); | 
|  |  | 
|  | Init *CachedInit = nullptr; | 
|  | Init *CachedBitVar = nullptr; | 
|  | bool CachedBitVarChanged = false; | 
|  |  | 
|  | for (unsigned i = 0, e = getNumBits(); i != e; ++i) { | 
|  | Init *CurBit = getBit(i); | 
|  | Init *CurBitVar = CurBit->getBitVar(); | 
|  |  | 
|  | NewBits[i] = CurBit; | 
|  |  | 
|  | if (CurBitVar == CachedBitVar) { | 
|  | if (CachedBitVarChanged) { | 
|  | Init *Bit = CachedInit->getBit(CurBit->getBitNum()); | 
|  | NewBits[i] = fixBitInit(RV, CurBit, Bit); | 
|  | } | 
|  | continue; | 
|  | } | 
|  | CachedBitVar = CurBitVar; | 
|  | CachedBitVarChanged = false; | 
|  |  | 
|  | Init *B; | 
|  | do { | 
|  | B = CurBitVar; | 
|  | CurBitVar = CurBitVar->resolveReferences(R, RV); | 
|  | CachedBitVarChanged |= B != CurBitVar; | 
|  | Changed |= B != CurBitVar; | 
|  | } while (B != CurBitVar); | 
|  | CachedInit = CurBitVar; | 
|  |  | 
|  | if (CachedBitVarChanged) { | 
|  | Init *Bit = CurBitVar->getBit(CurBit->getBitNum()); | 
|  | NewBits[i] = fixBitInit(RV, CurBit, Bit); | 
|  | } | 
|  | } | 
|  |  | 
|  | if (Changed) | 
|  | return BitsInit::get(NewBits); | 
|  |  | 
|  | return const_cast<BitsInit *>(this); | 
|  | } | 
|  |  | 
|  | IntInit *IntInit::get(int64_t V) { | 
|  | static DenseMap<int64_t, IntInit*> ThePool; | 
|  |  | 
|  | IntInit *&I = ThePool[V]; | 
|  | if (!I) I = new(Allocator) IntInit(V); | 
|  | return I; | 
|  | } | 
|  |  | 
|  | std::string IntInit::getAsString() const { | 
|  | return itostr(Value); | 
|  | } | 
|  |  | 
|  | static 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); | 
|  | } | 
|  |  | 
|  | Init *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 & (1LL << i)); | 
|  |  | 
|  | return BitsInit::get(NewBits); | 
|  | } | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init * | 
|  | IntInit::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) << Bits[i])); | 
|  | } | 
|  | return BitsInit::get(NewBits); | 
|  | } | 
|  |  | 
|  | CodeInit *CodeInit::get(StringRef V) { | 
|  | static StringMap<CodeInit*, BumpPtrAllocator &> ThePool(Allocator); | 
|  |  | 
|  | auto &Entry = *ThePool.insert(std::make_pair(V, nullptr)).first; | 
|  | if (!Entry.second) | 
|  | Entry.second = new(Allocator) CodeInit(Entry.getKey()); | 
|  | return Entry.second; | 
|  | } | 
|  |  | 
|  | StringInit *StringInit::get(StringRef V) { | 
|  | static StringMap<StringInit*, BumpPtrAllocator &> ThePool(Allocator); | 
|  |  | 
|  | auto &Entry = *ThePool.insert(std::make_pair(V, nullptr)).first; | 
|  | if (!Entry.second) | 
|  | Entry.second = new(Allocator) StringInit(Entry.getKey()); | 
|  | return Entry.second; | 
|  | } | 
|  |  | 
|  | Init *StringInit::convertInitializerTo(RecTy *Ty) const { | 
|  | if (isa<StringRecTy>(Ty)) | 
|  | return const_cast<StringInit *>(this); | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *CodeInit::convertInitializerTo(RecTy *Ty) const { | 
|  | if (isa<CodeRecTy>(Ty)) | 
|  | return const_cast<CodeInit *>(this); | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | static void ProfileListInit(FoldingSetNodeID &ID, | 
|  | ArrayRef<Init *> Range, | 
|  | RecTy *EltTy) { | 
|  | ID.AddInteger(Range.size()); | 
|  | ID.AddPointer(EltTy); | 
|  |  | 
|  | for (Init *I : Range) | 
|  | ID.AddPointer(I); | 
|  | } | 
|  |  | 
|  | ListInit *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; | 
|  |  | 
|  | 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; | 
|  | } | 
|  |  | 
|  | void ListInit::Profile(FoldingSetNodeID &ID) const { | 
|  | RecTy *EltTy = cast<ListRecTy>(getType())->getElementType(); | 
|  |  | 
|  | ProfileListInit(ID, getValues(), EltTy); | 
|  | } | 
|  |  | 
|  | Init *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, Ty); | 
|  | } | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *ListInit::convertInitListSlice(ArrayRef<unsigned> Elements) const { | 
|  | 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, getType()); | 
|  | } | 
|  |  | 
|  | Record *ListInit::getElementAsRecord(unsigned i) const { | 
|  | assert(i < NumValues && "List element index out of range!"); | 
|  | DefInit *DI = dyn_cast<DefInit>(getElement(i)); | 
|  | if (!DI) | 
|  | PrintFatalError("Expected record in list!"); | 
|  | return DI->getDef(); | 
|  | } | 
|  |  | 
|  | Init *ListInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | SmallVector<Init*, 8> Resolved; | 
|  | Resolved.reserve(size()); | 
|  | bool Changed = false; | 
|  |  | 
|  | for (Init *CurElt : getValues()) { | 
|  | Init *E; | 
|  |  | 
|  | do { | 
|  | E = CurElt; | 
|  | CurElt = CurElt->resolveReferences(R, RV); | 
|  | Changed |= E != CurElt; | 
|  | } while (E != CurElt); | 
|  | Resolved.push_back(E); | 
|  | } | 
|  |  | 
|  | if (Changed) | 
|  | return ListInit::get(Resolved, getType()); | 
|  | return const_cast<ListInit *>(this); | 
|  | } | 
|  |  | 
|  | Init *ListInit::resolveListElementReference(Record &R, const RecordVal *IRV, | 
|  | unsigned Elt) const { | 
|  | if (Elt >= size()) | 
|  | return nullptr;  // Out of range reference. | 
|  | Init *E = getElement(Elt); | 
|  | // If the element is set to some value, or if we are resolving a reference | 
|  | // to a specific variable and that variable is explicitly unset, then | 
|  | // replace the VarListElementInit with it. | 
|  | if (IRV || !isa<UnsetInit>(E)) | 
|  | return E; | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | std::string ListInit::getAsString() const { | 
|  | std::string Result = "["; | 
|  | const char *sep = ""; | 
|  | for (Init *Element : *this) { | 
|  | Result += sep; | 
|  | sep = ", "; | 
|  | Result += Element->getAsString(); | 
|  | } | 
|  | return Result + "]"; | 
|  | } | 
|  |  | 
|  | Init *OpInit::resolveListElementReference(Record &R, const RecordVal *IRV, | 
|  | unsigned Elt) const { | 
|  | Init *Resolved = resolveReferences(R, IRV); | 
|  | OpInit *OResolved = dyn_cast<OpInit>(Resolved); | 
|  | if (OResolved) { | 
|  | Resolved = OResolved->Fold(&R, nullptr); | 
|  | } | 
|  |  | 
|  | if (Resolved != this) { | 
|  | TypedInit *Typed = cast<TypedInit>(Resolved); | 
|  | if (Init *New = Typed->resolveListElementReference(R, IRV, Elt)) | 
|  | return New; | 
|  | return VarListElementInit::get(Typed, Elt); | 
|  | } | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *OpInit::getBit(unsigned Bit) const { | 
|  | if (getType() == BitRecTy::get()) | 
|  | return const_cast<OpInit*>(this); | 
|  | return VarBitInit::get(const_cast<OpInit*>(this), Bit); | 
|  | } | 
|  |  | 
|  | static void | 
|  | ProfileUnOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *Op, RecTy *Type) { | 
|  | ID.AddInteger(Opcode); | 
|  | ID.AddPointer(Op); | 
|  | ID.AddPointer(Type); | 
|  | } | 
|  |  | 
|  | UnOpInit *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; | 
|  | } | 
|  |  | 
|  | void UnOpInit::Profile(FoldingSetNodeID &ID) const { | 
|  | ProfileUnOpInit(ID, getOpcode(), getOperand(), getType()); | 
|  | } | 
|  |  | 
|  | Init *UnOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { | 
|  | switch (getOpcode()) { | 
|  | 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<IntInit>(LHS)) | 
|  | return StringInit::get(LHSi->getAsString()); | 
|  | } else { | 
|  | if (StringInit *Name = dyn_cast<StringInit>(LHS)) { | 
|  | // From TGParser::ParseIDValue | 
|  | if (CurRec) { | 
|  | if (const RecordVal *RV = CurRec->getValue(Name)) { | 
|  | if (RV->getType() != getType()) | 
|  | PrintFatalError("type mismatch in cast"); | 
|  | return VarInit::get(Name, RV->getType()); | 
|  | } | 
|  |  | 
|  | Init *TemplateArgName = QualifyName(*CurRec, CurMultiClass, Name, | 
|  | ":"); | 
|  |  | 
|  | if (CurRec->isTemplateArg(TemplateArgName)) { | 
|  | const RecordVal *RV = CurRec->getValue(TemplateArgName); | 
|  | assert(RV && "Template arg doesn't exist??"); | 
|  |  | 
|  | if (RV->getType() != getType()) | 
|  | PrintFatalError("type mismatch in cast"); | 
|  |  | 
|  | return VarInit::get(TemplateArgName, RV->getType()); | 
|  | } | 
|  | } | 
|  |  | 
|  | if (CurMultiClass) { | 
|  | Init *MCName = QualifyName(CurMultiClass->Rec, CurMultiClass, Name, | 
|  | "::"); | 
|  |  | 
|  | if (CurMultiClass->Rec.isTemplateArg(MCName)) { | 
|  | const RecordVal *RV = CurMultiClass->Rec.getValue(MCName); | 
|  | assert(RV && "Template arg doesn't exist??"); | 
|  |  | 
|  | if (RV->getType() != getType()) | 
|  | PrintFatalError("type mismatch in cast"); | 
|  |  | 
|  | return VarInit::get(MCName, RV->getType()); | 
|  | } | 
|  | } | 
|  | assert(CurRec && "NULL pointer"); | 
|  | if (Record *D = (CurRec->getRecords()).getDef(Name->getValue())) | 
|  | return DefInit::get(D); | 
|  |  | 
|  | PrintFatalError(CurRec->getLoc(), | 
|  | "Undefined reference:'" + Name->getValue() + "'\n"); | 
|  | } | 
|  |  | 
|  | if (isa<IntRecTy>(getType())) { | 
|  | if (BitsInit *BI = dyn_cast<BitsInit>(LHS)) { | 
|  | if (Init *NewInit = BI->convertInitializerTo(IntRecTy::get())) | 
|  | return NewInit; | 
|  | break; | 
|  | } | 
|  | } | 
|  | } | 
|  | break; | 
|  |  | 
|  | case HEAD: | 
|  | if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) { | 
|  | assert(!LHSl->empty() && "Empty list in head"); | 
|  | return LHSl->getElement(0); | 
|  | } | 
|  | break; | 
|  |  | 
|  | case TAIL: | 
|  | if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) { | 
|  | assert(!LHSl->empty() && "Empty list in tail"); | 
|  | // Note the +1.  We can't just pass the result of getValues() | 
|  | // directly. | 
|  | return ListInit::get(LHSl->getValues().slice(1), LHSl->getType()); | 
|  | } | 
|  | break; | 
|  |  | 
|  | case EMPTY: | 
|  | if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) | 
|  | return IntInit::get(LHSl->empty()); | 
|  | if (StringInit *LHSs = dyn_cast<StringInit>(LHS)) | 
|  | return IntInit::get(LHSs->getValue().empty()); | 
|  | break; | 
|  | } | 
|  | return const_cast<UnOpInit *>(this); | 
|  | } | 
|  |  | 
|  | Init *UnOpInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | Init *lhs = LHS->resolveReferences(R, RV); | 
|  |  | 
|  | if (LHS != lhs) | 
|  | return (UnOpInit::get(getOpcode(), lhs, getType()))->Fold(&R, nullptr); | 
|  | return Fold(&R, nullptr); | 
|  | } | 
|  |  | 
|  | std::string UnOpInit::getAsString() const { | 
|  | std::string Result; | 
|  | switch (getOpcode()) { | 
|  | case CAST: Result = "!cast<" + getType()->getAsString() + ">"; break; | 
|  | case HEAD: Result = "!head"; break; | 
|  | case TAIL: Result = "!tail"; break; | 
|  | case EMPTY: Result = "!empty"; break; | 
|  | } | 
|  | return Result + "(" + LHS->getAsString() + ")"; | 
|  | } | 
|  |  | 
|  | static void | 
|  | ProfileBinOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *LHS, Init *RHS, | 
|  | RecTy *Type) { | 
|  | ID.AddInteger(Opcode); | 
|  | ID.AddPointer(LHS); | 
|  | ID.AddPointer(RHS); | 
|  | ID.AddPointer(Type); | 
|  | } | 
|  |  | 
|  | BinOpInit *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; | 
|  | } | 
|  |  | 
|  | void BinOpInit::Profile(FoldingSetNodeID &ID) const { | 
|  | ProfileBinOpInit(ID, getOpcode(), getLHS(), getRHS(), getType()); | 
|  | } | 
|  |  | 
|  | static StringInit *ConcatStringInits(const StringInit *I0, | 
|  | const StringInit *I1) { | 
|  | SmallString<80> Concat(I0->getValue()); | 
|  | Concat.append(I1->getValue()); | 
|  | return StringInit::get(Concat); | 
|  | } | 
|  |  | 
|  | Init *BinOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) 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 || !ROp || LOp->getDef() != ROp->getDef()) | 
|  | PrintFatalError("Concated Dag operators do not match!"); | 
|  | 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(LHSs->getOperator(), 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; | 
|  | Args.insert(Args.end(), LHSs->begin(), LHSs->end()); | 
|  | Args.insert(Args.end(), RHSs->begin(), RHSs->end()); | 
|  | return ListInit::get( | 
|  | Args, cast<ListRecTy>(LHSs->getType())->getElementType()); | 
|  | } | 
|  | break; | 
|  | } | 
|  | case STRCONCAT: { | 
|  | StringInit *LHSs = dyn_cast<StringInit>(LHS); | 
|  | StringInit *RHSs = dyn_cast<StringInit>(RHS); | 
|  | if (LHSs && RHSs) | 
|  | return ConcatStringInits(LHSs, RHSs); | 
|  | break; | 
|  | } | 
|  | case EQ: { | 
|  | // try to fold eq comparison for 'bit' and 'int', otherwise fallback | 
|  | // to string objects. | 
|  | IntInit *L = | 
|  | dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get())); | 
|  | IntInit *R = | 
|  | dyn_cast_or_null<IntInit>(RHS->convertInitializerTo(IntRecTy::get())); | 
|  |  | 
|  | if (L && R) | 
|  | return IntInit::get(L->getValue() == R->getValue()); | 
|  |  | 
|  | StringInit *LHSs = dyn_cast<StringInit>(LHS); | 
|  | StringInit *RHSs = dyn_cast<StringInit>(RHS); | 
|  |  | 
|  | // Make sure we've resolved | 
|  | if (LHSs && RHSs) | 
|  | return IntInit::get(LHSs->getValue() == RHSs->getValue()); | 
|  |  | 
|  | break; | 
|  | } | 
|  | case ADD: | 
|  | case AND: | 
|  | case OR: | 
|  | 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!"); | 
|  | case ADD: Result = LHSv +  RHSv; break; | 
|  | case AND: Result = LHSv &  RHSv; break; | 
|  | case OR: Result = LHSv | RHSv; break; | 
|  | case SHL: Result = LHSv << 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); | 
|  | } | 
|  |  | 
|  | Init *BinOpInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | Init *lhs = LHS->resolveReferences(R, RV); | 
|  | Init *rhs = RHS->resolveReferences(R, RV); | 
|  |  | 
|  | if (LHS != lhs || RHS != rhs) | 
|  | return (BinOpInit::get(getOpcode(), lhs, rhs, getType()))->Fold(&R,nullptr); | 
|  | return Fold(&R, nullptr); | 
|  | } | 
|  |  | 
|  | std::string BinOpInit::getAsString() const { | 
|  | std::string Result; | 
|  | switch (getOpcode()) { | 
|  | case CONCAT: Result = "!con"; break; | 
|  | case ADD: Result = "!add"; break; | 
|  | case AND: Result = "!and"; break; | 
|  | case OR: Result = "!or"; break; | 
|  | case SHL: Result = "!shl"; break; | 
|  | case SRA: Result = "!sra"; break; | 
|  | case SRL: Result = "!srl"; break; | 
|  | case EQ: Result = "!eq"; break; | 
|  | case LISTCONCAT: Result = "!listconcat"; break; | 
|  | case STRCONCAT: Result = "!strconcat"; break; | 
|  | } | 
|  | return Result + "(" + LHS->getAsString() + ", " + RHS->getAsString() + ")"; | 
|  | } | 
|  |  | 
|  | static void | 
|  | ProfileTernOpInit(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); | 
|  | } | 
|  |  | 
|  | TernOpInit *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; | 
|  | } | 
|  |  | 
|  | void TernOpInit::Profile(FoldingSetNodeID &ID) const { | 
|  | ProfileTernOpInit(ID, getOpcode(), getLHS(), getMHS(), getRHS(), getType()); | 
|  | } | 
|  |  | 
|  | static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type, | 
|  | Record *CurRec, MultiClass *CurMultiClass); | 
|  |  | 
|  | static Init *EvaluateOperation(OpInit *RHSo, Init *LHS, Init *Arg, | 
|  | RecTy *Type, Record *CurRec, | 
|  | MultiClass *CurMultiClass) { | 
|  | // If this is a dag, recurse | 
|  | if (auto *TArg = dyn_cast<TypedInit>(Arg)) | 
|  | if (isa<DagRecTy>(TArg->getType())) | 
|  | return ForeachHelper(LHS, Arg, RHSo, Type, CurRec, CurMultiClass); | 
|  |  | 
|  | SmallVector<Init *, 8> NewOperands; | 
|  | NewOperands.reserve(RHSo->getNumOperands()); | 
|  | for (unsigned i = 0, e = RHSo->getNumOperands(); i < e; ++i) { | 
|  | if (auto *RHSoo = dyn_cast<OpInit>(RHSo->getOperand(i))) { | 
|  | if (Init *Result = EvaluateOperation(RHSoo, LHS, Arg, | 
|  | Type, CurRec, CurMultiClass)) | 
|  | NewOperands.push_back(Result); | 
|  | else | 
|  | NewOperands.push_back(Arg); | 
|  | } else if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) { | 
|  | NewOperands.push_back(Arg); | 
|  | } else { | 
|  | NewOperands.push_back(RHSo->getOperand(i)); | 
|  | } | 
|  | } | 
|  |  | 
|  | // Now run the operator and use its result as the new leaf | 
|  | const OpInit *NewOp = RHSo->clone(NewOperands); | 
|  | Init *NewVal = NewOp->Fold(CurRec, CurMultiClass); | 
|  | return (NewVal != NewOp) ? NewVal : nullptr; | 
|  | } | 
|  |  | 
|  | static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type, | 
|  | Record *CurRec, MultiClass *CurMultiClass) { | 
|  | OpInit *RHSo = dyn_cast<OpInit>(RHS); | 
|  |  | 
|  | if (!RHSo) | 
|  | PrintFatalError(CurRec->getLoc(), "!foreach requires an operator\n"); | 
|  |  | 
|  | TypedInit *LHSt = dyn_cast<TypedInit>(LHS); | 
|  |  | 
|  | if (!LHSt) | 
|  | PrintFatalError(CurRec->getLoc(), "!foreach requires typed variable\n"); | 
|  |  | 
|  | DagInit *MHSd = dyn_cast<DagInit>(MHS); | 
|  | if (MHSd && isa<DagRecTy>(Type)) { | 
|  | Init *Val = MHSd->getOperator(); | 
|  | if (Init *Result = EvaluateOperation(RHSo, LHS, Val, | 
|  | Type, CurRec, CurMultiClass)) | 
|  | Val = Result; | 
|  |  | 
|  | SmallVector<std::pair<Init *, StringInit*>, 8> args; | 
|  | for (unsigned int i = 0; i < MHSd->getNumArgs(); ++i) { | 
|  | Init *Arg = MHSd->getArg(i); | 
|  | StringInit *ArgName = MHSd->getArgName(i); | 
|  |  | 
|  | // Process args | 
|  | if (Init *Result = EvaluateOperation(RHSo, LHS, Arg, Type, | 
|  | CurRec, CurMultiClass)) | 
|  | Arg = Result; | 
|  |  | 
|  | // TODO: Process arg names | 
|  | args.push_back(std::make_pair(Arg, ArgName)); | 
|  | } | 
|  |  | 
|  | return DagInit::get(Val, nullptr, args); | 
|  | } | 
|  |  | 
|  | ListInit *MHSl = dyn_cast<ListInit>(MHS); | 
|  | if (MHSl && isa<ListRecTy>(Type)) { | 
|  | SmallVector<Init *, 8> NewOperands; | 
|  | SmallVector<Init *, 8> NewList(MHSl->begin(), MHSl->end()); | 
|  |  | 
|  | for (Init *&Item : NewList) { | 
|  | NewOperands.clear(); | 
|  | for(unsigned i = 0; i < RHSo->getNumOperands(); ++i) { | 
|  | // First, replace the foreach variable with the list item | 
|  | if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) | 
|  | NewOperands.push_back(Item); | 
|  | else | 
|  | NewOperands.push_back(RHSo->getOperand(i)); | 
|  | } | 
|  |  | 
|  | // Now run the operator and use its result as the new list item | 
|  | const OpInit *NewOp = RHSo->clone(NewOperands); | 
|  | Init *NewItem = NewOp->Fold(CurRec, CurMultiClass); | 
|  | if (NewItem != NewOp) | 
|  | Item = NewItem; | 
|  | } | 
|  | return ListInit::get(NewList, MHSl->getType()); | 
|  | } | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *TernOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) 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 = RHSv->getName(); | 
|  | if (LHSv->getAsString() == RHSv->getAsString()) | 
|  | Val = MHSv->getName(); | 
|  | return VarInit::get(Val, getType()); | 
|  | } | 
|  | if (LHSs && MHSs && RHSs) { | 
|  | std::string Val = RHSs->getValue(); | 
|  |  | 
|  | std::string::size_type found; | 
|  | std::string::size_type idx = 0; | 
|  | while (true) { | 
|  | found = Val.find(LHSs->getValue(), idx); | 
|  | if (found == std::string::npos) | 
|  | break; | 
|  | Val.replace(found, LHSs->getValue().size(), MHSs->getValue()); | 
|  | idx = found + MHSs->getValue().size(); | 
|  | } | 
|  |  | 
|  | return StringInit::get(Val); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case FOREACH: { | 
|  | if (Init *Result = ForeachHelper(LHS, MHS, RHS, getType(), | 
|  | CurRec, CurMultiClass)) | 
|  | return Result; | 
|  | break; | 
|  | } | 
|  |  | 
|  | case IF: { | 
|  | IntInit *LHSi = dyn_cast<IntInit>(LHS); | 
|  | if (Init *I = LHS->convertInitializerTo(IntRecTy::get())) | 
|  | LHSi = dyn_cast<IntInit>(I); | 
|  | if (LHSi) { | 
|  | if (LHSi->getValue()) | 
|  | return MHS; | 
|  | return RHS; | 
|  | } | 
|  | break; | 
|  | } | 
|  | } | 
|  |  | 
|  | return const_cast<TernOpInit *>(this); | 
|  | } | 
|  |  | 
|  | Init *TernOpInit::resolveReferences(Record &R, | 
|  | const RecordVal *RV) const { | 
|  | Init *lhs = LHS->resolveReferences(R, RV); | 
|  |  | 
|  | if (getOpcode() == IF && lhs != LHS) { | 
|  | IntInit *Value = dyn_cast<IntInit>(lhs); | 
|  | if (Init *I = lhs->convertInitializerTo(IntRecTy::get())) | 
|  | Value = dyn_cast<IntInit>(I); | 
|  | if (Value) { | 
|  | // Short-circuit | 
|  | if (Value->getValue()) { | 
|  | Init *mhs = MHS->resolveReferences(R, RV); | 
|  | return (TernOpInit::get(getOpcode(), lhs, mhs, | 
|  | RHS, getType()))->Fold(&R, nullptr); | 
|  | } | 
|  | Init *rhs = RHS->resolveReferences(R, RV); | 
|  | return (TernOpInit::get(getOpcode(), lhs, MHS, | 
|  | rhs, getType()))->Fold(&R, nullptr); | 
|  | } | 
|  | } | 
|  |  | 
|  | Init *mhs = MHS->resolveReferences(R, RV); | 
|  | Init *rhs = RHS->resolveReferences(R, RV); | 
|  |  | 
|  | if (LHS != lhs || MHS != mhs || RHS != rhs) | 
|  | return (TernOpInit::get(getOpcode(), lhs, mhs, rhs, | 
|  | getType()))->Fold(&R, nullptr); | 
|  | return Fold(&R, nullptr); | 
|  | } | 
|  |  | 
|  | std::string TernOpInit::getAsString() const { | 
|  | std::string Result; | 
|  | switch (getOpcode()) { | 
|  | case SUBST: Result = "!subst"; break; | 
|  | case FOREACH: Result = "!foreach"; break; | 
|  | case IF: Result = "!if"; break; | 
|  | } | 
|  | return Result + "(" + LHS->getAsString() + ", " + MHS->getAsString() + ", " + | 
|  | RHS->getAsString() + ")"; | 
|  | } | 
|  |  | 
|  | RecTy *TypedInit::getFieldType(StringInit *FieldName) const { | 
|  | if (RecordRecTy *RecordType = dyn_cast<RecordRecTy>(getType())) | 
|  | if (RecordVal *Field = RecordType->getRecord()->getValue(FieldName)) | 
|  | return Field->getType(); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init * | 
|  | TypedInit::convertInitializerTo(RecTy *Ty) const { | 
|  | if (isa<IntRecTy>(Ty)) { | 
|  | if (getType()->typeIsConvertibleTo(Ty)) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | if (isa<StringRecTy>(Ty)) { | 
|  | if (isa<StringRecTy>(getType())) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | if (isa<CodeRecTy>(Ty)) { | 
|  | if (isa<CodeRecTy>(getType())) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | if (isa<BitRecTy>(Ty)) { | 
|  | // Accept variable if it is already of bit type! | 
|  | if (isa<BitRecTy>(getType())) | 
|  | return const_cast<TypedInit *>(this); | 
|  | if (auto *BitsTy = dyn_cast<BitsRecTy>(getType())) { | 
|  | // Accept only bits<1> expression. | 
|  | if (BitsTy->getNumBits() == 1) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  | // Ternary !if can be converted to bit, but only if both sides are | 
|  | // convertible to a bit. | 
|  | if (const auto *TOI = dyn_cast<TernOpInit>(this)) { | 
|  | if (TOI->getOpcode() == TernOpInit::TernaryOp::IF && | 
|  | TOI->getMHS()->convertInitializerTo(BitRecTy::get()) && | 
|  | TOI->getRHS()->convertInitializerTo(BitRecTy::get())) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) { | 
|  | if (BRT->getNumBits() == 1 && isa<BitRecTy>(getType())) | 
|  | return BitsInit::get(const_cast<TypedInit *>(this)); | 
|  |  | 
|  | if (getType()->typeIsConvertibleTo(BRT)) { | 
|  | SmallVector<Init *, 16> NewBits(BRT->getNumBits()); | 
|  |  | 
|  | for (unsigned i = 0; i != BRT->getNumBits(); ++i) | 
|  | NewBits[i] = VarBitInit::get(const_cast<TypedInit *>(this), i); | 
|  | return BitsInit::get(NewBits); | 
|  | } | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | if (auto *DLRT = dyn_cast<ListRecTy>(Ty)) { | 
|  | if (auto *SLRT = dyn_cast<ListRecTy>(getType())) | 
|  | if (SLRT->getElementType()->typeIsConvertibleTo(DLRT->getElementType())) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | if (auto *DRT = dyn_cast<DagRecTy>(Ty)) { | 
|  | if (getType()->typeIsConvertibleTo(DRT)) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | if (auto *SRRT = dyn_cast<RecordRecTy>(Ty)) { | 
|  | // Ensure that this is compatible with Rec. | 
|  | if (RecordRecTy *DRRT = dyn_cast<RecordRecTy>(getType())) | 
|  | if (DRRT->getRecord()->isSubClassOf(SRRT->getRecord()) || | 
|  | DRRT->getRecord() == SRRT->getRecord()) | 
|  | return const_cast<TypedInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *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); | 
|  | } | 
|  |  | 
|  | Init *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); | 
|  | } | 
|  |  | 
|  |  | 
|  | VarInit *VarInit::get(StringRef VN, RecTy *T) { | 
|  | Init *Value = StringInit::get(VN); | 
|  | return VarInit::get(Value, T); | 
|  | } | 
|  |  | 
|  | VarInit *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; | 
|  | } | 
|  |  | 
|  | StringRef VarInit::getName() const { | 
|  | StringInit *NameString = cast<StringInit>(getNameInit()); | 
|  | return NameString->getValue(); | 
|  | } | 
|  |  | 
|  | Init *VarInit::getBit(unsigned Bit) const { | 
|  | if (getType() == BitRecTy::get()) | 
|  | return const_cast<VarInit*>(this); | 
|  | return VarBitInit::get(const_cast<VarInit*>(this), Bit); | 
|  | } | 
|  |  | 
|  | Init *VarInit::resolveListElementReference(Record &R, | 
|  | const RecordVal *IRV, | 
|  | unsigned Elt) const { | 
|  | if (R.isTemplateArg(getNameInit())) return nullptr; | 
|  | if (IRV && IRV->getNameInit() != getNameInit()) return nullptr; | 
|  |  | 
|  | RecordVal *RV = R.getValue(getNameInit()); | 
|  | assert(RV && "Reference to a non-existent variable?"); | 
|  | ListInit *LI = dyn_cast<ListInit>(RV->getValue()); | 
|  | if (!LI) | 
|  | return VarListElementInit::get(cast<TypedInit>(RV->getValue()), Elt); | 
|  |  | 
|  | if (Elt >= LI->size()) | 
|  | return nullptr;  // Out of range reference. | 
|  | Init *E = LI->getElement(Elt); | 
|  | // If the element is set to some value, or if we are resolving a reference | 
|  | // to a specific variable and that variable is explicitly unset, then | 
|  | // replace the VarListElementInit with it. | 
|  | if (IRV || !isa<UnsetInit>(E)) | 
|  | return E; | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | RecTy *VarInit::getFieldType(StringInit *FieldName) const { | 
|  | if (RecordRecTy *RTy = dyn_cast<RecordRecTy>(getType())) | 
|  | if (const RecordVal *RV = RTy->getRecord()->getValue(FieldName)) | 
|  | return RV->getType(); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *VarInit::getFieldInit(Record &R, const RecordVal *RV, | 
|  | StringInit *FieldName) const { | 
|  | if (isa<RecordRecTy>(getType())) | 
|  | if (const RecordVal *Val = R.getValue(VarName)) { | 
|  | if (RV != Val && (RV || isa<UnsetInit>(Val->getValue()))) | 
|  | return nullptr; | 
|  | Init *TheInit = Val->getValue(); | 
|  | assert(TheInit != this && "Infinite loop detected!"); | 
|  | if (Init *I = TheInit->getFieldInit(R, RV, FieldName)) | 
|  | return I; | 
|  | return nullptr; | 
|  | } | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *VarInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | if (RecordVal *Val = R.getValue(VarName)) | 
|  | if (RV == Val || (!RV && !isa<UnsetInit>(Val->getValue()))) | 
|  | return Val->getValue(); | 
|  | return const_cast<VarInit *>(this); | 
|  | } | 
|  |  | 
|  | VarBitInit *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; | 
|  | } | 
|  |  | 
|  | Init *VarBitInit::convertInitializerTo(RecTy *Ty) const { | 
|  | if (isa<BitRecTy>(Ty)) | 
|  | return const_cast<VarBitInit *>(this); | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | std::string VarBitInit::getAsString() const { | 
|  | return TI->getAsString() + "{" + utostr(Bit) + "}"; | 
|  | } | 
|  |  | 
|  | Init *VarBitInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | Init *I = TI->resolveReferences(R, RV); | 
|  | if (TI != I) | 
|  | return I->getBit(getBitNum()); | 
|  |  | 
|  | return const_cast<VarBitInit*>(this); | 
|  | } | 
|  |  | 
|  | VarListElementInit *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; | 
|  | } | 
|  |  | 
|  | std::string VarListElementInit::getAsString() const { | 
|  | return TI->getAsString() + "[" + utostr(Element) + "]"; | 
|  | } | 
|  |  | 
|  | Init * | 
|  | VarListElementInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | if (Init *I = getVariable()->resolveListElementReference(R, RV, | 
|  | getElementNum())) | 
|  | return I; | 
|  | return const_cast<VarListElementInit *>(this); | 
|  | } | 
|  |  | 
|  | Init *VarListElementInit::getBit(unsigned Bit) const { | 
|  | if (getType() == BitRecTy::get()) | 
|  | return const_cast<VarListElementInit*>(this); | 
|  | return VarBitInit::get(const_cast<VarListElementInit*>(this), Bit); | 
|  | } | 
|  |  | 
|  | Init *VarListElementInit:: resolveListElementReference(Record &R, | 
|  | const RecordVal *RV, | 
|  | unsigned Elt) const { | 
|  | if (Init *Result = TI->resolveListElementReference(R, RV, Element)) { | 
|  | if (TypedInit *TInit = dyn_cast<TypedInit>(Result)) { | 
|  | if (Init *Result2 = TInit->resolveListElementReference(R, RV, Elt)) | 
|  | return Result2; | 
|  | return VarListElementInit::get(TInit, Elt); | 
|  | } | 
|  | return Result; | 
|  | } | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | DefInit *DefInit::get(Record *R) { | 
|  | return R->getDefInit(); | 
|  | } | 
|  |  | 
|  | Init *DefInit::convertInitializerTo(RecTy *Ty) const { | 
|  | if (auto *RRT = dyn_cast<RecordRecTy>(Ty)) | 
|  | if (getDef()->isSubClassOf(RRT->getRecord())) | 
|  | return const_cast<DefInit *>(this); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | RecTy *DefInit::getFieldType(StringInit *FieldName) const { | 
|  | if (const RecordVal *RV = Def->getValue(FieldName)) | 
|  | return RV->getType(); | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *DefInit::getFieldInit(Record &R, const RecordVal *RV, | 
|  | StringInit *FieldName) const { | 
|  | return Def->getValue(FieldName)->getValue(); | 
|  | } | 
|  |  | 
|  | std::string DefInit::getAsString() const { | 
|  | return Def->getName(); | 
|  | } | 
|  |  | 
|  | FieldInit *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; | 
|  | } | 
|  |  | 
|  | Init *FieldInit::getBit(unsigned Bit) const { | 
|  | if (getType() == BitRecTy::get()) | 
|  | return const_cast<FieldInit*>(this); | 
|  | return VarBitInit::get(const_cast<FieldInit*>(this), Bit); | 
|  | } | 
|  |  | 
|  | Init *FieldInit::resolveListElementReference(Record &R, const RecordVal *RV, | 
|  | unsigned Elt) const { | 
|  | if (Init *ListVal = Rec->getFieldInit(R, RV, FieldName)) | 
|  | if (ListInit *LI = dyn_cast<ListInit>(ListVal)) { | 
|  | if (Elt >= LI->size()) return nullptr; | 
|  | Init *E = LI->getElement(Elt); | 
|  |  | 
|  | // If the element is set to some value, or if we are resolving a | 
|  | // reference to a specific variable and that variable is explicitly | 
|  | // unset, then replace the VarListElementInit with it. | 
|  | if (RV || !isa<UnsetInit>(E)) | 
|  | return E; | 
|  | } | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *FieldInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | Init *NewRec = RV ? Rec->resolveReferences(R, RV) : Rec; | 
|  |  | 
|  | if (Init *BitsVal = NewRec->getFieldInit(R, RV, FieldName)) { | 
|  | Init *BVR = BitsVal->resolveReferences(R, RV); | 
|  | return BVR->isComplete() ? BVR : const_cast<FieldInit *>(this); | 
|  | } | 
|  |  | 
|  | if (NewRec != Rec) | 
|  | return FieldInit::get(NewRec, FieldName); | 
|  | return const_cast<FieldInit *>(this); | 
|  | } | 
|  |  | 
|  | static 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!"); | 
|  | ID.AddPointer(*Arg++); | 
|  | ID.AddPointer(*Name++); | 
|  | } | 
|  | assert(Name == NameRange.end() && "Arg name overflow!"); | 
|  | } | 
|  |  | 
|  | DagInit * | 
|  | DagInit::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; | 
|  | } | 
|  |  | 
|  | DagInit * | 
|  | DagInit::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); | 
|  | } | 
|  |  | 
|  | void DagInit::Profile(FoldingSetNodeID &ID) const { | 
|  | ProfileDagInit(ID, Val, ValName, makeArrayRef(getTrailingObjects<Init *>(), NumArgs), makeArrayRef(getTrailingObjects<StringInit *>(), NumArgNames)); | 
|  | } | 
|  |  | 
|  | Init *DagInit::convertInitializerTo(RecTy *Ty) const { | 
|  | if (isa<DagRecTy>(Ty)) | 
|  | return const_cast<DagInit *>(this); | 
|  |  | 
|  | return nullptr; | 
|  | } | 
|  |  | 
|  | Init *DagInit::resolveReferences(Record &R, const RecordVal *RV) const { | 
|  | SmallVector<Init*, 8> NewArgs; | 
|  | NewArgs.reserve(arg_size()); | 
|  | bool ArgsChanged = false; | 
|  | for (const Init *Arg : getArgs()) { | 
|  | Init *NewArg = Arg->resolveReferences(R, RV); | 
|  | NewArgs.push_back(NewArg); | 
|  | ArgsChanged |= NewArg != Arg; | 
|  | } | 
|  |  | 
|  | Init *Op = Val->resolveReferences(R, RV); | 
|  | if (Op != Val || ArgsChanged) | 
|  | return DagInit::get(Op, ValName, NewArgs, getArgNames()); | 
|  |  | 
|  | return const_cast<DagInit *>(this); | 
|  | } | 
|  |  | 
|  | std::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 + ")"; | 
|  | } | 
|  |  | 
|  | //===----------------------------------------------------------------------===// | 
|  | //    Other implementations | 
|  | //===----------------------------------------------------------------------===// | 
|  |  | 
|  | RecordVal::RecordVal(Init *N, RecTy *T, bool P) | 
|  | : Name(N), TyAndPrefix(T, P) { | 
|  | Value = UnsetInit::get()->convertInitializerTo(T); | 
|  | assert(Value && "Cannot create unset value for current type!"); | 
|  | } | 
|  |  | 
|  | StringRef RecordVal::getName() const { | 
|  | return cast<StringInit>(getNameInit())->getValue(); | 
|  | } | 
|  |  | 
|  | #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) | 
|  | LLVM_DUMP_METHOD void RecordVal::dump() const { errs() << *this; } | 
|  | #endif | 
|  |  | 
|  | void RecordVal::print(raw_ostream &OS, bool PrintSem) const { | 
|  | if (getPrefix()) OS << "field "; | 
|  | OS << *getType() << " " << getNameInitAsString(); | 
|  |  | 
|  | if (getValue()) | 
|  | OS << " = " << *getValue(); | 
|  |  | 
|  | if (PrintSem) OS << ";\n"; | 
|  | } | 
|  |  | 
|  | unsigned Record::LastID = 0; | 
|  |  | 
|  | void Record::init() { | 
|  | checkName(); | 
|  |  | 
|  | // Every record potentially has a def at the top.  This value is | 
|  | // replaced with the top-level def name at instantiation time. | 
|  | addValue(RecordVal(StringInit::get("NAME"), StringRecTy::get(), false)); | 
|  | } | 
|  |  | 
|  | void Record::checkName() { | 
|  | // Ensure the record name has string type. | 
|  | const TypedInit *TypedName = cast<const TypedInit>(Name); | 
|  | if (!isa<StringRecTy>(TypedName->getType())) | 
|  | PrintFatalError(getLoc(), "Record name is not a string!"); | 
|  | } | 
|  |  | 
|  | DefInit *Record::getDefInit() { | 
|  | if (!TheInit) | 
|  | TheInit = new(Allocator) DefInit(this, new(Allocator) RecordRecTy(this)); | 
|  | return TheInit; | 
|  | } | 
|  |  | 
|  | StringRef Record::getName() const { | 
|  | return cast<StringInit>(Name)->getValue(); | 
|  | } | 
|  |  | 
|  | void 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. | 
|  | } | 
|  |  | 
|  | void Record::resolveReferencesTo(const RecordVal *RV) { | 
|  | for (RecordVal &Value : Values) { | 
|  | if (RV == &Value) // Skip resolve the same field as the given one | 
|  | continue; | 
|  | if (Init *V = Value.getValue()) | 
|  | if (Value.setValue(V->resolveReferences(*this, RV))) | 
|  | PrintFatalError(getLoc(), "Invalid value is found when setting '" + | 
|  | Value.getNameInitAsString() + | 
|  | "' after resolving references" + | 
|  | (RV ? " against '" + RV->getNameInitAsString() + | 
|  | "' of (" + RV->getValue()->getAsUnquotedString() + | 
|  | ")" | 
|  | : "") + "\n"); | 
|  | } | 
|  | Init *OldName = getNameInit(); | 
|  | Init *NewName = Name->resolveReferences(*this, RV); | 
|  | if (NewName != OldName) { | 
|  | // Re-register with RecordKeeper. | 
|  | setName(NewName); | 
|  | } | 
|  | } | 
|  |  | 
|  | #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) | 
|  | LLVM_DUMP_METHOD void Record::dump() const { errs() << *this; } | 
|  | #endif | 
|  |  | 
|  | raw_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??"); | 
|  | 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.getPrefix() && !R.isTemplateArg(Val.getNameInit())) | 
|  | OS << Val; | 
|  | for (const RecordVal &Val : R.getValues()) | 
|  | if (!Val.getPrefix() && !R.isTemplateArg(Val.getNameInit())) | 
|  | OS << Val; | 
|  |  | 
|  | return OS << "}\n"; | 
|  | } | 
|  |  | 
|  | Init *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(); | 
|  | } | 
|  |  | 
|  | StringRef Record::getValueAsString(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 (StringInit *SI = dyn_cast<StringInit>(R->getValue())) | 
|  | return SI->getValue(); | 
|  | if (CodeInit *CI = dyn_cast<CodeInit>(R->getValue())) | 
|  | return CI->getValue(); | 
|  |  | 
|  | PrintFatalError(getLoc(), "Record `" + getName() + "', field `" + | 
|  | FieldName + "' does not have a string initializer!"); | 
|  | } | 
|  |  | 
|  | BitsInit *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 + "' does not have a BitsInit initializer!"); | 
|  | } | 
|  |  | 
|  | ListInit *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 + "' does not have a list initializer!"); | 
|  | } | 
|  |  | 
|  | std::vector<Record*> | 
|  | Record::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; | 
|  | } | 
|  |  | 
|  | int64_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(), "Record `" + getName() + "', field `" + | 
|  | FieldName + "' does not have an int initializer!"); | 
|  | } | 
|  |  | 
|  | std::vector<int64_t> | 
|  | Record::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(), "Record `" + getName() + "', field `" + | 
|  | FieldName + "' does not have a list of ints initializer!"); | 
|  | } | 
|  | return Ints; | 
|  | } | 
|  |  | 
|  | std::vector<StringRef> | 
|  | Record::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(), "Record `" + getName() + "', field `" + | 
|  | FieldName + "' does not have a list of strings initializer!"); | 
|  | } | 
|  | return Strings; | 
|  | } | 
|  |  | 
|  | Record *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!"); | 
|  | } | 
|  |  | 
|  | bool 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!"); | 
|  | } | 
|  |  | 
|  | bool 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!"); | 
|  | } | 
|  |  | 
|  | DagInit *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!"); | 
|  | } | 
|  |  | 
|  | #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) | 
|  | LLVM_DUMP_METHOD void MultiClass::dump() const { | 
|  | errs() << "Record:\n"; | 
|  | Rec.dump(); | 
|  |  | 
|  | errs() << "Defs:\n"; | 
|  | for (const auto &Proto : DefPrototypes) | 
|  | Proto->dump(); | 
|  | } | 
|  |  | 
|  | LLVM_DUMP_METHOD void RecordKeeper::dump() const { errs() << *this; } | 
|  | #endif | 
|  |  | 
|  | raw_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; | 
|  | } | 
|  |  | 
|  | std::vector<Record *> | 
|  | RecordKeeper::getAllDerivedDefinitions(StringRef ClassName) const { | 
|  | Record *Class = getClass(ClassName); | 
|  | if (!Class) | 
|  | PrintFatalError("ERROR: Couldn't find the `" + ClassName + "' class!\n"); | 
|  |  | 
|  | std::vector<Record*> Defs; | 
|  | for (const auto &D : getDefs()) | 
|  | if (D.second->isSubClassOf(Class)) | 
|  | Defs.push_back(D.second.get()); | 
|  |  | 
|  | return Defs; | 
|  | } | 
|  |  | 
|  | static Init *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()); | 
|  | } | 
|  |  | 
|  | Init *llvm::QualifyName(Record &CurRec, MultiClass *CurMultiClass, | 
|  | Init *Name, StringRef Scoper) { | 
|  | Init *NewName = GetStrConcat(CurRec.getNameInit(), StringInit::get(Scoper)); | 
|  | NewName = GetStrConcat(NewName, Name); | 
|  | if (CurMultiClass && Scoper != "::") { | 
|  | Init *Prefix = GetStrConcat(CurMultiClass->Rec.getNameInit(), | 
|  | StringInit::get("::")); | 
|  | NewName = GetStrConcat(Prefix, NewName); | 
|  | } | 
|  |  | 
|  | if (BinOpInit *BinOp = dyn_cast<BinOpInit>(NewName)) | 
|  | NewName = BinOp->Fold(&CurRec, CurMultiClass); | 
|  | return NewName; | 
|  | } |