Home
last modified time | relevance | path

Searched +full:compute +full:- (Results 1 – 25 of 1068) sorted by relevance

12345678910>>...43

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DKnownBits.h1 //===- llvm/Support/KnownBits.h - Stores known zeros/ones -------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
96 /// Returns true if this value is known to be non-negative.
99 /// Returns true if this value is known to be non-zero.
112 /// Make this value non-negative.
119 // Assume that all bits that aren't known-ones are zeros. in getMinValue()
125 // Assume that all bits that aren't known-ones are zeros. in getSignedMinValue()
135 // Assume that all bits that aren't known-zeros are ones. in getMaxValue()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/misc/
H A Dqcom,fastrpc.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Srinivas Kandagatla <srinivas.kandagatla@linaro.org>
13 The FastRPC implements an IPC (Inter-Processor Communication)
25 - adsp
26 - mdsp
27 - sdsp
28 - cdsp
29 - cdsp1
[all …]
H A Dqcom,fastrpc.txt3 The FastRPC implements an IPC (Inter-Processor Communication)
9 - compatible:
14 - label
20 - qcom,non-secure-domain:
23 Definition: Property to specify that dsp domain is non-secure.
25 - qcom,vmids:
30 - #address-cells
35 - #size-cells
40 = COMPUTE BANKS
41 Each subnode of the Fastrpc represents compute context banks available
[all …]
/freebsd/crypto/openssl/demos/
H A DREADME.txt18 EVP_MD_demo.c Compute a digest from multiple buffers
19 EVP_MD_stdin.c Compute a digest with data read from stdin
20 EVP_MD_xof.c Compute a digest using the SHAKE256 XOF
21 EVP_f_md.c Compute a digest using BIO and EVP_f_md
30 poly1305.c Demonstration of Poly1305-AES message authentication
48 EVP_Signature_demo.c Compute and verify a signature from multiple buffers
49 rsa_pss_direct.c Compute and verify an RSA-PSS signature from a hash
50 rsa_pss_hash.c Compute and verify an RSA-PSS signature over a buffer
/freebsd/crypto/libecc/src/sig/
H A Decgdsa.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
45 q = &(in_priv->params->ec_gen_order); in ecgdsa_init_pub_key()
48 MUST_HAVE((!nn_cmp(&(in_priv->x), q, &cmp)) && (cmp < 0), ret, err); in ecgdsa_init_pub_key()
50 /* Y = (x^-1)G */ in ecgdsa_init_pub_key()
51 G = &(in_priv->params->ec_gen); in ecgdsa_init_pub_key()
55 ret = nn_modinv_fermat(&xinv, &(in_priv->x), &(in_priv->params->ec_gen_order)); EG(ret, err); in ecgdsa_init_pub_key()
57 ret = prj_pt_mul_blind(&(out_pub->y), &xinv, G); EG(ret, err); in ecgdsa_init_pub_key()
59 out_pub->key_type = ECGDSA; in ecgdsa_init_pub_key()
60 out_pub->params = in_priv->params; in ecgdsa_init_pub_key()
[all …]
H A Decrdsa.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
32 * NOTE: ISO/IEC 14888-3 standard seems to diverge from the existing implementations
34 * in RFC 7091 and draft-deremin-rfc4491-bis. While in ISO/IEC 14888-3 it is explicitely asked
37 * (this discrepancy is exhibited and confirmed by test vectors present in ISO/IEC 14888-3, and
39 * ISO/IEC 14888-3 algorithm description that must be fixed there.
42 * other implemetations, but keeps the ISO/IEC 14888-3 behavior if forced/asked by the user using
60 buf[i] = buf[buf_size - 1 - i]; in _reverse_endianness()
61 buf[buf_size - 1 - i] = tmp; in _reverse_endianness()
83 q = &(in_priv->params->ec_gen_order); in ecrdsa_init_pub_key()
[all …]
H A Decdsa_common.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
40 * leaking can be possible through side-channel attacks.
88 /* We compute bits2octets(hash) here */ in __ecdsa_rfc6979_nonce()
91 ret = nn_rshift(k, k, (bitcnt_t)((8 * hsize) - q_bit_len)); EG(ret, err); in __ecdsa_rfc6979_nonce()
110 /* We compute bits2octets(hash) here */ in __ecdsa_rfc6979_nonce()
125 * 3. Compute: in __ecdsa_rfc6979_nonce()
127 * If that value of k is within the [1,q-1] range, and is in __ecdsa_rfc6979_nonce()
131 * Otherwise, compute: in __ecdsa_rfc6979_nonce()
147 ret = nn_rshift(k, k, (bitcnt_t)((8 * q_len) - q_bit_len)); EG(ret, err); in __ecdsa_rfc6979_nonce()
[all …]
H A Dsm2.c2 * Copyright (C) 2021 - This file is part of libecc project
29 * other EC*DSA style signature algorithms described in ISO14888-3:
30 * the private key x MUST be in ]0, q-1[ instead of ]0, q[ (this is actually
45 /* Get a random value in ]0,q-1[ where q is the group generator order */ in sm2_gen_priv_key()
47 ret = nn_dec(&tmp, &(priv_key->params->ec_gen_order)); EG(ret, err); in sm2_gen_priv_key()
48 ret = nn_get_random_mod(&(priv_key->x), &tmp); in sm2_gen_priv_key()
69 * ]0, q-1[. This excluded q-1 is an oddity but is what the in sm2_init_pub_key()
70 * ISO14888-3:2018 has. in sm2_init_pub_key()
73 ret = nn_dec(&tmp, &in_priv->params->ec_gen_order); EG(ret, err); in sm2_init_pub_key()
74 /* If x >= (q - 1), this is an error */ in sm2_init_pub_key()
[all …]
H A Decfsdsa.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
43 q = &(in_priv->params->ec_gen_order); in ecfsdsa_init_pub_key()
46 MUST_HAVE(!nn_cmp(&(in_priv->x), q, &cmp) && (cmp < 0), ret, err); in ecfsdsa_init_pub_key()
49 G = &(in_priv->params->ec_gen); in ecfsdsa_init_pub_key()
51 ret = prj_pt_mul_blind(&(out_pub->y), &(in_priv->x), G); EG(ret, err); in ecfsdsa_init_pub_key()
53 out_pub->key_type = ECFSDSA; in ecfsdsa_init_pub_key()
54 out_pub->params = in_priv->params; in ecfsdsa_init_pub_key()
55 out_pub->magic = PUB_KEY_MAGIC; in ecfsdsa_init_pub_key()
83 * Global EC-FSDSA signature process is as follows (I,U,F provides
[all …]
H A Deckcdsa.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
32 * function returns 0 on success, -1 on error.
47 q = &(in_priv->params->ec_gen_order); in eckcdsa_init_pub_key()
53 MUST_HAVE((!nn_cmp(&(in_priv->x), q, &cmp)) && (cmp < 0), ret, err); in eckcdsa_init_pub_key()
55 /* Y = (x^-1)G */ in eckcdsa_init_pub_key()
56 G = &(in_priv->params->ec_gen); in eckcdsa_init_pub_key()
60 ret = nn_modinv_fermat(&xinv, &(in_priv->x), q); EG(ret, err); in eckcdsa_init_pub_key()
63 ret = prj_pt_mul_blind(&(out_pub->y), &xinv, G); EG(ret, err); in eckcdsa_init_pub_key()
65 out_pub->key_type = ECKCDSA; in eckcdsa_init_pub_key()
[all …]
H A Decsdsa_common.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
32 * Generic *internal* helper for EC-{,O}SDSA public key initialization
33 * functions. The function returns 0 on success, -1 on error.
49 G = &(in_priv->params->ec_gen); in __ecsdsa_init_pub_key()
51 ret = prj_pt_mul_blind(&(out_pub->y), &(in_priv->x), G); EG(ret, err); in __ecsdsa_init_pub_key()
53 out_pub->key_type = key_type; in __ecsdsa_init_pub_key()
54 out_pub->params = in_priv->params; in __ecsdsa_init_pub_key()
55 out_pub->magic = PUB_KEY_MAGIC; in __ecsdsa_init_pub_key()
66 * -1 on error. On success, signature length is provided via 'siglen' out
[all …]
H A Dfuzzing_ecdsa.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
39 MUST_HAVE((((void *)(A)) != NULL) && ((A)->magic == ECDSA_SIGN_MAGIC), ret, err)
68 ECDSA_SIGN_CHECK_INITIALIZED(&(ctx->sign_data.ecdsa), ret, err); in ecdsa_sign_raw()
75 priv_key = &(ctx->key_pair->priv_key); in ecdsa_sign_raw()
76 q = &(priv_key->params->ec_gen_order); in ecdsa_sign_raw()
77 q_bit_len = priv_key->params->ec_gen_order_bitlen; in ecdsa_sign_raw()
78 G = &(priv_key->params->ec_gen); in ecdsa_sign_raw()
80 x = &(priv_key->x); in ecdsa_sign_raw()
83 dbg_nn_print("p", &(priv_key->params->ec_fp.p)); in ecdsa_sign_raw()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A DOpenACCKinds.h1 //===--- OpenACCKinds.h - OpenACC Enums -------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 /// Defines some OpenACC-specific enums and functions.
12 //===----------------------------------------------------------------------===//
26 // Compute Constructs.
62 // Procedure Calls in Compute Regions.
184 /// 'if' clause, allowed on all the Compute Constructs, Data Constructs,
187 /// 'self' clause, allowed on Compute and Combined Constructs, plus 'update'.
189 /// 'copy' clause, allowed on Compute and Combined Constructs, plus 'data' and
[all …]
/freebsd/crypto/libecc/scripts/
H A Dexpand_libecc.py2 # * Copyright (C) 2017 - This file is part of libecc project
7 # * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
20 # External dependecy for SHA-3
22 # for SHA-3 functions for now
32 ### Ctrl-C handler
51 x0, x1 = x1, x0 - q * x1
52 y0, y1 = y1, y0 - q * y1
64 Compute montgomery coeff r, r^2 and mpinv. pbitlen is the size
70 mpinv = 2**wlen - (modinv(prime, 2**wlen))
75 Compute division coeffs p_normalized, p_shift and p_reciprocal.
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaOpenACC.cpp1 //===--- SemaOpenACC.cpp - Semantic Analysis for OpenACC constructs -------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
357 return C->getClauseKind() == Clause.getClauseKind(); in checkAlreadyHasClauseOfKind()
362 S.Diag((*Itr)->getBeginLoc(), diag::note_acc_previous_clause_here); in checkAlreadyHasClauseOfKind()
371 // This is only a requirement on compute and loop constructs so far, so this in checkValidAfterDeviceType()
379 // the directive or up to the next device_type clause are device-specific in checkValidAfterDeviceType()
465 << Clause.getClauseKind() << (*Itr)->getClauseKind(); in Visit()
466 SemaRef.Diag((*Itr)->getBeginLoc(), diag::note_acc_previous_clause_here); in Visit()
[all …]
/freebsd/contrib/bearssl/src/rsa/
H A Drsa_i15_priv.c45 * Compute the actual lengths of p and q, in bytes. in br_rsa_i15_private()
47 * them anyway in constant-time code). in br_rsa_i15_private()
49 p = sk->p; in br_rsa_i15_private()
50 plen = sk->plen; in br_rsa_i15_private()
53 plen --; in br_rsa_i15_private()
55 q = sk->q; in br_rsa_i15_private()
56 qlen = sk->qlen; in br_rsa_i15_private()
59 qlen --; in br_rsa_i15_private()
63 * Compute the maximum factor length, in words. in br_rsa_i15_private()
68 z -= 15; in br_rsa_i15_private()
[all …]
H A Drsa_i31_priv.c45 * Compute the actual lengths of p and q, in bytes. in br_rsa_i31_private()
47 * them anyway in constant-time code). in br_rsa_i31_private()
49 p = sk->p; in br_rsa_i31_private()
50 plen = sk->plen; in br_rsa_i31_private()
53 plen --; in br_rsa_i31_private()
55 q = sk->q; in br_rsa_i31_private()
56 qlen = sk->qlen; in br_rsa_i31_private()
59 qlen --; in br_rsa_i31_private()
63 * Compute the maximum factor length, in words. in br_rsa_i31_private()
68 z -= 31; in br_rsa_i31_private()
[all …]
H A Drsa_i62_priv.c30 #define TLEN (4 * U) /* TLEN is counted in 64-bit words */
47 * Compute the actual lengths of p and q, in bytes. in br_rsa_i62_private()
49 * them anyway in constant-time code). in br_rsa_i62_private()
51 p = sk->p; in br_rsa_i62_private()
52 plen = sk->plen; in br_rsa_i62_private()
55 plen --; in br_rsa_i62_private()
57 q = sk->q; in br_rsa_i62_private()
58 qlen = sk->qlen; in br_rsa_i62_private()
61 qlen --; in br_rsa_i62_private()
65 * Compute the maximum factor length, in words. in br_rsa_i62_private()
[all …]
/freebsd/contrib/bearssl/src/ec/
H A Dec_prime_i31.c122 return &pp[curve - BR_EC_secp256r1]; in id_to_curve()
129 * -- three values, x, y and z, in Montgomery representation
130 * -- affine coordinates are X = x / z^2 and Y = y / z^3
131 * -- for the point at infinity, z = 0
142 * MSUB(d, a) d = d-a (modular)
199 * m = 3*(x + z^2)*(x - z^2)
200 * x' = m^2 - 2*s
201 * y' = m*(s - x') - 8*y^4
215 * Compute z^2 (in t1).
220 * Compute x-z^2 (in t2) and then x+z^2 (in t1).
[all …]
H A Dec_prime_i15.c29 * - field modulus p
30 * - R^2 mod p (R = 2^(15k) for the smallest k such that R >= p)
31 * - b*R mod p (b is the second curve equation parameter)
123 return &pp[curve - BR_EC_secp256r1]; in id_to_curve()
130 * -- three values, x, y and z, in Montgomery representation
131 * -- affine coordinates are X = x / z^2 and Y = y / z^3
132 * -- for the point at infinity, z = 0
143 * MSUB(d, a) d = d-a (modular)
200 * m = 3*(x + z^2)*(x - z^2)
201 * x' = m^2 - 2*s
[all …]
/freebsd/sys/contrib/openzfs/config/
H A Dpo.m41 # po.m4 serial 30 (gettext-0.20)
2 dnl Copyright (C) 1995-2014, 2016, 2018-2019 Free Software Foundation, Inc.
17 dnl Ulrich Drepper <drepper@cygnus.com>, 1995-2000.
18 dnl Bruno Haible <haible@clisp.cons.org>, 2000-2003.
35 dnl Perform the following tests also if --disable-nls has been given,
42 [$ac_dir/$ac_word --statistics /dev/null >&]AS_MESSAGE_LOG_FD[ 2>&1 &&
43 …(if $ac_dir/$ac_word --statistics /dev/null 2>&1 >/dev/null | grep usage >/dev/null; then exit 1; …
49 case `$GMSGFMT --version | sed 1q | sed -e 's,^[^0-9]*,,'` in
50 '' | 0.[0-9] | 0.[0-9].* | 0.1[0-4] | 0.1[0-4].*) GMSGFMT_015=: ;;
60 …[$ac_dir/$ac_word --omit-header --copyright-holder= --msgid-bugs-address= /dev/null >&]AS_MESSAGE_…
[all …]
/freebsd/lib/msun/man/
H A Dcomplex.364 .Bl -column "csqrt" "complex absolute value (i.e., norm, modulus, magnitude)"
67 .\" Section 7.3.5 - 7.3.7 of ISO C99 standard unimplemented, see BUGS
69 .Ss Absolute-value Functions
85 carg compute the argument (i.e., phase angle)
86 cimag compute the imaginary part
87 conj compute the complex conjugate
88 cproj compute projection onto Riemann sphere
89 creal compute the real part
91 .\" Section 7.3.5-6 of ISO C99 standard
115 .%U http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1256.pdf
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDelinearization.h1 //===---- Delinearization.h - MultiDimensional Index Delinearization ------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 // use the on-demand SCEVAddRecExpr::delinearize() function.
14 //===----------------------------------------------------------------------===//
29 /// Compute the array dimensions Sizes from the set of Terms extracted from
50 /// The delinearization is a 3 step process: the first two steps compute the
55 /// 2. Compute the array size
56 /// 3. Compute the access function: divide the SCEV by the array size
62 /// To compute a uniform array size for several memory accesses to the same
[all …]
/freebsd/contrib/mtree/
H A Dcrc.c3 /*-
112 * Compute a POSIX 1003.2 checksum. This routine has been broken out so that
128 #define COMPUTE(var, ch) (var) = (var) << 8 ^ crctab[(var) >> 24 ^ (ch)] in crc() macro
135 for (len += nr, p = buf; nr--; ++p) { in crc()
136 COMPUTE(thecrc, *p); in crc()
137 COMPUTE(crctot, *p); in crc()
140 for (len += nr, p = buf; nr--; ++p) in crc()
141 COMPUTE(thecrc, *p); in crc()
151 COMPUTE(thecrc, len & 0xff); in crc()
152 COMPUTE(crctot, len & 0xff); in crc()
[all …]
/freebsd/crypto/libecc/src/fp/
H A Dfp_montgomery.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
22 /* Compute out = in1 + in2 mod p in the Montgomery form.
24 * Returns 0 on success, -1 on error.
33 /* Compute out = in1 - in2 mod p in the Montgomery form.
35 * Returns 0 on success, -1 on error.
44 /* Compute out = in1 * in2 mod p in the Montgomery form.
46 * Returns 0 on success, -1 on error.
55 /* Compute out = in * in mod p in the Montgomery form.
57 * Returns 0 on success, -1 on error.
[all …]

12345678910>>...43