/external/srec/srec/cfront/ |
himul32.h | 46 asm PINLINE int32 himul32(asr_int32_t factor1, asr_int32_T factor2) 49 reg factor2; local 51 mulhw r3, factor1, factor2 # place the high order 32 bits of the product in the return register r3 60 floor( (factor1 * factor2) / 2**32 ) 66 factor2 -- second signed 32 bit integer 76 PINLINE asr_int32_t himul32(asr_int32_t factor1, asr_int32_t factor2) 89 imul factor2 97 PINLINE asr_int32_t himul32(asr_int32_t factor1, asr_int32_t factor2) 110 __int64 y = factor2; 121 PINLINE asr_int32_t himul32(asr_int32_t factor1, asr_int32_t factor2) [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
CubicIntersection_Test.cpp | 543 double factor2 = calc2 / delta2; local 545 " factor2=%1.9g\n", __FUNCTION__, test, 546 calc1, delta1, factor1, calc2, delta2, factor2); 555 if (factor2 < largestFactor) { 556 SkDebugf("WE HAVE A WINNER! %1.9g\n", factor2); 561 largestFactor = factor2;
|
/external/skia/experimental/Intersection/ |
CubicIntersection_Test.cpp | 543 double factor2 = calc2 / delta2; local 545 " factor2=%1.9g\n", __FUNCTION__, test, 546 calc1, delta1, factor1, calc2, delta2, factor2); 555 if (factor2 < largestFactor) { 556 SkDebugf("WE HAVE A WINNER! %1.9g\n", factor2); 561 largestFactor = factor2;
|
/external/chromium_org/v8/tools/ |
run-deopt-fuzzer.py | 102 def __init__(self, factor1=2.0, factor2=0.2): 104 self._factor2 = factor2 177 result.add_option("--distribution-factor2", help=("Factor of the second " 257 print ("Distribution factor2 %s is out of range. Defaulting to 0.0"
|
/external/chromium_org/third_party/webrtc/modules/audio_processing/ns/ |
ns_core.c | 1049 float energy1, energy2, gain, factor, factor1, factor2; local [all...] |
/external/webrtc/src/modules/audio_processing/ns/ |
ns_core.c | 729 float energy1, energy2, gain, factor, factor1, factor2; local [all...] |
/external/opencv/cxcore/src/ |
cxdxt.cpp | 742 int p, q, factor2 = (factor - 1)/2; 745 CvComplex64f* b = buf + factor2; 757 for( p = 1, k = nx; p <= factor2; p++, k += nx ) 774 for( p = 1, k = nx; p <= factor2; p++, k += nx, d += dw ) 795 for( p = 1, k = nx; p <= factor2; p++, k += nx ) 800 for( q = 0; q < factor2; q++ ) [all...] |