Searched refs:div_pos (Results 1 – 4 of 4) sorted by relevance
/external/llvm-project/polly/lib/External/isl/ |
D | isl_polynomial.c | 1501 isl_size div_pos; in sort_divs() local 1508 div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div); in sort_divs() 1509 if (div_pos < 0) in sort_divs() 1531 for (i = 0; i < div_pos; ++i) in sort_divs() 1545 for (i = 0; i < len - div_pos; ++i) { in sort_divs() 1550 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1, in sort_divs() 1551 2 + div_pos + i - skip); in sort_divs() 1553 2 + div_pos + i - skip, 1); in sort_divs() 1556 reordering[div_pos + array[i].row] = div_pos + i - skip; in sort_divs() 2380 isl_size div_pos; in substitute_div() local [all …]
|
D | isl_output.c | 688 __isl_keep isl_mat *div, unsigned div_pos, in print_eq_mod_constraint() argument 695 isl_int_divexact(c[last], c[last], div->row[div_pos][0]); in print_eq_mod_constraint() 702 p = print_mod(p, space, div, div_pos, latex); in print_eq_mod_constraint() 707 c[last], div->row[div_pos] + 1, last); in print_eq_mod_constraint() 725 isl_size div_pos; in print_eq_constraint() local 728 div_pos = print_as_modulo_pos(p, space, div, last, c[last]); in print_eq_constraint() 729 if (n_div < 0 || div_pos < 0) in print_eq_constraint() 731 if (div_pos < n_div) in print_eq_constraint() 732 return print_eq_mod_constraint(p, space, div, div_pos, in print_eq_constraint()
|
D | isl_tab.c | 2215 unsigned div_pos; in ineq_for_div() local 2222 div_pos = 1 + total - bmap->n_div + div; in ineq_for_div() 2229 isl_int_neg(ineq->el[div_pos], bmap->div[div][0]); in ineq_for_div() 2252 unsigned div_pos; in add_div_constraints() local 2258 div_pos = 1 + total - tab->bmap->n_div + div; in add_div_constraints() 2273 isl_int_set(ineq->el[div_pos], tab->bmap->div[div][0]); in add_div_constraints() 2274 isl_int_add(ineq->el[0], ineq->el[0], ineq->el[div_pos]); in add_div_constraints()
|
D | isl_tab_pip.c | 1013 unsigned div_pos; in ineq_for_div() local 1020 div_pos = 1 + total - bset->n_div + div; in ineq_for_div() 1027 isl_int_neg(ineq->el[div_pos], bset->div[div][0]); in ineq_for_div()
|