return 0;
edge = entry->data;
- empty = isl_map_fast_is_empty(edge->map);
+ empty = isl_map_plain_is_empty(edge->map);
if (empty < 0)
return -1;
if (!entry)
return 0;
edge = entry->data;
- is_equal = isl_map_fast_is_equal(map, edge->map);
+ is_equal = isl_map_plain_is_equal(map, edge->map);
if (is_equal < 0)
return -1;
if (!is_equal)
if (!edge->map)
return -1;
- if (isl_map_fast_is_empty(edge->map)) {
+ if (isl_map_plain_is_empty(edge->map)) {
reset_table = 1;
isl_map_free(edge->map);
if (i != graph->n_edge - 1)
if (!edge_pred(edge, data))
continue;
- if (isl_map_fast_is_empty(edge->map))
+ if (isl_map_plain_is_empty(edge->map))
continue;
map = isl_map_copy(edge->map);