Home
last modified time | relevance | path

Searched full:lengths (Results 1 – 25 of 409) sorted by relevance

12345678910>>...17

/linux/lib/zlib_inflate/
H A Dinflate.h33 TABLE, /* i: waiting for dynamic block table lengths */
34 LENLENS, /* i: waiting for code length code lengths */
35 CODELENS, /* i: waiting for length/lit and distance code lengths */
104 unsigned ncode; /* number of code length code lengths */
105 unsigned nlen; /* number of length code lengths */
106 unsigned ndist; /* number of distance code lengths */
107 unsigned have; /* number of code lengths in lens[] */
109 unsigned short lens[320]; /* temporary storage for code lengths */
H A Dinftrees.c13 The code lengths are lens[0..codes-1]. The result starts at *table,
28 unsigned min, max; /* minimum and maximum code lengths */ in zlib_inflate_table()
62 Process a set of code lengths to create a canonical Huffman code. The in zlib_inflate_table()
63 code lengths are lens[0..codes-1]. Each length corresponds to the in zlib_inflate_table()
66 for codes with equal lengths. Then the code starts with all zero bits in zlib_inflate_table()
87 codes at all, checking for a valid set of lengths, and looking ahead in zlib_inflate_table()
92 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ in zlib_inflate_table()
98 /* bound code lengths, force root to be within code lengths */ in zlib_inflate_table()
116 /* check for an over-subscribed or incomplete set of lengths */ in zlib_inflate_table()
150 code lengths to determine what size sub-table is needed. The length in zlib_inflate_table()
/linux/tools/testing/selftests/arm64/fp/
H A Dsve-probe-vls.c32 * Enumerate up to SVE_VQ_MAX vector lengths in main()
55 ksft_test_result_pass("Enumerated %d vector lengths\n", nvqs); in main()
56 ksft_test_result_pass("All vector lengths valid\n"); in main()
58 /* Print out the vector lengths in ascending order: */ in main()
/linux/fs/ntfs3/lib/
H A Dlzx_decompress.c17 /* The smallest and largest allowed match lengths */
21 /* Number of distinct match lengths that can be represented */
24 /* Number of match lengths for which no length symbol is required */
65 /* Maximum lengths (in bits) of the codewords in each Huffman code */
120 * lengths
246 * the codeword lengths for this Huffman code were read, or all 0's
262 /* Read the lengths of the precode codewords. These are given in lzx_read_codeword_lens()
279 /* Decode the codeword lengths. */ in lzx_read_codeword_lens()
306 /* Run of identical lengths */ in lzx_read_codeword_lens()
326 * lengths will still be in range, and data that in lzx_read_codeword_lens()
[all …]
H A Ddecompress_common.c28 * reconstructed directly from the codeword lengths. A prefix code is
64 * used symbols are assigned the shortest codeword lengths.
105 * Returns 0 on success, or -1 if the lengths do not form a valid prefix
135 /* We can assume all lengths are <= max_codeword_len, but we in make_huffman_decode_table()
139 * exactly filled by the lengths, by this measure. in make_huffman_decode_table()
146 /* The lengths overflow the codespace; that is, the code in make_huffman_decode_table()
154 /* The lengths do not fill the codespace; that is, they form an in make_huffman_decode_table()
H A Dxpress_decompress.c26 /* An array that maps symbols to codeword lengths */
69 /* Read the Huffman codeword lengths. */ in xpress_decompress()
/linux/include/trace/events/
H A Ddma.h287 __dynamic_array(unsigned int, lengths, ents)
302 ((unsigned int *)__get_dynamic_array(lengths))[i] =
315 __print_array(__get_dynamic_array(lengths),
316 __get_dynamic_array_len(lengths) /
434 __dynamic_array(unsigned int, lengths, nents)
446 ((unsigned int *)__get_dynamic_array(lengths))[i] =
458 __print_array(__get_dynamic_array(lengths),
459 __get_dynamic_array_len(lengths) /
/linux/fs/orangefs/
H A Dxattr.c470 if (new_op->downcall.resp.listxattr.lengths[i] < 0 || in orangefs_listxattr()
471 new_op->downcall.resp.listxattr.lengths[i] > in orangefs_listxattr()
473 gossip_err("%s: impossible value for lengths[%d]\n", in orangefs_listxattr()
475 new_op->downcall.resp.listxattr.lengths[i]); in orangefs_listxattr()
479 if (total + new_op->downcall.resp.listxattr.lengths[i] > size) in orangefs_listxattr()
490 listxattr.lengths[i])) { in orangefs_listxattr()
496 new_op->downcall.resp.listxattr.lengths[i]); in orangefs_listxattr()
497 total += new_op->downcall.resp.listxattr.lengths[i]; in orangefs_listxattr()
504 key_size += new_op->downcall.resp.listxattr.lengths[i]; in orangefs_listxattr()
/linux/include/crypto/
H A Dsha2.h225 * @raw_key_len: the key length in bytes. All key lengths are supported.
255 * @raw_key_len: the key length in bytes. All key lengths are supported.
309 * @raw_key_len: the key length in bytes. All key lengths are supported.
426 * @raw_key_len: the key length in bytes. All key lengths are supported.
456 * @raw_key_len: the key length in bytes. All key lengths are supported.
510 * @raw_key_len: the key length in bytes. All key lengths are supported.
633 * @raw_key_len: the key length in bytes. All key lengths are supported.
663 * @raw_key_len: the key length in bytes. All key lengths are supported.
717 * @raw_key_len: the key length in bytes. All key lengths are supported.
806 * @raw_key_len: the key length in bytes. All key lengths are supported.
[all …]
H A Dsha1.h123 * @raw_key_len: the key length in bytes. All key lengths are supported.
149 * @raw_key_len: the key length in bytes. All key lengths are supported.
203 * @raw_key_len: the key length in bytes. All key lengths are supported.
H A Dmd5.h115 * @raw_key_len: the key length in bytes. All key lengths are supported.
141 * @raw_key_len: the key length in bytes. All key lengths are supported.
195 * @raw_key_len: the key length in bytes. All key lengths are supported.
/linux/lib/crypto/tests/
H A Dsha256_kunit.c46 * Test for sha256_finup_2x(). Specifically, choose various data lengths and
47 * salt lengths, and for each one, verify that sha256_finup_2x() produces the
128 * results with total message lengths that require more than 32 bits.
156 * Try a few different salt lengths, since sha256_finup_2x() performance in benchmark_sha256_finup_2x()
H A Dhash-test-template.h50 /* Generate a random length, preferring small lengths. */
167 * selected sequence of update lengths that sum to total_len. in test_hash_incremental_updates()
439 * Generate a list of update lengths to use. Ensure that it contains in test_hash_interrupt_context_2()
478 * Thus, just do a single consolidated test, which covers all data lengths up to
479 * 4096 bytes and all key lengths up to 292 bytes. For each data length, select
504 * Cycle through key lengths as well. Somewhat arbitrarily go in test_hmac()
536 /* Benchmark the hash function on various data lengths. */
H A Dblake2s_kunit.c66 * key lengths. Also tests both blake2s() and blake2s_init_key().
99 * allowed output lengths.
H A Dpoly1305_kunit.c69 * Accumulator overflow bugs may be specific to particular update lengths (in
75 * Poly1305 context with all-one-bits data of varying lengths (0, 16, 32, ...,
/linux/Documentation/devicetree/bindings/spi/
H A Dnvidia,tegra210-quad-peripheral-props.yaml17 Tap value varies based on platform design trace lengths from Tegra
26 Tap value varies based on platform design trace lengths from Tegra
/linux/lib/zlib_deflate/
H A Ddeftree.c14 * a Huffman encoding of the lengths of all the code strings (in
16 * reconstructed from the lengths in the inflate process, as described
75 /* The lengths of the bit length codes are sent in order of decreasing
76 * probability, to avoid transmitting the lengths for unused bit length codes.
84 /* The static literal tree. Since the bit lengths are imposed, there is no
344 * Compute the optimal bit lengths for a tree and update the total bit length
373 /* In a first pass, compute the optimal bit lengths (which may in gen_bitlen()
412 /* Now recompute all bit lengths, scanning in increasing frequency. in gen_bitlen()
414 * lengths instead of fixing only the wrong ones. This idea is taken in gen_bitlen()
477 * Construct one Huffman tree and assigns the code bit strings and lengths.
[all …]
H A Ddefutil.h27 /* number of codes used to transfer the bit lengths */
172 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
192 uch *l_buf; /* buffer for literals or lengths */
195 /* Size of match buffer for literals/lengths. There are 4 reasons for
218 * the same number of elements. To use different lengths, an extra flag
/linux/Documentation/devicetree/bindings/display/ti/
H A Dti,omap5-dss.txt64 - reg: addresses and lengths of the register spaces for 'proto', 'phy' and 'pll'
86 - reg: addresses and lengths of the register spaces for 'wp', 'pll', 'phy',
H A Dti,omap4-dss.txt83 - reg: addresses and lengths of the register spaces for 'proto', 'phy' and 'pll'
105 - reg: addresses and lengths of the register spaces for 'wp', 'pll', 'phy',
/linux/lib/
H A Dbuild_OID_registry47 # Split the data up into separate lists and also determine the lengths of the
51 my @lengths = ();
70 push @lengths, $size;
/linux/arch/arm64/kvm/
H A Dreset.c61 * order to support vector lengths greater than in kvm_arm_init_sve()
68 * Don't even try to make use of vector lengths that in kvm_arm_init_sve()
84 * Userspace can still customize the vector lengths by writing in kvm_vcpu_enable_sve()
/linux/drivers/mtd/parsers/
H A DKconfig100 of devices. It is used to describe the offsets and lengths of kernel
159 the offsets, lengths and names of all the images stored in the
/linux/Documentation/networking/
H A Dudplite.rst215 lengths), only the first fragment needs to be considered. When using
216 larger checksum coverage lengths, each eligible fragment needs to be
230 coverage lengths are likely to be expected.
/linux/net/rds/
H A Dinfo.h16 * or not by comparing the lengths.

12345678910>>...17