isl_union_set_compute_schedule: also keep track of proximity edges in hash table
authorSven Verdoolaege <skimo@kotnet.org>
Fri, 13 Apr 2012 09:32:53 +0000 (11:32 +0200)
committerSven Verdoolaege <skimo@kotnet.org>
Sun, 6 May 2012 12:33:06 +0000 (14:33 +0200)
commitd5ed563c9e82960af5fcddab2b37865ad988b378
tree6b349723c1da7ec0122c802a2f30db48e9f1aa1d
parentca385b4e1039fc750850c5b897054b74e529252f
isl_union_set_compute_schedule: also keep track of proximity edges in hash table

We don't use this additional hash table yet, but we will need it the next
commit. A separate hash table is needed because the entries are keyed
by the source and destination node, so there can be only one edge
between a given pair of nodes in a single table.

Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
isl_schedule.c