Home
last modified time | relevance | path

Searched refs:factor1 (Results 1 – 7 of 7) sorted by relevance

/external/llvm/test/Transforms/Reassociate/
Dprev_insts_canonicalized.ll8 ; CHECK-NEXT: %factor1 = mul i32 %in, 2
10 ; CHECK-NEXT: %_5 = add i32 %_3, %factor1
/external/webrtc/webrtc/modules/audio_processing/ns/
Dns_core.c1192 float energy1, energy2, gain, factor, factor1, factor2; in WebRtcNs_ProcessCore() local
1318 factor1 = 1.f; in WebRtcNs_ProcessCore()
1326 factor1 = 1.f + 1.3f * (gain - B_LIM); in WebRtcNs_ProcessCore()
1327 if (gain * factor1 > 1.f) { in WebRtcNs_ProcessCore()
1328 factor1 = 1.f / gain; in WebRtcNs_ProcessCore()
1341 factor = self->priorSpeechProb * factor1 + in WebRtcNs_ProcessCore()
/external/libxcam/modules/ocl/
Dcl_newtonemapping_handler.cpp114 float factor1 = y_max1 / (max1_log - t1_log + 0.001f); in block_split_haleq() local
137 int index = (int)((log(r + t1) - t1_log) * factor1 + 0.5f); in block_split_haleq()
/external/freetype/src/psaux/
Dpsintrp.c1951 CF2_F16Dot16 factor1; in cf2_interpT2CharString() local
1959 factor1 = cf2_stack_popFixed( opStack ); in cf2_interpT2CharString()
1962 FT_MulFix( factor1, factor2 ) ); in cf2_interpT2CharString()
2238 CF2_F16Dot16 factor1; in cf2_interpT2CharString() local
2245 factor1 = cf2_stack_popFixed( opStack ); in cf2_interpT2CharString()
2248 FT_MulFix( factor1, factor2 ) ); in cf2_interpT2CharString()
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/
Dmulvi32.ll64 …%factor1 = shufflevector <2 x i32> %1, <2 x i32> undef, <4 x i32> <i32 0, i32 undef, i32 2, i32 un…
65 …%product64 = call <2 x i64> @llvm.x86.sse2.pmulu.dq(<4 x i32> %factor0, <4 x i32> %factor1) readno…
/external/mesa3d/src/gallium/drivers/swr/rasterizer/core/
Dformat_types.h819 static const float factor1 = exp2(127.0f * expden / expnum - 127.0f)
823 simd16scalar result = _simd16_mul_ps(value, _simd16_set1_ps(factor1));
/external/v8/src/objects/
Dbigint.cc132 static bool ProductGreaterThan(digit_t factor1, digit_t factor2, digit_t high,
1564 bool MutableBigInt::ProductGreaterThan(digit_t factor1, digit_t factor2, in ProductGreaterThan() argument
1567 digit_t result_low = digit_mul(factor1, factor2, &result_high); in ProductGreaterThan()