/freebsd-src/sys/contrib/device-tree/Bindings/misc/ |
H A D | qcom,fastrpc.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) 3 --- 5 $schema: http://devicetree.org/meta-schema [all...] |
H A D | qcom,fastrpc.txt | 3 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-src/crypto/openssl/demos/ |
H A D | README.txt | 18 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-src/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | KnownBits.h | 1 //===- llvm/Support/KnownBits.h - Stores known zeros/ones -------*- [all...] |
/freebsd-src/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | OpenACCKinds.h | 1 //===--- OpenACCKinds.h - OpenACC Enums ------ [all...] |
/freebsd-src/contrib/bearssl/src/rsa/ |
H A D | rsa_i15_priv.c | 45 * 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 D | rsa_i31_priv.c | 45 * 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 D | rsa_i62_priv.c | 30 #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-src/lib/msun/man/ |
H A D | complex.3 | 64 .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 …]
|
H A D | log.3 | 1 .\" Copyright (c) 2008-2010 David Schultz <das@FreeBSD.org> 76 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 110 An attempt to take the logarithm of \*(Pm0 results in a divide-by-zero 111 exception, and -\*(If is returned. 135 .St -isoC-99 .
|
H A D | j0.3 | 80 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 127 is negative, including -\*(If, these routines will generate an invalid 132 will generate a divide-by-zero exception and return -\*(If. 141 will generate an overflow exception and return -\*(If. 154 .St -p1003.1-2001 .
|
/freebsd-src/contrib/bearssl/src/ec/ |
H A D | ec_prime_i31.c | 122 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 D | ec_prime_i15.c | 29 * - 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 …]
|
H A D | ec_p256_m62.c | 75 * A field element is encoded as five 64-bit integers, in basis 2^52. 79 * - top limb is less than 2^48 + 2^30 80 * - the other limbs fit on 53 bits each 85 #define MASK48 (BIT(48) - BIT(0)) 86 #define MASK52 (BIT(52) - BIT(0)) 94 /* Curve equation is y^2 = x^3 - 3*x + B. This constant is B*R mod p 145 w = a[1] - (s << 44); in f256_partial_reduce() 147 cc = -(w >> 52) & 0xFFF; /* cc < 16 */ in f256_partial_reduce() 148 w = a[2] - cc; in f256_partial_reduce() 151 w = a[3] - cc - (s << 36); in f256_partial_reduce() [all …]
|
H A D | ec_p256_m64.c | 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 116 * Fold carry t, using: 2^256 = 2^224 - 2^192 - 2^96 + 1 mod p. in f256_add() 120 w = (unsigned __int128)d[1] + (w >> 64) - (t << 32); in f256_add() 122 /* Here, carry "w >> 64" can only be 0 or -1 */ in f256_add() 123 w = (unsigned __int128)d[2] - ((w >> 64) & 1); in f256_add() 125 /* Again, carry is 0 or -1. But there can be carry only if t = 1, in f256_add() 126 in which case the addition of (t << 32) - t is positive. */ in f256_add() 127 w = (unsigned __int128)d[3] - ((w >> 64) & 1) + (t << 32) - t; in f256_add() [all …]
|
/freebsd-src/sys/contrib/openzfs/config/ |
H A D | po.m4 | 1 # 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-src/sys/contrib/device-tree/Bindings/arm/bcm/ |
H A D | bcm2835.yaml | 1 # SPDX-License-Identifier: GPL-2.0 3 --- 5 $schema: http://devicetree.org/meta-schemas/core.yaml# 10 - Eric Anholt <eric@anholt.net> 11 - Stefan Wahren <wahrenst@gmx.net> 18 - descriptio [all...] |
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | Delinearization.h | 1 //===---- Delinearization.h - MultiDimensional Index Delinearization ----- [all...] |
/freebsd-src/contrib/mtree/ |
H A D | crc.c | 3 /*- 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-src/contrib/bearssl/inc/ |
H A D | bearssl_aead.h | 51 * - A symmetric key. Exact size depends on the AEAD algorithm. 53 * - A nonce (IV). Size depends on the AEAD algorithm; for most 58 * - Data to encrypt and protect. 60 * - Additional authenticated data, which is covered by the MAC but 77 * - `br_xxx_init()` 85 * - `br_xxx_reset()` 90 * - `br_xxx_aad_inject()` 95 * - `br_xxx_flip()` 101 * - `br_xxx_run()` 107 * - `br_xxx_get_tag()` [all …]
|
/freebsd-src/sys/contrib/device-tree/Bindings/interconnect/ |
H A D | qcom,rpmh.yaml | 1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause) 3 --- 5 $schema: http://devicetree.org/meta-schemas/core.yaml# 7 title: Qualcomm RPMh Network-O [all...] |
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | CalcSpillWeights.h | 1 //===- lib/CodeGen/CalcSpillWeights.h ---------------------------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 64 /// (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/contrib/llvm-project/llvm/include/llvm/MCA/ |
H A D | CodeEmitter.h | 1 //===--------------------- CodeEmitter.h ------------------------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 10 /// 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 14 //===----------------------------------------------------------------------===// 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/usr.bin/cksum/ |
H A D | crc.c | 1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 98 * 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 119 for (len += nr, p = buf; nr--; ++p) { in crc() 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/lib/libcalendar/ |
H A D | calendar.c | 1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 63 * Compute the Julian date from the number of days elapsed since 73 * Compute the year by starting with an approximation not smaller in jdate() 81 idt.y--; in jdate() 84 * Set r to the days left in the year and compute the month by in jdate() 88 r = ndays - r; in jdate() 89 for (idt.m = 11; month1[idt.m] > r; idt.m--) in jdate() 92 /* Compute the days left in the month */ in jdate() 93 idt.d = r - month1[idt.m]; in jdate() [all …]
|