[llvm-commits] Patch for review: Speeding up ScheduleDAG computations

[Roman Levenstein]

Hi,

I've implemented some improvements related to the computation of
heights, depths and priorities and latencies 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 I changed the
existing implementation that uses and iterative and potentially
exponential algorithm to a well-known graph algorithm based on dynamic
programming. It has a linear run-time.

Tests on very big  input files with tens of thousends of instructions
in a BB, e.g. big4.bc use-case from Duraid's testsuit, indicate huge
speed-ups (up to 2x) compared to the current version,

Please review and tell if it is OK for submission.
- Roman
-------------- next part --------------
A non-text attachment was scrubbed...
Name: ScheduleDAG.patch
Type: text/x-diff
Size: 7616 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20080228/1db8a052/attachment.patch>