| commit | 5e596b8c2f1d9e99d70ea02252bfe6b9ececbf43 | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Thu, 9 Jan 2014 16:01:21 +0000 (9 17:01 +0100) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Thu, 19 Feb 2015 15:05:33 +0000 (19 16:05 +0100) | ||
| tree | b00ff2bdb4f987561db99960e2250c6ccfbfc444 | treesnapshot (tar.gz zip) |
| parent | 61eb0d5992006704b8e7484e30d9f7975c6ffbe3 | commitdiff |
isl_union_access_info_compute_flow: determine relative order from schedule tree
That is, if the schedule is given as a schedule tree, then use it directly
to determine the relative order of accesses rather than first converting
the schedule to a union map. This allows us to exploit the ordering
information explicitly available in the schedule tree rather than having
to rediscover some of it in the extracted union map.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
That is, if the schedule is given as a schedule tree, then use it directly
to determine the relative order of accesses rather than first converting
the schedule to a union map. This allows us to exploit the ordering
information explicitly available in the schedule tree rather than having
to rediscover some of it in the extracted union map.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| isl_flow.c | diffblobblamehistory |