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

1234567891011>>

/freebsd-11-stable/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-11-stable/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-11-stable/sys/mips/include/
H A Dfls64.h37 * Find Last Set bit (64 bit)
42 int bit; local
46 for (bit = 1; ((mask & 0x1ULL) == 0); bit++)
48 return (bit);
/freebsd-11-stable/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-11-stable/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);
/freebsd-11-stable/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 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.c35 * Find Last Set bit
40 int bit; local
44 for (bit = 1; mask != 1; bit++)
46 return (bit);
/freebsd-11-stable/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-11-stable/sys/compat/linuxkpi/common/include/linux/
H A Dbitops.h118 int bit; local
120 for (bit = 0; size >= BITS_PER_LONG;
121 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
124 return (bit + __ffsl(*addr));
129 bit += __ffsl(mask);
131 bit += size;
133 return (bit);
140 int bit; local
142 for (bit = 0; size >= BITS_PER_LONG;
143 size -= BITS_PER_LONG, bit
163 int bit; local
189 int bit; local
229 int bit; local
279 test_and_clear_bit(long bit, volatile unsigned long *var) argument
294 __test_and_clear_bit(long bit, volatile unsigned long *var) argument
309 test_and_set_bit(long bit, volatile unsigned long *var) argument
324 __test_and_set_bit(long bit, volatile unsigned long *var) argument
[all...]
/freebsd-11-stable/sys/sparc64/include/
H A Drunq.h49 u_long bit; local
53 for (bit = 1; (mask & 1UL) == 0; bit++)
55 return (bit);
/freebsd-11-stable/contrib/wpa/src/utils/
H A Dbitfield.c40 void bitfield_set(struct bitfield *bf, size_t bit) argument
42 if (bit >= bf->max_bits)
44 bf->bits[bit / 8] |= BIT(bit % 8);
48 void bitfield_clear(struct bitfield *bf, size_t bit) argument
50 if (bit >= bf->max_bits)
52 bf->bits[bit / 8] &= ~BIT(bit % 8);
56 int bitfield_is_set(struct bitfield *bf, size_t bit) argument
58 if (bit >
[all...]
H A Dbitfield.h16 void bitfield_set(struct bitfield *bf, size_t bit);
17 void bitfield_clear(struct bitfield *bf, size_t bit);
18 int bitfield_is_set(struct bitfield *bf, size_t bit);
/freebsd-11-stable/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h4 /* Maximum bitmap bit count is 2^LG_BITMAP_MAXBITS. */
127 bool bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
128 void bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
130 void bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
154 bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
159 assert(bit < binfo->nbits);
160 goff = bit >> LG_BITMAP_GROUP_NBITS;
162 return (!(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK))));
166 bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
172 assert(bit < binf
204 size_t bit; local
233 bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
[all...]
/freebsd-11-stable/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-11-stable/sys/xen/
H A Dxen-os.h104 xen_test_bit(int bit, volatile long *addr) argument
106 unsigned long mask = 1UL << (bit % NBPL);
108 return !!(atomic_load_acq_long(&addr[bit / NBPL]) & mask);
112 xen_set_bit(int bit, volatile long *addr) argument
114 atomic_set_long(&addr[bit / NBPL], 1UL << (bit % NBPL));
118 xen_clear_bit(int bit, volatile long *addr) argument
120 atomic_clear_long(&addr[bit / NBPL], 1UL << (bit % NBPL));
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/Process/Utility/
H A DInstructionUtils.h15 // Common utilities for manipulating instruction bit fields.
19 // Return the bit field(s) from the most significant bit (msbit) to the
20 // least significant bit (lsbit) of a 64-bit unsigned value.
27 // Return the bit field(s) from the most significant bit (msbit) to the
28 // least significant bit (lsbit) of a 32-bit unsigned value.
35 // Return the bit valu
36 Bit32(const uint32_t bits, const uint32_t bit) argument
40 Bit64(const uint64_t bits, const uint32_t bit) argument
[all...]

Completed in 131 milliseconds

1234567891011>>