| /linux/net/dccp/ |
| H A 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()
|
| /linux/lib/ |
| H A 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.
203 * Sorting time is O(n log n) both on average and worst-case. While
205 * O(n*n) worst-case behavior and extra memory requirements that make
267 * average, 3/4 worst-case.) in sort_r()
|
| H A D | decompress_unzstd.c | 14 * 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 D | decompress_unxz.c | 20 * The worst case for in-place decompression is that the beginning of
22 * incompressible. Thus, we must look for worst-case expansion when the
68 * the worst case for this would be tricky. Instead of trying to do that,
|
| H A D | plist.c | 269 /* Worst case test for plist_add() */ in plist_test()
293 pr_debug("plist_add worst case test time elapsed %lld\n", time_elapsed); in plist_test()
|
| /linux/arch/x86/boot/ |
| H A D | header.S | 394 # Getting to provably safe in-place decompression is hard. Worst case
444 # The worst case at the block level is a growth of the compressed data
447 # The worst case internal to a compressed block is very hard to figure.
448 # The worst case can at least be bounded by having one bit that represents
455 # block adding an extra 32767 bytes (the worst case uncompressed block size)
456 # is sufficient, to ensure that in the worst case the decompressed data for
|
| /linux/arch/x86/math-emu/ |
| H A 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
|
| /linux/Documentation/devicetree/bindings/power/ |
| H A 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
|
| /linux/net/netfilter/ |
| H A D | nft_set_pipapo.h | 232 * pipapo_estimate_size() - Estimate worst-case for set size
236 * of rules (composing netmasks) the entries expand to. We compute the worst
244 * Return: worst-case set size in bytes, 0 on any overflow
258 /* Worst-case ranges for each concatenated field: each n-bit in pipapo_estimate_size()
|
| /linux/drivers/gpu/drm/omapdrm/ |
| H A 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
|
| /linux/drivers/nfc/st21nfca/ |
| H A D | st21nfca.h | 21 /* Size in worst case :
32 /* Worst case when adding byte stuffing between each byte */
|
| /linux/include/net/ |
| H A 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.
|
| H A D | tso.h | 20 /* Calculate the worst case buffer count */
|
| /linux/include/linux/can/ |
| H A 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:
|
| /linux/tools/power/cpupower/bench/ |
| H A 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
|
| /linux/drivers/gpu/drm/amd/display/dc/hpo/dcn31/ |
| H A D | dcn31_hpo_dp_link_encoder.c | 374 /* Best case and worst case wait time for SAT_UPDATE_PENDING in dcn31_hpo_dp_link_enc_update_stream_allocation_table()
376 * worst: 868 us in dcn31_hpo_dp_link_enc_update_stream_allocation_table()
429 /* Best case and worst case wait time for RATE_UPDATE_PENDING in dcn31_hpo_dp_link_enc_set_throttled_vcp_size()
431 * worst: 903 ns in dcn31_hpo_dp_link_enc_set_throttled_vcp_size()
|
| /linux/tools/testing/selftests/net/tcp_ao/ |
| H A D | bench-lookups.c | 232 /* The worst case for FILO-list */ in server_fn()
237 test_print_stats("Delete: worst case", in server_fn()
345 test_print_stats("Connect: worst case", in client_fn()
|
| /linux/arch/arm/mach-shmobile/ |
| H A D | timer.c | 31 * Calculate a worst-case loops-per-jiffy value in shmobile_init_delay()
|
| /linux/drivers/media/pci/cx25821/ |
| H A D | cx25821-audio.h | 20 * Max size of the RISC program for a buffer. - worst case is 2 writes per line
|
| /linux/drivers/media/platform/st/sti/delta/ |
| H A D | delta-cfg.h | 37 * - at worst 21
|
| /linux/Documentation/arch/x86/x86_64/ |
| H A D | cpu-hotplug-spec.rst | 21 In the worst case the user can overwrite this choice using a command line
|
| /linux/block/ |
| H A D | blk-cgroup-fc-appid.c | 32 * Worst case an I/O may not find the right id. in blkcg_set_fc_appid()
|
| /linux/Documentation/usb/ |
| H A D | dwc3.rst | 23 usb_ep_disable(). Worst case are 32 interrupts, the lower limit is two
|
| /linux/kernel/sched/ |
| H A D | cpupri.c | 22 * worst case complexity of O(min(101, nr_domcpus)), though the scenario that
23 * yields the worst case search is fairly contrived.
|
| /linux/drivers/gpu/drm/i915/ |
| H A D | i915_vma_types.h | 223 * The worst case display setup would have the same vma pinned for
227 * Estimated worst case: 3 [qlen] * 4 [max crtcs] * 7 [max planes] = 84
|