| /freebsd/crypto/openssl/crypto/sha/asm/ |
| H A D | keccak1600-c64x.pl | 5 # this file except in compliance with the License. You can obtain a copy
21 # with bit interleaving. 64-bit values are simply split between A- and
22 # B-files, with A-file holding least significant halves. This works
25 # [incredible for a 32-bit processor] 10.9 cycles per processed byte
30 my @A = map([ $_, ($_+1), ($_+2), ($_+3), ($_+4) ], (5,10,16,21,26));
31 $A[1][4] = 31; # B14 is reserved, A14 is used as iota[]
32 ($A[3][0],$A[4][1]) = ($A[4][1],$A[3][0]);
33 my @C = (0..4,$A[3][0],$A[4][0]);
40 [ 18, 2, 61, 56, 14 ]);
47 $p ROTL B$src,$rot/2+1,A$dst
[all …]
|
| H A D | keccak1600-armv8.pl | 5 # this file except in compliance with the License. You can obtain a copy
31 # Add hardware-assisted ARMv8.2 implementation. It's KECCAK_1X_ALT
60 # compiler this code is at least 2x faster...
62 # $output is the last argument if it looks like a file (it has an extension)
63 # $flavour is the first argument if it doesn't look like a file
80 [ 18, 2, 61, 56, 14 ]);
119 my @A = map([ "x$_", "x".($_+1), "x".($_+2), "x".($_+3), "x".($_+4) ],
121 $A[3][3] = "x25"; # x18 is reserved
132 adrp $C[2],iotas
133 add $C[2],$C[2],:lo12:iotas
[all …]
|
| H A D | keccak1600-ppc64.pl | 5 # this file except in compliance with the License. You can obtain a copy
21 # *any* PPC64. Then PowerISA 2.07 adds 2x64-bit vector rotate, and
40 # $output is the last argument if it looks like a file (it has an extension)
41 # $flavour is the first argument if it doesn't look like a file
47 $LRSAVE =2*$SIZE_T;
78 my @A = map([ "r$_", "r".($_+1), "r".($_+2), "r".($_+3), "r".($_+4) ],
80 $A[1][1] = "r6"; # r13 is reserved
88 [ 18, 2, 61, 56, 14 ]);
101 xor $C[0],$A[0][0],$A[1][0] ; Theta
102 std $A[0][4],`$TEMP+0`($sp)
[all …]
|
| H A D | keccak1600-s390x.pl | 5 # this file except in compliance with the License. You can obtain a copy
23 # pointers to T[][] and A[][] at the end of round. Since number of
24 # rounds is even, last round writes to A[][] and everything works out.
33 # $output is the last argument if it looks like a file (it has an extension)
34 # $flavour is the first argument if it doesn't look like a file
48 my @A = map([ 8*$_, 8*($_+1), 8*($_+2), 8*($_+3), 8*($_+4) ], (0,5,10,15,20));
53 my ($src,$dst,$iotas) = map("%r$_",(2..4));
63 [ 18, 2, 61, 56, 14 ]);
75 lg @C[0],$A[4][0]($src)
76 lg @C[1],$A[4][1]($src)
[all …]
|
| H A D | keccak1600-armv4.pl | 5 # this file except in compliance with the License. You can obtain a copy
24 # be assembled even as Thumb-2. NEON code path is KECCAK_1X_ALT with
30 # Switch to KECCAK_2X variant for non-NEON code and merge almost 1/2
39 # e.g. 'eor a,b>>>x,c>>>y'. This conundrum is resolved by using
40 # 'eor a,b,c>>>(x-y)' and then merge-rotating 'a' in next operation
41 # that takes 'a' as input. And thing is that this next operation can
44 # is the keyword, i.e. "almost 1/2" is kind of complexity cap [for the
47 # Reduce per-round instruction count in Thumb-2 case by 16%. This is
50 # cores, such as Cortex-A5/A7, by 19%. Reality is a bit different, as
57 # r=1088(*) Thumb-2(**) NEON
[all …]
|
| H A D | keccak1600-x86_64.pl | 5 # this file except in compliance with the License. You can obtain a copy
23 # pointers to T[][] and A[][] at the end of round. Since number of
24 # rounds is even, last round writes to A[][] and everything works out.
34 # Core 2 12.9
47 # varies a lot, most common coefficient is 15% in comparison to
53 # $output is the last argument if it looks like a file (it has an extension)
54 # $flavour is the first argument if it doesn't look like a file
69 my @A = map([ 8*$_-100, 8*($_+1)-100, 8*($_+2)-100,
81 [ 18, 2, 61, 56, 14 ]);
90 mov $A[4][0](%rdi),@C[0]
[all …]
|
| /freebsd/crypto/openssl/crypto/sha/ |
| H A D | keccak1600.c | 5 * this file except in compliance with the License. You can obtain a copy
16 size_t SHA3_absorb(uint64_t A[5][5], const unsigned char *inp, size_t len,
18 void SHA3_squeeze(uint64_t A[5][5], unsigned char *out, size_t len, size_t r, int next);
54 #define ROL32(a, offset) (((a) << (offset)) | ((a) >> ((32 - (offset)) & 31))) argument
86 { 18, 2, 61, 56, 14 }
122 * references to A[x,y] in the specification are presented as A[y][x].
126 static void Theta(uint64_t A[5][5]) in Theta()
131 C[0] = A[0][0]; in Theta()
132 C[1] = A[0][1]; in Theta()
133 C[2] = A[0][2]; in Theta()
[all …]
|
| /freebsd/crypto/openssl/test/recipes/10-test_bn_data/ |
| H A D | bnshift.txt | 4 # this file except in compliance with the License. You can obtain a copy
8 # These test vectors satisfy A * 2 = LShift1
13 A = 0
16 A = 988b0905e52efb2709f98a12a
19 A = -988b0905e52efb2709f98a12a
22 A = 13116120bca5df64e13f314254
25 A = -13116120bca5df64e13f314254
28 A = 2622c241794bbec9c27e6284a8
31 A = -2622c241794bbec9c27e6284a8
34 A = 4c458482f2977d9384fcc50951
[all …]
|
| H A D | bngcd.txt | 4 # this file except in compliance with the License. You can obtain a copy
10 # These test vectors satisfy gcd(A, B) = GCD.
13 A = 0
18 A = 1
23 A = 1
27 # gcd(0,a) = a
28 A = 0
32 # gcd(-a,0) = |a|
33 A = -231f16458c487346cf50a17beec83632f25d19abeea1097c746533cd3e35207b7efd75dc3e9c663a64b6861e88579d…
38 # gcd(2**i - 1, 2**(i/2) - 1) = 2**(i/2) - 1
[all …]
|
| /freebsd/crypto/openssh/regress/unittests/utf8/ |
| H A D | tests.c | 43 if (wantlen == -2) in one()
48 wp = wantwidth == -2 ? NULL : &width; in one()
67 one(1, "empty", "", 2, 0, 0, ""); in tests()
68 one(1, "ascii", "x", -2, -2, -2, "x"); in tests()
69 one(1, "newline", "a\nb", -2, -2, -2, "a\nb"); in tests()
70 one(1, "cr", "a\rb", -2, -2, -2, "a\rb"); in tests()
71 one(1, "tab", "a\tb", -2, -2, -2, "a\tb"); in tests()
72 one(1, "esc", "\033x", -2, -2, -2, "\\033x"); in tests()
73 one(1, "inv_badbyte", "\377x", -2, -2, -2, "\\377x"); in tests()
74 one(1, "inv_nocont", "\341x", -2, -2, -2, "\\341x"); in tests()
[all …]
|
| /freebsd/contrib/netbsd-tests/lib/libc/regex/data/att/ |
| H A D | categorization.dat | 3 ?E aa* xaxaax (1,2) POSITION=leftmost
6 ?E (a*)(ab)*(b*) abc (0,2)(0,1)(?,?)(1,2) ASSOCIATIVITY=right
7 |E (a*)(ab)*(b*) abc (0,2)(0,0)(0,2)(2,2) ASSOCIATIVITY=left
10 ?E ((a*)(ab)*)((b*)(a*)) aba (0,3)(0,2)(0,0)(0,2)(2,3)(2,2)(2,3) SUBEXPRESSION=precedence
11 |E ((a*)(ab)*)((b*)(a*)) aba (0,3)(0,1)(0,1)(?,?)(1,3)(1,2)(2,3) SUBEXPRESSION=grouping
15 |E (...?.?)* xxxxxx (0,6)(2,6) REPEAT_LONGEST=last
19 ?E (a|ab)(bc|c) abcabc (0,3)(0,2)(2,3) EXPECTED
20 |E (a|ab)(bc|c) abcabc (0,3)(0,1)(1,3) BUG=alternation-order
23 ?E (aba|a*b)(aba|a*b) ababa (0,5)(0,2)(2,5) EXPECTED
24 |E (aba|a*b)(aba|a*b) ababa (0,4)(0,3)(3,4) BUG=first-match
[all …]
|
| H A D | nullsubexpr.dat | 3 E (a*)* a (0,1)(0,1)
7 E (a*)+ a (0,1)(0,1)
11 E (a+)* a (0,1)(0,1)
15 E (a+)+ a (0,1)(0,1)
20 E ([a]*)* a (0,1)(0,1)
24 E ([a]*)+ a (0,1)(0,1)
28 E ([^b]*)* a (0,1)(0,1)
32 E ([ab]*)* a (0,1)(0,1)
39 E ([^a]*)* b (0,1)(0,1)
45 E ((z)+|a)* zabcde (0,2)(1,2)
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/sapphirerapids/ |
| H A D | virtual-memory.json | 4 "CollectPEBSRecord": "2",
5 "Counter": "0,1,2,3",
8 "PEBScounters": "0,1,2,3",
14 … "BriefDescription": "Cycles when at least one PMH is busy with a page walk for a demand load.",
15 "CollectPEBSRecord": "2",
16 "Counter": "0,1,2,3",
20 "PEBScounters": "0,1,2,3",
21 …ounts cycles when at least one PMH (Page Miss Handler) is busy with a page walk for a demand load.…
26 …"BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (All page size…
27 "CollectPEBSRecord": "2",
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/icelakex/ |
| H A D | virtual-memory.json | 4 "CollectPEBSRecord": "2",
5 "Counter": "0,1,2,3",
8 "PEBScounters": "0,1,2,3",
15 … "BriefDescription": "Cycles when at least one PMH is busy with a page walk for a demand load.",
16 "CollectPEBSRecord": "2",
17 "Counter": "0,1,2,3",
21 "PEBScounters": "0,1,2,3",
22 …ounts cycles when at least one PMH (Page Miss Handler) is busy with a page walk for a demand load.…
28 …"BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (All page size…
29 "CollectPEBSRecord": "2",
[all …]
|
| /freebsd/lib/libsys/ |
| H A D | socket.2 | 9 .\" 2. Redistributions in binary form must reproduce the above copyright
18 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 creates an endpoint for communication and returns a descriptor.
48 argument specifies a communications domain within which
105 specifies a particular protocol to be used with the socket.
106 Normally only a single protocol exists to support a particular
107 socket type within a given protocol family.
109 that many protocols may exist, in which case a particular protocol
120 implementation of a socket type for the protocol, if any.
125 the socket and a peer to which the socket is connected.
[all …]
|
| /freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/ |
| H A D | cert-onecolumn.pem | 10 A
28 A
42 A
46 A
50 A
63 A
95 2
114 a
119 2
126 a
[all …]
|
| /freebsd/contrib/one-true-awk/testdir/ |
| H A D | T.expr | 5 awk=${awk-../a.out}
10 awk = "../a.out"
24 if (NF == 0) # blank line terminates a sequence
27 for (i = 2; i < NF; i++) # input data
51 # $1 $2 $3 output1 (\t for tab, \n for newline,
52 # $1 $2 $3 output2 ("" for null)
65 10E-2 no
69 2 2
74 -2e64 ""
80 x y 2
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/icelake/ |
| H A D | virtual-memory.json | 4 "CollectPEBSRecord": "2",
5 "Counter": "0,1,2,3",
8 "PEBScounters": "0,1,2,3",
15 … "BriefDescription": "Cycles when at least one PMH is busy with a page walk for a demand load.",
16 "CollectPEBSRecord": "2",
17 "Counter": "0,1,2,3",
21 "PEBScounters": "0,1,2,3",
22 …ounts cycles when at least one PMH (Page Miss Handler) is busy with a page walk for a demand load.…
28 …"BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (All page size…
29 "CollectPEBSRecord": "2",
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/tigerlake/ |
| H A D | virtual-memory.json | 4 "CollectPEBSRecord": "2",
5 "Counter": "0,1,2,3",
8 "PEBScounters": "0,1,2,3",
14 … "BriefDescription": "Cycles when at least one PMH is busy with a page walk for a demand load.",
15 "CollectPEBSRecord": "2",
16 "Counter": "0,1,2,3",
20 "PEBScounters": "0,1,2,3",
21 …ounts cycles when at least one PMH (Page Miss Handler) is busy with a page walk for a demand load.…
26 …"BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (All page size…
27 "CollectPEBSRecord": "2",
[all …]
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/channel_program/lua_core/ |
| H A D | tst.lib_table.lua | 7 --* a copy of this software and associated documentation files (the
19 --* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
46 local D20, D40 = 1048576, 1099511627776 -- 2^20, 2^40
62 local x,y,z,a,n
63 a = {}; lim = 2000
64 for i=1, lim do a[i]=i end
65 assert(select(lim, unpack(a)) == lim and select('#', unpack(a)) == lim)
66 x = unpack(a)
68 x = {unpack(a)}
70 x = {unpack(a, lim-2)}
[all …]
|
| /freebsd/crypto/openssl/crypto/bn/ |
| H A D | bn_sqrt.c | 5 * this file except in compliance with the License. You can obtain a copy
13 BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) in BN_mod_sqrt() argument
15 * Returns 'ret' such that ret^2 == a (mod p), using the Tonelli/Shanks in BN_mod_sqrt()
16 * algorithm (cf. Henri Cohen, "A Course in Algebraic Computational Number in BN_mod_sqrt()
24 BIGNUM *A, *b, *q, *t, *x, *y; in BN_mod_sqrt() local
29 if (BN_abs_is_word(p, 2)) { in BN_mod_sqrt()
34 if (!BN_set_word(ret, BN_is_bit_set(a, 0))) { in BN_mod_sqrt()
47 if (BN_is_zero(a) || BN_is_one(a)) { in BN_mod_sqrt()
52 if (!BN_set_word(ret, BN_is_one(a))) { in BN_mod_sqrt()
63 A = BN_CTX_get(ctx); in BN_mod_sqrt()
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/cascadelakex/ |
| H A D | virtual-memory.json | 4 "Counter": "0,1,2,3",
5 "CounterHTOff": "0,1,2,3,4,5,6,7",
8 …"PublicDescription": "Counts demand data loads that caused a page walk of any page size (4K/2M/4M/…
14 "Counter": "0,1,2,3",
15 "CounterHTOff": "0,1,2,3,4,5,6,7",
23 …"BriefDescription": "Cycles when at least one PMH is busy with a page walk for a load. EPT page wa…
24 "Counter": "0,1,2,3",
25 "CounterHTOff": "0,1,2,3,4,5,6,7",
29 …n": "Counts cycles when at least one PMH (Page Miss Handler) is busy with a page walk for a load.",
34 …"BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (All page size…
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/skylake/ |
| H A D | virtual-memory.json | 4 "Counter": "0,1,2,3",
5 "CounterHTOff": "0,1,2,3,4,5,6,7",
8 …"PublicDescription": "Counts demand data loads that caused a page walk of any page size (4K/2M/4M/…
14 "Counter": "0,1,2,3",
15 "CounterHTOff": "0,1,2,3,4,5,6,7",
23 …"BriefDescription": "Cycles when at least one PMH is busy with a page walk for a load. EPT page wa…
24 "Counter": "0,1,2,3",
25 "CounterHTOff": "0,1,2,3,4,5,6,7",
29 …n": "Counts cycles when at least one PMH (Page Miss Handler) is busy with a page walk for a load.",
34 …"BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (All page size…
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/skylakex/ |
| H A D | virtual-memory.json | 4 "Counter": "0,1,2,3",
5 "CounterHTOff": "0,1,2,3,4,5,6,7",
8 …"PublicDescription": "Counts demand data loads that caused a page walk of any page size (4K/2M/4M/…
14 "Counter": "0,1,2,3",
15 "CounterHTOff": "0,1,2,3,4,5,6,7",
23 …"BriefDescription": "Cycles when at least one PMH is busy with a page walk for a load. EPT page wa…
24 "Counter": "0,1,2,3",
25 "CounterHTOff": "0,1,2,3,4,5,6,7",
29 …n": "Counts cycles when at least one PMH (Page Miss Handler) is busy with a page walk for a load.",
34 …"BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (All page size…
[all …]
|
| /freebsd/lib/libc/compat-43/ |
| H A D | sigvec.2 | 9 .\" 2. Redistributions in binary form must reproduce the above copyright
18 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 .Dd April 2, 2022
50 .Xr sigaction 2 .
53 The system defines a set of signals that may be delivered to a process.
54 Signal delivery resembles the occurrence of a hardware interrupt:
56 context is saved, and a new one is built.
57 A process may specify a
59 to which a signal is delivered, or specify that a signal is to be
63 A process may also specify that a default action is to be taken
[all …]
|