1 //===- BitcodeReader.cpp - Internal BitcodeReader implementation ----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Bitcode/ReaderWriter.h"
11 #include "BitcodeReader.h"
12 #include "llvm/ADT/SmallString.h"
13 #include "llvm/ADT/SmallVector.h"
14 #include "llvm/AutoUpgrade.h"
15 #include "llvm/IR/Constants.h"
16 #include "llvm/IR/DerivedTypes.h"
17 #include "llvm/IR/InlineAsm.h"
18 #include "llvm/IR/IntrinsicInst.h"
19 #include "llvm/IR/Module.h"
20 #include "llvm/IR/OperandTraits.h"
21 #include "llvm/IR/Operator.h"
22 #include "llvm/Support/DataStream.h"
23 #include "llvm/Support/MathExtras.h"
24 #include "llvm/Support/MemoryBuffer.h"
28 SWITCH_INST_MAGIC = 0x4B5 // May 2012 => 1205 => Hex
31 void BitcodeReader::materializeForwardReferencedFunctions() {
32 while (!BlockAddrFwdRefs.empty()) {
33 Function *F = BlockAddrFwdRefs.begin()->first;
38 void BitcodeReader::FreeState() {
42 std::vector<Type*>().swap(TypeList);
46 std::vector<AttributeSet>().swap(MAttributes);
47 std::vector<BasicBlock*>().swap(FunctionBBs);
48 std::vector<Function*>().swap(FunctionsWithBodies);
49 DeferredFunctionInfo.clear();
52 assert(BlockAddrFwdRefs.empty() && "Unresolved blockaddress fwd references");
55 //===----------------------------------------------------------------------===//
56 // Helper functions to implement forward reference resolution, etc.
57 //===----------------------------------------------------------------------===//
59 /// ConvertToString - Convert a string from a record into an std::string, return
61 template<typename StrTy>
62 static bool ConvertToString(ArrayRef<uint64_t> Record, unsigned Idx,
64 if (Idx > Record.size())
67 for (unsigned i = Idx, e = Record.size(); i != e; ++i)
68 Result += (char)Record[i];
72 static GlobalValue::LinkageTypes GetDecodedLinkage(unsigned Val) {
74 default: // Map unknown/new linkages to external
75 case 0: return GlobalValue::ExternalLinkage;
76 case 1: return GlobalValue::WeakAnyLinkage;
77 case 2: return GlobalValue::AppendingLinkage;
78 case 3: return GlobalValue::InternalLinkage;
79 case 4: return GlobalValue::LinkOnceAnyLinkage;
80 case 5: return GlobalValue::DLLImportLinkage;
81 case 6: return GlobalValue::DLLExportLinkage;
82 case 7: return GlobalValue::ExternalWeakLinkage;
83 case 8: return GlobalValue::CommonLinkage;
84 case 9: return GlobalValue::PrivateLinkage;
85 case 10: return GlobalValue::WeakODRLinkage;
86 case 11: return GlobalValue::LinkOnceODRLinkage;
87 case 12: return GlobalValue::AvailableExternallyLinkage;
88 case 13: return GlobalValue::LinkerPrivateLinkage;
89 case 14: return GlobalValue::LinkerPrivateWeakLinkage;
90 case 15: return GlobalValue::LinkOnceODRAutoHideLinkage;
94 static GlobalValue::VisibilityTypes GetDecodedVisibility(unsigned Val) {
96 default: // Map unknown visibilities to default.
97 case 0: return GlobalValue::DefaultVisibility;
98 case 1: return GlobalValue::HiddenVisibility;
99 case 2: return GlobalValue::ProtectedVisibility;
103 static GlobalVariable::ThreadLocalMode GetDecodedThreadLocalMode(unsigned Val) {
105 case 0: return GlobalVariable::NotThreadLocal;
106 default: // Map unknown non-zero value to general dynamic.
107 case 1: return GlobalVariable::GeneralDynamicTLSModel;
108 case 2: return GlobalVariable::LocalDynamicTLSModel;
109 case 3: return GlobalVariable::InitialExecTLSModel;
110 case 4: return GlobalVariable::LocalExecTLSModel;
114 static int GetDecodedCastOpcode(unsigned Val) {
117 case bitc::CAST_TRUNC : return Instruction::Trunc;
118 case bitc::CAST_ZEXT : return Instruction::ZExt;
119 case bitc::CAST_SEXT : return Instruction::SExt;
120 case bitc::CAST_FPTOUI : return Instruction::FPToUI;
121 case bitc::CAST_FPTOSI : return Instruction::FPToSI;
122 case bitc::CAST_UITOFP : return Instruction::UIToFP;
123 case bitc::CAST_SITOFP : return Instruction::SIToFP;
124 case bitc::CAST_FPTRUNC : return Instruction::FPTrunc;
125 case bitc::CAST_FPEXT : return Instruction::FPExt;
126 case bitc::CAST_PTRTOINT: return Instruction::PtrToInt;
127 case bitc::CAST_INTTOPTR: return Instruction::IntToPtr;
128 case bitc::CAST_BITCAST : return Instruction::BitCast;
131 static int GetDecodedBinaryOpcode(unsigned Val, Type *Ty) {
134 case bitc::BINOP_ADD:
135 return Ty->isFPOrFPVectorTy() ? Instruction::FAdd : Instruction::Add;
136 case bitc::BINOP_SUB:
137 return Ty->isFPOrFPVectorTy() ? Instruction::FSub : Instruction::Sub;
138 case bitc::BINOP_MUL:
139 return Ty->isFPOrFPVectorTy() ? Instruction::FMul : Instruction::Mul;
140 case bitc::BINOP_UDIV: return Instruction::UDiv;
141 case bitc::BINOP_SDIV:
142 return Ty->isFPOrFPVectorTy() ? Instruction::FDiv : Instruction::SDiv;
143 case bitc::BINOP_UREM: return Instruction::URem;
144 case bitc::BINOP_SREM:
145 return Ty->isFPOrFPVectorTy() ? Instruction::FRem : Instruction::SRem;
146 case bitc::BINOP_SHL: return Instruction::Shl;
147 case bitc::BINOP_LSHR: return Instruction::LShr;
148 case bitc::BINOP_ASHR: return Instruction::AShr;
149 case bitc::BINOP_AND: return Instruction::And;
150 case bitc::BINOP_OR: return Instruction::Or;
151 case bitc::BINOP_XOR: return Instruction::Xor;
155 static AtomicRMWInst::BinOp GetDecodedRMWOperation(unsigned Val) {
157 default: return AtomicRMWInst::BAD_BINOP;
158 case bitc::RMW_XCHG: return AtomicRMWInst::Xchg;
159 case bitc::RMW_ADD: return AtomicRMWInst::Add;
160 case bitc::RMW_SUB: return AtomicRMWInst::Sub;
161 case bitc::RMW_AND: return AtomicRMWInst::And;
162 case bitc::RMW_NAND: return AtomicRMWInst::Nand;
163 case bitc::RMW_OR: return AtomicRMWInst::Or;
164 case bitc::RMW_XOR: return AtomicRMWInst::Xor;
165 case bitc::RMW_MAX: return AtomicRMWInst::Max;
166 case bitc::RMW_MIN: return AtomicRMWInst::Min;
167 case bitc::RMW_UMAX: return AtomicRMWInst::UMax;
168 case bitc::RMW_UMIN: return AtomicRMWInst::UMin;
172 static AtomicOrdering GetDecodedOrdering(unsigned Val) {
174 case bitc::ORDERING_NOTATOMIC: return NotAtomic;
175 case bitc::ORDERING_UNORDERED: return Unordered;
176 case bitc::ORDERING_MONOTONIC: return Monotonic;
177 case bitc::ORDERING_ACQUIRE: return Acquire;
178 case bitc::ORDERING_RELEASE: return Release;
179 case bitc::ORDERING_ACQREL: return AcquireRelease;
180 default: // Map unknown orderings to sequentially-consistent.
181 case bitc::ORDERING_SEQCST: return SequentiallyConsistent;
185 static SynchronizationScope GetDecodedSynchScope(unsigned Val) {
187 case bitc::SYNCHSCOPE_SINGLETHREAD: return SingleThread;
188 default: // Map unknown scopes to cross-thread.
189 case bitc::SYNCHSCOPE_CROSSTHREAD: return CrossThread;
195 /// @brief A class for maintaining the slot number definition
196 /// as a placeholder for the actual definition for forward constants defs.
197 class ConstantPlaceHolder : public ConstantExpr {
198 void operator=(const ConstantPlaceHolder &) LLVM_DELETED_FUNCTION;
200 // allocate space for exactly one operand
201 void *operator new(size_t s) {
202 return User::operator new(s, 1);
204 explicit ConstantPlaceHolder(Type *Ty, LLVMContext& Context)
205 : ConstantExpr(Ty, Instruction::UserOp1, &Op<0>(), 1) {
206 Op<0>() = UndefValue::get(Type::getInt32Ty(Context));
209 /// @brief Methods to support type inquiry through isa, cast, and dyn_cast.
210 static bool classof(const Value *V) {
211 return isa<ConstantExpr>(V) &&
212 cast<ConstantExpr>(V)->getOpcode() == Instruction::UserOp1;
216 /// Provide fast operand accessors
217 //DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
221 // FIXME: can we inherit this from ConstantExpr?
223 struct OperandTraits<ConstantPlaceHolder> :
224 public FixedNumOperandTraits<ConstantPlaceHolder, 1> {
229 void BitcodeReaderValueList::AssignValue(Value *V, unsigned Idx) {
238 WeakVH &OldV = ValuePtrs[Idx];
244 // Handle constants and non-constants (e.g. instrs) differently for
246 if (Constant *PHC = dyn_cast<Constant>(&*OldV)) {
247 ResolveConstants.push_back(std::make_pair(PHC, Idx));
250 // If there was a forward reference to this value, replace it.
251 Value *PrevVal = OldV;
252 OldV->replaceAllUsesWith(V);
258 Constant *BitcodeReaderValueList::getConstantFwdRef(unsigned Idx,
263 if (Value *V = ValuePtrs[Idx]) {
264 assert(Ty == V->getType() && "Type mismatch in constant table!");
265 return cast<Constant>(V);
268 // Create and return a placeholder, which will later be RAUW'd.
269 Constant *C = new ConstantPlaceHolder(Ty, Context);
274 Value *BitcodeReaderValueList::getValueFwdRef(unsigned Idx, Type *Ty) {
278 if (Value *V = ValuePtrs[Idx]) {
279 assert((Ty == 0 || Ty == V->getType()) && "Type mismatch in value table!");
283 // No type specified, must be invalid reference.
284 if (Ty == 0) return 0;
286 // Create and return a placeholder, which will later be RAUW'd.
287 Value *V = new Argument(Ty);
292 /// ResolveConstantForwardRefs - Once all constants are read, this method bulk
293 /// resolves any forward references. The idea behind this is that we sometimes
294 /// get constants (such as large arrays) which reference *many* forward ref
295 /// constants. Replacing each of these causes a lot of thrashing when
296 /// building/reuniquing the constant. Instead of doing this, we look at all the
297 /// uses and rewrite all the place holders at once for any constant that uses
299 void BitcodeReaderValueList::ResolveConstantForwardRefs() {
300 // Sort the values by-pointer so that they are efficient to look up with a
302 std::sort(ResolveConstants.begin(), ResolveConstants.end());
304 SmallVector<Constant*, 64> NewOps;
306 while (!ResolveConstants.empty()) {
307 Value *RealVal = operator[](ResolveConstants.back().second);
308 Constant *Placeholder = ResolveConstants.back().first;
309 ResolveConstants.pop_back();
311 // Loop over all users of the placeholder, updating them to reference the
312 // new value. If they reference more than one placeholder, update them all
314 while (!Placeholder->use_empty()) {
315 Value::use_iterator UI = Placeholder->use_begin();
318 // If the using object isn't uniqued, just update the operands. This
319 // handles instructions and initializers for global variables.
320 if (!isa<Constant>(U) || isa<GlobalValue>(U)) {
321 UI.getUse().set(RealVal);
325 // Otherwise, we have a constant that uses the placeholder. Replace that
326 // constant with a new constant that has *all* placeholder uses updated.
327 Constant *UserC = cast<Constant>(U);
328 for (User::op_iterator I = UserC->op_begin(), E = UserC->op_end();
331 if (!isa<ConstantPlaceHolder>(*I)) {
332 // Not a placeholder reference.
334 } else if (*I == Placeholder) {
335 // Common case is that it just references this one placeholder.
338 // Otherwise, look up the placeholder in ResolveConstants.
339 ResolveConstantsTy::iterator It =
340 std::lower_bound(ResolveConstants.begin(), ResolveConstants.end(),
341 std::pair<Constant*, unsigned>(cast<Constant>(*I),
343 assert(It != ResolveConstants.end() && It->first == *I);
344 NewOp = operator[](It->second);
347 NewOps.push_back(cast<Constant>(NewOp));
350 // Make the new constant.
352 if (ConstantArray *UserCA = dyn_cast<ConstantArray>(UserC)) {
353 NewC = ConstantArray::get(UserCA->getType(), NewOps);
354 } else if (ConstantStruct *UserCS = dyn_cast<ConstantStruct>(UserC)) {
355 NewC = ConstantStruct::get(UserCS->getType(), NewOps);
356 } else if (isa<ConstantVector>(UserC)) {
357 NewC = ConstantVector::get(NewOps);
359 assert(isa<ConstantExpr>(UserC) && "Must be a ConstantExpr.");
360 NewC = cast<ConstantExpr>(UserC)->getWithOperands(NewOps);
363 UserC->replaceAllUsesWith(NewC);
364 UserC->destroyConstant();
368 // Update all ValueHandles, they should be the only users at this point.
369 Placeholder->replaceAllUsesWith(RealVal);
374 void BitcodeReaderMDValueList::AssignValue(Value *V, unsigned Idx) {
383 WeakVH &OldV = MDValuePtrs[Idx];
389 // If there was a forward reference to this value, replace it.
390 MDNode *PrevVal = cast<MDNode>(OldV);
391 OldV->replaceAllUsesWith(V);
392 MDNode::deleteTemporary(PrevVal);
393 // Deleting PrevVal sets Idx value in MDValuePtrs to null. Set new
395 MDValuePtrs[Idx] = V;
398 Value *BitcodeReaderMDValueList::getValueFwdRef(unsigned Idx) {
402 if (Value *V = MDValuePtrs[Idx]) {
403 assert(V->getType()->isMetadataTy() && "Type mismatch in value table!");
407 // Create and return a placeholder, which will later be RAUW'd.
408 Value *V = MDNode::getTemporary(Context, ArrayRef<Value*>());
409 MDValuePtrs[Idx] = V;
413 Type *BitcodeReader::getTypeByID(unsigned ID) {
414 // The type table size is always specified correctly.
415 if (ID >= TypeList.size())
418 if (Type *Ty = TypeList[ID])
421 // If we have a forward reference, the only possible case is when it is to a
422 // named struct. Just create a placeholder for now.
423 return TypeList[ID] = StructType::create(Context);
427 //===----------------------------------------------------------------------===//
428 // Functions for parsing blocks from the bitcode file
429 //===----------------------------------------------------------------------===//
431 bool BitcodeReader::ParseAttributeBlock() {
432 if (Stream.EnterSubBlock(bitc::PARAMATTR_BLOCK_ID))
433 return Error("Malformed block record");
435 if (!MAttributes.empty())
436 return Error("Multiple PARAMATTR blocks found!");
438 SmallVector<uint64_t, 64> Record;
440 SmallVector<AttributeWithIndex, 8> Attrs;
442 // Read all the records.
444 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
446 switch (Entry.Kind) {
447 case BitstreamEntry::SubBlock: // Handled for us already.
448 case BitstreamEntry::Error:
449 return Error("Error at end of PARAMATTR block");
450 case BitstreamEntry::EndBlock:
452 case BitstreamEntry::Record:
453 // The interesting case.
459 switch (Stream.readRecord(Entry.ID, Record)) {
460 default: // Default behavior: ignore.
462 case bitc::PARAMATTR_CODE_ENTRY: { // ENTRY: [paramidx0, attr0, ...]
463 if (Record.size() & 1)
464 return Error("Invalid ENTRY record");
466 for (unsigned i = 0, e = Record.size(); i != e; i += 2) {
467 Attribute ReconstitutedAttr =
468 Attribute::decodeLLVMAttributesForBitcode(Context, Record[i+1]);
469 Record[i+1] = ReconstitutedAttr.Raw();
472 for (unsigned i = 0, e = Record.size(); i != e; i += 2) {
473 AttrBuilder B(Record[i+1]);
474 if (B.hasAttributes())
475 Attrs.push_back(AttributeWithIndex::get(Record[i],
476 Attribute::get(Context, B)));
479 MAttributes.push_back(AttributeSet::get(Context, Attrs));
487 bool BitcodeReader::ParseTypeTable() {
488 if (Stream.EnterSubBlock(bitc::TYPE_BLOCK_ID_NEW))
489 return Error("Malformed block record");
491 return ParseTypeTableBody();
494 bool BitcodeReader::ParseTypeTableBody() {
495 if (!TypeList.empty())
496 return Error("Multiple TYPE_BLOCKs found!");
498 SmallVector<uint64_t, 64> Record;
499 unsigned NumRecords = 0;
501 SmallString<64> TypeName;
503 // Read all the records for this type table.
505 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
507 switch (Entry.Kind) {
508 case BitstreamEntry::SubBlock: // Handled for us already.
509 case BitstreamEntry::Error:
510 Error("Error in the type table block");
512 case BitstreamEntry::EndBlock:
513 if (NumRecords != TypeList.size())
514 return Error("Invalid type forward reference in TYPE_BLOCK");
516 case BitstreamEntry::Record:
517 // The interesting case.
524 switch (Stream.readRecord(Entry.ID, Record)) {
525 default: return Error("unknown type in type table");
526 case bitc::TYPE_CODE_NUMENTRY: // TYPE_CODE_NUMENTRY: [numentries]
527 // TYPE_CODE_NUMENTRY contains a count of the number of types in the
528 // type list. This allows us to reserve space.
529 if (Record.size() < 1)
530 return Error("Invalid TYPE_CODE_NUMENTRY record");
531 TypeList.resize(Record[0]);
533 case bitc::TYPE_CODE_VOID: // VOID
534 ResultTy = Type::getVoidTy(Context);
536 case bitc::TYPE_CODE_HALF: // HALF
537 ResultTy = Type::getHalfTy(Context);
539 case bitc::TYPE_CODE_FLOAT: // FLOAT
540 ResultTy = Type::getFloatTy(Context);
542 case bitc::TYPE_CODE_DOUBLE: // DOUBLE
543 ResultTy = Type::getDoubleTy(Context);
545 case bitc::TYPE_CODE_X86_FP80: // X86_FP80
546 ResultTy = Type::getX86_FP80Ty(Context);
548 case bitc::TYPE_CODE_FP128: // FP128
549 ResultTy = Type::getFP128Ty(Context);
551 case bitc::TYPE_CODE_PPC_FP128: // PPC_FP128
552 ResultTy = Type::getPPC_FP128Ty(Context);
554 case bitc::TYPE_CODE_LABEL: // LABEL
555 ResultTy = Type::getLabelTy(Context);
557 case bitc::TYPE_CODE_METADATA: // METADATA
558 ResultTy = Type::getMetadataTy(Context);
560 case bitc::TYPE_CODE_X86_MMX: // X86_MMX
561 ResultTy = Type::getX86_MMXTy(Context);
563 case bitc::TYPE_CODE_INTEGER: // INTEGER: [width]
564 if (Record.size() < 1)
565 return Error("Invalid Integer type record");
567 ResultTy = IntegerType::get(Context, Record[0]);
569 case bitc::TYPE_CODE_POINTER: { // POINTER: [pointee type] or
570 // [pointee type, address space]
571 if (Record.size() < 1)
572 return Error("Invalid POINTER type record");
573 unsigned AddressSpace = 0;
574 if (Record.size() == 2)
575 AddressSpace = Record[1];
576 ResultTy = getTypeByID(Record[0]);
577 if (ResultTy == 0) return Error("invalid element type in pointer type");
578 ResultTy = PointerType::get(ResultTy, AddressSpace);
581 case bitc::TYPE_CODE_FUNCTION_OLD: {
582 // FIXME: attrid is dead, remove it in LLVM 4.0
583 // FUNCTION: [vararg, attrid, retty, paramty x N]
584 if (Record.size() < 3)
585 return Error("Invalid FUNCTION type record");
586 SmallVector<Type*, 8> ArgTys;
587 for (unsigned i = 3, e = Record.size(); i != e; ++i) {
588 if (Type *T = getTypeByID(Record[i]))
594 ResultTy = getTypeByID(Record[2]);
595 if (ResultTy == 0 || ArgTys.size() < Record.size()-3)
596 return Error("invalid type in function type");
598 ResultTy = FunctionType::get(ResultTy, ArgTys, Record[0]);
601 case bitc::TYPE_CODE_FUNCTION: {
602 // FUNCTION: [vararg, retty, paramty x N]
603 if (Record.size() < 2)
604 return Error("Invalid FUNCTION type record");
605 SmallVector<Type*, 8> ArgTys;
606 for (unsigned i = 2, e = Record.size(); i != e; ++i) {
607 if (Type *T = getTypeByID(Record[i]))
613 ResultTy = getTypeByID(Record[1]);
614 if (ResultTy == 0 || ArgTys.size() < Record.size()-2)
615 return Error("invalid type in function type");
617 ResultTy = FunctionType::get(ResultTy, ArgTys, Record[0]);
620 case bitc::TYPE_CODE_STRUCT_ANON: { // STRUCT: [ispacked, eltty x N]
621 if (Record.size() < 1)
622 return Error("Invalid STRUCT type record");
623 SmallVector<Type*, 8> EltTys;
624 for (unsigned i = 1, e = Record.size(); i != e; ++i) {
625 if (Type *T = getTypeByID(Record[i]))
630 if (EltTys.size() != Record.size()-1)
631 return Error("invalid type in struct type");
632 ResultTy = StructType::get(Context, EltTys, Record[0]);
635 case bitc::TYPE_CODE_STRUCT_NAME: // STRUCT_NAME: [strchr x N]
636 if (ConvertToString(Record, 0, TypeName))
637 return Error("Invalid STRUCT_NAME record");
640 case bitc::TYPE_CODE_STRUCT_NAMED: { // STRUCT: [ispacked, eltty x N]
641 if (Record.size() < 1)
642 return Error("Invalid STRUCT type record");
644 if (NumRecords >= TypeList.size())
645 return Error("invalid TYPE table");
647 // Check to see if this was forward referenced, if so fill in the temp.
648 StructType *Res = cast_or_null<StructType>(TypeList[NumRecords]);
650 Res->setName(TypeName);
651 TypeList[NumRecords] = 0;
652 } else // Otherwise, create a new struct.
653 Res = StructType::create(Context, TypeName);
656 SmallVector<Type*, 8> EltTys;
657 for (unsigned i = 1, e = Record.size(); i != e; ++i) {
658 if (Type *T = getTypeByID(Record[i]))
663 if (EltTys.size() != Record.size()-1)
664 return Error("invalid STRUCT type record");
665 Res->setBody(EltTys, Record[0]);
669 case bitc::TYPE_CODE_OPAQUE: { // OPAQUE: []
670 if (Record.size() != 1)
671 return Error("Invalid OPAQUE type record");
673 if (NumRecords >= TypeList.size())
674 return Error("invalid TYPE table");
676 // Check to see if this was forward referenced, if so fill in the temp.
677 StructType *Res = cast_or_null<StructType>(TypeList[NumRecords]);
679 Res->setName(TypeName);
680 TypeList[NumRecords] = 0;
681 } else // Otherwise, create a new struct with no body.
682 Res = StructType::create(Context, TypeName);
687 case bitc::TYPE_CODE_ARRAY: // ARRAY: [numelts, eltty]
688 if (Record.size() < 2)
689 return Error("Invalid ARRAY type record");
690 if ((ResultTy = getTypeByID(Record[1])))
691 ResultTy = ArrayType::get(ResultTy, Record[0]);
693 return Error("Invalid ARRAY type element");
695 case bitc::TYPE_CODE_VECTOR: // VECTOR: [numelts, eltty]
696 if (Record.size() < 2)
697 return Error("Invalid VECTOR type record");
698 if ((ResultTy = getTypeByID(Record[1])))
699 ResultTy = VectorType::get(ResultTy, Record[0]);
701 return Error("Invalid ARRAY type element");
705 if (NumRecords >= TypeList.size())
706 return Error("invalid TYPE table");
707 assert(ResultTy && "Didn't read a type?");
708 assert(TypeList[NumRecords] == 0 && "Already read type?");
709 TypeList[NumRecords++] = ResultTy;
713 bool BitcodeReader::ParseValueSymbolTable() {
714 if (Stream.EnterSubBlock(bitc::VALUE_SYMTAB_BLOCK_ID))
715 return Error("Malformed block record");
717 SmallVector<uint64_t, 64> Record;
719 // Read all the records for this value table.
720 SmallString<128> ValueName;
722 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
724 switch (Entry.Kind) {
725 case BitstreamEntry::SubBlock: // Handled for us already.
726 case BitstreamEntry::Error:
727 return Error("malformed value symbol table block");
728 case BitstreamEntry::EndBlock:
730 case BitstreamEntry::Record:
731 // The interesting case.
737 switch (Stream.readRecord(Entry.ID, Record)) {
738 default: // Default behavior: unknown type.
740 case bitc::VST_CODE_ENTRY: { // VST_ENTRY: [valueid, namechar x N]
741 if (ConvertToString(Record, 1, ValueName))
742 return Error("Invalid VST_ENTRY record");
743 unsigned ValueID = Record[0];
744 if (ValueID >= ValueList.size())
745 return Error("Invalid Value ID in VST_ENTRY record");
746 Value *V = ValueList[ValueID];
748 V->setName(StringRef(ValueName.data(), ValueName.size()));
752 case bitc::VST_CODE_BBENTRY: {
753 if (ConvertToString(Record, 1, ValueName))
754 return Error("Invalid VST_BBENTRY record");
755 BasicBlock *BB = getBasicBlock(Record[0]);
757 return Error("Invalid BB ID in VST_BBENTRY record");
759 BB->setName(StringRef(ValueName.data(), ValueName.size()));
767 bool BitcodeReader::ParseMetadata() {
768 unsigned NextMDValueNo = MDValueList.size();
770 if (Stream.EnterSubBlock(bitc::METADATA_BLOCK_ID))
771 return Error("Malformed block record");
773 SmallVector<uint64_t, 64> Record;
775 // Read all the records.
777 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
779 switch (Entry.Kind) {
780 case BitstreamEntry::SubBlock: // Handled for us already.
781 case BitstreamEntry::Error:
782 Error("malformed metadata block");
784 case BitstreamEntry::EndBlock:
786 case BitstreamEntry::Record:
787 // The interesting case.
791 bool IsFunctionLocal = false;
794 unsigned Code = Stream.readRecord(Entry.ID, Record);
796 default: // Default behavior: ignore.
798 case bitc::METADATA_NAME: {
799 // Read name of the named metadata.
800 SmallString<8> Name(Record.begin(), Record.end());
802 Code = Stream.ReadCode();
804 // METADATA_NAME is always followed by METADATA_NAMED_NODE.
805 unsigned NextBitCode = Stream.readRecord(Code, Record);
806 assert(NextBitCode == bitc::METADATA_NAMED_NODE); (void)NextBitCode;
808 // Read named metadata elements.
809 unsigned Size = Record.size();
810 NamedMDNode *NMD = TheModule->getOrInsertNamedMetadata(Name);
811 for (unsigned i = 0; i != Size; ++i) {
812 MDNode *MD = dyn_cast<MDNode>(MDValueList.getValueFwdRef(Record[i]));
814 return Error("Malformed metadata record");
819 case bitc::METADATA_FN_NODE:
820 IsFunctionLocal = true;
822 case bitc::METADATA_NODE: {
823 if (Record.size() % 2 == 1)
824 return Error("Invalid METADATA_NODE record");
826 unsigned Size = Record.size();
827 SmallVector<Value*, 8> Elts;
828 for (unsigned i = 0; i != Size; i += 2) {
829 Type *Ty = getTypeByID(Record[i]);
830 if (!Ty) return Error("Invalid METADATA_NODE record");
831 if (Ty->isMetadataTy())
832 Elts.push_back(MDValueList.getValueFwdRef(Record[i+1]));
833 else if (!Ty->isVoidTy())
834 Elts.push_back(ValueList.getValueFwdRef(Record[i+1], Ty));
836 Elts.push_back(NULL);
838 Value *V = MDNode::getWhenValsUnresolved(Context, Elts, IsFunctionLocal);
839 IsFunctionLocal = false;
840 MDValueList.AssignValue(V, NextMDValueNo++);
843 case bitc::METADATA_STRING: {
844 SmallString<8> String(Record.begin(), Record.end());
845 Value *V = MDString::get(Context, String);
846 MDValueList.AssignValue(V, NextMDValueNo++);
849 case bitc::METADATA_KIND: {
850 if (Record.size() < 2)
851 return Error("Invalid METADATA_KIND record");
853 unsigned Kind = Record[0];
854 SmallString<8> Name(Record.begin()+1, Record.end());
856 unsigned NewKind = TheModule->getMDKindID(Name.str());
857 if (!MDKindMap.insert(std::make_pair(Kind, NewKind)).second)
858 return Error("Conflicting METADATA_KIND records");
865 /// decodeSignRotatedValue - Decode a signed value stored with the sign bit in
866 /// the LSB for dense VBR encoding.
867 uint64_t BitcodeReader::decodeSignRotatedValue(uint64_t V) {
872 // There is no such thing as -0 with integers. "-0" really means MININT.
876 /// ResolveGlobalAndAliasInits - Resolve all of the initializers for global
877 /// values and aliases that we can.
878 bool BitcodeReader::ResolveGlobalAndAliasInits() {
879 std::vector<std::pair<GlobalVariable*, unsigned> > GlobalInitWorklist;
880 std::vector<std::pair<GlobalAlias*, unsigned> > AliasInitWorklist;
882 GlobalInitWorklist.swap(GlobalInits);
883 AliasInitWorklist.swap(AliasInits);
885 while (!GlobalInitWorklist.empty()) {
886 unsigned ValID = GlobalInitWorklist.back().second;
887 if (ValID >= ValueList.size()) {
888 // Not ready to resolve this yet, it requires something later in the file.
889 GlobalInits.push_back(GlobalInitWorklist.back());
891 if (Constant *C = dyn_cast<Constant>(ValueList[ValID]))
892 GlobalInitWorklist.back().first->setInitializer(C);
894 return Error("Global variable initializer is not a constant!");
896 GlobalInitWorklist.pop_back();
899 while (!AliasInitWorklist.empty()) {
900 unsigned ValID = AliasInitWorklist.back().second;
901 if (ValID >= ValueList.size()) {
902 AliasInits.push_back(AliasInitWorklist.back());
904 if (Constant *C = dyn_cast<Constant>(ValueList[ValID]))
905 AliasInitWorklist.back().first->setAliasee(C);
907 return Error("Alias initializer is not a constant!");
909 AliasInitWorklist.pop_back();
914 static APInt ReadWideAPInt(ArrayRef<uint64_t> Vals, unsigned TypeBits) {
915 SmallVector<uint64_t, 8> Words(Vals.size());
916 std::transform(Vals.begin(), Vals.end(), Words.begin(),
917 BitcodeReader::decodeSignRotatedValue);
919 return APInt(TypeBits, Words);
922 bool BitcodeReader::ParseConstants() {
923 if (Stream.EnterSubBlock(bitc::CONSTANTS_BLOCK_ID))
924 return Error("Malformed block record");
926 SmallVector<uint64_t, 64> Record;
928 // Read all the records for this value table.
929 Type *CurTy = Type::getInt32Ty(Context);
930 unsigned NextCstNo = ValueList.size();
932 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
934 switch (Entry.Kind) {
935 case BitstreamEntry::SubBlock: // Handled for us already.
936 case BitstreamEntry::Error:
937 return Error("malformed block record in AST file");
938 case BitstreamEntry::EndBlock:
939 if (NextCstNo != ValueList.size())
940 return Error("Invalid constant reference!");
942 // Once all the constants have been read, go through and resolve forward
944 ValueList.ResolveConstantForwardRefs();
946 case BitstreamEntry::Record:
947 // The interesting case.
954 unsigned BitCode = Stream.readRecord(Entry.ID, Record);
956 default: // Default behavior: unknown constant
957 case bitc::CST_CODE_UNDEF: // UNDEF
958 V = UndefValue::get(CurTy);
960 case bitc::CST_CODE_SETTYPE: // SETTYPE: [typeid]
962 return Error("Malformed CST_SETTYPE record");
963 if (Record[0] >= TypeList.size())
964 return Error("Invalid Type ID in CST_SETTYPE record");
965 CurTy = TypeList[Record[0]];
966 continue; // Skip the ValueList manipulation.
967 case bitc::CST_CODE_NULL: // NULL
968 V = Constant::getNullValue(CurTy);
970 case bitc::CST_CODE_INTEGER: // INTEGER: [intval]
971 if (!CurTy->isIntegerTy() || Record.empty())
972 return Error("Invalid CST_INTEGER record");
973 V = ConstantInt::get(CurTy, decodeSignRotatedValue(Record[0]));
975 case bitc::CST_CODE_WIDE_INTEGER: {// WIDE_INTEGER: [n x intval]
976 if (!CurTy->isIntegerTy() || Record.empty())
977 return Error("Invalid WIDE_INTEGER record");
979 APInt VInt = ReadWideAPInt(Record,
980 cast<IntegerType>(CurTy)->getBitWidth());
981 V = ConstantInt::get(Context, VInt);
985 case bitc::CST_CODE_FLOAT: { // FLOAT: [fpval]
987 return Error("Invalid FLOAT record");
988 if (CurTy->isHalfTy())
989 V = ConstantFP::get(Context, APFloat(APInt(16, (uint16_t)Record[0])));
990 else if (CurTy->isFloatTy())
991 V = ConstantFP::get(Context, APFloat(APInt(32, (uint32_t)Record[0])));
992 else if (CurTy->isDoubleTy())
993 V = ConstantFP::get(Context, APFloat(APInt(64, Record[0])));
994 else if (CurTy->isX86_FP80Ty()) {
995 // Bits are not stored the same way as a normal i80 APInt, compensate.
996 uint64_t Rearrange[2];
997 Rearrange[0] = (Record[1] & 0xffffLL) | (Record[0] << 16);
998 Rearrange[1] = Record[0] >> 48;
999 V = ConstantFP::get(Context, APFloat(APInt(80, Rearrange)));
1000 } else if (CurTy->isFP128Ty())
1001 V = ConstantFP::get(Context, APFloat(APInt(128, Record), true));
1002 else if (CurTy->isPPC_FP128Ty())
1003 V = ConstantFP::get(Context, APFloat(APInt(128, Record)));
1005 V = UndefValue::get(CurTy);
1009 case bitc::CST_CODE_AGGREGATE: {// AGGREGATE: [n x value number]
1011 return Error("Invalid CST_AGGREGATE record");
1013 unsigned Size = Record.size();
1014 SmallVector<Constant*, 16> Elts;
1016 if (StructType *STy = dyn_cast<StructType>(CurTy)) {
1017 for (unsigned i = 0; i != Size; ++i)
1018 Elts.push_back(ValueList.getConstantFwdRef(Record[i],
1019 STy->getElementType(i)));
1020 V = ConstantStruct::get(STy, Elts);
1021 } else if (ArrayType *ATy = dyn_cast<ArrayType>(CurTy)) {
1022 Type *EltTy = ATy->getElementType();
1023 for (unsigned i = 0; i != Size; ++i)
1024 Elts.push_back(ValueList.getConstantFwdRef(Record[i], EltTy));
1025 V = ConstantArray::get(ATy, Elts);
1026 } else if (VectorType *VTy = dyn_cast<VectorType>(CurTy)) {
1027 Type *EltTy = VTy->getElementType();
1028 for (unsigned i = 0; i != Size; ++i)
1029 Elts.push_back(ValueList.getConstantFwdRef(Record[i], EltTy));
1030 V = ConstantVector::get(Elts);
1032 V = UndefValue::get(CurTy);
1036 case bitc::CST_CODE_STRING: // STRING: [values]
1037 case bitc::CST_CODE_CSTRING: { // CSTRING: [values]
1039 return Error("Invalid CST_STRING record");
1041 SmallString<16> Elts(Record.begin(), Record.end());
1042 V = ConstantDataArray::getString(Context, Elts,
1043 BitCode == bitc::CST_CODE_CSTRING);
1046 case bitc::CST_CODE_DATA: {// DATA: [n x value]
1048 return Error("Invalid CST_DATA record");
1050 Type *EltTy = cast<SequentialType>(CurTy)->getElementType();
1051 unsigned Size = Record.size();
1053 if (EltTy->isIntegerTy(8)) {
1054 SmallVector<uint8_t, 16> Elts(Record.begin(), Record.end());
1055 if (isa<VectorType>(CurTy))
1056 V = ConstantDataVector::get(Context, Elts);
1058 V = ConstantDataArray::get(Context, Elts);
1059 } else if (EltTy->isIntegerTy(16)) {
1060 SmallVector<uint16_t, 16> Elts(Record.begin(), Record.end());
1061 if (isa<VectorType>(CurTy))
1062 V = ConstantDataVector::get(Context, Elts);
1064 V = ConstantDataArray::get(Context, Elts);
1065 } else if (EltTy->isIntegerTy(32)) {
1066 SmallVector<uint32_t, 16> Elts(Record.begin(), Record.end());
1067 if (isa<VectorType>(CurTy))
1068 V = ConstantDataVector::get(Context, Elts);
1070 V = ConstantDataArray::get(Context, Elts);
1071 } else if (EltTy->isIntegerTy(64)) {
1072 SmallVector<uint64_t, 16> Elts(Record.begin(), Record.end());
1073 if (isa<VectorType>(CurTy))
1074 V = ConstantDataVector::get(Context, Elts);
1076 V = ConstantDataArray::get(Context, Elts);
1077 } else if (EltTy->isFloatTy()) {
1078 SmallVector<float, 16> Elts(Size);
1079 std::transform(Record.begin(), Record.end(), Elts.begin(), BitsToFloat);
1080 if (isa<VectorType>(CurTy))
1081 V = ConstantDataVector::get(Context, Elts);
1083 V = ConstantDataArray::get(Context, Elts);
1084 } else if (EltTy->isDoubleTy()) {
1085 SmallVector<double, 16> Elts(Size);
1086 std::transform(Record.begin(), Record.end(), Elts.begin(),
1088 if (isa<VectorType>(CurTy))
1089 V = ConstantDataVector::get(Context, Elts);
1091 V = ConstantDataArray::get(Context, Elts);
1093 return Error("Unknown element type in CE_DATA");
1098 case bitc::CST_CODE_CE_BINOP: { // CE_BINOP: [opcode, opval, opval]
1099 if (Record.size() < 3) return Error("Invalid CE_BINOP record");
1100 int Opc = GetDecodedBinaryOpcode(Record[0], CurTy);
1102 V = UndefValue::get(CurTy); // Unknown binop.
1104 Constant *LHS = ValueList.getConstantFwdRef(Record[1], CurTy);
1105 Constant *RHS = ValueList.getConstantFwdRef(Record[2], CurTy);
1107 if (Record.size() >= 4) {
1108 if (Opc == Instruction::Add ||
1109 Opc == Instruction::Sub ||
1110 Opc == Instruction::Mul ||
1111 Opc == Instruction::Shl) {
1112 if (Record[3] & (1 << bitc::OBO_NO_SIGNED_WRAP))
1113 Flags |= OverflowingBinaryOperator::NoSignedWrap;
1114 if (Record[3] & (1 << bitc::OBO_NO_UNSIGNED_WRAP))
1115 Flags |= OverflowingBinaryOperator::NoUnsignedWrap;
1116 } else if (Opc == Instruction::SDiv ||
1117 Opc == Instruction::UDiv ||
1118 Opc == Instruction::LShr ||
1119 Opc == Instruction::AShr) {
1120 if (Record[3] & (1 << bitc::PEO_EXACT))
1121 Flags |= SDivOperator::IsExact;
1124 V = ConstantExpr::get(Opc, LHS, RHS, Flags);
1128 case bitc::CST_CODE_CE_CAST: { // CE_CAST: [opcode, opty, opval]
1129 if (Record.size() < 3) return Error("Invalid CE_CAST record");
1130 int Opc = GetDecodedCastOpcode(Record[0]);
1132 V = UndefValue::get(CurTy); // Unknown cast.
1134 Type *OpTy = getTypeByID(Record[1]);
1135 if (!OpTy) return Error("Invalid CE_CAST record");
1136 Constant *Op = ValueList.getConstantFwdRef(Record[2], OpTy);
1137 V = ConstantExpr::getCast(Opc, Op, CurTy);
1141 case bitc::CST_CODE_CE_INBOUNDS_GEP:
1142 case bitc::CST_CODE_CE_GEP: { // CE_GEP: [n x operands]
1143 if (Record.size() & 1) return Error("Invalid CE_GEP record");
1144 SmallVector<Constant*, 16> Elts;
1145 for (unsigned i = 0, e = Record.size(); i != e; i += 2) {
1146 Type *ElTy = getTypeByID(Record[i]);
1147 if (!ElTy) return Error("Invalid CE_GEP record");
1148 Elts.push_back(ValueList.getConstantFwdRef(Record[i+1], ElTy));
1150 ArrayRef<Constant *> Indices(Elts.begin() + 1, Elts.end());
1151 V = ConstantExpr::getGetElementPtr(Elts[0], Indices,
1153 bitc::CST_CODE_CE_INBOUNDS_GEP);
1156 case bitc::CST_CODE_CE_SELECT: // CE_SELECT: [opval#, opval#, opval#]
1157 if (Record.size() < 3) return Error("Invalid CE_SELECT record");
1158 V = ConstantExpr::getSelect(
1159 ValueList.getConstantFwdRef(Record[0],
1160 Type::getInt1Ty(Context)),
1161 ValueList.getConstantFwdRef(Record[1],CurTy),
1162 ValueList.getConstantFwdRef(Record[2],CurTy));
1164 case bitc::CST_CODE_CE_EXTRACTELT: { // CE_EXTRACTELT: [opty, opval, opval]
1165 if (Record.size() < 3) return Error("Invalid CE_EXTRACTELT record");
1167 dyn_cast_or_null<VectorType>(getTypeByID(Record[0]));
1168 if (OpTy == 0) return Error("Invalid CE_EXTRACTELT record");
1169 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy);
1170 Constant *Op1 = ValueList.getConstantFwdRef(Record[2],
1171 Type::getInt32Ty(Context));
1172 V = ConstantExpr::getExtractElement(Op0, Op1);
1175 case bitc::CST_CODE_CE_INSERTELT: { // CE_INSERTELT: [opval, opval, opval]
1176 VectorType *OpTy = dyn_cast<VectorType>(CurTy);
1177 if (Record.size() < 3 || OpTy == 0)
1178 return Error("Invalid CE_INSERTELT record");
1179 Constant *Op0 = ValueList.getConstantFwdRef(Record[0], OpTy);
1180 Constant *Op1 = ValueList.getConstantFwdRef(Record[1],
1181 OpTy->getElementType());
1182 Constant *Op2 = ValueList.getConstantFwdRef(Record[2],
1183 Type::getInt32Ty(Context));
1184 V = ConstantExpr::getInsertElement(Op0, Op1, Op2);
1187 case bitc::CST_CODE_CE_SHUFFLEVEC: { // CE_SHUFFLEVEC: [opval, opval, opval]
1188 VectorType *OpTy = dyn_cast<VectorType>(CurTy);
1189 if (Record.size() < 3 || OpTy == 0)
1190 return Error("Invalid CE_SHUFFLEVEC record");
1191 Constant *Op0 = ValueList.getConstantFwdRef(Record[0], OpTy);
1192 Constant *Op1 = ValueList.getConstantFwdRef(Record[1], OpTy);
1193 Type *ShufTy = VectorType::get(Type::getInt32Ty(Context),
1194 OpTy->getNumElements());
1195 Constant *Op2 = ValueList.getConstantFwdRef(Record[2], ShufTy);
1196 V = ConstantExpr::getShuffleVector(Op0, Op1, Op2);
1199 case bitc::CST_CODE_CE_SHUFVEC_EX: { // [opty, opval, opval, opval]
1200 VectorType *RTy = dyn_cast<VectorType>(CurTy);
1202 dyn_cast_or_null<VectorType>(getTypeByID(Record[0]));
1203 if (Record.size() < 4 || RTy == 0 || OpTy == 0)
1204 return Error("Invalid CE_SHUFVEC_EX record");
1205 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy);
1206 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], OpTy);
1207 Type *ShufTy = VectorType::get(Type::getInt32Ty(Context),
1208 RTy->getNumElements());
1209 Constant *Op2 = ValueList.getConstantFwdRef(Record[3], ShufTy);
1210 V = ConstantExpr::getShuffleVector(Op0, Op1, Op2);
1213 case bitc::CST_CODE_CE_CMP: { // CE_CMP: [opty, opval, opval, pred]
1214 if (Record.size() < 4) return Error("Invalid CE_CMP record");
1215 Type *OpTy = getTypeByID(Record[0]);
1216 if (OpTy == 0) return Error("Invalid CE_CMP record");
1217 Constant *Op0 = ValueList.getConstantFwdRef(Record[1], OpTy);
1218 Constant *Op1 = ValueList.getConstantFwdRef(Record[2], OpTy);
1220 if (OpTy->isFPOrFPVectorTy())
1221 V = ConstantExpr::getFCmp(Record[3], Op0, Op1);
1223 V = ConstantExpr::getICmp(Record[3], Op0, Op1);
1226 // This maintains backward compatibility, pre-asm dialect keywords.
1227 // FIXME: Remove with the 4.0 release.
1228 case bitc::CST_CODE_INLINEASM_OLD: {
1229 if (Record.size() < 2) return Error("Invalid INLINEASM record");
1230 std::string AsmStr, ConstrStr;
1231 bool HasSideEffects = Record[0] & 1;
1232 bool IsAlignStack = Record[0] >> 1;
1233 unsigned AsmStrSize = Record[1];
1234 if (2+AsmStrSize >= Record.size())
1235 return Error("Invalid INLINEASM record");
1236 unsigned ConstStrSize = Record[2+AsmStrSize];
1237 if (3+AsmStrSize+ConstStrSize > Record.size())
1238 return Error("Invalid INLINEASM record");
1240 for (unsigned i = 0; i != AsmStrSize; ++i)
1241 AsmStr += (char)Record[2+i];
1242 for (unsigned i = 0; i != ConstStrSize; ++i)
1243 ConstrStr += (char)Record[3+AsmStrSize+i];
1244 PointerType *PTy = cast<PointerType>(CurTy);
1245 V = InlineAsm::get(cast<FunctionType>(PTy->getElementType()),
1246 AsmStr, ConstrStr, HasSideEffects, IsAlignStack);
1249 // This version adds support for the asm dialect keywords (e.g.,
1251 case bitc::CST_CODE_INLINEASM: {
1252 if (Record.size() < 2) return Error("Invalid INLINEASM record");
1253 std::string AsmStr, ConstrStr;
1254 bool HasSideEffects = Record[0] & 1;
1255 bool IsAlignStack = (Record[0] >> 1) & 1;
1256 unsigned AsmDialect = Record[0] >> 2;
1257 unsigned AsmStrSize = Record[1];
1258 if (2+AsmStrSize >= Record.size())
1259 return Error("Invalid INLINEASM record");
1260 unsigned ConstStrSize = Record[2+AsmStrSize];
1261 if (3+AsmStrSize+ConstStrSize > Record.size())
1262 return Error("Invalid INLINEASM record");
1264 for (unsigned i = 0; i != AsmStrSize; ++i)
1265 AsmStr += (char)Record[2+i];
1266 for (unsigned i = 0; i != ConstStrSize; ++i)
1267 ConstrStr += (char)Record[3+AsmStrSize+i];
1268 PointerType *PTy = cast<PointerType>(CurTy);
1269 V = InlineAsm::get(cast<FunctionType>(PTy->getElementType()),
1270 AsmStr, ConstrStr, HasSideEffects, IsAlignStack,
1271 InlineAsm::AsmDialect(AsmDialect));
1274 case bitc::CST_CODE_BLOCKADDRESS:{
1275 if (Record.size() < 3) return Error("Invalid CE_BLOCKADDRESS record");
1276 Type *FnTy = getTypeByID(Record[0]);
1277 if (FnTy == 0) return Error("Invalid CE_BLOCKADDRESS record");
1279 dyn_cast_or_null<Function>(ValueList.getConstantFwdRef(Record[1],FnTy));
1280 if (Fn == 0) return Error("Invalid CE_BLOCKADDRESS record");
1282 // If the function is already parsed we can insert the block address right
1285 Function::iterator BBI = Fn->begin(), BBE = Fn->end();
1286 for (size_t I = 0, E = Record[2]; I != E; ++I) {
1288 return Error("Invalid blockaddress block #");
1291 V = BlockAddress::get(Fn, BBI);
1293 // Otherwise insert a placeholder and remember it so it can be inserted
1294 // when the function is parsed.
1295 GlobalVariable *FwdRef = new GlobalVariable(*Fn->getParent(),
1296 Type::getInt8Ty(Context),
1297 false, GlobalValue::InternalLinkage,
1299 BlockAddrFwdRefs[Fn].push_back(std::make_pair(Record[2], FwdRef));
1306 ValueList.AssignValue(V, NextCstNo);
1311 bool BitcodeReader::ParseUseLists() {
1312 if (Stream.EnterSubBlock(bitc::USELIST_BLOCK_ID))
1313 return Error("Malformed block record");
1315 SmallVector<uint64_t, 64> Record;
1317 // Read all the records.
1319 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
1321 switch (Entry.Kind) {
1322 case BitstreamEntry::SubBlock: // Handled for us already.
1323 case BitstreamEntry::Error:
1324 return Error("malformed use list block");
1325 case BitstreamEntry::EndBlock:
1327 case BitstreamEntry::Record:
1328 // The interesting case.
1332 // Read a use list record.
1334 switch (Stream.readRecord(Entry.ID, Record)) {
1335 default: // Default behavior: unknown type.
1337 case bitc::USELIST_CODE_ENTRY: { // USELIST_CODE_ENTRY: TBD.
1338 unsigned RecordLength = Record.size();
1339 if (RecordLength < 1)
1340 return Error ("Invalid UseList reader!");
1341 UseListRecords.push_back(Record);
1348 /// RememberAndSkipFunctionBody - When we see the block for a function body,
1349 /// remember where it is and then skip it. This lets us lazily deserialize the
1351 bool BitcodeReader::RememberAndSkipFunctionBody() {
1352 // Get the function we are talking about.
1353 if (FunctionsWithBodies.empty())
1354 return Error("Insufficient function protos");
1356 Function *Fn = FunctionsWithBodies.back();
1357 FunctionsWithBodies.pop_back();
1359 // Save the current stream state.
1360 uint64_t CurBit = Stream.GetCurrentBitNo();
1361 DeferredFunctionInfo[Fn] = CurBit;
1363 // Skip over the function block for now.
1364 if (Stream.SkipBlock())
1365 return Error("Malformed block record");
1369 bool BitcodeReader::GlobalCleanup() {
1370 // Patch the initializers for globals and aliases up.
1371 ResolveGlobalAndAliasInits();
1372 if (!GlobalInits.empty() || !AliasInits.empty())
1373 return Error("Malformed global initializer set");
1375 // Look for intrinsic functions which need to be upgraded at some point
1376 for (Module::iterator FI = TheModule->begin(), FE = TheModule->end();
1379 if (UpgradeIntrinsicFunction(FI, NewFn))
1380 UpgradedIntrinsics.push_back(std::make_pair(FI, NewFn));
1383 // Look for global variables which need to be renamed.
1384 for (Module::global_iterator
1385 GI = TheModule->global_begin(), GE = TheModule->global_end();
1387 UpgradeGlobalVariable(GI);
1388 // Force deallocation of memory for these vectors to favor the client that
1389 // want lazy deserialization.
1390 std::vector<std::pair<GlobalVariable*, unsigned> >().swap(GlobalInits);
1391 std::vector<std::pair<GlobalAlias*, unsigned> >().swap(AliasInits);
1395 bool BitcodeReader::ParseModule(bool Resume) {
1397 Stream.JumpToBit(NextUnreadBit);
1398 else if (Stream.EnterSubBlock(bitc::MODULE_BLOCK_ID))
1399 return Error("Malformed block record");
1401 SmallVector<uint64_t, 64> Record;
1402 std::vector<std::string> SectionTable;
1403 std::vector<std::string> GCTable;
1405 // Read all the records for this module.
1407 BitstreamEntry Entry = Stream.advance();
1409 switch (Entry.Kind) {
1410 case BitstreamEntry::Error:
1411 Error("malformed module block");
1413 case BitstreamEntry::EndBlock:
1414 return GlobalCleanup();
1416 case BitstreamEntry::SubBlock:
1418 default: // Skip unknown content.
1419 if (Stream.SkipBlock())
1420 return Error("Malformed block record");
1422 case bitc::BLOCKINFO_BLOCK_ID:
1423 if (Stream.ReadBlockInfoBlock())
1424 return Error("Malformed BlockInfoBlock");
1426 case bitc::PARAMATTR_BLOCK_ID:
1427 if (ParseAttributeBlock())
1430 case bitc::TYPE_BLOCK_ID_NEW:
1431 if (ParseTypeTable())
1434 case bitc::VALUE_SYMTAB_BLOCK_ID:
1435 if (ParseValueSymbolTable())
1437 SeenValueSymbolTable = true;
1439 case bitc::CONSTANTS_BLOCK_ID:
1440 if (ParseConstants() || ResolveGlobalAndAliasInits())
1443 case bitc::METADATA_BLOCK_ID:
1444 if (ParseMetadata())
1447 case bitc::FUNCTION_BLOCK_ID:
1448 // If this is the first function body we've seen, reverse the
1449 // FunctionsWithBodies list.
1450 if (!SeenFirstFunctionBody) {
1451 std::reverse(FunctionsWithBodies.begin(), FunctionsWithBodies.end());
1452 if (GlobalCleanup())
1454 SeenFirstFunctionBody = true;
1457 if (RememberAndSkipFunctionBody())
1459 // For streaming bitcode, suspend parsing when we reach the function
1460 // bodies. Subsequent materialization calls will resume it when
1461 // necessary. For streaming, the function bodies must be at the end of
1462 // the bitcode. If the bitcode file is old, the symbol table will be
1463 // at the end instead and will not have been seen yet. In this case,
1464 // just finish the parse now.
1465 if (LazyStreamer && SeenValueSymbolTable) {
1466 NextUnreadBit = Stream.GetCurrentBitNo();
1470 case bitc::USELIST_BLOCK_ID:
1471 if (ParseUseLists())
1477 case BitstreamEntry::Record:
1478 // The interesting case.
1484 switch (Stream.readRecord(Entry.ID, Record)) {
1485 default: break; // Default behavior, ignore unknown content.
1486 case bitc::MODULE_CODE_VERSION: { // VERSION: [version#]
1487 if (Record.size() < 1)
1488 return Error("Malformed MODULE_CODE_VERSION");
1489 // Only version #0 and #1 are supported so far.
1490 unsigned module_version = Record[0];
1491 switch (module_version) {
1492 default: return Error("Unknown bitstream version!");
1494 UseRelativeIDs = false;
1497 UseRelativeIDs = true;
1502 case bitc::MODULE_CODE_TRIPLE: { // TRIPLE: [strchr x N]
1504 if (ConvertToString(Record, 0, S))
1505 return Error("Invalid MODULE_CODE_TRIPLE record");
1506 TheModule->setTargetTriple(S);
1509 case bitc::MODULE_CODE_DATALAYOUT: { // DATALAYOUT: [strchr x N]
1511 if (ConvertToString(Record, 0, S))
1512 return Error("Invalid MODULE_CODE_DATALAYOUT record");
1513 TheModule->setDataLayout(S);
1516 case bitc::MODULE_CODE_ASM: { // ASM: [strchr x N]
1518 if (ConvertToString(Record, 0, S))
1519 return Error("Invalid MODULE_CODE_ASM record");
1520 TheModule->setModuleInlineAsm(S);
1523 case bitc::MODULE_CODE_DEPLIB: { // DEPLIB: [strchr x N]
1524 // FIXME: Remove in 4.0.
1526 if (ConvertToString(Record, 0, S))
1527 return Error("Invalid MODULE_CODE_DEPLIB record");
1531 case bitc::MODULE_CODE_SECTIONNAME: { // SECTIONNAME: [strchr x N]
1533 if (ConvertToString(Record, 0, S))
1534 return Error("Invalid MODULE_CODE_SECTIONNAME record");
1535 SectionTable.push_back(S);
1538 case bitc::MODULE_CODE_GCNAME: { // SECTIONNAME: [strchr x N]
1540 if (ConvertToString(Record, 0, S))
1541 return Error("Invalid MODULE_CODE_GCNAME record");
1542 GCTable.push_back(S);
1545 // GLOBALVAR: [pointer type, isconst, initid,
1546 // linkage, alignment, section, visibility, threadlocal,
1548 case bitc::MODULE_CODE_GLOBALVAR: {
1549 if (Record.size() < 6)
1550 return Error("Invalid MODULE_CODE_GLOBALVAR record");
1551 Type *Ty = getTypeByID(Record[0]);
1552 if (!Ty) return Error("Invalid MODULE_CODE_GLOBALVAR record");
1553 if (!Ty->isPointerTy())
1554 return Error("Global not a pointer type!");
1555 unsigned AddressSpace = cast<PointerType>(Ty)->getAddressSpace();
1556 Ty = cast<PointerType>(Ty)->getElementType();
1558 bool isConstant = Record[1];
1559 GlobalValue::LinkageTypes Linkage = GetDecodedLinkage(Record[3]);
1560 unsigned Alignment = (1 << Record[4]) >> 1;
1561 std::string Section;
1563 if (Record[5]-1 >= SectionTable.size())
1564 return Error("Invalid section ID");
1565 Section = SectionTable[Record[5]-1];
1567 GlobalValue::VisibilityTypes Visibility = GlobalValue::DefaultVisibility;
1568 if (Record.size() > 6)
1569 Visibility = GetDecodedVisibility(Record[6]);
1571 GlobalVariable::ThreadLocalMode TLM = GlobalVariable::NotThreadLocal;
1572 if (Record.size() > 7)
1573 TLM = GetDecodedThreadLocalMode(Record[7]);
1575 bool UnnamedAddr = false;
1576 if (Record.size() > 8)
1577 UnnamedAddr = Record[8];
1579 GlobalVariable *NewGV =
1580 new GlobalVariable(*TheModule, Ty, isConstant, Linkage, 0, "", 0,
1582 NewGV->setAlignment(Alignment);
1583 if (!Section.empty())
1584 NewGV->setSection(Section);
1585 NewGV->setVisibility(Visibility);
1586 NewGV->setUnnamedAddr(UnnamedAddr);
1588 ValueList.push_back(NewGV);
1590 // Remember which value to use for the global initializer.
1591 if (unsigned InitID = Record[2])
1592 GlobalInits.push_back(std::make_pair(NewGV, InitID-1));
1595 // FUNCTION: [type, callingconv, isproto, linkage, paramattr,
1596 // alignment, section, visibility, gc, unnamed_addr]
1597 case bitc::MODULE_CODE_FUNCTION: {
1598 if (Record.size() < 8)
1599 return Error("Invalid MODULE_CODE_FUNCTION record");
1600 Type *Ty = getTypeByID(Record[0]);
1601 if (!Ty) return Error("Invalid MODULE_CODE_FUNCTION record");
1602 if (!Ty->isPointerTy())
1603 return Error("Function not a pointer type!");
1605 dyn_cast<FunctionType>(cast<PointerType>(Ty)->getElementType());
1607 return Error("Function not a pointer to function type!");
1609 Function *Func = Function::Create(FTy, GlobalValue::ExternalLinkage,
1612 Func->setCallingConv(static_cast<CallingConv::ID>(Record[1]));
1613 bool isProto = Record[2];
1614 Func->setLinkage(GetDecodedLinkage(Record[3]));
1615 Func->setAttributes(getAttributes(Record[4]));
1617 Func->setAlignment((1 << Record[5]) >> 1);
1619 if (Record[6]-1 >= SectionTable.size())
1620 return Error("Invalid section ID");
1621 Func->setSection(SectionTable[Record[6]-1]);
1623 Func->setVisibility(GetDecodedVisibility(Record[7]));
1624 if (Record.size() > 8 && Record[8]) {
1625 if (Record[8]-1 > GCTable.size())
1626 return Error("Invalid GC ID");
1627 Func->setGC(GCTable[Record[8]-1].c_str());
1629 bool UnnamedAddr = false;
1630 if (Record.size() > 9)
1631 UnnamedAddr = Record[9];
1632 Func->setUnnamedAddr(UnnamedAddr);
1633 ValueList.push_back(Func);
1635 // If this is a function with a body, remember the prototype we are
1636 // creating now, so that we can match up the body with them later.
1638 FunctionsWithBodies.push_back(Func);
1639 if (LazyStreamer) DeferredFunctionInfo[Func] = 0;
1643 // ALIAS: [alias type, aliasee val#, linkage]
1644 // ALIAS: [alias type, aliasee val#, linkage, visibility]
1645 case bitc::MODULE_CODE_ALIAS: {
1646 if (Record.size() < 3)
1647 return Error("Invalid MODULE_ALIAS record");
1648 Type *Ty = getTypeByID(Record[0]);
1649 if (!Ty) return Error("Invalid MODULE_ALIAS record");
1650 if (!Ty->isPointerTy())
1651 return Error("Function not a pointer type!");
1653 GlobalAlias *NewGA = new GlobalAlias(Ty, GetDecodedLinkage(Record[2]),
1655 // Old bitcode files didn't have visibility field.
1656 if (Record.size() > 3)
1657 NewGA->setVisibility(GetDecodedVisibility(Record[3]));
1658 ValueList.push_back(NewGA);
1659 AliasInits.push_back(std::make_pair(NewGA, Record[1]));
1662 /// MODULE_CODE_PURGEVALS: [numvals]
1663 case bitc::MODULE_CODE_PURGEVALS:
1664 // Trim down the value list to the specified size.
1665 if (Record.size() < 1 || Record[0] > ValueList.size())
1666 return Error("Invalid MODULE_PURGEVALS record");
1667 ValueList.shrinkTo(Record[0]);
1674 bool BitcodeReader::ParseBitcodeInto(Module *M) {
1677 if (InitStream()) return true;
1679 // Sniff for the signature.
1680 if (Stream.Read(8) != 'B' ||
1681 Stream.Read(8) != 'C' ||
1682 Stream.Read(4) != 0x0 ||
1683 Stream.Read(4) != 0xC ||
1684 Stream.Read(4) != 0xE ||
1685 Stream.Read(4) != 0xD)
1686 return Error("Invalid bitcode signature");
1688 // We expect a number of well-defined blocks, though we don't necessarily
1689 // need to understand them all.
1691 if (Stream.AtEndOfStream())
1694 BitstreamEntry Entry =
1695 Stream.advance(BitstreamCursor::AF_DontAutoprocessAbbrevs);
1697 switch (Entry.Kind) {
1698 case BitstreamEntry::Error:
1699 Error("malformed module file");
1701 case BitstreamEntry::EndBlock:
1704 case BitstreamEntry::SubBlock:
1706 case bitc::BLOCKINFO_BLOCK_ID:
1707 if (Stream.ReadBlockInfoBlock())
1708 return Error("Malformed BlockInfoBlock");
1710 case bitc::MODULE_BLOCK_ID:
1711 // Reject multiple MODULE_BLOCK's in a single bitstream.
1713 return Error("Multiple MODULE_BLOCKs in same stream");
1715 if (ParseModule(false))
1717 if (LazyStreamer) return false;
1720 if (Stream.SkipBlock())
1721 return Error("Malformed block record");
1725 case BitstreamEntry::Record:
1726 // There should be no records in the top-level of blocks.
1728 // The ranlib in Xcode 4 will align archive members by appending newlines
1729 // to the end of them. If this file size is a multiple of 4 but not 8, we
1730 // have to read and ignore these final 4 bytes :-(
1731 if (Stream.getAbbrevIDWidth() == 2 && Entry.ID == 2 &&
1732 Stream.Read(6) == 2 && Stream.Read(24) == 0xa0a0a &&
1733 Stream.AtEndOfStream())
1736 return Error("Invalid record at top-level");
1741 bool BitcodeReader::ParseModuleTriple(std::string &Triple) {
1742 if (Stream.EnterSubBlock(bitc::MODULE_BLOCK_ID))
1743 return Error("Malformed block record");
1745 SmallVector<uint64_t, 64> Record;
1747 // Read all the records for this module.
1749 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
1751 switch (Entry.Kind) {
1752 case BitstreamEntry::SubBlock: // Handled for us already.
1753 case BitstreamEntry::Error:
1754 return Error("malformed module block");
1755 case BitstreamEntry::EndBlock:
1757 case BitstreamEntry::Record:
1758 // The interesting case.
1763 switch (Stream.readRecord(Entry.ID, Record)) {
1764 default: break; // Default behavior, ignore unknown content.
1765 case bitc::MODULE_CODE_TRIPLE: { // TRIPLE: [strchr x N]
1767 if (ConvertToString(Record, 0, S))
1768 return Error("Invalid MODULE_CODE_TRIPLE record");
1777 bool BitcodeReader::ParseTriple(std::string &Triple) {
1778 if (InitStream()) return true;
1780 // Sniff for the signature.
1781 if (Stream.Read(8) != 'B' ||
1782 Stream.Read(8) != 'C' ||
1783 Stream.Read(4) != 0x0 ||
1784 Stream.Read(4) != 0xC ||
1785 Stream.Read(4) != 0xE ||
1786 Stream.Read(4) != 0xD)
1787 return Error("Invalid bitcode signature");
1789 // We expect a number of well-defined blocks, though we don't necessarily
1790 // need to understand them all.
1792 BitstreamEntry Entry = Stream.advance();
1794 switch (Entry.Kind) {
1795 case BitstreamEntry::Error:
1796 Error("malformed module file");
1798 case BitstreamEntry::EndBlock:
1801 case BitstreamEntry::SubBlock:
1802 if (Entry.ID == bitc::MODULE_BLOCK_ID)
1803 return ParseModuleTriple(Triple);
1805 // Ignore other sub-blocks.
1806 if (Stream.SkipBlock()) {
1807 Error("malformed block record in AST file");
1812 case BitstreamEntry::Record:
1813 Stream.skipRecord(Entry.ID);
1819 /// ParseMetadataAttachment - Parse metadata attachments.
1820 bool BitcodeReader::ParseMetadataAttachment() {
1821 if (Stream.EnterSubBlock(bitc::METADATA_ATTACHMENT_ID))
1822 return Error("Malformed block record");
1824 SmallVector<uint64_t, 64> Record;
1826 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
1828 switch (Entry.Kind) {
1829 case BitstreamEntry::SubBlock: // Handled for us already.
1830 case BitstreamEntry::Error:
1831 return Error("malformed metadata block");
1832 case BitstreamEntry::EndBlock:
1834 case BitstreamEntry::Record:
1835 // The interesting case.
1839 // Read a metadata attachment record.
1841 switch (Stream.readRecord(Entry.ID, Record)) {
1842 default: // Default behavior: ignore.
1844 case bitc::METADATA_ATTACHMENT: {
1845 unsigned RecordLength = Record.size();
1846 if (Record.empty() || (RecordLength - 1) % 2 == 1)
1847 return Error ("Invalid METADATA_ATTACHMENT reader!");
1848 Instruction *Inst = InstructionList[Record[0]];
1849 for (unsigned i = 1; i != RecordLength; i = i+2) {
1850 unsigned Kind = Record[i];
1851 DenseMap<unsigned, unsigned>::iterator I =
1852 MDKindMap.find(Kind);
1853 if (I == MDKindMap.end())
1854 return Error("Invalid metadata kind ID");
1855 Value *Node = MDValueList.getValueFwdRef(Record[i+1]);
1856 Inst->setMetadata(I->second, cast<MDNode>(Node));
1864 /// ParseFunctionBody - Lazily parse the specified function body block.
1865 bool BitcodeReader::ParseFunctionBody(Function *F) {
1866 if (Stream.EnterSubBlock(bitc::FUNCTION_BLOCK_ID))
1867 return Error("Malformed block record");
1869 InstructionList.clear();
1870 unsigned ModuleValueListSize = ValueList.size();
1871 unsigned ModuleMDValueListSize = MDValueList.size();
1873 // Add all the function arguments to the value table.
1874 for(Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I)
1875 ValueList.push_back(I);
1877 unsigned NextValueNo = ValueList.size();
1878 BasicBlock *CurBB = 0;
1879 unsigned CurBBNo = 0;
1883 // Read all the records.
1884 SmallVector<uint64_t, 64> Record;
1886 BitstreamEntry Entry = Stream.advance();
1888 switch (Entry.Kind) {
1889 case BitstreamEntry::Error:
1890 return Error("Bitcode error in function block");
1891 case BitstreamEntry::EndBlock:
1892 goto OutOfRecordLoop;
1894 case BitstreamEntry::SubBlock:
1896 default: // Skip unknown content.
1897 if (Stream.SkipBlock())
1898 return Error("Malformed block record");
1900 case bitc::CONSTANTS_BLOCK_ID:
1901 if (ParseConstants()) return true;
1902 NextValueNo = ValueList.size();
1904 case bitc::VALUE_SYMTAB_BLOCK_ID:
1905 if (ParseValueSymbolTable()) return true;
1907 case bitc::METADATA_ATTACHMENT_ID:
1908 if (ParseMetadataAttachment()) return true;
1910 case bitc::METADATA_BLOCK_ID:
1911 if (ParseMetadata()) return true;
1916 case BitstreamEntry::Record:
1917 // The interesting case.
1924 unsigned BitCode = Stream.readRecord(Entry.ID, Record);
1926 default: // Default behavior: reject
1927 return Error("Unknown instruction");
1928 case bitc::FUNC_CODE_DECLAREBLOCKS: // DECLAREBLOCKS: [nblocks]
1929 if (Record.size() < 1 || Record[0] == 0)
1930 return Error("Invalid DECLAREBLOCKS record");
1931 // Create all the basic blocks for the function.
1932 FunctionBBs.resize(Record[0]);
1933 for (unsigned i = 0, e = FunctionBBs.size(); i != e; ++i)
1934 FunctionBBs[i] = BasicBlock::Create(Context, "", F);
1935 CurBB = FunctionBBs[0];
1938 case bitc::FUNC_CODE_DEBUG_LOC_AGAIN: // DEBUG_LOC_AGAIN
1939 // This record indicates that the last instruction is at the same
1940 // location as the previous instruction with a location.
1943 // Get the last instruction emitted.
1944 if (CurBB && !CurBB->empty())
1946 else if (CurBBNo && FunctionBBs[CurBBNo-1] &&
1947 !FunctionBBs[CurBBNo-1]->empty())
1948 I = &FunctionBBs[CurBBNo-1]->back();
1950 if (I == 0) return Error("Invalid DEBUG_LOC_AGAIN record");
1951 I->setDebugLoc(LastLoc);
1955 case bitc::FUNC_CODE_DEBUG_LOC: { // DEBUG_LOC: [line, col, scope, ia]
1956 I = 0; // Get the last instruction emitted.
1957 if (CurBB && !CurBB->empty())
1959 else if (CurBBNo && FunctionBBs[CurBBNo-1] &&
1960 !FunctionBBs[CurBBNo-1]->empty())
1961 I = &FunctionBBs[CurBBNo-1]->back();
1962 if (I == 0 || Record.size() < 4)
1963 return Error("Invalid FUNC_CODE_DEBUG_LOC record");
1965 unsigned Line = Record[0], Col = Record[1];
1966 unsigned ScopeID = Record[2], IAID = Record[3];
1968 MDNode *Scope = 0, *IA = 0;
1969 if (ScopeID) Scope = cast<MDNode>(MDValueList.getValueFwdRef(ScopeID-1));
1970 if (IAID) IA = cast<MDNode>(MDValueList.getValueFwdRef(IAID-1));
1971 LastLoc = DebugLoc::get(Line, Col, Scope, IA);
1972 I->setDebugLoc(LastLoc);
1977 case bitc::FUNC_CODE_INST_BINOP: { // BINOP: [opval, ty, opval, opcode]
1980 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) ||
1981 popValue(Record, OpNum, NextValueNo, LHS->getType(), RHS) ||
1982 OpNum+1 > Record.size())
1983 return Error("Invalid BINOP record");
1985 int Opc = GetDecodedBinaryOpcode(Record[OpNum++], LHS->getType());
1986 if (Opc == -1) return Error("Invalid BINOP record");
1987 I = BinaryOperator::Create((Instruction::BinaryOps)Opc, LHS, RHS);
1988 InstructionList.push_back(I);
1989 if (OpNum < Record.size()) {
1990 if (Opc == Instruction::Add ||
1991 Opc == Instruction::Sub ||
1992 Opc == Instruction::Mul ||
1993 Opc == Instruction::Shl) {
1994 if (Record[OpNum] & (1 << bitc::OBO_NO_SIGNED_WRAP))
1995 cast<BinaryOperator>(I)->setHasNoSignedWrap(true);
1996 if (Record[OpNum] & (1 << bitc::OBO_NO_UNSIGNED_WRAP))
1997 cast<BinaryOperator>(I)->setHasNoUnsignedWrap(true);
1998 } else if (Opc == Instruction::SDiv ||
1999 Opc == Instruction::UDiv ||
2000 Opc == Instruction::LShr ||
2001 Opc == Instruction::AShr) {
2002 if (Record[OpNum] & (1 << bitc::PEO_EXACT))
2003 cast<BinaryOperator>(I)->setIsExact(true);
2004 } else if (isa<FPMathOperator>(I)) {
2006 if (0 != (Record[OpNum] & FastMathFlags::UnsafeAlgebra))
2007 FMF.setUnsafeAlgebra();
2008 if (0 != (Record[OpNum] & FastMathFlags::NoNaNs))
2010 if (0 != (Record[OpNum] & FastMathFlags::NoInfs))
2012 if (0 != (Record[OpNum] & FastMathFlags::NoSignedZeros))
2013 FMF.setNoSignedZeros();
2014 if (0 != (Record[OpNum] & FastMathFlags::AllowReciprocal))
2015 FMF.setAllowReciprocal();
2017 I->setFastMathFlags(FMF);
2023 case bitc::FUNC_CODE_INST_CAST: { // CAST: [opval, opty, destty, castopc]
2026 if (getValueTypePair(Record, OpNum, NextValueNo, Op) ||
2027 OpNum+2 != Record.size())
2028 return Error("Invalid CAST record");
2030 Type *ResTy = getTypeByID(Record[OpNum]);
2031 int Opc = GetDecodedCastOpcode(Record[OpNum+1]);
2032 if (Opc == -1 || ResTy == 0)
2033 return Error("Invalid CAST record");
2034 I = CastInst::Create((Instruction::CastOps)Opc, Op, ResTy);
2035 InstructionList.push_back(I);
2038 case bitc::FUNC_CODE_INST_INBOUNDS_GEP:
2039 case bitc::FUNC_CODE_INST_GEP: { // GEP: [n x operands]
2042 if (getValueTypePair(Record, OpNum, NextValueNo, BasePtr))
2043 return Error("Invalid GEP record");
2045 SmallVector<Value*, 16> GEPIdx;
2046 while (OpNum != Record.size()) {
2048 if (getValueTypePair(Record, OpNum, NextValueNo, Op))
2049 return Error("Invalid GEP record");
2050 GEPIdx.push_back(Op);
2053 I = GetElementPtrInst::Create(BasePtr, GEPIdx);
2054 InstructionList.push_back(I);
2055 if (BitCode == bitc::FUNC_CODE_INST_INBOUNDS_GEP)
2056 cast<GetElementPtrInst>(I)->setIsInBounds(true);
2060 case bitc::FUNC_CODE_INST_EXTRACTVAL: {
2061 // EXTRACTVAL: [opty, opval, n x indices]
2064 if (getValueTypePair(Record, OpNum, NextValueNo, Agg))
2065 return Error("Invalid EXTRACTVAL record");
2067 SmallVector<unsigned, 4> EXTRACTVALIdx;
2068 for (unsigned RecSize = Record.size();
2069 OpNum != RecSize; ++OpNum) {
2070 uint64_t Index = Record[OpNum];
2071 if ((unsigned)Index != Index)
2072 return Error("Invalid EXTRACTVAL index");
2073 EXTRACTVALIdx.push_back((unsigned)Index);
2076 I = ExtractValueInst::Create(Agg, EXTRACTVALIdx);
2077 InstructionList.push_back(I);
2081 case bitc::FUNC_CODE_INST_INSERTVAL: {
2082 // INSERTVAL: [opty, opval, opty, opval, n x indices]
2085 if (getValueTypePair(Record, OpNum, NextValueNo, Agg))
2086 return Error("Invalid INSERTVAL record");
2088 if (getValueTypePair(Record, OpNum, NextValueNo, Val))
2089 return Error("Invalid INSERTVAL record");
2091 SmallVector<unsigned, 4> INSERTVALIdx;
2092 for (unsigned RecSize = Record.size();
2093 OpNum != RecSize; ++OpNum) {
2094 uint64_t Index = Record[OpNum];
2095 if ((unsigned)Index != Index)
2096 return Error("Invalid INSERTVAL index");
2097 INSERTVALIdx.push_back((unsigned)Index);
2100 I = InsertValueInst::Create(Agg, Val, INSERTVALIdx);
2101 InstructionList.push_back(I);
2105 case bitc::FUNC_CODE_INST_SELECT: { // SELECT: [opval, ty, opval, opval]
2106 // obsolete form of select
2107 // handles select i1 ... in old bitcode
2109 Value *TrueVal, *FalseVal, *Cond;
2110 if (getValueTypePair(Record, OpNum, NextValueNo, TrueVal) ||
2111 popValue(Record, OpNum, NextValueNo, TrueVal->getType(), FalseVal) ||
2112 popValue(Record, OpNum, NextValueNo, Type::getInt1Ty(Context), Cond))
2113 return Error("Invalid SELECT record");
2115 I = SelectInst::Create(Cond, TrueVal, FalseVal);
2116 InstructionList.push_back(I);
2120 case bitc::FUNC_CODE_INST_VSELECT: {// VSELECT: [ty,opval,opval,predty,pred]
2121 // new form of select
2122 // handles select i1 or select [N x i1]
2124 Value *TrueVal, *FalseVal, *Cond;
2125 if (getValueTypePair(Record, OpNum, NextValueNo, TrueVal) ||
2126 popValue(Record, OpNum, NextValueNo, TrueVal->getType(), FalseVal) ||
2127 getValueTypePair(Record, OpNum, NextValueNo, Cond))
2128 return Error("Invalid SELECT record");
2130 // select condition can be either i1 or [N x i1]
2131 if (VectorType* vector_type =
2132 dyn_cast<VectorType>(Cond->getType())) {
2134 if (vector_type->getElementType() != Type::getInt1Ty(Context))
2135 return Error("Invalid SELECT condition type");
2138 if (Cond->getType() != Type::getInt1Ty(Context))
2139 return Error("Invalid SELECT condition type");
2142 I = SelectInst::Create(Cond, TrueVal, FalseVal);
2143 InstructionList.push_back(I);
2147 case bitc::FUNC_CODE_INST_EXTRACTELT: { // EXTRACTELT: [opty, opval, opval]
2150 if (getValueTypePair(Record, OpNum, NextValueNo, Vec) ||
2151 popValue(Record, OpNum, NextValueNo, Type::getInt32Ty(Context), Idx))
2152 return Error("Invalid EXTRACTELT record");
2153 I = ExtractElementInst::Create(Vec, Idx);
2154 InstructionList.push_back(I);
2158 case bitc::FUNC_CODE_INST_INSERTELT: { // INSERTELT: [ty, opval,opval,opval]
2160 Value *Vec, *Elt, *Idx;
2161 if (getValueTypePair(Record, OpNum, NextValueNo, Vec) ||
2162 popValue(Record, OpNum, NextValueNo,
2163 cast<VectorType>(Vec->getType())->getElementType(), Elt) ||
2164 popValue(Record, OpNum, NextValueNo, Type::getInt32Ty(Context), Idx))
2165 return Error("Invalid INSERTELT record");
2166 I = InsertElementInst::Create(Vec, Elt, Idx);
2167 InstructionList.push_back(I);
2171 case bitc::FUNC_CODE_INST_SHUFFLEVEC: {// SHUFFLEVEC: [opval,ty,opval,opval]
2173 Value *Vec1, *Vec2, *Mask;
2174 if (getValueTypePair(Record, OpNum, NextValueNo, Vec1) ||
2175 popValue(Record, OpNum, NextValueNo, Vec1->getType(), Vec2))
2176 return Error("Invalid SHUFFLEVEC record");
2178 if (getValueTypePair(Record, OpNum, NextValueNo, Mask))
2179 return Error("Invalid SHUFFLEVEC record");
2180 I = new ShuffleVectorInst(Vec1, Vec2, Mask);
2181 InstructionList.push_back(I);
2185 case bitc::FUNC_CODE_INST_CMP: // CMP: [opty, opval, opval, pred]
2186 // Old form of ICmp/FCmp returning bool
2187 // Existed to differentiate between icmp/fcmp and vicmp/vfcmp which were
2188 // both legal on vectors but had different behaviour.
2189 case bitc::FUNC_CODE_INST_CMP2: { // CMP2: [opty, opval, opval, pred]
2190 // FCmp/ICmp returning bool or vector of bool
2194 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) ||
2195 popValue(Record, OpNum, NextValueNo, LHS->getType(), RHS) ||
2196 OpNum+1 != Record.size())
2197 return Error("Invalid CMP record");
2199 if (LHS->getType()->isFPOrFPVectorTy())
2200 I = new FCmpInst((FCmpInst::Predicate)Record[OpNum], LHS, RHS);
2202 I = new ICmpInst((ICmpInst::Predicate)Record[OpNum], LHS, RHS);
2203 InstructionList.push_back(I);
2207 case bitc::FUNC_CODE_INST_RET: // RET: [opty,opval<optional>]
2209 unsigned Size = Record.size();
2211 I = ReturnInst::Create(Context);
2212 InstructionList.push_back(I);
2218 if (getValueTypePair(Record, OpNum, NextValueNo, Op))
2219 return Error("Invalid RET record");
2220 if (OpNum != Record.size())
2221 return Error("Invalid RET record");
2223 I = ReturnInst::Create(Context, Op);
2224 InstructionList.push_back(I);
2227 case bitc::FUNC_CODE_INST_BR: { // BR: [bb#, bb#, opval] or [bb#]
2228 if (Record.size() != 1 && Record.size() != 3)
2229 return Error("Invalid BR record");
2230 BasicBlock *TrueDest = getBasicBlock(Record[0]);
2232 return Error("Invalid BR record");
2234 if (Record.size() == 1) {
2235 I = BranchInst::Create(TrueDest);
2236 InstructionList.push_back(I);
2239 BasicBlock *FalseDest = getBasicBlock(Record[1]);
2240 Value *Cond = getValue(Record, 2, NextValueNo,
2241 Type::getInt1Ty(Context));
2242 if (FalseDest == 0 || Cond == 0)
2243 return Error("Invalid BR record");
2244 I = BranchInst::Create(TrueDest, FalseDest, Cond);
2245 InstructionList.push_back(I);
2249 case bitc::FUNC_CODE_INST_SWITCH: { // SWITCH: [opty, op0, op1, ...]
2251 if ((Record[0] >> 16) == SWITCH_INST_MAGIC) {
2252 // New SwitchInst format with case ranges.
2254 Type *OpTy = getTypeByID(Record[1]);
2255 unsigned ValueBitWidth = cast<IntegerType>(OpTy)->getBitWidth();
2257 Value *Cond = getValue(Record, 2, NextValueNo, OpTy);
2258 BasicBlock *Default = getBasicBlock(Record[3]);
2259 if (OpTy == 0 || Cond == 0 || Default == 0)
2260 return Error("Invalid SWITCH record");
2262 unsigned NumCases = Record[4];
2264 SwitchInst *SI = SwitchInst::Create(Cond, Default, NumCases);
2265 InstructionList.push_back(SI);
2267 unsigned CurIdx = 5;
2268 for (unsigned i = 0; i != NumCases; ++i) {
2269 IntegersSubsetToBB CaseBuilder;
2270 unsigned NumItems = Record[CurIdx++];
2271 for (unsigned ci = 0; ci != NumItems; ++ci) {
2272 bool isSingleNumber = Record[CurIdx++];
2275 unsigned ActiveWords = 1;
2276 if (ValueBitWidth > 64)
2277 ActiveWords = Record[CurIdx++];
2278 Low = ReadWideAPInt(makeArrayRef(&Record[CurIdx], ActiveWords),
2280 CurIdx += ActiveWords;
2282 if (!isSingleNumber) {
2284 if (ValueBitWidth > 64)
2285 ActiveWords = Record[CurIdx++];
2287 ReadWideAPInt(makeArrayRef(&Record[CurIdx], ActiveWords),
2290 CaseBuilder.add(IntItem::fromType(OpTy, Low),
2291 IntItem::fromType(OpTy, High));
2292 CurIdx += ActiveWords;
2294 CaseBuilder.add(IntItem::fromType(OpTy, Low));
2296 BasicBlock *DestBB = getBasicBlock(Record[CurIdx++]);
2297 IntegersSubset Case = CaseBuilder.getCase();
2298 SI->addCase(Case, DestBB);
2300 uint16_t Hash = SI->hash();
2301 if (Hash != (Record[0] & 0xFFFF))
2302 return Error("Invalid SWITCH record");
2307 // Old SwitchInst format without case ranges.
2309 if (Record.size() < 3 || (Record.size() & 1) == 0)
2310 return Error("Invalid SWITCH record");
2311 Type *OpTy = getTypeByID(Record[0]);
2312 Value *Cond = getValue(Record, 1, NextValueNo, OpTy);
2313 BasicBlock *Default = getBasicBlock(Record[2]);
2314 if (OpTy == 0 || Cond == 0 || Default == 0)
2315 return Error("Invalid SWITCH record");
2316 unsigned NumCases = (Record.size()-3)/2;
2317 SwitchInst *SI = SwitchInst::Create(Cond, Default, NumCases);
2318 InstructionList.push_back(SI);
2319 for (unsigned i = 0, e = NumCases; i != e; ++i) {
2320 ConstantInt *CaseVal =
2321 dyn_cast_or_null<ConstantInt>(getFnValueByID(Record[3+i*2], OpTy));
2322 BasicBlock *DestBB = getBasicBlock(Record[1+3+i*2]);
2323 if (CaseVal == 0 || DestBB == 0) {
2325 return Error("Invalid SWITCH record!");
2327 SI->addCase(CaseVal, DestBB);
2332 case bitc::FUNC_CODE_INST_INDIRECTBR: { // INDIRECTBR: [opty, op0, op1, ...]
2333 if (Record.size() < 2)
2334 return Error("Invalid INDIRECTBR record");
2335 Type *OpTy = getTypeByID(Record[0]);
2336 Value *Address = getValue(Record, 1, NextValueNo, OpTy);
2337 if (OpTy == 0 || Address == 0)
2338 return Error("Invalid INDIRECTBR record");
2339 unsigned NumDests = Record.size()-2;
2340 IndirectBrInst *IBI = IndirectBrInst::Create(Address, NumDests);
2341 InstructionList.push_back(IBI);
2342 for (unsigned i = 0, e = NumDests; i != e; ++i) {
2343 if (BasicBlock *DestBB = getBasicBlock(Record[2+i])) {
2344 IBI->addDestination(DestBB);
2347 return Error("Invalid INDIRECTBR record!");
2354 case bitc::FUNC_CODE_INST_INVOKE: {
2355 // INVOKE: [attrs, cc, normBB, unwindBB, fnty, op0,op1,op2, ...]
2356 if (Record.size() < 4) return Error("Invalid INVOKE record");
2357 AttributeSet PAL = getAttributes(Record[0]);
2358 unsigned CCInfo = Record[1];
2359 BasicBlock *NormalBB = getBasicBlock(Record[2]);
2360 BasicBlock *UnwindBB = getBasicBlock(Record[3]);
2364 if (getValueTypePair(Record, OpNum, NextValueNo, Callee))
2365 return Error("Invalid INVOKE record");
2367 PointerType *CalleeTy = dyn_cast<PointerType>(Callee->getType());
2368 FunctionType *FTy = !CalleeTy ? 0 :
2369 dyn_cast<FunctionType>(CalleeTy->getElementType());
2371 // Check that the right number of fixed parameters are here.
2372 if (FTy == 0 || NormalBB == 0 || UnwindBB == 0 ||
2373 Record.size() < OpNum+FTy->getNumParams())
2374 return Error("Invalid INVOKE record");
2376 SmallVector<Value*, 16> Ops;
2377 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i, ++OpNum) {
2378 Ops.push_back(getValue(Record, OpNum, NextValueNo,
2379 FTy->getParamType(i)));
2380 if (Ops.back() == 0) return Error("Invalid INVOKE record");
2383 if (!FTy->isVarArg()) {
2384 if (Record.size() != OpNum)
2385 return Error("Invalid INVOKE record");
2387 // Read type/value pairs for varargs params.
2388 while (OpNum != Record.size()) {
2390 if (getValueTypePair(Record, OpNum, NextValueNo, Op))
2391 return Error("Invalid INVOKE record");
2396 I = InvokeInst::Create(Callee, NormalBB, UnwindBB, Ops);
2397 InstructionList.push_back(I);
2398 cast<InvokeInst>(I)->setCallingConv(
2399 static_cast<CallingConv::ID>(CCInfo));
2400 cast<InvokeInst>(I)->setAttributes(PAL);
2403 case bitc::FUNC_CODE_INST_RESUME: { // RESUME: [opval]
2406 if (getValueTypePair(Record, Idx, NextValueNo, Val))
2407 return Error("Invalid RESUME record");
2408 I = ResumeInst::Create(Val);
2409 InstructionList.push_back(I);
2412 case bitc::FUNC_CODE_INST_UNREACHABLE: // UNREACHABLE
2413 I = new UnreachableInst(Context);
2414 InstructionList.push_back(I);
2416 case bitc::FUNC_CODE_INST_PHI: { // PHI: [ty, val0,bb0, ...]
2417 if (Record.size() < 1 || ((Record.size()-1)&1))
2418 return Error("Invalid PHI record");
2419 Type *Ty = getTypeByID(Record[0]);
2420 if (!Ty) return Error("Invalid PHI record");
2422 PHINode *PN = PHINode::Create(Ty, (Record.size()-1)/2);
2423 InstructionList.push_back(PN);
2425 for (unsigned i = 0, e = Record.size()-1; i != e; i += 2) {
2427 // With the new function encoding, it is possible that operands have
2428 // negative IDs (for forward references). Use a signed VBR
2429 // representation to keep the encoding small.
2431 V = getValueSigned(Record, 1+i, NextValueNo, Ty);
2433 V = getValue(Record, 1+i, NextValueNo, Ty);
2434 BasicBlock *BB = getBasicBlock(Record[2+i]);
2435 if (!V || !BB) return Error("Invalid PHI record");
2436 PN->addIncoming(V, BB);
2442 case bitc::FUNC_CODE_INST_LANDINGPAD: {
2443 // LANDINGPAD: [ty, val, val, num, (id0,val0 ...)?]
2445 if (Record.size() < 4)
2446 return Error("Invalid LANDINGPAD record");
2447 Type *Ty = getTypeByID(Record[Idx++]);
2448 if (!Ty) return Error("Invalid LANDINGPAD record");
2450 if (getValueTypePair(Record, Idx, NextValueNo, PersFn))
2451 return Error("Invalid LANDINGPAD record");
2453 bool IsCleanup = !!Record[Idx++];
2454 unsigned NumClauses = Record[Idx++];
2455 LandingPadInst *LP = LandingPadInst::Create(Ty, PersFn, NumClauses);
2456 LP->setCleanup(IsCleanup);
2457 for (unsigned J = 0; J != NumClauses; ++J) {
2458 LandingPadInst::ClauseType CT =
2459 LandingPadInst::ClauseType(Record[Idx++]); (void)CT;
2462 if (getValueTypePair(Record, Idx, NextValueNo, Val)) {
2464 return Error("Invalid LANDINGPAD record");
2467 assert((CT != LandingPadInst::Catch ||
2468 !isa<ArrayType>(Val->getType())) &&
2469 "Catch clause has a invalid type!");
2470 assert((CT != LandingPadInst::Filter ||
2471 isa<ArrayType>(Val->getType())) &&
2472 "Filter clause has invalid type!");
2477 InstructionList.push_back(I);
2481 case bitc::FUNC_CODE_INST_ALLOCA: { // ALLOCA: [instty, opty, op, align]
2482 if (Record.size() != 4)
2483 return Error("Invalid ALLOCA record");
2485 dyn_cast_or_null<PointerType>(getTypeByID(Record[0]));
2486 Type *OpTy = getTypeByID(Record[1]);
2487 Value *Size = getFnValueByID(Record[2], OpTy);
2488 unsigned Align = Record[3];
2489 if (!Ty || !Size) return Error("Invalid ALLOCA record");
2490 I = new AllocaInst(Ty->getElementType(), Size, (1 << Align) >> 1);
2491 InstructionList.push_back(I);
2494 case bitc::FUNC_CODE_INST_LOAD: { // LOAD: [opty, op, align, vol]
2497 if (getValueTypePair(Record, OpNum, NextValueNo, Op) ||
2498 OpNum+2 != Record.size())
2499 return Error("Invalid LOAD record");
2501 I = new LoadInst(Op, "", Record[OpNum+1], (1 << Record[OpNum]) >> 1);
2502 InstructionList.push_back(I);
2505 case bitc::FUNC_CODE_INST_LOADATOMIC: {
2506 // LOADATOMIC: [opty, op, align, vol, ordering, synchscope]
2509 if (getValueTypePair(Record, OpNum, NextValueNo, Op) ||
2510 OpNum+4 != Record.size())
2511 return Error("Invalid LOADATOMIC record");
2514 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+2]);
2515 if (Ordering == NotAtomic || Ordering == Release ||
2516 Ordering == AcquireRelease)
2517 return Error("Invalid LOADATOMIC record");
2518 if (Ordering != NotAtomic && Record[OpNum] == 0)
2519 return Error("Invalid LOADATOMIC record");
2520 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+3]);
2522 I = new LoadInst(Op, "", Record[OpNum+1], (1 << Record[OpNum]) >> 1,
2523 Ordering, SynchScope);
2524 InstructionList.push_back(I);
2527 case bitc::FUNC_CODE_INST_STORE: { // STORE2:[ptrty, ptr, val, align, vol]
2530 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) ||
2531 popValue(Record, OpNum, NextValueNo,
2532 cast<PointerType>(Ptr->getType())->getElementType(), Val) ||
2533 OpNum+2 != Record.size())
2534 return Error("Invalid STORE record");
2536 I = new StoreInst(Val, Ptr, Record[OpNum+1], (1 << Record[OpNum]) >> 1);
2537 InstructionList.push_back(I);
2540 case bitc::FUNC_CODE_INST_STOREATOMIC: {
2541 // STOREATOMIC: [ptrty, ptr, val, align, vol, ordering, synchscope]
2544 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) ||
2545 popValue(Record, OpNum, NextValueNo,
2546 cast<PointerType>(Ptr->getType())->getElementType(), Val) ||
2547 OpNum+4 != Record.size())
2548 return Error("Invalid STOREATOMIC record");
2550 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+2]);
2551 if (Ordering == NotAtomic || Ordering == Acquire ||
2552 Ordering == AcquireRelease)
2553 return Error("Invalid STOREATOMIC record");
2554 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+3]);
2555 if (Ordering != NotAtomic && Record[OpNum] == 0)
2556 return Error("Invalid STOREATOMIC record");
2558 I = new StoreInst(Val, Ptr, Record[OpNum+1], (1 << Record[OpNum]) >> 1,
2559 Ordering, SynchScope);
2560 InstructionList.push_back(I);
2563 case bitc::FUNC_CODE_INST_CMPXCHG: {
2564 // CMPXCHG:[ptrty, ptr, cmp, new, vol, ordering, synchscope]
2566 Value *Ptr, *Cmp, *New;
2567 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) ||
2568 popValue(Record, OpNum, NextValueNo,
2569 cast<PointerType>(Ptr->getType())->getElementType(), Cmp) ||
2570 popValue(Record, OpNum, NextValueNo,
2571 cast<PointerType>(Ptr->getType())->getElementType(), New) ||
2572 OpNum+3 != Record.size())
2573 return Error("Invalid CMPXCHG record");
2574 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+1]);
2575 if (Ordering == NotAtomic || Ordering == Unordered)
2576 return Error("Invalid CMPXCHG record");
2577 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+2]);
2578 I = new AtomicCmpXchgInst(Ptr, Cmp, New, Ordering, SynchScope);
2579 cast<AtomicCmpXchgInst>(I)->setVolatile(Record[OpNum]);
2580 InstructionList.push_back(I);
2583 case bitc::FUNC_CODE_INST_ATOMICRMW: {
2584 // ATOMICRMW:[ptrty, ptr, val, op, vol, ordering, synchscope]
2587 if (getValueTypePair(Record, OpNum, NextValueNo, Ptr) ||
2588 popValue(Record, OpNum, NextValueNo,
2589 cast<PointerType>(Ptr->getType())->getElementType(), Val) ||
2590 OpNum+4 != Record.size())
2591 return Error("Invalid ATOMICRMW record");
2592 AtomicRMWInst::BinOp Operation = GetDecodedRMWOperation(Record[OpNum]);
2593 if (Operation < AtomicRMWInst::FIRST_BINOP ||
2594 Operation > AtomicRMWInst::LAST_BINOP)
2595 return Error("Invalid ATOMICRMW record");
2596 AtomicOrdering Ordering = GetDecodedOrdering(Record[OpNum+2]);
2597 if (Ordering == NotAtomic || Ordering == Unordered)
2598 return Error("Invalid ATOMICRMW record");
2599 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[OpNum+3]);
2600 I = new AtomicRMWInst(Operation, Ptr, Val, Ordering, SynchScope);
2601 cast<AtomicRMWInst>(I)->setVolatile(Record[OpNum+1]);
2602 InstructionList.push_back(I);
2605 case bitc::FUNC_CODE_INST_FENCE: { // FENCE:[ordering, synchscope]
2606 if (2 != Record.size())
2607 return Error("Invalid FENCE record");
2608 AtomicOrdering Ordering = GetDecodedOrdering(Record[0]);
2609 if (Ordering == NotAtomic || Ordering == Unordered ||
2610 Ordering == Monotonic)
2611 return Error("Invalid FENCE record");
2612 SynchronizationScope SynchScope = GetDecodedSynchScope(Record[1]);
2613 I = new FenceInst(Context, Ordering, SynchScope);
2614 InstructionList.push_back(I);
2617 case bitc::FUNC_CODE_INST_CALL: {
2618 // CALL: [paramattrs, cc, fnty, fnid, arg0, arg1...]
2619 if (Record.size() < 3)
2620 return Error("Invalid CALL record");
2622 AttributeSet PAL = getAttributes(Record[0]);
2623 unsigned CCInfo = Record[1];
2627 if (getValueTypePair(Record, OpNum, NextValueNo, Callee))
2628 return Error("Invalid CALL record");
2630 PointerType *OpTy = dyn_cast<PointerType>(Callee->getType());
2631 FunctionType *FTy = 0;
2632 if (OpTy) FTy = dyn_cast<FunctionType>(OpTy->getElementType());
2633 if (!FTy || Record.size() < FTy->getNumParams()+OpNum)
2634 return Error("Invalid CALL record");
2636 SmallVector<Value*, 16> Args;
2637 // Read the fixed params.
2638 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i, ++OpNum) {
2639 if (FTy->getParamType(i)->isLabelTy())
2640 Args.push_back(getBasicBlock(Record[OpNum]));
2642 Args.push_back(getValue(Record, OpNum, NextValueNo,
2643 FTy->getParamType(i)));
2644 if (Args.back() == 0) return Error("Invalid CALL record");
2647 // Read type/value pairs for varargs params.
2648 if (!FTy->isVarArg()) {
2649 if (OpNum != Record.size())
2650 return Error("Invalid CALL record");
2652 while (OpNum != Record.size()) {
2654 if (getValueTypePair(Record, OpNum, NextValueNo, Op))
2655 return Error("Invalid CALL record");
2660 I = CallInst::Create(Callee, Args);
2661 InstructionList.push_back(I);
2662 cast<CallInst>(I)->setCallingConv(
2663 static_cast<CallingConv::ID>(CCInfo>>1));
2664 cast<CallInst>(I)->setTailCall(CCInfo & 1);
2665 cast<CallInst>(I)->setAttributes(PAL);
2668 case bitc::FUNC_CODE_INST_VAARG: { // VAARG: [valistty, valist, instty]
2669 if (Record.size() < 3)
2670 return Error("Invalid VAARG record");
2671 Type *OpTy = getTypeByID(Record[0]);
2672 Value *Op = getValue(Record, 1, NextValueNo, OpTy);
2673 Type *ResTy = getTypeByID(Record[2]);
2674 if (!OpTy || !Op || !ResTy)
2675 return Error("Invalid VAARG record");
2676 I = new VAArgInst(Op, ResTy);
2677 InstructionList.push_back(I);
2682 // Add instruction to end of current BB. If there is no current BB, reject
2686 return Error("Invalid instruction with no BB");
2688 CurBB->getInstList().push_back(I);
2690 // If this was a terminator instruction, move to the next block.
2691 if (isa<TerminatorInst>(I)) {
2693 CurBB = CurBBNo < FunctionBBs.size() ? FunctionBBs[CurBBNo] : 0;
2696 // Non-void values get registered in the value table for future use.
2697 if (I && !I->getType()->isVoidTy())
2698 ValueList.AssignValue(I, NextValueNo++);
2703 // Check the function list for unresolved values.
2704 if (Argument *A = dyn_cast<Argument>(ValueList.back())) {
2705 if (A->getParent() == 0) {
2706 // We found at least one unresolved value. Nuke them all to avoid leaks.
2707 for (unsigned i = ModuleValueListSize, e = ValueList.size(); i != e; ++i){
2708 if ((A = dyn_cast<Argument>(ValueList[i])) && A->getParent() == 0) {
2709 A->replaceAllUsesWith(UndefValue::get(A->getType()));
2713 return Error("Never resolved value found in function!");
2717 // FIXME: Check for unresolved forward-declared metadata references
2718 // and clean up leaks.
2720 // See if anything took the address of blocks in this function. If so,
2721 // resolve them now.
2722 DenseMap<Function*, std::vector<BlockAddrRefTy> >::iterator BAFRI =
2723 BlockAddrFwdRefs.find(F);
2724 if (BAFRI != BlockAddrFwdRefs.end()) {
2725 std::vector<BlockAddrRefTy> &RefList = BAFRI->second;
2726 for (unsigned i = 0, e = RefList.size(); i != e; ++i) {
2727 unsigned BlockIdx = RefList[i].first;
2728 if (BlockIdx >= FunctionBBs.size())
2729 return Error("Invalid blockaddress block #");
2731 GlobalVariable *FwdRef = RefList[i].second;
2732 FwdRef->replaceAllUsesWith(BlockAddress::get(F, FunctionBBs[BlockIdx]));
2733 FwdRef->eraseFromParent();
2736 BlockAddrFwdRefs.erase(BAFRI);
2739 // Trim the value list down to the size it was before we parsed this function.
2740 ValueList.shrinkTo(ModuleValueListSize);
2741 MDValueList.shrinkTo(ModuleMDValueListSize);
2742 std::vector<BasicBlock*>().swap(FunctionBBs);
2746 /// FindFunctionInStream - Find the function body in the bitcode stream
2747 bool BitcodeReader::FindFunctionInStream(Function *F,
2748 DenseMap<Function*, uint64_t>::iterator DeferredFunctionInfoIterator) {
2749 while (DeferredFunctionInfoIterator->second == 0) {
2750 if (Stream.AtEndOfStream())
2751 return Error("Could not find Function in stream");
2752 // ParseModule will parse the next body in the stream and set its
2753 // position in the DeferredFunctionInfo map.
2754 if (ParseModule(true)) return true;
2759 //===----------------------------------------------------------------------===//
2760 // GVMaterializer implementation
2761 //===----------------------------------------------------------------------===//
2764 bool BitcodeReader::isMaterializable(const GlobalValue *GV) const {
2765 if (const Function *F = dyn_cast<Function>(GV)) {
2766 return F->isDeclaration() &&
2767 DeferredFunctionInfo.count(const_cast<Function*>(F));
2772 bool BitcodeReader::Materialize(GlobalValue *GV, std::string *ErrInfo) {
2773 Function *F = dyn_cast<Function>(GV);
2774 // If it's not a function or is already material, ignore the request.
2775 if (!F || !F->isMaterializable()) return false;
2777 DenseMap<Function*, uint64_t>::iterator DFII = DeferredFunctionInfo.find(F);
2778 assert(DFII != DeferredFunctionInfo.end() && "Deferred function not found!");
2779 // If its position is recorded as 0, its body is somewhere in the stream
2780 // but we haven't seen it yet.
2781 if (DFII->second == 0)
2782 if (LazyStreamer && FindFunctionInStream(F, DFII)) return true;
2784 // Move the bit stream to the saved position of the deferred function body.
2785 Stream.JumpToBit(DFII->second);
2787 if (ParseFunctionBody(F)) {
2788 if (ErrInfo) *ErrInfo = ErrorString;
2792 // Upgrade any old intrinsic calls in the function.
2793 for (UpgradedIntrinsicMap::iterator I = UpgradedIntrinsics.begin(),
2794 E = UpgradedIntrinsics.end(); I != E; ++I) {
2795 if (I->first != I->second) {
2796 for (Value::use_iterator UI = I->first->use_begin(),
2797 UE = I->first->use_end(); UI != UE; ) {
2798 if (CallInst* CI = dyn_cast<CallInst>(*UI++))
2799 UpgradeIntrinsicCall(CI, I->second);
2807 bool BitcodeReader::isDematerializable(const GlobalValue *GV) const {
2808 const Function *F = dyn_cast<Function>(GV);
2809 if (!F || F->isDeclaration())
2811 return DeferredFunctionInfo.count(const_cast<Function*>(F));
2814 void BitcodeReader::Dematerialize(GlobalValue *GV) {
2815 Function *F = dyn_cast<Function>(GV);
2816 // If this function isn't dematerializable, this is a noop.
2817 if (!F || !isDematerializable(F))
2820 assert(DeferredFunctionInfo.count(F) && "No info to read function later?");
2822 // Just forget the function body, we can remat it later.
2827 bool BitcodeReader::MaterializeModule(Module *M, std::string *ErrInfo) {
2828 assert(M == TheModule &&
2829 "Can only Materialize the Module this BitcodeReader is attached to.");
2830 // Iterate over the module, deserializing any functions that are still on
2832 for (Module::iterator F = TheModule->begin(), E = TheModule->end();
2834 if (F->isMaterializable() &&
2835 Materialize(F, ErrInfo))
2838 // At this point, if there are any function bodies, the current bit is
2839 // pointing to the END_BLOCK record after them. Now make sure the rest
2840 // of the bits in the module have been read.
2844 // Upgrade any intrinsic calls that slipped through (should not happen!) and
2845 // delete the old functions to clean up. We can't do this unless the entire
2846 // module is materialized because there could always be another function body
2847 // with calls to the old function.
2848 for (std::vector<std::pair<Function*, Function*> >::iterator I =
2849 UpgradedIntrinsics.begin(), E = UpgradedIntrinsics.end(); I != E; ++I) {
2850 if (I->first != I->second) {
2851 for (Value::use_iterator UI = I->first->use_begin(),
2852 UE = I->first->use_end(); UI != UE; ) {
2853 if (CallInst* CI = dyn_cast<CallInst>(*UI++))
2854 UpgradeIntrinsicCall(CI, I->second);
2856 if (!I->first->use_empty())
2857 I->first->replaceAllUsesWith(I->second);
2858 I->first->eraseFromParent();
2861 std::vector<std::pair<Function*, Function*> >().swap(UpgradedIntrinsics);
2866 bool BitcodeReader::InitStream() {
2867 if (LazyStreamer) return InitLazyStream();
2868 return InitStreamFromBuffer();
2871 bool BitcodeReader::InitStreamFromBuffer() {
2872 const unsigned char *BufPtr = (const unsigned char*)Buffer->getBufferStart();
2873 const unsigned char *BufEnd = BufPtr+Buffer->getBufferSize();
2875 if (Buffer->getBufferSize() & 3) {
2876 if (!isRawBitcode(BufPtr, BufEnd) && !isBitcodeWrapper(BufPtr, BufEnd))
2877 return Error("Invalid bitcode signature");
2879 return Error("Bitcode stream should be a multiple of 4 bytes in length");
2882 // If we have a wrapper header, parse it and ignore the non-bc file contents.
2883 // The magic number is 0x0B17C0DE stored in little endian.
2884 if (isBitcodeWrapper(BufPtr, BufEnd))
2885 if (SkipBitcodeWrapperHeader(BufPtr, BufEnd, true))
2886 return Error("Invalid bitcode wrapper header");
2888 StreamFile.reset(new BitstreamReader(BufPtr, BufEnd));
2889 Stream.init(*StreamFile);
2894 bool BitcodeReader::InitLazyStream() {
2895 // Check and strip off the bitcode wrapper; BitstreamReader expects never to
2897 StreamingMemoryObject *Bytes = new StreamingMemoryObject(LazyStreamer);
2898 StreamFile.reset(new BitstreamReader(Bytes));
2899 Stream.init(*StreamFile);
2901 unsigned char buf[16];
2902 if (Bytes->readBytes(0, 16, buf, NULL) == -1)
2903 return Error("Bitcode stream must be at least 16 bytes in length");
2905 if (!isBitcode(buf, buf + 16))
2906 return Error("Invalid bitcode signature");
2908 if (isBitcodeWrapper(buf, buf + 4)) {
2909 const unsigned char *bitcodeStart = buf;
2910 const unsigned char *bitcodeEnd = buf + 16;
2911 SkipBitcodeWrapperHeader(bitcodeStart, bitcodeEnd, false);
2912 Bytes->dropLeadingBytes(bitcodeStart - buf);
2913 Bytes->setKnownObjectSize(bitcodeEnd - bitcodeStart);
2918 //===----------------------------------------------------------------------===//
2919 // External interface
2920 //===----------------------------------------------------------------------===//
2922 /// getLazyBitcodeModule - lazy function-at-a-time loading from a file.
2924 Module *llvm::getLazyBitcodeModule(MemoryBuffer *Buffer,
2925 LLVMContext& Context,
2926 std::string *ErrMsg) {
2927 Module *M = new Module(Buffer->getBufferIdentifier(), Context);
2928 BitcodeReader *R = new BitcodeReader(Buffer, Context);
2929 M->setMaterializer(R);
2930 if (R->ParseBitcodeInto(M)) {
2932 *ErrMsg = R->getErrorString();
2934 delete M; // Also deletes R.
2937 // Have the BitcodeReader dtor delete 'Buffer'.
2938 R->setBufferOwned(true);
2940 R->materializeForwardReferencedFunctions();
2946 Module *llvm::getStreamedBitcodeModule(const std::string &name,
2947 DataStreamer *streamer,
2948 LLVMContext &Context,
2949 std::string *ErrMsg) {
2950 Module *M = new Module(name, Context);
2951 BitcodeReader *R = new BitcodeReader(streamer, Context);
2952 M->setMaterializer(R);
2953 if (R->ParseBitcodeInto(M)) {
2955 *ErrMsg = R->getErrorString();
2956 delete M; // Also deletes R.
2959 R->setBufferOwned(false); // no buffer to delete
2963 /// ParseBitcodeFile - Read the specified bitcode file, returning the module.
2964 /// If an error occurs, return null and fill in *ErrMsg if non-null.
2965 Module *llvm::ParseBitcodeFile(MemoryBuffer *Buffer, LLVMContext& Context,
2966 std::string *ErrMsg){
2967 Module *M = getLazyBitcodeModule(Buffer, Context, ErrMsg);
2970 // Don't let the BitcodeReader dtor delete 'Buffer', regardless of whether
2971 // there was an error.
2972 static_cast<BitcodeReader*>(M->getMaterializer())->setBufferOwned(false);
2974 // Read in the entire module, and destroy the BitcodeReader.
2975 if (M->MaterializeAllPermanently(ErrMsg)) {
2980 // TODO: Restore the use-lists to the in-memory state when the bitcode was
2981 // written. We must defer until the Module has been fully materialized.
2986 std::string llvm::getBitcodeTargetTriple(MemoryBuffer *Buffer,
2987 LLVMContext& Context,
2988 std::string *ErrMsg) {
2989 BitcodeReader *R = new BitcodeReader(Buffer, Context);
2990 // Don't let the BitcodeReader dtor delete 'Buffer'.
2991 R->setBufferOwned(false);
2993 std::string Triple("");
2994 if (R->ParseTriple(Triple))
2996 *ErrMsg = R->getErrorString();