Searched refs:bit (Results 1 - 25 of 411) sorted by relevance

1234567891011>>

/freebsd-10.1-release/contrib/binutils/libiberty/
H A Dffs.c1 /* 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-10.1-release/contrib/gcclibs/libiberty/
H A Dffs.c1 /* 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-10.1-release/sys/mips/include/
H A Dfls64.h34 * Find Last Set bit (64 bit)
39 int bit; local
43 for (bit = 1; ((mask & 0x1ULL) == 0); bit++)
45 return (bit);
/freebsd-10.1-release/contrib/sendmail/include/sm/
H A Dbitops.h20 ** 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-10.1-release/lib/libc/string/
H A Dffs.c39 * Find First Set bit
44 int bit; local
48 for (bit = 1; !(mask & 1); bit++)
50 return (bit);
H A Dffsl.c36 * Find First Set bit
41 int bit; local
45 for (bit = 1; !(mask & 1); bit++)
47 return (bit);
H A Dffsll.c36 * Find First Set bit
41 int bit; local
45 for (bit = 1; !(mask & 1); bit++)
47 return (bit);
H A Dfls.c36 * Find Last Set bit
41 int bit; local
45 for (bit = 1; mask != 1; bit++)
47 return (bit);
H A Dflsl.c36 * Find Last Set bit
41 int bit; local
45 for (bit = 1; mask != 1; bit++)
47 return (bit);
H A Dflsll.c36 * Find Last Set bit
41 int bit; local
45 for (bit = 1; mask != 1; bit++)
47 return (bit);
H A Dstrcspn.c41 * 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 Dstrspn.c41 * 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-10.1-release/sys/libkern/
H A Dffs.c36 * Find First Set bit
41 int bit; local
45 for (bit = 1; !(mask & 1); bit++)
47 return (bit);
H A Dffsl.c36 * Find First Set bit
41 int bit; local
45 for (bit = 1; !(mask & 1); bit++)
47 return (bit);
H A Dfls.c36 * Find Last Set bit
41 int bit; local
45 for (bit = 1; mask != 1; bit++)
47 return (bit);
H A Dflsl.c36 * Find Last Set bit
41 int bit; local
45 for (bit = 1; mask != 1; bit++)
47 return (bit);
H A Dflsll.c35 * Find Last Set bit
40 int bit; local
44 for (bit = 1; mask != 1; bit++)
46 return (bit);
H A Dstrcspn.c41 * 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)
/freebsd-10.1-release/contrib/gcc/config/
H A Dudivmodsi4.c4 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-10.1-release/sys/sparc64/include/
H A Drunq.h49 u_long bit; local
53 for (bit = 1; (mask & 1UL) == 0; bit++)
55 return (bit);
/freebsd-10.1-release/contrib/gcc/config/i386/
H A Dt-rtems-i38617 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-10.1-release/sys/ofed/include/linux/
H A Dbitops.h84 int bit; local
86 for (bit = 0; size >= BITS_PER_LONG;
87 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
90 return (bit + __ffsl(*addr));
95 bit += __ffsl(mask);
97 bit += size;
99 return (bit);
106 int bit; local
108 for (bit = 0; size >= BITS_PER_LONG;
109 size -= BITS_PER_LONG, bit
129 int bit; local
155 int bit; local
193 int bit; local
302 test_and_clear_bit(long bit, long *var) argument
317 test_and_set_bit(long bit, long *var) argument
[all...]
/freebsd-10.1-release/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/baddof/
H A Dbaddof.c58 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-10.1-release/usr.bin/dtc/
H A Dutil.hh65 for (int bit=(sizeof(T) - 1)*8 ; bit>=0 ; bit-= 8)
67 v.push_back((val >> bit) & 0xff);
/freebsd-10.1-release/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h4 /* Maximum bitmap bit count is 2^LG_BITMAP_MAXBITS. */
60 bool bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
61 void bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
63 void bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
77 bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
82 assert(bit < binfo->nbits);
83 goff = bit >> LG_BITMAP_GROUP_NBITS;
85 return (!(g & (1LU << (bit & BITMAP_GROUP_NBITS_MASK))));
89 bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
95 assert(bit < binf
125 size_t bit; local
145 bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
[all...]

Completed in 308 milliseconds

1234567891011>>