Searched refs:set1 (Results 1 - 25 of 34) sorted by relevance

12

/netbsd-6-1-5-RELEASE/sys/arch/powerpc/include/
H A Dcpuset.h38 #define CPUSET_ADDSET(set1, set2) atomic_or_32(&(set1), (set2))
39 #define CPUSET_DELSET(set1, set2) atomic_and_32(&(set1), ~(set2))
44 #define CPUSET_INTERSECTS_P(set1, set2) ((set1) & (set2))
49 #define CPUSET_EQUAL_P(set1, set2) ((set1) == (set2))
51 #define CPUSET_ASSIGN(set1, set2) ((set1)
[all...]
/netbsd-6-1-5-RELEASE/sys/arch/sparc64/include/
H A Dcpuset.h40 #define CPUSET_SUB(set1, set2) ((set1) &= ~(set2))
48 #define CPUSET_EQUAL(set1, set2) ((set1) == (set2))
50 #define CPUSET_ASSIGN(set1, set2) ((set1) = (set2))
/netbsd-6-1-5-RELEASE/sys/arch/mips/include/
H A Dcpuset.h38 #define CPUSET_SUB(set1, set2) atomic_and_64(&(set1), ~(set2))
46 #define CPUSET_EQUAL_P(set1, set2) ((set1) == (set2))
48 #define CPUSET_ASSIGN(set1, set2) ((set1) = (set2))
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/v850/
H A Dbit.s7 set1 5,16[r6]
H A Dv850e1.s30 set1 r9, [r1]
H A Dv850e1.d36 0x0+66 e1 4f e0 00 [ ]*set1 r9, r1
/netbsd-6-1-5-RELEASE/external/cddl/osnet/dist/uts/common/sys/
H A Dcpuvar.h438 #define CPUSET_ISEQUAL(set1, set2) cpuset_cmp(&(set1), &(set2))
476 #define CPUSET_OR(set1, set2) { \
479 (set1).cpub[_i] |= (set2).cpub[_i]; \
482 #define CPUSET_XOR(set1, set2) { \
485 (set1).cpub[_i] ^= (set2).cpub[_i]; \
488 #define CPUSET_AND(set1, set2) { \
491 (set1).cpub[_i] &= (set2).cpub[_i]; \
513 #define CPUSET_ISEQUAL(set1, set2) ((set1)
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.target/arm/
H A Dfp16-builtins-1.c15 set1 (double x) function
31 set1 (x); \
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/xstormy16/
H A Dallinsn.s954 set1 r0,#0
955 set1 r15,#15
956 set1 r8,#8
957 set1 r7,#7
958 set1 r1,#1
959 set1 r6,#10
960 set1 r13,#1
961 set1 r13,#15
965 set1 r0,r0
966 set1 r1
[all...]
H A Dallinsn.sh993 set1 r0,#0
994 set1 r15,#15
995 set1 r8,#8
996 set1 r7,#7
997 set1 r1,#1
998 set1 r6,#10
999 set1 r13,#1
1000 set1 r13,#15
1004 set1 r0,r0
1005 set1 r1
[all...]
H A Dreloc-2.s4 set1 0,#fwd1
H A Dallinsn.d870 6c6: 00 09 set1 r0,#0x0
871 6c8: ff 09 set1 r15,#0xf
872 6ca: 88 09 set1 r8,#0x8
873 6cc: 77 09 set1 r7,#0x7
874 6ce: 11 09 set1 r1,#0x1
875 6d0: a6 09 set1 r6,#0xa
876 6d2: 1d 09 set1 r13,#0x1
877 6d4: fd 09 set1 r13,#0xf
880 6d6: 00 0b set1 r0,r0
881 6d8: ff 0b set1 r1
[all...]
H A Dreloc-2.d11 2: 00 e3 set1 0x0,#0x1
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/
H A Dalias.c399 alias_set_subset_of (alias_set_type set1, alias_set_type set2)
407 /* Otherwise, check if set1 is a subset of set2. */
412 (splay_tree_key) set1)))
420 alias_sets_conflict_p (alias_set_type set1, alias_set_type set2)
425 if (alias_sets_must_conflict_p (set1, set2))
429 ase = get_alias_set_entry (set1);
441 (splay_tree_key) set1)))
489 alias_sets_must_conflict_p (alias_set_type set1, alias_set_type set2)
491 if (set1 == 0 || set2 == 0 || set1
398 alias_set_subset_of(alias_set_type set1, alias_set_type set2) argument
419 alias_sets_conflict_p(alias_set_type set1, alias_set_type set2) argument
488 alias_sets_must_conflict_p(alias_set_type set1, alias_set_type set2) argument
504 alias_set_type set1, set2; local
[all...]
H A Dtree-ssa-pre.c1362 find_leader_in_sets (unsigned int val, bitmap_set_t set1, bitmap_set_t set2) argument
1366 result = bitmap_find_leader (set1, val, NULL);
1475 phi_translate (pre_expr expr, bitmap_set_t set1, bitmap_set_t set2,
1483 phi_translate_1 (pre_expr expr, bitmap_set_t set1, bitmap_set_t set2, argument
1507 leader = find_leader_in_sets (op_val_id, set1, set2);
1508 result = phi_translate (leader, set1, set2, pred, phiblock);
1606 leader = find_leader_in_sets (op_val_id, set1, set2);
1607 opresult = phi_translate (leader, set1, set2, pred, phiblock);
1623 leader = find_leader_in_sets (op_val_id, set1, set2);
1624 opresult = phi_translate (leader, set1, set
1801 phi_translate(pre_expr expr, bitmap_set_t set1, bitmap_set_t set2, basic_block pred, basic_block phiblock) argument
2019 vro_valid_in_sets(bitmap_set_t set1, bitmap_set_t set2, vn_reference_op_t vro) argument
2073 valid_in_sets(bitmap_set_t set1, bitmap_set_t set2, pre_expr expr, basic_block block) argument
2144 dependent_clean(bitmap_set_t set1, bitmap_set_t set2, basic_block block) argument
[all...]
H A Dcfgcleanup.c274 rtx set1, set2, cond1, cond2, insn;
305 set1 = pc_set (BB_END (e->src));
308 != (XEXP (SET_SRC (set1), 1) == pc_rtx))
311 cond1 = XEXP (SET_SRC (set1), 0);
1177 rtx set1, set2, cond1, cond2;
1214 set1 = pc_set (BB_END (bb1));
1216 if ((XEXP (SET_SRC (set1), 1) == pc_rtx)
1220 cond1 = XEXP (SET_SRC (set1), 0);
271 rtx set1, set2, cond1, cond2, insn; local
1170 rtx set1, set2, cond1, cond2; local
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/
H A Dalias.c308 alias_sets_conflict_p (HOST_WIDE_INT set1, HOST_WIDE_INT set2)
314 if (set1 == 0 || set2 == 0
316 || set1 == set2)
320 ase = get_alias_set_entry (set1);
332 (splay_tree_key) set1)))
344 alias_sets_might_conflict_p (HOST_WIDE_INT set1, HOST_WIDE_INT set2)
346 if (set1 == 0 || set2 == 0 || set1 == set2)
362 HOST_WIDE_INT set1, set2;
376 set1
307 alias_sets_conflict_p(HOST_WIDE_INT set1, HOST_WIDE_INT set2) argument
343 alias_sets_might_conflict_p(HOST_WIDE_INT set1, HOST_WIDE_INT set2) argument
360 HOST_WIDE_INT set1, set2; local
[all...]
H A Dcfgcleanup.c267 rtx set1, set2, cond1, cond2, insn;
298 set1 = pc_set (BB_END (e->src));
301 != (XEXP (SET_SRC (set1), 1) == pc_rtx))
304 cond1 = XEXP (SET_SRC (set1), 0);
1236 rtx set1, set2, cond1, cond2;
1273 set1 = pc_set (BB_END (bb1));
1275 if ((XEXP (SET_SRC (set1), 1) == pc_rtx)
1279 cond1 = XEXP (SET_SRC (set1), 0);
264 rtx set1, set2, cond1, cond2, insn; local
1229 rtx set1, set2, cond1, cond2; local
H A Dtree-ssa-alias.c2240 struct pointer_set_t *set1 = pointer_set_create (); local
2251 pointer_set_insert (set1, VARRAY_TREE (may_aliases1, i));
2256 if (pointer_set_contains (set1, VARRAY_TREE (may_aliases2, i)))
2258 pointer_set_destroy (set1);
2262 pointer_set_destroy (set1);
/netbsd-6-1-5-RELEASE/external/bsd/tre/dist/lib/
H A Dtre-compile.c1090 tre_set_union(tre_mem_t mem, tre_pos_and_tags_t *set1, tre_pos_and_tags_t *set2, argument
1099 for (s1 = 0; set1[s1].position >= 0; s1++);
1105 for (s1 = 0; set1[s1].position >= 0; s1++)
1107 new_set[s1].position = set1[s1].position;
1108 new_set[s1].code_min = set1[s1].code_min;
1109 new_set[s1].code_max = set1[s1].code_max;
1110 new_set[s1].assertions = set1[s1].assertions | assertions;
1111 new_set[s1].class = set1[s1].class;
1112 new_set[s1].neg_classes = set1[s1].neg_classes;
1113 new_set[s1].backref = set1[s
[all...]
/netbsd-6-1-5-RELEASE/bin/csh/
H A Dset.c123 set1(vp, vecp, &shvhed);
443 set1(var, vec, &shvhed);
447 set1(Char *var, Char **vec, struct varent *head) function
H A Dextern.h277 void set1(Char *, Char **, struct varent *);
H A Dfunc.c210 set1(strip(p), saveblk(v), &aliases);
/netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/lib/
H A Dregex_internal.c1272 re_node_set_compare (const re_node_set *set1, const re_node_set *set2)
1275 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem)
1277 for (i = set1->nelem ; REG_VALID_INDEX (--i) ; )
1278 if (set1->elems[i] != set2->elems[i])
1270 re_node_set_compare(const re_node_set *set1, const re_node_set *set2) argument
/netbsd-6-1-5-RELEASE/gnu/dist/groff/src/devices/grodvi/
H A Ddvi.cpp145 set1 = 128, enumerator in enum:dvi_printer::__anon4821
398 out_unsigned(set1, code);

Completed in 300 milliseconds

12