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