/external/pixman/test/ |
H A D | prng-test.c | 62 double t1, t2; local 68 t1 = gettime(); 73 (double)BUFSIZE * N / 1000000. / (t2 - t1)); 75 t1 = gettime(); 80 (double)BUFSIZE * N / 1000000. / (t2 - t1)); 82 t1 = gettime(); 89 (double)BUFSIZE * N / 1000000. / (t2 - t1)); 91 t1 = gettime(); 98 (double)BUFSIZE * N / 1000000. / (t2 - t1));
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/x86/ |
H A D | x86SP_FFT_CToC_FC32_Fwd_Radix4_ms.c | 32 OMX_FC32 t1; local 48 // CSUB t1, in0, in2 49 t1.Re = in0[0] - in2[0]; 50 t1.Im = in0[n] - in2[n]; 68 // CSUB_ADD_X out3, t1, t3 69 out3[0] = t1.Re - t3.Im; 70 out3[n] = t1.Im + t3.Re; 72 // CADD_SUB_X out1, t1, t3 73 out1[0] = t1.Re + t3.Im; 74 out1[n] = t1 87 OMX_FC32 t1; local [all...] |
H A D | x86SP_FFT_CToC_FC32_Inv_Radix4_ms.c | 32 OMX_FC32 t1; local 48 // CSUB t1, in0, in2 49 t1.Re = in0[0] - in2[0]; 50 t1.Im = in0[n] - in2[n]; 68 // CSUB_ADD_X out1, t1, t3 69 out1[0] = t1.Re - t3.Im; 70 out1[n] = t1.Im + t3.Re; 72 // CADD_SUB_X out3, t1, t3 73 out3[0] = t1.Re + t3.Im; 74 out3[n] = t1 87 OMX_FC32 t1; local [all...] |
/external/openssl/crypto/sha/asm/ |
H A D | sha256-armv4.pl | 43 $len="r2"; $t1="r2"; 67 @ ldr $t1,[$inp],#4 @ $i 74 rev $t1,$t1 76 @ ldrb $t1,[$inp,#3] @ $i 80 orr $t1,$t1,$t2,lsl#8 82 orr $t1,$t1,$t0,lsl#16 87 orr $t1, [all...] |
/external/chromium_org/third_party/sqlite/src/test/ |
H A D | randexpr1.tcl | 27 {t1.a $a} 28 {t1.b $b} 29 {t1.c $c} 30 {t1.d $d} 31 {t1.e $e} 32 {t1.f $f} 61 {(select AGG from t1)} 65 {coalesce((select max(EXPR) from t1 where BOOL),EXPR)} 69 {coalesce((select EXPR from t1 where BOOL),EXPR)} 101 {EXPR in (select EXPR from t1 unio [all...] |
/external/chromium_org/sync/internal_api/public/util/ |
H A D | immutable.h | 206 static void Swap(T* t1, T* t2) { argument 210 swap(*t1, *t2); 218 static void Swap(T* t1, T* t2) { argument 219 t1->swap(*t2); 227 static void Swap(T* t1, T* t2) { argument 228 t1->Swap(t2);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsCubic.h | 66 SkDCubic subDivide(double t1, double t2) const; 68 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) { argument 71 return cubic.subDivide(t1, t2); 74 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const; 76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1, argument 80 cubic.subDivide(a, d, t1, t2, p);
|
/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
H A D | lattice_mips.c | 34 int32_t r0, r1, r2, t0, t1, t2, t_ar; local 57 "mul %[t1], %[r1], %[t_ar] \n\t" 61 "addu %[t1], %[t1], %[r0] \n\t" 63 "shra_r.w %[t1], %[t1], 15 \n\t" 66 "addiu %[t1], %[t1], 0x4000 \n\t" 67 "sra %[t1], %[t1], 1 140 int t0, t1, t2, t3; local [all...] |
/external/libcxx/test/thread/futures/futures.shared_future/ |
H A D | wait.pass.cpp | 54 Clock::time_point t1 = Clock::now(); local 56 assert(t1-t0 < ms(5)); 68 Clock::time_point t1 = Clock::now(); local 70 assert(t1-t0 < ms(5)); 82 Clock::time_point t1 = Clock::now(); local 84 assert(t1-t0 < ms(5));
|
H A D | wait_for.pass.cpp | 59 Clock::time_point t1 = Clock::now(); local 61 assert(t1-t0 < ms(5)); 75 Clock::time_point t1 = Clock::now(); local 77 assert(t1-t0 < ms(5)); 91 Clock::time_point t1 = Clock::now(); local 93 assert(t1-t0 < ms(5));
|
/external/libcxx/test/thread/futures/futures.unique_future/ |
H A D | wait.pass.cpp | 54 Clock::time_point t1 = Clock::now(); local 56 assert(t1-t0 < ms(5)); 68 Clock::time_point t1 = Clock::now(); local 70 assert(t1-t0 < ms(5)); 82 Clock::time_point t1 = Clock::now(); local 84 assert(t1-t0 < ms(5));
|
H A D | wait_for.pass.cpp | 59 Clock::time_point t1 = Clock::now(); local 61 assert(t1-t0 < ms(50)); 75 Clock::time_point t1 = Clock::now(); local 77 assert(t1-t0 < ms(50)); 91 Clock::time_point t1 = Clock::now(); local 93 assert(t1-t0 < ms(50));
|
/external/skia/src/pathops/ |
H A D | SkPathOpsCubic.h | 66 SkDCubic subDivide(double t1, double t2) const; 68 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) { argument 71 return cubic.subDivide(t1, t2); 74 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const; 76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1, argument 80 cubic.subDivide(a, d, t1, t2, p);
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreeWizard.java | 328 * structure and token types in t1. Check text if the pattern has 332 protected boolean _parse(Object t1, TreePattern tpattern, Map labels) { argument 334 if ( t1==null || tpattern==null ) { 339 if ( adaptor.getType(t1) != tpattern.getType() ) return false; 341 if ( tpattern.hasTextArg && !adaptor.getText(t1).equals(tpattern.getText()) ) { 346 // map label in pattern to node in t1 347 labels.put(tpattern.label, t1); 350 int n1 = adaptor.getChildCount(t1); 356 Object child1 = adaptor.getChild(t1, i); 385 /** Compare t1 an 394 equals(Object t1, Object t2, TreeAdaptor adaptor) argument 401 equals(Object t1, Object t2) argument 405 _equals(Object t1, Object t2, TreeAdaptor adaptor) argument [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicSubDivide.cpp | 11 Given a cubic c, t1, and t2, find a small cubic segment. 14 s1 = 1 - t1 16 A = c[0]*s1*s1*s1 + 3*c[1]*s1*s1*t1 + 3*c[2]*s1*t1*t1 + c[3]*t1*t1*t1 20 First, compute two reference T values 1/3 and 2/3 from t1 to t2: 22 c(at (2*t1 67 sub_divide(const Cubic& src, double t1, double t2, Cubic& dst) argument 93 sub_divide(const Cubic& src, const _Point& a, const _Point& d, double t1, double t2, _Point dst[2]) argument [all...] |
/external/skia/experimental/Intersection/ |
H A D | CubicSubDivide.cpp | 11 Given a cubic c, t1, and t2, find a small cubic segment. 14 s1 = 1 - t1 16 A = c[0]*s1*s1*s1 + 3*c[1]*s1*s1*t1 + 3*c[2]*s1*t1*t1 + c[3]*t1*t1*t1 20 First, compute two reference T values 1/3 and 2/3 from t1 to t2: 22 c(at (2*t1 67 sub_divide(const Cubic& src, double t1, double t2, Cubic& dst) argument 93 sub_divide(const Cubic& src, const _Point& a, const _Point& d, double t1, double t2, _Point dst[2]) argument [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsQuadLineIntersectionTest.cpp | 134 SkDPoint t1 = quad.ptAtT(tt1); local 138 if (!t1.approximatelyEqual(t2)) { 139 SkDebugf("%s [%d,%d] x!= t1=%1.9g (%1.9g,%1.9g) t2=%1.9g (%1.9g,%1.9g)\n", 140 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY); 143 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0]) 145 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) { 146 SkDebugf("%s t1=(%1.9g,%1.9g)\n", __FUNCTION__, t1.fX, t1 [all...] |
/external/chromium_org/v8/src/ic/mips/ |
H A D | access-compiler-mips.cc | 27 static Register registers[] = {receiver, name, a3, a0, t0, t1}; 37 static Register registers[] = {receiver, name, a3, t0, t1};
|
/external/chromium_org/v8/test/webkit/ |
H A D | closure-inside-extra-arg-call.js | 49 function t1() { function 54 t1();
|
/external/clang/test/CodeGen/ |
H A D | ms_struct-bitfield-1.c | 10 } ATTR t1; variable in typeref:struct:__anon18666 11 static int a1[(sizeof(t1) == 8) -1];
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_bvgraph.h | 53 t1.copyFrom(from); 54 while (!t1.empty()) { 55 uptr node = t1.getAndClearFirstOne(); 89 t1.copyFrom(from); 90 while (!t1.empty()) { 91 uptr idx = t1.getAndClearFirstOne(); 112 BV &to_visit = t1, 160 BV t1, t2; member in class:__sanitizer::BVGraph
|
/external/compiler-rt/lib/tsan/tests/rtl/ |
H A D | tsan_test.cc | 21 ScopedThread t1, t2; local 23 t1.Write1(l);
|
/external/libcxx/test/containers/sequences/array/ |
H A D | front_back.pass.cpp | 54 constexpr T t1 = c.front(); local 55 static_assert (t1 == 1, "");
|
H A D | indexing.pass.cpp | 52 constexpr T t1 = c[0]; local 53 static_assert (t1 == 1, "");
|
/external/libcxx/test/thread/thread.condition/ |
H A D | notify_all_at_thread_exit.pass.cpp | 40 Clock::time_point t1 = Clock::now(); local 41 assert(t1-t0 > ms(250));
|