| commit | 757a9321c189e9a13bbe012c5af17423d3773cad | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Wed, 15 Dec 2010 11:55:25 +0000 (15 12:55 +0100) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Wed, 15 Dec 2010 15:31:41 +0000 (15 16:31 +0100) | ||
| tree | 37f1b4bf6b2db91a29f5a493e3d0debaec6c24cb | treesnapshot (tar.gz zip) |
| parent | 7b82e27ff96bdf16483ac97d86adaa7fa86ae15e | commitdiff |
dataflow analysis: allow absence of "textual" order during sorting of sources
When sorting the potential sources, we would implicitly assume
that for any given pair of sources, one always appears before the other
at a certain level. However, for more generic schedules, this may
not necessarily be the case.
To avoid that the results would depend on the order that the accesses
are given in case accesses overlap, we extend the partial order to
a (nearly) total order by taking into account the description of the
sources.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
When sorting the potential sources, we would implicitly assume
that for any given pair of sources, one always appears before the other
at a certain level. However, for more generic schedules, this may
not necessarily be the case.
To avoid that the results would depend on the order that the accesses
are given in case accesses overlap, we extend the partial order to
a (nearly) total order by taking into account the description of the
sources.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| isl_flow.c | diffblobblamehistory |