forked from OSchip/llvm-project
b241d928bd
Schedule trees are a lot easier to work with, for both humans and machines. For humans the more structured schedule representation is easier to reason about. Together with the more abstract isl programming interface this can result in a lot cleaner code (see this changeset). For machines, the structured schedule and the fact that we now use explicit piecewise affine expressions instead of integer maps makes it easier to generate code from this schedule tree. As a result, we can already see a slight compile-time improvement -- for 3mm from 0m0.593s to 0m0.551s seconds (-7 %). More importantly, future optimizations such as full-partial tile separation will most likely result in more streamlined code to be generated. Contributed-by: Roman Gareev <gareevroman@gmail.com> llvm-svn: 243458 |
||
|---|---|---|
| .. | ||
| Canonicalization.cpp | ||
| CodePreparation.cpp | ||
| DeadCodeElimination.cpp | ||
| IndependentBlocks.cpp | ||
| ScheduleOptimizer.cpp | ||