Andrew Trick 8b1496c922 misched: Analysis that partitions the DAG into subtrees.
This is a simple, cheap infrastructure for analyzing the shape of a
DAG. It recognizes uniform DAGs that take the shape of bottom-up
subtrees, such as the included matrix multiplication example. This is
useful for heuristics that balance register pressure with ILP. Two
canonical expressions of the heuristic are implemented in scheduling
modes: -misched-ilpmin and -misched-ilpmax.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@168773 91177308-0d34-0410-b5e6-96231b3b80d8
2012-11-28 05:13:28 +00:00
..
2012-11-16 21:33:35 +00:00
2012-11-20 18:37:40 +00:00
2012-10-08 23:14:28 +00:00
2012-10-11 23:30:49 +00:00
2012-10-11 23:30:49 +00:00
2012-11-17 17:59:44 +00:00
2012-11-20 00:15:36 +00:00
2012-10-11 23:30:49 +00:00
2012-10-11 23:30:49 +00:00
2012-10-11 23:30:49 +00:00
2012-10-15 04:46:55 +00:00
2012-08-17 06:36:26 +00:00
2012-10-31 09:50:01 +00:00
2012-10-11 23:30:49 +00:00
2012-11-27 17:39:20 +00:00
2012-10-11 23:30:49 +00:00
2012-10-11 23:30:49 +00:00