Searched refs:set2 (Results 1 - 25 of 27) sorted by relevance

12

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/abi/
H A Dmangle43.C10 void set2 (unsigned int i) { m_u128 = 1; } function in struct:S
22 unsigned __int128 v = fo2 (); glb.set2 (i);
/haiku-buildtools/cloog/examples/example/
H A Dexample-isl.c18 isl_set *set_context, *set1, *set2; local
32 set2 = isl_set_read_from_str(ctx, str_domain2);
39 domain2 = cloog_domain_from_isl_set(set2);
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/arm/
H A Dfp16-builtins-1.c22 set2 (double x, double y) function
37 set2 (x,y); \
/haiku-buildtools/isl/include/isl/
H A Dset.h235 __isl_keep isl_set *set2, int pos);
291 struct isl_set *set1, struct isl_set *set2);
295 __isl_take isl_set *set2);
297 __isl_take isl_set *set2);
301 __isl_take isl_set *set2);
305 __isl_take isl_set *set2);
312 __isl_take isl_set *set2);
402 int isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
404 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
406 int isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
[all...]
/haiku-buildtools/isl/
H A Disl_test.c1029 isl_set *set1, *set2; local
1055 set2 = isl_set_read_from_str(ctx, str2);
1057 assert(isl_set_is_equal(set1, set2));
1059 isl_set_free(set2);
1157 isl_set *set, *set2; local
1163 set2 = isl_set_read_from_str(ctx, str);
1164 equal = isl_set_is_equal(set, set2);
1167 isl_set_free(set2);
1614 isl_set *set2; local
1638 set2
2282 const char *set2; member in struct:__anon1570
2320 isl_set *set1, *set2; local
3057 isl_set *set1, *set2; local
3258 isl_set *set, *set2; local
3279 isl_set *set, *set2; local
3679 isl_set *set1, *set2; local
[all...]
H A Disl_map_subtract.c547 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2) argument
551 (struct isl_map *)set1, (struct isl_map *)set2);
831 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2) argument
834 (struct isl_map *)set1, (struct isl_map *)set2);
H A Disl_union_map.c816 __isl_take isl_map *set2)
818 return isl_set_lex_le_set((isl_set *)set1, (isl_set *)set2);
822 __isl_take isl_map *set2)
824 return isl_set_lex_lt_set((isl_set *)set1, (isl_set *)set2);
1299 isl_set *set2 = *entry; local
1301 set2 = isl_set_product(isl_set_copy(data->map), isl_set_copy(set2));
1303 data->res = isl_union_set_add_set(data->res, set2);
815 lex_le_set(__isl_take isl_map *set1, __isl_take isl_map *set2) argument
821 lex_lt_set(__isl_take isl_map *set1, __isl_take isl_map *set2) argument
H A Disl_map.c2975 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2) argument
2979 (struct isl_map *)set2);
3724 __isl_take isl_set *set2)
3726 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
4184 __isl_take isl_set *set2)
4189 map = isl_map_intersect_range(map, set2);
4194 __isl_take isl_set *set2)
4199 map = isl_map_intersect_range(map, set2);
4204 __isl_take isl_set *set2)
4209 map = isl_map_intersect_range(map, set2);
3723 isl_set_sum(__isl_take isl_set *set1, __isl_take isl_set *set2) argument
4183 isl_set_lex_le_set(__isl_take isl_set *set1, __isl_take isl_set *set2) argument
4193 isl_set_lex_lt_set(__isl_take isl_set *set1, __isl_take isl_set *set2) argument
4203 isl_set_lex_ge_set(__isl_take isl_set *set1, __isl_take isl_set *set2) argument
4213 isl_set_lex_gt_set(__isl_take isl_set *set1, __isl_take isl_set *set2) argument
7130 isl_set_union_disjoint( struct isl_set *set1, struct isl_set *set2) argument
7138 isl_set_union(struct isl_set *set1, struct isl_set *set2) argument
7692 isl_set_is_equal(struct isl_set *set1, struct isl_set *set2) argument
7795 isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
7852 isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
8440 isl_set_follows_at(__isl_keep isl_set *set1, __isl_keep isl_set *set2, int pos) argument
8875 isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
8998 isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
9004 isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
9332 isl_set_product(struct isl_set *set1, struct isl_set *set2) argument
9337 isl_set_flat_product(__isl_take isl_set *set1, __isl_take isl_set *set2) argument
[all...]
H A Disl_map_simplify.c2553 __isl_keep isl_set *set2)
2556 (struct isl_map *)set2);
2559 /* Are "set1" and "set2" disjoint?
2561 int isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
2563 return isl_map_is_disjoint(set1, set2);
2566 int isl_set_fast_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
2568 return isl_set_plain_is_disjoint(set1, set2);
2552 isl_set_plain_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
H A Disl_ast_codegen.c1703 isl_set *set1, *set2; local
1724 set2 = isl_set_from_basic_set(bset);
1725 set1 = isl_set_subtract(set2, set1);
H A Disl_pw_templ.c737 __isl_take isl_set *set2))
1624 isl_set *set2 = *(isl_set * const *)p2; local
1626 return isl_set_plain_cmp(set1, set2);
H A Disl_transitive_closure.c816 static int isl_set_overlaps(__isl_keep isl_set *set1, __isl_keep isl_set *set2) argument
821 if (!isl_space_tuple_match(set1->dim, isl_dim_set, set2->dim, isl_dim_set))
824 i = isl_set_intersect(isl_set_copy(set1), isl_set_copy(set2));
H A Disl_aff.c2431 isl_set *set1, *set2; local
2434 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
2435 set1 = isl_set_intersect(set1, set2);
/haiku-buildtools/legacy/gcc/gcc/
H A Dregmove.c1762 rtx set2;
1799 set2 = single_set (q);
1800 if (! q || ! set2 || GET_CODE (SET_SRC (set2)) != code
1801 || XEXP (SET_SRC (set2), 0) != src
1802 || GET_CODE (XEXP (SET_SRC (set2), 1)) != CONST_INT
1803 || (SET_DEST (set2) != src
1827 set2 = set;
1836 newconst = INTVAL (XEXP (SET_SRC (set2), 1)) - insn_const;
1841 >= GET_MODE_BITSIZE (GET_MODE (SET_SRC (set2))))))
1757 rtx set2; local
1935 rtx q, set2; local
[all...]
H A Dreload1.c3847 ior_hard_reg_set (set1, set2)
3848 HARD_REG_SET *set1, *set2;
3850 IOR_HARD_REG_SET (*set1, *set2);
8226 rtx set2, dst, prev, next;
8240 set2 = single_set (prev);
8241 if (! set || ! set2
8242 || GET_CODE (SET_SRC (set)) != PLUS || GET_CODE (SET_SRC (set2)) != PLUS
8244 || GET_CODE (XEXP (SET_SRC (set2), 1)) != CONST_INT)
8247 if (! rtx_equal_p (dst, SET_DEST (set2))
8249 || ! rtx_equal_p (dst, XEXP (SET_SRC (set2),
8198 rtx set2, dst, prev, next; local
[all...]
H A Dhaifa-sched.c1260 #define BITSET_UNION(set1, set2, len) \
1261 do { register bitset tp = set1, sp = set2; \
1267 #define BITSET_INTER(set1, set2, len) \
1268 do { register bitset tp = set1, sp = set2; \
1274 #define BITSET_DIFFER(set1, set2, len) \
1275 do { register bitset tp = set1, sp = set2; \
/haiku-buildtools/cloog/source/isl/
H A Ddomain.c155 isl_set *set2 = isl_set_from_cloog_domain(dom2); local
156 set1 = isl_set_gist(isl_set_copy(set1), isl_set_copy(set2));
170 isl_set *set2 = isl_set_from_cloog_domain(dom2); local
171 set1 = isl_set_union(set1, set2);
185 isl_set *set2 = isl_set_from_cloog_domain(dom2); local
186 set1 = isl_set_intersect(isl_set_copy(set1), isl_set_copy(set2));
198 isl_set *set2 = isl_set_from_cloog_domain(minus); local
199 set1 = isl_set_subtract(isl_set_copy(set1), isl_set_copy(set2));
296 isl_set *set2 = isl_set_from_cloog_domain(dom2); local
299 follows = isl_set_follows_at(set1, set2, leve
1079 isl_set *set2 = isl_set_from_cloog_domain(d2); local
1257 isl_set *set2 = isl_set_from_cloog_domain(d2); local
[all...]
/haiku-buildtools/gcc/gcc/
H A Dalias.c444 alias_set_subset_of (alias_set_type set1, alias_set_type set2)
449 if (set2 == 0)
452 /* Otherwise, check if set1 is a subset of set2. */
453 ase = get_alias_set_entry (set2);
464 alias_sets_conflict_p (alias_set_type set1, alias_set_type set2)
469 if (alias_sets_must_conflict_p (set1, set2))
476 || ase->children->get (set2)))
480 ase = get_alias_set_entry (set2);
494 alias_sets_must_conflict_p (alias_set_type set1, alias_set_type set2)
496 if (set1 == 0 || set2
443 alias_set_subset_of(alias_set_type set1, alias_set_type set2) argument
463 alias_sets_conflict_p(alias_set_type set1, alias_set_type set2) argument
493 alias_sets_must_conflict_p(alias_set_type set1, alias_set_type set2) argument
509 alias_set_type set1, set2; local
[all...]
H A Dtree-ssa-pre.c1375 find_leader_in_sets (unsigned int val, bitmap_set_t set1, bitmap_set_t set2) argument
1380 if (!result && set2)
1381 result = bitmap_find_leader (set2, val);
1471 phi_translate (pre_expr expr, bitmap_set_t set1, bitmap_set_t set2,
1479 phi_translate_1 (pre_expr expr, bitmap_set_t set1, bitmap_set_t set2, argument
1501 leader = find_leader_in_sets (op_val_id, set1, set2);
1502 result = phi_translate (leader, set1, set2, pred, phiblock);
1599 leader = find_leader_in_sets (op_val_id, set1, set2);
1602 opresult = phi_translate (leader, set1, set2, pred, phiblock);
1767 phi_translate (pre_expr expr, bitmap_set_t set1, bitmap_set_t set2, argument
1975 op_valid_in_sets(bitmap_set_t set1, bitmap_set_t set2, tree op) argument
1994 valid_in_sets(bitmap_set_t set1, bitmap_set_t set2, pre_expr expr) argument
2039 dependent_clean(bitmap_set_t set1, bitmap_set_t set2) argument
[all...]
H A Dcfgcleanup.c300 rtx set1, set2, cond1, cond2;
333 set2 = pc_set (BB_END (b));
339 cond2 = XEXP (SET_SRC (set2), 0);
425 != (XEXP (SET_SRC (set2), 1) == pc_rtx))
1608 rtx set1, set2, cond1, cond2;
1646 set2 = pc_set (BB_END (bb2));
1648 != (XEXP (SET_SRC (set2), 1) == pc_rtx))
1652 cond2 = XEXP (SET_SRC (set2), 0);
297 rtx set1, set2, cond1, cond2; local
1601 rtx set1, set2, cond1, cond2; local
H A Dgcse.c2456 rtx set2;
2468 set2 = single_set (new_rtx);
2469 if (!set2 || !rtx_equal_p (SET_DEST (set2), dest))
2443 rtx set2; local
H A Dreload1.c9074 rtx set2, dst;
9089 set2 = single_set (prev);
9090 if (! set || ! set2
9091 || GET_CODE (SET_SRC (set)) != PLUS || GET_CODE (SET_SRC (set2)) != PLUS
9093 || !CONST_INT_P (XEXP (SET_SRC (set2), 1)))
9096 if (! rtx_equal_p (dst, SET_DEST (set2))
9098 || ! rtx_equal_p (dst, XEXP (SET_SRC (set2), 0))
9100 != -INTVAL (XEXP (SET_SRC (set2), 1))))
9047 rtx set2, dst; local
/haiku-buildtools/legacy/gcc/gcc/config/mips/
H A Dmips.c8102 rtx set1, set2;
8127 set2 = PATTERN (next);
8128 if (GET_CODE (set2) != SET)
8135 && rtx_equal_p (SET_DEST (set1), SET_DEST (set2))
8136 && GET_CODE (SET_SRC (set2)) == PLUS
8137 && rtx_equal_p (SET_DEST (set1), XEXP (SET_SRC (set2), 0))
8138 && mips16_gp_offset_p (XEXP (SET_SRC (set2), 1))
8139 && GET_CODE (XEXP (XEXP (SET_SRC (set2), 1), 0)) == MINUS)
8146 sym = XEXP (XEXP (XEXP (SET_SRC (set2), 1), 0), 0);
8064 rtx set1, set2; local
/haiku-buildtools/gcc/gcc/c-family/
H A Dc-common.c1956 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1958 if (set1 != set2 && set2 != 0
1959 && (set1 == 0 || !alias_sets_conflict_p (set1, set2)))
1966 && !alias_sets_must_conflict_p (set1, set2))
1982 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1984 || !alias_sets_must_conflict_p (set1, set2))
1954 alias_set_type set2 = get_alias_set (TREE_TYPE (type)); local
1980 alias_set_type set2 = get_alias_set (TREE_TYPE (type)); local
/haiku-buildtools/gcc/gcc/config/sparc/
H A Dsparc.c5376 rtx set1, set2;
5385 set2 = gen_rtx_SET (VOIDmode, mem,
5387 RTX_FRAME_RELATED_P (set2) = 1;
5390 gen_rtvec (2, set1, set2)));
5366 rtx set1, set2; local

Completed in 421 milliseconds

12