Searched refs:bit (Results 76 - 100 of 1247) sorted by relevance

1234567891011>>

/netbsd-6-1-5-RELEASE/external/bsd/flex/dist/tests/test-header-nr/
H A Dscanner.l34 %option 8bit outfile="scanner.c" prefix="test" header="scanner.h"
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/cris/
H A Drd-pic-2.d4 # Check that 16-bit PIC relocs aren't overflowing.
H A Dshexpr-1.s1 ; This expression had a bit moved.
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/mips/
H A Dmips16e-64.s1 # Test the 64bit instructions of mips16e.
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/execute/ieee/
H A Dmul-subnormal-single-1.x2 # IRIX 6 sets the MIPS IV flush to zero bit by default, so this test
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.c-torture/execute/ieee/
H A Dmul-subnormal-single-1.x2 # IRIX 6 sets the MIPS IV flush to zero bit by default, so this test
/netbsd-6-1-5-RELEASE/sys/arch/evbmips/loongson/
H A Disa_machdep.c69 loongson_isa_specific_eoi(int bit) argument
71 KASSERT((bit < 16) && (bit >= 0));
72 loongson_isaimr &= ~(1 << bit);
73 if (bit & 8) {
79 OCW2_SELECT | OCW2_EOI | OCW2_SL | OCW2_ILS(bit & 7);
80 bit = 2;
88 OCW2_SELECT | OCW2_EOI | OCW2_SL | OCW2_ILS(bit);
/netbsd-6-1-5-RELEASE/dist/bzip2/
H A Dunzcrash.c6 and then repeatedly decompress it, each time with a different bit of
7 the compressed data inverted, so as to test all possible one-bit errors.
64 void flip_bit ( int bit )
66 int byteno = bit / 8;
67 int bitno = bit % 8;
69 //fprintf ( stderr, "(byte %d bit %d mask %d)",
78 int bit; local
102 for (bit = 0; bit < nZ*8; bit
[all...]
/netbsd-6-1-5-RELEASE/sys/arch/powerpc/fpu/
H A Dfpu_sqrt.c130 * zero bit at the top of x. Doing so means that q is not going to acquire
131 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
166 * bit at a time, from the top down, and is not used itself in the loop
168 * in an integer, one word at a time, which saves a bit of work. Also,
169 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
181 * Furthermore, we can prove with a bit of work that x never exceeds y by
188 * In fact, we want even one more bit (for a carry, to avoid compares), or
196 u_int bit, q, tt; local
274 * set the top bit in q, so we can do that manually and start
275 * the loop at the next bit dow
[all...]
/netbsd-6-1-5-RELEASE/sys/arch/sparc/fpu/
H A Dfpu_sqrt.c126 * 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...]
H A Dfpu_mul.c61 * Each step consists of shifting the accumulator right one bit
62 * (maintaining any guard bits) and, if the next bit in y is set,
64 * we advance one bit leftward in y. Algorithmically:
67 * for (bit = 0; bit < FP_NMANT; bit++) {
69 * if (Y & (1 << bit))
76 * shifted right, but at most one bit.
92 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
96 * run 32 times without adding X to A. We can do a 32-bit shif
105 register u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m; local
[all...]
/netbsd-6-1-5-RELEASE/dist/nvi/include/
H A Dbitstring.h47 /* byte of the bitstring bit is in */
48 #define _bit_byte(bit) \
49 ((bit) >> 3)
51 /* mask for the bit within its byte */
52 #define _bit_mask(bit) \
53 (1 << ((bit)&0x7))
69 /* is bit N of bitstring name set? */
70 #define bit_test(name, bit) \
71 ((name)[_bit_byte(bit)] & _bit_mask(bit))
[all...]
/netbsd-6-1-5-RELEASE/sys/arch/ia64/stand/common/
H A Dbitstring.h41 /* byte of the bitstring bit is in */
42 #define _bit_byte(bit) \
43 ((bit) >> 3)
45 /* mask for the bit within its byte */
46 #define _bit_mask(bit) \
47 (1 << ((bit)&0x7))
62 /* is bit N of bitstring name set? */
63 #define bit_test(name, bit) \
64 ((name)[_bit_byte(bit)] & _bit_mask(bit))
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/i386/
H A Dx86-64-opcode.s16 IRET # -- -- -- -- CF ; 32-bit operand size
17 IRETW # 66 -- -- -- CF ; O16 for 16-bit operand size
18 IRETQ # -- -- -- 48 CF ; REX for 64-bit operand size
35 MOVw $0x7000,(%r8) # 66 -- -- 41 C7 00 00 70 ; REX to access upper reg. O16 for 16-bit operand size
36 MOVw $0x7000,(%rax) # 66 -- -- -- C7 00 00 70 ; O16 for 16-bit operand size
41 MOVw $0x7000,(%r8) # 66 -- -- -- 41 C7 00 00 70 ; O16 for 16-bit operand size
42 MOVw $0x7000,(%rax) # 66 -- -- -- C7 00 00 70 ; O16 for 16-bit operand size
46 MOVw $0x7000,(%r8) # 66 -- -- 41 C7 00 00 70 ; REX to access upper reg. O16 for 16-bit operand size
47 MOVw $0x7000,(%rax) # 66 -- -- -- C7 00 00 70 ; O16 for 16-bit operand size
50 MOVq $0x70000000,(%r8) # -- -- -- 49 C7 00 00 00 00 70 ; REX for 64-bit operan
[all...]
H A Dx86-64-dw2-compress-2.d3 #name: 64bit DWARF2 debugging information 2
/netbsd-6-1-5-RELEASE/sys/arch/arm/at91/
H A Dat91pio.c239 aprint_normal(" bit %d", paa->paa_bit);
245 at91pio_read(struct at91pio_softc *sc, int bit) argument
248 sc->pins[bit].pin_caps = 0;
250 return (PIO_READ(sc, PIO_PDSR) >> bit) & 1;
254 at91pio_set(struct at91pio_softc *sc, int bit) argument
257 sc->pins[bit].pin_caps = 0;
259 PIO_WRITE(sc, PIO_SODR, (1U << bit));
263 at91pio_clear(struct at91pio_softc *sc, int bit) argument
266 sc->pins[bit].pin_caps = 0;
268 PIO_WRITE(sc, PIO_CODR, (1U << bit));
272 at91pio_in(struct at91pio_softc *sc, int bit) argument
281 at91pio_out(struct at91pio_softc *sc, int bit) argument
289 at91pio_per(struct at91pio_softc *sc, int bit, int perab) argument
313 at91pio_intr_establish(struct at91pio_softc *sc, int bit, int ipl, int (*ireq_func)(void *), void *arg) argument
368 at91pio_intr_disestablish(struct at91pio_softc *sc, int bit, void *cookie) argument
405 int bit; local
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/config/
H A Dprint-sysroot-suffix.sh102 bit=
114 bit=`"$0" "$padding " "$optstring$x/" "$@"`
118 if [ "$lastbit" = "$bit" ]; then
125 lastbit="$bit"
127 bit=`"$0" "$padding " "$optstring" "$@"`
128 if [ "$bit" = "$lastbit" ]; then
130 echo "$bit"
132 echo "$n%{$result:$bit}"
135 echo "$n%{$result$lastopt:$lastbit;$n:$bit}"
/netbsd-6-1-5-RELEASE/external/public-domain/xz/dist/src/liblzma/rangecoder/
H A Dprice.h29 rc_bit_price(const probability prob, const uint32_t bit) argument
31 return lzma_rc_prices[(prob ^ ((UINT32_C(0) - bit)
59 const uint32_t bit = symbol & 1; local
61 price += rc_bit_price(probs[symbol], bit);
76 const uint32_t bit = symbol & 1; local
78 price += rc_bit_price(probs[model_index], bit);
79 model_index = (model_index << 1) + bit;
/netbsd-6-1-5-RELEASE/sys/arch/m68k/fpe/
H A Dfpu_mul.c61 * Each step consists of shifting the accumulator right one bit
62 * (maintaining any guard bits) and, if the next bit in y is set,
64 * we advance one bit leftward in y. Algorithmically:
67 * for (bit = 0; bit < FP_NMANT; bit++) {
69 * if (Y & (1 << bit))
76 * shifted right, but at most one bit.
92 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
96 * run 32 times without adding X to A. We can do a 32-bit shif
105 register u_int a2, a1, a0, x2, x1, x0, bit, m; local
[all...]
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/demos/prime/
H A DMakefile15 @echo Test creating a 128-bit prime
17 @echo Test creating a 256-bit prime
19 @echo Test creating a 512-bit prime
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/debug/
H A Dpr29558.c3 void stpi_unpack_16_1(int length, unsigned char *out, unsigned char bit) argument
7 for (bit = 128; length > 0; length--) {
9 temp[0] |= bit;
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/arm/
H A Dgroup-reloc-ldc-encoding-bad.l98 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
99 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
100 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
101 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
102 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
103 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
104 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
105 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
106 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
107 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit numbe
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/mmix/
H A Dloc-3.s1 # Check that a little bit of LOC:ing back and forward between code and
/netbsd-6-1-5-RELEASE/external/bsd/flex/dist/tests/test-header-r/
H A Dscanner.l38 %option 8bit outfile="scanner.c" prefix="test"
/netbsd-6-1-5-RELEASE/external/bsd/flex/dist/tests/test-linedir-r/
H A Dscanner.l38 %option 8bit outfile="scanner.c" prefix="test"

Completed in 210 milliseconds

1234567891011>>