Searched refs:cone (Results 1 – 10 of 10) sorted by relevance
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_sample.c | 795 isl_assert(cone->ctx, cone->n_eq == 0, goto error); in shift_cone() 798 0, 0, cone->n_ineq); in shift_cone() 818 isl_basic_set_free(cone); in shift_cone() 824 isl_basic_set_free(cone); in shift_cone() 845 if (!vec || !cone || !U) in round_up_in_cone() 858 cone = isl_basic_set_preimage(cone, U); in round_up_in_cone() 859 cone = isl_basic_set_remove_dims(cone, isl_dim_set, in round_up_in_cone() 862 cone = shift_cone(cone, vec); in round_up_in_cone() 961 M = isl_mat_sub_alloc6(ctx, cone->eq, 0, cone->n_eq, 1, total); in isl_basic_set_sample_with_cone() 1137 if (!cone) in gbr_sample() [all …]
|
| H A D | isl_affine_hull.c | 742 cone_dim = total - cone->n_eq; in affine_hull_with_cone() 744 M = isl_mat_sub_alloc6(bset->ctx, cone->eq, 0, cone->n_eq, 1, total); in affine_hull_with_cone() 783 isl_basic_set_free(cone); in affine_hull_with_cone() 788 isl_basic_set_free(cone); in affine_hull_with_cone() 811 struct isl_basic_set *cone; in uset_affine_hull() local 818 if (!cone) in uset_affine_hull() 820 if (cone->n_eq == 0) { in uset_affine_hull() 823 isl_basic_set_free(cone); in uset_affine_hull() 831 if (cone->n_eq < total) in uset_affine_hull() 832 return affine_hull_with_cone(bset, cone); in uset_affine_hull() [all …]
|
| H A D | isl_tab_pip.c | 3023 if (cgbr->cone->n_dead == cgbr->cone->n_col) { in gbr_get_sample() 3048 cone = isl_basic_set_dup(isl_tab_peek_bset(cgbr->cone)); in gbr_get_sample() 3049 cone = drop_constant_terms(cone); in gbr_get_sample() 3050 cone = isl_basic_set_update_from_tab(cone, cgbr->cone); in gbr_get_sample() 3051 cone = isl_basic_set_underlying_set(cone); in gbr_get_sample() 3052 cone = isl_basic_set_gauss(cone, NULL); in gbr_get_sample() 3130 if (cgbr->cone && cgbr->cone->n_col != cgbr->cone->n_dead) { in context_gbr_add_eq() 3189 if (cgbr->cone && cgbr->cone->n_col != cgbr->cone->n_dead) { in add_gbr_ineq() 3260 if (cgbr->cone) in context_gbr_test_ineq() 3453 cgbr->cone->bmap = isl_basic_map_insert_div(cgbr->cone->bmap, in context_gbr_insert_div() [all …]
|
| H A D | isl_sample.h | 24 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *cone);
|
| H A D | isl_tab.c | 85 tab->cone = 0; in isl_tab_alloc() 295 dup->cone = tab->cone; in isl_tab_dup() 446 isl_assert(tab1->mat->ctx, tab1->cone == tab2->cone, return NULL); in isl_tab_product() 548 prod->cone = tab1->cone; in isl_tab_product() 1918 if (tab->cone) { in isl_tab_add_ineq() 1924 if (tab->cone) { in isl_tab_add_ineq() 2124 if (tab->cone) { in isl_tab_add_eq() 2130 if (tab->cone) { in isl_tab_add_eq() 2451 tab->cone = 1; in isl_tab_from_recession_cone()
|
| H A D | isl_tab.h | 180 unsigned cone : 1; member
|
| H A D | isl_test.c | 1326 const char *cone; member 1343 isl_basic_set *cone, *expected; in test_recession_cone() local 1348 str = recession_cone_tests[i].cone; in test_recession_cone() 1350 cone = isl_basic_set_recession_cone(bset); in test_recession_cone() 1351 equal = isl_basic_set_is_equal(cone, expected); in test_recession_cone() 1352 isl_basic_set_free(cone); in test_recession_cone()
|
| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | IntegerRelation.cpp | 815 IntegerRelation &cone = transformedSet; in findIntegerSample() local 842 for (unsigned i = 0, e = cone.getNumInequalities(); i < e; ++i) { in findIntegerSample() 843 for (unsigned j = 0; j < cone.getNumVars(); ++j) { in findIntegerSample() 844 int64_t coeff = cone.atIneq(i, j); in findIntegerSample() 846 cone.atIneq(i, cone.getNumVars()) += coeff; in findIntegerSample() 854 Simplex shrunkenConeSimplex(cone); in findIntegerSample()
|
| /llvm-project-15.0.7/polly/lib/External/isl/doc/ |
| H A D | implementation.tex | 668 The affine hull of the recession cone therefore needs to be projected 670 incrementally keep track of this recession cone. The reduced basis 1116 generate the rational cone 1122 a Hilbert basis of this cone \parencite[Theorem~16.4]{Schrijver1986}.
|
| H A D | user.pod | 6608 be a cone, while the set of values may be any polyhedron.
|