| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| remove.c | 55 * If we require W to have space for un + 1 limbs, we could save qp or qp2
57 * If we allow ourselves to clobber U, we could save the other of qp and qp2,
88 mp_ptr tp, qp, np, qp2; local
102 qp2, un + 1, /* quotient, alternating */
114 mpn_bdiv_qr_wrap (qp2, tp, qp, qn + 1, pp, pn);
121 MP_PTR_SWAP (qp, qp2);
160 mpn_bdiv_qr_wrap (qp2, tp, qp, qn + 1, pwpsp[i], pn);
167 MP_PTR_SWAP (qp, qp2);
|
| /src/external/mit/isl/dist/ |
| isl_fold.c | 663 * "better" is the sign that the difference qp1 - qp2 needs to have for qp1
664 * to be covered by qp2.
680 isl_qpolynomial *qp1, *qp2, *d; local
685 qp2 = isl_qpolynomial_list_peek(list2, i);
686 equal = isl_qpolynomial_plain_is_equal(qp1, qp2);
693 isl_qpolynomial_copy(qp2));
767 /* isl_qpolynomial_list_map callback for adding "qp2" to "qp".
772 isl_qpolynomial *qp2 = user; local
774 return isl_qpolynomial_add(qp, isl_qpolynomial_copy(qp2));
1312 isl_qpolynomial *qp1, *qp2; local
1334 isl_qpolynomial *qp1, *qp2; local
1521 isl_qpolynomial *qp1, *qp2, *d; local
[all...] |
| isl_polynomial.c | 1795 __isl_take isl_qpolynomial *qp2),
1796 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1804 qp2 = isl_qpolynomial_cow(qp2);
1806 if (!qp1 || !qp2)
1809 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1810 qp1->div->n_col >= qp2->div->n_col, goto error);
1813 n_div2 = qp2->div->n_row;
1815 exp2 = isl_alloc_array(qp2->div->ctx, int, n_div2);
1819 div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2)
1844 isl_qpolynomial_free(qp2); variable
[all...] |
