Searched refs:reduction (Results 1 - 18 of 18) sorted by relevance

/freebsd-13-stable/lib/msun/tests/
H A Dtrig_test.c115 ATF_TC(reduction); variable
116 ATF_TC_HEAD(reduction, tc)
120 "tests to ensure argument reduction for large arguments is accurate");
122 ATF_TC_BODY(reduction, tc)
279 ATF_TP_ADD_TC(tp, reduction);
/freebsd-13-stable/sys/opencrypto/
H A Dgfmult.c121 * These are the reduction values. Since we are dealing with bit reversed
125 static uint16_t reduction[] = { variable
155 x.v[0] ^= (uint64_t)reduction[redbits] << (64 - 16);
204 x.v[0] ^= (uint64_t)reduction[redbits] << (64 - 16);
/freebsd-13-stable/sys/crypto/openssl/arm/
H A Dghashv8-armx.S81 .byte 0x26,0x4e,0xe0,0xf2 @ pmull q10,q0,q11 @ 1st phase of reduction
87 vext.8 q10,q0,q0,#8 @ 2nd phase of reduction
171 .byte 0x26,0x4e,0xe0,0xf2 @ pmull q10,q0,q11 @ 1st phase of reduction
184 vext.8 q10,q0,q0,#8 @ 2nd phase of reduction
211 .byte 0x26,0x4e,0xe0,0xf2 @ pmull q10,q0,q11 @ 1st phase of reduction
217 vext.8 q10,q0,q0,#8 @ 2nd phase of reduction
H A Dpoly1305-armv4.S464 @ lazy reduction as discussed in "NEON crypto" by D.J. Bernstein
502 @ This means that result of reduction have to be compressed upon
503 @ loop wrap-around. This can be done in the process of reduction
778 @ doesn't depend on reduction in previous iteration.
876 @ lazy reduction interleaved with base 2^32 -> base 2^26 of
1046 @ lazy reduction, but without narrowing
H A Decp_nistz256-armv4.S2871 @ multiplication-less reduction 1
2924 @ multiplication-less reduction 2
2977 @ multiplication-less reduction 3
3030 @ multiplication-less reduction 4
3083 @ multiplication-less reduction 5
3136 @ multiplication-less reduction 6
3189 @ multiplication-less reduction 7
3242 @ last multiplication-less reduction
/freebsd-13-stable/crypto/openssl/crypto/modes/asm/
H A Dghashv8-armx.pl28 # Implement 2x aggregated reduction [see ghash-x86.pl for background
33 # AArch64 register bank to "accommodate" 4x aggregated reduction and
223 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
229 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
340 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
353 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
383 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
389 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
498 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
511 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
[all...]
H A Dghash-c64xplus.pl74 SHL $E10000,16,$E10000 ; [pre-shifted] reduction polynomial
102 SHL $E10000,16,$E10000 ; [pre-shifted] reduction polynomial
/freebsd-13-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_itt.h70 // wait time value, reduction -if this is a reduction barrier
74 kmp_uint64 reduction);
H A Dkmp_settings.cpp1707 kmp_stg_fr_data_t *reduction = (kmp_stg_fr_data_t *)data; local
1710 rc = __kmp_stg_check_rivals(name, value, reduction->rivals);
1714 if (reduction->force) {
1741 kmp_stg_fr_data_t *reduction = (kmp_stg_fr_data_t *)data; local
1742 if (reduction->force) {
/freebsd-13-stable/contrib/llvm-project/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/
H A DRenderScriptRuntime.cpp836 // resolve reduction names.
850 for (const auto &reduction : module_desc->m_reductions) {
851 if (reduction.m_reduce_name != m_reduce_name)
855 {{reduction.m_init_name, eKernelTypeInit},
856 {reduction.m_accum_name, eKernelTypeAccum},
857 {reduction.m_comb_name, eKernelTypeComb},
858 {reduction.m_outc_name, eKernelTypeOutC},
859 {reduction.m_halter_name, eKernelTypeHalter}}};
879 LLDB_LOGF(log, "%s: %s reduction breakpoint on %s in %s",
2877 // The list of reduction kernel
[all...]
/freebsd-13-stable/crypto/openssl/crypto/poly1305/asm/
H A Dpoly1305-armv4.pl533 @ lazy reduction as discussed in "NEON crypto" by D.J. Bernstein
571 @ This means that result of reduction have to be compressed upon
572 @ loop wrap-around. This can be done in the process of reduction
847 @ doesn't depend on reduction in previous iteration.
945 @ lazy reduction interleaved with base 2^32 -> base 2^26 of
1115 @ lazy reduction, but without narrowing
H A Dpoly1305-c64xplus.pl235 SHRU $H4,2,B16 ; last reduction step
H A Dpoly1305-armv8.pl167 and $t0,$d2,#-4 // final reduction
252 and $t0,$d2,#-4 // final reduction
547 // doesn't depend on reduction in previous iteration.
686 // lazy reduction as discussed in "NEON crypto" by D.J. Bernstein
830 // lazy reduction, but without narrowing
H A Dpoly1305-sparcv9.pl254 srl $h4,2,$t0 ! final reduction step
350 srlx $D2,2,$T0 ! final reduction step
/freebsd-13-stable/crypto/openssl/crypto/ec/asm/
H A Decp_nistz256-armv4.pl638 @ multiplication-less reduction $i
696 @ last multiplication-less reduction
1009 vadd.u64 @AxB[1]#lo,@AxB[1]#lo,$temp @ reduction
1034 vadd.u64 @AxB[1]#lo,@AxB[1]#lo,$temp @ last reduction
H A Decp_nistz256-sparcv9.pl258 ! multiplication-less reduction
317 addcc @acc[3],$t0,@acc[3] ! multiplication-less reduction
1657 ! b[4] is accessed as 4-0-12-8-20-16-28-24. And prior reduction we
H A Decp_nistz256-armv8.pl455 // last reduction
1439 lsl $t0,$t4,#32 // last reduction
/freebsd-13-stable/sys/contrib/openzfs/module/icp/asm-x86_64/modes/
H A Dghash-x86_64.S52 # reduction_alg9, increase reduction aggregate factor to 4x. As for
56 # processing and reduction. "On top" of this we lay down aggregated
80 # ... 8x aggregate factor AVX code path is using reduction algorithm

Completed in 201 milliseconds