/external/chromium_org/third_party/skia/src/core/ |
SkCubicClipper.cpp | 42 SkScalar t0; local 47 t0 = t1; 48 SkScalar y01 = SkScalarInterp(ycrv[0], ycrv[1], t0); 49 SkScalar y12 = SkScalarInterp(ycrv[1], ycrv[2], t0); 50 SkScalar y23 = SkScalarInterp(ycrv[2], ycrv[3], t0); 51 SkScalar y012 = SkScalarInterp(y01, y12, t0); 52 SkScalar y123 = SkScalarInterp(y12, y23, t0); 53 SkScalar y0123 = SkScalarInterp(y012, y123, t0); 61 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe
|
/external/regex-re2/util/ |
benchmark.cc | 36 static int64 t0; variable 44 if(t0 != 0) 45 ns += nsec() - t0; 46 t0 = 0; 50 if(t0 == 0) 51 t0 = nsec(); 70 t0 = nsec(); 79 if(t0 != 0) 80 ns += nsec() - t0;
|
/external/skia/src/core/ |
SkCubicClipper.cpp | 42 SkScalar t0; local 47 t0 = t1; 48 SkScalar y01 = SkScalarInterp(ycrv[0], ycrv[1], t0); 49 SkScalar y12 = SkScalarInterp(ycrv[1], ycrv[2], t0); 50 SkScalar y23 = SkScalarInterp(ycrv[2], ycrv[3], t0); 51 SkScalar y012 = SkScalarInterp(y01, y12, t0); 52 SkScalar y123 = SkScalarInterp(y12, y23, t0); 53 SkScalar y0123 = SkScalarInterp(y012, y123, t0); 61 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe
|
/external/chromium_org/third_party/openssl/openssl/crypto/sha/asm/ |
sha512-ia64.pl | 121 s0=r26; s1=r27; t0=r28; t1=r29; 197 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32); 217 mux2 $t0=A,0x44 };; // copy lower half to upper 224 $t0="A", $t1="E", $code.=<<___ if ($BITS==64); 467 _rotr r10=$t0,$Sigma0[0] } // ROTR(a,28) 471 _rotr r11=$t0,$Sigma0[1] } // ROTR(a,34) 475 _rotr r8=$t0,$Sigma0[2] } // ROTR(a,39) 507 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32) [all...] |
sha1-mips.pl | 24 ($zero,$at,$t0,$t1,$t2)=map("\$$_",(0..2,24,25)); 33 # - copy return value to $t0, former $v0 [or to $a0 if you're adapting 41 # ($t0,$t1,$t2,$t3,$t8,$t9)=map("\$$_",(12..15,24,25)); 89 $t0="\$25"; 98 srl $t0,@X[$i],24 # byte swap($i) 104 or @X[$i],$t0 110 sll $t0,$a,5 # $i 114 addu $e,$t0 115 xor $t0,$c,$d 118 and $t0,$ [all...] |
/external/openssl/crypto/sha/asm/ |
sha512-ia64.pl | 121 s0=r26; s1=r27; t0=r28; t1=r29; 197 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32); 217 mux2 $t0=A,0x44 };; // copy lower half to upper 224 $t0="A", $t1="E", $code.=<<___ if ($BITS==64); 467 _rotr r10=$t0,$Sigma0[0] } // ROTR(a,28) 471 _rotr r11=$t0,$Sigma0[1] } // ROTR(a,34) 475 _rotr r8=$t0,$Sigma0[2] } // ROTR(a,39) 507 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32) [all...] |
sha1-mips.pl | 24 ($zero,$at,$t0,$t1,$t2)=map("\$$_",(0..2,24,25)); 33 # - copy return value to $t0, former $v0 [or to $a0 if you're adapting 41 # ($t0,$t1,$t2,$t3,$t8,$t9)=map("\$$_",(12..15,24,25)); 89 $t0="\$25"; 98 srl $t0,@X[$i],24 # byte swap($i) 104 or @X[$i],$t0 110 sll $t0,$a,5 # $i 114 addu $e,$t0 115 xor $t0,$c,$d 118 and $t0,$ [all...] |
/frameworks/av/media/libstagefright/codecs/aacenc/src/asm/ARMV5E/ |
Radix4FFT_v5.s | 61 smulwt r4, r10, r8 @ L_mpy_wx(cosx, t0) 64 smlawb r2, r11, r8, r4 @ r2 = L_mpy_wx(cosx, t0) + L_mpy_wx(sinx, t1)@ 65 smulwb r5, r10, r8 @ L_mpy_wx(sinx, t0) 67 mov r10, r0, asr #2 @ t0 = r0 >> 2@ 70 sub r3, r3, r5 @ r3 = L_mpy_wx(cosx, t1) - L_mpy_wx(sinx, t0)@ 73 sub r0, r10, r2 @ r0 = t0 - r2@ 76 add r2, r10, r2 @ r2 = t0 + r2@ 85 smulwt r6, r10, r8 @ L_mpy_wx(cosx, t0) 88 smlawb r4, r11, r8, r6 @ r4 = L_mpy_wx(cosx, t0) + L_mpy_wx(sinx, t1)@ 89 smulwb r7, r10, r8 @ L_mpy_wx(sinx, t0) [all...] |
/dalvik/vm/compiler/template/mips/ |
TEMPLATE_RETURN.S | 28 lw t0, offStackSaveArea_prevFrame(a0) # t0<- saveArea->prevFrame 36 lw a2, offStackSaveArea_method - sizeofStackSaveArea(t0) 48 move rFP, t0 # publish new FP 50 lw t0, offMethod_clazz(a2) # t0<- method->clazz 54 lw a0, offClassObject_pDvmDex(t0) # a0<- method->clazz->pDvmDex
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/futures/futures.shared_future/ |
wait.pass.cpp | 52 Clock::time_point t0 = Clock::now(); local 56 assert(t1-t0 < ms(5)); 66 Clock::time_point t0 = Clock::now(); local 70 assert(t1-t0 < ms(5)); 80 Clock::time_point t0 = Clock::now(); local 84 assert(t1-t0 < ms(5));
|
wait_for.pass.cpp | 57 Clock::time_point t0 = Clock::now(); local 61 assert(t1-t0 < ms(5)); 73 Clock::time_point t0 = Clock::now(); local 77 assert(t1-t0 < ms(5)); 89 Clock::time_point t0 = Clock::now(); local 93 assert(t1-t0 < ms(5));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/futures/futures.unique_future/ |
wait.pass.cpp | 52 Clock::time_point t0 = Clock::now(); local 56 assert(t1-t0 < ms(5)); 66 Clock::time_point t0 = Clock::now(); local 70 assert(t1-t0 < ms(5)); 80 Clock::time_point t0 = Clock::now(); local 84 assert(t1-t0 < ms(5));
|
wait_for.pass.cpp | 57 Clock::time_point t0 = Clock::now(); local 61 assert(t1-t0 < ms(50)); 73 Clock::time_point t0 = Clock::now(); local 77 assert(t1-t0 < ms(50)); 89 Clock::time_point t0 = Clock::now(); local 93 assert(t1-t0 < ms(50));
|
/frameworks/av/media/libstagefright/codecs/aacenc/src/asm/ARMV7/ |
Radix4FFT_v7.s | 64 VQDMULH.S32 Q10, Q2, Q14 @ MULHIGH(cosx, t0) 67 VQDMULH.S32 Q13, Q2, Q15 @ MULHIGH(sinx, t0) 69 VADD.S32 Q2, Q10, Q11 @ MULHIGH(cosx, t0) + MULHIGH(sinx, t1) 70 VSUB.S32 Q3, Q12, Q13 @ MULHIGH(cosx, t1) - MULHIGH(sinx, t0) 73 VSHR.S32 Q10, Q0, #2 @ t0 = r0 >> 2@ 76 VSUB.S32 Q0, Q10, Q2 @ r0 = t0 - r2@ 78 VADD.S32 Q2, Q10, Q2 @ r2 = t0 + r2@ 85 VQDMULH.S32 Q10, Q4, Q14 @ MULHIGH(cosx, t0) 88 VQDMULH.S32 Q13, Q4, Q15 @ MULHIGH(sinx, t0) 90 VADD.S32 Q8, Q10, Q11 @ MULHIGH(cosx, t0) + MULHIGH(sinx, t1 [all...] |
/dalvik/vm/mterp/mips/ |
OP_USHR_LONG.S | 10 GET_OPA(t0) # t3 <- AA 16 EAS2(rOBJ, rFP, t0) # rOBJ <- &fp[AA] 30 GET_INST_OPCODE(t0) # extract opcode from rINST 31 GOTO_OPCODE(t0) # jump to next instruction
|
binflopWide.S | 27 or t0, rARG2, rARG3 # second arg (a2-a3) is zero? 28 beqz t0, common_errDivideByZero 49 GET_INST_OPCODE(t0) # extract opcode from rINST 50 GOTO_OPCODE(t0) # jump to next instruction
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/ |
notify_all_at_thread_exit.pass.cpp | 38 Clock::time_point t0 = Clock::now(); local 41 assert(t1-t0 > ms(250));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.mutex/thread.lock/thread.lock.guard/ |
adopt_lock.pass.cpp | 31 time_point t0 = Clock::now(); local 38 ns d = t1 - t0 - ms(250);
|
mutex.fail.cpp | 31 time_point t0 = Clock::now(); local 37 ns d = t1 - t0 - ms(250);
|
mutex.pass.cpp | 31 time_point t0 = Clock::now(); local 37 ns d = t1 - t0 - ms(250);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.mutex/thread.lock/thread.lock.unique/thread.lock.unique.cons/ |
mutex.pass.cpp | 31 time_point t0 = Clock::now(); local 37 ns d = t1 - t0 - ms(250);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.mutex.requirements.mutex/thread.mutex.class/ |
lock.pass.cpp | 33 time_point t0 = Clock::now(); local 37 ns d = t1 - t0 - ms(250);
|
try_lock.pass.cpp | 31 time_point t0 = Clock::now(); local 39 ns d = t1 - t0 - ms(250);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.mutex.requirements.mutex/thread.mutex.recursive/ |
lock.pass.cpp | 33 time_point t0 = Clock::now(); local 39 ns d = t1 - t0 - ms(250);
|
try_lock.pass.cpp | 31 time_point t0 = Clock::now(); local 41 ns d = t1 - t0 - ms(250);
|