reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1603 for (i = 0; i < set->n; ++i) 1603 for (i = 0; i < set->n; ++i) 1603 for (i = 0; i < set->n; ++i) 1604 if (set->p[i]->n_eq == 0) 1606 if (i >= set->n) 1608 min_constraints = set->p[i]->n_ineq; 1609 best = i; 1610 for (i = best + 1; i < set->n; ++i) { 1610 for (i = best + 1; i < set->n; ++i) { 1610 for (i = best + 1; i < set->n; ++i) { 1611 if (set->p[i]->n_eq != 0) 1613 if (set->p[i]->n_ineq >= min_constraints) 1615 min_constraints = set->p[i]->n_ineq; 1616 best = i; 1627 for (i = 0; i < set->p[best]->n_ineq; ++i) { 1627 for (i = 0; i < set->p[best]->n_ineq; ++i) { 1627 for (i = 0; i < set->p[best]->n_ineq; ++i) { 1628 constraints[i].c = isl_mat_sub_alloc6(hull->ctx, 1629 set->p[best]->ineq + i, 0, 1, 0, 1 + total); 1630 if (!constraints[i].c) 1632 constraints[i].ineq = 1; 1634 for (i = 0; i < min_constraints; ++i) { 1634 for (i = 0; i < min_constraints; ++i) { 1634 for (i = 0; i < min_constraints; ++i) { 1637 c_hash = isl_seq_get_hash(constraints[i].c->row[0] + 1, total); 1639 max_constraint_equal, constraints[i].c->row[0] + 1, 1); 1643 entry->data = &constraints[i]; 1651 for (i = 0; i < set->p[s]->n_eq; ++i) { 1651 for (i = 0; i < set->p[s]->n_eq; ++i) { 1651 for (i = 0; i < set->p[s]->n_eq; ++i) { 1652 isl_int *eq = set->p[s]->eq[i]; 1659 for (i = 0; i < set->p[s]->n_ineq; ++i) { 1659 for (i = 0; i < set->p[s]->n_ineq; ++i) { 1659 for (i = 0; i < set->p[s]->n_ineq; ++i) { 1660 isl_int *ineq = set->p[s]->ineq[i]; 1667 for (i = 0; i < min_constraints; ++i) { 1667 for (i = 0; i < min_constraints; ++i) { 1667 for (i = 0; i < min_constraints; ++i) { 1668 if (constraints[i].count < n) 1670 if (!constraints[i].ineq) 1675 isl_seq_cpy(hull->ineq[j], constraints[i].c->row[0], 1 + total); 1683 for (i = 0; i < set->p[s]->n_ineq; ++i) { 1683 for (i = 0; i < set->p[s]->n_ineq; ++i) { 1683 for (i = 0; i < set->p[s]->n_ineq; ++i) { 1684 isl_int *ineq = set->p[s]->ineq[i]; 1688 if (i == set->p[s]->n_ineq) 1693 for (i = 0; i < min_constraints; ++i) 1693 for (i = 0; i < min_constraints; ++i) 1693 for (i = 0; i < min_constraints; ++i) 1694 isl_mat_free(constraints[i].c); 1702 for (i = 0; i < min_constraints; ++i) 1702 for (i = 0; i < min_constraints; ++i) 1702 for (i = 0; i < min_constraints; ++i) 1703 isl_mat_free(constraints[i].c);