| /freebsd-src/contrib/file/magic/Magdir/ |
| H A D | audio | 2 #----------
[all...] |
| H A D | database | 2 #----------
[all...] |
| H A D | zip | 1 #------------------------------------------------------------------------------
13 >>4 leshort x \b, made by
17 >>6 leshort x \b, extract using at least
20 >>12 ulelong x \b, last modified
21 >>14 lemsdosdate x \b, last modified %s
22 >>12 lemsdostime x %s
24 >>24 ulelong !0xFFffFFff \b, uncompressed size %u
26 >>10 leshort x \b, method=
41 >0 leshort 12 \bbzip2
58 >>0 leshort x \b[%#x]
[all …]
|
| H A D | rust | 2 #------------------------------------------------------------------------------
9 # URL: https://github.com/rust-lang/rust/blob/1.64.0/compiler/rustc_metadata/src/rmeta/mod.rs
11 >12 string \014rustc\x20 Rust compiler metadata
13 >>7 byte x \b, version %d
17 # URL: https://github.com/rust-lang/rust/blob/1.64.0/compiler/rustc_incremental/src/persist/file_fo…
21 >>6 pstring x \b, rustc %s
|
| /freebsd-src/contrib/bmake/unit-tests/ |
| H A D | varmod-subst-regex.mk | 1 # $NetBSD: varmod-subst-regex.mk,v 1.11 2023/12/18 11:13:51 rillig Exp $
6 .MAKEFLAGS: -dL
8 all: mod-regex-compile-error
9 all: mod-regex-limits
10 all: mod-regex-errors
11 all: unmatched-subexpression
14 # the regular expression "a b" since these words don't contain any
16 .if ${:Ua b b c:C,a b,,} != "a b b c"
22 .if ${:Ua b b c:C,a b,,1} != "a b b c"
29 .if ${:Ua b b c:C,a b,,W} != " b c"
[all …]
|
| H A D | varmod-edge.mk | 1 # $NetBSD: varmod-edge.mk,v 1.29 2024/07/09 17:07:23 rillig Exp $
9 # - INP, the input to the test
10 # - MOD, the expression for testing the modifier
11 # - EXP, the expected output
14 MOD= ${INP:M(*)}
16 .if ${MOD} != ${EXP}
17 . warning expected "${EXP}", got "${MOD}"
24 INP= (paren-brace} (
25 MOD
[all...] |
| H A D | varmod-subst.mk | 1 # $NetBSD: varmod-subst.mk,v 1.14 2023/12/18 11:13:51 rillig Exp $
5 all: mod-subst
6 all: mod-subst-delimiter
7 all: mod-subst-chain
8 all: mod-subst-dollar
130 .if ${:Uvalue:S,^val,&-&-&,} != "val-val-value"
133 .if ${:Uvalue:S,ue$,&-&-&,} != "value-ue-ue"
148 .if ${:U:S,,out-of-nothing,} != ""
151 .if ${:U:S,^,out-of-nothing,} != "out-of-nothing"
154 .if ${:U:S,$,out-of-nothing,} != "out-of-nothing"
[all …]
|
| /freebsd-src/sys/netinet6/ |
| H A D | ip6_id.c | 1 /*-
2 * SPDX-License-Identifier: (BSD-3-Clause AND BSD-2-Clause)
34 /*-
39 * such a mathematical system to generate more random (yet non-repeating)
63 * $OpenBSD: ip6_id.c,v 1.3 2003/12/12 06:57:12 itojun Exp $
68 * seed = random (bits - 1) bit
70 * j = random so that gcd(j,n-1) == 1
71 * g = g0^j mod n will be a generator again.
74 * X[n] = a*X[n-1]+b mod m is a Linear Congruential Generator
75 * with a = 7^(even random) mod m,
[all …]
|
| /freebsd-src/sys/contrib/device-tree/Bindings/input/touchscreen/ |
| H A D | stmpe.txt | 2 ----------------
5 - compatible: "st,stmpe-ts"
8 - st,ave-ctrl : Sample average control
9 0 -> 1 sample
10 1 -> 2 samples
11 2 -> 4 samples
12 3 -> 8 samples
13 - st,touch-det-delay : Touch detect interrupt delay (recommended is 3)
14 0 -> 10 us
15 1 -> 50 us
[all …]
|
| /freebsd-src/crypto/openssl/crypto/modes/asm/ |
| H A D | ghash-parisc.pl | 2 # Copyright 2010-2020 The OpenSSL Project Authors. All Rights Reserved.
19 # The module implements "4-bit" GCM GHASH function and underlying
20 # single multiplication operation in GF(2^128). "4-bit" means that it
21 # uses 256 bytes per-key table [+128 bytes shared table]. On PA-7100LC
23 # fast as code generated by gcc 3.2. PA-RISC 2.0 loop is scheduled for
24 # 8 cycles, but measured performance on PA-8600 system is ~9 cycles per
25 # processed byte. This is ~2.2x faster than 64-bit code generated by
26 # vendor compiler (which used to be very hard to beat:-).
28 # Special thanks to polarhome.com for providing HP-UX account.
90 $rem2="%r6"; # used in PA-RISC 2.0 code
[all …]
|
| /freebsd-src/crypto/openssl/crypto/objects/ |
| H A D | objects.txt | 1 # CCITT was renamed to ITU-T quite some time ago
2 0 : ITU-T : itu-t
3 !Alias ccitt itu-t
7 2 : JOINT-ISO-ITU-T : joint-iso-itu-t
8 !Alias joint-iso-ccitt joint-iso-itu-t
10 iso 2 : member-body : ISO Member Body
12 iso 3 : identified-organization
18 identified-organization 6 1 5 5 8 1 1 : HMAC-MD5 : hmac-md5
19 identified-organization 6 1 5 5 8 1 2 : HMAC-SHA1 : hmac-sha1
22 identified-organization 36 8 3 3 : x509ExtAdmission : Professional Information or basis for Admissi…
[all …]
|
| /freebsd-src/secure/lib/libcrypto/man/man3/ |
| H A D | BN_add.3 | 18 .\" Set up some character translations and predefined strings. \*(-- will
24 .tr \(*W-
27 . ds -- \(*W-
29 . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
30 . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch
37 . ds -- \|\(em\|
71 .\" Fear. Run. Save yourself. No user-serviceable parts.
81 . ds #H ((1u-(\\\\n(.fu%2u))*.13m)
97 . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
98 . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
[all …]
|
| H A D | EC_GROUP_new.3 | 18 .\" Set up some character translations and predefined strings. \*(-- will
24 .tr \(*W-
27 . ds -- \(*W-
29 . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
30 . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch
37 . ds -- \|\(em\|
71 .\" Fear. Run. Save yourself. No user-serviceable parts.
81 . ds #H ((1u-(\\\\n(.fu%2u))*.13m)
97 . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
98 . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
[all …]
|
| /freebsd-src/crypto/openssl/crypto/bn/asm/ |
| H A D | parisc-mont.pl | 2 # Copyright 2009-2020 The OpenSSL Project Authors. All Rights Reserved.
17 # On PA-7100LC this module performs ~90-50% better, less for longer
18 # keys, than code generated by gcc 3.2 for PA-RISC 1.1. Latter means
19 # that compiler utilized xmpyu instruction to perform 32x32=64-bit
24 # toward 4 times 16x16=32-bit multiplications [plus complementary
27 # for PA-RISC 1.1, but the "baseline" is far from optimal. The actual
28 # improvement coefficient was never collected on PA-7100LC, or any
30 # vendor compiler. But to give you a taste, PA-RISC 1.1 code path
32 # of ~5x on PA-8600.
34 # On PA-RISC 2.0 it has to compete with pa-risc2[W].s, which is
[all …]
|
| /freebsd-src/crypto/openssl/include/openssl/ |
| H A D | bn.h | 2 * Copyright 1995-2021 The OpenSSL Project Authors. All Rights Reserved.
34 * 64-bit processor with LP64 ABI
42 * 64-bit processor other than LP64 ABI
56 # define BN_TBIT ((BN_ULONG)1 << (BN_BITS2 - 1))
76 void BN_set_flags(BIGNUM *b, int n);
77 int BN_get_flags(const BIGNUM *b, int n);
80 #define BN_RAND_TOP_ANY -1
94 void BN_with_flags(BIGNUM *dest, const BIGNUM *b, int flags);
97 int BN_GENCB_call(BN_GENCB *cb, int a, int b);
102 /* Populate a BN_GENCB structure with an "old"-style callback */
[all …]
|
| /freebsd-src/crypto/openssl/crypto/sha/asm/ |
| H A D | sha512-parisc.pl | 2 # Copyright 2009-2020 The OpenSSL Project Authors. All Rights Reserved.
17 # SHA256/512 block procedure for PA-RISC.
22 # PA-7100LC. Compared to code generated by vendor compiler this
23 # implementation is almost 70% faster in 64-bit build, but delivers
24 # virtually same performance in 32-bit build on PA-8600.
27 # PA-7100LC, PA-RISC 1.1 processor. Then implementation detects if the
28 # code is executed on PA-RISC 2.0 processor and switches to 64-bit
29 # code path delivering adequate performance even in "blended" 32-bit
30 # build. Though 64-bit code is not any faster than code generated by
31 # vendor compiler on PA-8600...
[all …]
|
| /freebsd-src/crypto/openssl/crypto/bn/ |
| H A D | bn_gf2m.c | 2 * Copyright 2002-2021 The OpenSSL Project Authors. All Rights Reserved.
31 /* Platform-specific macros to accelerate squaring. */
41 SQR_nibble((w) >> 12) << 24 | SQR_nibble((w) >> 8) << 16 | \
49 SQR_nibble((w) >> 12) << 24 | SQR_nibble((w) >> 8) << 16 | \
55 * Product of two polynomials a, b each with degree < BN_BITS2 - 1, result is
56 * a polynomial r with degree < 2 * BN_BITS - 1 The caller MUST ensure that
61 const BN_ULONG b) in bn_GF2m_mul_1x1() argument
80 s = tab[b & 0x7]; in bn_GF2m_mul_1x1()
82 s = tab[b >> 3 & 0x7]; in bn_GF2m_mul_1x1()
85 s = tab[b >> 6 & 0x7]; in bn_GF2m_mul_1x1()
[all …]
|
| /freebsd-src/crypto/openssl/crypto/rc4/asm/ |
| H A D | rc4-md5-x86_64.pl | 2 # Copyright 2011-2020 The OpenSSL Project Authors. All Rights Reserved.
21 # since both algorithms exhibit instruction-level parallelism, ILP,
24 # instruction sequence is virtually identical to rc4-x86_64.pl, which
46 # (*) rc4-x86_64.pl delivers 5.3 on Opteron, so real improvement
64 ( $xlate="${dir}x86_64-xlate.pl" and -f $xlate ) or
65 ( $xlate="${dir}../../perlasm/x86_64-xlate.pl" and -f $xlate) or
66 die "can't locate x86_64-xlate.pl";
89 # size_t len); # number of 64-byte blocks
120 my $MOD=32; # 16, 32 or 64
167 mov -8($dat),$XX[0]#b
[all …]
|
| /freebsd-src/contrib/wpa/src/crypto/ |
| H A D | fips_prf_wolfssl.c | 2 * FIPS 186-2 PRF for libcrypto
3 * Copyright (c) 2004-2017, Jouni Malinen <j@w1.fi>
45 os_memset(xkey + seed_len, 0, sizeof(xkey) - seed_len); in fips186_2_prf()
49 /* FIPS 186-2 + change notice 1 */ in fips186_2_prf()
62 /* XVAL = (XKEY + XSEED_j) mod 2^b */ in fips186_2_prf()
70 WPA_PUT_BE32(xpos + 12, _t[3]); in fips186_2_prf()
73 /* XKEY = (1 + XKEY + w_i) mod 2^b */ in fips186_2_prf()
75 for (k = 19; k >= 0; k--) { in fips186_2_prf()
|
| H A D | md5-internal.c | 3 * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi>
24 * md5_vector - MD5 hash for data vector
29 * Returns: 0 on success, -1 of failure
37 return -1; in md5_vector()
47 /* ===== start - public domain MD5 implementation ===== */
49 * This code implements the MD5 message-digest algorithm.
62 * will fill a supplied 16-byte array with the digest.
69 * Note: this code is harmless on little-endian machines.
79 } while (--longs); in byteReverse()
89 ctx->buf[0] = 0x67452301; in MD5Init()
[all …]
|
| H A D | fips_prf_openssl.c | 2 * FIPS 186-2 PRF for libcrypto
3 * Copyright (c) 2004-2005, Jouni Malinen <j@w1.fi>
14 /* OpenSSL 3.0 has deprecated the low-level SHA1 functions and does not
16 * SHA1_Transform() function. Use the internal SHA-1 implementation instead in sha1_transform()
18 #include "sha1-internal.c" in sha1_transform()
70 os_memset(xkey + seed_len, 0, sizeof(xkey) - seed_len); in fips186_2_prf()
74 /* FIPS 186-2 + change notice 1 */ in fips186_2_prf()
87 /* XVAL = (XKEY + XSEED_j) mod 2^b */ in fips186_2_prf()
95 WPA_PUT_BE32(xpos + 12, _ in fips186_2_prf()
[all...] |
| /freebsd-src/contrib/bearssl/src/rsa/ |
| H A D | rsa_i31_privexp.c | 33 * We want to invert e modulo phi = (p-1)(q-1). This first in br_rsa_i31_compute_privexp()
37 * Since p = 3 mod 4 and q = 3 mod 4, phi/4 is an odd integer. in br_rsa_i31_compute_privexp()
39 * modulo phi, but this would involve assembling three modulus-wide in br_rsa_i31_compute_privexp()
42 * slightly more than 3 kB of stack space for RSA-4096. This in br_rsa_i31_compute_privexp()
47 * - We compute phi = k*e + r (Euclidean division of phi by e). in br_rsa_i31_compute_privexp()
50 * enforce non-ridiculously-small factors. in br_rsa_i31_compute_privexp()
52 * - We find small u, v such that u*e - v*r = 1 (using a in br_rsa_i31_compute_privexp()
56 * - Solution is: d = u + v*k in br_rsa_i31_compute_privexp()
58 * the above implies d < r + e*((phi-r)/e) = phi in br_rsa_i31_compute_privexp()
61 uint32_t tmp[4 * ((BR_MAX_RSA_FACTOR + 30) / 31) + 12]; in br_rsa_i31_compute_privexp()
[all …]
|
| H A D | rsa_i15_privexp.c | 33 * We want to invert e modulo phi = (p-1)(q-1). This first in br_rsa_i15_compute_privexp()
37 * Since p = 3 mod 4 and q = 3 mod 4, phi/4 is an odd integer. in br_rsa_i15_compute_privexp()
39 * modulo phi, but this would involve assembling three modulus-wide in br_rsa_i15_compute_privexp()
42 * slightly more than 3 kB of stack space for RSA-4096. This in br_rsa_i15_compute_privexp()
47 * - We compute phi = k*e + r (Euclidean division of phi by e). in br_rsa_i15_compute_privexp()
50 * enforce non-ridiculously-small factors. in br_rsa_i15_compute_privexp()
52 * - We find small u, v such that u*e - v*r = 1 (using a in br_rsa_i15_compute_privexp()
56 * - Solution is: d = u + v*k in br_rsa_i15_compute_privexp()
58 * the above implies d < r + e*((phi-r)/e) = phi in br_rsa_i15_compute_privexp()
61 uint16_t tmp[4 * ((BR_MAX_RSA_FACTOR + 14) / 15) + 12]; in br_rsa_i15_compute_privexp()
[all …]
|
| /freebsd-src/crypto/openssl/crypto/ec/asm/ |
| H A D | ecp_nistz256-x86.pl | 2 # Copyright 2015-2020 The OpenSSL Project Authors. All Rights Reserved.
23 # original .c module was made 32-bit savvy in order to make this
26 # with/without -DECP_NISTZ256_ASM
27 # Pentium +66-163%
28 # PIII +72-172%
29 # P4 +65-132%
30 # Core2 +90-215%
31 # Sandy Bridge +105-265% (contemporary i[57]-* are all close to this)
32 # Atom +65-155%
33 # Opteron +54-110%
[all …]
|
| /freebsd-src/crypto/openssl/crypto/ec/ |
| H A D | ecp_nistz256.c | 2 * Copyright 2014-2022 The OpenSSL Project Authors. All Rights Reserved.
48 #define ALIGNPTR(p,N) ((unsigned char *)p+N-(size_t)p%N)
71 * Constant time access to the X and Y coordinates of the pre-computed,
72 * generator multiplies, in the Montgomery domain. Pre-calculated
93 * functions]; b) addition is allowed to produce partially reduced
95 * step. Choice between the two can be platform-specific, but it was a)
98 /* Modular add: res = a+b mod P */
101 const BN_ULONG b[P256_LIMBS]);
102 /* Modular mul by 2: res = 2*a mod P */
105 /* Modular mul by 3: res = 3*a mod P */
[all …]
|