Home
last modified time | relevance | path

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

12345678910>>...31

/freebsd/sys/crypto/
H A Dchacha20_poly1305.c45 uint64_t lengths[2]; in chacha20_poly1305_encrypt() local
75 lengths[0] = htole64(aad_len); in chacha20_poly1305_encrypt()
76 lengths[1] = htole64(src_len); in chacha20_poly1305_encrypt()
77 exf->update(ctx, lengths, sizeof(lengths)); in chacha20_poly1305_encrypt()
81 explicit_bzero(lengths, sizeof(lengths)); in chacha20_poly1305_encrypt()
93 uint64_t lengths[2]; in chacha20_poly1305_decrypt() member
116 u.lengths[0] = htole64(aad_len); in chacha20_poly1305_decrypt()
117 u.lengths[1] = htole64(resid); in chacha20_poly1305_decrypt()
118 exf->update(ctx, u.lengths, sizeof(u.lengths)); in chacha20_poly1305_decrypt()
148 uint64_t lengths[2]; in xchacha20_poly1305_encrypt() local
[all …]
/freebsd/bin/sh/tests/parameters/
H A Dpositional9.06 lengths=${#*}${#@}"${#*}${#@}"$(echo ${#*}${#@}"${#*}${#@}")
8 lengths=$lengths${#*}${#@}"${#*}${#@}"$(echo ${#*}${#@}"${#*}${#@}")
9 case $lengths in
11 printf 'bad: %s\n' "$lengths"
15 printf 'too short: %s\n' "$lengths"
/freebsd/sys/contrib/zlib/
H A Dinflate.h37 TABLE, /* i: waiting for dynamic block table lengths */
38 LENLENS, /* i: waiting for code length code lengths */
39 CODELENS, /* i: waiting for length/lit and distance code lengths */
115 unsigned ncode; /* number of code length code lengths */
116 unsigned nlen; /* number of length code lengths */
117 unsigned ndist; /* number of distance code lengths */
118 unsigned have; /* number of code lengths in lens[] */
120 unsigned short lens[320]; /* temporary storage for code lengths */
H A Dinftrees.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
37 unsigned min, max; /* minimum and maximum code lengths */ in inflate_table()
71 Process a set of code lengths to create a canonical Huffman code. The in inflate_table()
72 code lengths are lens[0..codes-1]. Each length corresponds to the in inflate_table()
75 for codes with equal lengths. Then the code starts with all zero bits in inflate_table()
96 codes at all, checking for a valid set of lengths, and looking ahead in inflate_table()
101 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ in inflate_table()
107 /* bound code lengths, force root to be within code lengths */ in inflate_table()
125 /* check for an over-subscribed or incomplete set of lengths */ in inflate_table()
159 code lengths to determine what size sub-table is needed. The length in inflate_table()
H A Dtrees.c14 * a Huffman encoding of the lengths of all the code strings (in
16 * reconstructed from the lengths in the inflate process, as described
73 /* The lengths of the bit length codes are sent in order of decreasing
74 * probability, to avoid transmitting the lengths for unused bit length codes.
87 /* The static literal tree. Since the bit lengths are imposed, there is no
529 * Compute the optimal bit lengths for a tree and update the total bit length
554 /* In a first pass, compute the optimal bit lengths (which may in gen_bitlen()
593 /* Now recompute all bit lengths, scanning in increasing frequency. in gen_bitlen()
595 * lengths instead of fixing only the wrong ones. This idea is taken in gen_bitlen()
618 * Construct one Huffman tree and assigns the code bit strings and lengths.
[all …]
H A Dinfback.c256 static const unsigned short order[19] = /* permutation of code lengths */ in inflateBack()
318 strm->msg = (char *)"invalid stored block lengths"; in inflateBack()
363 /* get code length code lengths (not a typo) */ in inflateBack()
378 strm->msg = (char *)"invalid code lengths set"; in inflateBack()
382 Tracev((stderr, "inflate: code lengths ok\n")); in inflateBack()
384 /* get length and distance code code lengths */ in inflateBack()
452 strm->msg = (char *)"invalid literal/lengths set"; in inflateBack()
H A Ddeflate.h47 /* number of codes used to transfer the bit lengths */
204 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
227 uchf *l_buf; /* buffer for literals/lengths */
230 uchf *sym_buf; /* buffer for distances and literals/lengths */
234 /* Size of match buffer for literals/lengths. There are 4 reasons for
/freebsd/sys/contrib/zlib/doc/
H A Drfc1951.txt207 "deflate" format limits distances to 32K bytes and lengths to 258
211 Each type of value (literals, distances, and lengths) in the
213 tree for literals and lengths and a separate code tree for distances.
289 lengths, not a sequence of bytes. We must therefore specify
318 sequences of different lengths, but a parser can always parse
367 various alphabets must not exceed certain maximum code lengths.
369 lengths from symbol frequencies. Again, see Chapter 5,
413 just by giving the bit lengths of the codes for each symbol of
416 by the sequence of bit lengths (2, 1, 3, 3). The following
418 from most- to least-significant bit. The code lengths are
[all …]
/freebsd/crypto/krb5/src/lib/crypto/crypto_tests/
H A Dt_cts.c85 static const int lengths[] = { 17, 31, 32, 47, 48, 64 }; in test_cts() local
113 for (i = 0; i < sizeof(lengths)/sizeof(lengths[0]); i++) { in test_cts()
118 iov.data.length = in.length = lengths[i]; in test_cts()
119 memcpy(outbuf, input, lengths[i]); in test_cts()
134 if (memcmp(outbuf, input, lengths[i]) != 0) { in test_cts()
/freebsd/tests/sys/file/
H A Dftruncate_test.c49 * Select various potentially interesting lengths at and around power of 2
52 static off_t lengths[] = {0, 1, 2, 3, 4, 127, 128, 129, 511, 512, 513, 1023, variable
55 static int lengths_count = sizeof(lengths) / sizeof(off_t);
69 * using ftruncate and various lengths. Make sure that a negative in main()
94 len = lengths[i]; in main()
117 len = lengths[i]; in main()
/freebsd/sys/cam/
H A Dcam_periph.c811 uint32_t lengths[CAM_PERIPH_MAXMAPS]; in cam_periph_mapmem() local
828 lengths[0] = ccb->cdm.pattern_buf_len; in cam_periph_mapmem()
831 lengths[1] = ccb->cdm.match_buf_len; in cam_periph_mapmem()
836 lengths[0] = ccb->cdm.match_buf_len; in cam_periph_mapmem()
853 lengths[0] = ccb->csio.dxfer_len; in cam_periph_mapmem()
863 lengths[0] = ccb->ataio.dxfer_len; in cam_periph_mapmem()
872 lengths[0] = sizeof(struct mmc_data *); in cam_periph_mapmem()
875 lengths[1] = ccb->mmcio.cmd.data->len; in cam_periph_mapmem()
881 lengths[0] = ccb->smpio.smp_request_len; in cam_periph_mapmem()
884 lengths[1] = ccb->smpio.smp_response_len; in cam_periph_mapmem()
[all …]
/freebsd/sys/cam/scsi/
H A Dscsi_pass.c119 uint32_t lengths[CAM_PERIPH_MAXMAPS]; member
1294 uint32_t lengths[CAM_PERIPH_MAXMAPS]; in passmemsetup() local
1320 lengths[0] = ccb->cdm.pattern_buf_len; in passmemsetup()
1323 lengths[1] = ccb->cdm.match_buf_len; in passmemsetup()
1328 lengths[0] = ccb->cdm.match_buf_len; in passmemsetup()
1348 lengths[0] = ccb->csio.dxfer_len; in passmemsetup()
1368 lengths[0] = ccb->ataio.dxfer_len; in passmemsetup()
1377 lengths[0] = ccb->smpio.smp_request_len; in passmemsetup()
1380 lengths[1] = ccb->smpio.smp_response_len; in passmemsetup()
1392 lengths[0] = ccb->cdai.bufsiz; in passmemsetup()
[all …]
/freebsd/sys/contrib/dev/acpica/compiler/
H A Dasllength.c3 * Module Name: asllength - Tree walk to determine package and opcode lengths
190 * subtree length(s) to zero. The Subtree lengths are bubbled
216 * 1) Calculate the AML lengths (opcode, package length, etc.) for
218 * 2) Bubbble up all of these lengths to the parent node by summing
235 /* Generate the AML lengths for this node */ in LnPackageLengthWalk()
239 /* Bubble up all lengths (this node and all below it) to the parent */ in LnPackageLengthWalk()
312 * PARAMETERS: Op - Parse node whose AML opcode lengths will be
347 /* Data opcode lengths are easy */ in CgGenerateAmlOpcodeLength()
558 /* Adjust all subtree lengths up to the root */ in LnAdjustLengthToRoot()
/freebsd/contrib/unbound/dnstap/
H A Ddnstap_fstrm.h125 * buffer, because the lengths are included in the buffer. This is so that
140 * buffer, because the lengths are included in the buffer. This is so that
152 * buffer, because the lengths are included in the buffer. This is so that
166 * buffer, because the lengths are included in the buffer. This is so that
178 * buffer, because the lengths are included in the buffer. This is so that
/freebsd/bin/pax/tests/
H A Dlegacy_test.pl52 ok($? == 0, "Wrote 'ustar.ok' containing files with lengths @l");
59 ok($? == 0, "Restored 'ustar.ok' containing files with lengths @l");
72 ok($?, "Failed to write 'ustar.fail1' containing files with lengths @l");
/freebsd/sys/contrib/device-tree/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
H A Dnvidia,tegra114-spi.txt30 Tap values vary based on the platform design trace lengths from Tegra SPI
35 Tap values vary based on the platform design trace lengths from Tegra SPI
/freebsd/crypto/openssl/doc/man3/
H A DDSA_generate_parameters.pod38 For lengths under 2048 bits, the length of q is 160 bits; for lengths
113 Seed lengths greater than 20 are not supported.
/freebsd/crypto/openssl/apps/
H A Dspeed.c141 static const int *lengths = lengths_list; variable
653 || !EVP_DigestUpdate(ctx, buf, (size_t)lengths[testnum]) in EVP_Digest_loop()
661 if (!EVP_Digest(buf, (size_t)lengths[testnum], digest, NULL, md, in EVP_Digest_loop()
746 || !EVP_MAC_update(mctx, buf, lengths[testnum]) in EVP_MAC_loop()
809 if (EVP_Cipher(tempargs->ctx, buf, buf, (size_t)lengths[testnum]) <= 0) in EVP_Cipher_loop()
823 if (!EVP_MAC_update(mctx, buf, lengths[testnum])) in GHASH_loop()
876 RAND_bytes(buf, lengths[testnum]); in RAND_bytes_loop()
890 rc = EVP_DecryptUpdate(ctx, buf, &outl, buf, lengths[testnum]); in EVP_Update_loop()
898 rc = EVP_EncryptUpdate(ctx, buf, &outl, buf, lengths[testnum]); in EVP_Update_loop()
960 NULL, lengths[testnum])) { in EVP_Update_loop_aead_enc()
[all …]
/freebsd/secure/lib/libcrypto/man/man3/
H A DDSA_generate_parameters.3101 For lengths under 2048 bits, the length of q is 160 bits; for lengths
156 Seed lengths greater than 20 are not supported.
/freebsd/crypto/openssl/include/internal/
H A Dpacket.h91 * bytes read from |ptr|. Returns 0 otherwise (lengths or contents not equal).
92 * If lengths are equal, performs the comparison in constant time.
759 * Iterate through all the sub-packets and write out their lengths as if they
760 * were being closed. The lengths will be overwritten with the final lengths
776 * lengths
815 * lengths
853 * Convenience macros for WPACKET_sub_reserve_bytes with different lengths
875 * lengths
905 /* Convenience macros for calling WPACKET_sub_memcpy with different lengths */
/freebsd/contrib/llvm-project/clang/tools/clang-format/
H A DClangFormat.cpp47 Lengths("length", variable
250 if (!Offsets.empty() || !Lengths.empty()) { in fillRanges()
282 if (Offsets.size() != Lengths.size() && in fillRanges()
283 !(Offsets.size() == 1 && Lengths.empty())) { in fillRanges()
295 if (i < Lengths.size()) { in fillRanges()
296 if (Offsets[i] + Lengths[i] > Code->getBufferSize()) { in fillRanges()
297 errs() << "error: invalid length " << Lengths[i] in fillRanges()
298 << ", offset + length (" << Offsets[i] + Lengths[i] in fillRanges()
302 End = Start.getLocWithOffset(Lengths[i]); in fillRanges()
713 (!Offsets.empty() || !Lengths.empty() || !LineRanges.empty())) { in main()
/freebsd/contrib/bearssl/src/int/
H A Di15_mulacc.c39 * bit lengths of a[] and b[]; but the lengths are encoded. in br_i15_mulacc()
/freebsd/sys/contrib/device-tree/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',
/freebsd/contrib/diff/src/
H A Ddiff3.c74 size_t *lengths[2]; /* Line lengths (including newlines, if any) */ member
84 size_t *lengths[3]; /* Line lengths (including newlines, if any) */ member
102 ((diff)->lengths[filenum][linenum])
108 ((diff)->lengths[filenum])
931 sizeof *bptr->lengths[1])); in process_diff()
942 bptr->lengths[0] = bptr->lengths[1] = 0; in process_diff()
981 bptr->lengths[0] = xmalloc (numlines * sizeof *bptr->lengths[0]); in process_diff()
985 &(bptr->lengths[0][i]), in process_diff()
1006 bptr->lengths[1] = xmalloc (numlines * sizeof *bptr->lengths[1]); in process_diff()
1010 &(bptr->lengths[1][i]), in process_diff()

12345678910>>...31