diff options
| author | Chris Lattner <sabre@nondot.org> | 2002-10-17 04:57:28 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2002-10-17 04:57:28 +0000 |
| commit | 19db0492b85f6c92aebefffeb269c2078b043a3f (patch) | |
| tree | a28b38c9f28d871c9e3f63317c73d7f8756f585c /lib/Analysis/DataStructure/TopDownClosure.cpp | |
| parent | c966a2acee176369be2f901e32c346c176b7f772 (diff) | |
Enable incompleteness marking
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4217 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/TopDownClosure.cpp')
| -rw-r--r-- | lib/Analysis/DataStructure/TopDownClosure.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp index a5f2924ffd..8d4b93a294 100644 --- a/lib/Analysis/DataStructure/TopDownClosure.cpp +++ b/lib/Analysis/DataStructure/TopDownClosure.cpp @@ -176,11 +176,11 @@ DSGraph &TDDataStructures::calculateGraph(Function &F) { } -#if 0 // Recompute the Incomplete markers and eliminate unreachable nodes. Graph->maskIncompleteMarkers(); - Graph->markIncompleteNodes(/*markFormals*/ ! F.hasInternalLinkage() + Graph->markIncompleteNodes(/*markFormals*/ !F.hasInternalLinkage() /*&& FIXME: NEED TO CHECK IF ALL CALLERS FOUND!*/); +#if 0 Graph->removeDeadNodes(/*KeepAllGlobals*/ false, /*KeepCalls*/ false); #endif |