• Home
  • Raw
  • Download

Lines Matching refs:fold2

437 	__isl_take isl_qpolynomial_fold *fold2)  in isl_qpolynomial_fold_fold_on_domain()  argument
444 if (!fold1 || !fold2) in isl_qpolynomial_fold_fold_on_domain()
447 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error); in isl_qpolynomial_fold_fold_on_domain()
448 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim), in isl_qpolynomial_fold_fold_on_domain()
454 isl_qpolynomial_fold_is_nan(fold2)) { in isl_qpolynomial_fold_fold_on_domain()
456 return fold2; in isl_qpolynomial_fold_fold_on_domain()
459 if (isl_qpolynomial_fold_is_empty(fold2) || in isl_qpolynomial_fold_fold_on_domain()
461 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_fold_on_domain()
466 fold1->n + fold2->n); in isl_qpolynomial_fold_fold_on_domain()
478 for (i = 0; i < fold2->n; ++i) { in isl_qpolynomial_fold_fold_on_domain()
483 fold2->qp[i]); in isl_qpolynomial_fold_fold_on_domain()
490 isl_qpolynomial_copy(fold2->qp[i])); in isl_qpolynomial_fold_fold_on_domain()
507 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]); in isl_qpolynomial_fold_fold_on_domain()
514 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_fold_on_domain()
520 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_fold_on_domain()
559 __isl_take isl_qpolynomial_fold *fold2) in isl_qpolynomial_fold_add_on_domain() argument
564 if (!fold1 || !fold2) in isl_qpolynomial_fold_add_on_domain()
569 return fold2; in isl_qpolynomial_fold_add_on_domain()
572 if (isl_qpolynomial_fold_is_empty(fold2)) { in isl_qpolynomial_fold_add_on_domain()
573 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_add_on_domain()
577 if (fold1->n == 1 && fold2->n != 1) in isl_qpolynomial_fold_add_on_domain()
578 return isl_qpolynomial_fold_add_on_domain(dom, fold2, fold1); in isl_qpolynomial_fold_add_on_domain()
580 if (fold2->n == 1) { in isl_qpolynomial_fold_add_on_domain()
582 isl_qpolynomial_copy(fold2->qp[0])); in isl_qpolynomial_fold_add_on_domain()
583 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_add_on_domain()
589 isl_qpolynomial_copy(fold2->qp[0])); in isl_qpolynomial_fold_add_on_domain()
591 for (i = 1; i < fold2->n; ++i) { in isl_qpolynomial_fold_add_on_domain()
595 isl_qpolynomial_copy(fold2->qp[i])); in isl_qpolynomial_fold_add_on_domain()
600 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_add_on_domain()
605 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_add_on_domain()
833 __isl_take isl_qpolynomial_fold *fold2) in isl_qpolynomial_fold_fold() argument
838 if (!fold1 || !fold2) in isl_qpolynomial_fold_fold()
841 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error); in isl_qpolynomial_fold_fold()
842 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim), in isl_qpolynomial_fold_fold()
847 return fold2; in isl_qpolynomial_fold_fold()
850 if (isl_qpolynomial_fold_is_empty(fold2)) { in isl_qpolynomial_fold_fold()
851 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_fold()
856 fold1->n + fold2->n); in isl_qpolynomial_fold_fold()
867 for (i = 0; i < fold2->n; ++i) { in isl_qpolynomial_fold_fold()
868 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]); in isl_qpolynomial_fold_fold()
875 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_fold()
881 isl_qpolynomial_fold_free(fold2); in isl_qpolynomial_fold_fold()
1060 __isl_keep isl_qpolynomial_fold *fold2) in isl_qpolynomial_fold_plain_cmp() argument
1064 if (fold1 == fold2) in isl_qpolynomial_fold_plain_cmp()
1068 if (!fold2) in isl_qpolynomial_fold_plain_cmp()
1071 if (fold1->n != fold2->n) in isl_qpolynomial_fold_plain_cmp()
1072 return fold1->n - fold2->n; in isl_qpolynomial_fold_plain_cmp()
1077 cmp = isl_qpolynomial_plain_cmp(fold1->qp[i], fold2->qp[i]); in isl_qpolynomial_fold_plain_cmp()
1086 __isl_keep isl_qpolynomial_fold *fold2) in isl_qpolynomial_fold_plain_is_equal() argument
1090 if (!fold1 || !fold2) in isl_qpolynomial_fold_plain_is_equal()
1093 if (fold1->n != fold2->n) in isl_qpolynomial_fold_plain_is_equal()
1098 int eq = isl_qpolynomial_plain_is_equal(fold1->qp[i], fold2->qp[i]); in isl_qpolynomial_fold_plain_is_equal()
1202 __isl_keep isl_qpolynomial_fold *fold2) in qpolynomial_fold_covers_on_domain() argument
1207 if (!set || !fold1 || !fold2) in qpolynomial_fold_covers_on_domain()
1212 for (i = 0; i < fold2->n; ++i) { in qpolynomial_fold_covers_on_domain()
1219 isl_qpolynomial_copy(fold2->qp[i])); in qpolynomial_fold_covers_on_domain()