Searched refs:fastest (Results 1 – 20 of 20) sorted by relevance
119 struct xor_block_template *f, *fastest; in calibrate_xor_blocks() local121 fastest = XOR_SELECT_TEMPLATE(NULL); in calibrate_xor_blocks()123 if (fastest) { in calibrate_xor_blocks()126 fastest->name); in calibrate_xor_blocks()147 fastest = template_list; in calibrate_xor_blocks()148 for (f = fastest; f; f = f->next) in calibrate_xor_blocks()149 if (f->speed > fastest->speed) in calibrate_xor_blocks()150 fastest = f; in calibrate_xor_blocks()153 fastest->name, fastest->speed); in calibrate_xor_blocks()159 active_template = fastest; in calibrate_xor_blocks()
54 non-blocking mode. Blocking mode will guarantee the fastest result but
137 for a channel at a given time, in which case the maximum value (fastest
229 value (fastest fan speed) wins.
35 of additional memory to allow for fastest operation, both for
49 Values are decimal integers from 1 (slowest) to 255 (fastest).
46 fastest AES implementation for single blocks. For multiple
190 decompression speed is the second fastest and its compression speed202 is the fastest.
75 We recommend that developers who want the fastest incremental builds
15 bool "Automatically choose fastest RAID6 PQ functions"20 fastest one.
228 * This is the fastest we can go.
112 initiator access, and the term "near memory" represents the fastest
274 I also introduced the parity lookup. I expected this to be the fastest735 It proved to be fastest to do some table lookups. Performance gain
794 /* fastest mode for USB 2 */
366 slowest, to nine fastest.
470 # now, w/ group1, make mul64's decode the fastest since it will
303 several types. This example shows generic constraints like the fastest SPI
557 A: We recommend that developers who want the fastest incremental builds
606 Produce compressed trace using specified level n (default: 1 - fastest compression,
391 (both compression and decompression) is the fastest.