BitcodeReader.cpp revision 495d10ad56d1113ba33e0589e7c4f96f3c16fa52
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/DataStream.h" 26#include "llvm/Support/MathExtras.h" 27#include "llvm/Support/MemoryBuffer.h" 28#include "llvm/OperandTraits.h" 29using namespace llvm; 30 31enum { 32 SWITCH_INST_MAGIC = 0x4B5 // May 2012 => 1205 => Hex 33}; 34 35void BitcodeReader::materializeForwardReferencedFunctions() { 36 while (!BlockAddrFwdRefs.empty()) { 37 Function *F = BlockAddrFwdRefs.begin()->first; 38 F->Materialize(); 39 } 40} 41 42void BitcodeReader::FreeState() { 43 if (BufferOwned) 44 delete Buffer; 45 Buffer = 0; 46 std::vector<Type*>().swap(TypeList); 47 ValueList.clear(); 48 MDValueList.clear(); 49 50 std::vector<AttrListPtr>().swap(MAttributes); 51 std::vector<BasicBlock*>().swap(FunctionBBs); 52 std::vector<Function*>().swap(FunctionsWithBodies); 53 DeferredFunctionInfo.clear(); 54 MDKindMap.clear(); 55 56 assert(BlockAddrFwdRefs.empty() && "Unresolved blockaddress fwd references"); 57} 58 59//===----------------------------------------------------------------------===// 60// Helper functions to implement forward reference resolution, etc. 61//===----------------------------------------------------------------------===// 62 63/// ConvertToString - Convert a string from a record into an std::string, return 64/// true on failure. 65template<typename StrTy> 66static bool ConvertToString(ArrayRef<uint64_t> Record, unsigned Idx, 67 StrTy &Result) { 68 if (Idx > Record.size()) 69 return true; 70 71 for (unsigned i = Idx, e = Record.size(); i != e; ++i) 72 Result += (char)Record[i]; 73 return false; 74} 75 76static GlobalValue::LinkageTypes GetDecodedLinkage(unsigned Val) { 77 switch (Val) { 78 default: // Map unknown/new linkages to external 79 case 0: return GlobalValue::ExternalLinkage; 80 case 1: return GlobalValue::WeakAnyLinkage; 81 case 2: return GlobalValue::AppendingLinkage; 82 case 3: return GlobalValue::InternalLinkage; 83 case 4: return GlobalValue::LinkOnceAnyLinkage; 84 case 5: return GlobalValue::DLLImportLinkage; 85 case 6: return GlobalValue::DLLExportLinkage; 86 case 7: return GlobalValue::ExternalWeakLinkage; 87 case 8: return GlobalValue::CommonLinkage; 88 case 9: return GlobalValue::PrivateLinkage; 89 case 10: return GlobalValue::WeakODRLinkage; 90 case 11: return GlobalValue::LinkOnceODRLinkage; 91 case 12: return GlobalValue::AvailableExternallyLinkage; 92 case 13: return GlobalValue::LinkerPrivateLinkage; 93 case 14: return GlobalValue::LinkerPrivateWeakLinkage; 94 case 15: return GlobalValue::LinkOnceODRAutoHideLinkage; 95 } 96} 97 98static GlobalValue::VisibilityTypes GetDecodedVisibility(unsigned Val) { 99 switch (Val) { 100 default: // Map unknown visibilities to default. 101 case 0: return GlobalValue::DefaultVisibility; 102 case 1: return GlobalValue::HiddenVisibility; 103 case 2: return GlobalValue::ProtectedVisibility; 104 } 105} 106 107static GlobalVariable::ThreadLocalMode GetDecodedThreadLocalMode(unsigned Val) { 108 switch (Val) { 109 case 0: return GlobalVariable::NotThreadLocal; 110 default: // Map unknown non-zero value to general dynamic. 111 case 1: return GlobalVariable::GeneralDynamicTLSModel; 112 case 2: return GlobalVariable::LocalDynamicTLSModel; 113 case 3: return GlobalVariable::InitialExecTLSModel; 114 case 4: return GlobalVariable::LocalExecTLSModel; 115 } 116} 117 118static int GetDecodedCastOpcode(unsigned Val) { 119 switch (Val) { 120 default: return -1; 121 case bitc::CAST_TRUNC : return Instruction::Trunc; 122 case bitc::CAST_ZEXT : return Instruction::ZExt; 123 case bitc::CAST_SEXT : return Instruction::SExt; 124 case bitc::CAST_FPTOUI : return Instruction::FPToUI; 125 case bitc::CAST_FPTOSI : return Instruction::FPToSI; 126 case bitc::CAST_UITOFP : return Instruction::UIToFP; 127 case bitc::CAST_SITOFP : return Instruction::SIToFP; 128 case bitc::CAST_FPTRUNC : return Instruction::FPTrunc; 129 case bitc::CAST_FPEXT : return Instruction::FPExt; 130 case bitc::CAST_PTRTOINT: return Instruction::PtrToInt; 131 case bitc::CAST_INTTOPTR: return Instruction::IntToPtr; 132 case bitc::CAST_BITCAST : return Instruction::BitCast; 133 } 134} 135static int GetDecodedBinaryOpcode(unsigned Val, Type *Ty) { 136 switch (Val) { 137 default: return -1; 138 case bitc::BINOP_ADD: 139 return Ty->isFPOrFPVectorTy() ? Instruction::FAdd : Instruction::Add; 140 case bitc::BINOP_SUB: 141 return Ty->isFPOrFPVectorTy() ? Instruction::FSub : Instruction::Sub; 142 case bitc::BINOP_MUL: 143 return Ty->isFPOrFPVectorTy() ? Instruction::FMul : Instruction::Mul; 144 case bitc::BINOP_UDIV: return Instruction::UDiv; 145 case bitc::BINOP_SDIV: 146 return Ty->isFPOrFPVectorTy() ? Instruction::FDiv : Instruction::SDiv; 147 case bitc::BINOP_UREM: return Instruction::URem; 148 case bitc::BINOP_SREM: 149 return Ty->isFPOrFPVectorTy() ? Instruction::FRem : Instruction::SRem; 150 case bitc::BINOP_SHL: return Instruction::Shl; 151 case bitc::BINOP_LSHR: return Instruction::LShr; 152 case bitc::BINOP_ASHR: return Instruction::AShr; 153 case bitc::BINOP_AND: return Instruction::And; 154 case bitc::BINOP_OR: return Instruction::Or; 155 case bitc::BINOP_XOR: return Instruction::Xor; 156 } 157} 158 159static AtomicRMWInst::BinOp GetDecodedRMWOperation(unsigned Val) { 160 switch (Val) { 161 default: return AtomicRMWInst::BAD_BINOP; 162 case bitc::RMW_XCHG: return AtomicRMWInst::Xchg; 163 case bitc::RMW_ADD: return AtomicRMWInst::Add; 164 case bitc::RMW_SUB: return AtomicRMWInst::Sub; 165 case bitc::RMW_AND: return AtomicRMWInst::And; 166 case bitc::RMW_NAND: return AtomicRMWInst::Nand; 167 case bitc::RMW_OR: return AtomicRMWInst::Or; 168 case bitc::RMW_XOR: return AtomicRMWInst::Xor; 169 case bitc::RMW_MAX: return AtomicRMWInst::Max; 170 case bitc::RMW_MIN: return AtomicRMWInst::Min; 171 case bitc::RMW_UMAX: return AtomicRMWInst::UMax; 172 case bitc::RMW_UMIN: return AtomicRMWInst::UMin; 173 } 174} 175 176static AtomicOrdering GetDecodedOrdering(unsigned Val) { 177 switch (Val) { 178 case bitc::ORDERING_NOTATOMIC: return NotAtomic; 179 case bitc::ORDERING_UNORDERED: return Unordered; 180 case bitc::ORDERING_MONOTONIC: return Monotonic; 181 case bitc::ORDERING_ACQUIRE: return Acquire; 182 case bitc::ORDERING_RELEASE: return Release; 183 case bitc::ORDERING_ACQREL: return AcquireRelease; 184 default: // Map unknown orderings to sequentially-consistent. 185 case bitc::ORDERING_SEQCST: return SequentiallyConsistent; 186 } 187} 188 189static SynchronizationScope GetDecodedSynchScope(unsigned Val) { 190 switch (Val) { 191 case bitc::SYNCHSCOPE_SINGLETHREAD: return SingleThread; 192 default: // Map unknown scopes to cross-thread. 193 case bitc::SYNCHSCOPE_CROSSTHREAD: return CrossThread; 194 } 195} 196 197namespace llvm { 198namespace { 199 /// @brief A class for maintaining the slot number definition 200 /// as a placeholder for the actual definition for forward constants defs. 201 class ConstantPlaceHolder : public ConstantExpr { 202 void operator=(const ConstantPlaceHolder &) LLVM_DELETED_FUNCTION; 203 public: 204 // allocate space for exactly one operand 205 void *operator new(size_t s) { 206 return User::operator new(s, 1); 207 } 208 explicit ConstantPlaceHolder(Type *Ty, LLVMContext& Context) 209 : ConstantExpr(Ty, Instruction::UserOp1, &Op<0>(), 1) { 210 Op<0>() = UndefValue::get(Type::getInt32Ty(Context)); 211 } 212 213 /// @brief Methods to support type inquiry through isa, cast, and dyn_cast. 214 static bool classof(const Value *V) { 215 return isa<ConstantExpr>(V) && 216 cast<ConstantExpr>(V)->getOpcode() == Instruction::UserOp1; 217 } 218 219 220 /// Provide fast operand accessors 221 //DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value); 222 }; 223} 224 225// FIXME: can we inherit this from ConstantExpr? 226template <> 227struct OperandTraits<ConstantPlaceHolder> : 228 public FixedNumOperandTraits<ConstantPlaceHolder, 1> { 229}; 230} 231 232 233void BitcodeReaderValueList::AssignValue(Value *V, unsigned Idx) { 234 if (Idx == size()) { 235 push_back(V); 236 return; 237 } 238 239 if (Idx >= size()) 240 resize(Idx+1); 241 242 WeakVH &OldV = ValuePtrs[Idx]; 243 if (OldV == 0) { 244 OldV = V; 245 return; 246 } 247 248 // Handle constants and non-constants (e.g. instrs) differently for 249 // efficiency. 250 if (Constant *PHC = dyn_cast<Constant>(&*OldV)) { 251 ResolveConstants.push_back(std::make_pair(PHC, Idx)); 252 OldV = V; 253 } else { 254 // If there was a forward reference to this value, replace it. 255 Value *PrevVal = OldV; 256 OldV->replaceAllUsesWith(V); 257 delete PrevVal; 258 } 259} 260 261 262Constant *BitcodeReaderValueList::getConstantFwdRef(unsigned Idx, 263 Type *Ty) { 264 if (Idx >= size()) 265 resize(Idx + 1); 266 267 if (Value *V = ValuePtrs[Idx]) { 268 assert(Ty == V->getType() && "Type mismatch in constant table!"); 269 return cast<Constant>(V); 270 } 271 272 // Create and return a placeholder, which will later be RAUW'd. 273 Constant *C = new ConstantPlaceHolder(Ty, Context); 274 ValuePtrs[Idx] = C; 275 return C; 276} 277 278Value *BitcodeReaderValueList::getValueFwdRef(unsigned Idx, Type *Ty) { 279 if (Idx >= size()) 280 resize(Idx + 1); 281 282 if (Value *V = ValuePtrs[Idx]) { 283 assert((Ty == 0 || Ty == V->getType()) && "Type mismatch in value table!"); 284 return V; 285 } 286 287 // No type specified, must be invalid reference. 288 if (Ty == 0) return 0; 289 290 // Create and return a placeholder, which will later be RAUW'd. 291 Value *V = new Argument(Ty); 292 ValuePtrs[Idx] = V; 293 return V; 294} 295 296/// ResolveConstantForwardRefs - Once all constants are read, this method bulk 297/// resolves any forward references. The idea behind this is that we sometimes 298/// get constants (such as large arrays) which reference *many* forward ref 299/// constants. Replacing each of these causes a lot of thrashing when 300/// building/reuniquing the constant. Instead of doing this, we look at all the 301/// uses and rewrite all the place holders at once for any constant that uses 302/// a placeholder. 303void BitcodeReaderValueList::ResolveConstantForwardRefs() { 304 // Sort the values by-pointer so that they are efficient to look up with a 305 // binary search. 306 std::sort(ResolveConstants.begin(), ResolveConstants.end()); 307 308 SmallVector<Constant*, 64> NewOps; 309 310 while (!ResolveConstants.empty()) { 311 Value *RealVal = operator[](ResolveConstants.back().second); 312 Constant *Placeholder = ResolveConstants.back().first; 313 ResolveConstants.pop_back(); 314 315 // Loop over all users of the placeholder, updating them to reference the 316 // new value. If they reference more than one placeholder, update them all 317 // at once. 318 while (!Placeholder->use_empty()) { 319 Value::use_iterator UI = Placeholder->use_begin(); 320 User *U = *UI; 321 322 // If the using object isn't uniqued, just update the operands. This 323 // handles instructions and initializers for global variables. 324 if (!isa<Constant>(U) || isa<GlobalValue>(U)) { 325 UI.getUse().set(RealVal); 326 continue; 327 } 328 329 // Otherwise, we have a constant that uses the placeholder. Replace that 330 // constant with a new constant that has *all* placeholder uses updated. 331 Constant *UserC = cast<Constant>(U); 332 for (User::op_iterator I = UserC->op_begin(), E = UserC->op_end(); 333 I != E; ++I) { 334 Value *NewOp; 335 if (!isa<ConstantPlaceHolder>(*I)) { 336 // Not a placeholder reference. 337 NewOp = *I; 338 } else if (*I == Placeholder) { 339 // Common case is that it just references this one placeholder. 340 NewOp = RealVal; 341 } else { 342 // Otherwise, look up the placeholder in ResolveConstants. 343 ResolveConstantsTy::iterator It = 344 std::lower_bound(ResolveConstants.begin(), ResolveConstants.end(), 345 std::pair<Constant*, unsigned>(cast<Constant>(*I), 346 0)); 347 assert(It != ResolveConstants.end() && It->first == *I); 348 NewOp = operator[](It->second); 349 } 350 351 NewOps.push_back(cast<Constant>(NewOp)); 352 } 353 354 // Make the new constant. 355 Constant *NewC; 356 if (ConstantArray *UserCA = dyn_cast<ConstantArray>(UserC)) { 357 NewC = ConstantArray::get(UserCA->getType(), NewOps); 358 } else if (ConstantStruct *UserCS = dyn_cast<ConstantStruct>(UserC)) { 359 NewC = ConstantStruct::get(UserCS->getType(), NewOps); 360 } else if (isa<ConstantVector>(UserC)) { 361 NewC = ConstantVector::get(NewOps); 362 } else { 363 assert(isa<ConstantExpr>(UserC) && "Must be a ConstantExpr."); 364 NewC = cast<ConstantExpr>(UserC)->getWithOperands(NewOps); 365 } 366 367 UserC->replaceAllUsesWith(NewC); 368 UserC->destroyConstant(); 369 NewOps.clear(); 370 } 371 372 // Update all ValueHandles, they should be the only users at this point. 373 Placeholder->replaceAllUsesWith(RealVal); 374 delete Placeholder; 375 } 376} 377 378void BitcodeReaderMDValueList::AssignValue(Value *V, unsigned Idx) { 379 if (Idx == size()) { 380 push_back(V); 381 return; 382 } 383 384 if (Idx >= size()) 385 resize(Idx+1); 386 387 WeakVH &OldV = MDValuePtrs[Idx]; 388 if (OldV == 0) { 389 OldV = V; 390 return; 391 } 392 393 // If there was a forward reference to this value, replace it. 394 MDNode *PrevVal = cast<MDNode>(OldV); 395 OldV->replaceAllUsesWith(V); 396 MDNode::deleteTemporary(PrevVal); 397 // Deleting PrevVal sets Idx value in MDValuePtrs to null. Set new 398 // value for Idx. 399 MDValuePtrs[Idx] = V; 400} 401 402Value *BitcodeReaderMDValueList::getValueFwdRef(unsigned Idx) { 403 if (Idx >= size()) 404 resize(Idx + 1); 405 406 if (Value *V = MDValuePtrs[Idx]) { 407 assert(V->getType()->isMetadataTy() && "Type mismatch in value table!"); 408 return V; 409 } 410 411 // Create and return a placeholder, which will later be RAUW'd. 412 Value *V = MDNode::getTemporary(Context, ArrayRef<Value*>()); 413 MDValuePtrs[Idx] = V; 414 return V; 415} 416 417Type *BitcodeReader::getTypeByID(unsigned ID) { 418 // The type table size is always specified correctly. 419 if (ID >= TypeList.size()) 420 return 0; 421 422 if (Type *Ty = TypeList[ID]) 423 return Ty; 424 425 // If we have a forward reference, the only possible case is when it is to a 426 // named struct. Just create a placeholder for now. 427 return TypeList[ID] = StructType::create(Context); 428} 429 430 431//===----------------------------------------------------------------------===// 432// Functions for parsing blocks from the bitcode file 433//===----------------------------------------------------------------------===// 434 435bool BitcodeReader::ParseAttributeBlock() { 436 if (Stream.EnterSubBlock(bitc::PARAMATTR_BLOCK_ID)) 437 return Error("Malformed block record"); 438 439 if (!MAttributes.empty()) 440 return Error("Multiple PARAMATTR blocks found!"); 441 442 SmallVector<uint64_t, 64> Record; 443 444 SmallVector<AttributeWithIndex, 8> Attrs; 445 446 // Read all the records. 447 while (1) { 448 unsigned Code = Stream.ReadCode(); 449 if (Code == bitc::END_BLOCK) { 450 if (Stream.ReadBlockEnd()) 451 return Error("Error at end of PARAMATTR block"); 452 return false; 453 } 454 455 if (Code == bitc::ENTER_SUBBLOCK) { 456 // No known subblocks, always skip them. 457 Stream.ReadSubBlockID(); 458 if (Stream.SkipBlock()) 459 return Error("Malformed block record"); 460 continue; 461 } 462 463 if (Code == bitc::DEFINE_ABBREV) { 464 Stream.ReadAbbrevRecord(); 465 continue; 466 } 467 468 // Read a record. 469 Record.clear(); 470 switch (Stream.ReadRecord(Code, Record)) { 471 default: // Default behavior: ignore. 472 break; 473 case bitc::PARAMATTR_CODE_ENTRY: { // ENTRY: [paramidx0, attr0, ...] 474 if (Record.size() & 1) 475 return Error("Invalid ENTRY record"); 476 477 for (unsigned i = 0, e = Record.size(); i != e; i += 2) { 478 Attributes ReconstitutedAttr = 479 Attributes::decodeLLVMAttributesForBitcode(Context, Record[i+1]); 480 Record[i+1] = ReconstitutedAttr.Raw(); 481 } 482 483 for (unsigned i = 0, e = Record.size(); i != e; i += 2) { 484 AttrBuilder B(Record[i+1]); 485 if (B.hasAttributes()) 486 Attrs.push_back(AttributeWithIndex::get(Record[i], 487 Attributes::get(Context, B))); 488 } 489 490 MAttributes.push_back(AttrListPtr::get(Context, Attrs)); 491 Attrs.clear(); 492 break; 493 } 494 } 495 } 496} 497 498bool BitcodeReader::ParseTypeTable() { 499 if (Stream.EnterSubBlock(bitc::TYPE_BLOCK_ID_NEW)) 500 return Error("Malformed block record"); 501 502 return ParseTypeTableBody(); 503} 504 505bool BitcodeReader::ParseTypeTableBody() { 506 if (!TypeList.empty()) 507 return Error("Multiple TYPE_BLOCKs found!"); 508 509 SmallVector<uint64_t, 64> Record; 510 unsigned NumRecords = 0; 511 512 SmallString<64> TypeName; 513 514 // Read all the records for this type table. 515 while (1) { 516 unsigned Code = Stream.ReadCode(); 517 if (Code == bitc::END_BLOCK) { 518 if (NumRecords != TypeList.size()) 519 return Error("Invalid type forward reference in TYPE_BLOCK"); 520 if (Stream.ReadBlockEnd()) 521 return Error("Error at end of type table block"); 522 return false; 523 } 524 525 if (Code == bitc::ENTER_SUBBLOCK) { 526 // No known subblocks, always skip them. 527 Stream.ReadSubBlockID(); 528 if (Stream.SkipBlock()) 529 return Error("Malformed block record"); 530 continue; 531 } 532 533 if (Code == bitc::DEFINE_ABBREV) { 534 Stream.ReadAbbrevRecord(); 535 continue; 536 } 537 538 // Read a record. 539 Record.clear(); 540 Type *ResultTy = 0; 541 switch (Stream.ReadRecord(Code, Record)) { 542 default: return Error("unknown type in type table"); 543 case bitc::TYPE_CODE_NUMENTRY: // TYPE_CODE_NUMENTRY: [numentries] 544 // TYPE_CODE_NUMENTRY contains a count of the number of types in the 545 // type list. This allows us to reserve space. 546 if (Record.size() < 1) 547 return Error("Invalid TYPE_CODE_NUMENTRY record"); 548 TypeList.resize(Record[0]); 549 continue; 550 case bitc::TYPE_CODE_VOID: // VOID 551 ResultTy = Type::getVoidTy(Context); 552 break; 553 case bitc::TYPE_CODE_HALF: // HALF 554 ResultTy = Type::getHalfTy(Context); 555 break; 556 case bitc::TYPE_CODE_FLOAT: // FLOAT 557 ResultTy = Type::getFloatTy(Context); 558 break; 559 case bitc::TYPE_CODE_DOUBLE: // DOUBLE 560 ResultTy = Type::getDoubleTy(Context); 561 break; 562 case bitc::TYPE_CODE_X86_FP80: // X86_FP80 563 ResultTy = Type::getX86_FP80Ty(Context); 564 break; 565 case bitc::TYPE_CODE_FP128: // FP128 566 ResultTy = Type::getFP128Ty(Context); 567 break; 568 case bitc::TYPE_CODE_PPC_FP128: // PPC_FP128 569 ResultTy = Type::getPPC_FP128Ty(Context); 570 break; 571 case bitc::TYPE_CODE_LABEL: // LABEL 572 ResultTy = Type::getLabelTy(Context); 573 break; 574 case bitc::TYPE_CODE_METADATA: // METADATA 575 ResultTy = Type::getMetadataTy(Context); 576 break; 577 case bitc::TYPE_CODE_X86_MMX: // X86_MMX 578 ResultTy = Type::getX86_MMXTy(Context); 579 break; 580 case bitc::TYPE_CODE_INTEGER: // INTEGER: [width] 581 if (Record.size() < 1) 582 return Error("Invalid Integer type record"); 583 584 ResultTy = IntegerType::get(Context, Record[0]); 585 break; 586 case bitc::TYPE_CODE_POINTER: { // POINTER: [pointee type] or 587 // [pointee type, address space] 588 if (Record.size() < 1) 589 return Error("Invalid POINTER type record"); 590 unsigned AddressSpace = 0; 591 if (Record.size() == 2) 592 AddressSpace = Record[1]; 593 ResultTy = getTypeByID(Record[0]); 594 if (ResultTy == 0) return Error("invalid element type in pointer type"); 595 ResultTy = PointerType::get(ResultTy, AddressSpace); 596 break; 597 } 598 case bitc::TYPE_CODE_FUNCTION_OLD: { 599 // FIXME: attrid is dead, remove it in LLVM 4.0 600 // FUNCTION: [vararg, attrid, retty, paramty x N] 601 if (Record.size() < 3) 602 return Error("Invalid FUNCTION type record"); 603 SmallVector<Type*, 8> ArgTys; 604 for (unsigned i = 3, e = Record.size(); i != e; ++i) { 605 if (Type *T = getTypeByID(Record[i])) 606 ArgTys.push_back(T); 607 else 608 break; 609 } 610 611 ResultTy = getTypeByID(Record[2]); 612 if (ResultTy == 0 || ArgTys.size() < Record.size()-3) 613 return Error("invalid type in function type"); 614 615 ResultTy = FunctionType::get(ResultTy, ArgTys, Record[0]); 616 break; 617 } 618 case bitc::TYPE_CODE_FUNCTION: { 619 // FUNCTION: [vararg, retty, paramty x N] 620 if (Record.size() < 2) 621 return Error("Invalid FUNCTION type record"); 622 SmallVector<Type*, 8> ArgTys; 623 for (unsigned i = 2, e = Record.size(); i != e; ++i) { 624 if (Type *T = getTypeByID(Record[i])) 625 ArgTys.push_back(T); 626 else 627 break; 628 } 629 630 ResultTy = getTypeByID(Record[1]); 631 if (ResultTy == 0 || ArgTys.size() < Record.size()-2) 632 return Error("invalid type in function type"); 633 634 ResultTy = FunctionType::get(ResultTy, ArgTys, Record[0]); 635 break; 636 } 637 case bitc::TYPE_CODE_STRUCT_ANON: { // STRUCT: [ispacked, eltty x N] 638 if (Record.size() < 1) 639 return Error("Invalid STRUCT type record"); 640 SmallVector<Type*, 8> EltTys; 641 for (unsigned i = 1, e = Record.size(); i != e; ++i) { 642 if (Type *T = getTypeByID(Record[i])) 643 EltTys.push_back(T); 644 else 645 break; 646 } 647 if (EltTys.size() != Record.size()-1) 648 return Error("invalid type in struct type"); 649 ResultTy = StructType::get(Context, EltTys, Record[0]); 650 break; 651 } 652 case bitc::TYPE_CODE_STRUCT_NAME: // STRUCT_NAME: [strchr x N] 653 if (ConvertToString(Record, 0, TypeName)) 654 return Error("Invalid STRUCT_NAME record"); 655 continue; 656 657 case bitc::TYPE_CODE_STRUCT_NAMED: { // STRUCT: [ispacked, eltty x N] 658 if (Record.size() < 1) 659 return Error("Invalid STRUCT type record"); 660 661 if (NumRecords >= TypeList.size()) 662 return Error("invalid TYPE table"); 663 664 // Check to see if this was forward referenced, if so fill in the temp. 665 StructType *Res = cast_or_null<StructType>(TypeList[NumRecords]); 666 if (Res) { 667 Res->setName(TypeName); 668 TypeList[NumRecords] = 0; 669 } else // Otherwise, create a new struct. 670 Res = StructType::create(Context, TypeName); 671 TypeName.clear(); 672 673 SmallVector<Type*, 8> EltTys; 674 for (unsigned i = 1, e = Record.size(); i != e; ++i) { 675 if (Type *T = getTypeByID(Record[i])) 676 EltTys.push_back(T); 677 else 678 break; 679 } 680 if (EltTys.size() != Record.size()-1) 681 return Error("invalid STRUCT type record"); 682 Res->setBody(EltTys, Record[0]); 683 ResultTy = Res; 684 break; 685 } 686 case bitc::TYPE_CODE_OPAQUE: { // OPAQUE: [] 687 if (Record.size() != 1) 688 return Error("Invalid OPAQUE type record"); 689 690 if (NumRecords >= TypeList.size()) 691 return Error("invalid TYPE table"); 692 693 // Check to see if this was forward referenced, if so fill in the temp. 694 StructType *Res = cast_or_null<StructType>(TypeList[NumRecords]); 695 if (Res) { 696 Res->setName(TypeName); 697 TypeList[NumRecords] = 0; 698 } else // Otherwise, create a new struct with no body. 699 Res = StructType::create(Context, TypeName); 700 TypeName.clear(); 701 ResultTy = Res; 702 break; 703 } 704 case bitc::TYPE_CODE_ARRAY: // ARRAY: [numelts, eltty] 705 if (Record.size() < 2) 706 return Error("Invalid ARRAY type record"); 707 if ((ResultTy = getTypeByID(Record[1]))) 708 ResultTy = ArrayType::get(ResultTy, Record[0]); 709 else 710 return Error("Invalid ARRAY type element"); 711 break; 712 case bitc::TYPE_CODE_VECTOR: // VECTOR: [numelts, eltty] 713 if (Record.size() < 2) 714 return Error("Invalid VECTOR type record"); 715 if ((ResultTy = getTypeByID(Record[1]))) 716 ResultTy = VectorType::get(ResultTy, Record[0]); 717 else 718 return Error("Invalid ARRAY type element"); 719 break; 720 } 721 722 if (NumRecords >= TypeList.size()) 723 return Error("invalid TYPE table"); 724 assert(ResultTy && "Didn't read a type?"); 725 assert(TypeList[NumRecords] == 0 && "Already read type?"); 726 TypeList[NumRecords++] = ResultTy; 727 } 728} 729 730bool BitcodeReader::ParseValueSymbolTable() { 731 if (Stream.EnterSubBlock(bitc::VALUE_SYMTAB_BLOCK_ID)) 732 return Error("Malformed block record"); 733 734 SmallVector<uint64_t, 64> Record; 735 736 // Read all the records for this value table. 737 SmallString<128> ValueName; 738 while (1) { 739 unsigned Code = Stream.ReadCode(); 740 if (Code == bitc::END_BLOCK) { 741 if (Stream.ReadBlockEnd()) 742 return Error("Error at end of value symbol table block"); 743 return false; 744 } 745 if (Code == bitc::ENTER_SUBBLOCK) { 746 // No known subblocks, always skip them. 747 Stream.ReadSubBlockID(); 748 if (Stream.SkipBlock()) 749 return Error("Malformed block record"); 750 continue; 751 } 752 753 if (Code == bitc::DEFINE_ABBREV) { 754 Stream.ReadAbbrevRecord(); 755 continue; 756 } 757 758 // Read a record. 759 Record.clear(); 760 switch (Stream.ReadRecord(Code, Record)) { 761 default: // Default behavior: unknown type. 762 break; 763 case bitc::VST_CODE_ENTRY: { // VST_ENTRY: [valueid, namechar x N] 764 if (ConvertToString(Record, 1, ValueName)) 765 return Error("Invalid VST_ENTRY record"); 766 unsigned ValueID = Record[0]; 767 if (ValueID >= ValueList.size()) 768 return Error("Invalid Value ID in VST_ENTRY record"); 769 Value *V = ValueList[ValueID]; 770 771 V->setName(StringRef(ValueName.data(), ValueName.size())); 772 ValueName.clear(); 773 break; 774 } 775 case bitc::VST_CODE_BBENTRY: { 776 if (ConvertToString(Record, 1, ValueName)) 777 return Error("Invalid VST_BBENTRY record"); 778 BasicBlock *BB = getBasicBlock(Record[0]); 779 if (BB == 0) 780 return Error("Invalid BB ID in VST_BBENTRY record"); 781 782 BB->setName(StringRef(ValueName.data(), ValueName.size())); 783 ValueName.clear(); 784 break; 785 } 786 } 787 } 788} 789 790bool BitcodeReader::ParseMetadata() { 791 unsigned NextMDValueNo = MDValueList.size(); 792 793 if (Stream.EnterSubBlock(bitc::METADATA_BLOCK_ID)) 794 return Error("Malformed block record"); 795 796 SmallVector<uint64_t, 64> Record; 797 798 // Read all the records. 799 while (1) { 800 unsigned Code = Stream.ReadCode(); 801 if (Code == bitc::END_BLOCK) { 802 if (Stream.ReadBlockEnd()) 803 return Error("Error at end of PARAMATTR block"); 804 return false; 805 } 806 807 if (Code == bitc::ENTER_SUBBLOCK) { 808 // No known subblocks, always skip them. 809 Stream.ReadSubBlockID(); 810 if (Stream.SkipBlock()) 811 return Error("Malformed block record"); 812 continue; 813 } 814 815 if (Code == bitc::DEFINE_ABBREV) { 816 Stream.ReadAbbrevRecord(); 817 continue; 818 } 819 820 bool IsFunctionLocal = false; 821 // Read a record. 822 Record.clear(); 823 Code = Stream.ReadRecord(Code, Record); 824 switch (Code) { 825 default: // Default behavior: ignore. 826 break; 827 case bitc::METADATA_NAME: { 828 // Read named of the named metadata. 829 SmallString<8> Name(Record.begin(), Record.end()); 830 Record.clear(); 831 Code = Stream.ReadCode(); 832 833 // METADATA_NAME is always followed by METADATA_NAMED_NODE. 834 unsigned NextBitCode = Stream.ReadRecord(Code, Record); 835 assert(NextBitCode == bitc::METADATA_NAMED_NODE); (void)NextBitCode; 836 837 // Read named metadata elements. 838 unsigned Size = Record.size(); 839 NamedMDNode *NMD = TheModule->getOrInsertNamedMetadata(Name); 840 for (unsigned i = 0; i != Size; ++i) { 841 MDNode *MD = dyn_cast<MDNode>(MDValueList.getValueFwdRef(Record[i])); 842 if (MD == 0) 843 return Error("Malformed metadata record"); 844 NMD->addOperand(MD); 845 } 846 break; 847 } 848 case bitc::METADATA_FN_NODE: 849 IsFunctionLocal = true; 850 // fall-through 851 case bitc::METADATA_NODE: { 852 if (Record.size() % 2 == 1) 853 return Error("Invalid METADATA_NODE record"); 854 855 unsigned Size = Record.size(); 856 SmallVector<Value*, 8> Elts; 857 for (unsigned i = 0; i != Size; i += 2) { 858 Type *Ty = getTypeByID(Record[i]); 859 if (!Ty) return Error("Invalid METADATA_NODE record"); 860 if (Ty->isMetadataTy()) 861 Elts.push_back(MDValueList.getValueFwdRef(Record[i+1])); 862 else if (!Ty->isVoidTy()) 863 Elts.push_back(ValueList.getValueFwdRef(Record[i+1], Ty)); 864 else 865 Elts.push_back(NULL); 866 } 867 Value *V = MDNode::getWhenValsUnresolved(Context, Elts, IsFunctionLocal); 868 IsFunctionLocal = false; 869 MDValueList.AssignValue(V, NextMDValueNo++); 870 break; 871 } 872 case bitc::METADATA_STRING: { 873 SmallString<8> String(Record.begin(), Record.end()); 874 Value *V = MDString::get(Context, String); 875 MDValueList.AssignValue(V, NextMDValueNo++); 876 break; 877 } 878 case bitc::METADATA_KIND: { 879 if (Record.size() < 2) 880 return Error("Invalid METADATA_KIND record"); 881 882 unsigned Kind = Record[0]; 883 SmallString<8> Name(Record.begin()+1, Record.end()); 884 885 unsigned NewKind = TheModule->getMDKindID(Name.str()); 886 if (!MDKindMap.insert(std::make_pair(Kind, NewKind)).second) 887 return Error("Conflicting METADATA_KIND records"); 888 break; 889 } 890 } 891 } 892} 893 894/// decodeSignRotatedValue - Decode a signed value stored with the sign bit in 895/// the LSB for dense VBR encoding. 896uint64_t BitcodeReader::decodeSignRotatedValue(uint64_t V) { 897 if ((V & 1) == 0) 898 return V >> 1; 899 if (V != 1) 900 return -(V >> 1); 901 // There is no such thing as -0 with integers. "-0" really means MININT. 902 return 1ULL << 63; 903} 904 905/// ResolveGlobalAndAliasInits - Resolve all of the initializers for global 906/// values and aliases that we can. 907bool BitcodeReader::ResolveGlobalAndAliasInits() { 908 std::vector<std::pair<GlobalVariable*, unsigned> > GlobalInitWorklist; 909 std::vector<std::pair<GlobalAlias*, unsigned> > AliasInitWorklist; 910 911 GlobalInitWorklist.swap(GlobalInits); 912 AliasInitWorklist.swap(AliasInits); 913 914 while (!GlobalInitWorklist.empty()) { 915 unsigned ValID = GlobalInitWorklist.back().second; 916 if (ValID >= ValueList.size()) { 917 // Not ready to resolve this yet, it requires something later in the file. 918 GlobalInits.push_back(GlobalInitWorklist.back()); 919 } else { 920 if (Constant *C = dyn_cast<Constant>(ValueList[ValID])) 921 GlobalInitWorklist.back().first->setInitializer(C); 922 else 923 return Error("Global variable initializer is not a constant!"); 924 } 925 GlobalInitWorklist.pop_back(); 926 } 927 928 while (!AliasInitWorklist.empty()) { 929 unsigned ValID = AliasInitWorklist.back().second; 930 if (ValID >= ValueList.size()) { 931 AliasInits.push_back(AliasInitWorklist.back()); 932 } else { 933 if (Constant *C = dyn_cast<Constant>(ValueList[ValID])) 934 AliasInitWorklist.back().first->setAliasee(C); 935 else 936 return Error("Alias initializer is not a constant!"); 937 } 938 AliasInitWorklist.pop_back(); 939 } 940 return false; 941} 942 943static APInt ReadWideAPInt(ArrayRef<uint64_t> Vals, unsigned TypeBits) { 944 SmallVector<uint64_t, 8> Words(Vals.size()); 945 std::transform(Vals.begin(), Vals.end(), Words.begin(), 946 BitcodeReader::decodeSignRotatedValue); 947 948 return APInt(TypeBits, Words); 949} 950 951bool BitcodeReader::ParseConstants() { 952 if (Stream.EnterSubBlock(bitc::CONSTANTS_BLOCK_ID)) 953 return Error("Malformed block record"); 954 955 SmallVector<uint64_t, 64> Record; 956 957 // Read all the records for this value table. 958 Type *CurTy = Type::getInt32Ty(Context); 959 unsigned NextCstNo = ValueList.size(); 960 while (1) { 961 unsigned Code = Stream.ReadCode(); 962 if (Code == bitc::END_BLOCK) 963 break; 964 965 if (Code == bitc::ENTER_SUBBLOCK) { 966 // No known subblocks, always skip them. 967 Stream.ReadSubBlockID(); 968 if (Stream.SkipBlock()) 969 return Error("Malformed block record"); 970 continue; 971 } 972 973 if (Code == bitc::DEFINE_ABBREV) { 974 Stream.ReadAbbrevRecord(); 975 continue; 976 } 977 978 // Read a record. 979 Record.clear(); 980 Value *V = 0; 981 unsigned BitCode = Stream.ReadRecord(Code, Record); 982 switch (BitCode) { 983 default: // Default behavior: unknown constant 984 case bitc::CST_CODE_UNDEF: // UNDEF 985 V = UndefValue::get(CurTy); 986 break; 987 case bitc::CST_CODE_SETTYPE: // SETTYPE: [typeid] 988 if (Record.empty()) 989 return Error("Malformed CST_SETTYPE record"); 990 if (Record[0] >= TypeList.size()) 991 return Error("Invalid Type ID in CST_SETTYPE record"); 992 CurTy = TypeList[Record[0]]; 993 continue; // Skip the ValueList manipulation. 994 case bitc::CST_CODE_NULL: // NULL 995 V = Constant::getNullValue(CurTy); 996 break; 997 case bitc::CST_CODE_INTEGER: // INTEGER: [intval] 998 if (!CurTy->isIntegerTy() || Record.empty()) 999 return Error("Invalid CST_INTEGER record"); 1000 V = ConstantInt::get(CurTy, decodeSignRotatedValue(Record[0])); 1001 break; 1002 case bitc::CST_CODE_WIDE_INTEGER: {// WIDE_INTEGER: [n x intval] 1003 if (!CurTy->isIntegerTy() || Record.empty()) 1004 return Error("Invalid WIDE_INTEGER record"); 1005 1006 APInt VInt = ReadWideAPInt(Record, 1007 cast<IntegerType>(CurTy)->getBitWidth()); 1008 V = ConstantInt::get(Context, VInt); 1009 1010 break; 1011 } 1012 case bitc::CST_CODE_FLOAT: { // FLOAT: [fpval] 1013 if (Record.empty()) 1014 return Error("Invalid FLOAT record"); 1015 if (CurTy->isHalfTy()) 1016 V = ConstantFP::get(Context, APFloat(APInt(16, (uint16_t)Record[0]))); 1017 else if (CurTy->isFloatTy()) 1018 V = ConstantFP::get(Context, APFloat(APInt(32, (uint32_t)Record[0]))); 1019 else if (CurTy->isDoubleTy()) 1020 V = ConstantFP::get(Context, APFloat(APInt(64, Record[0]))); 1021 else if (CurTy->isX86_FP80Ty()) { 1022 // Bits are not stored the same way as a normal i80 APInt, compensate. 1023 uint64_t Rearrange[2]; 1024 Rearrange[0] = (Record[1] & 0xffffLL) | (Record[0] << 16); 1025 Rearrange[1] = Record[0] >> 48; 1026 V = ConstantFP::get(Context, APFloat(APInt(80, Rearrange))); 1027 } else if (CurTy->isFP128Ty()) 1028 V = ConstantFP::get(Context, APFloat(APInt(128, Record), true)); 1029 else if (CurTy->isPPC_FP128Ty()) 1030 V = ConstantFP::get(Context, APFloat(APInt(128, Record))); 1031 else 1032 V = UndefValue::get(CurTy); 1033 break; 1034 } 1035 1036 case bitc::CST_CODE_AGGREGATE: {// AGGREGATE: [n x value number] 1037 if (Record.empty()) 1038 return Error("Invalid CST_AGGREGATE record"); 1039 1040 unsigned Size = Record.size(); 1041 SmallVector<Constant*, 16> Elts; 1042 1043 if (StructType *STy = dyn_cast<StructType>(CurTy)) { 1044 for (unsigned i = 0; i != Size; ++i) 1045 Elts.push_back(ValueList.getConstantFwdRef(Record[i], 1046 STy->getElementType(i))); 1047 V = ConstantStruct::get(STy, Elts); 1048 } else if (ArrayType *ATy = dyn_cast<ArrayType>(CurTy)) { 1049 Type *EltTy = ATy->getElementType(); 1050 for (unsigned i = 0; i != Size; ++i) 1051 Elts.push_back(ValueList.getConstantFwdRef(Record[i], EltTy)); 1052 V = ConstantArray::get(ATy, Elts); 1053 } else if (VectorType *VTy = dyn_cast<VectorType>(CurTy)) { 1054 Type *EltTy = VTy->getElementType(); 1055 for (unsigned i = 0; i != Size; ++i) 1056 Elts.push_back(ValueList.getConstantFwdRef(Record[i], EltTy)); 1057 V = ConstantVector::get(Elts); 1058 } else { 1059 V = UndefValue::get(CurTy); 1060 } 1061 break; 1062 } 1063 case bitc::CST_CODE_STRING: // STRING: [values] 1064 case bitc::CST_CODE_CSTRING: { // CSTRING: [values] 1065 if (Record.empty()) 1066 return Error("Invalid CST_STRING record"); 1067 1068 SmallString<16> Elts(Record.begin(), Record.end()); 1069 V = ConstantDataArray::getString(Context, Elts, 1070 BitCode == bitc::CST_CODE_CSTRING); 1071 break; 1072 } 1073 case bitc::CST_CODE_DATA: {// DATA: [n x value] 1074 if (Record.empty()) 1075 return Error("Invalid CST_DATA record"); 1076 1077 Type *EltTy = cast<SequentialType>(CurTy)->getElementType(); 1078 unsigned Size = Record.size(); 1079 1080 if (EltTy->isIntegerTy(8)) { 1081 SmallVector<uint8_t, 16> Elts(Record.begin(), Record.end()); 1082 if (isa<VectorType>(CurTy)) 1083 V = ConstantDataVector::get(Context, Elts); 1084 else 1085 V = ConstantDataArray::get(Context, Elts); 1086 } else if (EltTy->isIntegerTy(16)) { 1087 SmallVector<uint16_t, 16> Elts(Record.begin(), Record.end()); 1088 if (isa<VectorType>(CurTy)) 1089 V = ConstantDataVector::get(Context, Elts); 1090 else 1091 V = ConstantDataArray::get(Context, Elts); 1092 } else if (EltTy->isIntegerTy(32)) { 1093 SmallVector<uint32_t, 16> Elts(Record.begin(), Record.end()); 1094 if (isa<VectorType>(CurTy)) 1095 V = ConstantDataVector::get(Context, Elts); 1096 else 1097 V = ConstantDataArray::get(Context, Elts); 1098 } else if (EltTy->isIntegerTy(64)) { 1099 SmallVector<uint64_t, 16> Elts(Record.begin(), Record.end()); 1100 if (isa<VectorType>(CurTy)) 1101 V = ConstantDataVector::get(Context, Elts); 1102 else 1103 V = ConstantDataArray::get(Context, Elts); 1104 } else if (EltTy->isFloatTy()) { 1105 SmallVector<float, 16> Elts(Size); 1106 std::transform(Record.begin(), Record.end(), Elts.begin(), BitsToFloat); 1107 if (isa<VectorType>(CurTy)) 1108 V = ConstantDataVector::get(Context, Elts); 1109 else 1110 V = ConstantDataArray::get(Context, Elts); 1111 } else if (EltTy->isDoubleTy()) { 1112 SmallVector<double, 16> Elts(Size); 1113 std::transform(Record.begin(), Record.end(), Elts.begin(), 1114 BitsToDouble); 1115 if (isa<VectorType>(CurTy)) 1116 V = ConstantDataVector::get(Context, Elts); 1117 else 1118 V = ConstantDataArray::get(Context, Elts); 1119 } else { 1120 return Error("Unknown element type in CE_DATA"); 1121 } 1122 break; 1123 } 1124 1125 case bitc::CST_CODE_CE_BINOP: { // CE_BINOP: [opcode, opval, opval] 1126 if (Record.size() < 3) return Error("Invalid CE_BINOP record"); 1127 int Opc = GetDecodedBinaryOpcode(Record[0], CurTy); 1128 if (Opc < 0) { 1129 V = UndefValue::get(CurTy); // Unknown binop. 1130 } else { 1131 Constant *LHS = ValueList.getConstantFwdRef(Record[1], CurTy); 1132 Constant *RHS = ValueList.getConstantFwdRef(Record[2], CurTy); 1133 unsigned Flags = 0; 1134 if (Record.size() >= 4) { 1135 if (Opc == Instruction::Add || 1136 Opc == Instruction::Sub || 1137 Opc == Instruction::Mul || 1138 Opc == Instruction::Shl) { 1139 if (Record[3] & (1 << bitc::OBO_NO_SIGNED_WRAP)) 1140 Flags |= OverflowingBinaryOperator::NoSignedWrap; 1141 if (Record[3] & (1 << bitc::OBO_NO_UNSIGNED_WRAP)) 1142 Flags |= OverflowingBinaryOperator::NoUnsignedWrap; 1143 } else if (Opc == Instruction::SDiv || 1144 Opc == Instruction::UDiv || 1145 Opc == Instruction::LShr || 1146 Opc == Instruction::AShr) { 1147 if (Record[3] & (1 << bitc::PEO_EXACT)) 1148 Flags |= SDivOperator::IsExact; 1149 } 1150 } 1151 V = ConstantExpr::get(Opc, LHS, RHS, Flags); 1152 } 1153 break; 1154 } 1155 case bitc::CST_CODE_CE_CAST: { // CE_CAST: [opcode, opty, opval] 1156 if (Record.size() < 3) return Error("Invalid CE_CAST record"); 1157 int Opc = GetDecodedCastOpcode(Record[0]); 1158 if (Opc < 0) { 1159 V = UndefValue::get(CurTy); // Unknown cast. 1160 } else { 1161 Type *OpTy = getTypeByID(Record[1]); 1162 if (!OpTy) return Error("Invalid CE_CAST record"); 1163 Constant *Op = ValueList.getConstantFwdRef(Record[2], OpTy); 1164 V = ConstantExpr::getCast(Opc, Op, CurTy); 1165 } 1166 break; 1167 } 1168 case bitc::CST_CODE_CE_INBOUNDS_GEP: 1169 case bitc::CST_CODE_CE_GEP: { // CE_GEP: [n x operands] 1170 if (Record.size() & 1) return Error("Invalid CE_GEP record"); 1171 SmallVector<Constant*, 16> Elts; 1172 for (unsigned i = 0, e = Record.size(); i != e; i += 2) { 1173 Type *ElTy = getTypeByID(Record[i]); 1174 if (!ElTy) return Error("Invalid CE_GEP record"); 1175 Elts.push_back(ValueList.getConstantFwdRef(Record[i+1], ElTy)); 1176 } 1177 ArrayRef<Constant *> Indices(Elts.begin() + 1, Elts.end()); 1178 V = ConstantExpr::getGetElementPtr(Elts[0], Indices, 1179 BitCode == 1180 bitc::CST_CODE_CE_INBOUNDS_GEP); 1181 break; 1182 } 1183 case bitc::CST_CODE_CE_SELECT: // CE_SELECT: [opval#, opval#, opval#] 1184 if (Record.size() < 3) return Error("Invalid CE_SELECT record"); 1185 V = ConstantExpr::getSelect( 1186 ValueList.getConstantFwdRef(Record[0], 1187 Type::getInt1Ty(Context)), 1188 ValueList.getConstantFwdRef(Record[1],CurTy), 1189 ValueList.getConstantFwdRef(Record[2],CurTy)); 1190 break; 1191 case bitc::CST_CODE_CE_EXTRACTELT: { // CE_EXTRACTELT: [opty, opval, opval] 1192 if (Record.size() < 3) return Error("Invalid CE_EXTRACTELT record"); 1193 VectorType *OpTy = 1194 dyn_cast_or_null<VectorType>(getTypeByID(Record[0])); 1195 if (OpTy == 0) return Error("Invalid CE_EXTRACTELT record"); 1196 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy); 1197 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], 1198 Type::getInt32Ty(Context)); 1199 V = ConstantExpr::getExtractElement(Op0, Op1); 1200 break; 1201 } 1202 case bitc::CST_CODE_CE_INSERTELT: { // CE_INSERTELT: [opval, opval, opval] 1203 VectorType *OpTy = dyn_cast<VectorType>(CurTy); 1204 if (Record.size() < 3 || OpTy == 0) 1205 return Error("Invalid CE_INSERTELT record"); 1206 Constant *Op0 = ValueList.getConstantFwdRef(Record[0], OpTy); 1207 Constant *Op1 = ValueList.getConstantFwdRef(Record[1], 1208 OpTy->getElementType()); 1209 Constant *Op2 = ValueList.getConstantFwdRef(Record[2], 1210 Type::getInt32Ty(Context)); 1211 V = ConstantExpr::getInsertElement(Op0, Op1, Op2); 1212 break; 1213 } 1214 case bitc::CST_CODE_CE_SHUFFLEVEC: { // CE_SHUFFLEVEC: [opval, opval, opval] 1215 VectorType *OpTy = dyn_cast<VectorType>(CurTy); 1216 if (Record.size() < 3 || OpTy == 0) 1217 return Error("Invalid CE_SHUFFLEVEC record"); 1218 Constant *Op0 = ValueList.getConstantFwdRef(Record[0], OpTy); 1219 Constant *Op1 = ValueList.getConstantFwdRef(Record[1], OpTy); 1220 Type *ShufTy = VectorType::get(Type::getInt32Ty(Context), 1221 OpTy->getNumElements()); 1222 Constant *Op2 = ValueList.getConstantFwdRef(Record[2], ShufTy); 1223 V = ConstantExpr::getShuffleVector(Op0, Op1, Op2); 1224 break; 1225 } 1226 case bitc::CST_CODE_CE_SHUFVEC_EX: { // [opty, opval, opval, opval] 1227 VectorType *RTy = dyn_cast<VectorType>(CurTy); 1228 VectorType *OpTy = 1229 dyn_cast_or_null<VectorType>(getTypeByID(Record[0])); 1230 if (Record.size() < 4 || RTy == 0 || OpTy == 0) 1231 return Error("Invalid CE_SHUFVEC_EX record"); 1232 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy); 1233 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], OpTy); 1234 Type *ShufTy = VectorType::get(Type::getInt32Ty(Context), 1235 RTy->getNumElements()); 1236 Constant *Op2 = ValueList.getConstantFwdRef(Record[3], ShufTy); 1237 V = ConstantExpr::getShuffleVector(Op0, Op1, Op2); 1238 break; 1239 } 1240 case bitc::CST_CODE_CE_CMP: { // CE_CMP: [opty, opval, opval, pred] 1241 if (Record.size() < 4) return Error("Invalid CE_CMP record"); 1242 Type *OpTy = getTypeByID(Record[0]); 1243 if (OpTy == 0) return Error("Invalid CE_CMP record"); 1244 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy); 1245 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], OpTy); 1246 1247 if (OpTy->isFPOrFPVectorTy()) 1248 V = ConstantExpr::getFCmp(Record[3], Op0, Op1); 1249 else 1250 V = ConstantExpr::getICmp(Record[3], Op0, Op1); 1251 break; 1252 } 1253 // This maintains backward compatibility, pre-asm dialect keywords. 1254 // FIXME: Remove with the 4.0 release. 1255 case bitc::CST_CODE_INLINEASM_OLD: { 1256 if (Record.size() < 2) return Error("Invalid INLINEASM record"); 1257 std::string AsmStr, ConstrStr; 1258 bool HasSideEffects = Record[0] & 1; 1259 bool IsAlignStack = Record[0] >> 1; 1260 unsigned AsmStrSize = Record[1]; 1261 if (2+AsmStrSize >= Record.size()) 1262 return Error("Invalid INLINEASM record"); 1263 unsigned ConstStrSize = Record[2+AsmStrSize]; 1264 if (3+AsmStrSize+ConstStrSize > Record.size()) 1265 return Error("Invalid INLINEASM record"); 1266 1267 for (unsigned i = 0; i != AsmStrSize; ++i) 1268 AsmStr += (char)Record[2+i]; 1269 for (unsigned i = 0; i != ConstStrSize; ++i) 1270 ConstrStr += (char)Record[3+AsmStrSize+i]; 1271 PointerType *PTy = cast<PointerType>(CurTy); 1272 V = InlineAsm::get(cast<FunctionType>(PTy->getElementType()), 1273 AsmStr, ConstrStr, HasSideEffects, IsAlignStack); 1274 break; 1275 } 1276 // This version adds support for the asm dialect keywords (e.g., 1277 // inteldialect). 1278 case bitc::CST_CODE_INLINEASM: { 1279 if (Record.size() < 2) return Error("Invalid INLINEASM record"); 1280 std::string AsmStr, ConstrStr; 1281 bool HasSideEffects = Record[0] & 1; 1282 bool IsAlignStack = (Record[0] >> 1) & 1; 1283 unsigned AsmDialect = Record[0] >> 2; 1284 unsigned AsmStrSize = Record[1]; 1285 if (2+AsmStrSize >= Record.size()) 1286 return Error("Invalid INLINEASM record"); 1287 unsigned ConstStrSize = Record[2+AsmStrSize]; 1288 if (3+AsmStrSize+ConstStrSize > Record.size()) 1289 return Error("Invalid INLINEASM record"); 1290 1291 for (unsigned i = 0; i != AsmStrSize; ++i) 1292 AsmStr += (char)Record[2+i]; 1293 for (unsigned i = 0; i != ConstStrSize; ++i) 1294 ConstrStr += (char)Record[3+AsmStrSize+i]; 1295 PointerType *PTy = cast<PointerType>(CurTy); 1296 V = InlineAsm::get(cast<FunctionType>(PTy->getElementType()), 1297 AsmStr, ConstrStr, HasSideEffects, IsAlignStack, 1298 InlineAsm::AsmDialect(AsmDialect)); 1299 break; 1300 } 1301 case bitc::CST_CODE_BLOCKADDRESS:{ 1302 if (Record.size() < 3) return Error("Invalid CE_BLOCKADDRESS record"); 1303 Type *FnTy = getTypeByID(Record[0]); 1304 if (FnTy == 0) return Error("Invalid CE_BLOCKADDRESS record"); 1305 Function *Fn = 1306 dyn_cast_or_null<Function>(ValueList.getConstantFwdRef(Record[1],FnTy)); 1307 if (Fn == 0) return Error("Invalid CE_BLOCKADDRESS record"); 1308 1309 // If the function is already parsed we can insert the block address right 1310 // away. 1311 if (!Fn->empty()) { 1312 Function::iterator BBI = Fn->begin(), BBE = Fn->end(); 1313 for (size_t I = 0, E = Record[2]; I != E; ++I) { 1314 if (BBI == BBE) 1315 return Error("Invalid blockaddress block #"); 1316 ++BBI; 1317 } 1318 V = BlockAddress::get(Fn, BBI); 1319 } else { 1320 // Otherwise insert a placeholder and remember it so it can be inserted 1321 // when the function is parsed. 1322 GlobalVariable *FwdRef = new GlobalVariable(*Fn->getParent(), 1323 Type::getInt8Ty(Context), 1324 false, GlobalValue::InternalLinkage, 1325 0, ""); 1326 BlockAddrFwdRefs[Fn].push_back(std::make_pair(Record[2], FwdRef)); 1327 V = FwdRef; 1328 } 1329 break; 1330 } 1331 } 1332 1333 ValueList.AssignValue(V, NextCstNo); 1334 ++NextCstNo; 1335 } 1336 1337 if (NextCstNo != ValueList.size()) 1338 return Error("Invalid constant reference!"); 1339 1340 if (Stream.ReadBlockEnd()) 1341 return Error("Error at end of constants block"); 1342 1343 // Once all the constants have been read, go through and resolve forward 1344 // references. 1345 ValueList.ResolveConstantForwardRefs(); 1346 return false; 1347} 1348 1349bool BitcodeReader::ParseUseLists() { 1350 if (Stream.EnterSubBlock(bitc::USELIST_BLOCK_ID)) 1351 return Error("Malformed block record"); 1352 1353 SmallVector<uint64_t, 64> Record; 1354 1355 // Read all the records. 1356 while (1) { 1357 unsigned Code = Stream.ReadCode(); 1358 if (Code == bitc::END_BLOCK) { 1359 if (Stream.ReadBlockEnd()) 1360 return Error("Error at end of use-list table block"); 1361 return false; 1362 } 1363 1364 if (Code == bitc::ENTER_SUBBLOCK) { 1365 // No known subblocks, always skip them. 1366 Stream.ReadSubBlockID(); 1367 if (Stream.SkipBlock()) 1368 return Error("Malformed block record"); 1369 continue; 1370 } 1371 1372 if (Code == bitc::DEFINE_ABBREV) { 1373 Stream.ReadAbbrevRecord(); 1374 continue; 1375 } 1376 1377 // Read a use list record. 1378 Record.clear(); 1379 switch (Stream.ReadRecord(Code, Record)) { 1380 default: // Default behavior: unknown type. 1381 break; 1382 case bitc::USELIST_CODE_ENTRY: { // USELIST_CODE_ENTRY: TBD. 1383 unsigned RecordLength = Record.size(); 1384 if (RecordLength < 1) 1385 return Error ("Invalid UseList reader!"); 1386 UseListRecords.push_back(Record); 1387 break; 1388 } 1389 } 1390 } 1391} 1392 1393/// RememberAndSkipFunctionBody - When we see the block for a function body, 1394/// remember where it is and then skip it. This lets us lazily deserialize the 1395/// functions. 1396bool BitcodeReader::RememberAndSkipFunctionBody() { 1397 // Get the function we are talking about. 1398 if (FunctionsWithBodies.empty()) 1399 return Error("Insufficient function protos"); 1400 1401 Function *Fn = FunctionsWithBodies.back(); 1402 FunctionsWithBodies.pop_back(); 1403 1404 // Save the current stream state. 1405 uint64_t CurBit = Stream.GetCurrentBitNo(); 1406 DeferredFunctionInfo[Fn] = CurBit; 1407 1408 // Skip over the function block for now. 1409 if (Stream.SkipBlock()) 1410 return Error("Malformed block record"); 1411 return false; 1412} 1413 1414bool BitcodeReader::GlobalCleanup() { 1415 // Patch the initializers for globals and aliases up. 1416 ResolveGlobalAndAliasInits(); 1417 if (!GlobalInits.empty() || !AliasInits.empty()) 1418 return Error("Malformed global initializer set"); 1419 1420 // Look for intrinsic functions which need to be upgraded at some point 1421 for (Module::iterator FI = TheModule->begin(), FE = TheModule->end(); 1422 FI != FE; ++FI) { 1423 Function *NewFn; 1424 if (UpgradeIntrinsicFunction(FI, NewFn)) 1425 UpgradedIntrinsics.push_back(std::make_pair(FI, NewFn)); 1426 } 1427 1428 // Look for global variables which need to be renamed. 1429 for (Module::global_iterator 1430 GI = TheModule->global_begin(), GE = TheModule->global_end(); 1431 GI != GE; ++GI) 1432 UpgradeGlobalVariable(GI); 1433 // Force deallocation of memory for these vectors to favor the client that 1434 // want lazy deserialization. 1435 std::vector<std::pair<GlobalVariable*, unsigned> >().swap(GlobalInits); 1436 std::vector<std::pair<GlobalAlias*, unsigned> >().swap(AliasInits); 1437 return false; 1438} 1439 1440bool BitcodeReader::ParseModule(bool Resume) { 1441 if (Resume) 1442 Stream.JumpToBit(NextUnreadBit); 1443 else if (Stream.EnterSubBlock(bitc::MODULE_BLOCK_ID)) 1444 return Error("Malformed block record"); 1445 1446 SmallVector<uint64_t, 64> Record; 1447 std::vector<std::string> SectionTable; 1448 std::vector<std::string> GCTable; 1449 1450 // Read all the records for this module. 1451 while (!Stream.AtEndOfStream()) { 1452 unsigned Code = Stream.ReadCode(); 1453 if (Code == bitc::END_BLOCK) { 1454 if (Stream.ReadBlockEnd()) 1455 return Error("Error at end of module block"); 1456 1457 return GlobalCleanup(); 1458 } 1459 1460 if (Code == bitc::ENTER_SUBBLOCK) { 1461 switch (Stream.ReadSubBlockID()) { 1462 default: // Skip unknown content. 1463 if (Stream.SkipBlock()) 1464 return Error("Malformed block record"); 1465 break; 1466 case bitc::BLOCKINFO_BLOCK_ID: 1467 if (Stream.ReadBlockInfoBlock()) 1468 return Error("Malformed BlockInfoBlock"); 1469 break; 1470 case bitc::PARAMATTR_BLOCK_ID: 1471 if (ParseAttributeBlock()) 1472 return true; 1473 break; 1474 case bitc::TYPE_BLOCK_ID_NEW: 1475 if (ParseTypeTable()) 1476 return true; 1477 break; 1478 case bitc::VALUE_SYMTAB_BLOCK_ID: 1479 if (ParseValueSymbolTable()) 1480 return true; 1481 SeenValueSymbolTable = true; 1482 break; 1483 case bitc::CONSTANTS_BLOCK_ID: 1484 if (ParseConstants() || ResolveGlobalAndAliasInits()) 1485 return true; 1486 break; 1487 case bitc::METADATA_BLOCK_ID: 1488 if (ParseMetadata()) 1489 return true; 1490 break; 1491 case bitc::FUNCTION_BLOCK_ID: 1492 // If this is the first function body we've seen, reverse the 1493 // FunctionsWithBodies list. 1494 if (!SeenFirstFunctionBody) { 1495 std::reverse(FunctionsWithBodies.begin(), FunctionsWithBodies.end()); 1496 if (GlobalCleanup()) 1497 return true; 1498 SeenFirstFunctionBody = true; 1499 } 1500 1501 if (RememberAndSkipFunctionBody()) 1502 return true; 1503 // For streaming bitcode, suspend parsing when we reach the function 1504 // bodies. Subsequent materialization calls will resume it when 1505 // necessary. For streaming, the function bodies must be at the end of 1506 // the bitcode. If the bitcode file is old, the symbol table will be 1507 // at the end instead and will not have been seen yet. In this case, 1508 // just finish the parse now. 1509 if (LazyStreamer && SeenValueSymbolTable) { 1510 NextUnreadBit = Stream.GetCurrentBitNo(); 1511 return false; 1512 } 1513 break; 1514 case bitc::USELIST_BLOCK_ID: 1515 if (ParseUseLists()) 1516 return true; 1517 break; 1518 } 1519 continue; 1520 } 1521 1522 if (Code == bitc::DEFINE_ABBREV) { 1523 Stream.ReadAbbrevRecord(); 1524 continue; 1525 } 1526 1527 // Read a record. 1528 switch (Stream.ReadRecord(Code, Record)) { 1529 default: break; // Default behavior, ignore unknown content. 1530 case bitc::MODULE_CODE_VERSION: { // VERSION: [version#] 1531 if (Record.size() < 1) 1532 return Error("Malformed MODULE_CODE_VERSION"); 1533 // Only version #0 and #1 are supported so far. 1534 unsigned module_version = Record[0]; 1535 switch (module_version) { 1536 default: return Error("Unknown bitstream version!"); 1537 case 0: 1538 UseRelativeIDs = false; 1539 break; 1540 case 1: 1541 UseRelativeIDs = true; 1542 break; 1543 } 1544 break; 1545 } 1546 case bitc::MODULE_CODE_TRIPLE: { // TRIPLE: [strchr x N] 1547 std::string S; 1548 if (ConvertToString(Record, 0, S)) 1549 return Error("Invalid MODULE_CODE_TRIPLE record"); 1550 TheModule->setTargetTriple(S); 1551 break; 1552 } 1553 case bitc::MODULE_CODE_DATALAYOUT: { // DATALAYOUT: [strchr x N] 1554 std::string S; 1555 if (ConvertToString(Record, 0, S)) 1556 return Error("Invalid MODULE_CODE_DATALAYOUT record"); 1557 TheModule->setDataLayout(S); 1558 break; 1559 } 1560 case bitc::MODULE_CODE_ASM: { // ASM: [strchr x N] 1561 std::string S; 1562 if (ConvertToString(Record, 0, S)) 1563 return Error("Invalid MODULE_CODE_ASM record"); 1564 TheModule->setModuleInlineAsm(S); 1565 break; 1566 } 1567 case bitc::MODULE_CODE_DEPLIB: { // DEPLIB: [strchr x N] 1568 std::string S; 1569 if (ConvertToString(Record, 0, S)) 1570 return Error("Invalid MODULE_CODE_DEPLIB record"); 1571 TheModule->addLibrary(S); 1572 break; 1573 } 1574 case bitc::MODULE_CODE_SECTIONNAME: { // SECTIONNAME: [strchr x N] 1575 std::string S; 1576 if (ConvertToString(Record, 0, S)) 1577 return Error("Invalid MODULE_CODE_SECTIONNAME record"); 1578 SectionTable.push_back(S); 1579 break; 1580 } 1581 case bitc::MODULE_CODE_GCNAME: { // SECTIONNAME: [strchr x N] 1582 std::string S; 1583 if (ConvertToString(Record, 0, S)) 1584 return Error("Invalid MODULE_CODE_GCNAME record"); 1585 GCTable.push_back(S); 1586 break; 1587 } 1588 // GLOBALVAR: [pointer type, isconst, initid, 1589 // linkage, alignment, section, visibility, threadlocal, 1590 // unnamed_addr] 1591 case bitc::MODULE_CODE_GLOBALVAR: { 1592 if (Record.size() < 6) 1593 return Error("Invalid MODULE_CODE_GLOBALVAR record"); 1594 Type *Ty = getTypeByID(Record[0]); 1595 if (!Ty) return Error("Invalid MODULE_CODE_GLOBALVAR record"); 1596 if (!Ty->isPointerTy()) 1597 return Error("Global not a pointer type!"); 1598 unsigned AddressSpace = cast<PointerType>(Ty)->getAddressSpace(); 1599 Ty = cast<PointerType>(Ty)->getElementType(); 1600 1601 bool isConstant = Record[1]; 1602 GlobalValue::LinkageTypes Linkage = GetDecodedLinkage(Record[3]); 1603 unsigned Alignment = (1 << Record[4]) >> 1; 1604 std::string Section; 1605 if (Record[5]) { 1606 if (Record[5]-1 >= SectionTable.size()) 1607 return Error("Invalid section ID"); 1608 Section = SectionTable[Record[5]-1]; 1609 } 1610 GlobalValue::VisibilityTypes Visibility = GlobalValue::DefaultVisibility; 1611 if (Record.size() > 6) 1612 Visibility = GetDecodedVisibility(Record[6]); 1613 1614 GlobalVariable::ThreadLocalMode TLM = GlobalVariable::NotThreadLocal; 1615 if (Record.size() > 7) 1616 TLM = GetDecodedThreadLocalMode(Record[7]); 1617 1618 bool UnnamedAddr = false; 1619 if (Record.size() > 8) 1620 UnnamedAddr = Record[8]; 1621 1622 GlobalVariable *NewGV = 1623 new GlobalVariable(*TheModule, Ty, isConstant, Linkage, 0, "", 0, 1624 TLM, AddressSpace); 1625 NewGV->setAlignment(Alignment); 1626 if (!Section.empty()) 1627 NewGV->setSection(Section); 1628 NewGV->setVisibility(Visibility); 1629 NewGV->setUnnamedAddr(UnnamedAddr); 1630 1631 ValueList.push_back(NewGV); 1632 1633 // Remember which value to use for the global initializer. 1634 if (unsigned InitID = Record[2]) 1635 GlobalInits.push_back(std::make_pair(NewGV, InitID-1)); 1636 break; 1637 } 1638 // FUNCTION: [type, callingconv, isproto, linkage, paramattr, 1639 // alignment, section, visibility, gc, unnamed_addr] 1640 case bitc::MODULE_CODE_FUNCTION: { 1641 if (Record.size() < 8) 1642 return Error("Invalid MODULE_CODE_FUNCTION record"); 1643 Type *Ty = getTypeByID(Record[0]); 1644 if (!Ty) return Error("Invalid MODULE_CODE_FUNCTION record"); 1645 if (!Ty->isPointerTy()) 1646 return Error("Function not a pointer type!"); 1647 FunctionType *FTy = 1648 dyn_cast<FunctionType>(cast<PointerType>(Ty)->getElementType()); 1649 if (!FTy) 1650 return Error("Function not a pointer to function type!"); 1651 1652 Function *Func = Function::Create(FTy, GlobalValue::ExternalLinkage, 1653 "", TheModule); 1654 1655 Func->setCallingConv(static_cast<CallingConv::ID>(Record[1])); 1656 bool isProto = Record[2]; 1657 Func->setLinkage(GetDecodedLinkage(Record[3])); 1658 Func->setAttributes(getAttributes(Record[4])); 1659 1660 Func->setAlignment((1 << Record[5]) >> 1); 1661 if (Record[6]) { 1662 if (Record[6]-1 >= SectionTable.size()) 1663 return Error("Invalid section ID"); 1664 Func->setSection(SectionTable[Record[6]-1]); 1665 } 1666 Func->setVisibility(GetDecodedVisibility(Record[7])); 1667 if (Record.size() > 8 && Record[8]) { 1668 if (Record[8]-1 > GCTable.size()) 1669 return Error("Invalid GC ID"); 1670 Func->setGC(GCTable[Record[8]-1].c_str()); 1671 } 1672 bool UnnamedAddr = false; 1673 if (Record.size() > 9) 1674 UnnamedAddr = Record[9]; 1675 Func->setUnnamedAddr(UnnamedAddr); 1676 ValueList.push_back(Func); 1677 1678 // If this is a function with a body, remember the prototype we are 1679 // creating now, so that we can match up the body with them later. 1680 if (!isProto) { 1681 FunctionsWithBodies.push_back(Func); 1682 if (LazyStreamer) DeferredFunctionInfo[Func] = 0; 1683 } 1684 break; 1685 } 1686 // ALIAS: [alias type, aliasee val#, linkage] 1687 // ALIAS: [alias type, aliasee val#, linkage, visibility] 1688 case bitc::MODULE_CODE_ALIAS: { 1689 if (Record.size() < 3) 1690 return Error("Invalid MODULE_ALIAS record"); 1691 Type *Ty = getTypeByID(Record[0]); 1692 if (!Ty) return Error("Invalid MODULE_ALIAS record"); 1693 if (!Ty->isPointerTy()) 1694 return Error("Function not a pointer type!"); 1695 1696 GlobalAlias *NewGA = new GlobalAlias(Ty, GetDecodedLinkage(Record[2]), 1697 "", 0, TheModule); 1698 // Old bitcode files didn't have visibility field. 1699 if (Record.size() > 3) 1700 NewGA->setVisibility(GetDecodedVisibility(Record[3])); 1701 ValueList.push_back(NewGA); 1702 AliasInits.push_back(std::make_pair(NewGA, Record[1])); 1703 break; 1704 } 1705 /// MODULE_CODE_PURGEVALS: [numvals] 1706 case bitc::MODULE_CODE_PURGEVALS: 1707 // Trim down the value list to the specified size. 1708 if (Record.size() < 1 || Record[0] > ValueList.size()) 1709 return Error("Invalid MODULE_PURGEVALS record"); 1710 ValueList.shrinkTo(Record[0]); 1711 break; 1712 } 1713 Record.clear(); 1714 } 1715 1716 return Error("Premature end of bitstream"); 1717} 1718 1719bool BitcodeReader::ParseBitcodeInto(Module *M) { 1720 TheModule = 0; 1721 1722 if (InitStream()) return true; 1723 1724 // Sniff for the signature. 1725 if (Stream.Read(8) != 'B' || 1726 Stream.Read(8) != 'C' || 1727 Stream.Read(4) != 0x0 || 1728 Stream.Read(4) != 0xC || 1729 Stream.Read(4) != 0xE || 1730 Stream.Read(4) != 0xD) 1731 return Error("Invalid bitcode signature"); 1732 1733 // We expect a number of well-defined blocks, though we don't necessarily 1734 // need to understand them all. 1735 while (!Stream.AtEndOfStream()) { 1736 unsigned Code = Stream.ReadCode(); 1737 1738 if (Code != bitc::ENTER_SUBBLOCK) { 1739 1740 // The ranlib in xcode 4 will align archive members by appending newlines 1741 // to the end of them. If this file size is a multiple of 4 but not 8, we 1742 // have to read and ignore these final 4 bytes :-( 1743 if (Stream.GetAbbrevIDWidth() == 2 && Code == 2 && 1744 Stream.Read(6) == 2 && Stream.Read(24) == 0xa0a0a && 1745 Stream.AtEndOfStream()) 1746 return false; 1747 1748 return Error("Invalid record at top-level"); 1749 } 1750 1751 unsigned BlockID = Stream.ReadSubBlockID(); 1752 1753 // We only know the MODULE subblock ID. 1754 switch (BlockID) { 1755 case bitc::BLOCKINFO_BLOCK_ID: 1756 if (Stream.ReadBlockInfoBlock()) 1757 return Error("Malformed BlockInfoBlock"); 1758 break; 1759 case bitc::MODULE_BLOCK_ID: 1760 // Reject multiple MODULE_BLOCK's in a single bitstream. 1761 if (TheModule) 1762 return Error("Multiple MODULE_BLOCKs in same stream"); 1763 TheModule = M; 1764 if (ParseModule(false)) 1765 return true; 1766 if (LazyStreamer) return false; 1767 break; 1768 default: 1769 if (Stream.SkipBlock()) 1770 return Error("Malformed block record"); 1771 break; 1772 } 1773 } 1774 1775 return false; 1776} 1777 1778bool BitcodeReader::ParseModuleTriple(std::string &Triple) { 1779 if (Stream.EnterSubBlock(bitc::MODULE_BLOCK_ID)) 1780 return Error("Malformed block record"); 1781 1782 SmallVector<uint64_t, 64> Record; 1783 1784 // Read all the records for this module. 1785 while (!Stream.AtEndOfStream()) { 1786 unsigned Code = Stream.ReadCode(); 1787 if (Code == bitc::END_BLOCK) { 1788 if (Stream.ReadBlockEnd()) 1789 return Error("Error at end of module block"); 1790 1791 return false; 1792 } 1793 1794 if (Code == bitc::ENTER_SUBBLOCK) { 1795 switch (Stream.ReadSubBlockID()) { 1796 default: // Skip unknown content. 1797 if (Stream.SkipBlock()) 1798 return Error("Malformed block record"); 1799 break; 1800 } 1801 continue; 1802 } 1803 1804 if (Code == bitc::DEFINE_ABBREV) { 1805 Stream.ReadAbbrevRecord(); 1806 continue; 1807 } 1808 1809 // Read a record. 1810 switch (Stream.ReadRecord(Code, Record)) { 1811 default: break; // Default behavior, ignore unknown content. 1812 case bitc::MODULE_CODE_TRIPLE: { // TRIPLE: [strchr x N] 1813 std::string S; 1814 if (ConvertToString(Record, 0, S)) 1815 return Error("Invalid MODULE_CODE_TRIPLE record"); 1816 Triple = S; 1817 break; 1818 } 1819 } 1820 Record.clear(); 1821 } 1822 1823 return Error("Premature end of bitstream"); 1824} 1825 1826bool BitcodeReader::ParseTriple(std::string &Triple) { 1827 if (InitStream()) return true; 1828 1829 // Sniff for the signature. 1830 if (Stream.Read(8) != 'B' || 1831 Stream.Read(8) != 'C' || 1832 Stream.Read(4) != 0x0 || 1833 Stream.Read(4) != 0xC || 1834 Stream.Read(4) != 0xE || 1835 Stream.Read(4) != 0xD) 1836 return Error("Invalid bitcode signature"); 1837 1838 // We expect a number of well-defined blocks, though we don't necessarily 1839 // need to understand them all. 1840 while (!Stream.AtEndOfStream()) { 1841 unsigned Code = Stream.ReadCode(); 1842 1843 if (Code != bitc::ENTER_SUBBLOCK) 1844 return Error("Invalid record at top-level"); 1845 1846 unsigned BlockID = Stream.ReadSubBlockID(); 1847 1848 // We only know the MODULE subblock ID. 1849 switch (BlockID) { 1850 case bitc::MODULE_BLOCK_ID: 1851 if (ParseModuleTriple(Triple)) 1852 return true; 1853 break; 1854 default: 1855 if (Stream.SkipBlock()) 1856 return Error("Malformed block record"); 1857 break; 1858 } 1859 } 1860 1861 return false; 1862} 1863 1864/// ParseMetadataAttachment - Parse metadata attachments. 1865bool BitcodeReader::ParseMetadataAttachment() { 1866 if (Stream.EnterSubBlock(bitc::METADATA_ATTACHMENT_ID)) 1867 return Error("Malformed block record"); 1868 1869 SmallVector<uint64_t, 64> Record; 1870 while(1) { 1871 unsigned Code = Stream.ReadCode(); 1872 if (Code == bitc::END_BLOCK) { 1873 if (Stream.ReadBlockEnd()) 1874 return Error("Error at end of PARAMATTR block"); 1875 break; 1876 } 1877 if (Code == bitc::DEFINE_ABBREV) { 1878 Stream.ReadAbbrevRecord(); 1879 continue; 1880 } 1881 // Read a metadata attachment record. 1882 Record.clear(); 1883 switch (Stream.ReadRecord(Code, Record)) { 1884 default: // Default behavior: ignore. 1885 break; 1886 case bitc::METADATA_ATTACHMENT: { 1887 unsigned RecordLength = Record.size(); 1888 if (Record.empty() || (RecordLength - 1) % 2 == 1) 1889 return Error ("Invalid METADATA_ATTACHMENT reader!"); 1890 Instruction *Inst = InstructionList[Record[0]]; 1891 for (unsigned i = 1; i != RecordLength; i = i+2) { 1892 unsigned Kind = Record[i]; 1893 DenseMap<unsigned, unsigned>::iterator I = 1894 MDKindMap.find(Kind); 1895 if (I == MDKindMap.end()) 1896 return Error("Invalid metadata kind ID"); 1897 Value *Node = MDValueList.getValueFwdRef(Record[i+1]); 1898 Inst->setMetadata(I->second, cast<MDNode>(Node)); 1899 } 1900 break; 1901 } 1902 } 1903 } 1904 return false; 1905} 1906 1907/// ParseFunctionBody - Lazily parse the specified function body block. 1908bool BitcodeReader::ParseFunctionBody(Function *F) { 1909 if (Stream.EnterSubBlock(bitc::FUNCTION_BLOCK_ID)) 1910 return Error("Malformed block record"); 1911 1912 InstructionList.clear(); 1913 unsigned ModuleValueListSize = ValueList.size(); 1914 unsigned ModuleMDValueListSize = MDValueList.size(); 1915 1916 // Add all the function arguments to the value table. 1917 for(Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I) 1918 ValueList.push_back(I); 1919 1920 unsigned NextValueNo = ValueList.size(); 1921 BasicBlock *CurBB = 0; 1922 unsigned CurBBNo = 0; 1923 1924 DebugLoc LastLoc; 1925 1926 // Read all the records. 1927 SmallVector<uint64_t, 64> Record; 1928 while (1) { 1929 unsigned Code = Stream.ReadCode(); 1930 if (Code == bitc::END_BLOCK) { 1931 if (Stream.ReadBlockEnd()) 1932 return Error("Error at end of function block"); 1933 break; 1934 } 1935 1936 if (Code == bitc::ENTER_SUBBLOCK) { 1937 switch (Stream.ReadSubBlockID()) { 1938 default: // Skip unknown content. 1939 if (Stream.SkipBlock()) 1940 return Error("Malformed block record"); 1941 break; 1942 case bitc::CONSTANTS_BLOCK_ID: 1943 if (ParseConstants()) return true; 1944 NextValueNo = ValueList.size(); 1945 break; 1946 case bitc::VALUE_SYMTAB_BLOCK_ID: 1947 if (ParseValueSymbolTable()) return true; 1948 break; 1949 case bitc::METADATA_ATTACHMENT_ID: 1950 if (ParseMetadataAttachment()) return true; 1951 break; 1952 case bitc::METADATA_BLOCK_ID: 1953 if (ParseMetadata()) return true; 1954 break; 1955 } 1956 continue; 1957 } 1958 1959 if (Code == bitc::DEFINE_ABBREV) { 1960 Stream.ReadAbbrevRecord(); 1961 continue; 1962 } 1963 1964 // Read a record. 1965 Record.clear(); 1966 Instruction *I = 0; 1967 unsigned BitCode = Stream.ReadRecord(Code, Record); 1968 switch (BitCode) { 1969 default: // Default behavior: reject 1970 return Error("Unknown instruction"); 1971 case bitc::FUNC_CODE_DECLAREBLOCKS: // DECLAREBLOCKS: [nblocks] 1972 if (Record.size() < 1 || Record[0] == 0) 1973 return Error("Invalid DECLAREBLOCKS record"); 1974 // Create all the basic blocks for the function. 1975 FunctionBBs.resize(Record[0]); 1976 for (unsigned i = 0, e = FunctionBBs.size(); i != e; ++i) 1977 FunctionBBs[i] = BasicBlock::Create(Context, "", F); 1978 CurBB = FunctionBBs[0]; 1979 continue; 1980 1981 case bitc::FUNC_CODE_DEBUG_LOC_AGAIN: // DEBUG_LOC_AGAIN 1982 // This record indicates that the last instruction is at the same 1983 // location as the previous instruction with a location. 1984 I = 0; 1985 1986 // Get the last instruction emitted. 1987 if (CurBB && !CurBB->empty()) 1988 I = &CurBB->back(); 1989 else if (CurBBNo && FunctionBBs[CurBBNo-1] && 1990 !FunctionBBs[CurBBNo-1]->empty()) 1991 I = &FunctionBBs[CurBBNo-1]->back(); 1992 1993 if (I == 0) return Error("Invalid DEBUG_LOC_AGAIN record"); 1994 I->setDebugLoc(LastLoc); 1995 I = 0; 1996 continue; 1997 1998 case bitc::FUNC_CODE_DEBUG_LOC: { // DEBUG_LOC: [line, col, scope, ia] 1999 I = 0; // Get the last instruction emitted. 2000 if (CurBB && !CurBB->empty()) 2001 I = &CurBB->back(); 2002 else if (CurBBNo && FunctionBBs[CurBBNo-1] && 2003 !FunctionBBs[CurBBNo-1]->empty()) 2004 I = &FunctionBBs[CurBBNo-1]->back(); 2005 if (I == 0 || Record.size() < 4) 2006 return Error("Invalid FUNC_CODE_DEBUG_LOC record"); 2007 2008 unsigned Line = Record[0], Col = Record[1]; 2009 unsigned ScopeID = Record[2], IAID = Record[3]; 2010 2011 MDNode *Scope = 0, *IA = 0; 2012 if (ScopeID) Scope = cast<MDNode>(MDValueList.getValueFwdRef(ScopeID-1)); 2013 if (IAID) IA = cast<MDNode>(MDValueList.getValueFwdRef(IAID-1)); 2014 LastLoc = DebugLoc::get(Line, Col, Scope, IA); 2015 I->setDebugLoc(LastLoc); 2016 I = 0; 2017 continue; 2018 } 2019 2020 case bitc::FUNC_CODE_INST_BINOP: { // BINOP: [opval, ty, opval, opcode] 2021 unsigned OpNum = 0; 2022 Value *LHS, *RHS; 2023 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) || 2024 popValue(Record, OpNum, NextValueNo, LHS->getType(), RHS) || 2025 OpNum+1 > Record.size()) 2026 return Error("Invalid BINOP record"); 2027 2028 int Opc = GetDecodedBinaryOpcode(Record[OpNum++], LHS->getType()); 2029 if (Opc == -1) return Error("Invalid BINOP record"); 2030 I = BinaryOperator::Create((Instruction::BinaryOps)Opc, LHS, RHS); 2031 InstructionList.push_back(I); 2032 if (OpNum < Record.size()) { 2033 if (Opc == Instruction::Add || 2034 Opc == Instruction::Sub || 2035 Opc == Instruction::Mul || 2036 Opc == Instruction::Shl) { 2037 if (Record[OpNum] & (1 << bitc::OBO_NO_SIGNED_WRAP)) 2038 cast<BinaryOperator>(I)->setHasNoSignedWrap(true); 2039 if (Record[OpNum] & (1 << bitc::OBO_NO_UNSIGNED_WRAP)) 2040 cast<BinaryOperator>(I)->setHasNoUnsignedWrap(true); 2041 } else if (Opc == Instruction::SDiv || 2042 Opc == Instruction::UDiv || 2043 Opc == Instruction::LShr || 2044 Opc == Instruction::AShr) { 2045 if (Record[OpNum] & (1 << bitc::PEO_EXACT)) 2046 cast<BinaryOperator>(I)->setIsExact(true); 2047 } else if (isa<FPMathOperator>(I)) { 2048 FastMathFlags FMF; 2049 FMF.UnsafeAlgebra = 2050 0 != (Record[OpNum] & (1 << bitc::FMF_UNSAFE_ALGEBRA)); 2051 FMF.NoNaNs 2052 = 0 != (Record[OpNum] & (1 << bitc::FMF_NO_NANS)); 2053 FMF.NoInfs 2054 = 0 != (Record[OpNum] & (1 << bitc::FMF_NO_INFS)); 2055 FMF.NoSignedZeros 2056 = 0 != (Record[OpNum] & (1 << bitc::FMF_NO_SIGNED_ZEROS)); 2057 FMF.AllowReciprocal 2058 = 0 != (Record[OpNum] & (1 << bitc::FMF_ALLOW_RECIPROCAL)); 2059 if (FMF.any()) 2060 I->setFastMathFlags(FMF); 2061 } 2062 2063 } 2064 break; 2065 } 2066 case bitc::FUNC_CODE_INST_CAST: { // CAST: [opval, opty, destty, castopc] 2067 unsigned OpNum = 0; 2068 Value *Op; 2069 if (getValueTypePair(Record, OpNum, NextValueNo, Op) || 2070 OpNum+2 != Record.size()) 2071 return Error("Invalid CAST record"); 2072 2073 Type *ResTy = getTypeByID(Record[OpNum]); 2074 int Opc = GetDecodedCastOpcode(Record[OpNum+1]); 2075 if (Opc == -1 || ResTy == 0) 2076 return Error("Invalid CAST record"); 2077 I = CastInst::Create((Instruction::CastOps)Opc, Op, ResTy); 2078 InstructionList.push_back(I); 2079 break; 2080 } 2081 case bitc::FUNC_CODE_INST_INBOUNDS_GEP: 2082 case bitc::FUNC_CODE_INST_GEP: { // GEP: [n x operands] 2083 unsigned OpNum = 0; 2084 Value *BasePtr; 2085 if (getValueTypePair(Record, OpNum, NextValueNo, BasePtr)) 2086 return Error("Invalid GEP record"); 2087 2088 SmallVector<Value*, 16> GEPIdx; 2089 while (OpNum != Record.size()) { 2090 Value *Op; 2091 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 2092 return Error("Invalid GEP record"); 2093 GEPIdx.push_back(Op); 2094 } 2095 2096 I = GetElementPtrInst::Create(BasePtr, GEPIdx); 2097 InstructionList.push_back(I); 2098 if (BitCode == bitc::FUNC_CODE_INST_INBOUNDS_GEP) 2099 cast<GetElementPtrInst>(I)->setIsInBounds(true); 2100 break; 2101 } 2102 2103 case bitc::FUNC_CODE_INST_EXTRACTVAL: { 2104 // EXTRACTVAL: [opty, opval, n x indices] 2105 unsigned OpNum = 0; 2106 Value *Agg; 2107 if (getValueTypePair(Record, OpNum, NextValueNo, Agg)) 2108 return Error("Invalid EXTRACTVAL record"); 2109 2110 SmallVector<unsigned, 4> EXTRACTVALIdx; 2111 for (unsigned RecSize = Record.size(); 2112 OpNum != RecSize; ++OpNum) { 2113 uint64_t Index = Record[OpNum]; 2114 if ((unsigned)Index != Index) 2115 return Error("Invalid EXTRACTVAL index"); 2116 EXTRACTVALIdx.push_back((unsigned)Index); 2117 } 2118 2119 I = ExtractValueInst::Create(Agg, EXTRACTVALIdx); 2120 InstructionList.push_back(I); 2121 break; 2122 } 2123 2124 case bitc::FUNC_CODE_INST_INSERTVAL: { 2125 // INSERTVAL: [opty, opval, opty, opval, n x indices] 2126 unsigned OpNum = 0; 2127 Value *Agg; 2128 if (getValueTypePair(Record, OpNum, NextValueNo, Agg)) 2129 return Error("Invalid INSERTVAL record"); 2130 Value *Val; 2131 if (getValueTypePair(Record, OpNum, NextValueNo, Val)) 2132 return Error("Invalid INSERTVAL record"); 2133 2134 SmallVector<unsigned, 4> INSERTVALIdx; 2135 for (unsigned RecSize = Record.size(); 2136 OpNum != RecSize; ++OpNum) { 2137 uint64_t Index = Record[OpNum]; 2138 if ((unsigned)Index != Index) 2139 return Error("Invalid INSERTVAL index"); 2140 INSERTVALIdx.push_back((unsigned)Index); 2141 } 2142 2143 I = InsertValueInst::Create(Agg, Val, INSERTVALIdx); 2144 InstructionList.push_back(I); 2145 break; 2146 } 2147 2148 case bitc::FUNC_CODE_INST_SELECT: { // SELECT: [opval, ty, opval, opval] 2149 // obsolete form of select 2150 // handles select i1 ... in old bitcode 2151 unsigned OpNum = 0; 2152 Value *TrueVal, *FalseVal, *Cond; 2153 if (getValueTypePair(Record, OpNum, NextValueNo, TrueVal) || 2154 popValue(Record, OpNum, NextValueNo, TrueVal->getType(), FalseVal) || 2155 popValue(Record, OpNum, NextValueNo, Type::getInt1Ty(Context), Cond)) 2156 return Error("Invalid SELECT record"); 2157 2158 I = SelectInst::Create(Cond, TrueVal, FalseVal); 2159 InstructionList.push_back(I); 2160 break; 2161 } 2162 2163 case bitc::FUNC_CODE_INST_VSELECT: {// VSELECT: [ty,opval,opval,predty,pred] 2164 // new form of select 2165 // handles select i1 or select [N x i1] 2166 unsigned OpNum = 0; 2167 Value *TrueVal, *FalseVal, *Cond; 2168 if (getValueTypePair(Record, OpNum, NextValueNo, TrueVal) || 2169 popValue(Record, OpNum, NextValueNo, TrueVal->getType(), FalseVal) || 2170 getValueTypePair(Record, OpNum, NextValueNo, Cond)) 2171 return Error("Invalid SELECT record"); 2172 2173 // select condition can be either i1 or [N x i1] 2174 if (VectorType* vector_type = 2175 dyn_cast<VectorType>(Cond->getType())) { 2176 // expect <n x i1> 2177 if (vector_type->getElementType() != Type::getInt1Ty(Context)) 2178 return Error("Invalid SELECT condition type"); 2179 } else { 2180 // expect i1 2181 if (Cond->getType() != Type::getInt1Ty(Context)) 2182 return Error("Invalid SELECT condition type"); 2183 } 2184 2185 I = SelectInst::Create(Cond, TrueVal, FalseVal); 2186 InstructionList.push_back(I); 2187 break; 2188 } 2189 2190 case bitc::FUNC_CODE_INST_EXTRACTELT: { // EXTRACTELT: [opty, opval, opval] 2191 unsigned OpNum = 0; 2192 Value *Vec, *Idx; 2193 if (getValueTypePair(Record, OpNum, NextValueNo, Vec) || 2194 popValue(Record, OpNum, NextValueNo, Type::getInt32Ty(Context), Idx)) 2195 return Error("Invalid EXTRACTELT record"); 2196 I = ExtractElementInst::Create(Vec, Idx); 2197 InstructionList.push_back(I); 2198 break; 2199 } 2200 2201 case bitc::FUNC_CODE_INST_INSERTELT: { // INSERTELT: [ty, opval,opval,opval] 2202 unsigned OpNum = 0; 2203 Value *Vec, *Elt, *Idx; 2204 if (getValueTypePair(Record, OpNum, NextValueNo, Vec) || 2205 popValue(Record, OpNum, NextValueNo, 2206 cast<VectorType>(Vec->getType())->getElementType(), Elt) || 2207 popValue(Record, OpNum, NextValueNo, Type::getInt32Ty(Context), Idx)) 2208 return Error("Invalid INSERTELT record"); 2209 I = InsertElementInst::Create(Vec, Elt, Idx); 2210 InstructionList.push_back(I); 2211 break; 2212 } 2213 2214 case bitc::FUNC_CODE_INST_SHUFFLEVEC: {// SHUFFLEVEC: [opval,ty,opval,opval] 2215 unsigned OpNum = 0; 2216 Value *Vec1, *Vec2, *Mask; 2217 if (getValueTypePair(Record, OpNum, NextValueNo, Vec1) || 2218 popValue(Record, OpNum, NextValueNo, Vec1->getType(), Vec2)) 2219 return Error("Invalid SHUFFLEVEC record"); 2220 2221 if (getValueTypePair(Record, OpNum, NextValueNo, Mask)) 2222 return Error("Invalid SHUFFLEVEC record"); 2223 I = new ShuffleVectorInst(Vec1, Vec2, Mask); 2224 InstructionList.push_back(I); 2225 break; 2226 } 2227 2228 case bitc::FUNC_CODE_INST_CMP: // CMP: [opty, opval, opval, pred] 2229 // Old form of ICmp/FCmp returning bool 2230 // Existed to differentiate between icmp/fcmp and vicmp/vfcmp which were 2231 // both legal on vectors but had different behaviour. 2232 case bitc::FUNC_CODE_INST_CMP2: { // CMP2: [opty, opval, opval, pred] 2233 // FCmp/ICmp returning bool or vector of bool 2234 2235 unsigned OpNum = 0; 2236 Value *LHS, *RHS; 2237 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) || 2238 popValue(Record, OpNum, NextValueNo, LHS->getType(), RHS) || 2239 OpNum+1 != Record.size()) 2240 return Error("Invalid CMP record"); 2241 2242 if (LHS->getType()->isFPOrFPVectorTy()) 2243 I = new FCmpInst((FCmpInst::Predicate)Record[OpNum], LHS, RHS); 2244 else 2245 I = new ICmpInst((ICmpInst::Predicate)Record[OpNum], LHS, RHS); 2246 InstructionList.push_back(I); 2247 break; 2248 } 2249 2250 case bitc::FUNC_CODE_INST_RET: // RET: [opty,opval<optional>] 2251 { 2252 unsigned Size = Record.size(); 2253 if (Size == 0) { 2254 I = ReturnInst::Create(Context); 2255 InstructionList.push_back(I); 2256 break; 2257 } 2258 2259 unsigned OpNum = 0; 2260 Value *Op = NULL; 2261 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 2262 return Error("Invalid RET record"); 2263 if (OpNum != Record.size()) 2264 return Error("Invalid RET record"); 2265 2266 I = ReturnInst::Create(Context, Op); 2267 InstructionList.push_back(I); 2268 break; 2269 } 2270 case bitc::FUNC_CODE_INST_BR: { // BR: [bb#, bb#, opval] or [bb#] 2271 if (Record.size() != 1 && Record.size() != 3) 2272 return Error("Invalid BR record"); 2273 BasicBlock *TrueDest = getBasicBlock(Record[0]); 2274 if (TrueDest == 0) 2275 return Error("Invalid BR record"); 2276 2277 if (Record.size() == 1) { 2278 I = BranchInst::Create(TrueDest); 2279 InstructionList.push_back(I); 2280 } 2281 else { 2282 BasicBlock *FalseDest = getBasicBlock(Record[1]); 2283 Value *Cond = getValue(Record, 2, NextValueNo, 2284 Type::getInt1Ty(Context)); 2285 if (FalseDest == 0 || Cond == 0) 2286 return Error("Invalid BR record"); 2287 I = BranchInst::Create(TrueDest, FalseDest, Cond); 2288 InstructionList.push_back(I); 2289 } 2290 break; 2291 } 2292 case bitc::FUNC_CODE_INST_SWITCH: { // SWITCH: [opty, op0, op1, ...] 2293 // Check magic 2294 if ((Record[0] >> 16) == SWITCH_INST_MAGIC) { 2295 // New SwitchInst format with case ranges. 2296 2297 Type *OpTy = getTypeByID(Record[1]); 2298 unsigned ValueBitWidth = cast<IntegerType>(OpTy)->getBitWidth(); 2299 2300 Value *Cond = getValue(Record, 2, NextValueNo, OpTy); 2301 BasicBlock *Default = getBasicBlock(Record[3]); 2302 if (OpTy == 0 || Cond == 0 || Default == 0) 2303 return Error("Invalid SWITCH record"); 2304 2305 unsigned NumCases = Record[4]; 2306 2307 SwitchInst *SI = SwitchInst::Create(Cond, Default, NumCases); 2308 InstructionList.push_back(SI); 2309 2310 unsigned CurIdx = 5; 2311 for (unsigned i = 0; i != NumCases; ++i) { 2312 IntegersSubsetToBB CaseBuilder; 2313 unsigned NumItems = Record[CurIdx++]; 2314 for (unsigned ci = 0; ci != NumItems; ++ci) { 2315 bool isSingleNumber = Record[CurIdx++]; 2316 2317 APInt Low; 2318 unsigned ActiveWords = 1; 2319 if (ValueBitWidth > 64) 2320 ActiveWords = Record[CurIdx++]; 2321 Low = ReadWideAPInt(makeArrayRef(&Record[CurIdx], ActiveWords), 2322 ValueBitWidth); 2323 CurIdx += ActiveWords; 2324 2325 if (!isSingleNumber) { 2326 ActiveWords = 1; 2327 if (ValueBitWidth > 64) 2328 ActiveWords = Record[CurIdx++]; 2329 APInt High = 2330 ReadWideAPInt(makeArrayRef(&Record[CurIdx], ActiveWords), 2331 ValueBitWidth); 2332 2333 CaseBuilder.add(IntItem::fromType(OpTy, Low), 2334 IntItem::fromType(OpTy, High)); 2335 CurIdx += ActiveWords; 2336 } else 2337 CaseBuilder.add(IntItem::fromType(OpTy, Low)); 2338 } 2339 BasicBlock *DestBB = getBasicBlock(Record[CurIdx++]); 2340 IntegersSubset Case = CaseBuilder.getCase(); 2341 SI->addCase(Case, DestBB); 2342 } 2343 uint16_t Hash = SI->hash(); 2344 if (Hash != (Record[0] & 0xFFFF)) 2345 return Error("Invalid SWITCH record"); 2346 I = SI; 2347 break; 2348 } 2349 2350 // Old SwitchInst format without case ranges. 2351 2352 if (Record.size() < 3 || (Record.size() & 1) == 0) 2353 return Error("Invalid SWITCH record"); 2354 Type *OpTy = getTypeByID(Record[0]); 2355 Value *Cond = getValue(Record, 1, NextValueNo, OpTy); 2356 BasicBlock *Default = getBasicBlock(Record[2]); 2357 if (OpTy == 0 || Cond == 0 || Default == 0) 2358 return Error("Invalid SWITCH record"); 2359 unsigned NumCases = (Record.size()-3)/2; 2360 SwitchInst *SI = SwitchInst::Create(Cond, Default, NumCases); 2361 InstructionList.push_back(SI); 2362 for (unsigned i = 0, e = NumCases; i != e; ++i) { 2363 ConstantInt *CaseVal = 2364 dyn_cast_or_null<ConstantInt>(getFnValueByID(Record[3+i*2], OpTy)); 2365 BasicBlock *DestBB = getBasicBlock(Record[1+3+i*2]); 2366 if (CaseVal == 0 || DestBB == 0) { 2367 delete SI; 2368 return Error("Invalid SWITCH record!"); 2369 } 2370 SI->addCase(CaseVal, DestBB); 2371 } 2372 I = SI; 2373 break; 2374 } 2375 case bitc::FUNC_CODE_INST_INDIRECTBR: { // INDIRECTBR: [opty, op0, op1, ...] 2376 if (Record.size() < 2) 2377 return Error("Invalid INDIRECTBR record"); 2378 Type *OpTy = getTypeByID(Record[0]); 2379 Value *Address = getValue(Record, 1, NextValueNo, OpTy); 2380 if (OpTy == 0 || Address == 0) 2381 return Error("Invalid INDIRECTBR record"); 2382 unsigned NumDests = Record.size()-2; 2383 IndirectBrInst *IBI = IndirectBrInst::Create(Address, NumDests); 2384 InstructionList.push_back(IBI); 2385 for (unsigned i = 0, e = NumDests; i != e; ++i) { 2386 if (BasicBlock *DestBB = getBasicBlock(Record[2+i])) { 2387 IBI->addDestination(DestBB); 2388 } else { 2389 delete IBI; 2390 return Error("Invalid INDIRECTBR record!"); 2391 } 2392 } 2393 I = IBI; 2394 break; 2395 } 2396 2397 case bitc::FUNC_CODE_INST_INVOKE: { 2398 // INVOKE: [attrs, cc, normBB, unwindBB, fnty, op0,op1,op2, ...] 2399 if (Record.size() < 4) return Error("Invalid INVOKE record"); 2400 AttrListPtr PAL = getAttributes(Record[0]); 2401 unsigned CCInfo = Record[1]; 2402 BasicBlock *NormalBB = getBasicBlock(Record[2]); 2403 BasicBlock *UnwindBB = getBasicBlock(Record[3]); 2404 2405 unsigned OpNum = 4; 2406 Value *Callee; 2407 if (getValueTypePair(Record, OpNum, NextValueNo, Callee)) 2408 return Error("Invalid INVOKE record"); 2409 2410 PointerType *CalleeTy = dyn_cast<PointerType>(Callee->getType()); 2411 FunctionType *FTy = !CalleeTy ? 0 : 2412 dyn_cast<FunctionType>(CalleeTy->getElementType()); 2413 2414 // Check that the right number of fixed parameters are here. 2415 if (FTy == 0 || NormalBB == 0 || UnwindBB == 0 || 2416 Record.size() < OpNum+FTy->getNumParams()) 2417 return Error("Invalid INVOKE record"); 2418 2419 SmallVector<Value*, 16> Ops; 2420 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i, ++OpNum) { 2421 Ops.push_back(getValue(Record, OpNum, NextValueNo, 2422 FTy->getParamType(i))); 2423 if (Ops.back() == 0) return Error("Invalid INVOKE record"); 2424 } 2425 2426 if (!FTy->isVarArg()) { 2427 if (Record.size() != OpNum) 2428 return Error("Invalid INVOKE record"); 2429 } else { 2430 // Read type/value pairs for varargs params. 2431 while (OpNum != Record.size()) { 2432 Value *Op; 2433 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 2434 return Error("Invalid INVOKE record"); 2435 Ops.push_back(Op); 2436 } 2437 } 2438 2439 I = InvokeInst::Create(Callee, NormalBB, UnwindBB, Ops); 2440 InstructionList.push_back(I); 2441 cast<InvokeInst>(I)->setCallingConv( 2442 static_cast<CallingConv::ID>(CCInfo)); 2443 cast<InvokeInst>(I)->setAttributes(PAL); 2444 break; 2445 } 2446 case bitc::FUNC_CODE_INST_RESUME: { // RESUME: [opval] 2447 unsigned Idx = 0; 2448 Value *Val = 0; 2449 if (getValueTypePair(Record, Idx, NextValueNo, Val)) 2450 return Error("Invalid RESUME record"); 2451 I = ResumeInst::Create(Val); 2452 InstructionList.push_back(I); 2453 break; 2454 } 2455 case bitc::FUNC_CODE_INST_UNREACHABLE: // UNREACHABLE 2456 I = new UnreachableInst(Context); 2457 InstructionList.push_back(I); 2458 break; 2459 case bitc::FUNC_CODE_INST_PHI: { // PHI: [ty, val0,bb0, ...] 2460 if (Record.size() < 1 || ((Record.size()-1)&1)) 2461 return Error("Invalid PHI record"); 2462 Type *Ty = getTypeByID(Record[0]); 2463 if (!Ty) return Error("Invalid PHI record"); 2464 2465 PHINode *PN = PHINode::Create(Ty, (Record.size()-1)/2); 2466 InstructionList.push_back(PN); 2467 2468 for (unsigned i = 0, e = Record.size()-1; i != e; i += 2) { 2469 Value *V; 2470 // With the new function encoding, it is possible that operands have 2471 // negative IDs (for forward references). Use a signed VBR 2472 // representation to keep the encoding small. 2473 if (UseRelativeIDs) 2474 V = getValueSigned(Record, 1+i, NextValueNo, Ty); 2475 else 2476 V = getValue(Record, 1+i, NextValueNo, Ty); 2477 BasicBlock *BB = getBasicBlock(Record[2+i]); 2478 if (!V || !BB) return Error("Invalid PHI record"); 2479 PN->addIncoming(V, BB); 2480 } 2481 I = PN; 2482 break; 2483 } 2484 2485 case bitc::FUNC_CODE_INST_LANDINGPAD: { 2486 // LANDINGPAD: [ty, val, val, num, (id0,val0 ...)?] 2487 unsigned Idx = 0; 2488 if (Record.size() < 4) 2489 return Error("Invalid LANDINGPAD record"); 2490 Type *Ty = getTypeByID(Record[Idx++]); 2491 if (!Ty) return Error("Invalid LANDINGPAD record"); 2492 Value *PersFn = 0; 2493 if (getValueTypePair(Record, Idx, NextValueNo, PersFn)) 2494 return Error("Invalid LANDINGPAD record"); 2495 2496 bool IsCleanup = !!Record[Idx++]; 2497 unsigned NumClauses = Record[Idx++]; 2498 LandingPadInst *LP = LandingPadInst::Create(Ty, PersFn, NumClauses); 2499 LP->setCleanup(IsCleanup); 2500 for (unsigned J = 0; J != NumClauses; ++J) { 2501 LandingPadInst::ClauseType CT = 2502 LandingPadInst::ClauseType(Record[Idx++]); (void)CT; 2503 Value *Val; 2504 2505 if (getValueTypePair(Record, Idx, NextValueNo, Val)) { 2506 delete LP; 2507 return Error("Invalid LANDINGPAD record"); 2508 } 2509 2510 assert((CT != LandingPadInst::Catch || 2511 !isa<ArrayType>(Val->getType())) && 2512 "Catch clause has a invalid type!"); 2513 assert((CT != LandingPadInst::Filter || 2514 isa<ArrayType>(Val->getType())) && 2515 "Filter clause has invalid type!"); 2516 LP->addClause(Val); 2517 } 2518 2519 I = LP; 2520 InstructionList.push_back(I); 2521 break; 2522 } 2523 2524 case bitc::FUNC_CODE_INST_ALLOCA: { // ALLOCA: [instty, opty, op, align] 2525 if (Record.size() != 4) 2526 return Error("Invalid ALLOCA record"); 2527 PointerType *Ty = 2528 dyn_cast_or_null<PointerType>(getTypeByID(Record[0])); 2529 Type *OpTy = getTypeByID(Record[1]); 2530 Value *Size = getFnValueByID(Record[2], OpTy); 2531 unsigned Align = Record[3]; 2532 if (!Ty || !Size) return Error("Invalid ALLOCA record"); 2533 I = new AllocaInst(Ty->getElementType(), Size, (1 << Align) >> 1); 2534 InstructionList.push_back(I); 2535 break; 2536 } 2537 case bitc::FUNC_CODE_INST_LOAD: { // LOAD: [opty, op, align, vol] 2538 unsigned OpNum = 0; 2539 Value *Op; 2540 if (getValueTypePair(Record, OpNum, NextValueNo, Op) || 2541 OpNum+2 != Record.size()) 2542 return Error("Invalid LOAD record"); 2543 2544 I = new LoadInst(Op, "", Record[OpNum+1], (1 << Record[OpNum]) >> 1); 2545 InstructionList.push_back(I); 2546 break; 2547 } 2548 case bitc::FUNC_CODE_INST_LOADATOMIC: { 2549 // LOADATOMIC: [opty, op, align, vol, ordering, synchscope] 2550 unsigned OpNum = 0; 2551 Value *Op; 2552 if (getValueTypePair(Record, OpNum, NextValueNo, Op) || 2553 OpNum+4 != Record.size()) 2554 return Error("Invalid LOADATOMIC record"); 2555 2556 2557 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+2]); 2558 if (Ordering == NotAtomic || Ordering == Release || 2559 Ordering == AcquireRelease) 2560 return Error("Invalid LOADATOMIC record"); 2561 if (Ordering != NotAtomic && Record[OpNum] == 0) 2562 return Error("Invalid LOADATOMIC record"); 2563 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+3]); 2564 2565 I = new LoadInst(Op, "", Record[OpNum+1], (1 << Record[OpNum]) >> 1, 2566 Ordering, SynchScope); 2567 InstructionList.push_back(I); 2568 break; 2569 } 2570 case bitc::FUNC_CODE_INST_STORE: { // STORE2:[ptrty, ptr, val, align, vol] 2571 unsigned OpNum = 0; 2572 Value *Val, *Ptr; 2573 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) || 2574 popValue(Record, OpNum, NextValueNo, 2575 cast<PointerType>(Ptr->getType())->getElementType(), Val) || 2576 OpNum+2 != Record.size()) 2577 return Error("Invalid STORE record"); 2578 2579 I = new StoreInst(Val, Ptr, Record[OpNum+1], (1 << Record[OpNum]) >> 1); 2580 InstructionList.push_back(I); 2581 break; 2582 } 2583 case bitc::FUNC_CODE_INST_STOREATOMIC: { 2584 // STOREATOMIC: [ptrty, ptr, val, align, vol, ordering, synchscope] 2585 unsigned OpNum = 0; 2586 Value *Val, *Ptr; 2587 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) || 2588 popValue(Record, OpNum, NextValueNo, 2589 cast<PointerType>(Ptr->getType())->getElementType(), Val) || 2590 OpNum+4 != Record.size()) 2591 return Error("Invalid STOREATOMIC record"); 2592 2593 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+2]); 2594 if (Ordering == NotAtomic || Ordering == Acquire || 2595 Ordering == AcquireRelease) 2596 return Error("Invalid STOREATOMIC record"); 2597 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+3]); 2598 if (Ordering != NotAtomic && Record[OpNum] == 0) 2599 return Error("Invalid STOREATOMIC record"); 2600 2601 I = new StoreInst(Val, Ptr, Record[OpNum+1], (1 << Record[OpNum]) >> 1, 2602 Ordering, SynchScope); 2603 InstructionList.push_back(I); 2604 break; 2605 } 2606 case bitc::FUNC_CODE_INST_CMPXCHG: { 2607 // CMPXCHG:[ptrty, ptr, cmp, new, vol, ordering, synchscope] 2608 unsigned OpNum = 0; 2609 Value *Ptr, *Cmp, *New; 2610 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) || 2611 popValue(Record, OpNum, NextValueNo, 2612 cast<PointerType>(Ptr->getType())->getElementType(), Cmp) || 2613 popValue(Record, OpNum, NextValueNo, 2614 cast<PointerType>(Ptr->getType())->getElementType(), New) || 2615 OpNum+3 != Record.size()) 2616 return Error("Invalid CMPXCHG record"); 2617 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+1]); 2618 if (Ordering == NotAtomic || Ordering == Unordered) 2619 return Error("Invalid CMPXCHG record"); 2620 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+2]); 2621 I = new AtomicCmpXchgInst(Ptr, Cmp, New, Ordering, SynchScope); 2622 cast<AtomicCmpXchgInst>(I)->setVolatile(Record[OpNum]); 2623 InstructionList.push_back(I); 2624 break; 2625 } 2626 case bitc::FUNC_CODE_INST_ATOMICRMW: { 2627 // ATOMICRMW:[ptrty, ptr, val, op, vol, ordering, synchscope] 2628 unsigned OpNum = 0; 2629 Value *Ptr, *Val; 2630 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) || 2631 popValue(Record, OpNum, NextValueNo, 2632 cast<PointerType>(Ptr->getType())->getElementType(), Val) || 2633 OpNum+4 != Record.size()) 2634 return Error("Invalid ATOMICRMW record"); 2635 AtomicRMWInst::BinOp Operation = GetDecodedRMWOperation(Record[OpNum]); 2636 if (Operation < AtomicRMWInst::FIRST_BINOP || 2637 Operation > AtomicRMWInst::LAST_BINOP) 2638 return Error("Invalid ATOMICRMW record"); 2639 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+2]); 2640 if (Ordering == NotAtomic || Ordering == Unordered) 2641 return Error("Invalid ATOMICRMW record"); 2642 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+3]); 2643 I = new AtomicRMWInst(Operation, Ptr, Val, Ordering, SynchScope); 2644 cast<AtomicRMWInst>(I)->setVolatile(Record[OpNum+1]); 2645 InstructionList.push_back(I); 2646 break; 2647 } 2648 case bitc::FUNC_CODE_INST_FENCE: { // FENCE:[ordering, synchscope] 2649 if (2 != Record.size()) 2650 return Error("Invalid FENCE record"); 2651 AtomicOrdering Ordering = GetDecodedOrdering(Record[0]); 2652 if (Ordering == NotAtomic || Ordering == Unordered || 2653 Ordering == Monotonic) 2654 return Error("Invalid FENCE record"); 2655 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[1]); 2656 I = new FenceInst(Context, Ordering, SynchScope); 2657 InstructionList.push_back(I); 2658 break; 2659 } 2660 case bitc::FUNC_CODE_INST_CALL: { 2661 // CALL: [paramattrs, cc, fnty, fnid, arg0, arg1...] 2662 if (Record.size() < 3) 2663 return Error("Invalid CALL record"); 2664 2665 AttrListPtr PAL = getAttributes(Record[0]); 2666 unsigned CCInfo = Record[1]; 2667 2668 unsigned OpNum = 2; 2669 Value *Callee; 2670 if (getValueTypePair(Record, OpNum, NextValueNo, Callee)) 2671 return Error("Invalid CALL record"); 2672 2673 PointerType *OpTy = dyn_cast<PointerType>(Callee->getType()); 2674 FunctionType *FTy = 0; 2675 if (OpTy) FTy = dyn_cast<FunctionType>(OpTy->getElementType()); 2676 if (!FTy || Record.size() < FTy->getNumParams()+OpNum) 2677 return Error("Invalid CALL record"); 2678 2679 SmallVector<Value*, 16> Args; 2680 // Read the fixed params. 2681 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i, ++OpNum) { 2682 if (FTy->getParamType(i)->isLabelTy()) 2683 Args.push_back(getBasicBlock(Record[OpNum])); 2684 else 2685 Args.push_back(getValue(Record, OpNum, NextValueNo, 2686 FTy->getParamType(i))); 2687 if (Args.back() == 0) return Error("Invalid CALL record"); 2688 } 2689 2690 // Read type/value pairs for varargs params. 2691 if (!FTy->isVarArg()) { 2692 if (OpNum != Record.size()) 2693 return Error("Invalid CALL record"); 2694 } else { 2695 while (OpNum != Record.size()) { 2696 Value *Op; 2697 if (getValueTypePair(Record, OpNum, NextValueNo, Op)) 2698 return Error("Invalid CALL record"); 2699 Args.push_back(Op); 2700 } 2701 } 2702 2703 I = CallInst::Create(Callee, Args); 2704 InstructionList.push_back(I); 2705 cast<CallInst>(I)->setCallingConv( 2706 static_cast<CallingConv::ID>(CCInfo>>1)); 2707 cast<CallInst>(I)->setTailCall(CCInfo & 1); 2708 cast<CallInst>(I)->setAttributes(PAL); 2709 break; 2710 } 2711 case bitc::FUNC_CODE_INST_VAARG: { // VAARG: [valistty, valist, instty] 2712 if (Record.size() < 3) 2713 return Error("Invalid VAARG record"); 2714 Type *OpTy = getTypeByID(Record[0]); 2715 Value *Op = getValue(Record, 1, NextValueNo, OpTy); 2716 Type *ResTy = getTypeByID(Record[2]); 2717 if (!OpTy || !Op || !ResTy) 2718 return Error("Invalid VAARG record"); 2719 I = new VAArgInst(Op, ResTy); 2720 InstructionList.push_back(I); 2721 break; 2722 } 2723 } 2724 2725 // Add instruction to end of current BB. If there is no current BB, reject 2726 // this file. 2727 if (CurBB == 0) { 2728 delete I; 2729 return Error("Invalid instruction with no BB"); 2730 } 2731 CurBB->getInstList().push_back(I); 2732 2733 // If this was a terminator instruction, move to the next block. 2734 if (isa<TerminatorInst>(I)) { 2735 ++CurBBNo; 2736 CurBB = CurBBNo < FunctionBBs.size() ? FunctionBBs[CurBBNo] : 0; 2737 } 2738 2739 // Non-void values get registered in the value table for future use. 2740 if (I && !I->getType()->isVoidTy()) 2741 ValueList.AssignValue(I, NextValueNo++); 2742 } 2743 2744 // Check the function list for unresolved values. 2745 if (Argument *A = dyn_cast<Argument>(ValueList.back())) { 2746 if (A->getParent() == 0) { 2747 // We found at least one unresolved value. Nuke them all to avoid leaks. 2748 for (unsigned i = ModuleValueListSize, e = ValueList.size(); i != e; ++i){ 2749 if ((A = dyn_cast<Argument>(ValueList[i])) && A->getParent() == 0) { 2750 A->replaceAllUsesWith(UndefValue::get(A->getType())); 2751 delete A; 2752 } 2753 } 2754 return Error("Never resolved value found in function!"); 2755 } 2756 } 2757 2758 // FIXME: Check for unresolved forward-declared metadata references 2759 // and clean up leaks. 2760 2761 // See if anything took the address of blocks in this function. If so, 2762 // resolve them now. 2763 DenseMap<Function*, std::vector<BlockAddrRefTy> >::iterator BAFRI = 2764 BlockAddrFwdRefs.find(F); 2765 if (BAFRI != BlockAddrFwdRefs.end()) { 2766 std::vector<BlockAddrRefTy> &RefList = BAFRI->second; 2767 for (unsigned i = 0, e = RefList.size(); i != e; ++i) { 2768 unsigned BlockIdx = RefList[i].first; 2769 if (BlockIdx >= FunctionBBs.size()) 2770 return Error("Invalid blockaddress block #"); 2771 2772 GlobalVariable *FwdRef = RefList[i].second; 2773 FwdRef->replaceAllUsesWith(BlockAddress::get(F, FunctionBBs[BlockIdx])); 2774 FwdRef->eraseFromParent(); 2775 } 2776 2777 BlockAddrFwdRefs.erase(BAFRI); 2778 } 2779 2780 // Trim the value list down to the size it was before we parsed this function. 2781 ValueList.shrinkTo(ModuleValueListSize); 2782 MDValueList.shrinkTo(ModuleMDValueListSize); 2783 std::vector<BasicBlock*>().swap(FunctionBBs); 2784 return false; 2785} 2786 2787/// FindFunctionInStream - Find the function body in the bitcode stream 2788bool BitcodeReader::FindFunctionInStream(Function *F, 2789 DenseMap<Function*, uint64_t>::iterator DeferredFunctionInfoIterator) { 2790 while (DeferredFunctionInfoIterator->second == 0) { 2791 if (Stream.AtEndOfStream()) 2792 return Error("Could not find Function in stream"); 2793 // ParseModule will parse the next body in the stream and set its 2794 // position in the DeferredFunctionInfo map. 2795 if (ParseModule(true)) return true; 2796 } 2797 return false; 2798} 2799 2800//===----------------------------------------------------------------------===// 2801// GVMaterializer implementation 2802//===----------------------------------------------------------------------===// 2803 2804 2805bool BitcodeReader::isMaterializable(const GlobalValue *GV) const { 2806 if (const Function *F = dyn_cast<Function>(GV)) { 2807 return F->isDeclaration() && 2808 DeferredFunctionInfo.count(const_cast<Function*>(F)); 2809 } 2810 return false; 2811} 2812 2813bool BitcodeReader::Materialize(GlobalValue *GV, std::string *ErrInfo) { 2814 Function *F = dyn_cast<Function>(GV); 2815 // If it's not a function or is already material, ignore the request. 2816 if (!F || !F->isMaterializable()) return false; 2817 2818 DenseMap<Function*, uint64_t>::iterator DFII = DeferredFunctionInfo.find(F); 2819 assert(DFII != DeferredFunctionInfo.end() && "Deferred function not found!"); 2820 // If its position is recorded as 0, its body is somewhere in the stream 2821 // but we haven't seen it yet. 2822 if (DFII->second == 0) 2823 if (LazyStreamer && FindFunctionInStream(F, DFII)) return true; 2824 2825 // Move the bit stream to the saved position of the deferred function body. 2826 Stream.JumpToBit(DFII->second); 2827 2828 if (ParseFunctionBody(F)) { 2829 if (ErrInfo) *ErrInfo = ErrorString; 2830 return true; 2831 } 2832 2833 // Upgrade any old intrinsic calls in the function. 2834 for (UpgradedIntrinsicMap::iterator I = UpgradedIntrinsics.begin(), 2835 E = UpgradedIntrinsics.end(); I != E; ++I) { 2836 if (I->first != I->second) { 2837 for (Value::use_iterator UI = I->first->use_begin(), 2838 UE = I->first->use_end(); UI != UE; ) { 2839 if (CallInst* CI = dyn_cast<CallInst>(*UI++)) 2840 UpgradeIntrinsicCall(CI, I->second); 2841 } 2842 } 2843 } 2844 2845 return false; 2846} 2847 2848bool BitcodeReader::isDematerializable(const GlobalValue *GV) const { 2849 const Function *F = dyn_cast<Function>(GV); 2850 if (!F || F->isDeclaration()) 2851 return false; 2852 return DeferredFunctionInfo.count(const_cast<Function*>(F)); 2853} 2854 2855void BitcodeReader::Dematerialize(GlobalValue *GV) { 2856 Function *F = dyn_cast<Function>(GV); 2857 // If this function isn't dematerializable, this is a noop. 2858 if (!F || !isDematerializable(F)) 2859 return; 2860 2861 assert(DeferredFunctionInfo.count(F) && "No info to read function later?"); 2862 2863 // Just forget the function body, we can remat it later. 2864 F->deleteBody(); 2865} 2866 2867 2868bool BitcodeReader::MaterializeModule(Module *M, std::string *ErrInfo) { 2869 assert(M == TheModule && 2870 "Can only Materialize the Module this BitcodeReader is attached to."); 2871 // Iterate over the module, deserializing any functions that are still on 2872 // disk. 2873 for (Module::iterator F = TheModule->begin(), E = TheModule->end(); 2874 F != E; ++F) 2875 if (F->isMaterializable() && 2876 Materialize(F, ErrInfo)) 2877 return true; 2878 2879 // At this point, if there are any function bodies, the current bit is 2880 // pointing to the END_BLOCK record after them. Now make sure the rest 2881 // of the bits in the module have been read. 2882 if (NextUnreadBit) 2883 ParseModule(true); 2884 2885 // Upgrade any intrinsic calls that slipped through (should not happen!) and 2886 // delete the old functions to clean up. We can't do this unless the entire 2887 // module is materialized because there could always be another function body 2888 // with calls to the old function. 2889 for (std::vector<std::pair<Function*, Function*> >::iterator I = 2890 UpgradedIntrinsics.begin(), E = UpgradedIntrinsics.end(); I != E; ++I) { 2891 if (I->first != I->second) { 2892 for (Value::use_iterator UI = I->first->use_begin(), 2893 UE = I->first->use_end(); UI != UE; ) { 2894 if (CallInst* CI = dyn_cast<CallInst>(*UI++)) 2895 UpgradeIntrinsicCall(CI, I->second); 2896 } 2897 if (!I->first->use_empty()) 2898 I->first->replaceAllUsesWith(I->second); 2899 I->first->eraseFromParent(); 2900 } 2901 } 2902 std::vector<std::pair<Function*, Function*> >().swap(UpgradedIntrinsics); 2903 2904 return false; 2905} 2906 2907bool BitcodeReader::InitStream() { 2908 if (LazyStreamer) return InitLazyStream(); 2909 return InitStreamFromBuffer(); 2910} 2911 2912bool BitcodeReader::InitStreamFromBuffer() { 2913 const unsigned char *BufPtr = (const unsigned char*)Buffer->getBufferStart(); 2914 const unsigned char *BufEnd = BufPtr+Buffer->getBufferSize(); 2915 2916 if (Buffer->getBufferSize() & 3) { 2917 if (!isRawBitcode(BufPtr, BufEnd) && !isBitcodeWrapper(BufPtr, BufEnd)) 2918 return Error("Invalid bitcode signature"); 2919 else 2920 return Error("Bitcode stream should be a multiple of 4 bytes in length"); 2921 } 2922 2923 // If we have a wrapper header, parse it and ignore the non-bc file contents. 2924 // The magic number is 0x0B17C0DE stored in little endian. 2925 if (isBitcodeWrapper(BufPtr, BufEnd)) 2926 if (SkipBitcodeWrapperHeader(BufPtr, BufEnd, true)) 2927 return Error("Invalid bitcode wrapper header"); 2928 2929 StreamFile.reset(new BitstreamReader(BufPtr, BufEnd)); 2930 Stream.init(*StreamFile); 2931 2932 return false; 2933} 2934 2935bool BitcodeReader::InitLazyStream() { 2936 // Check and strip off the bitcode wrapper; BitstreamReader expects never to 2937 // see it. 2938 StreamingMemoryObject *Bytes = new StreamingMemoryObject(LazyStreamer); 2939 StreamFile.reset(new BitstreamReader(Bytes)); 2940 Stream.init(*StreamFile); 2941 2942 unsigned char buf[16]; 2943 if (Bytes->readBytes(0, 16, buf, NULL) == -1) 2944 return Error("Bitcode stream must be at least 16 bytes in length"); 2945 2946 if (!isBitcode(buf, buf + 16)) 2947 return Error("Invalid bitcode signature"); 2948 2949 if (isBitcodeWrapper(buf, buf + 4)) { 2950 const unsigned char *bitcodeStart = buf; 2951 const unsigned char *bitcodeEnd = buf + 16; 2952 SkipBitcodeWrapperHeader(bitcodeStart, bitcodeEnd, false); 2953 Bytes->dropLeadingBytes(bitcodeStart - buf); 2954 Bytes->setKnownObjectSize(bitcodeEnd - bitcodeStart); 2955 } 2956 return false; 2957} 2958 2959//===----------------------------------------------------------------------===// 2960// External interface 2961//===----------------------------------------------------------------------===// 2962 2963/// getLazyBitcodeModule - lazy function-at-a-time loading from a file. 2964/// 2965Module *llvm::getLazyBitcodeModule(MemoryBuffer *Buffer, 2966 LLVMContext& Context, 2967 std::string *ErrMsg) { 2968 Module *M = new Module(Buffer->getBufferIdentifier(), Context); 2969 BitcodeReader *R = new BitcodeReader(Buffer, Context); 2970 M->setMaterializer(R); 2971 if (R->ParseBitcodeInto(M)) { 2972 if (ErrMsg) 2973 *ErrMsg = R->getErrorString(); 2974 2975 delete M; // Also deletes R. 2976 return 0; 2977 } 2978 // Have the BitcodeReader dtor delete 'Buffer'. 2979 R->setBufferOwned(true); 2980 2981 R->materializeForwardReferencedFunctions(); 2982 2983 return M; 2984} 2985 2986 2987Module *llvm::getStreamedBitcodeModule(const std::string &name, 2988 DataStreamer *streamer, 2989 LLVMContext &Context, 2990 std::string *ErrMsg) { 2991 Module *M = new Module(name, Context); 2992 BitcodeReader *R = new BitcodeReader(streamer, Context); 2993 M->setMaterializer(R); 2994 if (R->ParseBitcodeInto(M)) { 2995 if (ErrMsg) 2996 *ErrMsg = R->getErrorString(); 2997 delete M; // Also deletes R. 2998 return 0; 2999 } 3000 R->setBufferOwned(false); // no buffer to delete 3001 return M; 3002} 3003 3004/// ParseBitcodeFile - Read the specified bitcode file, returning the module. 3005/// If an error occurs, return null and fill in *ErrMsg if non-null. 3006Module *llvm::ParseBitcodeFile(MemoryBuffer *Buffer, LLVMContext& Context, 3007 std::string *ErrMsg){ 3008 Module *M = getLazyBitcodeModule(Buffer, Context, ErrMsg); 3009 if (!M) return 0; 3010 3011 // Don't let the BitcodeReader dtor delete 'Buffer', regardless of whether 3012 // there was an error. 3013 static_cast<BitcodeReader*>(M->getMaterializer())->setBufferOwned(false); 3014 3015 // Read in the entire module, and destroy the BitcodeReader. 3016 if (M->MaterializeAllPermanently(ErrMsg)) { 3017 delete M; 3018 return 0; 3019 } 3020 3021 // TODO: Restore the use-lists to the in-memory state when the bitcode was 3022 // written. We must defer until the Module has been fully materialized. 3023 3024 return M; 3025} 3026 3027std::string llvm::getBitcodeTargetTriple(MemoryBuffer *Buffer, 3028 LLVMContext& Context, 3029 std::string *ErrMsg) { 3030 BitcodeReader *R = new BitcodeReader(Buffer, Context); 3031 // Don't let the BitcodeReader dtor delete 'Buffer'. 3032 R->setBufferOwned(false); 3033 3034 std::string Triple(""); 3035 if (R->ParseTriple(Triple)) 3036 if (ErrMsg) 3037 *ErrMsg = R->getErrorString(); 3038 3039 delete R; 3040 return Triple; 3041} 3042