Home
last modified time | relevance | path

Searched full:worst (Results 1 – 25 of 752) sorted by relevance

12345678910>>...31

/OK3568_Linux_fs/kernel/net/dccp/
H A Dqpolicy.c48 struct sk_buff *skb, *worst = NULL; in qpolicy_prio_worst_skb() local
51 if (worst == NULL || skb->priority < worst->priority) in qpolicy_prio_worst_skb()
52 worst = skb; in qpolicy_prio_worst_skb()
53 return worst; in qpolicy_prio_worst_skb()
/OK3568_Linux_fs/kernel/lib/
H A Dsort.c6 * and 1.5*n*log2(n) + O(n) in the (very contrived) worst case.
10 * quicksort's O(n^2) worst case.
194 * Sorting time is O(n log n) both on average and worst-case. While
196 * O(n*n) worst-case behavior and extra memory requirements that make
247 * average, 3/4 worst-case.) in sort_r()
H A Ddecompress_unzstd.c14 * The worst case for in-place decompression is that the beginning of
16 * uncompressible. Thus, we must look for worst-case expansion when the
38 * the worst case for this would be tricky. Instead of trying to do that,
H A Ddecompress_unxz.c21 * The worst case for in-place decompression is that the beginning of
23 * uncompressible. Thus, we must look for worst-case expansion when the
69 * the worst case for this would be tricky. Instead of trying to do that,
/OK3568_Linux_fs/kernel/arch/h8300/lib/
H A Dmulsi3.S9 ; 16b * 16b = 372 states (worst case)
10 ; 32b * 32b = 724 states (worst case)
/OK3568_Linux_fs/buildroot/package/dahdi-linux/
H A D0002-fix-build-with-32-bits-kernel.patch36 - "%-15s: counts %3d, %3d, %3d worst %3d, overflows %3d worst_lag %02lld.%lld ms\n",
37 + "%-15s: counts %3d, %3d, %3d worst %3d, overflows %3d worst_lag %02lld.%d ms\n",
118 - NOTICE("Overflow of %-15s: counts %3d, %3d, %3d worst %3d, overflows %3d worst_lag %02lld.%lld …
120 + NOTICE("Overflow of %-15s: counts %3d, %3d, %3d worst %3d, overflows %3d worst_lag %02lld.%d ms…
/OK3568_Linux_fs/kernel/arch/x86/math-emu/
H A DREADME239 each function was tested at about 400 points. Ideal worst-case results
247 Function Tested x range Worst result Turbo C
281 Function Tested x range Worst result
307 worst-case results which are better than the worst-case results given
321 the worst accuracy which was found (in bits) and the approximate value
326 instr arg range # tests 63.7 63.8 63.9 worst at arg
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/power/
H A Ddomain-idle-state.yaml32 The worst case latency in microseconds required to enter the idle
38 The worst case latency in microseconds required to exit the idle
/OK3568_Linux_fs/kernel/net/netfilter/
H A Dnft_set_pipapo.h233 * pipapo_estimate_size() - Estimate worst-case for set size
237 * of rules (composing netmasks) the entries expand to. We compute the worst
245 * Return: worst-case set size in bytes, 0 on any overflow
259 /* Worst-case ranges for each concatenated field: each n-bit in pipapo_estimate_size()
/OK3568_Linux_fs/kernel/arch/x86/boot/
H A Dheader.S456 # Getting to provably safe in-place decompression is hard. Worst case
506 # The worst case at the block level is a growth of the compressed data
509 # The worst case internal to a compressed block is very hard to figure.
510 # The worst case can at least be bounded by having one bit that represents
517 # block adding an extra 32767 bytes (the worst case uncompressed block size)
518 # is sufficient, to ensure that in the worst case the decompressed data for
/OK3568_Linux_fs/kernel/arch/arm64/kvm/hyp/include/nvhe/
H A Dmm.h47 /* Provision the worst case scenario */ in __hyp_pgtable_max_pages()
84 * Include an extra 16 pages to safely upper-bound the worst case of in host_s2_mem_pgtable_pages()
/OK3568_Linux_fs/kernel/arch/x86/include/asm/
H A Dpgtable_32.h63 * (KERNEL_IMAGE_SIZE/4096) / 1024 pages (worst case, non PAE)
64 * (KERNEL_IMAGE_SIZE/4096) / 512 + 4 pages (worst case for PAE)
/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-benchmark/stressapptest/stressapptest/
H A Dread_sysfs_for_cachesize.patch28 // Return the worst case (largest) cache line size of the various levels of
65 // Return the worst-case (largest) cache line size of the system.
/OK3568_Linux_fs/kernel/drivers/gpu/drm/omapdrm/
H A Domap_dmm_priv.h114 * 3 descriptors is probably the worst-case for # of 2d-slices in a 1d area,
115 * but I guess you don't hit that worst case at the same time as full area
/OK3568_Linux_fs/kernel/include/net/
H A D6lowpan.h72 * Useful for getting the "extra" bytes we need at worst case compression.
77 /* Maximum worst case IPHC header buffer size */
318 * which is the IPHC "more bytes than IPv6 header" at worst case.
H A Drpl.h26 /* Worst decompression memory usage ipv6 address (16) + pad 7 */
/OK3568_Linux_fs/kernel/drivers/nfc/st21nfca/
H A Dst21nfca.h21 /* Size in worst case :
32 /* Worst case when adding byte stuffing between each byte */
/OK3568_Linux_fs/kernel/tools/power/cpupower/bench/
H A DREADME-BENCH7 - Identify worst case performance loss when doing dynamic frequency
84 will always see 50% loads and you get worst performance impact never
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/arm/
H A Didle-states.yaml87 entry-latency: Worst case latency required to enter the idle state. The
114 the worst case since it depends on the CPU operating conditions, i.e. caches
119 worst case wake-up latency it can incur if a CPU is allowed to enter an
288 Worst case latency in microseconds required to enter the idle state.
292 Worst case latency in microseconds required to exit the idle state.
/OK3568_Linux_fs/kernel/drivers/gpu/arm/bifrost/thirdparty/
H A Dmali_kbase_mmap.c140 /* Adjust search length to account for worst case alignment overhead */ in kbase_unmapped_area_topdown()
233 /* Adjust search length to account for worst case alignment overhead */ in kbase_unmapped_area_topdown()
297 * borrow part of the SAME_VA zone). In the worst case, this path may in kbase_context_get_unmapped_area()
/OK3568_Linux_fs/kernel/arch/arm/mach-shmobile/
H A Dtimer.c31 * Calculate a worst-case loops-per-jiffy value in shmobile_init_delay()
/OK3568_Linux_fs/kernel/drivers/media/pci/cx25821/
H A Dcx25821-audio.h20 * Max size of the RISC program for a buffer. - worst case is 2 writes per line
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dbitmap.h51 in the worst case (a sparse set with large distances between the values
116 The following operations can be performed in O(E) time worst-case in
133 amortized time with O(E) worst-case behavior.
181 time amortized (but O(E) time worst-case).
189 but O(E) time worst-case, but in O(1) time if the same element is
197 but O(E) time worst-case:
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dbitmap.h51 in the worst case (a sparse set with large distances between the values
116 The following operations can be performed in O(E) time worst-case in
133 amortized time with O(E) worst-case behavior.
181 time amortized (but O(E) time worst-case).
189 but O(E) time worst-case, but in O(1) time if the same element is
197 but O(E) time worst-case:
/OK3568_Linux_fs/kernel/drivers/media/platform/sti/delta/
H A Ddelta-cfg.h37 * - at worst 21

12345678910>>...31