aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure/EquivClassGraphs.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2005-03-21 20:31:29 +0000
committerChris Lattner <sabre@nondot.org>2005-03-21 20:31:29 +0000
commit275b3017404e9d3cfe73631257121ca020f88f21 (patch)
tree362b1b34dc4515d63315671ef19ac5a0fd5e7954 /lib/Analysis/DataStructure/EquivClassGraphs.cpp
parentd75e334d2460c64441d8770b34d025d1315b256c (diff)
Enhance the TD pass to build composite graphs when we have indirect call
sites that target multiple callees. If we have a function table, for example, with N callees, and M callers call through it, we used to have to perform O(M*N) graph inlinings. Now we perform O(M+N) inlinings. This speeds up the td pass on perlbmk from 36.26s to 25.75s. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20743 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/EquivClassGraphs.cpp')
0 files changed, 0 insertions, 0 deletions