Home
last modified time | relevance | path

Searched +full:a +full:- +full:z (Results 1 – 25 of 1160) sorted by relevance

12345678910>>...47

/freebsd-src/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A Dcert-onecolumn.pem1 -----BEGIN CERTIFICATE-----
6 z
10 A
28 A
42 A
46 A
50 A
55 z
63 A
70 Z
[all …]
H A Ddsa-onecolumn.pem1 -----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-src/contrib/bearssl/src/ec/
H A Dec_c25519_m64.c5 * 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 Dec_p256_m64.c5 * 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-src/contrib/netbsd-tests/bin/sh/
H A Dt_fsplit.sh3 # 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-src/lib/msun/src/
H A Dcatrig.c1 /*-
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-src/contrib/file/tests/
H A Dmatilde.arm.testfile2 <[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 DHWP97.hwp.testfile1 …a��� ����� �1�:�5�0�:�4�4�������������������������������������������������������������������������…
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 …-�νuY­wu-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-src/contrib/bearssl/src/symcipher/
H A Dpoly1305_ctmul32.c5 * 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-src/lib/msun/tests/
H A Dctrig_test.c1 /*-
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 Dinvctrig_test.c1 /*-
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-src/lib/libsysdecode/
H A Dmktables16 # 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-src/sys/contrib/libsodium/src/libsodium/crypto_stream/salsa20/xmm6int/
H A Du4.h29 /* 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-src/lib/msun/bsdsrc/
H A Db_tgamma.c1 /*-
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-src/tools/regression/usr.bin/env/
H A Dregress-env.rgdata1 #-
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-src/sys/dev/hpt27xx/
HDi386-elf.hpt27xx_lib.o ... -f A v q * q 3 x4 j-=m ld \c Qkkbal 0e N b l ...
/freebsd-src/crypto/openssl/crypto/cast/
H A Dc_skey.c2 * 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-src/lib/msun/ld80/
H A Db_tgammal.c1 /*-
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-src/contrib/gdtoa/
H A Dmisc.c39 #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-src/crypto/openssl/crypto/ec/
H A Decp_smpl.c2 * 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 Decp_nistputil.c2 * 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-src/contrib/unbound/services/
H A Dlocalzone.c2 * 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->nam in local_zone_out()
75 local_zone_print(struct local_zone * z) local_zone_print() argument
88 struct local_zone* z; local_zones_print() local
115 struct local_zone* z = (struct local_zone*)n->key; lzdel() local
131 local_zone_delete(struct local_zone * z) local_zone_delete() argument
147 struct local_zone* a = (struct local_zone*)z1; local_zone_cmp() local
161 struct local_data* a = (struct local_data*)d1; local_data_cmp() local
187 struct local_zone* z = (struct local_zone*)calloc(1, sizeof(*z)); local_zone_create() local
214 struct local_zone* z = local_zone_create(nm, len, labs, t, c); lz_enter_zone_dname() local
249 struct local_zone* z; lz_enter_zone() local
460 local_zone_find_data(struct local_zone * z,uint8_t * nm,size_t nmlen,int nmlabs) local_zone_find_data() argument
472 lz_find_create_node(struct local_zone * z,uint8_t * nm,size_t nmlen,int nmlabs,struct local_data ** res) lz_find_create_node() argument
512 lz_mark_soa_for_zone(struct local_zone * z,struct ub_packed_rrset_key * soa_rrset,uint8_t * rdata,size_t rdata_len,time_t ttl,const char * rrstr) lz_mark_soa_for_zone() argument
549 local_zone_enter_rr(struct local_zone * z,uint8_t * nm,size_t nmlen,int nmlabs,uint16_t rrtype,uint16_t rrclass,time_t ttl,uint8_t * rdata,size_t rdata_len,const char * rrstr) local_zone_enter_rr() argument
606 lz_enter_rr_into_zone(struct local_zone * z,const char * rrstr) lz_enter_rr_into_zone() argument
645 struct local_zone* z; lz_enter_rr_str() local
674 struct local_zone* z; lz_enter_zone_tag() local
711 struct local_zone* z; lz_enter_override() local
789 struct local_zone* z; lz_enter_zones() local
808 struct local_zone z; lz_exists() local
850 struct local_zone* z; add_empty_default() local
874 struct local_zone* z; local_zone_enter_defaults() local
1058 struct local_zone* z = local_zones_lookup(zones, lz_setup_implicit() local
1114 struct local_zone* z; lz_setup_implicit() local
1468 local_data_answer(struct local_zone * z,struct module_env * env,struct query_info * qinfo,struct edns_data * edns,struct comm_reply * repinfo,sldns_buffer * buf,struct regional * temp,int labs,struct local_data ** ldp,enum localzone_type lz_type,int tag,struct config_strlist ** tag_datas,size_t tag_datas_size,char ** tagname,int num_tags) local_data_answer() argument
1605 local_zone_does_not_cover(struct local_zone * z,struct query_info * qinfo,int labs) local_zone_does_not_cover() argument
1640 local_zones_zone_answer(struct local_zone * z,struct module_env * env,struct query_info * qinfo,struct edns_data * edns,struct comm_reply * repinfo,sldns_buffer * buf,struct regional * temp,struct local_data * ld,enum localzone_type lz_type) local_zones_zone_answer() argument
1761 lz_inform_print(struct local_zone * z,struct query_info * qinfo,struct sockaddr_storage * addr,socklen_t addrlen) lz_inform_print() argument
1844 struct local_zone* z = NULL; local_zones_answer() local
2003 set_kiddo_parents(struct local_zone * z,struct local_zone * match,struct local_zone * newp) set_kiddo_parents() argument
2032 struct local_zone* z = local_zone_create(name, len, labs, tp, dclass); local_zones_add_zone() local
2058 local_zones_del_zone(struct local_zones * zones,struct local_zone * z) local_zones_del_zone() argument
2079 struct local_zone* z; local_zones_add_RR() local
2123 del_empty_term(struct local_zone * z,struct local_data * d,uint8_t * name,size_t len,int labs) del_empty_term() argument
2161 struct local_zone* z; local_zones_del_data() local
[all...]
/freebsd-src/lib/libc/stdlib/
H A Dtsearch.c1 /*-
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 …]
/freebsd-src/contrib/ldns/
H A Dzone.c4 * 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-src/contrib/ldns/ldns/
H A Dzone.h5 * - what is it
6 * - get_glue function
7 * - search etc
9 * a Net::DNS like library for C
11 * (c) NLnet Labs, 2005-2006
38 * A list of RR's with some
44 /** the soa defines a zone */
46 /* basically a zone is a list of rr's */
48 /* we could change this to be a b-tree etc etc todo */
53 * create a new ldns_zone structure
[all …]

12345678910>>...47