Andrew Trick ceeb35bbb8 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.

llvm-svn: 168773
2012-11-28 05:13:28 +00:00
..
2012-10-01 16:44:04 +00:00
2012-10-08 16:38:25 +00:00
2010-11-29 18:16:10 +00:00
2010-11-29 18:16:10 +00:00
2010-11-29 18:16:10 +00:00
2009-07-08 21:57:46 +00:00
2012-07-23 08:51:15 +00:00
2012-11-14 19:17:44 +00:00