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;
*/
static int extract_node(__isl_take isl_set *set, void *user)
{
- int i;
int nvar, nparam;
isl_ctx *ctx;
isl_dim *dim;
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)
isl_ctx *ctx = isl_map_get_ctx(map);
isl_dim *dim;
isl_dim_map *dim_map;
- isl_set *delta;
isl_basic_set *coef;
struct isl_sched_node *node = edge->src;
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);