| /src/share/mk/ |
| bsd.buildinstall.mk | 7 # Compute a list of subdirectories delimited by .WAIT.
|
| /src/crypto/external/apache2/openssl/lib/libcrypto/arch/riscv64/ |
| aes-gcm-riscv64-zvkb-zvkg-zvkned.S | 13 # Compute the AES-GCM full-block e32 length for `LMUL=4`. We will handle
28 ## We could use vsetvli with `e32, m1` to compute the `n` number.
36 # Compute the H^n
208 # Compute AES ctr result.
244 # Compute the partial tags.
281 # Compute AES ctr ciphertext result.
402 # Compute AES ctr result.
438 # Compute the partial tags.
491 # Compute AES ctr ciphertext result.
624 # Compute AES ctr result
[all...] |
| aes-riscv64-zvbb-zvkg-zvkned.S | 80 # Compute [r-IV0*1, r-IV0*x, r-IV0*x^2, r-IV0*x^3, ...] in v16
85 # Compute [IV0*1, IV0*x, IV0*x^2, IV0*x^3, ...] in v28.
93 # We could use vsetvli with `e32, m1` to compute the `n` number.
203 # compute IV for last block
273 # Compute [r-IV0*1, r-IV0*x, r-IV0*x^2, r-IV0*x^3, ...] in v16
278 # Compute [IV0*1, IV0*x, IV0*x^2, IV0*x^3, ...] in v28.
286 # We could use vsetvli with `e32, m1` to compute the `n` number.
408 # compute IV for last block
520 # Compute [r-IV0*1, r-IV0*x, r-IV0*x^2, r-IV0*x^3, ...] in v16
525 # Compute [IV0*1, IV0*x, IV0*x^2, IV0*x^3, ...] in v28
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/src/ |
| gmock-matchers.cc | 130 ElementMatcherPairs Compute() {
229 return MaxBipartiteMatchState(g).Compute();
|
| /src/external/gpl2/gettext/dist/gettext-tools/libuniname/ |
| gen-uninames | 197 ;; Compute the word-indices for every unicode-char.
|
| /src/external/lgpl3/gmp/dist/mpn/s390_32/esame/ |
| aorslsh1_n.asm | 42 C * Compute RETVAL for sublsh1_n less stupidly
|
| /src/external/lgpl3/gmp/dist/mpn/s390_64/ |
| aorrlsh1_n.asm | 44 C * Compute RETVAL for sublsh1_n less stupidly.
|
| sublsh1_n.asm | 42 C * Compute RETVAL for sublsh1_n less stupidly
|
| /src/external/gpl3/gcc/dist/libgcc/config/sparc/ |
| lb1spc.S | 137 ! compute sign of result; if neither is negative, no problem
140 xor %o1, %o0, %g3 ! compute sign in any case
153 ! Ready to divide. Compute size of quotient; scale comparand.
176 ! Compute ITER in an unorthodox manner: know we need to shift V into
186 ! Now compute %g2.
485 ! compute sign of result; if neither is negative, no problem
499 ! Ready to divide. Compute size of quotient; scale comparand.
523 ! Compute ITER in an unorthodox manner: know we need to shift V into
533 ! Now compute %g2.
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/sparc/ |
| lb1spc.S | 137 ! compute sign of result; if neither is negative, no problem
140 xor %o1, %o0, %g3 ! compute sign in any case
153 ! Ready to divide. Compute size of quotient; scale comparand.
176 ! Compute ITER in an unorthodox manner: know we need to shift V into
186 ! Now compute %g2.
485 ! compute sign of result; if neither is negative, no problem
499 ! Ready to divide. Compute size of quotient; scale comparand.
523 ! Compute ITER in an unorthodox manner: know we need to shift V into
533 ! Now compute %g2.
|
| /src/crypto/external/apache2/openssl/dist/providers/implementations/ciphers/ |
| cipher_aes_ccm_hw_s390x.inc | 114 * En/de-crypt plain/cipher-text. Compute tag from plaintext. Returns 1 for
|
| /src/crypto/external/bsd/openssl/dist/providers/implementations/ciphers/ |
| cipher_aes_ccm_hw_s390x.inc | 114 * En/de-crypt plain/cipher-text. Compute tag from plaintext. Returns 1 for
|
| /src/external/lgpl3/gmp/dist/mpn/alpha/ev5/ |
| diveby3.asm | 81 C Compute initial l0 value
|
| /src/external/lgpl3/gmp/dist/mpn/powerpc32/ |
| divrem_2.asm | 84 C Compute di from d1
|
| /src/external/lgpl3/gmp/dist/mpn/sparc64/ultrasparc1234/ |
| add_n.asm | 38 C Compute carry-out from the most significant bits of u,v, and r, where
|
| sub_n.asm | 38 C Compute carry-out from the most significant bits of u,v, and r, where
|
| /src/external/gpl3/gcc/dist/libgcc/config/avr/ |
| lib1funcs.S | 1841 ;; T = 0: Compute Quotient in A[]
1842 ;; T = 1: Compute Remainder in A[] and shift SS one Bit left
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/avr/ |
| lib1funcs.S | 1836 ;; T = 0: Compute Quotient in A[]
1837 ;; T = 1: Compute Remainder in A[] and shift SS one Bit left
|
| /src/external/gpl3/gcc/dist/libgcc/config/arm/ |
| ieee754-df.S | 38 * from sp used to compute the CFA.
110 @ Compute exponent difference. Make largest exponent in r4,
|
| ieee754-sf.S | 36 * from sp used to compute the CFA.
82 @ Compute exponent difference. Make largest exponent in r2,
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/arm/ |
| ieee754-df.S | 38 * from sp used to compute the CFA.
110 @ Compute exponent difference. Make largest exponent in r4,
|
| ieee754-sf.S | 36 * from sp used to compute the CFA.
82 @ Compute exponent difference. Make largest exponent in r2,
|
| /src/sys/arch/m68k/060sp/dist/ |
| fplsp.s | 5582 #--Then, we need to compute A := R-P and a := r-p
6013 #--Then, we need to compute A := R-P and a := r-p
6325 #--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
6368 #--COMPUTE POLYNOMIAL
6808 # Step 5. Compute 2^(J/64)*exp(R) = 2^(J/64)*(1+p) by #
6936 # Step 5. Compute 2^(J/64)*p by #
7160 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7162 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
7323 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7325 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*
[all...] |
| fpsp.s | 5688 #--Then, we need to compute A := R-P and a := r-p
6119 #--Then, we need to compute A := R-P and a := r-p
6431 #--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
6474 #--COMPUTE POLYNOMIAL
6914 # Step 5. Compute 2^(J/64)*exp(R) = 2^(J/64)*(1+p) by #
7042 # Step 5. Compute 2^(J/64)*p by #
7266 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7268 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
7429 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7431 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*
[all...] |
| /src/external/gpl3/autoconf/dist/ |
| maint.mk | 151 # Compute and print the elapsed time for each syntax-check rule.
|
