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