| /freebsd/crypto/openssl/test/recipes/10-test_bn_data/ |
| 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…
40 A = f
[all …]
|
| /freebsd/contrib/ncurses/man/ |
| H A D | ncurses.3x | 6 .\" Permission is hereby granted, free of charge, to any person obtaining a *
19 .\" MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
31 .\" $Id: ncurses.3x,v 1.214 2024/04/27 17:55:43 tom Exp $
32 .TH ncurses 3X 2024-04-27 "ncurses @NCURSES_MAJOR@.@NCURSES_MINOR@" "Library calls"
66 The \*(``new curses\*('' library offers the programmer a
98 a
102 (such as \fI\%termios\fP(3)).
123 availability of a preprocessor macro exclusive of a function definition
141 that should be considered when writing to a
153 in a few cases,
[all …]
|
| /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]);
38 [ 3, 10, 43, 25, 39 ],
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
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
78 [ 3, 10, 43, 25, 39 ],
119 my @A = map([ "x$_", "x".($_+1), "x".($_+2), "x".($_+3), "x".($_+4) ],
121 $A[3][3] = "x25"; # x18 is reserved
136 eor $C[0],$A[0][0],$A[1][0]
137 stp $A[0][4],$A[1][4],[sp,#0] // offload pair...
138 eor $C[1],$A[0][1],$A[1][1]
139 eor $C[2],$A[0][2],$A[1][2]
[all …]
|
| H A D | keccak1600-ppc64.pl | 5 # this file except in compliance with the License. You can obtain a copy
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
68 my @A = map([ "r$_", "r".($_+1), "r".($_+2), "r".($_+3), "r".($_+4) ],
70 $A[1][1] = "r6"; # r13 is reserved
72 my @C = map("r$_", (0,3,4,5));
76 [ 3, 10, 43, 25, 39 ],
91 xor $C[0],$A[0][0],$A[1][0] ; Theta
92 std $A[0][4],`$TEMP+0`($sp)
93 xor $C[1],$A[0][1],$A[1][1]
[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
38 if ($flavour =~ /3[12]/) {
48 my @A = map([ 8*$_, 8*($_+1), 8*($_+2), 8*($_+3), 8*($_+4) ], (0,5,10,15,20));
61 [ 3, 10, 43, 25, 39 ],
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
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
50 # cores, such as Cortex-A5/A7, by 19%. Reality is a bit different, as
70 # Cortex-Mx, x>=3. Otherwise, non-NEON results for NEON-capable
73 # $output is the last argument if it looks like a file (it has an extension)
74 # $flavour is the first argument if it doesn't look like a file
96 # | uint64_t A[5][5] |
111 my @A = map([ 8*$_, 8*($_+1), 8*($_+2), 8*($_+3), 8*($_+4) ], (0,5,10,15,20));
[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.
47 # varies a lot, most common coefficient is 15% in comparison to
48 # gcc-5.x, 50% for gcc-4.x, 90% for gcc-3.x.
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,
70 8*($_+3)-100, 8*($_+4)-100 ], (0,5,10,15,20));
79 [ 3, 10, 43, 25, 39 ],
[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
14 size_t SHA3_absorb(uint64_t A[5][5], const unsigned char *inp, size_t len,
16 void SHA3_squeeze(uint64_t A[5][5], unsigned char *out, size_t len, size_t r);
52 #define ROL32(a, offset) (((a) << (offset)) | ((a) >> ((32 - (offset)) & 31))) argument
82 { 3, 10, 43, 25, 39 },
117 * to resemble section 3.2 of the FIPS PUB 202 "SHA-3 Standard:
120 * references to A[x,y] in the specification are presented as A[y][x].
124 static void Theta(uint64_t A[5][5]) in Theta()
129 C[0] = A[0][0]; in Theta()
130 C[1] = A[0][1]; in Theta()
[all …]
|
| /freebsd/contrib/ofed/librdmacm/man/ |
| H A D | rdma_cm.7 | 10 The RDMA CM is a communication manager used to setup reliable, connected
14 communication must be over a specific RDMA device, and data transfers
27 If a channel is not provided, then all rdma_cm operations for the selected
37 rdma_reg_read - registers a buffer for RDMA read operations
39 rdma_reg_write - registers a buffer for RDMA write operations
41 rdma_dereg_mr - deregisters a memory region
43 rdma_post_recv - post a buffer to receive a message
45 rdma_post_send - post a buffer to send a message
47 rdma_post_read - post an RDMA to read data into a buffer
49 rdma_post_write - post an RDMA to send data from a buffer
[all …]
|
| /freebsd/share/man/man3/ |
| H A D | pthread.3 | 12 .\" 3. All advertising materials mentioning features or use of this software
21 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
42 POSIX threads are a set of functions that support applications with
45 within a process.
46 Multithreading is used to improve the performance of a
71 .Xr pthread_np 3 .
81 Creates a new thread of execution.
86 Cancels execution of a thread.
91 Marks a thread for deletion.
111 Delivers a signal to a specified thread.
[all …]
|
| H A D | qmath.3 | 16 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
60 is used to refer to any numeric type and is therefore a superset of
89 .Ss Functions which create/initialise a Q number
91 .Xr Q_INI 3 initialise a Q number
95 .Xr Q_QADDQ 3 addition
96 .Xr Q_QDIVQ 3 division
97 .Xr Q_QMULQ 3 multiplication
98 .Xr Q_QSUBQ 3 subtraction
99 .Xr Q_NORMPREC 3 normalisation
100 .Xr Q_QMAXQ 3 maximum function
[all …]
|
| /freebsd/contrib/netbsd-tests/lib/libc/regex/data/att/ |
| H A D | forcedassoc.dat | 3 E (a|ab)(c|bcd) abcd (0,4)(0,1)(1,4)
4 E (a|ab)(bcd|c) abcd (0,4)(0,1)(1,4)
5 E (ab|a)(c|bcd) abcd (0,4)(0,1)(1,4)
6 E (ab|a)(bcd|c) abcd (0,4)(0,1)(1,4)
7 E ((a|ab)(c|bcd))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
8 E ((a|ab)(bcd|c))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
9 E ((ab|a)(c|bcd))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
10 E ((ab|a)(bcd|c))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
11 E (a|ab)((c|bcd)(d*)) abcd (0,4)(0,2)(2,4)(2,3)(3,4)
12 E (a|ab)((bcd|c)(d*)) abcd (0,4)(0,2)(2,4)(2,3)(3,4)
[all …]
|
| H A D | basic.dat | 4 BE a...b abababbb (2,7)
7 BE a] a]a (0,2)
15 BE ^a ax (0,1)
16 BE \^a a^a (1,3)
17 BE a\^ a^ (0,2)
18 BE a$ aa (1,2)
19 BE a\$ a$ (0,2)
22 E a($) aa (1,2)(2,2)
23 E a*(^a) aa (0,1)(0,1)
24 E (..)*(...)* a (0,0)
[all …]
|
| /freebsd/sys/dev/ath/ath_rate/sample/ |
| H A D | tx_schedules.h | 2 * SPDX-License-Identifier: BSD-3-Clause
13 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
15 * redistribution must be conditioned upon including a substantially
17 * 3. Neither the names of the above-listed copyright holders nor the names
29 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
43 #define A(_r) \ macro
45 (((_r) == 18) ? 3 : (((_r) == 24) ? 4 : (((_r) == 36) ? 5 : \
48 { 3,A( 6), 3,A( 6), 0,A( 6), 0,A( 6) }, /* 6Mb/s */
49 { 4,A( 9), 3,A( 6), 4,A( 6), 0,A( 6) }, /* 9Mb/s */
50 { 4,A(12), 3,A( 6), 4,A( 6), 0,A( 6) }, /* 12Mb/s */
[all …]
|
| /freebsd/lib/libc/posix1e/ |
| H A D | acl.3 | 18 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
42 provides a library for userland access to and manipulation of these ACLs.
49 As well as the POSIX.1e routines, there are a number of non-portable
55 POSIX.1e describes a set of ACL manipulation routines to manage the
64 .Xr acl_add_flag_np 3 ,
65 and may be used to add flags to a flagset.
68 .Xr acl_add_perm 3 ,
69 and may be used to add permissions to a permission set.
72 .Xr acl_calc_mask 3 ,
79 .Xr acl_clear_flags_np 3 ,
[all …]
|
| /freebsd/secure/lib/libcrypto/man/man7/ |
| H A D | migration_guide.7 | 19 .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
20 .\" double quote, and \*(R" will give a right double quote. \*(C+ will
21 .\" give a nicer C++. Capital omega is used to do unbreakable dashes and
76 . ds #F .3m
122 . ds o a
158 OpenSSL 3.0 is a major release and consequently any application that currently
180 With OpenSSL 3.0 it is possible to specify, either programmatically or via a
194 There is however a dedicated \f(CW\*(C`install_fips\*(C'\fR make target, which serves the
198 Not all algorithms may be available for the application at a particular moment.
200 the application should verify the result of the \fBEVP_EncryptInit\fR\|(3),
[all …]
|
| /freebsd/contrib/bc/tests/bc/ |
| H A D | errors.txt | 5 3 $ 7
13 a(3,3
16 3 +
17 3 - -
23 a * += 38297 2839
24 a += * 38297
25 a += * 38297 2839
26 a %= % 38297
27 a %= / 38297 2839
28 "s" + 3
[all …]
|
| /freebsd/lib/libc/rpc/ |
| H A D | rpc.3 | 2 .\" $NetBSD: rpc.3,v 1.10 2000/06/02 23:11:12 fvdl Exp $
17 calls on other machines across a network.
18 First, the client sends a request to the server.
19 On receipt of the request, the server calls a dispatch routine
20 to perform the requested service, and then sends back a reply.
25 Routines that take a
32 RPC interface routines take a
40 This string defines a class of transports which can be used
41 for a particular application.
169 void (*cl_abort)(); /* abort a call */
[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/contrib/arm-optimized-routines/math/ |
| H A D | pow_log_data.c | 23 0x1.999999959554ep-3 * 4,
24 -0x1.555555529a47ap-3 * 4,
25 0x1.2495b9b4845e9p-3 * -8,
26 -0x1.0002b8b263fc3p-3 * -8,
42 where c is chosen near the center of the subinterval such that 1/c has only a
53 #define A(a, b, c) {a, 0, b, c}, macro
54 A(0x1.6a00000000000p+0, -0x1.62c82f2b9c800p-2, 0x1.ab42428375680p-48)
55 A(0x1.6800000000000p+0, -0x1.5d1bdbf580800p-2, -0x1.ca508d8e0f720p-46)
56 A(0x1.6600000000000p+0, -0x1.5767717455800p-2, -0x1.362a4d5b6506dp-45)
57 A(0x1.6400000000000p+0, -0x1.51aad872df800p-2, -0x1.684e49eb067d5p-49)
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/icelake/ |
| H A D | cache.json | 5 "Counter": "0,1,2,3",
8 "PEBScounters": "0,1,2,3",
15 …"BriefDescription": "Number of cycles a demand request has waited due to L1D Fill Buffer (FB) unav…
17 "Counter": "0,1,2,3",
20 "PEBScounters": "0,1,2,3",
21 …"PublicDescription": "Counts number of cycles a demand request has waited due to L1D Fill Buffer (…
27 …"BriefDescription": "Number of phases a demand request has waited due to L1D Fill Buffer (FB) unav…
29 "Counter": "0,1,2,3",
34 "PEBScounters": "0,1,2,3",
35 …"PublicDescription": "Counts number of phases a demand request has waited due to L1D Fill Buffer (…
[all …]
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/icelakex/ |
| H A D | virtual-memory.json | 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.",
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…
30 "Counter": "0,1,2,3",
33 "PEBScounters": "0,1,2,3",
34 …s it missed in the DTLB and further levels of TLB. The page walk can end with or without a fault.",
[all …]
|