isl_scheduler.c: extract_edge: do not add edges that turn out to be empty
commit11354e507640f9602f7a4e56f1c92b9996c3e2cd
authorSven Verdoolaege <sven.verdoolaege@gmail.com>
Wed, 13 Sep 2017 12:32:30 +0000 (13 14:32 +0200)
committerSven Verdoolaege <sven.verdoolaege@gmail.com>
Thu, 14 Sep 2017 09:03:22 +0000 (14 11:03 +0200)
tree81210d3b3d10d4c7fb04e2c9166b7ebe82d03303
parent63dfaeb3d3d5030b1bef6b062885dc69e43d34c0
isl_scheduler.c: extract_edge: do not add edges that turn out to be empty

Even though extract_edge should only be called on non-empty
dependence relations, the relation may become empty after
intersection with the constraints used during compression.

Adding an empty edge is not usually a problem because
graph_has_edge will ignore such edges.
However, for edges of types that can appear multiple
times between the same pair of nodes, an empty edge
may shadow a non-empty edge, in which case the non-empty
edge(s) would be ignored.

Refrain from adding empty edges to avoid this potential problem.

Signed-off-by: Sven Verdoolaege <sven.verdoolaege@gmail.com>
isl_scheduler.c