reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
880 for (i = 0; i < bset->n_ineq; ++i) 880 for (i = 0; i < bset->n_ineq; ++i) 880 for (i = 0; i < bset->n_ineq; ++i) 881 if (isl_tab_freeze_constraint(tab, i) < 0) 889 for (i = 0; i < vertices->n_vertices; ++i) { 889 for (i = 0; i < vertices->n_vertices; ++i) { 889 for (i = 0; i < vertices->n_vertices; ++i) { 890 selection[i] = isl_basic_set_contains(vertices->v[i].dom, sample); 890 selection[i] = isl_basic_set_contains(vertices->v[i].dom, sample); 891 if (selection[i] < 0) 893 if (!selection[i]) 895 selection[i] = can_intersect(tab, vertices->v[i].dom); 895 selection[i] = can_intersect(tab, vertices->v[i].dom); 896 if (selection[i] < 0) 921 for (i = 0; i < vertices->n_vertices; ++i) { 921 for (i = 0; i < vertices->n_vertices; ++i) { 921 for (i = 0; i < vertices->n_vertices; ++i) { 922 selection[i] = bset_covers_tab(vertices->v[i].dom, 922 selection[i] = bset_covers_tab(vertices->v[i].dom, 924 if (selection[i] < 0) 926 if (!selection[i]) 928 selection[i] = can_intersect(tab, vertices->v[i].dom); 928 selection[i] = can_intersect(tab, vertices->v[i].dom); 929 if (selection[i] < 0) 956 for (i = 0; vertices && i < vertices->n_vertices; ++i) { 956 for (i = 0; vertices && i < vertices->n_vertices; ++i) { 956 for (i = 0; vertices && i < vertices->n_vertices; ++i) { 957 isl_basic_set_free(vertices->v[i].dom); 958 vertices->v[i].dom = NULL;