[llvm-commits] Patch for review: Speeding up ScheduleDAG computations
isanbard at gmail.com
Thu Feb 28 11:38:25 PST 2008
On Thu, Feb 28, 2008 at 6:15 AM, Roman Levenstein
<romix.llvm at googlemail.com> wrote:
> 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.
(I haven't looked at the patch yet.) Did you run the llvm-test suite
with your patch?
More information about the llvm-commits