aboutsummaryrefslogtreecommitdiffstats
path: root/bindings
diff options
context:
space:
mode:
authorRoman Levenstein <romix.llvm@googlemail.com>2008-03-04 11:19:43 +0000
committerRoman Levenstein <romix.llvm@googlemail.com>2008-03-04 11:19:43 +0000
commitd86449e77435508db465fbb20c80581a1c269f85 (patch)
tree68e08cfc71e73b59e39247dab454fa5695d375dd /bindings
parentef12057737229452c17983faa20857dba441ef05 (diff)
downloadexternal_llvm-d86449e77435508db465fbb20c80581a1c269f85.zip
external_llvm-d86449e77435508db465fbb20c80581a1c269f85.tar.gz
external_llvm-d86449e77435508db465fbb20c80581a1c269f85.tar.bz2
Some improvements related to the computation of heights, depths of SUnits.
The basic idea is that all these algorithms are computing the longest paths from the root node or to the exit node. Therefore the existing implementation that uses and iterative and potentially exponential algorithm was changed to a well-known graph algorithm based on dynamic programming. It has a linear run-time. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47884 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'bindings')
0 files changed, 0 insertions, 0 deletions