Home
last modified time | relevance | path

Searched refs:MaxRays (Results 1 – 25 of 79) sorted by relevance

1234

/dports/math/barvinok/barvinok-0.41.5/
H A Dseries.cc76 CA = align_context(C, P->Dimension, options->MaxRays); in barvinok_series_with_options()
77 P = DomainIntersection(P, CA, options->MaxRays); in barvinok_series_with_options()
90 options->MaxRays = MaxRays; in barvinok_series()
104 D = DomainIntersection(D, CA, options->MaxRays); in barvinok_enumerate_union_series_with_options()
124 gf->context = DomainConvex(D, options->MaxRays); in barvinok_enumerate_union_series_with_options()
134 unsigned MaxRays) in barvinok_enumerate_union_series() argument
138 options->MaxRays = MaxRays; in barvinok_enumerate_union_series()
150 unsigned MaxRays) in put_direction_last() argument
165 R = Polyhedron_Image(P, T, MaxRays); in put_direction_last()
253 R = DomainIntersection(P, CA, options->MaxRays); in project_full_dim()
[all …]
H A Dtestlib.cc152 options->MaxRays); in test_evalue()
183 options->MaxRays); in test_substitute()
484 options->MaxRays); in test_bernoulli()
491 options->MaxRays); in test_bernoulli()
510 options->MaxRays); in test_bernoulli_sum()
516 options->MaxRays); in test_bernoulli_sum()
527 options->MaxRays); in test_bernoulli_sum()
541 options->MaxRays); in test_bernoulli_sum()
547 options->MaxRays); in test_bernoulli_sum()
560 options->MaxRays); in test_bernoulli_sum()
[all …]
H A Dremove_equalities.c6 unsigned MaxRays) in transform() argument
13 *P = Polyhedron_Preimage(Q, T, MaxRays); in transform()
19 *C = Polyhedron_Preimage(D, CP, MaxRays); in transform()
62 int free, unsigned MaxRays) in remove_parameter_equalities() argument
87 transform(Q, D, T, free, MaxRays); in remove_parameter_equalities()
122 unsigned nparam, unsigned MaxRays) in remove_all_equalities() argument
147 transform(&Q, &D, CP, Q != *P, MaxRays); in remove_all_equalities()
152 remove_parameter_equalities(&Q, &D, &CP, &nparam, Q != *P, MaxRays); in remove_all_equalities()
170 transform(&Q, &D, T, Q != *P, MaxRays); in remove_all_equalities()
173 remove_parameter_equalities(&Q, &D, &CP, &nparam, Q != *P, MaxRays); in remove_all_equalities()
[all …]
H A Dscale.c112 Matrix *expansion, unsigned MaxRays) in apply_expansion() argument
145 Value *det, unsigned MaxRays) in Param_Polyhedron_Scale_Integer_Slow() argument
239 Value *det, unsigned MaxRays) in Param_Polyhedron_Scale_Integer_Fast() argument
329 unsigned MaxRays) in Polyhedron_Flate() argument
352 P2 = DomainIntersection(P, CA, MaxRays); in Polyhedron_Flate()
363 unsigned MaxRays) in flate_narrow2() argument
409 P2 = DomainIntersection(P, CA, MaxRays); in flate_narrow2()
497 P2 = DomainIntersection(P, CA, MaxRays); in flate_narrow()
700 unsigned MaxRays; in scale() local
731 MaxRays = options->MaxRays; in scale()
[all …]
H A Dbarvinok_enumerate_e.cc33 unsigned MaxRays) in Omega_simplify() argument
39 return relation2Domain(r, varv, paramv, MaxRays); in Omega_simplify()
44 unsigned MaxRays) in Omega_simplify() argument
51 unsigned MaxRays) in barvinok_enumerate_parker() argument
91 A = Constraints2Polyhedron(MA, options->verify->barvinok->MaxRays); in main()
120 options->verify->barvinok->MaxRays); in main()
143 options->verify->barvinok->MaxRays); in main()
186 unsigned MaxRays = options->verify->barvinok->MaxRays; in verify_results() local
198 S = Polyhedron_Scan(P, C, MaxRays & POL_NO_DUAL ? 0 : MaxRays); in verify_results()
H A Dbarvinok_e.cc16 Polyhedron *unfringe (Polyhedron *P, unsigned MaxRays) in unfringe() argument
47 R = AddConstraints(row->p, 1, R, MaxRays); in unfringe()
187 unsigned MaxRays) in rotate_along() argument
232 int nvar, int exist, int MaxRays, in SplitOnVar() argument
352 S = DomainAddRays(S, M, options->MaxRays); in split_sure()
904 options->MaxRays); in enumerate_vd()
1146 unsigned MaxRays) in barvinok_enumerate_e() argument
1150 options->MaxRays = MaxRays; in barvinok_enumerate_e()
1315 options->MaxRays); in barvinok_enumerate_e_r()
1334 options->MaxRays); in barvinok_enumerate_e_r()
[all …]
H A Dverify.c154 unsigned MaxRays = options->barvinok->MaxRays; in check_poly_context_scan() local
164 CC2 = DomainIntersection(*C, CC, MaxRays); in check_poly_context_scan()
179 CS = Polyhedron_Scan(CC, U, MaxRays & POL_NO_DUAL ? 0 : MaxRays); in check_poly_context_scan()
303 unsigned MaxRays) in check_EP_set_scan() argument
324 MaxRays & POL_NO_DUAL ? 0 : MaxRays); in check_EP_set_scan()
345 unsigned MaxRays = options->barvinok->MaxRays; in check_EP_on_poly() local
353 check_EP_set_scan(data, P, MaxRays); in check_EP_on_poly()
380 Polyhedron *R3 = DomainUnion(R, R2, MaxRays); in DomainProject()
389 unsigned MaxRays) in evalue_parameter_domain() argument
403 Polyhedron *P = DomainProject(D, nparam, MaxRays); in evalue_parameter_domain()
[all …]
H A Dpolysign_polylib.c43 Polyhedron *I = Polyhedron_Image(D, T, options->MaxRays); in PL_polyhedron_affine_sign()
44 if (POL_ISSET(options->MaxRays, POL_INTEGER)) in PL_polyhedron_affine_sign()
45 I = DomainConstraintSimplify(I, options->MaxRays); in PL_polyhedron_affine_sign()
48 I = Polyhedron_Image(D, T, options->MaxRays); in PL_polyhedron_affine_sign()
57 unsigned MaxRays) in PL_constraints_opt() argument
60 Polyhedron *P = Constraints2Polyhedron(C, MaxRays); in PL_constraints_opt()
H A D4coins.cc13 static Polyhedron *uncone(Polyhedron *C, unsigned MaxRays) in uncone() argument
30 P = Constraints2Polyhedron(Constraints, MaxRays); in uncone()
62 C = Constraints2Polyhedron(M, options->MaxRays); in main()
64 C = remove_equalities_p(C, 4, NULL, options->MaxRays); in main()
68 B = uncone(C, options->MaxRays); in main()
85 P = Polyhedron_Image(C, T, options->MaxRays); in main()
H A Dtopcom.c47 int d, unsigned nparam, unsigned MaxRays) in construct_vertex() argument
96 AD = Constraints2Polyhedron(A, MaxRays); in construct_vertex()
124 unsigned MaxRays) in add_vertex_to_domain() argument
153 vertex = construct_vertex(vertex_facets, Constraints, d, nparam, MaxRays); in add_vertex_to_domain()
164 Polyhedron *C, unsigned MaxRays) in compute_domain() argument
187 domain->domain.Domain = Constraints2Polyhedron(Constraints, MaxRays); in compute_domain()
214 compute_domain(domain, vertices, C, options->MaxRays); in add_domain()
267 unsigned MaxRays = options->MaxRays; in points2triangs() local
273 POL_UNSET(options->MaxRays, POL_INTEGER); in points2triangs()
315 domain, options->MaxRays)) in points2triangs()
[all …]
H A Dhull.c143 R = Constraints2Polyhedron(M, options->MaxRays); in add_facets()
173 R = AddRays(rays->p[0], 1+n_subopt, Q, options->MaxRays); in add_points()
276 P = Rays2Polyhedron(V, options->MaxRays); in truncate_cone()
339 Matrix *c, int n_c, unsigned MaxRays) in add_known_points() argument
343 R = AddRays(c->p[0], n_c, Q, MaxRays); in add_known_points()
360 remove_all_equalities(&C, NULL, NULL, &CV, 0, options->MaxRays); in gbr_cone_hull()
368 hull.init = add_known_points(hull.init, c, n_c, options->MaxRays); in gbr_cone_hull()
425 init = Rays2Polyhedron(vertices, options->MaxRays); in internal_polytope()
437 Q = AddConstraints(v->p, 1, P, options->MaxRays); in internal_polytope()
444 Q = AddConstraints(v->p, 1, P, options->MaxRays); in internal_polytope()
[all …]
H A Dreduce_domain.c7 Polyhedron *true_context(Polyhedron *P, Polyhedron *C, unsigned MaxRays) in true_context() argument
11 C = DomainIntersection(tmp, C, MaxRays); in true_context()
82 rVD = D->next ? DomainConvex(D, options->MaxRays) : Polyhedron_Copy(D); in reduce_domain()
106 rVD = Constraints2Polyhedron(constraints, options->MaxRays); in reduce_domain()
110 rVD = DomainConstraintSimplify(rVD, options->MaxRays); in reduce_domain()
H A Dvolume.c106 F = AddConstraints(row->p, 1, P, MaxRays); in facet()
288 unsigned cut_MaxRays = options->MaxRays; in volume_triangulate()
328 FF = facet(F, j, options->MaxRays); in volume_triangulate()
459 L = Rays2Polyhedron(M, options->MaxRays); in volume_triangulate_lift()
539 unsigned MaxRays; in Param_Polyhedron_Volume() local
556 options->MaxRays); in Param_Polyhedron_Volume()
567 TC = true_context(P, C, options->MaxRays); in Param_Polyhedron_Volume()
569 MaxRays = options->MaxRays; in Param_Polyhedron_Volume()
570 POL_UNSET(options->MaxRays, POL_INTEGER); in Param_Polyhedron_Volume()
589 F = DomainIntersection(P, CA, options->MaxRays); in Param_Polyhedron_Volume()
[all …]
H A Dtest.c56 A = Constraints2Polyhedron(M, options->MaxRays); in main()
84 B = Polyhedron_Polar(A, options->MaxRays); in main()
86 C = Polyhedron_Polar(B, options->MaxRays); in main()
142 B = remove_equalities(A, options->MaxRays); in main()
150 C = Constraints2Polyhedron(M, options->MaxRays); in main()
187 P = Constraints2Polyhedron(M, options->MaxRays); in main()
200 EP = barvinok_enumerate_union(A, C, options->MaxRays); in main()
H A Dremove_redundant_equalities.c29 A = Constraints2Polyhedron(M, options->MaxRays); in main()
32 C = Constraints2Polyhedron(M, options->MaxRays); in main()
35 A = remove_equalities_p(A, A->Dimension-C->Dimension, 0, options->MaxRays); in main()
H A Dparam_util.c78 unsigned MaxRays = options->MaxRays; in PL_P2PP() local
79 if (MaxRays & (POL_NO_DUAL | POL_INTEGER)) in PL_P2PP()
80 MaxRays = 0; in PL_P2PP()
81 return Polyhedron2Param_Domain(Din, Cin, MaxRays); in PL_P2PP()
200 C = Constraints2Polyhedron(M, options->MaxRays); in Param_Vertex_Cone()
H A Dbarvinok_union.cc88 P = Constraints2Polyhedron(M, options->barvinok->MaxRays); in main()
93 C = Constraints2Polyhedron(M, options->barvinok->MaxRays); in main()
102 gf = barvinok_enumerate_union_series(D, C, options->barvinok->MaxRays); in main()
108 EP = barvinok_enumerate_union(D, C, options->barvinok->MaxRays); in main()
H A Dverify_lexsmaller.c185 P = Constraints2Polyhedron(M, options->barvinok->MaxRays); in main()
189 D = Constraints2Polyhedron(M, options->barvinok->MaxRays); in main()
198 C = Constraints2Polyhedron(M, options->barvinok->MaxRays); in main()
205 EP = barvinok_lexsmaller_ev(P, D, dim, C, options->barvinok->MaxRays); in main()
208 evalue *EC = barvinok_lexsmaller_ev(D, D, dim, C, options->barvinok->MaxRays); in main()
232 SP = Polyhedron_Scan(P, C, options->barvinok->MaxRays); in main()
233 SD = Polyhedron_Scan(D, C, options->barvinok->MaxRays); in main()
H A Dhilbert.c115 Matrix *Cone_Hilbert_Basis(Polyhedron *C, unsigned MaxRays) in Cone_Hilbert_Basis() argument
126 remove_all_equalities(&C, NULL, NULL, &CV, 0, MaxRays); in Cone_Hilbert_Basis()
204 Matrix *hilbert = Cone_Hilbert_Basis(C, options->MaxRays); in Cone_Hilbert_Integer_Hull()
208 unsigned MaxRays = options->MaxRays; in Cone_Hilbert_Integer_Hull() local
213 POL_UNSET(options->MaxRays, POL_INTEGER); in Cone_Hilbert_Integer_Hull()
298 options->MaxRays = MaxRays; in Cone_Hilbert_Integer_Hull()
H A Dnormalization.c196 unsigned MaxRays) in move_exists_in_front() argument
215 *next = Constraints2Polyhedron(M, MaxRays); in move_exists_in_front()
234 unsigned MaxRays) in compute_var_shifts() argument
248 C = DomainConvex(D, MaxRays); in compute_var_shifts()
283 unsigned MaxRays) in skew_to_positive_orthant() argument
291 DE = move_exists_in_front(D, nvar, MaxRays); in skew_to_positive_orthant()
292 var_shifts = compute_var_shifts(DE, nvar, MaxRays); in skew_to_positive_orthant()
318 *next = Constraints2Polyhedron(C, MaxRays); in skew_to_positive_orthant()
H A Dutil.c55 Polyhedron *Polyhedron_Read(unsigned MaxRays) in Polyhedron_Read() argument
76 P = Rays2Polyhedron(M, MaxRays); in Polyhedron_Read()
78 P = Constraints2Polyhedron(M, MaxRays); in Polyhedron_Read()
265 options->MaxRays = NbMaxCons; in triangulate_cone()
560 P = Polyhedron_Preimage(Q, T, MaxRays); in remove_equalities()
583 unsigned MaxRays) in remove_equalities_p() argument
629 Q = Polyhedron_Image(P, m2, MaxRays); in remove_equalities_p()
1023 unsigned MaxRays; member
1102 data.MaxRays = MaxRays; in ParamLine_Length_mod()
1266 unsigned MaxRays, int set) in DomainContains() argument
[all …]
/dports/math/barvinok/barvinok-0.41.5/barvinok/
H A Dbarvinok.h16 Enumeration* barvinok_enumerate(Polyhedron *P, Polyhedron* C, unsigned MaxRays);
17 evalue* barvinok_enumerate_ev(Polyhedron *P, Polyhedron* C, unsigned MaxRays);
24 unsigned exist, unsigned nparam, unsigned MaxRays);
32 evalue* barvinok_enumerate_union(Polyhedron *D, Polyhedron* C, unsigned MaxRays);
45 gen_fun * barvinok_series(Polyhedron *P, Polyhedron* C, unsigned MaxRays);
56 unsigned MaxRays);
H A Dutil.h45 Polyhedron *Polyhedron_Read(unsigned MaxRays);
55 Polyhedron *remove_equalities(Polyhedron *P, unsigned MaxRays);
57 unsigned MaxRays);
61 Polyhedron *Factor_Context(Polyhedron *F, unsigned nparam, unsigned MaxRays);
81 unsigned MaxRays, int set);
87 Polyhedron *C, unsigned MaxRays);
89 Polyhedron *C, unsigned MaxRays);
104 int Polyhedron_is_unbounded(Polyhedron *P, unsigned nparam, unsigned MaxRays);
H A Devalue.h103 unsigned MaxRays, unsigned nparam);
124 void evalue_frac2polynomial(evalue *e, int sign, unsigned MaxRays);
126 evalue *evalue_sum(evalue *E, int nvar, unsigned MaxRays);
134 void evalue_split_domains_into_orthants(evalue *e, unsigned MaxRays);
138 void evalue_backsubstitute(evalue *e, Matrix *CP, unsigned MaxRays);
/dports/math/barvinok/barvinok-0.41.5/omega_interface/
H A Dcount.cc27 unsigned MaxRays) in barvinok_enumerate_parker() argument
36 R = skew_to_positive_orthant(D, nvar, MaxRays); in barvinok_enumerate_parker()
55 unsigned MaxRays) in barvinok_enumerate_parker() argument

1234