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

1234567

/haiku-fatelf/src/bin/gdb/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
17 register int bit; local
22 for (bit = 1; !(valu & 1); bit++)
25 return bit;
/haiku-fatelf/src/bin/network/tcpdump/libpcap/Win32/Src/
H A Dffs.c47 register int bit; local
51 for (bit = 1; !(mask & 1); bit++)
53 return(bit);
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
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...]
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 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...]
/haiku-fatelf/src/bin/coreutils/man/
H A Dchmod.x17 an octal number representing the bit pattern for the new mode bits.
45 on execution (\fBs\fP), restricted deletion flag or sticky bit
77 clears the set-group-ID bit of a
100 The restricted deletion flag or sticky bit is a single bit, whose
106 like \fB/tmp\fP. For regular files on some older systems, the bit
109 .IR "sticky bit" .
/haiku-fatelf/src/add-ons/translators/jpeg2000/libjasper/
H A Djpc_mqenc.h249 /* Encode a bit. */
251 #define jpc_mqenc_putbit(enc, bit) jpc_mqenc_putbit_macro(enc, bit)
253 #define jpc_mqenc_putbit(enc, bit) jpc_mqenc_putbit_func(enc, bit)
268 #define jpc_mqenc_putbit_macro(enc, bit) \
269 (((*((enc)->curctx))->mps == (bit)) ? \
283 int jpc_mqenc_putbit_func(jpc_mqenc_t *enc, int bit);
H A Djpc_bs.h172 /* The underlying stream associated with this bit stream. */
175 /* The mode in which this bit stream was opened. */
181 * Functions/macros for opening and closing bit streams..
184 /* Open a stream as a bit stream. */
187 /* Close a bit stream. */
191 * Functions/macros for reading from and writing to bit streams..
194 /* Read a bit from a bit stream. */
203 /* Write a bit to a bit strea
[all...]
H A Djpc_mqdec.h245 #define jpc_mqdec_mpsexchange(areg, delta, curctx, bit) \
250 (bit) = state->mps ^ 1; \
255 (bit) = state->mps; \
260 #define jpc_mqdec_lpsexchange(areg, delta, curctx, bit) \
265 (bit) = state->mps ^ 1; \
270 (bit) = state->mps; \
/haiku-fatelf/src/libs/compat/freebsd_network/
H A Dfbsd_ether.c47 int bit;
53 for (data = *buf++, bit = 0; bit < 8; bit++, data >>= 1)
92 int bit; local
98 for (data = *buf++, bit = 0; bit < 8; bit++, data >>= 1) {
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Ddither-predithered.c39 int val, int x, int y, unsigned bit, int length)
51 tptr[0] |= bit;
66 unsigned char bit; local
78 bit = 128;
96 if (!mask || (*(mask + d->ptr_offset) & bit))
103 CHANNEL(d, i).ptr[d->ptr_offset] |= bit;
107 ADVANCE_UNIDIRECTIONAL(d, bit, raw, CHANNEL_COUNT(d),
115 if (!mask || (*(mask + d->ptr_offset) & bit))
121 bit, length);
124 ADVANCE_UNIDIRECTIONAL(d, bit, ra
38 print_color_very_fast(const stpi_dither_t *d, stpi_dither_channel_t *dc, int val, int x, int y, unsigned bit, int length) argument
[all...]
H A Ddither-very-fast.c39 int val, int x, int y, unsigned char bit,
54 tptr[0] |= bit;
71 unsigned char bit; local
83 bit = 128;
101 if (!mask || (*(mask + d->ptr_offset) & bit))
109 CHANNEL(d, i).ptr[d->ptr_offset] |= bit;
113 ADVANCE_UNIDIRECTIONAL(d, bit, raw, CHANNEL_COUNT(d),
121 if (!mask || (*(mask + d->ptr_offset) & bit))
127 bit, bit_patterns[i], length);
130 ADVANCE_UNIDIRECTIONAL(d, bit, ra
38 print_color_very_fast(const stpi_dither_t *d, stpi_dither_channel_t *dc, int val, int x, int y, unsigned char bit, unsigned bits, int length) argument
[all...]
H A Ddither-impl.h200 #define ADVANCE_UNIDIRECTIONAL(d, bit, input, width, xerror, xstep, xmod) \
203 bit >>= 1; \
204 if (bit == 0) \
207 bit = 128; \
221 #define ADVANCE_REVERSE(d, bit, input, width, xerror, xstep, xmod) \
224 if (bit == 128) \
227 bit = 1; \
230 bit <<= 1; \
243 #define ADVANCE_BIDIRECTIONAL(d,bit,in,dir,width,xer,xstep,xmod,err,S) \
252 ADVANCE_UNIDIRECTIONAL(d, bit, i
[all...]
H A Dbit-ops.c2 * "$Id: bit-ops.c,v 1.14 2009/06/07 15:21:22 rlk Exp $"
383 unsigned char tempin, bit, temp0, temp1; local
387 for (bit = 128, temp0 = 0, temp1 = 0;
394 temp0 |= bit;
396 temp1 |= bit;
397 bit >>= 1;
399 temp0 |= bit;
401 temp1 |= bit;
402 bit >>= 1;
404 temp0 |= bit;
464 unsigned char tempin, bit, temp0, temp1, temp2, temp3; local
583 unsigned char tempin, bit, temp0, temp1, temp2, temp3, temp4, temp5, temp6, local
743 unsigned char tempin, bit; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A DBitmapBlock.cpp142 TRACE("BitmapBlock::_Update(): start index: %lu, start bit: %lu, remaining "
249 uint32 bit = pos & 0x1F; local
252 uint32 mask = ~((1 << bit) - 1);
255 TRACE("BitmapBlock::_FindNext(): index: %lu, bit: %lu, mask: %lX, "
256 "bits: %lX\n", index, bit, mask, bits);
260 // Find a 32 bits block that has a marked bit
264 bit = 0;
290 for (; bit < maxBit; ++bit) {
291 // Find the marked bit
318 int32 bit = pos & 0x1F; local
[all...]
/haiku-fatelf/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-fatelf/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-fatelf/src/add-ons/translators/webp/libwebp/dec/
H A Dbits.h36 // Initialize the bit reader and the boolean decoder.
48 // Read a bit with proba 'prob'. Speed-critical function!
75 const uint32_t bit = ((br->value_ >> 8) > split); local
76 if (bit) {
85 return bit;
90 const uint32_t bit = ((br->value_ >> 8) > split); local
91 if (bit) {
/haiku-fatelf/src/system/libroot/posix/crypt/
H A Dcrypt_util.c51 * Permutation done once on the 56 bit
62 * How much to rotate each 28 bit half of the pc1 permutated
63 * 56 bit key before using pc2 to give the i' key
82 * bits from the 32 bit intermediate result.
189 /* Macro to set a bit (0..23) */
196 * They do sbox lookup, shifting of this value, 32 bit
213 * eperm32tab: do 32 bit permutation and E selection
215 * The first index is the byte number in the 32 bit value to be permuted
217 * - third - selects the two 32 bit values
230 * The result is kept with 28 bit pe
338 int bit, sg; local
[all...]
/haiku-fatelf/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-fatelf/src/add-ons/translators/webp/libwebp/enc/
H A Dbit_writer.h38 int VP8PutBit(VP8BitWriter* const bw, int bit, int prob);
39 int VP8PutBitUniform(VP8BitWriter* const bw, int bit);
H A Dcost.h22 extern const uint16_t VP8EntropyCost[256]; // 8bit fixed-point log(p)
25 static inline int VP8BitCost(int bit, uint8_t proba) { argument
26 return !bit ? VP8EntropyCost[proba] : VP8EntropyCost[255 - proba];
/haiku-fatelf/src/libs/print/libgutenprint/include/gutenprint/
H A Dgutenprint-module.h50 #include <gutenprint/bit-ops.h>
/haiku-fatelf/src/bin/gdb/opcodes/
H A Dv850-dis.c61 /* Special case: 32 bit MOV */
222 case 0xfff8001f: regs = list18_l_regs; value &= ~0x10; break; /* Do not include magic bit */
250 unsigned int bit; local
253 for (bit = 0; bit < 32; bit++)
254 if (mask & (1 << bit))
256 unsigned long int first = bit;
266 for (bit++; bit < 3
[all...]

Completed in 121 milliseconds

1234567