1 //===-- AsmWriter.cpp - Printing LLVM as an assembly file -----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This library implements the functionality defined in llvm/Assembly/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 "llvm/Assembly/CachedWriter.h"
18 #include "llvm/Assembly/Writer.h"
19 #include "llvm/Assembly/PrintModulePass.h"
20 #include "llvm/Assembly/AsmAnnotationWriter.h"
21 #include "llvm/CallingConv.h"
22 #include "llvm/Constants.h"
23 #include "llvm/DerivedTypes.h"
24 #include "llvm/Instruction.h"
25 #include "llvm/Instructions.h"
26 #include "llvm/Module.h"
27 #include "llvm/SymbolTable.h"
28 #include "llvm/Assembly/Writer.h"
29 #include "llvm/Support/CFG.h"
30 #include "llvm/ADT/StringExtras.h"
31 #include "llvm/ADT/STLExtras.h"
32 #include "llvm/Support/MathExtras.h"
38 // Make virtual table appear in this compilation unit.
39 AssemblyAnnotationWriter::~AssemblyAnnotationWriter() {}
41 /// This class provides computation of slot numbers for LLVM Assembly writing.
42 /// @brief LLVM Assembly Writing Slot Computation.
49 /// @brief A mapping of Values to slot numbers
50 typedef std::map<const Value*, unsigned> ValueMap;
51 typedef std::map<const Type*, unsigned> TypeMap;
53 /// @brief A plane with next slot number and ValueMap
55 unsigned next_slot; ///< The next slot number to use
56 ValueMap map; ///< The map of Value* -> unsigned
57 ValuePlane() { next_slot = 0; } ///< Make sure we start at 0
63 TypePlane() { next_slot = 0; }
64 void clear() { map.clear(); next_slot = 0; }
67 /// @brief The map of planes by Type
68 typedef std::map<const Type*, ValuePlane> TypedPlanes;
71 /// @name Constructors
74 /// @brief Construct from a module
75 SlotMachine(const Module *M );
77 /// @brief Construct from a function, starting out in incorp state.
78 SlotMachine(const Function *F );
84 /// Return the slot number of the specified value in it's type
85 /// plane. Its an error to ask for something not in the SlotMachine.
86 /// Its an error to ask for a Type*
87 int getSlot(const Value *V);
88 int getSlot(const Type*Ty);
90 /// Determine if a Value has a slot or not
91 bool hasSlot(const Value* V);
92 bool hasSlot(const Type* Ty);
98 /// If you'd like to deal with a function instead of just a module, use
99 /// this method to get its data into the SlotMachine.
100 void incorporateFunction(const Function *F) {
102 FunctionProcessed = false;
105 /// After calling incorporateFunction, use this method to remove the
106 /// most recently incorporated function from the SlotMachine. This
107 /// will reset the state of the machine back to just the module contents.
108 void purgeFunction();
111 /// @name Implementation Details
114 /// This function does the actual initialization.
115 inline void initialize();
117 /// Values can be crammed into here at will. If they haven't
118 /// been inserted already, they get inserted, otherwise they are ignored.
119 /// Either way, the slot number for the Value* is returned.
120 unsigned createSlot(const Value *V);
121 unsigned createSlot(const Type* Ty);
123 /// Insert a value into the value table. Return the slot number
124 /// that it now occupies. BadThings(TM) will happen if you insert a
125 /// Value that's already been inserted.
126 unsigned insertValue( const Value *V );
127 unsigned insertValue( const Type* Ty);
129 /// Add all of the module level global variables (and their initializers)
130 /// and function declarations, but not the contents of those functions.
131 void processModule();
133 /// Add all of the functions arguments, basic blocks, and instructions
134 void processFunction();
136 SlotMachine(const SlotMachine &); // DO NOT IMPLEMENT
137 void operator=(const SlotMachine &); // DO NOT IMPLEMENT
144 /// @brief The module for which we are holding slot numbers
145 const Module* TheModule;
147 /// @brief The function for which we are holding slot numbers
148 const Function* TheFunction;
149 bool FunctionProcessed;
151 /// @brief The TypePlanes map for the module level data
155 /// @brief The TypePlanes map for the function level data
163 } // end namespace llvm
165 static RegisterPass<PrintModulePass>
166 X("printm", "Print module to stderr",PassInfo::Analysis|PassInfo::Optimization);
167 static RegisterPass<PrintFunctionPass>
168 Y("print","Print function to stderr",PassInfo::Analysis|PassInfo::Optimization);
170 static void WriteAsOperandInternal(std::ostream &Out, const Value *V,
172 std::map<const Type *, std::string> &TypeTable,
173 SlotMachine *Machine);
175 static void WriteAsOperandInternal(std::ostream &Out, const Type *T,
177 std::map<const Type *, std::string> &TypeTable,
178 SlotMachine *Machine);
180 static const Module *getModuleFromVal(const Value *V) {
181 if (const Argument *MA = dyn_cast<Argument>(V))
182 return MA->getParent() ? MA->getParent()->getParent() : 0;
183 else if (const BasicBlock *BB = dyn_cast<BasicBlock>(V))
184 return BB->getParent() ? BB->getParent()->getParent() : 0;
185 else if (const Instruction *I = dyn_cast<Instruction>(V)) {
186 const Function *M = I->getParent() ? I->getParent()->getParent() : 0;
187 return M ? M->getParent() : 0;
188 } else if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))
189 return GV->getParent();
193 static SlotMachine *createSlotMachine(const Value *V) {
194 if (const Argument *FA = dyn_cast<Argument>(V)) {
195 return new SlotMachine(FA->getParent());
196 } else if (const Instruction *I = dyn_cast<Instruction>(V)) {
197 return new SlotMachine(I->getParent()->getParent());
198 } else if (const BasicBlock *BB = dyn_cast<BasicBlock>(V)) {
199 return new SlotMachine(BB->getParent());
200 } else if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V)){
201 return new SlotMachine(GV->getParent());
202 } else if (const Function *Func = dyn_cast<Function>(V)) {
203 return new SlotMachine(Func);
208 // getLLVMName - Turn the specified string into an 'LLVM name', which is either
209 // prefixed with % (if the string only contains simple characters) or is
210 // surrounded with ""'s (if it has special chars in it).
211 static std::string getLLVMName(const std::string &Name,
212 bool prefixName = true) {
213 assert(!Name.empty() && "Cannot get empty name!");
215 // First character cannot start with a number...
216 if (Name[0] >= '0' && Name[0] <= '9')
217 return "\"" + Name + "\"";
219 // Scan to see if we have any characters that are not on the "white list"
220 for (unsigned i = 0, e = Name.size(); i != e; ++i) {
222 assert(C != '"' && "Illegal character in LLVM value name!");
223 if ((C < 'a' || C > 'z') && (C < 'A' || C > 'Z') && (C < '0' || C > '9') &&
224 C != '-' && C != '.' && C != '_')
225 return "\"" + Name + "\"";
228 // If we get here, then the identifier is legal to use as a "VarID".
236 /// fillTypeNameTable - If the module has a symbol table, take all global types
237 /// and stuff their names into the TypeNames map.
239 static void fillTypeNameTable(const Module *M,
240 std::map<const Type *, std::string> &TypeNames) {
242 const SymbolTable &ST = M->getSymbolTable();
243 SymbolTable::type_const_iterator TI = ST.type_begin();
244 for (; TI != ST.type_end(); ++TI ) {
245 // As a heuristic, don't insert pointer to primitive types, because
246 // they are used too often to have a single useful name.
248 const Type *Ty = cast<Type>(TI->second);
249 if (!isa<PointerType>(Ty) ||
250 !cast<PointerType>(Ty)->getElementType()->isPrimitiveType() ||
251 isa<OpaqueType>(cast<PointerType>(Ty)->getElementType()))
252 TypeNames.insert(std::make_pair(Ty, getLLVMName(TI->first)));
258 static void calcTypeName(const Type *Ty,
259 std::vector<const Type *> &TypeStack,
260 std::map<const Type *, std::string> &TypeNames,
261 std::string & Result){
262 if (Ty->isPrimitiveType() && !isa<OpaqueType>(Ty)) {
263 Result += Ty->getDescription(); // Base case
267 // Check to see if the type is named.
268 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
269 if (I != TypeNames.end()) {
274 if (isa<OpaqueType>(Ty)) {
279 // Check to see if the Type is already on the stack...
280 unsigned Slot = 0, CurSize = TypeStack.size();
281 while (Slot < CurSize && TypeStack[Slot] != Ty) ++Slot; // Scan for type
283 // This is another base case for the recursion. In this case, we know
284 // that we have looped back to a type that we have previously visited.
285 // Generate the appropriate upreference to handle this.
286 if (Slot < CurSize) {
287 Result += "\\" + utostr(CurSize-Slot); // Here's the upreference
291 TypeStack.push_back(Ty); // Recursive case: Add us to the stack..
293 switch (Ty->getTypeID()) {
294 case Type::FunctionTyID: {
295 const FunctionType *FTy = cast<FunctionType>(Ty);
296 calcTypeName(FTy->getReturnType(), TypeStack, TypeNames, Result);
298 for (FunctionType::param_iterator I = FTy->param_begin(),
299 E = FTy->param_end(); I != E; ++I) {
300 if (I != FTy->param_begin())
302 calcTypeName(*I, TypeStack, TypeNames, Result);
304 if (FTy->isVarArg()) {
305 if (FTy->getNumParams()) Result += ", ";
311 case Type::StructTyID: {
312 const StructType *STy = cast<StructType>(Ty);
314 for (StructType::element_iterator I = STy->element_begin(),
315 E = STy->element_end(); I != E; ++I) {
316 if (I != STy->element_begin())
318 calcTypeName(*I, TypeStack, TypeNames, Result);
323 case Type::PointerTyID:
324 calcTypeName(cast<PointerType>(Ty)->getElementType(),
325 TypeStack, TypeNames, Result);
328 case Type::ArrayTyID: {
329 const ArrayType *ATy = cast<ArrayType>(Ty);
330 Result += "[" + utostr(ATy->getNumElements()) + " x ";
331 calcTypeName(ATy->getElementType(), TypeStack, TypeNames, Result);
335 case Type::PackedTyID: {
336 const PackedType *PTy = cast<PackedType>(Ty);
337 Result += "<" + utostr(PTy->getNumElements()) + " x ";
338 calcTypeName(PTy->getElementType(), TypeStack, TypeNames, Result);
342 case Type::OpaqueTyID:
346 Result += "<unrecognized-type>";
349 TypeStack.pop_back(); // Remove self from stack...
354 /// printTypeInt - The internal guts of printing out a type that has a
355 /// potentially named portion.
357 static std::ostream &printTypeInt(std::ostream &Out, const Type *Ty,
358 std::map<const Type *, std::string> &TypeNames) {
359 // Primitive types always print out their description, regardless of whether
360 // they have been named or not.
362 if (Ty->isPrimitiveType() && !isa<OpaqueType>(Ty))
363 return Out << Ty->getDescription();
365 // Check to see if the type is named.
366 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
367 if (I != TypeNames.end()) return Out << I->second;
369 // Otherwise we have a type that has not been named but is a derived type.
370 // Carefully recurse the type hierarchy to print out any contained symbolic
373 std::vector<const Type *> TypeStack;
374 std::string TypeName;
375 calcTypeName(Ty, TypeStack, TypeNames, TypeName);
376 TypeNames.insert(std::make_pair(Ty, TypeName));//Cache type name for later use
377 return (Out << TypeName);
381 /// WriteTypeSymbolic - This attempts to write the specified type as a symbolic
382 /// type, iff there is an entry in the modules symbol table for the specified
383 /// type or one of it's component types. This is slower than a simple x << Type
385 std::ostream &llvm::WriteTypeSymbolic(std::ostream &Out, const Type *Ty,
389 // If they want us to print out a type, attempt to make it symbolic if there
390 // is a symbol table in the module...
392 std::map<const Type *, std::string> TypeNames;
393 fillTypeNameTable(M, TypeNames);
395 return printTypeInt(Out, Ty, TypeNames);
397 return Out << Ty->getDescription();
401 // PrintEscapedString - Print each character of the specified string, escaping
402 // it if it is not printable or if it is an escape char.
403 static void PrintEscapedString(const std::string &Str, std::ostream &Out) {
404 for (unsigned i = 0, e = Str.size(); i != e; ++i) {
405 unsigned char C = Str[i];
406 if (isprint(C) && C != '"' && C != '\\') {
410 << (char) ((C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'))
411 << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
416 /// @brief Internal constant writer.
417 static void WriteConstantInt(std::ostream &Out, const Constant *CV,
419 std::map<const Type *, std::string> &TypeTable,
420 SlotMachine *Machine) {
421 if (const ConstantBool *CB = dyn_cast<ConstantBool>(CV)) {
422 Out << (CB == ConstantBool::True ? "true" : "false");
423 } else if (const ConstantSInt *CI = dyn_cast<ConstantSInt>(CV)) {
424 Out << CI->getValue();
425 } else if (const ConstantUInt *CI = dyn_cast<ConstantUInt>(CV)) {
426 Out << CI->getValue();
427 } else if (const ConstantFP *CFP = dyn_cast<ConstantFP>(CV)) {
428 // We would like to output the FP constant value in exponential notation,
429 // but we cannot do this if doing so will lose precision. Check here to
430 // make sure that we only output it in exponential format if we can parse
431 // the value back and get the same value.
433 std::string StrVal = ftostr(CFP->getValue());
435 // Check to make sure that the stringized number is not some string like
436 // "Inf" or NaN, that atof will accept, but the lexer will not. Check that
437 // the string matches the "[-+]?[0-9]" regex.
439 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
440 ((StrVal[0] == '-' || StrVal[0] == '+') &&
441 (StrVal[1] >= '0' && StrVal[1] <= '9')))
442 // Reparse stringized version!
443 if (atof(StrVal.c_str()) == CFP->getValue()) {
448 // Otherwise we could not reparse it to exactly the same value, so we must
449 // output the string in hexadecimal format!
450 assert(sizeof(double) == sizeof(uint64_t) &&
451 "assuming that double is 64 bits!");
452 Out << "0x" << utohexstr(DoubleToBits(CFP->getValue()));
454 } else if (isa<ConstantAggregateZero>(CV)) {
455 Out << "zeroinitializer";
456 } else if (const ConstantArray *CA = dyn_cast<ConstantArray>(CV)) {
457 // As a special case, print the array as a string if it is an array of
458 // ubytes or an array of sbytes with positive values.
460 const Type *ETy = CA->getType()->getElementType();
461 if (CA->isString()) {
463 PrintEscapedString(CA->getAsString(), Out);
466 } else { // Cannot output in string format...
468 if (CA->getNumOperands()) {
470 printTypeInt(Out, ETy, TypeTable);
471 WriteAsOperandInternal(Out, CA->getOperand(0),
472 PrintName, TypeTable, Machine);
473 for (unsigned i = 1, e = CA->getNumOperands(); i != e; ++i) {
475 printTypeInt(Out, ETy, TypeTable);
476 WriteAsOperandInternal(Out, CA->getOperand(i), PrintName,
482 } else if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(CV)) {
484 if (CS->getNumOperands()) {
486 printTypeInt(Out, CS->getOperand(0)->getType(), TypeTable);
488 WriteAsOperandInternal(Out, CS->getOperand(0),
489 PrintName, TypeTable, Machine);
491 for (unsigned i = 1; i < CS->getNumOperands(); i++) {
493 printTypeInt(Out, CS->getOperand(i)->getType(), TypeTable);
495 WriteAsOperandInternal(Out, CS->getOperand(i),
496 PrintName, TypeTable, Machine);
501 } else if (const ConstantPacked *CP = dyn_cast<ConstantPacked>(CV)) {
502 const Type *ETy = CP->getType()->getElementType();
503 assert(CP->getNumOperands() > 0 &&
504 "Number of operands for a PackedConst must be > 0");
507 printTypeInt(Out, ETy, TypeTable);
508 WriteAsOperandInternal(Out, CP->getOperand(0),
509 PrintName, TypeTable, Machine);
510 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
512 printTypeInt(Out, ETy, TypeTable);
513 WriteAsOperandInternal(Out, CP->getOperand(i), PrintName,
517 } else if (isa<ConstantPointerNull>(CV)) {
520 } else if (isa<UndefValue>(CV)) {
523 } else if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CV)) {
524 Out << CE->getOpcodeName() << " (";
526 for (User::const_op_iterator OI=CE->op_begin(); OI != CE->op_end(); ++OI) {
527 printTypeInt(Out, (*OI)->getType(), TypeTable);
528 WriteAsOperandInternal(Out, *OI, PrintName, TypeTable, Machine);
529 if (OI+1 != CE->op_end())
533 if (CE->getOpcode() == Instruction::Cast) {
535 printTypeInt(Out, CE->getType(), TypeTable);
540 Out << "<placeholder or erroneous Constant>";
545 /// WriteAsOperand - Write the name of the specified value out to the specified
546 /// ostream. This can be useful when you just want to print int %reg126, not
547 /// the whole instruction that generated it.
549 static void WriteAsOperandInternal(std::ostream &Out, const Value *V,
551 std::map<const Type*, std::string> &TypeTable,
552 SlotMachine *Machine) {
554 if ((PrintName || isa<GlobalValue>(V)) && V->hasName())
555 Out << getLLVMName(V->getName());
557 const Constant *CV = dyn_cast<Constant>(V);
558 if (CV && !isa<GlobalValue>(CV))
559 WriteConstantInt(Out, CV, PrintName, TypeTable, Machine);
563 Slot = Machine->getSlot(V);
565 Machine = createSlotMachine(V);
567 Slot = Machine->getSlot(V);
580 /// WriteAsOperand - Write the name of the specified value out to the specified
581 /// ostream. This can be useful when you just want to print int %reg126, not
582 /// the whole instruction that generated it.
584 std::ostream &llvm::WriteAsOperand(std::ostream &Out, const Value *V,
585 bool PrintType, bool PrintName,
586 const Module *Context) {
587 std::map<const Type *, std::string> TypeNames;
588 if (Context == 0) Context = getModuleFromVal(V);
591 fillTypeNameTable(Context, TypeNames);
594 printTypeInt(Out, V->getType(), TypeNames);
596 WriteAsOperandInternal(Out, V, PrintName, TypeNames, 0);
600 /// WriteAsOperandInternal - Write the name of the specified value out to
601 /// the specified ostream. This can be useful when you just want to print
602 /// int %reg126, not the whole instruction that generated it.
604 static void WriteAsOperandInternal(std::ostream &Out, const Type *T,
606 std::map<const Type*, std::string> &TypeTable,
607 SlotMachine *Machine) {
611 Slot = Machine->getSlot(T);
617 Out << T->getDescription();
621 /// WriteAsOperand - Write the name of the specified value out to the specified
622 /// ostream. This can be useful when you just want to print int %reg126, not
623 /// the whole instruction that generated it.
625 std::ostream &llvm::WriteAsOperand(std::ostream &Out, const Type *Ty,
626 bool PrintType, bool PrintName,
627 const Module *Context) {
628 std::map<const Type *, std::string> TypeNames;
629 assert(Context != 0 && "Can't write types as operand without module context");
631 fillTypeNameTable(Context, TypeNames);
634 // printTypeInt(Out, V->getType(), TypeNames);
636 printTypeInt(Out, Ty, TypeNames);
638 WriteAsOperandInternal(Out, Ty, PrintName, TypeNames, 0);
644 class AssemblyWriter {
646 SlotMachine &Machine;
647 const Module *TheModule;
648 std::map<const Type *, std::string> TypeNames;
649 AssemblyAnnotationWriter *AnnotationWriter;
651 inline AssemblyWriter(std::ostream &o, SlotMachine &Mac, const Module *M,
652 AssemblyAnnotationWriter *AAW)
653 : Out(o), Machine(Mac), TheModule(M), AnnotationWriter(AAW) {
655 // If the module has a symbol table, take all global types and stuff their
656 // names into the TypeNames map.
658 fillTypeNameTable(M, TypeNames);
661 inline void write(const Module *M) { printModule(M); }
662 inline void write(const GlobalVariable *G) { printGlobal(G); }
663 inline void write(const Function *F) { printFunction(F); }
664 inline void write(const BasicBlock *BB) { printBasicBlock(BB); }
665 inline void write(const Instruction *I) { printInstruction(*I); }
666 inline void write(const Constant *CPV) { printConstant(CPV); }
667 inline void write(const Type *Ty) { printType(Ty); }
669 void writeOperand(const Value *Op, bool PrintType, bool PrintName = true);
671 const Module* getModule() { return TheModule; }
674 void printModule(const Module *M);
675 void printSymbolTable(const SymbolTable &ST);
676 void printConstant(const Constant *CPV);
677 void printGlobal(const GlobalVariable *GV);
678 void printFunction(const Function *F);
679 void printArgument(const Argument *FA);
680 void printBasicBlock(const BasicBlock *BB);
681 void printInstruction(const Instruction &I);
683 // printType - Go to extreme measures to attempt to print out a short,
684 // symbolic version of a type name.
686 std::ostream &printType(const Type *Ty) {
687 return printTypeInt(Out, Ty, TypeNames);
690 // printTypeAtLeastOneLevel - Print out one level of the possibly complex type
691 // without considering any symbolic types that we may have equal to it.
693 std::ostream &printTypeAtLeastOneLevel(const Type *Ty);
695 // printInfoComment - Print a little comment after the instruction indicating
696 // which slot it occupies.
697 void printInfoComment(const Value &V);
699 } // end of llvm namespace
701 /// printTypeAtLeastOneLevel - Print out one level of the possibly complex type
702 /// without considering any symbolic types that we may have equal to it.
704 std::ostream &AssemblyWriter::printTypeAtLeastOneLevel(const Type *Ty) {
705 if (const FunctionType *FTy = dyn_cast<FunctionType>(Ty)) {
706 printType(FTy->getReturnType()) << " (";
707 for (FunctionType::param_iterator I = FTy->param_begin(),
708 E = FTy->param_end(); I != E; ++I) {
709 if (I != FTy->param_begin())
713 if (FTy->isVarArg()) {
714 if (FTy->getNumParams()) Out << ", ";
718 } else if (const StructType *STy = dyn_cast<StructType>(Ty)) {
720 for (StructType::element_iterator I = STy->element_begin(),
721 E = STy->element_end(); I != E; ++I) {
722 if (I != STy->element_begin())
727 } else if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
728 printType(PTy->getElementType()) << '*';
729 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
730 Out << '[' << ATy->getNumElements() << " x ";
731 printType(ATy->getElementType()) << ']';
732 } else if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) {
733 Out << '<' << PTy->getNumElements() << " x ";
734 printType(PTy->getElementType()) << '>';
736 else if (const OpaqueType *OTy = dyn_cast<OpaqueType>(Ty)) {
739 if (!Ty->isPrimitiveType())
740 Out << "<unknown derived type>";
747 void AssemblyWriter::writeOperand(const Value *Operand, bool PrintType,
750 if (PrintType) { Out << ' '; printType(Operand->getType()); }
751 WriteAsOperandInternal(Out, Operand, PrintName, TypeNames, &Machine);
753 Out << "<null operand!>";
758 void AssemblyWriter::printModule(const Module *M) {
759 if (!M->getModuleIdentifier().empty() &&
760 // Don't print the ID if it will start a new line (which would
761 // require a comment char before it).
762 M->getModuleIdentifier().find('\n') == std::string::npos)
763 Out << "; ModuleID = '" << M->getModuleIdentifier() << "'\n";
765 switch (M->getEndianness()) {
766 case Module::LittleEndian: Out << "target endian = little\n"; break;
767 case Module::BigEndian: Out << "target endian = big\n"; break;
768 case Module::AnyEndianness: break;
770 switch (M->getPointerSize()) {
771 case Module::Pointer32: Out << "target pointersize = 32\n"; break;
772 case Module::Pointer64: Out << "target pointersize = 64\n"; break;
773 case Module::AnyPointerSize: break;
775 if (!M->getTargetTriple().empty())
776 Out << "target triple = \"" << M->getTargetTriple() << "\"\n";
778 if (!M->getModuleInlineAsm().empty()) {
779 // Split the string into lines, to make it easier to read the .ll file.
780 std::string Asm = M->getModuleInlineAsm();
782 size_t NewLine = Asm.find_first_of('\n', CurPos);
783 while (NewLine != std::string::npos) {
784 // We found a newline, print the portion of the asm string from the
785 // last newline up to this newline.
786 Out << "module asm \"";
787 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.begin()+NewLine),
791 NewLine = Asm.find_first_of('\n', CurPos);
793 Out << "module asm \"";
794 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.end()), Out);
798 // Loop over the dependent libraries and emit them.
799 Module::lib_iterator LI = M->lib_begin();
800 Module::lib_iterator LE = M->lib_end();
802 Out << "deplibs = [ ";
804 Out << '"' << *LI << '"';
812 // Loop over the symbol table, emitting all named constants.
813 printSymbolTable(M->getSymbolTable());
815 for (Module::const_global_iterator I = M->global_begin(), E = M->global_end(); I != E; ++I)
818 Out << "\nimplementation ; Functions:\n";
820 // Output all of the functions.
821 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
825 void AssemblyWriter::printGlobal(const GlobalVariable *GV) {
826 if (GV->hasName()) Out << getLLVMName(GV->getName()) << " = ";
828 if (!GV->hasInitializer())
831 switch (GV->getLinkage()) {
832 case GlobalValue::InternalLinkage: Out << "internal "; break;
833 case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
834 case GlobalValue::WeakLinkage: Out << "weak "; break;
835 case GlobalValue::AppendingLinkage: Out << "appending "; break;
836 case GlobalValue::ExternalLinkage: break;
837 case GlobalValue::GhostLinkage:
838 std::cerr << "GhostLinkage not allowed in AsmWriter!\n";
842 Out << (GV->isConstant() ? "constant " : "global ");
843 printType(GV->getType()->getElementType());
845 if (GV->hasInitializer()) {
846 Constant* C = cast<Constant>(GV->getInitializer());
847 assert(C && "GlobalVar initializer isn't constant?");
848 writeOperand(GV->getInitializer(), false, isa<GlobalValue>(C));
851 if (GV->hasSection())
852 Out << ", section \"" << GV->getSection() << '"';
853 if (GV->getAlignment())
854 Out << ", align " << GV->getAlignment();
856 printInfoComment(*GV);
861 // printSymbolTable - Run through symbol table looking for constants
862 // and types. Emit their declarations.
863 void AssemblyWriter::printSymbolTable(const SymbolTable &ST) {
866 for (SymbolTable::type_const_iterator TI = ST.type_begin();
867 TI != ST.type_end(); ++TI ) {
868 Out << "\t" << getLLVMName(TI->first) << " = type ";
870 // Make sure we print out at least one level of the type structure, so
871 // that we do not get %FILE = type %FILE
873 printTypeAtLeastOneLevel(TI->second) << "\n";
876 // Print the constants, in type plane order.
877 for (SymbolTable::plane_const_iterator PI = ST.plane_begin();
878 PI != ST.plane_end(); ++PI ) {
879 SymbolTable::value_const_iterator VI = ST.value_begin(PI->first);
880 SymbolTable::value_const_iterator VE = ST.value_end(PI->first);
882 for (; VI != VE; ++VI) {
883 const Value* V = VI->second;
884 const Constant *CPV = dyn_cast<Constant>(V) ;
885 if (CPV && !isa<GlobalValue>(V)) {
893 /// printConstant - Print out a constant pool entry...
895 void AssemblyWriter::printConstant(const Constant *CPV) {
896 // Don't print out unnamed constants, they will be inlined
897 if (!CPV->hasName()) return;
900 Out << "\t" << getLLVMName(CPV->getName()) << " =";
902 // Write the value out now...
903 writeOperand(CPV, true, false);
905 printInfoComment(*CPV);
909 /// printFunction - Print all aspects of a function.
911 void AssemblyWriter::printFunction(const Function *F) {
912 // Print out the return type and name...
915 // Ensure that no local symbols conflict with global symbols.
916 const_cast<Function*>(F)->renameLocalSymbols();
918 if (AnnotationWriter) AnnotationWriter->emitFunctionAnnot(F, Out);
923 switch (F->getLinkage()) {
924 case GlobalValue::InternalLinkage: Out << "internal "; break;
925 case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
926 case GlobalValue::WeakLinkage: Out << "weak "; break;
927 case GlobalValue::AppendingLinkage: Out << "appending "; break;
928 case GlobalValue::ExternalLinkage: break;
929 case GlobalValue::GhostLinkage:
930 std::cerr << "GhostLinkage not allowed in AsmWriter!\n";
934 // Print the calling convention.
935 switch (F->getCallingConv()) {
936 case CallingConv::C: break; // default
937 case CallingConv::Fast: Out << "fastcc "; break;
938 case CallingConv::Cold: Out << "coldcc "; break;
939 default: Out << "cc" << F->getCallingConv() << " "; break;
942 printType(F->getReturnType()) << ' ';
943 if (!F->getName().empty())
944 Out << getLLVMName(F->getName());
948 Machine.incorporateFunction(F);
950 // Loop over the arguments, printing them...
951 const FunctionType *FT = F->getFunctionType();
953 for(Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I)
956 // Finish printing arguments...
957 if (FT->isVarArg()) {
958 if (FT->getNumParams()) Out << ", ";
959 Out << "..."; // Output varargs portion of signature!
964 Out << " section \"" << F->getSection() << '"';
965 if (F->getAlignment())
966 Out << " align " << F->getAlignment();
968 if (F->isExternal()) {
973 // Output all of its basic blocks... for the function
974 for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
980 Machine.purgeFunction();
983 /// printArgument - This member is called for every argument that is passed into
984 /// the function. Simply print it out
986 void AssemblyWriter::printArgument(const Argument *Arg) {
987 // Insert commas as we go... the first arg doesn't get a comma
988 if (Arg != Arg->getParent()->arg_begin()) Out << ", ";
991 printType(Arg->getType());
993 // Output name, if available...
995 Out << ' ' << getLLVMName(Arg->getName());
998 /// printBasicBlock - This member is called for each basic block in a method.
1000 void AssemblyWriter::printBasicBlock(const BasicBlock *BB) {
1001 if (BB->hasName()) { // Print out the label if it exists...
1002 Out << "\n" << getLLVMName(BB->getName(), false) << ':';
1003 } else if (!BB->use_empty()) { // Don't print block # of no uses...
1004 Out << "\n; <label>:";
1005 int Slot = Machine.getSlot(BB);
1012 if (BB->getParent() == 0)
1013 Out << "\t\t; Error: Block without parent!";
1015 if (BB != &BB->getParent()->front()) { // Not the entry block?
1016 // Output predecessors for the block...
1018 pred_const_iterator PI = pred_begin(BB), PE = pred_end(BB);
1021 Out << " No predecessors!";
1024 writeOperand(*PI, false, true);
1025 for (++PI; PI != PE; ++PI) {
1027 writeOperand(*PI, false, true);
1035 if (AnnotationWriter) AnnotationWriter->emitBasicBlockStartAnnot(BB, Out);
1037 // Output all of the instructions in the basic block...
1038 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
1039 printInstruction(*I);
1041 if (AnnotationWriter) AnnotationWriter->emitBasicBlockEndAnnot(BB, Out);
1045 /// printInfoComment - Print a little comment after the instruction indicating
1046 /// which slot it occupies.
1048 void AssemblyWriter::printInfoComment(const Value &V) {
1049 if (V.getType() != Type::VoidTy) {
1051 printType(V.getType()) << '>';
1054 int SlotNum = Machine.getSlot(&V);
1058 Out << ':' << SlotNum; // Print out the def slot taken.
1060 Out << " [#uses=" << V.getNumUses() << ']'; // Output # uses
1064 /// printInstruction - This member is called for each Instruction in a function..
1066 void AssemblyWriter::printInstruction(const Instruction &I) {
1067 if (AnnotationWriter) AnnotationWriter->emitInstructionAnnot(&I, Out);
1071 // Print out name if it exists...
1073 Out << getLLVMName(I.getName()) << " = ";
1075 // If this is a volatile load or store, print out the volatile marker.
1076 if ((isa<LoadInst>(I) && cast<LoadInst>(I).isVolatile()) ||
1077 (isa<StoreInst>(I) && cast<StoreInst>(I).isVolatile())) {
1079 } else if (isa<CallInst>(I) && cast<CallInst>(I).isTailCall()) {
1080 // If this is a call, check if it's a tail call.
1084 // Print out the opcode...
1085 Out << I.getOpcodeName();
1087 // Print out the type of the operands...
1088 const Value *Operand = I.getNumOperands() ? I.getOperand(0) : 0;
1090 // Special case conditional branches to swizzle the condition out to the front
1091 if (isa<BranchInst>(I) && I.getNumOperands() > 1) {
1092 writeOperand(I.getOperand(2), true);
1094 writeOperand(Operand, true);
1096 writeOperand(I.getOperand(1), true);
1098 } else if (isa<SwitchInst>(I)) {
1099 // Special case switch statement to get formatting nice and correct...
1100 writeOperand(Operand , true); Out << ',';
1101 writeOperand(I.getOperand(1), true); Out << " [";
1103 for (unsigned op = 2, Eop = I.getNumOperands(); op < Eop; op += 2) {
1105 writeOperand(I.getOperand(op ), true); Out << ',';
1106 writeOperand(I.getOperand(op+1), true);
1109 } else if (isa<PHINode>(I)) {
1111 printType(I.getType());
1114 for (unsigned op = 0, Eop = I.getNumOperands(); op < Eop; op += 2) {
1115 if (op) Out << ", ";
1117 writeOperand(I.getOperand(op ), false); Out << ',';
1118 writeOperand(I.getOperand(op+1), false); Out << " ]";
1120 } else if (isa<ReturnInst>(I) && !Operand) {
1122 } else if (const CallInst *CI = dyn_cast<CallInst>(&I)) {
1123 // Print the calling convention being used.
1124 switch (CI->getCallingConv()) {
1125 case CallingConv::C: break; // default
1126 case CallingConv::Fast: Out << " fastcc"; break;
1127 case CallingConv::Cold: Out << " coldcc"; break;
1128 default: Out << " cc" << CI->getCallingConv(); break;
1131 const PointerType *PTy = cast<PointerType>(Operand->getType());
1132 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1133 const Type *RetTy = FTy->getReturnType();
1135 // If possible, print out the short form of the call instruction. We can
1136 // only do this if the first argument is a pointer to a nonvararg function,
1137 // and if the return type is not a pointer to a function.
1139 if (!FTy->isVarArg() &&
1140 (!isa<PointerType>(RetTy) ||
1141 !isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
1142 Out << ' '; printType(RetTy);
1143 writeOperand(Operand, false);
1145 writeOperand(Operand, true);
1148 if (CI->getNumOperands() > 1) writeOperand(CI->getOperand(1), true);
1149 for (unsigned op = 2, Eop = I.getNumOperands(); op < Eop; ++op) {
1151 writeOperand(I.getOperand(op), true);
1155 } else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
1156 const PointerType *PTy = cast<PointerType>(Operand->getType());
1157 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1158 const Type *RetTy = FTy->getReturnType();
1160 // Print the calling convention being used.
1161 switch (II->getCallingConv()) {
1162 case CallingConv::C: break; // default
1163 case CallingConv::Fast: Out << " fastcc"; break;
1164 case CallingConv::Cold: Out << " coldcc"; break;
1165 default: Out << " cc" << II->getCallingConv(); break;
1168 // If possible, print out the short form of the invoke instruction. We can
1169 // only do this if the first argument is a pointer to a nonvararg function,
1170 // and if the return type is not a pointer to a function.
1172 if (!FTy->isVarArg() &&
1173 (!isa<PointerType>(RetTy) ||
1174 !isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
1175 Out << ' '; printType(RetTy);
1176 writeOperand(Operand, false);
1178 writeOperand(Operand, true);
1182 if (I.getNumOperands() > 3) writeOperand(I.getOperand(3), true);
1183 for (unsigned op = 4, Eop = I.getNumOperands(); op < Eop; ++op) {
1185 writeOperand(I.getOperand(op), true);
1188 Out << " )\n\t\t\tto";
1189 writeOperand(II->getNormalDest(), true);
1191 writeOperand(II->getUnwindDest(), true);
1193 } else if (const AllocationInst *AI = dyn_cast<AllocationInst>(&I)) {
1195 printType(AI->getType()->getElementType());
1196 if (AI->isArrayAllocation()) {
1198 writeOperand(AI->getArraySize(), true);
1200 if (AI->getAlignment()) {
1201 Out << ", align " << AI->getAlignment();
1203 } else if (isa<CastInst>(I)) {
1204 if (Operand) writeOperand(Operand, true); // Work with broken code
1206 printType(I.getType());
1207 } else if (isa<VAArgInst>(I)) {
1208 if (Operand) writeOperand(Operand, true); // Work with broken code
1210 printType(I.getType());
1211 } else if (Operand) { // Print the normal way...
1213 // PrintAllTypes - Instructions who have operands of all the same type
1214 // omit the type from all but the first operand. If the instruction has
1215 // different type operands (for example br), then they are all printed.
1216 bool PrintAllTypes = false;
1217 const Type *TheType = Operand->getType();
1219 // Shift Left & Right print both types even for Ubyte LHS, and select prints
1220 // types even if all operands are bools.
1221 if (isa<ShiftInst>(I) || isa<SelectInst>(I) || isa<StoreInst>(I)) {
1222 PrintAllTypes = true;
1224 for (unsigned i = 1, E = I.getNumOperands(); i != E; ++i) {
1225 Operand = I.getOperand(i);
1226 if (Operand->getType() != TheType) {
1227 PrintAllTypes = true; // We have differing types! Print them all!
1233 if (!PrintAllTypes) {
1238 for (unsigned i = 0, E = I.getNumOperands(); i != E; ++i) {
1240 writeOperand(I.getOperand(i), PrintAllTypes);
1244 printInfoComment(I);
1249 //===----------------------------------------------------------------------===//
1250 // External Interface declarations
1251 //===----------------------------------------------------------------------===//
1253 void Module::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1254 SlotMachine SlotTable(this);
1255 AssemblyWriter W(o, SlotTable, this, AAW);
1259 void GlobalVariable::print(std::ostream &o) const {
1260 SlotMachine SlotTable(getParent());
1261 AssemblyWriter W(o, SlotTable, getParent(), 0);
1265 void Function::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1266 SlotMachine SlotTable(getParent());
1267 AssemblyWriter W(o, SlotTable, getParent(), AAW);
1272 void InlineAsm::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1273 SlotMachine SlotTable(getParent());
1274 AssemblyWriter W(o, SlotTable, getParent(), AAW);
1276 assert(0 && "Inline asm printing unimplemented!");
1280 void BasicBlock::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1281 SlotMachine SlotTable(getParent());
1282 AssemblyWriter W(o, SlotTable,
1283 getParent() ? getParent()->getParent() : 0, AAW);
1287 void Instruction::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1288 const Function *F = getParent() ? getParent()->getParent() : 0;
1289 SlotMachine SlotTable(F);
1290 AssemblyWriter W(o, SlotTable, F ? F->getParent() : 0, AAW);
1295 void Constant::print(std::ostream &o) const {
1296 if (this == 0) { o << "<null> constant value\n"; return; }
1298 o << ' ' << getType()->getDescription() << ' ';
1300 std::map<const Type *, std::string> TypeTable;
1301 WriteConstantInt(o, this, false, TypeTable, 0);
1304 void Type::print(std::ostream &o) const {
1308 o << getDescription();
1311 void Argument::print(std::ostream &o) const {
1312 WriteAsOperand(o, this, true, true,
1313 getParent() ? getParent()->getParent() : 0);
1316 // Value::dump - allow easy printing of Values from the debugger.
1317 // Located here because so much of the needed functionality is here.
1318 void Value::dump() const { print(std::cerr); }
1320 // Type::dump - allow easy printing of Values from the debugger.
1321 // Located here because so much of the needed functionality is here.
1322 void Type::dump() const { print(std::cerr); }
1324 //===----------------------------------------------------------------------===//
1325 // CachedWriter Class Implementation
1326 //===----------------------------------------------------------------------===//
1328 void CachedWriter::setModule(const Module *M) {
1329 delete SC; delete AW;
1331 SC = new SlotMachine(M );
1332 AW = new AssemblyWriter(Out, *SC, M, 0);
1338 CachedWriter::~CachedWriter() {
1343 CachedWriter &CachedWriter::operator<<(const Value &V) {
1344 assert(AW && SC && "CachedWriter does not have a current module!");
1345 if (const Instruction *I = dyn_cast<Instruction>(&V))
1347 else if (const BasicBlock *BB = dyn_cast<BasicBlock>(&V))
1349 else if (const Function *F = dyn_cast<Function>(&V))
1351 else if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(&V))
1354 AW->writeOperand(&V, true, true);
1358 CachedWriter& CachedWriter::operator<<(const Type &Ty) {
1359 if (SymbolicTypes) {
1360 const Module *M = AW->getModule();
1361 if (M) WriteTypeSymbolic(Out, &Ty, M);
1368 //===----------------------------------------------------------------------===//
1369 //===-- SlotMachine Implementation
1370 //===----------------------------------------------------------------------===//
1373 #define SC_DEBUG(X) std::cerr << X
1378 // Module level constructor. Causes the contents of the Module (sans functions)
1379 // to be added to the slot table.
1380 SlotMachine::SlotMachine(const Module *M)
1381 : TheModule(M) ///< Saved for lazy initialization.
1383 , FunctionProcessed(false)
1391 // Function level constructor. Causes the contents of the Module and the one
1392 // function provided to be added to the slot table.
1393 SlotMachine::SlotMachine(const Function *F )
1394 : TheModule( F ? F->getParent() : 0 ) ///< Saved for lazy initialization
1395 , TheFunction(F) ///< Saved for lazy initialization
1396 , FunctionProcessed(false)
1404 inline void SlotMachine::initialize(void) {
1407 TheModule = 0; ///< Prevent re-processing next time we're called.
1409 if ( TheFunction && ! FunctionProcessed) {
1414 // Iterate through all the global variables, functions, and global
1415 // variable initializers and create slots for them.
1416 void SlotMachine::processModule() {
1417 SC_DEBUG("begin processModule!\n");
1419 // Add all of the global variables to the value table...
1420 for (Module::const_global_iterator I = TheModule->global_begin(), E = TheModule->global_end();
1424 // Add all the functions to the table
1425 for (Module::const_iterator I = TheModule->begin(), E = TheModule->end();
1429 SC_DEBUG("end processModule!\n");
1433 // Process the arguments, basic blocks, and instructions of a function.
1434 void SlotMachine::processFunction() {
1435 SC_DEBUG("begin processFunction!\n");
1437 // Add all the function arguments
1438 for(Function::const_arg_iterator AI = TheFunction->arg_begin(),
1439 AE = TheFunction->arg_end(); AI != AE; ++AI)
1442 SC_DEBUG("Inserting Instructions:\n");
1444 // Add all of the basic blocks and instructions
1445 for (Function::const_iterator BB = TheFunction->begin(),
1446 E = TheFunction->end(); BB != E; ++BB) {
1448 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) {
1453 FunctionProcessed = true;
1455 SC_DEBUG("end processFunction!\n");
1458 // Clean up after incorporating a function. This is the only way
1459 // to get out of the function incorporation state that affects the
1460 // getSlot/createSlot lock. Function incorporation state is indicated
1461 // by TheFunction != 0.
1462 void SlotMachine::purgeFunction() {
1463 SC_DEBUG("begin purgeFunction!\n");
1464 fMap.clear(); // Simply discard the function level map
1467 FunctionProcessed = false;
1468 SC_DEBUG("end purgeFunction!\n");
1471 /// Get the slot number for a value. This function will assert if you
1472 /// ask for a Value that hasn't previously been inserted with createSlot.
1473 /// Types are forbidden because Type does not inherit from Value (any more).
1474 int SlotMachine::getSlot(const Value *V) {
1475 assert( V && "Can't get slot for null Value" );
1476 assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
1477 "Can't insert a non-GlobalValue Constant into SlotMachine");
1479 // Check for uninitialized state and do lazy initialization
1482 // Get the type of the value
1483 const Type* VTy = V->getType();
1485 // Find the type plane in the module map
1486 TypedPlanes::const_iterator MI = mMap.find(VTy);
1488 if ( TheFunction ) {
1489 // Lookup the type in the function map too
1490 TypedPlanes::const_iterator FI = fMap.find(VTy);
1491 // If there is a corresponding type plane in the function map
1492 if ( FI != fMap.end() ) {
1493 // Lookup the Value in the function map
1494 ValueMap::const_iterator FVI = FI->second.map.find(V);
1495 // If the value doesn't exist in the function map
1496 if ( FVI == FI->second.map.end() ) {
1497 // Look up the value in the module map.
1498 if (MI == mMap.end()) return -1;
1499 ValueMap::const_iterator MVI = MI->second.map.find(V);
1500 // If we didn't find it, it wasn't inserted
1501 if (MVI == MI->second.map.end()) return -1;
1502 assert( MVI != MI->second.map.end() && "Value not found");
1503 // We found it only at the module level
1506 // else the value exists in the function map
1508 // Return the slot number as the module's contribution to
1509 // the type plane plus the index in the function's contribution
1510 // to the type plane.
1511 if (MI != mMap.end())
1512 return MI->second.next_slot + FVI->second;
1519 // N.B. Can get here only if either !TheFunction or the function doesn't
1520 // have a corresponding type plane for the Value
1522 // Make sure the type plane exists
1523 if (MI == mMap.end()) return -1;
1524 // Lookup the value in the module's map
1525 ValueMap::const_iterator MVI = MI->second.map.find(V);
1526 // Make sure we found it.
1527 if (MVI == MI->second.map.end()) return -1;
1532 /// Get the slot number for a value. This function will assert if you
1533 /// ask for a Value that hasn't previously been inserted with createSlot.
1534 /// Types are forbidden because Type does not inherit from Value (any more).
1535 int SlotMachine::getSlot(const Type *Ty) {
1536 assert( Ty && "Can't get slot for null Type" );
1538 // Check for uninitialized state and do lazy initialization
1541 if ( TheFunction ) {
1542 // Lookup the Type in the function map
1543 TypeMap::const_iterator FTI = fTypes.map.find(Ty);
1544 // If the Type doesn't exist in the function map
1545 if ( FTI == fTypes.map.end() ) {
1546 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1547 // If we didn't find it, it wasn't inserted
1548 if (MTI == mTypes.map.end())
1550 // We found it only at the module level
1553 // else the value exists in the function map
1555 // Return the slot number as the module's contribution to
1556 // the type plane plus the index in the function's contribution
1557 // to the type plane.
1558 return mTypes.next_slot + FTI->second;
1562 // N.B. Can get here only if either !TheFunction
1564 // Lookup the value in the module's map
1565 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1566 // Make sure we found it.
1567 if (MTI == mTypes.map.end()) return -1;
1572 // Create a new slot, or return the existing slot if it is already
1573 // inserted. Note that the logic here parallels getSlot but instead
1574 // of asserting when the Value* isn't found, it inserts the value.
1575 unsigned SlotMachine::createSlot(const Value *V) {
1576 assert( V && "Can't insert a null Value to SlotMachine");
1577 assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
1578 "Can't insert a non-GlobalValue Constant into SlotMachine");
1580 const Type* VTy = V->getType();
1582 // Just ignore void typed things
1583 if (VTy == Type::VoidTy) return 0; // FIXME: Wrong return value!
1585 // Look up the type plane for the Value's type from the module map
1586 TypedPlanes::const_iterator MI = mMap.find(VTy);
1588 if ( TheFunction ) {
1589 // Get the type plane for the Value's type from the function map
1590 TypedPlanes::const_iterator FI = fMap.find(VTy);
1591 // If there is a corresponding type plane in the function map
1592 if ( FI != fMap.end() ) {
1593 // Lookup the Value in the function map
1594 ValueMap::const_iterator FVI = FI->second.map.find(V);
1595 // If the value doesn't exist in the function map
1596 if ( FVI == FI->second.map.end() ) {
1597 // If there is no corresponding type plane in the module map
1598 if ( MI == mMap.end() )
1599 return insertValue(V);
1600 // Look up the value in the module map
1601 ValueMap::const_iterator MVI = MI->second.map.find(V);
1602 // If we didn't find it, it wasn't inserted
1603 if ( MVI == MI->second.map.end() )
1604 return insertValue(V);
1606 // We found it only at the module level
1609 // else the value exists in the function map
1611 if ( MI == mMap.end() )
1614 // Return the slot number as the module's contribution to
1615 // the type plane plus the index in the function's contribution
1616 // to the type plane.
1617 return MI->second.next_slot + FVI->second;
1620 // else there is not a corresponding type plane in the function map
1622 // If the type plane doesn't exists at the module level
1623 if ( MI == mMap.end() ) {
1624 return insertValue(V);
1625 // else type plane exists at the module level, examine it
1627 // Look up the value in the module's map
1628 ValueMap::const_iterator MVI = MI->second.map.find(V);
1629 // If we didn't find it there either
1630 if ( MVI == MI->second.map.end() )
1631 // Return the slot number as the module's contribution to
1632 // the type plane plus the index of the function map insertion.
1633 return MI->second.next_slot + insertValue(V);
1640 // N.B. Can only get here if !TheFunction
1642 // If the module map's type plane is not for the Value's type
1643 if ( MI != mMap.end() ) {
1644 // Lookup the value in the module's map
1645 ValueMap::const_iterator MVI = MI->second.map.find(V);
1646 if ( MVI != MI->second.map.end() )
1650 return insertValue(V);
1653 // Create a new slot, or return the existing slot if it is already
1654 // inserted. Note that the logic here parallels getSlot but instead
1655 // of asserting when the Value* isn't found, it inserts the value.
1656 unsigned SlotMachine::createSlot(const Type *Ty) {
1657 assert( Ty && "Can't insert a null Type to SlotMachine");
1659 if ( TheFunction ) {
1660 // Lookup the Type in the function map
1661 TypeMap::const_iterator FTI = fTypes.map.find(Ty);
1662 // If the type doesn't exist in the function map
1663 if ( FTI == fTypes.map.end() ) {
1664 // Look up the type in the module map
1665 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1666 // If we didn't find it, it wasn't inserted
1667 if ( MTI == mTypes.map.end() )
1668 return insertValue(Ty);
1670 // We found it only at the module level
1673 // else the value exists in the function map
1675 // Return the slot number as the module's contribution to
1676 // the type plane plus the index in the function's contribution
1677 // to the type plane.
1678 return mTypes.next_slot + FTI->second;
1682 // N.B. Can only get here if !TheFunction
1684 // Lookup the type in the module's map
1685 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1686 if ( MTI != mTypes.map.end() )
1689 return insertValue(Ty);
1692 // Low level insert function. Minimal checking is done. This
1693 // function is just for the convenience of createSlot (above).
1694 unsigned SlotMachine::insertValue(const Value *V ) {
1695 assert(V && "Can't insert a null Value into SlotMachine!");
1696 assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
1697 "Can't insert a non-GlobalValue Constant into SlotMachine");
1699 // If this value does not contribute to a plane (is void)
1700 // or if the value already has a name then ignore it.
1701 if (V->getType() == Type::VoidTy || V->hasName() ) {
1702 SC_DEBUG("ignored value " << *V << "\n");
1703 return 0; // FIXME: Wrong return value
1706 const Type *VTy = V->getType();
1707 unsigned DestSlot = 0;
1709 if ( TheFunction ) {
1710 TypedPlanes::iterator I = fMap.find( VTy );
1711 if ( I == fMap.end() )
1712 I = fMap.insert(std::make_pair(VTy,ValuePlane())).first;
1713 DestSlot = I->second.map[V] = I->second.next_slot++;
1715 TypedPlanes::iterator I = mMap.find( VTy );
1716 if ( I == mMap.end() )
1717 I = mMap.insert(std::make_pair(VTy,ValuePlane())).first;
1718 DestSlot = I->second.map[V] = I->second.next_slot++;
1721 SC_DEBUG(" Inserting value [" << VTy << "] = " << V << " slot=" <<
1723 // G = Global, C = Constant, T = Type, F = Function, o = other
1724 SC_DEBUG((isa<GlobalVariable>(V) ? 'G' : (isa<Function>(V) ? 'F' :
1725 (isa<Constant>(V) ? 'C' : 'o'))));
1730 // Low level insert function. Minimal checking is done. This
1731 // function is just for the convenience of createSlot (above).
1732 unsigned SlotMachine::insertValue(const Type *Ty ) {
1733 assert(Ty && "Can't insert a null Type into SlotMachine!");
1735 unsigned DestSlot = 0;
1737 if ( TheFunction ) {
1738 DestSlot = fTypes.map[Ty] = fTypes.next_slot++;
1740 DestSlot = fTypes.map[Ty] = fTypes.next_slot++;
1742 SC_DEBUG(" Inserting type [" << DestSlot << "] = " << Ty << "\n");