BitcodeReader.cpp revision a6245247e9d0c718fb14230ba6610ee939b030fa
1//===- BitcodeReader.cpp - Internal BitcodeReader implementation ----------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This header defines the BitcodeReader class. 11// 12//===----------------------------------------------------------------------===// 13 14#include "llvm/Bitcode/ReaderWriter.h" 15#include "BitcodeReader.h" 16#include "llvm/Constants.h" 17#include "llvm/DerivedTypes.h" 18#include "llvm/InlineAsm.h" 19#include "llvm/IntrinsicInst.h" 20#include "llvm/Module.h" 21#include "llvm/Operator.h" 22#include "llvm/AutoUpgrade.h" 23#include "llvm/ADT/SmallString.h" 24#include "llvm/ADT/SmallVector.h" 25#include "llvm/Support/MathExtras.h" 26#include "llvm/Support/MemoryBuffer.h" 27#include "llvm/OperandTraits.h" 28using namespace llvm; 29 30void BitcodeReader::FreeState() { 31 if (BufferOwned) 32 delete Buffer; 33 Buffer = 0; 34 std::vector<PATypeHolder>().swap(TypeList); 35 ValueList.clear(); 36 MDValueList.clear(); 37 38 std::vector<AttrListPtr>().swap(MAttributes); 39 std::vector<BasicBlock*>().swap(FunctionBBs); 40 std::vector<Function*>().swap(FunctionsWithBodies); 41 DeferredFunctionInfo.clear(); 42} 43 44//===----------------------------------------------------------------------===// 45// Helper functions to implement forward reference resolution, etc. 46//===----------------------------------------------------------------------===// 47 48/// ConvertToString - Convert a string from a record into an std::string, return 49/// true on failure. 50template<typename StrTy> 51static bool ConvertToString(SmallVector<uint64_t, 64> &Record, unsigned Idx, 52 StrTy &Result) { 53 if (Idx > Record.size()) 54 return true; 55 56 for (unsigned i = Idx, e = Record.size(); i != e; ++i) 57 Result += (char)Record[i]; 58 return false; 59} 60 61static GlobalValue::LinkageTypes GetDecodedLinkage(unsigned Val) { 62 switch (Val) { 63 default: // Map unknown/new linkages to external 64 case 0: return GlobalValue::ExternalLinkage; 65 case 1: return GlobalValue::WeakAnyLinkage; 66 case 2: return GlobalValue::AppendingLinkage; 67 case 3: return GlobalValue::InternalLinkage; 68 case 4: return GlobalValue::LinkOnceAnyLinkage; 69 case 5: return GlobalValue::DLLImportLinkage; 70 case 6: return GlobalValue::DLLExportLinkage; 71 case 7: return GlobalValue::ExternalWeakLinkage; 72 case 8: return GlobalValue::CommonLinkage; 73 case 9: return GlobalValue::PrivateLinkage; 74 case 10: return GlobalValue::WeakODRLinkage; 75 case 11: return GlobalValue::LinkOnceODRLinkage; 76 case 12: return GlobalValue::AvailableExternallyLinkage; 77 case 13: return GlobalValue::LinkerPrivateLinkage; 78 } 79} 80 81static GlobalValue::VisibilityTypes GetDecodedVisibility(unsigned Val) { 82 switch (Val) { 83 default: // Map unknown visibilities to default. 84 case 0: return GlobalValue::DefaultVisibility; 85 case 1: return GlobalValue::HiddenVisibility; 86 case 2: return GlobalValue::ProtectedVisibility; 87 } 88} 89 90static int GetDecodedCastOpcode(unsigned Val) { 91 switch (Val) { 92 default: return -1; 93 case bitc::CAST_TRUNC : return Instruction::Trunc; 94 case bitc::CAST_ZEXT : return Instruction::ZExt; 95 case bitc::CAST_SEXT : return Instruction::SExt; 96 case bitc::CAST_FPTOUI : return Instruction::FPToUI; 97 case bitc::CAST_FPTOSI : return Instruction::FPToSI; 98 case bitc::CAST_UITOFP : return Instruction::UIToFP; 99 case bitc::CAST_SITOFP : return Instruction::SIToFP; 100 case bitc::CAST_FPTRUNC : return Instruction::FPTrunc; 101 case bitc::CAST_FPEXT : return Instruction::FPExt; 102 case bitc::CAST_PTRTOINT: return Instruction::PtrToInt; 103 case bitc::CAST_INTTOPTR: return Instruction::IntToPtr; 104 case bitc::CAST_BITCAST : return Instruction::BitCast; 105 } 106} 107static int GetDecodedBinaryOpcode(unsigned Val, const Type *Ty) { 108 switch (Val) { 109 default: return -1; 110 case bitc::BINOP_ADD: 111 return Ty->isFPOrFPVectorTy() ? Instruction::FAdd : Instruction::Add; 112 case bitc::BINOP_SUB: 113 return Ty->isFPOrFPVectorTy() ? Instruction::FSub : Instruction::Sub; 114 case bitc::BINOP_MUL: 115 return Ty->isFPOrFPVectorTy() ? Instruction::FMul : Instruction::Mul; 116 case bitc::BINOP_UDIV: return Instruction::UDiv; 117 case bitc::BINOP_SDIV: 118 return Ty->isFPOrFPVectorTy() ? Instruction::FDiv : Instruction::SDiv; 119 case bitc::BINOP_UREM: return Instruction::URem; 120 case bitc::BINOP_SREM: 121 return Ty->isFPOrFPVectorTy() ? Instruction::FRem : Instruction::SRem; 122 case bitc::BINOP_SHL: return Instruction::Shl; 123 case bitc::BINOP_LSHR: return Instruction::LShr; 124 case bitc::BINOP_ASHR: return Instruction::AShr; 125 case bitc::BINOP_AND: return Instruction::And; 126 case bitc::BINOP_OR: return Instruction::Or; 127 case bitc::BINOP_XOR: return Instruction::Xor; 128 } 129} 130 131namespace llvm { 132namespace { 133 /// @brief A class for maintaining the slot number definition 134 /// as a placeholder for the actual definition for forward constants defs. 135 class ConstantPlaceHolder : public ConstantExpr { 136 ConstantPlaceHolder(); // DO NOT IMPLEMENT 137 void operator=(const ConstantPlaceHolder &); // DO NOT IMPLEMENT 138 public: 139 // allocate space for exactly one operand 140 void *operator new(size_t s) { 141 return User::operator new(s, 1); 142 } 143 explicit ConstantPlaceHolder(const Type *Ty, LLVMContext& Context) 144 : ConstantExpr(Ty, Instruction::UserOp1, &Op<0>(), 1) { 145 Op<0>() = UndefValue::get(Type::getInt32Ty(Context)); 146 } 147 148 /// @brief Methods to support type inquiry through isa, cast, and dyn_cast. 149 static inline bool classof(const ConstantPlaceHolder *) { return true; } 150 static bool classof(const Value *V) { 151 return isa<ConstantExpr>(V) && 152 cast<ConstantExpr>(V)->getOpcode() == Instruction::UserOp1; 153 } 154 155 156 /// Provide fast operand accessors 157 //DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value); 158 }; 159} 160 161// FIXME: can we inherit this from ConstantExpr? 162template <> 163struct OperandTraits<ConstantPlaceHolder> : public FixedNumOperandTraits<1> { 164}; 165} 166 167 168void BitcodeReaderValueList::AssignValue(Value *V, unsigned Idx) { 169 if (Idx == size()) { 170 push_back(V); 171 return; 172 } 173 174 if (Idx >= size()) 175 resize(Idx+1); 176 177 WeakVH &OldV = ValuePtrs[Idx]; 178 if (OldV == 0) { 179 OldV = V; 180 return; 181 } 182 183 // Handle constants and non-constants (e.g. instrs) differently for 184 // efficiency. 185 if (Constant *PHC = dyn_cast<Constant>(&*OldV)) { 186 ResolveConstants.push_back(std::make_pair(PHC, Idx)); 187 OldV = V; 188 } else { 189 // If there was a forward reference to this value, replace it. 190 Value *PrevVal = OldV; 191 OldV->replaceAllUsesWith(V); 192 delete PrevVal; 193 } 194} 195 196 197Constant *BitcodeReaderValueList::getConstantFwdRef(unsigned Idx, 198 const Type *Ty) { 199 if (Idx >= size()) 200 resize(Idx + 1); 201 202 if (Value *V = ValuePtrs[Idx]) { 203 assert(Ty == V->getType() && "Type mismatch in constant table!"); 204 return cast<Constant>(V); 205 } 206 207 // Create and return a placeholder, which will later be RAUW'd. 208 Constant *C = new ConstantPlaceHolder(Ty, Context); 209 ValuePtrs[Idx] = C; 210 return C; 211} 212 213Value *BitcodeReaderValueList::getValueFwdRef(unsigned Idx, const Type *Ty) { 214 if (Idx >= size()) 215 resize(Idx + 1); 216 217 if (Value *V = ValuePtrs[Idx]) { 218 assert((Ty == 0 || Ty == V->getType()) && "Type mismatch in value table!"); 219 return V; 220 } 221 222 // No type specified, must be invalid reference. 223 if (Ty == 0) return 0; 224 225 // Create and return a placeholder, which will later be RAUW'd. 226 Value *V = new Argument(Ty); 227 ValuePtrs[Idx] = V; 228 return V; 229} 230 231/// ResolveConstantForwardRefs - Once all constants are read, this method bulk 232/// resolves any forward references. The idea behind this is that we sometimes 233/// get constants (such as large arrays) which reference *many* forward ref 234/// constants. Replacing each of these causes a lot of thrashing when 235/// building/reuniquing the constant. Instead of doing this, we look at all the 236/// uses and rewrite all the place holders at once for any constant that uses 237/// a placeholder. 238void BitcodeReaderValueList::ResolveConstantForwardRefs() { 239 // Sort the values by-pointer so that they are efficient to look up with a 240 // binary search. 241 std::sort(ResolveConstants.begin(), ResolveConstants.end()); 242 243 SmallVector<Constant*, 64> NewOps; 244 245 while (!ResolveConstants.empty()) { 246 Value *RealVal = operator[](ResolveConstants.back().second); 247 Constant *Placeholder = ResolveConstants.back().first; 248 ResolveConstants.pop_back(); 249 250 // Loop over all users of the placeholder, updating them to reference the 251 // new value. If they reference more than one placeholder, update them all 252 // at once. 253 while (!Placeholder->use_empty()) { 254 Value::use_iterator UI = Placeholder->use_begin(); 255 256 // If the using object isn't uniqued, just update the operands. This 257 // handles instructions and initializers for global variables. 258 if (!isa<Constant>(*UI) || isa<GlobalValue>(*UI)) { 259 UI.getUse().set(RealVal); 260 continue; 261 } 262 263 // Otherwise, we have a constant that uses the placeholder. Replace that 264 // constant with a new constant that has *all* placeholder uses updated. 265 Constant *UserC = cast<Constant>(*UI); 266 for (User::op_iterator I = UserC->op_begin(), E = UserC->op_end(); 267 I != E; ++I) { 268 Value *NewOp; 269 if (!isa<ConstantPlaceHolder>(*I)) { 270 // Not a placeholder reference. 271 NewOp = *I; 272 } else if (*I == Placeholder) { 273 // Common case is that it just references this one placeholder. 274 NewOp = RealVal; 275 } else { 276 // Otherwise, look up the placeholder in ResolveConstants. 277 ResolveConstantsTy::iterator It = 278 std::lower_bound(ResolveConstants.begin(), ResolveConstants.end(), 279 std::pair<Constant*, unsigned>(cast<Constant>(*I), 280 0)); 281 assert(It != ResolveConstants.end() && It->first == *I); 282 NewOp = operator[](It->second); 283 } 284 285 NewOps.push_back(cast<Constant>(NewOp)); 286 } 287 288 // Make the new constant. 289 Constant *NewC; 290 if (ConstantArray *UserCA = dyn_cast<ConstantArray>(UserC)) { 291 NewC = ConstantArray::get(UserCA->getType(), &NewOps[0], 292 NewOps.size()); 293 } else if (ConstantStruct *UserCS = dyn_cast<ConstantStruct>(UserC)) { 294 NewC = ConstantStruct::get(Context, &NewOps[0], NewOps.size(), 295 UserCS->getType()->isPacked()); 296 } else if (ConstantUnion *UserCU = dyn_cast<ConstantUnion>(UserC)) { 297 NewC = ConstantUnion::get(UserCU->getType(), NewOps[0]); 298 } else if (isa<ConstantVector>(UserC)) { 299 NewC = ConstantVector::get(&NewOps[0], NewOps.size()); 300 } else { 301 assert(isa<ConstantExpr>(UserC) && "Must be a ConstantExpr."); 302 NewC = cast<ConstantExpr>(UserC)->getWithOperands(&NewOps[0], 303 NewOps.size()); 304 } 305 306 UserC->replaceAllUsesWith(NewC); 307 UserC->destroyConstant(); 308 NewOps.clear(); 309 } 310 311 // Update all ValueHandles, they should be the only users at this point. 312 Placeholder->replaceAllUsesWith(RealVal); 313 delete Placeholder; 314 } 315} 316 317void BitcodeReaderMDValueList::AssignValue(Value *V, unsigned Idx) { 318 if (Idx == size()) { 319 push_back(V); 320 return; 321 } 322 323 if (Idx >= size()) 324 resize(Idx+1); 325 326 WeakVH &OldV = MDValuePtrs[Idx]; 327 if (OldV == 0) { 328 OldV = V; 329 return; 330 } 331 332 // If there was a forward reference to this value, replace it. 333 Value *PrevVal = OldV; 334 OldV->replaceAllUsesWith(V); 335 delete PrevVal; 336 // Deleting PrevVal sets Idx value in MDValuePtrs to null. Set new 337 // value for Idx. 338 MDValuePtrs[Idx] = V; 339} 340 341Value *BitcodeReaderMDValueList::getValueFwdRef(unsigned Idx) { 342 if (Idx >= size()) 343 resize(Idx + 1); 344 345 if (Value *V = MDValuePtrs[Idx]) { 346 assert(V->getType()->isMetadataTy() && "Type mismatch in value table!"); 347 return V; 348 } 349 350 // Create and return a placeholder, which will later be RAUW'd. 351 Value *V = new Argument(Type::getMetadataTy(Context)); 352 MDValuePtrs[Idx] = V; 353 return V; 354} 355 356const Type *BitcodeReader::getTypeByID(unsigned ID, bool isTypeTable) { 357 // If the TypeID is in range, return it. 358 if (ID < TypeList.size()) 359 return TypeList[ID].get(); 360 if (!isTypeTable) return 0; 361 362 // The type table allows forward references. Push as many Opaque types as 363 // needed to get up to ID. 364 while (TypeList.size() <= ID) 365 TypeList.push_back(OpaqueType::get(Context)); 366 return TypeList.back().get(); 367} 368 369//===----------------------------------------------------------------------===// 370// Functions for parsing blocks from the bitcode file 371//===----------------------------------------------------------------------===// 372 373bool BitcodeReader::ParseAttributeBlock() { 374 if (Stream.EnterSubBlock(bitc::PARAMATTR_BLOCK_ID)) 375 return Error("Malformed block record"); 376 377 if (!MAttributes.empty()) 378 return Error("Multiple PARAMATTR blocks found!"); 379 380 SmallVector<uint64_t, 64> Record; 381 382 SmallVector<AttributeWithIndex, 8> Attrs; 383 384 // Read all the records. 385 while (1) { 386 unsigned Code = Stream.ReadCode(); 387 if (Code == bitc::END_BLOCK) { 388 if (Stream.ReadBlockEnd()) 389 return Error("Error at end of PARAMATTR block"); 390 return false; 391 } 392 393 if (Code == bitc::ENTER_SUBBLOCK) { 394 // No known subblocks, always skip them. 395 Stream.ReadSubBlockID(); 396 if (Stream.SkipBlock()) 397 return Error("Malformed block record"); 398 continue; 399 } 400 401 if (Code == bitc::DEFINE_ABBREV) { 402 Stream.ReadAbbrevRecord(); 403 continue; 404 } 405 406 // Read a record. 407 Record.clear(); 408 switch (Stream.ReadRecord(Code, Record)) { 409 default: // Default behavior: ignore. 410 break; 411 case bitc::PARAMATTR_CODE_ENTRY: { // ENTRY: [paramidx0, attr0, ...] 412 if (Record.size() & 1) 413 return Error("Invalid ENTRY record"); 414 415 // FIXME : Remove this autoupgrade code in LLVM 3.0. 416 // If Function attributes are using index 0 then transfer them 417 // to index ~0. Index 0 is used for return value attributes but used to be 418 // used for function attributes. 419 Attributes RetAttribute = Attribute::None; 420 Attributes FnAttribute = Attribute::None; 421 for (unsigned i = 0, e = Record.size(); i != e; i += 2) { 422 // FIXME: remove in LLVM 3.0 423 // The alignment is stored as a 16-bit raw value from bits 31--16. 424 // We shift the bits above 31 down by 11 bits. 425 426 unsigned Alignment = (Record[i+1] & (0xffffull << 16)) >> 16; 427 if (Alignment && !isPowerOf2_32(Alignment)) 428 return Error("Alignment is not a power of two."); 429 430 Attributes ReconstitutedAttr = Record[i+1] & 0xffff; 431 if (Alignment) 432 ReconstitutedAttr |= Attribute::constructAlignmentFromInt(Alignment); 433 ReconstitutedAttr |= (Record[i+1] & (0xffffull << 32)) >> 11; 434 Record[i+1] = ReconstitutedAttr; 435 436 if (Record[i] == 0) 437 RetAttribute = Record[i+1]; 438 else if (Record[i] == ~0U) 439 FnAttribute = Record[i+1]; 440 } 441 442 unsigned OldRetAttrs = (Attribute::NoUnwind|Attribute::NoReturn| 443 Attribute::ReadOnly|Attribute::ReadNone); 444 445 if (FnAttribute == Attribute::None && RetAttribute != Attribute::None && 446 (RetAttribute & OldRetAttrs) != 0) { 447 if (FnAttribute == Attribute::None) { // add a slot so they get added. 448 Record.push_back(~0U); 449 Record.push_back(0); 450 } 451 452 FnAttribute |= RetAttribute & OldRetAttrs; 453 RetAttribute &= ~OldRetAttrs; 454 } 455 456 for (unsigned i = 0, e = Record.size(); i != e; i += 2) { 457 if (Record[i] == 0) { 458 if (RetAttribute != Attribute::None) 459 Attrs.push_back(AttributeWithIndex::get(0, RetAttribute)); 460 } else if (Record[i] == ~0U) { 461 if (FnAttribute != Attribute::None) 462 Attrs.push_back(AttributeWithIndex::get(~0U, FnAttribute)); 463 } else if (Record[i+1] != Attribute::None) 464 Attrs.push_back(AttributeWithIndex::get(Record[i], Record[i+1])); 465 } 466 467 MAttributes.push_back(AttrListPtr::get(Attrs.begin(), Attrs.end())); 468 Attrs.clear(); 469 break; 470 } 471 } 472 } 473} 474 475 476bool BitcodeReader::ParseTypeTable() { 477 if (Stream.EnterSubBlock(bitc::TYPE_BLOCK_ID)) 478 return Error("Malformed block record"); 479 480 if (!TypeList.empty()) 481 return Error("Multiple TYPE_BLOCKs found!"); 482 483 SmallVector<uint64_t, 64> Record; 484 unsigned NumRecords = 0; 485 486 // Read all the records for this type table. 487 while (1) { 488 unsigned Code = Stream.ReadCode(); 489 if (Code == bitc::END_BLOCK) { 490 if (NumRecords != TypeList.size()) 491 return Error("Invalid type forward reference in TYPE_BLOCK"); 492 if (Stream.ReadBlockEnd()) 493 return Error("Error at end of type table block"); 494 return false; 495 } 496 497 if (Code == bitc::ENTER_SUBBLOCK) { 498 // No known subblocks, always skip them. 499 Stream.ReadSubBlockID(); 500 if (Stream.SkipBlock()) 501 return Error("Malformed block record"); 502 continue; 503 } 504 505 if (Code == bitc::DEFINE_ABBREV) { 506 Stream.ReadAbbrevRecord(); 507 continue; 508 } 509 510 // Read a record. 511 Record.clear(); 512 const Type *ResultTy = 0; 513 switch (Stream.ReadRecord(Code, Record)) { 514 default: // Default behavior: unknown type. 515 ResultTy = 0; 516 break; 517 case bitc::TYPE_CODE_NUMENTRY: // TYPE_CODE_NUMENTRY: [numentries] 518 // TYPE_CODE_NUMENTRY contains a count of the number of types in the 519 // type list. This allows us to reserve space. 520 if (Record.size() < 1) 521 return Error("Invalid TYPE_CODE_NUMENTRY record"); 522 TypeList.reserve(Record[0]); 523 continue; 524 case bitc::TYPE_CODE_VOID: // VOID 525 ResultTy = Type::getVoidTy(Context); 526 break; 527 case bitc::TYPE_CODE_FLOAT: // FLOAT 528 ResultTy = Type::getFloatTy(Context); 529 break; 530 case bitc::TYPE_CODE_DOUBLE: // DOUBLE 531 ResultTy = Type::getDoubleTy(Context); 532 break; 533 case bitc::TYPE_CODE_X86_FP80: // X86_FP80 534 ResultTy = Type::getX86_FP80Ty(Context); 535 break; 536 case bitc::TYPE_CODE_FP128: // FP128 537 ResultTy = Type::getFP128Ty(Context); 538 break; 539 case bitc::TYPE_CODE_PPC_FP128: // PPC_FP128 540 ResultTy = Type::getPPC_FP128Ty(Context); 541 break; 542 case bitc::TYPE_CODE_LABEL: // LABEL 543 ResultTy = Type::getLabelTy(Context); 544 break; 545 case bitc::TYPE_CODE_OPAQUE: // OPAQUE 546 ResultTy = 0; 547 break; 548 case bitc::TYPE_CODE_METADATA: // METADATA 549 ResultTy = Type::getMetadataTy(Context); 550 break; 551 case bitc::TYPE_CODE_INTEGER: // INTEGER: [width] 552 if (Record.size() < 1) 553 return Error("Invalid Integer type record"); 554 555 ResultTy = IntegerType::get(Context, Record[0]); 556 break; 557 case bitc::TYPE_CODE_POINTER: { // POINTER: [pointee type] or 558 // [pointee type, address space] 559 if (Record.size() < 1) 560 return Error("Invalid POINTER type record"); 561 unsigned AddressSpace = 0; 562 if (Record.size() == 2) 563 AddressSpace = Record[1]; 564 ResultTy = PointerType::get(getTypeByID(Record[0], true), 565 AddressSpace); 566 break; 567 } 568 case bitc::TYPE_CODE_FUNCTION: { 569 // FIXME: attrid is dead, remove it in LLVM 3.0 570 // FUNCTION: [vararg, attrid, retty, paramty x N] 571 if (Record.size() < 3) 572 return Error("Invalid FUNCTION type record"); 573 std::vector<const Type*> ArgTys; 574 for (unsigned i = 3, e = Record.size(); i != e; ++i) 575 ArgTys.push_back(getTypeByID(Record[i], true)); 576 577 ResultTy = FunctionType::get(getTypeByID(Record[2], true), ArgTys, 578 Record[0]); 579 break; 580 } 581 case bitc::TYPE_CODE_STRUCT: { // STRUCT: [ispacked, eltty x N] 582 if (Record.size() < 1) 583 return Error("Invalid STRUCT type record"); 584 std::vector<const Type*> EltTys; 585 for (unsigned i = 1, e = Record.size(); i != e; ++i) 586 EltTys.push_back(getTypeByID(Record[i], true)); 587 ResultTy = StructType::get(Context, EltTys, Record[0]); 588 break; 589 } 590 case bitc::TYPE_CODE_UNION: { // UNION: [eltty x N] 591 SmallVector<const Type*, 8> EltTys; 592 for (unsigned i = 0, e = Record.size(); i != e; ++i) 593 EltTys.push_back(getTypeByID(Record[i], true)); 594 ResultTy = UnionType::get(&EltTys[0], EltTys.size()); 595 break; 596 } 597 case bitc::TYPE_CODE_ARRAY: // ARRAY: [numelts, eltty] 598 if (Record.size() < 2) 599 return Error("Invalid ARRAY type record"); 600 ResultTy = ArrayType::get(getTypeByID(Record[1], true), Record[0]); 601 break; 602 case bitc::TYPE_CODE_VECTOR: // VECTOR: [numelts, eltty] 603 if (Record.size() < 2) 604 return Error("Invalid VECTOR type record"); 605 ResultTy = VectorType::get(getTypeByID(Record[1], true), Record[0]); 606 break; 607 } 608 609 if (NumRecords == TypeList.size()) { 610 // If this is a new type slot, just append it. 611 TypeList.push_back(ResultTy ? ResultTy : OpaqueType::get(Context)); 612 ++NumRecords; 613 } else if (ResultTy == 0) { 614 // Otherwise, this was forward referenced, so an opaque type was created, 615 // but the result type is actually just an opaque. Leave the one we 616 // created previously. 617 ++NumRecords; 618 } else { 619 // Otherwise, this was forward referenced, so an opaque type was created. 620 // Resolve the opaque type to the real type now. 621 assert(NumRecords < TypeList.size() && "Typelist imbalance"); 622 const OpaqueType *OldTy = cast<OpaqueType>(TypeList[NumRecords++].get()); 623 624 // Don't directly push the new type on the Tab. Instead we want to replace 625 // the opaque type we previously inserted with the new concrete value. The 626 // refinement from the abstract (opaque) type to the new type causes all 627 // uses of the abstract type to use the concrete type (NewTy). This will 628 // also cause the opaque type to be deleted. 629 const_cast<OpaqueType*>(OldTy)->refineAbstractTypeTo(ResultTy); 630 631 // This should have replaced the old opaque type with the new type in the 632 // value table... or with a preexisting type that was already in the 633 // system. Let's just make sure it did. 634 assert(TypeList[NumRecords-1].get() != OldTy && 635 "refineAbstractType didn't work!"); 636 } 637 } 638} 639 640 641bool BitcodeReader::ParseTypeSymbolTable() { 642 if (Stream.EnterSubBlock(bitc::TYPE_SYMTAB_BLOCK_ID)) 643 return Error("Malformed block record"); 644 645 SmallVector<uint64_t, 64> Record; 646 647 // Read all the records for this type table. 648 std::string TypeName; 649 while (1) { 650 unsigned Code = Stream.ReadCode(); 651 if (Code == bitc::END_BLOCK) { 652 if (Stream.ReadBlockEnd()) 653 return Error("Error at end of type symbol table block"); 654 return false; 655 } 656 657 if (Code == bitc::ENTER_SUBBLOCK) { 658 // No known subblocks, always skip them. 659 Stream.ReadSubBlockID(); 660 if (Stream.SkipBlock()) 661 return Error("Malformed block record"); 662 continue; 663 } 664 665 if (Code == bitc::DEFINE_ABBREV) { 666 Stream.ReadAbbrevRecord(); 667 continue; 668 } 669 670 // Read a record. 671 Record.clear(); 672 switch (Stream.ReadRecord(Code, Record)) { 673 default: // Default behavior: unknown type. 674 break; 675 case bitc::TST_CODE_ENTRY: // TST_ENTRY: [typeid, namechar x N] 676 if (ConvertToString(Record, 1, TypeName)) 677 return Error("Invalid TST_ENTRY record"); 678 unsigned TypeID = Record[0]; 679 if (TypeID >= TypeList.size()) 680 return Error("Invalid Type ID in TST_ENTRY record"); 681 682 TheModule->addTypeName(TypeName, TypeList[TypeID].get()); 683 TypeName.clear(); 684 break; 685 } 686 } 687} 688 689bool BitcodeReader::ParseValueSymbolTable() { 690 if (Stream.EnterSubBlock(bitc::VALUE_SYMTAB_BLOCK_ID)) 691 return Error("Malformed block record"); 692 693 SmallVector<uint64_t, 64> Record; 694 695 // Read all the records for this value table. 696 SmallString<128> ValueName; 697 while (1) { 698 unsigned Code = Stream.ReadCode(); 699 if (Code == bitc::END_BLOCK) { 700 if (Stream.ReadBlockEnd()) 701 return Error("Error at end of value symbol table block"); 702 return false; 703 } 704 if (Code == bitc::ENTER_SUBBLOCK) { 705 // No known subblocks, always skip them. 706 Stream.ReadSubBlockID(); 707 if (Stream.SkipBlock()) 708 return Error("Malformed block record"); 709 continue; 710 } 711 712 if (Code == bitc::DEFINE_ABBREV) { 713 Stream.ReadAbbrevRecord(); 714 continue; 715 } 716 717 // Read a record. 718 Record.clear(); 719 switch (Stream.ReadRecord(Code, Record)) { 720 default: // Default behavior: unknown type. 721 break; 722 case bitc::VST_CODE_ENTRY: { // VST_ENTRY: [valueid, namechar x N] 723 if (ConvertToString(Record, 1, ValueName)) 724 return Error("Invalid VST_ENTRY record"); 725 unsigned ValueID = Record[0]; 726 if (ValueID >= ValueList.size()) 727 return Error("Invalid Value ID in VST_ENTRY record"); 728 Value *V = ValueList[ValueID]; 729 730 V->setName(StringRef(ValueName.data(), ValueName.size())); 731 ValueName.clear(); 732 break; 733 } 734 case bitc::VST_CODE_BBENTRY: { 735 if (ConvertToString(Record, 1, ValueName)) 736 return Error("Invalid VST_BBENTRY record"); 737 BasicBlock *BB = getBasicBlock(Record[0]); 738 if (BB == 0) 739 return Error("Invalid BB ID in VST_BBENTRY record"); 740 741 BB->setName(StringRef(ValueName.data(), ValueName.size())); 742 ValueName.clear(); 743 break; 744 } 745 } 746 } 747} 748 749bool BitcodeReader::ParseMetadata() { 750 unsigned NextMDValueNo = MDValueList.size(); 751 752 if (Stream.EnterSubBlock(bitc::METADATA_BLOCK_ID)) 753 return Error("Malformed block record"); 754 755 SmallVector<uint64_t, 64> Record; 756 757 // Read all the records. 758 while (1) { 759 unsigned Code = Stream.ReadCode(); 760 if (Code == bitc::END_BLOCK) { 761 if (Stream.ReadBlockEnd()) 762 return Error("Error at end of PARAMATTR block"); 763 return false; 764 } 765 766 if (Code == bitc::ENTER_SUBBLOCK) { 767 // No known subblocks, always skip them. 768 Stream.ReadSubBlockID(); 769 if (Stream.SkipBlock()) 770 return Error("Malformed block record"); 771 continue; 772 } 773 774 if (Code == bitc::DEFINE_ABBREV) { 775 Stream.ReadAbbrevRecord(); 776 continue; 777 } 778 779 bool IsFunctionLocal = false; 780 // Read a record. 781 Record.clear(); 782 switch (Stream.ReadRecord(Code, Record)) { 783 default: // Default behavior: ignore. 784 break; 785 case bitc::METADATA_NAME: { 786 // Read named of the named metadata. 787 unsigned NameLength = Record.size(); 788 SmallString<8> Name; 789 Name.resize(NameLength); 790 for (unsigned i = 0; i != NameLength; ++i) 791 Name[i] = Record[i]; 792 Record.clear(); 793 Code = Stream.ReadCode(); 794 795 // METADATA_NAME is always followed by METADATA_NAMED_NODE. 796 if (Stream.ReadRecord(Code, Record) != bitc::METADATA_NAMED_NODE) 797 assert ( 0 && "Inavlid Named Metadata record"); 798 799 // Read named metadata elements. 800 unsigned Size = Record.size(); 801 SmallVector<MDNode *, 8> Elts; 802 for (unsigned i = 0; i != Size; ++i) { 803 if (Record[i] == ~0U) { 804 Elts.push_back(NULL); 805 continue; 806 } 807 MDNode *MD = dyn_cast<MDNode>(MDValueList.getValueFwdRef(Record[i])); 808 if (MD == 0) 809 return Error("Malformed metadata record"); 810 Elts.push_back(MD); 811 } 812 Value *V = NamedMDNode::Create(Context, Name.str(), Elts.data(), 813 Elts.size(), TheModule); 814 MDValueList.AssignValue(V, NextMDValueNo++); 815 break; 816 } 817 case bitc::METADATA_FN_NODE: 818 IsFunctionLocal = true; 819 // fall-through 820 case bitc::METADATA_NODE: { 821 if (Record.empty() || Record.size() % 2 == 1) 822 return Error("Invalid METADATA_NODE record"); 823 824 unsigned Size = Record.size(); 825 SmallVector<Value*, 8> Elts; 826 for (unsigned i = 0; i != Size; i += 2) { 827 const Type *Ty = getTypeByID(Record[i], false); 828 if (Ty->isMetadataTy()) 829 Elts.push_back(MDValueList.getValueFwdRef(Record[i+1])); 830 else if (!Ty->isVoidTy()) 831 Elts.push_back(ValueList.getValueFwdRef(Record[i+1], Ty)); 832 else 833 Elts.push_back(NULL); 834 } 835 Value *V = MDNode::getWhenValsUnresolved(Context, &Elts[0], Elts.size(), 836 IsFunctionLocal); 837 IsFunctionLocal = false; 838 MDValueList.AssignValue(V, NextMDValueNo++); 839 break; 840 } 841 case bitc::METADATA_STRING: { 842 unsigned MDStringLength = Record.size(); 843 SmallString<8> String; 844 String.resize(MDStringLength); 845 for (unsigned i = 0; i != MDStringLength; ++i) 846 String[i] = Record[i]; 847 Value *V = MDString::get(Context, 848 StringRef(String.data(), String.size())); 849 MDValueList.AssignValue(V, NextMDValueNo++); 850 break; 851 } 852 case bitc::METADATA_KIND: { 853 unsigned RecordLength = Record.size(); 854 if (Record.empty() || RecordLength < 2) 855 return Error("Invalid METADATA_KIND record"); 856 SmallString<8> Name; 857 Name.resize(RecordLength-1); 858 unsigned Kind = Record[0]; 859 (void) Kind; 860 for (unsigned i = 1; i != RecordLength; ++i) 861 Name[i-1] = Record[i]; 862 863 unsigned NewKind = TheModule->getMDKindID(Name.str()); 864 assert(Kind == NewKind && 865 "FIXME: Unable to handle custom metadata mismatch!");(void)NewKind; 866 break; 867 } 868 } 869 } 870} 871 872/// DecodeSignRotatedValue - Decode a signed value stored with the sign bit in 873/// the LSB for dense VBR encoding. 874static uint64_t DecodeSignRotatedValue(uint64_t V) { 875 if ((V & 1) == 0) 876 return V >> 1; 877 if (V != 1) 878 return -(V >> 1); 879 // There is no such thing as -0 with integers. "-0" really means MININT. 880 return 1ULL << 63; 881} 882 883/// ResolveGlobalAndAliasInits - Resolve all of the initializers for global 884/// values and aliases that we can. 885bool BitcodeReader::ResolveGlobalAndAliasInits() { 886 std::vector<std::pair<GlobalVariable*, unsigned> > GlobalInitWorklist; 887 std::vector<std::pair<GlobalAlias*, unsigned> > AliasInitWorklist; 888 889 GlobalInitWorklist.swap(GlobalInits); 890 AliasInitWorklist.swap(AliasInits); 891 892 while (!GlobalInitWorklist.empty()) { 893 unsigned ValID = GlobalInitWorklist.back().second; 894 if (ValID >= ValueList.size()) { 895 // Not ready to resolve this yet, it requires something later in the file. 896 GlobalInits.push_back(GlobalInitWorklist.back()); 897 } else { 898 if (Constant *C = dyn_cast<Constant>(ValueList[ValID])) 899 GlobalInitWorklist.back().first->setInitializer(C); 900 else 901 return Error("Global variable initializer is not a constant!"); 902 } 903 GlobalInitWorklist.pop_back(); 904 } 905 906 while (!AliasInitWorklist.empty()) { 907 unsigned ValID = AliasInitWorklist.back().second; 908 if (ValID >= ValueList.size()) { 909 AliasInits.push_back(AliasInitWorklist.back()); 910 } else { 911 if (Constant *C = dyn_cast<Constant>(ValueList[ValID])) 912 AliasInitWorklist.back().first->setAliasee(C); 913 else 914 return Error("Alias initializer is not a constant!"); 915 } 916 AliasInitWorklist.pop_back(); 917 } 918 return false; 919} 920 921bool BitcodeReader::ParseConstants() { 922 if (Stream.EnterSubBlock(bitc::CONSTANTS_BLOCK_ID)) 923 return Error("Malformed block record"); 924 925 SmallVector<uint64_t, 64> Record; 926 927 // Read all the records for this value table. 928 const Type *CurTy = Type::getInt32Ty(Context); 929 unsigned NextCstNo = ValueList.size(); 930 while (1) { 931 unsigned Code = Stream.ReadCode(); 932 if (Code == bitc::END_BLOCK) 933 break; 934 935 if (Code == bitc::ENTER_SUBBLOCK) { 936 // No known subblocks, always skip them. 937 Stream.ReadSubBlockID(); 938 if (Stream.SkipBlock()) 939 return Error("Malformed block record"); 940 continue; 941 } 942 943 if (Code == bitc::DEFINE_ABBREV) { 944 Stream.ReadAbbrevRecord(); 945 continue; 946 } 947 948 // Read a record. 949 Record.clear(); 950 Value *V = 0; 951 unsigned BitCode = Stream.ReadRecord(Code, Record); 952 switch (BitCode) { 953 default: // Default behavior: unknown constant 954 case bitc::CST_CODE_UNDEF: // UNDEF 955 V = UndefValue::get(CurTy); 956 break; 957 case bitc::CST_CODE_SETTYPE: // SETTYPE: [typeid] 958 if (Record.empty()) 959 return Error("Malformed CST_SETTYPE record"); 960 if (Record[0] >= TypeList.size()) 961 return Error("Invalid Type ID in CST_SETTYPE record"); 962 CurTy = TypeList[Record[0]]; 963 continue; // Skip the ValueList manipulation. 964 case bitc::CST_CODE_NULL: // NULL 965 V = Constant::getNullValue(CurTy); 966 break; 967 case bitc::CST_CODE_INTEGER: // INTEGER: [intval] 968 if (!CurTy->isIntegerTy() || Record.empty()) 969 return Error("Invalid CST_INTEGER record"); 970 V = ConstantInt::get(CurTy, DecodeSignRotatedValue(Record[0])); 971 break; 972 case bitc::CST_CODE_WIDE_INTEGER: {// WIDE_INTEGER: [n x intval] 973 if (!CurTy->isIntegerTy() || Record.empty()) 974 return Error("Invalid WIDE_INTEGER record"); 975 976 unsigned NumWords = Record.size(); 977 SmallVector<uint64_t, 8> Words; 978 Words.resize(NumWords); 979 for (unsigned i = 0; i != NumWords; ++i) 980 Words[i] = DecodeSignRotatedValue(Record[i]); 981 V = ConstantInt::get(Context, 982 APInt(cast<IntegerType>(CurTy)->getBitWidth(), 983 NumWords, &Words[0])); 984 break; 985 } 986 case bitc::CST_CODE_FLOAT: { // FLOAT: [fpval] 987 if (Record.empty()) 988 return Error("Invalid FLOAT record"); 989 if (CurTy->isFloatTy()) 990 V = ConstantFP::get(Context, APFloat(APInt(32, (uint32_t)Record[0]))); 991 else if (CurTy->isDoubleTy()) 992 V = ConstantFP::get(Context, APFloat(APInt(64, Record[0]))); 993 else if (CurTy->isX86_FP80Ty()) { 994 // Bits are not stored the same way as a normal i80 APInt, compensate. 995 uint64_t Rearrange[2]; 996 Rearrange[0] = (Record[1] & 0xffffLL) | (Record[0] << 16); 997 Rearrange[1] = Record[0] >> 48; 998 V = ConstantFP::get(Context, APFloat(APInt(80, 2, Rearrange))); 999 } else if (CurTy->isFP128Ty()) 1000 V = ConstantFP::get(Context, APFloat(APInt(128, 2, &Record[0]), true)); 1001 else if (CurTy->isPPC_FP128Ty()) 1002 V = ConstantFP::get(Context, APFloat(APInt(128, 2, &Record[0]))); 1003 else 1004 V = UndefValue::get(CurTy); 1005 break; 1006 } 1007 1008 case bitc::CST_CODE_AGGREGATE: {// AGGREGATE: [n x value number] 1009 if (Record.empty()) 1010 return Error("Invalid CST_AGGREGATE record"); 1011 1012 unsigned Size = Record.size(); 1013 std::vector<Constant*> Elts; 1014 1015 if (const StructType *STy = dyn_cast<StructType>(CurTy)) { 1016 for (unsigned i = 0; i != Size; ++i) 1017 Elts.push_back(ValueList.getConstantFwdRef(Record[i], 1018 STy->getElementType(i))); 1019 V = ConstantStruct::get(STy, Elts); 1020 } else if (const UnionType *UnTy = dyn_cast<UnionType>(CurTy)) { 1021 uint64_t Index = Record[0]; 1022 Constant *Val = ValueList.getConstantFwdRef(Record[1], 1023 UnTy->getElementType(Index)); 1024 V = ConstantUnion::get(UnTy, Val); 1025 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(CurTy)) { 1026 const Type *EltTy = ATy->getElementType(); 1027 for (unsigned i = 0; i != Size; ++i) 1028 Elts.push_back(ValueList.getConstantFwdRef(Record[i], EltTy)); 1029 V = ConstantArray::get(ATy, Elts); 1030 } else if (const VectorType *VTy = dyn_cast<VectorType>(CurTy)) { 1031 const Type *EltTy = VTy->getElementType(); 1032 for (unsigned i = 0; i != Size; ++i) 1033 Elts.push_back(ValueList.getConstantFwdRef(Record[i], EltTy)); 1034 V = ConstantVector::get(Elts); 1035 } else { 1036 V = UndefValue::get(CurTy); 1037 } 1038 break; 1039 } 1040 case bitc::CST_CODE_STRING: { // STRING: [values] 1041 if (Record.empty()) 1042 return Error("Invalid CST_AGGREGATE record"); 1043 1044 const ArrayType *ATy = cast<ArrayType>(CurTy); 1045 const Type *EltTy = ATy->getElementType(); 1046 1047 unsigned Size = Record.size(); 1048 std::vector<Constant*> Elts; 1049 for (unsigned i = 0; i != Size; ++i) 1050 Elts.push_back(ConstantInt::get(EltTy, Record[i])); 1051 V = ConstantArray::get(ATy, Elts); 1052 break; 1053 } 1054 case bitc::CST_CODE_CSTRING: { // CSTRING: [values] 1055 if (Record.empty()) 1056 return Error("Invalid CST_AGGREGATE record"); 1057 1058 const ArrayType *ATy = cast<ArrayType>(CurTy); 1059 const Type *EltTy = ATy->getElementType(); 1060 1061 unsigned Size = Record.size(); 1062 std::vector<Constant*> Elts; 1063 for (unsigned i = 0; i != Size; ++i) 1064 Elts.push_back(ConstantInt::get(EltTy, Record[i])); 1065 Elts.push_back(Constant::getNullValue(EltTy)); 1066 V = ConstantArray::get(ATy, Elts); 1067 break; 1068 } 1069 case bitc::CST_CODE_CE_BINOP: { // CE_BINOP: [opcode, opval, opval] 1070 if (Record.size() < 3) return Error("Invalid CE_BINOP record"); 1071 int Opc = GetDecodedBinaryOpcode(Record[0], CurTy); 1072 if (Opc < 0) { 1073 V = UndefValue::get(CurTy); // Unknown binop. 1074 } else { 1075 Constant *LHS = ValueList.getConstantFwdRef(Record[1], CurTy); 1076 Constant *RHS = ValueList.getConstantFwdRef(Record[2], CurTy); 1077 unsigned Flags = 0; 1078 if (Record.size() >= 4) { 1079 if (Opc == Instruction::Add || 1080 Opc == Instruction::Sub || 1081 Opc == Instruction::Mul) { 1082 if (Record[3] & (1 << bitc::OBO_NO_SIGNED_WRAP)) 1083 Flags |= OverflowingBinaryOperator::NoSignedWrap; 1084 if (Record[3] & (1 << bitc::OBO_NO_UNSIGNED_WRAP)) 1085 Flags |= OverflowingBinaryOperator::NoUnsignedWrap; 1086 } else if (Opc == Instruction::SDiv) { 1087 if (Record[3] & (1 << bitc::SDIV_EXACT)) 1088 Flags |= SDivOperator::IsExact; 1089 } 1090 } 1091 V = ConstantExpr::get(Opc, LHS, RHS, Flags); 1092 } 1093 break; 1094 } 1095 case bitc::CST_CODE_CE_CAST: { // CE_CAST: [opcode, opty, opval] 1096 if (Record.size() < 3) return Error("Invalid CE_CAST record"); 1097 int Opc = GetDecodedCastOpcode(Record[0]); 1098 if (Opc < 0) { 1099 V = UndefValue::get(CurTy); // Unknown cast. 1100 } else { 1101 const Type *OpTy = getTypeByID(Record[1]); 1102 if (!OpTy) return Error("Invalid CE_CAST record"); 1103 Constant *Op = ValueList.getConstantFwdRef(Record[2], OpTy); 1104 V = ConstantExpr::getCast(Opc, Op, CurTy); 1105 } 1106 break; 1107 } 1108 case bitc::CST_CODE_CE_INBOUNDS_GEP: 1109 case bitc::CST_CODE_CE_GEP: { // CE_GEP: [n x operands] 1110 if (Record.size() & 1) return Error("Invalid CE_GEP record"); 1111 SmallVector<Constant*, 16> Elts; 1112 for (unsigned i = 0, e = Record.size(); i != e; i += 2) { 1113 const Type *ElTy = getTypeByID(Record[i]); 1114 if (!ElTy) return Error("Invalid CE_GEP record"); 1115 Elts.push_back(ValueList.getConstantFwdRef(Record[i+1], ElTy)); 1116 } 1117 if (BitCode == bitc::CST_CODE_CE_INBOUNDS_GEP) 1118 V = ConstantExpr::getInBoundsGetElementPtr(Elts[0], &Elts[1], 1119 Elts.size()-1); 1120 else 1121 V = ConstantExpr::getGetElementPtr(Elts[0], &Elts[1], 1122 Elts.size()-1); 1123 break; 1124 } 1125 case bitc::CST_CODE_CE_SELECT: // CE_SELECT: [opval#, opval#, opval#] 1126 if (Record.size() < 3) return Error("Invalid CE_SELECT record"); 1127 V = ConstantExpr::getSelect(ValueList.getConstantFwdRef(Record[0], 1128 Type::getInt1Ty(Context)), 1129 ValueList.getConstantFwdRef(Record[1],CurTy), 1130 ValueList.getConstantFwdRef(Record[2],CurTy)); 1131 break; 1132 case bitc::CST_CODE_CE_EXTRACTELT: { // CE_EXTRACTELT: [opty, opval, opval] 1133 if (Record.size() < 3) return Error("Invalid CE_EXTRACTELT record"); 1134 const VectorType *OpTy = 1135 dyn_cast_or_null<VectorType>(getTypeByID(Record[0])); 1136 if (OpTy == 0) return Error("Invalid CE_EXTRACTELT record"); 1137 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy); 1138 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], Type::getInt32Ty(Context)); 1139 V = ConstantExpr::getExtractElement(Op0, Op1); 1140 break; 1141 } 1142 case bitc::CST_CODE_CE_INSERTELT: { // CE_INSERTELT: [opval, opval, opval] 1143 const VectorType *OpTy = dyn_cast<VectorType>(CurTy); 1144 if (Record.size() < 3 || OpTy == 0) 1145 return Error("Invalid CE_INSERTELT record"); 1146 Constant *Op0 = ValueList.getConstantFwdRef(Record[0], OpTy); 1147 Constant *Op1 = ValueList.getConstantFwdRef(Record[1], 1148 OpTy->getElementType()); 1149 Constant *Op2 = ValueList.getConstantFwdRef(Record[2], Type::getInt32Ty(Context)); 1150 V = ConstantExpr::getInsertElement(Op0, Op1, Op2); 1151 break; 1152 } 1153 case bitc::CST_CODE_CE_SHUFFLEVEC: { // CE_SHUFFLEVEC: [opval, opval, opval] 1154 const VectorType *OpTy = dyn_cast<VectorType>(CurTy); 1155 if (Record.size() < 3 || OpTy == 0) 1156 return Error("Invalid CE_SHUFFLEVEC record"); 1157 Constant *Op0 = ValueList.getConstantFwdRef(Record[0], OpTy); 1158 Constant *Op1 = ValueList.getConstantFwdRef(Record[1], OpTy); 1159 const Type *ShufTy = VectorType::get(Type::getInt32Ty(Context), 1160 OpTy->getNumElements()); 1161 Constant *Op2 = ValueList.getConstantFwdRef(Record[2], ShufTy); 1162 V = ConstantExpr::getShuffleVector(Op0, Op1, Op2); 1163 break; 1164 } 1165 case bitc::CST_CODE_CE_SHUFVEC_EX: { // [opty, opval, opval, opval] 1166 const VectorType *RTy = dyn_cast<VectorType>(CurTy); 1167 const VectorType *OpTy = dyn_cast<VectorType>(getTypeByID(Record[0])); 1168 if (Record.size() < 4 || RTy == 0 || OpTy == 0) 1169 return Error("Invalid CE_SHUFVEC_EX record"); 1170 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy); 1171 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], OpTy); 1172 const Type *ShufTy = VectorType::get(Type::getInt32Ty(Context), 1173 RTy->getNumElements()); 1174 Constant *Op2 = ValueList.getConstantFwdRef(Record[3], ShufTy); 1175 V = ConstantExpr::getShuffleVector(Op0, Op1, Op2); 1176 break; 1177 } 1178 case bitc::CST_CODE_CE_CMP: { // CE_CMP: [opty, opval, opval, pred] 1179 if (Record.size() < 4) return Error("Invalid CE_CMP record"); 1180 const Type *OpTy = getTypeByID(Record[0]); 1181 if (OpTy == 0) return Error("Invalid CE_CMP record"); 1182 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy); 1183 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], OpTy); 1184 1185 if (OpTy->isFPOrFPVectorTy()) 1186 V = ConstantExpr::getFCmp(Record[3], Op0, Op1); 1187 else 1188 V = ConstantExpr::getICmp(Record[3], Op0, Op1); 1189 break; 1190 } 1191 case bitc::CST_CODE_INLINEASM: { 1192 if (Record.size() < 2) return Error("Invalid INLINEASM record"); 1193 std::string AsmStr, ConstrStr; 1194 bool HasSideEffects = Record[0] & 1; 1195 bool IsAlignStack = Record[0] >> 1; 1196 unsigned AsmStrSize = Record[1]; 1197 if (2+AsmStrSize >= Record.size()) 1198 return Error("Invalid INLINEASM record"); 1199 unsigned ConstStrSize = Record[2+AsmStrSize]; 1200 if (3+AsmStrSize+ConstStrSize > Record.size()) 1201 return Error("Invalid INLINEASM record"); 1202 1203 for (unsigned i = 0; i != AsmStrSize; ++i) 1204 AsmStr += (char)Record[2+i]; 1205 for (unsigned i = 0; i != ConstStrSize; ++i) 1206 ConstrStr += (char)Record[3+AsmStrSize+i]; 1207 const PointerType *PTy = cast<PointerType>(CurTy); 1208 V = InlineAsm::get(cast<FunctionType>(PTy->getElementType()), 1209 AsmStr, ConstrStr, HasSideEffects, IsAlignStack); 1210 break; 1211 } 1212 case bitc::CST_CODE_BLOCKADDRESS:{ 1213 if (Record.size() < 3) return Error("Invalid CE_BLOCKADDRESS record"); 1214 const Type *FnTy = getTypeByID(Record[0]); 1215 if (FnTy == 0) return Error("Invalid CE_BLOCKADDRESS record"); 1216 Function *Fn = 1217 dyn_cast_or_null<Function>(ValueList.getConstantFwdRef(Record[1],FnTy)); 1218 if (Fn == 0) return Error("Invalid CE_BLOCKADDRESS record"); 1219 1220 GlobalVariable *FwdRef = new GlobalVariable(*Fn->getParent(), 1221 Type::getInt8Ty(Context), 1222 false, GlobalValue::InternalLinkage, 1223 0, ""); 1224 BlockAddrFwdRefs[Fn].push_back(std::make_pair(Record[2], FwdRef)); 1225 V = FwdRef; 1226 break; 1227 } 1228 } 1229 1230 ValueList.AssignValue(V, NextCstNo); 1231 ++NextCstNo; 1232 } 1233 1234 if (NextCstNo != ValueList.size()) 1235 return Error("Invalid constant reference!"); 1236 1237 if (Stream.ReadBlockEnd()) 1238 return Error("Error at end of constants block"); 1239 1240 // Once all the constants have been read, go through and resolve forward 1241 // references. 1242 ValueList.ResolveConstantForwardRefs(); 1243 return false; 1244} 1245 1246/// RememberAndSkipFunctionBody - When we see the block for a function body, 1247/// remember where it is and then skip it. This lets us lazily deserialize the 1248/// functions. 1249bool BitcodeReader::RememberAndSkipFunctionBody() { 1250 // Get the function we are talking about. 1251 if (FunctionsWithBodies.empty()) 1252 return Error("Insufficient function protos"); 1253 1254 Function *Fn = FunctionsWithBodies.back(); 1255 FunctionsWithBodies.pop_back(); 1256 1257 // Save the current stream state. 1258 uint64_t CurBit = Stream.GetCurrentBitNo(); 1259 DeferredFunctionInfo[Fn] = CurBit; 1260 1261 // Skip over the function block for now. 1262 if (Stream.SkipBlock()) 1263 return Error("Malformed block record"); 1264 return false; 1265} 1266 1267bool BitcodeReader::ParseModule() { 1268 if (Stream.EnterSubBlock(bitc::MODULE_BLOCK_ID)) 1269 return Error("Malformed block record"); 1270 1271 SmallVector<uint64_t, 64> Record; 1272 std::vector<std::string> SectionTable; 1273 std::vector<std::string> GCTable; 1274 1275 // Read all the records for this module. 1276 while (!Stream.AtEndOfStream()) { 1277 unsigned Code = Stream.ReadCode(); 1278 if (Code == bitc::END_BLOCK) { 1279 if (Stream.ReadBlockEnd()) 1280 return Error("Error at end of module block"); 1281 1282 // Patch the initializers for globals and aliases up. 1283 ResolveGlobalAndAliasInits(); 1284 if (!GlobalInits.empty() || !AliasInits.empty()) 1285 return Error("Malformed global initializer set"); 1286 if (!FunctionsWithBodies.empty()) 1287 return Error("Too few function bodies found"); 1288 1289 // Look for intrinsic functions which need to be upgraded at some point 1290 for (Module::iterator FI = TheModule->begin(), FE = TheModule->end(); 1291 FI != FE; ++FI) { 1292 Function* NewFn; 1293 if (UpgradeIntrinsicFunction(FI, NewFn)) 1294 UpgradedIntrinsics.push_back(std::make_pair(FI, NewFn)); 1295 } 1296 1297 // Force deallocation of memory for these vectors to favor the client that 1298 // want lazy deserialization. 1299 std::vector<std::pair<GlobalVariable*, unsigned> >().swap(GlobalInits); 1300 std::vector<std::pair<GlobalAlias*, unsigned> >().swap(AliasInits); 1301 std::vector<Function*>().swap(FunctionsWithBodies); 1302 return false; 1303 } 1304 1305 if (Code == bitc::ENTER_SUBBLOCK) { 1306 switch (Stream.ReadSubBlockID()) { 1307 default: // Skip unknown content. 1308 if (Stream.SkipBlock()) 1309 return Error("Malformed block record"); 1310 break; 1311 case bitc::BLOCKINFO_BLOCK_ID: 1312 if (Stream.ReadBlockInfoBlock()) 1313 return Error("Malformed BlockInfoBlock"); 1314 break; 1315 case bitc::PARAMATTR_BLOCK_ID: 1316 if (ParseAttributeBlock()) 1317 return true; 1318 break; 1319 case bitc::TYPE_BLOCK_ID: 1320 if (ParseTypeTable()) 1321 return true; 1322 break; 1323 case bitc::TYPE_SYMTAB_BLOCK_ID: 1324 if (ParseTypeSymbolTable()) 1325 return true; 1326 break; 1327 case bitc::VALUE_SYMTAB_BLOCK_ID: 1328 if (ParseValueSymbolTable()) 1329 return true; 1330 break; 1331 case bitc::CONSTANTS_BLOCK_ID: 1332 if (ParseConstants() || ResolveGlobalAndAliasInits()) 1333 return true; 1334 break; 1335 case bitc::METADATA_BLOCK_ID: 1336 if (ParseMetadata()) 1337 return true; 1338 break; 1339 case bitc::FUNCTION_BLOCK_ID: 1340 // If this is the first function body we've seen, reverse the 1341 // FunctionsWithBodies list. 1342 if (!HasReversedFunctionsWithBodies) { 1343 std::reverse(FunctionsWithBodies.begin(), FunctionsWithBodies.end()); 1344 HasReversedFunctionsWithBodies = true; 1345 } 1346 1347 if (RememberAndSkipFunctionBody()) 1348 return true; 1349 break; 1350 } 1351 continue; 1352 } 1353 1354 if (Code == bitc::DEFINE_ABBREV) { 1355 Stream.ReadAbbrevRecord(); 1356 continue; 1357 } 1358 1359 // Read a record. 1360 switch (Stream.ReadRecord(Code, Record)) { 1361 default: break; // Default behavior, ignore unknown content. 1362 case bitc::MODULE_CODE_VERSION: // VERSION: [version#] 1363 if (Record.size() < 1) 1364 return Error("Malformed MODULE_CODE_VERSION"); 1365 // Only version #0 is supported so far. 1366 if (Record[0] != 0) 1367 return Error("Unknown bitstream version!"); 1368 break; 1369 case bitc::MODULE_CODE_TRIPLE: { // TRIPLE: [strchr x N] 1370 std::string S; 1371 if (ConvertToString(Record, 0, S)) 1372 return Error("Invalid MODULE_CODE_TRIPLE record"); 1373 TheModule->setTargetTriple(S); 1374 break; 1375 } 1376 case bitc::MODULE_CODE_DATALAYOUT: { // DATALAYOUT: [strchr x N] 1377 std::string S; 1378 if (ConvertToString(Record, 0, S)) 1379 return Error("Invalid MODULE_CODE_DATALAYOUT record"); 1380 TheModule->setDataLayout(S); 1381 break; 1382 } 1383 case bitc::MODULE_CODE_ASM: { // ASM: [strchr x N] 1384 std::string S; 1385 if (ConvertToString(Record, 0, S)) 1386 return Error("Invalid MODULE_CODE_ASM record"); 1387 TheModule->setModuleInlineAsm(S); 1388 break; 1389 } 1390 case bitc::MODULE_CODE_DEPLIB: { // DEPLIB: [strchr x N] 1391 std::string S; 1392 if (ConvertToString(Record, 0, S)) 1393 return Error("Invalid MODULE_CODE_DEPLIB record"); 1394 TheModule->addLibrary(S); 1395 break; 1396 } 1397 case bitc::MODULE_CODE_SECTIONNAME: { // SECTIONNAME: [strchr x N] 1398 std::string S; 1399 if (ConvertToString(Record, 0, S)) 1400 return Error("Invalid MODULE_CODE_SECTIONNAME record"); 1401 SectionTable.push_back(S); 1402 break; 1403 } 1404 case bitc::MODULE_CODE_GCNAME: { // SECTIONNAME: [strchr x N] 1405 std::string S; 1406 if (ConvertToString(Record, 0, S)) 1407 return Error("Invalid MODULE_CODE_GCNAME record"); 1408 GCTable.push_back(S); 1409 break; 1410 } 1411 // GLOBALVAR: [pointer type, isconst, initid, 1412 // linkage, alignment, section, visibility, threadlocal] 1413 case bitc::MODULE_CODE_GLOBALVAR: { 1414 if (Record.size() < 6) 1415 return Error("Invalid MODULE_CODE_GLOBALVAR record"); 1416 const Type *Ty = getTypeByID(Record[0]); 1417 if (!Ty->isPointerTy()) 1418 return Error("Global not a pointer type!"); 1419 unsigned AddressSpace = cast<PointerType>(Ty)->getAddressSpace(); 1420 Ty = cast<PointerType>(Ty)->getElementType(); 1421 1422 bool isConstant = Record[1]; 1423 GlobalValue::LinkageTypes Linkage = GetDecodedLinkage(Record[3]); 1424 unsigned Alignment = (1 << Record[4]) >> 1; 1425 std::string Section; 1426 if (Record[5]) { 1427 if (Record[5]-1 >= SectionTable.size()) 1428 return Error("Invalid section ID"); 1429 Section = SectionTable[Record[5]-1]; 1430 } 1431 GlobalValue::VisibilityTypes Visibility = GlobalValue::DefaultVisibility; 1432 if (Record.size() > 6) 1433 Visibility = GetDecodedVisibility(Record[6]); 1434 bool isThreadLocal = false; 1435 if (Record.size() > 7) 1436 isThreadLocal = Record[7]; 1437 1438 GlobalVariable *NewGV = 1439 new GlobalVariable(*TheModule, Ty, isConstant, Linkage, 0, "", 0, 1440 isThreadLocal, AddressSpace); 1441 NewGV->setAlignment(Alignment); 1442 if (!Section.empty()) 1443 NewGV->setSection(Section); 1444 NewGV->setVisibility(Visibility); 1445 NewGV->setThreadLocal(isThreadLocal); 1446 1447 ValueList.push_back(NewGV); 1448 1449 // Remember which value to use for the global initializer. 1450 if (unsigned InitID = Record[2]) 1451 GlobalInits.push_back(std::make_pair(NewGV, InitID-1)); 1452 break; 1453 } 1454 // FUNCTION: [type, callingconv, isproto, linkage, paramattr, 1455 // alignment, section, visibility, gc] 1456 case bitc::MODULE_CODE_FUNCTION: { 1457 if (Record.size() < 8) 1458 return Error("Invalid MODULE_CODE_FUNCTION record"); 1459 const Type *Ty = getTypeByID(Record[0]); 1460 if (!Ty->isPointerTy()) 1461 return Error("Function not a pointer type!"); 1462 const FunctionType *FTy = 1463 dyn_cast<FunctionType>(cast<PointerType>(Ty)->getElementType()); 1464 if (!FTy) 1465 return Error("Function not a pointer to function type!"); 1466 1467 Function *Func = Function::Create(FTy, GlobalValue::ExternalLinkage, 1468 "", TheModule); 1469 1470 Func->setCallingConv(static_cast<CallingConv::ID>(Record[1])); 1471 bool isProto = Record[2]; 1472 Func->setLinkage(GetDecodedLinkage(Record[3])); 1473 Func->setAttributes(getAttributes(Record[4])); 1474 1475 Func->setAlignment((1 << Record[5]) >> 1); 1476 if (Record[6]) { 1477 if (Record[6]-1 >= SectionTable.size()) 1478 return Error("Invalid section ID"); 1479 Func->setSection(SectionTable[Record[6]-1]); 1480 } 1481 Func->setVisibility(GetDecodedVisibility(Record[7])); 1482 if (Record.size() > 8 && Record[8]) { 1483 if (Record[8]-1 > GCTable.size()) 1484 return Error("Invalid GC ID"); 1485 Func->setGC(GCTable[Record[8]-1].c_str()); 1486 } 1487 ValueList.push_back(Func); 1488 1489 // If this is a function with a body, remember the prototype we are 1490 // creating now, so that we can match up the body with them later. 1491 if (!isProto) 1492 FunctionsWithBodies.push_back(Func); 1493 break; 1494 } 1495 // ALIAS: [alias type, aliasee val#, linkage] 1496 // ALIAS: [alias type, aliasee val#, linkage, visibility] 1497 case bitc::MODULE_CODE_ALIAS: { 1498 if (Record.size() < 3) 1499 return Error("Invalid MODULE_ALIAS record"); 1500 const Type *Ty = getTypeByID(Record[0]); 1501 if (!Ty->isPointerTy()) 1502 return Error("Function not a pointer type!"); 1503 1504 GlobalAlias *NewGA = new GlobalAlias(Ty, GetDecodedLinkage(Record[2]), 1505 "", 0, TheModule); 1506 // Old bitcode files didn't have visibility field. 1507 if (Record.size() > 3) 1508 NewGA->setVisibility(GetDecodedVisibility(Record[3])); 1509 ValueList.push_back(NewGA); 1510 AliasInits.push_back(std::make_pair(NewGA, Record[1])); 1511 break; 1512 } 1513 /// MODULE_CODE_PURGEVALS: [numvals] 1514 case bitc::MODULE_CODE_PURGEVALS: 1515 // Trim down the value list to the specified size. 1516 if (Record.size() < 1 || Record[0] > ValueList.size()) 1517 return Error("Invalid MODULE_PURGEVALS record"); 1518 ValueList.shrinkTo(Record[0]); 1519 break; 1520 } 1521 Record.clear(); 1522 } 1523 1524 return Error("Premature end of bitstream"); 1525} 1526 1527bool BitcodeReader::ParseBitcodeInto(Module *M) { 1528 TheModule = 0; 1529 1530 unsigned char *BufPtr = (unsigned char *)Buffer->getBufferStart(); 1531 unsigned char *BufEnd = BufPtr+Buffer->getBufferSize(); 1532 1533 if (Buffer->getBufferSize() & 3) { 1534 if (!isRawBitcode(BufPtr, BufEnd) && !isBitcodeWrapper(BufPtr, BufEnd)) 1535 return Error("Invalid bitcode signature"); 1536 else 1537 return Error("Bitcode stream should be a multiple of 4 bytes in length"); 1538 } 1539 1540 // If we have a wrapper header, parse it and ignore the non-bc file contents. 1541 // The magic number is 0x0B17C0DE stored in little endian. 1542 if (isBitcodeWrapper(BufPtr, BufEnd)) 1543 if (SkipBitcodeWrapperHeader(BufPtr, BufEnd)) 1544 return Error("Invalid bitcode wrapper header"); 1545 1546 StreamFile.init(BufPtr, BufEnd); 1547 Stream.init(StreamFile); 1548 1549 // Sniff for the signature. 1550 if (Stream.Read(8) != 'B' || 1551 Stream.Read(8) != 'C' || 1552 Stream.Read(4) != 0x0 || 1553 Stream.Read(4) != 0xC || 1554 Stream.Read(4) != 0xE || 1555 Stream.Read(4) != 0xD) 1556 return Error("Invalid bitcode signature"); 1557 1558 // We expect a number of well-defined blocks, though we don't necessarily 1559 // need to understand them all. 1560 while (!Stream.AtEndOfStream()) { 1561 unsigned Code = Stream.ReadCode(); 1562 1563 if (Code != bitc::ENTER_SUBBLOCK) 1564 return Error("Invalid record at top-level"); 1565 1566 unsigned BlockID = Stream.ReadSubBlockID(); 1567 1568 // We only know the MODULE subblock ID. 1569 switch (BlockID) { 1570 case bitc::BLOCKINFO_BLOCK_ID: 1571 if (Stream.ReadBlockInfoBlock()) 1572 return Error("Malformed BlockInfoBlock"); 1573 break; 1574 case bitc::MODULE_BLOCK_ID: 1575 // Reject multiple MODULE_BLOCK's in a single bitstream. 1576 if (TheModule) 1577 return Error("Multiple MODULE_BLOCKs in same stream"); 1578 TheModule = M; 1579 if (ParseModule()) 1580 return true; 1581 break; 1582 default: 1583 if (Stream.SkipBlock()) 1584 return Error("Malformed block record"); 1585 break; 1586 } 1587 } 1588 1589 return false; 1590} 1591 1592/// ParseMetadataAttachment - Parse metadata attachments. 1593bool BitcodeReader::ParseMetadataAttachment() { 1594 if (Stream.EnterSubBlock(bitc::METADATA_ATTACHMENT_ID)) 1595 return Error("Malformed block record"); 1596 1597 SmallVector<uint64_t, 64> Record; 1598 while(1) { 1599 unsigned Code = Stream.ReadCode(); 1600 if (Code == bitc::END_BLOCK) { 1601 if (Stream.ReadBlockEnd()) 1602 return Error("Error at end of PARAMATTR block"); 1603 break; 1604 } 1605 if (Code == bitc::DEFINE_ABBREV) { 1606 Stream.ReadAbbrevRecord(); 1607 continue; 1608 } 1609 // Read a metadata attachment record. 1610 Record.clear(); 1611 switch (Stream.ReadRecord(Code, Record)) { 1612 default: // Default behavior: ignore. 1613 break; 1614 case bitc::METADATA_ATTACHMENT: { 1615 unsigned RecordLength = Record.size(); 1616 if (Record.empty() || (RecordLength - 1) % 2 == 1) 1617 return Error ("Invalid METADATA_ATTACHMENT reader!"); 1618 Instruction *Inst = InstructionList[Record[0]]; 1619 for (unsigned i = 1; i != RecordLength; i = i+2) { 1620 unsigned Kind = Record[i]; 1621 Value *Node = MDValueList.getValueFwdRef(Record[i+1]); 1622 Inst->setMetadata(Kind, cast<MDNode>(Node)); 1623 } 1624 break; 1625 } 1626 } 1627 } 1628 return false; 1629} 1630 1631/// ParseFunctionBody - Lazily parse the specified function body block. 1632bool BitcodeReader::ParseFunctionBody(Function *F) { 1633 if (Stream.EnterSubBlock(bitc::FUNCTION_BLOCK_ID)) 1634 return Error("Malformed block record"); 1635 1636 InstructionList.clear(); 1637 unsigned ModuleValueListSize = ValueList.size(); 1638 1639 // Add all the function arguments to the value table. 1640 for(Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I) 1641 ValueList.push_back(I); 1642 1643 unsigned NextValueNo = ValueList.size(); 1644 BasicBlock *CurBB = 0; 1645 unsigned CurBBNo = 0; 1646 1647 DebugLoc LastLoc; 1648 1649 // Read all the records. 1650 SmallVector<uint64_t, 64> Record; 1651 while (1) { 1652 unsigned Code = Stream.ReadCode(); 1653 if (Code == bitc::END_BLOCK) { 1654 if (Stream.ReadBlockEnd()) 1655 return Error("Error at end of function block"); 1656 break; 1657 } 1658 1659 if (Code == bitc::ENTER_SUBBLOCK) { 1660 switch (Stream.ReadSubBlockID()) { 1661 default: // Skip unknown content. 1662 if (Stream.SkipBlock()) 1663 return Error("Malformed block record"); 1664 break; 1665 case bitc::CONSTANTS_BLOCK_ID: 1666 if (ParseConstants()) return true; 1667 NextValueNo = ValueList.size(); 1668 break; 1669 case bitc::VALUE_SYMTAB_BLOCK_ID: 1670 if (ParseValueSymbolTable()) return true; 1671 break; 1672 case bitc::METADATA_ATTACHMENT_ID: 1673 if (ParseMetadataAttachment()) return true; 1674 break; 1675 case bitc::METADATA_BLOCK_ID: 1676 if (ParseMetadata()) return true; 1677 break; 1678 } 1679 continue; 1680 } 1681 1682 if (Code == bitc::DEFINE_ABBREV) { 1683 Stream.ReadAbbrevRecord(); 1684 continue; 1685 } 1686 1687 // Read a record. 1688 Record.clear(); 1689 Instruction *I = 0; 1690 unsigned BitCode = Stream.ReadRecord(Code, Record); 1691 switch (BitCode) { 1692 default: // Default behavior: reject 1693 return Error("Unknown instruction"); 1694 case bitc::FUNC_CODE_DECLAREBLOCKS: // DECLAREBLOCKS: [nblocks] 1695 if (Record.size() < 1 || Record[0] == 0) 1696 return Error("Invalid DECLAREBLOCKS record"); 1697 // Create all the basic blocks for the function. 1698 FunctionBBs.resize(Record[0]); 1699 for (unsigned i = 0, e = FunctionBBs.size(); i != e; ++i) 1700 FunctionBBs[i] = BasicBlock::Create(Context, "", F); 1701 CurBB = FunctionBBs[0]; 1702 continue; 1703 1704 1705 case bitc::FUNC_CODE_DEBUG_LOC_AGAIN: // DEBUG_LOC_AGAIN 1706 // This record indicates that the last instruction is at the same 1707 // location as the previous instruction with a location. 1708 I = 0; 1709 1710 // Get the last instruction emitted. 1711 if (CurBB && !CurBB->empty()) 1712 I = &CurBB->back(); 1713 else if (CurBBNo && FunctionBBs[CurBBNo-1] && 1714 !FunctionBBs[CurBBNo-1]->empty()) 1715 I = &FunctionBBs[CurBBNo-1]->back(); 1716 1717 if (I == 0) return Error("Invalid DEBUG_LOC_AGAIN record"); 1718 I->setDebugLoc(LastLoc); 1719 I = 0; 1720 continue; 1721 1722 case bitc::FUNC_CODE_DEBUG_LOC: { // DEBUG_LOC: [line, col, scope, ia] 1723 I = 0; // Get the last instruction emitted. 1724 if (CurBB && !CurBB->empty()) 1725 I = &CurBB->back(); 1726 else if (CurBBNo && FunctionBBs[CurBBNo-1] && 1727 !FunctionBBs[CurBBNo-1]->empty()) 1728 I = &FunctionBBs[CurBBNo-1]->back(); 1729 if (I == 0 || Record.size() < 4) 1730 return Error("Invalid FUNC_CODE_DEBUG_LOC record"); 1731 1732 unsigned Line = Record[0], Col = Record[1]; 1733 unsigned ScopeID = Record[2], IAID = Record[3]; 1734 1735 MDNode *Scope = 0, *IA = 0; 1736 if (ScopeID) Scope = cast<MDNode>(MDValueList.getValueFwdRef(ScopeID-1)); 1737 if (IAID) IA = cast<MDNode>(MDValueList.getValueFwdRef(IAID-1)); 1738 LastLoc = DebugLoc::get(Line, Col, Scope, IA); 1739 I->setDebugLoc(LastLoc); 1740 I = 0; 1741 continue; 1742 } 1743 1744 case bitc::FUNC_CODE_INST_BINOP: { // BINOP: [opval, ty, opval, opcode] 1745 unsigned OpNum = 0; 1746 Value *LHS, *RHS; 1747 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) || 1748 getValue(Record, OpNum, LHS->getType(), RHS) || 1749 OpNum+1 > Record.size()) 1750 return Error("Invalid BINOP record"); 1751 1752 int Opc = GetDecodedBinaryOpcode(Record[OpNum++], LHS->getType()); 1753 if (Opc == -1) return Error("Invalid BINOP record"); 1754 I = BinaryOperator::Create((Instruction::BinaryOps)Opc, LHS, RHS); 1755 InstructionList.push_back(I); 1756 if (OpNum < Record.size()) { 1757 if (Opc == Instruction::Add || 1758 Opc == Instruction::Sub || 1759 Opc == Instruction::Mul) { 1760 if (Record[OpNum] & (1 << bitc::OBO_NO_SIGNED_WRAP)) 1761 cast<BinaryOperator>(I)->setHasNoSignedWrap(true); 1762 if (Record[OpNum] & (1 << bitc::OBO_NO_UNSIGNED_WRAP)) 1763 cast<BinaryOperator>(I)->setHasNoUnsignedWrap(true); 1764 } else if (Opc == Instruction::SDiv) { 1765 if (Record[OpNum] & (1 << bitc::SDIV_EXACT)) 1766 cast<BinaryOperator>(I)->setIsExact(true); 1767 } 1768 } 1769 break; 1770 } 1771 case bitc::FUNC_CODE_INST_CAST: { // CAST: [opval, opty, destty, castopc] 1772 unsigned OpNum = 0; 1773 Value *Op; 1774 if (getValueTypePair(Record, OpNum, NextValueNo, Op) || 1775 OpNum+2 != Record.size()) 1776 return Error("Invalid CAST record"); 1777 1778 const Type *ResTy = getTypeByID(Record[OpNum]); 1779 int Opc = GetDecodedCastOpcode(Record[OpNum+1]); 1780 if (Opc == -1 || ResTy == 0) 1781 return Error("Invalid CAST record"); 1782 I = CastInst::Create((Instruction::CastOps)Opc, Op, ResTy); 1783 InstructionList.push_back(I); 1784 break; 1785 } 1786 case bitc::FUNC_CODE_INST_INBOUNDS_GEP: 1787 case bitc::FUNC_CODE_INST_GEP: { // GEP: [n x operands] 1788 unsigned OpNum = 0; 1789 Value *BasePtr; 1790 if (getValueTypePair(Record, OpNum, NextValueNo, BasePtr)) 1791 return Error("Invalid GEP record"); 1792 1793 SmallVector<Value*, 16> GEPIdx; 1794 while (OpNum != Record.size()) { 1795 Value *Op; 1796 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 1797 return Error("Invalid GEP record"); 1798 GEPIdx.push_back(Op); 1799 } 1800 1801 I = GetElementPtrInst::Create(BasePtr, GEPIdx.begin(), GEPIdx.end()); 1802 InstructionList.push_back(I); 1803 if (BitCode == bitc::FUNC_CODE_INST_INBOUNDS_GEP) 1804 cast<GetElementPtrInst>(I)->setIsInBounds(true); 1805 break; 1806 } 1807 1808 case bitc::FUNC_CODE_INST_EXTRACTVAL: { 1809 // EXTRACTVAL: [opty, opval, n x indices] 1810 unsigned OpNum = 0; 1811 Value *Agg; 1812 if (getValueTypePair(Record, OpNum, NextValueNo, Agg)) 1813 return Error("Invalid EXTRACTVAL record"); 1814 1815 SmallVector<unsigned, 4> EXTRACTVALIdx; 1816 for (unsigned RecSize = Record.size(); 1817 OpNum != RecSize; ++OpNum) { 1818 uint64_t Index = Record[OpNum]; 1819 if ((unsigned)Index != Index) 1820 return Error("Invalid EXTRACTVAL index"); 1821 EXTRACTVALIdx.push_back((unsigned)Index); 1822 } 1823 1824 I = ExtractValueInst::Create(Agg, 1825 EXTRACTVALIdx.begin(), EXTRACTVALIdx.end()); 1826 InstructionList.push_back(I); 1827 break; 1828 } 1829 1830 case bitc::FUNC_CODE_INST_INSERTVAL: { 1831 // INSERTVAL: [opty, opval, opty, opval, n x indices] 1832 unsigned OpNum = 0; 1833 Value *Agg; 1834 if (getValueTypePair(Record, OpNum, NextValueNo, Agg)) 1835 return Error("Invalid INSERTVAL record"); 1836 Value *Val; 1837 if (getValueTypePair(Record, OpNum, NextValueNo, Val)) 1838 return Error("Invalid INSERTVAL record"); 1839 1840 SmallVector<unsigned, 4> INSERTVALIdx; 1841 for (unsigned RecSize = Record.size(); 1842 OpNum != RecSize; ++OpNum) { 1843 uint64_t Index = Record[OpNum]; 1844 if ((unsigned)Index != Index) 1845 return Error("Invalid INSERTVAL index"); 1846 INSERTVALIdx.push_back((unsigned)Index); 1847 } 1848 1849 I = InsertValueInst::Create(Agg, Val, 1850 INSERTVALIdx.begin(), INSERTVALIdx.end()); 1851 InstructionList.push_back(I); 1852 break; 1853 } 1854 1855 case bitc::FUNC_CODE_INST_SELECT: { // SELECT: [opval, ty, opval, opval] 1856 // obsolete form of select 1857 // handles select i1 ... in old bitcode 1858 unsigned OpNum = 0; 1859 Value *TrueVal, *FalseVal, *Cond; 1860 if (getValueTypePair(Record, OpNum, NextValueNo, TrueVal) || 1861 getValue(Record, OpNum, TrueVal->getType(), FalseVal) || 1862 getValue(Record, OpNum, Type::getInt1Ty(Context), Cond)) 1863 return Error("Invalid SELECT record"); 1864 1865 I = SelectInst::Create(Cond, TrueVal, FalseVal); 1866 InstructionList.push_back(I); 1867 break; 1868 } 1869 1870 case bitc::FUNC_CODE_INST_VSELECT: {// VSELECT: [ty,opval,opval,predty,pred] 1871 // new form of select 1872 // handles select i1 or select [N x i1] 1873 unsigned OpNum = 0; 1874 Value *TrueVal, *FalseVal, *Cond; 1875 if (getValueTypePair(Record, OpNum, NextValueNo, TrueVal) || 1876 getValue(Record, OpNum, TrueVal->getType(), FalseVal) || 1877 getValueTypePair(Record, OpNum, NextValueNo, Cond)) 1878 return Error("Invalid SELECT record"); 1879 1880 // select condition can be either i1 or [N x i1] 1881 if (const VectorType* vector_type = 1882 dyn_cast<const VectorType>(Cond->getType())) { 1883 // expect <n x i1> 1884 if (vector_type->getElementType() != Type::getInt1Ty(Context)) 1885 return Error("Invalid SELECT condition type"); 1886 } else { 1887 // expect i1 1888 if (Cond->getType() != Type::getInt1Ty(Context)) 1889 return Error("Invalid SELECT condition type"); 1890 } 1891 1892 I = SelectInst::Create(Cond, TrueVal, FalseVal); 1893 InstructionList.push_back(I); 1894 break; 1895 } 1896 1897 case bitc::FUNC_CODE_INST_EXTRACTELT: { // EXTRACTELT: [opty, opval, opval] 1898 unsigned OpNum = 0; 1899 Value *Vec, *Idx; 1900 if (getValueTypePair(Record, OpNum, NextValueNo, Vec) || 1901 getValue(Record, OpNum, Type::getInt32Ty(Context), Idx)) 1902 return Error("Invalid EXTRACTELT record"); 1903 I = ExtractElementInst::Create(Vec, Idx); 1904 InstructionList.push_back(I); 1905 break; 1906 } 1907 1908 case bitc::FUNC_CODE_INST_INSERTELT: { // INSERTELT: [ty, opval,opval,opval] 1909 unsigned OpNum = 0; 1910 Value *Vec, *Elt, *Idx; 1911 if (getValueTypePair(Record, OpNum, NextValueNo, Vec) || 1912 getValue(Record, OpNum, 1913 cast<VectorType>(Vec->getType())->getElementType(), Elt) || 1914 getValue(Record, OpNum, Type::getInt32Ty(Context), Idx)) 1915 return Error("Invalid INSERTELT record"); 1916 I = InsertElementInst::Create(Vec, Elt, Idx); 1917 InstructionList.push_back(I); 1918 break; 1919 } 1920 1921 case bitc::FUNC_CODE_INST_SHUFFLEVEC: {// SHUFFLEVEC: [opval,ty,opval,opval] 1922 unsigned OpNum = 0; 1923 Value *Vec1, *Vec2, *Mask; 1924 if (getValueTypePair(Record, OpNum, NextValueNo, Vec1) || 1925 getValue(Record, OpNum, Vec1->getType(), Vec2)) 1926 return Error("Invalid SHUFFLEVEC record"); 1927 1928 if (getValueTypePair(Record, OpNum, NextValueNo, Mask)) 1929 return Error("Invalid SHUFFLEVEC record"); 1930 I = new ShuffleVectorInst(Vec1, Vec2, Mask); 1931 InstructionList.push_back(I); 1932 break; 1933 } 1934 1935 case bitc::FUNC_CODE_INST_CMP: // CMP: [opty, opval, opval, pred] 1936 // Old form of ICmp/FCmp returning bool 1937 // Existed to differentiate between icmp/fcmp and vicmp/vfcmp which were 1938 // both legal on vectors but had different behaviour. 1939 case bitc::FUNC_CODE_INST_CMP2: { // CMP2: [opty, opval, opval, pred] 1940 // FCmp/ICmp returning bool or vector of bool 1941 1942 unsigned OpNum = 0; 1943 Value *LHS, *RHS; 1944 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) || 1945 getValue(Record, OpNum, LHS->getType(), RHS) || 1946 OpNum+1 != Record.size()) 1947 return Error("Invalid CMP record"); 1948 1949 if (LHS->getType()->isFPOrFPVectorTy()) 1950 I = new FCmpInst((FCmpInst::Predicate)Record[OpNum], LHS, RHS); 1951 else 1952 I = new ICmpInst((ICmpInst::Predicate)Record[OpNum], LHS, RHS); 1953 InstructionList.push_back(I); 1954 break; 1955 } 1956 1957 case bitc::FUNC_CODE_INST_GETRESULT: { // GETRESULT: [ty, val, n] 1958 if (Record.size() != 2) 1959 return Error("Invalid GETRESULT record"); 1960 unsigned OpNum = 0; 1961 Value *Op; 1962 getValueTypePair(Record, OpNum, NextValueNo, Op); 1963 unsigned Index = Record[1]; 1964 I = ExtractValueInst::Create(Op, Index); 1965 InstructionList.push_back(I); 1966 break; 1967 } 1968 1969 case bitc::FUNC_CODE_INST_RET: // RET: [opty,opval<optional>] 1970 { 1971 unsigned Size = Record.size(); 1972 if (Size == 0) { 1973 I = ReturnInst::Create(Context); 1974 InstructionList.push_back(I); 1975 break; 1976 } 1977 1978 unsigned OpNum = 0; 1979 SmallVector<Value *,4> Vs; 1980 do { 1981 Value *Op = NULL; 1982 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 1983 return Error("Invalid RET record"); 1984 Vs.push_back(Op); 1985 } while(OpNum != Record.size()); 1986 1987 const Type *ReturnType = F->getReturnType(); 1988 if (Vs.size() > 1 || 1989 (ReturnType->isStructTy() && 1990 (Vs.empty() || Vs[0]->getType() != ReturnType))) { 1991 Value *RV = UndefValue::get(ReturnType); 1992 for (unsigned i = 0, e = Vs.size(); i != e; ++i) { 1993 I = InsertValueInst::Create(RV, Vs[i], i, "mrv"); 1994 InstructionList.push_back(I); 1995 CurBB->getInstList().push_back(I); 1996 ValueList.AssignValue(I, NextValueNo++); 1997 RV = I; 1998 } 1999 I = ReturnInst::Create(Context, RV); 2000 InstructionList.push_back(I); 2001 break; 2002 } 2003 2004 I = ReturnInst::Create(Context, Vs[0]); 2005 InstructionList.push_back(I); 2006 break; 2007 } 2008 case bitc::FUNC_CODE_INST_BR: { // BR: [bb#, bb#, opval] or [bb#] 2009 if (Record.size() != 1 && Record.size() != 3) 2010 return Error("Invalid BR record"); 2011 BasicBlock *TrueDest = getBasicBlock(Record[0]); 2012 if (TrueDest == 0) 2013 return Error("Invalid BR record"); 2014 2015 if (Record.size() == 1) { 2016 I = BranchInst::Create(TrueDest); 2017 InstructionList.push_back(I); 2018 } 2019 else { 2020 BasicBlock *FalseDest = getBasicBlock(Record[1]); 2021 Value *Cond = getFnValueByID(Record[2], Type::getInt1Ty(Context)); 2022 if (FalseDest == 0 || Cond == 0) 2023 return Error("Invalid BR record"); 2024 I = BranchInst::Create(TrueDest, FalseDest, Cond); 2025 InstructionList.push_back(I); 2026 } 2027 break; 2028 } 2029 case bitc::FUNC_CODE_INST_SWITCH: { // SWITCH: [opty, op0, op1, ...] 2030 if (Record.size() < 3 || (Record.size() & 1) == 0) 2031 return Error("Invalid SWITCH record"); 2032 const Type *OpTy = getTypeByID(Record[0]); 2033 Value *Cond = getFnValueByID(Record[1], OpTy); 2034 BasicBlock *Default = getBasicBlock(Record[2]); 2035 if (OpTy == 0 || Cond == 0 || Default == 0) 2036 return Error("Invalid SWITCH record"); 2037 unsigned NumCases = (Record.size()-3)/2; 2038 SwitchInst *SI = SwitchInst::Create(Cond, Default, NumCases); 2039 InstructionList.push_back(SI); 2040 for (unsigned i = 0, e = NumCases; i != e; ++i) { 2041 ConstantInt *CaseVal = 2042 dyn_cast_or_null<ConstantInt>(getFnValueByID(Record[3+i*2], OpTy)); 2043 BasicBlock *DestBB = getBasicBlock(Record[1+3+i*2]); 2044 if (CaseVal == 0 || DestBB == 0) { 2045 delete SI; 2046 return Error("Invalid SWITCH record!"); 2047 } 2048 SI->addCase(CaseVal, DestBB); 2049 } 2050 I = SI; 2051 break; 2052 } 2053 case bitc::FUNC_CODE_INST_INDIRECTBR: { // INDIRECTBR: [opty, op0, op1, ...] 2054 if (Record.size() < 2) 2055 return Error("Invalid INDIRECTBR record"); 2056 const Type *OpTy = getTypeByID(Record[0]); 2057 Value *Address = getFnValueByID(Record[1], OpTy); 2058 if (OpTy == 0 || Address == 0) 2059 return Error("Invalid INDIRECTBR record"); 2060 unsigned NumDests = Record.size()-2; 2061 IndirectBrInst *IBI = IndirectBrInst::Create(Address, NumDests); 2062 InstructionList.push_back(IBI); 2063 for (unsigned i = 0, e = NumDests; i != e; ++i) { 2064 if (BasicBlock *DestBB = getBasicBlock(Record[2+i])) { 2065 IBI->addDestination(DestBB); 2066 } else { 2067 delete IBI; 2068 return Error("Invalid INDIRECTBR record!"); 2069 } 2070 } 2071 I = IBI; 2072 break; 2073 } 2074 2075 case bitc::FUNC_CODE_INST_INVOKE: { 2076 // INVOKE: [attrs, cc, normBB, unwindBB, fnty, op0,op1,op2, ...] 2077 if (Record.size() < 4) return Error("Invalid INVOKE record"); 2078 AttrListPtr PAL = getAttributes(Record[0]); 2079 unsigned CCInfo = Record[1]; 2080 BasicBlock *NormalBB = getBasicBlock(Record[2]); 2081 BasicBlock *UnwindBB = getBasicBlock(Record[3]); 2082 2083 unsigned OpNum = 4; 2084 Value *Callee; 2085 if (getValueTypePair(Record, OpNum, NextValueNo, Callee)) 2086 return Error("Invalid INVOKE record"); 2087 2088 const PointerType *CalleeTy = dyn_cast<PointerType>(Callee->getType()); 2089 const FunctionType *FTy = !CalleeTy ? 0 : 2090 dyn_cast<FunctionType>(CalleeTy->getElementType()); 2091 2092 // Check that the right number of fixed parameters are here. 2093 if (FTy == 0 || NormalBB == 0 || UnwindBB == 0 || 2094 Record.size() < OpNum+FTy->getNumParams()) 2095 return Error("Invalid INVOKE record"); 2096 2097 SmallVector<Value*, 16> Ops; 2098 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i, ++OpNum) { 2099 Ops.push_back(getFnValueByID(Record[OpNum], FTy->getParamType(i))); 2100 if (Ops.back() == 0) return Error("Invalid INVOKE record"); 2101 } 2102 2103 if (!FTy->isVarArg()) { 2104 if (Record.size() != OpNum) 2105 return Error("Invalid INVOKE record"); 2106 } else { 2107 // Read type/value pairs for varargs params. 2108 while (OpNum != Record.size()) { 2109 Value *Op; 2110 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 2111 return Error("Invalid INVOKE record"); 2112 Ops.push_back(Op); 2113 } 2114 } 2115 2116 I = InvokeInst::Create(Callee, NormalBB, UnwindBB, 2117 Ops.begin(), Ops.end()); 2118 InstructionList.push_back(I); 2119 cast<InvokeInst>(I)->setCallingConv( 2120 static_cast<CallingConv::ID>(CCInfo)); 2121 cast<InvokeInst>(I)->setAttributes(PAL); 2122 break; 2123 } 2124 case bitc::FUNC_CODE_INST_UNWIND: // UNWIND 2125 I = new UnwindInst(Context); 2126 InstructionList.push_back(I); 2127 break; 2128 case bitc::FUNC_CODE_INST_UNREACHABLE: // UNREACHABLE 2129 I = new UnreachableInst(Context); 2130 InstructionList.push_back(I); 2131 break; 2132 case bitc::FUNC_CODE_INST_PHI: { // PHI: [ty, val0,bb0, ...] 2133 if (Record.size() < 1 || ((Record.size()-1)&1)) 2134 return Error("Invalid PHI record"); 2135 const Type *Ty = getTypeByID(Record[0]); 2136 if (!Ty) return Error("Invalid PHI record"); 2137 2138 PHINode *PN = PHINode::Create(Ty); 2139 InstructionList.push_back(PN); 2140 PN->reserveOperandSpace((Record.size()-1)/2); 2141 2142 for (unsigned i = 0, e = Record.size()-1; i != e; i += 2) { 2143 Value *V = getFnValueByID(Record[1+i], Ty); 2144 BasicBlock *BB = getBasicBlock(Record[2+i]); 2145 if (!V || !BB) return Error("Invalid PHI record"); 2146 PN->addIncoming(V, BB); 2147 } 2148 I = PN; 2149 break; 2150 } 2151 2152 case bitc::FUNC_CODE_INST_MALLOC: { // MALLOC: [instty, op, align] 2153 // Autoupgrade malloc instruction to malloc call. 2154 // FIXME: Remove in LLVM 3.0. 2155 if (Record.size() < 3) 2156 return Error("Invalid MALLOC record"); 2157 const PointerType *Ty = 2158 dyn_cast_or_null<PointerType>(getTypeByID(Record[0])); 2159 Value *Size = getFnValueByID(Record[1], Type::getInt32Ty(Context)); 2160 if (!Ty || !Size) return Error("Invalid MALLOC record"); 2161 if (!CurBB) return Error("Invalid malloc instruction with no BB"); 2162 const Type *Int32Ty = IntegerType::getInt32Ty(CurBB->getContext()); 2163 Constant *AllocSize = ConstantExpr::getSizeOf(Ty->getElementType()); 2164 AllocSize = ConstantExpr::getTruncOrBitCast(AllocSize, Int32Ty); 2165 I = CallInst::CreateMalloc(CurBB, Int32Ty, Ty->getElementType(), 2166 AllocSize, Size, NULL); 2167 InstructionList.push_back(I); 2168 break; 2169 } 2170 case bitc::FUNC_CODE_INST_FREE: { // FREE: [op, opty] 2171 unsigned OpNum = 0; 2172 Value *Op; 2173 if (getValueTypePair(Record, OpNum, NextValueNo, Op) || 2174 OpNum != Record.size()) 2175 return Error("Invalid FREE record"); 2176 if (!CurBB) return Error("Invalid free instruction with no BB"); 2177 I = CallInst::CreateFree(Op, CurBB); 2178 InstructionList.push_back(I); 2179 break; 2180 } 2181 case bitc::FUNC_CODE_INST_ALLOCA: { // ALLOCA: [instty, op, align] 2182 if (Record.size() < 3) 2183 return Error("Invalid ALLOCA record"); 2184 const PointerType *Ty = 2185 dyn_cast_or_null<PointerType>(getTypeByID(Record[0])); 2186 Value *Size = getFnValueByID(Record[1], Type::getInt32Ty(Context)); 2187 unsigned Align = Record[2]; 2188 if (!Ty || !Size) return Error("Invalid ALLOCA record"); 2189 I = new AllocaInst(Ty->getElementType(), Size, (1 << Align) >> 1); 2190 InstructionList.push_back(I); 2191 break; 2192 } 2193 case bitc::FUNC_CODE_INST_LOAD: { // LOAD: [opty, op, align, vol] 2194 unsigned OpNum = 0; 2195 Value *Op; 2196 if (getValueTypePair(Record, OpNum, NextValueNo, Op) || 2197 OpNum+2 != Record.size()) 2198 return Error("Invalid LOAD record"); 2199 2200 I = new LoadInst(Op, "", Record[OpNum+1], (1 << Record[OpNum]) >> 1); 2201 InstructionList.push_back(I); 2202 break; 2203 } 2204 case bitc::FUNC_CODE_INST_STORE2: { // STORE2:[ptrty, ptr, val, align, vol] 2205 unsigned OpNum = 0; 2206 Value *Val, *Ptr; 2207 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) || 2208 getValue(Record, OpNum, 2209 cast<PointerType>(Ptr->getType())->getElementType(), Val) || 2210 OpNum+2 != Record.size()) 2211 return Error("Invalid STORE record"); 2212 2213 I = new StoreInst(Val, Ptr, Record[OpNum+1], (1 << Record[OpNum]) >> 1); 2214 InstructionList.push_back(I); 2215 break; 2216 } 2217 case bitc::FUNC_CODE_INST_STORE: { // STORE:[val, valty, ptr, align, vol] 2218 // FIXME: Legacy form of store instruction. Should be removed in LLVM 3.0. 2219 unsigned OpNum = 0; 2220 Value *Val, *Ptr; 2221 if (getValueTypePair(Record, OpNum, NextValueNo, Val) || 2222 getValue(Record, OpNum, 2223 PointerType::getUnqual(Val->getType()), Ptr)|| 2224 OpNum+2 != Record.size()) 2225 return Error("Invalid STORE record"); 2226 2227 I = new StoreInst(Val, Ptr, Record[OpNum+1], (1 << Record[OpNum]) >> 1); 2228 InstructionList.push_back(I); 2229 break; 2230 } 2231 case bitc::FUNC_CODE_INST_CALL: { 2232 // CALL: [paramattrs, cc, fnty, fnid, arg0, arg1...] 2233 if (Record.size() < 3) 2234 return Error("Invalid CALL record"); 2235 2236 AttrListPtr PAL = getAttributes(Record[0]); 2237 unsigned CCInfo = Record[1]; 2238 2239 unsigned OpNum = 2; 2240 Value *Callee; 2241 if (getValueTypePair(Record, OpNum, NextValueNo, Callee)) 2242 return Error("Invalid CALL record"); 2243 2244 const PointerType *OpTy = dyn_cast<PointerType>(Callee->getType()); 2245 const FunctionType *FTy = 0; 2246 if (OpTy) FTy = dyn_cast<FunctionType>(OpTy->getElementType()); 2247 if (!FTy || Record.size() < FTy->getNumParams()+OpNum) 2248 return Error("Invalid CALL record"); 2249 2250 SmallVector<Value*, 16> Args; 2251 // Read the fixed params. 2252 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i, ++OpNum) { 2253 if (FTy->getParamType(i)->getTypeID()==Type::LabelTyID) 2254 Args.push_back(getBasicBlock(Record[OpNum])); 2255 else 2256 Args.push_back(getFnValueByID(Record[OpNum], FTy->getParamType(i))); 2257 if (Args.back() == 0) return Error("Invalid CALL record"); 2258 } 2259 2260 // Read type/value pairs for varargs params. 2261 if (!FTy->isVarArg()) { 2262 if (OpNum != Record.size()) 2263 return Error("Invalid CALL record"); 2264 } else { 2265 while (OpNum != Record.size()) { 2266 Value *Op; 2267 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 2268 return Error("Invalid CALL record"); 2269 Args.push_back(Op); 2270 } 2271 } 2272 2273 I = CallInst::Create(Callee, Args.begin(), Args.end()); 2274 InstructionList.push_back(I); 2275 cast<CallInst>(I)->setCallingConv( 2276 static_cast<CallingConv::ID>(CCInfo>>1)); 2277 cast<CallInst>(I)->setTailCall(CCInfo & 1); 2278 cast<CallInst>(I)->setAttributes(PAL); 2279 break; 2280 } 2281 case bitc::FUNC_CODE_INST_VAARG: { // VAARG: [valistty, valist, instty] 2282 if (Record.size() < 3) 2283 return Error("Invalid VAARG record"); 2284 const Type *OpTy = getTypeByID(Record[0]); 2285 Value *Op = getFnValueByID(Record[1], OpTy); 2286 const Type *ResTy = getTypeByID(Record[2]); 2287 if (!OpTy || !Op || !ResTy) 2288 return Error("Invalid VAARG record"); 2289 I = new VAArgInst(Op, ResTy); 2290 InstructionList.push_back(I); 2291 break; 2292 } 2293 } 2294 2295 // Add instruction to end of current BB. If there is no current BB, reject 2296 // this file. 2297 if (CurBB == 0) { 2298 delete I; 2299 return Error("Invalid instruction with no BB"); 2300 } 2301 CurBB->getInstList().push_back(I); 2302 2303 // If this was a terminator instruction, move to the next block. 2304 if (isa<TerminatorInst>(I)) { 2305 ++CurBBNo; 2306 CurBB = CurBBNo < FunctionBBs.size() ? FunctionBBs[CurBBNo] : 0; 2307 } 2308 2309 // Non-void values get registered in the value table for future use. 2310 if (I && !I->getType()->isVoidTy()) 2311 ValueList.AssignValue(I, NextValueNo++); 2312 } 2313 2314 // Check the function list for unresolved values. 2315 if (Argument *A = dyn_cast<Argument>(ValueList.back())) { 2316 if (A->getParent() == 0) { 2317 // We found at least one unresolved value. Nuke them all to avoid leaks. 2318 for (unsigned i = ModuleValueListSize, e = ValueList.size(); i != e; ++i){ 2319 if ((A = dyn_cast<Argument>(ValueList.back())) && A->getParent() == 0) { 2320 A->replaceAllUsesWith(UndefValue::get(A->getType())); 2321 delete A; 2322 } 2323 } 2324 return Error("Never resolved value found in function!"); 2325 } 2326 } 2327 2328 // See if anything took the address of blocks in this function. If so, 2329 // resolve them now. 2330 DenseMap<Function*, std::vector<BlockAddrRefTy> >::iterator BAFRI = 2331 BlockAddrFwdRefs.find(F); 2332 if (BAFRI != BlockAddrFwdRefs.end()) { 2333 std::vector<BlockAddrRefTy> &RefList = BAFRI->second; 2334 for (unsigned i = 0, e = RefList.size(); i != e; ++i) { 2335 unsigned BlockIdx = RefList[i].first; 2336 if (BlockIdx >= FunctionBBs.size()) 2337 return Error("Invalid blockaddress block #"); 2338 2339 GlobalVariable *FwdRef = RefList[i].second; 2340 FwdRef->replaceAllUsesWith(BlockAddress::get(F, FunctionBBs[BlockIdx])); 2341 FwdRef->eraseFromParent(); 2342 } 2343 2344 BlockAddrFwdRefs.erase(BAFRI); 2345 } 2346 2347 // Trim the value list down to the size it was before we parsed this function. 2348 ValueList.shrinkTo(ModuleValueListSize); 2349 std::vector<BasicBlock*>().swap(FunctionBBs); 2350 2351 return false; 2352} 2353 2354//===----------------------------------------------------------------------===// 2355// GVMaterializer implementation 2356//===----------------------------------------------------------------------===// 2357 2358 2359bool BitcodeReader::isMaterializable(const GlobalValue *GV) const { 2360 if (const Function *F = dyn_cast<Function>(GV)) { 2361 return F->isDeclaration() && 2362 DeferredFunctionInfo.count(const_cast<Function*>(F)); 2363 } 2364 return false; 2365} 2366 2367bool BitcodeReader::Materialize(GlobalValue *GV, std::string *ErrInfo) { 2368 Function *F = dyn_cast<Function>(GV); 2369 // If it's not a function or is already material, ignore the request. 2370 if (!F || !F->isMaterializable()) return false; 2371 2372 DenseMap<Function*, uint64_t>::iterator DFII = DeferredFunctionInfo.find(F); 2373 assert(DFII != DeferredFunctionInfo.end() && "Deferred function not found!"); 2374 2375 // Move the bit stream to the saved position of the deferred function body. 2376 Stream.JumpToBit(DFII->second); 2377 2378 if (ParseFunctionBody(F)) { 2379 if (ErrInfo) *ErrInfo = ErrorString; 2380 return true; 2381 } 2382 2383 // Upgrade any old intrinsic calls in the function. 2384 for (UpgradedIntrinsicMap::iterator I = UpgradedIntrinsics.begin(), 2385 E = UpgradedIntrinsics.end(); I != E; ++I) { 2386 if (I->first != I->second) { 2387 for (Value::use_iterator UI = I->first->use_begin(), 2388 UE = I->first->use_end(); UI != UE; ) { 2389 if (CallInst* CI = dyn_cast<CallInst>(*UI++)) 2390 UpgradeIntrinsicCall(CI, I->second); 2391 } 2392 } 2393 } 2394 2395 return false; 2396} 2397 2398bool BitcodeReader::isDematerializable(const GlobalValue *GV) const { 2399 const Function *F = dyn_cast<Function>(GV); 2400 if (!F || F->isDeclaration()) 2401 return false; 2402 return DeferredFunctionInfo.count(const_cast<Function*>(F)); 2403} 2404 2405void BitcodeReader::Dematerialize(GlobalValue *GV) { 2406 Function *F = dyn_cast<Function>(GV); 2407 // If this function isn't dematerializable, this is a noop. 2408 if (!F || !isDematerializable(F)) 2409 return; 2410 2411 assert(DeferredFunctionInfo.count(F) && "No info to read function later?"); 2412 2413 // Just forget the function body, we can remat it later. 2414 F->deleteBody(); 2415} 2416 2417 2418bool BitcodeReader::MaterializeModule(Module *M, std::string *ErrInfo) { 2419 assert(M == TheModule && 2420 "Can only Materialize the Module this BitcodeReader is attached to."); 2421 // Iterate over the module, deserializing any functions that are still on 2422 // disk. 2423 for (Module::iterator F = TheModule->begin(), E = TheModule->end(); 2424 F != E; ++F) 2425 if (F->isMaterializable() && 2426 Materialize(F, ErrInfo)) 2427 return true; 2428 2429 // Upgrade any intrinsic calls that slipped through (should not happen!) and 2430 // delete the old functions to clean up. We can't do this unless the entire 2431 // module is materialized because there could always be another function body 2432 // with calls to the old function. 2433 for (std::vector<std::pair<Function*, Function*> >::iterator I = 2434 UpgradedIntrinsics.begin(), E = UpgradedIntrinsics.end(); I != E; ++I) { 2435 if (I->first != I->second) { 2436 for (Value::use_iterator UI = I->first->use_begin(), 2437 UE = I->first->use_end(); UI != UE; ) { 2438 if (CallInst* CI = dyn_cast<CallInst>(*UI++)) 2439 UpgradeIntrinsicCall(CI, I->second); 2440 } 2441 if (!I->first->use_empty()) 2442 I->first->replaceAllUsesWith(I->second); 2443 I->first->eraseFromParent(); 2444 } 2445 } 2446 std::vector<std::pair<Function*, Function*> >().swap(UpgradedIntrinsics); 2447 2448 // Check debug info intrinsics. 2449 CheckDebugInfoIntrinsics(TheModule); 2450 2451 return false; 2452} 2453 2454 2455//===----------------------------------------------------------------------===// 2456// External interface 2457//===----------------------------------------------------------------------===// 2458 2459/// getLazyBitcodeModule - lazy function-at-a-time loading from a file. 2460/// 2461Module *llvm::getLazyBitcodeModule(MemoryBuffer *Buffer, 2462 LLVMContext& Context, 2463 std::string *ErrMsg) { 2464 Module *M = new Module(Buffer->getBufferIdentifier(), Context); 2465 BitcodeReader *R = new BitcodeReader(Buffer, Context); 2466 M->setMaterializer(R); 2467 if (R->ParseBitcodeInto(M)) { 2468 if (ErrMsg) 2469 *ErrMsg = R->getErrorString(); 2470 2471 delete M; // Also deletes R. 2472 return 0; 2473 } 2474 // Have the BitcodeReader dtor delete 'Buffer'. 2475 R->setBufferOwned(true); 2476 return M; 2477} 2478 2479/// ParseBitcodeFile - Read the specified bitcode file, returning the module. 2480/// If an error occurs, return null and fill in *ErrMsg if non-null. 2481Module *llvm::ParseBitcodeFile(MemoryBuffer *Buffer, LLVMContext& Context, 2482 std::string *ErrMsg){ 2483 Module *M = getLazyBitcodeModule(Buffer, Context, ErrMsg); 2484 if (!M) return 0; 2485 2486 // Don't let the BitcodeReader dtor delete 'Buffer', regardless of whether 2487 // there was an error. 2488 static_cast<BitcodeReader*>(M->getMaterializer())->setBufferOwned(false); 2489 2490 // Read in the entire module, and destroy the BitcodeReader. 2491 if (M->MaterializeAllPermanently(ErrMsg)) { 2492 delete M; 2493 return NULL; 2494 } 2495 return M; 2496} 2497