Searched refs:bit (Results 1 - 25 of 75) sorted by path

123

/haiku/headers/libs/agg/
H A Dagg_bitset_iterator.h42 unsigned bit() const function in class:agg::bitset_iterator
H A Dagg_math.h266 //significant bit of the value. For other processors
289 //arcitectures including 64bit ones.
291 int bit=0;
299 bit = t >> 24;
300 if(bit)
302 bit = g_elder_bit_table[bit] + 24;
306 bit = (t >> 16) & 0xFF;
307 if(bit)
309 bit
[all...]
/haiku/src/add-ons/kernel/drivers/audio/echo/generic/
H A DCChannelMask.cpp94 // Retrieve an output bit mask and an input bitmask.
133 // Call SetIndexInMask and ClearIndexInMask to set or clear a single bit.
158 // The search starts at the bit specified by wStartPipeIndex and returns
159 // the pipe index for the first non-zero bit found.
167 CH_MASK bit; local
170 bit = 1 << wStartPipeIndex;
172 while (bit != 0)
174 if (0 != (m_Mask & bit))
177 bit <<= 1;
188 // Returns TRUE if the bit specifie
467 CH_MASK_DSP bit,temp; local
480 CH_MASK_DSP bit,temp; local
498 CH_MASK_DSP temp,bit; local
[all...]
/haiku/src/add-ons/kernel/drivers/disk/nvme/libnvme/
H A Dnvme_common.h363 * Test a bit value.
365 static inline int test_bit(__u8 *bitmap, unsigned int bit) argument
367 return bitmap[bit >> 3] & (1U << (bit & 0x7));
371 * Set a bit.
373 static inline void set_bit(__u8 *bitmap, unsigned int bit) argument
375 bitmap[bit >> 3] |= 1U << (bit & 0x7);
379 * Clear a bit.
381 static inline void clear_bit(__u8 *bitmap, unsigned int bit) argument
393 unsigned int i, j, bit, count = (nr_bits + 63) >> 6; local
[all...]
/haiku/src/add-ons/kernel/drivers/dvb/cx23882/
H A Di2c_core.c202 int bit = (byte >> i) & 1; local
204 if (bit)
211 TRACE("i2c_writebyte timeout at bit %d\n", i);
215 if (bit == 1 && 0 == bus->get_sda(bus->cookie)) {
217 // TRACE("i2c_writebyte lost arbitration at bit %d\n", i);
246 TRACE("i2c_readbyte timeout at bit %d\n", i);
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dbitmap.c49 * ntfs_bit_set - set a bit in a field of bits
51 * @bit: bit to set
52 * @new_value: value to set bit to (0 or 1)
54 * Set the bit @bit in the @bitmap to @new_value. Ignore all errors.
56 void ntfs_bit_set(u8 *bitmap, const u64 bit, const u8 new_value) argument
61 bitmap[bit >> 3] &= ~(1 << (bit & 7));
63 bitmap[bit >>
74 ntfs_bit_get(const u8 *bitmap, const u64 bit) argument
90 ntfs_bit_get_and_set(u8 *bitmap, const u64 bit, const u8 new_value) argument
120 int bit, firstbyte, lastbyte, lastbyte_pos, tmp, ret = -1; local
[all...]
H A Dbitmap.h32 * - Operations are 8-bit only to ensure the functions work both on little
33 * and big endian machines! So don't make them 32-bit ops!
34 * - bitmap starts at bit = 0 and ends at bit = bitmap size - 1.
35 * - _Caller_ has to make sure that the bit to operate on is less than the
39 extern void ntfs_bit_set(u8 *bitmap, const u64 bit, const u8 new_value);
40 extern char ntfs_bit_get(const u8 *bitmap, const u64 bit);
41 extern char ntfs_bit_get_and_set(u8 *bitmap, const u64 bit, const u8 new_value);
46 * ntfs_bitmap_set_bit - set a bit in a bitmap
48 * @bit
54 ntfs_bitmap_set_bit(ntfs_attr *na, s64 bit) argument
68 ntfs_bitmap_clear_bit(ntfs_attr *na, s64 bit) argument
[all...]
H A Dsupport.h64 * Simple bit operation macros. NOTE: These are NOT atomic.
66 #define test_bit(bit, var) ((var) & (1 << (bit)))
67 #define set_bit(bit, var) (var) |= 1 << (bit)
68 #define clear_bit(bit, var) (var) &= ~(1 << (bit))
70 #define test_and_set_bit(bit, var) \
72 const BOOL old_state = test_bit(bit, var); \
73 set_bit(bit, va
[all...]
/haiku/src/add-ons/media/media-add-ons/radeon/
H A DCC.cpp79 int bit = 0; local
101 const int nbits = (width + (bit == 0 ? 0 : bit == 15 ? C_RADEON_CC_BIT_DURATION :
107 if ((bit += nbits) >= C_RADEON_CC_BITS_PER_FIELD)
113 if (bit != C_RADEON_CC_BITS_PER_FIELD)
217 for (int bit = 0; bit < 7; bit++) {
218 if ((code & (0x0001 << bit)) != 0)
220 if ((code & (0x0100 << bit)) !
[all...]
/haiku/src/bin/network/telnet/
H A Dcommands.c1105 dolmmode(int bit, int on)
1117 c = (linemode | bit);
1119 c = (linemode & ~bit);
1125 setmod(int bit)
1127 return dolmmode(bit, 1); argument
1131 clearmode(int bit)
1133 return dolmmode(bit, 0);
2850 * the option filled in. This will be 32bit aligned.
3022 *lsrp++ = IPOPT_NOP; /* 32 bit word align it */
1101 dolmmode(int bit, int on) argument
1121 setmod(int bit) argument
/haiku/src/libs/agg/font_freetype/
H A Dagg_font_freetype.cpp432 if(bits.bit()) sl.add_cell(x + j, cover_full);
/haiku/src/libs/compat/freebsd_network/
H A Dfbsd_ether.c51 int bit;
57 for (data = *buf++, bit = 0; bit < 8; bit++, data >>= 1)
96 int bit; local
102 for (data = *buf++, bit = 0; bit < 8; bit++, data >>= 1) {
/haiku/src/libs/print/libprint/
H A DHalftone.cpp215 uchar cur; // cleared bit means white, set bit means black
328 uchar cur = 0; // cleared bit means white, set bit means black
330 const int bit = 7 - x % 8; local
335 cur |= (1 << bit);
354 if (bit == 0) {
H A DHalftoneView.cpp94 const int bit = 7 - (x % 8); local
95 const bool isSet = (*bitmap & (1 << bit)) != 0;
111 if (bit == 0) {
/haiku/src/libs/x86emu/
H A Dops2.c365 int bit, disp; local
380 bit = *shiftreg & 0x1F;
383 CONDITIONAL_SET_FLAG(srcval & (0x1 << bit), F_CF);
393 bit = *shiftreg & 0xF;
396 CONDITIONAL_SET_FLAG(srcval & (0x1 << bit), F_CF);
408 bit = *shiftreg & 0x1F;
411 CONDITIONAL_SET_FLAG(srcval & (0x1 << bit), F_CF);
421 bit = *shiftreg & 0xF;
424 CONDITIONAL_SET_FLAG(srcval & (0x1 << bit), F_CF);
436 bit
788 int bit, disp; local
1439 int bit, disp; local
1861 int bit; local
2116 int bit, disp; local
[all...]
/haiku/src/system/kernel/slab/
H A DHashedObjectCache.cpp24 int bit; local
25 for (bit = 0; value != 1; bit++)
27 return bit;
/haiku/src/system/libroot/os/arch/ppc/
H A Datomic.S14 #warning IMPLEMENT GCC 64-bit ATOMICS ON POWERPC 32-bit!
16 /* These are to fill in 64-bit atomic calls emitted by
17 * by GCC when 64-bit atomics are unavailable.
18 * (aka, on 32-bit PowerPC
/haiku/src/system/libroot/os/arch/sparc/
H A Dfpu_div.c66 * if X < Y. In that case, it will have to be shifted left one bit to
73 * The quotient mantissa X/Y can then be computed one bit at a time
80 * for (bit = FP_NMANT; --bit >= 0; R *= 2) {
82 * Q |= 1 << bit;
87 * The subtraction R -= Y always removes the uppermost bit from R (and
92 * included in the expanded internal representation. The sticky bit
98 * one bit at a time ``from the top down''. This means that we can
104 * is therefore at in [2.0,4.0).) Thus Q is sure to have bit FP_NMANT-1
111 * bit
156 u_int q, bit; local
[all...]
H A Dfpu_mul.c58 * Each step consists of shifting the accumulator right one bit
59 * (maintaining any guard bits) and, if the next bit in y is set,
61 * we advance one bit leftward in y. Algorithmically:
64 * for (bit = 0; bit < FP_NMANT; bit++) {
66 * if (Y & (1 << bit))
73 * shifted right, but at most one bit.
89 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
93 * run 32 times without adding X to A. We can do a 32-bit shif
103 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m; local
[all...]
H A Dfpu_sqrt.c123 * zero bit at the top of x. Doing so means that q is not going to acquire
124 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
159 * bit at a time, from the top down, and is not used itself in the loop
161 * in an integer, one word at a time, which saves a bit of work. Also,
162 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
174 * Furthermore, we can prove with a bit of work that x never exceeds y by
181 * In fact, we want even one more bit (for a carry, to avoid compares), or
190 u_int bit, q, tt; local
251 * set the top bit in q, so we can do that manually and start
252 * the loop at the next bit dow
[all...]
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Daddmul_1.S64 add %i5,%l0,%i5 ! ...add to bit 32 of the hi product
H A Dmul_1.S65 add %i5,%l0,%i5 ! ...add to bit 32 of the hi product
H A Dsubmul_1.S63 add %i5,%l0,%i5 ! ...add to bit 32 of the hi product
/haiku/src/system/libroot/posix/glibc/wctype/
H A Dwctype.h72 endian). We define the bit value interpretations here dependent on the
77 # define _ISwbit(bit) (1 << (bit))
79 # define _ISwbit(bit) \
80 ((bit) < 8 ? (int) ((1UL << (bit)) << 24) \
81 : ((bit) < 16 ? (int) ((1UL << (bit)) << 8) \
82 : ((bit) < 24 ? (int) ((1UL << (bit)) >>
[all...]
/haiku/
H A Dconfigure87 --use-32bit Use -m32 flag on 64bit host gcc compiler.
325 # Boot loader is 32-bit, need the 32-bit libs and c++ config
822 --use-32bit) HAIKU_HOST_USE_32BIT=1; shift 1;;

Completed in 135 milliseconds

123