/haiku/src/system/kernel/arch/riscv64/ |
H A D | arch_int.cpp | 85 dprintf(", sum: %d", (int)status.sum);
|
/haiku/src/bin/network/traceroute/ |
H A D | traceroute.c | 422 "spt dpt len sum", 432 "spt dpt cov sum", 442 "spt dpt seq ack xxflwin sum urp", 471 "typ cod sum ", 1485 u_short sum = p_cksum(outip, (u_short *)outudp, protlen, protlen); local 1486 outudp->uh_sum = (sum) ? sum : 0xffff; 1511 u_short sum = p_cksum(outip, (u_short *)outudp, protlen, 8); local 1512 outudp->uh_sum = (sum) ? sum 1722 u_short sum[2]; local 1744 register int sum = 0; local [all...] |
/haiku/src/bin/network/ping/ |
H A D | utils.c | 46 int nleft, sum; local 55 sum = 0; 59 * Our algorithm is simple, using a 32 bit accumulator (sum), we add 67 sum += data; 76 sum += last.us; 80 sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */ 81 sum += (sum >> 1 [all...] |
/haiku/src/add-ons/kernel/network/stack/ |
H A D | utility.cpp | 105 uint32 sum = 0; local 110 sum += *buffer++; 117 sum += *(uint8*)buffer; 122 sum += *(uint16*)ordered; 126 while (sum >> 16) { 127 sum = (sum & 0xffff) + (sum >> 16); 130 return sum;
|
H A D | net_buffer.cpp | 673 // sum up the size of all nodes 688 panic("net_buffer %p size != sum of its data node sizes (%lu vs. %lu)", 2229 uint32 sum = 0; local 2235 sum += __swap_int16(compute_checksum(node->start + offset, bytes)); 2237 sum += compute_checksum(node->start + offset, bytes); 2250 while (sum >> 16) { 2251 sum = (sum & 0xffff) + (sum >> 16); 2255 return (uint16)sum; [all...] |
/haiku/src/system/kernel/vm/ |
H A D | vm_page.cpp | 1379 int64 sum = 0; local 1381 sum += (int64)sPageUsage[i] * (i - 128); 1384 (float)sum / sPageUsagePageCount, sPageUsagePageCount); 1395 int64 sum = 0; local 1401 sum += count * (i - 128); 1409 sPageUsagePageCount > 0 ? (float)sum / sPageUsagePageCount : 0);
|
/haiku/src/system/kernel/arch/x86/ |
H A D | arch_cpu.cpp | 1049 uint32 sum = 0; 1051 sum += dwords[i]; 1053 if (sum != 0) {
|
/haiku/headers/private/system/arch/riscv64/ |
H A D | arch_cpu_defs.h | 40 uint64 sum: 1; // permit supervisor user memory access member in struct:MstatusReg::__anon65 65 uint64 sum: 1; // permit supervisor user memory access member in struct:SstatusReg::__anon66
|
/haiku/src/system/boot/platform/bios_ia32/ |
H A D | devices.cpp | 384 /** Computes a check sum for the specified block. 385 * The check sum is the sum of all data in that block interpreted as an 402 uint32 sum = 0; local 405 sum += array[i]; 408 return sum; 503 disk.device.unknown.check_sums[i].sum = compute_check_sum(drive, offset); 505 TRACE(("disk %x, offset %lld, sum %lu\n", drive->DriveID(), offset, 506 disk.device.unknown.check_sums[i].sum)); 842 fIdentifier.device.unknown.check_sums[i].sum [all...] |
/haiku/src/system/boot/platform/atari_m68k/ |
H A D | devices.cpp | 334 /** Computes a check sum for the specified block. 335 * The check sum is the sum of all data in that block interpreted as an 352 uint32 sum = 0; local 355 sum += array[i]; 358 return sum; 430 disk.device.unknown.check_sums[i].sum = compute_check_sum(drive, offset); 432 TRACE(("disk %x, offset %lld, sum %lu\n", drive->DriveID(), offset, 433 disk.device.unknown.check_sums[i].sum)); 797 fIdentifier.device.unknown.check_sums[i].sum [all...] |
/haiku/src/bin/mail_utils/ |
H A D | spamdbm.cpp | 1874 double sum; local 1882 sum = term = exp (-m); 1886 sum += term; 1891 ChiSquaredProbability(100, 300) on my box has sum == 1.0 + 2.0**-52 at this 1894 if (sum > 1.0) 1896 return sum; 3008 by the sum of the spam and genuine probabilities to get the Raw Spam Ratio for 3026 divided by the sum of the two values. The Nth root helps spread the resulting 3044 probabilities, -2*sum(ln(p_i)) follows the chi-squared distribution with 2*n 3181 logarithms are also used. But avoid the logarithms (sum o [all...] |
/haiku/src/add-ons/kernel/partitioning_systems/atari/ |
H A D | atari.cpp | 46 uint32 sum = 0; 48 sum += B_BENDIAN_TO_HOST_INT32(longs[i]); 51 if (sum != 0) 52 TRACE(("search_rdb: check sum is incorrect!\n")); 55 return sum == 0;
|
/haiku/src/add-ons/kernel/partitioning_systems/amiga/ |
H A D | amiga_rdb.cpp | 43 uint32 sum = 0; local 45 sum += B_BENDIAN_TO_HOST_INT32(longs[i]); 48 if (sum != 0) 49 TRACE(("search_rdb: check sum is incorrect!\n")); 52 return sum == 0;
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/ |
H A D | fs_cache.c | 99 size_t sum; local 107 for(sum=0; (sum + CHUNK) <= (num_blocks * bsize); sum += CHUNK) { 108 ret = read_pos(fd, (bnum * bsize) + sum, data, CHUNK); 115 if (ret == CHUNK && ((num_blocks * bsize) - sum) > 0) { 116 ret = read_pos(fd, (bnum * bsize) + sum, data, 117 (num_blocks * bsize) - sum); 119 if (ret == (num_blocks * bsize) - sum) 136 size_t sum; local [all...] |
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | BlockAllocator.cpp | 89 uint32 sum = 0; local 91 sum += *data4; 95 return sum; 116 out.Print("bfs:%s: block %lld (%p), sum %lu, s/l %lu/%lu", fLabel,
|
/haiku/src/kits/interface/layouter/ |
H A D | ComplexLayouter.cpp | 347 SumItem& sum = sums[i + 1]; local 348 TRACE("[%ld] minc = %4ld, maxc = %4ld\n", i + 1, sum.min, sum.max); 472 SumItem& sum = fSums[i + 1]; local 478 int32 baseMax = sum.max - constraint->min; 479 bool minRedundant = (sumMin < sum.min && baseMax > base.max); 482 int32 baseMin = sum.min - constraint->effectiveMax; 483 bool maxRedundant = (sumMax > sum.max && baseMin < base.min); 593 SumItem& sum = fSums[i + 1]; local 594 sum 603 SumItem& sum = fSums[i + 1]; local 628 SumItem& sum = fSums[i + 1]; local 653 SumItem& sum = fSums[i + 1]; local 678 SumItem& sum = fSums[index + 1]; local 764 SumItem& sum = fSums[i + 1]; local 800 SumItem& sum = sums[i + 1]; local 851 SumItem& sum = sums[i + 1]; local 901 SumItem& sum = fSums[i + 1]; local 913 SumItem& sum = fSums[i + 1]; local [all...] |
/haiku/src/kits/interface/ |
H A D | LayoutUtils.cpp | 27 // float sum = a + b + 1; 28 // if (sum >= B_SIZE_UNLIMITED) 31 // return sum; 64 float sum = a + b + 1; local 65 if (sum >= B_SIZE_UNLIMITED) 68 return sum;
|
/haiku/src/libs/compat/freebsd_network/ |
H A D | usb.cpp | 594 int sum = 0; local 596 sum += xfer->frames[i].iov_len; 597 *sumlen = sum;
|
/haiku/src/add-ons/kernel/network/protocols/ipv6/ |
H A D | ipv6_utils.h | 25 uint32 sum = 0; local 28 sum += *buffer++; 32 return sum; 42 uint32 sum = checksum; local 47 sum += compute_wordsum((uint8*)source, sizeof(in6_addr)); 48 sum += compute_wordsum((uint8*)destination, sizeof(in6_addr)); 49 sum += compute_wordsum((uint8*)&length, sizeof(uint16)); 50 sum += compute_wordsum((uint8*)&protocol, sizeof(uint16)); 52 while (sum >> 16) 53 sum [all...] |
/haiku/src/system/boot/platform/efi/arch/riscv64/ |
H A D | arch_traps.cpp | 58 dprintf(", sum: %d", (int)status.sum);
|
/haiku/headers/private/kernel/arch/riscv64/ |
H A D | arch_cpu.h | 22 return SstatusReg{.val = Sstatus()}.sum; 29 SetBitsSstatus(SstatusReg{.sum = 1}.val); 36 ClearBitsSstatus(SstatusReg{.sum = 1}.val);
|
/haiku/src/system/kernel/fs/ |
H A D | vfs_boot.cpp | 120 /*! Computes a check sum for the specified block. 121 The check sum is the sum of all data in that block interpreted as an 138 uint32 sum = 0; local 142 sum += array[i]; 145 return sum; 226 // Skip the check sum test for CDs, since we didn't read anything 238 != disk->device.unknown.check_sums[i].sum) {
|
/haiku/src/add-ons/accelerants/common/ |
H A D | ddc.c | 35 uint8 sum = 0; local 39 sum += *data; 48 if (sum != 0) {
|
/haiku/src/add-ons/kernel/drivers/network/ether/ipro1000/dev/e1000/ |
H A D | e1000_manage.h | 43 u16 length, u16 offset, u8 *sum);
|
H A D | e1000_manage.c | 50 u8 sum = 0; local 58 sum += buffer[i]; 60 return (u8) (0 - sum); 220 * @sum: sum of the data (not checksum) 224 * way. Also fills up the sum of the buffer in *buffer parameter. 227 u16 length, u16 offset, u8 *sum) 236 /* sum = only sum of the data and it is not checksum */ 249 *sum 226 e1000_mng_host_if_write_generic(struct e1000_hw *hw, u8 *buffer, u16 length, u16 offset, u8 *sum) argument [all...] |