Rename NewNode flag to HeapNode

llvm-svn: 4515

3 files changed, 5 insertions, 4 deletions

diff --git a/llvm/lib/Analysis/DataStructure/DataStructure.cpp b/llvm/lib/Analysis/DataStructure/DataStructure.cpp
index 2aadc000f6c..ac65d2ad762 100644
--- a/llvm/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/llvm/lib/Analysis/DataStructure/DataStructure.cpp
@@ -1003,10 +1003,11 @@ void GlobalDSGraph::removeReference(const DSGraph* referrer) {
   }
 }
 
+#if 0
 // Bits used in the next function
-static const char ExternalTypeBits = DSNode::GlobalNode | DSNode::NewNode;
+static const char ExternalTypeBits = DSNode::GlobalNode | DSNode::HeapNode;
+
 
-#if 0
 // GlobalDSGraph::cloneNodeInto - Clone a global node and all its externally
 // visible target links (and recursively their such links) into this graph.
 // NodeCache maps the node being cloned to its clone in the Globals graph,
diff --git a/llvm/lib/Analysis/DataStructure/Local.cpp b/llvm/lib/Analysis/DataStructure/Local.cpp
index 0d6046d13d3..e45cdcbed81 100644
--- a/llvm/lib/Analysis/DataStructure/Local.cpp
+++ b/llvm/lib/Analysis/DataStructure/Local.cpp
@@ -84,7 +84,7 @@ namespace {
   private:
     // Visitor functions, used to handle each instruction type we encounter...
     friend class InstVisitor<GraphBuilder>;
-    void visitMallocInst(MallocInst &MI) { handleAlloc(MI, DSNode::NewNode); }
+    void visitMallocInst(MallocInst &MI) { handleAlloc(MI, DSNode::HeapNode); }
     void visitAllocaInst(AllocaInst &AI) { handleAlloc(AI, DSNode::AllocaNode);}
     void handleAlloc(AllocationInst &AI, DSNode::NodeTy NT);
 
diff --git a/llvm/lib/Analysis/DataStructure/Printer.cpp b/llvm/lib/Analysis/DataStructure/Printer.cpp
index a58f7ef4eee..8514d53faf3 100644
--- a/llvm/lib/Analysis/DataStructure/Printer.cpp
+++ b/llvm/lib/Analysis/DataStructure/Printer.cpp
@@ -37,7 +37,7 @@ static string getCaption(const DSNode *N, const DSGraph *G) {
   }
 
   if (N->NodeType & DSNode::AllocaNode ) OS << "S";
-  if (N->NodeType & DSNode::NewNode    ) OS << "H";
+  if (N->NodeType & DSNode::HeapNode   ) OS << "H";
   if (N->NodeType & DSNode::GlobalNode ) OS << "G";
   if (N->NodeType & DSNode::UnknownNode) OS << "U";
   if (N->NodeType & DSNode::Incomplete ) OS << "I";