| commit | d124c38993acedc9a473b249108b2ed349be343f | [log] [tgz] |
|---|---|---|
| author | Chris Lattner <sabre@nondot.org> | Thu Jul 18 01:58:24 2002 +0000 |
| committer | Chris Lattner <sabre@nondot.org> | Thu Jul 18 01:58:24 2002 +0000 |
| tree | d83a48be9fed62d74c2e75799cb4881a2b3dbcd0 | |
| parent | 0b5909e6ae3d31c3e6c1379f61d7b038f225a620 [diff] [blame] |
The graph is more accurate when I don't completely ignore the return value. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2952 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/lib/Analysis/DataStructure/BottomUpClosure.cpp b/lib/Analysis/DataStructure/BottomUpClosure.cpp index c8e9fc3..ed468e31 100644 --- a/lib/Analysis/DataStructure/BottomUpClosure.cpp +++ b/lib/Analysis/DataStructure/BottomUpClosure.cpp
@@ -151,6 +151,9 @@ ResolveArguments(Call, FI, OldValMap); + if (Call[0]) // Handle the return value if present + RetVal->mergeWith(Call[0]); + // Merge global value nodes in the inlined graph with the global // value nodes in the current graph if there are duplicates. //