Jakob Stoklund Olesen 059e647c6d Compute instruction depths through the current trace. ...

Assuming infinite issue width, compute the earliest each instruction in
the trace can issue, when considering the latency of data dependencies.
The issue cycle is record as a 'depth' from the beginning of the trace.

This is half the computation required to find the length of the critical
path through the trace. Heights are next.

llvm-svn: 161074

2012-07-31 20:44:38 +00:00

28 KiB

Raw Blame History

View Raw