| /linux/net/netfilter/ipvs/ |
| H A D | Kconfig | 250 tristate "shortest expected delay scheduling"
252 The shortest expected delay scheduling algorithm assigns network
253 connections to the server with the shortest expected delay. The
269 that minimize its expected delay (The Shortest Expected Delay
|
| H A D | ip_vs_sed.c | 3 * IPVS: Shortest Expected Delay scheduling module
140 MODULE_DESCRIPTION("ipvs shortest expected delay scheduler");
|
| H A D | ip_vs_nq.c | 14 * sent to the server that minimize its expected delay (The Shortest
|
| /linux/Documentation/devicetree/bindings/mfd/ |
| H A D | rohm,bd71847-pmic.yaml | 65 # Shortest being 10ms, next 500ms and then multiple of 500ms up to 7,5s
67 # Shortest being 10ms, next 1000ms and then multiple of 1000ms up to 15s
|
| /linux/Documentation/networking/ |
| H A D | bridge.rst | 113 shortest path to the root bridge and, in doing so, create a loop-free
123 BPDUs and determines which of its ports provides the shortest path to the
133 STP ensures network convergence by calculating the shortest path and disabling
|
| /linux/fs/ntfs3/lib/ |
| H A D | decompress_common.c | 64 * used symbols are assigned the shortest codeword lengths.
196 * The table will start with entries for the shortest codeword(s), which in make_huffman_decode_table()
|
| /linux/Documentation/locking/ |
| H A D | lockstat.rst | 56 - shortest (non-0) time we ever had to wait for a lock
69 - shortest (non-0) time we ever held the lock
|
| /linux/Documentation/admin-guide/device-mapper/ |
| H A D | dm-service-time.rst | 6 which selects a path with the shortest estimated service time for
|
| /linux/drivers/acpi/acpica/ |
| H A D | exmisc.c | 406 /* Bytes match (to shortest length), compare lengths */ in acpi_ex_do_logical_op()
423 /* Bytes match (to shortest length), compare lengths */ in acpi_ex_do_logical_op()
|
| /linux/lib/zlib_inflate/ |
| H A D | inftrees.c | 21 longest code or if it is less than the shortest code.
67 for the first code of the shortest length, and the codes are integer in zlib_inflate_table()
|
| /linux/tools/perf/util/ |
| H A D | annotate-data.h | 206 * shortest path of basic blocks, it only maintains a single table.
|
| /linux/Documentation/block/ |
| H A D | blk-mq.rst | 50 queues. When the request arrives at the block layer, it will try the shortest
|
| /linux/drivers/net/ethernet/realtek/rtase/ |
| H A D | rtase.h | 25 /* 3 means InterFrameGap = the shortest one */
|
| /linux/drivers/parport/ |
| H A D | probe.c | 184 * the ID length. Read according to shortest possible ID in parport_read_device_id()
|
| /linux/include/linux/ |
| H A D | topology.h | 303 * find the one with the shortest distance.
|
| /linux/drivers/auxdisplay/ |
| H A D | panel.c | 732 udelay(40); /* the shortest command takes at least 40 us */ in lcd_write_cmd_s()
743 udelay(40); /* the shortest data takes at least 40 us */ in lcd_write_data_s()
765 udelay(120); /* the shortest command takes at least 120 us */ in lcd_write_cmd_p8()
787 udelay(45); /* the shortest data takes at least 45 us */ in lcd_write_data_p8()
|
| /linux/drivers/watchdog/ |
| H A D | realtek_otto_wdt.c | 200 /* Configure for shortest timeout and wait for reset to occur */ in otto_wdt_restart()
|
| /linux/Documentation/staging/ |
| H A D | lzo.rst | 106 stream length is at least 5 bytes (length of shortest possible
|
| /linux/Documentation/devicetree/bindings/cpu/ |
| H A D | idle-states.yaml | 123 An operating system scheduler may need to compute the shortest wake-up delay
130 (e.g. waking-up) the CPU with the shortest wake-up delay.
|
| /linux/drivers/net/wireless/ath/ath9k/ |
| H A D | link.c | 429 * The interval must be the shortest necessary to satisfy ANI, in ath_ani_calibrate()
|
| /linux/fs/xfs/scrub/ |
| H A D | refcount.c | 71 * a. Find the shortest fragments in the set and remove them.
|
| H A D | rtrefcount.c | 85 * a. Find the shortest fragments in the set and remove them.
|
| /linux/drivers/pwm/ |
| H A D | pwm-meson.c | 307 * in the shortest possible duration for one "count" in meson_pwm_apply()
|
| /linux/drivers/rtc/ |
| H A D | rtc-omap.c | 475 * The one-second alarm offset is the shortest offset possible as the alarm
|
| /linux/Documentation/scheduler/ |
| H A D | sched-util-clamp.rst | 650 since it designates the shortest computational time to finish the task's
|