| /src/external/mit/isl/dist/ |
| isl_affine_hull.c | 569 * construct an initial affine hull containing the recession cone
615 * recession cone, detect and add all equalities to the tableau.
699 /* Compute the affine hull of "bset", where "cone" is the recession cone
731 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *cone)
738 total = isl_basic_set_dim(cone, isl_dim_all);
742 cone_dim = total - cone->n_eq;
744 M = isl_mat_sub_alloc6(bset->ctx, cone->eq, 0, cone->n_eq, 1, total);
783 isl_basic_set_free(cone);
811 struct isl_basic_set *cone; local
[all...] |
| isl_sample.c | 753 /* Given a linear cone "cone" and a rational point "vec",
754 * construct a polyhedron with shifted copies of the constraints in "cone",
755 * i.e., a polyhedron with "cone" as its recession cone, such that each
757 * lies entirely inside the affine cone 'vec + cone'.
759 * to yield an integer point that lies inside said affine cone.
761 * Denote the constraints of cone by "<a_i, x> >= 0" and the rational
763 * Let b_i = <a_i, v>. Then the affine cone 'vec + cone' is give
1133 struct isl_basic_set *cone; local
[all...] |
| isl_tab.h | 181 unsigned cone : 1; member in struct:isl_tab
|
| isl_tab_pip.c | 2910 struct isl_tab *cone; member in struct:isl_context_gbr
3022 struct isl_basic_set *cone; local
3037 if (!cgbr->cone) {
3039 cgbr->cone = isl_tab_from_recession_cone(bset, 0);
3040 if (!cgbr->cone)
3042 if (isl_tab_track_bset(cgbr->cone,
3046 if (isl_tab_detect_implicit_equalities(cgbr->cone) < 0)
3049 if (cgbr->cone->n_dead == cgbr->cone->n_col) {
3074 cone = isl_basic_set_dup(isl_tab_peek_bset(cgbr->cone))
[all...] |
| isl_test.c | 1358 const char *cone; member in struct:__anon23689
1375 isl_basic_set *cone, *expected; local
1380 str = recession_cone_tests[i].cone;
1382 cone = isl_basic_set_recession_cone(bset);
1383 equal = isl_basic_set_is_equal(cone, expected);
1384 isl_basic_set_free(cone);
1389 isl_die(ctx, isl_error_unknown, "unexpected cone",
10949 { "recession cone", &test_recession_cone },
|
