2002-04-07 22:31:46 +00:00
|
|
|
//===-- AsmWriter.cpp - Printing LLVM as an assembly file -----------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
// This library implements the functionality defined in llvm/Assembly/Writer.h
|
|
|
|
//
|
2002-04-12 18:21:53 +00:00
|
|
|
// Note that these routines must be extremely tolerant of various errors in the
|
2003-05-08 02:44:12 +00:00
|
|
|
// LLVM code, because it can be used for debugging transformations.
|
2002-04-12 18:21:53 +00:00
|
|
|
//
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-04-08 22:03:40 +00:00
|
|
|
#include "llvm/Assembly/Writer.h"
|
2002-07-23 18:07:49 +00:00
|
|
|
#include "llvm/Assembly/PrintModulePass.h"
|
2003-10-30 23:41:03 +00:00
|
|
|
#include "llvm/Assembly/AsmAnnotationWriter.h"
|
2005-05-06 20:26:43 +00:00
|
|
|
#include "llvm/CallingConv.h"
|
2004-01-20 19:50:34 +00:00
|
|
|
#include "llvm/Constants.h"
|
2002-04-29 18:46:50 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2008-02-22 22:17:59 +00:00
|
|
|
#include "llvm/ParamAttrsList.h"
|
2006-01-25 18:57:27 +00:00
|
|
|
#include "llvm/InlineAsm.h"
|
2002-07-14 23:14:45 +00:00
|
|
|
#include "llvm/Instruction.h"
|
2004-07-29 16:53:53 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2004-01-20 19:50:34 +00:00
|
|
|
#include "llvm/Module.h"
|
2007-02-05 20:47:22 +00:00
|
|
|
#include "llvm/ValueSymbolTable.h"
|
2007-01-06 07:24:44 +00:00
|
|
|
#include "llvm/TypeSymbolTable.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2006-11-28 02:09:03 +00:00
|
|
|
#include "llvm/Support/CFG.h"
|
2005-08-17 19:34:49 +00:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2006-11-28 02:09:03 +00:00
|
|
|
#include "llvm/Support/Streams.h"
|
2001-09-07 16:36:04 +00:00
|
|
|
#include <algorithm>
|
2007-05-22 19:27:35 +00:00
|
|
|
#include <cctype>
|
2003-11-21 20:23:48 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2004-07-15 02:51:31 +00:00
|
|
|
namespace llvm {
|
2004-05-26 07:18:52 +00:00
|
|
|
|
2005-05-15 16:13:11 +00:00
|
|
|
// Make virtual table appear in this compilation unit.
|
|
|
|
AssemblyAnnotationWriter::~AssemblyAnnotationWriter() {}
|
|
|
|
|
2004-05-26 07:18:52 +00:00
|
|
|
/// This class provides computation of slot numbers for LLVM Assembly writing.
|
|
|
|
/// @brief LLVM Assembly Writing Slot Computation.
|
|
|
|
class SlotMachine {
|
|
|
|
|
|
|
|
/// @name Types
|
|
|
|
/// @{
|
|
|
|
public:
|
|
|
|
|
|
|
|
/// @brief A mapping of Values to slot numbers
|
2007-03-19 18:32:53 +00:00
|
|
|
typedef std::map<const Value*,unsigned> ValueMap;
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
/// @}
|
|
|
|
/// @name Constructors
|
|
|
|
/// @{
|
|
|
|
public:
|
|
|
|
/// @brief Construct from a module
|
2008-01-29 11:36:12 +00:00
|
|
|
explicit SlotMachine(const Module *M);
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
/// @brief Construct from a function, starting out in incorp state.
|
2008-01-29 11:36:12 +00:00
|
|
|
explicit SlotMachine(const Function *F);
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
/// @}
|
|
|
|
/// @name Accessors
|
|
|
|
/// @{
|
|
|
|
public:
|
|
|
|
/// Return the slot number of the specified value in it's type
|
2007-01-11 03:54:27 +00:00
|
|
|
/// plane. If something is not in the SlotMachine, return -1.
|
|
|
|
int getLocalSlot(const Value *V);
|
|
|
|
int getGlobalSlot(const GlobalValue *V);
|
2004-06-09 15:26:53 +00:00
|
|
|
|
2004-05-26 07:18:52 +00:00
|
|
|
/// @}
|
|
|
|
/// @name Mutators
|
|
|
|
/// @{
|
|
|
|
public:
|
2005-04-21 23:48:37 +00:00
|
|
|
/// If you'd like to deal with a function instead of just a module, use
|
2004-05-26 07:18:52 +00:00
|
|
|
/// this method to get its data into the SlotMachine.
|
2005-04-21 23:48:37 +00:00
|
|
|
void incorporateFunction(const Function *F) {
|
|
|
|
TheFunction = F;
|
2004-08-16 07:46:33 +00:00
|
|
|
FunctionProcessed = false;
|
|
|
|
}
|
2004-05-26 07:18:52 +00:00
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
/// After calling incorporateFunction, use this method to remove the
|
|
|
|
/// most recently incorporated function from the SlotMachine. This
|
2004-05-26 07:18:52 +00:00
|
|
|
/// will reset the state of the machine back to just the module contents.
|
|
|
|
void purgeFunction();
|
|
|
|
|
|
|
|
/// @}
|
|
|
|
/// @name Implementation Details
|
|
|
|
/// @{
|
|
|
|
private:
|
2004-05-26 21:56:09 +00:00
|
|
|
/// This function does the actual initialization.
|
|
|
|
inline void initialize();
|
|
|
|
|
2007-01-09 07:55:49 +00:00
|
|
|
/// CreateModuleSlot - Insert the specified GlobalValue* into the slot table.
|
|
|
|
void CreateModuleSlot(const GlobalValue *V);
|
|
|
|
|
|
|
|
/// CreateFunctionSlot - Insert the specified Value* into the slot table.
|
|
|
|
void CreateFunctionSlot(const Value *V);
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
/// Add all of the module level global variables (and their initializers)
|
|
|
|
/// and function declarations, but not the contents of those functions.
|
|
|
|
void processModule();
|
|
|
|
|
2004-05-26 21:56:09 +00:00
|
|
|
/// Add all of the functions arguments, basic blocks, and instructions
|
|
|
|
void processFunction();
|
|
|
|
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine(const SlotMachine &); // DO NOT IMPLEMENT
|
|
|
|
void operator=(const SlotMachine &); // DO NOT IMPLEMENT
|
|
|
|
|
|
|
|
/// @}
|
|
|
|
/// @name Data
|
|
|
|
/// @{
|
|
|
|
public:
|
|
|
|
|
|
|
|
/// @brief The module for which we are holding slot numbers
|
2004-05-26 21:56:09 +00:00
|
|
|
const Module* TheModule;
|
2004-05-26 07:18:52 +00:00
|
|
|
|
2004-05-26 21:56:09 +00:00
|
|
|
/// @brief The function for which we are holding slot numbers
|
|
|
|
const Function* TheFunction;
|
2004-08-16 07:46:33 +00:00
|
|
|
bool FunctionProcessed;
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
/// @brief The TypePlanes map for the module level data
|
2007-03-19 18:32:53 +00:00
|
|
|
ValueMap mMap;
|
|
|
|
unsigned mNext;
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
/// @brief The TypePlanes map for the function level data
|
2007-03-19 18:32:53 +00:00
|
|
|
ValueMap fMap;
|
|
|
|
unsigned fNext;
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
/// @}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
2004-07-15 02:51:31 +00:00
|
|
|
} // end namespace llvm
|
2004-05-26 07:18:52 +00:00
|
|
|
|
2007-05-03 01:11:54 +00:00
|
|
|
char PrintModulePass::ID = 0;
|
2006-08-27 22:42:52 +00:00
|
|
|
static RegisterPass<PrintModulePass>
|
2006-08-21 17:20:01 +00:00
|
|
|
X("printm", "Print module to stderr");
|
2007-05-03 01:11:54 +00:00
|
|
|
char PrintFunctionPass::ID = 0;
|
2006-08-27 22:42:52 +00:00
|
|
|
static RegisterPass<PrintFunctionPass>
|
2006-08-21 17:20:01 +00:00
|
|
|
Y("print","Print function to stderr");
|
2002-07-23 18:07:49 +00:00
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
static void WriteAsOperandInternal(std::ostream &Out, const Value *V,
|
2006-12-06 05:50:41 +00:00
|
|
|
std::map<const Type *, std::string> &TypeTable,
|
2004-07-04 11:50:43 +00:00
|
|
|
SlotMachine *Machine);
|
|
|
|
|
2001-10-29 16:37:48 +00:00
|
|
|
static const Module *getModuleFromVal(const Value *V) {
|
2003-07-23 15:30:06 +00:00
|
|
|
if (const Argument *MA = dyn_cast<Argument>(V))
|
2001-10-29 16:37:48 +00:00
|
|
|
return MA->getParent() ? MA->getParent()->getParent() : 0;
|
2003-07-23 15:30:06 +00:00
|
|
|
else if (const BasicBlock *BB = dyn_cast<BasicBlock>(V))
|
2001-10-29 16:37:48 +00:00
|
|
|
return BB->getParent() ? BB->getParent()->getParent() : 0;
|
2003-07-23 15:30:06 +00:00
|
|
|
else if (const Instruction *I = dyn_cast<Instruction>(V)) {
|
2002-03-26 18:01:55 +00:00
|
|
|
const Function *M = I->getParent() ? I->getParent()->getParent() : 0;
|
2001-10-29 16:37:48 +00:00
|
|
|
return M ? M->getParent() : 0;
|
2003-07-23 15:30:06 +00:00
|
|
|
} else if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))
|
2001-10-29 16:37:48 +00:00
|
|
|
return GV->getParent();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-05-26 07:18:52 +00:00
|
|
|
static SlotMachine *createSlotMachine(const Value *V) {
|
2003-07-23 15:30:06 +00:00
|
|
|
if (const Argument *FA = dyn_cast<Argument>(V)) {
|
2004-05-26 07:18:52 +00:00
|
|
|
return new SlotMachine(FA->getParent());
|
2003-07-23 15:30:06 +00:00
|
|
|
} else if (const Instruction *I = dyn_cast<Instruction>(V)) {
|
2004-05-26 07:18:52 +00:00
|
|
|
return new SlotMachine(I->getParent()->getParent());
|
2003-07-23 15:30:06 +00:00
|
|
|
} else if (const BasicBlock *BB = dyn_cast<BasicBlock>(V)) {
|
2004-05-26 07:18:52 +00:00
|
|
|
return new SlotMachine(BB->getParent());
|
2003-07-23 15:30:06 +00:00
|
|
|
} else if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V)){
|
2004-05-26 07:18:52 +00:00
|
|
|
return new SlotMachine(GV->getParent());
|
2007-04-25 14:27:10 +00:00
|
|
|
} else if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(V)){
|
|
|
|
return new SlotMachine(GA->getParent());
|
2003-07-23 15:30:06 +00:00
|
|
|
} else if (const Function *Func = dyn_cast<Function>(V)) {
|
2004-05-26 07:18:52 +00:00
|
|
|
return new SlotMachine(Func);
|
2001-10-29 16:05:51 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2007-01-26 08:02:52 +00:00
|
|
|
/// NameNeedsQuotes - Return true if the specified llvm name should be wrapped
|
|
|
|
/// with ""'s.
|
2007-05-22 19:27:35 +00:00
|
|
|
static std::string QuoteNameIfNeeded(const std::string &Name) {
|
|
|
|
std::string result;
|
|
|
|
bool needsQuotes = Name[0] >= '0' && Name[0] <= '9';
|
|
|
|
// Scan the name to see if it needs quotes and to replace funky chars with
|
|
|
|
// their octal equivalent.
|
2003-08-22 05:40:38 +00:00
|
|
|
for (unsigned i = 0, e = Name.size(); i != e; ++i) {
|
|
|
|
char C = Name[i];
|
|
|
|
assert(C != '"' && "Illegal character in LLVM value name!");
|
2007-05-22 19:27:35 +00:00
|
|
|
if (isalnum(C) || C == '-' || C == '.' || C == '_')
|
|
|
|
result += C;
|
|
|
|
else if (C == '\\') {
|
|
|
|
needsQuotes = true;
|
|
|
|
result += "\\\\";
|
|
|
|
} else if (isprint(C)) {
|
|
|
|
needsQuotes = true;
|
|
|
|
result += C;
|
|
|
|
} else {
|
|
|
|
needsQuotes = true;
|
|
|
|
result += "\\";
|
|
|
|
char hex1 = (C >> 4) & 0x0F;
|
|
|
|
if (hex1 < 10)
|
|
|
|
result += hex1 + '0';
|
|
|
|
else
|
|
|
|
result += hex1 - 10 + 'A';
|
|
|
|
char hex2 = C & 0x0F;
|
|
|
|
if (hex2 < 10)
|
|
|
|
result += hex2 + '0';
|
|
|
|
else
|
|
|
|
result += hex2 - 10 + 'A';
|
|
|
|
}
|
2007-01-26 08:02:52 +00:00
|
|
|
}
|
2007-05-22 19:27:35 +00:00
|
|
|
if (needsQuotes) {
|
|
|
|
result.insert(0,"\"");
|
|
|
|
result += '"';
|
|
|
|
}
|
|
|
|
return result;
|
2007-01-26 08:02:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
enum PrefixType {
|
|
|
|
GlobalPrefix,
|
|
|
|
LabelPrefix,
|
|
|
|
LocalPrefix
|
|
|
|
};
|
|
|
|
|
|
|
|
/// getLLVMName - Turn the specified string into an 'LLVM name', which is either
|
|
|
|
/// prefixed with % (if the string only contains simple characters) or is
|
|
|
|
/// surrounded with ""'s (if it has special chars in it).
|
|
|
|
static std::string getLLVMName(const std::string &Name, PrefixType Prefix) {
|
|
|
|
assert(!Name.empty() && "Cannot get empty name!");
|
|
|
|
switch (Prefix) {
|
|
|
|
default: assert(0 && "Bad prefix!");
|
2007-05-22 19:27:35 +00:00
|
|
|
case GlobalPrefix: return '@' + QuoteNameIfNeeded(Name);
|
|
|
|
case LabelPrefix: return QuoteNameIfNeeded(Name);
|
|
|
|
case LocalPrefix: return '%' + QuoteNameIfNeeded(Name);
|
2007-01-26 08:02:52 +00:00
|
|
|
}
|
2003-08-22 05:40:38 +00:00
|
|
|
}
|
|
|
|
|
2001-10-29 16:37:48 +00:00
|
|
|
|
2004-03-02 00:22:19 +00:00
|
|
|
/// fillTypeNameTable - If the module has a symbol table, take all global types
|
|
|
|
/// and stuff their names into the TypeNames map.
|
|
|
|
///
|
2001-10-29 16:37:48 +00:00
|
|
|
static void fillTypeNameTable(const Module *M,
|
2003-05-08 02:08:14 +00:00
|
|
|
std::map<const Type *, std::string> &TypeNames) {
|
2002-11-20 18:36:02 +00:00
|
|
|
if (!M) return;
|
2007-01-06 07:24:44 +00:00
|
|
|
const TypeSymbolTable &ST = M->getTypeSymbolTable();
|
|
|
|
TypeSymbolTable::const_iterator TI = ST.begin();
|
|
|
|
for (; TI != ST.end(); ++TI) {
|
2004-05-25 08:53:40 +00:00
|
|
|
// As a heuristic, don't insert pointer to primitive types, because
|
|
|
|
// they are used too often to have a single useful name.
|
|
|
|
//
|
|
|
|
const Type *Ty = cast<Type>(TI->second);
|
|
|
|
if (!isa<PointerType>(Ty) ||
|
2004-05-26 21:56:09 +00:00
|
|
|
!cast<PointerType>(Ty)->getElementType()->isPrimitiveType() ||
|
2007-01-15 02:27:26 +00:00
|
|
|
!cast<PointerType>(Ty)->getElementType()->isInteger() ||
|
2004-05-26 21:56:09 +00:00
|
|
|
isa<OpaqueType>(cast<PointerType>(Ty)->getElementType()))
|
2007-01-26 08:02:52 +00:00
|
|
|
TypeNames.insert(std::make_pair(Ty, getLLVMName(TI->first, LocalPrefix)));
|
2001-10-29 16:37:48 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
static void calcTypeName(const Type *Ty,
|
2004-06-01 14:54:08 +00:00
|
|
|
std::vector<const Type *> &TypeStack,
|
|
|
|
std::map<const Type *, std::string> &TypeNames,
|
|
|
|
std::string & Result){
|
2007-01-15 02:27:26 +00:00
|
|
|
if (Ty->isInteger() || (Ty->isPrimitiveType() && !isa<OpaqueType>(Ty))) {
|
2004-06-01 14:54:08 +00:00
|
|
|
Result += Ty->getDescription(); // Base case
|
|
|
|
return;
|
|
|
|
}
|
2001-10-29 16:37:48 +00:00
|
|
|
|
|
|
|
// Check to see if the type is named.
|
2003-05-08 02:08:14 +00:00
|
|
|
std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
|
2004-06-01 14:54:08 +00:00
|
|
|
if (I != TypeNames.end()) {
|
|
|
|
Result += I->second;
|
|
|
|
return;
|
|
|
|
}
|
2001-10-29 16:37:48 +00:00
|
|
|
|
2004-06-01 14:54:08 +00:00
|
|
|
if (isa<OpaqueType>(Ty)) {
|
|
|
|
Result += "opaque";
|
|
|
|
return;
|
|
|
|
}
|
2003-10-30 00:22:33 +00:00
|
|
|
|
2001-10-29 16:37:48 +00:00
|
|
|
// Check to see if the Type is already on the stack...
|
|
|
|
unsigned Slot = 0, CurSize = TypeStack.size();
|
|
|
|
while (Slot < CurSize && TypeStack[Slot] != Ty) ++Slot; // Scan for type
|
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
// This is another base case for the recursion. In this case, we know
|
2001-10-29 16:37:48 +00:00
|
|
|
// that we have looped back to a type that we have previously visited.
|
|
|
|
// Generate the appropriate upreference to handle this.
|
2004-06-01 14:54:08 +00:00
|
|
|
if (Slot < CurSize) {
|
|
|
|
Result += "\\" + utostr(CurSize-Slot); // Here's the upreference
|
|
|
|
return;
|
|
|
|
}
|
2001-10-29 16:37:48 +00:00
|
|
|
|
|
|
|
TypeStack.push_back(Ty); // Recursive case: Add us to the stack..
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (Ty->getTypeID()) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
case Type::IntegerTyID: {
|
|
|
|
unsigned BitWidth = cast<IntegerType>(Ty)->getBitWidth();
|
2007-01-12 07:25:20 +00:00
|
|
|
Result += "i" + utostr(BitWidth);
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
break;
|
|
|
|
}
|
2002-03-29 03:44:36 +00:00
|
|
|
case Type::FunctionTyID: {
|
2003-07-23 15:30:06 +00:00
|
|
|
const FunctionType *FTy = cast<FunctionType>(Ty);
|
2004-06-01 14:54:08 +00:00
|
|
|
calcTypeName(FTy->getReturnType(), TypeStack, TypeNames, Result);
|
|
|
|
Result += " (";
|
2004-02-09 04:14:01 +00:00
|
|
|
for (FunctionType::param_iterator I = FTy->param_begin(),
|
2007-11-27 13:23:08 +00:00
|
|
|
E = FTy->param_end(); I != E; ++I) {
|
2004-02-09 04:14:01 +00:00
|
|
|
if (I != FTy->param_begin())
|
2001-10-29 16:37:48 +00:00
|
|
|
Result += ", ";
|
2004-06-01 14:54:08 +00:00
|
|
|
calcTypeName(*I, TypeStack, TypeNames, Result);
|
2001-10-29 16:37:48 +00:00
|
|
|
}
|
2002-04-13 20:53:41 +00:00
|
|
|
if (FTy->isVarArg()) {
|
2004-02-09 04:14:01 +00:00
|
|
|
if (FTy->getNumParams()) Result += ", ";
|
2001-10-29 16:37:48 +00:00
|
|
|
Result += "...";
|
|
|
|
}
|
|
|
|
Result += ")";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Type::StructTyID: {
|
2003-07-23 15:30:06 +00:00
|
|
|
const StructType *STy = cast<StructType>(Ty);
|
2006-12-08 18:06:16 +00:00
|
|
|
if (STy->isPacked())
|
|
|
|
Result += '<';
|
2004-06-01 14:54:08 +00:00
|
|
|
Result += "{ ";
|
2004-02-09 04:37:31 +00:00
|
|
|
for (StructType::element_iterator I = STy->element_begin(),
|
|
|
|
E = STy->element_end(); I != E; ++I) {
|
|
|
|
if (I != STy->element_begin())
|
2001-10-29 16:37:48 +00:00
|
|
|
Result += ", ";
|
2004-06-01 14:54:08 +00:00
|
|
|
calcTypeName(*I, TypeStack, TypeNames, Result);
|
2001-10-29 16:37:48 +00:00
|
|
|
}
|
|
|
|
Result += " }";
|
2006-12-08 18:06:16 +00:00
|
|
|
if (STy->isPacked())
|
|
|
|
Result += '>';
|
2001-10-29 16:37:48 +00:00
|
|
|
break;
|
|
|
|
}
|
2007-12-11 08:59:05 +00:00
|
|
|
case Type::PointerTyID: {
|
|
|
|
const PointerType *PTy = cast<PointerType>(Ty);
|
|
|
|
calcTypeName(PTy->getElementType(),
|
2004-06-01 14:54:08 +00:00
|
|
|
TypeStack, TypeNames, Result);
|
2007-12-11 08:59:05 +00:00
|
|
|
if (unsigned AddressSpace = PTy->getAddressSpace())
|
|
|
|
Result += " addrspace(" + utostr(AddressSpace) + ")";
|
2004-06-01 14:54:08 +00:00
|
|
|
Result += "*";
|
2001-10-29 16:37:48 +00:00
|
|
|
break;
|
2007-12-11 08:59:05 +00:00
|
|
|
}
|
2001-10-29 16:37:48 +00:00
|
|
|
case Type::ArrayTyID: {
|
2003-07-23 15:30:06 +00:00
|
|
|
const ArrayType *ATy = cast<ArrayType>(Ty);
|
2004-06-01 14:54:08 +00:00
|
|
|
Result += "[" + utostr(ATy->getNumElements()) + " x ";
|
|
|
|
calcTypeName(ATy->getElementType(), TypeStack, TypeNames, Result);
|
|
|
|
Result += "]";
|
2001-10-29 16:37:48 +00:00
|
|
|
break;
|
|
|
|
}
|
2007-02-15 02:26:10 +00:00
|
|
|
case Type::VectorTyID: {
|
|
|
|
const VectorType *PTy = cast<VectorType>(Ty);
|
2004-08-20 06:00:58 +00:00
|
|
|
Result += "<" + utostr(PTy->getNumElements()) + " x ";
|
|
|
|
calcTypeName(PTy->getElementType(), TypeStack, TypeNames, Result);
|
|
|
|
Result += ">";
|
|
|
|
break;
|
|
|
|
}
|
2003-05-14 17:50:47 +00:00
|
|
|
case Type::OpaqueTyID:
|
2004-06-01 14:54:08 +00:00
|
|
|
Result += "opaque";
|
2003-05-14 17:50:47 +00:00
|
|
|
break;
|
2001-10-29 16:37:48 +00:00
|
|
|
default:
|
2004-06-01 14:54:08 +00:00
|
|
|
Result += "<unrecognized-type>";
|
2006-12-06 06:40:49 +00:00
|
|
|
break;
|
2001-10-29 16:37:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
TypeStack.pop_back(); // Remove self from stack...
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-03-01 19:48:13 +00:00
|
|
|
/// printTypeInt - The internal guts of printing out a type that has a
|
|
|
|
/// potentially named portion.
|
|
|
|
///
|
2003-05-08 02:08:14 +00:00
|
|
|
static std::ostream &printTypeInt(std::ostream &Out, const Type *Ty,
|
|
|
|
std::map<const Type *, std::string> &TypeNames) {
|
2001-10-29 16:37:48 +00:00
|
|
|
// Primitive types always print out their description, regardless of whether
|
|
|
|
// they have been named or not.
|
|
|
|
//
|
2007-01-15 02:27:26 +00:00
|
|
|
if (Ty->isInteger() || (Ty->isPrimitiveType() && !isa<OpaqueType>(Ty)))
|
2003-10-30 00:12:51 +00:00
|
|
|
return Out << Ty->getDescription();
|
2001-10-29 16:37:48 +00:00
|
|
|
|
|
|
|
// Check to see if the type is named.
|
2003-05-08 02:08:14 +00:00
|
|
|
std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
|
2001-10-29 16:37:48 +00:00
|
|
|
if (I != TypeNames.end()) return Out << I->second;
|
|
|
|
|
|
|
|
// Otherwise we have a type that has not been named but is a derived type.
|
|
|
|
// Carefully recurse the type hierarchy to print out any contained symbolic
|
|
|
|
// names.
|
|
|
|
//
|
2003-05-08 02:08:14 +00:00
|
|
|
std::vector<const Type *> TypeStack;
|
2004-06-01 14:54:08 +00:00
|
|
|
std::string TypeName;
|
|
|
|
calcTypeName(Ty, TypeStack, TypeNames, TypeName);
|
2002-01-20 22:54:45 +00:00
|
|
|
TypeNames.insert(std::make_pair(Ty, TypeName));//Cache type name for later use
|
2004-06-01 14:54:08 +00:00
|
|
|
return (Out << TypeName);
|
2001-10-29 16:37:48 +00:00
|
|
|
}
|
|
|
|
|
2001-10-31 04:33:19 +00:00
|
|
|
|
2004-03-01 19:48:13 +00:00
|
|
|
/// WriteTypeSymbolic - This attempts to write the specified type as a symbolic
|
|
|
|
/// type, iff there is an entry in the modules symbol table for the specified
|
|
|
|
/// type or one of it's component types. This is slower than a simple x << Type
|
|
|
|
///
|
2003-11-21 20:23:48 +00:00
|
|
|
std::ostream &llvm::WriteTypeSymbolic(std::ostream &Out, const Type *Ty,
|
|
|
|
const Module *M) {
|
2005-04-21 23:48:37 +00:00
|
|
|
Out << ' ';
|
2001-10-29 16:37:48 +00:00
|
|
|
|
2006-12-06 06:40:49 +00:00
|
|
|
// If they want us to print out a type, but there is no context, we can't
|
|
|
|
// print it symbolically.
|
|
|
|
if (!M)
|
2001-10-29 16:40:32 +00:00
|
|
|
return Out << Ty->getDescription();
|
2006-12-06 06:40:49 +00:00
|
|
|
|
|
|
|
std::map<const Type *, std::string> TypeNames;
|
|
|
|
fillTypeNameTable(M, TypeNames);
|
|
|
|
return printTypeInt(Out, Ty, TypeNames);
|
2001-10-29 16:37:48 +00:00
|
|
|
}
|
|
|
|
|
2006-01-23 23:03:36 +00:00
|
|
|
// PrintEscapedString - Print each character of the specified string, escaping
|
|
|
|
// it if it is not printable or if it is an escape char.
|
|
|
|
static void PrintEscapedString(const std::string &Str, std::ostream &Out) {
|
|
|
|
for (unsigned i = 0, e = Str.size(); i != e; ++i) {
|
|
|
|
unsigned char C = Str[i];
|
|
|
|
if (isprint(C) && C != '"' && C != '\\') {
|
|
|
|
Out << C;
|
|
|
|
} else {
|
|
|
|
Out << '\\'
|
|
|
|
<< (char) ((C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'))
|
|
|
|
<< (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-12-06 06:40:49 +00:00
|
|
|
static const char *getPredicateText(unsigned predicate) {
|
2006-12-04 05:19:18 +00:00
|
|
|
const char * pred = "unknown";
|
|
|
|
switch (predicate) {
|
|
|
|
case FCmpInst::FCMP_FALSE: pred = "false"; break;
|
|
|
|
case FCmpInst::FCMP_OEQ: pred = "oeq"; break;
|
|
|
|
case FCmpInst::FCMP_OGT: pred = "ogt"; break;
|
|
|
|
case FCmpInst::FCMP_OGE: pred = "oge"; break;
|
|
|
|
case FCmpInst::FCMP_OLT: pred = "olt"; break;
|
|
|
|
case FCmpInst::FCMP_OLE: pred = "ole"; break;
|
|
|
|
case FCmpInst::FCMP_ONE: pred = "one"; break;
|
|
|
|
case FCmpInst::FCMP_ORD: pred = "ord"; break;
|
|
|
|
case FCmpInst::FCMP_UNO: pred = "uno"; break;
|
|
|
|
case FCmpInst::FCMP_UEQ: pred = "ueq"; break;
|
|
|
|
case FCmpInst::FCMP_UGT: pred = "ugt"; break;
|
|
|
|
case FCmpInst::FCMP_UGE: pred = "uge"; break;
|
|
|
|
case FCmpInst::FCMP_ULT: pred = "ult"; break;
|
|
|
|
case FCmpInst::FCMP_ULE: pred = "ule"; break;
|
|
|
|
case FCmpInst::FCMP_UNE: pred = "une"; break;
|
|
|
|
case FCmpInst::FCMP_TRUE: pred = "true"; break;
|
|
|
|
case ICmpInst::ICMP_EQ: pred = "eq"; break;
|
|
|
|
case ICmpInst::ICMP_NE: pred = "ne"; break;
|
|
|
|
case ICmpInst::ICMP_SGT: pred = "sgt"; break;
|
|
|
|
case ICmpInst::ICMP_SGE: pred = "sge"; break;
|
|
|
|
case ICmpInst::ICMP_SLT: pred = "slt"; break;
|
|
|
|
case ICmpInst::ICMP_SLE: pred = "sle"; break;
|
|
|
|
case ICmpInst::ICMP_UGT: pred = "ugt"; break;
|
|
|
|
case ICmpInst::ICMP_UGE: pred = "uge"; break;
|
|
|
|
case ICmpInst::ICMP_ULT: pred = "ult"; break;
|
|
|
|
case ICmpInst::ICMP_ULE: pred = "ule"; break;
|
|
|
|
}
|
|
|
|
return pred;
|
|
|
|
}
|
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
/// @brief Internal constant writer.
|
|
|
|
static void WriteConstantInt(std::ostream &Out, const Constant *CV,
|
2003-05-08 02:08:14 +00:00
|
|
|
std::map<const Type *, std::string> &TypeTable,
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine *Machine) {
|
2006-02-27 10:33:53 +00:00
|
|
|
const int IndentSize = 4;
|
|
|
|
static std::string Indent = "\n";
|
2007-01-11 12:24:14 +00:00
|
|
|
if (const ConstantInt *CI = dyn_cast<ConstantInt>(CV)) {
|
2007-01-11 18:21:29 +00:00
|
|
|
if (CI->getType() == Type::Int1Ty)
|
2007-01-12 04:24:46 +00:00
|
|
|
Out << (CI->getZExtValue() ? "true" : "false");
|
|
|
|
else
|
2007-02-27 20:25:25 +00:00
|
|
|
Out << CI->getValue().toStringSigned(10);
|
2002-04-18 18:53:13 +00:00
|
|
|
} else if (const ConstantFP *CFP = dyn_cast<ConstantFP>(CV)) {
|
2007-09-12 03:30:33 +00:00
|
|
|
if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEdouble ||
|
|
|
|
&CFP->getValueAPF().getSemantics() == &APFloat::IEEEsingle) {
|
|
|
|
// We would like to output the FP constant value in exponential notation,
|
|
|
|
// but we cannot do this if doing so will lose precision. Check here to
|
|
|
|
// make sure that we only output it in exponential format if we can parse
|
|
|
|
// the value back and get the same value.
|
|
|
|
//
|
|
|
|
bool isDouble = &CFP->getValueAPF().getSemantics()==&APFloat::IEEEdouble;
|
|
|
|
double Val = (isDouble) ? CFP->getValueAPF().convertToDouble() :
|
|
|
|
CFP->getValueAPF().convertToFloat();
|
|
|
|
std::string StrVal = ftostr(CFP->getValueAPF());
|
|
|
|
|
|
|
|
// Check to make sure that the stringized number is not some string like
|
|
|
|
// "Inf" or NaN, that atof will accept, but the lexer will not. Check
|
|
|
|
// that the string matches the "[-+]?[0-9]" regex.
|
|
|
|
//
|
|
|
|
if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
|
|
|
|
((StrVal[0] == '-' || StrVal[0] == '+') &&
|
|
|
|
(StrVal[1] >= '0' && StrVal[1] <= '9'))) {
|
|
|
|
// Reparse stringized version!
|
|
|
|
if (atof(StrVal.c_str()) == Val) {
|
|
|
|
Out << StrVal;
|
|
|
|
return;
|
|
|
|
}
|
2002-04-18 18:53:13 +00:00
|
|
|
}
|
2007-09-12 03:30:33 +00:00
|
|
|
// Otherwise we could not reparse it to exactly the same value, so we must
|
|
|
|
// output the string in hexadecimal format!
|
|
|
|
assert(sizeof(double) == sizeof(uint64_t) &&
|
|
|
|
"assuming that double is 64 bits!");
|
|
|
|
Out << "0x" << utohexstr(DoubleToBits(Val));
|
|
|
|
} else {
|
|
|
|
// Some form of long double. These appear as a magic letter identifying
|
|
|
|
// the type, then a fixed number of hex digits.
|
|
|
|
Out << "0x";
|
|
|
|
if (&CFP->getValueAPF().getSemantics() == &APFloat::x87DoubleExtended)
|
|
|
|
Out << 'K';
|
|
|
|
else if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEquad)
|
|
|
|
Out << 'L';
|
2007-10-11 18:07:22 +00:00
|
|
|
else if (&CFP->getValueAPF().getSemantics() == &APFloat::PPCDoubleDouble)
|
|
|
|
Out << 'M';
|
2007-09-12 03:30:33 +00:00
|
|
|
else
|
|
|
|
assert(0 && "Unsupported floating point type");
|
2007-09-26 23:20:33 +00:00
|
|
|
// api needed to prevent premature destruction
|
|
|
|
APInt api = CFP->getValueAPF().convertToAPInt();
|
|
|
|
const uint64_t* p = api.getRawData();
|
2007-09-12 03:30:33 +00:00
|
|
|
uint64_t word = *p;
|
|
|
|
int shiftcount=60;
|
2007-10-11 18:07:22 +00:00
|
|
|
int width = api.getBitWidth();
|
2007-09-12 03:30:33 +00:00
|
|
|
for (int j=0; j<width; j+=4, shiftcount-=4) {
|
|
|
|
unsigned int nibble = (word>>shiftcount) & 15;
|
|
|
|
if (nibble < 10)
|
|
|
|
Out << (unsigned char)(nibble + '0');
|
|
|
|
else
|
|
|
|
Out << (unsigned char)(nibble - 10 + 'A');
|
|
|
|
if (shiftcount == 0) {
|
|
|
|
word = *(++p);
|
2007-10-11 18:07:22 +00:00
|
|
|
shiftcount = 64;
|
2007-09-12 03:30:33 +00:00
|
|
|
if (width-j-4 < 64)
|
|
|
|
shiftcount = width-j-4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2004-02-15 05:55:15 +00:00
|
|
|
} else if (isa<ConstantAggregateZero>(CV)) {
|
|
|
|
Out << "zeroinitializer";
|
2002-04-18 18:53:13 +00:00
|
|
|
} else if (const ConstantArray *CA = dyn_cast<ConstantArray>(CV)) {
|
|
|
|
// As a special case, print the array as a string if it is an array of
|
|
|
|
// ubytes or an array of sbytes with positive values.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2002-04-18 18:53:13 +00:00
|
|
|
const Type *ETy = CA->getType()->getElementType();
|
2006-01-23 23:03:36 +00:00
|
|
|
if (CA->isString()) {
|
2002-04-18 18:53:13 +00:00
|
|
|
Out << "c\"";
|
2006-01-23 23:03:36 +00:00
|
|
|
PrintEscapedString(CA->getAsString(), Out);
|
2002-04-18 18:53:13 +00:00
|
|
|
Out << "\"";
|
|
|
|
|
|
|
|
} else { // Cannot output in string format...
|
2004-06-04 21:11:51 +00:00
|
|
|
Out << '[';
|
2002-04-16 21:36:08 +00:00
|
|
|
if (CA->getNumOperands()) {
|
2004-06-04 21:11:51 +00:00
|
|
|
Out << ' ';
|
2002-04-18 18:53:13 +00:00
|
|
|
printTypeInt(Out, ETy, TypeTable);
|
2002-04-16 21:36:08 +00:00
|
|
|
WriteAsOperandInternal(Out, CA->getOperand(0),
|
2006-12-06 06:24:27 +00:00
|
|
|
TypeTable, Machine);
|
2002-04-16 21:36:08 +00:00
|
|
|
for (unsigned i = 1, e = CA->getNumOperands(); i != e; ++i) {
|
|
|
|
Out << ", ";
|
2002-04-18 18:53:13 +00:00
|
|
|
printTypeInt(Out, ETy, TypeTable);
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperandInternal(Out, CA->getOperand(i), TypeTable, Machine);
|
2002-04-16 21:36:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
Out << " ]";
|
|
|
|
}
|
|
|
|
} else if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(CV)) {
|
2007-01-08 18:21:30 +00:00
|
|
|
if (CS->getType()->isPacked())
|
|
|
|
Out << '<';
|
2004-06-04 21:11:51 +00:00
|
|
|
Out << '{';
|
2006-02-25 12:27:03 +00:00
|
|
|
unsigned N = CS->getNumOperands();
|
|
|
|
if (N) {
|
2006-02-27 10:33:53 +00:00
|
|
|
if (N > 2) {
|
|
|
|
Indent += std::string(IndentSize, ' ');
|
|
|
|
Out << Indent;
|
|
|
|
} else {
|
|
|
|
Out << ' ';
|
|
|
|
}
|
2002-04-16 21:36:08 +00:00
|
|
|
printTypeInt(Out, CS->getOperand(0)->getType(), TypeTable);
|
|
|
|
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperandInternal(Out, CS->getOperand(0), TypeTable, Machine);
|
2002-04-16 21:36:08 +00:00
|
|
|
|
2006-02-25 12:27:03 +00:00
|
|
|
for (unsigned i = 1; i < N; i++) {
|
2002-04-16 21:36:08 +00:00
|
|
|
Out << ", ";
|
2006-02-27 10:33:53 +00:00
|
|
|
if (N > 2) Out << Indent;
|
2002-04-16 21:36:08 +00:00
|
|
|
printTypeInt(Out, CS->getOperand(i)->getType(), TypeTable);
|
|
|
|
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperandInternal(Out, CS->getOperand(i), TypeTable, Machine);
|
2002-04-16 21:36:08 +00:00
|
|
|
}
|
2006-02-27 10:33:53 +00:00
|
|
|
if (N > 2) Indent.resize(Indent.size() - IndentSize);
|
2002-04-16 21:36:08 +00:00
|
|
|
}
|
2006-02-25 12:27:03 +00:00
|
|
|
|
2002-04-16 21:36:08 +00:00
|
|
|
Out << " }";
|
2007-01-08 18:21:30 +00:00
|
|
|
if (CS->getType()->isPacked())
|
|
|
|
Out << '>';
|
2007-02-15 02:26:10 +00:00
|
|
|
} else if (const ConstantVector *CP = dyn_cast<ConstantVector>(CV)) {
|
2004-08-20 06:00:58 +00:00
|
|
|
const Type *ETy = CP->getType()->getElementType();
|
2005-04-21 23:48:37 +00:00
|
|
|
assert(CP->getNumOperands() > 0 &&
|
2004-08-20 06:00:58 +00:00
|
|
|
"Number of operands for a PackedConst must be > 0");
|
|
|
|
Out << '<';
|
|
|
|
Out << ' ';
|
|
|
|
printTypeInt(Out, ETy, TypeTable);
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperandInternal(Out, CP->getOperand(0), TypeTable, Machine);
|
2004-08-20 06:00:58 +00:00
|
|
|
for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
|
|
|
|
Out << ", ";
|
|
|
|
printTypeInt(Out, ETy, TypeTable);
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperandInternal(Out, CP->getOperand(i), TypeTable, Machine);
|
2004-08-20 06:00:58 +00:00
|
|
|
}
|
|
|
|
Out << " >";
|
2002-04-16 21:36:08 +00:00
|
|
|
} else if (isa<ConstantPointerNull>(CV)) {
|
|
|
|
Out << "null";
|
|
|
|
|
2004-10-16 18:08:06 +00:00
|
|
|
} else if (isa<UndefValue>(CV)) {
|
|
|
|
Out << "undef";
|
|
|
|
|
2002-07-30 18:54:25 +00:00
|
|
|
} else if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CV)) {
|
2006-12-04 05:19:18 +00:00
|
|
|
Out << CE->getOpcodeName();
|
|
|
|
if (CE->isCompare())
|
|
|
|
Out << " " << getPredicateText(CE->getPredicate());
|
|
|
|
Out << " (";
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2002-07-14 23:14:45 +00:00
|
|
|
for (User::const_op_iterator OI=CE->op_begin(); OI != CE->op_end(); ++OI) {
|
|
|
|
printTypeInt(Out, (*OI)->getType(), TypeTable);
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperandInternal(Out, *OI, TypeTable, Machine);
|
2002-07-14 23:14:45 +00:00
|
|
|
if (OI+1 != CE->op_end())
|
2002-07-30 18:54:25 +00:00
|
|
|
Out << ", ";
|
2002-07-14 23:14:45 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2006-11-27 01:05:10 +00:00
|
|
|
if (CE->isCast()) {
|
2002-08-15 19:37:43 +00:00
|
|
|
Out << " to ";
|
|
|
|
printTypeInt(Out, CE->getType(), TypeTable);
|
|
|
|
}
|
2006-11-27 01:05:10 +00:00
|
|
|
|
2004-06-04 21:11:51 +00:00
|
|
|
Out << ')';
|
2002-08-15 19:37:43 +00:00
|
|
|
|
2002-04-16 21:36:08 +00:00
|
|
|
} else {
|
2002-07-14 23:14:45 +00:00
|
|
|
Out << "<placeholder or erroneous Constant>";
|
2002-04-16 21:36:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-03-02 00:22:19 +00:00
|
|
|
/// WriteAsOperand - Write the name of the specified value out to the specified
|
|
|
|
/// ostream. This can be useful when you just want to print int %reg126, not
|
|
|
|
/// the whole instruction that generated it.
|
|
|
|
///
|
2005-04-21 23:48:37 +00:00
|
|
|
static void WriteAsOperandInternal(std::ostream &Out, const Value *V,
|
2003-05-08 02:08:14 +00:00
|
|
|
std::map<const Type*, std::string> &TypeTable,
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine *Machine) {
|
2004-06-04 21:11:51 +00:00
|
|
|
Out << ' ';
|
2006-12-06 06:24:27 +00:00
|
|
|
if (V->hasName())
|
2007-01-26 08:02:52 +00:00
|
|
|
Out << getLLVMName(V->getName(),
|
|
|
|
isa<GlobalValue>(V) ? GlobalPrefix : LocalPrefix);
|
2004-07-17 23:47:01 +00:00
|
|
|
else {
|
|
|
|
const Constant *CV = dyn_cast<Constant>(V);
|
2006-01-25 22:26:05 +00:00
|
|
|
if (CV && !isa<GlobalValue>(CV)) {
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteConstantInt(Out, CV, TypeTable, Machine);
|
2006-01-25 22:26:05 +00:00
|
|
|
} else if (const InlineAsm *IA = dyn_cast<InlineAsm>(V)) {
|
|
|
|
Out << "asm ";
|
|
|
|
if (IA->hasSideEffects())
|
|
|
|
Out << "sideeffect ";
|
|
|
|
Out << '"';
|
|
|
|
PrintEscapedString(IA->getAsmString(), Out);
|
|
|
|
Out << "\", \"";
|
|
|
|
PrintEscapedString(IA->getConstraintString(), Out);
|
|
|
|
Out << '"';
|
|
|
|
} else {
|
2007-01-26 08:02:52 +00:00
|
|
|
char Prefix = '%';
|
2002-04-16 21:36:08 +00:00
|
|
|
int Slot;
|
2004-05-26 07:18:52 +00:00
|
|
|
if (Machine) {
|
2007-01-26 08:02:52 +00:00
|
|
|
if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
|
2007-01-11 03:54:27 +00:00
|
|
|
Slot = Machine->getGlobalSlot(GV);
|
2007-01-26 08:02:52 +00:00
|
|
|
Prefix = '@';
|
|
|
|
} else {
|
2007-01-11 03:54:27 +00:00
|
|
|
Slot = Machine->getLocalSlot(V);
|
2007-01-26 08:02:52 +00:00
|
|
|
}
|
2002-04-16 21:36:08 +00:00
|
|
|
} else {
|
2004-05-26 07:18:52 +00:00
|
|
|
Machine = createSlotMachine(V);
|
2007-01-11 03:54:27 +00:00
|
|
|
if (Machine) {
|
2007-01-26 08:02:52 +00:00
|
|
|
if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
|
2007-01-11 03:54:27 +00:00
|
|
|
Slot = Machine->getGlobalSlot(GV);
|
2007-01-26 08:02:52 +00:00
|
|
|
Prefix = '@';
|
|
|
|
} else {
|
2007-01-11 03:54:27 +00:00
|
|
|
Slot = Machine->getLocalSlot(V);
|
2007-01-26 08:02:52 +00:00
|
|
|
}
|
2007-01-11 03:54:27 +00:00
|
|
|
} else {
|
2004-06-09 19:41:19 +00:00
|
|
|
Slot = -1;
|
2007-01-11 03:54:27 +00:00
|
|
|
}
|
2004-05-26 21:56:09 +00:00
|
|
|
delete Machine;
|
2002-04-16 21:36:08 +00:00
|
|
|
}
|
2004-06-09 19:41:19 +00:00
|
|
|
if (Slot != -1)
|
2007-01-26 08:02:52 +00:00
|
|
|
Out << Prefix << Slot;
|
2004-06-09 19:41:19 +00:00
|
|
|
else
|
|
|
|
Out << "<badref>";
|
2002-04-16 21:36:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-03-01 19:48:13 +00:00
|
|
|
/// WriteAsOperand - Write the name of the specified value out to the specified
|
|
|
|
/// ostream. This can be useful when you just want to print int %reg126, not
|
|
|
|
/// the whole instruction that generated it.
|
|
|
|
///
|
2003-11-21 20:23:48 +00:00
|
|
|
std::ostream &llvm::WriteAsOperand(std::ostream &Out, const Value *V,
|
2006-12-06 06:15:43 +00:00
|
|
|
bool PrintType, const Module *Context) {
|
2003-05-08 02:08:14 +00:00
|
|
|
std::map<const Type *, std::string> TypeNames;
|
2002-07-10 16:48:17 +00:00
|
|
|
if (Context == 0) Context = getModuleFromVal(V);
|
2002-04-16 21:36:08 +00:00
|
|
|
|
2002-11-20 18:36:02 +00:00
|
|
|
if (Context)
|
2002-07-10 16:48:17 +00:00
|
|
|
fillTypeNameTable(Context, TypeNames);
|
2001-10-29 16:37:48 +00:00
|
|
|
|
2002-04-16 21:36:08 +00:00
|
|
|
if (PrintType)
|
|
|
|
printTypeInt(Out, V->getType(), TypeNames);
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperandInternal(Out, V, TypeNames, 0);
|
2001-07-20 19:15:21 +00:00
|
|
|
return Out;
|
|
|
|
}
|
|
|
|
|
2004-07-04 11:50:43 +00:00
|
|
|
|
2003-11-21 20:23:48 +00:00
|
|
|
namespace llvm {
|
2001-07-12 23:35:26 +00:00
|
|
|
|
2001-09-07 16:36:04 +00:00
|
|
|
class AssemblyWriter {
|
2004-06-21 21:53:56 +00:00
|
|
|
std::ostream &Out;
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine &Machine;
|
2001-10-29 16:05:51 +00:00
|
|
|
const Module *TheModule;
|
2003-05-08 02:08:14 +00:00
|
|
|
std::map<const Type *, std::string> TypeNames;
|
2003-10-30 23:41:03 +00:00
|
|
|
AssemblyAnnotationWriter *AnnotationWriter;
|
2001-06-06 20:29:01 +00:00
|
|
|
public:
|
2004-05-26 07:18:52 +00:00
|
|
|
inline AssemblyWriter(std::ostream &o, SlotMachine &Mac, const Module *M,
|
2003-10-30 23:41:03 +00:00
|
|
|
AssemblyAnnotationWriter *AAW)
|
2004-06-21 21:53:56 +00:00
|
|
|
: Out(o), Machine(Mac), TheModule(M), AnnotationWriter(AAW) {
|
2001-10-29 16:05:51 +00:00
|
|
|
|
|
|
|
// If the module has a symbol table, take all global types and stuff their
|
|
|
|
// names into the TypeNames map.
|
|
|
|
//
|
2001-10-29 16:37:48 +00:00
|
|
|
fillTypeNameTable(M, TypeNames);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2007-04-25 14:27:10 +00:00
|
|
|
inline void write(const Module *M) { printModule(M); }
|
|
|
|
inline void write(const GlobalVariable *G) { printGlobal(G); }
|
|
|
|
inline void write(const GlobalAlias *G) { printAlias(G); }
|
|
|
|
inline void write(const Function *F) { printFunction(F); }
|
|
|
|
inline void write(const BasicBlock *BB) { printBasicBlock(BB); }
|
2002-06-25 16:13:24 +00:00
|
|
|
inline void write(const Instruction *I) { printInstruction(*I); }
|
2007-04-25 14:27:10 +00:00
|
|
|
inline void write(const Type *Ty) { printType(Ty); }
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2006-12-06 06:24:27 +00:00
|
|
|
void writeOperand(const Value *Op, bool PrintType);
|
2008-02-19 21:38:47 +00:00
|
|
|
void writeParamOperand(const Value *Operand, ParameterAttributes Attrs);
|
2002-04-18 18:53:13 +00:00
|
|
|
|
2004-04-28 15:31:21 +00:00
|
|
|
const Module* getModule() { return TheModule; }
|
|
|
|
|
2004-11-15 19:30:05 +00:00
|
|
|
private:
|
2001-10-29 16:05:51 +00:00
|
|
|
void printModule(const Module *M);
|
2007-01-06 07:24:44 +00:00
|
|
|
void printTypeSymbolTable(const TypeSymbolTable &ST);
|
2001-10-29 16:05:51 +00:00
|
|
|
void printGlobal(const GlobalVariable *GV);
|
2007-04-25 14:27:10 +00:00
|
|
|
void printAlias(const GlobalAlias *GV);
|
2002-03-26 18:01:55 +00:00
|
|
|
void printFunction(const Function *F);
|
2008-02-19 21:38:47 +00:00
|
|
|
void printArgument(const Argument *FA, ParameterAttributes Attrs);
|
2001-10-29 16:05:51 +00:00
|
|
|
void printBasicBlock(const BasicBlock *BB);
|
2002-06-25 16:13:24 +00:00
|
|
|
void printInstruction(const Instruction &I);
|
2002-04-13 20:53:41 +00:00
|
|
|
|
|
|
|
// printType - Go to extreme measures to attempt to print out a short,
|
|
|
|
// symbolic version of a type name.
|
|
|
|
//
|
2003-05-08 02:08:14 +00:00
|
|
|
std::ostream &printType(const Type *Ty) {
|
2004-06-21 21:53:56 +00:00
|
|
|
return printTypeInt(Out, Ty, TypeNames);
|
2002-04-13 20:53:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// printTypeAtLeastOneLevel - Print out one level of the possibly complex type
|
|
|
|
// without considering any symbolic types that we may have equal to it.
|
|
|
|
//
|
2003-05-08 02:08:14 +00:00
|
|
|
std::ostream &printTypeAtLeastOneLevel(const Type *Ty);
|
2001-10-29 16:05:51 +00:00
|
|
|
|
2001-10-13 06:42:36 +00:00
|
|
|
// printInfoComment - Print a little comment after the instruction indicating
|
|
|
|
// which slot it occupies.
|
2002-06-25 16:13:24 +00:00
|
|
|
void printInfoComment(const Value &V);
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
2004-05-27 22:04:46 +00:00
|
|
|
} // end of llvm namespace
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2004-03-02 00:22:19 +00:00
|
|
|
/// printTypeAtLeastOneLevel - Print out one level of the possibly complex type
|
|
|
|
/// without considering any symbolic types that we may have equal to it.
|
|
|
|
///
|
2003-05-08 02:08:14 +00:00
|
|
|
std::ostream &AssemblyWriter::printTypeAtLeastOneLevel(const Type *Ty) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
if (const IntegerType *ITy = dyn_cast<IntegerType>(Ty))
|
|
|
|
Out << "i" << utostr(ITy->getBitWidth());
|
|
|
|
else if (const FunctionType *FTy = dyn_cast<FunctionType>(Ty)) {
|
2006-12-31 05:24:50 +00:00
|
|
|
printType(FTy->getReturnType());
|
|
|
|
Out << " (";
|
2004-02-09 04:14:01 +00:00
|
|
|
for (FunctionType::param_iterator I = FTy->param_begin(),
|
|
|
|
E = FTy->param_end(); I != E; ++I) {
|
|
|
|
if (I != FTy->param_begin())
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ", ";
|
2002-04-16 21:36:08 +00:00
|
|
|
printType(*I);
|
2002-04-13 20:53:41 +00:00
|
|
|
}
|
|
|
|
if (FTy->isVarArg()) {
|
2004-06-21 21:53:56 +00:00
|
|
|
if (FTy->getNumParams()) Out << ", ";
|
|
|
|
Out << "...";
|
2002-04-13 20:53:41 +00:00
|
|
|
}
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ')';
|
2002-06-25 16:13:24 +00:00
|
|
|
} else if (const StructType *STy = dyn_cast<StructType>(Ty)) {
|
2006-12-08 18:06:16 +00:00
|
|
|
if (STy->isPacked())
|
|
|
|
Out << '<';
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "{ ";
|
2004-02-09 04:37:31 +00:00
|
|
|
for (StructType::element_iterator I = STy->element_begin(),
|
|
|
|
E = STy->element_end(); I != E; ++I) {
|
|
|
|
if (I != STy->element_begin())
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ", ";
|
2002-04-13 20:53:41 +00:00
|
|
|
printType(*I);
|
|
|
|
}
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << " }";
|
2006-12-08 18:06:16 +00:00
|
|
|
if (STy->isPacked())
|
|
|
|
Out << '>';
|
2002-06-25 16:13:24 +00:00
|
|
|
} else if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
|
2007-12-18 03:49:35 +00:00
|
|
|
printType(PTy->getElementType());
|
|
|
|
if (unsigned AddressSpace = PTy->getAddressSpace())
|
|
|
|
Out << " addrspace(" << AddressSpace << ")";
|
|
|
|
Out << '*';
|
2002-06-25 16:13:24 +00:00
|
|
|
} else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << '[' << ATy->getNumElements() << " x ";
|
2004-06-04 21:11:51 +00:00
|
|
|
printType(ATy->getElementType()) << ']';
|
2007-02-15 02:26:10 +00:00
|
|
|
} else if (const VectorType *PTy = dyn_cast<VectorType>(Ty)) {
|
2004-08-20 15:37:30 +00:00
|
|
|
Out << '<' << PTy->getNumElements() << " x ";
|
|
|
|
printType(PTy->getElementType()) << '>';
|
|
|
|
}
|
2006-11-02 20:25:50 +00:00
|
|
|
else if (isa<OpaqueType>(Ty)) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "opaque";
|
2002-04-13 20:53:41 +00:00
|
|
|
} else {
|
2002-07-14 23:14:45 +00:00
|
|
|
if (!Ty->isPrimitiveType())
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "<unknown derived type>";
|
2002-04-13 20:53:41 +00:00
|
|
|
printType(Ty);
|
|
|
|
}
|
2004-06-21 21:53:56 +00:00
|
|
|
return Out;
|
2002-04-13 20:53:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-12-06 06:24:27 +00:00
|
|
|
void AssemblyWriter::writeOperand(const Value *Operand, bool PrintType) {
|
|
|
|
if (Operand == 0) {
|
2005-02-24 16:58:29 +00:00
|
|
|
Out << "<null operand!>";
|
2006-12-06 06:24:27 +00:00
|
|
|
} else {
|
|
|
|
if (PrintType) { Out << ' '; printType(Operand->getType()); }
|
|
|
|
WriteAsOperandInternal(Out, Operand, TypeNames, &Machine);
|
2005-02-24 16:58:29 +00:00
|
|
|
}
|
2001-09-07 16:36:04 +00:00
|
|
|
}
|
|
|
|
|
2008-02-19 21:38:47 +00:00
|
|
|
void AssemblyWriter::writeParamOperand(const Value *Operand,
|
|
|
|
ParameterAttributes Attrs) {
|
2007-11-27 13:23:08 +00:00
|
|
|
if (Operand == 0) {
|
|
|
|
Out << "<null operand!>";
|
|
|
|
} else {
|
|
|
|
Out << ' ';
|
|
|
|
// Print the type
|
|
|
|
printType(Operand->getType());
|
|
|
|
// Print parameter attributes list
|
|
|
|
if (Attrs != ParamAttr::None)
|
|
|
|
Out << ' ' << ParamAttrsList::getParamAttrsText(Attrs);
|
|
|
|
// Print the operand
|
|
|
|
WriteAsOperandInternal(Out, Operand, TypeNames, &Machine);
|
|
|
|
}
|
|
|
|
}
|
2001-09-07 16:36:04 +00:00
|
|
|
|
2001-10-29 16:05:51 +00:00
|
|
|
void AssemblyWriter::printModule(const Module *M) {
|
2005-03-02 23:12:40 +00:00
|
|
|
if (!M->getModuleIdentifier().empty() &&
|
2005-04-21 23:48:37 +00:00
|
|
|
// Don't print the ID if it will start a new line (which would
|
2005-03-02 23:12:40 +00:00
|
|
|
// require a comment char before it).
|
|
|
|
M->getModuleIdentifier().find('\n') == std::string::npos)
|
|
|
|
Out << "; ModuleID = '" << M->getModuleIdentifier() << "'\n";
|
|
|
|
|
2006-10-18 02:21:12 +00:00
|
|
|
if (!M->getDataLayout().empty())
|
2006-10-22 06:06:56 +00:00
|
|
|
Out << "target datalayout = \"" << M->getDataLayout() << "\"\n";
|
2004-07-25 21:44:54 +00:00
|
|
|
if (!M->getTargetTriple().empty())
|
2004-07-25 21:29:43 +00:00
|
|
|
Out << "target triple = \"" << M->getTargetTriple() << "\"\n";
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2006-01-24 04:13:11 +00:00
|
|
|
if (!M->getModuleInlineAsm().empty()) {
|
2006-01-24 00:45:30 +00:00
|
|
|
// Split the string into lines, to make it easier to read the .ll file.
|
2006-01-24 04:13:11 +00:00
|
|
|
std::string Asm = M->getModuleInlineAsm();
|
2006-01-24 00:45:30 +00:00
|
|
|
size_t CurPos = 0;
|
|
|
|
size_t NewLine = Asm.find_first_of('\n', CurPos);
|
|
|
|
while (NewLine != std::string::npos) {
|
|
|
|
// We found a newline, print the portion of the asm string from the
|
|
|
|
// last newline up to this newline.
|
|
|
|
Out << "module asm \"";
|
|
|
|
PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.begin()+NewLine),
|
|
|
|
Out);
|
|
|
|
Out << "\"\n";
|
|
|
|
CurPos = NewLine+1;
|
|
|
|
NewLine = Asm.find_first_of('\n', CurPos);
|
|
|
|
}
|
2006-01-24 00:40:17 +00:00
|
|
|
Out << "module asm \"";
|
2006-01-24 00:45:30 +00:00
|
|
|
PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.end()), Out);
|
2006-01-23 23:03:36 +00:00
|
|
|
Out << "\"\n";
|
|
|
|
}
|
|
|
|
|
2004-09-14 05:06:58 +00:00
|
|
|
// Loop over the dependent libraries and emit them.
|
2004-09-14 04:51:44 +00:00
|
|
|
Module::lib_iterator LI = M->lib_begin();
|
|
|
|
Module::lib_iterator LE = M->lib_end();
|
2004-07-25 21:44:54 +00:00
|
|
|
if (LI != LE) {
|
2004-09-14 04:51:44 +00:00
|
|
|
Out << "deplibs = [ ";
|
|
|
|
while (LI != LE) {
|
2004-09-14 05:06:58 +00:00
|
|
|
Out << '"' << *LI << '"';
|
2004-07-25 21:29:43 +00:00
|
|
|
++LI;
|
2004-09-14 04:51:44 +00:00
|
|
|
if (LI != LE)
|
|
|
|
Out << ", ";
|
2004-07-25 21:29:43 +00:00
|
|
|
}
|
|
|
|
Out << " ]\n";
|
2004-07-25 18:08:18 +00:00
|
|
|
}
|
2004-09-13 23:44:23 +00:00
|
|
|
|
2004-09-14 05:06:58 +00:00
|
|
|
// Loop over the symbol table, emitting all named constants.
|
2007-01-06 07:24:44 +00:00
|
|
|
printTypeSymbolTable(M->getTypeSymbolTable());
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2006-12-06 04:41:52 +00:00
|
|
|
for (Module::const_global_iterator I = M->global_begin(), E = M->global_end();
|
|
|
|
I != E; ++I)
|
2002-06-25 16:13:24 +00:00
|
|
|
printGlobal(I);
|
2007-04-26 02:24:10 +00:00
|
|
|
|
|
|
|
// Output all aliases.
|
|
|
|
if (!M->alias_empty()) Out << "\n";
|
|
|
|
for (Module::const_alias_iterator I = M->alias_begin(), E = M->alias_end();
|
|
|
|
I != E; ++I)
|
|
|
|
printAlias(I);
|
2001-09-07 16:36:04 +00:00
|
|
|
|
2004-09-14 05:06:58 +00:00
|
|
|
// Output all of the functions.
|
2002-06-25 16:13:24 +00:00
|
|
|
for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
|
|
|
|
printFunction(I);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2001-10-29 16:05:51 +00:00
|
|
|
void AssemblyWriter::printGlobal(const GlobalVariable *GV) {
|
2007-01-26 08:02:52 +00:00
|
|
|
if (GV->hasName()) Out << getLLVMName(GV->getName(), GlobalPrefix) << " = ";
|
2001-09-18 04:01:05 +00:00
|
|
|
|
2008-01-15 21:16:32 +00:00
|
|
|
if (!GV->hasInitializer()) {
|
2006-09-14 18:23:27 +00:00
|
|
|
switch (GV->getLinkage()) {
|
|
|
|
case GlobalValue::DLLImportLinkage: Out << "dllimport "; break;
|
|
|
|
case GlobalValue::ExternalWeakLinkage: Out << "extern_weak "; break;
|
|
|
|
default: Out << "external "; break;
|
2008-01-15 21:16:32 +00:00
|
|
|
}
|
|
|
|
} else {
|
2003-04-16 20:28:45 +00:00
|
|
|
switch (GV->getLinkage()) {
|
2006-09-14 18:23:27 +00:00
|
|
|
case GlobalValue::InternalLinkage: Out << "internal "; break;
|
|
|
|
case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
|
|
|
|
case GlobalValue::WeakLinkage: Out << "weak "; break;
|
|
|
|
case GlobalValue::AppendingLinkage: Out << "appending "; break;
|
|
|
|
case GlobalValue::DLLImportLinkage: Out << "dllimport "; break;
|
|
|
|
case GlobalValue::DLLExportLinkage: Out << "dllexport "; break;
|
|
|
|
case GlobalValue::ExternalWeakLinkage: Out << "extern_weak "; break;
|
|
|
|
case GlobalValue::ExternalLinkage: break;
|
2004-11-14 21:04:34 +00:00
|
|
|
case GlobalValue::GhostLinkage:
|
2006-12-07 01:30:32 +00:00
|
|
|
cerr << "GhostLinkage not allowed in AsmWriter!\n";
|
2004-11-14 21:04:34 +00:00
|
|
|
abort();
|
2003-04-16 20:28:45 +00:00
|
|
|
}
|
2007-01-12 19:20:47 +00:00
|
|
|
switch (GV->getVisibility()) {
|
2007-01-15 18:28:18 +00:00
|
|
|
default: assert(0 && "Invalid visibility style!");
|
2007-01-12 19:20:47 +00:00
|
|
|
case GlobalValue::DefaultVisibility: break;
|
|
|
|
case GlobalValue::HiddenVisibility: Out << "hidden "; break;
|
2007-04-29 18:35:00 +00:00
|
|
|
case GlobalValue::ProtectedVisibility: Out << "protected "; break;
|
2007-01-12 19:20:47 +00:00
|
|
|
}
|
|
|
|
}
|
2007-04-12 18:32:50 +00:00
|
|
|
|
|
|
|
if (GV->isThreadLocal()) Out << "thread_local ";
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << (GV->isConstant() ? "constant " : "global ");
|
2001-12-04 00:03:30 +00:00
|
|
|
printType(GV->getType()->getElementType());
|
2001-09-18 04:01:05 +00:00
|
|
|
|
2004-07-17 23:47:01 +00:00
|
|
|
if (GV->hasInitializer()) {
|
|
|
|
Constant* C = cast<Constant>(GV->getInitializer());
|
|
|
|
assert(C && "GlobalVar initializer isn't constant?");
|
2006-12-06 06:24:27 +00:00
|
|
|
writeOperand(GV->getInitializer(), false);
|
2004-07-17 23:47:01 +00:00
|
|
|
}
|
2007-04-25 14:27:10 +00:00
|
|
|
|
2007-12-11 08:59:05 +00:00
|
|
|
if (unsigned AddressSpace = GV->getType()->getAddressSpace())
|
|
|
|
Out << " addrspace(" << AddressSpace << ") ";
|
|
|
|
|
2005-11-12 00:10:19 +00:00
|
|
|
if (GV->hasSection())
|
|
|
|
Out << ", section \"" << GV->getSection() << '"';
|
|
|
|
if (GV->getAlignment())
|
2005-11-06 06:48:53 +00:00
|
|
|
Out << ", align " << GV->getAlignment();
|
2007-04-25 14:27:10 +00:00
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
printInfoComment(*GV);
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\n";
|
2001-09-10 07:58:01 +00:00
|
|
|
}
|
|
|
|
|
2007-04-25 14:27:10 +00:00
|
|
|
void AssemblyWriter::printAlias(const GlobalAlias *GA) {
|
|
|
|
Out << getLLVMName(GA->getName(), GlobalPrefix) << " = ";
|
|
|
|
switch (GA->getVisibility()) {
|
|
|
|
default: assert(0 && "Invalid visibility style!");
|
|
|
|
case GlobalValue::DefaultVisibility: break;
|
|
|
|
case GlobalValue::HiddenVisibility: Out << "hidden "; break;
|
2007-04-29 18:35:00 +00:00
|
|
|
case GlobalValue::ProtectedVisibility: Out << "protected "; break;
|
2007-04-25 14:27:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Out << "alias ";
|
|
|
|
|
|
|
|
switch (GA->getLinkage()) {
|
|
|
|
case GlobalValue::WeakLinkage: Out << "weak "; break;
|
|
|
|
case GlobalValue::InternalLinkage: Out << "internal "; break;
|
|
|
|
case GlobalValue::ExternalLinkage: break;
|
|
|
|
default:
|
|
|
|
assert(0 && "Invalid alias linkage");
|
|
|
|
}
|
|
|
|
|
2007-04-29 18:02:48 +00:00
|
|
|
const Constant *Aliasee = GA->getAliasee();
|
2007-04-25 14:27:10 +00:00
|
|
|
|
|
|
|
if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(Aliasee)) {
|
|
|
|
printType(GV->getType());
|
|
|
|
Out << " " << getLLVMName(GV->getName(), GlobalPrefix);
|
|
|
|
} else if (const Function *F = dyn_cast<Function>(Aliasee)) {
|
|
|
|
printType(F->getFunctionType());
|
|
|
|
Out << "* ";
|
|
|
|
|
|
|
|
if (!F->getName().empty())
|
|
|
|
Out << getLLVMName(F->getName(), GlobalPrefix);
|
|
|
|
else
|
|
|
|
Out << "@\"\"";
|
2007-04-28 13:45:00 +00:00
|
|
|
} else {
|
|
|
|
const ConstantExpr *CE = 0;
|
|
|
|
if ((CE = dyn_cast<ConstantExpr>(Aliasee)) &&
|
|
|
|
(CE->getOpcode() == Instruction::BitCast)) {
|
|
|
|
writeOperand(CE, false);
|
|
|
|
} else
|
|
|
|
assert(0 && "Unsupported aliasee");
|
|
|
|
}
|
|
|
|
|
2007-04-25 14:27:10 +00:00
|
|
|
printInfoComment(*GA);
|
|
|
|
Out << "\n";
|
|
|
|
}
|
|
|
|
|
2007-01-06 07:24:44 +00:00
|
|
|
void AssemblyWriter::printTypeSymbolTable(const TypeSymbolTable &ST) {
|
2004-05-25 08:53:40 +00:00
|
|
|
// Print the types.
|
2007-01-06 07:24:44 +00:00
|
|
|
for (TypeSymbolTable::const_iterator TI = ST.begin(), TE = ST.end();
|
|
|
|
TI != TE; ++TI) {
|
2007-01-26 08:02:52 +00:00
|
|
|
Out << "\t" << getLLVMName(TI->first, LocalPrefix) << " = type ";
|
2004-05-25 08:53:40 +00:00
|
|
|
|
|
|
|
// Make sure we print out at least one level of the type structure, so
|
|
|
|
// that we do not get %FILE = type %FILE
|
|
|
|
//
|
|
|
|
printTypeAtLeastOneLevel(TI->second) << "\n";
|
|
|
|
}
|
2007-01-06 07:24:44 +00:00
|
|
|
}
|
|
|
|
|
2004-03-02 00:22:19 +00:00
|
|
|
/// printFunction - Print all aspects of a function.
|
|
|
|
///
|
2002-06-25 16:13:24 +00:00
|
|
|
void AssemblyWriter::printFunction(const Function *F) {
|
2001-06-06 20:29:01 +00:00
|
|
|
// Print out the return type and name...
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\n";
|
2003-04-16 20:28:45 +00:00
|
|
|
|
2004-06-21 21:53:56 +00:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitFunctionAnnot(F, Out);
|
2003-10-30 23:41:03 +00:00
|
|
|
|
2007-01-30 20:08:39 +00:00
|
|
|
if (F->isDeclaration())
|
2007-08-19 22:15:26 +00:00
|
|
|
Out << "declare ";
|
|
|
|
else
|
2006-12-29 20:29:48 +00:00
|
|
|
Out << "define ";
|
2007-08-19 22:15:26 +00:00
|
|
|
|
|
|
|
switch (F->getLinkage()) {
|
|
|
|
case GlobalValue::InternalLinkage: Out << "internal "; break;
|
|
|
|
case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
|
|
|
|
case GlobalValue::WeakLinkage: Out << "weak "; break;
|
|
|
|
case GlobalValue::AppendingLinkage: Out << "appending "; break;
|
|
|
|
case GlobalValue::DLLImportLinkage: Out << "dllimport "; break;
|
|
|
|
case GlobalValue::DLLExportLinkage: Out << "dllexport "; break;
|
|
|
|
case GlobalValue::ExternalWeakLinkage: Out << "extern_weak "; break;
|
|
|
|
case GlobalValue::ExternalLinkage: break;
|
|
|
|
case GlobalValue::GhostLinkage:
|
|
|
|
cerr << "GhostLinkage not allowed in AsmWriter!\n";
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
switch (F->getVisibility()) {
|
|
|
|
default: assert(0 && "Invalid visibility style!");
|
|
|
|
case GlobalValue::DefaultVisibility: break;
|
|
|
|
case GlobalValue::HiddenVisibility: Out << "hidden "; break;
|
|
|
|
case GlobalValue::ProtectedVisibility: Out << "protected "; break;
|
2006-12-29 20:29:48 +00:00
|
|
|
}
|
2003-04-16 20:28:45 +00:00
|
|
|
|
2005-05-06 20:26:43 +00:00
|
|
|
// Print the calling convention.
|
|
|
|
switch (F->getCallingConv()) {
|
|
|
|
case CallingConv::C: break; // default
|
2006-09-20 22:03:51 +00:00
|
|
|
case CallingConv::Fast: Out << "fastcc "; break;
|
|
|
|
case CallingConv::Cold: Out << "coldcc "; break;
|
|
|
|
case CallingConv::X86_StdCall: Out << "x86_stdcallcc "; break;
|
|
|
|
case CallingConv::X86_FastCall: Out << "x86_fastcallcc "; break;
|
2005-05-06 20:26:43 +00:00
|
|
|
default: Out << "cc" << F->getCallingConv() << " "; break;
|
|
|
|
}
|
|
|
|
|
2006-12-31 05:24:50 +00:00
|
|
|
const FunctionType *FT = F->getFunctionType();
|
2007-11-27 13:23:08 +00:00
|
|
|
const ParamAttrsList *Attrs = F->getParamAttrs();
|
2004-06-04 21:11:51 +00:00
|
|
|
printType(F->getReturnType()) << ' ';
|
2003-10-18 05:57:43 +00:00
|
|
|
if (!F->getName().empty())
|
2007-01-26 08:02:52 +00:00
|
|
|
Out << getLLVMName(F->getName(), GlobalPrefix);
|
2003-10-18 05:57:43 +00:00
|
|
|
else
|
2007-01-26 08:02:52 +00:00
|
|
|
Out << "@\"\"";
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << '(';
|
2004-05-26 07:18:52 +00:00
|
|
|
Machine.incorporateFunction(F);
|
2001-09-07 16:36:04 +00:00
|
|
|
|
2001-10-29 16:05:51 +00:00
|
|
|
// Loop over the arguments, printing them...
|
2001-09-07 16:36:04 +00:00
|
|
|
|
2006-12-31 05:24:50 +00:00
|
|
|
unsigned Idx = 1;
|
2007-04-18 00:57:22 +00:00
|
|
|
if (!F->isDeclaration()) {
|
|
|
|
// If this isn't a declaration, print the argument names as well.
|
|
|
|
for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
|
|
|
|
I != E; ++I) {
|
|
|
|
// Insert commas as we go... the first arg doesn't get a comma
|
|
|
|
if (I != F->arg_begin()) Out << ", ";
|
|
|
|
printArgument(I, (Attrs ? Attrs->getParamAttrs(Idx)
|
2008-02-19 21:38:47 +00:00
|
|
|
: ParamAttr::None));
|
2007-04-18 00:57:22 +00:00
|
|
|
Idx++;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Otherwise, print the types from the function type.
|
|
|
|
for (unsigned i = 0, e = FT->getNumParams(); i != e; ++i) {
|
|
|
|
// Insert commas as we go... the first arg doesn't get a comma
|
|
|
|
if (i) Out << ", ";
|
|
|
|
|
|
|
|
// Output type...
|
|
|
|
printType(FT->getParamType(i));
|
|
|
|
|
2008-02-19 21:38:47 +00:00
|
|
|
ParameterAttributes ArgAttrs = ParamAttr::None;
|
2007-04-18 00:57:22 +00:00
|
|
|
if (Attrs) ArgAttrs = Attrs->getParamAttrs(i+1);
|
|
|
|
if (ArgAttrs != ParamAttr::None)
|
|
|
|
Out << ' ' << ParamAttrsList::getParamAttrsText(ArgAttrs);
|
|
|
|
}
|
2006-12-31 05:24:50 +00:00
|
|
|
}
|
2001-09-07 16:36:04 +00:00
|
|
|
|
|
|
|
// Finish printing arguments...
|
2002-06-25 16:13:24 +00:00
|
|
|
if (FT->isVarArg()) {
|
2004-06-21 21:53:56 +00:00
|
|
|
if (FT->getNumParams()) Out << ", ";
|
|
|
|
Out << "..."; // Output varargs portion of signature!
|
2001-09-07 16:36:04 +00:00
|
|
|
}
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ')';
|
2007-04-11 02:44:20 +00:00
|
|
|
if (Attrs && Attrs->getParamAttrs(0) != ParamAttr::None)
|
2007-04-09 06:10:42 +00:00
|
|
|
Out << ' ' << Attrs->getParamAttrsTextByIndex(0);
|
2005-11-12 00:10:19 +00:00
|
|
|
if (F->hasSection())
|
|
|
|
Out << " section \"" << F->getSection() << '"';
|
2005-11-06 06:48:53 +00:00
|
|
|
if (F->getAlignment())
|
|
|
|
Out << " align " << F->getAlignment();
|
2007-12-10 03:18:06 +00:00
|
|
|
if (F->hasCollector())
|
|
|
|
Out << " gc \"" << F->getCollector() << '"';
|
2005-11-12 00:10:19 +00:00
|
|
|
|
2007-01-30 20:08:39 +00:00
|
|
|
if (F->isDeclaration()) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\n";
|
2002-05-06 03:00:40 +00:00
|
|
|
} else {
|
2008-03-02 02:48:09 +00:00
|
|
|
Out << " {\n";
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2002-04-07 22:49:37 +00:00
|
|
|
// Output all of its basic blocks... for the function
|
2002-06-25 16:13:24 +00:00
|
|
|
for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
|
|
|
|
printBasicBlock(I);
|
2001-09-07 16:36:04 +00:00
|
|
|
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "}\n";
|
2001-09-07 16:36:04 +00:00
|
|
|
}
|
|
|
|
|
2004-05-26 07:18:52 +00:00
|
|
|
Machine.purgeFunction();
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2004-03-02 00:22:19 +00:00
|
|
|
/// printArgument - This member is called for every argument that is passed into
|
|
|
|
/// the function. Simply print it out
|
|
|
|
///
|
2008-02-19 21:38:47 +00:00
|
|
|
void AssemblyWriter::printArgument(const Argument *Arg,
|
|
|
|
ParameterAttributes Attrs) {
|
2001-06-06 20:29:01 +00:00
|
|
|
// Output type...
|
2001-10-29 16:05:51 +00:00
|
|
|
printType(Arg->getType());
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2007-11-27 13:23:08 +00:00
|
|
|
// Output parameter attributes list
|
2007-04-11 02:44:20 +00:00
|
|
|
if (Attrs != ParamAttr::None)
|
2007-04-09 06:10:42 +00:00
|
|
|
Out << ' ' << ParamAttrsList::getParamAttrsText(Attrs);
|
2006-12-31 05:24:50 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
// Output name, if available...
|
|
|
|
if (Arg->hasName())
|
2007-01-26 08:02:52 +00:00
|
|
|
Out << ' ' << getLLVMName(Arg->getName(), LocalPrefix);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2004-03-02 00:22:19 +00:00
|
|
|
/// printBasicBlock - This member is called for each basic block in a method.
|
|
|
|
///
|
2001-10-29 16:05:51 +00:00
|
|
|
void AssemblyWriter::printBasicBlock(const BasicBlock *BB) {
|
2008-03-02 02:48:09 +00:00
|
|
|
if (BB->hasName()) // Print out the label if it exists...
|
|
|
|
Out << getLLVMName(BB->getName(), LabelPrefix) << ':';
|
|
|
|
|
|
|
|
if (const BasicBlock* unwindDest = BB->getUnwindDest()) {
|
|
|
|
if (BB->hasName())
|
|
|
|
Out << ' ';
|
|
|
|
|
2008-03-10 02:20:00 +00:00
|
|
|
Out << "unwinds to";
|
2008-03-02 02:48:09 +00:00
|
|
|
writeOperand(unwindDest, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!BB->hasName() && !BB->use_empty()) { // Don't print block # of no uses...
|
|
|
|
Out << "; <label>:";
|
2007-01-11 03:54:27 +00:00
|
|
|
int Slot = Machine.getLocalSlot(BB);
|
2004-06-09 19:41:19 +00:00
|
|
|
if (Slot != -1)
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << Slot;
|
2004-06-09 19:41:19 +00:00
|
|
|
else
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "<badref>";
|
2002-10-02 19:38:55 +00:00
|
|
|
}
|
2003-11-20 00:09:43 +00:00
|
|
|
|
|
|
|
if (BB->getParent() == 0)
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\t\t; Error: Block without parent!";
|
2003-11-20 00:09:43 +00:00
|
|
|
else {
|
2007-03-22 16:38:57 +00:00
|
|
|
if (BB != &BB->getParent()->getEntryBlock()) { // Not the entry block?
|
2003-11-20 00:09:43 +00:00
|
|
|
// Output predecessors for the block...
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\t\t;";
|
2003-11-20 00:09:43 +00:00
|
|
|
pred_const_iterator PI = pred_begin(BB), PE = pred_end(BB);
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-11-20 00:09:43 +00:00
|
|
|
if (PI == PE) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << " No predecessors!";
|
2003-11-20 00:09:43 +00:00
|
|
|
} else {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << " preds =";
|
2006-12-06 06:24:27 +00:00
|
|
|
writeOperand(*PI, false);
|
2003-11-20 00:09:43 +00:00
|
|
|
for (++PI; PI != PE; ++PI) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ',';
|
2006-12-06 06:24:27 +00:00
|
|
|
writeOperand(*PI, false);
|
2003-11-20 00:09:43 +00:00
|
|
|
}
|
2003-11-16 22:59:57 +00:00
|
|
|
}
|
2002-10-02 19:38:55 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2008-03-02 02:48:09 +00:00
|
|
|
if (BB->hasName() || !BB->use_empty() || BB->getUnwindDest() ||
|
|
|
|
BB != &BB->getParent()->getEntryBlock())
|
|
|
|
Out << "\n";
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2004-06-21 21:53:56 +00:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitBasicBlockStartAnnot(BB, Out);
|
2003-10-30 23:41:03 +00:00
|
|
|
|
2001-09-07 16:36:04 +00:00
|
|
|
// Output all of the instructions in the basic block...
|
2002-06-25 16:13:24 +00:00
|
|
|
for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
|
|
|
|
printInstruction(*I);
|
2004-03-08 18:51:45 +00:00
|
|
|
|
2004-06-21 21:53:56 +00:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitBasicBlockEndAnnot(BB, Out);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2001-10-13 06:42:36 +00:00
|
|
|
|
2004-03-02 00:22:19 +00:00
|
|
|
/// printInfoComment - Print a little comment after the instruction indicating
|
|
|
|
/// which slot it occupies.
|
|
|
|
///
|
2002-06-25 16:13:24 +00:00
|
|
|
void AssemblyWriter::printInfoComment(const Value &V) {
|
|
|
|
if (V.getType() != Type::VoidTy) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\t\t; <";
|
2004-06-04 21:11:51 +00:00
|
|
|
printType(V.getType()) << '>';
|
2001-10-13 06:42:36 +00:00
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
if (!V.hasName()) {
|
2007-01-11 03:54:27 +00:00
|
|
|
int SlotNum;
|
|
|
|
if (const GlobalValue *GV = dyn_cast<GlobalValue>(&V))
|
|
|
|
SlotNum = Machine.getGlobalSlot(GV);
|
|
|
|
else
|
|
|
|
SlotNum = Machine.getLocalSlot(&V);
|
2004-06-09 19:41:19 +00:00
|
|
|
if (SlotNum == -1)
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ":<badref>";
|
2004-06-09 15:26:53 +00:00
|
|
|
else
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ':' << SlotNum; // Print out the def slot taken.
|
2001-10-13 06:42:36 +00:00
|
|
|
}
|
2005-02-01 01:24:01 +00:00
|
|
|
Out << " [#uses=" << V.getNumUses() << ']'; // Output # uses
|
2001-10-13 06:42:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-08-28 01:02:49 +00:00
|
|
|
// This member is called for each Instruction in a function..
|
2002-06-25 16:13:24 +00:00
|
|
|
void AssemblyWriter::printInstruction(const Instruction &I) {
|
2004-06-21 21:53:56 +00:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitInstructionAnnot(&I, Out);
|
2003-10-30 23:41:03 +00:00
|
|
|
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\t";
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
// Print out name if it exists...
|
2002-06-25 16:13:24 +00:00
|
|
|
if (I.hasName())
|
2007-01-26 08:02:52 +00:00
|
|
|
Out << getLLVMName(I.getName(), LocalPrefix) << " = ";
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2005-05-06 05:51:46 +00:00
|
|
|
// If this is a volatile load or store, print out the volatile marker.
|
2003-09-08 17:45:59 +00:00
|
|
|
if ((isa<LoadInst>(I) && cast<LoadInst>(I).isVolatile()) ||
|
2005-05-06 05:51:46 +00:00
|
|
|
(isa<StoreInst>(I) && cast<StoreInst>(I).isVolatile())) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "volatile ";
|
2005-05-06 05:51:46 +00:00
|
|
|
} else if (isa<CallInst>(I) && cast<CallInst>(I).isTailCall()) {
|
|
|
|
// If this is a call, check if it's a tail call.
|
|
|
|
Out << "tail ";
|
|
|
|
}
|
2003-09-08 17:45:59 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
// Print out the opcode...
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << I.getOpcodeName();
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2006-12-03 06:27:29 +00:00
|
|
|
// Print out the compare instruction predicates
|
|
|
|
if (const FCmpInst *FCI = dyn_cast<FCmpInst>(&I)) {
|
2006-12-04 05:19:18 +00:00
|
|
|
Out << " " << getPredicateText(FCI->getPredicate());
|
2006-12-03 06:27:29 +00:00
|
|
|
} else if (const ICmpInst *ICI = dyn_cast<ICmpInst>(&I)) {
|
2006-12-04 05:19:18 +00:00
|
|
|
Out << " " << getPredicateText(ICI->getPredicate());
|
2006-12-03 06:27:29 +00:00
|
|
|
}
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
// Print out the type of the operands...
|
2002-06-25 16:13:24 +00:00
|
|
|
const Value *Operand = I.getNumOperands() ? I.getOperand(0) : 0;
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
// Special case conditional branches to swizzle the condition out to the front
|
2002-06-25 16:13:24 +00:00
|
|
|
if (isa<BranchInst>(I) && I.getNumOperands() > 1) {
|
|
|
|
writeOperand(I.getOperand(2), true);
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ',';
|
2001-06-06 20:29:01 +00:00
|
|
|
writeOperand(Operand, true);
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ',';
|
2002-06-25 16:13:24 +00:00
|
|
|
writeOperand(I.getOperand(1), true);
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-04-13 18:34:38 +00:00
|
|
|
} else if (isa<SwitchInst>(I)) {
|
2001-06-06 20:29:01 +00:00
|
|
|
// Special case switch statement to get formatting nice and correct...
|
2004-06-21 21:53:56 +00:00
|
|
|
writeOperand(Operand , true); Out << ',';
|
|
|
|
writeOperand(I.getOperand(1), true); Out << " [";
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
for (unsigned op = 2, Eop = I.getNumOperands(); op < Eop; op += 2) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\n\t\t";
|
|
|
|
writeOperand(I.getOperand(op ), true); Out << ',';
|
2002-06-25 16:13:24 +00:00
|
|
|
writeOperand(I.getOperand(op+1), true);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\n\t]";
|
2001-10-02 03:41:24 +00:00
|
|
|
} else if (isa<PHINode>(I)) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ' ';
|
2002-06-25 16:13:24 +00:00
|
|
|
printType(I.getType());
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ' ';
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
for (unsigned op = 0, Eop = I.getNumOperands(); op < Eop; op += 2) {
|
2004-06-21 21:53:56 +00:00
|
|
|
if (op) Out << ", ";
|
2005-04-21 23:48:37 +00:00
|
|
|
Out << '[';
|
2004-06-21 21:53:56 +00:00
|
|
|
writeOperand(I.getOperand(op ), false); Out << ',';
|
|
|
|
writeOperand(I.getOperand(op+1), false); Out << " ]";
|
2001-06-11 15:04:20 +00:00
|
|
|
}
|
2008-02-23 00:47:00 +00:00
|
|
|
} else if (const GetResultInst *GRI = dyn_cast<GetResultInst>(&I)) {
|
2008-02-23 01:04:26 +00:00
|
|
|
writeOperand(I.getOperand(0), true);
|
2008-02-23 00:47:00 +00:00
|
|
|
Out << ", " << GRI->getIndex();
|
2008-02-23 00:35:18 +00:00
|
|
|
} else if (isa<ReturnInst>(I) && !Operand) {
|
|
|
|
Out << " void";
|
2005-05-06 20:26:43 +00:00
|
|
|
} else if (const CallInst *CI = dyn_cast<CallInst>(&I)) {
|
|
|
|
// Print the calling convention being used.
|
|
|
|
switch (CI->getCallingConv()) {
|
|
|
|
case CallingConv::C: break; // default
|
2006-05-19 21:58:52 +00:00
|
|
|
case CallingConv::Fast: Out << " fastcc"; break;
|
|
|
|
case CallingConv::Cold: Out << " coldcc"; break;
|
2007-11-18 18:32:16 +00:00
|
|
|
case CallingConv::X86_StdCall: Out << " x86_stdcallcc"; break;
|
|
|
|
case CallingConv::X86_FastCall: Out << " x86_fastcallcc"; break;
|
2005-05-06 20:26:43 +00:00
|
|
|
default: Out << " cc" << CI->getCallingConv(); break;
|
|
|
|
}
|
|
|
|
|
2007-04-09 06:10:42 +00:00
|
|
|
const PointerType *PTy = cast<PointerType>(Operand->getType());
|
|
|
|
const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
|
|
|
|
const Type *RetTy = FTy->getReturnType();
|
2007-11-27 13:23:08 +00:00
|
|
|
const ParamAttrsList *PAL = CI->getParamAttrs();
|
2001-11-06 21:28:12 +00:00
|
|
|
|
2003-08-05 15:34:45 +00:00
|
|
|
// If possible, print out the short form of the call instruction. We can
|
2002-04-07 22:49:37 +00:00
|
|
|
// only do this if the first argument is a pointer to a nonvararg function,
|
2003-08-05 15:34:45 +00:00
|
|
|
// and if the return type is not a pointer to a function.
|
2001-11-06 21:28:12 +00:00
|
|
|
//
|
2003-08-05 15:34:45 +00:00
|
|
|
if (!FTy->isVarArg() &&
|
2005-04-21 23:48:37 +00:00
|
|
|
(!isa<PointerType>(RetTy) ||
|
2002-07-25 20:58:51 +00:00
|
|
|
!isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ' '; printType(RetTy);
|
2001-11-06 21:28:12 +00:00
|
|
|
writeOperand(Operand, false);
|
|
|
|
} else {
|
|
|
|
writeOperand(Operand, true);
|
|
|
|
}
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << '(';
|
2006-12-31 05:24:50 +00:00
|
|
|
for (unsigned op = 1, Eop = I.getNumOperands(); op < Eop; ++op) {
|
|
|
|
if (op > 1)
|
|
|
|
Out << ',';
|
2008-02-19 21:38:47 +00:00
|
|
|
writeParamOperand(I.getOperand(op), PAL ? PAL->getParamAttrs(op) :
|
|
|
|
ParamAttr::None);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << " )";
|
2007-04-11 02:44:20 +00:00
|
|
|
if (PAL && PAL->getParamAttrs(0) != ParamAttr::None)
|
2007-04-09 06:10:42 +00:00
|
|
|
Out << ' ' << PAL->getParamAttrsTextByIndex(0);
|
2002-06-25 16:13:24 +00:00
|
|
|
} else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
|
2007-04-09 06:10:42 +00:00
|
|
|
const PointerType *PTy = cast<PointerType>(Operand->getType());
|
|
|
|
const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
|
|
|
|
const Type *RetTy = FTy->getReturnType();
|
2007-11-27 13:23:08 +00:00
|
|
|
const ParamAttrsList *PAL = II->getParamAttrs();
|
2003-08-05 15:34:45 +00:00
|
|
|
|
2005-05-06 20:26:43 +00:00
|
|
|
// Print the calling convention being used.
|
|
|
|
switch (II->getCallingConv()) {
|
|
|
|
case CallingConv::C: break; // default
|
2006-05-19 21:58:52 +00:00
|
|
|
case CallingConv::Fast: Out << " fastcc"; break;
|
|
|
|
case CallingConv::Cold: Out << " coldcc"; break;
|
2006-09-20 22:03:51 +00:00
|
|
|
case CallingConv::X86_StdCall: Out << "x86_stdcallcc "; break;
|
|
|
|
case CallingConv::X86_FastCall: Out << "x86_fastcallcc "; break;
|
2005-05-06 20:26:43 +00:00
|
|
|
default: Out << " cc" << II->getCallingConv(); break;
|
|
|
|
}
|
|
|
|
|
2003-08-05 15:34:45 +00:00
|
|
|
// If possible, print out the short form of the invoke instruction. We can
|
|
|
|
// only do this if the first argument is a pointer to a nonvararg function,
|
|
|
|
// and if the return type is not a pointer to a function.
|
|
|
|
//
|
|
|
|
if (!FTy->isVarArg() &&
|
2005-04-21 23:48:37 +00:00
|
|
|
(!isa<PointerType>(RetTy) ||
|
2003-08-05 15:34:45 +00:00
|
|
|
!isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ' '; printType(RetTy);
|
2003-08-05 15:34:45 +00:00
|
|
|
writeOperand(Operand, false);
|
|
|
|
} else {
|
|
|
|
writeOperand(Operand, true);
|
|
|
|
}
|
|
|
|
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << '(';
|
2006-12-31 05:24:50 +00:00
|
|
|
for (unsigned op = 3, Eop = I.getNumOperands(); op < Eop; ++op) {
|
|
|
|
if (op > 3)
|
|
|
|
Out << ',';
|
2008-02-19 21:38:47 +00:00
|
|
|
writeParamOperand(I.getOperand(op), PAL ? PAL->getParamAttrs(op-2) :
|
|
|
|
ParamAttr::None);
|
2001-10-13 06:42:36 +00:00
|
|
|
}
|
|
|
|
|
2007-01-05 17:06:19 +00:00
|
|
|
Out << " )";
|
2007-04-11 02:44:20 +00:00
|
|
|
if (PAL && PAL->getParamAttrs(0) != ParamAttr::None)
|
2007-04-09 06:10:42 +00:00
|
|
|
Out << " " << PAL->getParamAttrsTextByIndex(0);
|
2007-01-05 17:06:19 +00:00
|
|
|
Out << "\n\t\t\tto";
|
2001-10-13 06:42:36 +00:00
|
|
|
writeOperand(II->getNormalDest(), true);
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << " unwind";
|
2004-02-08 21:44:31 +00:00
|
|
|
writeOperand(II->getUnwindDest(), true);
|
2001-10-13 06:42:36 +00:00
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
} else if (const AllocationInst *AI = dyn_cast<AllocationInst>(&I)) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ' ';
|
2002-04-13 18:34:38 +00:00
|
|
|
printType(AI->getType()->getElementType());
|
|
|
|
if (AI->isArrayAllocation()) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ',';
|
2002-04-13 18:34:38 +00:00
|
|
|
writeOperand(AI->getArraySize(), true);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2005-11-05 09:21:28 +00:00
|
|
|
if (AI->getAlignment()) {
|
2005-11-05 21:20:34 +00:00
|
|
|
Out << ", align " << AI->getAlignment();
|
2005-11-05 09:21:28 +00:00
|
|
|
}
|
2001-10-13 06:42:36 +00:00
|
|
|
} else if (isa<CastInst>(I)) {
|
2003-11-17 01:17:04 +00:00
|
|
|
if (Operand) writeOperand(Operand, true); // Work with broken code
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << " to ";
|
2002-06-25 16:13:24 +00:00
|
|
|
printType(I.getType());
|
2003-10-18 05:57:43 +00:00
|
|
|
} else if (isa<VAArgInst>(I)) {
|
2003-11-17 01:17:04 +00:00
|
|
|
if (Operand) writeOperand(Operand, true); // Work with broken code
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ", ";
|
2003-05-08 02:44:12 +00:00
|
|
|
printType(I.getType());
|
2001-06-06 20:29:01 +00:00
|
|
|
} else if (Operand) { // Print the normal way...
|
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
// PrintAllTypes - Instructions who have operands of all the same type
|
2001-06-06 20:29:01 +00:00
|
|
|
// omit the type from all but the first operand. If the instruction has
|
|
|
|
// different type operands (for example br), then they are all printed.
|
|
|
|
bool PrintAllTypes = false;
|
|
|
|
const Type *TheType = Operand->getType();
|
|
|
|
|
2007-02-02 13:54:55 +00:00
|
|
|
// Select, Store and ShuffleVector always print all types.
|
2008-03-04 22:05:14 +00:00
|
|
|
if (isa<SelectInst>(I) || isa<StoreInst>(I) || isa<ShuffleVectorInst>(I)
|
|
|
|
|| isa<ReturnInst>(I)) {
|
2003-04-16 20:20:02 +00:00
|
|
|
PrintAllTypes = true;
|
|
|
|
} else {
|
|
|
|
for (unsigned i = 1, E = I.getNumOperands(); i != E; ++i) {
|
|
|
|
Operand = I.getOperand(i);
|
|
|
|
if (Operand->getType() != TheType) {
|
|
|
|
PrintAllTypes = true; // We have differing types! Print them all!
|
|
|
|
break;
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2001-10-29 16:05:51 +00:00
|
|
|
if (!PrintAllTypes) {
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << ' ';
|
2003-04-16 20:20:02 +00:00
|
|
|
printType(TheType);
|
2001-10-29 16:05:51 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
for (unsigned i = 0, E = I.getNumOperands(); i != E; ++i) {
|
2004-06-21 21:53:56 +00:00
|
|
|
if (i) Out << ',';
|
2002-06-25 16:13:24 +00:00
|
|
|
writeOperand(I.getOperand(i), PrintAllTypes);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
}
|
2007-04-22 19:24:39 +00:00
|
|
|
|
|
|
|
// Print post operand alignment for load/store
|
|
|
|
if (isa<LoadInst>(I) && cast<LoadInst>(I).getAlignment()) {
|
|
|
|
Out << ", align " << cast<LoadInst>(I).getAlignment();
|
|
|
|
} else if (isa<StoreInst>(I) && cast<StoreInst>(I).getAlignment()) {
|
|
|
|
Out << ", align " << cast<StoreInst>(I).getAlignment();
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-10-13 06:42:36 +00:00
|
|
|
printInfoComment(I);
|
2004-06-21 21:53:56 +00:00
|
|
|
Out << "\n";
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// External Interface declarations
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2003-10-30 23:41:03 +00:00
|
|
|
void Module::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine SlotTable(this);
|
2003-10-30 23:41:03 +00:00
|
|
|
AssemblyWriter W(o, SlotTable, this, AAW);
|
2002-04-08 22:03:40 +00:00
|
|
|
W.write(this);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2002-04-08 22:03:40 +00:00
|
|
|
void GlobalVariable::print(std::ostream &o) const {
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine SlotTable(getParent());
|
2003-10-30 23:41:03 +00:00
|
|
|
AssemblyWriter W(o, SlotTable, getParent(), 0);
|
2002-04-08 22:03:40 +00:00
|
|
|
W.write(this);
|
2001-09-10 20:08:19 +00:00
|
|
|
}
|
|
|
|
|
2007-04-25 14:27:10 +00:00
|
|
|
void GlobalAlias::print(std::ostream &o) const {
|
|
|
|
SlotMachine SlotTable(getParent());
|
|
|
|
AssemblyWriter W(o, SlotTable, getParent(), 0);
|
|
|
|
W.write(this);
|
|
|
|
}
|
|
|
|
|
2003-10-30 23:41:03 +00:00
|
|
|
void Function::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine SlotTable(getParent());
|
2003-10-30 23:41:03 +00:00
|
|
|
AssemblyWriter W(o, SlotTable, getParent(), AAW);
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-04-08 22:03:40 +00:00
|
|
|
W.write(this);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2006-01-24 04:13:11 +00:00
|
|
|
void InlineAsm::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperand(o, this, true, 0);
|
2006-01-24 04:13:11 +00:00
|
|
|
}
|
|
|
|
|
2003-10-30 23:41:03 +00:00
|
|
|
void BasicBlock::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine SlotTable(getParent());
|
2005-04-21 23:48:37 +00:00
|
|
|
AssemblyWriter W(o, SlotTable,
|
2003-10-30 23:41:03 +00:00
|
|
|
getParent() ? getParent()->getParent() : 0, AAW);
|
2002-04-08 22:03:40 +00:00
|
|
|
W.write(this);
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2003-10-30 23:41:03 +00:00
|
|
|
void Instruction::print(std::ostream &o, AssemblyAnnotationWriter *AAW) const {
|
2002-04-08 22:03:40 +00:00
|
|
|
const Function *F = getParent() ? getParent()->getParent() : 0;
|
2004-05-26 07:18:52 +00:00
|
|
|
SlotMachine SlotTable(F);
|
2003-10-30 23:41:03 +00:00
|
|
|
AssemblyWriter W(o, SlotTable, F ? F->getParent() : 0, AAW);
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-04-08 22:03:40 +00:00
|
|
|
W.write(this);
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-04-08 22:03:40 +00:00
|
|
|
void Constant::print(std::ostream &o) const {
|
|
|
|
if (this == 0) { o << "<null> constant value\n"; return; }
|
2002-09-10 15:53:49 +00:00
|
|
|
|
2004-06-04 21:11:51 +00:00
|
|
|
o << ' ' << getType()->getDescription() << ' ';
|
2006-03-01 22:17:00 +00:00
|
|
|
|
|
|
|
std::map<const Type *, std::string> TypeTable;
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteConstantInt(o, this, TypeTable, 0);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
void Type::print(std::ostream &o) const {
|
2002-04-08 22:03:40 +00:00
|
|
|
if (this == 0)
|
|
|
|
o << "<null Type>";
|
|
|
|
else
|
|
|
|
o << getDescription();
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2002-04-09 19:48:49 +00:00
|
|
|
void Argument::print(std::ostream &o) const {
|
2006-12-06 06:24:27 +00:00
|
|
|
WriteAsOperand(o, this, true, getParent() ? getParent()->getParent() : 0);
|
2002-04-08 22:03:40 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2004-05-25 18:14:38 +00:00
|
|
|
// Value::dump - allow easy printing of Values from the debugger.
|
|
|
|
// Located here because so much of the needed functionality is here.
|
2006-12-07 20:04:42 +00:00
|
|
|
void Value::dump() const { print(*cerr.stream()); cerr << '\n'; }
|
2004-05-25 18:14:38 +00:00
|
|
|
|
|
|
|
// Type::dump - allow easy printing of Values from the debugger.
|
|
|
|
// Located here because so much of the needed functionality is here.
|
2006-12-07 20:04:42 +00:00
|
|
|
void Type::dump() const { print(*cerr.stream()); cerr << '\n'; }
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2007-04-22 05:46:44 +00:00
|
|
|
void
|
|
|
|
ParamAttrsList::dump() const {
|
|
|
|
cerr << "PAL[ ";
|
|
|
|
for (unsigned i = 0; i < attrs.size(); ++i) {
|
|
|
|
uint16_t index = getParamIndex(i);
|
2008-02-19 21:38:47 +00:00
|
|
|
ParameterAttributes attrs = getParamAttrs(index);
|
2007-04-22 05:46:44 +00:00
|
|
|
cerr << "{" << index << "," << attrs << "} ";
|
|
|
|
}
|
2008-02-19 21:38:47 +00:00
|
|
|
|
2007-04-22 05:46:44 +00:00
|
|
|
cerr << "]\n";
|
|
|
|
}
|
|
|
|
|
2002-04-08 22:03:40 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-12-06 06:40:49 +00:00
|
|
|
// SlotMachine Implementation
|
2004-05-26 07:18:52 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#if 0
|
2006-12-07 01:30:32 +00:00
|
|
|
#define SC_DEBUG(X) cerr << X
|
2004-05-26 07:18:52 +00:00
|
|
|
#else
|
|
|
|
#define SC_DEBUG(X)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// Module level constructor. Causes the contents of the Module (sans functions)
|
|
|
|
// to be added to the slot table.
|
2005-04-21 23:48:37 +00:00
|
|
|
SlotMachine::SlotMachine(const Module *M)
|
2004-05-26 21:56:09 +00:00
|
|
|
: TheModule(M) ///< Saved for lazy initialization.
|
|
|
|
, TheFunction(0)
|
2004-08-16 07:46:33 +00:00
|
|
|
, FunctionProcessed(false)
|
2007-03-19 18:32:53 +00:00
|
|
|
, mMap(), mNext(0), fMap(), fNext(0)
|
2004-05-26 07:18:52 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// Function level constructor. Causes the contents of the Module and the one
|
|
|
|
// function provided to be added to the slot table.
|
2006-12-06 05:12:21 +00:00
|
|
|
SlotMachine::SlotMachine(const Function *F)
|
|
|
|
: TheModule(F ? F->getParent() : 0) ///< Saved for lazy initialization
|
2004-05-26 21:56:09 +00:00
|
|
|
, TheFunction(F) ///< Saved for lazy initialization
|
2004-08-16 07:46:33 +00:00
|
|
|
, FunctionProcessed(false)
|
2007-03-19 18:32:53 +00:00
|
|
|
, mMap(), mNext(0), fMap(), fNext(0)
|
2004-05-26 07:18:52 +00:00
|
|
|
{
|
2004-05-26 21:56:09 +00:00
|
|
|
}
|
|
|
|
|
2007-01-11 03:54:27 +00:00
|
|
|
inline void SlotMachine::initialize() {
|
2006-12-06 05:12:21 +00:00
|
|
|
if (TheModule) {
|
2005-04-21 23:48:37 +00:00
|
|
|
processModule();
|
2004-05-26 21:56:09 +00:00
|
|
|
TheModule = 0; ///< Prevent re-processing next time we're called.
|
|
|
|
}
|
2006-12-06 05:27:40 +00:00
|
|
|
if (TheFunction && !FunctionProcessed)
|
2005-04-21 23:48:37 +00:00
|
|
|
processFunction();
|
2004-05-26 07:18:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Iterate through all the global variables, functions, and global
|
2005-04-21 23:48:37 +00:00
|
|
|
// variable initializers and create slots for them.
|
2004-05-26 07:18:52 +00:00
|
|
|
void SlotMachine::processModule() {
|
|
|
|
SC_DEBUG("begin processModule!\n");
|
|
|
|
|
2006-12-06 06:15:43 +00:00
|
|
|
// Add all of the unnamed global variables to the value table.
|
2006-12-06 04:41:52 +00:00
|
|
|
for (Module::const_global_iterator I = TheModule->global_begin(),
|
|
|
|
E = TheModule->global_end(); I != E; ++I)
|
2006-12-06 06:15:43 +00:00
|
|
|
if (!I->hasName())
|
2007-01-09 07:55:49 +00:00
|
|
|
CreateModuleSlot(I);
|
2004-05-26 07:18:52 +00:00
|
|
|
|
2006-12-06 06:15:43 +00:00
|
|
|
// Add all the unnamed functions to the table.
|
2004-05-26 07:18:52 +00:00
|
|
|
for (Module::const_iterator I = TheModule->begin(), E = TheModule->end();
|
|
|
|
I != E; ++I)
|
2006-12-06 06:15:43 +00:00
|
|
|
if (!I->hasName())
|
2007-01-09 07:55:49 +00:00
|
|
|
CreateModuleSlot(I);
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
SC_DEBUG("end processModule!\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-05-26 21:56:09 +00:00
|
|
|
// Process the arguments, basic blocks, and instructions of a function.
|
|
|
|
void SlotMachine::processFunction() {
|
2004-05-26 07:18:52 +00:00
|
|
|
SC_DEBUG("begin processFunction!\n");
|
2007-03-19 18:32:53 +00:00
|
|
|
fNext = 0;
|
2004-05-26 07:18:52 +00:00
|
|
|
|
2006-12-06 06:15:43 +00:00
|
|
|
// Add all the function arguments with no names.
|
2005-04-21 23:48:37 +00:00
|
|
|
for(Function::const_arg_iterator AI = TheFunction->arg_begin(),
|
2005-03-15 04:54:21 +00:00
|
|
|
AE = TheFunction->arg_end(); AI != AE; ++AI)
|
2006-12-06 06:15:43 +00:00
|
|
|
if (!AI->hasName())
|
2007-01-09 07:55:49 +00:00
|
|
|
CreateFunctionSlot(AI);
|
2004-05-26 07:18:52 +00:00
|
|
|
|
|
|
|
SC_DEBUG("Inserting Instructions:\n");
|
|
|
|
|
2006-12-06 06:15:43 +00:00
|
|
|
// Add all of the basic blocks and instructions with no names.
|
2005-04-21 23:48:37 +00:00
|
|
|
for (Function::const_iterator BB = TheFunction->begin(),
|
2004-05-26 21:56:09 +00:00
|
|
|
E = TheFunction->end(); BB != E; ++BB) {
|
2006-12-06 06:15:43 +00:00
|
|
|
if (!BB->hasName())
|
2007-01-09 07:55:49 +00:00
|
|
|
CreateFunctionSlot(BB);
|
2006-12-06 06:15:43 +00:00
|
|
|
for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
|
|
|
|
if (I->getType() != Type::VoidTy && !I->hasName())
|
2007-01-09 07:55:49 +00:00
|
|
|
CreateFunctionSlot(I);
|
2004-05-26 07:18:52 +00:00
|
|
|
}
|
|
|
|
|
2004-08-16 07:46:33 +00:00
|
|
|
FunctionProcessed = true;
|
|
|
|
|
2004-05-26 07:18:52 +00:00
|
|
|
SC_DEBUG("end processFunction!\n");
|
|
|
|
}
|
|
|
|
|
2006-12-06 05:27:40 +00:00
|
|
|
/// Clean up after incorporating a function. This is the only way to get out of
|
2007-01-11 03:54:27 +00:00
|
|
|
/// the function incorporation state that affects get*Slot/Create*Slot. Function
|
2007-01-09 07:46:21 +00:00
|
|
|
/// incorporation state is indicated by TheFunction != 0.
|
2004-05-26 07:18:52 +00:00
|
|
|
void SlotMachine::purgeFunction() {
|
|
|
|
SC_DEBUG("begin purgeFunction!\n");
|
|
|
|
fMap.clear(); // Simply discard the function level map
|
2004-05-26 21:56:09 +00:00
|
|
|
TheFunction = 0;
|
2004-08-16 07:46:33 +00:00
|
|
|
FunctionProcessed = false;
|
2004-05-26 07:18:52 +00:00
|
|
|
SC_DEBUG("end purgeFunction!\n");
|
|
|
|
}
|
|
|
|
|
2007-01-11 03:54:27 +00:00
|
|
|
/// getGlobalSlot - Get the slot number of a global value.
|
|
|
|
int SlotMachine::getGlobalSlot(const GlobalValue *V) {
|
|
|
|
// Check for uninitialized state and do lazy initialization.
|
|
|
|
initialize();
|
|
|
|
|
|
|
|
// Find the type plane in the module map
|
2007-03-19 18:32:53 +00:00
|
|
|
ValueMap::const_iterator MI = mMap.find(V);
|
2007-01-11 03:54:27 +00:00
|
|
|
if (MI == mMap.end()) return -1;
|
2007-03-19 18:32:53 +00:00
|
|
|
|
|
|
|
return MI->second;
|
2007-01-11 03:54:27 +00:00
|
|
|
}
|
2004-05-26 21:56:09 +00:00
|
|
|
|
2007-01-11 03:54:27 +00:00
|
|
|
|
|
|
|
/// getLocalSlot - Get the slot number for a value that is local to a function.
|
|
|
|
int SlotMachine::getLocalSlot(const Value *V) {
|
|
|
|
assert(!isa<Constant>(V) && "Can't get a constant or global slot with this!");
|
|
|
|
|
|
|
|
// Check for uninitialized state and do lazy initialization.
|
|
|
|
initialize();
|
2004-05-26 07:18:52 +00:00
|
|
|
|
2007-03-19 18:32:53 +00:00
|
|
|
ValueMap::const_iterator FI = fMap.find(V);
|
2007-01-11 03:54:27 +00:00
|
|
|
if (FI == fMap.end()) return -1;
|
|
|
|
|
2007-03-19 18:32:53 +00:00
|
|
|
return FI->second;
|
2004-05-26 07:18:52 +00:00
|
|
|
}
|
|
|
|
|
2004-07-04 11:50:43 +00:00
|
|
|
|
2007-01-09 07:55:49 +00:00
|
|
|
/// CreateModuleSlot - Insert the specified GlobalValue* into the slot table.
|
|
|
|
void SlotMachine::CreateModuleSlot(const GlobalValue *V) {
|
2007-01-09 08:04:59 +00:00
|
|
|
assert(V && "Can't insert a null Value into SlotMachine!");
|
2007-03-19 18:32:53 +00:00
|
|
|
assert(V->getType() != Type::VoidTy && "Doesn't need a slot!");
|
|
|
|
assert(!V->hasName() && "Doesn't need a slot!");
|
2007-01-09 08:04:59 +00:00
|
|
|
|
2007-03-19 18:32:53 +00:00
|
|
|
unsigned DestSlot = mNext++;
|
|
|
|
mMap[V] = DestSlot;
|
2007-01-09 08:04:59 +00:00
|
|
|
|
2007-03-19 18:32:53 +00:00
|
|
|
SC_DEBUG(" Inserting value [" << V->getType() << "] = " << V << " slot=" <<
|
2007-01-09 08:04:59 +00:00
|
|
|
DestSlot << " [");
|
2007-04-25 14:27:10 +00:00
|
|
|
// G = Global, F = Function, A = Alias, o = other
|
|
|
|
SC_DEBUG((isa<GlobalVariable>(V) ? 'G' :
|
|
|
|
(isa<Function> ? 'F' :
|
|
|
|
(isa<GlobalAlias> ? 'A' : 'o'))) << "]\n");
|
2007-01-09 07:55:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-01-09 07:46:21 +00:00
|
|
|
/// CreateSlot - Create a new slot for the specified value if it has no name.
|
2007-01-09 07:55:49 +00:00
|
|
|
void SlotMachine::CreateFunctionSlot(const Value *V) {
|
|
|
|
const Type *VTy = V->getType();
|
2006-12-06 06:15:43 +00:00
|
|
|
assert(VTy != Type::VoidTy && !V->hasName() && "Doesn't need a slot!");
|
2007-01-09 08:04:59 +00:00
|
|
|
|
2007-03-19 18:32:53 +00:00
|
|
|
unsigned DestSlot = fNext++;
|
|
|
|
fMap[V] = DestSlot;
|
2007-01-09 08:04:59 +00:00
|
|
|
|
2006-12-06 05:55:41 +00:00
|
|
|
// G = Global, F = Function, o = other
|
2007-01-09 08:04:59 +00:00
|
|
|
SC_DEBUG(" Inserting value [" << VTy << "] = " << V << " slot=" <<
|
|
|
|
DestSlot << " [o]\n");
|
|
|
|
}
|