Home
last modified time | relevance | path

Searched refs:hull (Results 1 – 25 of 29) sorted by relevance

12

/netbsd-src/external/mit/isl/dist/
H A Disl_convex_hull.c539 static __isl_give isl_basic_set *extend(__isl_take isl_basic_set *hull, in extend() argument
549 if (dim < 0 || !hull) in extend()
550 return isl_basic_set_free(hull); in extend()
554 for (i = 0; i < hull->n_ineq; ++i) { in extend()
555 facet = compute_facet(set, hull->ineq[i]); in extend()
556 facet = isl_basic_set_add_eq(facet, hull->ineq[i]); in extend()
559 hull_facet = isl_basic_set_copy(hull); in extend()
560 hull_facet = isl_basic_set_add_eq(hull_facet, hull->ineq[i]); in extend()
565 hull = isl_basic_set_cow(hull); in extend()
566 hull = isl_basic_set_extend(hull, 0, 0, facet->n_ineq); in extend()
[all …]
H A Disl_affine_hull.c362 __isl_take isl_basic_set *hull, __isl_take isl_vec *sample, in add_adjacent_points() argument
368 dim = isl_basic_set_dim(hull, isl_dim_set); in add_adjacent_points()
378 contains = isl_basic_set_contains(hull, sample); in add_adjacent_points()
391 hull = affine_hull(hull, point); in add_adjacent_points()
401 return hull; in add_adjacent_points()
404 isl_basic_set_free(hull); in add_adjacent_points()
422 __isl_take isl_basic_set *hull, __isl_keep isl_basic_set *bset) in extend_affine_hull() argument
427 if (!tab || !hull) in extend_affine_hull()
438 for (j = 0; j < hull->n_eq; ++j) { in extend_affine_hull()
439 sample = outside_point(tab, hull->eq[j], 1); in extend_affine_hull()
[all …]
H A Disl_scheduler_clustering.c1389 isl_basic_map *hull; in compute_weights() local
1405 hull = isl_map_affine_hull(isl_map_copy(edge->map)); in compute_weights()
1406 hull = isl_basic_map_transform_dims(hull, isl_dim_in, 0, in compute_weights()
1408 hull = isl_basic_map_transform_dims(hull, isl_dim_out, 0, in compute_weights()
1410 hull = isl_basic_map_project_out(hull, in compute_weights()
1412 hull = isl_basic_map_project_out(hull, in compute_weights()
1414 hull = isl_basic_map_remove_divs(hull); in compute_weights()
1415 n_in = isl_basic_map_dim(hull, isl_dim_in); in compute_weights()
1416 n_out = isl_basic_map_dim(hull, isl_dim_out); in compute_weights()
1418 hull = isl_basic_map_free(hull); in compute_weights()
[all …]
H A Disl_stride.c302 isl_basic_set *hull; in set_detect_stride() local
304 hull = isl_set_affine_hull(isl_set_copy(set)); in set_detect_stride()
310 if (isl_basic_set_foreach_constraint(hull, &detect_stride, data) < 0) in set_detect_stride()
324 isl_basic_set_free(hull); in set_detect_stride()
327 isl_basic_set_free(hull); in set_detect_stride()
H A Disl_scheduler.c498 isl_set_free(node->hull); in clear_node()
793 __isl_take isl_set *hull, __isl_take isl_multi_aff *compress, in compress_node() argument
799 node->hull = hull; in compress_node()
803 hull = isl_set_preimage_multi_aff(hull, in compress_node()
805 node->hull = isl_set_intersect(node->hull, hull); in compress_node()
812 if (!node->hull || !node->compress || !node->decompress) in compress_node()
848 isl_set *hull; in project_out_fixed() local
867 hull = isl_map_range(isl_map_from_pw_multi_aff(pma)); in project_out_fixed()
871 return compress_node(node, hull, compress, decompress); in project_out_fixed()
974 __isl_take isl_set *hull, __isl_take isl_multi_aff *compress, in add_node() argument
[all …]
H A Disl_aff.c2308 isl_basic_set *hull; in isl_aff_gist() local
2313 hull = isl_set_affine_hull(context); in isl_aff_gist()
2314 return isl_aff_substitute_equalities_lifted(aff, hull); in isl_aff_gist()
5283 __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i) in pw_multi_aff_from_map_div() argument
5304 ls = isl_basic_map_get_local_space(hull); in pw_multi_aff_from_map_div()
5307 v = isl_basic_map_inequality_extract_output_upper_bound(hull, i, d); in pw_multi_aff_from_map_div()
5308 isl_basic_map_free(hull); in pw_multi_aff_from_map_div()
5333 isl_basic_map_free(hull); in pw_multi_aff_from_map_div()
5377 isl_basic_map *hull; in pw_multi_aff_from_map_check_div() local
5379 hull = isl_map_unshifted_simple_hull(isl_map_copy(map)); in pw_multi_aff_from_map_check_div()
[all …]
H A Disl_ast_codegen.c884 isl_basic_set *hull; in set_enforced_from_set() local
893 hull = isl_set_simple_hull(enforced_i); in set_enforced_from_set()
894 enforced = isl_basic_set_intersect(enforced, hull); in set_enforced_from_set()
1478 isl_basic_set *hull; in create_node_scaled() local
1489 hull = isl_set_unshifted_simple_hull(isl_set_copy(domain)); in create_node_scaled()
1490 bounds = isl_basic_set_intersect(bounds, hull); in create_node_scaled()
2580 isl_basic_set *hull; in find_unroll_lower_bound() local
2582 hull = isl_set_simple_hull(isl_set_copy(domain)); in find_unroll_lower_bound()
2584 if (isl_basic_set_foreach_constraint(hull, in find_unroll_lower_bound()
2588 isl_basic_set_free(hull); in find_unroll_lower_bound()
[all …]
H A Disl_coalesce.c320 isl_basic_map *hull; in coalesce_info_set_hull_hash() local
323 hull = isl_basic_map_copy(info->bmap); in coalesce_info_set_hull_hash()
324 hull = isl_basic_map_plain_affine_hull(hull); in coalesce_info_set_hull_hash()
325 n_div = isl_basic_map_dim(hull, isl_dim_div); in coalesce_info_set_hull_hash()
327 hull = isl_basic_map_free(hull); in coalesce_info_set_hull_hash()
328 hull = isl_basic_map_drop_constraints_involving_dims(hull, in coalesce_info_set_hull_hash()
330 info->hull_hash = isl_basic_map_get_hash(hull); in coalesce_info_set_hull_hash()
331 isl_basic_map_free(hull); in coalesce_info_set_hull_hash()
333 return hull ? 0 : -1; in coalesce_info_set_hull_hash()
3624 __isl_take isl_basic_map *hull) in set_up_substitutions() argument
[all …]
H A Disl_scheduler.h73 isl_set *hull; member
H A Disl_ast_build_expr.c901 isl_basic_set *hull; in try_extract_mod() local
916 hull = isl_set_simple_hull(isl_set_copy(data->build->domain)); in try_extract_mod()
917 hull = isl_basic_set_remove_divs(hull); in try_extract_mod()
920 r = isl_basic_set_foreach_constraint(hull, &check_parallel_or_opposite, in try_extract_mod()
922 isl_basic_set_free(hull); in try_extract_mod()
H A Disl_output.c1155 __isl_keep isl_space *space, __isl_take isl_basic_map *hull, in print_disjuncts_in_hull() argument
1160 p = print_disjunct(hull, space, p, latex); in print_disjuncts_in_hull()
1161 map = isl_map_plain_gist_basic_map(isl_map_copy(map), hull); in print_disjuncts_in_hull()
1199 isl_basic_map *hull; in print_disjuncts() local
1202 hull = isl_map_plain_unshifted_simple_hull(isl_map_copy(map)); in print_disjuncts()
1203 is_universe = isl_basic_map_plain_is_universe(hull); in print_disjuncts()
1207 return print_disjuncts_in_hull(map, space, hull, in print_disjuncts()
1209 isl_basic_map_free(hull); in print_disjuncts()
H A Disl_ast_graft.c237 isl_basic_set *hull; in isl_ast_graft_list_extract_hoistable_guard() local
284 hull = isl_set_unshifted_simple_hull_from_set_list(guard, set_list); in isl_ast_graft_list_extract_hoistable_guard()
285 guard = isl_set_from_basic_set(hull); in isl_ast_graft_list_extract_hoistable_guard()
H A DChangeLog62 - add fixed-size rectangular box hull
H A Disl_map_simplify.c3628 isl_basic_map *hull; in isl_map_plain_gist() local
3630 hull = isl_map_unshifted_simple_hull(context); in isl_map_plain_gist()
3631 return isl_map_plain_gist_basic_map(map, hull); in isl_map_plain_gist()
3679 isl_basic_map *hull; in isl_map_gist() local
3714 hull = isl_map_simple_hull(context); in isl_map_gist()
3723 hull = isl_map_unshifted_simple_hull_from_map_list(context, in isl_map_gist()
3726 return isl_map_gist_basic_map(map, hull); in isl_map_gist()
H A Disl_test.c1486 const char *hull; member
1511 isl_basic_set *hull, *expected; in test_various_simple_hull() local
1518 str = simple_hull_tests[i].hull; in test_various_simple_hull()
1520 hull = simple_hull_tests[i].fn(set); in test_various_simple_hull()
1521 equal = isl_basic_set_is_equal(hull, expected); in test_various_simple_hull()
1522 isl_basic_set_free(hull); in test_various_simple_hull()
1651 const char *hull; member
1703 set2 = isl_set_read_from_str(ctx, convex_hull_tests[i].hull); in test_convex_hull_algo()
/netbsd-src/games/sail/
H A Dassorted.c53 int guns, car, pc, hull; in table() local
61 hull = on->specs->hull; in table()
135 hull -= ghits; in table()
143 hull -= hhits; in table()
144 hull = hull < 0 ? 0 : hull; in table()
148 send_hull(on, hull); in table()
244 if (!hull) in table()
H A Dpl_6.c82 if (ptr->hull < max) { in repair()
83 FIX(hull, max); in repair()
84 send_hull(ms, ptr->hull); in repair()
H A Dextern.h199 char hull; member
H A Dsync.c799 ship->specs->hull = a; in recv_hull()
H A Dpl_7.c629 wprintw(stat_w, "Hull %2d\n", mc->hull); in draw_stat()
/netbsd-src/external/mit/isl/dist/test_inputs/
H A Daffine.polylib1 # the affine hull of {[a,b] : a=b && 1 <= a <= 163} ...
/netbsd-src/external/mit/isl/dist/doc/
H A Dimplementation.tex105 \section{Simple Hull}\label{s:simple hull}
110 (rational) convex hull. For integer sets, the obvious choice
111 would be the integer hull.
112 However, {\tt isl} currently does not support an integer hull operation
114 The convex hull operation is supported, but it is also fairly
117 Usually, it is not required to compute the exact integer hull,
118 and an overapproximation of this hull is sufficient.
119 The ``simple hull'' of a set is such an overapproximation
123 This means that the simple hull is relatively cheap to compute
124 and that the number of constraints in the simple hull is no
[all …]
H A Duser.pod4884 C<isl_fixed_box> using the functions described under "Box hull" in
6400 =item * Convex hull
6410 =item * Simple hull
6460 (See \autoref{s:simple hull}.)
6464 =item * Affine hull
6479 In case of union sets and relations, the affine hull is computed
6482 =item * Polyhedral hull
6496 In case of union sets and relations, the polyhedral hull is computed
6499 =item * Box hull
/netbsd-src/external/mit/xorg/lib/libGLU/
H A DMakefile65 hull.cc \
/netbsd-src/share/dict/
H A Dweb2a6851 boll hull
17933 dredge hull
29387 hull insurance
29388 hull-less
29389 hull-less oat
42644 pressure hull
48295 rough-hull
59122 steamer hull

12