2002-04-08 06:31:46 +08:00
|
|
|
//===-- AsmWriter.cpp - Printing LLVM as an assembly file -----------------===//
|
2005-04-22 07:48:37 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:36:04 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-22 07:48:37 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-07 04:29:01 +08:00
|
|
|
//
|
2014-01-07 20:34:26 +08:00
|
|
|
// This library implements the functionality defined in llvm/IR/Writer.h
|
2001-06-07 04:29:01 +08:00
|
|
|
//
|
2002-04-13 02:21:53 +08:00
|
|
|
// Note that these routines must be extremely tolerant of various errors in the
|
2003-05-08 10:44:12 +08:00
|
|
|
// LLVM code, because it can be used for debugging transformations.
|
2002-04-13 02:21:53 +08:00
|
|
|
//
|
2001-06-07 04:29:01 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-05-24 06:34:33 +08:00
|
|
|
#include "AsmWriter.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
|
|
|
#include "llvm/ADT/STLExtras.h"
|
|
|
|
#include "llvm/ADT/SmallString.h"
|
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2014-01-07 20:34:26 +08:00
|
|
|
#include "llvm/IR/AssemblyAnnotationWriter.h"
|
2014-03-04 19:45:46 +08:00
|
|
|
#include "llvm/IR/CFG.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/CallingConv.h"
|
|
|
|
#include "llvm/IR/Constants.h"
|
2014-03-06 08:46:21 +08:00
|
|
|
#include "llvm/IR/DebugInfo.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/DerivedTypes.h"
|
2014-01-12 19:10:32 +08:00
|
|
|
#include "llvm/IR/IRPrintingPasses.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/InlineAsm.h"
|
|
|
|
#include "llvm/IR/IntrinsicInst.h"
|
|
|
|
#include "llvm/IR/LLVMContext.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
|
|
|
#include "llvm/IR/Operator.h"
|
2013-01-07 23:43:51 +08:00
|
|
|
#include "llvm/IR/TypeFinder.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/ValueSymbolTable.h"
|
2010-01-05 09:29:26 +08:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-10-01 04:16:54 +08:00
|
|
|
#include "llvm/Support/Dwarf.h"
|
2009-07-09 02:01:40 +08:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2009-08-13 01:23:50 +08:00
|
|
|
#include "llvm/Support/FormattedStream.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2001-09-08 00:36:04 +08:00
|
|
|
#include <algorithm>
|
2007-05-23 03:27:35 +08:00
|
|
|
#include <cctype>
|
2003-11-22 04:23:48 +08:00
|
|
|
using namespace llvm;
|
2003-11-12 06:41:34 +08:00
|
|
|
|
2005-05-16 00:13:11 +08:00
|
|
|
// Make virtual table appear in this compilation unit.
|
|
|
|
AssemblyAnnotationWriter::~AssemblyAnnotationWriter() {}
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Helper Functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
2004-07-04 19:50:43 +08:00
|
|
|
|
2001-10-30 00:37:48 +08:00
|
|
|
static const Module *getModuleFromVal(const Value *V) {
|
2003-07-23 23:30:06 +08:00
|
|
|
if (const Argument *MA = dyn_cast<Argument>(V))
|
2014-04-09 14:08:46 +08:00
|
|
|
return MA->getParent() ? MA->getParent()->getParent() : nullptr;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const BasicBlock *BB = dyn_cast<BasicBlock>(V))
|
2014-04-09 14:08:46 +08:00
|
|
|
return BB->getParent() ? BB->getParent()->getParent() : nullptr;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const Instruction *I = dyn_cast<Instruction>(V)) {
|
2014-04-09 14:08:46 +08:00
|
|
|
const Function *M = I->getParent() ? I->getParent()->getParent() : nullptr;
|
|
|
|
return M ? M->getParent() : nullptr;
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))
|
2001-10-30 00:37:48 +08:00
|
|
|
return GV->getParent();
|
2014-04-09 14:08:46 +08:00
|
|
|
return nullptr;
|
2001-10-30 00:37:48 +08:00
|
|
|
}
|
|
|
|
|
2013-02-20 15:21:42 +08:00
|
|
|
static void PrintCallingConv(unsigned cc, raw_ostream &Out) {
|
2012-09-13 23:11:12 +08:00
|
|
|
switch (cc) {
|
2013-02-20 15:21:42 +08:00
|
|
|
default: Out << "cc" << cc; break;
|
|
|
|
case CallingConv::Fast: Out << "fastcc"; break;
|
|
|
|
case CallingConv::Cold: Out << "coldcc"; break;
|
2013-11-12 06:40:22 +08:00
|
|
|
case CallingConv::WebKit_JS: Out << "webkit_jscc"; break;
|
|
|
|
case CallingConv::AnyReg: Out << "anyregcc"; break;
|
2014-01-18 03:47:03 +08:00
|
|
|
case CallingConv::PreserveMost: Out << "preserve_mostcc"; break;
|
|
|
|
case CallingConv::PreserveAll: Out << "preserve_allcc"; break;
|
2013-02-20 15:21:42 +08:00
|
|
|
case CallingConv::X86_StdCall: Out << "x86_stdcallcc"; break;
|
|
|
|
case CallingConv::X86_FastCall: Out << "x86_fastcallcc"; break;
|
|
|
|
case CallingConv::X86_ThisCall: Out << "x86_thiscallcc"; break;
|
|
|
|
case CallingConv::Intel_OCL_BI: Out << "intel_ocl_bicc"; break;
|
|
|
|
case CallingConv::ARM_APCS: Out << "arm_apcscc"; break;
|
|
|
|
case CallingConv::ARM_AAPCS: Out << "arm_aapcscc"; break;
|
|
|
|
case CallingConv::ARM_AAPCS_VFP: Out << "arm_aapcs_vfpcc"; break;
|
|
|
|
case CallingConv::MSP430_INTR: Out << "msp430_intrcc"; break;
|
|
|
|
case CallingConv::PTX_Kernel: Out << "ptx_kernel"; break;
|
|
|
|
case CallingConv::PTX_Device: Out << "ptx_device"; break;
|
2013-07-12 14:02:35 +08:00
|
|
|
case CallingConv::X86_64_SysV: Out << "x86_64_sysvcc"; break;
|
|
|
|
case CallingConv::X86_64_Win64: Out << "x86_64_win64cc"; break;
|
2013-12-15 18:01:20 +08:00
|
|
|
case CallingConv::SPIR_FUNC: Out << "spir_func"; break;
|
|
|
|
case CallingConv::SPIR_KERNEL: Out << "spir_kernel"; break;
|
2012-09-13 23:11:12 +08:00
|
|
|
}
|
|
|
|
}
|
2012-11-16 06:34:00 +08:00
|
|
|
|
2008-10-29 03:33:02 +08:00
|
|
|
// PrintEscapedString - Print each character of the specified string, escaping
|
|
|
|
// it if it is not printable or if it is an escape char.
|
2010-07-08 07:16:37 +08:00
|
|
|
static void PrintEscapedString(StringRef Name, raw_ostream &Out) {
|
2009-07-26 07:55:21 +08:00
|
|
|
for (unsigned i = 0, e = Name.size(); i != e; ++i) {
|
|
|
|
unsigned char C = Name[i];
|
2009-03-15 14:39:52 +08:00
|
|
|
if (isprint(C) && C != '\\' && C != '"')
|
2008-10-29 03:33:02 +08:00
|
|
|
Out << C;
|
|
|
|
else
|
|
|
|
Out << '\\' << hexdigit(C >> 4) << hexdigit(C & 0x0F);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-08-18 01:28:37 +08:00
|
|
|
enum PrefixType {
|
|
|
|
GlobalPrefix,
|
2014-06-28 02:19:56 +08:00
|
|
|
ComdatPrefix,
|
2008-08-18 01:28:37 +08:00
|
|
|
LabelPrefix,
|
2008-10-15 07:28:09 +08:00
|
|
|
LocalPrefix,
|
|
|
|
NoPrefix
|
2008-08-18 01:28:37 +08:00
|
|
|
};
|
|
|
|
|
2008-08-17 12:40:13 +08:00
|
|
|
/// PrintLLVMName - Turn the specified name 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). Print it out.
|
2010-07-15 06:38:02 +08:00
|
|
|
static void PrintLLVMName(raw_ostream &OS, StringRef Name, PrefixType Prefix) {
|
2011-04-24 22:30:00 +08:00
|
|
|
assert(!Name.empty() && "Cannot get empty name!");
|
2008-08-17 12:40:13 +08:00
|
|
|
switch (Prefix) {
|
2008-10-15 07:28:09 +08:00
|
|
|
case NoPrefix: break;
|
2008-08-19 13:16:28 +08:00
|
|
|
case GlobalPrefix: OS << '@'; break;
|
2014-06-28 02:19:56 +08:00
|
|
|
case ComdatPrefix: OS << '$'; break;
|
2008-08-19 13:16:28 +08:00
|
|
|
case LabelPrefix: break;
|
|
|
|
case LocalPrefix: OS << '%'; break;
|
2009-03-19 14:31:22 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-17 12:40:13 +08:00
|
|
|
// Scan the name to see if it needs quotes first.
|
2013-02-13 05:21:59 +08:00
|
|
|
bool NeedsQuotes = isdigit(static_cast<unsigned char>(Name[0]));
|
2008-08-17 12:40:13 +08:00
|
|
|
if (!NeedsQuotes) {
|
2009-07-26 07:55:21 +08:00
|
|
|
for (unsigned i = 0, e = Name.size(); i != e; ++i) {
|
2012-07-17 00:18:18 +08:00
|
|
|
// By making this unsigned, the value passed in to isalnum will always be
|
|
|
|
// in the range 0-255. This is important when building with MSVC because
|
|
|
|
// its implementation will assert. This situation can arise when dealing
|
|
|
|
// with UTF-8 multibyte characters.
|
|
|
|
unsigned char C = Name[i];
|
2013-02-13 05:21:59 +08:00
|
|
|
if (!isalnum(static_cast<unsigned char>(C)) && C != '-' && C != '.' &&
|
|
|
|
C != '_') {
|
2008-08-17 12:40:13 +08:00
|
|
|
NeedsQuotes = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-17 12:40:13 +08:00
|
|
|
// If we didn't need any quotes, just write out the name in one blast.
|
|
|
|
if (!NeedsQuotes) {
|
2009-07-26 07:55:21 +08:00
|
|
|
OS << Name;
|
2008-08-17 12:40:13 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-17 12:40:13 +08:00
|
|
|
// Okay, we need quotes. Output the quotes and escape any scary characters as
|
|
|
|
// needed.
|
|
|
|
OS << '"';
|
2009-07-26 07:55:21 +08:00
|
|
|
PrintEscapedString(Name, OS);
|
2008-08-17 12:40:13 +08:00
|
|
|
OS << '"';
|
|
|
|
}
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
/// PrintLLVMName - Turn the specified name 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). Print it out.
|
2009-08-13 04:56:03 +08:00
|
|
|
static void PrintLLVMName(raw_ostream &OS, const Value *V) {
|
2009-09-20 10:20:51 +08:00
|
|
|
PrintLLVMName(OS, V->getName(),
|
2008-08-17 12:40:13 +08:00
|
|
|
isa<GlobalValue>(V) ? GlobalPrefix : LocalPrefix);
|
|
|
|
}
|
|
|
|
|
2009-03-01 06:34:45 +08:00
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
namespace llvm {
|
2009-09-20 10:20:51 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
void TypePrinting::incorporateTypes(const Module &M) {
|
2012-08-03 08:30:35 +08:00
|
|
|
NamedTypes.run(M, false);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
// The list of struct types we got back includes all the struct types, split
|
|
|
|
// the unnamed ones out to a numbering and remove the anonymous structs.
|
|
|
|
unsigned NextNumber = 0;
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
std::vector<StructType*>::iterator NextToUse = NamedTypes.begin(), I, E;
|
|
|
|
for (I = NamedTypes.begin(), E = NamedTypes.end(); I != E; ++I) {
|
|
|
|
StructType *STy = *I;
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
// Ignore anonymous types.
|
2011-08-13 02:07:07 +08:00
|
|
|
if (STy->isLiteral())
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
continue;
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
if (STy->getName().empty())
|
|
|
|
NumberedTypes[STy] = NextNumber++;
|
|
|
|
else
|
|
|
|
*NextToUse++ = STy;
|
2009-03-01 04:25:14 +08:00
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
NamedTypes.erase(NextToUse, NamedTypes.end());
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
/// CalcTypeName - Write the specified type to the specified raw_ostream, making
|
|
|
|
/// use of type names or up references to shorten the type name where possible.
|
|
|
|
void TypePrinting::print(Type *Ty, raw_ostream &OS) {
|
2009-03-01 04:25:14 +08:00
|
|
|
switch (Ty->getTypeID()) {
|
2013-12-07 10:27:52 +08:00
|
|
|
case Type::VoidTyID: OS << "void"; return;
|
|
|
|
case Type::HalfTyID: OS << "half"; return;
|
|
|
|
case Type::FloatTyID: OS << "float"; return;
|
|
|
|
case Type::DoubleTyID: OS << "double"; return;
|
|
|
|
case Type::X86_FP80TyID: OS << "x86_fp80"; return;
|
|
|
|
case Type::FP128TyID: OS << "fp128"; return;
|
|
|
|
case Type::PPC_FP128TyID: OS << "ppc_fp128"; return;
|
|
|
|
case Type::LabelTyID: OS << "label"; return;
|
|
|
|
case Type::MetadataTyID: OS << "metadata"; return;
|
|
|
|
case Type::X86_MMXTyID: OS << "x86_mmx"; return;
|
2009-03-01 05:18:43 +08:00
|
|
|
case Type::IntegerTyID:
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << 'i' << cast<IntegerType>(Ty)->getBitWidth();
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
return;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2009-03-01 04:35:42 +08:00
|
|
|
case Type::FunctionTyID: {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
FunctionType *FTy = cast<FunctionType>(Ty);
|
|
|
|
print(FTy->getReturnType(), OS);
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << " (";
|
2009-03-01 04:35:42 +08:00
|
|
|
for (FunctionType::param_iterator I = FTy->param_begin(),
|
|
|
|
E = FTy->param_end(); I != E; ++I) {
|
|
|
|
if (I != FTy->param_begin())
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << ", ";
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
print(*I, OS);
|
2009-03-01 04:25:14 +08:00
|
|
|
}
|
2009-03-01 04:35:42 +08:00
|
|
|
if (FTy->isVarArg()) {
|
2009-03-01 05:27:31 +08:00
|
|
|
if (FTy->getNumParams()) OS << ", ";
|
|
|
|
OS << "...";
|
2009-03-01 04:25:14 +08:00
|
|
|
}
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << ')';
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
return;
|
2009-03-01 04:35:42 +08:00
|
|
|
}
|
|
|
|
case Type::StructTyID: {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
StructType *STy = cast<StructType>(Ty);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2011-08-13 02:07:07 +08:00
|
|
|
if (STy->isLiteral())
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
return printStructBody(STy, OS);
|
|
|
|
|
|
|
|
if (!STy->getName().empty())
|
|
|
|
return PrintLLVMName(OS, STy->getName(), LocalPrefix);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
DenseMap<StructType*, unsigned>::iterator I = NumberedTypes.find(STy);
|
|
|
|
if (I != NumberedTypes.end())
|
|
|
|
OS << '%' << I->second;
|
|
|
|
else // Not enumerated, print the hex address.
|
2011-11-03 01:24:36 +08:00
|
|
|
OS << "%\"type " << STy << '\"';
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
return;
|
2009-03-01 04:35:42 +08:00
|
|
|
}
|
|
|
|
case Type::PointerTyID: {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
PointerType *PTy = cast<PointerType>(Ty);
|
|
|
|
print(PTy->getElementType(), OS);
|
2009-03-01 04:35:42 +08:00
|
|
|
if (unsigned AddressSpace = PTy->getAddressSpace())
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << " addrspace(" << AddressSpace << ')';
|
|
|
|
OS << '*';
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
return;
|
2009-03-01 04:35:42 +08:00
|
|
|
}
|
|
|
|
case Type::ArrayTyID: {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
ArrayType *ATy = cast<ArrayType>(Ty);
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << '[' << ATy->getNumElements() << " x ";
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
print(ATy->getElementType(), OS);
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << ']';
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
return;
|
2009-03-01 04:35:42 +08:00
|
|
|
}
|
|
|
|
case Type::VectorTyID: {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
VectorType *PTy = cast<VectorType>(Ty);
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << "<" << PTy->getNumElements() << " x ";
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
print(PTy->getElementType(), OS);
|
2009-03-01 05:27:31 +08:00
|
|
|
OS << '>';
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
return;
|
2009-03-01 04:35:42 +08:00
|
|
|
}
|
2009-03-01 04:25:14 +08:00
|
|
|
}
|
2013-12-07 10:27:52 +08:00
|
|
|
llvm_unreachable("Invalid TypeID");
|
2009-03-01 04:25:14 +08:00
|
|
|
}
|
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
void TypePrinting::printStructBody(StructType *STy, raw_ostream &OS) {
|
|
|
|
if (STy->isOpaque()) {
|
|
|
|
OS << "opaque";
|
|
|
|
return;
|
2009-03-01 04:25:14 +08:00
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
if (STy->isPacked())
|
|
|
|
OS << '<';
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
if (STy->getNumElements() == 0) {
|
|
|
|
OS << "{}";
|
|
|
|
} else {
|
|
|
|
StructType::element_iterator I = STy->element_begin();
|
|
|
|
OS << "{ ";
|
|
|
|
print(*I++, OS);
|
|
|
|
for (StructType::element_iterator E = STy->element_end(); I != E; ++I) {
|
|
|
|
OS << ", ";
|
|
|
|
print(*I, OS);
|
2009-03-01 07:20:19 +08:00
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
OS << " }";
|
2009-03-01 07:20:19 +08:00
|
|
|
}
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
if (STy->isPacked())
|
|
|
|
OS << '>';
|
2009-03-01 07:20:19 +08:00
|
|
|
}
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// SlotTracker Class: Enumerate slot numbers for unnamed values
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// This class provides computation of slot numbers for LLVM Assembly writing.
|
|
|
|
///
|
|
|
|
class SlotTracker {
|
|
|
|
public:
|
2009-07-09 05:44:25 +08:00
|
|
|
/// ValueMap - A mapping of Values to slot numbers.
|
2008-08-19 12:36:02 +08:00
|
|
|
typedef DenseMap<const Value*, unsigned> ValueMap;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
|
|
|
private:
|
2009-07-09 05:44:25 +08:00
|
|
|
/// TheModule - The module for which we are holding slot numbers.
|
2008-08-19 12:36:02 +08:00
|
|
|
const Module* TheModule;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2009-07-09 05:44:25 +08:00
|
|
|
/// TheFunction - The function for which we are holding slot numbers.
|
2008-08-19 12:36:02 +08:00
|
|
|
const Function* TheFunction;
|
|
|
|
bool FunctionProcessed;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2011-07-11 15:28:49 +08:00
|
|
|
/// mMap - The slot map for the module level data.
|
2008-08-19 12:36:02 +08:00
|
|
|
ValueMap mMap;
|
|
|
|
unsigned mNext;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2011-07-11 15:28:49 +08:00
|
|
|
/// fMap - The slot map for the function level data.
|
2008-08-19 12:36:02 +08:00
|
|
|
ValueMap fMap;
|
|
|
|
unsigned fNext;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2009-07-09 05:44:25 +08:00
|
|
|
/// mdnMap - Map for MDNodes.
|
2009-12-31 10:20:11 +08:00
|
|
|
DenseMap<const MDNode*, unsigned> mdnMap;
|
2009-07-09 05:44:25 +08:00
|
|
|
unsigned mdnNext;
|
2013-02-11 16:43:33 +08:00
|
|
|
|
|
|
|
/// asMap - The slot map for attribute sets.
|
|
|
|
DenseMap<AttributeSet, unsigned> asMap;
|
|
|
|
unsigned asNext;
|
2008-08-19 12:36:02 +08:00
|
|
|
public:
|
|
|
|
/// Construct from a module
|
|
|
|
explicit SlotTracker(const Module *M);
|
|
|
|
/// Construct from a function, starting out in incorp state.
|
|
|
|
explicit SlotTracker(const Function *F);
|
|
|
|
|
|
|
|
/// Return the slot number of the specified value in it's type
|
|
|
|
/// plane. If something is not in the SlotTracker, return -1.
|
|
|
|
int getLocalSlot(const Value *V);
|
|
|
|
int getGlobalSlot(const GlobalValue *V);
|
2009-07-09 05:44:25 +08:00
|
|
|
int getMetadataSlot(const MDNode *N);
|
2013-02-11 16:43:33 +08:00
|
|
|
int getAttributeGroupSlot(AttributeSet AS);
|
2008-08-19 12:36:02 +08:00
|
|
|
|
|
|
|
/// If you'd like to deal with a function instead of just a module, use
|
|
|
|
/// this method to get its data into the SlotTracker.
|
|
|
|
void incorporateFunction(const Function *F) {
|
|
|
|
TheFunction = F;
|
|
|
|
FunctionProcessed = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// After calling incorporateFunction, use this method to remove the
|
|
|
|
/// most recently incorporated function from the SlotTracker. This
|
|
|
|
/// will reset the state of the machine back to just the module contents.
|
|
|
|
void purgeFunction();
|
|
|
|
|
2009-07-09 05:44:25 +08:00
|
|
|
/// MDNode map iterators.
|
2009-12-31 10:20:11 +08:00
|
|
|
typedef DenseMap<const MDNode*, unsigned>::iterator mdn_iterator;
|
|
|
|
mdn_iterator mdn_begin() { return mdnMap.begin(); }
|
|
|
|
mdn_iterator mdn_end() { return mdnMap.end(); }
|
|
|
|
unsigned mdn_size() const { return mdnMap.size(); }
|
|
|
|
bool mdn_empty() const { return mdnMap.empty(); }
|
2009-07-09 05:44:25 +08:00
|
|
|
|
2013-02-11 16:43:33 +08:00
|
|
|
/// AttributeSet map iterators.
|
|
|
|
typedef DenseMap<AttributeSet, unsigned>::iterator as_iterator;
|
|
|
|
as_iterator as_begin() { return asMap.begin(); }
|
|
|
|
as_iterator as_end() { return asMap.end(); }
|
|
|
|
unsigned as_size() const { return asMap.size(); }
|
|
|
|
bool as_empty() const { return asMap.empty(); }
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
/// This function does the actual initialization.
|
|
|
|
inline void initialize();
|
|
|
|
|
2009-07-09 05:44:25 +08:00
|
|
|
// Implementation Details
|
|
|
|
private:
|
2008-08-19 12:36:02 +08:00
|
|
|
/// CreateModuleSlot - Insert the specified GlobalValue* into the slot table.
|
|
|
|
void CreateModuleSlot(const GlobalValue *V);
|
2009-07-09 05:44:25 +08:00
|
|
|
|
|
|
|
/// CreateMetadataSlot - Insert the specified MDNode* into the slot table.
|
|
|
|
void CreateMetadataSlot(const MDNode *N);
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
/// CreateFunctionSlot - Insert the specified Value* into the slot table.
|
|
|
|
void CreateFunctionSlot(const Value *V);
|
|
|
|
|
2013-02-11 16:43:33 +08:00
|
|
|
/// \brief Insert the specified AttributeSet into the slot table.
|
|
|
|
void CreateAttributeSetSlot(AttributeSet AS);
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
/// Add all of the module level global variables (and their initializers)
|
|
|
|
/// and function declarations, but not the contents of those functions.
|
|
|
|
void processModule();
|
|
|
|
|
2009-07-09 05:44:25 +08:00
|
|
|
/// Add all of the functions arguments, basic blocks, and instructions.
|
2008-08-19 12:36:02 +08:00
|
|
|
void processFunction();
|
|
|
|
|
2012-09-16 01:09:36 +08:00
|
|
|
SlotTracker(const SlotTracker &) LLVM_DELETED_FUNCTION;
|
|
|
|
void operator=(const SlotTracker &) LLVM_DELETED_FUNCTION;
|
2008-08-19 12:36:02 +08:00
|
|
|
};
|
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
SlotTracker *createSlotTracker(const Module *M) {
|
|
|
|
return new SlotTracker(M);
|
|
|
|
}
|
2008-08-19 12:36:02 +08:00
|
|
|
|
|
|
|
static SlotTracker *createSlotTracker(const Value *V) {
|
|
|
|
if (const Argument *FA = dyn_cast<Argument>(V))
|
|
|
|
return new SlotTracker(FA->getParent());
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const Instruction *I = dyn_cast<Instruction>(V))
|
2011-10-01 03:50:40 +08:00
|
|
|
if (I->getParent())
|
|
|
|
return new SlotTracker(I->getParent()->getParent());
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const BasicBlock *BB = dyn_cast<BasicBlock>(V))
|
|
|
|
return new SlotTracker(BB->getParent());
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V))
|
|
|
|
return new SlotTracker(GV->getParent());
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(V))
|
2009-09-20 10:20:51 +08:00
|
|
|
return new SlotTracker(GA->getParent());
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (const Function *Func = dyn_cast<Function>(V))
|
|
|
|
return new SlotTracker(Func);
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2010-07-21 07:55:01 +08:00
|
|
|
if (const MDNode *MD = dyn_cast<MDNode>(V)) {
|
|
|
|
if (!MD->isFunctionLocal())
|
|
|
|
return new SlotTracker(MD->getFunction());
|
|
|
|
|
2014-04-09 14:08:46 +08:00
|
|
|
return new SlotTracker((Function *)nullptr);
|
2010-07-21 07:55:01 +08:00
|
|
|
}
|
2010-01-13 08:00:24 +08:00
|
|
|
|
2014-04-09 14:08:46 +08:00
|
|
|
return nullptr;
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
2010-01-05 09:29:26 +08:00
|
|
|
#define ST_DEBUG(X) dbgs() << X
|
2008-08-19 12:36:02 +08:00
|
|
|
#else
|
2008-08-19 12:47:09 +08:00
|
|
|
#define ST_DEBUG(X)
|
2008-08-19 12:36:02 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
// Module level constructor. Causes the contents of the Module (sans functions)
|
|
|
|
// to be added to the slot table.
|
|
|
|
SlotTracker::SlotTracker(const Module *M)
|
2014-04-09 14:08:46 +08:00
|
|
|
: TheModule(M), TheFunction(nullptr), FunctionProcessed(false),
|
2013-02-11 16:43:33 +08:00
|
|
|
mNext(0), fNext(0), mdnNext(0), asNext(0) {
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Function level constructor. Causes the contents of the Module and the one
|
|
|
|
// function provided to be added to the slot table.
|
|
|
|
SlotTracker::SlotTracker(const Function *F)
|
2014-04-09 14:08:46 +08:00
|
|
|
: TheModule(F ? F->getParent() : nullptr), TheFunction(F),
|
|
|
|
FunctionProcessed(false), mNext(0), fNext(0), mdnNext(0), asNext(0) {
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
inline void SlotTracker::initialize() {
|
|
|
|
if (TheModule) {
|
|
|
|
processModule();
|
2014-04-09 14:08:46 +08:00
|
|
|
TheModule = nullptr; ///< Prevent re-processing next time we're called.
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
if (TheFunction && !FunctionProcessed)
|
|
|
|
processFunction();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Iterate through all the global variables, functions, and global
|
|
|
|
// variable initializers and create slots for them.
|
|
|
|
void SlotTracker::processModule() {
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG("begin processModule!\n");
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
// Add all of the unnamed global variables to the value table.
|
|
|
|
for (Module::const_global_iterator I = TheModule->global_begin(),
|
2009-07-09 05:44:25 +08:00
|
|
|
E = TheModule->global_end(); I != E; ++I) {
|
2009-09-20 10:20:51 +08:00
|
|
|
if (!I->hasName())
|
2008-08-19 12:36:02 +08:00
|
|
|
CreateModuleSlot(I);
|
2009-07-09 05:44:25 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2009-07-30 06:04:47 +08:00
|
|
|
// Add metadata used by named metadata.
|
2009-09-20 10:20:51 +08:00
|
|
|
for (Module::const_named_metadata_iterator
|
2009-07-30 06:04:47 +08:00
|
|
|
I = TheModule->named_metadata_begin(),
|
|
|
|
E = TheModule->named_metadata_end(); I != E; ++I) {
|
|
|
|
const NamedMDNode *NMD = I;
|
2010-07-22 02:54:18 +08:00
|
|
|
for (unsigned i = 0, e = NMD->getNumOperands(); i != e; ++i)
|
|
|
|
CreateMetadataSlot(NMD->getOperand(i));
|
2009-07-30 06:04:47 +08:00
|
|
|
}
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
for (Module::const_iterator I = TheModule->begin(), E = TheModule->end();
|
2013-02-11 16:43:33 +08:00
|
|
|
I != E; ++I) {
|
2008-08-19 12:36:02 +08:00
|
|
|
if (!I->hasName())
|
2013-02-11 16:43:33 +08:00
|
|
|
// Add all the unnamed functions to the table.
|
2008-08-19 12:36:02 +08:00
|
|
|
CreateModuleSlot(I);
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2013-02-11 16:43:33 +08:00
|
|
|
// Add all the function attributes to the table.
|
2013-02-20 15:21:42 +08:00
|
|
|
// FIXME: Add attributes of other objects?
|
2013-02-11 16:43:33 +08:00
|
|
|
AttributeSet FnAttrs = I->getAttributes().getFnAttributes();
|
|
|
|
if (FnAttrs.hasAttributes(AttributeSet::FunctionIndex))
|
|
|
|
CreateAttributeSetSlot(FnAttrs);
|
|
|
|
}
|
|
|
|
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG("end processModule!\n");
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Process the arguments, basic blocks, and instructions of a function.
|
|
|
|
void SlotTracker::processFunction() {
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG("begin processFunction!\n");
|
2008-08-19 12:36:02 +08:00
|
|
|
fNext = 0;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
// Add all the function arguments with no names.
|
|
|
|
for(Function::const_arg_iterator AI = TheFunction->arg_begin(),
|
|
|
|
AE = TheFunction->arg_end(); AI != AE; ++AI)
|
|
|
|
if (!AI->hasName())
|
|
|
|
CreateFunctionSlot(AI);
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG("Inserting Instructions:\n");
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2009-12-31 10:13:35 +08:00
|
|
|
SmallVector<std::pair<unsigned, MDNode*>, 4> MDForInst;
|
2009-09-17 04:21:17 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
// Add all of the basic blocks and instructions with no names.
|
|
|
|
for (Function::const_iterator BB = TheFunction->begin(),
|
|
|
|
E = TheFunction->end(); BB != E; ++BB) {
|
|
|
|
if (!BB->hasName())
|
|
|
|
CreateFunctionSlot(BB);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-09-20 10:20:51 +08:00
|
|
|
for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E;
|
2009-07-09 05:44:25 +08:00
|
|
|
++I) {
|
2009-12-29 07:41:32 +08:00
|
|
|
if (!I->getType()->isVoidTy() && !I->hasName())
|
2008-08-19 12:36:02 +08:00
|
|
|
CreateFunctionSlot(I);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2010-05-11 04:53:17 +08:00
|
|
|
// Intrinsics can directly use metadata. We allow direct calls to any
|
|
|
|
// llvm.foo function here, because the target may not be linked into the
|
|
|
|
// optimizer.
|
|
|
|
if (const CallInst *CI = dyn_cast<CallInst>(I)) {
|
|
|
|
if (Function *F = CI->getCalledFunction())
|
2013-12-05 14:05:43 +08:00
|
|
|
if (F->isIntrinsic())
|
2010-05-11 04:53:17 +08:00
|
|
|
for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
|
|
|
|
if (MDNode *N = dyn_cast_or_null<MDNode>(I->getOperand(i)))
|
|
|
|
CreateMetadataSlot(N);
|
2013-02-20 08:04:41 +08:00
|
|
|
|
2013-02-22 17:09:42 +08:00
|
|
|
// Add all the call attributes to the table.
|
|
|
|
AttributeSet Attrs = CI->getAttributes().getFnAttributes();
|
|
|
|
if (Attrs.hasAttributes(AttributeSet::FunctionIndex))
|
|
|
|
CreateAttributeSetSlot(Attrs);
|
|
|
|
} else if (const InvokeInst *II = dyn_cast<InvokeInst>(I)) {
|
|
|
|
// Add all the call attributes to the table.
|
|
|
|
AttributeSet Attrs = II->getAttributes().getFnAttributes();
|
|
|
|
if (Attrs.hasAttributes(AttributeSet::FunctionIndex))
|
|
|
|
CreateAttributeSetSlot(Attrs);
|
2010-05-11 04:53:17 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2009-09-17 04:21:17 +08:00
|
|
|
// Process metadata attached with this instruction.
|
2009-12-29 07:41:32 +08:00
|
|
|
I->getAllMetadata(MDForInst);
|
|
|
|
for (unsigned i = 0, e = MDForInst.size(); i != e; ++i)
|
|
|
|
CreateMetadataSlot(MDForInst[i].second);
|
2009-12-31 10:13:35 +08:00
|
|
|
MDForInst.clear();
|
2009-07-09 05:44:25 +08:00
|
|
|
}
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
2009-09-17 04:21:17 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
FunctionProcessed = true;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG("end processFunction!\n");
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Clean up after incorporating a function. This is the only way to get out of
|
|
|
|
/// the function incorporation state that affects get*Slot/Create*Slot. Function
|
|
|
|
/// incorporation state is indicated by TheFunction != 0.
|
|
|
|
void SlotTracker::purgeFunction() {
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG("begin purgeFunction!\n");
|
2008-08-19 12:36:02 +08:00
|
|
|
fMap.clear(); // Simply discard the function level map
|
2014-04-09 14:08:46 +08:00
|
|
|
TheFunction = nullptr;
|
2008-08-19 12:36:02 +08:00
|
|
|
FunctionProcessed = false;
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG("end purgeFunction!\n");
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// getGlobalSlot - Get the slot number of a global value.
|
|
|
|
int SlotTracker::getGlobalSlot(const GlobalValue *V) {
|
|
|
|
// Check for uninitialized state and do lazy initialization.
|
|
|
|
initialize();
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2011-07-11 15:28:49 +08:00
|
|
|
// Find the value in the module map
|
2008-08-19 12:36:02 +08:00
|
|
|
ValueMap::iterator MI = mMap.find(V);
|
2008-10-02 03:58:59 +08:00
|
|
|
return MI == mMap.end() ? -1 : (int)MI->second;
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
2009-12-31 10:20:11 +08:00
|
|
|
/// getMetadataSlot - Get the slot number of a MDNode.
|
2009-07-09 05:44:25 +08:00
|
|
|
int SlotTracker::getMetadataSlot(const MDNode *N) {
|
|
|
|
// Check for uninitialized state and do lazy initialization.
|
|
|
|
initialize();
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2011-07-11 15:28:49 +08:00
|
|
|
// Find the MDNode in the module map
|
2009-12-31 10:20:11 +08:00
|
|
|
mdn_iterator MI = mdnMap.find(N);
|
2009-07-09 05:44:25 +08:00
|
|
|
return MI == mdnMap.end() ? -1 : (int)MI->second;
|
|
|
|
}
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
|
|
|
|
/// getLocalSlot - Get the slot number for a value that is local to a function.
|
|
|
|
int SlotTracker::getLocalSlot(const Value *V) {
|
|
|
|
assert(!isa<Constant>(V) && "Can't get a constant or global slot with this!");
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
// Check for uninitialized state and do lazy initialization.
|
|
|
|
initialize();
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
ValueMap::iterator FI = fMap.find(V);
|
2008-10-02 03:58:59 +08:00
|
|
|
return FI == fMap.end() ? -1 : (int)FI->second;
|
2008-08-19 12:36:02 +08:00
|
|
|
}
|
|
|
|
|
2013-02-11 16:43:33 +08:00
|
|
|
int SlotTracker::getAttributeGroupSlot(AttributeSet AS) {
|
|
|
|
// Check for uninitialized state and do lazy initialization.
|
|
|
|
initialize();
|
|
|
|
|
|
|
|
// Find the AttributeSet in the module map.
|
|
|
|
as_iterator AI = asMap.find(AS);
|
|
|
|
return AI == asMap.end() ? -1 : (int)AI->second;
|
|
|
|
}
|
2008-08-19 12:36:02 +08:00
|
|
|
|
|
|
|
/// CreateModuleSlot - Insert the specified GlobalValue* into the slot table.
|
|
|
|
void SlotTracker::CreateModuleSlot(const GlobalValue *V) {
|
|
|
|
assert(V && "Can't insert a null Value into SlotTracker!");
|
2009-12-29 15:25:48 +08:00
|
|
|
assert(!V->getType()->isVoidTy() && "Doesn't need a slot!");
|
2008-08-19 12:36:02 +08:00
|
|
|
assert(!V->hasName() && "Doesn't need a slot!");
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
unsigned DestSlot = mNext++;
|
|
|
|
mMap[V] = DestSlot;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG(" Inserting value [" << V->getType() << "] = " << V << " slot=" <<
|
2008-08-19 12:36:02 +08:00
|
|
|
DestSlot << " [");
|
|
|
|
// G = Global, F = Function, A = Alias, o = other
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG((isa<GlobalVariable>(V) ? 'G' :
|
2008-08-19 12:36:02 +08:00
|
|
|
(isa<Function>(V) ? 'F' :
|
|
|
|
(isa<GlobalAlias>(V) ? 'A' : 'o'))) << "]\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
/// CreateSlot - Create a new slot for the specified value if it has no name.
|
|
|
|
void SlotTracker::CreateFunctionSlot(const Value *V) {
|
2009-12-29 15:25:48 +08:00
|
|
|
assert(!V->getType()->isVoidTy() && !V->hasName() && "Doesn't need a slot!");
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
unsigned DestSlot = fNext++;
|
|
|
|
fMap[V] = DestSlot;
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
// G = Global, F = Function, o = other
|
2008-08-19 12:47:09 +08:00
|
|
|
ST_DEBUG(" Inserting value [" << V->getType() << "] = " << V << " slot=" <<
|
2008-08-19 12:36:02 +08:00
|
|
|
DestSlot << " [o]\n");
|
2009-09-20 10:20:51 +08:00
|
|
|
}
|
2008-08-19 12:36:02 +08:00
|
|
|
|
2009-07-09 05:44:25 +08:00
|
|
|
/// CreateModuleSlot - Insert the specified MDNode* into the slot table.
|
|
|
|
void SlotTracker::CreateMetadataSlot(const MDNode *N) {
|
|
|
|
assert(N && "Can't insert a null Value into SlotTracker!");
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2009-12-31 10:27:30 +08:00
|
|
|
// Don't insert if N is a function-local metadata, these are always printed
|
|
|
|
// inline.
|
2010-07-21 07:55:01 +08:00
|
|
|
if (!N->isFunctionLocal()) {
|
|
|
|
mdn_iterator I = mdnMap.find(N);
|
|
|
|
if (I != mdnMap.end())
|
|
|
|
return;
|
2009-07-09 05:44:25 +08:00
|
|
|
|
2010-07-21 07:55:01 +08:00
|
|
|
unsigned DestSlot = mdnNext++;
|
|
|
|
mdnMap[N] = DestSlot;
|
|
|
|
}
|
2008-08-19 12:36:02 +08:00
|
|
|
|
2009-12-31 10:27:30 +08:00
|
|
|
// Recursively add any MDNodes referenced by operands.
|
|
|
|
for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
|
|
|
|
if (const MDNode *Op = dyn_cast_or_null<MDNode>(N->getOperand(i)))
|
|
|
|
CreateMetadataSlot(Op);
|
2009-07-09 05:44:25 +08:00
|
|
|
}
|
2008-08-19 12:36:02 +08:00
|
|
|
|
2013-02-11 16:43:33 +08:00
|
|
|
void SlotTracker::CreateAttributeSetSlot(AttributeSet AS) {
|
|
|
|
assert(AS.hasAttributes(AttributeSet::FunctionIndex) &&
|
|
|
|
"Doesn't need a slot!");
|
|
|
|
|
|
|
|
as_iterator I = asMap.find(AS);
|
|
|
|
if (I != asMap.end())
|
|
|
|
return;
|
|
|
|
|
|
|
|
unsigned DestSlot = asNext++;
|
|
|
|
asMap[AS] = DestSlot;
|
|
|
|
}
|
|
|
|
|
2008-08-19 12:36:02 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AsmWriter Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-08-13 04:56:03 +08:00
|
|
|
static void WriteAsOperandInternal(raw_ostream &Out, const Value *V,
|
2009-08-13 23:27:57 +08:00
|
|
|
TypePrinting *TypePrinter,
|
2010-07-21 07:55:01 +08:00
|
|
|
SlotTracker *Machine,
|
|
|
|
const Module *Context);
|
2008-08-19 12:36:02 +08:00
|
|
|
|
2006-12-06 14:40:49 +08:00
|
|
|
static const char *getPredicateText(unsigned predicate) {
|
2006-12-04 13:19:18 +08:00
|
|
|
const char * pred = "unknown";
|
|
|
|
switch (predicate) {
|
2009-12-31 10:13:35 +08:00
|
|
|
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;
|
2006-12-04 13:19:18 +08:00
|
|
|
}
|
|
|
|
return pred;
|
|
|
|
}
|
|
|
|
|
2011-07-29 05:48:00 +08:00
|
|
|
static void writeAtomicRMWOperation(raw_ostream &Out,
|
|
|
|
AtomicRMWInst::BinOp Op) {
|
|
|
|
switch (Op) {
|
|
|
|
default: Out << " <unknown operation " << Op << ">"; break;
|
|
|
|
case AtomicRMWInst::Xchg: Out << " xchg"; break;
|
|
|
|
case AtomicRMWInst::Add: Out << " add"; break;
|
|
|
|
case AtomicRMWInst::Sub: Out << " sub"; break;
|
|
|
|
case AtomicRMWInst::And: Out << " and"; break;
|
|
|
|
case AtomicRMWInst::Nand: Out << " nand"; break;
|
|
|
|
case AtomicRMWInst::Or: Out << " or"; break;
|
|
|
|
case AtomicRMWInst::Xor: Out << " xor"; break;
|
|
|
|
case AtomicRMWInst::Max: Out << " max"; break;
|
|
|
|
case AtomicRMWInst::Min: Out << " min"; break;
|
|
|
|
case AtomicRMWInst::UMax: Out << " umax"; break;
|
|
|
|
case AtomicRMWInst::UMin: Out << " umin"; break;
|
|
|
|
}
|
|
|
|
}
|
2009-07-09 05:44:25 +08:00
|
|
|
|
2009-08-13 04:56:03 +08:00
|
|
|
static void WriteOptimizationInfo(raw_ostream &Out, const User *U) {
|
2012-11-27 08:42:44 +08:00
|
|
|
if (const FPMathOperator *FPO = dyn_cast<const FPMathOperator>(U)) {
|
|
|
|
// Unsafe algebra implies all the others, no need to write them all out
|
|
|
|
if (FPO->hasUnsafeAlgebra())
|
|
|
|
Out << " fast";
|
|
|
|
else {
|
|
|
|
if (FPO->hasNoNaNs())
|
|
|
|
Out << " nnan";
|
|
|
|
if (FPO->hasNoInfs())
|
|
|
|
Out << " ninf";
|
|
|
|
if (FPO->hasNoSignedZeros())
|
|
|
|
Out << " nsz";
|
|
|
|
if (FPO->hasAllowReciprocal())
|
|
|
|
Out << " arcp";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-21 05:19:07 +08:00
|
|
|
if (const OverflowingBinaryOperator *OBO =
|
|
|
|
dyn_cast<OverflowingBinaryOperator>(U)) {
|
2009-08-21 01:11:38 +08:00
|
|
|
if (OBO->hasNoUnsignedWrap())
|
2009-07-28 00:11:46 +08:00
|
|
|
Out << " nuw";
|
2009-08-21 01:11:38 +08:00
|
|
|
if (OBO->hasNoSignedWrap())
|
2009-07-28 00:11:46 +08:00
|
|
|
Out << " nsw";
|
2011-02-07 05:44:57 +08:00
|
|
|
} else if (const PossiblyExactOperator *Div =
|
|
|
|
dyn_cast<PossiblyExactOperator>(U)) {
|
2009-07-21 05:19:07 +08:00
|
|
|
if (Div->isExact())
|
2009-07-28 00:11:46 +08:00
|
|
|
Out << " exact";
|
2009-07-28 05:53:46 +08:00
|
|
|
} else if (const GEPOperator *GEP = dyn_cast<GEPOperator>(U)) {
|
|
|
|
if (GEP->isInBounds())
|
|
|
|
Out << " inbounds";
|
2009-07-21 05:19:07 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-07-15 04:57:55 +08:00
|
|
|
static void WriteConstantInternal(raw_ostream &Out, const Constant *CV,
|
|
|
|
TypePrinting &TypePrinter,
|
2010-07-21 07:55:01 +08:00
|
|
|
SlotTracker *Machine,
|
|
|
|
const Module *Context) {
|
2007-01-11 20:24:14 +08:00
|
|
|
if (const ConstantInt *CI = dyn_cast<ConstantInt>(CV)) {
|
2010-02-16 00:12:20 +08:00
|
|
|
if (CI->getType()->isIntegerTy(1)) {
|
2007-01-12 12:24:46 +08:00
|
|
|
Out << (CI->getZExtValue() ? "true" : "false");
|
2008-08-17 15:19:36 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
Out << CI->getValue();
|
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-17 15:19:36 +08:00
|
|
|
if (const ConstantFP *CFP = dyn_cast<ConstantFP>(CV)) {
|
2012-05-24 23:59:06 +08:00
|
|
|
if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEsingle ||
|
2011-12-17 08:04:22 +08:00
|
|
|
&CFP->getValueAPF().getSemantics() == &APFloat::IEEEdouble) {
|
2007-09-12 11:30:33 +08:00
|
|
|
// 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.
|
|
|
|
//
|
2009-01-22 04:32:55 +08:00
|
|
|
bool ignored;
|
2011-12-17 08:04:22 +08:00
|
|
|
bool isHalf = &CFP->getValueAPF().getSemantics()==&APFloat::IEEEhalf;
|
2007-09-12 11:30:33 +08:00
|
|
|
bool isDouble = &CFP->getValueAPF().getSemantics()==&APFloat::IEEEdouble;
|
2012-02-16 16:12:24 +08:00
|
|
|
bool isInf = CFP->getValueAPF().isInfinity();
|
|
|
|
bool isNaN = CFP->getValueAPF().isNaN();
|
|
|
|
if (!isHalf && !isInf && !isNaN) {
|
2011-12-17 08:04:22 +08:00
|
|
|
double Val = isDouble ? CFP->getValueAPF().convertToDouble() :
|
|
|
|
CFP->getValueAPF().convertToFloat();
|
|
|
|
SmallString<128> StrVal;
|
|
|
|
raw_svector_ostream(StrVal) << Val;
|
|
|
|
|
|
|
|
// 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!
|
2012-02-16 12:19:15 +08:00
|
|
|
if (APFloat(APFloat::IEEEdouble, StrVal).convertToDouble() == Val) {
|
2011-12-17 08:04:22 +08:00
|
|
|
Out << StrVal.str();
|
|
|
|
return;
|
|
|
|
}
|
2007-09-12 11:30:33 +08:00
|
|
|
}
|
2002-04-19 02:53:13 +08:00
|
|
|
}
|
2007-09-12 11:30:33 +08:00
|
|
|
// Otherwise we could not reparse it to exactly the same value, so we must
|
2009-01-22 04:32:55 +08:00
|
|
|
// output the string in hexadecimal format! Note that loading and storing
|
|
|
|
// floating point types changes the bits of NaNs on some hosts, notably
|
|
|
|
// x86, so we must not use these types.
|
2014-03-16 02:47:07 +08:00
|
|
|
static_assert(sizeof(double) == sizeof(uint64_t),
|
|
|
|
"assuming that double is 64 bits!");
|
2008-11-10 12:30:26 +08:00
|
|
|
char Buffer[40];
|
2009-01-22 04:32:55 +08:00
|
|
|
APFloat apf = CFP->getValueAPF();
|
2011-12-17 08:04:22 +08:00
|
|
|
// Halves and floats are represented in ASCII IR as double, convert.
|
2009-01-22 04:32:55 +08:00
|
|
|
if (!isDouble)
|
2009-09-20 10:20:51 +08:00
|
|
|
apf.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven,
|
2009-01-22 04:32:55 +08:00
|
|
|
&ignored);
|
2009-09-20 10:20:51 +08:00
|
|
|
Out << "0x" <<
|
|
|
|
utohex_buffer(uint64_t(apf.bitcastToAPInt().getZExtValue()),
|
2009-01-22 04:32:55 +08:00
|
|
|
Buffer+40);
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2012-05-24 23:59:06 +08:00
|
|
|
// Either half, or some form of long double.
|
|
|
|
// These appear as a magic letter identifying the type, then a
|
|
|
|
// fixed number of hex digits.
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << "0x";
|
2012-05-24 23:59:06 +08:00
|
|
|
// Bit position, in the current word, of the next nibble to print.
|
|
|
|
int shiftcount;
|
|
|
|
|
2009-03-24 05:16:53 +08:00
|
|
|
if (&CFP->getValueAPF().getSemantics() == &APFloat::x87DoubleExtended) {
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << 'K';
|
2009-03-24 05:16:53 +08:00
|
|
|
// api needed to prevent premature destruction
|
|
|
|
APInt api = CFP->getValueAPF().bitcastToAPInt();
|
|
|
|
const uint64_t* p = api.getRawData();
|
|
|
|
uint64_t word = p[1];
|
2012-05-24 23:59:06 +08:00
|
|
|
shiftcount = 12;
|
2009-03-24 05:16:53 +08:00
|
|
|
int width = api.getBitWidth();
|
|
|
|
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 && j+4 < width) {
|
|
|
|
word = *p;
|
|
|
|
shiftcount = 64;
|
|
|
|
if (width-j-4 < 64)
|
|
|
|
shiftcount = width-j-4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return;
|
2012-05-24 23:59:06 +08:00
|
|
|
} else if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEquad) {
|
|
|
|
shiftcount = 60;
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << 'L';
|
2012-05-24 23:59:06 +08:00
|
|
|
} else if (&CFP->getValueAPF().getSemantics() == &APFloat::PPCDoubleDouble) {
|
|
|
|
shiftcount = 60;
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << 'M';
|
2012-05-24 23:59:06 +08:00
|
|
|
} else if (&CFP->getValueAPF().getSemantics() == &APFloat::IEEEhalf) {
|
|
|
|
shiftcount = 12;
|
|
|
|
Out << 'H';
|
|
|
|
} else
|
2009-07-15 00:55:14 +08:00
|
|
|
llvm_unreachable("Unsupported floating point type");
|
2008-08-19 13:06:27 +08:00
|
|
|
// api needed to prevent premature destruction
|
2008-10-10 02:53:47 +08:00
|
|
|
APInt api = CFP->getValueAPF().bitcastToAPInt();
|
2008-08-19 13:06:27 +08:00
|
|
|
const uint64_t* p = api.getRawData();
|
|
|
|
uint64_t word = *p;
|
|
|
|
int width = api.getBitWidth();
|
|
|
|
for (int j=0; j<width; j+=4, shiftcount-=4) {
|
|
|
|
unsigned int nibble = (word>>shiftcount) & 15;
|
|
|
|
if (nibble < 10)
|
|
|
|
Out << (unsigned char)(nibble + '0');
|
2007-09-12 11:30:33 +08:00
|
|
|
else
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << (unsigned char)(nibble - 10 + 'A');
|
|
|
|
if (shiftcount == 0 && j+4 < width) {
|
|
|
|
word = *(++p);
|
|
|
|
shiftcount = 64;
|
|
|
|
if (width-j-4 < 64)
|
|
|
|
shiftcount = width-j-4;
|
2007-09-12 11:30:33 +08:00
|
|
|
}
|
|
|
|
}
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (isa<ConstantAggregateZero>(CV)) {
|
2004-02-15 13:55:15 +08:00
|
|
|
Out << "zeroinitializer";
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-10-28 11:38:12 +08:00
|
|
|
if (const BlockAddress *BA = dyn_cast<BlockAddress>(CV)) {
|
|
|
|
Out << "blockaddress(";
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, BA->getFunction(), &TypePrinter, Machine,
|
|
|
|
Context);
|
2009-10-28 11:38:12 +08:00
|
|
|
Out << ", ";
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, BA->getBasicBlock(), &TypePrinter, Machine,
|
|
|
|
Context);
|
2009-10-28 11:38:12 +08:00
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (const ConstantArray *CA = dyn_cast<ConstantArray>(CV)) {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
Type *ETy = CA->getType()->getElementType();
|
2012-02-05 10:29:43 +08:00
|
|
|
Out << '[';
|
|
|
|
TypePrinter.print(ETy, Out);
|
|
|
|
Out << ' ';
|
|
|
|
WriteAsOperandInternal(Out, CA->getOperand(0),
|
|
|
|
&TypePrinter, Machine,
|
|
|
|
Context);
|
|
|
|
for (unsigned i = 1, e = CA->getNumOperands(); i != e; ++i) {
|
|
|
|
Out << ", ";
|
2012-01-31 11:15:40 +08:00
|
|
|
TypePrinter.print(ETy, Out);
|
|
|
|
Out << ' ';
|
2012-02-05 10:29:43 +08:00
|
|
|
WriteAsOperandInternal(Out, CA->getOperand(i), &TypePrinter, Machine,
|
2012-01-31 11:15:40 +08:00
|
|
|
Context);
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
2012-02-05 10:29:43 +08:00
|
|
|
Out << ']';
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2012-11-16 06:34:00 +08:00
|
|
|
|
2012-01-26 10:32:04 +08:00
|
|
|
if (const ConstantDataArray *CA = dyn_cast<ConstantDataArray>(CV)) {
|
|
|
|
// As a special case, print the array as a string if it is an array of
|
|
|
|
// i8 with ConstantInt values.
|
|
|
|
if (CA->isString()) {
|
|
|
|
Out << "c\"";
|
|
|
|
PrintEscapedString(CA->getAsString(), Out);
|
|
|
|
Out << '"';
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
Type *ETy = CA->getType()->getElementType();
|
|
|
|
Out << '[';
|
2012-01-31 11:15:40 +08:00
|
|
|
TypePrinter.print(ETy, Out);
|
|
|
|
Out << ' ';
|
|
|
|
WriteAsOperandInternal(Out, CA->getElementAsConstant(0),
|
|
|
|
&TypePrinter, Machine,
|
|
|
|
Context);
|
|
|
|
for (unsigned i = 1, e = CA->getNumElements(); i != e; ++i) {
|
|
|
|
Out << ", ";
|
2012-01-26 10:32:04 +08:00
|
|
|
TypePrinter.print(ETy, Out);
|
|
|
|
Out << ' ';
|
2012-01-31 11:15:40 +08:00
|
|
|
WriteAsOperandInternal(Out, CA->getElementAsConstant(i), &TypePrinter,
|
|
|
|
Machine, Context);
|
2012-01-26 10:32:04 +08:00
|
|
|
}
|
2012-01-31 11:15:40 +08:00
|
|
|
Out << ']';
|
2012-01-26 10:32:04 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(CV)) {
|
2007-01-09 02:21:30 +08:00
|
|
|
if (CS->getType()->isPacked())
|
|
|
|
Out << '<';
|
2004-06-05 05:11:51 +08:00
|
|
|
Out << '{';
|
2006-02-25 20:27:03 +08:00
|
|
|
unsigned N = CS->getNumOperands();
|
|
|
|
if (N) {
|
2008-08-19 12:47:09 +08:00
|
|
|
Out << ' ';
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(CS->getOperand(0)->getType(), Out);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2002-04-17 05:36:08 +08:00
|
|
|
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, CS->getOperand(0), &TypePrinter, Machine,
|
|
|
|
Context);
|
2002-04-17 05:36:08 +08:00
|
|
|
|
2006-02-25 20:27:03 +08:00
|
|
|
for (unsigned i = 1; i < N; i++) {
|
2002-04-17 05:36:08 +08:00
|
|
|
Out << ", ";
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(CS->getOperand(i)->getType(), Out);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2002-04-17 05:36:08 +08:00
|
|
|
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, CS->getOperand(i), &TypePrinter, Machine,
|
|
|
|
Context);
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << '}';
|
2007-01-09 02:21:30 +08:00
|
|
|
if (CS->getType()->isPacked())
|
|
|
|
Out << '>';
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2012-01-26 10:32:04 +08:00
|
|
|
if (isa<ConstantVector>(CV) || isa<ConstantDataVector>(CV)) {
|
|
|
|
Type *ETy = CV->getType()->getVectorElementType();
|
2009-02-11 08:25:25 +08:00
|
|
|
Out << '<';
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(ETy, Out);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2012-01-26 10:32:04 +08:00
|
|
|
WriteAsOperandInternal(Out, CV->getAggregateElement(0U), &TypePrinter,
|
|
|
|
Machine, Context);
|
|
|
|
for (unsigned i = 1, e = CV->getType()->getVectorNumElements(); i != e;++i){
|
2008-08-19 13:26:17 +08:00
|
|
|
Out << ", ";
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(ETy, Out);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2012-01-26 10:32:04 +08:00
|
|
|
WriteAsOperandInternal(Out, CV->getAggregateElement(i), &TypePrinter,
|
|
|
|
Machine, Context);
|
2008-08-19 13:06:27 +08:00
|
|
|
}
|
2009-02-11 08:25:25 +08:00
|
|
|
Out << '>';
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (isa<ConstantPointerNull>(CV)) {
|
2002-04-17 05:36:08 +08:00
|
|
|
Out << "null";
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (isa<UndefValue>(CV)) {
|
2004-10-17 02:08:06 +08:00
|
|
|
Out << "undef";
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CV)) {
|
2006-12-04 13:19:18 +08:00
|
|
|
Out << CE->getOpcodeName();
|
2009-07-28 00:11:46 +08:00
|
|
|
WriteOptimizationInfo(Out, CE);
|
2006-12-04 13:19:18 +08:00
|
|
|
if (CE->isCompare())
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << ' ' << getPredicateText(CE->getPredicate());
|
2006-12-04 13:19:18 +08:00
|
|
|
Out << " (";
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2002-07-15 07:14:45 +08:00
|
|
|
for (User::const_op_iterator OI=CE->op_begin(); OI != CE->op_end(); ++OI) {
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print((*OI)->getType(), Out);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, *OI, &TypePrinter, Machine, Context);
|
2002-07-15 07:14:45 +08:00
|
|
|
if (OI+1 != CE->op_end())
|
2002-07-31 02:54:25 +08:00
|
|
|
Out << ", ";
|
2002-07-15 07:14:45 +08:00
|
|
|
}
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2008-06-01 03:12:39 +08:00
|
|
|
if (CE->hasIndices()) {
|
2011-04-13 23:22:40 +08:00
|
|
|
ArrayRef<unsigned> Indices = CE->getIndices();
|
2008-06-01 03:12:39 +08:00
|
|
|
for (unsigned i = 0, e = Indices.size(); i != e; ++i)
|
|
|
|
Out << ", " << Indices[i];
|
|
|
|
}
|
|
|
|
|
2006-11-27 09:05:10 +08:00
|
|
|
if (CE->isCast()) {
|
2002-08-16 03:37:43 +08:00
|
|
|
Out << " to ";
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(CE->getType(), Out);
|
2002-08-16 03:37:43 +08:00
|
|
|
}
|
2006-11-27 09:05:10 +08:00
|
|
|
|
2004-06-05 05:11:51 +08:00
|
|
|
Out << ')';
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << "<placeholder or erroneous Constant>";
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
|
|
|
|
2009-12-31 10:31:59 +08:00
|
|
|
static void WriteMDNodeBodyInternal(raw_ostream &Out, const MDNode *Node,
|
|
|
|
TypePrinting *TypePrinter,
|
2010-07-21 07:55:01 +08:00
|
|
|
SlotTracker *Machine,
|
|
|
|
const Module *Context) {
|
2009-12-31 10:31:59 +08:00
|
|
|
Out << "!{";
|
|
|
|
for (unsigned mi = 0, me = Node->getNumOperands(); mi != me; ++mi) {
|
|
|
|
const Value *V = Node->getOperand(mi);
|
2014-04-09 14:08:46 +08:00
|
|
|
if (!V)
|
2009-12-31 10:31:59 +08:00
|
|
|
Out << "null";
|
|
|
|
else {
|
|
|
|
TypePrinter->print(V->getType(), Out);
|
|
|
|
Out << ' ';
|
2011-10-01 03:48:58 +08:00
|
|
|
WriteAsOperandInternal(Out, Node->getOperand(mi),
|
2010-07-21 07:55:01 +08:00
|
|
|
TypePrinter, Machine, Context);
|
2009-12-31 10:31:59 +08:00
|
|
|
}
|
|
|
|
if (mi + 1 != me)
|
|
|
|
Out << ", ";
|
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-12-31 10:31:59 +08:00
|
|
|
Out << "}";
|
|
|
|
}
|
|
|
|
|
2014-01-09 10:29:41 +08:00
|
|
|
// Full implementation of printing a Value as an operand with support for
|
|
|
|
// TypePrinting, etc.
|
2009-08-13 04:56:03 +08:00
|
|
|
static void WriteAsOperandInternal(raw_ostream &Out, const Value *V,
|
2009-08-13 23:27:57 +08:00
|
|
|
TypePrinting *TypePrinter,
|
2010-07-21 07:55:01 +08:00
|
|
|
SlotTracker *Machine,
|
|
|
|
const Module *Context) {
|
2008-08-17 12:40:13 +08:00
|
|
|
if (V->hasName()) {
|
|
|
|
PrintLLVMName(Out, V);
|
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-17 12:40:13 +08:00
|
|
|
const Constant *CV = dyn_cast<Constant>(V);
|
|
|
|
if (CV && !isa<GlobalValue>(CV)) {
|
2009-08-13 23:27:57 +08:00
|
|
|
assert(TypePrinter && "Constants require TypePrinting!");
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteConstantInternal(Out, CV, *TypePrinter, Machine, Context);
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (const InlineAsm *IA = dyn_cast<InlineAsm>(V)) {
|
2008-08-17 12:40:13 +08:00
|
|
|
Out << "asm ";
|
|
|
|
if (IA->hasSideEffects())
|
|
|
|
Out << "sideeffect ";
|
2009-10-22 07:28:00 +08:00
|
|
|
if (IA->isAlignStack())
|
|
|
|
Out << "alignstack ";
|
2012-09-06 03:00:49 +08:00
|
|
|
// We don't emit the AD_ATT dialect as it's the assumed default.
|
|
|
|
if (IA->getDialect() == InlineAsm::AD_Intel)
|
|
|
|
Out << "inteldialect ";
|
2008-08-17 12:40:13 +08:00
|
|
|
Out << '"';
|
|
|
|
PrintEscapedString(IA->getAsmString(), Out);
|
|
|
|
Out << "\", \"";
|
|
|
|
PrintEscapedString(IA->getConstraintString(), Out);
|
|
|
|
Out << '"';
|
2008-08-19 13:06:27 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-07-23 01:43:22 +08:00
|
|
|
|
2009-07-23 09:07:34 +08:00
|
|
|
if (const MDNode *N = dyn_cast<MDNode>(V)) {
|
2009-12-19 04:09:14 +08:00
|
|
|
if (N->isFunctionLocal()) {
|
2009-12-04 09:35:02 +08:00
|
|
|
// Print metadata inline, not via slot reference number.
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteMDNodeBodyInternal(Out, N, TypePrinter, Machine, Context);
|
2009-12-04 09:35:02 +08:00
|
|
|
return;
|
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2010-07-21 07:55:01 +08:00
|
|
|
if (!Machine) {
|
|
|
|
if (N->isFunctionLocal())
|
|
|
|
Machine = new SlotTracker(N->getFunction());
|
|
|
|
else
|
|
|
|
Machine = new SlotTracker(Context);
|
|
|
|
}
|
2010-09-10 04:53:58 +08:00
|
|
|
int Slot = Machine->getMetadataSlot(N);
|
|
|
|
if (Slot == -1)
|
|
|
|
Out << "<badref>";
|
|
|
|
else
|
|
|
|
Out << '!' << Slot;
|
2009-07-23 09:07:34 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-07-23 01:43:22 +08:00
|
|
|
if (const MDString *MDS = dyn_cast<MDString>(V)) {
|
|
|
|
Out << "!\"";
|
2009-07-26 07:55:21 +08:00
|
|
|
PrintEscapedString(MDS->getString(), Out);
|
2009-07-23 01:43:22 +08:00
|
|
|
Out << '"';
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
char Prefix = '%';
|
|
|
|
int Slot;
|
2011-08-03 14:15:41 +08:00
|
|
|
// If we have a SlotTracker, use it.
|
2008-08-19 13:06:27 +08:00
|
|
|
if (Machine) {
|
|
|
|
if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
|
|
|
|
Slot = Machine->getGlobalSlot(GV);
|
|
|
|
Prefix = '@';
|
|
|
|
} else {
|
|
|
|
Slot = Machine->getLocalSlot(V);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2011-08-03 14:15:41 +08:00
|
|
|
// If the local value didn't succeed, then we may be referring to a value
|
|
|
|
// from a different function. Translate it, as this can happen when using
|
|
|
|
// address of blocks.
|
|
|
|
if (Slot == -1)
|
|
|
|
if ((Machine = createSlotTracker(V))) {
|
|
|
|
Slot = Machine->getLocalSlot(V);
|
|
|
|
delete Machine;
|
|
|
|
}
|
2008-08-19 13:06:27 +08:00
|
|
|
}
|
2011-08-03 14:15:41 +08:00
|
|
|
} else if ((Machine = createSlotTracker(V))) {
|
|
|
|
// Otherwise, create one to get the # and then destroy it.
|
|
|
|
if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
|
|
|
|
Slot = Machine->getGlobalSlot(GV);
|
|
|
|
Prefix = '@';
|
2006-01-26 06:26:05 +08:00
|
|
|
} else {
|
2011-08-03 14:15:41 +08:00
|
|
|
Slot = Machine->getLocalSlot(V);
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
2011-08-03 14:15:41 +08:00
|
|
|
delete Machine;
|
2014-04-09 14:08:46 +08:00
|
|
|
Machine = nullptr;
|
2011-08-03 14:15:41 +08:00
|
|
|
} else {
|
|
|
|
Slot = -1;
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
if (Slot != -1)
|
|
|
|
Out << Prefix << Slot;
|
|
|
|
else
|
|
|
|
Out << "<badref>";
|
2002-04-17 05:36:08 +08:00
|
|
|
}
|
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
void AssemblyWriter::init() {
|
2014-06-28 02:19:56 +08:00
|
|
|
if (!TheModule)
|
|
|
|
return;
|
|
|
|
TypePrinter.incorporateTypes(*TheModule);
|
|
|
|
for (const Function &F : *TheModule)
|
|
|
|
if (const Comdat *C = F.getComdat())
|
|
|
|
Comdats.insert(C);
|
|
|
|
for (const GlobalVariable &GV : TheModule->globals())
|
|
|
|
if (const Comdat *C = GV.getComdat())
|
|
|
|
Comdats.insert(C);
|
2013-05-09 04:38:31 +08:00
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
AssemblyWriter::AssemblyWriter(formatted_raw_ostream &o, SlotTracker &Mac,
|
|
|
|
const Module *M,
|
|
|
|
AssemblyAnnotationWriter *AAW)
|
|
|
|
: Out(o), TheModule(M), Machine(Mac), AnnotationWriter(AAW) {
|
|
|
|
init();
|
|
|
|
}
|
2002-04-19 02:53:13 +08:00
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
AssemblyWriter::AssemblyWriter(formatted_raw_ostream &o, const Module *M,
|
|
|
|
AssemblyAnnotationWriter *AAW)
|
|
|
|
: Out(o), TheModule(M), ModuleSlotTracker(createSlotTracker(M)),
|
|
|
|
Machine(*ModuleSlotTracker), AnnotationWriter(AAW) {
|
|
|
|
init();
|
|
|
|
}
|
2009-12-31 10:13:35 +08:00
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
AssemblyWriter::~AssemblyWriter() { }
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2006-12-06 14:24:27 +08:00
|
|
|
void AssemblyWriter::writeOperand(const Value *Operand, bool PrintType) {
|
2014-04-09 14:08:46 +08:00
|
|
|
if (!Operand) {
|
2005-02-25 00:58:29 +08:00
|
|
|
Out << "<null operand!>";
|
2009-12-31 10:33:14 +08:00
|
|
|
return;
|
2005-02-25 00:58:29 +08:00
|
|
|
}
|
2009-12-31 10:33:14 +08:00
|
|
|
if (PrintType) {
|
|
|
|
TypePrinter.print(Operand->getType(), Out);
|
|
|
|
Out << ' ';
|
|
|
|
}
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, Operand, &TypePrinter, &Machine, TheModule);
|
2001-09-08 00:36:04 +08:00
|
|
|
}
|
|
|
|
|
2011-07-26 07:16:38 +08:00
|
|
|
void AssemblyWriter::writeAtomic(AtomicOrdering Ordering,
|
|
|
|
SynchronizationScope SynchScope) {
|
|
|
|
if (Ordering == NotAtomic)
|
|
|
|
return;
|
|
|
|
|
|
|
|
switch (SynchScope) {
|
|
|
|
case SingleThread: Out << " singlethread"; break;
|
|
|
|
case CrossThread: break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (Ordering) {
|
|
|
|
default: Out << " <bad ordering " << int(Ordering) << ">"; break;
|
|
|
|
case Unordered: Out << " unordered"; break;
|
|
|
|
case Monotonic: Out << " monotonic"; break;
|
|
|
|
case Acquire: Out << " acquire"; break;
|
|
|
|
case Release: Out << " release"; break;
|
|
|
|
case AcquireRelease: Out << " acq_rel"; break;
|
|
|
|
case SequentiallyConsistent: Out << " seq_cst"; break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-03-11 18:48:52 +08:00
|
|
|
void AssemblyWriter::writeAtomicCmpXchg(AtomicOrdering SuccessOrdering,
|
|
|
|
AtomicOrdering FailureOrdering,
|
|
|
|
SynchronizationScope SynchScope) {
|
|
|
|
assert(SuccessOrdering != NotAtomic && FailureOrdering != NotAtomic);
|
|
|
|
|
|
|
|
switch (SynchScope) {
|
|
|
|
case SingleThread: Out << " singlethread"; break;
|
|
|
|
case CrossThread: break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (SuccessOrdering) {
|
|
|
|
default: Out << " <bad ordering " << int(SuccessOrdering) << ">"; break;
|
|
|
|
case Unordered: Out << " unordered"; break;
|
|
|
|
case Monotonic: Out << " monotonic"; break;
|
|
|
|
case Acquire: Out << " acquire"; break;
|
|
|
|
case Release: Out << " release"; break;
|
|
|
|
case AcquireRelease: Out << " acq_rel"; break;
|
|
|
|
case SequentiallyConsistent: Out << " seq_cst"; break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (FailureOrdering) {
|
|
|
|
default: Out << " <bad ordering " << int(FailureOrdering) << ">"; break;
|
|
|
|
case Unordered: Out << " unordered"; break;
|
|
|
|
case Monotonic: Out << " monotonic"; break;
|
|
|
|
case Acquire: Out << " acquire"; break;
|
|
|
|
case Release: Out << " release"; break;
|
|
|
|
case AcquireRelease: Out << " acq_rel"; break;
|
|
|
|
case SequentiallyConsistent: Out << " seq_cst"; break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-20 10:20:51 +08:00
|
|
|
void AssemblyWriter::writeParamOperand(const Value *Operand,
|
2012-12-30 21:50:49 +08:00
|
|
|
AttributeSet Attrs, unsigned Idx) {
|
2014-04-09 14:08:46 +08:00
|
|
|
if (!Operand) {
|
2007-11-27 21:23:08 +08:00
|
|
|
Out << "<null operand!>";
|
2009-12-31 10:33:14 +08:00
|
|
|
return;
|
2007-11-27 21:23:08 +08:00
|
|
|
}
|
2009-12-31 10:33:14 +08:00
|
|
|
|
|
|
|
// Print the type
|
|
|
|
TypePrinter.print(Operand->getType(), Out);
|
|
|
|
// Print parameter attributes list
|
2012-12-30 21:50:49 +08:00
|
|
|
if (Attrs.hasAttributes(Idx))
|
|
|
|
Out << ' ' << Attrs.getAsString(Idx);
|
2009-12-31 10:33:14 +08:00
|
|
|
Out << ' ';
|
|
|
|
// Print the operand
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, Operand, &TypePrinter, &Machine, TheModule);
|
2007-11-27 21:23:08 +08:00
|
|
|
}
|
2001-09-08 00:36:04 +08:00
|
|
|
|
2001-10-30 00:05:51 +08:00
|
|
|
void AssemblyWriter::printModule(const Module *M) {
|
2013-02-11 16:43:33 +08:00
|
|
|
Machine.initialize();
|
|
|
|
|
2005-03-03 07:12:40 +08:00
|
|
|
if (!M->getModuleIdentifier().empty() &&
|
2005-04-22 07:48:37 +08:00
|
|
|
// Don't print the ID if it will start a new line (which would
|
2005-03-03 07:12:40 +08:00
|
|
|
// require a comment char before it).
|
|
|
|
M->getModuleIdentifier().find('\n') == std::string::npos)
|
|
|
|
Out << "; ModuleID = '" << M->getModuleIdentifier() << "'\n";
|
|
|
|
|
2014-02-26 04:01:08 +08:00
|
|
|
const std::string &DL = M->getDataLayoutStr();
|
|
|
|
if (!DL.empty())
|
|
|
|
Out << "target datalayout = \"" << DL << "\"\n";
|
2004-07-26 05:44:54 +08:00
|
|
|
if (!M->getTargetTriple().empty())
|
2004-07-26 05:29:43 +08:00
|
|
|
Out << "target triple = \"" << M->getTargetTriple() << "\"\n";
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2006-01-24 12:13:11 +08:00
|
|
|
if (!M->getModuleInlineAsm().empty()) {
|
2006-01-24 08:45:30 +08:00
|
|
|
// Split the string into lines, to make it easier to read the .ll file.
|
2006-01-24 12:13:11 +08:00
|
|
|
std::string Asm = M->getModuleInlineAsm();
|
2006-01-24 08:45:30 +08:00
|
|
|
size_t CurPos = 0;
|
|
|
|
size_t NewLine = Asm.find_first_of('\n', CurPos);
|
2009-08-13 07:54:22 +08:00
|
|
|
Out << '\n';
|
2006-01-24 08:45:30 +08:00
|
|
|
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);
|
|
|
|
}
|
2011-03-02 12:14:42 +08:00
|
|
|
std::string rest(Asm.begin()+CurPos, Asm.end());
|
|
|
|
if (!rest.empty()) {
|
|
|
|
Out << "module asm \"";
|
|
|
|
PrintEscapedString(rest, Out);
|
|
|
|
Out << "\"\n";
|
|
|
|
}
|
2006-01-24 07:03:36 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
printTypeIdentities();
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2014-06-28 02:19:56 +08:00
|
|
|
// Output all comdats.
|
|
|
|
if (!Comdats.empty())
|
|
|
|
Out << '\n';
|
|
|
|
for (const Comdat *C : Comdats) {
|
|
|
|
printComdat(C);
|
|
|
|
if (C != Comdats.back())
|
|
|
|
Out << '\n';
|
|
|
|
}
|
|
|
|
|
2009-08-13 07:54:22 +08:00
|
|
|
// Output all globals.
|
|
|
|
if (!M->global_empty()) Out << '\n';
|
2006-12-06 12:41:52 +08:00
|
|
|
for (Module::const_global_iterator I = M->global_begin(), E = M->global_end();
|
2012-09-12 17:55:51 +08:00
|
|
|
I != E; ++I) {
|
|
|
|
printGlobal(I); Out << '\n';
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2007-04-26 10:24:10 +08: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-08 00:36:04 +08:00
|
|
|
|
2004-09-14 13:06:58 +08:00
|
|
|
// Output all of the functions.
|
2002-06-26 00:13:24 +08:00
|
|
|
for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
|
|
|
|
printFunction(I);
|
2009-07-09 05:44:25 +08:00
|
|
|
|
2013-02-11 16:43:33 +08:00
|
|
|
// Output all attribute groups.
|
2013-04-30 07:48:06 +08:00
|
|
|
if (!Machine.as_empty()) {
|
2013-02-11 16:43:33 +08:00
|
|
|
Out << '\n';
|
|
|
|
writeAllAttributeGroups();
|
|
|
|
}
|
|
|
|
|
2009-07-30 06:04:47 +08:00
|
|
|
// Output named metadata.
|
2009-08-13 07:54:22 +08:00
|
|
|
if (!M->named_metadata_empty()) Out << '\n';
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-07-30 06:04:47 +08:00
|
|
|
for (Module::const_named_metadata_iterator I = M->named_metadata_begin(),
|
2009-12-31 10:13:35 +08:00
|
|
|
E = M->named_metadata_end(); I != E; ++I)
|
2009-12-31 09:54:05 +08:00
|
|
|
printNamedMDNode(I);
|
2009-07-30 06:04:47 +08:00
|
|
|
|
|
|
|
// Output metadata.
|
2009-12-31 10:20:11 +08:00
|
|
|
if (!Machine.mdn_empty()) {
|
2009-12-31 10:13:35 +08:00
|
|
|
Out << '\n';
|
|
|
|
writeAllMDNodes();
|
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2009-12-31 09:54:05 +08:00
|
|
|
void AssemblyWriter::printNamedMDNode(const NamedMDNode *NMD) {
|
2011-06-15 14:37:58 +08:00
|
|
|
Out << '!';
|
|
|
|
StringRef Name = NMD->getName();
|
|
|
|
if (Name.empty()) {
|
|
|
|
Out << "<empty name> ";
|
|
|
|
} else {
|
2013-02-13 05:21:59 +08:00
|
|
|
if (isalpha(static_cast<unsigned char>(Name[0])) ||
|
|
|
|
Name[0] == '-' || Name[0] == '$' ||
|
2011-06-15 14:37:58 +08:00
|
|
|
Name[0] == '.' || Name[0] == '_')
|
|
|
|
Out << Name[0];
|
|
|
|
else
|
|
|
|
Out << '\\' << hexdigit(Name[0] >> 4) << hexdigit(Name[0] & 0x0F);
|
|
|
|
for (unsigned i = 1, e = Name.size(); i != e; ++i) {
|
|
|
|
unsigned char C = Name[i];
|
2013-02-13 05:21:59 +08:00
|
|
|
if (isalnum(static_cast<unsigned char>(C)) || C == '-' || C == '$' ||
|
|
|
|
C == '.' || C == '_')
|
2011-06-15 14:37:58 +08:00
|
|
|
Out << C;
|
|
|
|
else
|
|
|
|
Out << '\\' << hexdigit(C >> 4) << hexdigit(C & 0x0F);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Out << " = !{";
|
2009-12-31 09:54:05 +08:00
|
|
|
for (unsigned i = 0, e = NMD->getNumOperands(); i != e; ++i) {
|
|
|
|
if (i) Out << ", ";
|
2010-09-10 04:53:58 +08:00
|
|
|
int Slot = Machine.getMetadataSlot(NMD->getOperand(i));
|
|
|
|
if (Slot == -1)
|
|
|
|
Out << "<badref>";
|
|
|
|
else
|
|
|
|
Out << '!' << Slot;
|
2009-12-31 09:54:05 +08:00
|
|
|
}
|
|
|
|
Out << "}\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-08-13 01:23:50 +08:00
|
|
|
static void PrintLinkage(GlobalValue::LinkageTypes LT,
|
|
|
|
formatted_raw_ostream &Out) {
|
2008-08-19 13:06:27 +08:00
|
|
|
switch (LT) {
|
2009-07-20 09:03:30 +08:00
|
|
|
case GlobalValue::ExternalLinkage: break;
|
|
|
|
case GlobalValue::PrivateLinkage: Out << "private "; break;
|
|
|
|
case GlobalValue::InternalLinkage: Out << "internal "; break;
|
|
|
|
case GlobalValue::LinkOnceAnyLinkage: Out << "linkonce "; break;
|
|
|
|
case GlobalValue::LinkOnceODRLinkage: Out << "linkonce_odr "; break;
|
|
|
|
case GlobalValue::WeakAnyLinkage: Out << "weak "; break;
|
|
|
|
case GlobalValue::WeakODRLinkage: Out << "weak_odr "; break;
|
|
|
|
case GlobalValue::CommonLinkage: Out << "common "; break;
|
|
|
|
case GlobalValue::AppendingLinkage: Out << "appending "; break;
|
|
|
|
case GlobalValue::ExternalWeakLinkage: Out << "extern_weak "; break;
|
2009-04-13 13:44:34 +08:00
|
|
|
case GlobalValue::AvailableExternallyLinkage:
|
|
|
|
Out << "available_externally ";
|
|
|
|
break;
|
2008-08-19 13:06:27 +08:00
|
|
|
}
|
|
|
|
}
|
Introduce new linkage types linkonce_odr, weak_odr, common_odr
and extern_weak_odr. These are the same as the non-odr versions,
except that they indicate that the global will only be overridden
by an *equivalent* global. In C, a function with weak linkage can
be overridden by a function which behaves completely differently.
This means that IP passes have to skip weak functions, since any
deductions made from the function definition might be wrong, since
the definition could be replaced by something completely different
at link time. This is not allowed in C++, thanks to the ODR
(One-Definition-Rule): if a function is replaced by another at
link-time, then the new function must be the same as the original
function. If a language knows that a function or other global can
only be overridden by an equivalent global, it can give it the
weak_odr linkage type, and the optimizers will understand that it
is alright to make deductions based on the function body. The
code generators on the other hand map weak and weak_odr linkage
to the same thing.
llvm-svn: 66339
2009-03-07 23:45:40 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
|
|
|
|
static void PrintVisibility(GlobalValue::VisibilityTypes Vis,
|
2009-08-13 01:23:50 +08:00
|
|
|
formatted_raw_ostream &Out) {
|
2008-08-19 13:06:27 +08:00
|
|
|
switch (Vis) {
|
|
|
|
case GlobalValue::DefaultVisibility: break;
|
|
|
|
case GlobalValue::HiddenVisibility: Out << "hidden "; break;
|
|
|
|
case GlobalValue::ProtectedVisibility: Out << "protected "; break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-01-14 23:22:47 +08:00
|
|
|
static void PrintDLLStorageClass(GlobalValue::DLLStorageClassTypes SCT,
|
|
|
|
formatted_raw_ostream &Out) {
|
|
|
|
switch (SCT) {
|
|
|
|
case GlobalValue::DefaultStorageClass: break;
|
|
|
|
case GlobalValue::DLLImportStorageClass: Out << "dllimport "; break;
|
|
|
|
case GlobalValue::DLLExportStorageClass: Out << "dllexport "; break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-23 19:37:03 +08:00
|
|
|
static void PrintThreadLocalModel(GlobalVariable::ThreadLocalMode TLM,
|
|
|
|
formatted_raw_ostream &Out) {
|
|
|
|
switch (TLM) {
|
|
|
|
case GlobalVariable::NotThreadLocal:
|
|
|
|
break;
|
|
|
|
case GlobalVariable::GeneralDynamicTLSModel:
|
|
|
|
Out << "thread_local ";
|
|
|
|
break;
|
|
|
|
case GlobalVariable::LocalDynamicTLSModel:
|
|
|
|
Out << "thread_local(localdynamic) ";
|
|
|
|
break;
|
|
|
|
case GlobalVariable::InitialExecTLSModel:
|
|
|
|
Out << "thread_local(initialexec) ";
|
|
|
|
break;
|
|
|
|
case GlobalVariable::LocalExecTLSModel:
|
|
|
|
Out << "thread_local(localexec) ";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-10-30 00:05:51 +08:00
|
|
|
void AssemblyWriter::printGlobal(const GlobalVariable *GV) {
|
2010-01-30 07:12:36 +08:00
|
|
|
if (GV->isMaterializable())
|
|
|
|
Out << "; Materializable\n";
|
|
|
|
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, GV, &TypePrinter, &Machine, GV->getParent());
|
2009-08-13 07:32:33 +08:00
|
|
|
Out << " = ";
|
2001-09-18 12:01:05 +08:00
|
|
|
|
2008-08-19 13:16:28 +08:00
|
|
|
if (!GV->hasInitializer() && GV->hasExternalLinkage())
|
|
|
|
Out << "external ";
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:16:28 +08:00
|
|
|
PrintLinkage(GV->getLinkage(), Out);
|
|
|
|
PrintVisibility(GV->getVisibility(), Out);
|
2014-01-14 23:22:47 +08:00
|
|
|
PrintDLLStorageClass(GV->getDLLStorageClass(), Out);
|
2012-06-23 19:37:03 +08:00
|
|
|
PrintThreadLocalModel(GV->getThreadLocalMode(), Out);
|
2014-06-06 09:20:28 +08:00
|
|
|
if (GV->hasUnnamedAddr())
|
|
|
|
Out << "unnamed_addr ";
|
2007-04-13 02:32:50 +08:00
|
|
|
|
2009-01-02 15:01:27 +08:00
|
|
|
if (unsigned AddressSpace = GV->getType()->getAddressSpace())
|
|
|
|
Out << "addrspace(" << AddressSpace << ") ";
|
2013-02-05 13:57:38 +08:00
|
|
|
if (GV->isExternallyInitialized()) Out << "externally_initialized ";
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << (GV->isConstant() ? "constant " : "global ");
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(GV->getType()->getElementType(), Out);
|
2001-09-18 12:01:05 +08:00
|
|
|
|
2008-09-15 01:21:12 +08:00
|
|
|
if (GV->hasInitializer()) {
|
|
|
|
Out << ' ';
|
2009-07-09 05:44:25 +08:00
|
|
|
writeOperand(GV->getInitializer(), false);
|
2008-09-15 01:21:12 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2010-07-08 07:16:37 +08:00
|
|
|
if (GV->hasSection()) {
|
|
|
|
Out << ", section \"";
|
|
|
|
PrintEscapedString(GV->getSection(), Out);
|
|
|
|
Out << '"';
|
|
|
|
}
|
2014-06-28 02:19:56 +08:00
|
|
|
if (GV->hasComdat()) {
|
|
|
|
Out << ", comdat ";
|
|
|
|
PrintLLVMName(Out, GV->getComdat()->getName(), ComdatPrefix);
|
|
|
|
}
|
2005-11-12 08:10:19 +08:00
|
|
|
if (GV->getAlignment())
|
2005-11-06 14:48:53 +08:00
|
|
|
Out << ", align " << GV->getAlignment();
|
2007-04-25 22:27:10 +08:00
|
|
|
|
2002-06-26 00:13:24 +08:00
|
|
|
printInfoComment(*GV);
|
2001-09-10 15:58:01 +08:00
|
|
|
}
|
|
|
|
|
2007-04-25 22:27:10 +08:00
|
|
|
void AssemblyWriter::printAlias(const GlobalAlias *GA) {
|
2010-01-30 07:12:36 +08:00
|
|
|
if (GA->isMaterializable())
|
|
|
|
Out << "; Materializable\n";
|
|
|
|
|
2008-06-04 02:14:29 +08:00
|
|
|
// Don't crash when dumping partially built GA
|
|
|
|
if (!GA->hasName())
|
|
|
|
Out << "<<nameless>> = ";
|
2008-08-17 12:40:13 +08:00
|
|
|
else {
|
|
|
|
PrintLLVMName(Out, GA);
|
|
|
|
Out << " = ";
|
|
|
|
}
|
2008-08-19 13:06:27 +08:00
|
|
|
PrintVisibility(GA->getVisibility(), Out);
|
2014-01-14 23:22:47 +08:00
|
|
|
PrintDLLStorageClass(GA->getDLLStorageClass(), Out);
|
2014-05-29 02:15:43 +08:00
|
|
|
PrintThreadLocalModel(GA->getThreadLocalMode(), Out);
|
2014-06-06 09:20:28 +08:00
|
|
|
if (GA->hasUnnamedAddr())
|
|
|
|
Out << "unnamed_addr ";
|
2007-04-25 22:27:10 +08:00
|
|
|
|
|
|
|
Out << "alias ";
|
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
PrintLinkage(GA->getLinkage(), Out);
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2007-04-30 02:02:48 +08:00
|
|
|
const Constant *Aliasee = GA->getAliasee();
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2014-04-09 14:08:46 +08:00
|
|
|
if (!Aliasee) {
|
2014-06-03 10:41:57 +08:00
|
|
|
TypePrinter.print(GA->getType(), Out);
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
Out << " <<NULL ALIASEE>>";
|
2011-08-01 20:48:54 +08:00
|
|
|
} else {
|
2011-08-01 20:29:14 +08:00
|
|
|
writeOperand(Aliasee, !isa<ConstantExpr>(Aliasee));
|
2011-08-01 20:48:54 +08:00
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2007-04-25 22:27:10 +08:00
|
|
|
printInfoComment(*GA);
|
2008-08-19 13:16:28 +08:00
|
|
|
Out << '\n';
|
2007-04-25 22:27:10 +08:00
|
|
|
}
|
|
|
|
|
2014-06-28 02:19:56 +08:00
|
|
|
void AssemblyWriter::printComdat(const Comdat *C) {
|
|
|
|
C->print(Out);
|
|
|
|
}
|
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
void AssemblyWriter::printTypeIdentities() {
|
|
|
|
if (TypePrinter.NumberedTypes.empty() &&
|
|
|
|
TypePrinter.NamedTypes.empty())
|
|
|
|
return;
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
Out << '\n';
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
// We know all the numbers that each type is used and we know that it is a
|
|
|
|
// dense assignment. Convert the map to an index table.
|
|
|
|
std::vector<StructType*> NumberedTypes(TypePrinter.NumberedTypes.size());
|
2011-10-01 03:48:58 +08:00
|
|
|
for (DenseMap<StructType*, unsigned>::iterator I =
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
TypePrinter.NumberedTypes.begin(), E = TypePrinter.NumberedTypes.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
assert(I->second < NumberedTypes.size() && "Didn't get a dense numbering?");
|
|
|
|
NumberedTypes[I->second] = I->first;
|
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-03-01 08:03:38 +08:00
|
|
|
// Emit all numbered types.
|
|
|
|
for (unsigned i = 0, e = NumberedTypes.size(); i != e; ++i) {
|
2009-08-13 07:32:33 +08:00
|
|
|
Out << '%' << i << " = type ";
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-03-01 08:03:38 +08:00
|
|
|
// Make sure we print out at least one level of the type structure, so
|
|
|
|
// that we do not get %2 = type %2
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
TypePrinter.printStructBody(NumberedTypes[i], Out);
|
2009-08-13 07:54:22 +08:00
|
|
|
Out << '\n';
|
2009-03-01 08:03:38 +08:00
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
for (unsigned i = 0, e = TypePrinter.NamedTypes.size(); i != e; ++i) {
|
|
|
|
PrintLLVMName(Out, TypePrinter.NamedTypes[i]->getName(), LocalPrefix);
|
2008-08-19 13:16:28 +08:00
|
|
|
Out << " = type ";
|
2004-05-25 16:53:40 +08:00
|
|
|
|
|
|
|
// Make sure we print out at least one level of the type structure, so
|
|
|
|
// that we do not get %FILE = type %FILE
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
TypePrinter.printStructBody(TypePrinter.NamedTypes[i], Out);
|
2008-08-19 13:06:27 +08:00
|
|
|
Out << '\n';
|
2004-05-25 16:53:40 +08:00
|
|
|
}
|
2007-01-06 15:24:44 +08:00
|
|
|
}
|
|
|
|
|
2004-03-02 08:22:19 +08:00
|
|
|
/// printFunction - Print all aspects of a function.
|
|
|
|
///
|
2002-06-26 00:13:24 +08:00
|
|
|
void AssemblyWriter::printFunction(const Function *F) {
|
2008-08-19 13:06:27 +08:00
|
|
|
// Print out the return type and name.
|
|
|
|
Out << '\n';
|
2003-04-17 04:28:45 +08:00
|
|
|
|
2004-06-22 05:53:56 +08:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitFunctionAnnot(F, Out);
|
2003-10-31 07:41:03 +08:00
|
|
|
|
2010-01-30 07:12:36 +08:00
|
|
|
if (F->isMaterializable())
|
|
|
|
Out << "; Materializable\n";
|
|
|
|
|
2013-04-17 04:55:47 +08:00
|
|
|
const AttributeSet &Attrs = F->getAttributes();
|
2013-04-30 07:48:06 +08:00
|
|
|
if (Attrs.hasAttributes(AttributeSet::FunctionIndex)) {
|
2013-04-17 04:55:47 +08:00
|
|
|
AttributeSet AS = Attrs.getFnAttributes();
|
2013-05-01 21:07:03 +08:00
|
|
|
std::string AttrStr;
|
|
|
|
|
|
|
|
unsigned Idx = 0;
|
|
|
|
for (unsigned E = AS.getNumSlots(); Idx != E; ++Idx)
|
|
|
|
if (AS.getSlotIndex(Idx) == AttributeSet::FunctionIndex)
|
|
|
|
break;
|
|
|
|
|
|
|
|
for (AttributeSet::iterator I = AS.begin(Idx), E = AS.end(Idx);
|
|
|
|
I != E; ++I) {
|
|
|
|
Attribute Attr = *I;
|
|
|
|
if (!Attr.isStringAttribute()) {
|
|
|
|
if (!AttrStr.empty()) AttrStr += ' ';
|
|
|
|
AttrStr += Attr.getAsString();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-17 04:55:47 +08:00
|
|
|
if (!AttrStr.empty())
|
|
|
|
Out << "; Function Attrs: " << AttrStr << '\n';
|
|
|
|
}
|
|
|
|
|
2007-01-31 04:08:39 +08:00
|
|
|
if (F->isDeclaration())
|
2007-08-20 06:15:26 +08:00
|
|
|
Out << "declare ";
|
|
|
|
else
|
2006-12-30 04:29:48 +08:00
|
|
|
Out << "define ";
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-08-19 13:06:27 +08:00
|
|
|
PrintLinkage(F->getLinkage(), Out);
|
|
|
|
PrintVisibility(F->getVisibility(), Out);
|
2014-01-14 23:22:47 +08:00
|
|
|
PrintDLLStorageClass(F->getDLLStorageClass(), Out);
|
2003-04-17 04:28:45 +08:00
|
|
|
|
2005-05-07 04:26:43 +08:00
|
|
|
// Print the calling convention.
|
2012-09-13 23:11:12 +08:00
|
|
|
if (F->getCallingConv() != CallingConv::C) {
|
|
|
|
PrintCallingConv(F->getCallingConv(), Out);
|
|
|
|
Out << " ";
|
2005-05-07 04:26:43 +08:00
|
|
|
}
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
FunctionType *FT = F->getFunctionType();
|
2013-01-19 05:53:16 +08:00
|
|
|
if (Attrs.hasAttributes(AttributeSet::ReturnIndex))
|
|
|
|
Out << Attrs.getAsString(AttributeSet::ReturnIndex) << ' ';
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(F->getReturnType(), Out);
|
2008-08-19 13:26:17 +08:00
|
|
|
Out << ' ';
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteAsOperandInternal(Out, F, &TypePrinter, &Machine, F->getParent());
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << '(';
|
2004-05-26 15:18:52 +08:00
|
|
|
Machine.incorporateFunction(F);
|
2001-09-08 00:36:04 +08:00
|
|
|
|
2001-10-30 00:05:51 +08:00
|
|
|
// Loop over the arguments, printing them...
|
2001-09-08 00:36:04 +08:00
|
|
|
|
2006-12-31 13:24:50 +08:00
|
|
|
unsigned Idx = 1;
|
2007-04-18 08:57:22 +08: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 << ", ";
|
2012-12-30 21:50:49 +08:00
|
|
|
printArgument(I, Attrs, Idx);
|
2007-04-18 08:57:22 +08: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 << ", ";
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2007-04-18 08:57:22 +08:00
|
|
|
// Output type...
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(FT->getParamType(i), Out);
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2012-12-30 21:50:49 +08:00
|
|
|
if (Attrs.hasAttributes(i+1))
|
|
|
|
Out << ' ' << Attrs.getAsString(i+1);
|
2007-04-18 08:57:22 +08:00
|
|
|
}
|
2006-12-31 13:24:50 +08:00
|
|
|
}
|
2001-09-08 00:36:04 +08:00
|
|
|
|
|
|
|
// Finish printing arguments...
|
2002-06-26 00:13:24 +08:00
|
|
|
if (FT->isVarArg()) {
|
2004-06-22 05:53:56 +08:00
|
|
|
if (FT->getNumParams()) Out << ", ";
|
|
|
|
Out << "..."; // Output varargs portion of signature!
|
2001-09-08 00:36:04 +08:00
|
|
|
}
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << ')';
|
2011-01-26 03:09:56 +08:00
|
|
|
if (F->hasUnnamedAddr())
|
|
|
|
Out << " unnamed_addr";
|
2013-04-30 07:48:06 +08:00
|
|
|
if (Attrs.hasAttributes(AttributeSet::FunctionIndex))
|
|
|
|
Out << " #" << Machine.getAttributeGroupSlot(Attrs.getFnAttributes());
|
2010-07-08 07:16:37 +08:00
|
|
|
if (F->hasSection()) {
|
|
|
|
Out << " section \"";
|
|
|
|
PrintEscapedString(F->getSection(), Out);
|
|
|
|
Out << '"';
|
|
|
|
}
|
2014-06-28 02:19:56 +08:00
|
|
|
if (F->hasComdat()) {
|
|
|
|
Out << " comdat ";
|
|
|
|
PrintLLVMName(Out, F->getComdat()->getName(), ComdatPrefix);
|
|
|
|
}
|
2005-11-06 14:48:53 +08:00
|
|
|
if (F->getAlignment())
|
|
|
|
Out << " align " << F->getAlignment();
|
2008-08-18 02:44:35 +08:00
|
|
|
if (F->hasGC())
|
|
|
|
Out << " gc \"" << F->getGC() << '"';
|
2013-09-16 09:08:15 +08:00
|
|
|
if (F->hasPrefixData()) {
|
|
|
|
Out << " prefix ";
|
|
|
|
writeOperand(F->getPrefixData(), true);
|
|
|
|
}
|
2008-09-23 06:32:29 +08:00
|
|
|
if (F->isDeclaration()) {
|
2010-09-03 06:52:10 +08:00
|
|
|
Out << '\n';
|
2008-09-23 06:32:29 +08:00
|
|
|
} else {
|
2010-09-03 06:52:10 +08:00
|
|
|
Out << " {";
|
|
|
|
// Output all of the function's basic blocks.
|
2002-06-26 00:13:24 +08:00
|
|
|
for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
|
|
|
|
printBasicBlock(I);
|
2001-09-08 00:36:04 +08:00
|
|
|
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << "}\n";
|
2001-09-08 00:36:04 +08:00
|
|
|
}
|
|
|
|
|
2004-05-26 15:18:52 +08:00
|
|
|
Machine.purgeFunction();
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2004-03-02 08:22:19 +08:00
|
|
|
/// printArgument - This member is called for every argument that is passed into
|
|
|
|
/// the function. Simply print it out
|
|
|
|
///
|
2009-09-20 10:20:51 +08:00
|
|
|
void AssemblyWriter::printArgument(const Argument *Arg,
|
2012-12-30 21:50:49 +08:00
|
|
|
AttributeSet Attrs, unsigned Idx) {
|
2001-06-07 04:29:01 +08:00
|
|
|
// Output type...
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(Arg->getType(), Out);
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2007-11-27 21:23:08 +08:00
|
|
|
// Output parameter attributes list
|
2012-12-30 21:50:49 +08:00
|
|
|
if (Attrs.hasAttributes(Idx))
|
|
|
|
Out << ' ' << Attrs.getAsString(Idx);
|
2006-12-31 13:24:50 +08:00
|
|
|
|
2001-06-07 04:29:01 +08:00
|
|
|
// Output name, if available...
|
2008-08-17 12:40:13 +08:00
|
|
|
if (Arg->hasName()) {
|
|
|
|
Out << ' ';
|
|
|
|
PrintLLVMName(Out, Arg);
|
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2004-03-02 08:22:19 +08:00
|
|
|
/// printBasicBlock - This member is called for each basic block in a method.
|
|
|
|
///
|
2001-10-30 00:05:51 +08:00
|
|
|
void AssemblyWriter::printBasicBlock(const BasicBlock *BB) {
|
2008-04-26 00:53:59 +08:00
|
|
|
if (BB->hasName()) { // Print out the label if it exists...
|
2008-08-17 12:40:13 +08:00
|
|
|
Out << "\n";
|
2009-07-26 07:55:21 +08:00
|
|
|
PrintLLVMName(Out, BB->getName(), LabelPrefix);
|
2008-08-17 12:40:13 +08:00
|
|
|
Out << ':';
|
2008-04-26 00:53:59 +08:00
|
|
|
} else if (!BB->use_empty()) { // Don't print block # of no uses...
|
2011-04-11 07:18:04 +08:00
|
|
|
Out << "\n; <label>:";
|
2007-01-11 11:54:27 +08:00
|
|
|
int Slot = Machine.getLocalSlot(BB);
|
2004-06-10 03:41:19 +08:00
|
|
|
if (Slot != -1)
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << Slot;
|
2004-06-10 03:41:19 +08:00
|
|
|
else
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << "<badref>";
|
2002-10-03 03:38:55 +08:00
|
|
|
}
|
2003-11-20 08:09:43 +08:00
|
|
|
|
2014-04-09 14:08:46 +08:00
|
|
|
if (!BB->getParent()) {
|
2009-08-17 23:48:08 +08:00
|
|
|
Out.PadToColumn(50);
|
2009-08-13 01:23:50 +08:00
|
|
|
Out << "; Error: Block without parent!";
|
|
|
|
} else if (BB != &BB->getParent()->getEntryBlock()) { // Not the entry block?
|
2010-09-03 06:52:10 +08:00
|
|
|
// Output predecessors for the block.
|
2009-08-17 23:48:08 +08:00
|
|
|
Out.PadToColumn(50);
|
2009-08-13 01:23:50 +08:00
|
|
|
Out << ";";
|
2010-03-26 07:25:28 +08:00
|
|
|
const_pred_iterator PI = pred_begin(BB), PE = pred_end(BB);
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2008-04-22 10:45:44 +08:00
|
|
|
if (PI == PE) {
|
|
|
|
Out << " No predecessors!";
|
|
|
|
} else {
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << " preds = ";
|
2008-04-22 10:45:44 +08:00
|
|
|
writeOperand(*PI, false);
|
|
|
|
for (++PI; PI != PE; ++PI) {
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2006-12-06 14:24:27 +08:00
|
|
|
writeOperand(*PI, false);
|
2003-11-17 06:59:57 +08:00
|
|
|
}
|
2002-10-03 03:38:55 +08:00
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2008-04-22 10:45:44 +08:00
|
|
|
Out << "\n";
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2004-06-22 05:53:56 +08:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitBasicBlockStartAnnot(BB, Out);
|
2003-10-31 07:41:03 +08:00
|
|
|
|
2001-09-08 00:36:04 +08:00
|
|
|
// Output all of the instructions in the basic block...
|
2009-07-14 02:27:59 +08:00
|
|
|
for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
|
2013-05-09 04:38:31 +08:00
|
|
|
printInstructionLine(*I);
|
2009-07-14 02:27:59 +08:00
|
|
|
}
|
2004-03-09 02:51:45 +08:00
|
|
|
|
2004-06-22 05:53:56 +08:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitBasicBlockEndAnnot(BB, Out);
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
/// printInstructionLine - Print an instruction and a newline character.
|
|
|
|
void AssemblyWriter::printInstructionLine(const Instruction &I) {
|
|
|
|
printInstruction(I);
|
|
|
|
Out << '\n';
|
|
|
|
}
|
|
|
|
|
2004-03-02 08:22:19 +08:00
|
|
|
/// printInfoComment - Print a little comment after the instruction indicating
|
|
|
|
/// which slot it occupies.
|
|
|
|
///
|
2002-06-26 00:13:24 +08:00
|
|
|
void AssemblyWriter::printInfoComment(const Value &V) {
|
2013-04-17 04:55:47 +08:00
|
|
|
if (AnnotationWriter)
|
2010-02-11 04:41:46 +08:00
|
|
|
AnnotationWriter->printInfoComment(V, Out);
|
2001-10-13 14:42:36 +08:00
|
|
|
}
|
|
|
|
|
2006-08-28 09:02:49 +08:00
|
|
|
// This member is called for each Instruction in a function..
|
2002-06-26 00:13:24 +08:00
|
|
|
void AssemblyWriter::printInstruction(const Instruction &I) {
|
2004-06-22 05:53:56 +08:00
|
|
|
if (AnnotationWriter) AnnotationWriter->emitInstructionAnnot(&I, Out);
|
2003-10-31 07:41:03 +08:00
|
|
|
|
2009-08-13 07:32:33 +08:00
|
|
|
// Print out indentation for an instruction.
|
2009-08-13 09:41:52 +08:00
|
|
|
Out << " ";
|
2001-06-07 04:29:01 +08:00
|
|
|
|
|
|
|
// Print out name if it exists...
|
2008-08-17 12:40:13 +08:00
|
|
|
if (I.hasName()) {
|
|
|
|
PrintLLVMName(Out, &I);
|
|
|
|
Out << " = ";
|
2009-12-29 15:25:48 +08:00
|
|
|
} else if (!I.getType()->isVoidTy()) {
|
2008-08-30 01:19:30 +08:00
|
|
|
// Print out the def slot taken.
|
|
|
|
int SlotNum = Machine.getLocalSlot(&I);
|
|
|
|
if (SlotNum == -1)
|
|
|
|
Out << "<badref> = ";
|
|
|
|
else
|
|
|
|
Out << '%' << SlotNum << " = ";
|
2008-08-17 12:40:13 +08:00
|
|
|
}
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2014-04-25 04:14:34 +08:00
|
|
|
if (const CallInst *CI = dyn_cast<CallInst>(&I)) {
|
|
|
|
if (CI->isMustTailCall())
|
|
|
|
Out << "musttail ";
|
|
|
|
else if (CI->isTailCall())
|
|
|
|
Out << "tail ";
|
|
|
|
}
|
2003-09-09 01:45:59 +08:00
|
|
|
|
2001-06-07 04:29:01 +08:00
|
|
|
// Print out the opcode...
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << I.getOpcodeName();
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2011-08-13 06:50:01 +08:00
|
|
|
// If this is an atomic load or store, print out the atomic marker.
|
|
|
|
if ((isa<LoadInst>(I) && cast<LoadInst>(I).isAtomic()) ||
|
|
|
|
(isa<StoreInst>(I) && cast<StoreInst>(I).isAtomic()))
|
|
|
|
Out << " atomic";
|
|
|
|
|
IR: add "cmpxchg weak" variant to support permitted failure.
This commit adds a weak variant of the cmpxchg operation, as described
in C++11. A cmpxchg instruction with this modifier is permitted to
fail to store, even if the comparison indicated it should.
As a result, cmpxchg instructions must return a flag indicating
success in addition to their original iN value loaded. Thus, for
uniformity *all* cmpxchg instructions now return "{ iN, i1 }". The
second flag is 1 when the store succeeded.
At the DAG level, a new ATOMIC_CMP_SWAP_WITH_SUCCESS node has been
added as the natural representation for the new cmpxchg instructions.
It is a strong cmpxchg.
By default this gets Expanded to the existing ATOMIC_CMP_SWAP during
Legalization, so existing backends should see no change in behaviour.
If they wish to deal with the enhanced node instead, they can call
setOperationAction on it. Beware: as a node with 2 results, it cannot
be selected from TableGen.
Currently, no use is made of the extra information provided in this
patch. Test updates are almost entirely adapting the input IR to the
new scheme.
Summary for out of tree users:
------------------------------
+ Legacy Bitcode files are upgraded during read.
+ Legacy assembly IR files will be invalid.
+ Front-ends must adapt to different type for "cmpxchg".
+ Backends should be unaffected by default.
llvm-svn: 210903
2014-06-13 22:24:07 +08:00
|
|
|
if (isa<AtomicCmpXchgInst>(I) && cast<AtomicCmpXchgInst>(I).isWeak())
|
|
|
|
Out << " weak";
|
|
|
|
|
2011-08-13 06:50:01 +08:00
|
|
|
// If this is a volatile operation, print out the volatile marker.
|
|
|
|
if ((isa<LoadInst>(I) && cast<LoadInst>(I).isVolatile()) ||
|
|
|
|
(isa<StoreInst>(I) && cast<StoreInst>(I).isVolatile()) ||
|
|
|
|
(isa<AtomicCmpXchgInst>(I) && cast<AtomicCmpXchgInst>(I).isVolatile()) ||
|
|
|
|
(isa<AtomicRMWInst>(I) && cast<AtomicRMWInst>(I).isVolatile()))
|
|
|
|
Out << " volatile";
|
|
|
|
|
2009-07-28 00:11:46 +08:00
|
|
|
// Print out optimization information.
|
|
|
|
WriteOptimizationInfo(Out, &I);
|
|
|
|
|
2006-12-03 14:27:29 +08:00
|
|
|
// Print out the compare instruction predicates
|
2008-05-13 03:01:56 +08:00
|
|
|
if (const CmpInst *CI = dyn_cast<CmpInst>(&I))
|
2008-08-24 06:52:27 +08:00
|
|
|
Out << ' ' << getPredicateText(CI->getPredicate());
|
2006-12-03 14:27:29 +08:00
|
|
|
|
2011-07-29 05:48:00 +08:00
|
|
|
// Print out the atomicrmw operation
|
|
|
|
if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(&I))
|
|
|
|
writeAtomicRMWOperation(Out, RMWI->getOperation());
|
|
|
|
|
2001-06-07 04:29:01 +08:00
|
|
|
// Print out the type of the operands...
|
2014-04-09 14:08:46 +08:00
|
|
|
const Value *Operand = I.getNumOperands() ? I.getOperand(0) : nullptr;
|
2001-06-07 04:29:01 +08:00
|
|
|
|
|
|
|
// Special case conditional branches to swizzle the condition out to the front
|
2009-02-09 23:45:06 +08:00
|
|
|
if (isa<BranchInst>(I) && cast<BranchInst>(I).isConditional()) {
|
2013-02-11 09:16:51 +08:00
|
|
|
const BranchInst &BI(cast<BranchInst>(I));
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2009-02-09 23:45:06 +08:00
|
|
|
writeOperand(BI.getCondition(), true);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2009-02-09 23:45:06 +08:00
|
|
|
writeOperand(BI.getSuccessor(0), true);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2009-02-09 23:45:06 +08:00
|
|
|
writeOperand(BI.getSuccessor(1), true);
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2002-04-14 02:34:38 +08:00
|
|
|
} else if (isa<SwitchInst>(I)) {
|
2013-02-11 09:16:51 +08:00
|
|
|
const SwitchInst& SI(cast<SwitchInst>(I));
|
2009-10-28 03:13:16 +08:00
|
|
|
// Special case switch instruction to get formatting nice and correct.
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2011-09-30 04:21:17 +08:00
|
|
|
writeOperand(SI.getCondition(), true);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2011-09-30 04:21:17 +08:00
|
|
|
writeOperand(SI.getDefaultDest(), true);
|
2008-08-24 06:52:27 +08:00
|
|
|
Out << " [";
|
2013-02-11 09:16:51 +08:00
|
|
|
for (SwitchInst::ConstCaseIt i = SI.case_begin(), e = SI.case_end();
|
2012-03-08 15:06:20 +08:00
|
|
|
i != e; ++i) {
|
2009-08-13 09:41:52 +08:00
|
|
|
Out << "\n ";
|
2012-03-08 15:06:20 +08:00
|
|
|
writeOperand(i.getCaseValue(), true);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2012-03-08 15:06:20 +08:00
|
|
|
writeOperand(i.getCaseSuccessor(), true);
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
2009-08-13 09:41:52 +08:00
|
|
|
Out << "\n ]";
|
2009-10-28 08:19:10 +08:00
|
|
|
} else if (isa<IndirectBrInst>(I)) {
|
|
|
|
// Special case indirectbr instruction to get formatting nice and correct.
|
2009-10-28 03:13:16 +08:00
|
|
|
Out << ' ';
|
|
|
|
writeOperand(Operand, true);
|
2009-10-30 10:01:10 +08:00
|
|
|
Out << ", [";
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-10-28 03:13:16 +08:00
|
|
|
for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) {
|
|
|
|
if (i != 1)
|
|
|
|
Out << ", ";
|
|
|
|
writeOperand(I.getOperand(i), true);
|
|
|
|
}
|
|
|
|
Out << ']';
|
2011-06-20 22:18:48 +08:00
|
|
|
} else if (const PHINode *PN = dyn_cast<PHINode>(&I)) {
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << ' ';
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(I.getType(), Out);
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << ' ';
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2011-06-20 22:18:48 +08:00
|
|
|
for (unsigned op = 0, Eop = PN->getNumIncomingValues(); op < Eop; ++op) {
|
2004-06-22 05:53:56 +08:00
|
|
|
if (op) Out << ", ";
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << "[ ";
|
2011-06-20 22:18:48 +08:00
|
|
|
writeOperand(PN->getIncomingValue(op), false); Out << ", ";
|
|
|
|
writeOperand(PN->getIncomingBlock(op), false); Out << " ]";
|
2001-06-11 23:04:20 +08:00
|
|
|
}
|
2008-06-01 03:12:39 +08:00
|
|
|
} else if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(&I)) {
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2008-06-01 03:12:39 +08:00
|
|
|
writeOperand(I.getOperand(0), true);
|
|
|
|
for (const unsigned *i = EVI->idx_begin(), *e = EVI->idx_end(); i != e; ++i)
|
|
|
|
Out << ", " << *i;
|
|
|
|
} else if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(&I)) {
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
|
|
|
writeOperand(I.getOperand(0), true); Out << ", ";
|
2008-06-01 03:12:39 +08:00
|
|
|
writeOperand(I.getOperand(1), true);
|
|
|
|
for (const unsigned *i = IVI->idx_begin(), *e = IVI->idx_end(); i != e; ++i)
|
|
|
|
Out << ", " << *i;
|
2011-08-13 04:24:12 +08:00
|
|
|
} else if (const LandingPadInst *LPI = dyn_cast<LandingPadInst>(&I)) {
|
|
|
|
Out << ' ';
|
|
|
|
TypePrinter.print(I.getType(), Out);
|
|
|
|
Out << " personality ";
|
|
|
|
writeOperand(I.getOperand(0), true); Out << '\n';
|
|
|
|
|
|
|
|
if (LPI->isCleanup())
|
|
|
|
Out << " cleanup";
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = LPI->getNumClauses(); i != e; ++i) {
|
|
|
|
if (i != 0 || LPI->isCleanup()) Out << "\n";
|
|
|
|
if (LPI->isCatch(i))
|
|
|
|
Out << " catch ";
|
|
|
|
else
|
|
|
|
Out << " filter ";
|
|
|
|
|
|
|
|
writeOperand(LPI->getClause(i), true);
|
|
|
|
}
|
2008-02-23 08:35:18 +08:00
|
|
|
} else if (isa<ReturnInst>(I) && !Operand) {
|
|
|
|
Out << " void";
|
2005-05-07 04:26:43 +08:00
|
|
|
} else if (const CallInst *CI = dyn_cast<CallInst>(&I)) {
|
|
|
|
// Print the calling convention being used.
|
2012-09-13 23:11:12 +08:00
|
|
|
if (CI->getCallingConv() != CallingConv::C) {
|
|
|
|
Out << " ";
|
|
|
|
PrintCallingConv(CI->getCallingConv(), Out);
|
2005-05-07 04:26:43 +08:00
|
|
|
}
|
|
|
|
|
2010-06-23 21:09:06 +08:00
|
|
|
Operand = CI->getCalledValue();
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
PointerType *PTy = cast<PointerType>(Operand->getType());
|
|
|
|
FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
|
|
|
|
Type *RetTy = FTy->getReturnType();
|
2012-12-08 07:16:57 +08:00
|
|
|
const AttributeSet &PAL = CI->getAttributes();
|
2001-11-07 05:28:12 +08:00
|
|
|
|
2013-01-19 05:53:16 +08:00
|
|
|
if (PAL.hasAttributes(AttributeSet::ReturnIndex))
|
|
|
|
Out << ' ' << PAL.getAsString(AttributeSet::ReturnIndex);
|
2008-09-30 04:49:50 +08:00
|
|
|
|
2003-08-05 23:34:45 +08:00
|
|
|
// If possible, print out the short form of the call instruction. We can
|
2002-04-08 06:49:37 +08:00
|
|
|
// only do this if the first argument is a pointer to a nonvararg function,
|
2003-08-05 23:34:45 +08:00
|
|
|
// and if the return type is not a pointer to a function.
|
2001-11-07 05:28:12 +08:00
|
|
|
//
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2003-08-05 23:34:45 +08:00
|
|
|
if (!FTy->isVarArg() &&
|
2010-02-16 19:11:14 +08:00
|
|
|
(!RetTy->isPointerTy() ||
|
|
|
|
!cast<PointerType>(RetTy)->getElementType()->isFunctionTy())) {
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(RetTy, Out);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2001-11-07 05:28:12 +08:00
|
|
|
writeOperand(Operand, false);
|
|
|
|
} else {
|
|
|
|
writeOperand(Operand, true);
|
|
|
|
}
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << '(';
|
2010-06-23 21:09:06 +08:00
|
|
|
for (unsigned op = 0, Eop = CI->getNumArgOperands(); op < Eop; ++op) {
|
|
|
|
if (op > 0)
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2012-12-30 21:50:49 +08:00
|
|
|
writeParamOperand(CI->getArgOperand(op), PAL, op + 1);
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ')';
|
2012-12-30 18:32:01 +08:00
|
|
|
if (PAL.hasAttributes(AttributeSet::FunctionIndex))
|
2013-02-22 17:09:42 +08:00
|
|
|
Out << " #" << Machine.getAttributeGroupSlot(PAL.getFnAttributes());
|
2002-06-26 00:13:24 +08:00
|
|
|
} else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
|
2010-03-24 21:21:49 +08:00
|
|
|
Operand = II->getCalledValue();
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
PointerType *PTy = cast<PointerType>(Operand->getType());
|
|
|
|
FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
|
|
|
|
Type *RetTy = FTy->getReturnType();
|
2012-12-08 07:16:57 +08:00
|
|
|
const AttributeSet &PAL = II->getAttributes();
|
2003-08-05 23:34:45 +08:00
|
|
|
|
2005-05-07 04:26:43 +08:00
|
|
|
// Print the calling convention being used.
|
2012-09-13 23:11:12 +08:00
|
|
|
if (II->getCallingConv() != CallingConv::C) {
|
|
|
|
Out << " ";
|
|
|
|
PrintCallingConv(II->getCallingConv(), Out);
|
2005-05-07 04:26:43 +08:00
|
|
|
}
|
|
|
|
|
2013-01-19 05:53:16 +08:00
|
|
|
if (PAL.hasAttributes(AttributeSet::ReturnIndex))
|
|
|
|
Out << ' ' << PAL.getAsString(AttributeSet::ReturnIndex);
|
2008-09-30 04:49:50 +08:00
|
|
|
|
2003-08-05 23:34:45 +08: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.
|
|
|
|
//
|
2008-10-16 02:02:08 +08:00
|
|
|
Out << ' ';
|
2003-08-05 23:34:45 +08:00
|
|
|
if (!FTy->isVarArg() &&
|
2010-02-16 19:11:14 +08:00
|
|
|
(!RetTy->isPointerTy() ||
|
|
|
|
!cast<PointerType>(RetTy)->getElementType()->isFunctionTy())) {
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(RetTy, Out);
|
2008-10-16 02:02:08 +08:00
|
|
|
Out << ' ';
|
2003-08-05 23:34:45 +08:00
|
|
|
writeOperand(Operand, false);
|
|
|
|
} else {
|
|
|
|
writeOperand(Operand, true);
|
|
|
|
}
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << '(';
|
2010-06-23 21:09:06 +08:00
|
|
|
for (unsigned op = 0, Eop = II->getNumArgOperands(); op < Eop; ++op) {
|
2010-03-24 21:21:49 +08:00
|
|
|
if (op)
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2012-12-30 21:50:49 +08:00
|
|
|
writeParamOperand(II->getArgOperand(op), PAL, op + 1);
|
2001-10-13 14:42:36 +08:00
|
|
|
}
|
|
|
|
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ')';
|
2012-12-30 18:32:01 +08:00
|
|
|
if (PAL.hasAttributes(AttributeSet::FunctionIndex))
|
2013-02-22 17:09:42 +08:00
|
|
|
Out << " #" << Machine.getAttributeGroupSlot(PAL.getFnAttributes());
|
2008-09-27 06:53:05 +08:00
|
|
|
|
2009-08-13 09:41:52 +08:00
|
|
|
Out << "\n to ";
|
2001-10-13 14:42:36 +08:00
|
|
|
writeOperand(II->getNormalDest(), true);
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << " unwind ";
|
2004-02-09 05:44:31 +08:00
|
|
|
writeOperand(II->getUnwindDest(), true);
|
2001-10-13 14:42:36 +08:00
|
|
|
|
2009-10-24 05:09:37 +08:00
|
|
|
} else if (const AllocaInst *AI = dyn_cast<AllocaInst>(&I)) {
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << ' ';
|
2014-01-25 09:24:06 +08:00
|
|
|
if (AI->isUsedWithInAlloca())
|
2014-03-09 14:41:58 +08:00
|
|
|
Out << "inalloca ";
|
|
|
|
TypePrinter.print(AI->getAllocatedType(), Out);
|
2009-08-01 02:23:24 +08:00
|
|
|
if (!AI->getArraySize() || AI->isArrayAllocation()) {
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ", ";
|
2002-04-14 02:34:38 +08:00
|
|
|
writeOperand(AI->getArraySize(), true);
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
2005-11-05 17:21:28 +08:00
|
|
|
if (AI->getAlignment()) {
|
2005-11-06 05:20:34 +08:00
|
|
|
Out << ", align " << AI->getAlignment();
|
2005-11-05 17:21:28 +08:00
|
|
|
}
|
2001-10-13 14:42:36 +08:00
|
|
|
} else if (isa<CastInst>(I)) {
|
2008-09-15 01:21:12 +08:00
|
|
|
if (Operand) {
|
|
|
|
Out << ' ';
|
|
|
|
writeOperand(Operand, true); // Work with broken code
|
|
|
|
}
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << " to ";
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(I.getType(), Out);
|
2003-10-18 13:57:43 +08:00
|
|
|
} else if (isa<VAArgInst>(I)) {
|
2008-09-15 01:21:12 +08:00
|
|
|
if (Operand) {
|
|
|
|
Out << ' ';
|
|
|
|
writeOperand(Operand, true); // Work with broken code
|
|
|
|
}
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << ", ";
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(I.getType(), Out);
|
|
|
|
} else if (Operand) { // Print the normal way.
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2005-04-22 07:48:37 +08:00
|
|
|
// PrintAllTypes - Instructions who have operands of all the same type
|
2001-06-07 04:29:01 +08: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;
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
Type *TheType = Operand->getType();
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2007-02-02 21:54:55 +08:00
|
|
|
// Select, Store and ShuffleVector always print all types.
|
2008-03-05 06:05:14 +08:00
|
|
|
if (isa<SelectInst>(I) || isa<StoreInst>(I) || isa<ShuffleVectorInst>(I)
|
|
|
|
|| isa<ReturnInst>(I)) {
|
2003-04-17 04:20:02 +08:00
|
|
|
PrintAllTypes = true;
|
|
|
|
} else {
|
|
|
|
for (unsigned i = 1, E = I.getNumOperands(); i != E; ++i) {
|
|
|
|
Operand = I.getOperand(i);
|
2009-01-16 02:40:57 +08:00
|
|
|
// note that Operand shouldn't be null, but the test helps make dump()
|
|
|
|
// more tolerant of malformed IR
|
2009-01-15 01:51:41 +08:00
|
|
|
if (Operand && Operand->getType() != TheType) {
|
2003-04-17 04:20:02 +08:00
|
|
|
PrintAllTypes = true; // We have differing types! Print them all!
|
|
|
|
break;
|
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
}
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2001-10-30 00:05:51 +08:00
|
|
|
if (!PrintAllTypes) {
|
2004-06-22 05:53:56 +08:00
|
|
|
Out << ' ';
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(TheType, Out);
|
2001-10-30 00:05:51 +08:00
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2008-09-15 01:21:12 +08:00
|
|
|
Out << ' ';
|
2002-06-26 00:13:24 +08:00
|
|
|
for (unsigned i = 0, E = I.getNumOperands(); i != E; ++i) {
|
2008-09-15 01:21:12 +08:00
|
|
|
if (i) Out << ", ";
|
2002-06-26 00:13:24 +08:00
|
|
|
writeOperand(I.getOperand(i), PrintAllTypes);
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
}
|
2009-09-20 10:20:51 +08:00
|
|
|
|
2011-08-10 07:02:53 +08:00
|
|
|
// Print atomic ordering/alignment for memory operations
|
|
|
|
if (const LoadInst *LI = dyn_cast<LoadInst>(&I)) {
|
|
|
|
if (LI->isAtomic())
|
|
|
|
writeAtomic(LI->getOrdering(), LI->getSynchScope());
|
|
|
|
if (LI->getAlignment())
|
|
|
|
Out << ", align " << LI->getAlignment();
|
|
|
|
} else if (const StoreInst *SI = dyn_cast<StoreInst>(&I)) {
|
|
|
|
if (SI->isAtomic())
|
|
|
|
writeAtomic(SI->getOrdering(), SI->getSynchScope());
|
|
|
|
if (SI->getAlignment())
|
|
|
|
Out << ", align " << SI->getAlignment();
|
2011-07-29 05:48:00 +08:00
|
|
|
} else if (const AtomicCmpXchgInst *CXI = dyn_cast<AtomicCmpXchgInst>(&I)) {
|
2014-03-11 18:48:52 +08:00
|
|
|
writeAtomicCmpXchg(CXI->getSuccessOrdering(), CXI->getFailureOrdering(),
|
|
|
|
CXI->getSynchScope());
|
2011-07-29 05:48:00 +08:00
|
|
|
} else if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(&I)) {
|
|
|
|
writeAtomic(RMWI->getOrdering(), RMWI->getSynchScope());
|
2011-07-26 07:16:38 +08:00
|
|
|
} else if (const FenceInst *FI = dyn_cast<FenceInst>(&I)) {
|
|
|
|
writeAtomic(FI->getOrdering(), FI->getSynchScope());
|
2007-04-23 03:24:39 +08:00
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2009-12-29 04:10:43 +08:00
|
|
|
// Print Metadata info.
|
2010-02-25 14:53:04 +08:00
|
|
|
SmallVector<std::pair<unsigned, MDNode*>, 4> InstMD;
|
|
|
|
I.getAllMetadata(InstMD);
|
2010-03-02 13:32:52 +08:00
|
|
|
if (!InstMD.empty()) {
|
|
|
|
SmallVector<StringRef, 8> MDNames;
|
|
|
|
I.getType()->getContext().getMDKindNames(MDNames);
|
|
|
|
for (unsigned i = 0, e = InstMD.size(); i != e; ++i) {
|
|
|
|
unsigned Kind = InstMD[i].first;
|
|
|
|
if (Kind < MDNames.size()) {
|
|
|
|
Out << ", !" << MDNames[Kind];
|
2013-05-09 04:38:31 +08:00
|
|
|
} else {
|
|
|
|
Out << ", !<unknown kind #" << Kind << ">";
|
|
|
|
}
|
2010-07-21 07:55:01 +08:00
|
|
|
Out << ' ';
|
|
|
|
WriteAsOperandInternal(Out, InstMD[i].second, &TypePrinter, &Machine,
|
|
|
|
TheModule);
|
2010-02-25 14:53:04 +08:00
|
|
|
}
|
2009-10-08 00:37:55 +08:00
|
|
|
}
|
2001-10-13 14:42:36 +08:00
|
|
|
printInfoComment(I);
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2009-12-31 10:13:35 +08:00
|
|
|
static void WriteMDNodeComment(const MDNode *Node,
|
2010-07-12 16:16:59 +08:00
|
|
|
formatted_raw_ostream &Out) {
|
2009-12-31 10:13:35 +08:00
|
|
|
if (Node->getNumOperands() < 1)
|
|
|
|
return;
|
2012-06-28 08:41:44 +08:00
|
|
|
|
|
|
|
Value *Op = Node->getOperand(0);
|
|
|
|
if (!Op || !isa<ConstantInt>(Op) || cast<ConstantInt>(Op)->getBitWidth() < 32)
|
|
|
|
return;
|
|
|
|
|
|
|
|
DIDescriptor Desc(Node);
|
2013-03-12 07:39:23 +08:00
|
|
|
if (!Desc.Verify())
|
2009-12-31 10:13:35 +08:00
|
|
|
return;
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2012-06-28 08:41:44 +08:00
|
|
|
unsigned Tag = Desc.getTag();
|
2009-12-31 10:13:35 +08:00
|
|
|
Out.PadToColumn(50);
|
2012-07-04 04:01:02 +08:00
|
|
|
if (dwarf::TagString(Tag)) {
|
|
|
|
Out << "; ";
|
|
|
|
Desc.print(Out);
|
|
|
|
} else if (Tag == dwarf::DW_TAG_user_base) {
|
2009-12-31 10:13:35 +08:00
|
|
|
Out << "; [ DW_TAG_user_base ]";
|
2012-07-04 04:01:02 +08:00
|
|
|
}
|
2009-12-31 10:13:35 +08:00
|
|
|
}
|
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
void AssemblyWriter::writeMDNode(unsigned Slot, const MDNode *Node) {
|
|
|
|
Out << '!' << Slot << " = metadata ";
|
|
|
|
printMDNodeBody(Node);
|
|
|
|
}
|
|
|
|
|
2009-12-31 10:13:35 +08:00
|
|
|
void AssemblyWriter::writeAllMDNodes() {
|
|
|
|
SmallVector<const MDNode *, 16> Nodes;
|
2009-12-31 10:20:11 +08:00
|
|
|
Nodes.resize(Machine.mdn_size());
|
|
|
|
for (SlotTracker::mdn_iterator I = Machine.mdn_begin(), E = Machine.mdn_end();
|
|
|
|
I != E; ++I)
|
2009-12-31 10:13:35 +08:00
|
|
|
Nodes[I->second] = cast<MDNode>(I->first);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
2009-12-31 10:13:35 +08:00
|
|
|
for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
|
2013-05-09 04:38:31 +08:00
|
|
|
writeMDNode(i, Nodes[i]);
|
2009-12-31 10:13:35 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void AssemblyWriter::printMDNodeBody(const MDNode *Node) {
|
2010-07-21 07:55:01 +08:00
|
|
|
WriteMDNodeBodyInternal(Out, Node, &TypePrinter, &Machine, TheModule);
|
2009-12-31 10:13:35 +08:00
|
|
|
WriteMDNodeComment(Node, Out);
|
|
|
|
Out << "\n";
|
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2013-02-11 16:43:33 +08:00
|
|
|
void AssemblyWriter::writeAllAttributeGroups() {
|
|
|
|
std::vector<std::pair<AttributeSet, unsigned> > asVec;
|
|
|
|
asVec.resize(Machine.as_size());
|
|
|
|
|
|
|
|
for (SlotTracker::as_iterator I = Machine.as_begin(), E = Machine.as_end();
|
|
|
|
I != E; ++I)
|
|
|
|
asVec[I->second] = *I;
|
|
|
|
|
|
|
|
for (std::vector<std::pair<AttributeSet, unsigned> >::iterator
|
|
|
|
I = asVec.begin(), E = asVec.end(); I != E; ++I)
|
|
|
|
Out << "attributes #" << I->second << " = { "
|
2013-05-01 21:07:03 +08:00
|
|
|
<< I->first.getAsString(AttributeSet::FunctionIndex, true) << " }\n";
|
2013-02-11 16:43:33 +08:00
|
|
|
}
|
|
|
|
|
2013-05-09 04:38:31 +08:00
|
|
|
} // namespace llvm
|
|
|
|
|
2001-06-07 04:29:01 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// External Interface declarations
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-08-13 01:23:50 +08:00
|
|
|
void Module::print(raw_ostream &ROS, AssemblyAnnotationWriter *AAW) const {
|
2008-08-24 06:23:09 +08:00
|
|
|
SlotTracker SlotTable(this);
|
2009-08-13 01:23:50 +08:00
|
|
|
formatted_raw_ostream OS(ROS);
|
2008-08-24 06:23:09 +08:00
|
|
|
AssemblyWriter W(OS, SlotTable, this, AAW);
|
2009-12-31 10:23:35 +08:00
|
|
|
W.printModule(this);
|
2002-04-09 06:03:40 +08:00
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2014-04-23 20:23:05 +08:00
|
|
|
void NamedMDNode::print(raw_ostream &ROS) const {
|
2010-07-22 07:38:33 +08:00
|
|
|
SlotTracker SlotTable(getParent());
|
|
|
|
formatted_raw_ostream OS(ROS);
|
2014-04-23 20:23:05 +08:00
|
|
|
AssemblyWriter W(OS, SlotTable, getParent(), nullptr);
|
2010-07-22 07:38:33 +08:00
|
|
|
W.printNamedMDNode(this);
|
|
|
|
}
|
|
|
|
|
2014-06-28 02:19:56 +08:00
|
|
|
void Comdat::print(raw_ostream &ROS) const {
|
|
|
|
PrintLLVMName(ROS, getName(), ComdatPrefix);
|
|
|
|
ROS << " = comdat ";
|
|
|
|
|
|
|
|
switch (getSelectionKind()) {
|
|
|
|
case Comdat::Any:
|
|
|
|
ROS << "any";
|
|
|
|
break;
|
|
|
|
case Comdat::ExactMatch:
|
|
|
|
ROS << "exactmatch";
|
|
|
|
break;
|
|
|
|
case Comdat::Largest:
|
|
|
|
ROS << "largest";
|
|
|
|
break;
|
|
|
|
case Comdat::NoDuplicates:
|
|
|
|
ROS << "noduplicates";
|
|
|
|
break;
|
|
|
|
case Comdat::SameSize:
|
|
|
|
ROS << "samesize";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
ROS << '\n';
|
|
|
|
}
|
|
|
|
|
2009-03-01 05:11:05 +08:00
|
|
|
void Type::print(raw_ostream &OS) const {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
TypePrinting TP;
|
|
|
|
TP.print(const_cast<Type*>(this), OS);
|
2011-10-01 03:48:58 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
// If the type is a named struct type, print the body as well.
|
|
|
|
if (StructType *STy = dyn_cast<StructType>(const_cast<Type*>(this)))
|
2011-08-13 02:07:07 +08:00
|
|
|
if (!STy->isLiteral()) {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
OS << " = type ";
|
|
|
|
TP.printStructBody(STy, OS);
|
|
|
|
}
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2014-04-06 07:33:25 +08:00
|
|
|
void Value::print(raw_ostream &ROS) const {
|
2009-08-13 04:56:03 +08:00
|
|
|
formatted_raw_ostream OS(ROS);
|
2008-08-24 06:23:09 +08:00
|
|
|
if (const Instruction *I = dyn_cast<Instruction>(this)) {
|
2014-04-06 07:33:25 +08:00
|
|
|
const Function *F = I->getParent() ? I->getParent()->getParent() : nullptr;
|
2008-08-24 06:23:09 +08:00
|
|
|
SlotTracker SlotTable(F);
|
2014-04-06 07:33:25 +08:00
|
|
|
AssemblyWriter W(OS, SlotTable, getModuleFromVal(I), nullptr);
|
2009-12-31 10:23:35 +08:00
|
|
|
W.printInstruction(*I);
|
2008-08-24 06:23:09 +08:00
|
|
|
} else if (const BasicBlock *BB = dyn_cast<BasicBlock>(this)) {
|
|
|
|
SlotTracker SlotTable(BB->getParent());
|
2014-04-06 07:33:25 +08:00
|
|
|
AssemblyWriter W(OS, SlotTable, getModuleFromVal(BB), nullptr);
|
2009-12-31 10:23:35 +08:00
|
|
|
W.printBasicBlock(BB);
|
2008-08-24 06:23:09 +08:00
|
|
|
} else if (const GlobalValue *GV = dyn_cast<GlobalValue>(this)) {
|
|
|
|
SlotTracker SlotTable(GV->getParent());
|
2014-04-06 07:33:25 +08:00
|
|
|
AssemblyWriter W(OS, SlotTable, GV->getParent(), nullptr);
|
2009-12-31 10:23:35 +08:00
|
|
|
if (const GlobalVariable *V = dyn_cast<GlobalVariable>(GV))
|
|
|
|
W.printGlobal(V);
|
|
|
|
else if (const Function *F = dyn_cast<Function>(GV))
|
|
|
|
W.printFunction(F);
|
|
|
|
else
|
|
|
|
W.printAlias(cast<GlobalAlias>(GV));
|
2009-07-02 04:59:15 +08:00
|
|
|
} else if (const MDNode *N = dyn_cast<MDNode>(this)) {
|
2010-01-20 12:45:57 +08:00
|
|
|
const Function *F = N->getFunction();
|
2010-01-14 09:47:37 +08:00
|
|
|
SlotTracker SlotTable(F);
|
2014-04-06 07:33:25 +08:00
|
|
|
AssemblyWriter W(OS, SlotTable, F ? F->getParent() : nullptr, nullptr);
|
2009-12-31 10:13:35 +08:00
|
|
|
W.printMDNodeBody(N);
|
2008-08-24 06:23:09 +08:00
|
|
|
} else if (const Constant *C = dyn_cast<Constant>(this)) {
|
2009-03-01 07:20:19 +08:00
|
|
|
TypePrinting TypePrinter;
|
2009-03-01 05:26:53 +08:00
|
|
|
TypePrinter.print(C->getType(), OS);
|
2009-03-01 05:11:05 +08:00
|
|
|
OS << ' ';
|
2014-04-06 07:33:25 +08:00
|
|
|
WriteConstantInternal(OS, C, TypePrinter, nullptr, nullptr);
|
2009-12-31 09:41:14 +08:00
|
|
|
} else if (isa<InlineAsm>(this) || isa<MDString>(this) ||
|
|
|
|
isa<Argument>(this)) {
|
2014-01-09 10:29:41 +08:00
|
|
|
this->printAsOperand(OS);
|
2008-08-24 06:23:09 +08:00
|
|
|
} else {
|
2014-05-09 08:49:03 +08:00
|
|
|
llvm_unreachable("Unknown value to print out!");
|
2008-08-24 06:23:09 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-01-09 10:29:41 +08:00
|
|
|
void Value::printAsOperand(raw_ostream &O, bool PrintType, const Module *M) const {
|
|
|
|
// Fast path: Don't construct and populate a TypePrinting object if we
|
|
|
|
// won't be needing any types printed.
|
|
|
|
if (!PrintType &&
|
|
|
|
((!isa<Constant>(this) && !isa<MDNode>(this)) ||
|
|
|
|
hasName() || isa<GlobalValue>(this))) {
|
2014-04-09 14:08:46 +08:00
|
|
|
WriteAsOperandInternal(O, this, nullptr, nullptr, M);
|
2014-01-09 10:29:41 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!M)
|
|
|
|
M = getModuleFromVal(this);
|
|
|
|
|
|
|
|
TypePrinting TypePrinter;
|
|
|
|
if (M)
|
|
|
|
TypePrinter.incorporateTypes(*M);
|
|
|
|
if (PrintType) {
|
|
|
|
TypePrinter.print(getType(), O);
|
|
|
|
O << ' ';
|
|
|
|
}
|
|
|
|
|
2014-04-09 14:08:46 +08:00
|
|
|
WriteAsOperandInternal(O, this, &TypePrinter, nullptr, M);
|
2014-01-09 10:29:41 +08:00
|
|
|
}
|
|
|
|
|
2008-08-26 01:03:15 +08:00
|
|
|
// Value::dump - allow easy printing of Values from the debugger.
|
2010-01-05 09:29:26 +08:00
|
|
|
void Value::dump() const { print(dbgs()); dbgs() << '\n'; }
|
2004-05-26 02:14:38 +08:00
|
|
|
|
2008-10-02 04:16:19 +08:00
|
|
|
// Type::dump - allow easy printing of Types from the debugger.
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
void Type::dump() const { print(dbgs()); }
|
2009-03-01 05:05:51 +08:00
|
|
|
|
2008-08-26 01:03:15 +08:00
|
|
|
// Module::dump() - Allow printing of Modules from the debugger.
|
2014-04-09 14:08:46 +08:00
|
|
|
void Module::dump() const { print(dbgs(), nullptr); }
|
2011-12-10 07:18:34 +08:00
|
|
|
|
2014-06-28 02:19:56 +08:00
|
|
|
// \brief Allow printing of Comdats from the debugger.
|
|
|
|
void Comdat::dump() const { print(dbgs()); }
|
|
|
|
|
2011-12-10 07:18:34 +08:00
|
|
|
// NamedMDNode::dump() - Allow printing of NamedMDNodes from the debugger.
|
2014-04-23 20:23:05 +08:00
|
|
|
void NamedMDNode::dump() const { print(dbgs()); }
|