| /openbmc/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()
|
| /openbmc/openbmc/poky/meta/recipes-extended/gawk/gawk/ |
| H A D | 0001-configure.ac-re-enable-disabled-printf-features.patch | 22 - has_f_format=no dnl Cross-compiling, assuming the worst.
31 - has_a_format=no dnl Cross-compiling, assuming the worst.
|
| /openbmc/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.
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()
|
| 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 | 21 * The worst case for in-place decompression is that the beginning of
23 * incompressible. 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,
|
| /openbmc/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
|
| /openbmc/linux/arch/x86/boot/ |
| H A 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
|
| /openbmc/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
|
| /openbmc/linux/net/netfilter/ |
| H A 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()
|
| /openbmc/linux/arch/arm64/include/asm/ |
| H A 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()
|
| /openbmc/qemu/tests/qemu-iotests/ |
| H A D | 302 | 53 # 3. Make room for image data, allocating for the worst case.
73 # 3. Make room for image data, allocating for the worst case.
|
| /openbmc/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
|
| /openbmc/linux/drivers/nfc/st21nfca/ |
| H A D | st21nfca.h | 21 /* Size in worst case :
32 /* Worst case when adding byte stuffing between each byte */
|
| /openbmc/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
|
| /openbmc/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:
|
| /openbmc/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 */
|
| /openbmc/linux/drivers/gpu/drm/amd/display/dc/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()
|
| /openbmc/linux/arch/arm/mach-shmobile/ |
| H A D | timer.c | 31 * Calculate a worst-case loops-per-jiffy value in shmobile_init_delay()
|
| /openbmc/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
|
| /openbmc/linux/drivers/media/platform/st/sti/delta/ |
| H A D | delta-cfg.h | 37 * - at worst 21
|
| /openbmc/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()
|
| /openbmc/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
|
| /openbmc/linux/Documentation/usb/ |
| H A D | dwc3.rst | 23 usb_ep_disable(). Worst case are 32 interrupts, the lower limit is two
|
| /openbmc/linux/Documentation/devicetree/bindings/regulator/ |
| H A D | vctrl.txt | 29 down in the worst case (lightest expected load).
|