| /linux-6.12.1/lib/zlib_inflate/ |
| D | inflate.h | 33 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 */
|
| D | inftrees.c | 13 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-6.12.1/arch/arm64/crypto/ |
| D | sm4-ce-gcm-glue.c | 28 const u8 *ghash_table, const u8 *lengths);
32 const u8 *ghash_table, const u8 *lengths);
142 const u8 *ghash_table, const u8 *lengths)) in gcm_crypt() argument
147 be128 __aligned(8) lengths; in gcm_crypt()
151 lengths.a = cpu_to_be64(req->assoclen * 8); in gcm_crypt()
152 lengths.b = cpu_to_be64(walk->total * 8); in gcm_crypt()
171 (const u8 *)&lengths); in gcm_crypt()
191 (const u8 *)&lengths); in gcm_crypt()
|
| D | ghash-ce-glue.c | 343 be128 lengths; in gcm_encrypt() local
347 lengths.a = cpu_to_be64(assoclen * 8); in gcm_encrypt()
348 lengths.b = cpu_to_be64(req->cryptlen * 8); in gcm_encrypt()
362 tag = (u8 *)&lengths; in gcm_encrypt()
408 be128 lengths; in gcm_decrypt() local
413 lengths.a = cpu_to_be64(assoclen * 8); in gcm_decrypt()
414 lengths.b = cpu_to_be64((req->cryptlen - authsize) * 8); in gcm_decrypt()
432 tag = (u8 *)&lengths; in gcm_decrypt()
|
| /linux-6.12.1/tools/testing/selftests/arm64/fp/ |
| D | sve-probe-vls.c | 32 * 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-6.12.1/include/trace/events/ |
| D | dma.h | 187 __dynamic_array(unsigned int, lengths, ents)
202 ((unsigned int *)__get_dynamic_array(lengths))[i] =
215 __print_array(__get_dynamic_array(lengths),
216 __get_dynamic_array_len(lengths) /
300 __dynamic_array(unsigned int, lengths, nents)
312 ((unsigned int *)__get_dynamic_array(lengths))[i] =
324 __print_array(__get_dynamic_array(lengths),
325 __get_dynamic_array_len(lengths) /
|
| /linux-6.12.1/fs/ntfs3/lib/ |
| D | lzx_decompress.c | 17 /* 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 …]
|
| D | decompress_common.c | 28 * 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()
|
| D | xpress_decompress.c | 26 /* An array that maps symbols to codeword lengths */
69 /* Read the Huffman codeword lengths. */ in xpress_decompress()
|
| /linux-6.12.1/fs/orangefs/ |
| D | xattr.c | 468 if (new_op->downcall.resp.listxattr.lengths[i] < 0 || in orangefs_listxattr()
469 new_op->downcall.resp.listxattr.lengths[i] > in orangefs_listxattr()
471 gossip_err("%s: impossible value for lengths[%d]\n", in orangefs_listxattr()
473 new_op->downcall.resp.listxattr.lengths[i]); in orangefs_listxattr()
477 if (total + new_op->downcall.resp.listxattr.lengths[i] > size) in orangefs_listxattr()
488 listxattr.lengths[i])) { in orangefs_listxattr()
494 new_op->downcall.resp.listxattr.lengths[i]); in orangefs_listxattr()
495 total += new_op->downcall.resp.listxattr.lengths[i]; in orangefs_listxattr()
502 key_size += new_op->downcall.resp.listxattr.lengths[i]; in orangefs_listxattr()
|
| /linux-6.12.1/lib/ |
| D | inflate.c | 25 single bytes (called "literals") and match lengths. A second Huffman
101 13. The literal/length and distance code bit lengths are read as a
102 single stream of lengths. It is possible (and advantageous) for
104 the two sets of lengths.
174 static const unsigned border[] = { /* Order of the bit length code lengths */
176 static const ush cplens[] = { /* Copy lengths for literal codes 257..285 */
323 unsigned *b, /* code lengths in bits (all assumed <= BMAX) */ in huft_build()
331 /* Given a list of code lengths and a maximum table size, make a set of in huft_build()
335 oversubscribed set of lengths), and three if not enough memory. */ in huft_build()
433 /* Make a table of values in order of bit lengths */ in huft_build()
[all …]
|
| D | build_OID_registry | 47 # Split the data up into separate lists and also determine the lengths of the
51 my @lengths = ();
70 push @lengths, $size;
|
| /linux-6.12.1/drivers/crypto/nx/ |
| D | nx-842.h | 116 * @multiple: All buffer lengths should be a multiple of this
117 * @minimum: Buffer lengths must not be less than this amount
118 * @maximum: Buffer lengths must not be more than this amount
120 * The constraints apply to all buffers and lengths, both input and output,
|
| /linux-6.12.1/Documentation/devicetree/bindings/spi/ |
| D | nvidia,tegra210-quad-peripheral-props.yaml | 17 Tap value varies based on platform design trace lengths from Tegra
26 Tap value varies based on platform design trace lengths from Tegra
|
| /linux-6.12.1/lib/zlib_deflate/ |
| D | deftree.c | 14 * 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 …]
|
| D | defutil.h | 27 /* 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-6.12.1/arch/arm/crypto/ |
| D | ghash-ce-glue.c | 498 be128 lengths; in gcm_encrypt() local
543 lengths.a = cpu_to_be64(assoclen * 8); in gcm_encrypt()
544 lengths.b = cpu_to_be64(req->cryptlen * 8); in gcm_encrypt()
546 tag = (u8 *)&lengths; in gcm_encrypt()
590 be128 lengths; in gcm_decrypt() local
638 lengths.a = cpu_to_be64(assoclen * 8); in gcm_decrypt()
639 lengths.b = cpu_to_be64((req->cryptlen - authsize) * 8); in gcm_decrypt()
641 tag = (u8 *)&lengths; in gcm_decrypt()
|
| /linux-6.12.1/Documentation/devicetree/bindings/display/ti/ |
| D | ti,omap5-dss.txt | 64 - 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',
|
| D | ti,omap4-dss.txt | 83 - 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-6.12.1/include/linux/ |
| D | crc32.h | 18 * sequences of bytes, seq1 and seq2 with lengths len1
46 * sequences of bytes, seq1 and seq2 with lengths len1
|
| /linux-6.12.1/arch/arm64/kvm/ |
| D | reset.c | 61 * 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-6.12.1/drivers/media/rc/ |
| D | redrat3.c | 77 /* Max number of lengths in the signal. */
83 /* Delta value when measuring lengths */
119 * The redrat3 encodes an IR signal as set of different lengths and a set
120 * of indices into those lengths. This sets how much two lengths must
311 /* don't allow zero lengths to go back, breaks lirc */ in redrat3_len_to_us()
316 * convert us back into redrat3 lengths
335 /* don't allow zero lengths to go back, breaks lirc */ in redrat3_us_to_len()
|
| /linux-6.12.1/drivers/mtd/parsers/ |
| D | Kconfig | 100 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-6.12.1/net/rds/ |
| D | info.h | 16 * or not by comparing the lengths.
|
| /linux-6.12.1/Documentation/networking/ |
| D | udplite.rst | 215 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.
|