/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/tools/fixup_tos_boot_checksum/ |
H A D | fixup_tos_boot_checksum.c | 11 uint16_t sum; local 21 for (sum = 0, i = 0; i < (512-2)/2; i++) { 25 sum += v; 27 sum = 0x1234 - sum /*+ 1*/; 28 //sum = 0xaa55; 30 *p++ = (uint8_t)(sum >> 8); 31 *p++ = (uint8_t)sum;
|
/haiku/src/tools/fixup_amiga_boot_checksum/ |
H A D | fixup_amiga_boot_checksum.c | 13 uint32_t sum; local 29 for (sum = 0, i = 0; i < (BB_SIZE)/sizeof(uint32_t); i++) { 30 uint32_t old = sum; 32 sum += ntohl(*p++); 34 if (sum < old) 35 sum++; 37 sum = ~sum; 38 //fprintf(stderr, "checksum: 0x%lx\n", (long)sum); 40 ((uint32_t *)bootblock)[1] = htonl(sum); [all...] |
/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/libs/agg/src/ |
H A D | agg_image_filters.cpp | 45 // of 1.0 which means that any sum of pixel weights must be equal to 1.0. 57 int sum = 0; local 61 sum += m_weight_array[j * image_subpixel_scale + i]; 64 if(sum == image_filter_scale) break; 66 double k = double(image_filter_scale) / double(sum); 67 sum = 0; 70 sum += m_weight_array[j * image_subpixel_scale + i] = 74 sum -= image_filter_scale; 75 int inc = (sum > 0) ? -1 : 1; 77 for(j = 0; j < m_diameter && sum; [all...] |
/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/libs/mapm/ |
H A D | mapmrsin.c | 65 M_APM sum, term, tmp2, tmp7, tmp8; local 69 sum = M_get_stack_var(); 75 m_apm_copy(sum, xx); 105 m_apm_subtract(tmp7, sum, term); 106 m_apm_copy(sum, tmp7); 110 m_apm_add(tmp7, sum, term); 111 m_apm_copy(sum, tmp7); 118 m_apm_round(rr, places, sum); 129 M_APM sum, term, tmp7, tmp8, tmp9; local 133 sum [all...] |
H A D | mapm_cpi.c | 112 M_APM tmp1, tmp2, a0, b0, c0, a1, b1, sum, pow_2; local 122 sum = M_get_stack_var(); 128 m_apm_copy(sum, MM_One); 153 m_apm_subtract(tmp1, sum, tmp2); 154 m_apm_round(sum, dplaces, tmp1); 168 m_apm_divide(tmp1, dplaces, tmp2, sum);
|
H A D | mapm_lg3.c | 165 M_APM tmp1, tmp2, tmp3, tmp4, tmpC2, sum, pow_2, tmpA0, tmpB0; local 175 sum = M_get_stack_var(); 188 m_apm_multiply(sum, MM_0_5, tmp3); 212 m_apm_add(tmp3, sum, tmp1); 218 m_apm_round(sum, dplaces, tmp3);
|
/haiku/src/add-ons/kernel/drivers/network/wlan/realtekwifi/dev/rtwn/usb/ |
H A D | rtwn_usb_reg.h | 25 uint16_t sum = 0; local 30 sum ^= ((uint16_t *)buf)[i]; 32 return (sum); /* NB: already little endian. */
|
/haiku/src/tools/fixup_next_boot_floppy/ |
H A D | fixup_next_boot_floppy.c | 30 uint32_t sum = 0; local 32 sum += B2H16(*p++); 33 // sum both shorts 34 sum = (sum & 0x0ffff) + (sum >> 16); 35 if (sum > 65535) 36 sum -= 65535; 37 return sum; 44 uint16_t sum; local [all...] |
/haiku/src/bin/pc/ |
H A D | pc.c | 448 ULONG val, sum = 0; local 452 sum = logical_and_expr(str); 461 sum = (val || sum); 464 return sum; 472 ULONG val, sum = 0; local 476 sum = or_expr(str); 485 sum = (val && sum); 488 return sum; 495 ULONG val, sum = 0; local 519 ULONG val, sum = 0; local 543 ULONG val, sum = 0; local 566 ULONG val, sum = 0; local 596 ULONG val, sum = 0; local 645 ULONG val, sum = 0; local 676 ULONG val, sum = 0; local 707 ULONG val, sum = 0; local [all...] |
/haiku/src/system/kernel/debug/ |
H A D | gdb.cpp | 89 int sum; local 98 sum = 0; 100 sum += sReply[i]; 102 sum %= 256; 104 sprintf(sReply + len, "#%02x", sum); 126 // compute check sum 127 int sum = 0; local 129 sum += sReply[i]; 130 sum %= 256; 132 // print check sum 149 int sum; local 175 int sum; local [all...] |
/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/libs/compat/freebsd_network/compat/machine/ |
H A D | in_cksum.h | 16 in_pseudo(u_int sum, u_int b, u_int c) argument
|
/haiku/src/system/libroot/posix/musl/math/ |
H A D | fmal.c | 84 struct dd sum; local 87 sum = dd_add(a, b); 88 if (sum.lo != 0) { 89 u.f = sum.hi; 91 sum.hi = nextafterl(sum.hi, INFINITY * sum.lo); 93 return (sum.hi); 103 struct dd sum; local 107 sum [all...] |
/haiku/src/tests/system/network/icmp/ |
H A D | big_datagram.cpp | 37 u_int32_t sum; local 38 for (sum = 0; nwords > 0; nwords--) 39 sum += *(buf++); 40 sum = (sum >> 16) + (sum & 0xffff); 41 sum += (sum >> 16); 42 return ~sum;
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ |
H A D | ah_eeprom_v1.c | 31 uint32_t sum; local 38 sum = 0; 47 sum += eeval; 51 if (sum == 0 || sum == 0xffff*3) { 118 uint32_t sum; local 161 sum = 0; 165 sum ^= athvals[i]; 167 if (sum != 0xffff) { 169 __func__, sum); [all...] |
H A D | ah_eeprom_v14.c | 36 uint32_t sum; local 48 sum = 0; 52 sum += pBase->macAddr[i]; 54 if (sum == 0 || sum == 0xffff*3) { 342 uint32_t sum; local 409 sum = 0; 411 sum ^= eep_data[w]; 413 if (sum != 0xffff) { 415 "Bad EEPROM checksum 0x%x (Len=%u)\n", sum, le [all...] |
/haiku/src/tests/system/libroot/posix/ |
H A D | memalign_test.cpp | 16 sum(addr_t address) function 26 *((uint8 *)address + i) = sum((addr_t)address + i); 34 if (*((uint8 *)address + i) != sum((addr_t)address + i)) { 37 sum((addr_t)address + i));
|
/haiku/src/system/kernel/arch/x86/32/ |
H A D | bios.cpp | 65 uint8 sum = 0; local 68 sum += bytes[i]; 70 return sum == 0;
|
/haiku/headers/private/kernel/boot/ |
H A D | disk_identifier.h | 68 uint32 sum; member in struct:disk_identifier::__anon1045::__anon1052::__anon1053
|
/haiku/src/tests/system/benchmarks/ |
H A D | ctxbench.c | 51 unsigned long min_time, max_time, sum; local 56 sum = 0; 62 sum += elapsed_times[i] - overhead; 69 printf("mean latency: %f\n", (double)sum / ITERATIONS / PASSES);
|
/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/apps/showimage/ |
H A D | Filter.cpp | 608 Scaler::RowValues(float* sum, const uchar* src, intType srcW, intType fromX, argument 611 sum[0] = a0X * src[0]; 612 sum[1] = a0X * src[1]; 613 sum[2] = a0X * src[2]; 618 sum[0] += src[0]; 619 sum[1] += src[1]; 620 sum[2] += src[2]; 624 sum[0] += a1X * src[0]; 625 sum[1] += a1X * src[1]; 626 sum[ 712 float sum[3]; local [all...] |