| commit | b902aa05d78d33e37e4c54ea9732445fc7685ef4 | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Tue, 12 May 2015 09:20:56 +0000 (12 11:20 +0200) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Tue, 12 May 2015 10:19:51 +0000 (12 12:19 +0200) | ||
| tree | 936baee51047662e8b38f7bc000ce612ea29177c | treesnapshot (tar.gz zip) |
| parent | eaccc42c829a125a0f32c7f6ed74013f4883cb66 | commitdiff |
isl_schedule_constraints_compute_schedule: strongly satisfy dependences
The core scheduling algorithm only ensures that dependences are weakly
satisfied. In particular, instances of different statements may
still be mapped together. These statements are therefore separated
apart in a final step by sorting them according to the remaining
dependences. In some pathological cases, however, different dependences
may impose a different order on the statements.
In such cases, we add an extra schedule row to carry at least one
more dependence.
Reported-by: Tobias Grosser <tobias@grosser.es>
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
The core scheduling algorithm only ensures that dependences are weakly
satisfied. In particular, instances of different statements may
still be mapped together. These statements are therefore separated
apart in a final step by sorting them according to the remaining
dependences. In some pathological cases, however, different dependences
may impose a different order on the statements.
In such cases, we add an extra schedule row to carry at least one
more dependence.
Reported-by: Tobias Grosser <tobias@grosser.es>
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| isl_scheduler.c | diffblobblamehistory | |
| isl_test.c | diffblobblamehistory |