Home
last modified time | relevance | path

Searched refs:set1 (Results 1 – 25 of 27) sorted by relevance

12

/dragonfly/sys/sys/
H A Dcpumask.h42 #define CPU_AND(dst, set1, set2) __CPU_AND(dst, set1, set2) argument
43 #define CPU_OR(dst, set1, set2) __CPU_OR(dst, set1, set2) argument
44 #define CPU_XOR(dst, set1, set2) __CPU_XOR(dst, set1, set2) argument
45 #define CPU_EQUAL(set1, set2) __CPU_EQUAL(set1, set2) argument
H A Dsignalvar.h123 #define SIGSETEQ(set1, set2) __sigseteq(&(set1), &(set2)) argument
124 #define SIGSETNEQ(set1, set2) (!__sigseteq(&(set1), &(set2))) argument
126 #define SIGSETOR(set1, set2) \ argument
130 (set1).__bits[__i] |= (set2).__bits[__i]; \
133 #define SIGSETAND(set1, set2) \ argument
137 (set1).__bits[__i] &= (set2).__bits[__i]; \
140 #define SIGSETNAND(set1, set2) \ argument
144 (set1).__bits[__i] &= ~(set2).__bits[__i]; \
185 __sigseteq(sigset_t *set1, sigset_t *set2) in __sigseteq() argument
190 if (set1->__bits[i] != set2->__bits[i]) in __sigseteq()
/dragonfly/sys/net/ipfw3/
H A Dip_fw3_set.c102 int *set1, *set2; in ip_fw3_ctl_set_move_set() local
105 set1 =(int *)sopt->sopt_val; in ip_fw3_ctl_set_move_set()
106 set2 = set1 + 1; in ip_fw3_ctl_set_move_set()
107 if (*set1 > 0 && *set1 < 32 && *set2 > 0 && *set2 < 32) { in ip_fw3_ctl_set_move_set()
111 msg.set_from = *set1; in ip_fw3_ctl_set_move_set()
174 int *set1, *set2; in ip_fw3_ctl_set_swap() local
177 set1 =(int *)sopt->sopt_val; in ip_fw3_ctl_set_swap()
178 set2 = set1 + 1; in ip_fw3_ctl_set_swap()
179 if (*set1 > 0 && *set1 < 32 && *set2 > 0 && *set2 < 32) { in ip_fw3_ctl_set_swap()
183 msg.set_from = *set1; in ip_fw3_ctl_set_swap()
/dragonfly/sys/cpu/x86_64/include/
H A Dcpumask.h234 #define __CPU_EQUAL(set1, set2) CPUMASK_CMPMASKEQ(*set1, *set2) argument
239 #define __CPU_AND(dst, set1, set2) \ argument
241 if (dst == set1) { \
245 CPUMASK_ANDMASK(*dst, *set1); \
249 #define __CPU_OR(dst, set1, set2) \ argument
251 if (dst == set1) { \
255 CPUMASK_ORMASK(*dst, *set1); \
259 #define __CPU_XOR(dst, set1, set2) \ argument
261 if (dst == set1) { \
265 CPUMASK_XORMASK(*dst, *set1); \
/dragonfly/contrib/gcc-8.0/gcc/config/i386/
H A Dx86-tune-sched.c212 rtx set1, set2; in exact_store_load_dependency() local
214 set1 = single_set (store); in exact_store_load_dependency()
215 if (!set1) in exact_store_load_dependency()
217 if (!MEM_P (SET_DEST (set1))) in exact_store_load_dependency()
222 if (exact_dependency_1 (SET_DEST (set1), SET_SRC (set2))) in exact_store_load_dependency()
/dragonfly/contrib/gcc-8.0/gcc/
H A Dalias.c454 if (set1 == voidptr_set || set2 == voidptr_set) in alias_set_subset_of()
458 if (ase2->children && set1 != voidptr_set in alias_set_subset_of()
475 if (alias_sets_must_conflict_p (set1, set2)) in alias_sets_conflict_p()
479 ase1 = get_alias_set_entry (set1); in alias_sets_conflict_p()
512 if (set1 == voidptr_set || set2 == voidptr_set) in alias_sets_conflict_p()
525 if (ase2->is_pointer && set1 != voidptr_set in alias_sets_conflict_p()
548 if (set1 == 0 || set2 == 0) in alias_sets_must_conflict_p()
553 if (set1 == set2) in alias_sets_must_conflict_p()
570 alias_set_type set1, set2; in objects_must_conflict_p() local
591 set1 = t1 ? get_alias_set (t1) : 0; in objects_must_conflict_p()
[all …]
H A Dtree-ssa-pre.c1225 if (set1)
1226 result = bitmap_find_leader (set1, val);
1641 bitmap_set_t set1, bitmap_set_t set2, edge e) in phi_translate() argument
1872 if (!op_valid_in_sets (set1, set2, nary->op[i])) in valid_in_sets()
1885 if (!op_valid_in_sets (set1, set2, vro->op0) in valid_in_sets()
1886 || !op_valid_in_sets (set1, set2, vro->op1) in valid_in_sets()
1887 || !op_valid_in_sets (set1, set2, vro->op2)) in valid_in_sets()
1902 clean (bitmap_set_t set1, bitmap_set_t set2 = NULL)
1910 if (!valid_in_sets (set1, set2, expr)) in FOR_EACH_VEC_ELT()
1917 if (! bitmap_find_leader (set1, val)) in FOR_EACH_VEC_ELT()
[all …]
H A Dcfgcleanup.c251 rtx set1, set2, cond1, cond2; in thread_jump() local
283 set1 = pc_set (BB_END (e->src)); in thread_jump()
286 != (XEXP (SET_SRC (set1), 1) == pc_rtx)) in thread_jump()
289 cond1 = XEXP (SET_SRC (set1), 0); in thread_jump()
1620 rtx set1, set2, cond1, cond2; in outgoing_edges_match() local
1657 set1 = pc_set (BB_END (bb1)); in outgoing_edges_match()
1659 if ((XEXP (SET_SRC (set1), 1) == pc_rtx) in outgoing_edges_match()
1663 cond1 = XEXP (SET_SRC (set1), 0); in outgoing_edges_match()
H A Dread-rtl-function.c1796 rtx set1 = single_set (insn_1); in test_loading_dump_fragment_2() local
1797 ASSERT_NE (NULL, set1); in test_loading_dump_fragment_2()
1803 rtx src1 = SET_SRC (set1); in test_loading_dump_fragment_2()
2141 rtx set1 = single_set (insn_1); in test_loading_mem() local
2142 rtx mem1 = SET_DEST (set1); in test_loading_mem()
H A Dcombine.c3561 rtx set1 = XVECEXP (newpat, 0, 1); in try_combine() local
3564 if (((REG_P (SET_DEST (set1)) in try_combine()
3566 || (GET_CODE (SET_DEST (set1)) == SUBREG in try_combine()
3569 && !side_effects_p (SET_SRC (set1))) in try_combine()
3583 rtx dest = SET_DEST (set1); in try_combine()
3588 newpat = set1; in try_combine()
4039 rtx set1 = XVECEXP (newpat, 0, 1); in try_combine() local
4049 && !(REG_P (SET_DEST (set1)) in try_combine()
4053 SUBREG_REG (SET_DEST (set1)))) in try_combine()
4061 newi2pat = set1; in try_combine()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dalias.c415 alias_set_subset_of (alias_set_type set1, alias_set_type set2) in alias_set_subset_of() argument
428 (splay_tree_key) set1))) in alias_set_subset_of()
436 alias_sets_conflict_p (alias_set_type set1, alias_set_type set2) in alias_sets_conflict_p() argument
441 if (alias_sets_must_conflict_p (set1, set2)) in alias_sets_conflict_p()
445 ase = get_alias_set_entry (set1); in alias_sets_conflict_p()
457 (splay_tree_key) set1))) in alias_sets_conflict_p()
468 alias_sets_must_conflict_p (alias_set_type set1, alias_set_type set2) in alias_sets_must_conflict_p() argument
470 if (set1 == 0 || set2 == 0 || set1 == set2) in alias_sets_must_conflict_p()
484 alias_set_type set1, set2; in objects_must_conflict_p() local
498 set1 = t1 ? get_alias_set (t1) : 0; in objects_must_conflict_p()
[all …]
H A Dtree-ssa-pre.c1317 result = bitmap_find_leader (set1, val, NULL); in find_leader_in_sets()
1456 leader = find_leader_in_sets (op_val_id, set1, set2); in phi_translate_1()
1557 leader = find_leader_in_sets (op_val_id, set1, set2); in phi_translate_1()
1565 opresult = phi_translate (leader, set1, set2, in phi_translate_1()
2021 if (!union_contains_value (set1, set2, in vro_valid_in_sets()
2034 if (!union_contains_value (set1, set2, in vro_valid_in_sets()
2048 if (!union_contains_value (set1, set2, in vro_valid_in_sets()
2085 if (!union_contains_value (set1, set2, in valid_in_sets()
2108 if (!vro_valid_in_sets (set1, set2, vro)) in valid_in_sets()
2142 if (!valid_in_sets (set1, set2, expr, block)) in dependent_clean()
[all …]
H A Dcfgcleanup.c270 rtx set1, set2, cond1, cond2, insn; in thread_jump() local
301 set1 = pc_set (BB_END (e->src)); in thread_jump()
304 != (XEXP (SET_SRC (set1), 1) == pc_rtx)) in thread_jump()
307 cond1 = XEXP (SET_SRC (set1), 0); in thread_jump()
1539 rtx set1, set2, cond1, cond2; in outgoing_edges_match() local
1576 set1 = pc_set (BB_END (bb1)); in outgoing_edges_match()
1578 if ((XEXP (SET_SRC (set1), 1) == pc_rtx) in outgoing_edges_match()
1582 cond1 = XEXP (SET_SRC (set1), 0); in outgoing_edges_match()
H A Dcprop.c814 struct expr *set1 = 0; in find_avail_set() local
855 set1 = set; in find_avail_set()
869 return set1; in find_avail_set()
H A Dcombine.c3422 rtx set1 = XVECEXP (newpat, 0, 1); in try_combine() local
3424 if (((REG_P (SET_DEST (set1)) in try_combine()
3425 && find_reg_note (i3, REG_UNUSED, SET_DEST (set1))) in try_combine()
3426 || (GET_CODE (SET_DEST (set1)) == SUBREG in try_combine()
3427 && find_reg_note (i3, REG_UNUSED, SUBREG_REG (SET_DEST (set1))))) in try_combine()
3429 && !side_effects_p (SET_SRC (set1))) in try_combine()
3443 newpat = set1; in try_combine()
/dragonfly/contrib/tre/lib/
H A Dtre-compile.c2128 for (s1 = 0; set1[s1].position >= 0; s1++); in tre_set_union()
2134 for (s1 = 0; set1[s1].position >= 0; s1++) in tre_set_union()
2136 new_set[s1].position = set1[s1].position; in tre_set_union()
2137 new_set[s1].code_min = set1[s1].code_min; in tre_set_union()
2138 new_set[s1].code_max = set1[s1].code_max; in tre_set_union()
2141 new_set[s1].backref = set1[s1].backref; in tre_set_union()
2142 if (set1[s1].tags == NULL && tags == NULL) in tre_set_union()
2146 for (i = 0; set1[s1].tags != NULL && set1[s1].tags[i] >= 0; i++); in tre_set_union()
2152 new_tags[j] = set1[s1].tags[j]; in tre_set_union()
2158 if (set1[s1].params) in tre_set_union()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/lto/
H A Dlto-symtab.c284 alias_set_type set1 = get_alias_set (type); in warn_type_compatibility_p() local
287 if (set1 && set2 && set1 != set2) in warn_type_compatibility_p()
302 || (set1 != TYPE_ALIAS_SET (ptr_type_node) in warn_type_compatibility_p()
/dragonfly/contrib/gcc-8.0/gcc/c-family/
H A Dc-warn.c645 alias_set_type set1 in strict_aliasing_warning() local
650 && set1 != set2 in strict_aliasing_warning()
651 && !alias_set_subset_of (set2, set1) in strict_aliasing_warning()
652 && !alias_sets_conflict_p (set1, set2)) in strict_aliasing_warning()
660 && !alias_sets_must_conflict_p (set1, set2)) in strict_aliasing_warning()
675 alias_set_type set1 = get_alias_set (TREE_TYPE (otype)); in strict_aliasing_warning() local
678 || !alias_sets_must_conflict_p (set1, set2)) in strict_aliasing_warning()
/dragonfly/contrib/cvs-1.12/lib/
H A Dregex_internal.c1270 re_node_set_compare (const re_node_set *set1, const re_node_set *set2) in internal_function()
1273 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem) in internal_function()
1275 for (i = set1->nelem ; REG_VALID_INDEX (--i) ; ) in internal_function()
1276 if (set1->elems[i] != set2->elems[i]) in internal_function()
/dragonfly/contrib/diffutils/lib/
H A Dregex_internal.c1359 re_node_set_compare (const re_node_set *set1, const re_node_set *set2) in re_node_set_compare() argument
1362 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem) in re_node_set_compare()
1364 for (i = set1->nelem ; --i >= 0 ; ) in re_node_set_compare()
1365 if (set1->elems[i] != set2->elems[i]) in re_node_set_compare()
/dragonfly/contrib/grep/lib/
H A Dregex_internal.c1353 re_node_set_compare (const re_node_set *set1, const re_node_set *set2) in re_node_set_compare() argument
1356 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem) in re_node_set_compare()
1358 for (i = set1->nelem ; --i >= 0 ; ) in re_node_set_compare()
1359 if (set1->elems[i] != set2->elems[i]) in re_node_set_compare()
/dragonfly/contrib/tcsh-6/
H A Dsh.set.c323 set1(vp, vecp, &shvhed, flags); in doset()
644 set1(var, vec, &shvhed, flags); in setv()
648 set1(const Char *var, Char **vec, struct varent *head, int flags) in set1() function
H A Dsh.decls.h387 extern void set1 (const Char *, Char **,
H A Dtw.comp.c81 set1(strip(p), saveblk(v), &completions, VAR_READWRITE); in docomplete()
/dragonfly/contrib/gcc-4.7/gcc/c-family/
H A Dc-common.c1689 alias_set_type set1 = in strict_aliasing_warning() local
1693 if (set1 != set2 && set2 != 0 in strict_aliasing_warning()
1694 && (set1 == 0 || !alias_sets_conflict_p (set1, set2))) in strict_aliasing_warning()
1701 && !alias_sets_must_conflict_p (set1, set2)) in strict_aliasing_warning()
1716 alias_set_type set1 = get_alias_set (TREE_TYPE (otype)); in strict_aliasing_warning() local
1719 || !alias_sets_must_conflict_p (set1, set2)) in strict_aliasing_warning()

12