X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FTableGen%2FRecord.cpp;h=11e35b75375e4ac8dcf82fd4277e19f9d8efd72f;hb=db6cb1a90cd0ab35e2dadc97962a5d67742c0bbc;hp=c553a21c261e0a414afabfc9a8f4582ac7ba8d6b;hpb=01ce4b98ced7c239bdcdd13506a52d4a0cbbbefe;p=oota-llvm.git diff --git a/lib/TableGen/Record.cpp b/lib/TableGen/Record.cpp index c553a21c261..11e35b75375 100644 --- a/lib/TableGen/Record.cpp +++ b/lib/TableGen/Record.cpp @@ -86,249 +86,69 @@ IntRecTy IntRecTy::Shared; StringRecTy StringRecTy::Shared; DagRecTy DagRecTy::Shared; -void RecTy::anchor() { } void RecTy::dump() const { print(errs()); } ListRecTy *RecTy::getListTy() { if (!ListTy) - ListTy = new ListRecTy(this); - return ListTy; + ListTy.reset(new ListRecTy(this)); + return ListTy.get(); } -bool RecTy::baseClassOf(const RecTy *RHS) const{ - assert (RHS && "NULL pointer"); +bool RecTy::typeIsConvertibleTo(const RecTy *RHS) const { + assert(RHS && "NULL pointer"); return Kind == RHS->getRecTyKind(); } -Init *BitRecTy::convertValue(BitsInit *BI) { - if (BI->getNumBits() != 1) return nullptr; // Only accept if just one bit! - return BI->getBit(0); -} - -Init *BitRecTy::convertValue(IntInit *II) { - int64_t Val = II->getValue(); - if (Val != 0 && Val != 1) return nullptr; // Only accept 0 or 1 for a bit! - - return BitInit::get(Val != 0); -} - -Init *BitRecTy::convertValue(TypedInit *VI) { - RecTy *Ty = VI->getType(); - if (isa(Ty) || isa(Ty) || isa(Ty)) - return VI; // Accept variable if it is already of bit type! - return nullptr; -} - -bool BitRecTy::baseClassOf(const RecTy *RHS) const{ - if(RecTy::baseClassOf(RHS) || getRecTyKind() == IntRecTyKind) +bool BitRecTy::typeIsConvertibleTo(const RecTy *RHS) const{ + if (RecTy::typeIsConvertibleTo(RHS) || RHS->getRecTyKind() == IntRecTyKind) return true; - if(const BitsRecTy *BitsTy = dyn_cast(RHS)) + if (const BitsRecTy *BitsTy = dyn_cast(RHS)) return BitsTy->getNumBits() == 1; return false; } BitsRecTy *BitsRecTy::get(unsigned Sz) { - static std::vector Shared; + static std::vector> Shared; if (Sz >= Shared.size()) Shared.resize(Sz + 1); - BitsRecTy *&Ty = Shared[Sz]; + std::unique_ptr &Ty = Shared[Sz]; if (!Ty) - Ty = new BitsRecTy(Sz); - return Ty; + Ty.reset(new BitsRecTy(Sz)); + return Ty.get(); } std::string BitsRecTy::getAsString() const { return "bits<" + utostr(Size) + ">"; } -Init *BitsRecTy::convertValue(UnsetInit *UI) { - SmallVector NewBits(Size); - - for (unsigned i = 0; i != Size; ++i) - NewBits[i] = UnsetInit::get(); - - return BitsInit::get(NewBits); -} - -Init *BitsRecTy::convertValue(BitInit *UI) { - if (Size != 1) return nullptr; // Can only convert single bit. - return BitsInit::get(UI); -} - -/// canFitInBitfield - Return true if the number of bits is large enough to hold -/// the integer value. -static bool canFitInBitfield(int64_t Value, unsigned NumBits) { - // For example, with NumBits == 4, we permit Values from [-7 .. 15]. - return (NumBits >= sizeof(Value) * 8) || - (Value >> NumBits == 0) || (Value >> (NumBits-1) == -1); -} - -/// convertValue from Int initializer to bits type: Split the integer up into the -/// appropriate bits. -/// -Init *BitsRecTy::convertValue(IntInit *II) { - int64_t Value = II->getValue(); - // Make sure this bitfield is large enough to hold the integer value. - if (!canFitInBitfield(Value, Size)) - return nullptr; - - SmallVector NewBits(Size); - - for (unsigned i = 0; i != Size; ++i) - NewBits[i] = BitInit::get(Value & (1LL << i)); - - return BitsInit::get(NewBits); -} - -Init *BitsRecTy::convertValue(BitsInit *BI) { - // If the number of bits is right, return it. Otherwise we need to expand or - // truncate. - if (BI->getNumBits() == Size) return BI; - return nullptr; -} - -Init *BitsRecTy::convertValue(TypedInit *VI) { - if (Size == 1 && isa(VI->getType())) - return BitsInit::get(VI); - - if (VI->getType()->typeIsConvertibleTo(this)) { - SmallVector NewBits(Size); - - for (unsigned i = 0; i != Size; ++i) - NewBits[i] = VarBitInit::get(VI, i); - return BitsInit::get(NewBits); - } - - return nullptr; -} - -bool BitsRecTy::baseClassOf(const RecTy *RHS) const{ - if (RecTy::baseClassOf(RHS)) //argument and the receiver are the same type +bool BitsRecTy::typeIsConvertibleTo(const RecTy *RHS) const { + if (RecTy::typeIsConvertibleTo(RHS)) //argument and the sender are same type return cast(RHS)->Size == Size; RecTyKind kind = RHS->getRecTyKind(); return (kind == BitRecTyKind && Size == 1) || (kind == IntRecTyKind); } -Init *IntRecTy::convertValue(BitInit *BI) { - return IntInit::get(BI->getValue()); -} - -Init *IntRecTy::convertValue(BitsInit *BI) { - int64_t Result = 0; - for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) - if (BitInit *Bit = dyn_cast(BI->getBit(i))) { - Result |= Bit->getValue() << i; - } else { - return nullptr; - } - return IntInit::get(Result); -} - -Init *IntRecTy::convertValue(TypedInit *TI) { - if (TI->getType()->typeIsConvertibleTo(this)) - return TI; // Accept variable if already of the right type! - return nullptr; -} - -bool IntRecTy::baseClassOf(const RecTy *RHS) const{ +bool IntRecTy::typeIsConvertibleTo(const RecTy *RHS) const { RecTyKind kind = RHS->getRecTyKind(); return kind==BitRecTyKind || kind==BitsRecTyKind || kind==IntRecTyKind; } -Init *StringRecTy::convertValue(UnOpInit *BO) { - if (BO->getOpcode() == UnOpInit::CAST) { - Init *L = BO->getOperand()->convertInitializerTo(this); - if (!L) return nullptr; - if (L != BO->getOperand()) - return UnOpInit::get(UnOpInit::CAST, L, new StringRecTy); - return BO; - } - - return convertValue((TypedInit*)BO); -} - -Init *StringRecTy::convertValue(BinOpInit *BO) { - if (BO->getOpcode() == BinOpInit::STRCONCAT) { - Init *L = BO->getLHS()->convertInitializerTo(this); - Init *R = BO->getRHS()->convertInitializerTo(this); - if (!L || !R) return nullptr; - if (L != BO->getLHS() || R != BO->getRHS()) - return BinOpInit::get(BinOpInit::STRCONCAT, L, R, new StringRecTy); - return BO; - } - - return convertValue((TypedInit*)BO); -} - - -Init *StringRecTy::convertValue(TypedInit *TI) { - if (isa(TI->getType())) - return TI; // Accept variable if already of the right type! - return nullptr; +std::string StringRecTy::getAsString() const { + return "string"; } std::string ListRecTy::getAsString() const { return "list<" + Ty->getAsString() + ">"; } -Init *ListRecTy::convertValue(ListInit *LI) { - std::vector Elements; - - // Verify that all of the elements of the list are subclasses of the - // appropriate class! - for (unsigned i = 0, e = LI->getSize(); i != e; ++i) - if (Init *CI = LI->getElement(i)->convertInitializerTo(Ty)) - Elements.push_back(CI); - else - return nullptr; - - if (!isa(LI->getType())) - return nullptr; - - return ListInit::get(Elements, this); -} - -Init *ListRecTy::convertValue(TypedInit *TI) { - // Ensure that TI is compatible with our class. - if (ListRecTy *LRT = dyn_cast(TI->getType())) - if (LRT->getElementType()->typeIsConvertibleTo(getElementType())) - return TI; - return nullptr; -} - -bool ListRecTy::baseClassOf(const RecTy *RHS) const{ - if(const ListRecTy* ListTy = dyn_cast(RHS)) - return ListTy->getElementType()->typeIsConvertibleTo(Ty); +bool ListRecTy::typeIsConvertibleTo(const RecTy *RHS) const { + if (const auto *ListTy = dyn_cast(RHS)) + return Ty->typeIsConvertibleTo(ListTy->getElementType()); return false; } -Init *DagRecTy::convertValue(TypedInit *TI) { - if (TI->getType()->typeIsConvertibleTo(this)) - return TI; - return nullptr; -} - -Init *DagRecTy::convertValue(UnOpInit *BO) { - if (BO->getOpcode() == UnOpInit::CAST) { - Init *L = BO->getOperand()->convertInitializerTo(this); - if (!L) return nullptr; - if (L != BO->getOperand()) - return UnOpInit::get(UnOpInit::CAST, L, new DagRecTy); - return BO; - } - return nullptr; -} - -Init *DagRecTy::convertValue(BinOpInit *BO) { - if (BO->getOpcode() == BinOpInit::CONCAT) { - Init *L = BO->getLHS()->convertInitializerTo(this); - Init *R = BO->getRHS()->convertInitializerTo(this); - if (!L || !R) return nullptr; - if (L != BO->getLHS() || R != BO->getRHS()) - return BinOpInit::get(BinOpInit::CONCAT, L, R, new DagRecTy); - return BO; - } - return nullptr; +std::string DagRecTy::getAsString() const { + return "dag"; } RecordRecTy *RecordRecTy::get(Record *R) { @@ -339,40 +159,23 @@ std::string RecordRecTy::getAsString() const { return Rec->getName(); } -Init *RecordRecTy::convertValue(DefInit *DI) { - // Ensure that DI is a subclass of Rec. - if (!DI->getDef()->isSubClassOf(Rec)) - return nullptr; - return DI; -} - -Init *RecordRecTy::convertValue(TypedInit *TI) { - // Ensure that TI is compatible with Rec. - if (RecordRecTy *RRT = dyn_cast(TI->getType())) - if (RRT->getRecord()->isSubClassOf(getRecord()) || - RRT->getRecord() == getRecord()) - return TI; - return nullptr; -} - -bool RecordRecTy::baseClassOf(const RecTy *RHS) const{ +bool RecordRecTy::typeIsConvertibleTo(const RecTy *RHS) const { const RecordRecTy *RTy = dyn_cast(RHS); if (!RTy) return false; - if (Rec == RTy->getRecord() || RTy->getRecord()->isSubClassOf(Rec)) + if (RTy->getRecord() == Rec || Rec->isSubClassOf(RTy->getRecord())) return true; - const std::vector &SC = Rec->getSuperClasses(); - for (unsigned i = 0, e = SC.size(); i != e; ++i) - if (RTy->getRecord()->isSubClassOf(SC[i])) + for (Record *SC : RTy->getRecord()->getSuperClasses()) + if (Rec->isSubClassOf(SC)) return true; return false; } /// resolveTypes - Find a common type that T1 and T2 convert to. -/// Return 0 if no such type exists. +/// Return null if no such type exists. /// RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) { if (T1->typeIsConvertibleTo(T2)) @@ -383,38 +186,20 @@ RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) { // If one is a Record type, check superclasses if (RecordRecTy *RecTy1 = dyn_cast(T1)) { // See if T2 inherits from a type T1 also inherits from - const std::vector &T1SuperClasses = - RecTy1->getRecord()->getSuperClasses(); - for(std::vector::const_iterator i = T1SuperClasses.begin(), - iend = T1SuperClasses.end(); - i != iend; - ++i) { - RecordRecTy *SuperRecTy1 = RecordRecTy::get(*i); + for (Record *SuperRec1 : RecTy1->getRecord()->getSuperClasses()) { + RecordRecTy *SuperRecTy1 = RecordRecTy::get(SuperRec1); RecTy *NewType1 = resolveTypes(SuperRecTy1, T2); - if (NewType1) { - if (NewType1 != SuperRecTy1) { - delete SuperRecTy1; - } + if (NewType1) return NewType1; - } } } if (RecordRecTy *RecTy2 = dyn_cast(T2)) { // See if T1 inherits from a type T2 also inherits from - const std::vector &T2SuperClasses = - RecTy2->getRecord()->getSuperClasses(); - for (std::vector::const_iterator i = T2SuperClasses.begin(), - iend = T2SuperClasses.end(); - i != iend; - ++i) { - RecordRecTy *SuperRecTy2 = RecordRecTy::get(*i); + for (Record *SuperRec2 : RecTy2->getRecord()->getSuperClasses()) { + RecordRecTy *SuperRecTy2 = RecordRecTy::get(SuperRec2); RecTy *NewType2 = resolveTypes(T1, SuperRecTy2); - if (NewType2) { - if (NewType2 != SuperRecTy2) { - delete SuperRecTy2; - } + if (NewType2) return NewType2; - } } } return nullptr; @@ -428,14 +213,24 @@ RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) { void Init::anchor() { } void Init::dump() const { return print(errs()); } -void UnsetInit::anchor() { } - UnsetInit *UnsetInit::get() { static UnsetInit TheInit; return &TheInit; } -void BitInit::anchor() { } +Init *UnsetInit::convertInitializerTo(RecTy *Ty) const { + if (auto *BRT = dyn_cast(Ty)) { + SmallVector NewBits(BRT->getNumBits()); + + for (unsigned i = 0; i != BRT->getNumBits(); ++i) + NewBits[i] = UnsetInit::get(); + + return BitsInit::get(NewBits); + } + + // All other types can just be returned. + return const_cast(this); +} BitInit *BitInit::get(bool V) { static BitInit True(true); @@ -444,20 +239,33 @@ BitInit *BitInit::get(bool V) { return V ? &True : &False; } +Init *BitInit::convertInitializerTo(RecTy *Ty) const { + if (isa(Ty)) + return const_cast(this); + + if (isa(Ty)) + return IntInit::get(getValue()); + + if (auto *BRT = dyn_cast(Ty)) { + // Can only convert single bit. + if (BRT->getNumBits() == 1) + return BitsInit::get(const_cast(this)); + } + + return nullptr; +} + static void ProfileBitsInit(FoldingSetNodeID &ID, ArrayRef Range) { ID.AddInteger(Range.size()); - for (ArrayRef::iterator i = Range.begin(), - iend = Range.end(); - i != iend; - ++i) - ID.AddPointer(*i); + for (Init *I : Range) + ID.AddPointer(I); } BitsInit *BitsInit::get(ArrayRef Range) { - typedef FoldingSet Pool; - static Pool ThePool; + static FoldingSet ThePool; + static std::vector> TheActualPool; FoldingSetNodeID ID; ProfileBitsInit(ID, Range); @@ -468,7 +276,7 @@ BitsInit *BitsInit::get(ArrayRef Range) { BitsInit *I = new BitsInit(Range); ThePool.InsertNode(I, IP); - + TheActualPool.push_back(std::unique_ptr(I)); return I; } @@ -476,6 +284,32 @@ void BitsInit::Profile(FoldingSetNodeID &ID) const { ProfileBitsInit(ID, Bits); } +Init *BitsInit::convertInitializerTo(RecTy *Ty) const { + if (isa(Ty)) { + if (getNumBits() != 1) return nullptr; // Only accept if just one bit! + return getBit(0); + } + + if (auto *BRT = dyn_cast(Ty)) { + // If the number of bits is right, return it. Otherwise we need to expand + // or truncate. + if (getNumBits() != BRT->getNumBits()) return nullptr; + return const_cast(this); + } + + if (isa(Ty)) { + int64_t Result = 0; + for (unsigned i = 0, e = getNumBits(); i != e; ++i) + if (auto *Bit = dyn_cast(getBit(i))) + Result |= static_cast(Bit->getValue()) << i; + else + return nullptr; + return IntInit::get(Result); + } + + return nullptr; +} + Init * BitsInit::convertInitializerBitRange(const std::vector &Bits) const { SmallVector NewBits(Bits.size()); @@ -504,7 +338,7 @@ std::string BitsInit::getAsString() const { // bits initializer will resolve into VarBitInit to keep the field name and bit // number used in targets with fixed insn length. static Init *fixBitInit(const RecordVal *RV, Init *Before, Init *After) { - if (RV || After != UnsetInit::get()) + if (RV || !isa(After)) return After; return Before; } @@ -557,33 +391,52 @@ Init *BitsInit::resolveReferences(Record &R, const RecordVal *RV) const { return const_cast(this); } -namespace { - template - class Pool : public T { - public: - ~Pool(); - }; - template - Pool::~Pool() { - for (typename T::iterator I = this->begin(), E = this->end(); I != E; ++I) { - typename T::value_type &Item = *I; - delete Item.second; - } - } -} - IntInit *IntInit::get(int64_t V) { - static Pool > ThePool; + static DenseMap> ThePool; - IntInit *&I = ThePool[V]; - if (!I) I = new IntInit(V); - return I; + std::unique_ptr &I = ThePool[V]; + if (!I) I.reset(new IntInit(V)); + return I.get(); } std::string IntInit::getAsString() const { return itostr(Value); } +/// canFitInBitfield - Return true if the number of bits is large enough to hold +/// the integer value. +static bool canFitInBitfield(int64_t Value, unsigned NumBits) { + // For example, with NumBits == 4, we permit Values from [-7 .. 15]. + return (NumBits >= sizeof(Value) * 8) || + (Value >> NumBits == 0) || (Value >> (NumBits-1) == -1); +} + +Init *IntInit::convertInitializerTo(RecTy *Ty) const { + if (isa(Ty)) + return const_cast(this); + + if (isa(Ty)) { + int64_t Val = getValue(); + if (Val != 0 && Val != 1) return nullptr; // Only accept 0 or 1 for a bit! + return BitInit::get(Val != 0); + } + + if (auto *BRT = dyn_cast(Ty)) { + int64_t Value = getValue(); + // Make sure this bitfield is large enough to hold the integer value. + if (!canFitInBitfield(Value, BRT->getNumBits())) + return nullptr; + + SmallVector NewBits(BRT->getNumBits()); + for (unsigned i = 0; i != BRT->getNumBits(); ++i) + NewBits[i] = BitInit::get(Value & (1LL << i)); + + return BitsInit::get(NewBits); + } + + return nullptr; +} + Init * IntInit::convertInitializerBitRange(const std::vector &Bits) const { SmallVector NewBits(Bits.size()); @@ -597,14 +450,19 @@ IntInit::convertInitializerBitRange(const std::vector &Bits) const { return BitsInit::get(NewBits); } -void StringInit::anchor() { } - StringInit *StringInit::get(StringRef V) { - static Pool > ThePool; + static StringMap> ThePool; - StringInit *&I = ThePool[V]; - if (!I) I = new StringInit(V); - return I; + std::unique_ptr &I = ThePool[V]; + if (!I) I.reset(new StringInit(V)); + return I.get(); +} + +Init *StringInit::convertInitializerTo(RecTy *Ty) const { + if (isa(Ty)) + return const_cast(this); + + return nullptr; } static void ProfileListInit(FoldingSetNodeID &ID, @@ -613,16 +471,12 @@ static void ProfileListInit(FoldingSetNodeID &ID, ID.AddInteger(Range.size()); ID.AddPointer(EltTy); - for (ArrayRef::iterator i = Range.begin(), - iend = Range.end(); - i != iend; - ++i) - ID.AddPointer(*i); + for (Init *I : Range) + ID.AddPointer(I); } ListInit *ListInit::get(ArrayRef Range, RecTy *EltTy) { - typedef FoldingSet Pool; - static Pool ThePool; + static FoldingSet ThePool; static std::vector> TheActualPool; FoldingSetNodeID ID; @@ -639,18 +493,35 @@ ListInit *ListInit::get(ArrayRef Range, RecTy *EltTy) { } void ListInit::Profile(FoldingSetNodeID &ID) const { - ListRecTy *ListType = dyn_cast(getType()); - assert(ListType && "Bad type for ListInit!"); - RecTy *EltTy = ListType->getElementType(); + RecTy *EltTy = cast(getType())->getElementType(); ProfileListInit(ID, Values, EltTy); } +Init *ListInit::convertInitializerTo(RecTy *Ty) const { + if (auto *LRT = dyn_cast(Ty)) { + std::vector Elements; + + // Verify that all of the elements of the list are subclasses of the + // appropriate class! + for (Init *I : getValues()) + if (Init *CI = I->convertInitializerTo(LRT->getElementType())) + Elements.push_back(CI); + else + return nullptr; + + if (isa(getType())) + return ListInit::get(Elements, Ty); + } + + return nullptr; +} + Init * ListInit::convertInitListSlice(const std::vector &Elements) const { std::vector Vals; for (unsigned i = 0, e = Elements.size(); i != e; ++i) { - if (Elements[i] >= getSize()) + if (Elements[i] >= size()) return nullptr; Vals.push_back(getElement(Elements[i])); } @@ -667,12 +538,11 @@ Record *ListInit::getElementAsRecord(unsigned i) const { Init *ListInit::resolveReferences(Record &R, const RecordVal *RV) const { std::vector Resolved; - Resolved.reserve(getSize()); + Resolved.reserve(size()); bool Changed = false; - for (unsigned i = 0, e = getSize(); i != e; ++i) { + for (Init *CurElt : getValues()) { Init *E; - Init *CurElt = getElement(i); do { E = CurElt; @@ -689,7 +559,7 @@ Init *ListInit::resolveReferences(Record &R, const RecordVal *RV) const { Init *ListInit::resolveListElementReference(Record &R, const RecordVal *IRV, unsigned Elt) const { - if (Elt >= getSize()) + if (Elt >= size()) return nullptr; // Out of range reference. Init *E = getElement(Elt); // If the element is set to some value, or if we are resolving a reference @@ -718,14 +588,10 @@ Init *OpInit::resolveListElementReference(Record &R, const RecordVal *IRV, } if (Resolved != this) { - TypedInit *Typed = dyn_cast(Resolved); - assert(Typed && "Expected typed init for list reference"); - if (Typed) { - Init *New = Typed->resolveListElementReference(R, IRV, Elt); - if (New) - return New; - return VarListElementInit::get(Typed, Elt); - } + TypedInit *Typed = cast(Resolved); + if (Init *New = Typed->resolveListElementReference(R, IRV, Elt)) + return New; + return VarListElementInit::get(Typed, Elt); } return nullptr; @@ -739,24 +605,24 @@ Init *OpInit::getBit(unsigned Bit) const { UnOpInit *UnOpInit::get(UnaryOp opc, Init *lhs, RecTy *Type) { typedef std::pair, RecTy *> Key; - static Pool > ThePool; + static DenseMap> ThePool; Key TheKey(std::make_pair(std::make_pair(opc, lhs), Type)); - UnOpInit *&I = ThePool[TheKey]; - if (!I) I = new UnOpInit(opc, lhs, Type); - return I; + std::unique_ptr &I = ThePool[TheKey]; + if (!I) I.reset(new UnOpInit(opc, lhs, Type)); + return I.get(); } Init *UnOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { switch (getOpcode()) { case CAST: { - if (getType()->getAsString() == "string") { + if (isa(getType())) { if (StringInit *LHSs = dyn_cast(LHS)) return LHSs; if (DefInit *LHSd = dyn_cast(LHS)) - return StringInit::get(LHSd->getDef()->getName()); + return StringInit::get(LHSd->getAsString()); if (IntInit *LHSi = dyn_cast(LHS)) return StringInit::get(LHSi->getAsString()); @@ -774,7 +640,7 @@ Init *UnOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { Init *TemplateArgName = QualifyName(*CurRec, CurMultiClass, Name, ":"); - + if (CurRec->isTemplateArg(TemplateArgName)) { const RecordVal *RV = CurRec->getValue(TemplateArgName); assert(RV && "Template arg doesn't exist??"); @@ -787,7 +653,8 @@ Init *UnOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { } if (CurMultiClass) { - Init *MCName = QualifyName(CurMultiClass->Rec, CurMultiClass, Name, "::"); + Init *MCName = QualifyName(CurMultiClass->Rec, CurMultiClass, Name, + "::"); if (CurMultiClass->Rec.isTemplateArg(MCName)) { const RecordVal *RV = CurMultiClass->Rec.getValue(MCName); @@ -799,58 +666,45 @@ Init *UnOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { return VarInit::get(MCName, RV->getType()); } } - + assert(CurRec && "NULL pointer"); if (Record *D = (CurRec->getRecords()).getDef(Name)) return DefInit::get(D); PrintFatalError(CurRec->getLoc(), "Undefined reference:'" + Name + "'\n"); } + + if (isa(getType())) { + if (BitsInit *BI = dyn_cast(LHS)) { + if (Init *NewInit = BI->convertInitializerTo(IntRecTy::get())) + return NewInit; + break; + } + } } break; } case HEAD: { if (ListInit *LHSl = dyn_cast(LHS)) { - if (LHSl->getSize() == 0) { - assert(0 && "Empty list in car"); - return nullptr; - } + assert(!LHSl->empty() && "Empty list in head"); return LHSl->getElement(0); } break; } case TAIL: { if (ListInit *LHSl = dyn_cast(LHS)) { - if (LHSl->getSize() == 0) { - assert(0 && "Empty list in cdr"); - return nullptr; - } + assert(!LHSl->empty() && "Empty list in tail"); // Note the +1. We can't just pass the result of getValues() // directly. - ArrayRef::iterator begin = LHSl->getValues().begin()+1; - ArrayRef::iterator end = LHSl->getValues().end(); - ListInit *Result = - ListInit::get(ArrayRef(begin, end - begin), - LHSl->getType()); - return Result; + return ListInit::get(LHSl->getValues().slice(1), LHSl->getType()); } break; } case EMPTY: { - if (ListInit *LHSl = dyn_cast(LHS)) { - if (LHSl->getSize() == 0) { - return IntInit::get(1); - } else { - return IntInit::get(0); - } - } - if (StringInit *LHSs = dyn_cast(LHS)) { - if (LHSs->getValue().empty()) { - return IntInit::get(1); - } else { - return IntInit::get(0); - } - } + if (ListInit *LHSl = dyn_cast(LHS)) + return IntInit::get(LHSl->empty()); + if (StringInit *LHSs = dyn_cast(LHS)) + return IntInit::get(LHSs->getValue().empty()); break; } @@ -868,7 +722,7 @@ Init *UnOpInit::resolveReferences(Record &R, const RecordVal *RV) const { std::string UnOpInit::getAsString() const { std::string Result; - switch (Opc) { + switch (getOpcode()) { case CAST: Result = "!cast<" + getType()->getAsString() + ">"; break; case HEAD: Result = "!head"; break; case TAIL: Result = "!tail"; break; @@ -884,14 +738,14 @@ BinOpInit *BinOpInit::get(BinaryOp opc, Init *lhs, RecTy * > Key; - static Pool > ThePool; + static DenseMap> ThePool; Key TheKey(std::make_pair(std::make_pair(std::make_pair(opc, lhs), rhs), Type)); - BinOpInit *&I = ThePool[TheKey]; - if (!I) I = new BinOpInit(opc, lhs, rhs, Type); - return I; + std::unique_ptr &I = ThePool[TheKey]; + if (!I) I.reset(new BinOpInit(opc, lhs, rhs, Type)); + return I.get(); } Init *BinOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { @@ -926,7 +780,7 @@ Init *BinOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { Args.insert(Args.end(), LHSs->begin(), LHSs->end()); Args.insert(Args.end(), RHSs->begin(), RHSs->end()); return ListInit::get( - Args, static_cast(LHSs->getType())->getElementType()); + Args, cast(LHSs->getType())->getElementType()); } break; } @@ -958,17 +812,21 @@ Init *BinOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { break; } case ADD: + case AND: case SHL: case SRA: case SRL: { - IntInit *LHSi = dyn_cast(LHS); - IntInit *RHSi = dyn_cast(RHS); + IntInit *LHSi = + dyn_cast_or_null(LHS->convertInitializerTo(IntRecTy::get())); + IntInit *RHSi = + dyn_cast_or_null(RHS->convertInitializerTo(IntRecTy::get())); if (LHSi && RHSi) { int64_t LHSv = LHSi->getValue(), RHSv = RHSi->getValue(); int64_t Result; switch (getOpcode()) { default: llvm_unreachable("Bad opcode!"); case ADD: Result = LHSv + RHSv; break; + case AND: Result = LHSv & RHSv; break; case SHL: Result = LHSv << RHSv; break; case SRA: Result = LHSv >> RHSv; break; case SRL: Result = (uint64_t)LHSv >> (uint64_t)RHSv; break; @@ -992,9 +850,10 @@ Init *BinOpInit::resolveReferences(Record &R, const RecordVal *RV) const { std::string BinOpInit::getAsString() const { std::string Result; - switch (Opc) { + switch (getOpcode()) { case CONCAT: Result = "!con"; break; case ADD: Result = "!add"; break; + case AND: Result = "!and"; break; case SHL: Result = "!shl"; break; case SRA: Result = "!sra"; break; case SRL: Result = "!srl"; break; @@ -1005,9 +864,8 @@ std::string BinOpInit::getAsString() const { return Result + "(" + LHS->getAsString() + ", " + RHS->getAsString() + ")"; } -TernOpInit *TernOpInit::get(TernaryOp opc, Init *lhs, - Init *mhs, Init *rhs, - RecTy *Type) { +TernOpInit *TernOpInit::get(TernaryOp opc, Init *lhs, Init *mhs, Init *rhs, + RecTy *Type) { typedef std::pair< std::pair< std::pair, Init *>, @@ -1016,8 +874,7 @@ TernOpInit *TernOpInit::get(TernaryOp opc, Init *lhs, Init * > Key; - typedef DenseMap Pool; - static Pool ThePool; + static DenseMap> ThePool; Key TheKey(std::make_pair(std::make_pair(std::make_pair(std::make_pair(opc, Type), @@ -1025,9 +882,9 @@ TernOpInit *TernOpInit::get(TernaryOp opc, Init *lhs, mhs), rhs)); - TernOpInit *&I = ThePool[TheKey]; - if (!I) I = new TernOpInit(opc, lhs, mhs, rhs, Type); - return I; + std::unique_ptr &I = ThePool[TheKey]; + if (!I) I.reset(new TernOpInit(opc, lhs, mhs, rhs, Type)); + return I.get(); } static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type, @@ -1036,28 +893,19 @@ static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type, static Init *EvaluateOperation(OpInit *RHSo, Init *LHS, Init *Arg, RecTy *Type, Record *CurRec, MultiClass *CurMultiClass) { - std::vector NewOperands; - - TypedInit *TArg = dyn_cast(Arg); - // If this is a dag, recurse - if (TArg && TArg->getType()->getAsString() == "dag") { - Init *Result = ForeachHelper(LHS, Arg, RHSo, Type, - CurRec, CurMultiClass); - return Result; - } - - for (int i = 0; i < RHSo->getNumOperands(); ++i) { - OpInit *RHSoo = dyn_cast(RHSo->getOperand(i)); + if (auto *TArg = dyn_cast(Arg)) + if (isa(TArg->getType())) + return ForeachHelper(LHS, Arg, RHSo, Type, CurRec, CurMultiClass); - if (RHSoo) { - Init *Result = EvaluateOperation(RHSoo, LHS, Arg, - Type, CurRec, CurMultiClass); - if (Result) { + std::vector NewOperands; + for (unsigned i = 0; i < RHSo->getNumOperands(); ++i) { + if (auto *RHSoo = dyn_cast(RHSo->getOperand(i))) { + if (Init *Result = EvaluateOperation(RHSoo, LHS, Arg, + Type, CurRec, CurMultiClass)) NewOperands.push_back(Result); - } else { + else NewOperands.push_back(Arg); - } } else if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) { NewOperands.push_back(Arg); } else { @@ -1073,76 +921,63 @@ static Init *EvaluateOperation(OpInit *RHSo, Init *LHS, Init *Arg, static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type, Record *CurRec, MultiClass *CurMultiClass) { - DagInit *MHSd = dyn_cast(MHS); - ListInit *MHSl = dyn_cast(MHS); OpInit *RHSo = dyn_cast(RHS); - if (!RHSo) { + if (!RHSo) PrintFatalError(CurRec->getLoc(), "!foreach requires an operator\n"); - } TypedInit *LHSt = dyn_cast(LHS); if (!LHSt) PrintFatalError(CurRec->getLoc(), "!foreach requires typed variable\n"); - if ((MHSd && isa(Type)) || (MHSl && isa(Type))) { - if (MHSd) { - Init *Val = MHSd->getOperator(); - Init *Result = EvaluateOperation(RHSo, LHS, Val, - Type, CurRec, CurMultiClass); - if (Result) { - Val = Result; - } + DagInit *MHSd = dyn_cast(MHS); + if (MHSd && isa(Type)) { + Init *Val = MHSd->getOperator(); + if (Init *Result = EvaluateOperation(RHSo, LHS, Val, + Type, CurRec, CurMultiClass)) + Val = Result; + + std::vector > args; + for (unsigned int i = 0; i < MHSd->getNumArgs(); ++i) { + Init *Arg = MHSd->getArg(i); + std::string ArgName = MHSd->getArgName(i); + + // Process args + if (Init *Result = EvaluateOperation(RHSo, LHS, Arg, Type, + CurRec, CurMultiClass)) + Arg = Result; + + // TODO: Process arg names + args.push_back(std::make_pair(Arg, ArgName)); + } - std::vector > args; - for (unsigned int i = 0; i < MHSd->getNumArgs(); ++i) { - Init *Arg; - std::string ArgName; - Arg = MHSd->getArg(i); - ArgName = MHSd->getArgName(i); - - // Process args - Init *Result = EvaluateOperation(RHSo, LHS, Arg, Type, - CurRec, CurMultiClass); - if (Result) { - Arg = Result; - } + return DagInit::get(Val, "", args); + } - // TODO: Process arg names - args.push_back(std::make_pair(Arg, ArgName)); + ListInit *MHSl = dyn_cast(MHS); + if (MHSl && isa(Type)) { + std::vector NewOperands; + std::vector NewList(MHSl->begin(), MHSl->end()); + + for (Init *&Item : NewList) { + NewOperands.clear(); + for(unsigned i = 0; i < RHSo->getNumOperands(); ++i) { + // First, replace the foreach variable with the list item + if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) + NewOperands.push_back(Item); + else + NewOperands.push_back(RHSo->getOperand(i)); } - return DagInit::get(Val, "", args); - } - if (MHSl) { - std::vector NewOperands; - std::vector NewList(MHSl->begin(), MHSl->end()); - - for (std::vector::iterator li = NewList.begin(), - liend = NewList.end(); - li != liend; - ++li) { - Init *Item = *li; - NewOperands.clear(); - for(int i = 0; i < RHSo->getNumOperands(); ++i) { - // First, replace the foreach variable with the list item - if (LHS->getAsString() == RHSo->getOperand(i)->getAsString()) { - NewOperands.push_back(Item); - } else { - NewOperands.push_back(RHSo->getOperand(i)); - } - } - - // Now run the operator and use its result as the new list item - const OpInit *NewOp = RHSo->clone(NewOperands); - Init *NewItem = NewOp->Fold(CurRec, CurMultiClass); - if (NewItem != NewOp) - *li = NewItem; - } - return ListInit::get(NewList, MHSl->getType()); + // Now run the operator and use its result as the new list item + const OpInit *NewOp = RHSo->clone(NewOperands); + Init *NewItem = NewOp->Fold(CurRec, CurMultiClass); + if (NewItem != NewOp) + Item = NewItem; } + return ListInit::get(NewList, MHSl->getType()); } return nullptr; } @@ -1162,48 +997,40 @@ Init *TernOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { VarInit *RHSv = dyn_cast(RHS); StringInit *RHSs = dyn_cast(RHS); - if ((LHSd && MHSd && RHSd) - || (LHSv && MHSv && RHSv) - || (LHSs && MHSs && RHSs)) { - if (RHSd) { - Record *Val = RHSd->getDef(); - if (LHSd->getAsString() == RHSd->getAsString()) { - Val = MHSd->getDef(); - } - return DefInit::get(Val); - } - if (RHSv) { - std::string Val = RHSv->getName(); - if (LHSv->getAsString() == RHSv->getAsString()) { - Val = MHSv->getName(); - } - return VarInit::get(Val, getType()); + if (LHSd && MHSd && RHSd) { + Record *Val = RHSd->getDef(); + if (LHSd->getAsString() == RHSd->getAsString()) + Val = MHSd->getDef(); + return DefInit::get(Val); + } + if (LHSv && MHSv && RHSv) { + std::string Val = RHSv->getName(); + if (LHSv->getAsString() == RHSv->getAsString()) + Val = MHSv->getName(); + return VarInit::get(Val, getType()); + } + if (LHSs && MHSs && RHSs) { + std::string Val = RHSs->getValue(); + + std::string::size_type found; + std::string::size_type idx = 0; + while (true) { + found = Val.find(LHSs->getValue(), idx); + if (found == std::string::npos) + break; + Val.replace(found, LHSs->getValue().size(), MHSs->getValue()); + idx = found + MHSs->getValue().size(); } - if (RHSs) { - std::string Val = RHSs->getValue(); - - std::string::size_type found; - std::string::size_type idx = 0; - do { - found = Val.find(LHSs->getValue(), idx); - if (found != std::string::npos) { - Val.replace(found, LHSs->getValue().size(), MHSs->getValue()); - } - idx = found + MHSs->getValue().size(); - } while (found != std::string::npos); - return StringInit::get(Val); - } + return StringInit::get(Val); } break; } case FOREACH: { - Init *Result = ForeachHelper(LHS, MHS, RHS, getType(), - CurRec, CurMultiClass); - if (Result) { + if (Init *Result = ForeachHelper(LHS, MHS, RHS, getType(), + CurRec, CurMultiClass)) return Result; - } break; } @@ -1212,11 +1039,9 @@ Init *TernOpInit::Fold(Record *CurRec, MultiClass *CurMultiClass) const { if (Init *I = LHS->convertInitializerTo(IntRecTy::get())) LHSi = dyn_cast(I); if (LHSi) { - if (LHSi->getValue()) { + if (LHSi->getValue()) return MHS; - } else { - return RHS; - } + return RHS; } break; } @@ -1229,7 +1054,7 @@ Init *TernOpInit::resolveReferences(Record &R, const RecordVal *RV) const { Init *lhs = LHS->resolveReferences(R, RV); - if (Opc == IF && lhs != LHS) { + if (getOpcode() == IF && lhs != LHS) { IntInit *Value = dyn_cast(lhs); if (Init *I = lhs->convertInitializerTo(IntRecTy::get())) Value = dyn_cast(I); @@ -1239,11 +1064,10 @@ Init *TernOpInit::resolveReferences(Record &R, Init *mhs = MHS->resolveReferences(R, RV); return (TernOpInit::get(getOpcode(), lhs, mhs, RHS, getType()))->Fold(&R, nullptr); - } else { - Init *rhs = RHS->resolveReferences(R, RV); - return (TernOpInit::get(getOpcode(), lhs, MHS, - rhs, getType()))->Fold(&R, nullptr); } + Init *rhs = RHS->resolveReferences(R, RV); + return (TernOpInit::get(getOpcode(), lhs, MHS, + rhs, getType()))->Fold(&R, nullptr); } } @@ -1258,13 +1082,13 @@ Init *TernOpInit::resolveReferences(Record &R, std::string TernOpInit::getAsString() const { std::string Result; - switch (Opc) { + switch (getOpcode()) { case SUBST: Result = "!subst"; break; case FOREACH: Result = "!foreach"; break; case IF: Result = "!if"; break; - } - return Result + "(" + LHS->getAsString() + ", " + MHS->getAsString() + ", " - + RHS->getAsString() + ")"; + } + return Result + "(" + LHS->getAsString() + ", " + MHS->getAsString() + ", " + + RHS->getAsString() + ")"; } RecTy *TypedInit::getFieldType(const std::string &FieldName) const { @@ -1274,6 +1098,82 @@ RecTy *TypedInit::getFieldType(const std::string &FieldName) const { return nullptr; } +Init * +TypedInit::convertInitializerTo(RecTy *Ty) const { + if (isa(Ty)) { + if (getType()->typeIsConvertibleTo(Ty)) + return const_cast(this); + return nullptr; + } + + if (isa(Ty)) { + if (isa(getType())) + return const_cast(this); + return nullptr; + } + + if (isa(Ty)) { + // Accept variable if it is already of bit type! + if (isa(getType())) + return const_cast(this); + if (auto *BitsTy = dyn_cast(getType())) { + // Accept only bits<1> expression. + if (BitsTy->getNumBits() == 1) + return const_cast(this); + return nullptr; + } + // Ternary !if can be converted to bit, but only if both sides are + // convertible to a bit. + if (const auto *TOI = dyn_cast(this)) { + if (TOI->getOpcode() == TernOpInit::TernaryOp::IF && + TOI->getMHS()->convertInitializerTo(BitRecTy::get()) && + TOI->getRHS()->convertInitializerTo(BitRecTy::get())) + return const_cast(this); + return nullptr; + } + return nullptr; + } + + if (auto *BRT = dyn_cast(Ty)) { + if (BRT->getNumBits() == 1 && isa(getType())) + return BitsInit::get(const_cast(this)); + + if (getType()->typeIsConvertibleTo(BRT)) { + SmallVector NewBits(BRT->getNumBits()); + + for (unsigned i = 0; i != BRT->getNumBits(); ++i) + NewBits[i] = VarBitInit::get(const_cast(this), i); + return BitsInit::get(NewBits); + } + + return nullptr; + } + + if (auto *DLRT = dyn_cast(Ty)) { + if (auto *SLRT = dyn_cast(getType())) + if (SLRT->getElementType()->typeIsConvertibleTo(DLRT->getElementType())) + return const_cast(this); + return nullptr; + } + + if (auto *DRT = dyn_cast(Ty)) { + if (getType()->typeIsConvertibleTo(DRT)) + return const_cast(this); + return nullptr; + } + + if (auto *SRRT = dyn_cast(Ty)) { + // Ensure that this is compatible with Rec. + if (RecordRecTy *DRRT = dyn_cast(getType())) + if (DRRT->getRecord()->isSubClassOf(SRRT->getRecord()) || + DRRT->getRecord() == SRRT->getRecord()) + return const_cast(this); + return nullptr; + } + + return nullptr; +} + Init * TypedInit::convertInitializerBitRange(const std::vector &Bits) const { BitsRecTy *T = dyn_cast(getType()); @@ -1314,18 +1214,17 @@ VarInit *VarInit::get(const std::string &VN, RecTy *T) { VarInit *VarInit::get(Init *VN, RecTy *T) { typedef std::pair Key; - static Pool > ThePool; + static DenseMap> ThePool; Key TheKey(std::make_pair(T, VN)); - VarInit *&I = ThePool[TheKey]; - if (!I) I = new VarInit(VN, T); - return I; + std::unique_ptr &I = ThePool[TheKey]; + if (!I) I.reset(new VarInit(VN, T)); + return I.get(); } const std::string &VarInit::getName() const { - StringInit *NameString = dyn_cast(getNameInit()); - assert(NameString && "VarInit name is not a string!"); + StringInit *NameString = cast(getNameInit()); return NameString->getValue(); } @@ -1344,13 +1243,10 @@ Init *VarInit::resolveListElementReference(Record &R, RecordVal *RV = R.getValue(getNameInit()); assert(RV && "Reference to a non-existent variable?"); ListInit *LI = dyn_cast(RV->getValue()); - if (!LI) { - TypedInit *VI = dyn_cast(RV->getValue()); - assert(VI && "Invalid list element!"); - return VarListElementInit::get(VI, Elt); - } + if (!LI) + return VarListElementInit::get(cast(RV->getValue()), Elt); - if (Elt >= LI->getSize()) + if (Elt >= LI->size()) return nullptr; // Out of range reference. Init *E = LI->getElement(Elt); // If the element is set to some value, or if we are resolving a reference @@ -1379,8 +1275,7 @@ Init *VarInit::getFieldInit(Record &R, const RecordVal *RV, assert(TheInit != this && "Infinite loop detected!"); if (Init *I = TheInit->getFieldInit(R, RV, FieldName)) return I; - else - return nullptr; + return nullptr; } return nullptr; } @@ -1399,19 +1294,24 @@ Init *VarInit::resolveReferences(Record &R, const RecordVal *RV) const { VarBitInit *VarBitInit::get(TypedInit *T, unsigned B) { typedef std::pair Key; - typedef DenseMap Pool; - - static Pool ThePool; + static DenseMap> ThePool; Key TheKey(std::make_pair(T, B)); - VarBitInit *&I = ThePool[TheKey]; - if (!I) I = new VarBitInit(T, B); - return I; + std::unique_ptr &I = ThePool[TheKey]; + if (!I) I.reset(new VarBitInit(T, B)); + return I.get(); +} + +Init *VarBitInit::convertInitializerTo(RecTy *Ty) const { + if (isa(Ty)) + return const_cast(this); + + return nullptr; } std::string VarBitInit::getAsString() const { - return TI->getAsString() + "{" + utostr(Bit) + "}"; + return TI->getAsString() + "{" + utostr(Bit) + "}"; } Init *VarBitInit::resolveReferences(Record &R, const RecordVal *RV) const { @@ -1425,15 +1325,13 @@ Init *VarBitInit::resolveReferences(Record &R, const RecordVal *RV) const { VarListElementInit *VarListElementInit::get(TypedInit *T, unsigned E) { typedef std::pair Key; - typedef DenseMap Pool; - - static Pool ThePool; + static DenseMap> ThePool; Key TheKey(std::make_pair(T, E)); - VarListElementInit *&I = ThePool[TheKey]; - if (!I) I = new VarListElementInit(T, E); - return I; + std::unique_ptr &I = ThePool[TheKey]; + if (!I) I.reset(new VarListElementInit(T, E)); + return I.get(); } std::string VarListElementInit::getAsString() const { @@ -1457,17 +1355,15 @@ Init *VarListElementInit::getBit(unsigned Bit) const { Init *VarListElementInit:: resolveListElementReference(Record &R, const RecordVal *RV, unsigned Elt) const { - Init *Result = TI->resolveListElementReference(R, RV, Element); - - if (Result) { + if (Init *Result = TI->resolveListElementReference(R, RV, Element)) { if (TypedInit *TInit = dyn_cast(Result)) { - Init *Result2 = TInit->resolveListElementReference(R, RV, Elt); - if (Result2) return Result2; - return new VarListElementInit(TInit, Elt); + if (Init *Result2 = TInit->resolveListElementReference(R, RV, Elt)) + return Result2; + return VarListElementInit::get(TInit, Elt); } return Result; } - + return nullptr; } @@ -1475,6 +1371,13 @@ DefInit *DefInit::get(Record *R) { return R->getDefInit(); } +Init *DefInit::convertInitializerTo(RecTy *Ty) const { + if (auto *RRT = dyn_cast(Ty)) + if (getDef()->isSubClassOf(RRT->getRecord())) + return const_cast(this); + return nullptr; +} + RecTy *DefInit::getFieldType(const std::string &FieldName) const { if (const RecordVal *RV = Def->getValue(FieldName)) return RV->getType(); @@ -1493,14 +1396,13 @@ std::string DefInit::getAsString() const { FieldInit *FieldInit::get(Init *R, const std::string &FN) { typedef std::pair Key; - typedef DenseMap Pool; - static Pool ThePool; + static DenseMap> ThePool; Key TheKey(std::make_pair(R, FN)); - FieldInit *&I = ThePool[TheKey]; - if (!I) I = new FieldInit(R, FN); - return I; + std::unique_ptr &I = ThePool[TheKey]; + if (!I) I.reset(new FieldInit(R, FN)); + return I.get(); } Init *FieldInit::getBit(unsigned Bit) const { @@ -1513,7 +1415,7 @@ Init *FieldInit::resolveListElementReference(Record &R, const RecordVal *RV, unsigned Elt) const { if (Init *ListVal = Rec->getFieldInit(R, RV, FieldName)) if (ListInit *LI = dyn_cast(ListVal)) { - if (Elt >= LI->getSize()) return nullptr; + if (Elt >= LI->size()) return nullptr; Init *E = LI->getElement(Elt); // If the element is set to some value, or if we are resolving a @@ -1528,15 +1430,13 @@ Init *FieldInit::resolveListElementReference(Record &R, const RecordVal *RV, Init *FieldInit::resolveReferences(Record &R, const RecordVal *RV) const { Init *NewRec = RV ? Rec->resolveReferences(R, RV) : Rec; - Init *BitsVal = NewRec->getFieldInit(R, RV, FieldName); - if (BitsVal) { + if (Init *BitsVal = NewRec->getFieldInit(R, RV, FieldName)) { Init *BVR = BitsVal->resolveReferences(R, RV); return BVR->isComplete() ? BVR : const_cast(this); } - if (NewRec != Rec) { + if (NewRec != Rec) return FieldInit::get(NewRec, FieldName); - } return const_cast(this); } @@ -1560,8 +1460,8 @@ DagInit * DagInit::get(Init *V, const std::string &VN, ArrayRef ArgRange, ArrayRef NameRange) { - typedef FoldingSet Pool; - static Pool ThePool; + static FoldingSet ThePool; + static std::vector> TheActualPool; FoldingSetNodeID ID; ProfileDagInit(ID, V, VN, ArgRange, NameRange); @@ -1572,24 +1472,19 @@ DagInit::get(Init *V, const std::string &VN, DagInit *I = new DagInit(V, VN, ArgRange, NameRange); ThePool.InsertNode(I, IP); - + TheActualPool.push_back(std::unique_ptr(I)); return I; } DagInit * DagInit::get(Init *V, const std::string &VN, const std::vector > &args) { - typedef std::pair PairType; - std::vector Args; std::vector Names; - for (std::vector::const_iterator i = args.begin(), - iend = args.end(); - i != iend; - ++i) { - Args.push_back(i->first); - Names.push_back(i->second); + for (const auto &Arg : args) { + Args.push_back(Arg.first); + Names.push_back(Arg.second); } return DagInit::get(V, VN, Args, Names); @@ -1599,6 +1494,13 @@ void DagInit::Profile(FoldingSetNodeID &ID) const { ProfileDagInit(ID, Val, ValName, Args, ArgNames); } +Init *DagInit::convertInitializerTo(RecTy *Ty) const { + if (isa(Ty)) + return const_cast(this); + + return nullptr; +} + Init *DagInit::resolveReferences(Record &R, const RecordVal *RV) const { std::vector NewArgs; for (unsigned i = 0, e = Args.size(); i != e; ++i) @@ -1617,7 +1519,7 @@ std::string DagInit::getAsString() const { std::string Result = "(" + Val->getAsString(); if (!ValName.empty()) Result += ":" + ValName; - if (Args.size()) { + if (!Args.empty()) { Result += " " + Args[0]->getAsString(); if (!ArgNames[0].empty()) Result += ":$" + ArgNames[0]; for (unsigned i = 1, e = Args.size(); i != e; ++i) { @@ -1633,22 +1535,20 @@ std::string DagInit::getAsString() const { // Other implementations //===----------------------------------------------------------------------===// -RecordVal::RecordVal(Init *N, RecTy *T, unsigned P) - : Name(N), Ty(T), Prefix(P) { - Value = Ty->convertValue(UnsetInit::get()); +RecordVal::RecordVal(Init *N, RecTy *T, bool P) + : NameAndPrefix(N, P), Ty(T) { + Value = UnsetInit::get()->convertInitializerTo(Ty); assert(Value && "Cannot create unset value for current type!"); } -RecordVal::RecordVal(const std::string &N, RecTy *T, unsigned P) - : Name(StringInit::get(N)), Ty(T), Prefix(P) { - Value = Ty->convertValue(UnsetInit::get()); +RecordVal::RecordVal(const std::string &N, RecTy *T, bool P) + : NameAndPrefix(StringInit::get(N), P), Ty(T) { + Value = UnsetInit::get()->convertInitializerTo(Ty); assert(Value && "Cannot create unset value for current type!"); } const std::string &RecordVal::getName() const { - StringInit *NameString = dyn_cast(Name); - assert(NameString && "RecordVal name is not a string!"); - return NameString->getValue(); + return cast(getNameInit())->getValue(); } void RecordVal::dump() const { errs() << *this; } @@ -1676,33 +1576,22 @@ void Record::init() { void Record::checkName() { // Ensure the record name has string type. - const TypedInit *TypedName = dyn_cast(Name); - assert(TypedName && "Record name is not typed!"); - RecTy *Type = TypedName->getType(); - if (!isa(Type)) + const TypedInit *TypedName = cast(Name); + if (!isa(TypedName->getType())) PrintFatalError(getLoc(), "Record name is not a string!"); } DefInit *Record::getDefInit() { if (!TheInit) - TheInit = new DefInit(this, new RecordRecTy(this)); - return TheInit; + TheInit.reset(new DefInit(this, new RecordRecTy(this))); + return TheInit.get(); } const std::string &Record::getName() const { - const StringInit *NameString = dyn_cast(Name); - assert(NameString && "Record name is not a string!"); - return NameString->getValue(); + return cast(Name)->getValue(); } void Record::setName(Init *NewName) { - if (TrackedRecords.getDef(Name->getAsUnquotedString()) == this) { - TrackedRecords.removeDef(Name->getAsUnquotedString()); - TrackedRecords.addDef(this); - } else if (TrackedRecords.getClass(Name->getAsUnquotedString()) == this) { - TrackedRecords.removeClass(Name->getAsUnquotedString()); - TrackedRecords.addClass(this); - } // Otherwise this isn't yet registered. Name = NewName; checkName(); // DO NOT resolve record values to the name at this point because @@ -1731,14 +1620,13 @@ void Record::resolveReferencesTo(const RecordVal *RV) { continue; if (Init *V = Values[i].getValue()) if (Values[i].setValue(V->resolveReferences(*this, RV))) - PrintFatalError(getLoc(), "Invalid value is found when setting '" - + Values[i].getNameInitAsString() - + "' after resolving references" - + (RV ? " against '" + RV->getNameInitAsString() - + "' of (" - + RV->getValue()->getAsUnquotedString() + ")" - : "") - + "\n"); + PrintFatalError(getLoc(), "Invalid value is found when setting '" + + Values[i].getNameInitAsString() + + "' after resolving references" + + (RV ? " against '" + RV->getNameInitAsString() + + "' of (" + RV->getValue()->getAsUnquotedString() + + ")" + : "") + "\n"); } Init *OldName = getNameInit(); Init *NewName = Name->resolveReferences(*this, RV); @@ -1753,12 +1641,14 @@ void Record::dump() const { errs() << *this; } raw_ostream &llvm::operator<<(raw_ostream &OS, const Record &R) { OS << R.getNameInitAsString(); - const std::vector &TArgs = R.getTemplateArgs(); + ArrayRef TArgs = R.getTemplateArgs(); if (!TArgs.empty()) { OS << "<"; - for (unsigned i = 0, e = TArgs.size(); i != e; ++i) { - if (i) OS << ", "; - const RecordVal *RV = R.getValue(TArgs[i]); + bool NeedComma = false; + for (const Init *TA : TArgs) { + if (NeedComma) OS << ", "; + NeedComma = true; + const RecordVal *RV = R.getValue(TA); assert(RV && "Template argument record not found??"); RV->print(OS, false); } @@ -1766,21 +1656,20 @@ raw_ostream &llvm::operator<<(raw_ostream &OS, const Record &R) { } OS << " {"; - const std::vector &SC = R.getSuperClasses(); + ArrayRef SC = R.getSuperClasses(); if (!SC.empty()) { OS << "\t//"; - for (unsigned i = 0, e = SC.size(); i != e; ++i) - OS << " " << SC[i]->getNameInitAsString(); + for (const Record *Super : SC) + OS << " " << Super->getNameInitAsString(); } OS << "\n"; - const std::vector &Vals = R.getValues(); - for (unsigned i = 0, e = Vals.size(); i != e; ++i) - if (Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName())) - OS << Vals[i]; - for (unsigned i = 0, e = Vals.size(); i != e; ++i) - if (!Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName())) - OS << Vals[i]; + for (const RecordVal &Val : R.getValues()) + if (Val.getPrefix() && !R.isTemplateArg(Val.getName())) + OS << Val; + for (const RecordVal &Val : R.getValues()) + if (!Val.getPrefix() && !R.isTemplateArg(Val.getName())) + OS << Val; return OS << "}\n"; } @@ -1853,13 +1742,12 @@ std::vector Record::getValueAsListOfDefs(StringRef FieldName) const { ListInit *List = getValueAsListInit(FieldName); std::vector Defs; - for (unsigned i = 0; i < List->getSize(); i++) { - if (DefInit *DI = dyn_cast(List->getElement(i))) { + for (Init *I : List->getValues()) { + if (DefInit *DI = dyn_cast(I)) Defs.push_back(DI->getDef()); - } else { + else PrintFatalError(getLoc(), "Record `" + getName() + "', field `" + FieldName + "' list is not entirely DefInit!"); - } } return Defs; } @@ -1888,13 +1776,12 @@ std::vector Record::getValueAsListOfInts(StringRef FieldName) const { ListInit *List = getValueAsListInit(FieldName); std::vector Ints; - for (unsigned i = 0; i < List->getSize(); i++) { - if (IntInit *II = dyn_cast(List->getElement(i))) { + for (Init *I : List->getValues()) { + if (IntInit *II = dyn_cast(I)) Ints.push_back(II->getValue()); - } else { + else PrintFatalError(getLoc(), "Record `" + getName() + "', field `" + FieldName + "' does not have a list of ints initializer!"); - } } return Ints; } @@ -1907,13 +1794,12 @@ std::vector Record::getValueAsListOfStrings(StringRef FieldName) const { ListInit *List = getValueAsListInit(FieldName); std::vector Strings; - for (unsigned i = 0; i < List->getSize(); i++) { - if (StringInit *II = dyn_cast(List->getElement(i))) { - Strings.push_back(II->getValue()); - } else { + for (Init *I : List->getValues()) { + if (StringInit *SI = dyn_cast(I)) + Strings.push_back(SI->getValue()); + else PrintFatalError(getLoc(), "Record `" + getName() + "', field `" + FieldName + "' does not have a list of strings initializer!"); - } } return Strings; } @@ -1956,7 +1842,7 @@ bool Record::getValueAsBitOrUnset(StringRef FieldName, bool &Unset) const { PrintFatalError(getLoc(), "Record `" + getName() + "' does not have a field named `" + FieldName.str() + "'!\n"); - if (R->getValue() == UnsetInit::get()) { + if (isa(R->getValue())) { Unset = true; return false; } @@ -1989,12 +1875,8 @@ void MultiClass::dump() const { Rec.dump(); errs() << "Defs:\n"; - for (RecordVector::const_iterator r = DefPrototypes.begin(), - rend = DefPrototypes.end(); - r != rend; - ++r) { - (*r)->dump(); - } + for (const auto &Proto : DefPrototypes) + Proto->dump(); } @@ -2002,16 +1884,12 @@ void RecordKeeper::dump() const { errs() << *this; } raw_ostream &llvm::operator<<(raw_ostream &OS, const RecordKeeper &RK) { OS << "------------- Classes -----------------\n"; - const std::map &Classes = RK.getClasses(); - for (std::map::const_iterator I = Classes.begin(), - E = Classes.end(); I != E; ++I) - OS << "class " << *I->second; + for (const auto &C : RK.getClasses()) + OS << "class " << *C.second; OS << "------------- Defs -----------------\n"; - const std::map &Defs = RK.getDefs(); - for (std::map::const_iterator I = Defs.begin(), - E = Defs.end(); I != E; ++I) - OS << "def " << *I->second; + for (const auto &D : RK.getDefs()) + OS << "def " << *D.second; return OS; } @@ -2026,10 +1904,9 @@ RecordKeeper::getAllDerivedDefinitions(const std::string &ClassName) const { PrintFatalError("ERROR: Couldn't find the `" + ClassName + "' class!\n"); std::vector Defs; - for (std::map::const_iterator I = getDefs().begin(), - E = getDefs().end(); I != E; ++I) - if (I->second->isSubClassOf(Class)) - Defs.push_back(I->second); + for (const auto &D : getDefs()) + if (D.second->isSubClassOf(Class)) + Defs.push_back(D.second.get()); return Defs; } @@ -2038,26 +1915,26 @@ RecordKeeper::getAllDerivedDefinitions(const std::string &ClassName) const { /// to CurRec's name. Init *llvm::QualifyName(Record &CurRec, MultiClass *CurMultiClass, Init *Name, const std::string &Scoper) { - RecTy *Type = dyn_cast(Name)->getType(); + RecTy *Type = cast(Name)->getType(); BinOpInit *NewName = - BinOpInit::get(BinOpInit::STRCONCAT, - BinOpInit::get(BinOpInit::STRCONCAT, - CurRec.getNameInit(), - StringInit::get(Scoper), - Type)->Fold(&CurRec, CurMultiClass), - Name, - Type); + BinOpInit::get(BinOpInit::STRCONCAT, + BinOpInit::get(BinOpInit::STRCONCAT, + CurRec.getNameInit(), + StringInit::get(Scoper), + Type)->Fold(&CurRec, CurMultiClass), + Name, + Type); if (CurMultiClass && Scoper != "::") { NewName = - BinOpInit::get(BinOpInit::STRCONCAT, - BinOpInit::get(BinOpInit::STRCONCAT, - CurMultiClass->Rec.getNameInit(), - StringInit::get("::"), - Type)->Fold(&CurRec, CurMultiClass), - NewName->Fold(&CurRec, CurMultiClass), - Type); + BinOpInit::get(BinOpInit::STRCONCAT, + BinOpInit::get(BinOpInit::STRCONCAT, + CurMultiClass->Rec.getNameInit(), + StringInit::get("::"), + Type)->Fold(&CurRec, CurMultiClass), + NewName->Fold(&CurRec, CurMultiClass), + Type); } return NewName->Fold(&CurRec, CurMultiClass);