Searched full:shortest (Results 1 – 25 of 81) sorted by relevance
1234
| /linux-6.14.4/drivers/auxdisplay/ |
| D | hd44780.c | 112 /* The shortest command takes at least 120 us */ in hd44780_write_cmd_gpio8()
123 /* The shortest data takes at least 45 us */ in hd44780_write_data_gpio8()
151 /* The shortest command takes at least 120 us */ in hd44780_write_cmd_gpio4()
179 /* The shortest data takes at least 45 us */ in hd44780_write_data_gpio4()
|
| 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-6.14.4/net/netfilter/ipvs/ |
| 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
|
| D | ip_vs_sed.c | 3 * IPVS: Shortest Expected Delay scheduling module
140 MODULE_DESCRIPTION("ipvs shortest expected delay scheduler");
|
| D | ip_vs_nq.c | 14 * sent to the server that minimize its expected delay (The Shortest
|
| /linux-6.14.4/Documentation/devicetree/bindings/mfd/ |
| 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
|
| D | rohm,bd71837-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-6.14.4/Documentation/networking/ |
| 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-6.14.4/fs/ntfs3/lib/ |
| 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-6.14.4/Documentation/ABI/testing/ |
| D | configfs-usb-gadget-uvc | 276 dwMaxBitRate the maximum bit rate at the shortest
335 dwMaxBitRate the maximum bit rate at the shortest
399 dwMaxBitRate the maximum bit rate at the shortest
|
| /linux-6.14.4/fs/unicode/ |
| D | utf8-norm.c | 36 * shortest representation of a 32bit value is to be used. A decoder
62 * The shortest sequence requirement was introduced by:
63 * Corrigendum #1: UTF-8 Shortest Form
|
| /linux-6.14.4/Documentation/admin-guide/device-mapper/ |
| D | dm-service-time.rst | 6 which selects a path with the shortest estimated service time for
|
| /linux-6.14.4/Documentation/locking/ |
| 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-6.14.4/drivers/acpi/acpica/ |
| 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-6.14.4/lib/zlib_inflate/ |
| 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-6.14.4/drivers/md/ |
| D | Kconfig | 447 the path expected to complete the incoming I/O in the shortest
457 the path expected to complete the incoming I/O in the shortest
|
| /linux-6.14.4/tools/perf/util/ |
| D | annotate-data.h | 203 * shortest path of basic blocks, it only maintains a single table.
|
| /linux-6.14.4/Documentation/block/ |
| D | blk-mq.rst | 50 queues. When the request arrives at the block layer, it will try the shortest
|
| /linux-6.14.4/drivers/net/ethernet/realtek/rtase/ |
| D | rtase.h | 25 /* 3 means InterFrameGap = the shortest one */
|
| /linux-6.14.4/Documentation/filesystems/bcachefs/ |
| D | CodingStyle.rst | 172 tools we use for testing. The shortest possible edit/test/debug cycle is
|
| /linux-6.14.4/lib/ |
| D | inflate.c | 283 shortest codes, so those codes dominate the decoding time, and hence
295 bits is used, or when the shortest code is *longer* than the requested
296 table size, in which case the length of the shortest code in bits is
453 /* go through the bit lengths (k already is bits in shortest code) */ in huft_build()
|
| /linux-6.14.4/drivers/parport/ |
| D | probe.c | 184 * the ID length. Read according to shortest possible ID in parport_read_device_id()
|
| /linux-6.14.4/drivers/watchdog/ |
| D | realtek_otto_wdt.c | 200 /* Configure for shortest timeout and wait for reset to occur */ in otto_wdt_restart()
|
| /linux-6.14.4/Documentation/staging/ |
| D | lzo.rst | 106 stream length is at least 5 bytes (length of shortest possible
|
| /linux-6.14.4/drivers/media/i2c/ |
| D | ir-kbd-i2c.c | 505 * is set to the shortest possible anyway.
581 /* We have to encode the trailing pulse. Find the shortest space */ in zilog_ir_format()
|
1234