Home
last modified time | relevance | path

Searched full:compute (Results 1 – 25 of 2219) sorted by relevance

12345678910>>...89

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DKnownBits.h323 /// Compute known bits resulting from adding LHS, RHS and a 1-bit Carry.
328 /// Compute known bits resulting from adding LHS and RHS.
333 /// Compute known bits results from subtracting RHS from LHS with 1-bit
339 /// Compute knownbits resulting from addition of LHS and RHS.
345 /// Compute knownbits resulting from subtraction of LHS and RHS.
351 /// Compute knownbits resulting from llvm.sadd.sat(LHS, RHS)
355 /// Compute knownbits resulting from llvm.uadd.sat(LHS, RHS)
359 /// Compute knownbits resulting from llvm.ssub.sat(LHS, RHS)
363 /// Compute knownbits resulting from llvm.usub.sat(LHS, RHS)
367 /// Compute knownbits resulting from APIntOps::avgFloorS
[all …]
/freebsd/crypto/openssl/demos/
H A DREADME.txt23 EVP_MD_demo.c Compute a digest from multiple buffers
24 EVP_MD_stdin.c Compute a digest with data read from stdin
25 EVP_MD_xof.c Compute a digest using the SHAKE256 XOF
26 EVP_f_md.c Compute a digest using BIO and EVP_f_md
72 EVP_EC_Signature_demo.c Compute and verify an EC signature.
73 EVP_DSA_Signature_demo.c Compute and verify a DSA signature.
74 EVP_ED_Signature_demo.c Compute and verify an ED25519 signature.
75 rsa_pss_direct.c Compute and verify an RSA-PSS signature from a hash
76 rsa_pss_hash.c Compute and verify an RSA-PSS signature over a buffer
/freebsd/sys/contrib/device-tree/Bindings/misc/
H A Dqcom,fastrpc.yaml68 "(compute-)?cb@[0-9]*$":
72 Each subnode of the Fastrpc represents compute context banks available on the dsp.
76 const: qcom,fastrpc-compute-cb
129 compute-cb@1 {
130 compatible = "qcom,fastrpc-compute-cb";
135 compute-cb@2 {
136 compatible = "qcom,fastrpc-compute-cb";
141 compute-cb@3 {
142 compatible = "qcom,fastrpc-compute-cb";
H A Dqcom,fastrpc.txt40 = COMPUTE BANKS
41 Each subnode of the Fastrpc represents compute context banks available
43 - All Compute context banks MUST contain the following properties:
48 Definition: must be "qcom,fastrpc-compute-cb"
77 compatible = "qcom,fastrpc-compute-cb";
82 compatible = "qcom,fastrpc-compute-cb";
/freebsd/crypto/libecc/src/sig/
H A Decgdsa.c99 *| UF 1. Compute h = H(m). If |h| > bitlen(q), set h to bitlen(q)
101 *| F 2. Compute e = - OS2I(h) mod q
103 *| F 4. Compute W = (W_x,W_y) = kG
104 *| F 5. Compute r = W_x mod q
106 *| F 7. Compute s = x(kr + e) mod q
172 /* 1. Compute h = H(m) */ in _ecgdsa_sign_update()
241 /* 1. Compute h = H(m) */ in _ecgdsa_sign_finalize()
265 * 2. Convert h to an integer and then compute e = -h mod q, in _ecgdsa_sign_finalize()
266 * i.e. compute e = - OS2I(h) mod q in _ecgdsa_sign_finalize()
268 * Because we only support positive integers, we compute in _ecgdsa_sign_finalize()
[all …]
H A Decrdsa.c129 *| UF 1. Compute h = H(m)
131 *| F 3. Compute W = (W_x,W_y) = kG
132 *| F 4. Compute r = W_x mod q
134 *| F 6. Compute e = OS2I(h) mod q. If e is 0, set e to 1.
138 *| F 7. Compute s = (rx + ke) mod q
273 /* 3. Compute W = kG = (Wx, Wy) */ in _ecrdsa_sign_finalize()
284 /* 4. Compute r = Wx mod q */ in _ecrdsa_sign_finalize()
297 /* 6. Compute e = OS2I(h) mod q. If e is 0, set e to 1. */ in _ecrdsa_sign_finalize()
324 /* Compute s = (rx + ke) mod q */ in _ecrdsa_sign_finalize()
404 *| F 2. Compute h = H(m)
[all …]
H A Decdsa_common.c88 /* We compute bits2octets(hash) here */ in __ecdsa_rfc6979_nonce()
110 /* We compute bits2octets(hash) here */ in __ecdsa_rfc6979_nonce()
125 * 3. Compute: in __ecdsa_rfc6979_nonce()
131 * Otherwise, compute: in __ecdsa_rfc6979_nonce()
231 *| UF 1. Compute h = H(m)
236 *| F 5. Compute W = (W_x,W_y) = kG
237 *| F 6. Compute r = W_x mod q
240 *| F 9. Compute s = k^-1 * (xr + e) mod q
309 /* 1. Compute h = H(m) */ in __ecdsa_sign_update()
382 /* 1. Compute h = H(m) */ in __ecdsa_sign_finalize()
[all …]
H A Dsm2.c113 * Helper to compute Z from user ID, curve parameters, public key and hash
229 *| F 2. Compute H = h(M1)
231 *| F 4. Compute W = (W_x,W_y) = kG
232 *| F 5. Compute r = (OS2I(H) + Wx) mod q
235 *| F 8. Compute s = ((1 + x)^(-1) * (k - rx)) mod q
269 /* Compute Z from the ID */ in _sm2_sign_init()
301 /* 1. Compute h = H(m) */ in _sm2_sign_update()
363 /* 2. Compute H = h(M1) */ in _sm2_sign_finalize()
381 /* 4. Compute W = (W_x,W_y) = kG */ in _sm2_sign_finalize()
392 /* 5. Compute r = (OS2I(H) + Wx) mod q */ in _sm2_sign_finalize()
[all …]
H A Decfsdsa.c90 *| I 2. Compute W = (W_x,W_y) = kG
91 *| I 3. Compute r = FE2OS(W_x)||FE2OS(W_y)
93 *| IUF 5. Compute h = H(r||m)
94 *| F 6. Compute e = OS2I(h) mod q
95 *| F 7. Compute s = (k + ex) mod q
175 /* 2. Compute W = (W_x,W_y) = kG */ in _ecfsdsa_sign_init()
187 /* 3. Compute r = FE2OS(W_x)||FE2OS(W_y) */ in _ecfsdsa_sign_init()
201 /* 5. Compute h = H(r||m). in _ecfsdsa_sign_init()
245 /* 5. Compute h = H(r||m) */ in _ecfsdsa_sign_update()
310 /* 5. Compute h = H(r||m) */ in _ecfsdsa_sign_finalize()
[all …]
H A Deckcdsa.c176 *| IUF 1. Compute h = H(z||m)
181 *| F 4. Compute W = (W_x,W_y) = kG
182 *| F 5. Compute r = H(FE2OS(W_x)).
186 *| F 7. Compute e = OS2I(r XOR h) mod q
187 *| F 8. Compute s = x(k - e) mod q
226 * 1. Compute h = H(z||m) in _eckcdsa_sign_init()
228 * We first need to compute z, the certificate data that will be in _eckcdsa_sign_init()
282 /* 1. Compute h = H(z||m) */ in _eckcdsa_sign_update()
356 /* 1. Compute h = H(z||m) */ in _eckcdsa_sign_finalize()
394 /* 4. Compute W = (W_x,W_y) = kG */ in _eckcdsa_sign_finalize()
[all …]
H A Dfuzzing_ecdsa.c92 /* 1. Compute h = H(m) */ in ecdsa_sign_raw()
121 * 3. Compute e = OS2I(h) mod q, i.e. by converting h to an in ecdsa_sign_raw()
158 /* 5. Compute W = (W_x,W_y) = kG */ in ecdsa_sign_raw()
169 /* 6. Compute r = W_x mod q */ in ecdsa_sign_raw()
202 /* 9. Compute s = k^-1 * (xr + e) mod q */ in ecdsa_sign_raw()
209 /* In case of blinding, we compute (b*k)^-1, and in ecdsa_sign_raw()
214 /* Compute k^-1 mod q */ in ecdsa_sign_raw()
319 /* 2. Compute h = H(m) */ in ecdsa_verify_raw()
350 * 4. Compute e = OS2I(h) mod q, by converting h to an integer in ecdsa_verify_raw()
364 /* Compute s^-1 mod q */ in ecdsa_verify_raw()
[all …]
H A Decsdsa_common.c105 *| I 2. Compute W = kG = (Wx, Wy)
106 *| IUF 3. Compute r = H(Wx [|| Wy] || m)
109 *| F 4. Compute e = OS2I(r) mod q
111 *| F 6. Compute s = (k + ex) mod q.
193 /* 2. Compute W = kG = (Wx, Wy). */ in __ecsdsa_sign_init()
204 * 3. Compute r = H(Wx [|| Wy] || m) in __ecsdsa_sign_init()
257 /* 3. Compute r = H(Wx [|| Wy] || m) */ in __ecsdsa_sign_update()
314 /* 3. Compute r = H(Wx [|| Wy] || m) */ in __ecsdsa_sign_finalize()
322 /* 4. Compute e = OS2I(r) mod q */ in __ecsdsa_sign_finalize()
340 /* 6. Compute s = (k + ex) mod q. */ in __ecsdsa_sign_finalize()
[all …]
/freebsd/crypto/libecc/scripts/
H A Dexpand_libecc.py64 Compute montgomery coeff r, r^2 and mpinv. pbitlen is the size
75 Compute division coeffs p_normalized, p_shift and p_reciprocal.
479 # *| UF 1. Compute h = H(m)
484 # *| F 5. Compute W = (W_x,W_y) = kG
485 # *| F 6. Compute r = W_x mod q
488 # *| F 9. Compute s = k^-1 * (xr + e) mod q
500 # Compute the hash
527 # *| UF 2. Compute h = H(m)
530 # *| F 4. Compute e = OS2I(h) mod q
531 # *| F 5. Compute u = (s^-1)e mod q
[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()
63 * Compute the maximum factor length, in words. in br_rsa_i15_private()
84 * Compute signature length (in bytes). in br_rsa_i15_private()
108 * Compute the modulus (product of the two factors), to compare in br_rsa_i15_private()
145 * Compute s2 = x^dq mod q. in br_rsa_i15_private()
154 * Compute s1 = x^dq mod q. in br_rsa_i15_private()
163 * Compute: in br_rsa_i15_private()
184 * h is now in t2. We compute the final result: in br_rsa_i15_private()
H A Drsa_i31_priv.c45 * Compute the actual lengths of p and q, in bytes. in br_rsa_i31_private()
63 * Compute the maximum factor length, in words. in br_rsa_i31_private()
85 * Compute modulus length (in bytes). in br_rsa_i31_private()
102 * Compute the modulus (product of the two factors), to compare in br_rsa_i31_private()
139 * Compute s2 = x^dq mod q. in br_rsa_i31_private()
148 * Compute s1 = x^dp mod p. in br_rsa_i31_private()
157 * Compute: in br_rsa_i31_private()
178 * h is now in t2. We compute the final result: in br_rsa_i31_private()
H A Drsa_i62_priv.c47 * Compute the actual lengths of p and q, in bytes. in br_rsa_i62_private()
65 * Compute the maximum factor length, in words. in br_rsa_i62_private()
87 * Compute signature length (in bytes). in br_rsa_i62_private()
104 * Compute the modulus (product of the two factors), to compare in br_rsa_i62_private()
141 * Compute s2 = x^dq mod q. in br_rsa_i62_private()
150 * Compute s1 = x^dp mod p. in br_rsa_i62_private()
159 * Compute: in br_rsa_i62_private()
180 * h is now in t2. We compute the final result: in br_rsa_i62_private()
/freebsd/contrib/bearssl/src/ec/
H A Dec_prime_i31.c215 * Compute z^2 (in t1).
220 * Compute x-z^2 (in t2) and then x+z^2 (in t1).
227 * Compute m = 3*(x+z^2)*(x-z^2) (in t1).
235 * Compute s = 4*x*y^2 (in t2) and 2*y^2 (in t3).
243 * Compute x' = m^2 - 2*s.
250 * Compute z' = 2*y*z.
257 * Compute y' = m*(s - x') - 8*y^4. Note that we already have
321 * Compute u1 = x1*z2^2 (in t1) and s1 = y1*z2^3 (in t3).
329 * Compute u2 = x2*z1^2 (in t2) and s2 = y2*z1^3 (in t4).
337 * Compute h = u2 - u1 (in t2) and r = s2 - s1 (in t4).
[all …]
H A Dec_prime_i15.c216 * Compute z^2 (in t1).
221 * Compute x-z^2 (in t2) and then x+z^2 (in t1).
228 * Compute m = 3*(x+z^2)*(x-z^2) (in t1).
236 * Compute s = 4*x*y^2 (in t2) and 2*y^2 (in t3).
244 * Compute x' = m^2 - 2*s.
251 * Compute z' = 2*y*z.
258 * Compute y' = m*(s - x') - 8*y^4. Note that we already have
322 * Compute u1 = x1*z2^2 (in t1) and s1 = y1*z2^3 (in t3).
330 * Compute u2 = x2*z1^2 (in t2) and s2 = y2*z1^3 (in t4).
338 * Compute h = u2 - u1 (in t2) and r = s2 - s1 (in t4).
[all …]
/freebsd/sys/contrib/openzfs/config/
H A Dpo.m4143 # Compute POFILES
145 # Compute UPDATEPOFILES
147 # Compute DUMMYPOFILES
149 # Compute GMOFILES
211 [# Capture the value of obsolete ALL_LINGUAS because we need it to compute
214 # Capture the value of LINGUAS because we need it to compute CATALOGS.
301 # Compute POTFILES_DEPS as
321 # Compute POFILES
323 # Compute UPDATEPOFILES
325 # Compute DUMMYPOFILES
[all …]
/freebsd/lib/msun/man/
H A Dcomplex.385 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
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A DOpenACCKinds.h29 // Compute Constructs.
65 // Procedure Calls in Compute Regions.
208 /// 'async' clause, allowed on Compute, Data, 'update', 'wait', and Combined
211 /// 'attach' clause, allowed on Compute and Combined constructs, plus 'data'
220 /// 'copy' clause, allowed on Compute and Combined Constructs, plus 'data' and
227 /// 'copyin' clause, allowed on Compute and Combined constructs, plus 'data',
235 /// 'copyout' clause, allowed on Compute and Combined constructs, plus 'data',
243 /// 'create' clause, allowed on Compute and Combined constructs, plus 'data',
264 /// 'deviceptr' clause, allowed on Compute and Combined Constructs, plus
269 /// 'device_type' clause, allowed on Compute, 'data', 'init', 'shutdown',
[all …]
/freebsd/contrib/mtree/
H A Dcrc.c112 * 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
136 COMPUTE(thecrc, *p); in crc()
137 COMPUTE(crctot, *p); in crc()
141 COMPUTE(thecrc, *p); in crc()
151 COMPUTE(thecrc, len & 0xff); in crc()
152 COMPUTE(crctot, len & 0xff); in crc()
156 COMPUTE(thecrc, len & 0xff); in crc()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDelinearization.h29 /// 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
64 /// accesses, and compute in step 2 a unique array shape. This guarantees
86 /// 2. Compute the array size: sort and unique them
97 /// 3. Compute the access function
/freebsd/sys/compat/linuxkpi/common/src/
H A Dlinux_siphash.c116 * siphash_1u64 - compute 64-bit siphash PRF value of a u64
132 * siphash_2u64 - compute 64-bit siphash PRF value of 2 u64
153 * siphash_3u64 - compute 64-bit siphash PRF value of 3 u64
180 * siphash_4u64 - compute 64-bit siphash PRF value of 4 u64
318 * hsiphash_1u32 - compute 64-bit hsiphash PRF value of a u32
331 * hsiphash_2u32 - compute 32-bit hsiphash PRF value of 2 u32
348 * hsiphash_3u32 - compute 32-bit hsiphash PRF value of 3 u32
368 * hsiphash_4u32 - compute 32-bit hsiphash PRF value of 4 u32
462 * hsiphash_1u32 - compute 32-bit hsiphash PRF value of a u32
477 * hsiphash_2u32 - compute 32-bit hsiphash PRF value of 2 u32
[all …]
/freebsd/crypto/libecc/src/fp/
H A Dfp_montgomery.c22 /* Compute out = in1 + in2 mod p in the Montgomery form.
33 /* Compute out = in1 - in2 mod p in the Montgomery form.
44 /* Compute out = in1 * in2 mod p in the Montgomery form.
55 /* Compute out = in * in mod p in the Montgomery form.
67 * Compute out such that in1 = out * in2 mod p in the Montgomery form.

12345678910>>...89