HomeSort by: relevance | last modified time | path
    Searched refs:bset1 (Results 1 - 7 of 7) sorted by relevancy

  /src/external/mit/isl/dist/
isl_affine_hull.c 75 struct isl_basic_set *bset1, struct isl_basic_set *bset2,
80 if (isl_int_eq(bset1->eq[row][col], bset2->eq[row][col]))
85 isl_int_lcm(m, bset1->eq[row][col], bset2->eq[row][col]);
86 isl_int_divexact(c, m, bset1->eq[row][col]);
87 isl_seq_scale(bset1->eq[row], bset1->eq[row], c, col+1);
108 /* Make first row entries in column col of bset1 identical to
109 * those of bset2, using the fact that entry bset1->eq[row][col]=a
110 * is non-zero. Initially, these elements of bset1 are all zero.
118 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2
    [all...]
isl_convex_hull.c 745 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
752 dim = isl_basic_set_dim(bset1, isl_dim_set);
756 hull = isl_basic_set_alloc(bset1->ctx, 0, 2 + 3 * dim, 0,
757 1 + dim + bset1->n_eq + bset2->n_eq,
758 2 + bset1->n_ineq + bset2->n_ineq);
759 bset[0] = bset1;
798 isl_basic_set_free(bset1);
802 isl_basic_set_free(bset1);
865 /* Compute the lineality space of the convex hull of bset1 and bset2.
867 * We first compute the intersection of the recession cone of bset1
1438 isl_basic_set *bset1, *bset2; local
    [all...]
isl_test.c 550 isl_basic_set *bset1, *bset2; local
559 bset1 = isl_basic_set_read_from_file(ctx, input);
562 equal = isl_basic_set_is_equal(bset1, bset2);
564 isl_basic_set_free(bset1);
655 isl_basic_set *bset1, *bset2; local
659 bset1 = isl_basic_set_universe(space);
660 bset1 = isl_basic_set_upper_bound_val(bset1, isl_dim_set, 0,
662 bset1 = isl_basic_set_lower_bound_val(bset1, isl_dim_set, 0
1296 struct isl_basic_set *bset1, *bset2; local
1332 struct isl_basic_set *bset1, *bset2; local
1624 struct isl_basic_set *bset1, *bset2; local
1965 isl_basic_set *bset1, *bset2; local
2464 isl_basic_set *bset1, *bset2; local
3212 isl_basic_set *bset1, *bset2; local
4353 isl_basic_set *bset1, *bset2; local
8812 isl_basic_set *bset1, *bset2; local
9082 isl_basic_set *bset1, *bset2; local
9186 isl_basic_set *bset1, *bset2; local
10618 isl_basic_set *bset1, *bset2; local
10635 isl_basic_set *bset1, *bset2; local
    [all...]
isl_map.c 3774 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
3776 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1),
3781 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
3783 return isl_basic_set_intersect(bset1, bset2);
9194 isl_bool isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
9197 return isl_basic_map_is_subset(bset1, bset2);
9214 isl_bool isl_basic_set_is_equal(__isl_keep isl_basic_set *bset1,
9218 bset_to_bmap(bset1), bset_to_bmap(bset2));
9260 /* Check that "bset1" and "bset2" live in the same space,
9263 isl_stat isl_basic_set_check_equal_space(__isl_keep isl_basic_set *bset1,
    [all...]
isl_map_private.h 572 isl_stat isl_basic_set_check_equal_space(__isl_keep isl_basic_set *bset1,
isl_map_simplify.c 3875 int isl_basic_set_plain_is_disjoint(__isl_keep isl_basic_set *bset1,
3878 return isl_basic_map_plain_is_disjoint(bset_to_bmap(bset1),
4069 /* Are "bset1" and "bset2" disjoint?
4071 isl_bool isl_basic_set_is_disjoint(__isl_keep isl_basic_set *bset1,
4074 return isl_basic_map_is_disjoint(bset1, bset2);
  /src/external/mit/isl/dist/include/isl/
set.h 110 __isl_take isl_basic_set *bset1,
114 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2);
191 isl_bool isl_basic_set_is_equal(__isl_keep isl_basic_set *bset1,
193 isl_bool isl_basic_set_is_disjoint(__isl_keep isl_basic_set *bset1,
235 __isl_take isl_basic_set *bset1,
238 int isl_basic_set_compare_at(__isl_keep isl_basic_set *bset1,
271 isl_bool isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
273 isl_bool isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
324 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2);

Completed in 28 milliseconds