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

1234567891011>>

/freebsd-current/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-current/sys/contrib/device-tree/include/dt-bindings/mfd/
H A Dstm32f4-rcc.h34 #define STM32F4_AHB1_RESET(bit) (STM32F4_RCC_AHB1_##bit + (0x10 * 8))
35 #define STM32F4_AHB1_CLOCK(bit) (STM32F4_RCC_AHB1_##bit)
44 #define STM32F4_AHB2_RESET(bit) (STM32F4_RCC_AHB2_##bit + (0x14 * 8))
45 #define STM32F4_AHB2_CLOCK(bit) (STM32F4_RCC_AHB2_##bit + 0x20)
51 #define STM32F4_AHB3_RESET(bit) (STM32F4_RCC_AHB3_##bit
[all...]
H A Dstm32f7-rcc.h34 #define STM32F7_AHB1_RESET(bit) (STM32F7_RCC_AHB1_##bit + (0x10 * 8))
35 #define STM32F7_AHB1_CLOCK(bit) (STM32F7_RCC_AHB1_##bit)
45 #define STM32F7_AHB2_RESET(bit) (STM32F7_RCC_AHB2_##bit + (0x14 * 8))
46 #define STM32F7_AHB2_CLOCK(bit) (STM32F7_RCC_AHB2_##bit + 0x20)
52 #define STM32F7_AHB3_RESET(bit) (STM32F7_RCC_AHB3_##bit
[all...]
H A Dstm32h7-rcc.h17 #define STM32H7_AHB3_RESET(bit) (STM32H7_RCC_AHB3_##bit + (0x7C * 8))
28 #define STM32H7_AHB1_RESET(bit) (STM32H7_RCC_AHB1_##bit + (0x80 * 8))
37 #define STM32H7_AHB2_RESET(bit) (STM32H7_RCC_AHB2_##bit + (0x84 * 8))
56 #define STM32H7_AHB4_RESET(bit) (STM32H7_RCC_AHB4_##bit + (0x88 * 8))
62 #define STM32H7_APB3_RESET(bit) (STM32H7_RCC_APB3_##bit
[all...]
/freebsd-current/sys/compat/linuxkpi/common/include/linux/
H A Dbitops.h128 int bit; local
130 for (bit = 0; size >= BITS_PER_LONG;
131 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
134 return (bit + __ffsl(*addr));
139 bit += __ffsl(mask);
141 bit += size;
143 return (bit);
150 int bit; local
152 for (bit = 0; size >= BITS_PER_LONG;
153 size -= BITS_PER_LONG, bit
173 int bit; local
199 int bit; local
239 int bit; local
292 test_and_clear_bit(long bit, volatile unsigned long *var) argument
307 __test_and_clear_bit(long bit, volatile unsigned long *var) argument
322 test_and_set_bit(long bit, volatile unsigned long *var) argument
337 __test_and_set_bit(long bit, volatile unsigned long *var) argument
[all...]
H A Dwait_bit.h45 clear_and_wake_up_bit(int bit, void *word) argument
47 clear_bit_unlock(bit, word);
48 wake_up_bit(word, bit);
52 bit_waitqueue(void *word, int bit) argument
/freebsd-current/sys/dev/qat/qat_api/include/
H A Dcpa_types.h160 * To test whether a bit in the bitmap is set, use @ref
170 #define CPA_BITMAP_BIT_TEST(bitmask, bit) \
171 ((bitmask[(bit)/32]) & (0x1 << ((bit)%32)))
174 * Test a specified bit in the specified bitmap. The bitmap may have been
175 * declared using @ref CPA_BITMAP. Returns a Boolean (true if the bit is
178 #define CPA_BITMAP_BIT_SET(bitmask, bit) \
179 (bitmask[(bit)/32] |= (0x1 << ((bit)%32)))
183 * Set a specified bit i
[all...]
/freebsd-current/sys/contrib/openzfs/include/os/linux/spl/sys/
H A Dwait.h31 #define spl_wait_on_bit(word, bit, mode) wait_on_bit(word, bit, mode)
41 #define spl_wait_on_bit(word, bit, mode) \
42 wait_on_bit(word, bit, spl_bit_wait, mode)
/freebsd-current/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-current/contrib/llvm-project/libcxx/modules/std/
H A Dbit.inc11 // [bit.cast], bit_cast
15 // [bit.byteswap], byteswap
19 // [bit.pow.two], integral powers of 2
25 // [bit.rotate], rotating
29 // [bit.count], counting
36 // [bit.endian], endian
/freebsd-current/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h11 /* Maximum bitmap bit count is 2^LG_BITMAP_MAXBITS. */
13 /* Maximum bitmap bit count is determined by maximum regions per slab. */
16 /* Maximum bitmap bit count is determined by number of extent size classes. */
195 bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) { argument
199 assert(bit < binfo->nbits);
200 goff = bit >> LG_BITMAP_GROUP_NBITS;
202 return !(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)));
206 bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) { argument
211 assert(bit < binfo->nbits);
212 assert(!bitmap_get(bitmap, binfo, bit));
246 size_t bit = 0; local
302 size_t bit; local
331 bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
[all...]
/freebsd-current/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-current/sys/xen/
H A Dxen-os.h123 xen_test_bit(int bit, volatile xen_ulong_t *addr) argument
125 unsigned long mask = 1UL << (bit % NBPL);
127 return !!(atomic_load_acq_xen_ulong(&addr[bit / NBPL]) & mask);
131 xen_set_bit(int bit, volatile xen_ulong_t *addr) argument
133 atomic_set_xen_ulong(&addr[bit / NBPL], 1UL << (bit % NBPL));
137 xen_clear_bit(int bit, volatile xen_ulong_t *addr) argument
139 atomic_clear_xen_ulong(&addr[bit / NBPL], 1UL << (bit % NBPL));
/freebsd-current/contrib/dialog/samples/
H A Dinputbox6-8bit2 # $Id: inputbox6-8bit,v 1.8 2020/11/26 00:03:58 tom Exp $
8 . ./testdata-8bit
/freebsd-current/sys/arm64/include/
H A Dacle-compat.h4 #error Do not include this header, used only for 32-bit compatibility
H A Dcpuinfo.h4 #error Do not include this header, used only for 32-bit compatibility
H A Dsysreg.h4 #error Do not include this header, used only for 32-bit compatibility
/freebsd-current/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...]
/freebsd-current/sys/libkern/
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-current/lib/libc/string/
H A Dstrspn.c40 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to
44 u_long bit; local
51 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */
59 bit = BIT(*charset);
60 tbl[idx] |= bit;
65 bit = BIT(*s1);
66 if ((tbl[idx] & bit) == 0)
H A Dstrcspn.c40 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to
44 u_long bit; local
51 #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-current/contrib/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...]
/freebsd-current/sys/powerpc/fpu/
H A Dfpu_sqrt.c124 * zero bit at the top of x. Doing so means that q is not going to acquire
125 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
160 * bit at a time, from the top down, and is not used itself in the loop
162 * in an integer, one word at a time, which saves a bit of work. Also,
163 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
175 * Furthermore, we can prove with a bit of work that x never exceeds y by
182 * In fact, we want even one more bit (for a carry, to avoid compares), or
190 u_int bit, q, tt; local
268 * set the top bit in q, so we can do that manually and start
269 * the loop at the next bit dow
[all...]

Completed in 362 milliseconds

1234567891011>>