/freebsd-9.3-release/contrib/binutils/libiberty/ |
H A D | ffs.c | 1 /* ffs -- Find the first bit set in the parameter 5 Find the first (least significant) bit set in @var{valu}. Bits are 6 numbered from right to left, starting with bit 1 (corresponding to the 16 register int bit; local 21 for (bit = 1; !(valu & 1); bit++) 24 return bit;
|
/freebsd-9.3-release/contrib/gcclibs/libiberty/ |
H A D | ffs.c | 1 /* ffs -- Find the first bit set in the parameter 5 Find the first (least significant) bit set in @var{valu}. Bits are 6 numbered from right to left, starting with bit 1 (corresponding to the 16 register int bit; local 21 for (bit = 1; !(valu & 1); bit++) 24 return bit;
|
/freebsd-9.3-release/sys/mips/include/ |
H A D | fls64.h | 34 * Find Last Set bit (64 bit) 39 int bit; local 43 for (bit = 1; ((mask & 0x1ULL) == 0); bit++) 45 return (bit);
|
/freebsd-9.3-release/contrib/bind9/lib/dns/include/dns/ |
H A D | bit.h | 18 /* $Id: bit.h,v 1.14 2007/06/19 23:47:16 tbox Exp $ */ 23 /*! \file dns/bit.h */ 30 #define DNS_BIT_SET(bit, bitset) \ 31 (*(bitset) |= ((dns_bitset_t)1 << (bit))) 32 #define DNS_BIT_CLEAR(bit, bitset) \ 33 (*(bitset) &= ~((dns_bitset_t)1 << (bit))) 34 #define DNS_BIT_CHECK(bit, bitset) \ 35 ISC_TF((*(bitset) & ((dns_bitset_t)1 << (bit))) \ 36 == ((dns_bitset_t)1 << (bit)))
|
/freebsd-9.3-release/contrib/sendmail/include/sm/ |
H A D | bitops.h | 20 ** Data structure for bit maps. 22 ** Each bit in this map can be referenced by an ascii character. 23 ** This is 256 possible bits, or 32 8-bit bytes. 26 # define BITMAPBITS 256 /* number of bits in a bit map */ 28 # define BITMAPBYTES (BITMAPBITS / BYTEBITS) /* number of bytes in bit map */ 34 # define _BITWORD(bit) (((unsigned char)(bit) / (BYTEBITS * sizeof (int))) & BITMAPMAX) 35 # define _BITBIT(bit) ((unsigned int)1 << ((unsigned char)(bit) % (BYTEBITS * sizeof (int)))) 39 /* properly case and truncate bit */ [all...] |
/freebsd-9.3-release/lib/libc/string/ |
H A D | ffs.c | 39 * Find First Set bit 44 int bit; local 48 for (bit = 1; !(mask & 1); bit++) 50 return (bit);
|
H A D | ffsl.c | 36 * Find First Set bit 41 int bit; local 45 for (bit = 1; !(mask & 1); bit++) 47 return (bit);
|
H A D | ffsll.c | 36 * Find First Set bit 41 int bit; local 45 for (bit = 1; !(mask & 1); bit++) 47 return (bit);
|
H A D | fls.c | 36 * Find Last Set bit 41 int bit; local 45 for (bit = 1; mask != 1; bit++) 47 return (bit);
|
H A D | flsl.c | 36 * Find Last Set bit 41 int bit; local 45 for (bit = 1; mask != 1; bit++) 47 return (bit);
|
H A D | flsll.c | 36 * Find Last Set bit 41 int bit; local 45 for (bit = 1; mask != 1; bit++) 47 return (bit);
|
H A D | strcspn.c | 41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to 45 u_long bit; local 52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */ 61 bit = BIT(*charset); 62 tbl[idx] |= bit; 67 bit = BIT(*s1); 68 if ((tbl[idx] & bit) != 0)
|
H A D | strspn.c | 41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to 45 u_long bit; local 52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */ 60 bit = BIT(*charset); 61 tbl[idx] |= bit; 66 bit = BIT(*s1); 67 if ((tbl[idx] & bit) == 0)
|
/freebsd-9.3-release/sys/libkern/ |
H A D | ffs.c | 36 * Find First Set bit 41 int bit; local 45 for (bit = 1; !(mask & 1); bit++) 47 return (bit);
|
H A D | ffsl.c | 36 * Find First Set bit 41 int bit; local 45 for (bit = 1; !(mask & 1); bit++) 47 return (bit);
|
H A D | fls.c | 36 * Find Last Set bit 41 int bit; local 45 for (bit = 1; mask != 1; bit++) 47 return (bit);
|
H A D | flsl.c | 36 * Find Last Set bit 41 int bit; local 45 for (bit = 1; mask != 1; bit++) 47 return (bit);
|
H A D | strcspn.c | 41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to 45 u_long bit; local 52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */ 61 bit = BIT(*charset); 62 tbl[idx] |= bit; 67 bit = BIT(*s1); 68 if ((tbl[idx] & bit) != 0)
|
H A D | strspn.c | 41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to 45 u_long bit; local 52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */ 60 bit = BIT(*charset); 61 tbl[idx] |= bit; 66 bit = BIT(*s1); 67 if ((tbl[idx] & bit) == 0)
|
/freebsd-9.3-release/contrib/gcc/config/ |
H A D | udivmodsi4.c | 4 unsigned long bit = 1; local 7 while (den < num && bit && !(den & (1L<<31))) 10 bit <<=1; 12 while (bit) 17 res |= bit; 19 bit >>=1;
|
/freebsd-9.3-release/sys/ofed/include/linux/ |
H A D | bitops.h | 70 int bit; local 72 for (bit = 0; size >= BITS_PER_LONG; 73 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) { 76 return (bit + __ffsl(*addr)); 81 bit += __ffsl(mask); 83 bit += size; 85 return (bit); 92 int bit; local 94 for (bit = 0; size >= BITS_PER_LONG; 95 size -= BITS_PER_LONG, bit 115 int bit; local 141 int bit; local 179 int bit; local 288 test_and_clear_bit(long bit, long *var) argument 303 test_and_set_bit(long bit, long *var) argument [all...] |
/freebsd-9.3-release/sys/sparc64/include/ |
H A D | runq.h | 49 u_long bit; local 53 for (bit = 1; (mask & 1UL) == 0; bit++) 55 return (bit);
|
/freebsd-9.3-release/contrib/gcc/config/i386/ |
H A D | t-rtems-i386 | 17 FPBIT = fp-bit.c 18 DPBIT = dp-bit.c 20 LIB2FUNCS_EXTRA = xp-bit.c 22 dp-bit.c: $(srcdir)/config/fp-bit.c 23 echo '#ifdef __LITTLE_ENDIAN__' > dp-bit.c 24 echo '#define FLOAT_BIT_ORDER_MISMATCH' >>dp-bit.c 25 echo '#endif' >> dp-bit.c 26 cat $(srcdir)/config/fp-bit.c >> dp-bit [all...] |
/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/baddof/ |
H A D | baddof.c | 58 int bit, i; local 67 * We are going iterate through, flipping one bit and attempting 70 for (bit = 0; bit < len * 8; bit++) { 71 saved = buf[bit / 8]; 72 buf[bit / 8] ^= (1 << (bit % 8)); 74 if ((bit % 100) == 0) 75 printf("%d\n", bit); [all...] |
/freebsd-9.3-release/contrib/bzip2/ |
H A D | unzcrash.c | 6 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...] |