1 //===-- AsmWriter.cpp - Printing LLVM as an assembly file -----------------===//
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 // This library implements the functionality defined in llvm/IR/Writer.h
12 // Note that these routines must be extremely tolerant of various errors in the
13 // LLVM code, because it can be used for debugging transformations.
15 //===----------------------------------------------------------------------===//
17 #include "AsmWriter.h"
18 #include "llvm/ADT/DenseMap.h"
19 #include "llvm/ADT/STLExtras.h"
20 #include "llvm/ADT/SmallString.h"
21 #include "llvm/ADT/StringExtras.h"
22 #include "llvm/IR/AssemblyAnnotationWriter.h"
23 #include "llvm/IR/CFG.h"
24 #include "llvm/IR/CallingConv.h"
25 #include "llvm/IR/Constants.h"
26 #include "llvm/IR/DebugInfo.h"
27 #include "llvm/IR/DerivedTypes.h"
28 #include "llvm/IR/IRPrintingPasses.h"
29 #include "llvm/IR/InlineAsm.h"
30 #include "llvm/IR/IntrinsicInst.h"
31 #include "llvm/IR/LLVMContext.h"
32 #include "llvm/IR/Module.h"
33 #include "llvm/IR/Operator.h"
34 #include "llvm/IR/TypeFinder.h"
35 #include "llvm/IR/ValueSymbolTable.h"
36 #include "llvm/Support/Debug.h"
37 #include "llvm/Support/Dwarf.h"
38 #include "llvm/Support/ErrorHandling.h"
39 #include "llvm/Support/FormattedStream.h"
40 #include "llvm/Support/MathExtras.h"
45 // Make virtual table appear in this compilation unit.
46 AssemblyAnnotationWriter::~AssemblyAnnotationWriter() {}
48 //===----------------------------------------------------------------------===//
50 //===----------------------------------------------------------------------===//
54 DenseMap<const Value *, std::pair<unsigned, bool>> IDs;
56 unsigned size() const { return IDs.size(); }
57 std::pair<unsigned, bool> &operator[](const Value *V) { return IDs[V]; }
58 std::pair<unsigned, bool> lookup(const Value *V) const {
61 void index(const Value *V) {
62 // Explicitly sequence get-size and insert-value operations to avoid UB.
63 unsigned ID = IDs.size() + 1;
69 static void orderValue(const Value *V, OrderMap &OM) {
70 if (OM.lookup(V).first)
73 if (const Constant *C = dyn_cast<Constant>(V))
74 if (C->getNumOperands() && !isa<GlobalValue>(C))
75 for (const Value *Op : C->operands())
76 if (!isa<BasicBlock>(Op) && !isa<GlobalValue>(Op))
79 // Note: we cannot cache this lookup above, since inserting into the map
80 // changes the map's size, and thus affects the other IDs.
84 static OrderMap orderModule(const Module *M) {
85 // This needs to match the order used by ValueEnumerator::ValueEnumerator()
86 // and ValueEnumerator::incorporateFunction().
89 for (const GlobalVariable &G : M->globals()) {
90 if (G.hasInitializer())
91 if (!isa<GlobalValue>(G.getInitializer()))
92 orderValue(G.getInitializer(), OM);
95 for (const GlobalAlias &A : M->aliases()) {
96 if (!isa<GlobalValue>(A.getAliasee()))
97 orderValue(A.getAliasee(), OM);
100 for (const Function &F : *M) {
101 if (F.hasPrefixData())
102 if (!isa<GlobalValue>(F.getPrefixData()))
103 orderValue(F.getPrefixData(), OM);
105 if (F.hasPrologueData())
106 if (!isa<GlobalValue>(F.getPrologueData()))
107 orderValue(F.getPrologueData(), OM);
111 if (F.isDeclaration())
114 for (const Argument &A : F.args())
116 for (const BasicBlock &BB : F) {
118 for (const Instruction &I : BB) {
119 for (const Value *Op : I.operands())
120 if ((isa<Constant>(*Op) && !isa<GlobalValue>(*Op)) ||
130 static void predictValueUseListOrderImpl(const Value *V, const Function *F,
131 unsigned ID, const OrderMap &OM,
132 UseListOrderStack &Stack) {
133 // Predict use-list order for this one.
134 typedef std::pair<const Use *, unsigned> Entry;
135 SmallVector<Entry, 64> List;
136 for (const Use &U : V->uses())
137 // Check if this user will be serialized.
138 if (OM.lookup(U.getUser()).first)
139 List.push_back(std::make_pair(&U, List.size()));
142 // We may have lost some users.
146 !isa<GlobalVariable>(V) && !isa<Function>(V) && !isa<BasicBlock>(V);
147 if (auto *BA = dyn_cast<BlockAddress>(V))
148 ID = OM.lookup(BA->getBasicBlock()).first;
149 std::sort(List.begin(), List.end(), [&](const Entry &L, const Entry &R) {
150 const Use *LU = L.first;
151 const Use *RU = R.first;
155 auto LID = OM.lookup(LU->getUser()).first;
156 auto RID = OM.lookup(RU->getUser()).first;
158 // If ID is 4, then expect: 7 6 5 1 2 3.
172 // LID and RID are equal, so we have different operands of the same user.
173 // Assume operands are added in order for all instructions.
176 return LU->getOperandNo() < RU->getOperandNo();
177 return LU->getOperandNo() > RU->getOperandNo();
181 List.begin(), List.end(),
182 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
183 // Order is already correct.
186 // Store the shuffle.
187 Stack.emplace_back(V, F, List.size());
188 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
189 for (size_t I = 0, E = List.size(); I != E; ++I)
190 Stack.back().Shuffle[I] = List[I].second;
193 static void predictValueUseListOrder(const Value *V, const Function *F,
194 OrderMap &OM, UseListOrderStack &Stack) {
195 auto &IDPair = OM[V];
196 assert(IDPair.first && "Unmapped value");
198 // Already predicted.
201 // Do the actual prediction.
202 IDPair.second = true;
203 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end())
204 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack);
206 // Recursive descent into constants.
207 if (const Constant *C = dyn_cast<Constant>(V))
208 if (C->getNumOperands()) // Visit GlobalValues.
209 for (const Value *Op : C->operands())
210 if (isa<Constant>(Op)) // Visit GlobalValues.
211 predictValueUseListOrder(Op, F, OM, Stack);
214 static UseListOrderStack predictUseListOrder(const Module *M) {
215 OrderMap OM = orderModule(M);
217 // Use-list orders need to be serialized after all the users have been added
218 // to a value, or else the shuffles will be incomplete. Store them per
219 // function in a stack.
221 // Aside from function order, the order of values doesn't matter much here.
222 UseListOrderStack Stack;
224 // We want to visit the functions backward now so we can list function-local
225 // constants in the last Function they're used in. Module-level constants
226 // have already been visited above.
227 for (auto I = M->rbegin(), E = M->rend(); I != E; ++I) {
228 const Function &F = *I;
229 if (F.isDeclaration())
231 for (const BasicBlock &BB : F)
232 predictValueUseListOrder(&BB, &F, OM, Stack);
233 for (const Argument &A : F.args())
234 predictValueUseListOrder(&A, &F, OM, Stack);
235 for (const BasicBlock &BB : F)
236 for (const Instruction &I : BB)
237 for (const Value *Op : I.operands())
238 if (isa<Constant>(*Op) || isa<InlineAsm>(*Op)) // Visit GlobalValues.
239 predictValueUseListOrder(Op, &F, OM, Stack);
240 for (const BasicBlock &BB : F)
241 for (const Instruction &I : BB)
242 predictValueUseListOrder(&I, &F, OM, Stack);
245 // Visit globals last.
246 for (const GlobalVariable &G : M->globals())
247 predictValueUseListOrder(&G, nullptr, OM, Stack);
248 for (const Function &F : *M)
249 predictValueUseListOrder(&F, nullptr, OM, Stack);
250 for (const GlobalAlias &A : M->aliases())
251 predictValueUseListOrder(&A, nullptr, OM, Stack);
252 for (const GlobalVariable &G : M->globals())
253 if (G.hasInitializer())
254 predictValueUseListOrder(G.getInitializer(), nullptr, OM, Stack);
255 for (const GlobalAlias &A : M->aliases())
256 predictValueUseListOrder(A.getAliasee(), nullptr, OM, Stack);
257 for (const Function &F : *M)
258 if (F.hasPrefixData())
259 predictValueUseListOrder(F.getPrefixData(), nullptr, OM, Stack);
264 static const Module *getModuleFromVal(const Value *V) {
265 if (const Argument *MA = dyn_cast<Argument>(V))
266 return MA->getParent() ? MA->getParent()->getParent() : nullptr;
268 if (const BasicBlock *BB = dyn_cast<BasicBlock>(V))
269 return BB->getParent() ? BB->getParent()->getParent() : nullptr;
271 if (const Instruction *I = dyn_cast<Instruction>(V)) {
272 const Function *M = I->getParent() ? I->getParent()->getParent() : nullptr;
273 return M ? M->getParent() : nullptr;
276 if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))
277 return GV->getParent();
281 static void PrintCallingConv(unsigned cc, raw_ostream &Out) {
283 default: Out << "cc" << cc; break;
284 case CallingConv::Fast: Out << "fastcc"; break;
285 case CallingConv::Cold: Out << "coldcc"; break;
286 case CallingConv::WebKit_JS: Out << "webkit_jscc"; break;
287 case CallingConv::AnyReg: Out << "anyregcc"; break;
288 case CallingConv::PreserveMost: Out << "preserve_mostcc"; break;
289 case CallingConv::PreserveAll: Out << "preserve_allcc"; break;
290 case CallingConv::GHC: Out << "ghccc"; break;
291 case CallingConv::X86_StdCall: Out << "x86_stdcallcc"; break;
292 case CallingConv::X86_FastCall: Out << "x86_fastcallcc"; break;
293 case CallingConv::X86_ThisCall: Out << "x86_thiscallcc"; break;
294 case CallingConv::X86_VectorCall:Out << "x86_vectorcallcc"; break;
295 case CallingConv::Intel_OCL_BI: Out << "intel_ocl_bicc"; break;
296 case CallingConv::ARM_APCS: Out << "arm_apcscc"; break;
297 case CallingConv::ARM_AAPCS: Out << "arm_aapcscc"; break;
298 case CallingConv::ARM_AAPCS_VFP: Out << "arm_aapcs_vfpcc"; break;
299 case CallingConv::MSP430_INTR: Out << "msp430_intrcc"; break;
300 case CallingConv::PTX_Kernel: Out << "ptx_kernel"; break;
301 case CallingConv::PTX_Device: Out << "ptx_device"; break;
302 case CallingConv::X86_64_SysV: Out << "x86_64_sysvcc"; break;
303 case CallingConv::X86_64_Win64: Out << "x86_64_win64cc"; break;
304 case CallingConv::SPIR_FUNC: Out << "spir_func"; break;
305 case CallingConv::SPIR_KERNEL: Out << "spir_kernel"; break;
309 // PrintEscapedString - Print each character of the specified string, escaping
310 // it if it is not printable or if it is an escape char.
311 static void PrintEscapedString(StringRef Name, raw_ostream &Out) {
312 for (unsigned i = 0, e = Name.size(); i != e; ++i) {
313 unsigned char C = Name[i];
314 if (isprint(C) && C != '\\' && C != '"')
317 Out << '\\' << hexdigit(C >> 4) << hexdigit(C & 0x0F);
329 /// PrintLLVMName - Turn the specified name into an 'LLVM name', which is either
330 /// prefixed with % (if the string only contains simple characters) or is
331 /// surrounded with ""'s (if it has special chars in it). Print it out.
332 static void PrintLLVMName(raw_ostream &OS, StringRef Name, PrefixType Prefix) {
333 assert(!Name.empty() && "Cannot get empty name!");
335 case NoPrefix: break;
336 case GlobalPrefix: OS << '@'; break;
337 case ComdatPrefix: OS << '$'; break;
338 case LabelPrefix: break;
339 case LocalPrefix: OS << '%'; break;
342 // Scan the name to see if it needs quotes first.
343 bool NeedsQuotes = isdigit(static_cast<unsigned char>(Name[0]));
345 for (unsigned i = 0, e = Name.size(); i != e; ++i) {
346 // By making this unsigned, the value passed in to isalnum will always be
347 // in the range 0-255. This is important when building with MSVC because
348 // its implementation will assert. This situation can arise when dealing
349 // with UTF-8 multibyte characters.
350 unsigned char C = Name[i];
351 if (!isalnum(static_cast<unsigned char>(C)) && C != '-' && C != '.' &&
359 // If we didn't need any quotes, just write out the name in one blast.
365 // Okay, we need quotes. Output the quotes and escape any scary characters as
368 PrintEscapedString(Name, OS);
372 /// PrintLLVMName - Turn the specified name into an 'LLVM name', which is either
373 /// prefixed with % (if the string only contains simple characters) or is
374 /// surrounded with ""'s (if it has special chars in it). Print it out.
375 static void PrintLLVMName(raw_ostream &OS, const Value *V) {
376 PrintLLVMName(OS, V->getName(),
377 isa<GlobalValue>(V) ? GlobalPrefix : LocalPrefix);
383 void TypePrinting::incorporateTypes(const Module &M) {
384 NamedTypes.run(M, false);
386 // The list of struct types we got back includes all the struct types, split
387 // the unnamed ones out to a numbering and remove the anonymous structs.
388 unsigned NextNumber = 0;
390 std::vector<StructType*>::iterator NextToUse = NamedTypes.begin(), I, E;
391 for (I = NamedTypes.begin(), E = NamedTypes.end(); I != E; ++I) {
392 StructType *STy = *I;
394 // Ignore anonymous types.
395 if (STy->isLiteral())
398 if (STy->getName().empty())
399 NumberedTypes[STy] = NextNumber++;
404 NamedTypes.erase(NextToUse, NamedTypes.end());
408 /// CalcTypeName - Write the specified type to the specified raw_ostream, making
409 /// use of type names or up references to shorten the type name where possible.
410 void TypePrinting::print(Type *Ty, raw_ostream &OS) {
411 switch (Ty->getTypeID()) {
412 case Type::VoidTyID: OS << "void"; return;
413 case Type::HalfTyID: OS << "half"; return;
414 case Type::FloatTyID: OS << "float"; return;
415 case Type::DoubleTyID: OS << "double"; return;
416 case Type::X86_FP80TyID: OS << "x86_fp80"; return;
417 case Type::FP128TyID: OS << "fp128"; return;
418 case Type::PPC_FP128TyID: OS << "ppc_fp128"; return;
419 case Type::LabelTyID: OS << "label"; return;
420 case Type::MetadataTyID: OS << "metadata"; return;
421 case Type::X86_MMXTyID: OS << "x86_mmx"; return;
422 case Type::IntegerTyID:
423 OS << 'i' << cast<IntegerType>(Ty)->getBitWidth();
426 case Type::FunctionTyID: {
427 FunctionType *FTy = cast<FunctionType>(Ty);
428 print(FTy->getReturnType(), OS);
430 for (FunctionType::param_iterator I = FTy->param_begin(),
431 E = FTy->param_end(); I != E; ++I) {
432 if (I != FTy->param_begin())
436 if (FTy->isVarArg()) {
437 if (FTy->getNumParams()) OS << ", ";
443 case Type::StructTyID: {
444 StructType *STy = cast<StructType>(Ty);
446 if (STy->isLiteral())
447 return printStructBody(STy, OS);
449 if (!STy->getName().empty())
450 return PrintLLVMName(OS, STy->getName(), LocalPrefix);
452 DenseMap<StructType*, unsigned>::iterator I = NumberedTypes.find(STy);
453 if (I != NumberedTypes.end())
454 OS << '%' << I->second;
455 else // Not enumerated, print the hex address.
456 OS << "%\"type " << STy << '\"';
459 case Type::PointerTyID: {
460 PointerType *PTy = cast<PointerType>(Ty);
461 print(PTy->getElementType(), OS);
462 if (unsigned AddressSpace = PTy->getAddressSpace())
463 OS << " addrspace(" << AddressSpace << ')';
467 case Type::ArrayTyID: {
468 ArrayType *ATy = cast<ArrayType>(Ty);
469 OS << '[' << ATy->getNumElements() << " x ";
470 print(ATy->getElementType(), OS);
474 case Type::VectorTyID: {
475 VectorType *PTy = cast<VectorType>(Ty);
476 OS << "<" << PTy->getNumElements() << " x ";
477 print(PTy->getElementType(), OS);
482 llvm_unreachable("Invalid TypeID");
485 void TypePrinting::printStructBody(StructType *STy, raw_ostream &OS) {
486 if (STy->isOpaque()) {
494 if (STy->getNumElements() == 0) {
497 StructType::element_iterator I = STy->element_begin();
500 for (StructType::element_iterator E = STy->element_end(); I != E; ++I) {
511 //===----------------------------------------------------------------------===//
512 // SlotTracker Class: Enumerate slot numbers for unnamed values
513 //===----------------------------------------------------------------------===//
514 /// This class provides computation of slot numbers for LLVM Assembly writing.
518 /// ValueMap - A mapping of Values to slot numbers.
519 typedef DenseMap<const Value*, unsigned> ValueMap;
522 /// TheModule - The module for which we are holding slot numbers.
523 const Module* TheModule;
525 /// TheFunction - The function for which we are holding slot numbers.
526 const Function* TheFunction;
527 bool FunctionProcessed;
529 /// mMap - The slot map for the module level data.
533 /// fMap - The slot map for the function level data.
537 /// mdnMap - Map for MDNodes.
538 DenseMap<const MDNode*, unsigned> mdnMap;
541 /// asMap - The slot map for attribute sets.
542 DenseMap<AttributeSet, unsigned> asMap;
545 /// Construct from a module
546 explicit SlotTracker(const Module *M);
547 /// Construct from a function, starting out in incorp state.
548 explicit SlotTracker(const Function *F);
550 /// Return the slot number of the specified value in it's type
551 /// plane. If something is not in the SlotTracker, return -1.
552 int getLocalSlot(const Value *V);
553 int getGlobalSlot(const GlobalValue *V);
554 int getMetadataSlot(const MDNode *N);
555 int getAttributeGroupSlot(AttributeSet AS);
557 /// If you'd like to deal with a function instead of just a module, use
558 /// this method to get its data into the SlotTracker.
559 void incorporateFunction(const Function *F) {
561 FunctionProcessed = false;
564 const Function *getFunction() const { return TheFunction; }
566 /// After calling incorporateFunction, use this method to remove the
567 /// most recently incorporated function from the SlotTracker. This
568 /// will reset the state of the machine back to just the module contents.
569 void purgeFunction();
571 /// MDNode map iterators.
572 typedef DenseMap<const MDNode*, unsigned>::iterator mdn_iterator;
573 mdn_iterator mdn_begin() { return mdnMap.begin(); }
574 mdn_iterator mdn_end() { return mdnMap.end(); }
575 unsigned mdn_size() const { return mdnMap.size(); }
576 bool mdn_empty() const { return mdnMap.empty(); }
578 /// AttributeSet map iterators.
579 typedef DenseMap<AttributeSet, unsigned>::iterator as_iterator;
580 as_iterator as_begin() { return asMap.begin(); }
581 as_iterator as_end() { return asMap.end(); }
582 unsigned as_size() const { return asMap.size(); }
583 bool as_empty() const { return asMap.empty(); }
585 /// This function does the actual initialization.
586 inline void initialize();
588 // Implementation Details
590 /// CreateModuleSlot - Insert the specified GlobalValue* into the slot table.
591 void CreateModuleSlot(const GlobalValue *V);
593 /// CreateMetadataSlot - Insert the specified MDNode* into the slot table.
594 void CreateMetadataSlot(const MDNode *N);
596 /// CreateFunctionSlot - Insert the specified Value* into the slot table.
597 void CreateFunctionSlot(const Value *V);
599 /// \brief Insert the specified AttributeSet into the slot table.
600 void CreateAttributeSetSlot(AttributeSet AS);
602 /// Add all of the module level global variables (and their initializers)
603 /// and function declarations, but not the contents of those functions.
604 void processModule();
606 /// Add all of the functions arguments, basic blocks, and instructions.
607 void processFunction();
609 SlotTracker(const SlotTracker &) LLVM_DELETED_FUNCTION;
610 void operator=(const SlotTracker &) LLVM_DELETED_FUNCTION;
613 SlotTracker *createSlotTracker(const Module *M) {
614 return new SlotTracker(M);
617 static SlotTracker *createSlotTracker(const Value *V) {
618 if (const Argument *FA = dyn_cast<Argument>(V))
619 return new SlotTracker(FA->getParent());
621 if (const Instruction *I = dyn_cast<Instruction>(V))
623 return new SlotTracker(I->getParent()->getParent());
625 if (const BasicBlock *BB = dyn_cast<BasicBlock>(V))
626 return new SlotTracker(BB->getParent());
628 if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V))
629 return new SlotTracker(GV->getParent());
631 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(V))
632 return new SlotTracker(GA->getParent());
634 if (const Function *Func = dyn_cast<Function>(V))
635 return new SlotTracker(Func);
637 if (const MDNode *MD = dyn_cast<MDNode>(V)) {
638 if (!MD->isFunctionLocal())
639 return new SlotTracker(MD->getFunction());
641 return new SlotTracker((Function *)nullptr);
648 #define ST_DEBUG(X) dbgs() << X
653 // Module level constructor. Causes the contents of the Module (sans functions)
654 // to be added to the slot table.
655 SlotTracker::SlotTracker(const Module *M)
656 : TheModule(M), TheFunction(nullptr), FunctionProcessed(false),
657 mNext(0), fNext(0), mdnNext(0), asNext(0) {
660 // Function level constructor. Causes the contents of the Module and the one
661 // function provided to be added to the slot table.
662 SlotTracker::SlotTracker(const Function *F)
663 : TheModule(F ? F->getParent() : nullptr), TheFunction(F),
664 FunctionProcessed(false), mNext(0), fNext(0), mdnNext(0), asNext(0) {
667 inline void SlotTracker::initialize() {
670 TheModule = nullptr; ///< Prevent re-processing next time we're called.
673 if (TheFunction && !FunctionProcessed)
677 // Iterate through all the global variables, functions, and global
678 // variable initializers and create slots for them.
679 void SlotTracker::processModule() {
680 ST_DEBUG("begin processModule!\n");
682 // Add all of the unnamed global variables to the value table.
683 for (Module::const_global_iterator I = TheModule->global_begin(),
684 E = TheModule->global_end(); I != E; ++I) {
689 // Add metadata used by named metadata.
690 for (Module::const_named_metadata_iterator
691 I = TheModule->named_metadata_begin(),
692 E = TheModule->named_metadata_end(); I != E; ++I) {
693 const NamedMDNode *NMD = I;
694 for (unsigned i = 0, e = NMD->getNumOperands(); i != e; ++i)
695 CreateMetadataSlot(NMD->getOperand(i));
698 for (Module::const_iterator I = TheModule->begin(), E = TheModule->end();
701 // Add all the unnamed functions to the table.
704 // Add all the function attributes to the table.
705 // FIXME: Add attributes of other objects?
706 AttributeSet FnAttrs = I->getAttributes().getFnAttributes();
707 if (FnAttrs.hasAttributes(AttributeSet::FunctionIndex))
708 CreateAttributeSetSlot(FnAttrs);
711 ST_DEBUG("end processModule!\n");
714 // Process the arguments, basic blocks, and instructions of a function.
715 void SlotTracker::processFunction() {
716 ST_DEBUG("begin processFunction!\n");
719 // Add all the function arguments with no names.
720 for(Function::const_arg_iterator AI = TheFunction->arg_begin(),
721 AE = TheFunction->arg_end(); AI != AE; ++AI)
723 CreateFunctionSlot(AI);
725 ST_DEBUG("Inserting Instructions:\n");
727 SmallVector<std::pair<unsigned, MDNode *>, 4> MDForInst;
729 // Add all of the basic blocks and instructions with no names.
730 for (Function::const_iterator BB = TheFunction->begin(),
731 E = TheFunction->end(); BB != E; ++BB) {
733 CreateFunctionSlot(BB);
735 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E;
737 if (!I->getType()->isVoidTy() && !I->hasName())
738 CreateFunctionSlot(I);
740 // Intrinsics can directly use metadata. We allow direct calls to any
741 // llvm.foo function here, because the target may not be linked into the
743 if (const CallInst *CI = dyn_cast<CallInst>(I)) {
744 if (Function *F = CI->getCalledFunction())
745 if (F->isIntrinsic())
746 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
747 if (MDNode *N = dyn_cast_or_null<MDNode>(I->getOperand(i)))
748 CreateMetadataSlot(N);
750 // Add all the call attributes to the table.
751 AttributeSet Attrs = CI->getAttributes().getFnAttributes();
752 if (Attrs.hasAttributes(AttributeSet::FunctionIndex))
753 CreateAttributeSetSlot(Attrs);
754 } else if (const InvokeInst *II = dyn_cast<InvokeInst>(I)) {
755 // Add all the call attributes to the table.
756 AttributeSet Attrs = II->getAttributes().getFnAttributes();
757 if (Attrs.hasAttributes(AttributeSet::FunctionIndex))
758 CreateAttributeSetSlot(Attrs);
761 // Process metadata attached with this instruction.
762 I->getAllMetadata(MDForInst);
763 for (unsigned i = 0, e = MDForInst.size(); i != e; ++i)
764 CreateMetadataSlot(MDForInst[i].second);
769 FunctionProcessed = true;
771 ST_DEBUG("end processFunction!\n");
774 /// Clean up after incorporating a function. This is the only way to get out of
775 /// the function incorporation state that affects get*Slot/Create*Slot. Function
776 /// incorporation state is indicated by TheFunction != 0.
777 void SlotTracker::purgeFunction() {
778 ST_DEBUG("begin purgeFunction!\n");
779 fMap.clear(); // Simply discard the function level map
780 TheFunction = nullptr;
781 FunctionProcessed = false;
782 ST_DEBUG("end purgeFunction!\n");
785 /// getGlobalSlot - Get the slot number of a global value.
786 int SlotTracker::getGlobalSlot(const GlobalValue *V) {
787 // Check for uninitialized state and do lazy initialization.
790 // Find the value in the module map
791 ValueMap::iterator MI = mMap.find(V);
792 return MI == mMap.end() ? -1 : (int)MI->second;
795 /// getMetadataSlot - Get the slot number of a MDNode.
796 int SlotTracker::getMetadataSlot(const MDNode *N) {
797 // Check for uninitialized state and do lazy initialization.
800 // Find the MDNode in the module map
801 mdn_iterator MI = mdnMap.find(N);
802 return MI == mdnMap.end() ? -1 : (int)MI->second;
806 /// getLocalSlot - Get the slot number for a value that is local to a function.
807 int SlotTracker::getLocalSlot(const Value *V) {
808 assert(!isa<Constant>(V) && "Can't get a constant or global slot with this!");
810 // Check for uninitialized state and do lazy initialization.
813 ValueMap::iterator FI = fMap.find(V);
814 return FI == fMap.end() ? -1 : (int)FI->second;
817 int SlotTracker::getAttributeGroupSlot(AttributeSet AS) {
818 // Check for uninitialized state and do lazy initialization.
821 // Find the AttributeSet in the module map.
822 as_iterator AI = asMap.find(AS);
823 return AI == asMap.end() ? -1 : (int)AI->second;
826 /// CreateModuleSlot - Insert the specified GlobalValue* into the slot table.
827 void SlotTracker::CreateModuleSlot(const GlobalValue *V) {
828 assert(V && "Can't insert a null Value into SlotTracker!");
829 assert(!V->getType()->isVoidTy() && "Doesn't need a slot!");
830 assert(!V->hasName() && "Doesn't need a slot!");
832 unsigned DestSlot = mNext++;
835 ST_DEBUG(" Inserting value [" << V->getType() << "] = " << V << " slot=" <<
837 // G = Global, F = Function, A = Alias, o = other
838 ST_DEBUG((isa<GlobalVariable>(V) ? 'G' :
839 (isa<Function>(V) ? 'F' :
840 (isa<GlobalAlias>(V) ? 'A' : 'o'))) << "]\n");
843 /// CreateSlot - Create a new slot for the specified value if it has no name.
844 void SlotTracker::CreateFunctionSlot(const Value *V) {
845 assert(!V->getType()->isVoidTy() && !V->hasName() && "Doesn't need a slot!");
847 unsigned DestSlot = fNext++;
850 // G = Global, F = Function, o = other
851 ST_DEBUG(" Inserting value [" << V->getType() << "] = " << V << " slot=" <<
852 DestSlot << " [o]\n");
855 /// CreateModuleSlot - Insert the specified MDNode* into the slot table.
856 void SlotTracker::CreateMetadataSlot(const MDNode *N) {
857 assert(N && "Can't insert a null Value into SlotTracker!");
859 // Don't insert if N is a function-local metadata, these are always printed
861 if (!N->isFunctionLocal()) {
862 mdn_iterator I = mdnMap.find(N);
863 if (I != mdnMap.end())
866 unsigned DestSlot = mdnNext++;
867 mdnMap[N] = DestSlot;
870 // Recursively add any MDNodes referenced by operands.
871 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
872 if (const MDNode *Op = dyn_cast_or_null<MDNode>(N->getOperand(i)))
873 CreateMetadataSlot(Op);
876 void SlotTracker::CreateAttributeSetSlot(AttributeSet AS) {
877 assert(AS.hasAttributes(AttributeSet::FunctionIndex) &&
878 "Doesn't need a slot!");
880 as_iterator I = asMap.find(AS);
881 if (I != asMap.end())
884 unsigned DestSlot = asNext++;
885 asMap[AS] = DestSlot;
888 //===----------------------------------------------------------------------===//
889 // AsmWriter Implementation
890 //===----------------------------------------------------------------------===//
892 static void WriteAsOperandInternal(raw_ostream &Out, const Value *V,
893 TypePrinting *TypePrinter,
894 SlotTracker *Machine,
895 const Module *Context);
897 static const char *getPredicateText(unsigned predicate) {
898 const char * pred = "unknown";
900 case FCmpInst::FCMP_FALSE: pred = "false"; break;
901 case FCmpInst::FCMP_OEQ: pred = "oeq"; break;
902 case FCmpInst::FCMP_OGT: pred = "ogt"; break;
903 case FCmpInst::FCMP_OGE: pred = "oge"; break;
904 case FCmpInst::FCMP_OLT: pred = "olt"; break;
905 case FCmpInst::FCMP_OLE: pred = "ole"; break;
906 case FCmpInst::FCMP_ONE: pred = "one"; break;
907 case FCmpInst::FCMP_ORD: pred = "ord"; break;
908 case FCmpInst::FCMP_UNO: pred = "uno"; break;
909 case FCmpInst::FCMP_UEQ: pred = "ueq"; break;
910 case FCmpInst::FCMP_UGT: pred = "ugt"; break;
911 case FCmpInst::FCMP_UGE: pred = "uge"; break;
912 case FCmpInst::FCMP_ULT: pred = "ult"; break;
913 case FCmpInst::FCMP_ULE: pred = "ule"; break;
914 case FCmpInst::FCMP_UNE: pred = "une"; break;
915 case FCmpInst::FCMP_TRUE: pred = "true"; break;
916 case ICmpInst::ICMP_EQ: pred = "eq"; break;
917 case ICmpInst::ICMP_NE: pred = "ne"; break;
918 case ICmpInst::ICMP_SGT: pred = "sgt"; break;
919 case ICmpInst::ICMP_SGE: pred = "sge"; break;
920 case ICmpInst::ICMP_SLT: pred = "slt"; break;
921 case ICmpInst::ICMP_SLE: pred = "sle"; break;
922 case ICmpInst::ICMP_UGT: pred = "ugt"; break;
923 case ICmpInst::ICMP_UGE: pred = "uge"; break;
924 case ICmpInst::ICMP_ULT: pred = "ult"; break;
925 case ICmpInst::ICMP_ULE: pred = "ule"; break;
930 static void writeAtomicRMWOperation(raw_ostream &Out,
931 AtomicRMWInst::BinOp Op) {
933 default: Out << " <unknown operation " << Op << ">"; break;
934 case AtomicRMWInst::Xchg: Out << " xchg"; break;
935 case AtomicRMWInst::Add: Out << " add"; break;
936 case AtomicRMWInst::Sub: Out << " sub"; break;
937 case AtomicRMWInst::And: Out << " and"; break;
938 case AtomicRMWInst::Nand: Out << " nand"; break;
939 case AtomicRMWInst::Or: Out << " or"; break;
940 case AtomicRMWInst::Xor: Out << " xor"; break;
941 case AtomicRMWInst::Max: Out << " max"; break;
942 case AtomicRMWInst::Min: Out << " min"; break;
943 case AtomicRMWInst::UMax: Out << " umax"; break;
944 case AtomicRMWInst::UMin: Out << " umin"; break;
948 static void WriteOptimizationInfo(raw_ostream &Out, const User *U) {
949 if (const FPMathOperator *FPO = dyn_cast<const FPMathOperator>(U)) {
950 // Unsafe algebra implies all the others, no need to write them all out
951 if (FPO->hasUnsafeAlgebra())
954 if (FPO->hasNoNaNs())
956 if (FPO->hasNoInfs())
958 if (FPO->hasNoSignedZeros())
960 if (FPO->hasAllowReciprocal())
965 if (const OverflowingBinaryOperator *OBO =
966 dyn_cast<OverflowingBinaryOperator>(U)) {
967 if (OBO->hasNoUnsignedWrap())
969 if (OBO->hasNoSignedWrap())
971 } else if (const PossiblyExactOperator *Div =
972 dyn_cast<PossiblyExactOperator>(U)) {
975 } else if (const GEPOperator *GEP = dyn_cast<GEPOperator>(U)) {
976 if (GEP->isInBounds())
981 static void WriteConstantInternal(raw_ostream &Out, const Constant *CV,
982 TypePrinting &TypePrinter,
983 SlotTracker *Machine,
984 const Module *Context) {
985 if (const ConstantInt *CI = dyn_cast<ConstantInt>(CV)) {
986 if (CI->getType()->isIntegerTy(1)) {
987 Out << (CI->getZExtValue() ? "true" : "false");
990 Out << CI->getValue();
994 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(CV)) {
995 if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEsingle ||
996 &CFP->getValueAPF().getSemantics() == &APFloat::IEEEdouble) {
997 // We would like to output the FP constant value in exponential notation,
998 // but we cannot do this if doing so will lose precision. Check here to
999 // make sure that we only output it in exponential format if we can parse
1000 // the value back and get the same value.
1003 bool isHalf = &CFP->getValueAPF().getSemantics()==&APFloat::IEEEhalf;
1004 bool isDouble = &CFP->getValueAPF().getSemantics()==&APFloat::IEEEdouble;
1005 bool isInf = CFP->getValueAPF().isInfinity();
1006 bool isNaN = CFP->getValueAPF().isNaN();
1007 if (!isHalf && !isInf && !isNaN) {
1008 double Val = isDouble ? CFP->getValueAPF().convertToDouble() :
1009 CFP->getValueAPF().convertToFloat();
1010 SmallString<128> StrVal;
1011 raw_svector_ostream(StrVal) << Val;
1013 // Check to make sure that the stringized number is not some string like
1014 // "Inf" or NaN, that atof will accept, but the lexer will not. Check
1015 // that the string matches the "[-+]?[0-9]" regex.
1017 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
1018 ((StrVal[0] == '-' || StrVal[0] == '+') &&
1019 (StrVal[1] >= '0' && StrVal[1] <= '9'))) {
1020 // Reparse stringized version!
1021 if (APFloat(APFloat::IEEEdouble, StrVal).convertToDouble() == Val) {
1022 Out << StrVal.str();
1027 // Otherwise we could not reparse it to exactly the same value, so we must
1028 // output the string in hexadecimal format! Note that loading and storing
1029 // floating point types changes the bits of NaNs on some hosts, notably
1030 // x86, so we must not use these types.
1031 static_assert(sizeof(double) == sizeof(uint64_t),
1032 "assuming that double is 64 bits!");
1034 APFloat apf = CFP->getValueAPF();
1035 // Halves and floats are represented in ASCII IR as double, convert.
1037 apf.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven,
1040 utohex_buffer(uint64_t(apf.bitcastToAPInt().getZExtValue()),
1045 // Either half, or some form of long double.
1046 // These appear as a magic letter identifying the type, then a
1047 // fixed number of hex digits.
1049 // Bit position, in the current word, of the next nibble to print.
1052 if (&CFP->getValueAPF().getSemantics() == &APFloat::x87DoubleExtended) {
1054 // api needed to prevent premature destruction
1055 APInt api = CFP->getValueAPF().bitcastToAPInt();
1056 const uint64_t* p = api.getRawData();
1057 uint64_t word = p[1];
1059 int width = api.getBitWidth();
1060 for (int j=0; j<width; j+=4, shiftcount-=4) {
1061 unsigned int nibble = (word>>shiftcount) & 15;
1063 Out << (unsigned char)(nibble + '0');
1065 Out << (unsigned char)(nibble - 10 + 'A');
1066 if (shiftcount == 0 && j+4 < width) {
1070 shiftcount = width-j-4;
1074 } else if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEquad) {
1077 } else if (&CFP->getValueAPF().getSemantics() == &APFloat::PPCDoubleDouble) {
1080 } else if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEhalf) {
1084 llvm_unreachable("Unsupported floating point type");
1085 // api needed to prevent premature destruction
1086 APInt api = CFP->getValueAPF().bitcastToAPInt();
1087 const uint64_t* p = api.getRawData();
1089 int width = api.getBitWidth();
1090 for (int j=0; j<width; j+=4, shiftcount-=4) {
1091 unsigned int nibble = (word>>shiftcount) & 15;
1093 Out << (unsigned char)(nibble + '0');
1095 Out << (unsigned char)(nibble - 10 + 'A');
1096 if (shiftcount == 0 && j+4 < width) {
1100 shiftcount = width-j-4;
1106 if (isa<ConstantAggregateZero>(CV)) {
1107 Out << "zeroinitializer";
1111 if (const BlockAddress *BA = dyn_cast<BlockAddress>(CV)) {
1112 Out << "blockaddress(";
1113 WriteAsOperandInternal(Out, BA->getFunction(), &TypePrinter, Machine,
1116 WriteAsOperandInternal(Out, BA->getBasicBlock(), &TypePrinter, Machine,
1122 if (const ConstantArray *CA = dyn_cast<ConstantArray>(CV)) {
1123 Type *ETy = CA->getType()->getElementType();
1125 TypePrinter.print(ETy, Out);
1127 WriteAsOperandInternal(Out, CA->getOperand(0),
1128 &TypePrinter, Machine,
1130 for (unsigned i = 1, e = CA->getNumOperands(); i != e; ++i) {
1132 TypePrinter.print(ETy, Out);
1134 WriteAsOperandInternal(Out, CA->getOperand(i), &TypePrinter, Machine,
1141 if (const ConstantDataArray *CA = dyn_cast<ConstantDataArray>(CV)) {
1142 // As a special case, print the array as a string if it is an array of
1143 // i8 with ConstantInt values.
1144 if (CA->isString()) {
1146 PrintEscapedString(CA->getAsString(), Out);
1151 Type *ETy = CA->getType()->getElementType();
1153 TypePrinter.print(ETy, Out);
1155 WriteAsOperandInternal(Out, CA->getElementAsConstant(0),
1156 &TypePrinter, Machine,
1158 for (unsigned i = 1, e = CA->getNumElements(); i != e; ++i) {
1160 TypePrinter.print(ETy, Out);
1162 WriteAsOperandInternal(Out, CA->getElementAsConstant(i), &TypePrinter,
1170 if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(CV)) {
1171 if (CS->getType()->isPacked())
1174 unsigned N = CS->getNumOperands();
1177 TypePrinter.print(CS->getOperand(0)->getType(), Out);
1180 WriteAsOperandInternal(Out, CS->getOperand(0), &TypePrinter, Machine,
1183 for (unsigned i = 1; i < N; i++) {
1185 TypePrinter.print(CS->getOperand(i)->getType(), Out);
1188 WriteAsOperandInternal(Out, CS->getOperand(i), &TypePrinter, Machine,
1195 if (CS->getType()->isPacked())
1200 if (isa<ConstantVector>(CV) || isa<ConstantDataVector>(CV)) {
1201 Type *ETy = CV->getType()->getVectorElementType();
1203 TypePrinter.print(ETy, Out);
1205 WriteAsOperandInternal(Out, CV->getAggregateElement(0U), &TypePrinter,
1207 for (unsigned i = 1, e = CV->getType()->getVectorNumElements(); i != e;++i){
1209 TypePrinter.print(ETy, Out);
1211 WriteAsOperandInternal(Out, CV->getAggregateElement(i), &TypePrinter,
1218 if (isa<ConstantPointerNull>(CV)) {
1223 if (isa<UndefValue>(CV)) {
1228 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CV)) {
1229 Out << CE->getOpcodeName();
1230 WriteOptimizationInfo(Out, CE);
1231 if (CE->isCompare())
1232 Out << ' ' << getPredicateText(CE->getPredicate());
1235 for (User::const_op_iterator OI=CE->op_begin(); OI != CE->op_end(); ++OI) {
1236 TypePrinter.print((*OI)->getType(), Out);
1238 WriteAsOperandInternal(Out, *OI, &TypePrinter, Machine, Context);
1239 if (OI+1 != CE->op_end())
1243 if (CE->hasIndices()) {
1244 ArrayRef<unsigned> Indices = CE->getIndices();
1245 for (unsigned i = 0, e = Indices.size(); i != e; ++i)
1246 Out << ", " << Indices[i];
1251 TypePrinter.print(CE->getType(), Out);
1258 Out << "<placeholder or erroneous Constant>";
1261 static void WriteMDNodeBodyInternal(raw_ostream &Out, const MDNode *Node,
1262 TypePrinting *TypePrinter,
1263 SlotTracker *Machine,
1264 const Module *Context) {
1266 for (unsigned mi = 0, me = Node->getNumOperands(); mi != me; ++mi) {
1267 const Value *V = Node->getOperand(mi);
1271 TypePrinter->print(V->getType(), Out);
1273 WriteAsOperandInternal(Out, Node->getOperand(mi),
1274 TypePrinter, Machine, Context);
1283 // Full implementation of printing a Value as an operand with support for
1284 // TypePrinting, etc.
1285 static void WriteAsOperandInternal(raw_ostream &Out, const Value *V,
1286 TypePrinting *TypePrinter,
1287 SlotTracker *Machine,
1288 const Module *Context) {
1290 PrintLLVMName(Out, V);
1294 const Constant *CV = dyn_cast<Constant>(V);
1295 if (CV && !isa<GlobalValue>(CV)) {
1296 assert(TypePrinter && "Constants require TypePrinting!");
1297 WriteConstantInternal(Out, CV, *TypePrinter, Machine, Context);
1301 if (const InlineAsm *IA = dyn_cast<InlineAsm>(V)) {
1303 if (IA->hasSideEffects())
1304 Out << "sideeffect ";
1305 if (IA->isAlignStack())
1306 Out << "alignstack ";
1307 // We don't emit the AD_ATT dialect as it's the assumed default.
1308 if (IA->getDialect() == InlineAsm::AD_Intel)
1309 Out << "inteldialect ";
1311 PrintEscapedString(IA->getAsmString(), Out);
1313 PrintEscapedString(IA->getConstraintString(), Out);
1318 if (const MDNode *N = dyn_cast<MDNode>(V)) {
1319 if (N->isFunctionLocal()) {
1320 // Print metadata inline, not via slot reference number.
1321 WriteMDNodeBodyInternal(Out, N, TypePrinter, Machine, Context);
1326 if (N->isFunctionLocal())
1327 Machine = new SlotTracker(N->getFunction());
1329 Machine = new SlotTracker(Context);
1331 int Slot = Machine->getMetadataSlot(N);
1339 if (const MDString *MDS = dyn_cast<MDString>(V)) {
1341 PrintEscapedString(MDS->getString(), Out);
1348 // If we have a SlotTracker, use it.
1350 if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
1351 Slot = Machine->getGlobalSlot(GV);
1354 Slot = Machine->getLocalSlot(V);
1356 // If the local value didn't succeed, then we may be referring to a value
1357 // from a different function. Translate it, as this can happen when using
1358 // address of blocks.
1360 if ((Machine = createSlotTracker(V))) {
1361 Slot = Machine->getLocalSlot(V);
1365 } else if ((Machine = createSlotTracker(V))) {
1366 // Otherwise, create one to get the # and then destroy it.
1367 if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
1368 Slot = Machine->getGlobalSlot(GV);
1371 Slot = Machine->getLocalSlot(V);
1380 Out << Prefix << Slot;
1385 void AssemblyWriter::init() {
1388 TypePrinter.incorporateTypes(*TheModule);
1389 for (const Function &F : *TheModule)
1390 if (const Comdat *C = F.getComdat())
1392 for (const GlobalVariable &GV : TheModule->globals())
1393 if (const Comdat *C = GV.getComdat())
1398 AssemblyWriter::AssemblyWriter(formatted_raw_ostream &o, SlotTracker &Mac,
1400 AssemblyAnnotationWriter *AAW)
1401 : Out(o), TheModule(M), Machine(Mac), AnnotationWriter(AAW) {
1405 AssemblyWriter::AssemblyWriter(formatted_raw_ostream &o, const Module *M,
1406 AssemblyAnnotationWriter *AAW)
1407 : Out(o), TheModule(M), ModuleSlotTracker(createSlotTracker(M)),
1408 Machine(*ModuleSlotTracker), AnnotationWriter(AAW) {
1412 AssemblyWriter::~AssemblyWriter() { }
1414 void AssemblyWriter::writeOperand(const Value *Operand, bool PrintType) {
1416 Out << "<null operand!>";
1420 TypePrinter.print(Operand->getType(), Out);
1423 WriteAsOperandInternal(Out, Operand, &TypePrinter, &Machine, TheModule);
1426 void AssemblyWriter::writeAtomic(AtomicOrdering Ordering,
1427 SynchronizationScope SynchScope) {
1428 if (Ordering == NotAtomic)
1431 switch (SynchScope) {
1432 case SingleThread: Out << " singlethread"; break;
1433 case CrossThread: break;
1437 default: Out << " <bad ordering " << int(Ordering) << ">"; break;
1438 case Unordered: Out << " unordered"; break;
1439 case Monotonic: Out << " monotonic"; break;
1440 case Acquire: Out << " acquire"; break;
1441 case Release: Out << " release"; break;
1442 case AcquireRelease: Out << " acq_rel"; break;
1443 case SequentiallyConsistent: Out << " seq_cst"; break;
1447 void AssemblyWriter::writeAtomicCmpXchg(AtomicOrdering SuccessOrdering,
1448 AtomicOrdering FailureOrdering,
1449 SynchronizationScope SynchScope) {
1450 assert(SuccessOrdering != NotAtomic && FailureOrdering != NotAtomic);
1452 switch (SynchScope) {
1453 case SingleThread: Out << " singlethread"; break;
1454 case CrossThread: break;
1457 switch (SuccessOrdering) {
1458 default: Out << " <bad ordering " << int(SuccessOrdering) << ">"; break;
1459 case Unordered: Out << " unordered"; break;
1460 case Monotonic: Out << " monotonic"; break;
1461 case Acquire: Out << " acquire"; break;
1462 case Release: Out << " release"; break;
1463 case AcquireRelease: Out << " acq_rel"; break;
1464 case SequentiallyConsistent: Out << " seq_cst"; break;
1467 switch (FailureOrdering) {
1468 default: Out << " <bad ordering " << int(FailureOrdering) << ">"; break;
1469 case Unordered: Out << " unordered"; break;
1470 case Monotonic: Out << " monotonic"; break;
1471 case Acquire: Out << " acquire"; break;
1472 case Release: Out << " release"; break;
1473 case AcquireRelease: Out << " acq_rel"; break;
1474 case SequentiallyConsistent: Out << " seq_cst"; break;
1478 void AssemblyWriter::writeParamOperand(const Value *Operand,
1479 AttributeSet Attrs, unsigned Idx) {
1481 Out << "<null operand!>";
1486 TypePrinter.print(Operand->getType(), Out);
1487 // Print parameter attributes list
1488 if (Attrs.hasAttributes(Idx))
1489 Out << ' ' << Attrs.getAsString(Idx);
1491 // Print the operand
1492 WriteAsOperandInternal(Out, Operand, &TypePrinter, &Machine, TheModule);
1495 void AssemblyWriter::printModule(const Module *M) {
1496 Machine.initialize();
1498 if (shouldPreserveAssemblyUseListOrder())
1499 UseListOrders = predictUseListOrder(M);
1501 if (!M->getModuleIdentifier().empty() &&
1502 // Don't print the ID if it will start a new line (which would
1503 // require a comment char before it).
1504 M->getModuleIdentifier().find('\n') == std::string::npos)
1505 Out << "; ModuleID = '" << M->getModuleIdentifier() << "'\n";
1507 const std::string &DL = M->getDataLayoutStr();
1509 Out << "target datalayout = \"" << DL << "\"\n";
1510 if (!M->getTargetTriple().empty())
1511 Out << "target triple = \"" << M->getTargetTriple() << "\"\n";
1513 if (!M->getModuleInlineAsm().empty()) {
1514 // Split the string into lines, to make it easier to read the .ll file.
1515 std::string Asm = M->getModuleInlineAsm();
1517 size_t NewLine = Asm.find_first_of('\n', CurPos);
1519 while (NewLine != std::string::npos) {
1520 // We found a newline, print the portion of the asm string from the
1521 // last newline up to this newline.
1522 Out << "module asm \"";
1523 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.begin()+NewLine),
1527 NewLine = Asm.find_first_of('\n', CurPos);
1529 std::string rest(Asm.begin()+CurPos, Asm.end());
1530 if (!rest.empty()) {
1531 Out << "module asm \"";
1532 PrintEscapedString(rest, Out);
1537 printTypeIdentities();
1539 // Output all comdats.
1540 if (!Comdats.empty())
1542 for (const Comdat *C : Comdats) {
1544 if (C != Comdats.back())
1548 // Output all globals.
1549 if (!M->global_empty()) Out << '\n';
1550 for (Module::const_global_iterator I = M->global_begin(), E = M->global_end();
1552 printGlobal(I); Out << '\n';
1555 // Output all aliases.
1556 if (!M->alias_empty()) Out << "\n";
1557 for (Module::const_alias_iterator I = M->alias_begin(), E = M->alias_end();
1561 // Output global use-lists.
1562 printUseLists(nullptr);
1564 // Output all of the functions.
1565 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
1567 assert(UseListOrders.empty() && "All use-lists should have been consumed");
1569 // Output all attribute groups.
1570 if (!Machine.as_empty()) {
1572 writeAllAttributeGroups();
1575 // Output named metadata.
1576 if (!M->named_metadata_empty()) Out << '\n';
1578 for (Module::const_named_metadata_iterator I = M->named_metadata_begin(),
1579 E = M->named_metadata_end(); I != E; ++I)
1580 printNamedMDNode(I);
1583 if (!Machine.mdn_empty()) {
1589 void AssemblyWriter::printNamedMDNode(const NamedMDNode *NMD) {
1591 StringRef Name = NMD->getName();
1593 Out << "<empty name> ";
1595 if (isalpha(static_cast<unsigned char>(Name[0])) ||
1596 Name[0] == '-' || Name[0] == '$' ||
1597 Name[0] == '.' || Name[0] == '_')
1600 Out << '\\' << hexdigit(Name[0] >> 4) << hexdigit(Name[0] & 0x0F);
1601 for (unsigned i = 1, e = Name.size(); i != e; ++i) {
1602 unsigned char C = Name[i];
1603 if (isalnum(static_cast<unsigned char>(C)) || C == '-' || C == '$' ||
1604 C == '.' || C == '_')
1607 Out << '\\' << hexdigit(C >> 4) << hexdigit(C & 0x0F);
1611 for (unsigned i = 0, e = NMD->getNumOperands(); i != e; ++i) {
1613 int Slot = Machine.getMetadataSlot(NMD->getOperand(i));
1623 static void PrintLinkage(GlobalValue::LinkageTypes LT,
1624 formatted_raw_ostream &Out) {
1626 case GlobalValue::ExternalLinkage: break;
1627 case GlobalValue::PrivateLinkage: Out << "private "; break;
1628 case GlobalValue::InternalLinkage: Out << "internal "; break;
1629 case GlobalValue::LinkOnceAnyLinkage: Out << "linkonce "; break;
1630 case GlobalValue::LinkOnceODRLinkage: Out << "linkonce_odr "; break;
1631 case GlobalValue::WeakAnyLinkage: Out << "weak "; break;
1632 case GlobalValue::WeakODRLinkage: Out << "weak_odr "; break;
1633 case GlobalValue::CommonLinkage: Out << "common "; break;
1634 case GlobalValue::AppendingLinkage: Out << "appending "; break;
1635 case GlobalValue::ExternalWeakLinkage: Out << "extern_weak "; break;
1636 case GlobalValue::AvailableExternallyLinkage:
1637 Out << "available_externally ";
1643 static void PrintVisibility(GlobalValue::VisibilityTypes Vis,
1644 formatted_raw_ostream &Out) {
1646 case GlobalValue::DefaultVisibility: break;
1647 case GlobalValue::HiddenVisibility: Out << "hidden "; break;
1648 case GlobalValue::ProtectedVisibility: Out << "protected "; break;
1652 static void PrintDLLStorageClass(GlobalValue::DLLStorageClassTypes SCT,
1653 formatted_raw_ostream &Out) {
1655 case GlobalValue::DefaultStorageClass: break;
1656 case GlobalValue::DLLImportStorageClass: Out << "dllimport "; break;
1657 case GlobalValue::DLLExportStorageClass: Out << "dllexport "; break;
1661 static void PrintThreadLocalModel(GlobalVariable::ThreadLocalMode TLM,
1662 formatted_raw_ostream &Out) {
1664 case GlobalVariable::NotThreadLocal:
1666 case GlobalVariable::GeneralDynamicTLSModel:
1667 Out << "thread_local ";
1669 case GlobalVariable::LocalDynamicTLSModel:
1670 Out << "thread_local(localdynamic) ";
1672 case GlobalVariable::InitialExecTLSModel:
1673 Out << "thread_local(initialexec) ";
1675 case GlobalVariable::LocalExecTLSModel:
1676 Out << "thread_local(localexec) ";
1681 void AssemblyWriter::printGlobal(const GlobalVariable *GV) {
1682 if (GV->isMaterializable())
1683 Out << "; Materializable\n";
1685 WriteAsOperandInternal(Out, GV, &TypePrinter, &Machine, GV->getParent());
1688 if (!GV->hasInitializer() && GV->hasExternalLinkage())
1691 PrintLinkage(GV->getLinkage(), Out);
1692 PrintVisibility(GV->getVisibility(), Out);
1693 PrintDLLStorageClass(GV->getDLLStorageClass(), Out);
1694 PrintThreadLocalModel(GV->getThreadLocalMode(), Out);
1695 if (GV->hasUnnamedAddr())
1696 Out << "unnamed_addr ";
1698 if (unsigned AddressSpace = GV->getType()->getAddressSpace())
1699 Out << "addrspace(" << AddressSpace << ") ";
1700 if (GV->isExternallyInitialized()) Out << "externally_initialized ";
1701 Out << (GV->isConstant() ? "constant " : "global ");
1702 TypePrinter.print(GV->getType()->getElementType(), Out);
1704 if (GV->hasInitializer()) {
1706 writeOperand(GV->getInitializer(), false);
1709 if (GV->hasSection()) {
1710 Out << ", section \"";
1711 PrintEscapedString(GV->getSection(), Out);
1714 if (GV->hasComdat()) {
1716 PrintLLVMName(Out, GV->getComdat()->getName(), ComdatPrefix);
1718 if (GV->getAlignment())
1719 Out << ", align " << GV->getAlignment();
1721 printInfoComment(*GV);
1724 void AssemblyWriter::printAlias(const GlobalAlias *GA) {
1725 if (GA->isMaterializable())
1726 Out << "; Materializable\n";
1728 // Don't crash when dumping partially built GA
1730 Out << "<<nameless>> = ";
1732 PrintLLVMName(Out, GA);
1735 PrintLinkage(GA->getLinkage(), Out);
1736 PrintVisibility(GA->getVisibility(), Out);
1737 PrintDLLStorageClass(GA->getDLLStorageClass(), Out);
1738 PrintThreadLocalModel(GA->getThreadLocalMode(), Out);
1739 if (GA->hasUnnamedAddr())
1740 Out << "unnamed_addr ";
1744 const Constant *Aliasee = GA->getAliasee();
1747 TypePrinter.print(GA->getType(), Out);
1748 Out << " <<NULL ALIASEE>>";
1750 writeOperand(Aliasee, !isa<ConstantExpr>(Aliasee));
1753 printInfoComment(*GA);
1757 void AssemblyWriter::printComdat(const Comdat *C) {
1761 void AssemblyWriter::printTypeIdentities() {
1762 if (TypePrinter.NumberedTypes.empty() &&
1763 TypePrinter.NamedTypes.empty())
1768 // We know all the numbers that each type is used and we know that it is a
1769 // dense assignment. Convert the map to an index table.
1770 std::vector<StructType*> NumberedTypes(TypePrinter.NumberedTypes.size());
1771 for (DenseMap<StructType*, unsigned>::iterator I =
1772 TypePrinter.NumberedTypes.begin(), E = TypePrinter.NumberedTypes.end();
1774 assert(I->second < NumberedTypes.size() && "Didn't get a dense numbering?");
1775 NumberedTypes[I->second] = I->first;
1778 // Emit all numbered types.
1779 for (unsigned i = 0, e = NumberedTypes.size(); i != e; ++i) {
1780 Out << '%' << i << " = type ";
1782 // Make sure we print out at least one level of the type structure, so
1783 // that we do not get %2 = type %2
1784 TypePrinter.printStructBody(NumberedTypes[i], Out);
1788 for (unsigned i = 0, e = TypePrinter.NamedTypes.size(); i != e; ++i) {
1789 PrintLLVMName(Out, TypePrinter.NamedTypes[i]->getName(), LocalPrefix);
1792 // Make sure we print out at least one level of the type structure, so
1793 // that we do not get %FILE = type %FILE
1794 TypePrinter.printStructBody(TypePrinter.NamedTypes[i], Out);
1799 /// printFunction - Print all aspects of a function.
1801 void AssemblyWriter::printFunction(const Function *F) {
1802 // Print out the return type and name.
1805 if (AnnotationWriter) AnnotationWriter->emitFunctionAnnot(F, Out);
1807 if (F->isMaterializable())
1808 Out << "; Materializable\n";
1810 const AttributeSet &Attrs = F->getAttributes();
1811 if (Attrs.hasAttributes(AttributeSet::FunctionIndex)) {
1812 AttributeSet AS = Attrs.getFnAttributes();
1813 std::string AttrStr;
1816 for (unsigned E = AS.getNumSlots(); Idx != E; ++Idx)
1817 if (AS.getSlotIndex(Idx) == AttributeSet::FunctionIndex)
1820 for (AttributeSet::iterator I = AS.begin(Idx), E = AS.end(Idx);
1822 Attribute Attr = *I;
1823 if (!Attr.isStringAttribute()) {
1824 if (!AttrStr.empty()) AttrStr += ' ';
1825 AttrStr += Attr.getAsString();
1829 if (!AttrStr.empty())
1830 Out << "; Function Attrs: " << AttrStr << '\n';
1833 if (F->isDeclaration())
1838 PrintLinkage(F->getLinkage(), Out);
1839 PrintVisibility(F->getVisibility(), Out);
1840 PrintDLLStorageClass(F->getDLLStorageClass(), Out);
1842 // Print the calling convention.
1843 if (F->getCallingConv() != CallingConv::C) {
1844 PrintCallingConv(F->getCallingConv(), Out);
1848 FunctionType *FT = F->getFunctionType();
1849 if (Attrs.hasAttributes(AttributeSet::ReturnIndex))
1850 Out << Attrs.getAsString(AttributeSet::ReturnIndex) << ' ';
1851 TypePrinter.print(F->getReturnType(), Out);
1853 WriteAsOperandInternal(Out, F, &TypePrinter, &Machine, F->getParent());
1855 Machine.incorporateFunction(F);
1857 // Loop over the arguments, printing them...
1860 if (!F->isDeclaration()) {
1861 // If this isn't a declaration, print the argument names as well.
1862 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
1864 // Insert commas as we go... the first arg doesn't get a comma
1865 if (I != F->arg_begin()) Out << ", ";
1866 printArgument(I, Attrs, Idx);
1870 // Otherwise, print the types from the function type.
1871 for (unsigned i = 0, e = FT->getNumParams(); i != e; ++i) {
1872 // Insert commas as we go... the first arg doesn't get a comma
1876 TypePrinter.print(FT->getParamType(i), Out);
1878 if (Attrs.hasAttributes(i+1))
1879 Out << ' ' << Attrs.getAsString(i+1);
1883 // Finish printing arguments...
1884 if (FT->isVarArg()) {
1885 if (FT->getNumParams()) Out << ", ";
1886 Out << "..."; // Output varargs portion of signature!
1889 if (F->hasUnnamedAddr())
1890 Out << " unnamed_addr";
1891 if (Attrs.hasAttributes(AttributeSet::FunctionIndex))
1892 Out << " #" << Machine.getAttributeGroupSlot(Attrs.getFnAttributes());
1893 if (F->hasSection()) {
1894 Out << " section \"";
1895 PrintEscapedString(F->getSection(), Out);
1898 if (F->hasComdat()) {
1900 PrintLLVMName(Out, F->getComdat()->getName(), ComdatPrefix);
1902 if (F->getAlignment())
1903 Out << " align " << F->getAlignment();
1905 Out << " gc \"" << F->getGC() << '"';
1906 if (F->hasPrefixData()) {
1908 writeOperand(F->getPrefixData(), true);
1910 if (F->hasPrologueData()) {
1911 Out << " prologue ";
1912 writeOperand(F->getPrologueData(), true);
1915 if (F->isDeclaration()) {
1919 // Output all of the function's basic blocks.
1920 for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
1923 // Output the function's use-lists.
1929 Machine.purgeFunction();
1932 /// printArgument - This member is called for every argument that is passed into
1933 /// the function. Simply print it out
1935 void AssemblyWriter::printArgument(const Argument *Arg,
1936 AttributeSet Attrs, unsigned Idx) {
1938 TypePrinter.print(Arg->getType(), Out);
1940 // Output parameter attributes list
1941 if (Attrs.hasAttributes(Idx))
1942 Out << ' ' << Attrs.getAsString(Idx);
1944 // Output name, if available...
1945 if (Arg->hasName()) {
1947 PrintLLVMName(Out, Arg);
1951 /// printBasicBlock - This member is called for each basic block in a method.
1953 void AssemblyWriter::printBasicBlock(const BasicBlock *BB) {
1954 if (BB->hasName()) { // Print out the label if it exists...
1956 PrintLLVMName(Out, BB->getName(), LabelPrefix);
1958 } else if (!BB->use_empty()) { // Don't print block # of no uses...
1959 Out << "\n; <label>:";
1960 int Slot = Machine.getLocalSlot(BB);
1967 if (!BB->getParent()) {
1968 Out.PadToColumn(50);
1969 Out << "; Error: Block without parent!";
1970 } else if (BB != &BB->getParent()->getEntryBlock()) { // Not the entry block?
1971 // Output predecessors for the block.
1972 Out.PadToColumn(50);
1974 const_pred_iterator PI = pred_begin(BB), PE = pred_end(BB);
1977 Out << " No predecessors!";
1980 writeOperand(*PI, false);
1981 for (++PI; PI != PE; ++PI) {
1983 writeOperand(*PI, false);
1990 if (AnnotationWriter) AnnotationWriter->emitBasicBlockStartAnnot(BB, Out);
1992 // Output all of the instructions in the basic block...
1993 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
1994 printInstructionLine(*I);
1997 if (AnnotationWriter) AnnotationWriter->emitBasicBlockEndAnnot(BB, Out);
2000 /// printInstructionLine - Print an instruction and a newline character.
2001 void AssemblyWriter::printInstructionLine(const Instruction &I) {
2002 printInstruction(I);
2006 /// printInfoComment - Print a little comment after the instruction indicating
2007 /// which slot it occupies.
2009 void AssemblyWriter::printInfoComment(const Value &V) {
2010 if (AnnotationWriter)
2011 AnnotationWriter->printInfoComment(V, Out);
2014 // This member is called for each Instruction in a function..
2015 void AssemblyWriter::printInstruction(const Instruction &I) {
2016 if (AnnotationWriter) AnnotationWriter->emitInstructionAnnot(&I, Out);
2018 // Print out indentation for an instruction.
2021 // Print out name if it exists...
2023 PrintLLVMName(Out, &I);
2025 } else if (!I.getType()->isVoidTy()) {
2026 // Print out the def slot taken.
2027 int SlotNum = Machine.getLocalSlot(&I);
2029 Out << "<badref> = ";
2031 Out << '%' << SlotNum << " = ";
2034 if (const CallInst *CI = dyn_cast<CallInst>(&I)) {
2035 if (CI->isMustTailCall())
2037 else if (CI->isTailCall())
2041 // Print out the opcode...
2042 Out << I.getOpcodeName();
2044 // If this is an atomic load or store, print out the atomic marker.
2045 if ((isa<LoadInst>(I) && cast<LoadInst>(I).isAtomic()) ||
2046 (isa<StoreInst>(I) && cast<StoreInst>(I).isAtomic()))
2049 if (isa<AtomicCmpXchgInst>(I) && cast<AtomicCmpXchgInst>(I).isWeak())
2052 // If this is a volatile operation, print out the volatile marker.
2053 if ((isa<LoadInst>(I) && cast<LoadInst>(I).isVolatile()) ||
2054 (isa<StoreInst>(I) && cast<StoreInst>(I).isVolatile()) ||
2055 (isa<AtomicCmpXchgInst>(I) && cast<AtomicCmpXchgInst>(I).isVolatile()) ||
2056 (isa<AtomicRMWInst>(I) && cast<AtomicRMWInst>(I).isVolatile()))
2059 // Print out optimization information.
2060 WriteOptimizationInfo(Out, &I);
2062 // Print out the compare instruction predicates
2063 if (const CmpInst *CI = dyn_cast<CmpInst>(&I))
2064 Out << ' ' << getPredicateText(CI->getPredicate());
2066 // Print out the atomicrmw operation
2067 if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(&I))
2068 writeAtomicRMWOperation(Out, RMWI->getOperation());
2070 // Print out the type of the operands...
2071 const Value *Operand = I.getNumOperands() ? I.getOperand(0) : nullptr;
2073 // Special case conditional branches to swizzle the condition out to the front
2074 if (isa<BranchInst>(I) && cast<BranchInst>(I).isConditional()) {
2075 const BranchInst &BI(cast<BranchInst>(I));
2077 writeOperand(BI.getCondition(), true);
2079 writeOperand(BI.getSuccessor(0), true);
2081 writeOperand(BI.getSuccessor(1), true);
2083 } else if (isa<SwitchInst>(I)) {
2084 const SwitchInst& SI(cast<SwitchInst>(I));
2085 // Special case switch instruction to get formatting nice and correct.
2087 writeOperand(SI.getCondition(), true);
2089 writeOperand(SI.getDefaultDest(), true);
2091 for (SwitchInst::ConstCaseIt i = SI.case_begin(), e = SI.case_end();
2094 writeOperand(i.getCaseValue(), true);
2096 writeOperand(i.getCaseSuccessor(), true);
2099 } else if (isa<IndirectBrInst>(I)) {
2100 // Special case indirectbr instruction to get formatting nice and correct.
2102 writeOperand(Operand, true);
2105 for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) {
2108 writeOperand(I.getOperand(i), true);
2111 } else if (const PHINode *PN = dyn_cast<PHINode>(&I)) {
2113 TypePrinter.print(I.getType(), Out);
2116 for (unsigned op = 0, Eop = PN->getNumIncomingValues(); op < Eop; ++op) {
2117 if (op) Out << ", ";
2119 writeOperand(PN->getIncomingValue(op), false); Out << ", ";
2120 writeOperand(PN->getIncomingBlock(op), false); Out << " ]";
2122 } else if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(&I)) {
2124 writeOperand(I.getOperand(0), true);
2125 for (const unsigned *i = EVI->idx_begin(), *e = EVI->idx_end(); i != e; ++i)
2127 } else if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(&I)) {
2129 writeOperand(I.getOperand(0), true); Out << ", ";
2130 writeOperand(I.getOperand(1), true);
2131 for (const unsigned *i = IVI->idx_begin(), *e = IVI->idx_end(); i != e; ++i)
2133 } else if (const LandingPadInst *LPI = dyn_cast<LandingPadInst>(&I)) {
2135 TypePrinter.print(I.getType(), Out);
2136 Out << " personality ";
2137 writeOperand(I.getOperand(0), true); Out << '\n';
2139 if (LPI->isCleanup())
2142 for (unsigned i = 0, e = LPI->getNumClauses(); i != e; ++i) {
2143 if (i != 0 || LPI->isCleanup()) Out << "\n";
2144 if (LPI->isCatch(i))
2149 writeOperand(LPI->getClause(i), true);
2151 } else if (isa<ReturnInst>(I) && !Operand) {
2153 } else if (const CallInst *CI = dyn_cast<CallInst>(&I)) {
2154 // Print the calling convention being used.
2155 if (CI->getCallingConv() != CallingConv::C) {
2157 PrintCallingConv(CI->getCallingConv(), Out);
2160 Operand = CI->getCalledValue();
2161 PointerType *PTy = cast<PointerType>(Operand->getType());
2162 FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2163 Type *RetTy = FTy->getReturnType();
2164 const AttributeSet &PAL = CI->getAttributes();
2166 if (PAL.hasAttributes(AttributeSet::ReturnIndex))
2167 Out << ' ' << PAL.getAsString(AttributeSet::ReturnIndex);
2169 // If possible, print out the short form of the call instruction. We can
2170 // only do this if the first argument is a pointer to a nonvararg function,
2171 // and if the return type is not a pointer to a function.
2174 if (!FTy->isVarArg() &&
2175 (!RetTy->isPointerTy() ||
2176 !cast<PointerType>(RetTy)->getElementType()->isFunctionTy())) {
2177 TypePrinter.print(RetTy, Out);
2179 writeOperand(Operand, false);
2181 writeOperand(Operand, true);
2184 for (unsigned op = 0, Eop = CI->getNumArgOperands(); op < Eop; ++op) {
2187 writeParamOperand(CI->getArgOperand(op), PAL, op + 1);
2190 // Emit an ellipsis if this is a musttail call in a vararg function. This
2191 // is only to aid readability, musttail calls forward varargs by default.
2192 if (CI->isMustTailCall() && CI->getParent() &&
2193 CI->getParent()->getParent() &&
2194 CI->getParent()->getParent()->isVarArg())
2198 if (PAL.hasAttributes(AttributeSet::FunctionIndex))
2199 Out << " #" << Machine.getAttributeGroupSlot(PAL.getFnAttributes());
2200 } else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
2201 Operand = II->getCalledValue();
2202 PointerType *PTy = cast<PointerType>(Operand->getType());
2203 FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2204 Type *RetTy = FTy->getReturnType();
2205 const AttributeSet &PAL = II->getAttributes();
2207 // Print the calling convention being used.
2208 if (II->getCallingConv() != CallingConv::C) {
2210 PrintCallingConv(II->getCallingConv(), Out);
2213 if (PAL.hasAttributes(AttributeSet::ReturnIndex))
2214 Out << ' ' << PAL.getAsString(AttributeSet::ReturnIndex);
2216 // If possible, print out the short form of the invoke instruction. We can
2217 // only do this if the first argument is a pointer to a nonvararg function,
2218 // and if the return type is not a pointer to a function.
2221 if (!FTy->isVarArg() &&
2222 (!RetTy->isPointerTy() ||
2223 !cast<PointerType>(RetTy)->getElementType()->isFunctionTy())) {
2224 TypePrinter.print(RetTy, Out);
2226 writeOperand(Operand, false);
2228 writeOperand(Operand, true);
2231 for (unsigned op = 0, Eop = II->getNumArgOperands(); op < Eop; ++op) {
2234 writeParamOperand(II->getArgOperand(op), PAL, op + 1);
2238 if (PAL.hasAttributes(AttributeSet::FunctionIndex))
2239 Out << " #" << Machine.getAttributeGroupSlot(PAL.getFnAttributes());
2242 writeOperand(II->getNormalDest(), true);
2244 writeOperand(II->getUnwindDest(), true);
2246 } else if (const AllocaInst *AI = dyn_cast<AllocaInst>(&I)) {
2248 if (AI->isUsedWithInAlloca())
2250 TypePrinter.print(AI->getAllocatedType(), Out);
2251 if (!AI->getArraySize() || AI->isArrayAllocation()) {
2253 writeOperand(AI->getArraySize(), true);
2255 if (AI->getAlignment()) {
2256 Out << ", align " << AI->getAlignment();
2258 } else if (isa<CastInst>(I)) {
2261 writeOperand(Operand, true); // Work with broken code
2264 TypePrinter.print(I.getType(), Out);
2265 } else if (isa<VAArgInst>(I)) {
2268 writeOperand(Operand, true); // Work with broken code
2271 TypePrinter.print(I.getType(), Out);
2272 } else if (Operand) { // Print the normal way.
2274 // PrintAllTypes - Instructions who have operands of all the same type
2275 // omit the type from all but the first operand. If the instruction has
2276 // different type operands (for example br), then they are all printed.
2277 bool PrintAllTypes = false;
2278 Type *TheType = Operand->getType();
2280 // Select, Store and ShuffleVector always print all types.
2281 if (isa<SelectInst>(I) || isa<StoreInst>(I) || isa<ShuffleVectorInst>(I)
2282 || isa<ReturnInst>(I)) {
2283 PrintAllTypes = true;
2285 for (unsigned i = 1, E = I.getNumOperands(); i != E; ++i) {
2286 Operand = I.getOperand(i);
2287 // note that Operand shouldn't be null, but the test helps make dump()
2288 // more tolerant of malformed IR
2289 if (Operand && Operand->getType() != TheType) {
2290 PrintAllTypes = true; // We have differing types! Print them all!
2296 if (!PrintAllTypes) {
2298 TypePrinter.print(TheType, Out);
2302 for (unsigned i = 0, E = I.getNumOperands(); i != E; ++i) {
2304 writeOperand(I.getOperand(i), PrintAllTypes);
2308 // Print atomic ordering/alignment for memory operations
2309 if (const LoadInst *LI = dyn_cast<LoadInst>(&I)) {
2311 writeAtomic(LI->getOrdering(), LI->getSynchScope());
2312 if (LI->getAlignment())
2313 Out << ", align " << LI->getAlignment();
2314 } else if (const StoreInst *SI = dyn_cast<StoreInst>(&I)) {
2316 writeAtomic(SI->getOrdering(), SI->getSynchScope());
2317 if (SI->getAlignment())
2318 Out << ", align " << SI->getAlignment();
2319 } else if (const AtomicCmpXchgInst *CXI = dyn_cast<AtomicCmpXchgInst>(&I)) {
2320 writeAtomicCmpXchg(CXI->getSuccessOrdering(), CXI->getFailureOrdering(),
2321 CXI->getSynchScope());
2322 } else if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(&I)) {
2323 writeAtomic(RMWI->getOrdering(), RMWI->getSynchScope());
2324 } else if (const FenceInst *FI = dyn_cast<FenceInst>(&I)) {
2325 writeAtomic(FI->getOrdering(), FI->getSynchScope());
2328 // Print Metadata info.
2329 SmallVector<std::pair<unsigned, MDNode *>, 4> InstMD;
2330 I.getAllMetadata(InstMD);
2331 if (!InstMD.empty()) {
2332 SmallVector<StringRef, 8> MDNames;
2333 I.getType()->getContext().getMDKindNames(MDNames);
2334 for (unsigned i = 0, e = InstMD.size(); i != e; ++i) {
2335 unsigned Kind = InstMD[i].first;
2336 if (Kind < MDNames.size()) {
2337 Out << ", !" << MDNames[Kind];
2339 Out << ", !<unknown kind #" << Kind << ">";
2342 WriteAsOperandInternal(Out, InstMD[i].second, &TypePrinter, &Machine,
2346 printInfoComment(I);
2349 static void WriteMDNodeComment(const MDNode *Node,
2350 formatted_raw_ostream &Out) {
2351 if (Node->getNumOperands() < 1)
2354 Value *Op = Node->getOperand(0);
2355 if (!Op || !isa<MDString>(Op))
2358 DIDescriptor Desc(Node);
2362 unsigned Tag = Desc.getTag();
2363 Out.PadToColumn(50);
2364 if (dwarf::TagString(Tag)) {
2367 } else if (Tag == dwarf::DW_TAG_user_base) {
2368 Out << "; [ DW_TAG_user_base ]";
2372 void AssemblyWriter::writeMDNode(unsigned Slot, const MDNode *Node) {
2373 Out << '!' << Slot << " = metadata ";
2374 printMDNodeBody(Node);
2377 void AssemblyWriter::writeAllMDNodes() {
2378 SmallVector<const MDNode *, 16> Nodes;
2379 Nodes.resize(Machine.mdn_size());
2380 for (SlotTracker::mdn_iterator I = Machine.mdn_begin(), E = Machine.mdn_end();
2382 Nodes[I->second] = cast<MDNode>(I->first);
2384 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2385 writeMDNode(i, Nodes[i]);
2389 void AssemblyWriter::printMDNodeBody(const MDNode *Node) {
2390 WriteMDNodeBodyInternal(Out, Node, &TypePrinter, &Machine, TheModule);
2391 WriteMDNodeComment(Node, Out);
2395 void AssemblyWriter::writeAllAttributeGroups() {
2396 std::vector<std::pair<AttributeSet, unsigned> > asVec;
2397 asVec.resize(Machine.as_size());
2399 for (SlotTracker::as_iterator I = Machine.as_begin(), E = Machine.as_end();
2401 asVec[I->second] = *I;
2403 for (std::vector<std::pair<AttributeSet, unsigned> >::iterator
2404 I = asVec.begin(), E = asVec.end(); I != E; ++I)
2405 Out << "attributes #" << I->second << " = { "
2406 << I->first.getAsString(AttributeSet::FunctionIndex, true) << " }\n";
2411 void AssemblyWriter::printUseListOrder(const UseListOrder &Order) {
2412 bool IsInFunction = Machine.getFunction();
2416 Out << "uselistorder";
2417 if (const BasicBlock *BB =
2418 IsInFunction ? nullptr : dyn_cast<BasicBlock>(Order.V)) {
2420 writeOperand(BB->getParent(), false);
2422 writeOperand(BB, false);
2425 writeOperand(Order.V, true);
2429 assert(Order.Shuffle.size() >= 2 && "Shuffle too small");
2430 Out << Order.Shuffle[0];
2431 for (unsigned I = 1, E = Order.Shuffle.size(); I != E; ++I)
2432 Out << ", " << Order.Shuffle[I];
2436 void AssemblyWriter::printUseLists(const Function *F) {
2438 [&]() { return !UseListOrders.empty() && UseListOrders.back().F == F; };
2443 Out << "\n; uselistorder directives\n";
2445 printUseListOrder(UseListOrders.back());
2446 UseListOrders.pop_back();
2450 //===----------------------------------------------------------------------===//
2451 // External Interface declarations
2452 //===----------------------------------------------------------------------===//
2454 void Module::print(raw_ostream &ROS, AssemblyAnnotationWriter *AAW) const {
2455 SlotTracker SlotTable(this);
2456 formatted_raw_ostream OS(ROS);
2457 AssemblyWriter W(OS, SlotTable, this, AAW);
2458 W.printModule(this);
2461 void NamedMDNode::print(raw_ostream &ROS) const {
2462 SlotTracker SlotTable(getParent());
2463 formatted_raw_ostream OS(ROS);
2464 AssemblyWriter W(OS, SlotTable, getParent(), nullptr);
2465 W.printNamedMDNode(this);
2468 void Comdat::print(raw_ostream &ROS) const {
2469 PrintLLVMName(ROS, getName(), ComdatPrefix);
2470 ROS << " = comdat ";
2472 switch (getSelectionKind()) {
2476 case Comdat::ExactMatch:
2477 ROS << "exactmatch";
2479 case Comdat::Largest:
2482 case Comdat::NoDuplicates:
2483 ROS << "noduplicates";
2485 case Comdat::SameSize:
2493 void Type::print(raw_ostream &OS) const {
2495 TP.print(const_cast<Type*>(this), OS);
2497 // If the type is a named struct type, print the body as well.
2498 if (StructType *STy = dyn_cast<StructType>(const_cast<Type*>(this)))
2499 if (!STy->isLiteral()) {
2501 TP.printStructBody(STy, OS);
2505 void Value::print(raw_ostream &ROS) const {
2506 formatted_raw_ostream OS(ROS);
2507 if (const Instruction *I = dyn_cast<Instruction>(this)) {
2508 const Function *F = I->getParent() ? I->getParent()->getParent() : nullptr;
2509 SlotTracker SlotTable(F);
2510 AssemblyWriter W(OS, SlotTable, getModuleFromVal(I), nullptr);
2511 W.printInstruction(*I);
2512 } else if (const BasicBlock *BB = dyn_cast<BasicBlock>(this)) {
2513 SlotTracker SlotTable(BB->getParent());
2514 AssemblyWriter W(OS, SlotTable, getModuleFromVal(BB), nullptr);
2515 W.printBasicBlock(BB);
2516 } else if (const GlobalValue *GV = dyn_cast<GlobalValue>(this)) {
2517 SlotTracker SlotTable(GV->getParent());
2518 AssemblyWriter W(OS, SlotTable, GV->getParent(), nullptr);
2519 if (const GlobalVariable *V = dyn_cast<GlobalVariable>(GV))
2521 else if (const Function *F = dyn_cast<Function>(GV))
2524 W.printAlias(cast<GlobalAlias>(GV));
2525 } else if (const MDNode *N = dyn_cast<MDNode>(this)) {
2526 const Function *F = N->getFunction();
2527 SlotTracker SlotTable(F);
2528 AssemblyWriter W(OS, SlotTable, F ? F->getParent() : nullptr, nullptr);
2529 W.printMDNodeBody(N);
2530 } else if (const Constant *C = dyn_cast<Constant>(this)) {
2531 TypePrinting TypePrinter;
2532 TypePrinter.print(C->getType(), OS);
2534 WriteConstantInternal(OS, C, TypePrinter, nullptr, nullptr);
2535 } else if (isa<InlineAsm>(this) || isa<MDString>(this) ||
2536 isa<Argument>(this)) {
2537 this->printAsOperand(OS);
2539 llvm_unreachable("Unknown value to print out!");
2543 void Value::printAsOperand(raw_ostream &O, bool PrintType, const Module *M) const {
2544 // Fast path: Don't construct and populate a TypePrinting object if we
2545 // won't be needing any types printed.
2547 ((!isa<Constant>(this) && !isa<MDNode>(this)) ||
2548 hasName() || isa<GlobalValue>(this))) {
2549 WriteAsOperandInternal(O, this, nullptr, nullptr, M);
2554 M = getModuleFromVal(this);
2556 TypePrinting TypePrinter;
2558 TypePrinter.incorporateTypes(*M);
2560 TypePrinter.print(getType(), O);
2564 WriteAsOperandInternal(O, this, &TypePrinter, nullptr, M);
2567 // Value::dump - allow easy printing of Values from the debugger.
2568 void Value::dump() const { print(dbgs()); dbgs() << '\n'; }
2570 // Type::dump - allow easy printing of Types from the debugger.
2571 void Type::dump() const { print(dbgs()); dbgs() << '\n'; }
2573 // Module::dump() - Allow printing of Modules from the debugger.
2574 void Module::dump() const { print(dbgs(), nullptr); }
2576 // \brief Allow printing of Comdats from the debugger.
2577 void Comdat::dump() const { print(dbgs()); }
2579 // NamedMDNode::dump() - Allow printing of NamedMDNodes from the debugger.
2580 void NamedMDNode::dump() const { print(dbgs()); }