Searched refs:n_zero (Results 1 – 6 of 6) sorted by relevance
90 if (n_bounded <= tab->n_zero + 1) in isl_tab_compute_reduced_basis()131 i = tab->n_zero; in isl_tab_compute_reduced_basis()146 tab->n_zero++; in isl_tab_compute_reduced_basis()150 if (i+1 == tab->n_zero) { in isl_tab_compute_reduced_basis()218 if (i+1 == tab->n_zero && fixed) { in isl_tab_compute_reduced_basis()225 tab->n_zero++; in isl_tab_compute_reduced_basis()238 if (i > tab->n_zero) { in isl_tab_compute_reduced_basis()246 GBR_set(F[tab->n_zero], F_new); in isl_tab_compute_reduced_basis()247 if (gbr_only_first && GBR_lt(F[tab->n_zero], two)) in isl_tab_compute_reduced_basis()251 if (!GBR_is_zero(F[tab->n_zero])) { in isl_tab_compute_reduced_basis()[all …]
207 tab->n_zero = n_eq = tab->n_var - tab->n_col + tab->n_dead; in initial_basis()472 tab->n_zero = level; in isl_tab_sample()1106 tab->n_zero = eq->n_row; in isl_tab_set_initial_basis_with_cone()1111 tab->n_unbounded = tab->n_var - (eq->n_row - tab->n_zero); in isl_tab_set_initial_basis_with_cone()
167 int n_zero; member
3058 cgbr->tab->n_zero = 0; in gbr_get_sample()5140 __isl_keep isl_vec *sol, int n_op, int n_zero) in force_better_solution() argument5149 for (i = n_zero; i < n_op; ++i) in force_better_solution()5165 for (; i >= n_zero; --i) { in force_better_solution()5252 int n_zero; member5311 local->n_zero = 0; in init_local_region()5424 local->n_zero = force_better_solution(data->tab, in better_next_side()5425 data->sol, data->n_op, local->n_zero); in better_next_side()5426 if (local->n_zero < 0) in better_next_side()
90 tab->n_zero = 0; in isl_tab_alloc()300 dup->n_zero = tab->n_zero; in isl_tab_dup()553 prod->n_zero = 0; in isl_tab_product()
682 if (hull->n_eq > tab->n_zero) { in isl_tab_detect_equalities()