Searched refs:bit (Results 26 - 50 of 75) sorted by relevance

123

/haiku/src/add-ons/kernel/network/protocols/ipv4/
H A Dipv4_address.cpp208 /*! Routing utility function: determines the least significant bit that is set
210 \return the number of the first bit that is set (0-32, where 32 means
211 that there's no bit set in the mask).
223 int8 bit = 0; local
224 for (uint32 bitMask = 1; bit < 32; bitMask <<= 1, bit++) {
226 return bit;
249 int8 bit = 0; local
250 for (uint32 bitMask = 1; bit < 32; bitMask <<= 1, bit
[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/add-ons/input_server/devices/virtio/
H A DVirtioInputDevice.cpp35 inline static void SetBit(Type &val, int bit) {val |= Type(1) << bit;} argument
38 inline static void ClearBit(Type &val, int bit) {val &= ~(Type(1) << bit);} argument
41 inline static void InvertBit(Type &val, int bit) {val ^= Type(1) << bit;} argument
44 inline static void SetBitTo(Type &val, int bit, bool isSet) { argument
45 val ^= ((isSet? -1: 0) ^ val) & (Type(1) << bit);}
48 inline static bool IsBitSet(Type val, int bit) { argument
49 return (val & (Type(1) << bit)) !
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/utils/
H A Dutils.c720 * The metadata file $Bitmap has one binary bit representing each cluster on
721 * disk. The bit will be set for each cluster that is in use. The function
722 * reads the relevant part of $Bitmap into a buffer and tests the bit.
726 * refreshed. @bmplcn stores offset to the first bit (in bits) stored in the
739 int byte, bit; local
772 bit = 1 << (lcn & 7);
774 ntfs_log_debug("cluster = %lld, bmplcn = %lld, byte = %d, bit = %d, "
775 "in use %d\n", lcn, bmplcn, byte, bit, buffer[byte] &
776 bit);
778 return (buffer[byte] & bit);
802 int byte, bit; local
[all...]
/haiku/src/add-ons/accelerants/nvidia/engine/
H A Dnv_i2c.c20 //4 - SDA not released for master to generate STOP bit
311 uint8 cnt, bit, byte = 0; local
319 bit = RXBit (BusNR);
320 byte += bit;
334 bool bit; local
342 bit = (tmp & 0x80);
343 TXBit (BusNR, bit);
347 bit = RXBit (BusNR);
348 if (bit) i2c_flag_error (3);
353 return bit;
[all...]
/haiku/src/build/libbe/interface/
H A DBitmap.cpp301 bit_mask(int32 bit) argument
303 return 1 << bit;
308 inverse_bit_mask(int32 bit) argument
310 return ~bit_mask(bit);
872 Gray1Reader(const void *data) : BaseReader<uint8>(data), bit(7) {}
877 bit = 7;
882 if (bit == 7)
886 bit = 7;
892 if (*pixels & bit_mask(bit))
897 bit
917 int32 bit; member in struct:Gray1Reader
1112 int32 bit; member in struct:Gray1Writer
[all...]
/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/servers/app/
H A DCursorSet.cpp383 // to RGBA32. Eventually, there will be support for 16 and 8-bit depths
412 uint16 bit = 1 << (15 - x); local
413 bitmapPosition[x] = ((cursorFlip & bit) != 0 ? black : white)
414 & ((maskFlip & bit) != 0 ? 0xffffffff : 0x00ffffff);
H A DServerFont.cpp541 for (int bit = 0; bit < BITS_PER_BLOCK; ++bit) {
547 rangeStart = bit;
555 // when we find an empty bit, that's the end of the range
556 uint32 endPoint = currentCodePoint + (bit - 1);
/haiku/src/bin/network/ping/
H A Dping.c113 #define A(bit) rcvd_tbl[(bit)>>3] /* identify byte in array */
114 #define B(bit) (1 << ((bit) & 0x07)) /* identify bit in byte */
115 #define SET(bit) (A(bit) |= B(bit))
116 #define CLR(bit) (A(bit)
[all...]
H A Dping6.c158 #define A(bit) rcvd_tbl[(bit)>>3] /* identify byte in array */
159 #define B(bit) (1 << ((bit) & 0x07)) /* identify bit in byte */
160 #define SET(bit) (A(bit) |= B(bit))
161 #define CLR(bit) (A(bit)
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dlcnalloc.c148 int bit = *buf & (1 << j); local
150 if (bit) {
240 LCN bmp_pos; /* current bit position inside the bitmap */
244 u8 *buf, *byte, bit, writeback; local
340 bit = 1 << (lcn & 7);
342 if (*byte & bit) {
354 /* First free bit is at lcn + bmp_pos. */
368 /* Allocate the bitmap bit. */
369 *byte |= bit;
H A Dindex.c1002 u32 bit = 1 << (pos % 8); local
1029 byte |= bit;
1031 byte &= ~bit;
1058 int bit; local
1073 for (bit = 0; bit < 8; bit++) {
1074 if (!(bm[byte] & (1 << bit))) {
1075 vcn = ntfs_ibm_pos_to_vcn(icx, byte * 8 + bit);
/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/bfs/
H A DBlockAllocator.cpp268 // the block bitmap is accessed in 32-bit blocks
656 int32 numBits = groups[i].fNumBits, bit = 0;
660 for (int32 j = 0; j < 32 && bit < numBits; j++, bit++) {
669 start = bit;
807 for (uint32 bit = start % bitsPerFullBlock;
808 bit < cached.NumBlockBits(); bit++) {
809 if (!cached.IsUsed(bit)) {
1112 for (uint32 bit
[all...]
/haiku/src/add-ons/print/drivers/pcl6/
H A DPCL6Rasterizer.cpp201 uchar outMask = 0x80; // current bit mask (1 << (8 - bit)) in output buffer
262 // for each bit in the current byte of each plane
361 for (int bit = 0; bit < 8; bit ++) {
362 if (value & (1 << bit)) {
/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/add-ons/kernel/bus_managers/scsi/
H A Ddevices.cpp259 #define SET_BIT(field, bit) field[(bit) >> 3] |= 1 << ((bit) & 7)
/haiku/src/system/libroot/posix/musl/math/x86/
H A Dexpl.s2 # where hi+lo = log2e*x with 128bit precision
/haiku/src/system/libroot/posix/musl/math/x86_64/
H A Dexpl.s2 # where hi+lo = log2e*x with 128bit precision
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211.c80 /* map ieee80211_opmode to the corresponding capability bit */
852 * Synchronize flag bit state in the com structure
860 int bit; local
864 bit = 0;
867 bit = 1;
870 if (bit)
892 * Synchronize flags_ht bit state in the com structure
900 int bit; local
904 bit = 0;
907 bit
940 int bit; local
980 int bit; local
[all...]
/haiku/src/add-ons/kernel/drivers/network/ether/usb_asix/
H A DASIXDevice.cpp229 // the device pushes packets 16bit aligned
626 for (int bit = 0; bit < 8; bit++, data >>= 1) {

Completed in 162 milliseconds

123