/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/g++.dg/abi/ |
H A D | bitfield1.C | 15 Int bit : 1; // signedness by -f{signed,unsigned}-bitfields member in struct:A 24 a.bit = 1; 30 if (a.bit != 1)
|
H A D | bitfield2.C | 15 Int bit : 1; // signedness by -f{signed,unsigned}-bitfields member in struct:A 24 a.bit = 1; 30 if (a.bit != -1)
|
/netbsd-6-1-5-RELEASE/sys/arch/arm/ep93xx/ |
H A D | epgpiovar.h | 44 int epgpio_read(struct epgpio_softc *,epgpio_port, int bit); 45 void epgpio_set(struct epgpio_softc *,epgpio_port, int bit); 46 void epgpio_clear(struct epgpio_softc *,epgpio_port, int bit); 47 void epgpio_in(struct epgpio_softc *,epgpio_port, int bit); 48 void epgpio_out(struct epgpio_softc *,epgpio_port, int bit); 50 void *epgpio_intr_establish(struct epgpio_softc *,epgpio_port, int bit, 52 void epgpio_intr_disestablish(struct epgpio_softc *,epgpio_port, int bit);
|
/netbsd-6-1-5-RELEASE/external/gpl2/lvm2/dist/libdm/datastruct/ |
H A D | bitset.c | 60 static inline int _test_word(uint32_t test, int bit) argument 62 while (bit < (int) DM_BITS_PER_INT) { 63 if (test & (0x1 << bit)) 64 return bit; 65 bit++; 73 int bit, word; local 76 last_bit++; /* otherwise we'll return the same bit again */ 84 bit = last_bit & (DM_BITS_PER_INT - 1); 86 if ((bit = _test_word(test, bit)) > [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/hcrypto/ |
H A D | test_rand.c | 154 int bit, i; local 160 for (bit = 0; bit < 8 && c; bit++) { 162 bits[bit]++; 167 for (bit = 0; bit < 8; bit++) { 169 res = ((double)abs(len - bits[bit] * 2)) / (double)len; 172 bit, bi [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/tmux/dist/compat/ |
H A D | bitstring.h | 52 /* byte of the bitstring bit is in */ 53 #define _bit_byte(bit) \ 54 ((bit) >> 3) 56 /* mask for the bit within its byte */ 57 #define _bit_mask(bit) \ 58 (1 << ((bit)&0x7)) 73 /* is bit N of bitstring name set? */ 74 #define bit_test(name, bit) \ 75 ((name)[_bit_byte(bit)] & _bit_mask(bit)) [all...] |
/netbsd-6-1-5-RELEASE/include/ |
H A D | bitstring.h | 57 /* byte of the bitstring bit is in */ 58 #define _bit_byte(bit) \ 59 (uint32_t)((bit) >> 3) 61 /* mask for the bit within its byte */ 62 #define _bit_mask(bit) \ 63 (uint32_t)((1 << (uint32_t)((bit)&0x7))) 78 /* is bit N of bitstring name set? */ 79 #define bit_test(name, bit) \ 80 /*LINTED bitwise on signed*/((name)[_bit_byte(bit)] & _bit_mask(bit)) [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/m68hc11/ |
H A D | bug-1825.s | 8 ldx L1,pc ; Assemble to 5-bit > 0 offset 13 subd L1,pc ; Assemble to 5-bit < 0 offset 16 ldab L3,pc ; 5-bit < 0 offset 17 ldab L4,pc ; 5-bit > 0 offset 21 subd L4,pc ; 9-bit < 0 offset 22 addd L5,pc ; 9-bit > 0 offset 26 orab L5,pc ; 9 bit < 0 offset (min value) 27 oraa L6,pc ; 9 bit > 0 offset (max value) 31 orab L6,pc ; 16 bit < 0 offset 32 anda _main,pc ; 16 bit < [all...] |
H A D | indexed12.s | 3 ;; with a 5, 9 and 16-bit offset. 13 ldaa L2-L1,x ; -> ldaa 2,x (5-bit offset), text seg 14 adda L1-L2,y ; -> adda -2,y (5-bit offset), text seg 16 orab L7-L6,sp ; -> orab 8,sp (5-bit offset), text seg 17 anda L8-L7,sp ; -> anda 15,sp (5-bit offset), text seg 18 eora L7-L8,sp ; -> eora -15,sp (5-bit offset), text seg 19 eorb L7-L9,sp ; -> eorb -16,sp (5-bit offset), text seg 21 andb L9-L7,sp ; -> andb 16,sp (9-bit offset), text seg 22 staa L7-L10,x ; -> staa -17,x (9-bit offset), text seg 23 stab L11-L10,y ; -> stab 128,y (9-bit offse [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/mips/ |
H A D | mips32r2-fp32.s | 8 # Even registers are supported w/ 32-bit FPU, odd 9 # registers supported only for 64-bit FPU. 10 # Only the 32-bit FPU instructions are tested here.
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/i386/ |
H A D | x86-64-inval.s | 9 calll *%eax # 32-bit data size not allowed 10 calll *(%ax) # 32-bit data size not allowed 11 calll *(%eax) # 32-bit data size not allowed 12 calll *(%r8) # 32-bit data size not allowed 13 calll *(%rax) # 32-bit data size not allowed 14 callq *(%ax) # no 16-bit addressing 17 enterl $0,$0 # can't have 32-bit stack operands 20 jmpl *%eax # 32-bit data size not allowed 21 jmpl *(%ax) # 32-bit data size not allowed 22 jmpl *(%eax) # 32-bit dat [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/mmix/ |
H A D | reloc16.s | 1 # Simple relocations against 16-bit extern symbols.
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/sh/sh64/ |
H A D | abi-32.s | 1 ! Check successful .abi assertion for 32-bit ABI.
|
H A D | immexpr32-2.d | 4 #name: Resolved 64-bit operand, 32-bit ABI.
|
H A D | immexpr64-2.d | 4 #name: Resolved 64-bit operand, 64-bit ABI.
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/ld/testsuite/ld-d10v/ |
H A D | reloc-005.s | 1 ;; Test 18 bit pc rel relocation
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/compat/abi/ |
H A D | bitfield1_x.C | 13 a.bit = 1;
|
H A D | bitfield1_y.C | 13 if (a.bit != 1)
|
H A D | bitfield2_x.C | 13 a.bit = 1;
|
H A D | bitfield2_y.C | 13 if (a.bit != -1)
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/g++.dg/compat/abi/ |
H A D | bitfield1_x.C | 13 a.bit = 1;
|
H A D | bitfield1_y.C | 13 if (a.bit != 1)
|
H A D | bitfield2_x.C | 13 a.bit = 1;
|
H A D | bitfield2_y.C | 13 if (a.bit != -1)
|
/netbsd-6-1-5-RELEASE/sys/arch/m68k/fpe/ |
H A D | fpu_sqrt.c | 126 * zero bit at the top of x. Doing so means that q is not going to acquire 127 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the 162 * bit at a time, from the top down, and is not used itself in the loop 164 * in an integer, one word at a time, which saves a bit of work. Also, 165 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are 177 * Furthermore, we can prove with a bit of work that x never exceeds y by 184 * In fact, we want even one more bit (for a carry, to avoid compares), or 192 register u_int bit, q, tt; local 253 * set the top bit in q, so we can do that manually and start 254 * the loop at the next bit dow [all...] |