aboutsummaryrefslogtreecommitdiff
path: root/llvm/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
commitc1439d539f27abb6f3fff22a1adcd1ad999fe73a (patch)
tree375f563481003591ceb4841ad0482c2870cc91c5 /llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp
parent650cd59f28c94db42ca6c2d9fda1e1a56ef03677 (diff)
downloadllvm-c1439d539f27abb6f3fff22a1adcd1ad999fe73a.zip
llvm-c1439d539f27abb6f3fff22a1adcd1ad999fe73a.tar.gz
llvm-c1439d539f27abb6f3fff22a1adcd1ad999fe73a.tar.bz2
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. llvm-svn: 20743
Diffstat (limited to 'llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp')
0 files changed, 0 insertions, 0 deletions