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/TableGen/Error.h"
16 #include "llvm/Support/DataTypes.h"
17 #include "llvm/Support/ErrorHandling.h"
18 #include "llvm/Support/Format.h"
19 #include "llvm/ADT/DenseMap.h"
20 #include "llvm/ADT/FoldingSet.h"
21 #include "llvm/ADT/Hashing.h"
22 #include "llvm/ADT/SmallVector.h"
23 #include "llvm/ADT/STLExtras.h"
24 #include "llvm/ADT/StringExtras.h"
25 #include "llvm/ADT/StringMap.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 = new ListRecTy(this);
98 Init *BitRecTy::convertValue(BitsInit *BI) {
99 if (BI->getNumBits() != 1) return 0; // Only accept if just one bit!
100 return BI->getBit(0);
103 bool BitRecTy::baseClassOf(const BitsRecTy *RHS) const {
104 return RHS->getNumBits() == 1;
107 Init *BitRecTy::convertValue(IntInit *II) {
108 int64_t Val = II->getValue();
109 if (Val != 0 && Val != 1) return 0; // Only accept 0 or 1 for a bit!
111 return BitInit::get(Val != 0);
114 Init *BitRecTy::convertValue(TypedInit *VI) {
115 if (dynamic_cast<BitRecTy*>(VI->getType()))
116 return VI; // Accept variable if it is already of bit type!
120 BitsRecTy *BitsRecTy::get(unsigned Sz) {
121 static std::vector<BitsRecTy*> Shared;
122 if (Sz >= Shared.size())
123 Shared.resize(Sz + 1);
124 BitsRecTy *&Ty = Shared[Sz];
126 Ty = new BitsRecTy(Sz);
130 std::string BitsRecTy::getAsString() const {
131 return "bits<" + utostr(Size) + ">";
134 Init *BitsRecTy::convertValue(UnsetInit *UI) {
135 SmallVector<Init *, 16> NewBits(Size);
137 for (unsigned i = 0; i != Size; ++i)
138 NewBits[i] = UnsetInit::get();
140 return BitsInit::get(NewBits);
143 Init *BitsRecTy::convertValue(BitInit *UI) {
144 if (Size != 1) return 0; // Can only convert single bit.
145 return BitsInit::get(UI);
148 /// canFitInBitfield - Return true if the number of bits is large enough to hold
149 /// the integer value.
150 static bool canFitInBitfield(int64_t Value, unsigned NumBits) {
151 // For example, with NumBits == 4, we permit Values from [-7 .. 15].
152 return (NumBits >= sizeof(Value) * 8) ||
153 (Value >> NumBits == 0) || (Value >> (NumBits-1) == -1);
156 /// convertValue from Int initializer to bits type: Split the integer up into the
157 /// appropriate bits.
159 Init *BitsRecTy::convertValue(IntInit *II) {
160 int64_t Value = II->getValue();
161 // Make sure this bitfield is large enough to hold the integer value.
162 if (!canFitInBitfield(Value, Size))
165 SmallVector<Init *, 16> NewBits(Size);
167 for (unsigned i = 0; i != Size; ++i)
168 NewBits[i] = BitInit::get(Value & (1LL << i));
170 return BitsInit::get(NewBits);
173 Init *BitsRecTy::convertValue(BitsInit *BI) {
174 // If the number of bits is right, return it. Otherwise we need to expand or
176 if (BI->getNumBits() == Size) return BI;
180 Init *BitsRecTy::convertValue(TypedInit *VI) {
181 if (BitsRecTy *BRT = dynamic_cast<BitsRecTy*>(VI->getType()))
182 if (BRT->Size == Size) {
183 SmallVector<Init *, 16> NewBits(Size);
185 for (unsigned i = 0; i != Size; ++i)
186 NewBits[i] = VarBitInit::get(VI, i);
187 return BitsInit::get(NewBits);
190 if (Size == 1 && dynamic_cast<BitRecTy*>(VI->getType()))
191 return BitsInit::get(VI);
193 if (TernOpInit *Tern = dynamic_cast<TernOpInit*>(VI)) {
194 if (Tern->getOpcode() == TernOpInit::IF) {
195 Init *LHS = Tern->getLHS();
196 Init *MHS = Tern->getMHS();
197 Init *RHS = Tern->getRHS();
199 IntInit *MHSi = dynamic_cast<IntInit*>(MHS);
200 IntInit *RHSi = dynamic_cast<IntInit*>(RHS);
203 int64_t MHSVal = MHSi->getValue();
204 int64_t RHSVal = RHSi->getValue();
206 if (canFitInBitfield(MHSVal, Size) && canFitInBitfield(RHSVal, Size)) {
207 SmallVector<Init *, 16> NewBits(Size);
209 for (unsigned i = 0; i != Size; ++i)
211 TernOpInit::get(TernOpInit::IF, LHS,
212 IntInit::get((MHSVal & (1LL << i)) ? 1 : 0),
213 IntInit::get((RHSVal & (1LL << i)) ? 1 : 0),
216 return BitsInit::get(NewBits);
219 BitsInit *MHSbs = dynamic_cast<BitsInit*>(MHS);
220 BitsInit *RHSbs = dynamic_cast<BitsInit*>(RHS);
222 if (MHSbs && RHSbs) {
223 SmallVector<Init *, 16> NewBits(Size);
225 for (unsigned i = 0; i != Size; ++i)
226 NewBits[i] = TernOpInit::get(TernOpInit::IF, LHS,
231 return BitsInit::get(NewBits);
240 Init *IntRecTy::convertValue(BitInit *BI) {
241 return IntInit::get(BI->getValue());
244 Init *IntRecTy::convertValue(BitsInit *BI) {
246 for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i)
247 if (BitInit *Bit = dynamic_cast<BitInit*>(BI->getBit(i))) {
248 Result |= Bit->getValue() << i;
252 return IntInit::get(Result);
255 Init *IntRecTy::convertValue(TypedInit *TI) {
256 if (TI->getType()->typeIsConvertibleTo(this))
257 return TI; // Accept variable if already of the right type!
261 Init *StringRecTy::convertValue(UnOpInit *BO) {
262 if (BO->getOpcode() == UnOpInit::CAST) {
263 Init *L = BO->getOperand()->convertInitializerTo(this);
264 if (L == 0) return 0;
265 if (L != BO->getOperand())
266 return UnOpInit::get(UnOpInit::CAST, L, new StringRecTy);
270 return convertValue((TypedInit*)BO);
273 Init *StringRecTy::convertValue(BinOpInit *BO) {
274 if (BO->getOpcode() == BinOpInit::STRCONCAT) {
275 Init *L = BO->getLHS()->convertInitializerTo(this);
276 Init *R = BO->getRHS()->convertInitializerTo(this);
277 if (L == 0 || R == 0) return 0;
278 if (L != BO->getLHS() || R != BO->getRHS())
279 return BinOpInit::get(BinOpInit::STRCONCAT, L, R, new StringRecTy);
283 return convertValue((TypedInit*)BO);
287 Init *StringRecTy::convertValue(TypedInit *TI) {
288 if (dynamic_cast<StringRecTy*>(TI->getType()))
289 return TI; // Accept variable if already of the right type!
293 std::string ListRecTy::getAsString() const {
294 return "list<" + Ty->getAsString() + ">";
297 Init *ListRecTy::convertValue(ListInit *LI) {
298 std::vector<Init*> Elements;
300 // Verify that all of the elements of the list are subclasses of the
301 // appropriate class!
302 for (unsigned i = 0, e = LI->getSize(); i != e; ++i)
303 if (Init *CI = LI->getElement(i)->convertInitializerTo(Ty))
304 Elements.push_back(CI);
308 ListRecTy *LType = dynamic_cast<ListRecTy*>(LI->getType());
313 return ListInit::get(Elements, this);
316 Init *ListRecTy::convertValue(TypedInit *TI) {
317 // Ensure that TI is compatible with our class.
318 if (ListRecTy *LRT = dynamic_cast<ListRecTy*>(TI->getType()))
319 if (LRT->getElementType()->typeIsConvertibleTo(getElementType()))
324 Init *DagRecTy::convertValue(TypedInit *TI) {
325 if (TI->getType()->typeIsConvertibleTo(this))
330 Init *DagRecTy::convertValue(UnOpInit *BO) {
331 if (BO->getOpcode() == UnOpInit::CAST) {
332 Init *L = BO->getOperand()->convertInitializerTo(this);
333 if (L == 0) return 0;
334 if (L != BO->getOperand())
335 return UnOpInit::get(UnOpInit::CAST, L, new DagRecTy);
341 Init *DagRecTy::convertValue(BinOpInit *BO) {
342 if (BO->getOpcode() == BinOpInit::CONCAT) {
343 Init *L = BO->getLHS()->convertInitializerTo(this);
344 Init *R = BO->getRHS()->convertInitializerTo(this);
345 if (L == 0 || R == 0) return 0;
346 if (L != BO->getLHS() || R != BO->getRHS())
347 return BinOpInit::get(BinOpInit::CONCAT, L, R, new DagRecTy);
353 RecordRecTy *RecordRecTy::get(Record *R) {
354 return &dynamic_cast<RecordRecTy&>(*R->getDefInit()->getType());
357 std::string RecordRecTy::getAsString() const {
358 return Rec->getName();
361 Init *RecordRecTy::convertValue(DefInit *DI) {
362 // Ensure that DI is a subclass of Rec.
363 if (!DI->getDef()->isSubClassOf(Rec))
368 Init *RecordRecTy::convertValue(TypedInit *TI) {
369 // Ensure that TI is compatible with Rec.
370 if (RecordRecTy *RRT = dynamic_cast<RecordRecTy*>(TI->getType()))
371 if (RRT->getRecord()->isSubClassOf(getRecord()) ||
372 RRT->getRecord() == getRecord())
377 bool RecordRecTy::baseClassOf(const RecordRecTy *RHS) const {
378 if (Rec == RHS->getRecord() || RHS->getRecord()->isSubClassOf(Rec))
381 const std::vector<Record*> &SC = Rec->getSuperClasses();
382 for (unsigned i = 0, e = SC.size(); i != e; ++i)
383 if (RHS->getRecord()->isSubClassOf(SC[i]))
390 /// resolveTypes - Find a common type that T1 and T2 convert to.
391 /// Return 0 if no such type exists.
393 RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) {
394 if (!T1->typeIsConvertibleTo(T2)) {
395 if (!T2->typeIsConvertibleTo(T1)) {
396 // If one is a Record type, check superclasses
397 RecordRecTy *RecTy1 = dynamic_cast<RecordRecTy*>(T1);
399 // See if T2 inherits from a type T1 also inherits from
400 const std::vector<Record *> &T1SuperClasses =
401 RecTy1->getRecord()->getSuperClasses();
402 for(std::vector<Record *>::const_iterator i = T1SuperClasses.begin(),
403 iend = T1SuperClasses.end();
406 RecordRecTy *SuperRecTy1 = RecordRecTy::get(*i);
407 RecTy *NewType1 = resolveTypes(SuperRecTy1, T2);
409 if (NewType1 != SuperRecTy1) {
416 RecordRecTy *RecTy2 = dynamic_cast<RecordRecTy*>(T2);
418 // See if T1 inherits from a type T2 also inherits from
419 const std::vector<Record *> &T2SuperClasses =
420 RecTy2->getRecord()->getSuperClasses();
421 for (std::vector<Record *>::const_iterator i = T2SuperClasses.begin(),
422 iend = T2SuperClasses.end();
425 RecordRecTy *SuperRecTy2 = RecordRecTy::get(*i);
426 RecTy *NewType2 = resolveTypes(T1, SuperRecTy2);
428 if (NewType2 != SuperRecTy2) {
443 //===----------------------------------------------------------------------===//
444 // Initializer implementations
445 //===----------------------------------------------------------------------===//
447 void Init::anchor() { }
448 void Init::dump() const { return print(errs()); }
450 void UnsetInit::anchor() { }
452 UnsetInit *UnsetInit::get() {
453 static UnsetInit TheInit;
457 void BitInit::anchor() { }
459 BitInit *BitInit::get(bool V) {
460 static BitInit True(true);
461 static BitInit False(false);
463 return V ? &True : &False;
467 ProfileBitsInit(FoldingSetNodeID &ID, ArrayRef<Init *> Range) {
468 ID.AddInteger(Range.size());
470 for (ArrayRef<Init *>::iterator i = Range.begin(),
477 BitsInit *BitsInit::get(ArrayRef<Init *> Range) {
478 typedef FoldingSet<BitsInit> Pool;
482 ProfileBitsInit(ID, Range);
485 if (BitsInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
488 BitsInit *I = new BitsInit(Range);
489 ThePool.InsertNode(I, IP);
494 void BitsInit::Profile(FoldingSetNodeID &ID) const {
495 ProfileBitsInit(ID, Bits);
499 BitsInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) const {
500 SmallVector<Init *, 16> NewBits(Bits.size());
502 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
503 if (Bits[i] >= getNumBits())
505 NewBits[i] = getBit(Bits[i]);
507 return BitsInit::get(NewBits);
510 std::string BitsInit::getAsString() const {
511 std::string Result = "{ ";
512 for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
513 if (i) Result += ", ";
514 if (Init *Bit = getBit(e-i-1))
515 Result += Bit->getAsString();
519 return Result + " }";
522 // resolveReferences - If there are any field references that refer to fields
523 // that have been filled in, we can propagate the values now.
525 Init *BitsInit::resolveReferences(Record &R, const RecordVal *RV) const {
526 bool Changed = false;
527 SmallVector<Init *, 16> NewBits(getNumBits());
529 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
531 Init *CurBit = getBit(i);
535 CurBit = CurBit->resolveReferences(R, RV);
536 Changed |= B != CurBit;
537 } while (B != CurBit);
542 return BitsInit::get(NewBits);
544 return const_cast<BitsInit *>(this);
547 IntInit *IntInit::get(int64_t V) {
548 typedef DenseMap<int64_t, IntInit *> Pool;
551 IntInit *&I = ThePool[V];
552 if (!I) I = new IntInit(V);
556 std::string IntInit::getAsString() const {
557 return itostr(Value);
561 IntInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) const {
562 SmallVector<Init *, 16> NewBits(Bits.size());
564 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
568 NewBits[i] = BitInit::get(Value & (INT64_C(1) << Bits[i]));
570 return BitsInit::get(NewBits);
573 void StringInit::anchor() { }
575 StringInit *StringInit::get(StringRef V) {
576 typedef StringMap<StringInit *> Pool;
579 StringInit *&I = ThePool[V];
580 if (!I) I = new StringInit(V);
584 static void ProfileListInit(FoldingSetNodeID &ID,
585 ArrayRef<Init *> Range,
587 ID.AddInteger(Range.size());
588 ID.AddPointer(EltTy);
590 for (ArrayRef<Init *>::iterator i = Range.begin(),
597 ListInit *ListInit::get(ArrayRef<Init *> Range, RecTy *EltTy) {
598 typedef FoldingSet<ListInit> Pool;
601 // Just use the FoldingSetNodeID to compute a hash. Use a DenseMap
602 // for actual storage.
604 ProfileListInit(ID, Range, EltTy);
607 if (ListInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
610 ListInit *I = new ListInit(Range, EltTy);
611 ThePool.InsertNode(I, IP);
615 void ListInit::Profile(FoldingSetNodeID &ID) const {
616 ListRecTy *ListType = dynamic_cast<ListRecTy *>(getType());
617 assert(ListType && "Bad type for ListInit!");
618 RecTy *EltTy = ListType->getElementType();
620 ProfileListInit(ID, Values, EltTy);
624 ListInit::convertInitListSlice(const std::vector<unsigned> &Elements) const {
625 std::vector<Init*> Vals;
626 for (unsigned i = 0, e = Elements.size(); i != e; ++i) {
627 if (Elements[i] >= getSize())
629 Vals.push_back(getElement(Elements[i]));
631 return ListInit::get(Vals, getType());
634 Record *ListInit::getElementAsRecord(unsigned i) const {
635 assert(i < Values.size() && "List element index out of range!");
636 DefInit *DI = dynamic_cast<DefInit*>(Values[i]);
637 if (DI == 0) throw "Expected record in list!";
641 Init *ListInit::resolveReferences(Record &R, const RecordVal *RV) const {
642 std::vector<Init*> Resolved;
643 Resolved.reserve(getSize());
644 bool Changed = false;
646 for (unsigned i = 0, e = getSize(); i != e; ++i) {
648 Init *CurElt = getElement(i);
652 CurElt = CurElt->resolveReferences(R, RV);
653 Changed |= E != CurElt;
654 } while (E != CurElt);
655 Resolved.push_back(E);
659 return ListInit::get(Resolved, getType());
660 return const_cast<ListInit *>(this);
663 Init *ListInit::resolveListElementReference(Record &R, const RecordVal *IRV,
664 unsigned Elt) const {
665 if (Elt >= getSize())
666 return 0; // Out of range reference.
667 Init *E = getElement(Elt);
668 // If the element is set to some value, or if we are resolving a reference
669 // to a specific variable and that variable is explicitly unset, then
670 // replace the VarListElementInit with it.
671 if (IRV || !dynamic_cast<UnsetInit*>(E))
676 std::string ListInit::getAsString() const {
677 std::string Result = "[";
678 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
679 if (i) Result += ", ";
680 Result += Values[i]->getAsString();
685 Init *OpInit::resolveBitReference(Record &R, const RecordVal *IRV,
686 unsigned Bit) const {
687 Init *Folded = Fold(&R, 0);
689 if (Folded != this) {
690 TypedInit *Typed = dynamic_cast<TypedInit *>(Folded);
692 return Typed->resolveBitReference(R, IRV, Bit);
699 Init *OpInit::resolveListElementReference(Record &R, const RecordVal *IRV,
700 unsigned Elt) const {
701 Init *Resolved = resolveReferences(R, IRV);
702 OpInit *OResolved = dynamic_cast<OpInit *>(Resolved);
704 Resolved = OResolved->Fold(&R, 0);
707 if (Resolved != this) {
708 TypedInit *Typed = dynamic_cast<TypedInit *>(Resolved);
709 assert(Typed && "Expected typed init for list reference");
711 Init *New = Typed->resolveListElementReference(R, IRV, Elt);
714 return VarListElementInit::get(Typed, Elt);
721 UnOpInit *UnOpInit::get(UnaryOp opc, Init *lhs, RecTy *Type) {
722 typedef std::pair<std::pair<unsigned, Init *>, RecTy *> Key;
724 typedef DenseMap<Key, UnOpInit *> Pool;
727 Key TheKey(std::make_pair(std::make_pair(opc, lhs), Type));
729 UnOpInit *&I = ThePool[TheKey];
730 if (!I) I = new UnOpInit(opc, lhs, Type);
734 Init *UnOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const {
735 switch (getOpcode()) {
737 if (getType()->getAsString() == "string") {
738 StringInit *LHSs = dynamic_cast<StringInit*>(LHS);
743 DefInit *LHSd = dynamic_cast<DefInit*>(LHS);
745 return StringInit::get(LHSd->getDef()->getName());
748 IntInit *LHSi = dynamic_cast<IntInit*>(LHS);
750 return StringInit::get(LHSi->getAsString());
753 StringInit *LHSs = dynamic_cast<StringInit*>(LHS);
755 std::string Name = LHSs->getValue();
757 // From TGParser::ParseIDValue
759 if (const RecordVal *RV = CurRec->getValue(Name)) {
760 if (RV->getType() != getType())
761 throw "type mismatch in cast";
762 return VarInit::get(Name, RV->getType());
765 Init *TemplateArgName = QualifyName(*CurRec, CurMultiClass, Name,
768 if (CurRec->isTemplateArg(TemplateArgName)) {
769 const RecordVal *RV = CurRec->getValue(TemplateArgName);
770 assert(RV && "Template arg doesn't exist??");
772 if (RV->getType() != getType())
773 throw "type mismatch in cast";
775 return VarInit::get(TemplateArgName, RV->getType());
780 Init *MCName = QualifyName(CurMultiClass->Rec, CurMultiClass, Name, "::");
782 if (CurMultiClass->Rec.isTemplateArg(MCName)) {
783 const RecordVal *RV = CurMultiClass->Rec.getValue(MCName);
784 assert(RV && "Template arg doesn't exist??");
786 if (RV->getType() != getType())
787 throw "type mismatch in cast";
789 return VarInit::get(MCName, RV->getType());
793 if (Record *D = (CurRec->getRecords()).getDef(Name))
794 return DefInit::get(D);
796 throw TGError(CurRec->getLoc(), "Undefined reference:'" + Name + "'\n");
802 ListInit *LHSl = dynamic_cast<ListInit*>(LHS);
804 if (LHSl->getSize() == 0) {
805 assert(0 && "Empty list in car");
808 return LHSl->getElement(0);
813 ListInit *LHSl = dynamic_cast<ListInit*>(LHS);
815 if (LHSl->getSize() == 0) {
816 assert(0 && "Empty list in cdr");
819 // Note the +1. We can't just pass the result of getValues()
821 ArrayRef<Init *>::iterator begin = LHSl->getValues().begin()+1;
822 ArrayRef<Init *>::iterator end = LHSl->getValues().end();
824 ListInit::get(ArrayRef<Init *>(begin, end - begin),
831 ListInit *LHSl = dynamic_cast<ListInit*>(LHS);
833 if (LHSl->getSize() == 0) {
834 return IntInit::get(1);
836 return IntInit::get(0);
839 StringInit *LHSs = dynamic_cast<StringInit*>(LHS);
841 if (LHSs->getValue().empty()) {
842 return IntInit::get(1);
844 return IntInit::get(0);
851 return const_cast<UnOpInit *>(this);
854 Init *UnOpInit::resolveReferences(Record &R, const RecordVal *RV) const {
855 Init *lhs = LHS->resolveReferences(R, RV);
858 return (UnOpInit::get(getOpcode(), lhs, getType()))->Fold(&R, 0);
862 std::string UnOpInit::getAsString() const {
865 case CAST: Result = "!cast<" + getType()->getAsString() + ">"; break;
866 case HEAD: Result = "!head"; break;
867 case TAIL: Result = "!tail"; break;
868 case EMPTY: Result = "!empty"; break;
870 return Result + "(" + LHS->getAsString() + ")";
873 BinOpInit *BinOpInit::get(BinaryOp opc, Init *lhs,
874 Init *rhs, RecTy *Type) {
876 std::pair<std::pair<unsigned, Init *>, Init *>,
880 typedef DenseMap<Key, BinOpInit *> Pool;
883 Key TheKey(std::make_pair(std::make_pair(std::make_pair(opc, lhs), rhs),
886 BinOpInit *&I = ThePool[TheKey];
887 if (!I) I = new BinOpInit(opc, lhs, rhs, Type);
891 Init *BinOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const {
892 switch (getOpcode()) {
894 DagInit *LHSs = dynamic_cast<DagInit*>(LHS);
895 DagInit *RHSs = dynamic_cast<DagInit*>(RHS);
897 DefInit *LOp = dynamic_cast<DefInit*>(LHSs->getOperator());
898 DefInit *ROp = dynamic_cast<DefInit*>(RHSs->getOperator());
899 if (LOp == 0 || ROp == 0 || LOp->getDef() != ROp->getDef())
900 throw "Concated Dag operators do not match!";
901 std::vector<Init*> Args;
902 std::vector<std::string> ArgNames;
903 for (unsigned i = 0, e = LHSs->getNumArgs(); i != e; ++i) {
904 Args.push_back(LHSs->getArg(i));
905 ArgNames.push_back(LHSs->getArgName(i));
907 for (unsigned i = 0, e = RHSs->getNumArgs(); i != e; ++i) {
908 Args.push_back(RHSs->getArg(i));
909 ArgNames.push_back(RHSs->getArgName(i));
911 return DagInit::get(LHSs->getOperator(), "", Args, ArgNames);
916 StringInit *LHSs = dynamic_cast<StringInit*>(LHS);
917 StringInit *RHSs = dynamic_cast<StringInit*>(RHS);
919 return StringInit::get(LHSs->getValue() + RHSs->getValue());
923 // try to fold eq comparison for 'bit' and 'int', otherwise fallback
924 // to string objects.
926 dynamic_cast<IntInit*>(LHS->convertInitializerTo(IntRecTy::get()));
928 dynamic_cast<IntInit*>(RHS->convertInitializerTo(IntRecTy::get()));
931 return IntInit::get(L->getValue() == R->getValue());
933 StringInit *LHSs = dynamic_cast<StringInit*>(LHS);
934 StringInit *RHSs = dynamic_cast<StringInit*>(RHS);
936 // Make sure we've resolved
938 return IntInit::get(LHSs->getValue() == RHSs->getValue());
945 IntInit *LHSi = dynamic_cast<IntInit*>(LHS);
946 IntInit *RHSi = dynamic_cast<IntInit*>(RHS);
948 int64_t LHSv = LHSi->getValue(), RHSv = RHSi->getValue();
950 switch (getOpcode()) {
951 default: llvm_unreachable("Bad opcode!");
952 case SHL: Result = LHSv << RHSv; break;
953 case SRA: Result = LHSv >> RHSv; break;
954 case SRL: Result = (uint64_t)LHSv >> (uint64_t)RHSv; break;
956 return IntInit::get(Result);
961 return const_cast<BinOpInit *>(this);
964 Init *BinOpInit::resolveReferences(Record &R, const RecordVal *RV) const {
965 Init *lhs = LHS->resolveReferences(R, RV);
966 Init *rhs = RHS->resolveReferences(R, RV);
968 if (LHS != lhs || RHS != rhs)
969 return (BinOpInit::get(getOpcode(), lhs, rhs, getType()))->Fold(&R, 0);
973 std::string BinOpInit::getAsString() const {
976 case CONCAT: Result = "!con"; break;
977 case SHL: Result = "!shl"; break;
978 case SRA: Result = "!sra"; break;
979 case SRL: Result = "!srl"; break;
980 case EQ: Result = "!eq"; break;
981 case STRCONCAT: Result = "!strconcat"; break;
983 return Result + "(" + LHS->getAsString() + ", " + RHS->getAsString() + ")";
986 TernOpInit *TernOpInit::get(TernaryOp opc, Init *lhs,
987 Init *mhs, Init *rhs,
991 std::pair<std::pair<unsigned, RecTy *>, Init *>,
997 typedef DenseMap<Key, TernOpInit *> Pool;
1000 Key TheKey(std::make_pair(std::make_pair(std::make_pair(std::make_pair(opc,
1006 TernOpInit *&I = ThePool[TheKey];
1007 if (!I) I = new TernOpInit(opc, lhs, mhs, rhs, Type);
1011 static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type,
1012 Record *CurRec, MultiClass *CurMultiClass);
1014 static Init *EvaluateOperation(OpInit *RHSo, Init *LHS, Init *Arg,
1015 RecTy *Type, Record *CurRec,
1016 MultiClass *CurMultiClass) {
1017 std::vector<Init *> NewOperands;
1019 TypedInit *TArg = dynamic_cast<TypedInit*>(Arg);
1021 // If this is a dag, recurse
1022 if (TArg && TArg->getType()->getAsString() == "dag") {
1023 Init *Result = ForeachHelper(LHS, Arg, RHSo, Type,
1024 CurRec, CurMultiClass);
1032 for (int i = 0; i < RHSo->getNumOperands(); ++i) {
1033 OpInit *RHSoo = dynamic_cast<OpInit*>(RHSo->getOperand(i));
1036 Init *Result = EvaluateOperation(RHSoo, LHS, Arg,
1037 Type, CurRec, CurMultiClass);
1039 NewOperands.push_back(Result);
1041 NewOperands.push_back(Arg);
1043 } else if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) {
1044 NewOperands.push_back(Arg);
1046 NewOperands.push_back(RHSo->getOperand(i));
1050 // Now run the operator and use its result as the new leaf
1051 const OpInit *NewOp = RHSo->clone(NewOperands);
1052 Init *NewVal = NewOp->Fold(CurRec, CurMultiClass);
1053 if (NewVal != NewOp)
1059 static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type,
1060 Record *CurRec, MultiClass *CurMultiClass) {
1061 DagInit *MHSd = dynamic_cast<DagInit*>(MHS);
1062 ListInit *MHSl = dynamic_cast<ListInit*>(MHS);
1064 DagRecTy *DagType = dynamic_cast<DagRecTy*>(Type);
1065 ListRecTy *ListType = dynamic_cast<ListRecTy*>(Type);
1067 OpInit *RHSo = dynamic_cast<OpInit*>(RHS);
1070 throw TGError(CurRec->getLoc(), "!foreach requires an operator\n");
1073 TypedInit *LHSt = dynamic_cast<TypedInit*>(LHS);
1076 throw TGError(CurRec->getLoc(), "!foreach requires typed variable\n");
1079 if ((MHSd && DagType) || (MHSl && ListType)) {
1081 Init *Val = MHSd->getOperator();
1082 Init *Result = EvaluateOperation(RHSo, LHS, Val,
1083 Type, CurRec, CurMultiClass);
1088 std::vector<std::pair<Init *, std::string> > args;
1089 for (unsigned int i = 0; i < MHSd->getNumArgs(); ++i) {
1091 std::string ArgName;
1092 Arg = MHSd->getArg(i);
1093 ArgName = MHSd->getArgName(i);
1096 Init *Result = EvaluateOperation(RHSo, LHS, Arg, Type,
1097 CurRec, CurMultiClass);
1102 // TODO: Process arg names
1103 args.push_back(std::make_pair(Arg, ArgName));
1106 return DagInit::get(Val, "", args);
1109 std::vector<Init *> NewOperands;
1110 std::vector<Init *> NewList(MHSl->begin(), MHSl->end());
1112 for (std::vector<Init *>::iterator li = NewList.begin(),
1113 liend = NewList.end();
1117 NewOperands.clear();
1118 for(int i = 0; i < RHSo->getNumOperands(); ++i) {
1119 // First, replace the foreach variable with the list item
1120 if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) {
1121 NewOperands.push_back(Item);
1123 NewOperands.push_back(RHSo->getOperand(i));
1127 // Now run the operator and use its result as the new list item
1128 const OpInit *NewOp = RHSo->clone(NewOperands);
1129 Init *NewItem = NewOp->Fold(CurRec, CurMultiClass);
1130 if (NewItem != NewOp)
1133 return ListInit::get(NewList, MHSl->getType());
1139 Init *TernOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const {
1140 switch (getOpcode()) {
1142 DefInit *LHSd = dynamic_cast<DefInit*>(LHS);
1143 VarInit *LHSv = dynamic_cast<VarInit*>(LHS);
1144 StringInit *LHSs = dynamic_cast<StringInit*>(LHS);
1146 DefInit *MHSd = dynamic_cast<DefInit*>(MHS);
1147 VarInit *MHSv = dynamic_cast<VarInit*>(MHS);
1148 StringInit *MHSs = dynamic_cast<StringInit*>(MHS);
1150 DefInit *RHSd = dynamic_cast<DefInit*>(RHS);
1151 VarInit *RHSv = dynamic_cast<VarInit*>(RHS);
1152 StringInit *RHSs = dynamic_cast<StringInit*>(RHS);
1154 if ((LHSd && MHSd && RHSd)
1155 || (LHSv && MHSv && RHSv)
1156 || (LHSs && MHSs && RHSs)) {
1158 Record *Val = RHSd->getDef();
1159 if (LHSd->getAsString() == RHSd->getAsString()) {
1160 Val = MHSd->getDef();
1162 return DefInit::get(Val);
1165 std::string Val = RHSv->getName();
1166 if (LHSv->getAsString() == RHSv->getAsString()) {
1167 Val = MHSv->getName();
1169 return VarInit::get(Val, getType());
1172 std::string Val = RHSs->getValue();
1174 std::string::size_type found;
1175 std::string::size_type idx = 0;
1177 found = Val.find(LHSs->getValue(), idx);
1178 if (found != std::string::npos) {
1179 Val.replace(found, LHSs->getValue().size(), MHSs->getValue());
1181 idx = found + MHSs->getValue().size();
1182 } while (found != std::string::npos);
1184 return StringInit::get(Val);
1191 Init *Result = ForeachHelper(LHS, MHS, RHS, getType(),
1192 CurRec, CurMultiClass);
1200 IntInit *LHSi = dynamic_cast<IntInit*>(LHS);
1201 if (Init *I = LHS->convertInitializerTo(IntRecTy::get()))
1202 LHSi = dynamic_cast<IntInit*>(I);
1204 if (LHSi->getValue()) {
1214 return const_cast<TernOpInit *>(this);
1217 Init *TernOpInit::resolveReferences(Record &R,
1218 const RecordVal *RV) const {
1219 Init *lhs = LHS->resolveReferences(R, RV);
1221 if (Opc == IF && lhs != LHS) {
1222 IntInit *Value = dynamic_cast<IntInit*>(lhs);
1223 if (Init *I = lhs->convertInitializerTo(IntRecTy::get()))
1224 Value = dynamic_cast<IntInit*>(I);
1227 if (Value->getValue()) {
1228 Init *mhs = MHS->resolveReferences(R, RV);
1229 return (TernOpInit::get(getOpcode(), lhs, mhs,
1230 RHS, getType()))->Fold(&R, 0);
1232 Init *rhs = RHS->resolveReferences(R, RV);
1233 return (TernOpInit::get(getOpcode(), lhs, MHS,
1234 rhs, getType()))->Fold(&R, 0);
1239 Init *mhs = MHS->resolveReferences(R, RV);
1240 Init *rhs = RHS->resolveReferences(R, RV);
1242 if (LHS != lhs || MHS != mhs || RHS != rhs)
1243 return (TernOpInit::get(getOpcode(), lhs, mhs, rhs,
1244 getType()))->Fold(&R, 0);
1248 std::string TernOpInit::getAsString() const {
1251 case SUBST: Result = "!subst"; break;
1252 case FOREACH: Result = "!foreach"; break;
1253 case IF: Result = "!if"; break;
1255 return Result + "(" + LHS->getAsString() + ", " + MHS->getAsString() + ", "
1256 + RHS->getAsString() + ")";
1259 RecTy *TypedInit::getFieldType(const std::string &FieldName) const {
1260 RecordRecTy *RecordType = dynamic_cast<RecordRecTy *>(getType());
1262 RecordVal *Field = RecordType->getRecord()->getValue(FieldName);
1264 return Field->getType();
1271 TypedInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) const {
1272 BitsRecTy *T = dynamic_cast<BitsRecTy*>(getType());
1273 if (T == 0) return 0; // Cannot subscript a non-bits variable.
1274 unsigned NumBits = T->getNumBits();
1276 SmallVector<Init *, 16> NewBits(Bits.size());
1277 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
1278 if (Bits[i] >= NumBits)
1281 NewBits[i] = VarBitInit::get(const_cast<TypedInit *>(this), Bits[i]);
1283 return BitsInit::get(NewBits);
1287 TypedInit::convertInitListSlice(const std::vector<unsigned> &Elements) const {
1288 ListRecTy *T = dynamic_cast<ListRecTy*>(getType());
1289 if (T == 0) return 0; // Cannot subscript a non-list variable.
1291 if (Elements.size() == 1)
1292 return VarListElementInit::get(const_cast<TypedInit *>(this), Elements[0]);
1294 std::vector<Init*> ListInits;
1295 ListInits.reserve(Elements.size());
1296 for (unsigned i = 0, e = Elements.size(); i != e; ++i)
1297 ListInits.push_back(VarListElementInit::get(const_cast<TypedInit *>(this),
1299 return ListInit::get(ListInits, T);
1303 VarInit *VarInit::get(const std::string &VN, RecTy *T) {
1304 Init *Value = StringInit::get(VN);
1305 return VarInit::get(Value, T);
1308 VarInit *VarInit::get(Init *VN, RecTy *T) {
1309 typedef std::pair<RecTy *, Init *> Key;
1310 typedef DenseMap<Key, VarInit *> Pool;
1311 static Pool ThePool;
1313 Key TheKey(std::make_pair(T, VN));
1315 VarInit *&I = ThePool[TheKey];
1316 if (!I) I = new VarInit(VN, T);
1320 const std::string &VarInit::getName() const {
1321 StringInit *NameString =
1322 dynamic_cast<StringInit *>(getNameInit());
1323 assert(NameString && "VarInit name is not a string!");
1324 return NameString->getValue();
1327 Init *VarInit::resolveBitReference(Record &R, const RecordVal *IRV,
1328 unsigned Bit) const {
1329 if (R.isTemplateArg(getNameInit())) return 0;
1330 if (IRV && IRV->getNameInit() != getNameInit()) return 0;
1332 RecordVal *RV = R.getValue(getNameInit());
1333 assert(RV && "Reference to a non-existent variable?");
1334 assert(dynamic_cast<BitsInit*>(RV->getValue()));
1335 BitsInit *BI = (BitsInit*)RV->getValue();
1337 assert(Bit < BI->getNumBits() && "Bit reference out of range!");
1338 Init *B = BI->getBit(Bit);
1340 // If the bit is set to some value, or if we are resolving a reference to a
1341 // specific variable and that variable is explicitly unset, then replace the
1342 // VarBitInit with it.
1343 if (IRV || !dynamic_cast<UnsetInit*>(B))
1348 Init *VarInit::resolveListElementReference(Record &R,
1349 const RecordVal *IRV,
1350 unsigned Elt) const {
1351 if (R.isTemplateArg(getNameInit())) return 0;
1352 if (IRV && IRV->getNameInit() != getNameInit()) return 0;
1354 RecordVal *RV = R.getValue(getNameInit());
1355 assert(RV && "Reference to a non-existent variable?");
1356 ListInit *LI = dynamic_cast<ListInit*>(RV->getValue());
1358 TypedInit *VI = dynamic_cast<TypedInit*>(RV->getValue());
1359 assert(VI && "Invalid list element!");
1360 return VarListElementInit::get(VI, Elt);
1363 if (Elt >= LI->getSize())
1364 return 0; // Out of range reference.
1365 Init *E = LI->getElement(Elt);
1366 // If the element is set to some value, or if we are resolving a reference
1367 // to a specific variable and that variable is explicitly unset, then
1368 // replace the VarListElementInit with it.
1369 if (IRV || !dynamic_cast<UnsetInit*>(E))
1375 RecTy *VarInit::getFieldType(const std::string &FieldName) const {
1376 if (RecordRecTy *RTy = dynamic_cast<RecordRecTy*>(getType()))
1377 if (const RecordVal *RV = RTy->getRecord()->getValue(FieldName))
1378 return RV->getType();
1382 Init *VarInit::getFieldInit(Record &R, const RecordVal *RV,
1383 const std::string &FieldName) const {
1384 if (dynamic_cast<RecordRecTy*>(getType()))
1385 if (const RecordVal *Val = R.getValue(VarName)) {
1386 if (RV != Val && (RV || dynamic_cast<UnsetInit*>(Val->getValue())))
1388 Init *TheInit = Val->getValue();
1389 assert(TheInit != this && "Infinite loop detected!");
1390 if (Init *I = TheInit->getFieldInit(R, RV, FieldName))
1398 /// resolveReferences - This method is used by classes that refer to other
1399 /// variables which may not be defined at the time the expression is formed.
1400 /// If a value is set for the variable later, this method will be called on
1401 /// users of the value to allow the value to propagate out.
1403 Init *VarInit::resolveReferences(Record &R, const RecordVal *RV) const {
1404 if (RecordVal *Val = R.getValue(VarName))
1405 if (RV == Val || (RV == 0 && !dynamic_cast<UnsetInit*>(Val->getValue())))
1406 return Val->getValue();
1407 return const_cast<VarInit *>(this);
1410 VarBitInit *VarBitInit::get(TypedInit *T, unsigned B) {
1411 typedef std::pair<TypedInit *, unsigned> Key;
1412 typedef DenseMap<Key, VarBitInit *> Pool;
1414 static Pool ThePool;
1416 Key TheKey(std::make_pair(T, B));
1418 VarBitInit *&I = ThePool[TheKey];
1419 if (!I) I = new VarBitInit(T, B);
1423 std::string VarBitInit::getAsString() const {
1424 return TI->getAsString() + "{" + utostr(Bit) + "}";
1427 Init *VarBitInit::resolveReferences(Record &R, const RecordVal *RV) const {
1428 if (Init *I = getVariable()->resolveBitReference(R, RV, getBitNum()))
1430 return const_cast<VarBitInit *>(this);
1433 VarListElementInit *VarListElementInit::get(TypedInit *T,
1435 typedef std::pair<TypedInit *, unsigned> Key;
1436 typedef DenseMap<Key, VarListElementInit *> Pool;
1438 static Pool ThePool;
1440 Key TheKey(std::make_pair(T, E));
1442 VarListElementInit *&I = ThePool[TheKey];
1443 if (!I) I = new VarListElementInit(T, E);
1447 std::string VarListElementInit::getAsString() const {
1448 return TI->getAsString() + "[" + utostr(Element) + "]";
1452 VarListElementInit::resolveReferences(Record &R, const RecordVal *RV) const {
1453 if (Init *I = getVariable()->resolveListElementReference(R, RV,
1456 return const_cast<VarListElementInit *>(this);
1459 Init *VarListElementInit::resolveBitReference(Record &R, const RecordVal *RV,
1460 unsigned Bit) const {
1461 // FIXME: This should be implemented, to support references like:
1462 // bit B = AA[0]{1};
1466 Init *VarListElementInit:: resolveListElementReference(Record &R,
1467 const RecordVal *RV,
1468 unsigned Elt) const {
1469 Init *Result = TI->resolveListElementReference(R, RV, Element);
1472 TypedInit *TInit = dynamic_cast<TypedInit *>(Result);
1474 Init *Result2 = TInit->resolveListElementReference(R, RV, Elt);
1475 if (Result2) return Result2;
1476 return new VarListElementInit(TInit, Elt);
1484 DefInit *DefInit::get(Record *R) {
1485 return R->getDefInit();
1488 RecTy *DefInit::getFieldType(const std::string &FieldName) const {
1489 if (const RecordVal *RV = Def->getValue(FieldName))
1490 return RV->getType();
1494 Init *DefInit::getFieldInit(Record &R, const RecordVal *RV,
1495 const std::string &FieldName) const {
1496 return Def->getValue(FieldName)->getValue();
1500 std::string DefInit::getAsString() const {
1501 return Def->getName();
1504 FieldInit *FieldInit::get(Init *R, const std::string &FN) {
1505 typedef std::pair<Init *, TableGenStringKey> Key;
1506 typedef DenseMap<Key, FieldInit *> Pool;
1507 static Pool ThePool;
1509 Key TheKey(std::make_pair(R, FN));
1511 FieldInit *&I = ThePool[TheKey];
1512 if (!I) I = new FieldInit(R, FN);
1516 Init *FieldInit::resolveBitReference(Record &R, const RecordVal *RV,
1517 unsigned Bit) const {
1518 if (Init *BitsVal = Rec->getFieldInit(R, RV, FieldName))
1519 if (BitsInit *BI = dynamic_cast<BitsInit*>(BitsVal)) {
1520 assert(Bit < BI->getNumBits() && "Bit reference out of range!");
1521 Init *B = BI->getBit(Bit);
1523 if (dynamic_cast<BitInit*>(B)) // If the bit is set.
1524 return B; // Replace the VarBitInit with it.
1529 Init *FieldInit::resolveListElementReference(Record &R, const RecordVal *RV,
1530 unsigned Elt) const {
1531 if (Init *ListVal = Rec->getFieldInit(R, RV, FieldName))
1532 if (ListInit *LI = dynamic_cast<ListInit*>(ListVal)) {
1533 if (Elt >= LI->getSize()) return 0;
1534 Init *E = LI->getElement(Elt);
1536 // If the element is set to some value, or if we are resolving a
1537 // reference to a specific variable and that variable is explicitly
1538 // unset, then replace the VarListElementInit with it.
1539 if (RV || !dynamic_cast<UnsetInit*>(E))
1545 Init *FieldInit::resolveReferences(Record &R, const RecordVal *RV) const {
1546 Init *NewRec = RV ? Rec->resolveReferences(R, RV) : Rec;
1548 Init *BitsVal = NewRec->getFieldInit(R, RV, FieldName);
1550 Init *BVR = BitsVal->resolveReferences(R, RV);
1551 return BVR->isComplete() ? BVR : const_cast<FieldInit *>(this);
1554 if (NewRec != Rec) {
1555 return FieldInit::get(NewRec, FieldName);
1557 return const_cast<FieldInit *>(this);
1560 void ProfileDagInit(FoldingSetNodeID &ID,
1562 const std::string &VN,
1563 ArrayRef<Init *> ArgRange,
1564 ArrayRef<std::string> NameRange) {
1568 ArrayRef<Init *>::iterator Arg = ArgRange.begin();
1569 ArrayRef<std::string>::iterator Name = NameRange.begin();
1570 while (Arg != ArgRange.end()) {
1571 assert(Name != NameRange.end() && "Arg name underflow!");
1572 ID.AddPointer(*Arg++);
1573 ID.AddString(*Name++);
1575 assert(Name == NameRange.end() && "Arg name overflow!");
1579 DagInit::get(Init *V, const std::string &VN,
1580 ArrayRef<Init *> ArgRange,
1581 ArrayRef<std::string> NameRange) {
1582 typedef FoldingSet<DagInit> Pool;
1583 static Pool ThePool;
1585 FoldingSetNodeID ID;
1586 ProfileDagInit(ID, V, VN, ArgRange, NameRange);
1589 if (DagInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
1592 DagInit *I = new DagInit(V, VN, ArgRange, NameRange);
1593 ThePool.InsertNode(I, IP);
1599 DagInit::get(Init *V, const std::string &VN,
1600 const std::vector<std::pair<Init*, std::string> > &args) {
1601 typedef std::pair<Init*, std::string> PairType;
1603 std::vector<Init *> Args;
1604 std::vector<std::string> Names;
1606 for (std::vector<PairType>::const_iterator i = args.begin(),
1610 Args.push_back(i->first);
1611 Names.push_back(i->second);
1614 return DagInit::get(V, VN, Args, Names);
1617 void DagInit::Profile(FoldingSetNodeID &ID) const {
1618 ProfileDagInit(ID, Val, ValName, Args, ArgNames);
1621 Init *DagInit::resolveReferences(Record &R, const RecordVal *RV) const {
1622 std::vector<Init*> NewArgs;
1623 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1624 NewArgs.push_back(Args[i]->resolveReferences(R, RV));
1626 Init *Op = Val->resolveReferences(R, RV);
1628 if (Args != NewArgs || Op != Val)
1629 return DagInit::get(Op, ValName, NewArgs, ArgNames);
1631 return const_cast<DagInit *>(this);
1635 std::string DagInit::getAsString() const {
1636 std::string Result = "(" + Val->getAsString();
1637 if (!ValName.empty())
1638 Result += ":" + ValName;
1640 Result += " " + Args[0]->getAsString();
1641 if (!ArgNames[0].empty()) Result += ":$" + ArgNames[0];
1642 for (unsigned i = 1, e = Args.size(); i != e; ++i) {
1643 Result += ", " + Args[i]->getAsString();
1644 if (!ArgNames[i].empty()) Result += ":$" + ArgNames[i];
1647 return Result + ")";
1651 //===----------------------------------------------------------------------===//
1652 // Other implementations
1653 //===----------------------------------------------------------------------===//
1655 RecordVal::RecordVal(Init *N, RecTy *T, unsigned P)
1656 : Name(N), Ty(T), Prefix(P) {
1657 Value = Ty->convertValue(UnsetInit::get());
1658 assert(Value && "Cannot create unset value for current type!");
1661 RecordVal::RecordVal(const std::string &N, RecTy *T, unsigned P)
1662 : Name(StringInit::get(N)), Ty(T), Prefix(P) {
1663 Value = Ty->convertValue(UnsetInit::get());
1664 assert(Value && "Cannot create unset value for current type!");
1667 const std::string &RecordVal::getName() const {
1668 StringInit *NameString = dynamic_cast<StringInit *>(Name);
1669 assert(NameString && "RecordVal name is not a string!");
1670 return NameString->getValue();
1673 void RecordVal::dump() const { errs() << *this; }
1675 void RecordVal::print(raw_ostream &OS, bool PrintSem) const {
1676 if (getPrefix()) OS << "field ";
1677 OS << *getType() << " " << getNameInitAsString();
1680 OS << " = " << *getValue();
1682 if (PrintSem) OS << ";\n";
1685 unsigned Record::LastID = 0;
1687 void Record::init() {
1690 // Every record potentially has a def at the top. This value is
1691 // replaced with the top-level def name at instantiation time.
1692 RecordVal DN("NAME", StringRecTy::get(), 0);
1696 void Record::checkName() {
1697 // Ensure the record name has string type.
1698 const TypedInit *TypedName = dynamic_cast<const TypedInit *>(Name);
1699 assert(TypedName && "Record name is not typed!");
1700 RecTy *Type = TypedName->getType();
1701 if (dynamic_cast<StringRecTy *>(Type) == 0) {
1702 throw "Record name is not a string!";
1706 DefInit *Record::getDefInit() {
1708 TheInit = new DefInit(this, new RecordRecTy(this));
1712 const std::string &Record::getName() const {
1713 const StringInit *NameString =
1714 dynamic_cast<const StringInit *>(Name);
1715 assert(NameString && "Record name is not a string!");
1716 return NameString->getValue();
1719 void Record::setName(Init *NewName) {
1720 if (TrackedRecords.getDef(Name->getAsUnquotedString()) == this) {
1721 TrackedRecords.removeDef(Name->getAsUnquotedString());
1722 TrackedRecords.addDef(this);
1723 } else if (TrackedRecords.getClass(Name->getAsUnquotedString()) == this) {
1724 TrackedRecords.removeClass(Name->getAsUnquotedString());
1725 TrackedRecords.addClass(this);
1726 } // Otherwise this isn't yet registered.
1729 // DO NOT resolve record values to the name at this point because
1730 // there might be default values for arguments of this def. Those
1731 // arguments might not have been resolved yet so we don't want to
1732 // prematurely assume values for those arguments were not passed to
1735 // Nonetheless, it may be that some of this Record's values
1736 // reference the record name. Indeed, the reason for having the
1737 // record name be an Init is to provide this flexibility. The extra
1738 // resolve steps after completely instantiating defs takes care of
1739 // this. See TGParser::ParseDef and TGParser::ParseDefm.
1742 void Record::setName(const std::string &Name) {
1743 setName(StringInit::get(Name));
1746 /// resolveReferencesTo - If anything in this record refers to RV, replace the
1747 /// reference to RV with the RHS of RV. If RV is null, we resolve all possible
1749 void Record::resolveReferencesTo(const RecordVal *RV) {
1750 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1751 if (RV == &Values[i]) // Skip resolve the same field as the given one
1753 if (Init *V = Values[i].getValue())
1754 Values[i].setValue(V->resolveReferences(*this, RV));
1756 Init *OldName = getNameInit();
1757 Init *NewName = Name->resolveReferences(*this, RV);
1758 if (NewName != OldName) {
1759 // Re-register with RecordKeeper.
1764 void Record::dump() const { errs() << *this; }
1766 raw_ostream &llvm::operator<<(raw_ostream &OS, const Record &R) {
1767 OS << R.getNameInitAsString();
1769 const std::vector<Init *> &TArgs = R.getTemplateArgs();
1770 if (!TArgs.empty()) {
1772 for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
1774 const RecordVal *RV = R.getValue(TArgs[i]);
1775 assert(RV && "Template argument record not found??");
1776 RV->print(OS, false);
1782 const std::vector<Record*> &SC = R.getSuperClasses();
1785 for (unsigned i = 0, e = SC.size(); i != e; ++i)
1786 OS << " " << SC[i]->getNameInitAsString();
1790 const std::vector<RecordVal> &Vals = R.getValues();
1791 for (unsigned i = 0, e = Vals.size(); i != e; ++i)
1792 if (Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName()))
1794 for (unsigned i = 0, e = Vals.size(); i != e; ++i)
1795 if (!Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName()))
1801 /// getValueInit - Return the initializer for a value with the specified name,
1802 /// or throw an exception if the field does not exist.
1804 Init *Record::getValueInit(StringRef FieldName) const {
1805 const RecordVal *R = getValue(FieldName);
1806 if (R == 0 || R->getValue() == 0)
1807 throw "Record `" + getName() + "' does not have a field named `" +
1808 FieldName.str() + "'!\n";
1809 return R->getValue();
1813 /// getValueAsString - This method looks up the specified field and returns its
1814 /// value as a string, throwing an exception if the field does not exist or if
1815 /// the value is not a string.
1817 std::string Record::getValueAsString(StringRef FieldName) const {
1818 const RecordVal *R = getValue(FieldName);
1819 if (R == 0 || R->getValue() == 0)
1820 throw "Record `" + getName() + "' does not have a field named `" +
1821 FieldName.str() + "'!\n";
1823 if (StringInit *SI = dynamic_cast<StringInit*>(R->getValue()))
1824 return SI->getValue();
1825 throw "Record `" + getName() + "', field `" + FieldName.str() +
1826 "' does not have a string initializer!";
1829 /// getValueAsBitsInit - This method looks up the specified field and returns
1830 /// its value as a BitsInit, throwing an exception if the field does not exist
1831 /// or if the value is not the right type.
1833 BitsInit *Record::getValueAsBitsInit(StringRef FieldName) const {
1834 const RecordVal *R = getValue(FieldName);
1835 if (R == 0 || R->getValue() == 0)
1836 throw "Record `" + getName() + "' does not have a field named `" +
1837 FieldName.str() + "'!\n";
1839 if (BitsInit *BI = dynamic_cast<BitsInit*>(R->getValue()))
1841 throw "Record `" + getName() + "', field `" + FieldName.str() +
1842 "' does not have a BitsInit initializer!";
1845 /// getValueAsListInit - This method looks up the specified field and returns
1846 /// its value as a ListInit, throwing an exception if the field does not exist
1847 /// or if the value is not the right type.
1849 ListInit *Record::getValueAsListInit(StringRef FieldName) const {
1850 const RecordVal *R = getValue(FieldName);
1851 if (R == 0 || R->getValue() == 0)
1852 throw "Record `" + getName() + "' does not have a field named `" +
1853 FieldName.str() + "'!\n";
1855 if (ListInit *LI = dynamic_cast<ListInit*>(R->getValue()))
1857 throw "Record `" + getName() + "', field `" + FieldName.str() +
1858 "' does not have a list initializer!";
1861 /// getValueAsListOfDefs - This method looks up the specified field and returns
1862 /// its value as a vector of records, throwing an exception if the field does
1863 /// not exist or if the value is not the right type.
1865 std::vector<Record*>
1866 Record::getValueAsListOfDefs(StringRef FieldName) const {
1867 ListInit *List = getValueAsListInit(FieldName);
1868 std::vector<Record*> Defs;
1869 for (unsigned i = 0; i < List->getSize(); i++) {
1870 if (DefInit *DI = dynamic_cast<DefInit*>(List->getElement(i))) {
1871 Defs.push_back(DI->getDef());
1873 throw "Record `" + getName() + "', field `" + FieldName.str() +
1874 "' list is not entirely DefInit!";
1880 /// getValueAsInt - This method looks up the specified field and returns its
1881 /// value as an int64_t, throwing an exception if the field does not exist or if
1882 /// the value is not the right type.
1884 int64_t Record::getValueAsInt(StringRef FieldName) const {
1885 const RecordVal *R = getValue(FieldName);
1886 if (R == 0 || R->getValue() == 0)
1887 throw "Record `" + getName() + "' does not have a field named `" +
1888 FieldName.str() + "'!\n";
1890 if (IntInit *II = dynamic_cast<IntInit*>(R->getValue()))
1891 return II->getValue();
1892 throw "Record `" + getName() + "', field `" + FieldName.str() +
1893 "' does not have an int initializer!";
1896 /// getValueAsListOfInts - This method looks up the specified field and returns
1897 /// its value as a vector of integers, throwing an exception if the field does
1898 /// not exist or if the value is not the right type.
1900 std::vector<int64_t>
1901 Record::getValueAsListOfInts(StringRef FieldName) const {
1902 ListInit *List = getValueAsListInit(FieldName);
1903 std::vector<int64_t> Ints;
1904 for (unsigned i = 0; i < List->getSize(); i++) {
1905 if (IntInit *II = dynamic_cast<IntInit*>(List->getElement(i))) {
1906 Ints.push_back(II->getValue());
1908 throw "Record `" + getName() + "', field `" + FieldName.str() +
1909 "' does not have a list of ints initializer!";
1915 /// getValueAsListOfStrings - This method looks up the specified field and
1916 /// returns its value as a vector of strings, throwing an exception if the
1917 /// field does not exist or if the value is not the right type.
1919 std::vector<std::string>
1920 Record::getValueAsListOfStrings(StringRef FieldName) const {
1921 ListInit *List = getValueAsListInit(FieldName);
1922 std::vector<std::string> Strings;
1923 for (unsigned i = 0; i < List->getSize(); i++) {
1924 if (StringInit *II = dynamic_cast<StringInit*>(List->getElement(i))) {
1925 Strings.push_back(II->getValue());
1927 throw "Record `" + getName() + "', field `" + FieldName.str() +
1928 "' does not have a list of strings initializer!";
1934 /// getValueAsDef - This method looks up the specified field and returns its
1935 /// value as a Record, throwing an exception if the field does not exist or if
1936 /// the value is not the right type.
1938 Record *Record::getValueAsDef(StringRef FieldName) const {
1939 const RecordVal *R = getValue(FieldName);
1940 if (R == 0 || R->getValue() == 0)
1941 throw "Record `" + getName() + "' does not have a field named `" +
1942 FieldName.str() + "'!\n";
1944 if (DefInit *DI = dynamic_cast<DefInit*>(R->getValue()))
1945 return DI->getDef();
1946 throw "Record `" + getName() + "', field `" + FieldName.str() +
1947 "' does not have a def initializer!";
1950 /// getValueAsBit - This method looks up the specified field and returns its
1951 /// value as a bit, throwing an exception if the field does not exist or if
1952 /// the value is not the right type.
1954 bool Record::getValueAsBit(StringRef FieldName) const {
1955 const RecordVal *R = getValue(FieldName);
1956 if (R == 0 || R->getValue() == 0)
1957 throw "Record `" + getName() + "' does not have a field named `" +
1958 FieldName.str() + "'!\n";
1960 if (BitInit *BI = dynamic_cast<BitInit*>(R->getValue()))
1961 return BI->getValue();
1962 throw "Record `" + getName() + "', field `" + FieldName.str() +
1963 "' does not have a bit initializer!";
1966 /// getValueAsDag - This method looks up the specified field and returns its
1967 /// value as an Dag, throwing an exception if the field does not exist or if
1968 /// the value is not the right type.
1970 DagInit *Record::getValueAsDag(StringRef FieldName) const {
1971 const RecordVal *R = getValue(FieldName);
1972 if (R == 0 || R->getValue() == 0)
1973 throw "Record `" + getName() + "' does not have a field named `" +
1974 FieldName.str() + "'!\n";
1976 if (DagInit *DI = dynamic_cast<DagInit*>(R->getValue()))
1978 throw "Record `" + getName() + "', field `" + FieldName.str() +
1979 "' does not have a dag initializer!";
1983 void MultiClass::dump() const {
1984 errs() << "Record:\n";
1987 errs() << "Defs:\n";
1988 for (RecordVector::const_iterator r = DefPrototypes.begin(),
1989 rend = DefPrototypes.end();
1997 void RecordKeeper::dump() const { errs() << *this; }
1999 raw_ostream &llvm::operator<<(raw_ostream &OS, const RecordKeeper &RK) {
2000 OS << "------------- Classes -----------------\n";
2001 const std::map<std::string, Record*> &Classes = RK.getClasses();
2002 for (std::map<std::string, Record*>::const_iterator I = Classes.begin(),
2003 E = Classes.end(); I != E; ++I)
2004 OS << "class " << *I->second;
2006 OS << "------------- Defs -----------------\n";
2007 const std::map<std::string, Record*> &Defs = RK.getDefs();
2008 for (std::map<std::string, Record*>::const_iterator I = Defs.begin(),
2009 E = Defs.end(); I != E; ++I)
2010 OS << "def " << *I->second;
2015 /// getAllDerivedDefinitions - This method returns all concrete definitions
2016 /// that derive from the specified class name. If a class with the specified
2017 /// name does not exist, an error is printed and true is returned.
2018 std::vector<Record*>
2019 RecordKeeper::getAllDerivedDefinitions(const std::string &ClassName) const {
2020 Record *Class = getClass(ClassName);
2022 throw "ERROR: Couldn't find the `" + ClassName + "' class!\n";
2024 std::vector<Record*> Defs;
2025 for (std::map<std::string, Record*>::const_iterator I = getDefs().begin(),
2026 E = getDefs().end(); I != E; ++I)
2027 if (I->second->isSubClassOf(Class))
2028 Defs.push_back(I->second);
2033 /// QualifyName - Return an Init with a qualifier prefix referring
2034 /// to CurRec's name.
2035 Init *llvm::QualifyName(Record &CurRec, MultiClass *CurMultiClass,
2036 Init *Name, const std::string &Scoper) {
2037 RecTy *Type = dynamic_cast<TypedInit *>(Name)->getType();
2039 BinOpInit *NewName =
2040 BinOpInit::get(BinOpInit::STRCONCAT,
2041 BinOpInit::get(BinOpInit::STRCONCAT,
2042 CurRec.getNameInit(),
2043 StringInit::get(Scoper),
2044 Type)->Fold(&CurRec, CurMultiClass),
2048 if (CurMultiClass && Scoper != "::") {
2050 BinOpInit::get(BinOpInit::STRCONCAT,
2051 BinOpInit::get(BinOpInit::STRCONCAT,
2052 CurMultiClass->Rec.getNameInit(),
2053 StringInit::get("::"),
2054 Type)->Fold(&CurRec, CurMultiClass),
2055 NewName->Fold(&CurRec, CurMultiClass),
2059 return NewName->Fold(&CurRec, CurMultiClass);
2062 /// QualifyName - Return an Init with a qualifier prefix referring
2063 /// to CurRec's name.
2064 Init *llvm::QualifyName(Record &CurRec, MultiClass *CurMultiClass,
2065 const std::string &Name,
2066 const std::string &Scoper) {
2067 return QualifyName(CurRec, CurMultiClass, StringInit::get(Name), Scoper);