/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | mft.c | 506 * ntfs_ffz - Find the first unset (zero) bit in a word 550 s64 pass_end, ll, data_pos, pass_start, ofs, bit; local 616 /* If we read at least one byte, search @buf for a zero bit. */ 619 bit = data_pos & 7; 622 "data_pos 0x%llx, bit 0x%llx, " 624 (long long)data_pos, (long long)bit, 626 for (; bit < size && data_pos + bit < pass_end; 627 bit &= ~7ull, bit 1428 s64 ll, bit; local 1713 s64 ll, bit; local [all...] |
/haiku/src/add-ons/kernel/file_systems/ntfs/utils/ |
H A D | mkntfs.c | 388 int bit; local 399 bit = 1; /* was allocated */ 402 bit = 0; 406 bit = 0; 408 return (bit); 420 int bn; /* bit number */ 777 char bit; local 784 bit = bitmap_get_and_set(lcn,1); 785 if (bit) 4386 /* Generate a 64-bit rando [all...] |
H A D | utils.c | 720 * 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/kernel/generic/tty/ |
H A D | tty.cpp | 992 } else if ((flags & ISTRIP) != 0) // strip off eighth bit 2095 int bit = 0; local 2099 bit = TCGB_DCD; 2102 bit = TCGB_CTS; 2105 bit = TCGB_DSR; 2108 bit = TCGB_RI; 2116 cookie->tty->hardware_bits |= bit; 2118 cookie->tty->hardware_bits &= ~bit;
|
/haiku/src/add-ons/kernel/network/protocols/ipv4/ |
H A D | ipv4_address.cpp | 208 /*! 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/kernel/network/protocols/ipv6/ |
H A D | ipv6_address.cpp | 236 /*! Routing utility function: determines the least significant bit that is set 238 \return the number of the first bit that is set (0-32, where 32 means 239 that there's no bit set in the mask). 252 for (uint8 bit = 0; bit < 8; bit++) { 253 if ((pmask[i] & (1 << (7 - bit))) == 0) 254 return i * 8 + bit; 282 for (int8 bit = 7; bit > [all...] |
/haiku/src/add-ons/print/drivers/pcl6/ |
H A D | PCL6Rasterizer.cpp | 201 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/apps/bootmanager/ |
H A D | bootman.S | 77 ; cx - support bit mask 159 ; 16 bit code 232 ; 64 bit value
|
/haiku/src/bin/network/ping/ |
H A D | ping.c | 113 #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 D | ping6.c | 158 #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/build/libbe/interface/ |
H A D | Bitmap.cpp | 301 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/build/libgnuregex/ |
H A D | regex.c | 259 are ordered low-bit-first. A character is in the set if its 260 bit is 1. A character too large to have a bit in the map is 581 unsigned bit; 586 for (bit = 0; bit < BYTEWIDTH; bit++) 587 if (map_byte & (1 << bit)) 588 printchar (c * BYTEWIDTH + bit); 804 The argument SYNTAX is a bit mas 576 unsigned bit; local [all...] |
/haiku/src/libs/compat/freebsd_network/compat/machine/generic/ |
H A D | cpufunc.h | 13 int bit; local 16 for (bit = 1; mask != 1; bit++) 18 return bit; 26 int bit; local 30 for (bit = 1; !(mask & 1); bit++) 32 return (bit);
|
/haiku/src/libs/compat/freebsd_network/compat/net/ |
H A D | if_media.h | 377 #define IFM_AVALID 0x00000001 /* Active bit valid */ 925 #define IFM_STATUS_DESC(ifms, bit) \ 926 (ifms)->ifms_string[((ifms)->ifms_bit & (bit)) ? 1 : 0]
|
/haiku/src/libs/compat/freebsd_network/ |
H A D | pci.cpp | 182 pci_set_command_bit(device_t dev, uint16_t bit) argument 185 pci_write_config(dev, PCI_command, command | bit, 2); 192 // We do this a bit later than FreeBSD does. 205 int bit = 0; local 209 bit = PCI_command_io; 212 bit = PCI_command_memory; 218 pci_set_command_bit(dev, bit); 219 if (pci_read_config(dev, PCI_command, 2) & bit)
|
/haiku/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211.c | 80 /* 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...] |
H A D | ieee80211_var.h | 191 * ic_chan_avail is a bit vector of these channels used to check 662 #define IEEE80211_ATH_CAP(vap, ni, bit) \ 663 ((vap)->iv_flags & (ni)->ni_ath_flags & (bit))
|
/haiku/src/servers/app/ |
H A D | CursorSet.cpp | 383 // 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 D | ServerFont.cpp | 541 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/servers/app/font/ |
H A D | FontEngine.cpp | 308 if (bits.bit()) 342 if (bits.bit()) 390 if (bits.bit()) {
|
/haiku/src/system/kernel/arch/arm/ |
H A D | soc_omap3.cpp | 32 uint32 bit = irq % 32, bank = irq / 32; local 33 fRegBase[INTCPS_MIR_CLEARn + (8 * bank)] = 1 << bit; 40 uint32 bit = irq % 32, bank = irq / 32; local 41 fRegBase[INTCPS_MIR_SETn + (8 * bank)] = 1 << bit;
|
/haiku/src/system/kernel/platform/atari_m68k/ |
H A D | platform.cpp | 211 uint8 bit = 1 << (irq % 8); local 215 if (val & bit == 0) { 216 val |= bit; 225 uint8 bit = 1 << (irq % 8); local 229 if (val & bit) { 230 val &= ~bit; 239 uint8 bit = 1 << (irq % 8); local 243 if (val & bit) { 244 val &= ~bit;
|
/haiku/src/system/libroot/posix/glibc/ctype/ |
H A D | ctype.h | 37 endian). We define the bit value interpretations here dependent on the 42 # define _ISbit(bit) (1 << (bit)) 44 # define _ISbit(bit) ((bit) < 8 ? ((1 << (bit)) << 8) : ((1 << (bit)) >> 8)) 87 #define __isascii(c) (((c) & ~0x7f) == 0) /* If C is a 7 bit value. */
|
/haiku/src/system/libroot/posix/musl/math/x86/ |
H A D | expl.s | 2 # where hi+lo = log2e*x with 128bit precision
|
/haiku/src/system/libroot/posix/musl/math/x86_64/ |
H A D | expl.s | 2 # where hi+lo = log2e*x with 128bit precision
|