2010-03-21 21:17:34 +00:00
|
|
|
//===-- LLVMContextImpl.cpp - Implement LLVMContextImpl -------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the opaque LLVMContextImpl.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "LLVMContextImpl.h"
|
2010-09-08 18:03:32 +00:00
|
|
|
#include "llvm/Module.h"
|
2011-07-12 00:26:08 +00:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2010-03-22 05:23:37 +00:00
|
|
|
#include <algorithm>
|
2010-04-15 17:08:50 +00:00
|
|
|
using namespace llvm;
|
2010-03-21 21:17:34 +00:00
|
|
|
|
|
|
|
LLVMContextImpl::LLVMContextImpl(LLVMContext &C)
|
|
|
|
: TheTrueVal(0), TheFalseVal(0),
|
|
|
|
VoidTy(C, Type::VoidTyID),
|
|
|
|
LabelTy(C, Type::LabelTyID),
|
2011-12-17 00:04:22 +00:00
|
|
|
HalfTy(C, Type::HalfTyID),
|
2010-03-21 21:17:34 +00:00
|
|
|
FloatTy(C, Type::FloatTyID),
|
|
|
|
DoubleTy(C, Type::DoubleTyID),
|
|
|
|
MetadataTy(C, Type::MetadataTyID),
|
|
|
|
X86_FP80Ty(C, Type::X86_FP80TyID),
|
|
|
|
FP128Ty(C, Type::FP128TyID),
|
|
|
|
PPC_FP128Ty(C, Type::PPC_FP128TyID),
|
2010-09-10 20:55:01 +00:00
|
|
|
X86_MMXTy(C, Type::X86_MMXTyID),
|
2010-03-21 21:17:34 +00:00
|
|
|
Int1Ty(C, 1),
|
|
|
|
Int8Ty(C, 8),
|
|
|
|
Int16Ty(C, 16),
|
|
|
|
Int32Ty(C, 32),
|
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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
Int64Ty(C, 64) {
|
2010-04-06 00:44:45 +00:00
|
|
|
InlineAsmDiagHandler = 0;
|
|
|
|
InlineAsmDiagContext = 0;
|
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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
NamedStructTypesUniqueID = 0;
|
2010-03-21 21:17:34 +00:00
|
|
|
}
|
|
|
|
|
2010-03-22 05:23:37 +00:00
|
|
|
namespace {
|
|
|
|
struct DropReferences {
|
|
|
|
// Takes the value_type of a ConstantUniqueMap's internal map, whose 'second'
|
|
|
|
// is a Constant*.
|
|
|
|
template<typename PairT>
|
|
|
|
void operator()(const PairT &P) {
|
|
|
|
P.second->dropAllReferences();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2010-03-21 21:17:34 +00:00
|
|
|
LLVMContextImpl::~LLVMContextImpl() {
|
2010-09-08 18:03:32 +00:00
|
|
|
// NOTE: We need to delete the contents of OwnedModules, but we have to
|
|
|
|
// duplicate it into a temporary vector, because the destructor of Module
|
|
|
|
// will try to remove itself from OwnedModules set. This would cause
|
|
|
|
// iterator invalidation if we iterated on the set directly.
|
|
|
|
std::vector<Module*> Modules(OwnedModules.begin(), OwnedModules.end());
|
2011-07-12 00:26:08 +00:00
|
|
|
DeleteContainerPointers(Modules);
|
2010-09-08 18:03:32 +00:00
|
|
|
|
2010-03-22 05:23:37 +00:00
|
|
|
std::for_each(ExprConstants.map_begin(), ExprConstants.map_end(),
|
|
|
|
DropReferences());
|
|
|
|
std::for_each(ArrayConstants.map_begin(), ArrayConstants.map_end(),
|
|
|
|
DropReferences());
|
|
|
|
std::for_each(StructConstants.map_begin(), StructConstants.map_end(),
|
|
|
|
DropReferences());
|
|
|
|
std::for_each(VectorConstants.map_begin(), VectorConstants.map_end(),
|
|
|
|
DropReferences());
|
2010-03-21 21:17:34 +00:00
|
|
|
ExprConstants.freeConstants();
|
|
|
|
ArrayConstants.freeConstants();
|
|
|
|
StructConstants.freeConstants();
|
|
|
|
VectorConstants.freeConstants();
|
|
|
|
AggZeroConstants.freeConstants();
|
|
|
|
NullPtrConstants.freeConstants();
|
|
|
|
UndefValueConstants.freeConstants();
|
|
|
|
InlineAsms.freeConstants();
|
2011-07-12 00:26:08 +00:00
|
|
|
DeleteContainerSeconds(IntConstants);
|
|
|
|
DeleteContainerSeconds(FPConstants);
|
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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
|
2010-03-21 21:17:34 +00:00
|
|
|
// Destroy MDNodes. ~MDNode can move and remove nodes between the MDNodeSet
|
|
|
|
// and the NonUniquedMDNodes sets, so copy the values out first.
|
|
|
|
SmallVector<MDNode*, 8> MDNodes;
|
|
|
|
MDNodes.reserve(MDNodeSet.size() + NonUniquedMDNodes.size());
|
|
|
|
for (FoldingSetIterator<MDNode> I = MDNodeSet.begin(), E = MDNodeSet.end();
|
2011-07-13 04:22:39 +00:00
|
|
|
I != E; ++I)
|
2010-03-21 21:17:34 +00:00
|
|
|
MDNodes.push_back(&*I);
|
|
|
|
MDNodes.append(NonUniquedMDNodes.begin(), NonUniquedMDNodes.end());
|
2010-10-12 00:15:27 +00:00
|
|
|
for (SmallVectorImpl<MDNode *>::iterator I = MDNodes.begin(),
|
2011-07-13 04:22:39 +00:00
|
|
|
E = MDNodes.end(); I != E; ++I)
|
2010-03-21 21:17:34 +00:00
|
|
|
(*I)->destroy();
|
|
|
|
assert(MDNodeSet.empty() && NonUniquedMDNodes.empty() &&
|
|
|
|
"Destroying all MDNodes didn't empty the Context's sets.");
|
|
|
|
// Destroy MDStrings.
|
2011-07-12 00:26:08 +00:00
|
|
|
DeleteContainerSeconds(MDStringCache);
|
2010-03-21 21:17:34 +00:00
|
|
|
}
|
2011-12-20 02:50:00 +00:00
|
|
|
|
|
|
|
// ConstantsContext anchors
|
|
|
|
void UnaryConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void BinaryConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void SelectConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void ExtractElementConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void InsertElementConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void ShuffleVectorConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void ExtractValueConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void InsertValueConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void GetElementPtrConstantExpr::anchor() { }
|
|
|
|
|
|
|
|
void CompareConstantExpr::anchor() { }
|