| commit | 81bf4c25ca428f6f7b0060c00c8d2329da84d7f4 | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Tue, 26 Feb 2013 11:35:16 +0000 (26 12:35 +0100) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Sat, 16 Mar 2013 15:49:57 +0000 (16 16:49 +0100) | ||
| tree | fd5ba5b9345ce290a180a9f793f365719c709b9a | treesnapshot (tar.gz zip) |
| parent | a16b7baa95dc0a2d60db78e7bcabf3a86c436705 | commitdiff |
isl_schedule_get_band_forest: sort bands in band list
In particular if the partial schedule of the parent of a band list
assigns different constant values to the domains of the bands in the list,
then sort the bands according to those constant values.
This should provide for a more "natural" order to the user.
The need for sorting could be avoided entirely if we were to
construct a forest of bands directly from isl_union_set_compute_schedule.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
In particular if the partial schedule of the parent of a band list
assigns different constant values to the domains of the bands in the list,
then sort the bands according to those constant values.
This should provide for a more "natural" order to the user.
The need for sorting could be avoided entirely if we were to
construct a forest of bands directly from isl_union_set_compute_schedule.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| isl_schedule.c | diffblobblamehistory |