1 //===- Record.cpp - Record implementation ---------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // Implement the tablegen record classes.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/TableGen/Record.h"
15 #include "llvm/ADT/DenseMap.h"
16 #include "llvm/ADT/FoldingSet.h"
17 #include "llvm/ADT/Hashing.h"
18 #include "llvm/ADT/STLExtras.h"
19 #include "llvm/ADT/SmallVector.h"
20 #include "llvm/ADT/StringExtras.h"
21 #include "llvm/ADT/StringMap.h"
22 #include "llvm/Support/DataTypes.h"
23 #include "llvm/Support/ErrorHandling.h"
24 #include "llvm/Support/Format.h"
25 #include "llvm/TableGen/Error.h"
29 //===----------------------------------------------------------------------===//
30 // std::string wrapper for DenseMap purposes
31 //===----------------------------------------------------------------------===//
35 /// TableGenStringKey - This is a wrapper for std::string suitable for
36 /// using as a key to a DenseMap. Because there isn't a particularly
37 /// good way to indicate tombstone or empty keys for strings, we want
38 /// to wrap std::string to indicate that this is a "special" string
39 /// not expected to take on certain values (those of the tombstone and
40 /// empty keys). This makes things a little safer as it clarifies
41 /// that DenseMap is really not appropriate for general strings.
43 class TableGenStringKey {
45 TableGenStringKey(const std::string &str) : data(str) {}
46 TableGenStringKey(const char *str) : data(str) {}
48 const std::string &str() const { return data; }
50 friend hash_code hash_value(const TableGenStringKey &Value) {
51 using llvm::hash_value;
52 return hash_value(Value.str());
58 /// Specialize DenseMapInfo for TableGenStringKey.
59 template<> struct DenseMapInfo<TableGenStringKey> {
60 static inline TableGenStringKey getEmptyKey() {
61 TableGenStringKey Empty("<<<EMPTY KEY>>>");
64 static inline TableGenStringKey getTombstoneKey() {
65 TableGenStringKey Tombstone("<<<TOMBSTONE KEY>>>");
68 static unsigned getHashValue(const TableGenStringKey& Val) {
69 using llvm::hash_value;
70 return hash_value(Val);
72 static bool isEqual(const TableGenStringKey& LHS,
73 const TableGenStringKey& RHS) {
74 return LHS.str() == RHS.str();
80 //===----------------------------------------------------------------------===//
81 // Type implementations
82 //===----------------------------------------------------------------------===//
84 BitRecTy BitRecTy::Shared;
85 IntRecTy IntRecTy::Shared;
86 StringRecTy StringRecTy::Shared;
87 DagRecTy DagRecTy::Shared;
89 void RecTy::anchor() { }
90 void RecTy::dump() const { print(errs()); }
92 ListRecTy *RecTy::getListTy() {
94 ListTy.reset(new ListRecTy(this));
98 bool RecTy::baseClassOf(const RecTy *RHS) const{
99 assert (RHS && "NULL pointer");
100 return Kind == RHS->getRecTyKind();
103 Init *BitRecTy::convertValue(BitsInit *BI) {
104 if (BI->getNumBits() != 1) return nullptr; // Only accept if just one bit!
105 return BI->getBit(0);
108 Init *BitRecTy::convertValue(IntInit *II) {
109 int64_t Val = II->getValue();
110 if (Val != 0 && Val != 1) return nullptr; // Only accept 0 or 1 for a bit!
112 return BitInit::get(Val != 0);
115 Init *BitRecTy::convertValue(TypedInit *VI) {
116 RecTy *Ty = VI->getType();
117 if (isa<BitRecTy>(Ty))
118 return VI; // Accept variable if it is already of bit type!
119 if (auto *BitsTy = dyn_cast<BitsRecTy>(Ty))
120 // Accept only bits<1> expression.
121 return BitsTy->getNumBits() == 1 ? VI : nullptr;
122 // Ternary !if can be converted to bit, but only if both sides are
123 // convertible to a bit.
124 if (TernOpInit *TOI = dyn_cast<TernOpInit>(VI)) {
125 if (TOI->getOpcode() != TernOpInit::TernaryOp::IF)
127 if (!TOI->getMHS()->convertInitializerTo(BitRecTy::get()) ||
128 !TOI->getRHS()->convertInitializerTo(BitRecTy::get()))
135 bool BitRecTy::baseClassOf(const RecTy *RHS) const{
136 if(RecTy::baseClassOf(RHS) || RHS->getRecTyKind() == IntRecTyKind)
138 if(const BitsRecTy *BitsTy = dyn_cast<BitsRecTy>(RHS))
139 return BitsTy->getNumBits() == 1;
143 BitsRecTy *BitsRecTy::get(unsigned Sz) {
144 static std::vector<std::unique_ptr<BitsRecTy>> Shared;
145 if (Sz >= Shared.size())
146 Shared.resize(Sz + 1);
147 std::unique_ptr<BitsRecTy> &Ty = Shared[Sz];
149 Ty.reset(new BitsRecTy(Sz));
153 std::string BitsRecTy::getAsString() const {
154 return "bits<" + utostr(Size) + ">";
157 Init *BitsRecTy::convertValue(UnsetInit *UI) {
158 SmallVector<Init *, 16> NewBits(Size);
160 for (unsigned i = 0; i != Size; ++i)
161 NewBits[i] = UnsetInit::get();
163 return BitsInit::get(NewBits);
166 Init *BitsRecTy::convertValue(BitInit *UI) {
167 if (Size != 1) return nullptr; // Can only convert single bit.
168 return BitsInit::get(UI);
171 /// canFitInBitfield - Return true if the number of bits is large enough to hold
172 /// the integer value.
173 static bool canFitInBitfield(int64_t Value, unsigned NumBits) {
174 // For example, with NumBits == 4, we permit Values from [-7 .. 15].
175 return (NumBits >= sizeof(Value) * 8) ||
176 (Value >> NumBits == 0) || (Value >> (NumBits-1) == -1);
179 /// convertValue from Int initializer to bits type: Split the integer up into the
180 /// appropriate bits.
182 Init *BitsRecTy::convertValue(IntInit *II) {
183 int64_t Value = II->getValue();
184 // Make sure this bitfield is large enough to hold the integer value.
185 if (!canFitInBitfield(Value, Size))
188 SmallVector<Init *, 16> NewBits(Size);
190 for (unsigned i = 0; i != Size; ++i)
191 NewBits[i] = BitInit::get(Value & (1LL << i));
193 return BitsInit::get(NewBits);
196 Init *BitsRecTy::convertValue(BitsInit *BI) {
197 // If the number of bits is right, return it. Otherwise we need to expand or
199 if (BI->getNumBits() == Size) return BI;
203 Init *BitsRecTy::convertValue(TypedInit *VI) {
204 if (Size == 1 && isa<BitRecTy>(VI->getType()))
205 return BitsInit::get(VI);
207 if (VI->getType()->typeIsConvertibleTo(this)) {
208 SmallVector<Init *, 16> NewBits(Size);
210 for (unsigned i = 0; i != Size; ++i)
211 NewBits[i] = VarBitInit::get(VI, i);
212 return BitsInit::get(NewBits);
218 bool BitsRecTy::baseClassOf(const RecTy *RHS) const{
219 if (RecTy::baseClassOf(RHS)) //argument and the receiver are the same type
220 return cast<BitsRecTy>(RHS)->Size == Size;
221 RecTyKind kind = RHS->getRecTyKind();
222 return (kind == BitRecTyKind && Size == 1) || (kind == IntRecTyKind);
225 Init *IntRecTy::convertValue(BitInit *BI) {
226 return IntInit::get(BI->getValue());
229 Init *IntRecTy::convertValue(BitsInit *BI) {
231 for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i)
232 if (BitInit *Bit = dyn_cast<BitInit>(BI->getBit(i))) {
233 Result |= Bit->getValue() << i;
237 return IntInit::get(Result);
240 Init *IntRecTy::convertValue(TypedInit *TI) {
241 if (TI->getType()->typeIsConvertibleTo(this))
242 return TI; // Accept variable if already of the right type!
246 bool IntRecTy::baseClassOf(const RecTy *RHS) const{
247 RecTyKind kind = RHS->getRecTyKind();
248 return kind==BitRecTyKind || kind==BitsRecTyKind || kind==IntRecTyKind;
251 Init *StringRecTy::convertValue(UnOpInit *BO) {
252 if (BO->getOpcode() == UnOpInit::CAST) {
253 Init *L = BO->getOperand()->convertInitializerTo(this);
254 if (!L) return nullptr;
255 if (L != BO->getOperand())
256 return UnOpInit::get(UnOpInit::CAST, L, StringRecTy::get());
260 return convertValue((TypedInit*)BO);
263 Init *StringRecTy::convertValue(BinOpInit *BO) {
264 if (BO->getOpcode() == BinOpInit::STRCONCAT) {
265 Init *L = BO->getLHS()->convertInitializerTo(this);
266 Init *R = BO->getRHS()->convertInitializerTo(this);
267 if (!L || !R) return nullptr;
268 if (L != BO->getLHS() || R != BO->getRHS())
269 return BinOpInit::get(BinOpInit::STRCONCAT, L, R, StringRecTy::get());
273 return convertValue((TypedInit*)BO);
277 Init *StringRecTy::convertValue(TypedInit *TI) {
278 if (isa<StringRecTy>(TI->getType()))
279 return TI; // Accept variable if already of the right type!
283 std::string ListRecTy::getAsString() const {
284 return "list<" + Ty->getAsString() + ">";
287 Init *ListRecTy::convertValue(ListInit *LI) {
288 std::vector<Init*> Elements;
290 // Verify that all of the elements of the list are subclasses of the
291 // appropriate class!
292 for (unsigned i = 0, e = LI->getSize(); i != e; ++i)
293 if (Init *CI = LI->getElement(i)->convertInitializerTo(Ty))
294 Elements.push_back(CI);
298 if (!isa<ListRecTy>(LI->getType()))
301 return ListInit::get(Elements, this);
304 Init *ListRecTy::convertValue(TypedInit *TI) {
305 // Ensure that TI is compatible with our class.
306 if (ListRecTy *LRT = dyn_cast<ListRecTy>(TI->getType()))
307 if (LRT->getElementType()->typeIsConvertibleTo(getElementType()))
312 bool ListRecTy::baseClassOf(const RecTy *RHS) const{
313 if(const ListRecTy* ListTy = dyn_cast<ListRecTy>(RHS))
314 return ListTy->getElementType()->typeIsConvertibleTo(Ty);
318 Init *DagRecTy::convertValue(TypedInit *TI) {
319 if (TI->getType()->typeIsConvertibleTo(this))
324 Init *DagRecTy::convertValue(UnOpInit *BO) {
325 if (BO->getOpcode() == UnOpInit::CAST) {
326 Init *L = BO->getOperand()->convertInitializerTo(this);
327 if (!L) return nullptr;
328 if (L != BO->getOperand())
329 return UnOpInit::get(UnOpInit::CAST, L, new DagRecTy);
335 Init *DagRecTy::convertValue(BinOpInit *BO) {
336 if (BO->getOpcode() == BinOpInit::CONCAT) {
337 Init *L = BO->getLHS()->convertInitializerTo(this);
338 Init *R = BO->getRHS()->convertInitializerTo(this);
339 if (!L || !R) return nullptr;
340 if (L != BO->getLHS() || R != BO->getRHS())
341 return BinOpInit::get(BinOpInit::CONCAT, L, R, new DagRecTy);
347 RecordRecTy *RecordRecTy::get(Record *R) {
348 return dyn_cast<RecordRecTy>(R->getDefInit()->getType());
351 std::string RecordRecTy::getAsString() const {
352 return Rec->getName();
355 Init *RecordRecTy::convertValue(DefInit *DI) {
356 // Ensure that DI is a subclass of Rec.
357 if (!DI->getDef()->isSubClassOf(Rec))
362 Init *RecordRecTy::convertValue(TypedInit *TI) {
363 // Ensure that TI is compatible with Rec.
364 if (RecordRecTy *RRT = dyn_cast<RecordRecTy>(TI->getType()))
365 if (RRT->getRecord()->isSubClassOf(getRecord()) ||
366 RRT->getRecord() == getRecord())
371 bool RecordRecTy::baseClassOf(const RecTy *RHS) const{
372 const RecordRecTy *RTy = dyn_cast<RecordRecTy>(RHS);
376 if (Rec == RTy->getRecord() || RTy->getRecord()->isSubClassOf(Rec))
379 const std::vector<Record*> &SC = Rec->getSuperClasses();
380 for (unsigned i = 0, e = SC.size(); i != e; ++i)
381 if (RTy->getRecord()->isSubClassOf(SC[i]))
387 /// resolveTypes - Find a common type that T1 and T2 convert to.
388 /// Return null if no such type exists.
390 RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) {
391 if (T1->typeIsConvertibleTo(T2))
393 if (T2->typeIsConvertibleTo(T1))
396 // If one is a Record type, check superclasses
397 if (RecordRecTy *RecTy1 = dyn_cast<RecordRecTy>(T1)) {
398 // See if T2 inherits from a type T1 also inherits from
399 for (Record *SuperRec1 : RecTy1->getRecord()->getSuperClasses()) {
400 RecordRecTy *SuperRecTy1 = RecordRecTy::get(SuperRec1);
401 RecTy *NewType1 = resolveTypes(SuperRecTy1, T2);
406 if (RecordRecTy *RecTy2 = dyn_cast<RecordRecTy>(T2)) {
407 // See if T1 inherits from a type T2 also inherits from
408 for (Record *SuperRec2 : RecTy2->getRecord()->getSuperClasses()) {
409 RecordRecTy *SuperRecTy2 = RecordRecTy::get(SuperRec2);
410 RecTy *NewType2 = resolveTypes(T1, SuperRecTy2);
419 //===----------------------------------------------------------------------===//
420 // Initializer implementations
421 //===----------------------------------------------------------------------===//
423 void Init::anchor() { }
424 void Init::dump() const { return print(errs()); }
426 void UnsetInit::anchor() { }
428 UnsetInit *UnsetInit::get() {
429 static UnsetInit TheInit;
433 void BitInit::anchor() { }
435 BitInit *BitInit::get(bool V) {
436 static BitInit True(true);
437 static BitInit False(false);
439 return V ? &True : &False;
443 ProfileBitsInit(FoldingSetNodeID &ID, ArrayRef<Init *> Range) {
444 ID.AddInteger(Range.size());
446 for (ArrayRef<Init *>::iterator i = Range.begin(),
453 BitsInit *BitsInit::get(ArrayRef<Init *> Range) {
454 static FoldingSet<BitsInit> ThePool;
455 static std::vector<std::unique_ptr<BitsInit>> TheActualPool;
458 ProfileBitsInit(ID, Range);
461 if (BitsInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
464 BitsInit *I = new BitsInit(Range);
465 ThePool.InsertNode(I, IP);
466 TheActualPool.push_back(std::unique_ptr<BitsInit>(I));
470 void BitsInit::Profile(FoldingSetNodeID &ID) const {
471 ProfileBitsInit(ID, Bits);
475 BitsInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) const {
476 SmallVector<Init *, 16> NewBits(Bits.size());
478 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
479 if (Bits[i] >= getNumBits())
481 NewBits[i] = getBit(Bits[i]);
483 return BitsInit::get(NewBits);
486 std::string BitsInit::getAsString() const {
487 std::string Result = "{ ";
488 for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
489 if (i) Result += ", ";
490 if (Init *Bit = getBit(e-i-1))
491 Result += Bit->getAsString();
495 return Result + " }";
498 // Fix bit initializer to preserve the behavior that bit reference from a unset
499 // bits initializer will resolve into VarBitInit to keep the field name and bit
500 // number used in targets with fixed insn length.
501 static Init *fixBitInit(const RecordVal *RV, Init *Before, Init *After) {
502 if (RV || !isa<UnsetInit>(After))
507 // resolveReferences - If there are any field references that refer to fields
508 // that have been filled in, we can propagate the values now.
510 Init *BitsInit::resolveReferences(Record &R, const RecordVal *RV) const {
511 bool Changed = false;
512 SmallVector<Init *, 16> NewBits(getNumBits());
514 Init *CachedInit = nullptr;
515 Init *CachedBitVar = nullptr;
516 bool CachedBitVarChanged = false;
518 for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
519 Init *CurBit = Bits[i];
520 Init *CurBitVar = CurBit->getBitVar();
524 if (CurBitVar == CachedBitVar) {
525 if (CachedBitVarChanged) {
526 Init *Bit = CachedInit->getBit(CurBit->getBitNum());
527 NewBits[i] = fixBitInit(RV, CurBit, Bit);
531 CachedBitVar = CurBitVar;
532 CachedBitVarChanged = false;
537 CurBitVar = CurBitVar->resolveReferences(R, RV);
538 CachedBitVarChanged |= B != CurBitVar;
539 Changed |= B != CurBitVar;
540 } while (B != CurBitVar);
541 CachedInit = CurBitVar;
543 if (CachedBitVarChanged) {
544 Init *Bit = CurBitVar->getBit(CurBit->getBitNum());
545 NewBits[i] = fixBitInit(RV, CurBit, Bit);
550 return BitsInit::get(NewBits);
552 return const_cast<BitsInit *>(this);
555 IntInit *IntInit::get(int64_t V) {
556 static DenseMap<int64_t, std::unique_ptr<IntInit>> ThePool;
558 std::unique_ptr<IntInit> &I = ThePool[V];
559 if (!I) I.reset(new IntInit(V));
563 std::string IntInit::getAsString() const {
564 return itostr(Value);
568 IntInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) const {
569 SmallVector<Init *, 16> NewBits(Bits.size());
571 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
575 NewBits[i] = BitInit::get(Value & (INT64_C(1) << Bits[i]));
577 return BitsInit::get(NewBits);
580 void StringInit::anchor() { }
582 StringInit *StringInit::get(StringRef V) {
583 static StringMap<std::unique_ptr<StringInit>> ThePool;
585 std::unique_ptr<StringInit> &I = ThePool[V];
586 if (!I) I.reset(new StringInit(V));
590 static void ProfileListInit(FoldingSetNodeID &ID,
591 ArrayRef<Init *> Range,
593 ID.AddInteger(Range.size());
594 ID.AddPointer(EltTy);
596 for (ArrayRef<Init *>::iterator i = Range.begin(),
603 ListInit *ListInit::get(ArrayRef<Init *> Range, RecTy *EltTy) {
604 static FoldingSet<ListInit> ThePool;
605 static std::vector<std::unique_ptr<ListInit>> TheActualPool;
608 ProfileListInit(ID, Range, EltTy);
611 if (ListInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
614 ListInit *I = new ListInit(Range, EltTy);
615 ThePool.InsertNode(I, IP);
616 TheActualPool.push_back(std::unique_ptr<ListInit>(I));
620 void ListInit::Profile(FoldingSetNodeID &ID) const {
621 RecTy *EltTy = cast<ListRecTy>(getType())->getElementType();
623 ProfileListInit(ID, Values, EltTy);
627 ListInit::convertInitListSlice(const std::vector<unsigned> &Elements) const {
628 std::vector<Init*> Vals;
629 for (unsigned i = 0, e = Elements.size(); i != e; ++i) {
630 if (Elements[i] >= getSize())
632 Vals.push_back(getElement(Elements[i]));
634 return ListInit::get(Vals, getType());
637 Record *ListInit::getElementAsRecord(unsigned i) const {
638 assert(i < Values.size() && "List element index out of range!");
639 DefInit *DI = dyn_cast<DefInit>(Values[i]);
641 PrintFatalError("Expected record in list!");
645 Init *ListInit::resolveReferences(Record &R, const RecordVal *RV) const {
646 std::vector<Init*> Resolved;
647 Resolved.reserve(getSize());
648 bool Changed = false;
650 for (unsigned i = 0, e = getSize(); i != e; ++i) {
652 Init *CurElt = getElement(i);
656 CurElt = CurElt->resolveReferences(R, RV);
657 Changed |= E != CurElt;
658 } while (E != CurElt);
659 Resolved.push_back(E);
663 return ListInit::get(Resolved, getType());
664 return const_cast<ListInit *>(this);
667 Init *ListInit::resolveListElementReference(Record &R, const RecordVal *IRV,
668 unsigned Elt) const {
669 if (Elt >= getSize())
670 return nullptr; // Out of range reference.
671 Init *E = getElement(Elt);
672 // If the element is set to some value, or if we are resolving a reference
673 // to a specific variable and that variable is explicitly unset, then
674 // replace the VarListElementInit with it.
675 if (IRV || !isa<UnsetInit>(E))
680 std::string ListInit::getAsString() const {
681 std::string Result = "[";
682 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
683 if (i) Result += ", ";
684 Result += Values[i]->getAsString();
689 Init *OpInit::resolveListElementReference(Record &R, const RecordVal *IRV,
690 unsigned Elt) const {
691 Init *Resolved = resolveReferences(R, IRV);
692 OpInit *OResolved = dyn_cast<OpInit>(Resolved);
694 Resolved = OResolved->Fold(&R, nullptr);
697 if (Resolved != this) {
698 TypedInit *Typed = cast<TypedInit>(Resolved);
699 if (Init *New = Typed->resolveListElementReference(R, IRV, Elt))
701 return VarListElementInit::get(Typed, Elt);
707 Init *OpInit::getBit(unsigned Bit) const {
708 if (getType() == BitRecTy::get())
709 return const_cast<OpInit*>(this);
710 return VarBitInit::get(const_cast<OpInit*>(this), Bit);
713 UnOpInit *UnOpInit::get(UnaryOp opc, Init *lhs, RecTy *Type) {
714 typedef std::pair<std::pair<unsigned, Init *>, RecTy *> Key;
715 static DenseMap<Key, std::unique_ptr<UnOpInit>> ThePool;
717 Key TheKey(std::make_pair(std::make_pair(opc, lhs), Type));
719 std::unique_ptr<UnOpInit> &I = ThePool[TheKey];
720 if (!I) I.reset(new UnOpInit(opc, lhs, Type));
724 Init *UnOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const {
725 switch (getOpcode()) {
727 if (getType()->getAsString() == "string") {
728 if (StringInit *LHSs = dyn_cast<StringInit>(LHS))
731 if (DefInit *LHSd = dyn_cast<DefInit>(LHS))
732 return StringInit::get(LHSd->getDef()->getName());
734 if (IntInit *LHSi = dyn_cast<IntInit>(LHS))
735 return StringInit::get(LHSi->getAsString());
737 if (StringInit *LHSs = dyn_cast<StringInit>(LHS)) {
738 std::string Name = LHSs->getValue();
740 // From TGParser::ParseIDValue
742 if (const RecordVal *RV = CurRec->getValue(Name)) {
743 if (RV->getType() != getType())
744 PrintFatalError("type mismatch in cast");
745 return VarInit::get(Name, RV->getType());
748 Init *TemplateArgName = QualifyName(*CurRec, CurMultiClass, Name,
751 if (CurRec->isTemplateArg(TemplateArgName)) {
752 const RecordVal *RV = CurRec->getValue(TemplateArgName);
753 assert(RV && "Template arg doesn't exist??");
755 if (RV->getType() != getType())
756 PrintFatalError("type mismatch in cast");
758 return VarInit::get(TemplateArgName, RV->getType());
763 Init *MCName = QualifyName(CurMultiClass->Rec, CurMultiClass, Name, "::");
765 if (CurMultiClass->Rec.isTemplateArg(MCName)) {
766 const RecordVal *RV = CurMultiClass->Rec.getValue(MCName);
767 assert(RV && "Template arg doesn't exist??");
769 if (RV->getType() != getType())
770 PrintFatalError("type mismatch in cast");
772 return VarInit::get(MCName, RV->getType());
775 assert(CurRec && "NULL pointer");
776 if (Record *D = (CurRec->getRecords()).getDef(Name))
777 return DefInit::get(D);
779 PrintFatalError(CurRec->getLoc(),
780 "Undefined reference:'" + Name + "'\n");
786 if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) {
787 assert(LHSl->getSize() != 0 && "Empty list in car");
788 return LHSl->getElement(0);
793 if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) {
794 assert(LHSl->getSize() != 0 && "Empty list in cdr");
795 // Note the +1. We can't just pass the result of getValues()
797 ArrayRef<Init *>::iterator begin = LHSl->getValues().begin()+1;
798 ArrayRef<Init *>::iterator end = LHSl->getValues().end();
800 ListInit::get(ArrayRef<Init *>(begin, end - begin),
807 if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) {
808 if (LHSl->getSize() == 0) {
809 return IntInit::get(1);
811 return IntInit::get(0);
814 if (StringInit *LHSs = dyn_cast<StringInit>(LHS)) {
815 if (LHSs->getValue().empty()) {
816 return IntInit::get(1);
818 return IntInit::get(0);
825 return const_cast<UnOpInit *>(this);
828 Init *UnOpInit::resolveReferences(Record &R, const RecordVal *RV) const {
829 Init *lhs = LHS->resolveReferences(R, RV);
832 return (UnOpInit::get(getOpcode(), lhs, getType()))->Fold(&R, nullptr);
833 return Fold(&R, nullptr);
836 std::string UnOpInit::getAsString() const {
839 case CAST: Result = "!cast<" + getType()->getAsString() + ">"; break;
840 case HEAD: Result = "!head"; break;
841 case TAIL: Result = "!tail"; break;
842 case EMPTY: Result = "!empty"; break;
844 return Result + "(" + LHS->getAsString() + ")";
847 BinOpInit *BinOpInit::get(BinaryOp opc, Init *lhs,
848 Init *rhs, RecTy *Type) {
850 std::pair<std::pair<unsigned, Init *>, Init *>,
854 static DenseMap<Key, std::unique_ptr<BinOpInit>> ThePool;
856 Key TheKey(std::make_pair(std::make_pair(std::make_pair(opc, lhs), rhs),
859 std::unique_ptr<BinOpInit> &I = ThePool[TheKey];
860 if (!I) I.reset(new BinOpInit(opc, lhs, rhs, Type));
864 Init *BinOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const {
865 switch (getOpcode()) {
867 DagInit *LHSs = dyn_cast<DagInit>(LHS);
868 DagInit *RHSs = dyn_cast<DagInit>(RHS);
870 DefInit *LOp = dyn_cast<DefInit>(LHSs->getOperator());
871 DefInit *ROp = dyn_cast<DefInit>(RHSs->getOperator());
872 if (!LOp || !ROp || LOp->getDef() != ROp->getDef())
873 PrintFatalError("Concated Dag operators do not match!");
874 std::vector<Init*> Args;
875 std::vector<std::string> ArgNames;
876 for (unsigned i = 0, e = LHSs->getNumArgs(); i != e; ++i) {
877 Args.push_back(LHSs->getArg(i));
878 ArgNames.push_back(LHSs->getArgName(i));
880 for (unsigned i = 0, e = RHSs->getNumArgs(); i != e; ++i) {
881 Args.push_back(RHSs->getArg(i));
882 ArgNames.push_back(RHSs->getArgName(i));
884 return DagInit::get(LHSs->getOperator(), "", Args, ArgNames);
889 ListInit *LHSs = dyn_cast<ListInit>(LHS);
890 ListInit *RHSs = dyn_cast<ListInit>(RHS);
892 std::vector<Init *> Args;
893 Args.insert(Args.end(), LHSs->begin(), LHSs->end());
894 Args.insert(Args.end(), RHSs->begin(), RHSs->end());
895 return ListInit::get(
896 Args, static_cast<ListRecTy *>(LHSs->getType())->getElementType());
901 StringInit *LHSs = dyn_cast<StringInit>(LHS);
902 StringInit *RHSs = dyn_cast<StringInit>(RHS);
904 return StringInit::get(LHSs->getValue() + RHSs->getValue());
908 // try to fold eq comparison for 'bit' and 'int', otherwise fallback
909 // to string objects.
911 dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get()));
913 dyn_cast_or_null<IntInit>(RHS->convertInitializerTo(IntRecTy::get()));
916 return IntInit::get(L->getValue() == R->getValue());
918 StringInit *LHSs = dyn_cast<StringInit>(LHS);
919 StringInit *RHSs = dyn_cast<StringInit>(RHS);
921 // Make sure we've resolved
923 return IntInit::get(LHSs->getValue() == RHSs->getValue());
933 dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get()));
935 dyn_cast_or_null<IntInit>(RHS->convertInitializerTo(IntRecTy::get()));
937 int64_t LHSv = LHSi->getValue(), RHSv = RHSi->getValue();
939 switch (getOpcode()) {
940 default: llvm_unreachable("Bad opcode!");
941 case ADD: Result = LHSv + RHSv; break;
942 case AND: Result = LHSv & RHSv; break;
943 case SHL: Result = LHSv << RHSv; break;
944 case SRA: Result = LHSv >> RHSv; break;
945 case SRL: Result = (uint64_t)LHSv >> (uint64_t)RHSv; break;
947 return IntInit::get(Result);
952 return const_cast<BinOpInit *>(this);
955 Init *BinOpInit::resolveReferences(Record &R, const RecordVal *RV) const {
956 Init *lhs = LHS->resolveReferences(R, RV);
957 Init *rhs = RHS->resolveReferences(R, RV);
959 if (LHS != lhs || RHS != rhs)
960 return (BinOpInit::get(getOpcode(), lhs, rhs, getType()))->Fold(&R,nullptr);
961 return Fold(&R, nullptr);
964 std::string BinOpInit::getAsString() const {
967 case CONCAT: Result = "!con"; break;
968 case ADD: Result = "!add"; break;
969 case AND: Result = "!and"; break;
970 case SHL: Result = "!shl"; break;
971 case SRA: Result = "!sra"; break;
972 case SRL: Result = "!srl"; break;
973 case EQ: Result = "!eq"; break;
974 case LISTCONCAT: Result = "!listconcat"; break;
975 case STRCONCAT: Result = "!strconcat"; break;
977 return Result + "(" + LHS->getAsString() + ", " + RHS->getAsString() + ")";
980 TernOpInit *TernOpInit::get(TernaryOp opc, Init *lhs,
981 Init *mhs, Init *rhs,
985 std::pair<std::pair<unsigned, RecTy *>, Init *>,
991 static DenseMap<Key, std::unique_ptr<TernOpInit>> ThePool;
993 Key TheKey(std::make_pair(std::make_pair(std::make_pair(std::make_pair(opc,
999 std::unique_ptr<TernOpInit> &I = ThePool[TheKey];
1000 if (!I) I.reset(new TernOpInit(opc, lhs, mhs, rhs, Type));
1004 static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type,
1005 Record *CurRec, MultiClass *CurMultiClass);
1007 static Init *EvaluateOperation(OpInit *RHSo, Init *LHS, Init *Arg,
1008 RecTy *Type, Record *CurRec,
1009 MultiClass *CurMultiClass) {
1010 // If this is a dag, recurse
1011 if (TypedInit *TArg = dyn_cast<TypedInit>(Arg)) {
1012 if (TArg->getType()->getAsString() == "dag") {
1013 Init *Result = ForeachHelper(LHS, Arg, RHSo, Type,
1014 CurRec, CurMultiClass);
1019 std::vector<Init *> NewOperands;
1020 for (int i = 0; i < RHSo->getNumOperands(); ++i) {
1021 if (OpInit *RHSoo = dyn_cast<OpInit>(RHSo->getOperand(i))) {
1022 Init *Result = EvaluateOperation(RHSoo, LHS, Arg,
1023 Type, CurRec, CurMultiClass);
1025 NewOperands.push_back(Result);
1027 NewOperands.push_back(Arg);
1029 } else if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) {
1030 NewOperands.push_back(Arg);
1032 NewOperands.push_back(RHSo->getOperand(i));
1036 // Now run the operator and use its result as the new leaf
1037 const OpInit *NewOp = RHSo->clone(NewOperands);
1038 Init *NewVal = NewOp->Fold(CurRec, CurMultiClass);
1039 return (NewVal != NewOp) ? NewVal : nullptr;
1042 static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type,
1043 Record *CurRec, MultiClass *CurMultiClass) {
1044 DagInit *MHSd = dyn_cast<DagInit>(MHS);
1045 ListInit *MHSl = dyn_cast<ListInit>(MHS);
1047 OpInit *RHSo = dyn_cast<OpInit>(RHS);
1050 PrintFatalError(CurRec->getLoc(), "!foreach requires an operator\n");
1053 TypedInit *LHSt = dyn_cast<TypedInit>(LHS);
1056 PrintFatalError(CurRec->getLoc(), "!foreach requires typed variable\n");
1058 if ((MHSd && isa<DagRecTy>(Type)) || (MHSl && isa<ListRecTy>(Type))) {
1060 Init *Val = MHSd->getOperator();
1061 Init *Result = EvaluateOperation(RHSo, LHS, Val,
1062 Type, CurRec, CurMultiClass);
1067 std::vector<std::pair<Init *, std::string> > args;
1068 for (unsigned int i = 0; i < MHSd->getNumArgs(); ++i) {
1070 std::string ArgName;
1071 Arg = MHSd->getArg(i);
1072 ArgName = MHSd->getArgName(i);
1075 Init *Result = EvaluateOperation(RHSo, LHS, Arg, Type,
1076 CurRec, CurMultiClass);
1081 // TODO: Process arg names
1082 args.push_back(std::make_pair(Arg, ArgName));
1085 return DagInit::get(Val, "", args);
1088 std::vector<Init *> NewOperands;
1089 std::vector<Init *> NewList(MHSl->begin(), MHSl->end());
1091 for (std::vector<Init *>::iterator li = NewList.begin(),
1092 liend = NewList.end();
1096 NewOperands.clear();
1097 for(int i = 0; i < RHSo->getNumOperands(); ++i) {
1098 // First, replace the foreach variable with the list item
1099 if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) {
1100 NewOperands.push_back(Item);
1102 NewOperands.push_back(RHSo->getOperand(i));
1106 // Now run the operator and use its result as the new list item
1107 const OpInit *NewOp = RHSo->clone(NewOperands);
1108 Init *NewItem = NewOp->Fold(CurRec, CurMultiClass);
1109 if (NewItem != NewOp)
1112 return ListInit::get(NewList, MHSl->getType());
1118 Init *TernOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const {
1119 switch (getOpcode()) {
1121 DefInit *LHSd = dyn_cast<DefInit>(LHS);
1122 VarInit *LHSv = dyn_cast<VarInit>(LHS);
1123 StringInit *LHSs = dyn_cast<StringInit>(LHS);
1125 DefInit *MHSd = dyn_cast<DefInit>(MHS);
1126 VarInit *MHSv = dyn_cast<VarInit>(MHS);
1127 StringInit *MHSs = dyn_cast<StringInit>(MHS);
1129 DefInit *RHSd = dyn_cast<DefInit>(RHS);
1130 VarInit *RHSv = dyn_cast<VarInit>(RHS);
1131 StringInit *RHSs = dyn_cast<StringInit>(RHS);
1133 if ((LHSd && MHSd && RHSd)
1134 || (LHSv && MHSv && RHSv)
1135 || (LHSs && MHSs && RHSs)) {
1137 Record *Val = RHSd->getDef();
1138 if (LHSd->getAsString() == RHSd->getAsString()) {
1139 Val = MHSd->getDef();
1141 return DefInit::get(Val);
1144 std::string Val = RHSv->getName();
1145 if (LHSv->getAsString() == RHSv->getAsString()) {
1146 Val = MHSv->getName();
1148 return VarInit::get(Val, getType());
1151 std::string Val = RHSs->getValue();
1153 std::string::size_type found;
1154 std::string::size_type idx = 0;
1156 found = Val.find(LHSs->getValue(), idx);
1157 if (found != std::string::npos) {
1158 Val.replace(found, LHSs->getValue().size(), MHSs->getValue());
1160 idx = found + MHSs->getValue().size();
1161 } while (found != std::string::npos);
1163 return StringInit::get(Val);
1170 Init *Result = ForeachHelper(LHS, MHS, RHS, getType(),
1171 CurRec, CurMultiClass);
1179 IntInit *LHSi = dyn_cast<IntInit>(LHS);
1180 if (Init *I = LHS->convertInitializerTo(IntRecTy::get()))
1181 LHSi = dyn_cast<IntInit>(I);
1183 if (LHSi->getValue()) {
1193 return const_cast<TernOpInit *>(this);
1196 Init *TernOpInit::resolveReferences(Record &R,
1197 const RecordVal *RV) const {
1198 Init *lhs = LHS->resolveReferences(R, RV);
1200 if (Opc == IF && lhs != LHS) {
1201 IntInit *Value = dyn_cast<IntInit>(lhs);
1202 if (Init *I = lhs->convertInitializerTo(IntRecTy::get()))
1203 Value = dyn_cast<IntInit>(I);
1206 if (Value->getValue()) {
1207 Init *mhs = MHS->resolveReferences(R, RV);
1208 return (TernOpInit::get(getOpcode(), lhs, mhs,
1209 RHS, getType()))->Fold(&R, nullptr);
1211 Init *rhs = RHS->resolveReferences(R, RV);
1212 return (TernOpInit::get(getOpcode(), lhs, MHS,
1213 rhs, getType()))->Fold(&R, nullptr);
1218 Init *mhs = MHS->resolveReferences(R, RV);
1219 Init *rhs = RHS->resolveReferences(R, RV);
1221 if (LHS != lhs || MHS != mhs || RHS != rhs)
1222 return (TernOpInit::get(getOpcode(), lhs, mhs, rhs,
1223 getType()))->Fold(&R, nullptr);
1224 return Fold(&R, nullptr);
1227 std::string TernOpInit::getAsString() const {
1230 case SUBST: Result = "!subst"; break;
1231 case FOREACH: Result = "!foreach"; break;
1232 case IF: Result = "!if"; break;
1234 return Result + "(" + LHS->getAsString() + ", " + MHS->getAsString() + ", "
1235 + RHS->getAsString() + ")";
1238 RecTy *TypedInit::getFieldType(const std::string &FieldName) const {
1239 if (RecordRecTy *RecordType = dyn_cast<RecordRecTy>(getType()))
1240 if (RecordVal *Field = RecordType->getRecord()->getValue(FieldName))
1241 return Field->getType();
1246 TypedInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) const {
1247 BitsRecTy *T = dyn_cast<BitsRecTy>(getType());
1248 if (!T) return nullptr; // Cannot subscript a non-bits variable.
1249 unsigned NumBits = T->getNumBits();
1251 SmallVector<Init *, 16> NewBits(Bits.size());
1252 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
1253 if (Bits[i] >= NumBits)
1256 NewBits[i] = VarBitInit::get(const_cast<TypedInit *>(this), Bits[i]);
1258 return BitsInit::get(NewBits);
1262 TypedInit::convertInitListSlice(const std::vector<unsigned> &Elements) const {
1263 ListRecTy *T = dyn_cast<ListRecTy>(getType());
1264 if (!T) return nullptr; // Cannot subscript a non-list variable.
1266 if (Elements.size() == 1)
1267 return VarListElementInit::get(const_cast<TypedInit *>(this), Elements[0]);
1269 std::vector<Init*> ListInits;
1270 ListInits.reserve(Elements.size());
1271 for (unsigned i = 0, e = Elements.size(); i != e; ++i)
1272 ListInits.push_back(VarListElementInit::get(const_cast<TypedInit *>(this),
1274 return ListInit::get(ListInits, T);
1278 VarInit *VarInit::get(const std::string &VN, RecTy *T) {
1279 Init *Value = StringInit::get(VN);
1280 return VarInit::get(Value, T);
1283 VarInit *VarInit::get(Init *VN, RecTy *T) {
1284 typedef std::pair<RecTy *, Init *> Key;
1285 static DenseMap<Key, std::unique_ptr<VarInit>> ThePool;
1287 Key TheKey(std::make_pair(T, VN));
1289 std::unique_ptr<VarInit> &I = ThePool[TheKey];
1290 if (!I) I.reset(new VarInit(VN, T));
1294 const std::string &VarInit::getName() const {
1295 StringInit *NameString = cast<StringInit>(getNameInit());
1296 return NameString->getValue();
1299 Init *VarInit::getBit(unsigned Bit) const {
1300 if (getType() == BitRecTy::get())
1301 return const_cast<VarInit*>(this);
1302 return VarBitInit::get(const_cast<VarInit*>(this), Bit);
1305 Init *VarInit::resolveListElementReference(Record &R,
1306 const RecordVal *IRV,
1307 unsigned Elt) const {
1308 if (R.isTemplateArg(getNameInit())) return nullptr;
1309 if (IRV && IRV->getNameInit() != getNameInit()) return nullptr;
1311 RecordVal *RV = R.getValue(getNameInit());
1312 assert(RV && "Reference to a non-existent variable?");
1313 ListInit *LI = dyn_cast<ListInit>(RV->getValue());
1315 TypedInit *VI = cast<TypedInit>(RV->getValue());
1316 return VarListElementInit::get(VI, Elt);
1319 if (Elt >= LI->getSize())
1320 return nullptr; // Out of range reference.
1321 Init *E = LI->getElement(Elt);
1322 // If the element is set to some value, or if we are resolving a reference
1323 // to a specific variable and that variable is explicitly unset, then
1324 // replace the VarListElementInit with it.
1325 if (IRV || !isa<UnsetInit>(E))
1331 RecTy *VarInit::getFieldType(const std::string &FieldName) const {
1332 if (RecordRecTy *RTy = dyn_cast<RecordRecTy>(getType()))
1333 if (const RecordVal *RV = RTy->getRecord()->getValue(FieldName))
1334 return RV->getType();
1338 Init *VarInit::getFieldInit(Record &R, const RecordVal *RV,
1339 const std::string &FieldName) const {
1340 if (isa<RecordRecTy>(getType()))
1341 if (const RecordVal *Val = R.getValue(VarName)) {
1342 if (RV != Val && (RV || isa<UnsetInit>(Val->getValue())))
1344 Init *TheInit = Val->getValue();
1345 assert(TheInit != this && "Infinite loop detected!");
1346 if (Init *I = TheInit->getFieldInit(R, RV, FieldName))
1354 /// resolveReferences - This method is used by classes that refer to other
1355 /// variables which may not be defined at the time the expression is formed.
1356 /// If a value is set for the variable later, this method will be called on
1357 /// users of the value to allow the value to propagate out.
1359 Init *VarInit::resolveReferences(Record &R, const RecordVal *RV) const {
1360 if (RecordVal *Val = R.getValue(VarName))
1361 if (RV == Val || (!RV && !isa<UnsetInit>(Val->getValue())))
1362 return Val->getValue();
1363 return const_cast<VarInit *>(this);
1366 VarBitInit *VarBitInit::get(TypedInit *T, unsigned B) {
1367 typedef std::pair<TypedInit *, unsigned> Key;
1368 static DenseMap<Key, std::unique_ptr<VarBitInit>> ThePool;
1370 Key TheKey(std::make_pair(T, B));
1372 std::unique_ptr<VarBitInit> &I = ThePool[TheKey];
1373 if (!I) I.reset(new VarBitInit(T, B));
1377 std::string VarBitInit::getAsString() const {
1378 return TI->getAsString() + "{" + utostr(Bit) + "}";
1381 Init *VarBitInit::resolveReferences(Record &R, const RecordVal *RV) const {
1382 Init *I = TI->resolveReferences(R, RV);
1384 return I->getBit(getBitNum());
1386 return const_cast<VarBitInit*>(this);
1389 VarListElementInit *VarListElementInit::get(TypedInit *T,
1391 typedef std::pair<TypedInit *, unsigned> Key;
1392 static DenseMap<Key, std::unique_ptr<VarListElementInit>> ThePool;
1394 Key TheKey(std::make_pair(T, E));
1396 std::unique_ptr<VarListElementInit> &I = ThePool[TheKey];
1397 if (!I) I.reset(new VarListElementInit(T, E));
1401 std::string VarListElementInit::getAsString() const {
1402 return TI->getAsString() + "[" + utostr(Element) + "]";
1406 VarListElementInit::resolveReferences(Record &R, const RecordVal *RV) const {
1407 if (Init *I = getVariable()->resolveListElementReference(R, RV,
1410 return const_cast<VarListElementInit *>(this);
1413 Init *VarListElementInit::getBit(unsigned Bit) const {
1414 if (getType() == BitRecTy::get())
1415 return const_cast<VarListElementInit*>(this);
1416 return VarBitInit::get(const_cast<VarListElementInit*>(this), Bit);
1419 Init *VarListElementInit:: resolveListElementReference(Record &R,
1420 const RecordVal *RV,
1421 unsigned Elt) const {
1422 Init *Result = TI->resolveListElementReference(R, RV, Element);
1425 if (TypedInit *TInit = dyn_cast<TypedInit>(Result)) {
1426 Init *Result2 = TInit->resolveListElementReference(R, RV, Elt);
1427 if (Result2) return Result2;
1428 return VarListElementInit::get(TInit, Elt);
1436 DefInit *DefInit::get(Record *R) {
1437 return R->getDefInit();
1440 RecTy *DefInit::getFieldType(const std::string &FieldName) const {
1441 if (const RecordVal *RV = Def->getValue(FieldName))
1442 return RV->getType();
1446 Init *DefInit::getFieldInit(Record &R, const RecordVal *RV,
1447 const std::string &FieldName) const {
1448 return Def->getValue(FieldName)->getValue();
1452 std::string DefInit::getAsString() const {
1453 return Def->getName();
1456 FieldInit *FieldInit::get(Init *R, const std::string &FN) {
1457 typedef std::pair<Init *, TableGenStringKey> Key;
1458 static DenseMap<Key, std::unique_ptr<FieldInit>> ThePool;
1460 Key TheKey(std::make_pair(R, FN));
1462 std::unique_ptr<FieldInit> &I = ThePool[TheKey];
1463 if (!I) I.reset(new FieldInit(R, FN));
1467 Init *FieldInit::getBit(unsigned Bit) const {
1468 if (getType() == BitRecTy::get())
1469 return const_cast<FieldInit*>(this);
1470 return VarBitInit::get(const_cast<FieldInit*>(this), Bit);
1473 Init *FieldInit::resolveListElementReference(Record &R, const RecordVal *RV,
1474 unsigned Elt) const {
1475 if (Init *ListVal = Rec->getFieldInit(R, RV, FieldName))
1476 if (ListInit *LI = dyn_cast<ListInit>(ListVal)) {
1477 if (Elt >= LI->getSize()) return nullptr;
1478 Init *E = LI->getElement(Elt);
1480 // If the element is set to some value, or if we are resolving a
1481 // reference to a specific variable and that variable is explicitly
1482 // unset, then replace the VarListElementInit with it.
1483 if (RV || !isa<UnsetInit>(E))
1489 Init *FieldInit::resolveReferences(Record &R, const RecordVal *RV) const {
1490 Init *NewRec = RV ? Rec->resolveReferences(R, RV) : Rec;
1492 Init *BitsVal = NewRec->getFieldInit(R, RV, FieldName);
1494 Init *BVR = BitsVal->resolveReferences(R, RV);
1495 return BVR->isComplete() ? BVR : const_cast<FieldInit *>(this);
1498 if (NewRec != Rec) {
1499 return FieldInit::get(NewRec, FieldName);
1501 return const_cast<FieldInit *>(this);
1504 static void ProfileDagInit(FoldingSetNodeID &ID, Init *V, const std::string &VN,
1505 ArrayRef<Init *> ArgRange,
1506 ArrayRef<std::string> NameRange) {
1510 ArrayRef<Init *>::iterator Arg = ArgRange.begin();
1511 ArrayRef<std::string>::iterator Name = NameRange.begin();
1512 while (Arg != ArgRange.end()) {
1513 assert(Name != NameRange.end() && "Arg name underflow!");
1514 ID.AddPointer(*Arg++);
1515 ID.AddString(*Name++);
1517 assert(Name == NameRange.end() && "Arg name overflow!");
1521 DagInit::get(Init *V, const std::string &VN,
1522 ArrayRef<Init *> ArgRange,
1523 ArrayRef<std::string> NameRange) {
1524 static FoldingSet<DagInit> ThePool;
1525 static std::vector<std::unique_ptr<DagInit>> TheActualPool;
1527 FoldingSetNodeID ID;
1528 ProfileDagInit(ID, V, VN, ArgRange, NameRange);
1531 if (DagInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
1534 DagInit *I = new DagInit(V, VN, ArgRange, NameRange);
1535 ThePool.InsertNode(I, IP);
1536 TheActualPool.push_back(std::unique_ptr<DagInit>(I));
1541 DagInit::get(Init *V, const std::string &VN,
1542 const std::vector<std::pair<Init*, std::string> > &args) {
1543 typedef std::pair<Init*, std::string> PairType;
1545 std::vector<Init *> Args;
1546 std::vector<std::string> Names;
1548 for (std::vector<PairType>::const_iterator i = args.begin(),
1552 Args.push_back(i->first);
1553 Names.push_back(i->second);
1556 return DagInit::get(V, VN, Args, Names);
1559 void DagInit::Profile(FoldingSetNodeID &ID) const {
1560 ProfileDagInit(ID, Val, ValName, Args, ArgNames);
1563 Init *DagInit::resolveReferences(Record &R, const RecordVal *RV) const {
1564 std::vector<Init*> NewArgs;
1565 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1566 NewArgs.push_back(Args[i]->resolveReferences(R, RV));
1568 Init *Op = Val->resolveReferences(R, RV);
1570 if (Args != NewArgs || Op != Val)
1571 return DagInit::get(Op, ValName, NewArgs, ArgNames);
1573 return const_cast<DagInit *>(this);
1577 std::string DagInit::getAsString() const {
1578 std::string Result = "(" + Val->getAsString();
1579 if (!ValName.empty())
1580 Result += ":" + ValName;
1581 if (!Args.empty()) {
1582 Result += " " + Args[0]->getAsString();
1583 if (!ArgNames[0].empty()) Result += ":$" + ArgNames[0];
1584 for (unsigned i = 1, e = Args.size(); i != e; ++i) {
1585 Result += ", " + Args[i]->getAsString();
1586 if (!ArgNames[i].empty()) Result += ":$" + ArgNames[i];
1589 return Result + ")";
1593 //===----------------------------------------------------------------------===//
1594 // Other implementations
1595 //===----------------------------------------------------------------------===//
1597 RecordVal::RecordVal(Init *N, RecTy *T, unsigned P)
1598 : Name(N), Ty(T), Prefix(P) {
1599 Value = Ty->convertValue(UnsetInit::get());
1600 assert(Value && "Cannot create unset value for current type!");
1603 RecordVal::RecordVal(const std::string &N, RecTy *T, unsigned P)
1604 : Name(StringInit::get(N)), Ty(T), Prefix(P) {
1605 Value = Ty->convertValue(UnsetInit::get());
1606 assert(Value && "Cannot create unset value for current type!");
1609 const std::string &RecordVal::getName() const {
1610 return cast<StringInit>(Name)->getValue();
1613 void RecordVal::dump() const { errs() << *this; }
1615 void RecordVal::print(raw_ostream &OS, bool PrintSem) const {
1616 if (getPrefix()) OS << "field ";
1617 OS << *getType() << " " << getNameInitAsString();
1620 OS << " = " << *getValue();
1622 if (PrintSem) OS << ";\n";
1625 unsigned Record::LastID = 0;
1627 void Record::init() {
1630 // Every record potentially has a def at the top. This value is
1631 // replaced with the top-level def name at instantiation time.
1632 RecordVal DN("NAME", StringRecTy::get(), 0);
1636 void Record::checkName() {
1637 // Ensure the record name has string type.
1638 const TypedInit *TypedName = cast<const TypedInit>(Name);
1639 RecTy *Type = TypedName->getType();
1640 if (!isa<StringRecTy>(Type))
1641 PrintFatalError(getLoc(), "Record name is not a string!");
1644 DefInit *Record::getDefInit() {
1645 static DenseMap<Record *, std::unique_ptr<DefInit>> ThePool;
1649 std::unique_ptr<DefInit> &I = ThePool[this];
1650 if (!I) I.reset(new DefInit(this, new RecordRecTy(this)));
1654 const std::string &Record::getName() const {
1655 return cast<StringInit>(Name)->getValue();
1658 void Record::setName(Init *NewName) {
1661 // DO NOT resolve record values to the name at this point because
1662 // there might be default values for arguments of this def. Those
1663 // arguments might not have been resolved yet so we don't want to
1664 // prematurely assume values for those arguments were not passed to
1667 // Nonetheless, it may be that some of this Record's values
1668 // reference the record name. Indeed, the reason for having the
1669 // record name be an Init is to provide this flexibility. The extra
1670 // resolve steps after completely instantiating defs takes care of
1671 // this. See TGParser::ParseDef and TGParser::ParseDefm.
1674 void Record::setName(const std::string &Name) {
1675 setName(StringInit::get(Name));
1678 /// resolveReferencesTo - If anything in this record refers to RV, replace the
1679 /// reference to RV with the RHS of RV. If RV is null, we resolve all possible
1681 void Record::resolveReferencesTo(const RecordVal *RV) {
1682 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1683 if (RV == &Values[i]) // Skip resolve the same field as the given one
1685 if (Init *V = Values[i].getValue())
1686 if (Values[i].setValue(V->resolveReferences(*this, RV)))
1687 PrintFatalError(getLoc(), "Invalid value is found when setting '"
1688 + Values[i].getNameInitAsString()
1689 + "' after resolving references"
1690 + (RV ? " against '" + RV->getNameInitAsString()
1692 + RV->getValue()->getAsUnquotedString() + ")"
1696 Init *OldName = getNameInit();
1697 Init *NewName = Name->resolveReferences(*this, RV);
1698 if (NewName != OldName) {
1699 // Re-register with RecordKeeper.
1704 void Record::dump() const { errs() << *this; }
1706 raw_ostream &llvm::operator<<(raw_ostream &OS, const Record &R) {
1707 OS << R.getNameInitAsString();
1709 const std::vector<Init *> &TArgs = R.getTemplateArgs();
1710 if (!TArgs.empty()) {
1712 for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
1714 const RecordVal *RV = R.getValue(TArgs[i]);
1715 assert(RV && "Template argument record not found??");
1716 RV->print(OS, false);
1722 const std::vector<Record*> &SC = R.getSuperClasses();
1725 for (unsigned i = 0, e = SC.size(); i != e; ++i)
1726 OS << " " << SC[i]->getNameInitAsString();
1730 const std::vector<RecordVal> &Vals = R.getValues();
1731 for (unsigned i = 0, e = Vals.size(); i != e; ++i)
1732 if (Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName()))
1734 for (unsigned i = 0, e = Vals.size(); i != e; ++i)
1735 if (!Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName()))
1741 /// getValueInit - Return the initializer for a value with the specified name,
1742 /// or abort if the field does not exist.
1744 Init *Record::getValueInit(StringRef FieldName) const {
1745 const RecordVal *R = getValue(FieldName);
1746 if (!R || !R->getValue())
1747 PrintFatalError(getLoc(), "Record `" + getName() +
1748 "' does not have a field named `" + FieldName + "'!\n");
1749 return R->getValue();
1753 /// getValueAsString - This method looks up the specified field and returns its
1754 /// value as a string, aborts if the field does not exist or if
1755 /// the value is not a string.
1757 std::string Record::getValueAsString(StringRef FieldName) const {
1758 const RecordVal *R = getValue(FieldName);
1759 if (!R || !R->getValue())
1760 PrintFatalError(getLoc(), "Record `" + getName() +
1761 "' does not have a field named `" + FieldName + "'!\n");
1763 if (StringInit *SI = dyn_cast<StringInit>(R->getValue()))
1764 return SI->getValue();
1765 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1766 FieldName + "' does not have a string initializer!");
1769 /// getValueAsBitsInit - This method looks up the specified field and returns
1770 /// its value as a BitsInit, aborts if the field does not exist or if
1771 /// the value is not the right type.
1773 BitsInit *Record::getValueAsBitsInit(StringRef FieldName) const {
1774 const RecordVal *R = getValue(FieldName);
1775 if (!R || !R->getValue())
1776 PrintFatalError(getLoc(), "Record `" + getName() +
1777 "' does not have a field named `" + FieldName + "'!\n");
1779 if (BitsInit *BI = dyn_cast<BitsInit>(R->getValue()))
1781 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1782 FieldName + "' does not have a BitsInit initializer!");
1785 /// getValueAsListInit - This method looks up the specified field and returns
1786 /// its value as a ListInit, aborting if the field does not exist or if
1787 /// the value is not the right type.
1789 ListInit *Record::getValueAsListInit(StringRef FieldName) const {
1790 const RecordVal *R = getValue(FieldName);
1791 if (!R || !R->getValue())
1792 PrintFatalError(getLoc(), "Record `" + getName() +
1793 "' does not have a field named `" + FieldName + "'!\n");
1795 if (ListInit *LI = dyn_cast<ListInit>(R->getValue()))
1797 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1798 FieldName + "' does not have a list initializer!");
1801 /// getValueAsListOfDefs - This method looks up the specified field and returns
1802 /// its value as a vector of records, aborting if the field does not exist
1803 /// or if the value is not the right type.
1805 std::vector<Record*>
1806 Record::getValueAsListOfDefs(StringRef FieldName) const {
1807 ListInit *List = getValueAsListInit(FieldName);
1808 std::vector<Record*> Defs;
1809 for (unsigned i = 0; i < List->getSize(); i++) {
1810 if (DefInit *DI = dyn_cast<DefInit>(List->getElement(i))) {
1811 Defs.push_back(DI->getDef());
1813 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1814 FieldName + "' list is not entirely DefInit!");
1820 /// getValueAsInt - This method looks up the specified field and returns its
1821 /// value as an int64_t, aborting if the field does not exist or if the value
1822 /// is not the right type.
1824 int64_t Record::getValueAsInt(StringRef FieldName) const {
1825 const RecordVal *R = getValue(FieldName);
1826 if (!R || !R->getValue())
1827 PrintFatalError(getLoc(), "Record `" + getName() +
1828 "' does not have a field named `" + FieldName + "'!\n");
1830 if (IntInit *II = dyn_cast<IntInit>(R->getValue()))
1831 return II->getValue();
1832 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1833 FieldName + "' does not have an int initializer!");
1836 /// getValueAsListOfInts - This method looks up the specified field and returns
1837 /// its value as a vector of integers, aborting if the field does not exist or
1838 /// if the value is not the right type.
1840 std::vector<int64_t>
1841 Record::getValueAsListOfInts(StringRef FieldName) const {
1842 ListInit *List = getValueAsListInit(FieldName);
1843 std::vector<int64_t> Ints;
1844 for (unsigned i = 0; i < List->getSize(); i++) {
1845 if (IntInit *II = dyn_cast<IntInit>(List->getElement(i))) {
1846 Ints.push_back(II->getValue());
1848 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1849 FieldName + "' does not have a list of ints initializer!");
1855 /// getValueAsListOfStrings - This method looks up the specified field and
1856 /// returns its value as a vector of strings, aborting if the field does not
1857 /// exist or if the value is not the right type.
1859 std::vector<std::string>
1860 Record::getValueAsListOfStrings(StringRef FieldName) const {
1861 ListInit *List = getValueAsListInit(FieldName);
1862 std::vector<std::string> Strings;
1863 for (unsigned i = 0; i < List->getSize(); i++) {
1864 if (StringInit *II = dyn_cast<StringInit>(List->getElement(i))) {
1865 Strings.push_back(II->getValue());
1867 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1868 FieldName + "' does not have a list of strings initializer!");
1874 /// getValueAsDef - This method looks up the specified field and returns its
1875 /// value as a Record, aborting if the field does not exist or if the value
1876 /// is not the right type.
1878 Record *Record::getValueAsDef(StringRef FieldName) const {
1879 const RecordVal *R = getValue(FieldName);
1880 if (!R || !R->getValue())
1881 PrintFatalError(getLoc(), "Record `" + getName() +
1882 "' does not have a field named `" + FieldName + "'!\n");
1884 if (DefInit *DI = dyn_cast<DefInit>(R->getValue()))
1885 return DI->getDef();
1886 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1887 FieldName + "' does not have a def initializer!");
1890 /// getValueAsBit - This method looks up the specified field and returns its
1891 /// value as a bit, aborting if the field does not exist or if the value is
1892 /// not the right type.
1894 bool Record::getValueAsBit(StringRef FieldName) const {
1895 const RecordVal *R = getValue(FieldName);
1896 if (!R || !R->getValue())
1897 PrintFatalError(getLoc(), "Record `" + getName() +
1898 "' does not have a field named `" + FieldName + "'!\n");
1900 if (BitInit *BI = dyn_cast<BitInit>(R->getValue()))
1901 return BI->getValue();
1902 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1903 FieldName + "' does not have a bit initializer!");
1906 bool Record::getValueAsBitOrUnset(StringRef FieldName, bool &Unset) const {
1907 const RecordVal *R = getValue(FieldName);
1908 if (!R || !R->getValue())
1909 PrintFatalError(getLoc(), "Record `" + getName() +
1910 "' does not have a field named `" + FieldName.str() + "'!\n");
1912 if (isa<UnsetInit>(R->getValue())) {
1917 if (BitInit *BI = dyn_cast<BitInit>(R->getValue()))
1918 return BI->getValue();
1919 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1920 FieldName + "' does not have a bit initializer!");
1923 /// getValueAsDag - This method looks up the specified field and returns its
1924 /// value as an Dag, aborting if the field does not exist or if the value is
1925 /// not the right type.
1927 DagInit *Record::getValueAsDag(StringRef FieldName) const {
1928 const RecordVal *R = getValue(FieldName);
1929 if (!R || !R->getValue())
1930 PrintFatalError(getLoc(), "Record `" + getName() +
1931 "' does not have a field named `" + FieldName + "'!\n");
1933 if (DagInit *DI = dyn_cast<DagInit>(R->getValue()))
1935 PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
1936 FieldName + "' does not have a dag initializer!");
1940 void MultiClass::dump() const {
1941 errs() << "Record:\n";
1944 errs() << "Defs:\n";
1945 for (RecordVector::const_iterator r = DefPrototypes.begin(),
1946 rend = DefPrototypes.end();
1954 void RecordKeeper::dump() const { errs() << *this; }
1956 raw_ostream &llvm::operator<<(raw_ostream &OS, const RecordKeeper &RK) {
1957 OS << "------------- Classes -----------------\n";
1958 const auto &Classes = RK.getClasses();
1959 for (const auto &C : Classes)
1960 OS << "class " << *C.second;
1962 OS << "------------- Defs -----------------\n";
1963 const auto &Defs = RK.getDefs();
1964 for (const auto &D : Defs)
1965 OS << "def " << *D.second;
1970 /// getAllDerivedDefinitions - This method returns all concrete definitions
1971 /// that derive from the specified class name. If a class with the specified
1972 /// name does not exist, an error is printed and true is returned.
1973 std::vector<Record*>
1974 RecordKeeper::getAllDerivedDefinitions(const std::string &ClassName) const {
1975 Record *Class = getClass(ClassName);
1977 PrintFatalError("ERROR: Couldn't find the `" + ClassName + "' class!\n");
1979 std::vector<Record*> Defs;
1980 for (const auto &D : getDefs())
1981 if (D.second->isSubClassOf(Class))
1982 Defs.push_back(D.second.get());
1987 /// QualifyName - Return an Init with a qualifier prefix referring
1988 /// to CurRec's name.
1989 Init *llvm::QualifyName(Record &CurRec, MultiClass *CurMultiClass,
1990 Init *Name, const std::string &Scoper) {
1991 RecTy *Type = cast<TypedInit>(Name)->getType();
1993 BinOpInit *NewName =
1994 BinOpInit::get(BinOpInit::STRCONCAT,
1995 BinOpInit::get(BinOpInit::STRCONCAT,
1996 CurRec.getNameInit(),
1997 StringInit::get(Scoper),
1998 Type)->Fold(&CurRec, CurMultiClass),
2002 if (CurMultiClass && Scoper != "::") {
2004 BinOpInit::get(BinOpInit::STRCONCAT,
2005 BinOpInit::get(BinOpInit::STRCONCAT,
2006 CurMultiClass->Rec.getNameInit(),
2007 StringInit::get("::"),
2008 Type)->Fold(&CurRec, CurMultiClass),
2009 NewName->Fold(&CurRec, CurMultiClass),
2013 return NewName->Fold(&CurRec, CurMultiClass);
2016 /// QualifyName - Return an Init with a qualifier prefix referring
2017 /// to CurRec's name.
2018 Init *llvm::QualifyName(Record &CurRec, MultiClass *CurMultiClass,
2019 const std::string &Name,
2020 const std::string &Scoper) {
2021 return QualifyName(CurRec, CurMultiClass, StringInit::get(Name), Scoper);