/freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/ |
H A D | cert-onecolumn.pem | 1 -----BEGIN CERTIFICATE----- 6 z 10 A 28 A 42 A 46 A 50 A 55 z 63 A 70 Z [all …]
|
H A D | dsa-onecolumn.pem | 1 -----BEGIN DSA PRIVATE KEY----- 2 Proc-Type: 4,ENCRYPTED 3 DEK-Info: AES-256-CBC,A2A7FA3E5E454B59C8777564E7AF3CD6 13 a 34 z 36 a 70 z 101 a 108 A 187 Z [all …]
|
/freebsd/contrib/bearssl/src/ec/ |
H A D | ec_c25519_m64.c | 5 * a copy of this software and associated documentation files (the 17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 72 * A field element is encoded as four 64-bit integers, in basis 2^63. 77 #define MASK63 (((uint64_t)1 << 63) - (uint64_t)1) 80 * Swap two field elements, conditionally on a flag. 83 f255_cswap(uint64_t *a, uint64_t *b, uint32_t ctl) in f255_cswap() argument 87 m = -(uint64_t)ctl; in f255_cswap() 88 w = m & (a[0] ^ b[0]); a[0] ^= w; b[0] ^= w; in f255_cswap() 89 w = m & (a[1] ^ b[1]); a[1] ^= w; b[1] ^= w; in f255_cswap() 90 w = m & (a[2] ^ b[2]); a[2] ^= w; b[2] ^= w; in f255_cswap() [all …]
|
H A D | ec_p256_m64.c | 5 * a copy of this software and associated documentation files (the 17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 75 * A field element is encoded as four 64-bit integers, in basis 2^64. 76 * Values may reach up to 2^256-1. Montgomery multiplication is used. 85 /* Curve equation is y^2 = x^3 - 3*x + B. This constant is B*R mod p 96 f256_add(uint64_t *d, const uint64_t *a, const uint64_t *b) in f256_add() argument 105 w = (unsigned __int128)a[0] + b[0]; in f256_add() 107 w = (unsigned __int128)a[1] + b[1] + (w >> 64); in f256_add() 109 w = (unsigned __int128)a[2] + b[2] + (w >> 64); in f256_add() 111 w = (unsigned __int128)a[3] + b[3] + (w >> 64); in f256_add() [all …]
|
/freebsd/contrib/netbsd-tests/bin/sh/ |
H A D | t_fsplit.sh | 3 # Copyright (c) 2007-2016 The NetBSD Foundation, Inc. 17 # TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 32 # In particular this means that in ${x-word}, 'word' must be expanded as if 33 # the "${x-" and "}" were absent from the input line. 35 # So: sh -c 'set ${x-a b c}; echo $#' should give 3. 36 # and: sh -c 'set -- ${x-}' echo $#' shold give 0 54 result=$( ${TEST_SH} -c "unset x; $1" ) 63 # trim the test text in case we use it in a message below 66 set -- "$(expr "$1" : '\(............\).*')..." "$2" ;; 102 # Check that IFS is applied to text from ${x-...} unless it is inside [all …]
|
/freebsd/lib/msun/src/ |
H A D | catrig.c | 1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 4 * Copyright (c) 2012 Stephen Montgomery-Smith <stephen@FreeBSD.ORG> 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 47 FOUR_SQRT_MIN = 0x1p-509, /* >= 4 * sqrt(DBL_MIN) */ 49 m_e = 2.7182818284590452e0, /* 0x15bf0a8b145769.0p-51 */ 50 m_ln2 = 6.9314718055994531e-1, /* 0x162e42fefa39ef.0p-53 */ 51 pio2_hi = 1.5707963267948966e0, /* 0x1921fb54442d18.0p-52 */ 53 SQRT_3_EPSILON = 2.5809568279517849e-8, /* 0x1bb67ae8584caa.0p-78 */ 54 SQRT_6_EPSILON = 3.6500241499888571e-8, /* 0x13988e1409212e.0p-77 */ [all …]
|
/freebsd/contrib/file/tests/ |
H A D | matilde.arm.testfile | 2 <[d��y�����'�P�[<k�0^��<j~yJ/!ݘG&�����e�4ta��+a�<�p������(����n���{i�/�8A�<� ٫7… 3 …z����P<��s��`8A{1e�d!�Tkr(��n���u�RP<Rby��z��z�;+~��*�s�'�7q#�ڰ<p�l���-*�Bm�h2U�v��ښ�m… 4 R��0-as�Aꏾ�<�H���Ҵ�_d)Q����A����Kp���@< <J?�9a�V�9u8�9��Fp�ך�"��P< 5 �Hpc��A��Z�%�;�.s 6 �%Vйa����@<x@m1�A�"J�)��C�.t4�c��d0<zg���Y*˴fRMg�J5o��;�κ�h�<<Pg����*�0�*=�K|�K~��%… 7 (Q�)�y�E4�@<<�f�a��7_�����xR���?hl <{�Hf��+G!�x̳X���Am���<x�fT�ۃ��VtBU9�����c�en… 9 !�:���=K����[��<Ɖ�lH��!L��-��I��w�9:y��<�U'�ԫ�Lc�\vyY>�Ԫ�ϧ�4p<&@i�~#�������)J$�� 10 ��[��ơ��<&@�����(�\�W�!"-@��C]�4�<&F����*�2;[��v�w�>�=�����<!x@;����e�R!���F�iW�…
|
H A D | HWP97.hwp.testfile | 1 …a��� ���� 1:50:44… 3 …�!��,��n�%���l�#N�\���T.�X��}�)u�n�k롞%]��qۃ�"��,�jv �װ�a�/���^�����u�亮h��t{��n�g�z�F�'5��… 4 d\އ�&R/[�7�-��ہ�}��A��%�䔓���_XZ�5-r]^�� 5 …-�νuYwu-E�#rY���a"�"��;>A�������7����{���$��܅y҅���\t�8���#S&O�貔������ �Z��SV��u�C�:�!g���… 6 …-%R!6O�B��^묘j���-x��������6��J�}��F��NK�Y�Q�u�9��F�Ŋ��0��+&�Iw4�I��{�fߍǮ����9E�Xh{�S���… 7 >��ĕ�y~/Yۿ��5����W����)�Wȴ�8tǮI��G�MW��ֺD��y�.;O�&�^�0��/�z�!���� 8 �7�s����-đ��0�uC�D:�:�Yޣ��I�D��~��:��~V��mqL�rQ9L�#������ 9�}\��q]ɰ^6�G�����]��Փ3Q�… 12 …��q��D{m��h�N\D��\��w���]`ד�Ws�؊�����ö3�r�Z8�H�$�C�G->y8�Z˃�,�N�I90FU��1s�+��1s[�L�"�m��…
|
/freebsd/lib/msun/tests/ |
H A D | ctrig_test.c | 1 /*- 2 * Copyright (c) 2008-2011 David Schultz <das@FreeBSD.org> 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 38 #include "test-utils.h" 44 * Test that a function returns the correct value and sets the 56 #define test_p(func, z, result, exceptmask, excepts, checksign) \ argument 58 volatile long double complex _d = z; \ 70 * Test within a given tolerance. The tolerance indicates relative error 74 #define test_p_tol(func, z, result, tol) do { \ argument 76 creall(z), cimagl(z), creall(result), cimagl(result)); \ [all …]
|
H A D | invctrig_test.c | 1 /*- 2 * Copyright (c) 2008-2013 David Schultz <das@FreeBSD.org> 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 38 #include "test-utils.h" 44 * Test that a function returns the correct value and sets the 56 #define test_p(func, z, result, exceptmask, excepts, checksign) do { \ argument 57 volatile long double complex _d = z; \ 63 #func, #z); \ 67 * Test within a given tolerance. The tolerance indicates relative error 70 #define test_p_tol(func, z, result, tol) do { \ argument [all …]
|
/freebsd/contrib/bearssl/src/symcipher/ |
H A D | poly1305_ctmul32.c | 5 * a copy of this software and associated documentation files (the 17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 31 poly1305_inner(uint32_t *a, const uint32_t *r, const void *data, size_t len) in poly1305_inner() argument 34 * Implementation notes: we split the 130-bit values into ten in poly1305_inner() 35 * 13-bit words. This gives us some space for carries and allows in poly1305_inner() 36 * using only 32x32->32 multiplications, which are way faster than in poly1305_inner() 37 * 32x32->64 multiplications on the ARM Cortex-M0/M0+, and also in poly1305_inner() 38 * help in making constant-time code on the Cortex-M3. in poly1305_inner() 40 * Since we compute modulo 2^130-5, the "upper words" become in poly1305_inner() 41 * low words with a factor of 5; that is, x*2^130 = x*5 mod p. in poly1305_inner() [all …]
|
/freebsd/lib/libsysdecode/ |
H A D | mktables | 16 # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 # Originally this script was 'mksubr' for kdump which generated a complete 33 set -e 37 if [ -z "$1" ] 39 echo "usage: sh $0 include-dir [output-file]" 43 if [ -n "$2" ]; then 45 output_tmp=$(mktemp -u) 51 # Generate a table C #definitions. The including file can define the 63 if [ -z "$excl" ]; then 66 filter="egrep -v" [all …]
|
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_stream/salsa20/xmm6int/ |
H A D | u4.h | 29 /* no z8 -> first half of the nonce, will fill later */ 34 /* no z9 -> second half of the nonce, will fill later */ 100 /* the inner loop is a direct translation (regexp search/replace) 101 * from the amd64-xmm6 ASM */ 362 /* store data ; this macro replicates the original amd64-xmm6 code */ 363 #define ONEQUAD_SHUFFLE(A, B, C, D) \ argument 364 z##A = _mm_add_epi32(z##A, orig##A); \ 365 z##B = _mm_add_epi32(z##B, orig##B); \ 366 z##C = _mm_add_epi32(z##C, orig##C); \ 367 z##D = _mm_add_epi32(z##D, orig##D); \ [all …]
|
/freebsd/tools/regression/usr.bin/env/ |
H A D | regress-env.rgdata | 1 #- 2 # Copyright (c) 2005 - Garance Alistair Drosehn <gad@FreeBSD.org>. 16 # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 30 gblenv=TESTVAR=Global-TV-Value 33 # These first two tests are testing how well the regression-script itself is 34 # handling environment-variables, as much as testing the `env' program. 38 script:/bin/echo A-${TESTVAR}-Z 39 stdout:A-a1a-Z 42 sb_args:-S /bin/sh 43 script:/bin/echo A-${TESTVAR}-Z [all …]
|
/freebsd/lib/msun/bsdsrc/ |
H A D | b_tgamma.c | 1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 41 * The algorithm remains, but the code has been re-arranged to facilitate 52 double a; member 65 * xleft > x > iota: smaller_gam(x) where iota = 1e-17. 66 * iota > x > -itoa: Handle x near 0. 67 * -iota > x : neg_gam 70 * -Inf: return NaN and raise invalid; 72 * other x ~< 177.79: return +-0 and raise underflow; [all …]
|
/freebsd/sys/dev/hpt27xx/ |
HD | i386-elf.hpt27xx_lib.o | ... -f A v q * q 3 x4 j-=m ld \c Qkkbal 0e N b l ... |
/freebsd/crypto/openssl/crypto/cast/ |
H A D | c_skey.c | 2 * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved. 5 * this file except in compliance with the License. You can obtain a copy 20 #define CAST_exp(l,A,a,n) \ argument 21 A[n/4]=l; \ 22 a[n+3]=(l )&0xff; \ 23 a[n+2]=(l>> 8)&0xff; \ 24 a[n+1]=(l>>16)&0xff; \ 25 a[n+0]=(l>>24)&0xff; 35 CAST_LONG z[16]; in CAST_set_key() local 37 CAST_LONG X[4], Z[4]; in CAST_set_key() local [all …]
|
/freebsd/lib/msun/ld80/ |
H A D | b_tgammal.c | 1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 64 long double a; member 72 static const volatile double tiny = 1e-300; 77 * equal-ripples: 79 * log(G(x)) ~= (x-0.5)*(log(x)-1) + 0.5(log(2*pi)-1) + 1/x*P(1/(x*x)) 81 * Keep extra precision in multiplying (x-.5)(log(x)-1), to avoid 82 * premature round-off. 84 * Accurate to max(ulp(1/128) absolute, 2^-66 relative) error. [all …]
|
/freebsd/contrib/gdtoa/ |
H A D | misc.c | 39 #define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double)) 61 freelist[k] = rv->next; 66 rv = (Bigint *)MALLOC(sizeof(Bigint) + (x-1)*sizeof(ULong)); 68 len = (sizeof(Bigint) + (x-1)*sizeof(ULong) + sizeof(double) - 1) 70 if (k <= Kmax && pmem_next - private_mem + len <= PRIVATE_mem) { 77 rv->k = k; 78 rv->maxwds = x; 81 rv->sign = rv->wds = 0; 94 if (v->k > Kmax) 102 v->next = freelist[v->k]; [all …]
|
/freebsd/crypto/openssl/crypto/ec/ |
H A D | ecp_smpl.c | 2 * Copyright 2001-2021 The OpenSSL Project Authors. All Rights Reserved. 6 * this file except in compliance with the License. You can obtain a copy 86 * non-trivial representations of field elements if necessary 94 * that if a non-trivial representation is used, it is a Montgomery 100 group->field = BN_new(); in ossl_ec_GFp_simple_group_init() 101 group->a = BN_new(); in ossl_ec_GFp_simple_group_init() 102 group->b = BN_new(); in ossl_ec_GFp_simple_group_init() 103 if (group->field == NULL || group->a == NULL || group->b == NULL) { in ossl_ec_GFp_simple_group_init() 104 BN_free(group->field); in ossl_ec_GFp_simple_group_init() 105 BN_free(group->a); in ossl_ec_GFp_simple_group_init() [all …]
|
H A D | ecp_nistputil.c | 2 * Copyright 2011-2021 The OpenSSL Project Authors. All Rights Reserved. 5 * this file except in compliance with the License. You can obtain a copy 15 * You may obtain a copy of the License at 17 * http://www.apache.org/licenses/LICENSE-2.0 43 * infinity is found (Z = 0), it remains unchanged.) This function is 46 * with (BIGNUM-based) EC_POINT data structures. point_array is the 49 * of size 'felem_size'. tmp_felems needs to point to a temporary array of 84 #define Z(I) (&((char *)point_array)[(3*(I) + 2) * felem_size]) in ossl_ec_GFp_nistp_points_make_affine_internal() macro 86 if (!felem_is_zero(Z(0))) in ossl_ec_GFp_nistp_points_make_affine_internal() 87 felem_assign(tmp_felem(0), Z(0)); in ossl_ec_GFp_nistp_points_make_affine_internal() [all …]
|
/freebsd/contrib/unbound/services/ |
H A D | localzone.c | 2 * services/localzone.c - local zones authority service. 26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 56 * with 16 bytes for an A record, a 64K packet has about 4000 max */ 61 local_zone_out(struct local_zone* z) in local_zone_out() argument 65 RBTREE_FOR(d, struct local_data*, &z->data) { in local_zone_out() 66 for(p = d->rrsets; p; p = p->next) { in local_zone_out() 67 log_nametypeclass(NO_VERBOSE, "rrset", d->name, in local_zone_out() 68 ntohs(p->rrset->rk.type), in local_zone_out() 69 ntohs(p->rrset->rk.rrset_class)); in local_zone_out() 75 local_zone_print(struct local_zone* z) in local_zone_print() argument [all …]
|
/freebsd/contrib/tzdata/ |
H A D | etcetera | 4 # 2009-05-17 by Arthur David Olson. 9 # can be useful if the timezone database is wrong or if a ship or 10 # aircraft at sea is not in a timezone. 12 # Starting with POSIX 1003.1-2001, the entries below are all 14 # instead of TZ='Etc/GMT+4' one can use the POSIX setting TZ='<-04>+4'. 16 # Do not use a POSIX TZ setting like TZ='GMT+4', which is four hours 21 Zone Etc/UTC 0 - UTC 25 #Zone GMT 0 - GMT 27 Zone Etc/GMT 0 - GM [all...] |
/freebsd/contrib/ldns/ |
H A D | zone.c | 4 * a Net::DNS like library for C 6 * (c) NLnet Labs, 2005-2006 18 ldns_zone_soa(const ldns_zone *z) in ldns_zone_soa() argument 20 return z->_soa; in ldns_zone_soa() 24 ldns_zone_rr_count(const ldns_zone *z) in ldns_zone_rr_count() argument 26 return ldns_rr_list_rr_count(z->_rrs); in ldns_zone_rr_count() 30 ldns_zone_set_soa(ldns_zone *z, ldns_rr *soa) in ldns_zone_set_soa() argument 32 z->_soa = soa; in ldns_zone_set_soa() 36 ldns_zone_rrs(const ldns_zone *z) in ldns_zone_rrs() argument 38 return z->_rrs; in ldns_zone_rrs() [all …]
|
/freebsd/lib/libc/stdlib/ |
H A D | tsearch.c | 1 /*- 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 37 posix_tnode **leaf, *result, *n, *x, *y, *z; in tsearch() local 53 if ((*leaf)->balance != 0) { in tsearch() 55 * If we reach a node that has a non-zero in tsearch() 65 cmp = compar(key, (*leaf)->key); in tsearch() 68 leaf = &(*leaf)->llink; in tsearch() 71 leaf = &(*leaf)->rlink; in tsearch() 77 /* Did not find a matching key in the tree. Insert a new node. */ in tsearch() 81 result->key = (void *)key; in tsearch() [all …]
|