Searched refs:dom (Results 1 - 25 of 58) sorted by relevance

123

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/expr/
H A Dvolatile1.C3 struct dom struct
7 ~dom() throw();
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dssa-fre-17.c5 int dom; member in struct:Bar
15 f.doms[0].dom = i;
16 f.doms[1].dom = j;
17 f.doms[2].dom = k;
18 return f.doms[0LL].dom;
21 /* { dg-final { scan-tree-dump "Replaced f.doms\\\[0\\\].dom with i_" "fre1" } } */
/haiku-buildtools/isl/
H A Disl_map_no_piplib.c14 struct isl_basic_map *bmap, struct isl_basic_set *dom,
18 isl_basic_set_free(dom);
13 isl_pip_basic_map_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max) argument
H A Disl_map_lexopt_templ.c21 * (or maximal) image element for each domain element in dom.
22 * Set *empty to those elements in dom that do not have an image element.
24 * We first make sure the basic sets in dom are disjoint and then
30 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
36 dom = isl_set_make_disjoint(dom);
37 if (!dom)
40 if (isl_set_plain_is_empty(dom)) {
43 *empty = dom;
45 isl_set_free(dom);
111 isl_set *dom = NULL; local
[all...]
H A Disl_map_piplib.h20 struct isl_basic_map *bmap, struct isl_basic_set *dom,
H A Disl_vertices_private.h11 * of the vertex as a singleton parametric set. "dom" is the projection
16 isl_basic_set *dom; member in struct:isl_vertex
26 isl_basic_set *dom; member in struct:isl_chamber
46 isl_basic_set *dom; member in struct:isl_cell
H A Disl_vertices.c48 isl_basic_set_free(vertices->v[i].dom);
54 isl_basic_set_free(vertices->c[i].dom);
74 isl_basic_set_free(list->v.dom);
136 v->v.dom = isl_basic_set_copy(v->v.vertex);
137 v->v.dom = isl_basic_set_params(v->v.dom);
138 if (!v->v.dom)
202 vertices->v[0].dom = isl_basic_set_params(isl_basic_set_copy(bset));
203 if (!vertices->v[0].vertex || !vertices->v[0].dom)
214 vertices->c[0].dom
1074 isl_cell_alloc(__isl_take isl_vertices *vertices, __isl_take isl_basic_set *dom, int id) argument
1215 isl_basic_set *dom = isl_basic_set_copy(vertices->c[0].dom); local
1231 isl_basic_set *dom = isl_basic_set_copy(vertices->c[i].dom); local
1275 isl_basic_set *dom = isl_basic_set_copy(vertices->c[i].dom); local
[all...]
H A Disl_morph.c19 __isl_take isl_basic_set *dom, __isl_take isl_basic_set *ran,
24 if (!dom || !ran || !map || !inv)
27 morph = isl_alloc_type(dom->ctx, struct isl_morph);
32 morph->dom = dom;
39 isl_basic_set_free(dom);
60 return isl_morph_alloc(isl_basic_set_copy(morph->dom),
84 isl_basic_set_free(morph->dom);
104 return isl_basic_set_dim(morph->dom, type);
127 dom_offset = 1 + isl_space_offset(morph->dom
18 isl_morph_alloc( __isl_take isl_basic_set *dom, __isl_take isl_basic_set *ran, __isl_take isl_mat *map, __isl_take isl_mat *inv) argument
379 isl_basic_set *dom, *ran; local
497 isl_basic_set *dom, *ran; local
737 isl_basic_set *dom, *ran; local
[all...]
H A Disl_tab_pip.c124 * "M" describes the solution in terms of the dimensions of "dom".
126 * of dimensions of "dom".
128 * If "M" is NULL, then there is no solution on "dom".
132 struct isl_basic_set *dom; member in struct:isl_partial_sol
169 struct isl_basic_set *dom, struct isl_mat *M);
182 isl_basic_set_free(partial->dom);
193 struct isl_basic_set *dom, struct isl_mat *M)
197 if (sol->error || !dom)
200 partial = isl_alloc_type(dom->ctx, struct isl_partial_sol);
205 partial->dom
192 sol_push_sol(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) argument
603 sol_map_add(struct isl_sol_map *sol, struct isl_basic_set *dom, struct isl_mat *M) argument
683 sol_map_add_wrap(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) argument
2073 tab_for_lexmin(struct isl_basic_map *bmap, struct isl_basic_set *dom, unsigned M, int max) argument
2593 isl_context_lex_alloc(struct isl_basic_set *dom) argument
3337 isl_context_gbr_alloc(struct isl_basic_set *dom) argument
3364 isl_context_alloc(struct isl_basic_set *dom) argument
3382 sol_map_init(struct isl_basic_map *bmap, struct isl_basic_set *dom, int track_empty, int max) argument
3997 find_context_div(struct isl_basic_map *bmap, struct isl_basic_set *dom, unsigned div) argument
4035 align_context_divs(struct isl_basic_map *bmap, struct isl_basic_set *dom) argument
4076 basic_map_partial_lexopt_base( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, struct isl_sol *(*init)(__isl_keep isl_basic_map *bmap, __isl_take isl_basic_set *dom, int track_empty, int max)) argument
4123 basic_map_partial_lexopt_base_map( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) argument
4509 basic_map_partial_lexopt_symm_map_core( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space) argument
4563 basic_map_partial_lexopt_symm( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, int first, int second, __isl_give union isl_lex_res (*core)(__isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space)) argument
4655 basic_map_partial_lexopt_symm_map( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, int first, int second) argument
4672 basic_map_partial_lexopt( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) argument
4715 isl_tab_basic_map_partial_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max) argument
4771 sol_for_add(struct isl_sol_for *sol, struct isl_basic_set *dom, struct isl_mat *M) argument
4811 sol_for_add_wrap(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) argument
4817 sol_for_init(struct isl_basic_map *bmap, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user) argument
4824 struct isl_basic_set *dom = NULL; local
4862 isl_basic_map_foreach_lexopt(__isl_keep isl_basic_map *bmap, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user) argument
4900 isl_basic_set_foreach_lexopt(__isl_keep isl_basic_set *bset, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user) argument
5267 sol_pma_add(struct isl_sol_pma *sol, __isl_take isl_basic_set *dom, __isl_take isl_mat *M) argument
5308 sol_pma_add_wrap(struct isl_sol *sol, __isl_take isl_basic_set *dom, __isl_take isl_mat *M) argument
5321 sol_pma_init(__isl_keep isl_basic_map *bmap, __isl_take isl_basic_set *dom, int track_empty, int max) argument
5369 basic_map_partial_lexopt_base_pma( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) argument
5551 basic_map_partial_lexopt_symm_pma_core( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space) argument
5580 basic_map_partial_lexopt_symm_pma( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, int first, int second) argument
5597 basic_map_partial_lexopt_pma( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) argument
5641 isl_basic_map_partial_lexopt_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) argument
[all...]
H A Dbound.c69 isl_set *dom = NULL; local
104 dom = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf));
105 bounded = isl_set_is_bounded(dom);
113 isl_set_sample_point(isl_set_copy(dom)));
119 nvar = isl_set_dim(dom, isl_dim_set);
164 isl_set_free(dom);
185 isl_set *dom; local
189 dom = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf));
190 context = isl_set_params(isl_set_copy(dom));
223 isl_set_free(dom);
[all...]
H A Disl_bernstein.c113 static void add_fold(__isl_take isl_qpolynomial *b, __isl_keep isl_set *dom, argument
121 data->fold_tight = isl_qpolynomial_fold_fold_on_domain(dom,
124 data->fold = isl_qpolynomial_fold_fold_on_domain(dom,
139 __isl_keep isl_set *dom, struct bernstein_data *data)
190 add_fold(b, dom, k, n, d, data);
255 isl_set *dom; local
273 dim_param = isl_basic_set_get_space(cell->dom);
305 dom = isl_set_from_basic_set(isl_basic_set_copy(cell->dom));
308 extract_coefficients(poly, dom, dat
138 extract_coefficients(isl_qpolynomial *poly, __isl_keep isl_set *dom, struct bernstein_data *data) argument
345 isl_set *dom; local
357 isl_set *dom; local
[all...]
H A Disl_transitive_closure.c834 * that takes an element from the dom R \times Z to an
847 * x in dom R and x + d in ran R and
920 * domain and range equal to "dom".
923 __isl_take isl_set *dom, __isl_keep isl_basic_map *bmap, int *exact)
930 dom = isl_set_add_dims(dom, isl_dim_set, 1);
931 app = isl_map_from_domain_and_range(dom, isl_set_copy(dom));
946 * with domain and/or range outside of dom and ran.
949 __isl_keep isl_set *dom, __isl_kee
922 q_closure(__isl_take isl_space *dim, __isl_take isl_set *dom, __isl_keep isl_basic_map *bmap, int *exact) argument
948 has_spurious_elements(__isl_keep isl_map *qc, __isl_keep isl_set *dom, __isl_keep isl_set *ran) argument
1017 composability(__isl_keep isl_set *C, int i, isl_set **dom, isl_set **ran, int *left, int *right, __isl_keep isl_map *map) argument
1196 incemental_on_entire_domain(__isl_keep isl_space *dim, __isl_keep isl_map *map, isl_set **dom, isl_set **ran, int *left, int *right, __isl_give isl_map **res) argument
1284 isl_set **dom = NULL; local
1418 merge(isl_set **set, int *group, __isl_take isl_set *dom, int pos) argument
1651 isl_set *dom; local
2179 box_closure_on_domain(__isl_take isl_map *map, __isl_take isl_set *dom, __isl_take isl_set *ran, int with_id) argument
2343 box_closure_with_identity(__isl_take isl_map *map, __isl_take isl_set *dom) argument
[all...]
H A Disl_morph.h24 * "map" is an affine mapping from "dom" to "ran"
30 isl_basic_set *dom; member in struct:isl_morph
39 __isl_take isl_basic_set *dom, __isl_take isl_basic_set *ran,
H A Disl_map_piplib.c409 struct isl_basic_map *bmap, struct isl_basic_set *dom,
420 if (!bmap || !dom)
424 isl_assert(ctx, isl_basic_map_compatible_domain(bmap, dom), goto error);
429 domain = isl_basic_map_to_pip(bmap, nparam + n_in, 0, dom->n_div);
432 context = isl_basic_map_to_pip((struct isl_basic_map *)dom, 0, 0, 0);
445 copy = isl_basic_set_copy(dom);
457 *empty = isl_set_from_basic_set(dom);
459 isl_basic_set_free(dom);
474 isl_basic_set_free(dom);
408 isl_pip_basic_map_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max) argument
H A Disl_map_subtract.c554 /* Remove the elements of "dom" from the domain of "map".
557 __isl_take isl_set *dom)
561 if (!isl_map_compatible_domain(map, dom))
562 isl_die(isl_set_get_ctx(dom), isl_error_invalid,
566 ext_dom = isl_map_intersect_domain(ext_dom, dom);
570 isl_set_free(dom);
575 __isl_take isl_set *dom)
577 return isl_map_align_params_map_map_and(map, dom, &map_subtract_domain);
580 /* Remove the elements of "dom" from the range of "map".
583 __isl_take isl_set *dom)
556 map_subtract_domain(__isl_take isl_map *map, __isl_take isl_set *dom) argument
574 isl_map_subtract_domain(__isl_take isl_map *map, __isl_take isl_set *dom) argument
582 map_subtract_range(__isl_take isl_map *map, __isl_take isl_set *dom) argument
600 isl_map_subtract_range(__isl_take isl_map *map, __isl_take isl_set *dom) argument
[all...]
H A Disl_factorization.c31 len = isl_alloc_array(morph->dom->ctx, int, n_group);
36 f = isl_alloc_type(morph->dom->ctx, struct isl_factorizer);
90 isl_basic_set *dom; local
106 dom = isl_basic_set_universe(isl_space_copy(dim));
110 morph = isl_morph_alloc(dom, ran, Q, U);
H A Disl_input.c2721 __isl_take isl_set *dom, struct vars *v)
2728 return read_map_tuple(s, dom, isl_dim_set, v, 1, 0);
2736 dom = read_map_tuple(s, dom, isl_dim_set, v, 1, 0);
2740 return dom;
2744 isl_set_free(dom);
2771 /* Read a piecewise affine expression from "s" with domain (space) "dom".
2774 __isl_take isl_set *dom, struct vars *v)
2778 if (!isl_set_is_params(dom) && isl_stream_eat(s, ISL_TOKEN_TO))
2784 pwaff = accept_affine(s, isl_set_get_space(dom),
2720 read_aff_domain(struct isl_stream *s, __isl_take isl_set *dom, struct vars *v) argument
2773 read_pw_aff_with_dom(struct isl_stream *s, __isl_take isl_set *dom, struct vars *v) argument
2802 isl_set *dom = NULL; local
2985 isl_set *dom = NULL; local
[all...]
H A Disl_tab.h245 struct isl_basic_map *bmap, struct isl_basic_set *dom,
248 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
H A Disl_space.c1137 isl_space *dom, *ran1, *ran2, *nest; local
1148 dom = isl_space_domain(isl_space_copy(left));
1154 return isl_space_join(isl_space_reverse(dom), nest);
1789 isl_space *dom, *ran; local
1798 dom = isl_space_unwrap(isl_space_domain(isl_space_copy(dim)));
1800 dom_dom = isl_space_domain(isl_space_copy(dom));
1801 dom_ran = isl_space_range(dom);
1804 dom = isl_space_join(isl_space_from_domain(dom_dom),
1808 return isl_space_join(isl_space_from_domain(isl_space_wrap(dom)),
1831 isl_space *dom, *ra local
1870 isl_space *dom, *ran; local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Duse_21.f9011 public :: domain_container, dom
19 type(domain_container) :: dom variable in module:domain
30 use domain, only: dom
32 call dom%init
/haiku-buildtools/gcc/gcc/
H A Ddominance.c63 artificial ENTRY_BLOCK (or EXIT_BLOCK in the post-dom case) in our lists to
89 /* After the algorithm is done, dom[x] contains the immediate dominator
91 TBB *dom; member in struct:dom_info
163 init_ar (di->dom, TBB, num, 0);
215 free (di->dom);
357 /* In the post-dom case we may have nodes without a path to EXIT_BLOCK.
358 They are reverse-unreachable. In the dom-case we disallow such
359 nodes, but in post-dom we have to deal with them.
508 On return the immediate dominator to node V is in di->dom[V]. */
587 di->dom[
790 basic_block dom; local
903 basic_block dom; local
1114 basic_block bb, dom = NULL; variable
1186 basic_block bb, dom, ybb; local
1265 basic_block bb, dom; local
[all...]
H A Dtree-cfgcleanup.c555 basic_block dom, dombb, domdest; local
563 dom = dombb;
566 dom = nearest_common_dominator (CDI_DOMINATORS, domdest, dombb);
568 set_immediate_dominator (CDI_DOMINATORS, dest, dom);
828 basic_block dombb, domdest, dom; local
925 dom = dombb;
928 dom = nearest_common_dominator (CDI_DOMINATORS, domdest, dombb);
930 set_immediate_dominator (CDI_DOMINATORS, dest, dom);
H A Dsanopt.c209 imm_dom_path_with_freeing_call (basic_block bb, basic_block dom) argument
224 if (e->src == dom)
243 if (e->src == dom)
273 if (e->src == dom)
277 for (src = e->src; src != dom; )
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/
H A Dunroll1.C88 static void setDomain(Storage_t &dom, const T &newdom) { argument
89 dom[0] = newdom.first();
90 dom[1] = newdom.length();
94 static void setDomain(Storage_t &dom, const T1 &begval, const T2 &endval) { argument
95 dom[0] = begval;
96 dom[1] = (endval - begval + 1);
129 static void setDomain(int &dom, const T &newdom) { argument
130 dom = DomainTraits<T>::getFirst(newdom);
363 explicit DomainLayout(const Interval &dom) : node_m(0, dom) {} argument
387 BrickBase(const Interval &dom) argument
397 Engine(const Interval &dom) argument
[all...]
/haiku-buildtools/isl/doc/
H A Dmanual.tex48 \def\domain{\mathop{\rm dom}\nolimits}

Completed in 308 milliseconds

123