| /kernel/linux/linux-5.10/net/dccp/ |
| D | qpolicy.c | 48 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()
|
| /kernel/linux/linux-6.6/net/dccp/ |
| D | qpolicy.c | 48 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()
|
| /kernel/linux/linux-5.10/arch/h8300/lib/ |
| D | mulsi3.S | 9 ; 16b * 16b = 372 states (worst case)
10 ; 32b * 32b = 724 states (worst case)
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/power/ |
| D | domain-idle-state.yaml | 32 The worst case latency in microseconds required to enter the idle
38 The worst case latency in microseconds required to exit the idle
|
| /kernel/linux/linux-5.10/lib/ |
| D | sort.c | 6 * 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()
|
| /kernel/linux/linux-6.6/lib/ |
| D | sort.c | 6 * and 1.5*n*log2(n) + O(n) in the (very contrived) worst case.
10 * quicksort's O(n^2) worst case.
205 * Sorting time is O(n log n) both on average and worst-case. While
207 * O(n*n) worst-case behavior and extra memory requirements that make
262 * average, 3/4 worst-case.) in sort_r()
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/power/ |
| D | domain-idle-state.yaml | 33 The worst case latency in microseconds required to enter the idle
39 The worst case latency in microseconds required to exit the idle
|
| /kernel/linux/linux-6.6/arch/x86/boot/ |
| D | header.S | 398 # Getting to provably safe in-place decompression is hard. Worst case
448 # The worst case at the block level is a growth of the compressed data
451 # The worst case internal to a compressed block is very hard to figure.
452 # The worst case can at least be bounded by having one bit that represents
459 # block adding an extra 32767 bytes (the worst case uncompressed block size)
460 # is sufficient, to ensure that in the worst case the decompressed data for
|
| /kernel/linux/linux-5.10/net/netfilter/ |
| D | nft_set_pipapo.h | 241 * pipapo_estimate_size() - Estimate worst-case for set size
245 * of rules (composing netmasks) the entries expand to. We compute the worst
253 * Return: worst-case set size in bytes, 0 on any overflow
267 /* Worst-case ranges for each concatenated field: each n-bit in pipapo_estimate_size()
|
| /kernel/linux/linux-5.10/arch/x86/include/asm/ |
| D | pgtable_32.h | 63 * (KERNEL_IMAGE_SIZE/4096) / 1024 pages (worst case, non PAE)
64 * (KERNEL_IMAGE_SIZE/4096) / 512 + 4 pages (worst case for PAE)
|
| /kernel/linux/linux-5.10/arch/x86/math-emu/ |
| D | README | 239 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
|
| /kernel/linux/linux-6.6/arch/x86/math-emu/ |
| D | README | 239 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
|
| /kernel/linux/linux-6.6/net/netfilter/ |
| D | nft_set_pipapo.h | 239 * pipapo_estimate_size() - Estimate worst-case for set size
243 * of rules (composing netmasks) the entries expand to. We compute the worst
251 * Return: worst-case set size in bytes, 0 on any overflow
265 /* Worst-case ranges for each concatenated field: each n-bit in pipapo_estimate_size()
|
| /kernel/linux/linux-5.10/arch/x86/boot/ |
| D | header.S | 456 # 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
|
| /kernel/linux/linux-6.6/arch/arm64/include/asm/ |
| D | kvm_pkvm.h | 61 /* Provision the worst case scenario */ in __hyp_pgtable_max_pages()
100 * Include an extra 16 pages to safely upper-bound the worst case of in host_s2_pgtable_pages()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/omapdrm/ |
| D | omap_dmm_priv.h | 106 * 3 descriptors is probably the worst-case for # of 2d-slices in a 1d area,
107 * but I guess you don't hit that worst case at the same time as full area
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/omapdrm/ |
| D | omap_dmm_priv.h | 114 * 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
|
| /kernel/linux/linux-5.10/drivers/nfc/st21nfca/ |
| D | st21nfca.h | 21 /* Size in worst case :
32 /* Worst case when adding byte stuffing between each byte */
|
| /kernel/linux/linux-6.6/drivers/nfc/st21nfca/ |
| D | st21nfca.h | 21 /* Size in worst case :
32 /* Worst case when adding byte stuffing between each byte */
|
| /kernel/linux/linux-5.10/tools/power/cpupower/bench/ |
| D | README-BENCH | 7 - Identify worst case performance loss when doing dynamic frequency
84 will always see 50% loads and you get worst performance impact never
|
| /kernel/linux/linux-6.6/tools/power/cpupower/bench/ |
| D | README-BENCH | 7 - Identify worst case performance loss when doing dynamic frequency
84 will always see 50% loads and you get worst performance impact never
|
| /kernel/linux/linux-6.6/include/linux/can/ |
| D | length.h | 157 * The worst bit stuffing case is a sequence in which dominant and
172 * Return: length of the stuffed bit stream in the worst case scenario.
212 * @bitstuffing: true: calculate the bitstuffing worst case; false:
|
| /kernel/linux/linux-5.10/include/net/ |
| D | 6lowpan.h | 72 * 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.
|
| /kernel/linux/linux-6.6/include/net/ |
| D | 6lowpan.h | 72 * 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.
|
| D | tso.h | 20 /* Calculate the worst case buffer count */
|