Home
last modified time | relevance | path

Searched refs:div_pos (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_polynomial.c1506 isl_size div_pos; in sort_divs() local
1514 if (div_pos < 0) in sort_divs()
1561 reordering[div_pos + array[i].row] = div_pos + i - skip; in sort_divs()
2397 if (div_pos < 0) in substitute_div()
2409 for (i = div_pos + div + 1; i < div_pos + qp->div->n_row; ++i) in substitute_div()
2438 if (div_pos < 0) in substitute_non_divs()
2779 if (div_pos < 0) in remove_redundant_divs()
2824 reordering[div_pos + i] = div_pos + i - skip; in remove_redundant_divs()
4584 if (div_pos < 0) in set_div()
4657 if (div_pos < 0) in split_periods()
[all …]
H A Disl_output.c688 __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()
H A Disl_tab.c2204 unsigned div_pos; in ineq_for_div() local
2211 div_pos = 1 + total - bmap->n_div + div; in ineq_for_div()
2218 isl_int_neg(ineq->el[div_pos], bmap->div[div][0]); in ineq_for_div()
2241 unsigned div_pos; in add_div_constraints() local
2247 div_pos = 1 + total - tab->bmap->n_div + div; in add_div_constraints()
2262 isl_int_set(ineq->el[div_pos], tab->bmap->div[div][0]); in add_div_constraints()
2263 isl_int_add(ineq->el[0], ineq->el[0], ineq->el[div_pos]); in add_div_constraints()
H A Disl_tab_pip.c1013 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()