HomeSort by: relevance | last modified time | path
    Searched refs:n_con (Results 1 - 8 of 8) sorted by relevancy

  /src/external/mit/isl/dist/
isl_tab.c 69 tab->n_con = 0;
114 if (tab->max_con < tab->n_con + n_new) {
247 for (i = 0; i < tab->n_con; ++i)
279 dup->n_con = tab->n_con;
485 for (i = 0; i < tab1->n_con; ++i) {
489 for (i = 0; i < tab2->n_con; ++i) {
490 prod->con[tab1->n_con + i] = tab2->con[i];
491 update_index2(&prod->con[tab1->n_con + i],
509 t -= tab1->n_con;
    [all...]
isl_tab.h 147 unsigned n_con; member in struct:isl_tab
isl_map_subtract.c 230 for (i = 0; i < tab->n_con; ++i)
245 int n_test = tab->n_con - offset;
389 offset = tab->n_con;
isl_vertices.c 677 for (i = 0; i < tab->n_con && tab->con[i].frozen; ++i)
752 for (i = 0; i < tab->n_con && tab->con[i].frozen; ++i)
803 for (i = 0; i < tab->n_con; ++i) {
861 for (i = 0; i < tab->n_con; ++i) {
987 if (isl_tab_freeze_constraint(tab, tab->n_con - 1) < 0)
basis_reduction_tab.c 164 lp->con_offset = lp->tab->n_con;
isl_coalesce.c 3012 n_ineq = tab->n_con - tab->n_eq;
3092 isl_tab_select_facet(info->tab, info->tab->n_con - 1) < 0)
3144 if (info->bmap->n_eq + info->bmap->n_ineq != info->tab->n_con)
3161 n_ineq = info->tab->n_con - info->tab->n_eq;
isl_sample.c 174 for (i = 0, j = 0; i < tab->n_con; ++i) {
isl_tab_pip.c 2481 var = &context_tab->con[context_tab->n_con - 1];
2767 var = &context_tab->con[context_tab->n_con - 1];

Completed in 21 milliseconds