* Rename UnlinkUndistinguishableShadowNodes & RemoveUnreachableShadowNodes
to reflect that they can eliminate arbitrary nodes.
* Rename the ShadowNodeEliminate.cpp file to EliminateNodes.cpp for the
same reason
llvm-svn: 2020
diff --git a/llvm/lib/Analysis/DataStructure/ComputeClosure.cpp b/llvm/lib/Analysis/DataStructure/ComputeClosure.cpp
index 1f15b68..a86d6e5 100644
--- a/llvm/lib/Analysis/DataStructure/ComputeClosure.cpp
+++ b/llvm/lib/Analysis/DataStructure/ComputeClosure.cpp
@@ -193,10 +193,10 @@
// Eliminate shadow nodes that are not distinguishable from some other
// node in the graph...
//
- Changed = UnlinkUndistinguishableShadowNodes();
+ Changed = UnlinkUndistinguishableNodes();
// Eliminate shadow nodes that are now extraneous due to linking...
- Changed |= RemoveUnreachableShadowNodes();
+ Changed |= RemoveUnreachableNodes();
}
//if (F == Func) return; // Only do one self inlining