2002-07-11 00:38:08 +02:00
|
|
|
//===- DataStructure.cpp - Implement the core data structure analysis -----===//
|
2002-03-26 23:39:06 +01:00
|
|
|
//
|
2002-07-11 00:38:08 +02:00
|
|
|
// This file implements the core data structure functionality.
|
2002-03-26 23:39:06 +01:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-10-02 00:33:50 +02:00
|
|
|
#include "llvm/Analysis/DSGraph.h"
|
|
|
|
#include "llvm/Function.h"
|
2002-10-20 23:41:02 +02:00
|
|
|
#include "llvm/iOther.h"
|
2002-07-11 00:38:08 +02:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2002-10-02 06:57:39 +02:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2002-07-11 00:38:08 +02:00
|
|
|
#include "Support/STLExtras.h"
|
2002-10-02 00:33:50 +02:00
|
|
|
#include "Support/Statistic.h"
|
2002-11-18 22:44:46 +01:00
|
|
|
#include "Support/Timer.h"
|
2002-07-18 02:12:30 +02:00
|
|
|
#include <algorithm>
|
2002-03-26 23:39:06 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
namespace {
|
2002-11-08 02:21:07 +01:00
|
|
|
Statistic<> NumFolds ("dsnode", "Number of nodes completely folded");
|
|
|
|
Statistic<> NumCallNodesMerged("dsnode", "Number of call nodes merged");
|
2002-11-06 07:20:27 +01:00
|
|
|
};
|
|
|
|
|
2002-11-07 06:20:53 +01:00
|
|
|
namespace DS { // TODO: FIXME
|
2002-10-02 00:33:50 +02:00
|
|
|
extern TargetData TD;
|
|
|
|
}
|
2002-11-07 06:20:53 +01:00
|
|
|
using namespace DS;
|
2002-10-02 00:33:50 +02:00
|
|
|
|
2003-02-13 20:09:00 +01:00
|
|
|
DSNode *DSNodeHandle::HandleForwarding() const {
|
|
|
|
assert(!N->ForwardNH.isNull() && "Can only be invoked if forwarding!");
|
|
|
|
|
|
|
|
// Handle node forwarding here!
|
|
|
|
DSNode *Next = N->ForwardNH.getNode(); // Cause recursive shrinkage
|
|
|
|
Offset += N->ForwardNH.getOffset();
|
|
|
|
|
|
|
|
if (--N->NumReferrers == 0) {
|
|
|
|
// Removing the last referrer to the node, sever the forwarding link
|
|
|
|
N->stopForwarding();
|
|
|
|
}
|
|
|
|
|
|
|
|
N = Next;
|
|
|
|
N->NumReferrers++;
|
|
|
|
if (N->Size <= Offset) {
|
|
|
|
assert(N->Size <= 1 && "Forwarded to shrunk but not collapsed node?");
|
|
|
|
Offset = 0;
|
|
|
|
}
|
|
|
|
return N;
|
|
|
|
}
|
|
|
|
|
2002-07-11 00:38:08 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// DSNode Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-03-26 23:39:06 +01:00
|
|
|
|
2003-06-19 23:15:11 +02:00
|
|
|
DSNode::DSNode(const Type *T, DSGraph *G)
|
|
|
|
: NumReferrers(0), Size(0), ParentGraph(G), Ty(Type::VoidTy), NodeType(0) {
|
2002-10-31 06:45:02 +01:00
|
|
|
// Add the type entry if it is specified...
|
2002-11-06 07:20:27 +01:00
|
|
|
if (T) mergeTypeInfo(T, 0);
|
2003-02-12 00:11:51 +01:00
|
|
|
G->getNodes().push_back(this);
|
2002-07-11 00:38:08 +02:00
|
|
|
}
|
2002-03-26 23:39:06 +01:00
|
|
|
|
2002-07-18 02:12:30 +02:00
|
|
|
// DSNode copy constructor... do not copy over the referrers list!
|
2003-02-12 00:11:51 +01:00
|
|
|
DSNode::DSNode(const DSNode &N, DSGraph *G)
|
|
|
|
: NumReferrers(0), Size(N.Size), ParentGraph(G), Ty(N.Ty),
|
|
|
|
Links(N.Links), Globals(N.Globals), NodeType(N.NodeType) {
|
|
|
|
G->getNodes().push_back(this);
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
|
|
|
|
2003-02-12 00:11:51 +01:00
|
|
|
void DSNode::assertOK() const {
|
|
|
|
assert((Ty != Type::VoidTy ||
|
|
|
|
Ty == Type::VoidTy && (Size == 0 ||
|
|
|
|
(NodeType & DSNode::Array))) &&
|
|
|
|
"Node not OK!");
|
|
|
|
}
|
|
|
|
|
|
|
|
/// forwardNode - Mark this node as being obsolete, and all references to it
|
|
|
|
/// should be forwarded to the specified node and offset.
|
|
|
|
///
|
|
|
|
void DSNode::forwardNode(DSNode *To, unsigned Offset) {
|
|
|
|
assert(this != To && "Cannot forward a node to itself!");
|
|
|
|
assert(ForwardNH.isNull() && "Already forwarding from this node!");
|
|
|
|
if (To->Size <= 1) Offset = 0;
|
|
|
|
assert((Offset < To->Size || (Offset == To->Size && Offset == 0)) &&
|
|
|
|
"Forwarded offset is wrong!");
|
|
|
|
ForwardNH.setNode(To);
|
|
|
|
ForwardNH.setOffset(Offset);
|
|
|
|
NodeType = DEAD;
|
|
|
|
Size = 0;
|
|
|
|
Ty = Type::VoidTy;
|
2002-03-26 23:39:06 +01:00
|
|
|
}
|
|
|
|
|
2002-07-11 22:32:22 +02:00
|
|
|
// addGlobal - Add an entry for a global value to the Globals list. This also
|
|
|
|
// marks the node with the 'G' flag if it does not already have it.
|
|
|
|
//
|
|
|
|
void DSNode::addGlobal(GlobalValue *GV) {
|
2002-07-18 02:12:30 +02:00
|
|
|
// Keep the list sorted.
|
2003-02-01 05:01:21 +01:00
|
|
|
std::vector<GlobalValue*>::iterator I =
|
2002-07-18 02:12:30 +02:00
|
|
|
std::lower_bound(Globals.begin(), Globals.end(), GV);
|
|
|
|
|
|
|
|
if (I == Globals.end() || *I != GV) {
|
2002-10-02 00:33:50 +02:00
|
|
|
//assert(GV->getType()->getElementType() == Ty);
|
2002-07-18 02:12:30 +02:00
|
|
|
Globals.insert(I, GV);
|
|
|
|
NodeType |= GlobalNode;
|
|
|
|
}
|
2002-07-11 22:32:22 +02:00
|
|
|
}
|
|
|
|
|
2002-10-31 06:45:02 +01:00
|
|
|
/// foldNodeCompletely - If we determine that this node has some funny
|
|
|
|
/// behavior happening to it that we cannot represent, we fold it down to a
|
|
|
|
/// single, completely pessimistic, node. This node is represented as a
|
|
|
|
/// single byte with a single TypeEntry of "void".
|
|
|
|
///
|
|
|
|
void DSNode::foldNodeCompletely() {
|
2003-02-12 00:11:51 +01:00
|
|
|
if (isNodeCompletelyFolded()) return; // If this node is already folded...
|
2002-11-06 07:20:27 +01:00
|
|
|
|
|
|
|
++NumFolds;
|
|
|
|
|
2003-02-12 00:11:51 +01:00
|
|
|
// Create the node we are going to forward to...
|
2003-06-19 23:15:11 +02:00
|
|
|
DSNode *DestNode = new DSNode(0, ParentGraph);
|
|
|
|
DestNode->NodeType = NodeType|DSNode::Array;
|
2003-02-12 00:11:51 +01:00
|
|
|
DestNode->Ty = Type::VoidTy;
|
|
|
|
DestNode->Size = 1;
|
|
|
|
DestNode->Globals.swap(Globals);
|
|
|
|
|
|
|
|
// Start forwarding to the destination node...
|
|
|
|
forwardNode(DestNode, 0);
|
|
|
|
|
|
|
|
if (Links.size()) {
|
|
|
|
DestNode->Links.push_back(Links[0]);
|
|
|
|
DSNodeHandle NH(DestNode);
|
|
|
|
|
|
|
|
// If we have links, merge all of our outgoing links together...
|
|
|
|
for (unsigned i = Links.size()-1; i != 0; --i)
|
|
|
|
NH.getNode()->Links[0].mergeWith(Links[i]);
|
|
|
|
Links.clear();
|
|
|
|
} else {
|
|
|
|
DestNode->Links.resize(1);
|
|
|
|
}
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
2002-11-07 07:31:54 +01:00
|
|
|
|
2002-10-31 06:45:02 +01:00
|
|
|
/// isNodeCompletelyFolded - Return true if this node has been completely
|
|
|
|
/// folded down to something that can never be expanded, effectively losing
|
|
|
|
/// all of the field sensitivity that may be present in the node.
|
|
|
|
///
|
|
|
|
bool DSNode::isNodeCompletelyFolded() const {
|
2002-11-18 22:44:46 +01:00
|
|
|
return getSize() == 1 && Ty == Type::VoidTy && isArray();
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-06-29 22:27:45 +02:00
|
|
|
namespace {
|
|
|
|
/// TypeElementWalker Class - Used for implementation of physical subtyping...
|
|
|
|
///
|
|
|
|
class TypeElementWalker {
|
|
|
|
struct StackState {
|
|
|
|
const Type *Ty;
|
|
|
|
unsigned Offset;
|
|
|
|
unsigned Idx;
|
|
|
|
StackState(const Type *T, unsigned Off = 0)
|
|
|
|
: Ty(T), Offset(Off), Idx(0) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
std::vector<StackState> Stack;
|
|
|
|
public:
|
|
|
|
TypeElementWalker(const Type *T) {
|
|
|
|
Stack.push_back(T);
|
|
|
|
StepToLeaf();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isDone() const { return Stack.empty(); }
|
|
|
|
const Type *getCurrentType() const { return Stack.back().Ty; }
|
|
|
|
unsigned getCurrentOffset() const { return Stack.back().Offset; }
|
|
|
|
|
|
|
|
void StepToNextType() {
|
|
|
|
PopStackAndAdvance();
|
|
|
|
StepToLeaf();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
/// PopStackAndAdvance - Pop the current element off of the stack and
|
|
|
|
/// advance the underlying element to the next contained member.
|
|
|
|
void PopStackAndAdvance() {
|
|
|
|
assert(!Stack.empty() && "Cannot pop an empty stack!");
|
|
|
|
Stack.pop_back();
|
|
|
|
while (!Stack.empty()) {
|
|
|
|
StackState &SS = Stack.back();
|
|
|
|
if (const StructType *ST = dyn_cast<StructType>(SS.Ty)) {
|
|
|
|
++SS.Idx;
|
|
|
|
if (SS.Idx != ST->getElementTypes().size()) {
|
|
|
|
const StructLayout *SL = TD.getStructLayout(ST);
|
|
|
|
SS.Offset += SL->MemberOffsets[SS.Idx]-SL->MemberOffsets[SS.Idx-1];
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
Stack.pop_back(); // At the end of the structure
|
|
|
|
} else {
|
|
|
|
const ArrayType *AT = cast<ArrayType>(SS.Ty);
|
|
|
|
++SS.Idx;
|
|
|
|
if (SS.Idx != AT->getNumElements()) {
|
|
|
|
SS.Offset += TD.getTypeSize(AT->getElementType());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
Stack.pop_back(); // At the end of the array
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// StepToLeaf - Used by physical subtyping to move to the first leaf node
|
|
|
|
/// on the type stack.
|
|
|
|
void StepToLeaf() {
|
|
|
|
if (Stack.empty()) return;
|
|
|
|
while (!Stack.empty() && !Stack.back().Ty->isFirstClassType()) {
|
|
|
|
StackState &SS = Stack.back();
|
|
|
|
if (const StructType *ST = dyn_cast<StructType>(SS.Ty)) {
|
|
|
|
if (ST->getElementTypes().empty()) {
|
|
|
|
assert(SS.Idx == 0);
|
|
|
|
PopStackAndAdvance();
|
|
|
|
} else {
|
|
|
|
// Step into the structure...
|
|
|
|
assert(SS.Idx < ST->getElementTypes().size());
|
|
|
|
const StructLayout *SL = TD.getStructLayout(ST);
|
|
|
|
Stack.push_back(StackState(ST->getElementTypes()[SS.Idx],
|
|
|
|
SS.Offset+SL->MemberOffsets[SS.Idx]));
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
const ArrayType *AT = cast<ArrayType>(SS.Ty);
|
|
|
|
if (AT->getNumElements() == 0) {
|
|
|
|
assert(SS.Idx == 0);
|
|
|
|
PopStackAndAdvance();
|
|
|
|
} else {
|
|
|
|
// Step into the array...
|
|
|
|
assert(SS.Idx < AT->getNumElements());
|
|
|
|
Stack.push_back(StackState(AT->getElementType(),
|
|
|
|
SS.Offset+SS.Idx*
|
|
|
|
TD.getTypeSize(AT->getElementType())));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
/// ElementTypesAreCompatible - Check to see if the specified types are
|
|
|
|
/// "physically" compatible. If so, return true, else return false. We only
|
|
|
|
/// have to check the fields in T1: T2 may be larger than T1.
|
|
|
|
///
|
|
|
|
static bool ElementTypesAreCompatible(const Type *T1, const Type *T2) {
|
|
|
|
TypeElementWalker T1W(T1), T2W(T2);
|
|
|
|
|
|
|
|
while (!T1W.isDone() && !T2W.isDone()) {
|
|
|
|
if (T1W.getCurrentOffset() != T2W.getCurrentOffset())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const Type *T1 = T1W.getCurrentType();
|
|
|
|
const Type *T2 = T2W.getCurrentType();
|
|
|
|
if (T1 != T2 && !T1->isLosslesslyConvertibleTo(T2))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
T1W.StepToNextType();
|
|
|
|
T2W.StepToNextType();
|
|
|
|
}
|
|
|
|
|
|
|
|
return T1W.isDone();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
/// mergeTypeInfo - This method merges the specified type into the current node
|
|
|
|
/// at the specified offset. This may update the current node's type record if
|
|
|
|
/// this gives more information to the node, it may do nothing to the node if
|
|
|
|
/// this information is already known, or it may merge the node completely (and
|
|
|
|
/// return true) if the information is incompatible with what is already known.
|
2002-10-02 06:57:39 +02:00
|
|
|
///
|
2002-11-06 07:20:27 +01:00
|
|
|
/// This method returns true if the node is completely folded, otherwise false.
|
|
|
|
///
|
2003-03-03 18:13:31 +01:00
|
|
|
bool DSNode::mergeTypeInfo(const Type *NewTy, unsigned Offset,
|
|
|
|
bool FoldIfIncompatible) {
|
2002-11-06 07:20:27 +01:00
|
|
|
// Check to make sure the Size member is up-to-date. Size can be one of the
|
|
|
|
// following:
|
|
|
|
// Size = 0, Ty = Void: Nothing is known about this node.
|
|
|
|
// Size = 0, Ty = FnTy: FunctionPtr doesn't have a size, so we use zero
|
|
|
|
// Size = 1, Ty = Void, Array = 1: The node is collapsed
|
|
|
|
// Otherwise, sizeof(Ty) = Size
|
|
|
|
//
|
2002-11-18 22:44:46 +01:00
|
|
|
assert(((Size == 0 && Ty == Type::VoidTy && !isArray()) ||
|
|
|
|
(Size == 0 && !Ty->isSized() && !isArray()) ||
|
|
|
|
(Size == 1 && Ty == Type::VoidTy && isArray()) ||
|
|
|
|
(Size == 0 && !Ty->isSized() && !isArray()) ||
|
|
|
|
(TD.getTypeSize(Ty) == Size)) &&
|
2002-11-06 07:20:27 +01:00
|
|
|
"Size member of DSNode doesn't match the type structure!");
|
|
|
|
assert(NewTy != Type::VoidTy && "Cannot merge void type into DSNode!");
|
|
|
|
|
2002-11-18 22:44:46 +01:00
|
|
|
if (Offset == 0 && NewTy == Ty)
|
2002-11-06 07:20:27 +01:00
|
|
|
return false; // This should be a common case, handle it efficiently
|
|
|
|
|
|
|
|
// Return true immediately if the node is completely folded.
|
|
|
|
if (isNodeCompletelyFolded()) return true;
|
|
|
|
|
2002-11-08 23:49:57 +01:00
|
|
|
// If this is an array type, eliminate the outside arrays because they won't
|
|
|
|
// be used anyway. This greatly reduces the size of large static arrays used
|
|
|
|
// as global variables, for example.
|
|
|
|
//
|
2002-11-09 20:25:27 +01:00
|
|
|
bool WillBeArray = false;
|
2002-11-08 23:49:57 +01:00
|
|
|
while (const ArrayType *AT = dyn_cast<ArrayType>(NewTy)) {
|
|
|
|
// FIXME: we might want to keep small arrays, but must be careful about
|
|
|
|
// things like: [2 x [10000 x int*]]
|
|
|
|
NewTy = AT->getElementType();
|
2002-11-09 20:25:27 +01:00
|
|
|
WillBeArray = true;
|
2002-11-08 23:49:57 +01:00
|
|
|
}
|
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Figure out how big the new type we're merging in is...
|
|
|
|
unsigned NewTySize = NewTy->isSized() ? TD.getTypeSize(NewTy) : 0;
|
|
|
|
|
|
|
|
// Otherwise check to see if we can fold this type into the current node. If
|
|
|
|
// we can't, we fold the node completely, if we can, we potentially update our
|
|
|
|
// internal state.
|
|
|
|
//
|
2002-11-18 22:44:46 +01:00
|
|
|
if (Ty == Type::VoidTy) {
|
2002-11-06 07:20:27 +01:00
|
|
|
// If this is the first type that this node has seen, just accept it without
|
|
|
|
// question....
|
|
|
|
assert(Offset == 0 && "Cannot have an offset into a void node!");
|
2002-11-18 22:44:46 +01:00
|
|
|
assert(!isArray() && "This shouldn't happen!");
|
|
|
|
Ty = NewTy;
|
|
|
|
NodeType &= ~Array;
|
|
|
|
if (WillBeArray) NodeType |= Array;
|
2002-11-06 07:20:27 +01:00
|
|
|
Size = NewTySize;
|
|
|
|
|
|
|
|
// Calculate the number of outgoing links from this node.
|
|
|
|
Links.resize((Size+DS::PointerSize-1) >> DS::PointerShift);
|
|
|
|
return false;
|
2002-10-02 06:57:39 +02:00
|
|
|
}
|
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Handle node expansion case here...
|
|
|
|
if (Offset+NewTySize > Size) {
|
|
|
|
// It is illegal to grow this node if we have treated it as an array of
|
|
|
|
// objects...
|
2002-11-18 22:44:46 +01:00
|
|
|
if (isArray()) {
|
2003-03-03 18:13:31 +01:00
|
|
|
if (FoldIfIncompatible) foldNodeCompletely();
|
2002-11-06 07:20:27 +01:00
|
|
|
return true;
|
|
|
|
}
|
2002-10-02 00:33:50 +02:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
if (Offset) { // We could handle this case, but we don't for now...
|
2003-06-29 22:27:45 +02:00
|
|
|
std::cerr << "UNIMP: Trying to merge a growth type into "
|
|
|
|
<< "offset != 0: Collapsing!\n";
|
2003-03-03 18:13:31 +01:00
|
|
|
if (FoldIfIncompatible) foldNodeCompletely();
|
2002-11-06 07:20:27 +01:00
|
|
|
return true;
|
|
|
|
}
|
2002-10-02 00:33:50 +02:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Okay, the situation is nice and simple, we are trying to merge a type in
|
|
|
|
// at offset 0 that is bigger than our current type. Implement this by
|
|
|
|
// switching to the new type and then merge in the smaller one, which should
|
|
|
|
// hit the other code path here. If the other code path decides it's not
|
|
|
|
// ok, it will collapse the node as appropriate.
|
|
|
|
//
|
2002-11-18 22:44:46 +01:00
|
|
|
const Type *OldTy = Ty;
|
|
|
|
Ty = NewTy;
|
|
|
|
NodeType &= ~Array;
|
|
|
|
if (WillBeArray) NodeType |= Array;
|
2002-11-06 07:20:27 +01:00
|
|
|
Size = NewTySize;
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Must grow links to be the appropriate size...
|
|
|
|
Links.resize((Size+DS::PointerSize-1) >> DS::PointerShift);
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Merge in the old type now... which is guaranteed to be smaller than the
|
|
|
|
// "current" type.
|
|
|
|
return mergeTypeInfo(OldTy, 0);
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
2002-11-06 07:20:27 +01:00
|
|
|
|
2002-11-07 05:59:28 +01:00
|
|
|
assert(Offset <= Size &&
|
2002-11-06 07:20:27 +01:00
|
|
|
"Cannot merge something into a part of our type that doesn't exist!");
|
|
|
|
|
2002-11-18 22:44:46 +01:00
|
|
|
// Find the section of Ty that NewTy overlaps with... first we find the
|
2002-11-06 07:20:27 +01:00
|
|
|
// type that starts at offset Offset.
|
2002-10-31 06:45:02 +01:00
|
|
|
//
|
2002-11-06 07:20:27 +01:00
|
|
|
unsigned O = 0;
|
2002-11-18 22:44:46 +01:00
|
|
|
const Type *SubType = Ty;
|
2002-11-06 07:20:27 +01:00
|
|
|
while (O < Offset) {
|
|
|
|
assert(Offset-O < TD.getTypeSize(SubType) && "Offset out of range!");
|
|
|
|
|
|
|
|
switch (SubType->getPrimitiveID()) {
|
|
|
|
case Type::StructTyID: {
|
|
|
|
const StructType *STy = cast<StructType>(SubType);
|
|
|
|
const StructLayout &SL = *TD.getStructLayout(STy);
|
|
|
|
|
|
|
|
unsigned i = 0, e = SL.MemberOffsets.size();
|
|
|
|
for (; i+1 < e && SL.MemberOffsets[i+1] <= Offset-O; ++i)
|
|
|
|
/* empty */;
|
|
|
|
|
|
|
|
// The offset we are looking for must be in the i'th element...
|
|
|
|
SubType = STy->getElementTypes()[i];
|
|
|
|
O += SL.MemberOffsets[i];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Type::ArrayTyID: {
|
|
|
|
SubType = cast<ArrayType>(SubType)->getElementType();
|
|
|
|
unsigned ElSize = TD.getTypeSize(SubType);
|
|
|
|
unsigned Remainder = (Offset-O) % ElSize;
|
|
|
|
O = Offset-Remainder;
|
|
|
|
break;
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
2002-11-06 07:20:27 +01:00
|
|
|
default:
|
2003-03-03 18:13:31 +01:00
|
|
|
if (FoldIfIncompatible) foldNodeCompletely();
|
2003-02-03 20:12:15 +01:00
|
|
|
return true;
|
2002-11-06 07:20:27 +01:00
|
|
|
}
|
|
|
|
}
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
assert(O == Offset && "Could not achieve the correct offset!");
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// If we found our type exactly, early exit
|
|
|
|
if (SubType == NewTy) return false;
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2003-06-29 22:27:45 +02:00
|
|
|
unsigned SubTypeSize = SubType->isSized() ? TD.getTypeSize(SubType) : 0;
|
|
|
|
|
|
|
|
// Ok, we are getting desperate now. Check for physical subtyping, where we
|
|
|
|
// just require each element in the node to be compatible.
|
2003-06-30 00:36:31 +02:00
|
|
|
if (NewTySize <= SubTypeSize && NewTySize && NewTySize < 256 &&
|
2003-06-29 22:27:45 +02:00
|
|
|
SubTypeSize && SubTypeSize < 256 &&
|
|
|
|
ElementTypesAreCompatible(NewTy, SubType))
|
|
|
|
return false;
|
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Okay, so we found the leader type at the offset requested. Search the list
|
|
|
|
// of types that starts at this offset. If SubType is currently an array or
|
|
|
|
// structure, the type desired may actually be the first element of the
|
|
|
|
// composite type...
|
|
|
|
//
|
2002-11-18 22:44:46 +01:00
|
|
|
unsigned PadSize = SubTypeSize; // Size, including pad memory which is ignored
|
2002-11-06 07:20:27 +01:00
|
|
|
while (SubType != NewTy) {
|
|
|
|
const Type *NextSubType = 0;
|
2002-11-09 01:49:05 +01:00
|
|
|
unsigned NextSubTypeSize = 0;
|
2002-11-18 22:44:46 +01:00
|
|
|
unsigned NextPadSize = 0;
|
2002-11-06 07:20:27 +01:00
|
|
|
switch (SubType->getPrimitiveID()) {
|
2002-11-18 22:44:46 +01:00
|
|
|
case Type::StructTyID: {
|
|
|
|
const StructType *STy = cast<StructType>(SubType);
|
|
|
|
const StructLayout &SL = *TD.getStructLayout(STy);
|
|
|
|
if (SL.MemberOffsets.size() > 1)
|
|
|
|
NextPadSize = SL.MemberOffsets[1];
|
|
|
|
else
|
|
|
|
NextPadSize = SubTypeSize;
|
|
|
|
NextSubType = STy->getElementTypes()[0];
|
|
|
|
NextSubTypeSize = TD.getTypeSize(NextSubType);
|
2002-11-06 07:20:27 +01:00
|
|
|
break;
|
2002-11-18 22:44:46 +01:00
|
|
|
}
|
2002-11-06 07:20:27 +01:00
|
|
|
case Type::ArrayTyID:
|
|
|
|
NextSubType = cast<ArrayType>(SubType)->getElementType();
|
2002-11-18 22:44:46 +01:00
|
|
|
NextSubTypeSize = TD.getTypeSize(NextSubType);
|
|
|
|
NextPadSize = NextSubTypeSize;
|
2002-11-06 07:20:27 +01:00
|
|
|
break;
|
|
|
|
default: ;
|
|
|
|
// fall out
|
|
|
|
}
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
if (NextSubType == 0)
|
|
|
|
break; // In the default case, break out of the loop
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-18 22:44:46 +01:00
|
|
|
if (NextPadSize < NewTySize)
|
2002-11-06 07:20:27 +01:00
|
|
|
break; // Don't allow shrinking to a smaller type than NewTySize
|
|
|
|
SubType = NextSubType;
|
|
|
|
SubTypeSize = NextSubTypeSize;
|
2002-11-18 22:44:46 +01:00
|
|
|
PadSize = NextPadSize;
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// If we found the type exactly, return it...
|
|
|
|
if (SubType == NewTy)
|
|
|
|
return false;
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Check to see if we have a compatible, but different type...
|
|
|
|
if (NewTySize == SubTypeSize) {
|
2003-05-20 20:45:36 +02:00
|
|
|
// Check to see if this type is obviously convertible... int -> uint f.e.
|
|
|
|
if (NewTy->isLosslesslyConvertibleTo(SubType))
|
2002-11-06 07:20:27 +01:00
|
|
|
return false;
|
2002-10-31 06:45:02 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// Check to see if we have a pointer & integer mismatch going on here,
|
|
|
|
// loading a pointer as a long, for example.
|
2002-10-31 06:45:02 +01:00
|
|
|
//
|
2002-11-06 07:20:27 +01:00
|
|
|
if (SubType->isInteger() && isa<PointerType>(NewTy) ||
|
|
|
|
NewTy->isInteger() && isa<PointerType>(SubType))
|
|
|
|
return false;
|
2002-11-18 22:44:46 +01:00
|
|
|
} else if (NewTySize > SubTypeSize && NewTySize <= PadSize) {
|
|
|
|
// We are accessing the field, plus some structure padding. Ignore the
|
|
|
|
// structure padding.
|
|
|
|
return false;
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
2002-11-06 07:20:27 +01:00
|
|
|
|
2002-11-18 22:44:46 +01:00
|
|
|
DEBUG(std::cerr << "MergeTypeInfo Folding OrigTy: " << Ty
|
2002-11-07 02:54:56 +01:00
|
|
|
<< "\n due to:" << NewTy << " @ " << Offset << "!\n"
|
|
|
|
<< "SubType: " << SubType << "\n\n");
|
2002-11-06 07:20:27 +01:00
|
|
|
|
2003-03-03 18:13:31 +01:00
|
|
|
if (FoldIfIncompatible) foldNodeCompletely();
|
2002-11-06 07:20:27 +01:00
|
|
|
return true;
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
|
|
|
|
2002-04-04 21:21:27 +02:00
|
|
|
|
2002-11-05 01:01:58 +01:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
// addEdgeTo - Add an edge from the current node to the specified node. This
|
|
|
|
// can cause merging of nodes in the graph.
|
|
|
|
//
|
|
|
|
void DSNode::addEdgeTo(unsigned Offset, const DSNodeHandle &NH) {
|
|
|
|
if (NH.getNode() == 0) return; // Nothing to do
|
2002-10-02 06:57:39 +02:00
|
|
|
|
2002-11-06 07:20:27 +01:00
|
|
|
DSNodeHandle &ExistingEdge = getLink(Offset);
|
|
|
|
if (ExistingEdge.getNode()) {
|
|
|
|
// Merge the two nodes...
|
|
|
|
ExistingEdge.mergeWith(NH);
|
|
|
|
} else { // No merging to perform...
|
|
|
|
setLink(Offset, NH); // Just force a link in there...
|
2002-10-02 06:57:39 +02:00
|
|
|
}
|
2002-03-26 23:39:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-10-02 00:33:50 +02:00
|
|
|
// MergeSortedVectors - Efficiently merge a vector into another vector where
|
|
|
|
// duplicates are not allowed and both are sorted. This assumes that 'T's are
|
|
|
|
// efficiently copyable and have sane comparison semantics.
|
2002-03-26 23:39:06 +01:00
|
|
|
//
|
2003-02-01 05:01:21 +01:00
|
|
|
static void MergeSortedVectors(std::vector<GlobalValue*> &Dest,
|
|
|
|
const std::vector<GlobalValue*> &Src) {
|
2002-10-02 00:33:50 +02:00
|
|
|
// By far, the most common cases will be the simple ones. In these cases,
|
|
|
|
// avoid having to allocate a temporary vector...
|
|
|
|
//
|
|
|
|
if (Src.empty()) { // Nothing to merge in...
|
|
|
|
return;
|
|
|
|
} else if (Dest.empty()) { // Just copy the result in...
|
|
|
|
Dest = Src;
|
|
|
|
} else if (Src.size() == 1) { // Insert a single element...
|
2002-11-18 22:44:46 +01:00
|
|
|
const GlobalValue *V = Src[0];
|
2003-02-01 05:01:21 +01:00
|
|
|
std::vector<GlobalValue*>::iterator I =
|
2002-10-02 00:33:50 +02:00
|
|
|
std::lower_bound(Dest.begin(), Dest.end(), V);
|
|
|
|
if (I == Dest.end() || *I != Src[0]) // If not already contained...
|
|
|
|
Dest.insert(I, Src[0]);
|
|
|
|
} else if (Dest.size() == 1) {
|
2002-11-18 22:44:46 +01:00
|
|
|
GlobalValue *Tmp = Dest[0]; // Save value in temporary...
|
2002-10-02 00:33:50 +02:00
|
|
|
Dest = Src; // Copy over list...
|
2003-02-01 05:01:21 +01:00
|
|
|
std::vector<GlobalValue*>::iterator I =
|
2002-11-12 08:20:45 +01:00
|
|
|
std::lower_bound(Dest.begin(), Dest.end(), Tmp);
|
|
|
|
if (I == Dest.end() || *I != Tmp) // If not already contained...
|
|
|
|
Dest.insert(I, Tmp);
|
2002-10-02 00:33:50 +02:00
|
|
|
|
|
|
|
} else {
|
|
|
|
// Make a copy to the side of Dest...
|
2003-02-01 05:01:21 +01:00
|
|
|
std::vector<GlobalValue*> Old(Dest);
|
2002-10-02 00:33:50 +02:00
|
|
|
|
|
|
|
// Make space for all of the type entries now...
|
|
|
|
Dest.resize(Dest.size()+Src.size());
|
|
|
|
|
|
|
|
// Merge the two sorted ranges together... into Dest.
|
|
|
|
std::merge(Old.begin(), Old.end(), Src.begin(), Src.end(), Dest.begin());
|
|
|
|
|
|
|
|
// Now erase any duplicate entries that may have accumulated into the
|
|
|
|
// vectors (because they were in both of the input sets)
|
|
|
|
Dest.erase(std::unique(Dest.begin(), Dest.end()), Dest.end());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-12-06 22:15:21 +01:00
|
|
|
// MergeNodes() - Helper function for DSNode::mergeWith().
|
|
|
|
// This function does the hard work of merging two nodes, CurNodeH
|
|
|
|
// and NH after filtering out trivial cases and making sure that
|
|
|
|
// CurNodeH.offset >= NH.offset.
|
|
|
|
//
|
|
|
|
// ***WARNING***
|
|
|
|
// Since merging may cause either node to go away, we must always
|
|
|
|
// use the node-handles to refer to the nodes. These node handles are
|
|
|
|
// automatically updated during merging, so will always provide access
|
|
|
|
// to the correct node after a merge.
|
2002-10-02 00:33:50 +02:00
|
|
|
//
|
2002-12-06 22:15:21 +01:00
|
|
|
void DSNode::MergeNodes(DSNodeHandle& CurNodeH, DSNodeHandle& NH) {
|
|
|
|
assert(CurNodeH.getOffset() >= NH.getOffset() &&
|
|
|
|
"This should have been enforced in the caller.");
|
2002-11-12 08:20:45 +01:00
|
|
|
|
|
|
|
// Now we know that Offset >= NH.Offset, so convert it so our "Offset" (with
|
|
|
|
// respect to NH.Offset) is now zero. NOffset is the distance from the base
|
|
|
|
// of our object that N starts from.
|
|
|
|
//
|
2002-12-06 22:15:21 +01:00
|
|
|
unsigned NOffset = CurNodeH.getOffset()-NH.getOffset();
|
|
|
|
unsigned NSize = NH.getNode()->getSize();
|
2002-11-12 08:20:45 +01:00
|
|
|
|
2003-06-29 22:27:45 +02:00
|
|
|
// If the two nodes are of different size, and the smaller node has the array
|
|
|
|
// bit set, collapse!
|
|
|
|
if (NSize != CurNodeH.getNode()->getSize()) {
|
|
|
|
if (NSize < CurNodeH.getNode()->getSize()) {
|
|
|
|
if (NH.getNode()->isArray())
|
|
|
|
NH.getNode()->foldNodeCompletely();
|
|
|
|
} else if (CurNodeH.getNode()->isArray()) {
|
|
|
|
NH.getNode()->foldNodeCompletely();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Merge the type entries of the two nodes together...
|
2003-02-12 00:11:51 +01:00
|
|
|
if (NH.getNode()->Ty != Type::VoidTy)
|
2002-12-06 22:15:21 +01:00
|
|
|
CurNodeH.getNode()->mergeTypeInfo(NH.getNode()->Ty, NOffset);
|
2003-06-19 23:15:11 +02:00
|
|
|
assert(!CurNodeH.getNode()->isDeadNode());
|
2002-11-08 22:27:12 +01:00
|
|
|
|
2002-10-31 06:45:02 +01:00
|
|
|
// If we are merging a node with a completely folded node, then both nodes are
|
|
|
|
// now completely folded.
|
|
|
|
//
|
2002-12-06 22:15:21 +01:00
|
|
|
if (CurNodeH.getNode()->isNodeCompletelyFolded()) {
|
|
|
|
if (!NH.getNode()->isNodeCompletelyFolded()) {
|
|
|
|
NH.getNode()->foldNodeCompletely();
|
2003-02-12 00:11:51 +01:00
|
|
|
assert(NH.getNode() && NH.getOffset() == 0 &&
|
|
|
|
"folding did not make offset 0?");
|
2002-12-06 22:15:21 +01:00
|
|
|
NOffset = NH.getOffset();
|
|
|
|
NSize = NH.getNode()->getSize();
|
|
|
|
assert(NOffset == 0 && NSize == 1);
|
2002-11-08 22:27:12 +01:00
|
|
|
}
|
2002-12-06 22:15:21 +01:00
|
|
|
} else if (NH.getNode()->isNodeCompletelyFolded()) {
|
|
|
|
CurNodeH.getNode()->foldNodeCompletely();
|
2003-02-12 00:11:51 +01:00
|
|
|
assert(CurNodeH.getNode() && CurNodeH.getOffset() == 0 &&
|
|
|
|
"folding did not make offset 0?");
|
2002-11-12 08:20:45 +01:00
|
|
|
NOffset = NH.getOffset();
|
2002-12-06 22:15:21 +01:00
|
|
|
NSize = NH.getNode()->getSize();
|
|
|
|
assert(NOffset == 0 && NSize == 1);
|
2002-10-31 06:45:02 +01:00
|
|
|
}
|
|
|
|
|
2003-02-12 00:11:51 +01:00
|
|
|
DSNode *N = NH.getNode();
|
|
|
|
if (CurNodeH.getNode() == N || N == 0) return;
|
2003-06-19 23:15:11 +02:00
|
|
|
assert(!CurNodeH.getNode()->isDeadNode());
|
2002-10-02 00:33:50 +02:00
|
|
|
|
2003-06-19 23:15:11 +02:00
|
|
|
// Merge the NodeType information...
|
2003-02-12 00:11:51 +01:00
|
|
|
CurNodeH.getNode()->NodeType |= N->NodeType;
|
2003-06-19 23:15:11 +02:00
|
|
|
|
|
|
|
// Start forwarding to the new node!
|
2003-02-12 00:11:51 +01:00
|
|
|
N->forwardNode(CurNodeH.getNode(), NOffset);
|
2003-06-19 23:15:11 +02:00
|
|
|
assert(!CurNodeH.getNode()->isDeadNode());
|
2002-12-06 22:15:21 +01:00
|
|
|
|
2003-02-12 00:11:51 +01:00
|
|
|
// Make all of the outgoing links of N now be outgoing links of CurNodeH.
|
|
|
|
//
|
|
|
|
for (unsigned i = 0; i < N->getNumLinks(); ++i) {
|
|
|
|
DSNodeHandle &Link = N->getLink(i << DS::PointerShift);
|
2002-11-06 07:20:27 +01:00
|
|
|
if (Link.getNode()) {
|
2002-12-05 18:17:26 +01:00
|
|
|
// Compute the offset into the current node at which to
|
|
|
|
// merge this link. In the common case, this is a linear
|
|
|
|
// relation to the offset in the original node (with
|
|
|
|
// wrapping), but if the current node gets collapsed due to
|
|
|
|
// recursive merging, we must make sure to merge in all remaining
|
|
|
|
// links at offset zero.
|
|
|
|
unsigned MergeOffset = 0;
|
2003-02-12 00:11:51 +01:00
|
|
|
DSNode *CN = CurNodeH.getNode();
|
|
|
|
if (CN->Size != 1)
|
|
|
|
MergeOffset = ((i << DS::PointerShift)+NOffset) % CN->getSize();
|
|
|
|
CN->addEdgeTo(MergeOffset, Link);
|
2002-10-02 06:57:39 +02:00
|
|
|
}
|
|
|
|
}
|
2002-10-02 00:33:50 +02:00
|
|
|
|
|
|
|
// Now that there are no outgoing edges, all of the Links are dead.
|
2003-02-12 00:11:51 +01:00
|
|
|
N->Links.clear();
|
2002-07-11 22:32:22 +02:00
|
|
|
|
2002-10-02 00:33:50 +02:00
|
|
|
// Merge the globals list...
|
2003-02-12 00:11:51 +01:00
|
|
|
if (!N->Globals.empty()) {
|
|
|
|
MergeSortedVectors(CurNodeH.getNode()->Globals, N->Globals);
|
2002-07-18 02:12:30 +02:00
|
|
|
|
|
|
|
// Delete the globals from the old node...
|
2003-02-12 00:11:51 +01:00
|
|
|
std::vector<GlobalValue*>().swap(N->Globals);
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
2002-03-26 23:39:06 +01:00
|
|
|
}
|
|
|
|
|
2002-12-06 22:15:21 +01:00
|
|
|
|
|
|
|
// mergeWith - Merge this node and the specified node, moving all links to and
|
|
|
|
// from the argument node into the current node, deleting the node argument.
|
|
|
|
// Offset indicates what offset the specified node is to be merged into the
|
|
|
|
// current node.
|
|
|
|
//
|
|
|
|
// The specified node may be a null pointer (in which case, nothing happens).
|
|
|
|
//
|
|
|
|
void DSNode::mergeWith(const DSNodeHandle &NH, unsigned Offset) {
|
|
|
|
DSNode *N = NH.getNode();
|
|
|
|
if (N == 0 || (N == this && NH.getOffset() == Offset))
|
|
|
|
return; // Noop
|
|
|
|
|
2003-06-19 23:15:11 +02:00
|
|
|
assert(!N->isDeadNode() && !isDeadNode());
|
2002-12-06 22:15:21 +01:00
|
|
|
assert(!hasNoReferrers() && "Should not try to fold a useless node!");
|
|
|
|
|
|
|
|
if (N == this) {
|
|
|
|
// We cannot merge two pieces of the same node together, collapse the node
|
|
|
|
// completely.
|
|
|
|
DEBUG(std::cerr << "Attempting to merge two chunks of"
|
|
|
|
<< " the same node together!\n");
|
|
|
|
foldNodeCompletely();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If both nodes are not at offset 0, make sure that we are merging the node
|
|
|
|
// at an later offset into the node with the zero offset.
|
|
|
|
//
|
|
|
|
if (Offset < NH.getOffset()) {
|
|
|
|
N->mergeWith(DSNodeHandle(this, Offset), NH.getOffset());
|
|
|
|
return;
|
|
|
|
} else if (Offset == NH.getOffset() && getSize() < N->getSize()) {
|
|
|
|
// If the offsets are the same, merge the smaller node into the bigger node
|
|
|
|
N->mergeWith(DSNodeHandle(this, Offset), NH.getOffset());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ok, now we can merge the two nodes. Use a static helper that works with
|
|
|
|
// two node handles, since "this" may get merged away at intermediate steps.
|
|
|
|
DSNodeHandle CurNodeH(this, Offset);
|
|
|
|
DSNodeHandle NHCopy(NH);
|
|
|
|
DSNode::MergeNodes(CurNodeH, NHCopy);
|
|
|
|
}
|
|
|
|
|
2002-10-21 00:11:44 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// DSCallSite Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-10-20 23:41:02 +02:00
|
|
|
// Define here to avoid including iOther.h and BasicBlock.h in DSGraph.h
|
2002-10-21 00:11:44 +02:00
|
|
|
Function &DSCallSite::getCaller() const {
|
2002-10-21 04:08:03 +02:00
|
|
|
return *Inst->getParent()->getParent();
|
2002-10-20 23:41:02 +02:00
|
|
|
}
|
2002-10-20 20:07:37 +02:00
|
|
|
|
|
|
|
|
2002-07-11 00:38:08 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// DSGraph Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-03-28 18:56:03 +01:00
|
|
|
|
2003-06-30 05:15:25 +02:00
|
|
|
DSGraph::DSGraph(const DSGraph &G) : GlobalsGraph(0) {
|
2002-11-10 07:59:55 +01:00
|
|
|
PrintAuxCalls = false;
|
2003-06-30 05:15:25 +02:00
|
|
|
NodeMapTy NodeMap;
|
|
|
|
cloneInto(G, ScalarMap, ReturnNodes, NodeMap);
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
|
|
|
|
2003-06-30 05:15:25 +02:00
|
|
|
DSGraph::DSGraph(const DSGraph &G, NodeMapTy &NodeMap)
|
|
|
|
: GlobalsGraph(0) {
|
2002-11-10 07:59:55 +01:00
|
|
|
PrintAuxCalls = false;
|
2003-06-30 05:15:25 +02:00
|
|
|
cloneInto(G, ScalarMap, ReturnNodes, NodeMap);
|
2002-10-21 17:32:34 +02:00
|
|
|
}
|
|
|
|
|
2002-07-11 00:38:08 +02:00
|
|
|
DSGraph::~DSGraph() {
|
|
|
|
FunctionCalls.clear();
|
2002-11-08 22:27:12 +01:00
|
|
|
AuxFunctionCalls.clear();
|
2002-11-03 22:27:48 +01:00
|
|
|
ScalarMap.clear();
|
2003-06-30 05:15:25 +02:00
|
|
|
ReturnNodes.clear();
|
2002-03-28 18:56:03 +01:00
|
|
|
|
2002-07-11 00:38:08 +02:00
|
|
|
// Drop all intra-node references, so that assertions don't fail...
|
|
|
|
std::for_each(Nodes.begin(), Nodes.end(),
|
|
|
|
std::mem_fun(&DSNode::dropAllReferences));
|
2002-03-28 18:56:03 +01:00
|
|
|
|
2002-07-11 00:38:08 +02:00
|
|
|
// Delete all of the nodes themselves...
|
|
|
|
std::for_each(Nodes.begin(), Nodes.end(), deleter<DSNode>);
|
2002-03-28 18:56:03 +01:00
|
|
|
}
|
|
|
|
|
2002-07-18 02:12:30 +02:00
|
|
|
// dump - Allow inspection of graph in a debugger.
|
|
|
|
void DSGraph::dump() const { print(std::cerr); }
|
|
|
|
|
2002-10-20 20:07:37 +02:00
|
|
|
|
2002-10-02 00:33:50 +02:00
|
|
|
/// remapLinks - Change all of the Links in the current node according to the
|
|
|
|
/// specified mapping.
|
2002-10-31 06:45:02 +01:00
|
|
|
///
|
2003-06-30 05:36:09 +02:00
|
|
|
void DSNode::remapLinks(DSGraph::NodeMapTy &OldNodeMap) {
|
2002-11-08 06:01:14 +01:00
|
|
|
for (unsigned i = 0, e = Links.size(); i != e; ++i) {
|
|
|
|
DSNodeHandle &H = OldNodeMap[Links[i].getNode()];
|
|
|
|
Links[i].setNode(H.getNode());
|
|
|
|
Links[i].setOffset(Links[i].getOffset()+H.getOffset());
|
|
|
|
}
|
2002-10-02 00:33:50 +02:00
|
|
|
}
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2002-10-20 20:07:37 +02:00
|
|
|
|
2003-06-30 05:15:25 +02:00
|
|
|
/// cloneInto - Clone the specified DSGraph into the current graph. The
|
|
|
|
/// translated ScalarMap for the old function is filled into the OldValMap
|
|
|
|
/// member, and the translated ReturnNodes map is returned into ReturnNodes.
|
|
|
|
///
|
|
|
|
/// The CloneFlags member controls various aspects of the cloning process.
|
|
|
|
///
|
|
|
|
void DSGraph::cloneInto(const DSGraph &G, ScalarMapTy &OldValMap,
|
|
|
|
ReturnNodesTy &OldReturnNodes, NodeMapTy &OldNodeMap,
|
|
|
|
unsigned CloneFlags) {
|
2002-10-02 00:33:50 +02:00
|
|
|
assert(OldNodeMap.empty() && "Returned OldNodeMap should be empty!");
|
2002-11-08 02:21:07 +01:00
|
|
|
assert(&G != this && "Cannot clone graph into itself!");
|
2002-07-18 02:12:30 +02:00
|
|
|
|
2002-07-31 00:05:22 +02:00
|
|
|
unsigned FN = Nodes.size(); // First new node...
|
2002-07-18 02:12:30 +02:00
|
|
|
|
|
|
|
// Duplicate all of the nodes, populating the node map...
|
|
|
|
Nodes.reserve(FN+G.Nodes.size());
|
2003-02-03 21:08:51 +01:00
|
|
|
|
|
|
|
// Remove alloca or mod/ref bits as specified...
|
2003-06-19 23:15:11 +02:00
|
|
|
unsigned BitsToClear =((CloneFlags & StripAllocaBit) ? DSNode::AllocaNode : 0)
|
|
|
|
| ((CloneFlags & StripModRefBits) ? (DSNode::Modified | DSNode::Read) : 0);
|
|
|
|
BitsToClear |= DSNode::DEAD; // Clear dead flag...
|
2002-07-18 02:12:30 +02:00
|
|
|
for (unsigned i = 0, e = G.Nodes.size(); i != e; ++i) {
|
2002-10-02 00:33:50 +02:00
|
|
|
DSNode *Old = G.Nodes[i];
|
2003-02-12 00:11:51 +01:00
|
|
|
DSNode *New = new DSNode(*Old, this);
|
2003-06-19 23:15:11 +02:00
|
|
|
New->maskNodeTypes(~BitsToClear);
|
2002-07-18 18:12:08 +02:00
|
|
|
OldNodeMap[Old] = New;
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
|
|
|
|
2002-11-18 22:44:46 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
Timer::addPeakMemoryMeasurement();
|
|
|
|
#endif
|
|
|
|
|
2002-07-31 00:05:22 +02:00
|
|
|
// Rewrite the links in the new nodes to point into the current graph now.
|
2002-07-18 02:12:30 +02:00
|
|
|
for (unsigned i = FN, e = Nodes.size(); i != e; ++i)
|
2002-10-02 00:33:50 +02:00
|
|
|
Nodes[i]->remapLinks(OldNodeMap);
|
2002-07-18 02:12:30 +02:00
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
// Copy the scalar map... merging all of the global nodes...
|
2003-06-30 05:36:09 +02:00
|
|
|
for (ScalarMapTy::const_iterator I = G.ScalarMap.begin(),
|
2002-11-03 22:27:48 +01:00
|
|
|
E = G.ScalarMap.end(); I != E; ++I) {
|
2002-11-08 06:01:14 +01:00
|
|
|
DSNodeHandle &MappedNode = OldNodeMap[I->second.getNode()];
|
2003-06-30 07:09:29 +02:00
|
|
|
DSNodeHandle &H = OldValMap[I->first];
|
|
|
|
H.mergeWith(DSNodeHandle(MappedNode.getNode(),
|
|
|
|
I->second.getOffset()+MappedNode.getOffset()));
|
2002-10-17 22:09:52 +02:00
|
|
|
|
2003-06-30 07:09:29 +02:00
|
|
|
// If this is a global, add the global to this fn or merge if already exists
|
2003-06-30 07:18:26 +02:00
|
|
|
if (isa<GlobalValue>(I->first))
|
2003-06-30 07:09:29 +02:00
|
|
|
ScalarMap[I->first].mergeWith(H);
|
2002-10-17 22:09:52 +02:00
|
|
|
}
|
2002-10-02 00:33:50 +02:00
|
|
|
|
2002-11-08 22:27:12 +01:00
|
|
|
if (!(CloneFlags & DontCloneCallNodes)) {
|
|
|
|
// Copy the function calls list...
|
|
|
|
unsigned FC = FunctionCalls.size(); // FirstCall
|
|
|
|
FunctionCalls.reserve(FC+G.FunctionCalls.size());
|
|
|
|
for (unsigned i = 0, ei = G.FunctionCalls.size(); i != ei; ++i)
|
|
|
|
FunctionCalls.push_back(DSCallSite(G.FunctionCalls[i], OldNodeMap));
|
2002-11-08 23:27:09 +01:00
|
|
|
}
|
2002-11-08 22:27:12 +01:00
|
|
|
|
2002-11-08 23:27:09 +01:00
|
|
|
if (!(CloneFlags & DontCloneAuxCallNodes)) {
|
2002-11-08 22:27:12 +01:00
|
|
|
// Copy the auxillary function calls list...
|
2002-11-08 23:27:09 +01:00
|
|
|
unsigned FC = AuxFunctionCalls.size(); // FirstCall
|
2002-11-08 22:27:12 +01:00
|
|
|
AuxFunctionCalls.reserve(FC+G.AuxFunctionCalls.size());
|
|
|
|
for (unsigned i = 0, ei = G.AuxFunctionCalls.size(); i != ei; ++i)
|
|
|
|
AuxFunctionCalls.push_back(DSCallSite(G.AuxFunctionCalls[i], OldNodeMap));
|
|
|
|
}
|
2002-10-17 22:09:52 +02:00
|
|
|
|
2003-06-30 05:15:25 +02:00
|
|
|
// Map the return node pointers over...
|
|
|
|
for (ReturnNodesTy::const_iterator I = G.getReturnNodes().begin(),
|
|
|
|
E = G.getReturnNodes().end(); I != E; ++I) {
|
|
|
|
const DSNodeHandle &Ret = I->second;
|
|
|
|
DSNodeHandle &MappedRet = OldNodeMap[Ret.getNode()];
|
|
|
|
OldReturnNodes.insert(std::make_pair(I->first,
|
|
|
|
DSNodeHandle(MappedRet.getNode(),
|
|
|
|
MappedRet.getOffset()+Ret.getOffset())));
|
|
|
|
}
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
|
|
|
|
2002-11-07 07:31:54 +01:00
|
|
|
/// mergeInGraph - The method is used for merging graphs together. If the
|
|
|
|
/// argument graph is not *this, it makes a clone of the specified graph, then
|
|
|
|
/// merges the nodes specified in the call site with the formal arguments in the
|
|
|
|
/// graph.
|
|
|
|
///
|
2003-06-30 05:15:25 +02:00
|
|
|
void DSGraph::mergeInGraph(DSCallSite &CS, Function &F, const DSGraph &Graph,
|
2002-11-08 22:27:12 +01:00
|
|
|
unsigned CloneFlags) {
|
2003-06-30 07:09:29 +02:00
|
|
|
ScalarMapTy OldValMap, *ScalarMap;
|
2002-11-07 07:31:54 +01:00
|
|
|
DSNodeHandle RetVal;
|
|
|
|
|
|
|
|
// If this is not a recursive call, clone the graph into this graph...
|
|
|
|
if (&Graph != this) {
|
|
|
|
// Clone the callee's graph into the current graph, keeping
|
|
|
|
// track of where scalars in the old graph _used_ to point,
|
|
|
|
// and of the new nodes matching nodes of the old graph.
|
2003-06-30 05:15:25 +02:00
|
|
|
NodeMapTy OldNodeMap;
|
2002-11-07 07:31:54 +01:00
|
|
|
|
|
|
|
// The clone call may invalidate any of the vectors in the data
|
|
|
|
// structure graph. Strip locals and don't copy the list of callers
|
2003-06-30 05:15:25 +02:00
|
|
|
ReturnNodesTy OldRetNodes;
|
|
|
|
cloneInto(Graph, OldValMap, OldRetNodes, OldNodeMap, CloneFlags);
|
|
|
|
RetVal = OldRetNodes[&F];
|
2002-11-07 07:31:54 +01:00
|
|
|
ScalarMap = &OldValMap;
|
|
|
|
} else {
|
2003-06-30 05:15:25 +02:00
|
|
|
RetVal = getReturnNodeFor(F);
|
2002-11-07 07:31:54 +01:00
|
|
|
ScalarMap = &getScalarMap();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Merge the return value with the return value of the context...
|
|
|
|
RetVal.mergeWith(CS.getRetVal());
|
|
|
|
|
|
|
|
// Resolve all of the function arguments...
|
|
|
|
Function::aiterator AI = F.abegin();
|
2002-12-06 22:15:21 +01:00
|
|
|
|
2002-11-07 07:31:54 +01:00
|
|
|
for (unsigned i = 0, e = CS.getNumPtrArgs(); i != e; ++i, ++AI) {
|
|
|
|
// Advance the argument iterator to the first pointer argument...
|
2003-02-06 01:15:08 +01:00
|
|
|
while (AI != F.aend() && !isPointerType(AI->getType())) {
|
2002-11-07 07:31:54 +01:00
|
|
|
++AI;
|
|
|
|
#ifndef NDEBUG
|
|
|
|
if (AI == F.aend())
|
|
|
|
std::cerr << "Bad call to Function: " << F.getName() << "\n";
|
|
|
|
#endif
|
|
|
|
}
|
2003-02-06 01:15:08 +01:00
|
|
|
if (AI == F.aend()) break;
|
2002-11-07 07:31:54 +01:00
|
|
|
|
|
|
|
// Add the link from the argument scalar to the provided value
|
2003-02-12 00:11:51 +01:00
|
|
|
assert(ScalarMap->count(AI) && "Argument not in scalar map?");
|
2002-11-07 07:31:54 +01:00
|
|
|
DSNodeHandle &NH = (*ScalarMap)[AI];
|
|
|
|
assert(NH.getNode() && "Pointer argument without scalarmap entry?");
|
|
|
|
NH.mergeWith(CS.getPtrArg(i));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2002-07-18 02:12:30 +02:00
|
|
|
// markIncompleteNodes - Mark the specified node as having contents that are not
|
|
|
|
// known with the current analysis we have performed. Because a node makes all
|
2003-06-19 23:15:11 +02:00
|
|
|
// of the nodes it can reach incomplete if the node itself is incomplete, we
|
2002-07-18 02:12:30 +02:00
|
|
|
// must recursively traverse the data structure graph, marking all reachable
|
|
|
|
// nodes as incomplete.
|
|
|
|
//
|
|
|
|
static void markIncompleteNode(DSNode *N) {
|
|
|
|
// Stop recursion if no node, or if node already marked...
|
2003-06-28 23:58:28 +02:00
|
|
|
if (N == 0 || N->isIncomplete()) return;
|
2002-07-18 02:12:30 +02:00
|
|
|
|
|
|
|
// Actually mark the node
|
2003-06-19 23:15:11 +02:00
|
|
|
N->setIncompleteMarker();
|
2002-07-18 02:12:30 +02:00
|
|
|
|
|
|
|
// Recusively process children...
|
2002-11-06 07:20:27 +01:00
|
|
|
for (unsigned i = 0, e = N->getSize(); i < e; i += DS::PointerSize)
|
|
|
|
if (DSNode *DSN = N->getLink(i).getNode())
|
|
|
|
markIncompleteNode(DSN);
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
|
|
|
|
2002-11-11 04:36:55 +01:00
|
|
|
static void markIncomplete(DSCallSite &Call) {
|
|
|
|
// Then the return value is certainly incomplete!
|
|
|
|
markIncompleteNode(Call.getRetVal().getNode());
|
|
|
|
|
|
|
|
// All objects pointed to by function arguments are incomplete!
|
|
|
|
for (unsigned i = 0, e = Call.getNumPtrArgs(); i != e; ++i)
|
|
|
|
markIncompleteNode(Call.getPtrArg(i).getNode());
|
|
|
|
}
|
2002-07-18 02:12:30 +02:00
|
|
|
|
|
|
|
// markIncompleteNodes - Traverse the graph, identifying nodes that may be
|
|
|
|
// modified by other functions that have not been resolved yet. This marks
|
|
|
|
// nodes that are reachable through three sources of "unknownness":
|
|
|
|
//
|
|
|
|
// Global Variables, Function Calls, and Incoming Arguments
|
|
|
|
//
|
|
|
|
// For any node that may have unknown components (because something outside the
|
|
|
|
// scope of current analysis may have modified it), the 'Incomplete' flag is
|
|
|
|
// added to the NodeType.
|
|
|
|
//
|
2003-01-23 23:05:33 +01:00
|
|
|
void DSGraph::markIncompleteNodes(unsigned Flags) {
|
2002-07-18 02:12:30 +02:00
|
|
|
// Mark any incoming arguments as incomplete...
|
2003-06-30 05:15:25 +02:00
|
|
|
if (Flags & DSGraph::MarkFormalArgs)
|
|
|
|
for (ReturnNodesTy::iterator FI = ReturnNodes.begin(), E =ReturnNodes.end();
|
|
|
|
FI != E; ++FI) {
|
|
|
|
Function &F = *FI->first;
|
|
|
|
if (F.getName() != "main")
|
|
|
|
for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I)
|
|
|
|
if (isPointerType(I->getType()) &&
|
|
|
|
ScalarMap.find(I) != ScalarMap.end())
|
|
|
|
markIncompleteNode(ScalarMap[I].getNode());
|
|
|
|
}
|
2002-07-18 02:12:30 +02:00
|
|
|
|
|
|
|
// Mark stuff passed into functions calls as being incomplete...
|
2002-11-11 04:36:55 +01:00
|
|
|
if (!shouldPrintAuxCalls())
|
|
|
|
for (unsigned i = 0, e = FunctionCalls.size(); i != e; ++i)
|
|
|
|
markIncomplete(FunctionCalls[i]);
|
|
|
|
else
|
|
|
|
for (unsigned i = 0, e = AuxFunctionCalls.size(); i != e; ++i)
|
|
|
|
markIncomplete(AuxFunctionCalls[i]);
|
|
|
|
|
2002-07-18 02:12:30 +02:00
|
|
|
|
2003-02-09 19:41:49 +01:00
|
|
|
// Mark all global nodes as incomplete...
|
|
|
|
if ((Flags & DSGraph::IgnoreGlobals) == 0)
|
|
|
|
for (unsigned i = 0, e = Nodes.size(); i != e; ++i)
|
2003-06-19 23:15:11 +02:00
|
|
|
if (Nodes[i]->isGlobalNode() && Nodes[i]->getNumLinks())
|
2003-02-09 19:41:49 +01:00
|
|
|
markIncompleteNode(Nodes[i]);
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
|
|
|
|
2002-11-10 07:59:55 +01:00
|
|
|
static inline void killIfUselessEdge(DSNodeHandle &Edge) {
|
|
|
|
if (DSNode *N = Edge.getNode()) // Is there an edge?
|
2003-02-12 00:11:51 +01:00
|
|
|
if (N->getNumReferrers() == 1) // Does it point to a lonely node?
|
2003-06-19 23:15:11 +02:00
|
|
|
// No interesting info?
|
|
|
|
if ((N->getNodeFlags() & ~DSNode::Incomplete) == 0 &&
|
2002-11-18 22:44:46 +01:00
|
|
|
N->getType() == Type::VoidTy && !N->isNodeCompletelyFolded())
|
2002-11-10 07:59:55 +01:00
|
|
|
Edge.setNode(0); // Kill the edge!
|
|
|
|
}
|
2002-07-18 02:12:30 +02:00
|
|
|
|
2002-11-10 07:59:55 +01:00
|
|
|
static inline bool nodeContainsExternalFunction(const DSNode *N) {
|
|
|
|
const std::vector<GlobalValue*> &Globals = N->getGlobals();
|
|
|
|
for (unsigned i = 0, e = Globals.size(); i != e; ++i)
|
|
|
|
if (Globals[i]->isExternal())
|
|
|
|
return true;
|
2002-07-18 02:12:30 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2003-06-30 05:15:25 +02:00
|
|
|
static void removeIdenticalCalls(std::vector<DSCallSite> &Calls) {
|
2002-07-31 00:05:22 +02:00
|
|
|
// Remove trivially identical function calls
|
|
|
|
unsigned NumFns = Calls.size();
|
2002-11-10 07:59:55 +01:00
|
|
|
std::sort(Calls.begin(), Calls.end()); // Sort by callee as primary key!
|
|
|
|
|
|
|
|
// Scan the call list cleaning it up as necessary...
|
2003-02-05 22:59:58 +01:00
|
|
|
DSNode *LastCalleeNode = 0;
|
|
|
|
Function *LastCalleeFunc = 0;
|
2002-11-10 07:59:55 +01:00
|
|
|
unsigned NumDuplicateCalls = 0;
|
|
|
|
bool LastCalleeContainsExternalFunction = false;
|
2002-11-11 22:35:38 +01:00
|
|
|
for (unsigned i = 0; i != Calls.size(); ++i) {
|
2002-11-10 07:59:55 +01:00
|
|
|
DSCallSite &CS = Calls[i];
|
|
|
|
|
2002-11-11 22:35:38 +01:00
|
|
|
// If the Callee is a useless edge, this must be an unreachable call site,
|
|
|
|
// eliminate it.
|
2003-02-12 00:11:51 +01:00
|
|
|
if (CS.isIndirectCall() && CS.getCalleeNode()->getNumReferrers() == 1 &&
|
2003-06-19 23:15:11 +02:00
|
|
|
CS.getCalleeNode()->getNodeFlags() == 0) { // No useful info?
|
2003-02-05 22:59:58 +01:00
|
|
|
std::cerr << "WARNING: Useless call site found??\n";
|
2002-11-11 22:35:38 +01:00
|
|
|
CS.swap(Calls.back());
|
|
|
|
Calls.pop_back();
|
|
|
|
--i;
|
2002-11-10 07:59:55 +01:00
|
|
|
} else {
|
2002-11-11 22:35:38 +01:00
|
|
|
// If the return value or any arguments point to a void node with no
|
|
|
|
// information at all in it, and the call node is the only node to point
|
|
|
|
// to it, remove the edge to the node (killing the node).
|
|
|
|
//
|
|
|
|
killIfUselessEdge(CS.getRetVal());
|
|
|
|
for (unsigned a = 0, e = CS.getNumPtrArgs(); a != e; ++a)
|
|
|
|
killIfUselessEdge(CS.getPtrArg(a));
|
|
|
|
|
|
|
|
// If this call site calls the same function as the last call site, and if
|
|
|
|
// the function pointer contains an external function, this node will
|
|
|
|
// never be resolved. Merge the arguments of the call node because no
|
|
|
|
// information will be lost.
|
|
|
|
//
|
2003-02-05 22:59:58 +01:00
|
|
|
if ((CS.isDirectCall() && CS.getCalleeFunc() == LastCalleeFunc) ||
|
|
|
|
(CS.isIndirectCall() && CS.getCalleeNode() == LastCalleeNode)) {
|
2002-11-11 22:35:38 +01:00
|
|
|
++NumDuplicateCalls;
|
|
|
|
if (NumDuplicateCalls == 1) {
|
2003-02-05 22:59:58 +01:00
|
|
|
if (LastCalleeNode)
|
|
|
|
LastCalleeContainsExternalFunction =
|
|
|
|
nodeContainsExternalFunction(LastCalleeNode);
|
|
|
|
else
|
|
|
|
LastCalleeContainsExternalFunction = LastCalleeFunc->isExternal();
|
2002-11-11 22:35:38 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (LastCalleeContainsExternalFunction ||
|
|
|
|
// This should be more than enough context sensitivity!
|
|
|
|
// FIXME: Evaluate how many times this is tripped!
|
|
|
|
NumDuplicateCalls > 20) {
|
|
|
|
DSCallSite &OCS = Calls[i-1];
|
|
|
|
OCS.mergeWith(CS);
|
|
|
|
|
|
|
|
// The node will now be eliminated as a duplicate!
|
|
|
|
if (CS.getNumPtrArgs() < OCS.getNumPtrArgs())
|
|
|
|
CS = OCS;
|
|
|
|
else if (CS.getNumPtrArgs() > OCS.getNumPtrArgs())
|
|
|
|
OCS = CS;
|
|
|
|
}
|
|
|
|
} else {
|
2003-02-05 22:59:58 +01:00
|
|
|
if (CS.isDirectCall()) {
|
|
|
|
LastCalleeFunc = CS.getCalleeFunc();
|
|
|
|
LastCalleeNode = 0;
|
|
|
|
} else {
|
|
|
|
LastCalleeNode = CS.getCalleeNode();
|
|
|
|
LastCalleeFunc = 0;
|
|
|
|
}
|
2002-11-11 22:35:38 +01:00
|
|
|
NumDuplicateCalls = 0;
|
|
|
|
}
|
2002-11-10 07:59:55 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-07-31 00:05:22 +02:00
|
|
|
Calls.erase(std::unique(Calls.begin(), Calls.end()),
|
|
|
|
Calls.end());
|
|
|
|
|
2002-11-08 02:21:07 +01:00
|
|
|
// Track the number of call nodes merged away...
|
|
|
|
NumCallNodesMerged += NumFns-Calls.size();
|
|
|
|
|
2002-07-31 00:05:22 +02:00
|
|
|
DEBUG(if (NumFns != Calls.size())
|
2003-06-30 05:15:25 +02:00
|
|
|
std::cerr << "Merged " << (NumFns-Calls.size()) << " call nodes.\n";);
|
2002-07-31 00:05:22 +02:00
|
|
|
}
|
2002-07-18 02:12:30 +02:00
|
|
|
|
2002-11-10 07:59:55 +01:00
|
|
|
|
2002-07-18 20:22:40 +02:00
|
|
|
// removeTriviallyDeadNodes - After the graph has been constructed, this method
|
|
|
|
// removes all unreachable nodes that are created because they got merged with
|
|
|
|
// other nodes in the graph. These nodes will all be trivially unreachable, so
|
|
|
|
// we don't have to perform any non-trivial analysis here.
|
2002-07-18 02:12:30 +02:00
|
|
|
//
|
2002-11-09 23:07:02 +01:00
|
|
|
void DSGraph::removeTriviallyDeadNodes() {
|
2003-06-30 05:15:25 +02:00
|
|
|
removeIdenticalCalls(FunctionCalls);
|
|
|
|
removeIdenticalCalls(AuxFunctionCalls);
|
2002-11-10 07:59:55 +01:00
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
for (unsigned i = 0; i != Nodes.size(); ++i) {
|
|
|
|
DSNode *Node = Nodes[i];
|
2003-06-28 23:58:28 +02:00
|
|
|
if (Node->isComplete() && !Node->isModified() && !Node->isRead()) {
|
2003-02-03 20:12:15 +01:00
|
|
|
// This is a useless node if it has no mod/ref info (checked above),
|
|
|
|
// outgoing edges (which it cannot, as it is not modified in this
|
|
|
|
// context), and it has no incoming edges. If it is a global node it may
|
|
|
|
// have all of these properties and still have incoming edges, due to the
|
|
|
|
// scalar map, so we check those now.
|
|
|
|
//
|
2003-02-12 00:11:51 +01:00
|
|
|
if (Node->getNumReferrers() == Node->getGlobals().size()) {
|
2003-06-19 23:15:11 +02:00
|
|
|
const std::vector<GlobalValue*> &Globals = Node->getGlobals();
|
2003-02-12 00:11:51 +01:00
|
|
|
|
|
|
|
// Loop through and make sure all of the globals are referring directly
|
|
|
|
// to the node...
|
|
|
|
for (unsigned j = 0, e = Globals.size(); j != e; ++j) {
|
|
|
|
DSNode *N = ScalarMap.find(Globals[j])->second.getNode();
|
|
|
|
assert(N == Node && "ScalarMap doesn't match globals list!");
|
|
|
|
}
|
|
|
|
|
2003-06-19 23:15:11 +02:00
|
|
|
// Make sure NumReferrers still agrees, if so, the node is truly dead.
|
2003-02-12 00:11:51 +01:00
|
|
|
if (Node->getNumReferrers() == Globals.size()) {
|
|
|
|
for (unsigned j = 0, e = Globals.size(); j != e; ++j)
|
|
|
|
ScalarMap.erase(Globals[j]);
|
2003-06-19 23:15:11 +02:00
|
|
|
Node->makeNodeDead();
|
2003-02-12 00:11:51 +01:00
|
|
|
}
|
2003-02-03 20:12:15 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-06-19 23:15:11 +02:00
|
|
|
if (Node->getNodeFlags() == 0 && Node->hasNoReferrers()) {
|
2003-02-10 19:18:18 +01:00
|
|
|
// This node is dead!
|
2003-02-03 20:12:15 +01:00
|
|
|
delete Node; // Free memory...
|
2003-02-10 19:47:23 +01:00
|
|
|
Nodes[i--] = Nodes.back();
|
|
|
|
Nodes.pop_back(); // Remove from node list...
|
2002-11-10 07:59:55 +01:00
|
|
|
}
|
2003-02-03 20:12:15 +01:00
|
|
|
}
|
2002-07-18 02:12:30 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-01-29 22:10:20 +01:00
|
|
|
/// markReachableNodes - This method recursively traverses the specified
|
|
|
|
/// DSNodes, marking any nodes which are reachable. All reachable nodes it adds
|
|
|
|
/// to the set, which allows it to only traverse visited nodes once.
|
|
|
|
///
|
2003-02-01 05:52:08 +01:00
|
|
|
void DSNode::markReachableNodes(hash_set<DSNode*> &ReachableNodes) {
|
2003-01-29 22:10:20 +01:00
|
|
|
if (this == 0) return;
|
2003-02-12 00:11:51 +01:00
|
|
|
assert(getForwardNode() == 0 && "Cannot mark a forwarded node!");
|
2003-02-01 05:52:08 +01:00
|
|
|
if (ReachableNodes.count(this)) return; // Already marked reachable
|
|
|
|
ReachableNodes.insert(this); // Is reachable now
|
2003-01-29 22:10:20 +01:00
|
|
|
|
|
|
|
for (unsigned i = 0, e = getSize(); i < e; i += DS::PointerSize)
|
|
|
|
getLink(i).getNode()->markReachableNodes(ReachableNodes);
|
|
|
|
}
|
2002-07-18 20:22:40 +02:00
|
|
|
|
2003-02-01 05:52:08 +01:00
|
|
|
void DSCallSite::markReachableNodes(hash_set<DSNode*> &Nodes) {
|
2003-01-29 22:10:20 +01:00
|
|
|
getRetVal().getNode()->markReachableNodes(Nodes);
|
2003-02-05 22:59:58 +01:00
|
|
|
if (isIndirectCall()) getCalleeNode()->markReachableNodes(Nodes);
|
2003-01-29 22:10:20 +01:00
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
for (unsigned i = 0, e = getNumPtrArgs(); i != e; ++i)
|
|
|
|
getPtrArg(i).getNode()->markReachableNodes(Nodes);
|
2002-07-31 00:05:22 +02:00
|
|
|
}
|
|
|
|
|
2003-02-01 07:17:02 +01:00
|
|
|
// CanReachAliveNodes - Simple graph walker that recursively traverses the graph
|
|
|
|
// looking for a node that is marked alive. If an alive node is found, return
|
|
|
|
// true, otherwise return false. If an alive node is reachable, this node is
|
|
|
|
// marked as alive...
|
2002-11-10 07:59:55 +01:00
|
|
|
//
|
2003-02-01 07:17:02 +01:00
|
|
|
static bool CanReachAliveNodes(DSNode *N, hash_set<DSNode*> &Alive,
|
|
|
|
hash_set<DSNode*> &Visited) {
|
2002-07-31 00:05:22 +02:00
|
|
|
if (N == 0) return false;
|
2003-02-12 00:11:51 +01:00
|
|
|
assert(N->getForwardNode() == 0 && "Cannot mark a forwarded node!");
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2002-11-10 07:59:55 +01:00
|
|
|
// If we know that this node is alive, return so!
|
|
|
|
if (Alive.count(N)) return true;
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2002-11-10 07:59:55 +01:00
|
|
|
// Otherwise, we don't think the node is alive yet, check for infinite
|
|
|
|
// recursion.
|
2003-02-01 05:52:08 +01:00
|
|
|
if (Visited.count(N)) return false; // Found a cycle
|
2003-02-01 07:17:02 +01:00
|
|
|
Visited.insert(N); // No recursion, insert into Visited...
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2002-11-10 07:59:55 +01:00
|
|
|
for (unsigned i = 0, e = N->getSize(); i < e; i += DS::PointerSize)
|
2003-02-01 07:17:02 +01:00
|
|
|
if (CanReachAliveNodes(N->getLink(i).getNode(), Alive, Visited)) {
|
|
|
|
N->markReachableNodes(Alive);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
2002-07-31 00:05:22 +02:00
|
|
|
}
|
|
|
|
|
2003-02-01 07:17:02 +01:00
|
|
|
// CallSiteUsesAliveArgs - Return true if the specified call site can reach any
|
|
|
|
// alive nodes.
|
|
|
|
//
|
2003-02-01 05:52:08 +01:00
|
|
|
static bool CallSiteUsesAliveArgs(DSCallSite &CS, hash_set<DSNode*> &Alive,
|
|
|
|
hash_set<DSNode*> &Visited) {
|
2003-02-05 22:59:58 +01:00
|
|
|
if (CanReachAliveNodes(CS.getRetVal().getNode(), Alive, Visited))
|
|
|
|
return true;
|
|
|
|
if (CS.isIndirectCall() &&
|
|
|
|
CanReachAliveNodes(CS.getCalleeNode(), Alive, Visited))
|
2002-11-10 07:59:55 +01:00
|
|
|
return true;
|
2003-02-03 20:12:15 +01:00
|
|
|
for (unsigned i = 0, e = CS.getNumPtrArgs(); i != e; ++i)
|
|
|
|
if (CanReachAliveNodes(CS.getPtrArg(i).getNode(), Alive, Visited))
|
2002-11-10 07:59:55 +01:00
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2002-07-18 20:22:40 +02:00
|
|
|
// removeDeadNodes - Use a more powerful reachability analysis to eliminate
|
|
|
|
// subgraphs that are unreachable. This often occurs because the data
|
|
|
|
// structure doesn't "escape" into it's caller, and thus should be eliminated
|
|
|
|
// from the caller's graph entirely. This is only appropriate to use when
|
|
|
|
// inlining graphs.
|
|
|
|
//
|
2003-01-23 23:05:33 +01:00
|
|
|
void DSGraph::removeDeadNodes(unsigned Flags) {
|
2003-02-03 20:12:15 +01:00
|
|
|
// Reduce the amount of work we have to do... remove dummy nodes left over by
|
|
|
|
// merging...
|
2002-11-09 23:07:02 +01:00
|
|
|
removeTriviallyDeadNodes();
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2002-07-18 20:22:40 +02:00
|
|
|
// FIXME: Merge nontrivially identical call nodes...
|
|
|
|
|
|
|
|
// Alive - a set that holds all nodes found to be reachable/alive.
|
2003-02-01 05:52:08 +01:00
|
|
|
hash_set<DSNode*> Alive;
|
2002-11-10 07:59:55 +01:00
|
|
|
std::vector<std::pair<Value*, DSNode*> > GlobalNodes;
|
2002-07-18 20:22:40 +02:00
|
|
|
|
2002-11-10 07:59:55 +01:00
|
|
|
// Mark all nodes reachable by (non-global) scalar nodes as alive...
|
2003-06-30 05:36:09 +02:00
|
|
|
for (ScalarMapTy::iterator I = ScalarMap.begin(), E = ScalarMap.end(); I !=E;)
|
2003-02-14 07:28:00 +01:00
|
|
|
if (isa<GlobalValue>(I->first)) { // Keep track of global nodes
|
2003-02-03 20:12:15 +01:00
|
|
|
assert(I->second.getNode() && "Null global node?");
|
2003-02-14 07:28:00 +01:00
|
|
|
GlobalNodes.push_back(std::make_pair(I->first, I->second.getNode()));
|
|
|
|
++I;
|
|
|
|
} else {
|
|
|
|
// Check to see if this is a worthless node generated for non-pointer
|
|
|
|
// values, such as integers. Consider an addition of long types: A+B.
|
|
|
|
// Assuming we can track all uses of the value in this context, and it is
|
|
|
|
// NOT used as a pointer, we can delete the node. We will be able to
|
|
|
|
// detect this situation if the node pointed to ONLY has Unknown bit set
|
|
|
|
// in the node. In this case, the node is not incomplete, does not point
|
|
|
|
// to any other nodes (no mod/ref bits set), and is therefore
|
|
|
|
// uninteresting for data structure analysis. If we run across one of
|
|
|
|
// these, prune the scalar pointing to it.
|
|
|
|
//
|
|
|
|
DSNode *N = I->second.getNode();
|
2003-06-19 23:15:11 +02:00
|
|
|
if (N->isUnknownNode() && !isa<Argument>(I->first)) {
|
2003-02-14 07:28:00 +01:00
|
|
|
ScalarMap.erase(I++);
|
|
|
|
} else {
|
|
|
|
I->second.getNode()->markReachableNodes(Alive);
|
|
|
|
++I;
|
|
|
|
}
|
2003-02-03 20:12:15 +01:00
|
|
|
}
|
2002-11-02 01:13:20 +01:00
|
|
|
|
2002-07-31 00:05:22 +02:00
|
|
|
// The return value is alive as well...
|
2003-06-30 05:15:25 +02:00
|
|
|
for (ReturnNodesTy::iterator I = ReturnNodes.begin(), E = ReturnNodes.end();
|
|
|
|
I != E; ++I)
|
|
|
|
I->second.getNode()->markReachableNodes(Alive);
|
2002-07-31 00:05:22 +02:00
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
// Mark any nodes reachable by primary calls as alive...
|
2002-11-10 07:59:55 +01:00
|
|
|
for (unsigned i = 0, e = FunctionCalls.size(); i != e; ++i)
|
2003-02-03 20:12:15 +01:00
|
|
|
FunctionCalls[i].markReachableNodes(Alive);
|
2002-11-10 07:59:55 +01:00
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
bool Iterate;
|
|
|
|
hash_set<DSNode*> Visited;
|
|
|
|
std::vector<unsigned char> AuxFCallsAlive(AuxFunctionCalls.size());
|
|
|
|
do {
|
|
|
|
Visited.clear();
|
|
|
|
// If any global nodes points to a non-global that is "alive", the global is
|
2003-02-12 00:11:51 +01:00
|
|
|
// "alive" as well... Remove it from the GlobalNodes list so we only have
|
2003-02-03 20:12:15 +01:00
|
|
|
// unreachable globals in the list.
|
|
|
|
//
|
|
|
|
Iterate = false;
|
|
|
|
for (unsigned i = 0; i != GlobalNodes.size(); ++i)
|
|
|
|
if (CanReachAliveNodes(GlobalNodes[i].second, Alive, Visited)) {
|
|
|
|
std::swap(GlobalNodes[i--], GlobalNodes.back()); // Move to end to erase
|
|
|
|
GlobalNodes.pop_back(); // Erase efficiently
|
|
|
|
Iterate = true;
|
|
|
|
}
|
2002-11-10 07:59:55 +01:00
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
for (unsigned i = 0, e = AuxFunctionCalls.size(); i != e; ++i)
|
|
|
|
if (!AuxFCallsAlive[i] &&
|
|
|
|
CallSiteUsesAliveArgs(AuxFunctionCalls[i], Alive, Visited)) {
|
|
|
|
AuxFunctionCalls[i].markReachableNodes(Alive);
|
|
|
|
AuxFCallsAlive[i] = true;
|
|
|
|
Iterate = true;
|
|
|
|
}
|
|
|
|
} while (Iterate);
|
2002-11-10 07:59:55 +01:00
|
|
|
|
|
|
|
// Remove all dead aux function calls...
|
2003-02-03 20:12:15 +01:00
|
|
|
unsigned CurIdx = 0;
|
2002-11-10 07:59:55 +01:00
|
|
|
for (unsigned i = 0, e = AuxFunctionCalls.size(); i != e; ++i)
|
|
|
|
if (AuxFCallsAlive[i])
|
|
|
|
AuxFunctionCalls[CurIdx++].swap(AuxFunctionCalls[i]);
|
2003-02-03 20:12:15 +01:00
|
|
|
if (!(Flags & DSGraph::RemoveUnreachableGlobals)) {
|
2003-02-04 01:03:57 +01:00
|
|
|
assert(GlobalsGraph && "No globals graph available??");
|
2003-02-03 20:12:15 +01:00
|
|
|
// Move the unreachable call nodes to the globals graph...
|
|
|
|
GlobalsGraph->AuxFunctionCalls.insert(GlobalsGraph->AuxFunctionCalls.end(),
|
|
|
|
AuxFunctionCalls.begin()+CurIdx,
|
|
|
|
AuxFunctionCalls.end());
|
|
|
|
}
|
|
|
|
// Crop all the useless ones out...
|
2002-11-10 07:59:55 +01:00
|
|
|
AuxFunctionCalls.erase(AuxFunctionCalls.begin()+CurIdx,
|
|
|
|
AuxFunctionCalls.end());
|
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
// At this point, any nodes which are visited, but not alive, are nodes which
|
|
|
|
// should be moved to the globals graph. Loop over all nodes, eliminating
|
|
|
|
// completely unreachable nodes, and moving visited nodes to the globals graph
|
|
|
|
//
|
2003-02-12 00:11:51 +01:00
|
|
|
std::vector<DSNode*> DeadNodes;
|
|
|
|
DeadNodes.reserve(Nodes.size());
|
2002-07-18 20:22:40 +02:00
|
|
|
for (unsigned i = 0; i != Nodes.size(); ++i)
|
|
|
|
if (!Alive.count(Nodes[i])) {
|
|
|
|
DSNode *N = Nodes[i];
|
2003-02-12 00:11:51 +01:00
|
|
|
Nodes[i--] = Nodes.back(); // move node to end of vector
|
|
|
|
Nodes.pop_back(); // Erase node from alive list.
|
2003-02-03 20:12:15 +01:00
|
|
|
if (!(Flags & DSGraph::RemoveUnreachableGlobals) && // Not in TD pass
|
|
|
|
Visited.count(N)) { // Visited but not alive?
|
|
|
|
GlobalsGraph->Nodes.push_back(N); // Move node to globals graph
|
2003-02-12 00:11:51 +01:00
|
|
|
N->setParentGraph(GlobalsGraph);
|
2003-02-03 20:12:15 +01:00
|
|
|
} else { // Otherwise, delete the node
|
2003-06-19 23:15:11 +02:00
|
|
|
assert((!N->isGlobalNode() ||
|
2003-02-03 20:12:15 +01:00
|
|
|
(Flags & DSGraph::RemoveUnreachableGlobals))
|
|
|
|
&& "Killing a global?");
|
2003-02-12 00:11:51 +01:00
|
|
|
//std::cerr << "[" << i+1 << "/" << DeadNodes.size()
|
|
|
|
// << "] Node is dead: "; N->dump();
|
|
|
|
DeadNodes.push_back(N);
|
|
|
|
N->dropAllReferences();
|
2003-02-03 20:12:15 +01:00
|
|
|
}
|
2003-02-12 00:11:51 +01:00
|
|
|
} else {
|
|
|
|
assert(Nodes[i]->getForwardNode() == 0 && "Alive forwarded node?");
|
2003-02-03 20:12:15 +01:00
|
|
|
}
|
2003-02-01 07:41:15 +01:00
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
// Now that the nodes have either been deleted or moved to the globals graph,
|
|
|
|
// loop over the scalarmap, updating the entries for globals...
|
|
|
|
//
|
|
|
|
if (!(Flags & DSGraph::RemoveUnreachableGlobals)) { // Not in the TD pass?
|
|
|
|
// In this array we start the remapping, which can cause merging. Because
|
|
|
|
// of this, the DSNode pointers in GlobalNodes may be invalidated, so we
|
|
|
|
// must always go through the ScalarMap (which contains DSNodeHandles [which
|
|
|
|
// cannot be invalidated by merging]).
|
|
|
|
//
|
|
|
|
for (unsigned i = 0, e = GlobalNodes.size(); i != e; ++i) {
|
|
|
|
Value *G = GlobalNodes[i].first;
|
2003-06-30 05:36:09 +02:00
|
|
|
ScalarMapTy::iterator I = ScalarMap.find(G);
|
2003-02-03 20:12:15 +01:00
|
|
|
assert(I != ScalarMap.end() && "Global not in scalar map anymore?");
|
|
|
|
assert(I->second.getNode() && "Global not pointing to anything?");
|
|
|
|
assert(!Alive.count(I->second.getNode()) && "Node is alive??");
|
|
|
|
GlobalsGraph->ScalarMap[G].mergeWith(I->second);
|
|
|
|
assert(GlobalsGraph->ScalarMap[G].getNode() &&
|
|
|
|
"Global not pointing to anything?");
|
|
|
|
ScalarMap.erase(I);
|
2002-07-18 20:22:40 +02:00
|
|
|
}
|
2003-02-03 20:12:15 +01:00
|
|
|
|
|
|
|
// Merging leaves behind silly nodes, we remove them to avoid polluting the
|
|
|
|
// globals graph.
|
2003-02-12 00:11:51 +01:00
|
|
|
if (!GlobalNodes.empty())
|
|
|
|
GlobalsGraph->removeTriviallyDeadNodes();
|
2003-02-03 20:12:15 +01:00
|
|
|
} else {
|
|
|
|
// If we are in the top-down pass, remove all unreachable globals from the
|
|
|
|
// ScalarMap...
|
|
|
|
for (unsigned i = 0, e = GlobalNodes.size(); i != e; ++i)
|
|
|
|
ScalarMap.erase(GlobalNodes[i].first);
|
|
|
|
}
|
|
|
|
|
2003-02-12 00:11:51 +01:00
|
|
|
// Loop over all of the dead nodes now, deleting them since their referrer
|
|
|
|
// count is zero.
|
|
|
|
for (unsigned i = 0, e = DeadNodes.size(); i != e; ++i)
|
|
|
|
delete DeadNodes[i];
|
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
DEBUG(AssertGraphOK(); GlobalsGraph->AssertGraphOK());
|
2002-07-18 20:22:40 +02:00
|
|
|
}
|
|
|
|
|
2003-02-03 20:12:15 +01:00
|
|
|
void DSGraph::AssertGraphOK() const {
|
2003-02-12 00:11:51 +01:00
|
|
|
for (unsigned i = 0, e = Nodes.size(); i != e; ++i)
|
|
|
|
Nodes[i]->assertOK();
|
|
|
|
return; // FIXME: remove
|
2003-06-30 05:36:09 +02:00
|
|
|
for (ScalarMapTy::const_iterator I = ScalarMap.begin(),
|
2003-02-03 20:12:15 +01:00
|
|
|
E = ScalarMap.end(); I != E; ++I) {
|
|
|
|
assert(I->second.getNode() && "Null node in scalarmap!");
|
|
|
|
AssertNodeInGraph(I->second.getNode());
|
|
|
|
if (GlobalValue *GV = dyn_cast<GlobalValue>(I->first)) {
|
2003-06-19 23:15:11 +02:00
|
|
|
assert(I->second.getNode()->isGlobalNode() &&
|
2003-02-03 20:12:15 +01:00
|
|
|
"Global points to node, but node isn't global?");
|
|
|
|
AssertNodeContainsGlobal(I->second.getNode(), GV);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
AssertCallNodesInGraph();
|
|
|
|
AssertAuxCallNodesInGraph();
|
|
|
|
}
|