Jakob Stoklund Olesen 5f8e8bd656 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.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@161074 91177308-0d34-0410-b5e6-96231b3b80d8
2012-07-31 20:44:38 +00:00
..
2012-07-19 00:15:11 +00:00
2012-07-19 21:43:55 +00:00
2012-07-27 21:41:59 +00:00