Go to file
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
clang Include clang-check as part of the clang installation. 2012-07-31 20:29:59 +00:00
compiler-rt First tiny move towards integrating AddressSanitizer regressions test into LLVM lit-based testing infrastructure. 2012-07-31 15:43:11 +00:00
debuginfo-tests Fix this for gdb 7.4. 2012-07-23 19:41:58 +00:00
libclc configure.py: Add an install rule. 2012-06-01 17:29:59 +00:00
libcxx Despite my pathological distrust of spin locks, the number just don't lie. I've put a small spin in __sp_mut::lock() on std::mutex::try_lock(), which is testing quite well. In my experience, putting in a yield for every failed iteration is also a major performance booster. This change makes one of the performance tests I was using (a highly contended one) run about 20 times faster. 2012-07-30 17:13:21 +00:00
libcxxabi Andrew Morrow: Mainline clang seems to have recently become more strict about the 2012-07-29 20:41:19 +00:00
lld Hook up lld-test to llvm check-all. Patch by Andy Gibbs! 2012-07-31 18:44:52 +00:00
lldb <rdar://problem/11862570> Fixing a potential crasher related to Python locking 2012-07-31 16:58:12 +00:00
llvm Compute instruction depths through the current trace. 2012-07-31 20:44:38 +00:00
polly Create a new directory before running the polly script 2012-07-24 16:58:57 +00:00