Chris Lattner | f5bd1b7 | 2003-10-05 19:27:59 +0000 | [diff] [blame] | 1 | //===- Record.cpp - Record implementation ---------------------------------===// |
John Criswell | d303203 | 2003-10-20 20:20:30 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | f5bd1b7 | 2003-10-05 19:27:59 +0000 | [diff] [blame] | 9 | // |
| 10 | // |
| 11 | //===----------------------------------------------------------------------===// |
| 12 | |
| 13 | #include "Record.h" |
| 14 | |
| 15 | //===----------------------------------------------------------------------===// |
| 16 | // Type implementations |
| 17 | //===----------------------------------------------------------------------===// |
| 18 | |
Brian Gaeke | 960707c | 2003-11-11 22:41:34 +0000 | [diff] [blame^] | 19 | namespace llvm { |
| 20 | |
Chris Lattner | f5bd1b7 | 2003-10-05 19:27:59 +0000 | [diff] [blame] | 21 | void RecTy::dump() const { print(std::cerr); } |
| 22 | |
| 23 | Init *BitRecTy::convertValue(BitsInit *BI) { |
| 24 | if (BI->getNumBits() != 1) return 0; // Only accept if just one bit! |
| 25 | return BI->getBit(0); |
| 26 | } |
| 27 | |
| 28 | bool BitRecTy::baseClassOf(const BitsRecTy *RHS) const { |
| 29 | return RHS->getNumBits() == 1; |
| 30 | } |
| 31 | |
| 32 | Init *BitRecTy::convertValue(IntInit *II) { |
| 33 | int Val = II->getValue(); |
| 34 | if (Val != 0 && Val != 1) return 0; // Only accept 0 or 1 for a bit! |
| 35 | |
| 36 | return new BitInit(Val != 0); |
| 37 | } |
| 38 | |
| 39 | Init *BitRecTy::convertValue(TypedInit *VI) { |
| 40 | if (dynamic_cast<BitRecTy*>(VI->getType())) |
| 41 | return VI; // Accept variable if it is already of bit type! |
| 42 | return 0; |
| 43 | } |
| 44 | |
| 45 | Init *BitsRecTy::convertValue(UnsetInit *UI) { |
| 46 | BitsInit *Ret = new BitsInit(Size); |
| 47 | |
| 48 | for (unsigned i = 0; i != Size; ++i) |
| 49 | Ret->setBit(i, new UnsetInit()); |
| 50 | return Ret; |
| 51 | } |
| 52 | |
| 53 | Init *BitsRecTy::convertValue(BitInit *UI) { |
| 54 | if (Size != 1) return 0; // Can only convert single bit... |
| 55 | BitsInit *Ret = new BitsInit(1); |
| 56 | Ret->setBit(0, UI); |
| 57 | return Ret; |
| 58 | } |
| 59 | |
| 60 | // convertValue from Int initializer to bits type: Split the integer up into the |
| 61 | // appropriate bits... |
| 62 | // |
| 63 | Init *BitsRecTy::convertValue(IntInit *II) { |
| 64 | int Value = II->getValue(); |
| 65 | // Make sure this bitfield is large enough to hold the integer value... |
| 66 | if (Value >= 0) { |
| 67 | if (Value & ~((1 << Size)-1)) |
| 68 | return 0; |
| 69 | } else { |
| 70 | if ((Value >> Size) != -1 || ((Value & (1 << Size-1)) == 0)) |
| 71 | return 0; |
| 72 | } |
| 73 | |
| 74 | BitsInit *Ret = new BitsInit(Size); |
| 75 | for (unsigned i = 0; i != Size; ++i) |
| 76 | Ret->setBit(i, new BitInit(Value & (1 << i))); |
| 77 | |
| 78 | return Ret; |
| 79 | } |
| 80 | |
| 81 | Init *BitsRecTy::convertValue(BitsInit *BI) { |
| 82 | // If the number of bits is right, return it. Otherwise we need to expand or |
| 83 | // truncate... |
| 84 | if (BI->getNumBits() == Size) return BI; |
| 85 | return 0; |
| 86 | } |
| 87 | |
| 88 | Init *BitsRecTy::convertValue(TypedInit *VI) { |
| 89 | if (BitsRecTy *BRT = dynamic_cast<BitsRecTy*>(VI->getType())) |
| 90 | if (BRT->Size == Size) { |
| 91 | BitsInit *Ret = new BitsInit(Size); |
| 92 | for (unsigned i = 0; i != Size; ++i) |
| 93 | Ret->setBit(i, new VarBitInit(VI, i)); |
| 94 | return Ret; |
| 95 | } |
| 96 | if (Size == 1 && dynamic_cast<BitRecTy*>(VI->getType())) { |
| 97 | BitsInit *Ret = new BitsInit(1); |
| 98 | Ret->setBit(0, VI); |
| 99 | return Ret; |
| 100 | } |
| 101 | |
| 102 | return 0; |
| 103 | } |
| 104 | |
| 105 | Init *IntRecTy::convertValue(BitInit *BI) { |
| 106 | return new IntInit(BI->getValue()); |
| 107 | } |
| 108 | |
| 109 | Init *IntRecTy::convertValue(BitsInit *BI) { |
| 110 | int Result = 0; |
| 111 | for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) |
| 112 | if (BitInit *Bit = dynamic_cast<BitInit*>(BI->getBit(i))) { |
| 113 | Result |= Bit->getValue() << i; |
| 114 | } else { |
| 115 | return 0; |
| 116 | } |
| 117 | return new IntInit(Result); |
| 118 | } |
| 119 | |
| 120 | Init *IntRecTy::convertValue(TypedInit *TI) { |
| 121 | if (TI->getType()->typeIsConvertibleTo(this)) |
| 122 | return TI; // Accept variable if already of the right type! |
| 123 | return 0; |
| 124 | } |
| 125 | |
| 126 | Init *StringRecTy::convertValue(TypedInit *TI) { |
| 127 | if (dynamic_cast<StringRecTy*>(TI->getType())) |
| 128 | return TI; // Accept variable if already of the right type! |
| 129 | return 0; |
| 130 | } |
| 131 | |
| 132 | void ListRecTy::print(std::ostream &OS) const { |
| 133 | OS << "list<" << *Ty << ">"; |
| 134 | } |
| 135 | |
| 136 | Init *ListRecTy::convertValue(ListInit *LI) { |
| 137 | std::vector<Init*> Elements; |
| 138 | |
| 139 | // Verify that all of the elements of the list are subclasses of the |
| 140 | // appropriate class! |
| 141 | for (unsigned i = 0, e = LI->getSize(); i != e; ++i) |
| 142 | if (Init *CI = LI->getElement(i)->convertInitializerTo(Ty)) |
| 143 | Elements.push_back(CI); |
| 144 | else |
| 145 | return 0; |
| 146 | |
| 147 | return new ListInit(Elements); |
| 148 | } |
| 149 | |
| 150 | Init *ListRecTy::convertValue(TypedInit *TI) { |
| 151 | // Ensure that TI is compatible with our class. |
| 152 | if (ListRecTy *LRT = dynamic_cast<ListRecTy*>(TI->getType())) |
| 153 | if (LRT->getElementType()->typeIsConvertibleTo(getElementType())) |
| 154 | return TI; |
| 155 | return 0; |
| 156 | } |
| 157 | |
| 158 | Init *CodeRecTy::convertValue(TypedInit *TI) { |
| 159 | if (TI->getType()->typeIsConvertibleTo(this)) |
| 160 | return TI; |
| 161 | return 0; |
| 162 | } |
| 163 | |
| 164 | Init *DagRecTy::convertValue(TypedInit *TI) { |
| 165 | if (TI->getType()->typeIsConvertibleTo(this)) |
| 166 | return TI; |
| 167 | return 0; |
| 168 | } |
| 169 | |
| 170 | |
| 171 | void RecordRecTy::print(std::ostream &OS) const { |
| 172 | OS << Rec->getName(); |
| 173 | } |
| 174 | |
| 175 | Init *RecordRecTy::convertValue(DefInit *DI) { |
| 176 | // Ensure that DI is a subclass of Rec. |
| 177 | if (!DI->getDef()->isSubClassOf(Rec)) |
| 178 | return 0; |
| 179 | return DI; |
| 180 | } |
| 181 | |
| 182 | Init *RecordRecTy::convertValue(TypedInit *TI) { |
| 183 | // Ensure that TI is compatible with Rec. |
| 184 | if (RecordRecTy *RRT = dynamic_cast<RecordRecTy*>(TI->getType())) |
| 185 | if (RRT->getRecord()->isSubClassOf(getRecord()) || |
| 186 | RRT->getRecord() == getRecord()) |
| 187 | return TI; |
| 188 | return 0; |
| 189 | } |
| 190 | |
| 191 | bool RecordRecTy::baseClassOf(const RecordRecTy *RHS) const { |
| 192 | return Rec == RHS->getRecord() || RHS->getRecord()->isSubClassOf(Rec); |
| 193 | } |
| 194 | |
| 195 | |
| 196 | //===----------------------------------------------------------------------===// |
| 197 | // Initializer implementations |
| 198 | //===----------------------------------------------------------------------===// |
| 199 | |
| 200 | void Init::dump() const { return print(std::cerr); } |
| 201 | |
| 202 | Init *BitsInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) { |
| 203 | BitsInit *BI = new BitsInit(Bits.size()); |
| 204 | for (unsigned i = 0, e = Bits.size(); i != e; ++i) { |
| 205 | if (Bits[i] >= getNumBits()) { |
| 206 | delete BI; |
| 207 | return 0; |
| 208 | } |
| 209 | BI->setBit(i, getBit(Bits[i])); |
| 210 | } |
| 211 | return BI; |
| 212 | } |
| 213 | |
| 214 | void BitsInit::print(std::ostream &OS) const { |
| 215 | //if (!printInHex(OS)) return; |
| 216 | //if (!printAsVariable(OS)) return; |
| 217 | //if (!printAsUnset(OS)) return; |
| 218 | |
| 219 | OS << "{ "; |
| 220 | for (unsigned i = 0, e = getNumBits(); i != e; ++i) { |
| 221 | if (i) OS << ", "; |
| 222 | if (Init *Bit = getBit(e-i-1)) |
| 223 | Bit->print(OS); |
| 224 | else |
| 225 | OS << "*"; |
| 226 | } |
| 227 | OS << " }"; |
| 228 | } |
| 229 | |
| 230 | bool BitsInit::printInHex(std::ostream &OS) const { |
| 231 | // First, attempt to convert the value into an integer value... |
| 232 | int Result = 0; |
| 233 | for (unsigned i = 0, e = getNumBits(); i != e; ++i) |
| 234 | if (BitInit *Bit = dynamic_cast<BitInit*>(getBit(i))) { |
| 235 | Result |= Bit->getValue() << i; |
| 236 | } else { |
| 237 | return true; |
| 238 | } |
| 239 | |
| 240 | OS << "0x" << std::hex << Result << std::dec; |
| 241 | return false; |
| 242 | } |
| 243 | |
| 244 | bool BitsInit::printAsVariable(std::ostream &OS) const { |
| 245 | // Get the variable that we may be set equal to... |
| 246 | assert(getNumBits() != 0); |
| 247 | VarBitInit *FirstBit = dynamic_cast<VarBitInit*>(getBit(0)); |
| 248 | if (FirstBit == 0) return true; |
| 249 | TypedInit *Var = FirstBit->getVariable(); |
| 250 | |
| 251 | // Check to make sure the types are compatible. |
| 252 | BitsRecTy *Ty = dynamic_cast<BitsRecTy*>(FirstBit->getVariable()->getType()); |
| 253 | if (Ty == 0) return true; |
| 254 | if (Ty->getNumBits() != getNumBits()) return true; // Incompatible types! |
| 255 | |
| 256 | // Check to make sure all bits are referring to the right bits in the variable |
| 257 | for (unsigned i = 0, e = getNumBits(); i != e; ++i) { |
| 258 | VarBitInit *Bit = dynamic_cast<VarBitInit*>(getBit(i)); |
| 259 | if (Bit == 0 || Bit->getVariable() != Var || Bit->getBitNum() != i) |
| 260 | return true; |
| 261 | } |
| 262 | |
| 263 | Var->print(OS); |
| 264 | return false; |
| 265 | } |
| 266 | |
| 267 | bool BitsInit::printAsUnset(std::ostream &OS) const { |
| 268 | for (unsigned i = 0, e = getNumBits(); i != e; ++i) |
| 269 | if (!dynamic_cast<UnsetInit*>(getBit(i))) |
| 270 | return true; |
| 271 | OS << "?"; |
| 272 | return false; |
| 273 | } |
| 274 | |
| 275 | // resolveReferences - If there are any field references that refer to fields |
| 276 | // that have been filled in, we can propagate the values now. |
| 277 | // |
| 278 | Init *BitsInit::resolveReferences(Record &R) { |
| 279 | bool Changed = false; |
| 280 | BitsInit *New = new BitsInit(getNumBits()); |
| 281 | |
| 282 | for (unsigned i = 0, e = Bits.size(); i != e; ++i) { |
| 283 | Init *B; |
| 284 | Init *CurBit = getBit(i); |
| 285 | |
| 286 | do { |
| 287 | B = CurBit; |
| 288 | CurBit = CurBit->resolveReferences(R); |
| 289 | Changed |= B != CurBit; |
| 290 | } while (B != CurBit); |
| 291 | New->setBit(i, CurBit); |
| 292 | } |
| 293 | |
| 294 | if (Changed) |
| 295 | return New; |
| 296 | delete New; |
| 297 | return this; |
| 298 | } |
| 299 | |
| 300 | Init *IntInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) { |
| 301 | BitsInit *BI = new BitsInit(Bits.size()); |
| 302 | |
| 303 | for (unsigned i = 0, e = Bits.size(); i != e; ++i) { |
| 304 | if (Bits[i] >= 32) { |
| 305 | delete BI; |
| 306 | return 0; |
| 307 | } |
| 308 | BI->setBit(i, new BitInit(Value & (1 << Bits[i]))); |
| 309 | } |
| 310 | return BI; |
| 311 | } |
| 312 | |
| 313 | void ListInit::print(std::ostream &OS) const { |
| 314 | OS << "["; |
| 315 | for (unsigned i = 0, e = Values.size(); i != e; ++i) { |
| 316 | if (i) OS << ", "; |
| 317 | OS << *Values[i]; |
| 318 | } |
| 319 | OS << "]"; |
| 320 | } |
| 321 | |
| 322 | Init *VarInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) { |
| 323 | BitsRecTy *T = dynamic_cast<BitsRecTy*>(getType()); |
| 324 | if (T == 0) return 0; // Cannot subscript a non-bits variable... |
| 325 | unsigned NumBits = T->getNumBits(); |
| 326 | |
| 327 | BitsInit *BI = new BitsInit(Bits.size()); |
| 328 | for (unsigned i = 0, e = Bits.size(); i != e; ++i) { |
| 329 | if (Bits[i] >= NumBits) { |
| 330 | delete BI; |
| 331 | return 0; |
| 332 | } |
| 333 | BI->setBit(i, new VarBitInit(this, Bits[i])); |
| 334 | } |
| 335 | return BI; |
| 336 | } |
| 337 | |
| 338 | Init *VarInit::resolveBitReference(Record &R, unsigned Bit) { |
| 339 | if (R.isTemplateArg(getName())) |
| 340 | return this; |
| 341 | |
| 342 | RecordVal *RV = R.getValue(getName()); |
| 343 | assert(RV && "Reference to a non-existant variable?"); |
| 344 | assert(dynamic_cast<BitsInit*>(RV->getValue())); |
| 345 | BitsInit *BI = (BitsInit*)RV->getValue(); |
| 346 | |
| 347 | assert(Bit < BI->getNumBits() && "Bit reference out of range!"); |
| 348 | Init *B = BI->getBit(Bit); |
| 349 | |
| 350 | if (!dynamic_cast<UnsetInit*>(B)) // If the bit is not set... |
| 351 | return B; // Replace the VarBitInit with it. |
| 352 | return this; |
| 353 | } |
| 354 | |
| 355 | RecTy *VarInit::getFieldType(const std::string &FieldName) const { |
| 356 | if (RecordRecTy *RTy = dynamic_cast<RecordRecTy*>(getType())) |
| 357 | if (const RecordVal *RV = RTy->getRecord()->getValue(FieldName)) |
| 358 | return RV->getType(); |
| 359 | return 0; |
| 360 | } |
| 361 | |
| 362 | Init *VarInit::getFieldInit(Record &R, const std::string &FieldName) const { |
| 363 | if (RecordRecTy *RTy = dynamic_cast<RecordRecTy*>(getType())) |
| 364 | if (const RecordVal *RV = R.getValue(VarName)) |
| 365 | if (Init *I = RV->getValue()->getFieldInit(R, FieldName)) |
| 366 | return I; |
| 367 | else |
| 368 | return 0; |
| 369 | return 0; |
| 370 | } |
| 371 | |
| 372 | /// resolveReferences - This method is used by classes that refer to other |
| 373 | /// variables which may not be defined at the time they expression is formed. |
| 374 | /// If a value is set for the variable later, this method will be called on |
| 375 | /// users of the value to allow the value to propagate out. |
| 376 | /// |
| 377 | Init *VarInit::resolveReferences(Record &R) { |
| 378 | if (RecordVal *Val = R.getValue(VarName)) |
| 379 | if (!dynamic_cast<UnsetInit*>(Val->getValue())) |
| 380 | return Val->getValue(); |
| 381 | return this; |
| 382 | } |
| 383 | |
| 384 | |
| 385 | Init *VarBitInit::resolveReferences(Record &R) { |
| 386 | Init *I = getVariable()->resolveBitReference(R, getBitNum()); |
| 387 | if (I != getVariable()) |
| 388 | return I; |
| 389 | return this; |
| 390 | } |
| 391 | |
| 392 | RecTy *DefInit::getFieldType(const std::string &FieldName) const { |
| 393 | if (const RecordVal *RV = Def->getValue(FieldName)) |
| 394 | return RV->getType(); |
| 395 | return 0; |
| 396 | } |
| 397 | |
| 398 | Init *DefInit::getFieldInit(Record &R, const std::string &FieldName) const { |
| 399 | return Def->getValue(FieldName)->getValue(); |
| 400 | } |
| 401 | |
| 402 | |
| 403 | void DefInit::print(std::ostream &OS) const { |
| 404 | OS << Def->getName(); |
| 405 | } |
| 406 | |
| 407 | Init *FieldInit::convertInitializerBitRange(const std::vector<unsigned> &Bits) { |
| 408 | BitsRecTy *T = dynamic_cast<BitsRecTy*>(getType()); |
| 409 | if (T == 0) return 0; // Cannot subscript a non-bits field... |
| 410 | unsigned NumBits = T->getNumBits(); |
| 411 | |
| 412 | BitsInit *BI = new BitsInit(Bits.size()); |
| 413 | for (unsigned i = 0, e = Bits.size(); i != e; ++i) { |
| 414 | if (Bits[i] >= NumBits) { |
| 415 | delete BI; |
| 416 | return 0; |
| 417 | } |
| 418 | BI->setBit(i, new VarBitInit(this, Bits[i])); |
| 419 | } |
| 420 | return BI; |
| 421 | } |
| 422 | |
| 423 | Init *FieldInit::resolveBitReference(Record &R, unsigned Bit) { |
| 424 | Init *BitsVal = Rec->getFieldInit(R, FieldName); |
| 425 | if (BitsVal) |
| 426 | if (BitsInit *BI = dynamic_cast<BitsInit*>(BitsVal)) { |
| 427 | assert(Bit < BI->getNumBits() && "Bit reference out of range!"); |
| 428 | Init *B = BI->getBit(Bit); |
| 429 | |
| 430 | if (dynamic_cast<BitInit*>(B)) // If the bit is set... |
| 431 | return B; // Replace the VarBitInit with it. |
| 432 | } |
| 433 | return this; |
| 434 | } |
| 435 | |
| 436 | Init *FieldInit::resolveReferences(Record &R) { |
| 437 | Init *BitsVal = Rec->getFieldInit(R, FieldName); |
| 438 | if (BitsVal) { |
| 439 | Init *BVR = BitsVal->resolveReferences(R); |
| 440 | return BVR->isComplete() ? BVR : this; |
| 441 | } |
| 442 | return this; |
| 443 | } |
| 444 | |
| 445 | |
| 446 | void DagInit::print(std::ostream &OS) const { |
| 447 | OS << "(" << NodeTypeDef->getName(); |
| 448 | if (Args.size()) { |
| 449 | OS << " " << *Args[0]; |
| 450 | if (!ArgNames[0].empty()) OS << ":$" << ArgNames[0]; |
| 451 | for (unsigned i = 1, e = Args.size(); i != e; ++i) { |
| 452 | OS << ", " << *Args[i]; |
| 453 | if (!ArgNames[i].empty()) OS << ":$" << ArgNames[i]; |
| 454 | } |
| 455 | } |
| 456 | OS << ")"; |
| 457 | } |
| 458 | |
| 459 | |
| 460 | //===----------------------------------------------------------------------===// |
| 461 | // Other implementations |
| 462 | //===----------------------------------------------------------------------===// |
| 463 | |
| 464 | RecordVal::RecordVal(const std::string &N, RecTy *T, unsigned P) |
| 465 | : Name(N), Ty(T), Prefix(P) { |
| 466 | Value = Ty->convertValue(new UnsetInit()); |
| 467 | assert(Value && "Cannot create unset value for current type!"); |
| 468 | } |
| 469 | |
| 470 | void RecordVal::dump() const { std::cerr << *this; } |
| 471 | |
| 472 | void RecordVal::print(std::ostream &OS, bool PrintSem) const { |
| 473 | if (getPrefix()) OS << "field "; |
| 474 | OS << *getType() << " " << getName(); |
| 475 | if (getValue()) { |
| 476 | OS << " = " << *getValue(); |
| 477 | } |
| 478 | if (PrintSem) OS << ";\n"; |
| 479 | } |
| 480 | |
| 481 | // resolveReferences - If there are any field references that refer to fields |
| 482 | // that have been filled in, we can propagate the values now. |
| 483 | // |
| 484 | void Record::resolveReferences() { |
| 485 | for (unsigned i = 0, e = Values.size(); i != e; ++i) |
| 486 | Values[i].setValue(Values[i].getValue()->resolveReferences(*this)); |
| 487 | } |
| 488 | |
| 489 | void Record::dump() const { std::cerr << *this; } |
| 490 | |
| 491 | std::ostream &operator<<(std::ostream &OS, const Record &R) { |
| 492 | OS << R.getName(); |
| 493 | |
| 494 | const std::vector<std::string> &TArgs = R.getTemplateArgs(); |
| 495 | if (!TArgs.empty()) { |
| 496 | OS << "<"; |
| 497 | for (unsigned i = 0, e = TArgs.size(); i != e; ++i) { |
| 498 | if (i) OS << ", "; |
| 499 | const RecordVal *RV = R.getValue(TArgs[i]); |
| 500 | assert(RV && "Template argument record not found??"); |
| 501 | RV->print(OS, false); |
| 502 | } |
| 503 | OS << ">"; |
| 504 | } |
| 505 | |
| 506 | OS << " {"; |
| 507 | const std::vector<Record*> &SC = R.getSuperClasses(); |
| 508 | if (!SC.empty()) { |
| 509 | OS << "\t//"; |
| 510 | for (unsigned i = 0, e = SC.size(); i != e; ++i) |
| 511 | OS << " " << SC[i]->getName(); |
| 512 | } |
| 513 | OS << "\n"; |
| 514 | |
| 515 | const std::vector<RecordVal> &Vals = R.getValues(); |
| 516 | for (unsigned i = 0, e = Vals.size(); i != e; ++i) |
| 517 | if (Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName())) |
| 518 | OS << Vals[i]; |
| 519 | for (unsigned i = 0, e = Vals.size(); i != e; ++i) |
| 520 | if (!Vals[i].getPrefix() && !R.isTemplateArg(Vals[i].getName())) |
| 521 | OS << Vals[i]; |
| 522 | |
| 523 | return OS << "}\n"; |
| 524 | } |
| 525 | |
| 526 | /// getValueInit - Return the initializer for a value with the specified name, |
| 527 | /// or throw an exception if the field does not exist. |
| 528 | /// |
| 529 | Init *Record::getValueInit(const std::string &FieldName) const { |
| 530 | const RecordVal *R = getValue(FieldName); |
| 531 | if (R == 0 || R->getValue() == 0) |
| 532 | throw "Record '" + getName() + "' does not have a field named '" + |
| 533 | FieldName + "!\n"; |
| 534 | return R->getValue(); |
| 535 | } |
| 536 | |
| 537 | |
| 538 | /// getValueAsString - This method looks up the specified field and returns its |
| 539 | /// value as a string, throwing an exception if the field does not exist or if |
| 540 | /// the value is not a string. |
| 541 | /// |
| 542 | std::string Record::getValueAsString(const std::string &FieldName) const { |
| 543 | const RecordVal *R = getValue(FieldName); |
| 544 | if (R == 0 || R->getValue() == 0) |
| 545 | throw "Record '" + getName() + "' does not have a field named '" + |
| 546 | FieldName + "!\n"; |
| 547 | |
| 548 | if (const StringInit *SI = dynamic_cast<const StringInit*>(R->getValue())) |
| 549 | return SI->getValue(); |
| 550 | throw "Record '" + getName() + "', field '" + FieldName + |
| 551 | "' does not have a string initializer!"; |
| 552 | } |
| 553 | |
| 554 | /// getValueAsBitsInit - This method looks up the specified field and returns |
| 555 | /// its value as a BitsInit, throwing an exception if the field does not exist |
| 556 | /// or if the value is not the right type. |
| 557 | /// |
| 558 | BitsInit *Record::getValueAsBitsInit(const std::string &FieldName) const { |
| 559 | const RecordVal *R = getValue(FieldName); |
| 560 | if (R == 0 || R->getValue() == 0) |
| 561 | throw "Record '" + getName() + "' does not have a field named '" + |
| 562 | FieldName + "!\n"; |
| 563 | |
| 564 | if (BitsInit *BI = dynamic_cast<BitsInit*>(R->getValue())) |
| 565 | return BI; |
| 566 | throw "Record '" + getName() + "', field '" + FieldName + |
| 567 | "' does not have a BitsInit initializer!"; |
| 568 | } |
| 569 | |
| 570 | /// getValueAsListInit - This method looks up the specified field and returns |
| 571 | /// its value as a ListInit, throwing an exception if the field does not exist |
| 572 | /// or if the value is not the right type. |
| 573 | /// |
| 574 | ListInit *Record::getValueAsListInit(const std::string &FieldName) const { |
| 575 | const RecordVal *R = getValue(FieldName); |
| 576 | if (R == 0 || R->getValue() == 0) |
| 577 | throw "Record '" + getName() + "' does not have a field named '" + |
| 578 | FieldName + "!\n"; |
| 579 | |
| 580 | if (ListInit *LI = dynamic_cast<ListInit*>(R->getValue())) |
| 581 | return LI; |
| 582 | throw "Record '" + getName() + "', field '" + FieldName + |
| 583 | "' does not have a list initializer!"; |
| 584 | } |
| 585 | |
| 586 | /// getValueAsInt - This method looks up the specified field and returns its |
| 587 | /// value as an int, throwing an exception if the field does not exist or if |
| 588 | /// the value is not the right type. |
| 589 | /// |
| 590 | int Record::getValueAsInt(const std::string &FieldName) const { |
| 591 | const RecordVal *R = getValue(FieldName); |
| 592 | if (R == 0 || R->getValue() == 0) |
| 593 | throw "Record '" + getName() + "' does not have a field named '" + |
| 594 | FieldName + "!\n"; |
| 595 | |
| 596 | if (IntInit *II = dynamic_cast<IntInit*>(R->getValue())) |
| 597 | return II->getValue(); |
| 598 | throw "Record '" + getName() + "', field '" + FieldName + |
| 599 | "' does not have a list initializer!"; |
| 600 | } |
| 601 | |
| 602 | /// getValueAsDef - This method looks up the specified field and returns its |
| 603 | /// value as a Record, throwing an exception if the field does not exist or if |
| 604 | /// the value is not the right type. |
| 605 | /// |
| 606 | Record *Record::getValueAsDef(const std::string &FieldName) const { |
| 607 | const RecordVal *R = getValue(FieldName); |
| 608 | if (R == 0 || R->getValue() == 0) |
| 609 | throw "Record '" + getName() + "' does not have a field named '" + |
| 610 | FieldName + "!\n"; |
| 611 | |
| 612 | if (DefInit *DI = dynamic_cast<DefInit*>(R->getValue())) |
| 613 | return DI->getDef(); |
| 614 | throw "Record '" + getName() + "', field '" + FieldName + |
| 615 | "' does not have a list initializer!"; |
| 616 | } |
| 617 | |
| 618 | /// getValueAsBit - This method looks up the specified field and returns its |
| 619 | /// value as a bit, throwing an exception if the field does not exist or if |
| 620 | /// the value is not the right type. |
| 621 | /// |
| 622 | bool Record::getValueAsBit(const std::string &FieldName) const { |
| 623 | const RecordVal *R = getValue(FieldName); |
| 624 | if (R == 0 || R->getValue() == 0) |
| 625 | throw "Record '" + getName() + "' does not have a field named '" + |
| 626 | FieldName + "!\n"; |
| 627 | |
| 628 | if (BitInit *BI = dynamic_cast<BitInit*>(R->getValue())) |
| 629 | return BI->getValue(); |
| 630 | throw "Record '" + getName() + "', field '" + FieldName + |
| 631 | "' does not have a bit initializer!"; |
| 632 | } |
| 633 | |
| 634 | /// getValueAsDag - This method looks up the specified field and returns its |
| 635 | /// value as an Dag, throwing an exception if the field does not exist or if |
| 636 | /// the value is not the right type. |
| 637 | /// |
| 638 | DagInit *Record::getValueAsDag(const std::string &FieldName) const { |
| 639 | const RecordVal *R = getValue(FieldName); |
| 640 | if (R == 0 || R->getValue() == 0) |
| 641 | throw "Record '" + getName() + "' does not have a field named '" + |
| 642 | FieldName + "!\n"; |
| 643 | |
| 644 | if (DagInit *DI = dynamic_cast<DagInit*>(R->getValue())) |
| 645 | return DI; |
| 646 | throw "Record '" + getName() + "', field '" + FieldName + |
| 647 | "' does not have a dag initializer!"; |
| 648 | } |
| 649 | |
| 650 | |
| 651 | void RecordKeeper::dump() const { std::cerr << *this; } |
| 652 | |
| 653 | std::ostream &operator<<(std::ostream &OS, const RecordKeeper &RK) { |
| 654 | OS << "------------- Classes -----------------\n"; |
| 655 | const std::map<std::string, Record*> &Classes = RK.getClasses(); |
| 656 | for (std::map<std::string, Record*>::const_iterator I = Classes.begin(), |
| 657 | E = Classes.end(); I != E; ++I) |
| 658 | OS << "class " << *I->second; |
| 659 | |
| 660 | OS << "------------- Defs -----------------\n"; |
| 661 | const std::map<std::string, Record*> &Defs = RK.getDefs(); |
| 662 | for (std::map<std::string, Record*>::const_iterator I = Defs.begin(), |
| 663 | E = Defs.end(); I != E; ++I) |
| 664 | OS << "def " << *I->second; |
| 665 | return OS; |
| 666 | } |
| 667 | |
| 668 | |
| 669 | /// getAllDerivedDefinitions - This method returns all concrete definitions |
| 670 | /// that derive from the specified class name. If a class with the specified |
| 671 | /// name does not exist, an error is printed and true is returned. |
| 672 | std::vector<Record*> |
| 673 | RecordKeeper::getAllDerivedDefinitions(const std::string &ClassName) const { |
| 674 | Record *Class = Records.getClass(ClassName); |
| 675 | if (!Class) |
| 676 | throw "ERROR: Couldn't find the '" + ClassName + "' class!\n"; |
| 677 | |
| 678 | std::vector<Record*> Defs; |
| 679 | for (std::map<std::string, Record*>::const_iterator I = getDefs().begin(), |
| 680 | E = getDefs().end(); I != E; ++I) |
| 681 | if (I->second->isSubClassOf(Class)) |
| 682 | Defs.push_back(I->second); |
| 683 | |
| 684 | return Defs; |
| 685 | } |
Brian Gaeke | 960707c | 2003-11-11 22:41:34 +0000 | [diff] [blame^] | 686 | |
| 687 | } // End llvm namespace |