Home
last modified time | relevance | path

Searched refs:isl_tab_is_redundant (Results 1 – 6 of 6) sorted by relevance

/netbsd-src/external/mit/isl/dist/
H A Disl_tab.h224 int isl_tab_is_redundant(struct isl_tab *tab, int con);
H A Disl_coalesce.c112 if (tab_i && isl_tab_is_redundant(tab_i, n_eq + k)) { in ineq_status_in()
484 if (!isl_tab_is_redundant(tab, bmap->n_eq + k)) in number_of_constraints_increases()
1134 if (!isl_tab_is_redundant(info[i].tab, n_eq + relax[l])) in is_relaxed_extension()
1366 if (isl_tab_is_redundant(info->tab, bmap->n_eq + l)) in add_selected_wraps()
1500 red = isl_tab_is_redundant(info->tab, n_eq + l); in has_redundant_cuts()
3191 if (isl_tab_is_redundant(info->tab, n_eq + i)) in tab_insert_divs()
H A Disl_vertices.c277 if (isl_tab_is_redundant(tab, level)) in can_select()
306 else if (isl_tab_is_redundant(tab, i)) in can_select()
H A Disl_map_subtract.c259 r = isl_tab_is_redundant(tab, offset + i); in n_non_redundant()
H A Disl_tab.c2642 else if (isl_tab_is_redundant(tab, n_eq + i)) in isl_basic_map_update_from_tab()
3425 int isl_tab_is_redundant(struct isl_tab *tab, int con) in isl_tab_is_redundant() function
H A Disl_map_simplify.c2468 } else if (isl_tab_is_redundant(tab, n_eq + row[i])) { in update_ineq()