1 //===- DataStructure.cpp - Implement the core data structure analysis -----===//
3 // This file implements the core data structure functionality.
5 //===----------------------------------------------------------------------===//
7 #include "llvm/Analysis/DSGraph.h"
8 #include "llvm/Function.h"
9 #include "llvm/iOther.h"
10 #include "llvm/DerivedTypes.h"
11 #include "llvm/Target/TargetData.h"
12 #include "Support/STLExtras.h"
13 #include "Support/Statistic.h"
14 #include "Support/Timer.h"
18 Statistic<> NumFolds ("dsnode", "Number of nodes completely folded");
19 Statistic<> NumCallNodesMerged("dsnode", "Number of call nodes merged");
22 namespace DS { // TODO: FIXME
27 DSNode *DSNodeHandle::HandleForwarding() const {
28 assert(!N->ForwardNH.isNull() && "Can only be invoked if forwarding!");
30 // Handle node forwarding here!
31 DSNode *Next = N->ForwardNH.getNode(); // Cause recursive shrinkage
32 Offset += N->ForwardNH.getOffset();
34 if (--N->NumReferrers == 0) {
35 // Removing the last referrer to the node, sever the forwarding link
41 if (N->Size <= Offset) {
42 assert(N->Size <= 1 && "Forwarded to shrunk but not collapsed node?");
48 //===----------------------------------------------------------------------===//
49 // DSNode Implementation
50 //===----------------------------------------------------------------------===//
52 DSNode::DSNode(const Type *T, DSGraph *G)
53 : NumReferrers(0), Size(0), ParentGraph(G), Ty(Type::VoidTy), NodeType(0) {
54 // Add the type entry if it is specified...
55 if (T) mergeTypeInfo(T, 0);
56 G->getNodes().push_back(this);
59 // DSNode copy constructor... do not copy over the referrers list!
60 DSNode::DSNode(const DSNode &N, DSGraph *G)
61 : NumReferrers(0), Size(N.Size), ParentGraph(G), Ty(N.Ty),
62 Links(N.Links), Globals(N.Globals), NodeType(N.NodeType) {
63 G->getNodes().push_back(this);
66 void DSNode::assertOK() const {
67 assert((Ty != Type::VoidTy ||
68 Ty == Type::VoidTy && (Size == 0 ||
69 (NodeType & DSNode::Array))) &&
73 /// forwardNode - Mark this node as being obsolete, and all references to it
74 /// should be forwarded to the specified node and offset.
76 void DSNode::forwardNode(DSNode *To, unsigned Offset) {
77 assert(this != To && "Cannot forward a node to itself!");
78 assert(ForwardNH.isNull() && "Already forwarding from this node!");
79 if (To->Size <= 1) Offset = 0;
80 assert((Offset < To->Size || (Offset == To->Size && Offset == 0)) &&
81 "Forwarded offset is wrong!");
82 ForwardNH.setNode(To);
83 ForwardNH.setOffset(Offset);
89 // addGlobal - Add an entry for a global value to the Globals list. This also
90 // marks the node with the 'G' flag if it does not already have it.
92 void DSNode::addGlobal(GlobalValue *GV) {
93 // Keep the list sorted.
94 std::vector<GlobalValue*>::iterator I =
95 std::lower_bound(Globals.begin(), Globals.end(), GV);
97 if (I == Globals.end() || *I != GV) {
98 //assert(GV->getType()->getElementType() == Ty);
99 Globals.insert(I, GV);
100 NodeType |= GlobalNode;
104 /// foldNodeCompletely - If we determine that this node has some funny
105 /// behavior happening to it that we cannot represent, we fold it down to a
106 /// single, completely pessimistic, node. This node is represented as a
107 /// single byte with a single TypeEntry of "void".
109 void DSNode::foldNodeCompletely() {
110 if (isNodeCompletelyFolded()) return; // If this node is already folded...
114 // Create the node we are going to forward to...
115 DSNode *DestNode = new DSNode(0, ParentGraph);
116 DestNode->NodeType = NodeType|DSNode::Array;
117 DestNode->Ty = Type::VoidTy;
119 DestNode->Globals.swap(Globals);
121 // Start forwarding to the destination node...
122 forwardNode(DestNode, 0);
125 DestNode->Links.push_back(Links[0]);
126 DSNodeHandle NH(DestNode);
128 // If we have links, merge all of our outgoing links together...
129 for (unsigned i = Links.size()-1; i != 0; --i)
130 NH.getNode()->Links[0].mergeWith(Links[i]);
133 DestNode->Links.resize(1);
137 /// isNodeCompletelyFolded - Return true if this node has been completely
138 /// folded down to something that can never be expanded, effectively losing
139 /// all of the field sensitivity that may be present in the node.
141 bool DSNode::isNodeCompletelyFolded() const {
142 return getSize() == 1 && Ty == Type::VoidTy && isArray();
147 /// TypeElementWalker Class - Used for implementation of physical subtyping...
149 class TypeElementWalker {
154 StackState(const Type *T, unsigned Off = 0)
155 : Ty(T), Offset(Off), Idx(0) {}
158 std::vector<StackState> Stack;
160 TypeElementWalker(const Type *T) {
165 bool isDone() const { return Stack.empty(); }
166 const Type *getCurrentType() const { return Stack.back().Ty; }
167 unsigned getCurrentOffset() const { return Stack.back().Offset; }
169 void StepToNextType() {
170 PopStackAndAdvance();
175 /// PopStackAndAdvance - Pop the current element off of the stack and
176 /// advance the underlying element to the next contained member.
177 void PopStackAndAdvance() {
178 assert(!Stack.empty() && "Cannot pop an empty stack!");
180 while (!Stack.empty()) {
181 StackState &SS = Stack.back();
182 if (const StructType *ST = dyn_cast<StructType>(SS.Ty)) {
184 if (SS.Idx != ST->getElementTypes().size()) {
185 const StructLayout *SL = TD.getStructLayout(ST);
186 SS.Offset += SL->MemberOffsets[SS.Idx]-SL->MemberOffsets[SS.Idx-1];
189 Stack.pop_back(); // At the end of the structure
191 const ArrayType *AT = cast<ArrayType>(SS.Ty);
193 if (SS.Idx != AT->getNumElements()) {
194 SS.Offset += TD.getTypeSize(AT->getElementType());
197 Stack.pop_back(); // At the end of the array
202 /// StepToLeaf - Used by physical subtyping to move to the first leaf node
203 /// on the type stack.
205 if (Stack.empty()) return;
206 while (!Stack.empty() && !Stack.back().Ty->isFirstClassType()) {
207 StackState &SS = Stack.back();
208 if (const StructType *ST = dyn_cast<StructType>(SS.Ty)) {
209 if (ST->getElementTypes().empty()) {
211 PopStackAndAdvance();
213 // Step into the structure...
214 assert(SS.Idx < ST->getElementTypes().size());
215 const StructLayout *SL = TD.getStructLayout(ST);
216 Stack.push_back(StackState(ST->getElementTypes()[SS.Idx],
217 SS.Offset+SL->MemberOffsets[SS.Idx]));
220 const ArrayType *AT = cast<ArrayType>(SS.Ty);
221 if (AT->getNumElements() == 0) {
223 PopStackAndAdvance();
225 // Step into the array...
226 assert(SS.Idx < AT->getNumElements());
227 Stack.push_back(StackState(AT->getElementType(),
229 TD.getTypeSize(AT->getElementType())));
237 /// ElementTypesAreCompatible - Check to see if the specified types are
238 /// "physically" compatible. If so, return true, else return false. We only
239 /// have to check the fields in T1: T2 may be larger than T1.
241 static bool ElementTypesAreCompatible(const Type *T1, const Type *T2) {
242 TypeElementWalker T1W(T1), T2W(T2);
244 while (!T1W.isDone() && !T2W.isDone()) {
245 if (T1W.getCurrentOffset() != T2W.getCurrentOffset())
248 const Type *T1 = T1W.getCurrentType();
249 const Type *T2 = T2W.getCurrentType();
250 if (T1 != T2 && !T1->isLosslesslyConvertibleTo(T2))
253 T1W.StepToNextType();
254 T2W.StepToNextType();
261 /// mergeTypeInfo - This method merges the specified type into the current node
262 /// at the specified offset. This may update the current node's type record if
263 /// this gives more information to the node, it may do nothing to the node if
264 /// this information is already known, or it may merge the node completely (and
265 /// return true) if the information is incompatible with what is already known.
267 /// This method returns true if the node is completely folded, otherwise false.
269 bool DSNode::mergeTypeInfo(const Type *NewTy, unsigned Offset,
270 bool FoldIfIncompatible) {
271 // Check to make sure the Size member is up-to-date. Size can be one of the
273 // Size = 0, Ty = Void: Nothing is known about this node.
274 // Size = 0, Ty = FnTy: FunctionPtr doesn't have a size, so we use zero
275 // Size = 1, Ty = Void, Array = 1: The node is collapsed
276 // Otherwise, sizeof(Ty) = Size
278 assert(((Size == 0 && Ty == Type::VoidTy && !isArray()) ||
279 (Size == 0 && !Ty->isSized() && !isArray()) ||
280 (Size == 1 && Ty == Type::VoidTy && isArray()) ||
281 (Size == 0 && !Ty->isSized() && !isArray()) ||
282 (TD.getTypeSize(Ty) == Size)) &&
283 "Size member of DSNode doesn't match the type structure!");
284 assert(NewTy != Type::VoidTy && "Cannot merge void type into DSNode!");
286 if (Offset == 0 && NewTy == Ty)
287 return false; // This should be a common case, handle it efficiently
289 // Return true immediately if the node is completely folded.
290 if (isNodeCompletelyFolded()) return true;
292 // If this is an array type, eliminate the outside arrays because they won't
293 // be used anyway. This greatly reduces the size of large static arrays used
294 // as global variables, for example.
296 bool WillBeArray = false;
297 while (const ArrayType *AT = dyn_cast<ArrayType>(NewTy)) {
298 // FIXME: we might want to keep small arrays, but must be careful about
299 // things like: [2 x [10000 x int*]]
300 NewTy = AT->getElementType();
304 // Figure out how big the new type we're merging in is...
305 unsigned NewTySize = NewTy->isSized() ? TD.getTypeSize(NewTy) : 0;
307 // Otherwise check to see if we can fold this type into the current node. If
308 // we can't, we fold the node completely, if we can, we potentially update our
311 if (Ty == Type::VoidTy) {
312 // If this is the first type that this node has seen, just accept it without
314 assert(Offset == 0 && "Cannot have an offset into a void node!");
315 assert(!isArray() && "This shouldn't happen!");
318 if (WillBeArray) NodeType |= Array;
321 // Calculate the number of outgoing links from this node.
322 Links.resize((Size+DS::PointerSize-1) >> DS::PointerShift);
326 // Handle node expansion case here...
327 if (Offset+NewTySize > Size) {
328 // It is illegal to grow this node if we have treated it as an array of
331 if (FoldIfIncompatible) foldNodeCompletely();
335 if (Offset) { // We could handle this case, but we don't for now...
336 std::cerr << "UNIMP: Trying to merge a growth type into "
337 << "offset != 0: Collapsing!\n";
338 if (FoldIfIncompatible) foldNodeCompletely();
342 // Okay, the situation is nice and simple, we are trying to merge a type in
343 // at offset 0 that is bigger than our current type. Implement this by
344 // switching to the new type and then merge in the smaller one, which should
345 // hit the other code path here. If the other code path decides it's not
346 // ok, it will collapse the node as appropriate.
348 const Type *OldTy = Ty;
351 if (WillBeArray) NodeType |= Array;
354 // Must grow links to be the appropriate size...
355 Links.resize((Size+DS::PointerSize-1) >> DS::PointerShift);
357 // Merge in the old type now... which is guaranteed to be smaller than the
359 return mergeTypeInfo(OldTy, 0);
362 assert(Offset <= Size &&
363 "Cannot merge something into a part of our type that doesn't exist!");
365 // Find the section of Ty that NewTy overlaps with... first we find the
366 // type that starts at offset Offset.
369 const Type *SubType = Ty;
371 assert(Offset-O < TD.getTypeSize(SubType) && "Offset out of range!");
373 switch (SubType->getPrimitiveID()) {
374 case Type::StructTyID: {
375 const StructType *STy = cast<StructType>(SubType);
376 const StructLayout &SL = *TD.getStructLayout(STy);
378 unsigned i = 0, e = SL.MemberOffsets.size();
379 for (; i+1 < e && SL.MemberOffsets[i+1] <= Offset-O; ++i)
382 // The offset we are looking for must be in the i'th element...
383 SubType = STy->getElementTypes()[i];
384 O += SL.MemberOffsets[i];
387 case Type::ArrayTyID: {
388 SubType = cast<ArrayType>(SubType)->getElementType();
389 unsigned ElSize = TD.getTypeSize(SubType);
390 unsigned Remainder = (Offset-O) % ElSize;
391 O = Offset-Remainder;
395 if (FoldIfIncompatible) foldNodeCompletely();
400 assert(O == Offset && "Could not achieve the correct offset!");
402 // If we found our type exactly, early exit
403 if (SubType == NewTy) return false;
405 unsigned SubTypeSize = SubType->isSized() ? TD.getTypeSize(SubType) : 0;
407 // Ok, we are getting desperate now. Check for physical subtyping, where we
408 // just require each element in the node to be compatible.
409 if (NewTySize <= SubTypeSize && NewTySize && NewTySize < 256 &&
410 SubTypeSize && SubTypeSize < 256 &&
411 ElementTypesAreCompatible(NewTy, SubType))
414 // Okay, so we found the leader type at the offset requested. Search the list
415 // of types that starts at this offset. If SubType is currently an array or
416 // structure, the type desired may actually be the first element of the
419 unsigned PadSize = SubTypeSize; // Size, including pad memory which is ignored
420 while (SubType != NewTy) {
421 const Type *NextSubType = 0;
422 unsigned NextSubTypeSize = 0;
423 unsigned NextPadSize = 0;
424 switch (SubType->getPrimitiveID()) {
425 case Type::StructTyID: {
426 const StructType *STy = cast<StructType>(SubType);
427 const StructLayout &SL = *TD.getStructLayout(STy);
428 if (SL.MemberOffsets.size() > 1)
429 NextPadSize = SL.MemberOffsets[1];
431 NextPadSize = SubTypeSize;
432 NextSubType = STy->getElementTypes()[0];
433 NextSubTypeSize = TD.getTypeSize(NextSubType);
436 case Type::ArrayTyID:
437 NextSubType = cast<ArrayType>(SubType)->getElementType();
438 NextSubTypeSize = TD.getTypeSize(NextSubType);
439 NextPadSize = NextSubTypeSize;
445 if (NextSubType == 0)
446 break; // In the default case, break out of the loop
448 if (NextPadSize < NewTySize)
449 break; // Don't allow shrinking to a smaller type than NewTySize
450 SubType = NextSubType;
451 SubTypeSize = NextSubTypeSize;
452 PadSize = NextPadSize;
455 // If we found the type exactly, return it...
456 if (SubType == NewTy)
459 // Check to see if we have a compatible, but different type...
460 if (NewTySize == SubTypeSize) {
461 // Check to see if this type is obviously convertible... int -> uint f.e.
462 if (NewTy->isLosslesslyConvertibleTo(SubType))
465 // Check to see if we have a pointer & integer mismatch going on here,
466 // loading a pointer as a long, for example.
468 if (SubType->isInteger() && isa<PointerType>(NewTy) ||
469 NewTy->isInteger() && isa<PointerType>(SubType))
471 } else if (NewTySize > SubTypeSize && NewTySize <= PadSize) {
472 // We are accessing the field, plus some structure padding. Ignore the
473 // structure padding.
477 DEBUG(std::cerr << "MergeTypeInfo Folding OrigTy: " << Ty
478 << "\n due to:" << NewTy << " @ " << Offset << "!\n"
479 << "SubType: " << SubType << "\n\n");
481 if (FoldIfIncompatible) foldNodeCompletely();
487 // addEdgeTo - Add an edge from the current node to the specified node. This
488 // can cause merging of nodes in the graph.
490 void DSNode::addEdgeTo(unsigned Offset, const DSNodeHandle &NH) {
491 if (NH.getNode() == 0) return; // Nothing to do
493 DSNodeHandle &ExistingEdge = getLink(Offset);
494 if (ExistingEdge.getNode()) {
495 // Merge the two nodes...
496 ExistingEdge.mergeWith(NH);
497 } else { // No merging to perform...
498 setLink(Offset, NH); // Just force a link in there...
503 // MergeSortedVectors - Efficiently merge a vector into another vector where
504 // duplicates are not allowed and both are sorted. This assumes that 'T's are
505 // efficiently copyable and have sane comparison semantics.
507 static void MergeSortedVectors(std::vector<GlobalValue*> &Dest,
508 const std::vector<GlobalValue*> &Src) {
509 // By far, the most common cases will be the simple ones. In these cases,
510 // avoid having to allocate a temporary vector...
512 if (Src.empty()) { // Nothing to merge in...
514 } else if (Dest.empty()) { // Just copy the result in...
516 } else if (Src.size() == 1) { // Insert a single element...
517 const GlobalValue *V = Src[0];
518 std::vector<GlobalValue*>::iterator I =
519 std::lower_bound(Dest.begin(), Dest.end(), V);
520 if (I == Dest.end() || *I != Src[0]) // If not already contained...
521 Dest.insert(I, Src[0]);
522 } else if (Dest.size() == 1) {
523 GlobalValue *Tmp = Dest[0]; // Save value in temporary...
524 Dest = Src; // Copy over list...
525 std::vector<GlobalValue*>::iterator I =
526 std::lower_bound(Dest.begin(), Dest.end(), Tmp);
527 if (I == Dest.end() || *I != Tmp) // If not already contained...
531 // Make a copy to the side of Dest...
532 std::vector<GlobalValue*> Old(Dest);
534 // Make space for all of the type entries now...
535 Dest.resize(Dest.size()+Src.size());
537 // Merge the two sorted ranges together... into Dest.
538 std::merge(Old.begin(), Old.end(), Src.begin(), Src.end(), Dest.begin());
540 // Now erase any duplicate entries that may have accumulated into the
541 // vectors (because they were in both of the input sets)
542 Dest.erase(std::unique(Dest.begin(), Dest.end()), Dest.end());
547 // MergeNodes() - Helper function for DSNode::mergeWith().
548 // This function does the hard work of merging two nodes, CurNodeH
549 // and NH after filtering out trivial cases and making sure that
550 // CurNodeH.offset >= NH.offset.
553 // Since merging may cause either node to go away, we must always
554 // use the node-handles to refer to the nodes. These node handles are
555 // automatically updated during merging, so will always provide access
556 // to the correct node after a merge.
558 void DSNode::MergeNodes(DSNodeHandle& CurNodeH, DSNodeHandle& NH) {
559 assert(CurNodeH.getOffset() >= NH.getOffset() &&
560 "This should have been enforced in the caller.");
562 // Now we know that Offset >= NH.Offset, so convert it so our "Offset" (with
563 // respect to NH.Offset) is now zero. NOffset is the distance from the base
564 // of our object that N starts from.
566 unsigned NOffset = CurNodeH.getOffset()-NH.getOffset();
567 unsigned NSize = NH.getNode()->getSize();
569 // If the two nodes are of different size, and the smaller node has the array
570 // bit set, collapse!
571 if (NSize != CurNodeH.getNode()->getSize()) {
572 if (NSize < CurNodeH.getNode()->getSize()) {
573 if (NH.getNode()->isArray())
574 NH.getNode()->foldNodeCompletely();
575 } else if (CurNodeH.getNode()->isArray()) {
576 NH.getNode()->foldNodeCompletely();
580 // Merge the type entries of the two nodes together...
581 if (NH.getNode()->Ty != Type::VoidTy)
582 CurNodeH.getNode()->mergeTypeInfo(NH.getNode()->Ty, NOffset);
583 assert(!CurNodeH.getNode()->isDeadNode());
585 // If we are merging a node with a completely folded node, then both nodes are
586 // now completely folded.
588 if (CurNodeH.getNode()->isNodeCompletelyFolded()) {
589 if (!NH.getNode()->isNodeCompletelyFolded()) {
590 NH.getNode()->foldNodeCompletely();
591 assert(NH.getNode() && NH.getOffset() == 0 &&
592 "folding did not make offset 0?");
593 NOffset = NH.getOffset();
594 NSize = NH.getNode()->getSize();
595 assert(NOffset == 0 && NSize == 1);
597 } else if (NH.getNode()->isNodeCompletelyFolded()) {
598 CurNodeH.getNode()->foldNodeCompletely();
599 assert(CurNodeH.getNode() && CurNodeH.getOffset() == 0 &&
600 "folding did not make offset 0?");
601 NOffset = NH.getOffset();
602 NSize = NH.getNode()->getSize();
603 assert(NOffset == 0 && NSize == 1);
606 DSNode *N = NH.getNode();
607 if (CurNodeH.getNode() == N || N == 0) return;
608 assert(!CurNodeH.getNode()->isDeadNode());
610 // Merge the NodeType information...
611 CurNodeH.getNode()->NodeType |= N->NodeType;
613 // Start forwarding to the new node!
614 N->forwardNode(CurNodeH.getNode(), NOffset);
615 assert(!CurNodeH.getNode()->isDeadNode());
617 // Make all of the outgoing links of N now be outgoing links of CurNodeH.
619 for (unsigned i = 0; i < N->getNumLinks(); ++i) {
620 DSNodeHandle &Link = N->getLink(i << DS::PointerShift);
621 if (Link.getNode()) {
622 // Compute the offset into the current node at which to
623 // merge this link. In the common case, this is a linear
624 // relation to the offset in the original node (with
625 // wrapping), but if the current node gets collapsed due to
626 // recursive merging, we must make sure to merge in all remaining
627 // links at offset zero.
628 unsigned MergeOffset = 0;
629 DSNode *CN = CurNodeH.getNode();
631 MergeOffset = ((i << DS::PointerShift)+NOffset) % CN->getSize();
632 CN->addEdgeTo(MergeOffset, Link);
636 // Now that there are no outgoing edges, all of the Links are dead.
639 // Merge the globals list...
640 if (!N->Globals.empty()) {
641 MergeSortedVectors(CurNodeH.getNode()->Globals, N->Globals);
643 // Delete the globals from the old node...
644 std::vector<GlobalValue*>().swap(N->Globals);
649 // mergeWith - Merge this node and the specified node, moving all links to and
650 // from the argument node into the current node, deleting the node argument.
651 // Offset indicates what offset the specified node is to be merged into the
654 // The specified node may be a null pointer (in which case, nothing happens).
656 void DSNode::mergeWith(const DSNodeHandle &NH, unsigned Offset) {
657 DSNode *N = NH.getNode();
658 if (N == 0 || (N == this && NH.getOffset() == Offset))
661 assert(!N->isDeadNode() && !isDeadNode());
662 assert(!hasNoReferrers() && "Should not try to fold a useless node!");
665 // We cannot merge two pieces of the same node together, collapse the node
667 DEBUG(std::cerr << "Attempting to merge two chunks of"
668 << " the same node together!\n");
669 foldNodeCompletely();
673 // If both nodes are not at offset 0, make sure that we are merging the node
674 // at an later offset into the node with the zero offset.
676 if (Offset < NH.getOffset()) {
677 N->mergeWith(DSNodeHandle(this, Offset), NH.getOffset());
679 } else if (Offset == NH.getOffset() && getSize() < N->getSize()) {
680 // If the offsets are the same, merge the smaller node into the bigger node
681 N->mergeWith(DSNodeHandle(this, Offset), NH.getOffset());
685 // Ok, now we can merge the two nodes. Use a static helper that works with
686 // two node handles, since "this" may get merged away at intermediate steps.
687 DSNodeHandle CurNodeH(this, Offset);
688 DSNodeHandle NHCopy(NH);
689 DSNode::MergeNodes(CurNodeH, NHCopy);
692 //===----------------------------------------------------------------------===//
693 // DSCallSite Implementation
694 //===----------------------------------------------------------------------===//
696 // Define here to avoid including iOther.h and BasicBlock.h in DSGraph.h
697 Function &DSCallSite::getCaller() const {
698 return *Inst->getParent()->getParent();
702 //===----------------------------------------------------------------------===//
703 // DSGraph Implementation
704 //===----------------------------------------------------------------------===//
706 /// getFunctionNames - Return a space separated list of the name of the
707 /// functions in this graph (if any)
708 std::string DSGraph::getFunctionNames() const {
709 switch (getReturnNodes().size()) {
710 case 0: return "Globals graph";
711 case 1: return getReturnNodes().begin()->first->getName();
714 for (DSGraph::ReturnNodesTy::const_iterator I = getReturnNodes().begin();
715 I != getReturnNodes().end(); ++I)
716 Return += I->first->getName() + " ";
717 Return.erase(Return.end()-1, Return.end()); // Remove last space character
723 DSGraph::DSGraph(const DSGraph &G) : GlobalsGraph(0) {
724 PrintAuxCalls = false;
726 cloneInto(G, ScalarMap, ReturnNodes, NodeMap);
729 DSGraph::DSGraph(const DSGraph &G, NodeMapTy &NodeMap)
731 PrintAuxCalls = false;
732 cloneInto(G, ScalarMap, ReturnNodes, NodeMap);
735 DSGraph::~DSGraph() {
736 FunctionCalls.clear();
737 AuxFunctionCalls.clear();
741 // Drop all intra-node references, so that assertions don't fail...
742 std::for_each(Nodes.begin(), Nodes.end(),
743 std::mem_fun(&DSNode::dropAllReferences));
745 // Delete all of the nodes themselves...
746 std::for_each(Nodes.begin(), Nodes.end(), deleter<DSNode>);
749 // dump - Allow inspection of graph in a debugger.
750 void DSGraph::dump() const { print(std::cerr); }
753 /// remapLinks - Change all of the Links in the current node according to the
754 /// specified mapping.
756 void DSNode::remapLinks(DSGraph::NodeMapTy &OldNodeMap) {
757 for (unsigned i = 0, e = Links.size(); i != e; ++i) {
758 DSNodeHandle &H = OldNodeMap[Links[i].getNode()];
759 Links[i].setNode(H.getNode());
760 Links[i].setOffset(Links[i].getOffset()+H.getOffset());
765 /// cloneInto - Clone the specified DSGraph into the current graph. The
766 /// translated ScalarMap for the old function is filled into the OldValMap
767 /// member, and the translated ReturnNodes map is returned into ReturnNodes.
769 /// The CloneFlags member controls various aspects of the cloning process.
771 void DSGraph::cloneInto(const DSGraph &G, ScalarMapTy &OldValMap,
772 ReturnNodesTy &OldReturnNodes, NodeMapTy &OldNodeMap,
773 unsigned CloneFlags) {
774 assert(OldNodeMap.empty() && "Returned OldNodeMap should be empty!");
775 assert(&G != this && "Cannot clone graph into itself!");
777 unsigned FN = Nodes.size(); // First new node...
779 // Duplicate all of the nodes, populating the node map...
780 Nodes.reserve(FN+G.Nodes.size());
782 // Remove alloca or mod/ref bits as specified...
783 unsigned BitsToClear =((CloneFlags & StripAllocaBit) ? DSNode::AllocaNode : 0)
784 | ((CloneFlags & StripModRefBits) ? (DSNode::Modified | DSNode::Read) : 0);
785 BitsToClear |= DSNode::DEAD; // Clear dead flag...
786 for (unsigned i = 0, e = G.Nodes.size(); i != e; ++i) {
787 DSNode *Old = G.Nodes[i];
788 DSNode *New = new DSNode(*Old, this);
789 New->maskNodeTypes(~BitsToClear);
790 OldNodeMap[Old] = New;
794 Timer::addPeakMemoryMeasurement();
797 // Rewrite the links in the new nodes to point into the current graph now.
798 for (unsigned i = FN, e = Nodes.size(); i != e; ++i)
799 Nodes[i]->remapLinks(OldNodeMap);
801 // Copy the scalar map... merging all of the global nodes...
802 for (ScalarMapTy::const_iterator I = G.ScalarMap.begin(),
803 E = G.ScalarMap.end(); I != E; ++I) {
804 DSNodeHandle &MappedNode = OldNodeMap[I->second.getNode()];
805 DSNodeHandle &H = OldValMap[I->first];
806 H.mergeWith(DSNodeHandle(MappedNode.getNode(),
807 I->second.getOffset()+MappedNode.getOffset()));
809 // If this is a global, add the global to this fn or merge if already exists
810 if (isa<GlobalValue>(I->first))
811 ScalarMap[I->first].mergeWith(H);
814 if (!(CloneFlags & DontCloneCallNodes)) {
815 // Copy the function calls list...
816 unsigned FC = FunctionCalls.size(); // FirstCall
817 FunctionCalls.reserve(FC+G.FunctionCalls.size());
818 for (unsigned i = 0, ei = G.FunctionCalls.size(); i != ei; ++i)
819 FunctionCalls.push_back(DSCallSite(G.FunctionCalls[i], OldNodeMap));
822 if (!(CloneFlags & DontCloneAuxCallNodes)) {
823 // Copy the auxillary function calls list...
824 unsigned FC = AuxFunctionCalls.size(); // FirstCall
825 AuxFunctionCalls.reserve(FC+G.AuxFunctionCalls.size());
826 for (unsigned i = 0, ei = G.AuxFunctionCalls.size(); i != ei; ++i)
827 AuxFunctionCalls.push_back(DSCallSite(G.AuxFunctionCalls[i], OldNodeMap));
830 // Map the return node pointers over...
831 for (ReturnNodesTy::const_iterator I = G.getReturnNodes().begin(),
832 E = G.getReturnNodes().end(); I != E; ++I) {
833 const DSNodeHandle &Ret = I->second;
834 DSNodeHandle &MappedRet = OldNodeMap[Ret.getNode()];
835 OldReturnNodes.insert(std::make_pair(I->first,
836 DSNodeHandle(MappedRet.getNode(),
837 MappedRet.getOffset()+Ret.getOffset())));
841 /// mergeInGraph - The method is used for merging graphs together. If the
842 /// argument graph is not *this, it makes a clone of the specified graph, then
843 /// merges the nodes specified in the call site with the formal arguments in the
846 void DSGraph::mergeInGraph(const DSCallSite &CS, Function &F,
847 const DSGraph &Graph, unsigned CloneFlags) {
848 ScalarMapTy OldValMap, *ScalarMap;
851 // If this is not a recursive call, clone the graph into this graph...
852 if (&Graph != this) {
853 // Clone the callee's graph into the current graph, keeping
854 // track of where scalars in the old graph _used_ to point,
855 // and of the new nodes matching nodes of the old graph.
856 NodeMapTy OldNodeMap;
858 // The clone call may invalidate any of the vectors in the data
859 // structure graph. Strip locals and don't copy the list of callers
860 ReturnNodesTy OldRetNodes;
861 cloneInto(Graph, OldValMap, OldRetNodes, OldNodeMap, CloneFlags);
862 RetVal = OldRetNodes[&F];
863 ScalarMap = &OldValMap;
865 RetVal = getReturnNodeFor(F);
866 ScalarMap = &getScalarMap();
869 // Merge the return value with the return value of the context...
870 RetVal.mergeWith(CS.getRetVal());
872 // Resolve all of the function arguments...
873 Function::aiterator AI = F.abegin();
875 for (unsigned i = 0, e = CS.getNumPtrArgs(); i != e; ++i, ++AI) {
876 // Advance the argument iterator to the first pointer argument...
877 while (AI != F.aend() && !isPointerType(AI->getType())) {
881 std::cerr << "Bad call to Function: " << F.getName() << "\n";
884 if (AI == F.aend()) break;
886 // Add the link from the argument scalar to the provided value
887 assert(ScalarMap->count(AI) && "Argument not in scalar map?");
888 DSNodeHandle &NH = (*ScalarMap)[AI];
889 assert(NH.getNode() && "Pointer argument without scalarmap entry?");
890 NH.mergeWith(CS.getPtrArg(i));
895 // markIncompleteNodes - Mark the specified node as having contents that are not
896 // known with the current analysis we have performed. Because a node makes all
897 // of the nodes it can reach incomplete if the node itself is incomplete, we
898 // must recursively traverse the data structure graph, marking all reachable
899 // nodes as incomplete.
901 static void markIncompleteNode(DSNode *N) {
902 // Stop recursion if no node, or if node already marked...
903 if (N == 0 || N->isIncomplete()) return;
905 // Actually mark the node
906 N->setIncompleteMarker();
908 // Recusively process children...
909 for (unsigned i = 0, e = N->getSize(); i < e; i += DS::PointerSize)
910 if (DSNode *DSN = N->getLink(i).getNode())
911 markIncompleteNode(DSN);
914 static void markIncomplete(DSCallSite &Call) {
915 // Then the return value is certainly incomplete!
916 markIncompleteNode(Call.getRetVal().getNode());
918 // All objects pointed to by function arguments are incomplete!
919 for (unsigned i = 0, e = Call.getNumPtrArgs(); i != e; ++i)
920 markIncompleteNode(Call.getPtrArg(i).getNode());
923 // markIncompleteNodes - Traverse the graph, identifying nodes that may be
924 // modified by other functions that have not been resolved yet. This marks
925 // nodes that are reachable through three sources of "unknownness":
927 // Global Variables, Function Calls, and Incoming Arguments
929 // For any node that may have unknown components (because something outside the
930 // scope of current analysis may have modified it), the 'Incomplete' flag is
931 // added to the NodeType.
933 void DSGraph::markIncompleteNodes(unsigned Flags) {
934 // Mark any incoming arguments as incomplete...
935 if (Flags & DSGraph::MarkFormalArgs)
936 for (ReturnNodesTy::iterator FI = ReturnNodes.begin(), E =ReturnNodes.end();
938 Function &F = *FI->first;
939 if (F.getName() != "main")
940 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I)
941 if (isPointerType(I->getType()) &&
942 ScalarMap.find(I) != ScalarMap.end())
943 markIncompleteNode(ScalarMap[I].getNode());
946 // Mark stuff passed into functions calls as being incomplete...
947 if (!shouldPrintAuxCalls())
948 for (unsigned i = 0, e = FunctionCalls.size(); i != e; ++i)
949 markIncomplete(FunctionCalls[i]);
951 for (unsigned i = 0, e = AuxFunctionCalls.size(); i != e; ++i)
952 markIncomplete(AuxFunctionCalls[i]);
955 // Mark all global nodes as incomplete...
956 if ((Flags & DSGraph::IgnoreGlobals) == 0)
957 for (unsigned i = 0, e = Nodes.size(); i != e; ++i)
958 if (Nodes[i]->isGlobalNode() && Nodes[i]->getNumLinks())
959 markIncompleteNode(Nodes[i]);
962 static inline void killIfUselessEdge(DSNodeHandle &Edge) {
963 if (DSNode *N = Edge.getNode()) // Is there an edge?
964 if (N->getNumReferrers() == 1) // Does it point to a lonely node?
965 // No interesting info?
966 if ((N->getNodeFlags() & ~DSNode::Incomplete) == 0 &&
967 N->getType() == Type::VoidTy && !N->isNodeCompletelyFolded())
968 Edge.setNode(0); // Kill the edge!
971 static inline bool nodeContainsExternalFunction(const DSNode *N) {
972 const std::vector<GlobalValue*> &Globals = N->getGlobals();
973 for (unsigned i = 0, e = Globals.size(); i != e; ++i)
974 if (Globals[i]->isExternal())
979 static void removeIdenticalCalls(std::vector<DSCallSite> &Calls) {
980 // Remove trivially identical function calls
981 unsigned NumFns = Calls.size();
982 std::sort(Calls.begin(), Calls.end()); // Sort by callee as primary key!
984 // Scan the call list cleaning it up as necessary...
985 DSNode *LastCalleeNode = 0;
986 Function *LastCalleeFunc = 0;
987 unsigned NumDuplicateCalls = 0;
988 bool LastCalleeContainsExternalFunction = false;
989 for (unsigned i = 0; i != Calls.size(); ++i) {
990 DSCallSite &CS = Calls[i];
992 // If the Callee is a useless edge, this must be an unreachable call site,
994 if (CS.isIndirectCall() && CS.getCalleeNode()->getNumReferrers() == 1 &&
995 CS.getCalleeNode()->getNodeFlags() == 0) { // No useful info?
996 std::cerr << "WARNING: Useless call site found??\n";
997 CS.swap(Calls.back());
1001 // If the return value or any arguments point to a void node with no
1002 // information at all in it, and the call node is the only node to point
1003 // to it, remove the edge to the node (killing the node).
1005 killIfUselessEdge(CS.getRetVal());
1006 for (unsigned a = 0, e = CS.getNumPtrArgs(); a != e; ++a)
1007 killIfUselessEdge(CS.getPtrArg(a));
1009 // If this call site calls the same function as the last call site, and if
1010 // the function pointer contains an external function, this node will
1011 // never be resolved. Merge the arguments of the call node because no
1012 // information will be lost.
1014 if ((CS.isDirectCall() && CS.getCalleeFunc() == LastCalleeFunc) ||
1015 (CS.isIndirectCall() && CS.getCalleeNode() == LastCalleeNode)) {
1016 ++NumDuplicateCalls;
1017 if (NumDuplicateCalls == 1) {
1019 LastCalleeContainsExternalFunction =
1020 nodeContainsExternalFunction(LastCalleeNode);
1022 LastCalleeContainsExternalFunction = LastCalleeFunc->isExternal();
1025 if (LastCalleeContainsExternalFunction ||
1026 // This should be more than enough context sensitivity!
1027 // FIXME: Evaluate how many times this is tripped!
1028 NumDuplicateCalls > 20) {
1029 DSCallSite &OCS = Calls[i-1];
1032 // The node will now be eliminated as a duplicate!
1033 if (CS.getNumPtrArgs() < OCS.getNumPtrArgs())
1035 else if (CS.getNumPtrArgs() > OCS.getNumPtrArgs())
1039 if (CS.isDirectCall()) {
1040 LastCalleeFunc = CS.getCalleeFunc();
1043 LastCalleeNode = CS.getCalleeNode();
1046 NumDuplicateCalls = 0;
1051 Calls.erase(std::unique(Calls.begin(), Calls.end()),
1054 // Track the number of call nodes merged away...
1055 NumCallNodesMerged += NumFns-Calls.size();
1057 DEBUG(if (NumFns != Calls.size())
1058 std::cerr << "Merged " << (NumFns-Calls.size()) << " call nodes.\n";);
1062 // removeTriviallyDeadNodes - After the graph has been constructed, this method
1063 // removes all unreachable nodes that are created because they got merged with
1064 // other nodes in the graph. These nodes will all be trivially unreachable, so
1065 // we don't have to perform any non-trivial analysis here.
1067 void DSGraph::removeTriviallyDeadNodes() {
1068 removeIdenticalCalls(FunctionCalls);
1069 removeIdenticalCalls(AuxFunctionCalls);
1071 for (unsigned i = 0; i != Nodes.size(); ++i) {
1072 DSNode *Node = Nodes[i];
1073 if (Node->isComplete() && !Node->isModified() && !Node->isRead()) {
1074 // This is a useless node if it has no mod/ref info (checked above),
1075 // outgoing edges (which it cannot, as it is not modified in this
1076 // context), and it has no incoming edges. If it is a global node it may
1077 // have all of these properties and still have incoming edges, due to the
1078 // scalar map, so we check those now.
1080 if (Node->getNumReferrers() == Node->getGlobals().size()) {
1081 const std::vector<GlobalValue*> &Globals = Node->getGlobals();
1083 // Loop through and make sure all of the globals are referring directly
1085 for (unsigned j = 0, e = Globals.size(); j != e; ++j) {
1086 DSNode *N = ScalarMap.find(Globals[j])->second.getNode();
1087 assert(N == Node && "ScalarMap doesn't match globals list!");
1090 // Make sure NumReferrers still agrees, if so, the node is truly dead.
1091 if (Node->getNumReferrers() == Globals.size()) {
1092 for (unsigned j = 0, e = Globals.size(); j != e; ++j)
1093 ScalarMap.erase(Globals[j]);
1094 Node->makeNodeDead();
1099 if (Node->getNodeFlags() == 0 && Node->hasNoReferrers()) {
1100 // This node is dead!
1101 delete Node; // Free memory...
1102 Nodes[i--] = Nodes.back();
1103 Nodes.pop_back(); // Remove from node list...
1109 /// markReachableNodes - This method recursively traverses the specified
1110 /// DSNodes, marking any nodes which are reachable. All reachable nodes it adds
1111 /// to the set, which allows it to only traverse visited nodes once.
1113 void DSNode::markReachableNodes(hash_set<DSNode*> &ReachableNodes) {
1114 if (this == 0) return;
1115 assert(getForwardNode() == 0 && "Cannot mark a forwarded node!");
1116 if (ReachableNodes.count(this)) return; // Already marked reachable
1117 ReachableNodes.insert(this); // Is reachable now
1119 for (unsigned i = 0, e = getSize(); i < e; i += DS::PointerSize)
1120 getLink(i).getNode()->markReachableNodes(ReachableNodes);
1123 void DSCallSite::markReachableNodes(hash_set<DSNode*> &Nodes) {
1124 getRetVal().getNode()->markReachableNodes(Nodes);
1125 if (isIndirectCall()) getCalleeNode()->markReachableNodes(Nodes);
1127 for (unsigned i = 0, e = getNumPtrArgs(); i != e; ++i)
1128 getPtrArg(i).getNode()->markReachableNodes(Nodes);
1131 // CanReachAliveNodes - Simple graph walker that recursively traverses the graph
1132 // looking for a node that is marked alive. If an alive node is found, return
1133 // true, otherwise return false. If an alive node is reachable, this node is
1134 // marked as alive...
1136 static bool CanReachAliveNodes(DSNode *N, hash_set<DSNode*> &Alive,
1137 hash_set<DSNode*> &Visited) {
1138 if (N == 0) return false;
1139 assert(N->getForwardNode() == 0 && "Cannot mark a forwarded node!");
1141 // If we know that this node is alive, return so!
1142 if (Alive.count(N)) return true;
1144 // Otherwise, we don't think the node is alive yet, check for infinite
1146 if (Visited.count(N)) return false; // Found a cycle
1147 Visited.insert(N); // No recursion, insert into Visited...
1149 for (unsigned i = 0, e = N->getSize(); i < e; i += DS::PointerSize)
1150 if (CanReachAliveNodes(N->getLink(i).getNode(), Alive, Visited)) {
1151 N->markReachableNodes(Alive);
1157 // CallSiteUsesAliveArgs - Return true if the specified call site can reach any
1160 static bool CallSiteUsesAliveArgs(DSCallSite &CS, hash_set<DSNode*> &Alive,
1161 hash_set<DSNode*> &Visited) {
1162 if (CanReachAliveNodes(CS.getRetVal().getNode(), Alive, Visited))
1164 if (CS.isIndirectCall() &&
1165 CanReachAliveNodes(CS.getCalleeNode(), Alive, Visited))
1167 for (unsigned i = 0, e = CS.getNumPtrArgs(); i != e; ++i)
1168 if (CanReachAliveNodes(CS.getPtrArg(i).getNode(), Alive, Visited))
1173 // removeDeadNodes - Use a more powerful reachability analysis to eliminate
1174 // subgraphs that are unreachable. This often occurs because the data
1175 // structure doesn't "escape" into it's caller, and thus should be eliminated
1176 // from the caller's graph entirely. This is only appropriate to use when
1179 void DSGraph::removeDeadNodes(unsigned Flags) {
1180 // Reduce the amount of work we have to do... remove dummy nodes left over by
1182 removeTriviallyDeadNodes();
1184 // FIXME: Merge nontrivially identical call nodes...
1186 // Alive - a set that holds all nodes found to be reachable/alive.
1187 hash_set<DSNode*> Alive;
1188 std::vector<std::pair<Value*, DSNode*> > GlobalNodes;
1190 // Mark all nodes reachable by (non-global) scalar nodes as alive...
1191 for (ScalarMapTy::iterator I = ScalarMap.begin(), E = ScalarMap.end(); I !=E;)
1192 if (isa<GlobalValue>(I->first)) { // Keep track of global nodes
1193 assert(I->second.getNode() && "Null global node?");
1194 GlobalNodes.push_back(std::make_pair(I->first, I->second.getNode()));
1197 // Check to see if this is a worthless node generated for non-pointer
1198 // values, such as integers. Consider an addition of long types: A+B.
1199 // Assuming we can track all uses of the value in this context, and it is
1200 // NOT used as a pointer, we can delete the node. We will be able to
1201 // detect this situation if the node pointed to ONLY has Unknown bit set
1202 // in the node. In this case, the node is not incomplete, does not point
1203 // to any other nodes (no mod/ref bits set), and is therefore
1204 // uninteresting for data structure analysis. If we run across one of
1205 // these, prune the scalar pointing to it.
1207 DSNode *N = I->second.getNode();
1208 if (N->isUnknownNode() && !isa<Argument>(I->first)) {
1209 ScalarMap.erase(I++);
1211 I->second.getNode()->markReachableNodes(Alive);
1216 // The return value is alive as well...
1217 for (ReturnNodesTy::iterator I = ReturnNodes.begin(), E = ReturnNodes.end();
1219 I->second.getNode()->markReachableNodes(Alive);
1221 // Mark any nodes reachable by primary calls as alive...
1222 for (unsigned i = 0, e = FunctionCalls.size(); i != e; ++i)
1223 FunctionCalls[i].markReachableNodes(Alive);
1226 hash_set<DSNode*> Visited;
1227 std::vector<unsigned char> AuxFCallsAlive(AuxFunctionCalls.size());
1230 // If any global nodes points to a non-global that is "alive", the global is
1231 // "alive" as well... Remove it from the GlobalNodes list so we only have
1232 // unreachable globals in the list.
1235 for (unsigned i = 0; i != GlobalNodes.size(); ++i)
1236 if (CanReachAliveNodes(GlobalNodes[i].second, Alive, Visited)) {
1237 std::swap(GlobalNodes[i--], GlobalNodes.back()); // Move to end to erase
1238 GlobalNodes.pop_back(); // Erase efficiently
1242 for (unsigned i = 0, e = AuxFunctionCalls.size(); i != e; ++i)
1243 if (!AuxFCallsAlive[i] &&
1244 CallSiteUsesAliveArgs(AuxFunctionCalls[i], Alive, Visited)) {
1245 AuxFunctionCalls[i].markReachableNodes(Alive);
1246 AuxFCallsAlive[i] = true;
1251 // Remove all dead aux function calls...
1252 unsigned CurIdx = 0;
1253 for (unsigned i = 0, e = AuxFunctionCalls.size(); i != e; ++i)
1254 if (AuxFCallsAlive[i])
1255 AuxFunctionCalls[CurIdx++].swap(AuxFunctionCalls[i]);
1256 if (!(Flags & DSGraph::RemoveUnreachableGlobals)) {
1257 assert(GlobalsGraph && "No globals graph available??");
1258 // Move the unreachable call nodes to the globals graph...
1259 GlobalsGraph->AuxFunctionCalls.insert(GlobalsGraph->AuxFunctionCalls.end(),
1260 AuxFunctionCalls.begin()+CurIdx,
1261 AuxFunctionCalls.end());
1263 // Crop all the useless ones out...
1264 AuxFunctionCalls.erase(AuxFunctionCalls.begin()+CurIdx,
1265 AuxFunctionCalls.end());
1267 // At this point, any nodes which are visited, but not alive, are nodes which
1268 // should be moved to the globals graph. Loop over all nodes, eliminating
1269 // completely unreachable nodes, and moving visited nodes to the globals graph
1271 std::vector<DSNode*> DeadNodes;
1272 DeadNodes.reserve(Nodes.size());
1273 for (unsigned i = 0; i != Nodes.size(); ++i)
1274 if (!Alive.count(Nodes[i])) {
1275 DSNode *N = Nodes[i];
1276 Nodes[i--] = Nodes.back(); // move node to end of vector
1277 Nodes.pop_back(); // Erase node from alive list.
1278 if (!(Flags & DSGraph::RemoveUnreachableGlobals) && // Not in TD pass
1279 Visited.count(N)) { // Visited but not alive?
1280 GlobalsGraph->Nodes.push_back(N); // Move node to globals graph
1281 N->setParentGraph(GlobalsGraph);
1282 } else { // Otherwise, delete the node
1283 assert((!N->isGlobalNode() ||
1284 (Flags & DSGraph::RemoveUnreachableGlobals))
1285 && "Killing a global?");
1286 //std::cerr << "[" << i+1 << "/" << DeadNodes.size()
1287 // << "] Node is dead: "; N->dump();
1288 DeadNodes.push_back(N);
1289 N->dropAllReferences();
1292 assert(Nodes[i]->getForwardNode() == 0 && "Alive forwarded node?");
1295 // Now that the nodes have either been deleted or moved to the globals graph,
1296 // loop over the scalarmap, updating the entries for globals...
1298 if (!(Flags & DSGraph::RemoveUnreachableGlobals)) { // Not in the TD pass?
1299 // In this array we start the remapping, which can cause merging. Because
1300 // of this, the DSNode pointers in GlobalNodes may be invalidated, so we
1301 // must always go through the ScalarMap (which contains DSNodeHandles [which
1302 // cannot be invalidated by merging]).
1304 for (unsigned i = 0, e = GlobalNodes.size(); i != e; ++i) {
1305 Value *G = GlobalNodes[i].first;
1306 ScalarMapTy::iterator I = ScalarMap.find(G);
1307 assert(I != ScalarMap.end() && "Global not in scalar map anymore?");
1308 assert(I->second.getNode() && "Global not pointing to anything?");
1309 assert(!Alive.count(I->second.getNode()) && "Node is alive??");
1310 GlobalsGraph->ScalarMap[G].mergeWith(I->second);
1311 assert(GlobalsGraph->ScalarMap[G].getNode() &&
1312 "Global not pointing to anything?");
1316 // Merging leaves behind silly nodes, we remove them to avoid polluting the
1318 if (!GlobalNodes.empty())
1319 GlobalsGraph->removeTriviallyDeadNodes();
1321 // If we are in the top-down pass, remove all unreachable globals from the
1323 for (unsigned i = 0, e = GlobalNodes.size(); i != e; ++i)
1324 ScalarMap.erase(GlobalNodes[i].first);
1327 // Loop over all of the dead nodes now, deleting them since their referrer
1329 for (unsigned i = 0, e = DeadNodes.size(); i != e; ++i)
1330 delete DeadNodes[i];
1332 DEBUG(AssertGraphOK(); GlobalsGraph->AssertGraphOK());
1335 void DSGraph::AssertGraphOK() const {
1336 for (unsigned i = 0, e = Nodes.size(); i != e; ++i)
1337 Nodes[i]->assertOK();
1338 return; // FIXME: remove
1339 for (ScalarMapTy::const_iterator I = ScalarMap.begin(),
1340 E = ScalarMap.end(); I != E; ++I) {
1341 assert(I->second.getNode() && "Null node in scalarmap!");
1342 AssertNodeInGraph(I->second.getNode());
1343 if (GlobalValue *GV = dyn_cast<GlobalValue>(I->first)) {
1344 assert(I->second.getNode()->isGlobalNode() &&
1345 "Global points to node, but node isn't global?");
1346 AssertNodeContainsGlobal(I->second.getNode(), GV);
1349 AssertCallNodesInGraph();
1350 AssertAuxCallNodesInGraph();