Home
last modified time | relevance | path

Searched refs:overhead (Results 1 - 25 of 26) sorted by relevance

12

/third_party/ltp/testcases/kernel/sched/tool/
H A Dtime-schedule.c27 This programme will determine the context switch (scheduling) overhead on
102 signed long overhead, total_diffs; in main() local
186 /* Determine overhead. Do it in a loop=2. The first iteration should warm in main()
187 the cache, the second will compute the overhead */ in main()
204 overhead = 1000000 * (after.tv_sec - before.tv_sec); in main()
205 overhead += after.tv_usec - before.tv_usec; in main()
249 fprintf(stderr, "Syscall%s overhead: %.1f us\n", frob_fpu ? "/FPU" : "", in main()
250 (double)overhead / 20.0); in main()
252 fprintf(stderr, "Num switches during overhead check: %lu\n", in main()
255 (double)min_diff / 20.0, (double)(min_diff - overhead) / 20. in main()
[all...]
/third_party/node/deps/openssl/openssl/ssl/record/
H A Dtls_pad.c78 const size_t overhead = 1 /* padding length byte */ + mac_size; in ssl3_cbc_remove_padding_and_mac() local
83 if (overhead > *reclen) in ssl3_cbc_remove_padding_and_mac()
87 good = constant_time_ge_s(*reclen, padding_length + overhead); in ssl3_cbc_remove_padding_and_mac()
124 size_t overhead = ((block_size == 1) ? 0 : 1) /* padding length byte */ in tls1_cbc_remove_padding_and_mac() local
131 if (overhead > *reclen) in tls1_cbc_remove_padding_and_mac()
144 good = constant_time_ge_s(*reclen, overhead + padding_length); in tls1_cbc_remove_padding_and_mac()
H A Drecord_local.h127 int early_data_count_ok(SSL *s, size_t length, size_t overhead, int send);
H A Dssl3_record.c105 int early_data_count_ok(SSL *s, size_t length, size_t overhead, int send) in early_data_count_ok() argument
138 /* If we are dealing with ciphertext we need to allow for the overhead */ in early_data_count_ok()
139 max_early_data += overhead; in early_data_count_ok()
405 * does not include the compression overhead anyway. in ssl3_get_record()
/third_party/openssl/ssl/record/
H A Dtls_pad.c78 const size_t overhead = 1 /* padding length byte */ + mac_size; in ssl3_cbc_remove_padding_and_mac() local
83 if (overhead > *reclen) in ssl3_cbc_remove_padding_and_mac()
87 good = constant_time_ge_s(*reclen, padding_length + overhead); in ssl3_cbc_remove_padding_and_mac()
124 size_t overhead = ((block_size == 1) ? 0 : 1) /* padding length byte */ in tls1_cbc_remove_padding_and_mac() local
131 if (overhead > *reclen) in tls1_cbc_remove_padding_and_mac()
144 good = constant_time_ge_s(*reclen, overhead + padding_length); in tls1_cbc_remove_padding_and_mac()
H A Drecord_local.h127 int early_data_count_ok(SSL *s, size_t length, size_t overhead, int send);
H A Dssl3_record.c105 int early_data_count_ok(SSL *s, size_t length, size_t overhead, int send) in early_data_count_ok() argument
138 /* If we are dealing with ciphertext we need to allow for the overhead */ in early_data_count_ok()
139 max_early_data += overhead; in early_data_count_ok()
405 * does not include the compression overhead anyway. in ssl3_get_record()
/third_party/skia/src/core/
H A DSkArenaAlloc.cpp72 constexpr uint32_t overhead = headerSize + sizeof(Footer); in ensureSpace() local
73 AssertRelease(size <= maxSize - overhead); in ensureSpace()
74 uint32_t objSizeAndOverhead = size + overhead; in ensureSpace()
H A DSkArenaAlloc.h69 // starting with an allocation of firstHeapAllocation bytes. If your data (plus a small overhead)
97 // POD is really data with no destructors). For POD data it has zero overhead per item, and a
98 // typical per block overhead of 8 bytes. For non-POD objects there is a per item overhead of 4
99 // bytes. For arrays of non-POD objects there is a per array overhead of typically 8 bytes. There
100 // is an addition overhead when switching from POD data to non-POD data of typically 8 bytes.
249 constexpr uint32_t overhead = sizeof(Footer) + sizeof(uint32_t);
250 AssertRelease(arraySize <= std::numeric_limits<uint32_t>::max() - overhead);
251 uint32_t totalSize = arraySize + overhead;
/third_party/skia/bench/
H A Dnanobench.cpp112 static DEFINE_int(overheadLoops, 100000, "Loops to estimate timer overhead.");
114 "Loop until timer overhead is at most this fraction of our measurments.");
300 double overhead = 0; in estimate_timer_overhead() local
303 overhead += now_ms() - start; in estimate_timer_overhead()
305 return overhead / FLAGS_overheadLoops; in estimate_timer_overhead()
363 static int setup_cpu_bench(const double overhead, Target* target, Benchmark* bench) { in setup_cpu_bench() argument
364 // First figure out approximately how many loops of bench it takes to make overhead negligible. in setup_cpu_bench()
369 while (bench_plus_overhead < overhead) { in setup_cpu_bench()
372 bench->getUniqueName(), HUMANIZE(bench_plus_overhead), HUMANIZE(overhead)); in setup_cpu_bench()
380 // We'll pick N to make timer overhead negligibl in setup_cpu_bench()
[all...]
/third_party/libwebsockets/lib/misc/lwsac/
H A Dlwsac.c239 uint64_t overhead = 0; in lwsac_total_overhead() local
242 overhead += (head->alloc_size - head->ofs) + sizeof(*head); in lwsac_total_overhead()
247 return overhead; in lwsac_total_overhead()
/third_party/elfutils/libdwelf/
H A Ddwelf_strtab.c112 size_t overhead = offsetof (struct memoryblock, memory); in morememory() local
113 len += overhead + MALLOC_OVERHEAD; in morememory()
125 st->left = len - overhead; in morememory()
/third_party/mbedtls/library/
H A Dbignum_core.c247 size_t overhead = (X_limbs * ciL) - input_length; in mbedtls_mpi_core_read_be() local
249 memcpy(Xp + overhead, input, input_length); in mbedtls_mpi_core_read_be()
622 const size_t overhead = (limbs * ciL) - n_bytes; in mbedtls_mpi_core_fill_random() local
628 memset(X, 0, overhead); in mbedtls_mpi_core_fill_random()
630 MBEDTLS_MPI_CHK(f_rng(p_rng, (unsigned char *) X + overhead, n_bytes)); in mbedtls_mpi_core_fill_random() local
H A Dssl_tls.c3286 const size_t overhead = (size_t) ret; in mbedtls_ssl_get_max_out_record_payload() local
3292 if (mtu <= overhead) { in mbedtls_ssl_get_max_out_record_payload()
3297 if (max_len > mtu - overhead) { in mbedtls_ssl_get_max_out_record_payload()
3298 max_len = mtu - overhead; in mbedtls_ssl_get_max_out_record_payload()
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dnanobenchmark.cc196 // lower overhead than RDTSCP because it does not read TSC_AUX. In summary,
199 // Using Start+Start leads to higher variance and overhead than Stop+Stop.
279 // Returns a 32-bit timestamp with about 4 cycles less overhead than
462 // Returns timer overhead / minimum measurable difference.
671 // (Nearly) empty Func for measuring timer overhead/resolution.
677 // Returns overhead of accessing inputs[] and calling a function; this will
745 const Ticks overhead = Overhead(arg, &full, p); in MeasureImpl() local
747 if (overhead < overhead_skip) { in MeasureImpl()
748 ABSL_RAW_LOG(WARNING, "Measurement failed: overhead %u < %u\n", overhead, in MeasureImpl()
[all...]
/third_party/libcoap/src/
H A Dcoap_oscore.c2039 * Compute the size of the potential OSCORE overhead
2043 size_t overhead = 0; in coap_oscore_overhead() local
2053 overhead += 1; in coap_oscore_overhead()
2059 overhead += 2 + coap_opt_length(option); in coap_oscore_overhead()
2066 overhead += 1 + in coap_oscore_overhead()
2074 /* AAD overhead */ in coap_oscore_overhead()
2075 overhead += AES_CCM_TAG; in coap_oscore_overhead()
2078 overhead += 1; in coap_oscore_overhead()
2080 return overhead; in coap_oscore_overhead()
H A Dcoap_openssl.c3222 unsigned int overhead = 37; in coap_dtls_get_overhead() local
3266 coap_log_warn("Unknown overhead for DTLS with cipher %s\n", in coap_dtls_get_overhead()
3272 overhead = DTLS1_RT_HEADER_LENGTH + ivlen + maclen + blocksize - 1 + pad; in coap_dtls_get_overhead()
3274 return overhead; in coap_dtls_get_overhead()
/third_party/node/deps/v8/src/wasm/
H A Dwasm-code-manager.cc585 // Returns an overapproximation of the code size overhead per new code space
589 size_t overhead = RoundUp<kCodeAlignment>( in OverheadPerCodeSpace() local
595 overhead += Heap::GetCodeRangeReservedAreaSize(); in OverheadPerCodeSpace()
599 overhead += in OverheadPerCodeSpace()
604 return overhead; in OverheadPerCodeSpace()
610 size_t overhead = OverheadPerCodeSpace(num_declared_functions); in ReservationSize() local
613 // a) needed size + overhead (this is the minimum needed) in ReservationSize()
614 // b) 2 * overhead (to not waste too much space by overhead) in ReservationSize()
616 size_t minimum_size = 2 * overhead; in ReservationSize()
[all...]
/third_party/libbpf/include/uapi/linux/
H A Dpkt_sched.h93 unsigned short overhead; member
105 int overhead; member
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_schedule_instructions.cpp1736 const unsigned overhead = v->grf_used && has_bank_conflict(isa, inst) ?
1739 return 4 + overhead;
1741 return 2 + overhead;
/third_party/icu/icu4c/source/test/perf/collationperf/
H A DCollPerf.pl205 comparison, and the overhead of memory usage and retrieval time for sort
/third_party/curl/lib/
H A Dmime.c1613 size_t overhead, const char *skip, size_t skiplen) in slist_size()
1619 size += strlen(s->data) + overhead; in slist_size()
1612 slist_size(struct curl_slist *s, size_t overhead, const char *skip, size_t skiplen) slist_size() argument
/third_party/node/deps/brotli/c/enc/
H A Dencode.c232 fill the table, incurring O(hash table size) overhead for in GetHashTable()
516 /* TODO: find more precise minimal block overhead. */ in ShouldCompress()
1429 size_t overhead = 2 + (4 * num_large_blocks) + 3 + 1; in BrotliEncoderMaxCompressedSize() local
1430 size_t result = input_size + overhead; in BrotliEncoderMaxCompressedSize()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dencode.c232 fill the table, incurring O(hash table size) overhead for in GetHashTable()
516 /* TODO: find more precise minimal block overhead. */ in ShouldCompress()
1429 size_t overhead = 2 + (4 * num_large_blocks) + 3 + 1; in BrotliEncoderMaxCompressedSize() local
1430 size_t result = input_size + overhead; in BrotliEncoderMaxCompressedSize()
/third_party/libunwind/libunwind/doc/
H A Dlibunwind-dynamic.tex317 overhead of explicit sorting is only paid when there is a real benefit

Completed in 55 milliseconds

12