Searched refs:total (Results 1 - 25 of 130) sorted by path

123456

/haiku-fatelf/docs/user/
H A Dapidoc.dox190 two more spaces, making the total of four. This is to visually
/haiku-fatelf/src/add-ons/accelerants/common/
H A Dvalidate_display_mode.cpp35 uint16& total, const timing_constraints& constraints)
61 if (total < syncStart + syncLength + constraints.min_after_sync) {
62 TRACE("%s: total(%" B_PRIu16 ")"
66 __func__, total, syncStart, syncLength, constraints.min_after_sync);
67 total = syncStart + syncLength + constraints.min_after_sync;
70 if (total > constraints.max_total) {
71 TRACE("%s: total(%" B_PRIu16 ") > max_total(%" B_PRIu16 ")\n",
72 __func__, total, constraints.max_total);
73 total = constraints.max_total;
74 syncLength = min_c(syncLength, uint16(total
34 sanitize_timing(uint16& display, uint16& syncStart, uint16& syncEnd, uint16& total, const timing_constraints& constraints) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/debugger/qrencode/
H A Dqrinput.c1130 int bits, total = 0; local
1136 total += bits;
1140 return total;
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/iprowifi2100/dev/ipw/
H A Dif_ipw.c2653 uint32_t total;
2661 total = count * size;
2663 if (total > *len) {
2664 *len = total;
2668 *len = total;
2669 ipw_read_mem_1(sc, addr, buf, total);
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/iprowifi3945/dev/wpi/
H A Dif_wpireg.h427 uint32_t total; member in struct:wpi_missed_beacon
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/iprowifi4965/dev/iwn/
H A Dif_iwn.c2980 misses, le32toh(miss->total));
4483 int i, total, nbant, noise; local
4485 total = nbant = 0;
4489 total += noise;
4493 return (nbant == 0) ? -127 : (total / nbant) - 107;
H A Dif_iwnreg.h1108 uint32_t total; member in struct:iwn_beacon_missed
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp1457 int32 total = bytesBefore + bytesAfter; local
1494 total = BFS_ENDIAN_TO_HOST_INT16(inKeyLengths[in++]);
1516 BFS_ENDIAN_TO_HOST_INT16(inKeyLengths[in]) - total);
1533 bytesBefore = node->AllKeyLength() - total;
1562 memmove(inKeys, inKeys + total, bytesBefore);
1564 memmove(inKeys + bytesBefore + bytes, inKeys + total + bytesBefore,
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/
H A Dattributes.c497 int total = 0; local
540 total += bytesRead;
543 *len = total;
575 int total = 0; local
630 total += bytesWritten;
633 *_length = total;
H A Dfs_func.c1189 int total = 0; local
1238 total += bytesRead;
1241 *len = total;
1269 int total = 0; local
1336 total += bytesWritten;
1339 *len = total;
1340 if (total > 0)
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dattrib.c152 s64 total, r; local
215 for (i = 0, total = 0; rl[i].length; i++) {
216 if (total + (rl[i].length << vol->cluster_size_bits) >=
269 memcpy(b + total, intbuf, sle64_to_cpu(a->data_size) -
270 total);
272 total = sle64_to_cpu(a->data_size);
287 b + total);
303 total += r;
306 return total;
914 s64 br, to_read, ofs, total, total local
1763 s64 total = 0; local
6609 int res, total = 0; local
6654 int res, total = 0; local
6758 s64 total = 0; local
[all...]
H A Dcompress.c565 s64 br, to_read, ofs, total, total2; local
609 total = total2 = 0;
664 if (total)
665 return total;
676 total += to_read;
719 if (total)
720 return total;
724 total += br;
778 if (total)
779 return total;
[all...]
H A Ddevice.c204 s64 br, total; local
218 for (total = 0; count; count -= br, total += br) {
219 br = dops->pread(dev, (char*)b + total, count, pos + total);
224 if (!br || total)
225 return total;
230 return total;
255 s64 written, total, ret = -1; local
274 for (total
[all...]
H A Drunlist.c1099 s64 bytes_read, to_read, ofs, total; local
1117 for (total = 0LL; count; rl++, ofs = 0) {
1128 total += to_read;
1141 total += bytes_read;
1154 return total;
1156 if (total)
1157 return total;
1188 s64 written, to_write, total = 0; local
1208 for (total = 0LL; count; rl++, ofs = 0) {
1219 total
[all...]
H A Dsecurity.c445 unsigned long total; local
449 total = 0;
457 total += STUFFSZ;
463 } while (!res && (total < ALIGN_SDS_BLOCK));
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/utils/
H A Dmkntfs.c450 long long bytes_written, total; local
455 total = 0LL;
468 total += bytes_written;
474 return total;
537 s64 bytes_written, total, length, delta; local
544 total = 0LL;
550 total += length;
561 if (total + length > val_len) {
563 length = val_len - total;
575 total, lengt
[all...]
/haiku-fatelf/src/add-ons/mail_daemon/inbound_protocols/imap/
H A DIMAPFolderConfig.cpp342 uint64 used, total; local
343 if (fIMAPFolders.GetQuota(used, total) == B_OK) {
348 quotaString += string_for_size(total, buffer, 256);
/haiku-fatelf/src/add-ons/mail_daemon/inbound_protocols/imap/imap_lib/
H A DIMAPFolders.cpp89 IMAPFolders::GetQuota(uint64& used, uint64& total) argument
102 total = quotaCommand.TotalStorage();
H A DIMAPFolders.h42 status_t GetQuota(uint64& used, uint64& total);
/haiku-fatelf/src/add-ons/media/media-add-ons/radeon/
H A DVideoIn.cpp43 } total; member in struct:__anon2577
/haiku-fatelf/src/add-ons/translators/raw/
H A DRAW.cpp2083 int32 percent, val, total, i;
2094 for (val = 0x2000, total = 0; --val > 32;) {
2095 if ((total += fHistogram[val][c]) > percent)
/haiku-fatelf/src/add-ons/translators/webp/libwebp/enc/
H A Danalysis.c116 const int total = a + b; local
117 if (total == 0) return 255; // that's the default probability.
118 proba = (255 * a + total / 2) / total;
H A Dcost.h29 // Cost of coding 'nb' 1's and 'total-nb' 0's using 'proba' probability.
30 static inline uint64_t VP8BranchCost(uint64_t nb, uint64_t total, uint8_t proba) { argument
31 return nb * VP8BitCost(1, proba) + (total - nb) * VP8BitCost(0, proba);
H A Dframe.c68 static int CalcSkipProba(uint64_t nb, uint64_t total) { argument
69 return (int)(total ? (total - nb) * 255 / total : 255);
141 // Return the total bit-cost for coding the probability updates.
142 static int CalcTokenProba(uint64_t nb, uint64_t total) { argument
143 return (int)(nb ? ((total - nb) * 255 + total / 2) / total : 255);
/haiku-fatelf/src/apps/cortex/TransportView/
H A DTransportView.cpp1202 int total = menu->CountItems(); local
1203 for(int n = 0; n < total; ++n) {

Completed in 314 milliseconds

123456