HomeSort by: relevance | last modified time | path
    Searched defs:div_pos (Results 1 - 4 of 4) sorted by relevancy

  /src/external/mit/isl/dist/
isl_output.c 675 * of the corresponding integer division. "div_pos" is the corresponding
688 __isl_keep isl_mat *div, unsigned div_pos,
695 isl_int_divexact(c[last], c[last], div->row[div_pos][0]);
702 p = print_mod(p, space, div, div_pos, latex);
707 c[last], div->row[div_pos] + 1, last);
725 isl_size div_pos; local
728 div_pos = print_as_modulo_pos(p, space, div, last, c[last]);
729 if (n_div < 0 || div_pos < 0)
731 if (div_pos < n_div)
732 return print_eq_mod_constraint(p, space, div, div_pos,
    [all...]
isl_tab.c 2204 unsigned div_pos; local
2211 div_pos = 1 + total - bmap->n_div + div;
2218 isl_int_neg(ineq->el[div_pos], bmap->div[div][0]);
2241 unsigned div_pos; local
2247 div_pos = 1 + total - tab->bmap->n_div + div;
2262 isl_int_set(ineq->el[div_pos], tab->bmap->div[div][0]);
2263 isl_int_add(ineq->el[0], ineq->el[0], ineq->el[div_pos]);
isl_polynomial.c 1674 isl_size div_pos; local
1681 div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
1682 if (div_pos < 0)
1704 for (i = 0; i < div_pos; ++i)
1718 for (i = 0; i < len - div_pos; ++i) {
1723 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1724 2 + div_pos + i - skip);
1726 2 + div_pos + i - skip, 1);
1729 reordering[div_pos + array[i].row] = div_pos + i - skip
2536 isl_size div_pos; local
2585 isl_size div_pos; local
2915 isl_size div_pos; local
4790 isl_size div_pos; local
4856 isl_size div_pos; local
5221 isl_size div_pos; local
    [all...]
isl_tab_pip.c 1039 unsigned div_pos; local
1046 div_pos = 1 + total - bset->n_div + div;
1053 isl_int_neg(ineq->el[div_pos], bset->div[div][0]);

Completed in 27 milliseconds