Home
last modified time | relevance | path

Searched full:a (Results 1 – 25 of 11421) sorted by relevance

12345678910>>...457

/freebsd/usr.bin/m4/tests/
H A Dregress.esyscmd.out4 hi there a
5 hi there a
7 hi there a
8 hi there a
10 hi there a
11 hi there a
13 hi there a
14 hi there a
16 hi there a
17 hi there a
[all …]
/freebsd/crypto/openssl/test/recipes/10-test_bn_data/
H A Dbnshift.txt4 # 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 Dbngcd.txt4 # 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 …]
H A Dbnsum.txt4 # this file except in compliance with the License. You can obtain a copy
10 # These test vectors satisfy A + B = Sum.
13 A = 0
17 A = c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce12…
21 A = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce1…
25 A = c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce12…
29 A = c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c7875…
33 A = c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c7875…
37 A = -c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c787…
41 A = -c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c787…
[all …]
H A Dbnmul.txt4 # this file except in compliance with the License. You can obtain a copy
8 # These test vectors satisfy A^2 = Square.
12 # Regression test for a BN_sqr overflow bug.
14 A = 80000000000000008000000000000001fffffffffffffffe0000000000000000
16 # Regression test for a BN_sqr overflow bug.
18 A = 80000000000000000000000080000001fffffffe000000000000000000000000
21 A = -df6a253c3f
24 A = 21f253ddb5a6d
27 A = -95fbaee5a09c86d
30 A = -3e71292dd4ad3ed3b4
[all …]
H A Dbnmod.txt4 # this file except in compliance with the License. You can obtain a copy
8 # These test vectors satisfy A * B = ModMul (mod M) and 0 <= ModMul < M.
14 A = 6b18497fed9befdf22a01d988d34213f6687d8a96e86c188dea4172e7c6095a0d18d3c86c0f5a1af9c6e3aaeb6baac2…
19 A = 16c92f77c139706430f396f72ec7adb045745cd9f5899b0074d9955bd32de66f57c05c7929b575312a7f1c04f19e724…
24 A = -6715098ab2ba3ea1e6341e89936e3ae913cdd450dc831c8534071f3c362841e47d88f2cd29c0d1239aa0949f3685f1…
29 A = -11fec955948e007b59fc50e729941ee9d43d552b9411510b73f6b4faafc0465f261f8381d96f647267f72175883172…
34 A = 7713413d87f1e50840255927ff27bad79e5de5898725a876e4647913158cda9f5fa031dd7fc11d2e8130a0ba99e8706…
39 A = 17d806d7c76aa8acb051fd9c0c782443f1b1b6387455f7cfb737c41658d0459bda5d13587055eafb87ad8d209bccac1…
44 A = -6d84cdf18a2f53fe496248fafef183914d55c42267af3dd42a39515e80cf29211fd58454986f5fb6afb56170dd9865…
49 A = -1f745c8f0c8fe6ce3f893d77fb274c61b72b2d9f9c5a2eb2467bc00d1f496d0ad469d76bce318bd64ff1107ee5fcad…
[all …]
/freebsd/contrib/bearssl/src/kdf/
H A Dshake.c5 * a copy of this software and associated documentation files (the
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
46 * XOR a block of data into the provided state. This supports only
47 * blocks whose length is a multiple of 64 bits.
50 xor_block(uint64_t *A, const void *data, size_t rate) in xor_block() argument
55 A[u >> 3] ^= br_dec64le((const unsigned char *)data + u); in xor_block()
60 * Process a block with the provided data. The data length must be a
64 process_block(uint64_t *A) in process_block() argument
78 tt0 = A[ 1] ^ A[ 6]; in process_block()
79 tt1 = A[11] ^ A[16]; in process_block()
[all …]
/freebsd/contrib/lua/doc/
H A Dcontents.html13 <A HREF="http://www.lua.org/"><IMG SRC="logo.gif" ALT="Lua"></A>
20 For a complete introduction to Lua programming, see the book
21 <A HREF="http://www.lua.org/pil/">Programming in Lua</A>.
24 <A HREF="manual.html">start</A>
26 <A HREF="#contents">contents</A>
28 <A HREF="#index">index</A>
30 <A HREF="http://www.lua.org/manual/">other versions</A>
37 <A HREF="http://www.lua.org/license.html">Lua license</A>.
40 <H2><A NAME="contents">Contents</A></H2>
42 <LI><A HREF="manual.html">1 &ndash; Introduction</A>
[all …]
/freebsd/contrib/bc/tests/bc/scripts/
H A Datan.txt2 a(.267)
3 a(1)
5 a(.267)
6 a(1)
8 a(.267)
9 a(1)
11 a(.267)
12 a(1)
14 a(.267)
15 a(1)
[all …]
/freebsd/crypto/openssl/crypto/sha/asm/
H A Dkeccak1600-c64x.pl5 # 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]);
47 $p ROTL B$src,$rot/2+1,A$dst
48 || ROTL A$src,$rot/2, B$dst
[all …]
/freebsd/contrib/libarchive/libarchive/test/
H A Dtest_read_format_zip.c17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
31 int extract_one(struct archive* a, struct archive_entry* ae, uint32_t crc) in extract_one() argument
43 bytes_read = archive_read_data(a, buf, fsize); in extract_one()
59 int extract_one_using_blocks(struct archive* a, int block_size, uint32_t crc) in extract_one_using_blocks() argument
71 bytes_read = archive_read_data(a, buf, block_size); in extract_one_using_blocks()
103 verify_basic(struct archive *a, int seek_checks) in verify_basic() argument
111 assertEqualIntA(a, ARCHIVE_OK, archive_read_next_header(a, &ae)); in verify_basic()
112 assertEqualString("ZIP 1.0 (uncompressed)", archive_format_name(a)); in verify_basic()
119 assertEqualIntA(a, archive_read_has_encrypted_entries(a), 0); in verify_basic()
120 assertEqualIntA(a, ARCHIVE_EOF, in verify_basic()
[all …]
H A Dtest_read_format_zip_filename.c16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
32 struct archive *a; in DEFINE_TEST()
44 assert((a = archive_read_new()) != NULL); in DEFINE_TEST()
45 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_filter_all(a)); in DEFINE_TEST()
46 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_format_all(a)); in DEFINE_TEST()
47 if (ARCHIVE_OK != archive_read_set_options(a, "hdrcharset=CP932")) { in DEFINE_TEST()
52 assertEqualIntA(a, ARCHIVE_OK, in DEFINE_TEST()
53 archive_read_open_filename(a, refnam in DEFINE_TEST()
33 struct archive *a; DEFINE_TEST() local
93 struct archive *a; DEFINE_TEST() local
171 struct archive *a; DEFINE_TEST() local
246 struct archive *a; DEFINE_TEST() local
340 struct archive *a; DEFINE_TEST() local
397 struct archive *a; DEFINE_TEST() local
453 struct archive *a; DEFINE_TEST() local
510 struct archive *a; DEFINE_TEST() local
566 struct archive *a; DEFINE_TEST() local
628 struct archive *a; DEFINE_TEST() local
693 struct archive *a; DEFINE_TEST() local
745 struct archive *a; DEFINE_TEST() local
804 struct archive *a; DEFINE_TEST() local
881 struct archive *a; DEFINE_TEST() local
944 struct archive *a; DEFINE_TEST() local
994 struct archive *a; DEFINE_TEST() local
1051 struct archive *a; DEFINE_TEST() local
1125 struct archive *a; DEFINE_TEST() local
[all...]
H A Dtest_read_format_mtree.c17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
34 struct archive *a; in test_read_format_mtree1() local
47 * format handling open a directory. It is for through in test_read_format_mtree1()
48 * the routine which open a directory that we create in test_read_format_mtree1()
54 assert((a = archive_read_new()) != NULL); in test_read_format_mtree1()
55 assertEqualIntA(a, ARCHIVE_OK, in test_read_format_mtree1()
56 archive_read_support_filter_all(a)); in test_read_format_mtree1()
57 assertEqualIntA(a, ARCHIVE_OK, in test_read_format_mtree1()
58 archive_read_support_format_all(a)); in test_read_format_mtree1()
59 assertEqualIntA(a, ARCHIVE_OK, in test_read_format_mtree1()
[all …]
H A Dtest_write_format_zip.c18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
42 * Write a variety of different file types into the archive.
45 write_contents(struct archive *a) in write_contents() argument
56 * Write a file to it. in write_contents()
63 assertEqualInt(0, archive_write_header(a, ae)); in write_contents()
65 assertEqualInt(8, archive_write_data(a, "12345678", 9)); in write_contents()
66 assertEqualInt(0, archive_write_data(a, "1", 1)); in write_contents()
76 assertEqualInt(ARCHIVE_OK, archive_write_header(a, ae)); in write_contents()
78 assertEqualInt(4, archive_write_data(a, "1234", 4)); in write_contents()
81 * Write a file with an unknown size. in write_contents()
[all …]
H A Dtest_write_filter_zstd.c17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
32 struct archive *a; in DEFINE_TEST() local
53 * Write a 100 files and read them all back. in DEFINE_TEST()
55 assert((a = archive_write_new()) != NULL); in DEFINE_TEST()
56 assertEqualIntA(a, ARCHIVE_OK, archive_write_set_format_ustar(a)); in DEFINE_TEST()
57 r = archive_write_add_filter_zstd(a); in DEFINE_TEST()
60 assertEqualInt(ARCHIVE_OK, archive_write_free(a)); in DEFINE_TEST()
65 assertEqualIntA(a, ARCHIVE_OK, in DEFINE_TEST()
66 archive_write_set_bytes_per_block(a, 10)); in DEFINE_TEST()
67 assertEqualInt(ARCHIVE_FILTER_ZSTD, archive_filter_code(a, 0)); in DEFINE_TEST()
[all …]
H A Dtest_read_format_7zip.c16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
39 * Extract a non-encoded file.
47 struct archive *a; in test_copy() local
52 assert((a = archive_read_new()) != NULL); in test_copy()
53 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_filter_all(a)); in test_copy()
54 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_format_all(a)); in test_copy()
57 assertEqualIntA(a, ARCHIVE_OK, in test_copy()
58 archive_read_open_fd(a, fd, 10240)); in test_copy()
60 assertEqualIntA(a, ARCHIVE_OK, in test_copy()
61 archive_read_open_filename(a, refname, 10240)); in test_copy()
[all …]
H A Dtest_read_format_iso_Z.c16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
31 struct archive *a; in test1() local
36 assert((a = archive_read_new()) != NULL); in test1()
37 assertEqualIntA(a, ARCHIVE_OK, in test1()
38 archive_read_support_filter_all(a)); in test1()
39 assertEqualIntA(a, ARCHIVE_OK, in test1()
40 archive_read_support_format_all(a)); in test1()
41 assertEqualIntA(a, ARCHIVE_OK, in test1()
42 archive_read_open_filename(a, name, 512)); in test1()
45 assertEqualIntA(a, ARCHIVE_OK, in test1()
[all …]
H A Dtest_read_format_cpio_filename.c16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
32 struct archive *a; in DEFINE_TEST()
44 assert((a = archive_read_new()) != NULL); in DEFINE_TEST()
45 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_filter_all(a)); in DEFINE_TEST()
46 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_format_all(a)); in DEFINE_TEST()
47 if (ARCHIVE_OK != archive_read_set_options(a, "hdrcharset=eucJP")) { in DEFINE_TEST()
52 assertEqualIntA(a, ARCHIVE_OK, in DEFINE_TEST()
53 archive_read_open_filename(a, refnam in DEFINE_TEST()
33 struct archive *a; DEFINE_TEST() local
88 struct archive *a; DEFINE_TEST() local
141 struct archive *a; DEFINE_TEST() local
188 struct archive *a; DEFINE_TEST() local
241 struct archive *a; DEFINE_TEST() local
293 struct archive *a; DEFINE_TEST() local
346 struct archive *a; DEFINE_TEST() local
398 struct archive *a; DEFINE_TEST() local
451 struct archive *a; DEFINE_TEST() local
504 struct archive *a; DEFINE_TEST() local
550 struct archive *a; DEFINE_TEST() local
601 struct archive *a; DEFINE_TEST() local
653 struct archive *a; DEFINE_TEST() local
712 struct archive *a; DEFINE_TEST() local
758 struct archive *a; DEFINE_TEST() local
811 struct archive *a; DEFINE_TEST() local
[all...]
/freebsd/lib/libc/regex/grot/
H A Dtests9 # expected to fail. If there is a fourth field, it is the substring that
10 # the RE is expected to match. If there is a fifth field, it is a comma-
12 # no match for that one. In both the fourth and fifth fields, a (sub)field
14 # a null string followed by the stuff after the @; this provides a way to
20 # b RE is a BRE, not an ERE
21 # & try it as both an ERE and a BRE
36 a & a a
39 a|b|c - abc a
42 a(b)c - abc abc
43 a\(b\)c b abc abc
[all …]
/freebsd/crypto/krb5/doc/html/appdev/refs/api/
H A Dindex.html21 …<link rel="next" title="krb5_build_principal - Build a principal name using null-terminated string…
28 <h1><a href="../../../index.html">MIT Kerberos Documentation</a></h1>
32 <a href="../../../index.html" title="Full Table of Contents"
33 accesskey="C">Contents</a> |
34 <a href="../index.html" title="Complete reference - API and datatypes"
35 accesskey="P">previous</a> |
36 …<a href="krb5_build_principal.html" title="krb5_build_principal - Build a principal name using nul…
37 accesskey="N">next</a> |
38 <a href="../../../genindex.html" title="General Index"
39 accesskey="I">index</a> |
[all …]
/freebsd/crypto/krb5/doc/html/appdev/refs/macros/
H A Dindex.html28 <h1><a href="../../../index.html">MIT Kerberos Documentation</a></h1>
32 <a href="../../../index.html" title="Full Table of Contents"
33 accesskey="C">Contents</a> |
34 <a href="../types/krb5_tkt_creds_context.html" title="krb5_tkt_creds_context"
35 accesskey="P">previous</a> |
36 <a href="ADDRTYPE_ADDRPORT.html" title="ADDRTYPE_ADDRPORT"
37 accesskey="N">next</a> |
38 <a href="../../../genindex.html" title="General Index"
39 accesskey="I">index</a> |
40 <a href="../../../search.html" title="Enter search criteria"
[all …]
/freebsd/crypto/krb5/doc/html/
H A Dgenindex-all.html25 <h1><a href="index.html">MIT Kerberos Documentation</a></h1>
29 <a href="index.html" title="Full Table of Contents"
30 accesskey="C">Contents</a> |
31 <a href="genindex.html" title="General Index"
32 accesskey="I">index</a> |
33 <a href="search.html" title="Enter search criteria"
34 accesskey="S">Search</a> |
35 <a href="mailto:krb5-bugs@mit.edu?subject=Documentation__Index">feedback</a>
52 <a href="#A"><strong>A</strong></a>
53 | <a href="#C"><strong>C</strong></a>
[all …]
H A Dgenindex-K.html26 <h1><a href="index.html">MIT Kerberos Documentation</a></h1>
30 <a href="index.html" title="Full Table of Contents"
31 accesskey="C">Contents</a> |
32 <a href="genindex.html" title="General Index"
33 accesskey="I">index</a> |
34 <a href="search.html" title="Enter search criteria"
35 accesskey="S">Search</a> |
36 <a href="mailto:krb5-bugs@mit.edu?subject=Documentation__Index">feedback</a>
54 …<li><a href="appdev/refs/macros/KDC_OPT_ALLOW_POSTDATE.html#KDC_OPT_ALLOW_POSTDATE">KDC_OPT_ALLOW_…
56 …<li><a href="appdev/refs/macros/KDC_OPT_CANONICALIZE.html#KDC_OPT_CANONICALIZE">KDC_OPT_CANONICALI…
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/
H A DREADME.txt12 This is a replacement library for libgcc. Each function is contained
13 in its own file. Each function has a corresponding unit test under
16 A rudimentary script to test each file is in the file called
28 Here is a synopsis of the contents of this library:
38 di_int __ashldi3(di_int a, int b); // a << b
39 ti_int __ashlti3(ti_int a, int b); // a << b
41 di_int __ashrdi3(di_int a, int b); // a >> b arithmetic (sign fill)
42 ti_int __ashrti3(ti_int a, int b); // a >> b arithmetic (sign fill)
43 di_int __lshrdi3(di_int a, int b); // a >> b logical (zero fill)
44 ti_int __lshrti3(ti_int a, int b); // a >> b logical (zero fill)
[all …]
/freebsd/contrib/bearssl/src/ec/
H A Dec_c25519_m15.c5 * a copy of this software and associated documentation files (the
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
74 * that right-shifting a signed negative integer copies the sign bit
90 * Convert an integer from unsigned little-endian encoding to a sequence of
139 * Normalise an array of words to a strict 13 bits per word. Returned
165 * square20() computes the square of a 260-bit integer. Each word must
173 mul20(uint32_t *d, const uint32_t *a, const uint32_t *b) in mul20() argument
176 * Two-level Karatsuba: turns a 20x20 multiplication into in mul20()
252 memcpy(u, a, 20 * sizeof *a); in mul20()
253 ZADD(u, 4, a, 0, a, 1); in mul20()
[all …]

12345678910>>...457