Searched defs:t1 (Results 176 - 200 of 736) sorted by relevance

1234567891011>>

/external/libcxx/test/thread/thread.threads/thread.thread.class/thread.thread.assign/
H A Dmove.pass.cpp66 std::thread t1; local
67 t1 = std::move(t0);
68 assert(t1.get_id() == id);
70 t1.join();
77 std::thread t1; local
78 t0 = std::move(t1);
/external/libcxx/test/thread/thread.threads/thread.thread.class/thread.thread.constr/
H A Dcopy.fail.cpp59 std::thread t1 = t0; local
60 assert(t1.get_id() == id);
62 t1.join();
H A Dmove.pass.cpp60 std::thread t1 = std::move(t0); local
61 assert(t1.get_id() == id);
63 t1.join();
/external/libcxx/test/thread/thread.threads/thread.thread.class/thread.thread.member/
H A Dget_id.pass.cpp48 std::thread t1; local
49 std::thread::id id1 = t1.get_id();
51 assert(t1.get_id() == std::thread::id());
H A Dswap.pass.cpp48 std::thread t1; local
49 std::thread::id id1 = t1.get_id();
50 t0.swap(t1);
52 assert(t1.get_id() == id0);
53 t1.join();
/external/libcxx/test/utilities/tuple/tuple.tuple/tuple.assign/
H A Dconvert_move.pass.cpp43 T1 t1; local
44 t1 = std::move(t0);
45 assert(std::get<0>(t1) == 2);
51 T1 t1; local
52 t1 = std::move(t0);
53 assert(std::get<0>(t1) == 2);
54 assert(std::get<1>(t1) == int('a'));
60 T1 t1; local
61 t1 = std::move(t0);
62 assert(std::get<0>(t1)
82 T1 t1; local
[all...]
H A Dmove_pair.pass.cpp43 T1 t1; local
44 t1 = std::move(t0);
45 assert(std::get<0>(t1) == 2);
46 assert(std::get<1>(t1)->id_ == 3);
/external/libcxx/test/utilities/tuple/tuple.tuple/tuple.cnstr/
H A Dconvert_copy.pass.cpp59 T1 t1 = t0; local
60 assert(std::get<0>(t1) == 2);
67 constexpr T1 t1 = t0; local
68 static_assert(std::get<0>(t1) == 2, "");
74 constexpr T1 t1{t0};
75 static_assert(std::get<0>(t1) == C(2), "");
82 T1 t1 = t0; local
83 assert(std::get<0>(t1) == 2);
84 assert(std::get<1>(t1) == int('a'));
90 T1 t1 local
100 T1 t1 = t0; local
[all...]
/external/libcxxabi/test/
H A Dtest_demangle.cpp29672 Clock::time_point t1 = Clock::now(); local
[all...]
/external/libvpx/libvpx/vp8/common/x86/
H A Dloopfilter_block_sse2.asm112 paddsb %5, [GLOBAL(t1)]
808 t1: label
/external/llvm/unittests/Support/
H A DManagedStatic.cpp50 pthread_t t1, t2; local
51 pthread_create(&t1, &a1, test1::helper, nullptr);
53 pthread_join(t1, nullptr);
/external/openssl/crypto/dh/
H A Ddh_gen.c122 BIGNUM *t1,*t2; local
129 t1 = BN_CTX_get(ctx);
131 if (t1 == NULL || t2 == NULL) goto err;
144 if (!BN_set_word(t1,24)) goto err;
151 if (!BN_set_word(t1,12)) goto err;
158 if (!BN_set_word(t1,10)) goto err;
170 if (!BN_set_word(t1,2)) goto err;
175 if(!BN_generate_prime_ex(ret->p,prime_len,1,t1,t2,cb)) goto err;
/external/qemu/distrib/sdl-1.2.15/test/
H A Dtesttimer.c30 SDL_TimerID t1, t2, t3; local
63 t1 = SDL_AddTimer(100, callback, (void*)1);
64 if(!t1)
78 SDL_RemoveTimer(t1);
/external/skia/src/pathops/
H A DSkPathOpsLine.h23 static SkDLine SubDivide(const SkPoint a[2], double t1, double t2) { argument
26 return line.subDivide(t1, t2);
39 SkDLine subDivide(double t1, double t2) const;
/external/valgrind/main/memcheck/tests/
H A Dorigin2-not-quite.c16 __attribute__((noinline)) int t1(void);
25 x += t1();
32 __attribute__((noinline)) int t1(void) function
/external/chromium_org/sync/api/attachments/
H A Dattachment_id.cc35 sync_pb::AttachmentIdProto* t1,
37 t1->Swap(t2);
34 Swap( sync_pb::AttachmentIdProto* t1, sync_pb::AttachmentIdProto* t2) argument
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_time.h71 * Return t2 = t1 + usecs
75 util_time_add(const struct util_time *t1, argument
79 t2->counter = t1->counter + usecs;
88 util_time_diff(const struct util_time *t1, argument
91 return t2->counter - t1->counter;
102 _util_time_compare(const struct util_time *t1, argument
105 if (t1->counter < t2->counter)
107 else if(t1->counter > t2->counter)
/external/chromium_org/third_party/modp_b64/
H A Dmodp_b64.cc86 uint8_t t1, t2, t3; local
90 t1 = str[i]; t2 = str[i+1]; t3 = str[i+2];
91 *p++ = e0[t1];
92 *p++ = e1[((t1 & 0x03) << 4) | ((t2 >> 4) & 0x0F)];
102 t1 = str[i];
103 *p++ = e0[t1];
104 *p++ = e1[(t1 & 0x03) << 4];
109 t1 = str[i]; t2 = str[i+1];
110 *p++ = e0[t1];
111 *p++ = e1[((t1
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/src/x86/
H A Dx86SP_FFT_CToC_FC32_Inv_Radix4_fs.c32 OMX_FC32 t1; local
40 // CSUB t1, in0, in2
41 t1.Re = in0[0] - in2[0];
42 t1.Im = in0[n] - in2[n];
60 // CSUB_ADD_X out1, t1, t3
61 out1[0] = t1.Re - t3.Im;
62 out1[n] = t1.Im + t3.Re;
64 // CADD_SUB_X out3, t1, t3
65 out3[0] = t1.Re + t3.Im;
66 out3[n] = t1
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DQuadraticSubDivide.cpp12 Given a quadratic q, t1, and t2, find a small quadratic segment.
15 A = c[0]*(1 - t1)*(1 - t1) + 2*c[1]*t1*(1 - t1) + c[2]*t1*t1
16 C = c[3]*(1 - t1)*(1 - t1) + 2*c[2]*t1*(
42 sub_divide(const Quadratic& src, double t1, double t2, Quadratic& dst) argument
53 sub_divide(const Quadratic& src, const _Point& a, const _Point& c, double t1, double t2) argument
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsQuad.h49 SkDQuad subDivide(double t1, double t2) const;
50 static SkDQuad SubDivide(const SkPoint a[3], double t1, double t2) { argument
53 return quad.subDivide(t1, t2);
55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const;
57 double t1, double t2) {
60 return quad.subDivide(a, c, t1, t2);
56 SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c, double t1, double t2) argument
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Dstack_trace_table_test.cc43 tcmalloc::StackTrace t1; local
44 t1.size = static_cast<uintptr_t>(1024);
45 t1.depth = static_cast<uintptr_t>(2);
46 t1.stack[0] = reinterpret_cast<void*>(1);
47 t1.stack[1] = reinterpret_cast<void*>(2);
56 // Table w/ just t1
57 AddTrace(&table, t1);
63 // Table w/ t1, t2
64 AddTrace(&table, t1);
71 // Table w/ 2 x t1,
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
H A Dstack_trace_table_test.cc43 tcmalloc::StackTrace t1; local
44 t1.size = static_cast<uintptr_t>(1024);
45 t1.depth = static_cast<uintptr_t>(2);
46 t1.stack[0] = reinterpret_cast<void*>(1);
47 t1.stack[1] = reinterpret_cast<void*>(2);
56 // Table w/ just t1
57 AddTrace(&table, t1);
63 // Table w/ t1, t2
64 AddTrace(&table, t1);
71 // Table w/ 2 x t1,
[all...]
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/
H A Dcross_correlation_mips.c21 int32_t t0 = 0, t1 = 0, t2 = 0, t3 = 0, sum = 0; local
43 "lh %[t1], 0(%[pseq2]) \n\t"
46 "mul %[t0], %[t0], %[t1] \n\t"
71 "lh %[t1], 0(%[pseq2]) \n\t"
74 "mul %[t0], %[t0], %[t1] \n\t"
86 "lh %[t1], 0(%[pseq2]) \n\t"
87 "mul %[t0], %[t0], %[t1] \n\t"
96 : [step_seq2] "+r" (step_seq2), [t0] "=&r" (t0), [t1] "=&r" (t1),
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-binop.js144 function t1(a, b) {return a-b} function
145 assertEquals(t1(1,2), 1-2);
146 assertEquals(t1(2,true), 2-1);
147 assertEquals(t1(false,2), 0-2);
148 assertEquals(t1(1,2.4), 1-2.4);
149 assertEquals(t1(1.3,2.4), 1.3-2.4);
150 assertEquals(t1(true,2.4), 1-2.4);
151 assertEquals(t1(1,undefined), 1-NaN);
152 assertEquals(t1(1,1<<30), 1-(1<<30));
153 assertEquals(t1(
[all...]

Completed in 2353 milliseconds

1234567891011>>