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 /// @brief Internal constant writer.
402 static void WriteConstantInt(std::ostream &Out, const Constant *CV,
404 std::map<const Type *, std::string> &TypeTable,
405 SlotMachine *Machine) {
406 if (const ConstantBool *CB = dyn_cast<ConstantBool>(CV)) {
407 Out << (CB == ConstantBool::True ? "true" : "false");
408 } else if (const ConstantSInt *CI = dyn_cast<ConstantSInt>(CV)) {
409 Out << CI->getValue();
410 } else if (const ConstantUInt *CI = dyn_cast<ConstantUInt>(CV)) {
411 Out << CI->getValue();
412 } else if (const ConstantFP *CFP = dyn_cast<ConstantFP>(CV)) {
413 // We would like to output the FP constant value in exponential notation,
414 // but we cannot do this if doing so will lose precision. Check here to
415 // make sure that we only output it in exponential format if we can parse
416 // the value back and get the same value.
418 std::string StrVal = ftostr(CFP->getValue());
420 // Check to make sure that the stringized number is not some string like
421 // "Inf" or NaN, that atof will accept, but the lexer will not. Check that
422 // the string matches the "[-+]?[0-9]" regex.
424 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
425 ((StrVal[0] == '-' || StrVal[0] == '+') &&
426 (StrVal[1] >= '0' && StrVal[1] <= '9')))
427 // Reparse stringized version!
428 if (atof(StrVal.c_str()) == CFP->getValue()) {
433 // Otherwise we could not reparse it to exactly the same value, so we must
434 // output the string in hexadecimal format!
435 assert(sizeof(double) == sizeof(uint64_t) &&
436 "assuming that double is 64 bits!");
437 Out << "0x" << utohexstr(DoubleToBits(CFP->getValue()));
439 } else if (isa<ConstantAggregateZero>(CV)) {
440 Out << "zeroinitializer";
441 } else if (const ConstantArray *CA = dyn_cast<ConstantArray>(CV)) {
442 // As a special case, print the array as a string if it is an array of
443 // ubytes or an array of sbytes with positive values.
445 const Type *ETy = CA->getType()->getElementType();
446 bool isString = (ETy == Type::SByteTy || ETy == Type::UByteTy);
448 if (ETy == Type::SByteTy)
449 for (unsigned i = 0; i < CA->getNumOperands(); ++i)
450 if (cast<ConstantSInt>(CA->getOperand(i))->getValue() < 0) {
457 for (unsigned i = 0; i < CA->getNumOperands(); ++i) {
459 (unsigned char)cast<ConstantInt>(CA->getOperand(i))->getRawValue();
461 if (isprint(C) && C != '"' && C != '\\') {
465 << (char) ((C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'))
466 << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
471 } else { // Cannot output in string format...
473 if (CA->getNumOperands()) {
475 printTypeInt(Out, ETy, TypeTable);
476 WriteAsOperandInternal(Out, CA->getOperand(0),
477 PrintName, TypeTable, Machine);
478 for (unsigned i = 1, e = CA->getNumOperands(); i != e; ++i) {
480 printTypeInt(Out, ETy, TypeTable);
481 WriteAsOperandInternal(Out, CA->getOperand(i), PrintName,
487 } else if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(CV)) {
489 if (CS->getNumOperands()) {
491 printTypeInt(Out, CS->getOperand(0)->getType(), TypeTable);
493 WriteAsOperandInternal(Out, CS->getOperand(0),
494 PrintName, TypeTable, Machine);
496 for (unsigned i = 1; i < CS->getNumOperands(); i++) {
498 printTypeInt(Out, CS->getOperand(i)->getType(), TypeTable);
500 WriteAsOperandInternal(Out, CS->getOperand(i),
501 PrintName, TypeTable, Machine);
506 } else if (const ConstantPacked *CP = dyn_cast<ConstantPacked>(CV)) {
507 const Type *ETy = CP->getType()->getElementType();
508 assert(CP->getNumOperands() > 0 &&
509 "Number of operands for a PackedConst must be > 0");
512 printTypeInt(Out, ETy, TypeTable);
513 WriteAsOperandInternal(Out, CP->getOperand(0),
514 PrintName, TypeTable, Machine);
515 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
517 printTypeInt(Out, ETy, TypeTable);
518 WriteAsOperandInternal(Out, CP->getOperand(i), PrintName,
522 } else if (isa<ConstantPointerNull>(CV)) {
525 } else if (isa<UndefValue>(CV)) {
528 } else if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CV)) {
529 Out << CE->getOpcodeName() << " (";
531 for (User::const_op_iterator OI=CE->op_begin(); OI != CE->op_end(); ++OI) {
532 printTypeInt(Out, (*OI)->getType(), TypeTable);
533 WriteAsOperandInternal(Out, *OI, PrintName, TypeTable, Machine);
534 if (OI+1 != CE->op_end())
538 if (CE->getOpcode() == Instruction::Cast) {
540 printTypeInt(Out, CE->getType(), TypeTable);
545 Out << "<placeholder or erroneous Constant>";
550 /// WriteAsOperand - Write the name of the specified value out to the specified
551 /// ostream. This can be useful when you just want to print int %reg126, not
552 /// the whole instruction that generated it.
554 static void WriteAsOperandInternal(std::ostream &Out, const Value *V,
556 std::map<const Type*, std::string> &TypeTable,
557 SlotMachine *Machine) {
559 if ((PrintName || isa<GlobalValue>(V)) && V->hasName())
560 Out << getLLVMName(V->getName());
562 const Constant *CV = dyn_cast<Constant>(V);
563 if (CV && !isa<GlobalValue>(CV))
564 WriteConstantInt(Out, CV, PrintName, TypeTable, Machine);
568 Slot = Machine->getSlot(V);
570 Machine = createSlotMachine(V);
572 Slot = Machine->getSlot(V);
585 /// WriteAsOperand - Write the name of the specified value out to the specified
586 /// ostream. This can be useful when you just want to print int %reg126, not
587 /// the whole instruction that generated it.
589 std::ostream &llvm::WriteAsOperand(std::ostream &Out, const Value *V,
590 bool PrintType, bool PrintName,
591 const Module *Context) {
592 std::map<const Type *, std::string> TypeNames;
593 if (Context == 0) Context = getModuleFromVal(V);
596 fillTypeNameTable(Context, TypeNames);
599 printTypeInt(Out, V->getType(), TypeNames);
601 WriteAsOperandInternal(Out, V, PrintName, TypeNames, 0);
605 /// WriteAsOperandInternal - Write the name of the specified value out to
606 /// the specified ostream. This can be useful when you just want to print
607 /// int %reg126, not the whole instruction that generated it.
609 static void WriteAsOperandInternal(std::ostream &Out, const Type *T,
611 std::map<const Type*, std::string> &TypeTable,
612 SlotMachine *Machine) {
616 Slot = Machine->getSlot(T);
622 Out << T->getDescription();
626 /// WriteAsOperand - Write the name of the specified value out to the specified
627 /// ostream. This can be useful when you just want to print int %reg126, not
628 /// the whole instruction that generated it.
630 std::ostream &llvm::WriteAsOperand(std::ostream &Out, const Type *Ty,
631 bool PrintType, bool PrintName,
632 const Module *Context) {
633 std::map<const Type *, std::string> TypeNames;
634 assert(Context != 0 && "Can't write types as operand without module context");
636 fillTypeNameTable(Context, TypeNames);
639 // printTypeInt(Out, V->getType(), TypeNames);
641 printTypeInt(Out, Ty, TypeNames);
643 WriteAsOperandInternal(Out, Ty, PrintName, TypeNames, 0);
649 class AssemblyWriter {
651 SlotMachine &Machine;
652 const Module *TheModule;
653 std::map<const Type *, std::string> TypeNames;
654 AssemblyAnnotationWriter *AnnotationWriter;
656 inline AssemblyWriter(std::ostream &o, SlotMachine &Mac, const Module *M,
657 AssemblyAnnotationWriter *AAW)
658 : Out(o), Machine(Mac), TheModule(M), AnnotationWriter(AAW) {
660 // If the module has a symbol table, take all global types and stuff their
661 // names into the TypeNames map.
663 fillTypeNameTable(M, TypeNames);
666 inline void write(const Module *M) { printModule(M); }
667 inline void write(const GlobalVariable *G) { printGlobal(G); }
668 inline void write(const Function *F) { printFunction(F); }
669 inline void write(const BasicBlock *BB) { printBasicBlock(BB); }
670 inline void write(const Instruction *I) { printInstruction(*I); }
671 inline void write(const Constant *CPV) { printConstant(CPV); }
672 inline void write(const Type *Ty) { printType(Ty); }
674 void writeOperand(const Value *Op, bool PrintType, bool PrintName = true);
676 const Module* getModule() { return TheModule; }
679 void printModule(const Module *M);
680 void printSymbolTable(const SymbolTable &ST);
681 void printConstant(const Constant *CPV);
682 void printGlobal(const GlobalVariable *GV);
683 void printFunction(const Function *F);
684 void printArgument(const Argument *FA);
685 void printBasicBlock(const BasicBlock *BB);
686 void printInstruction(const Instruction &I);
688 // printType - Go to extreme measures to attempt to print out a short,
689 // symbolic version of a type name.
691 std::ostream &printType(const Type *Ty) {
692 return printTypeInt(Out, Ty, TypeNames);
695 // printTypeAtLeastOneLevel - Print out one level of the possibly complex type
696 // without considering any symbolic types that we may have equal to it.
698 std::ostream &printTypeAtLeastOneLevel(const Type *Ty);
700 // printInfoComment - Print a little comment after the instruction indicating
701 // which slot it occupies.
702 void printInfoComment(const Value &V);
704 } // end of llvm namespace
706 /// printTypeAtLeastOneLevel - Print out one level of the possibly complex type
707 /// without considering any symbolic types that we may have equal to it.
709 std::ostream &AssemblyWriter::printTypeAtLeastOneLevel(const Type *Ty) {
710 if (const FunctionType *FTy = dyn_cast<FunctionType>(Ty)) {
711 printType(FTy->getReturnType()) << " (";
712 for (FunctionType::param_iterator I = FTy->param_begin(),
713 E = FTy->param_end(); I != E; ++I) {
714 if (I != FTy->param_begin())
718 if (FTy->isVarArg()) {
719 if (FTy->getNumParams()) Out << ", ";
723 } else if (const StructType *STy = dyn_cast<StructType>(Ty)) {
725 for (StructType::element_iterator I = STy->element_begin(),
726 E = STy->element_end(); I != E; ++I) {
727 if (I != STy->element_begin())
732 } else if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
733 printType(PTy->getElementType()) << '*';
734 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
735 Out << '[' << ATy->getNumElements() << " x ";
736 printType(ATy->getElementType()) << ']';
737 } else if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) {
738 Out << '<' << PTy->getNumElements() << " x ";
739 printType(PTy->getElementType()) << '>';
741 else if (const OpaqueType *OTy = dyn_cast<OpaqueType>(Ty)) {
744 if (!Ty->isPrimitiveType())
745 Out << "<unknown derived type>";
752 void AssemblyWriter::writeOperand(const Value *Operand, bool PrintType,
755 if (PrintType) { Out << ' '; printType(Operand->getType()); }
756 WriteAsOperandInternal(Out, Operand, PrintName, TypeNames, &Machine);
758 Out << "<null operand!>";
763 void AssemblyWriter::printModule(const Module *M) {
764 if (!M->getModuleIdentifier().empty() &&
765 // Don't print the ID if it will start a new line (which would
766 // require a comment char before it).
767 M->getModuleIdentifier().find('\n') == std::string::npos)
768 Out << "; ModuleID = '" << M->getModuleIdentifier() << "'\n";
770 switch (M->getEndianness()) {
771 case Module::LittleEndian: Out << "target endian = little\n"; break;
772 case Module::BigEndian: Out << "target endian = big\n"; break;
773 case Module::AnyEndianness: break;
775 switch (M->getPointerSize()) {
776 case Module::Pointer32: Out << "target pointersize = 32\n"; break;
777 case Module::Pointer64: Out << "target pointersize = 64\n"; break;
778 case Module::AnyPointerSize: break;
780 if (!M->getTargetTriple().empty())
781 Out << "target triple = \"" << M->getTargetTriple() << "\"\n";
783 // Loop over the dependent libraries and emit them.
784 Module::lib_iterator LI = M->lib_begin();
785 Module::lib_iterator LE = M->lib_end();
787 Out << "deplibs = [ ";
789 Out << '"' << *LI << '"';
797 // Loop over the symbol table, emitting all named constants.
798 printSymbolTable(M->getSymbolTable());
800 for (Module::const_global_iterator I = M->global_begin(), E = M->global_end(); I != E; ++I)
803 Out << "\nimplementation ; Functions:\n";
805 // Output all of the functions.
806 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
810 void AssemblyWriter::printGlobal(const GlobalVariable *GV) {
811 if (GV->hasName()) Out << getLLVMName(GV->getName()) << " = ";
813 if (!GV->hasInitializer())
816 switch (GV->getLinkage()) {
817 case GlobalValue::InternalLinkage: Out << "internal "; break;
818 case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
819 case GlobalValue::WeakLinkage: Out << "weak "; break;
820 case GlobalValue::AppendingLinkage: Out << "appending "; break;
821 case GlobalValue::ExternalLinkage: break;
822 case GlobalValue::GhostLinkage:
823 std::cerr << "GhostLinkage not allowed in AsmWriter!\n";
827 Out << (GV->isConstant() ? "constant " : "global ");
828 printType(GV->getType()->getElementType());
830 if (GV->hasInitializer()) {
831 Constant* C = cast<Constant>(GV->getInitializer());
832 assert(C && "GlobalVar initializer isn't constant?");
833 writeOperand(GV->getInitializer(), false, isa<GlobalValue>(C));
836 printInfoComment(*GV);
841 // printSymbolTable - Run through symbol table looking for constants
842 // and types. Emit their declarations.
843 void AssemblyWriter::printSymbolTable(const SymbolTable &ST) {
846 for (SymbolTable::type_const_iterator TI = ST.type_begin();
847 TI != ST.type_end(); ++TI ) {
848 Out << "\t" << getLLVMName(TI->first) << " = type ";
850 // Make sure we print out at least one level of the type structure, so
851 // that we do not get %FILE = type %FILE
853 printTypeAtLeastOneLevel(TI->second) << "\n";
856 // Print the constants, in type plane order.
857 for (SymbolTable::plane_const_iterator PI = ST.plane_begin();
858 PI != ST.plane_end(); ++PI ) {
859 SymbolTable::value_const_iterator VI = ST.value_begin(PI->first);
860 SymbolTable::value_const_iterator VE = ST.value_end(PI->first);
862 for (; VI != VE; ++VI) {
863 const Value* V = VI->second;
864 const Constant *CPV = dyn_cast<Constant>(V) ;
865 if (CPV && !isa<GlobalValue>(V)) {
873 /// printConstant - Print out a constant pool entry...
875 void AssemblyWriter::printConstant(const Constant *CPV) {
876 // Don't print out unnamed constants, they will be inlined
877 if (!CPV->hasName()) return;
880 Out << "\t" << getLLVMName(CPV->getName()) << " =";
882 // Write the value out now...
883 writeOperand(CPV, true, false);
885 printInfoComment(*CPV);
889 /// printFunction - Print all aspects of a function.
891 void AssemblyWriter::printFunction(const Function *F) {
892 // Print out the return type and name...
895 // Ensure that no local symbols conflict with global symbols.
896 const_cast<Function*>(F)->renameLocalSymbols();
898 if (AnnotationWriter) AnnotationWriter->emitFunctionAnnot(F, Out);
903 switch (F->getLinkage()) {
904 case GlobalValue::InternalLinkage: Out << "internal "; break;
905 case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
906 case GlobalValue::WeakLinkage: Out << "weak "; break;
907 case GlobalValue::AppendingLinkage: Out << "appending "; break;
908 case GlobalValue::ExternalLinkage: break;
909 case GlobalValue::GhostLinkage:
910 std::cerr << "GhostLinkage not allowed in AsmWriter!\n";
914 // Print the calling convention.
915 switch (F->getCallingConv()) {
916 case CallingConv::C: break; // default
917 case CallingConv::Fast: Out << "fastcc "; break;
918 case CallingConv::Cold: Out << "coldcc "; break;
919 default: Out << "cc" << F->getCallingConv() << " "; break;
922 printType(F->getReturnType()) << ' ';
923 if (!F->getName().empty())
924 Out << getLLVMName(F->getName());
928 Machine.incorporateFunction(F);
930 // Loop over the arguments, printing them...
931 const FunctionType *FT = F->getFunctionType();
933 for(Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I)
936 // Finish printing arguments...
937 if (FT->isVarArg()) {
938 if (FT->getNumParams()) Out << ", ";
939 Out << "..."; // Output varargs portion of signature!
943 if (F->isExternal()) {
948 // Output all of its basic blocks... for the function
949 for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
955 Machine.purgeFunction();
958 /// printArgument - This member is called for every argument that is passed into
959 /// the function. Simply print it out
961 void AssemblyWriter::printArgument(const Argument *Arg) {
962 // Insert commas as we go... the first arg doesn't get a comma
963 if (Arg != Arg->getParent()->arg_begin()) Out << ", ";
966 printType(Arg->getType());
968 // Output name, if available...
970 Out << ' ' << getLLVMName(Arg->getName());
973 /// printBasicBlock - This member is called for each basic block in a method.
975 void AssemblyWriter::printBasicBlock(const BasicBlock *BB) {
976 if (BB->hasName()) { // Print out the label if it exists...
977 Out << "\n" << getLLVMName(BB->getName(), false) << ':';
978 } else if (!BB->use_empty()) { // Don't print block # of no uses...
979 Out << "\n; <label>:";
980 int Slot = Machine.getSlot(BB);
987 if (BB->getParent() == 0)
988 Out << "\t\t; Error: Block without parent!";
990 if (BB != &BB->getParent()->front()) { // Not the entry block?
991 // Output predecessors for the block...
993 pred_const_iterator PI = pred_begin(BB), PE = pred_end(BB);
996 Out << " No predecessors!";
999 writeOperand(*PI, false, true);
1000 for (++PI; PI != PE; ++PI) {
1002 writeOperand(*PI, false, true);
1010 if (AnnotationWriter) AnnotationWriter->emitBasicBlockStartAnnot(BB, Out);
1012 // Output all of the instructions in the basic block...
1013 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
1014 printInstruction(*I);
1016 if (AnnotationWriter) AnnotationWriter->emitBasicBlockEndAnnot(BB, Out);
1020 /// printInfoComment - Print a little comment after the instruction indicating
1021 /// which slot it occupies.
1023 void AssemblyWriter::printInfoComment(const Value &V) {
1024 if (V.getType() != Type::VoidTy) {
1026 printType(V.getType()) << '>';
1029 int SlotNum = Machine.getSlot(&V);
1033 Out << ':' << SlotNum; // Print out the def slot taken.
1035 Out << " [#uses=" << V.getNumUses() << ']'; // Output # uses
1039 /// printInstruction - This member is called for each Instruction in a function..
1041 void AssemblyWriter::printInstruction(const Instruction &I) {
1042 if (AnnotationWriter) AnnotationWriter->emitInstructionAnnot(&I, Out);
1046 // Print out name if it exists...
1048 Out << getLLVMName(I.getName()) << " = ";
1050 // If this is a volatile load or store, print out the volatile marker.
1051 if ((isa<LoadInst>(I) && cast<LoadInst>(I).isVolatile()) ||
1052 (isa<StoreInst>(I) && cast<StoreInst>(I).isVolatile())) {
1054 } else if (isa<CallInst>(I) && cast<CallInst>(I).isTailCall()) {
1055 // If this is a call, check if it's a tail call.
1059 // Print out the opcode...
1060 Out << I.getOpcodeName();
1062 // Print out the type of the operands...
1063 const Value *Operand = I.getNumOperands() ? I.getOperand(0) : 0;
1065 // Special case conditional branches to swizzle the condition out to the front
1066 if (isa<BranchInst>(I) && I.getNumOperands() > 1) {
1067 writeOperand(I.getOperand(2), true);
1069 writeOperand(Operand, true);
1071 writeOperand(I.getOperand(1), true);
1073 } else if (isa<SwitchInst>(I)) {
1074 // Special case switch statement to get formatting nice and correct...
1075 writeOperand(Operand , true); Out << ',';
1076 writeOperand(I.getOperand(1), true); Out << " [";
1078 for (unsigned op = 2, Eop = I.getNumOperands(); op < Eop; op += 2) {
1080 writeOperand(I.getOperand(op ), true); Out << ',';
1081 writeOperand(I.getOperand(op+1), true);
1084 } else if (isa<PHINode>(I)) {
1086 printType(I.getType());
1089 for (unsigned op = 0, Eop = I.getNumOperands(); op < Eop; op += 2) {
1090 if (op) Out << ", ";
1092 writeOperand(I.getOperand(op ), false); Out << ',';
1093 writeOperand(I.getOperand(op+1), false); Out << " ]";
1095 } else if (isa<ReturnInst>(I) && !Operand) {
1097 } else if (const CallInst *CI = dyn_cast<CallInst>(&I)) {
1098 // Print the calling convention being used.
1099 switch (CI->getCallingConv()) {
1100 case CallingConv::C: break; // default
1101 case CallingConv::Fast: Out << " fastcc"; break;
1102 case CallingConv::Cold: Out << " coldcc"; break;
1103 default: Out << " cc" << CI->getCallingConv(); break;
1106 const PointerType *PTy = cast<PointerType>(Operand->getType());
1107 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1108 const Type *RetTy = FTy->getReturnType();
1110 // If possible, print out the short form of the call instruction. We can
1111 // only do this if the first argument is a pointer to a nonvararg function,
1112 // and if the return type is not a pointer to a function.
1114 if (!FTy->isVarArg() &&
1115 (!isa<PointerType>(RetTy) ||
1116 !isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
1117 Out << ' '; printType(RetTy);
1118 writeOperand(Operand, false);
1120 writeOperand(Operand, true);
1123 if (CI->getNumOperands() > 1) writeOperand(CI->getOperand(1), true);
1124 for (unsigned op = 2, Eop = I.getNumOperands(); op < Eop; ++op) {
1126 writeOperand(I.getOperand(op), true);
1130 } else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
1131 const PointerType *PTy = cast<PointerType>(Operand->getType());
1132 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1133 const Type *RetTy = FTy->getReturnType();
1135 // Print the calling convention being used.
1136 switch (II->getCallingConv()) {
1137 case CallingConv::C: break; // default
1138 case CallingConv::Fast: Out << " fastcc"; break;
1139 case CallingConv::Cold: Out << " coldcc"; break;
1140 default: Out << " cc" << II->getCallingConv(); break;
1143 // If possible, print out the short form of the invoke instruction. We can
1144 // only do this if the first argument is a pointer to a nonvararg function,
1145 // and if the return type is not a pointer to a function.
1147 if (!FTy->isVarArg() &&
1148 (!isa<PointerType>(RetTy) ||
1149 !isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
1150 Out << ' '; printType(RetTy);
1151 writeOperand(Operand, false);
1153 writeOperand(Operand, true);
1157 if (I.getNumOperands() > 3) writeOperand(I.getOperand(3), true);
1158 for (unsigned op = 4, Eop = I.getNumOperands(); op < Eop; ++op) {
1160 writeOperand(I.getOperand(op), true);
1163 Out << " )\n\t\t\tto";
1164 writeOperand(II->getNormalDest(), true);
1166 writeOperand(II->getUnwindDest(), true);
1168 } else if (const AllocationInst *AI = dyn_cast<AllocationInst>(&I)) {
1170 printType(AI->getType()->getElementType());
1171 if (AI->isArrayAllocation()) {
1173 writeOperand(AI->getArraySize(), true);
1175 } else if (isa<CastInst>(I)) {
1176 if (Operand) writeOperand(Operand, true); // Work with broken code
1178 printType(I.getType());
1179 } else if (isa<VAArgInst>(I)) {
1180 if (Operand) writeOperand(Operand, true); // Work with broken code
1182 printType(I.getType());
1183 } else if (Operand) { // Print the normal way...
1185 // PrintAllTypes - Instructions who have operands of all the same type
1186 // omit the type from all but the first operand. If the instruction has
1187 // different type operands (for example br), then they are all printed.
1188 bool PrintAllTypes = false;
1189 const Type *TheType = Operand->getType();
1191 // Shift Left & Right print both types even for Ubyte LHS, and select prints
1192 // types even if all operands are bools.
1193 if (isa<ShiftInst>(I) || isa<SelectInst>(I) || isa<StoreInst>(I)) {
1194 PrintAllTypes = true;
1196 for (unsigned i = 1, E = I.getNumOperands(); i != E; ++i) {
1197 Operand = I.getOperand(i);
1198 if (Operand->getType() != TheType) {
1199 PrintAllTypes = true; // We have differing types! Print them all!
1205 if (!PrintAllTypes) {
1210 for (unsigned i = 0, E = I.getNumOperands(); i != E; ++i) {
1212 writeOperand(I.getOperand(i), PrintAllTypes);
1216 printInfoComment(I);
1221 //===----------------------------------------------------------------------===//
1222 // External Interface declarations
1223 //===----------------------------------------------------------------------===//
1225 void Module::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1226 SlotMachine SlotTable(this);
1227 AssemblyWriter W(o, SlotTable, this, AAW);
1231 void GlobalVariable::print(std::ostream &o) const {
1232 SlotMachine SlotTable(getParent());
1233 AssemblyWriter W(o, SlotTable, getParent(), 0);
1237 void Function::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1238 SlotMachine SlotTable(getParent());
1239 AssemblyWriter W(o, SlotTable, getParent(), AAW);
1244 void BasicBlock::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1245 SlotMachine SlotTable(getParent());
1246 AssemblyWriter W(o, SlotTable,
1247 getParent() ? getParent()->getParent() : 0, AAW);
1251 void Instruction::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
1252 const Function *F = getParent() ? getParent()->getParent() : 0;
1253 SlotMachine SlotTable(F);
1254 AssemblyWriter W(o, SlotTable, F ? F->getParent() : 0, AAW);
1259 void Constant::print(std::ostream &o) const {
1260 if (this == 0) { o << "<null> constant value\n"; return; }
1262 o << ' ' << getType()->getDescription() << ' ';
1264 std::map<const Type *, std::string> TypeTable;
1265 WriteConstantInt(o, this, false, TypeTable, 0);
1268 void Type::print(std::ostream &o) const {
1272 o << getDescription();
1275 void Argument::print(std::ostream &o) const {
1276 WriteAsOperand(o, this, true, true,
1277 getParent() ? getParent()->getParent() : 0);
1280 // Value::dump - allow easy printing of Values from the debugger.
1281 // Located here because so much of the needed functionality is here.
1282 void Value::dump() const { print(std::cerr); }
1284 // Type::dump - allow easy printing of Values from the debugger.
1285 // Located here because so much of the needed functionality is here.
1286 void Type::dump() const { print(std::cerr); }
1288 //===----------------------------------------------------------------------===//
1289 // CachedWriter Class Implementation
1290 //===----------------------------------------------------------------------===//
1292 void CachedWriter::setModule(const Module *M) {
1293 delete SC; delete AW;
1295 SC = new SlotMachine(M );
1296 AW = new AssemblyWriter(Out, *SC, M, 0);
1302 CachedWriter::~CachedWriter() {
1307 CachedWriter &CachedWriter::operator<<(const Value &V) {
1308 assert(AW && SC && "CachedWriter does not have a current module!");
1309 if (const Instruction *I = dyn_cast<Instruction>(&V))
1311 else if (const BasicBlock *BB = dyn_cast<BasicBlock>(&V))
1313 else if (const Function *F = dyn_cast<Function>(&V))
1315 else if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(&V))
1318 AW->writeOperand(&V, true, true);
1322 CachedWriter& CachedWriter::operator<<(const Type &Ty) {
1323 if (SymbolicTypes) {
1324 const Module *M = AW->getModule();
1325 if (M) WriteTypeSymbolic(Out, &Ty, M);
1332 //===----------------------------------------------------------------------===//
1333 //===-- SlotMachine Implementation
1334 //===----------------------------------------------------------------------===//
1337 #define SC_DEBUG(X) std::cerr << X
1342 // Module level constructor. Causes the contents of the Module (sans functions)
1343 // to be added to the slot table.
1344 SlotMachine::SlotMachine(const Module *M)
1345 : TheModule(M) ///< Saved for lazy initialization.
1347 , FunctionProcessed(false)
1355 // Function level constructor. Causes the contents of the Module and the one
1356 // function provided to be added to the slot table.
1357 SlotMachine::SlotMachine(const Function *F )
1358 : TheModule( F ? F->getParent() : 0 ) ///< Saved for lazy initialization
1359 , TheFunction(F) ///< Saved for lazy initialization
1360 , FunctionProcessed(false)
1368 inline void SlotMachine::initialize(void) {
1371 TheModule = 0; ///< Prevent re-processing next time we're called.
1373 if ( TheFunction && ! FunctionProcessed) {
1378 // Iterate through all the global variables, functions, and global
1379 // variable initializers and create slots for them.
1380 void SlotMachine::processModule() {
1381 SC_DEBUG("begin processModule!\n");
1383 // Add all of the global variables to the value table...
1384 for (Module::const_global_iterator I = TheModule->global_begin(), E = TheModule->global_end();
1388 // Add all the functions to the table
1389 for (Module::const_iterator I = TheModule->begin(), E = TheModule->end();
1393 SC_DEBUG("end processModule!\n");
1397 // Process the arguments, basic blocks, and instructions of a function.
1398 void SlotMachine::processFunction() {
1399 SC_DEBUG("begin processFunction!\n");
1401 // Add all the function arguments
1402 for(Function::const_arg_iterator AI = TheFunction->arg_begin(),
1403 AE = TheFunction->arg_end(); AI != AE; ++AI)
1406 SC_DEBUG("Inserting Instructions:\n");
1408 // Add all of the basic blocks and instructions
1409 for (Function::const_iterator BB = TheFunction->begin(),
1410 E = TheFunction->end(); BB != E; ++BB) {
1412 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) {
1417 FunctionProcessed = true;
1419 SC_DEBUG("end processFunction!\n");
1422 // Clean up after incorporating a function. This is the only way
1423 // to get out of the function incorporation state that affects the
1424 // getSlot/createSlot lock. Function incorporation state is indicated
1425 // by TheFunction != 0.
1426 void SlotMachine::purgeFunction() {
1427 SC_DEBUG("begin purgeFunction!\n");
1428 fMap.clear(); // Simply discard the function level map
1431 FunctionProcessed = false;
1432 SC_DEBUG("end purgeFunction!\n");
1435 /// Get the slot number for a value. This function will assert if you
1436 /// ask for a Value that hasn't previously been inserted with createSlot.
1437 /// Types are forbidden because Type does not inherit from Value (any more).
1438 int SlotMachine::getSlot(const Value *V) {
1439 assert( V && "Can't get slot for null Value" );
1440 assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
1441 "Can't insert a non-GlobalValue Constant into SlotMachine");
1443 // Check for uninitialized state and do lazy initialization
1446 // Get the type of the value
1447 const Type* VTy = V->getType();
1449 // Find the type plane in the module map
1450 TypedPlanes::const_iterator MI = mMap.find(VTy);
1452 if ( TheFunction ) {
1453 // Lookup the type in the function map too
1454 TypedPlanes::const_iterator FI = fMap.find(VTy);
1455 // If there is a corresponding type plane in the function map
1456 if ( FI != fMap.end() ) {
1457 // Lookup the Value in the function map
1458 ValueMap::const_iterator FVI = FI->second.map.find(V);
1459 // If the value doesn't exist in the function map
1460 if ( FVI == FI->second.map.end() ) {
1461 // Look up the value in the module map.
1462 if (MI == mMap.end()) return -1;
1463 ValueMap::const_iterator MVI = MI->second.map.find(V);
1464 // If we didn't find it, it wasn't inserted
1465 if (MVI == MI->second.map.end()) return -1;
1466 assert( MVI != MI->second.map.end() && "Value not found");
1467 // We found it only at the module level
1470 // else the value exists in the function map
1472 // Return the slot number as the module's contribution to
1473 // the type plane plus the index in the function's contribution
1474 // to the type plane.
1475 if (MI != mMap.end())
1476 return MI->second.next_slot + FVI->second;
1483 // N.B. Can get here only if either !TheFunction or the function doesn't
1484 // have a corresponding type plane for the Value
1486 // Make sure the type plane exists
1487 if (MI == mMap.end()) return -1;
1488 // Lookup the value in the module's map
1489 ValueMap::const_iterator MVI = MI->second.map.find(V);
1490 // Make sure we found it.
1491 if (MVI == MI->second.map.end()) return -1;
1496 /// Get the slot number for a value. This function will assert if you
1497 /// ask for a Value that hasn't previously been inserted with createSlot.
1498 /// Types are forbidden because Type does not inherit from Value (any more).
1499 int SlotMachine::getSlot(const Type *Ty) {
1500 assert( Ty && "Can't get slot for null Type" );
1502 // Check for uninitialized state and do lazy initialization
1505 if ( TheFunction ) {
1506 // Lookup the Type in the function map
1507 TypeMap::const_iterator FTI = fTypes.map.find(Ty);
1508 // If the Type doesn't exist in the function map
1509 if ( FTI == fTypes.map.end() ) {
1510 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1511 // If we didn't find it, it wasn't inserted
1512 if (MTI == mTypes.map.end())
1514 // We found it only at the module level
1517 // else the value exists in the function map
1519 // Return the slot number as the module's contribution to
1520 // the type plane plus the index in the function's contribution
1521 // to the type plane.
1522 return mTypes.next_slot + FTI->second;
1526 // N.B. Can get here only if either !TheFunction
1528 // Lookup the value in the module's map
1529 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1530 // Make sure we found it.
1531 if (MTI == mTypes.map.end()) return -1;
1536 // Create a new slot, or return the existing slot if it is already
1537 // inserted. Note that the logic here parallels getSlot but instead
1538 // of asserting when the Value* isn't found, it inserts the value.
1539 unsigned SlotMachine::createSlot(const Value *V) {
1540 assert( V && "Can't insert a null Value to SlotMachine");
1541 assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
1542 "Can't insert a non-GlobalValue Constant into SlotMachine");
1544 const Type* VTy = V->getType();
1546 // Just ignore void typed things
1547 if (VTy == Type::VoidTy) return 0; // FIXME: Wrong return value!
1549 // Look up the type plane for the Value's type from the module map
1550 TypedPlanes::const_iterator MI = mMap.find(VTy);
1552 if ( TheFunction ) {
1553 // Get the type plane for the Value's type from the function map
1554 TypedPlanes::const_iterator FI = fMap.find(VTy);
1555 // If there is a corresponding type plane in the function map
1556 if ( FI != fMap.end() ) {
1557 // Lookup the Value in the function map
1558 ValueMap::const_iterator FVI = FI->second.map.find(V);
1559 // If the value doesn't exist in the function map
1560 if ( FVI == FI->second.map.end() ) {
1561 // If there is no corresponding type plane in the module map
1562 if ( MI == mMap.end() )
1563 return insertValue(V);
1564 // Look up the value in the module map
1565 ValueMap::const_iterator MVI = MI->second.map.find(V);
1566 // If we didn't find it, it wasn't inserted
1567 if ( MVI == MI->second.map.end() )
1568 return insertValue(V);
1570 // We found it only at the module level
1573 // else the value exists in the function map
1575 if ( MI == mMap.end() )
1578 // Return the slot number as the module's contribution to
1579 // the type plane plus the index in the function's contribution
1580 // to the type plane.
1581 return MI->second.next_slot + FVI->second;
1584 // else there is not a corresponding type plane in the function map
1586 // If the type plane doesn't exists at the module level
1587 if ( MI == mMap.end() ) {
1588 return insertValue(V);
1589 // else type plane exists at the module level, examine it
1591 // Look up the value in the module's map
1592 ValueMap::const_iterator MVI = MI->second.map.find(V);
1593 // If we didn't find it there either
1594 if ( MVI == MI->second.map.end() )
1595 // Return the slot number as the module's contribution to
1596 // the type plane plus the index of the function map insertion.
1597 return MI->second.next_slot + insertValue(V);
1604 // N.B. Can only get here if !TheFunction
1606 // If the module map's type plane is not for the Value's type
1607 if ( MI != mMap.end() ) {
1608 // Lookup the value in the module's map
1609 ValueMap::const_iterator MVI = MI->second.map.find(V);
1610 if ( MVI != MI->second.map.end() )
1614 return insertValue(V);
1617 // Create a new slot, or return the existing slot if it is already
1618 // inserted. Note that the logic here parallels getSlot but instead
1619 // of asserting when the Value* isn't found, it inserts the value.
1620 unsigned SlotMachine::createSlot(const Type *Ty) {
1621 assert( Ty && "Can't insert a null Type to SlotMachine");
1623 if ( TheFunction ) {
1624 // Lookup the Type in the function map
1625 TypeMap::const_iterator FTI = fTypes.map.find(Ty);
1626 // If the type doesn't exist in the function map
1627 if ( FTI == fTypes.map.end() ) {
1628 // Look up the type in the module map
1629 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1630 // If we didn't find it, it wasn't inserted
1631 if ( MTI == mTypes.map.end() )
1632 return insertValue(Ty);
1634 // We found it only at the module level
1637 // else the value exists in the function map
1639 // Return the slot number as the module's contribution to
1640 // the type plane plus the index in the function's contribution
1641 // to the type plane.
1642 return mTypes.next_slot + FTI->second;
1646 // N.B. Can only get here if !TheFunction
1648 // Lookup the type in the module's map
1649 TypeMap::const_iterator MTI = mTypes.map.find(Ty);
1650 if ( MTI != mTypes.map.end() )
1653 return insertValue(Ty);
1656 // Low level insert function. Minimal checking is done. This
1657 // function is just for the convenience of createSlot (above).
1658 unsigned SlotMachine::insertValue(const Value *V ) {
1659 assert(V && "Can't insert a null Value into SlotMachine!");
1660 assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
1661 "Can't insert a non-GlobalValue Constant into SlotMachine");
1663 // If this value does not contribute to a plane (is void)
1664 // or if the value already has a name then ignore it.
1665 if (V->getType() == Type::VoidTy || V->hasName() ) {
1666 SC_DEBUG("ignored value " << *V << "\n");
1667 return 0; // FIXME: Wrong return value
1670 const Type *VTy = V->getType();
1671 unsigned DestSlot = 0;
1673 if ( TheFunction ) {
1674 TypedPlanes::iterator I = fMap.find( VTy );
1675 if ( I == fMap.end() )
1676 I = fMap.insert(std::make_pair(VTy,ValuePlane())).first;
1677 DestSlot = I->second.map[V] = I->second.next_slot++;
1679 TypedPlanes::iterator I = mMap.find( VTy );
1680 if ( I == mMap.end() )
1681 I = mMap.insert(std::make_pair(VTy,ValuePlane())).first;
1682 DestSlot = I->second.map[V] = I->second.next_slot++;
1685 SC_DEBUG(" Inserting value [" << VTy << "] = " << V << " slot=" <<
1687 // G = Global, C = Constant, T = Type, F = Function, o = other
1688 SC_DEBUG((isa<GlobalVariable>(V) ? 'G' : (isa<Function>(V) ? 'F' :
1689 (isa<Constant>(V) ? 'C' : 'o'))));
1694 // Low level insert function. Minimal checking is done. This
1695 // function is just for the convenience of createSlot (above).
1696 unsigned SlotMachine::insertValue(const Type *Ty ) {
1697 assert(Ty && "Can't insert a null Type into SlotMachine!");
1699 unsigned DestSlot = 0;
1701 if ( TheFunction ) {
1702 DestSlot = fTypes.map[Ty] = fTypes.next_slot++;
1704 DestSlot = fTypes.map[Ty] = fTypes.next_slot++;
1706 SC_DEBUG(" Inserting type [" << DestSlot << "] = " << Ty << "\n");