Home
last modified time | relevance | path

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

12345678910>>...95

/freebsd-src/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
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-src/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-src/contrib/llvm-project/llvm/include/llvm/Support/
H A DKnownBits.h319 /// Compute known bits resulting from adding LHS, RHS and a 1-bit Carry. in commonBits()
323 /// Compute known bits resulting from adding LHS and RHS. in haveNoCommonBitsSet()
327 /// Compute known bits results from subtracting RHS from LHS with 1-bit
332 /// Compute knownbits resulting from llvm.sadd.sat(LHS, RHS)
335 /// Compute knownbits resulting from llvm.uadd.sat(LHS, RHS)
338 /// Compute knownbits resulting from llvm.ssub.sat(LHS, RHS)
341 /// Compute knownbits resulting from llvm.usub.sat(LHS, RHS)
344 /// Compute knownbits resulting from APIntOps::avgFloorS
347 /// Compute knownbits resulting from APIntOps::avgFloorU
350 /// Compute knownbit
[all...]
/freebsd-src/contrib/llvm-project/clang/include/clang/Basic/
H A DOpenACCKinds.h26 // 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
198 /// 'attach' clause, allowed on Compute and Combined constructs, plus 'data'
207 /// 'deviceptr' clause, allowed on Compute and Combined Constructs, plus
219 /// 'no_create' clause, allowed on allowed on Compute and Combined constructs,
222 /// 'present' clause, allowed on Compute and Combined constructs, plus 'data'
228 /// 'copyout' clause, allowed on Compute an
[all...]
/freebsd-src/contrib/bearssl/src/rsa/
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_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_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-src/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
H A Dlog.376 functions compute the natural logarithm of
84 functions compute the logarithm base 10 of
91 compute the logarithm base 2 of
99 functions compute the natural logarithm of
H A Dj0.380 compute the Bessel function of the first kind of orders
87 compute the Bessel function of the first kind of the integer order
98 compute the linearly independent Bessel function of the second kind
107 compute the Bessel function of the second kind for the integer order
/freebsd-src/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 …]
H A Dec_p256_m62.c170 * We compute d = 2^13*p + a - b; this ensures a positive in f256_sub()
267 * The operations below compute: in f256_montymul()
348 * The operations below compute: in f256_montymul()
485 * We compute a^(p-2) mod p. The exponent pattern (from high to in f256_invert()
550 * We compute t = r + (2^256 - p) = r + 2^224 - 2^192 - 2^96 + 1. in f256_final_reduce()
732 /* Compute affine coordinates x (in t1) and y (in t2). */ in point_encode()
780 * Compute z^2 in t1. in p256_double()
785 * Compute x-z^2 in t2 and x+z^2 in t1. in p256_double()
791 * Compute 3*(x+z^2)*(x-z^2) in t1. in p256_double()
798 * Compute 4*x*y^2 (in t2) and 2*y^2 (in t3). in p256_double()
[all …]
H A Dec_p256_m64.c270 * p = -1 mod 2^64, we can compute f = d[0] + a[u]*b[0] mod 2^64. in f256_montymul()
373 * p = -1 mod 2^64, we can compute f = d[0] + a[u]*b[0] mod 2^64. in f256_montymul()
548 * We compute a^(p-2) mod p. The exponent pattern (from high to in f256_invert()
742 /* Compute affine coordinates x (in t1) and y (in t2). */ in point_encode()
801 * Compute z^2 in t1. in p256_double()
806 * Compute x-z^2 in t2 and x+z^2 in t1. in p256_double()
812 * Compute 3*(x+z^2)*(x-z^2) in t1. in p256_double()
819 * Compute 4*x*y^2 (in t2) and 2*y^2 (in t3). in p256_double()
827 * Compute x' = m^2 - 2*s. in p256_double()
834 * Compute z' = 2*y*z. in p256_double()
[all …]
/freebsd-src/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-src/sys/contrib/openzfs/config/
H A Dpo.m4142 # Compute POFILES
144 # Compute UPDATEPOFILES
146 # Compute DUMMYPOFILES
148 # Compute GMOFILES
210 [# Capture the value of obsolete ALL_LINGUAS because we need it to compute
213 # Capture the value of LINGUAS because we need it to compute CATALOGS.
300 # Compute POTFILES_DEPS as
320 # Compute POFILES
322 # Compute UPDATEPOFILES
324 # Compute DUMMYPOFILES
[all …]
/freebsd-src/sys/contrib/device-tree/Bindings/arm/bcm/
H A Dbcm2835.yaml22 - raspberrypi,4-compute-module
41 - raspberrypi,compute-module
58 - raspberrypi,3-compute-module
59 - raspberrypi,3-compute-module-lite
/freebsd-src/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-src/contrib/bearssl/inc/
H A Dbearssl_aead.h109 * Compute the authentication tag. All message data (encrypted or
256 * \brief Compute authentication tag.
258 * Compute the AEAD authentication tag. The tag length depends
269 * `check_tag()` function may be used to compute and check the
280 * \brief Compute and check authentication tag.
299 * \brief Compute authentication tag (with truncation).
314 * \brief Compute and check authentication tag (with truncation).
455 * \brief Compute GCM authentication tag.
457 * Compute the GCM authentication tag. The tag is a 16-byte value which
467 * compute and check the tag value.
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DCalcSpillWeights.h64 /// (re)compute li's spill weight and allocation hint.
67 /// Compute spill weights and allocation hints for all virtual register
85 /// (Re)compute LI's spill weight and allocation hint, or, for non null
86 /// start and end - compute future expected spill weight of a split
88 /// \param LI The live interval for which to compute the weight.
/freebsd-src/sys/contrib/device-tree/Bindings/interconnect/
H A Dqcom,rpmh.yaml30 - qcom,sc7180-compute-noc
42 - qcom,sc8180x-compute-noc
75 - qcom,sm8150-compute-noc
84 - qcom,sm8250-compute-noc
101 - qcom,sm8350-compute-noc
/freebsd-src/usr.bin/cksum/
H A Dcrc.c98 * Compute a POSIX 1003.2 checksum. This routine has been broken out so that
114 #define COMPUTE(var, ch) (var) = (var) << 8 ^ crctab[(var) >> 24 ^ (ch)] in crc() macro
120 COMPUTE(lcrc, *p); in crc()
121 COMPUTE(crc_total, *p); in crc()
130 COMPUTE(lcrc, len & 0xff); in crc()
131 COMPUTE(crc_total, len & 0xff); in crc()
/freebsd-src/contrib/llvm-project/llvm/include/llvm/MCA/
H A DCodeEmitter.h10 /// A utility class used to compute instruction encodings. It buffers encodings
11 /// for later usage. It exposes a simple API to compute and get the encodings as
30 /// A utility class used to compute instruction encodings for a code region.
32 /// It provides a simple API to compute and return instruction encodings as
/freebsd-src/lib/libcalendar/
H A Dcalendar.c63 * Compute the Julian date from the number of days elapsed since
73 * Compute the year by starting with an approximation not smaller in jdate()
84 * Set r to the days left in the year and compute the month by in jdate()
92 /* Compute the days left in the month */ in jdate()
126 * Compute the date according to the Gregorian calendar from the number of
138 * Compute the year by starting with an approximation not smaller in gdate()
149 * Set ndays to the number of days left and compute by linear in gdate()
228 * Compute the week number from the number of days since March 1st year 0.

12345678910>>...95