Tobias Grosser 808cd69a92 Use schedule trees to represent execution order of statements ... Instead of flat schedules, we now use so-called schedule trees to represent the execution order of the statements in a SCoP. Schedule trees make it a lot easier to analyze, understand and modify properties of a schedule, as specific nodes in the tree can be choosen and possibly replaced. This patch does not yet fully move our DependenceInfo pass to schedule trees, as some additional performance analysis is needed here. (In general schedule trees should be faster in compile-time, as the more structured representation is generally easier to analyze and work with). We also can not yet perform the reduction analysis on schedule trees. For more information regarding schedule trees, please see Section 6 of https://lirias.kuleuven.be/handle/123456789/497238 llvm-svn: 242130		2015-07-14 09:33:13 +00:00
..
chained_iterations.ll	Use schedule trees to represent execution order of statements	2015-07-14 09:33:13 +00:00
chained_iterations_2.ll	Use schedule trees to represent execution order of statements	2015-07-14 09:33:13 +00:00
computeout.ll	Use schedule trees to represent execution order of statements	2015-07-14 09:33:13 +00:00
dead_iteration_elimination.ll	Use schedule trees to represent execution order of statements	2015-07-14 09:33:13 +00:00
non-affine-affine-mix.ll	Use schedule trees to represent execution order of statements	2015-07-14 09:33:13 +00:00
non-affine.ll	Replace srem by function call in nonaffine test cases	2015-06-23 20:55:05 +00:00
null_schedule.ll	Use schedule trees to represent execution order of statements	2015-07-14 09:33:13 +00:00