Searched refs:t1 (Results 176 - 200 of 1138) sorted by relevance

1234567891011>>

/external/libcxx/test/utilities/tuple/tuple.tuple/tuple.cnstr/
H A Dalloc_move_pair.pass.cpp48 T1 t1(std::allocator_arg, A1<int>(5), std::move(t0));
50 assert(std::get<0>(t1) == 2);
51 assert(std::get<1>(t1)->id_ == 3);
/external/libcxx/test/utilities/tuple/tuple.tuple/tuple.creation/
H A Dmake_tuple.pass.cpp43 constexpr auto t1 = std::make_tuple(0, 1, 3.14); local
44 constexpr int i1 = std::get<1>(t1);
45 constexpr double d1 = std::get<2>(t1);
/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/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/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/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/boringssl/src/crypto/bn/
H A Dcmp.c64 BN_ULONG t1, t2, *ap, *bp; local
74 t1 = ap[i];
76 if (t1 != t2) {
77 return (t1 > t2) ? 1 : -1;
87 BN_ULONG t1, t2; local
121 t1 = a->d[i];
123 if (t1 > t2) {
125 } if (t1 < t2) {
/external/clang/test/CodeGenCXX/
H A Dmember-functions.cpp71 T t1, t2; local
74 T result = t1 + t2;
/external/clang/test/PCH/
H A Dnamespaces.cpp9 N1::t1 *ip1 = &int_val;
15 N2::t1 *fp1 = &float_val;
/external/libcxx/test/thread/thread.threads/thread.thread.this/
H A Dsleep_for.pass.cpp27 time_point t1 = Clock::now(); local
28 std::chrono::nanoseconds ns = (t1 - t0) - ms;
H A Dsleep_until.pass.cpp27 time_point t1 = Clock::now(); local
28 std::chrono::nanoseconds ns = (t1 - t0) - ms;
/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/valgrind/main/helgrind/tests/
H A Dhg02_deadlock.c7 static void *t1(void *v) function
35 pthread_create(&a, NULL, t1, NULL);
H A Dhg03_inherit.c13 static void *t1(void *v) function
44 pthread_create(&a, NULL, t1, (void *)&shared[0]);
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DQuarticRoot.cpp33 int reducedQuarticRoots(const double t4, const double t3, const double t2, const double t1, argument
42 t4, t3, t2, t1, t0);
50 || approximately_zero_when_compared_to(t4, t1)
53 && approximately_zero_when_compared_to(t4, t1)
59 || approximately_zero_when_compared_to(t3, t1)
62 && approximately_zero_when_compared_to(t3, t1)
67 bool t0Or = approximately_zero_when_compared_to(t0, t1) // 0 is one root
71 bool t0And = approximately_zero_when_compared_to(t0, t1) // 0 is one root
80 && approximately_zero_when_compared_to(t4, t1)
83 && approximately_zero_when_compared_to(t3, t1)
[all...]
/external/skia/experimental/Intersection/
H A DQuarticRoot.cpp33 int reducedQuarticRoots(const double t4, const double t3, const double t2, const double t1, argument
42 t4, t3, t2, t1, t0);
50 || approximately_zero_when_compared_to(t4, t1)
53 && approximately_zero_when_compared_to(t4, t1)
59 || approximately_zero_when_compared_to(t3, t1)
62 && approximately_zero_when_compared_to(t3, t1)
67 bool t0Or = approximately_zero_when_compared_to(t0, t1) // 0 is one root
71 bool t0And = approximately_zero_when_compared_to(t0, t1) // 0 is one root
80 && approximately_zero_when_compared_to(t4, t1)
83 && approximately_zero_when_compared_to(t3, t1)
[all...]
/external/valgrind/main/none/tests/mips32/
H A Dmips32_dsp.c327 "move $t1, %3 \n\t" \
329 "mtlo $t1, $" ac " \n\t" \
334 : "t0", "t1" \
441 "move $t1, %3 \n\t" \
443 "mtlo $t1, $" ac " \n\t" \
449 : "t0", "t1" \
557 TESTDSPINST_RD_RT_DSPC("absq_s.ph $t0, $t1", 0x00000000, t0, t1);
559 TESTDSPINST_RD_RT_DSPC("absq_s.ph $t4, $t1", 0xfabc2435, t4, t1);
[all...]
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/
H A Dassign_move.pass.cpp30 T t1[] = {10, 11, 12, 13}; local
33 C c1(I(std::begin(t1)), I(std::end(t1)), A(10));
47 T t1[] = {10, 11, 12, 13}; local
50 C c1(I(std::begin(t1)), I(std::end(t1)), A(11));
64 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; local
67 C c1(I(std::begin(t1)), I(std::end(t1)), A(10));
81 T t1[] local
99 T t1[] = {10, 11, 12, 13}; local
116 T t1[] = {10, 11, 12, 13}; local
133 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; local
150 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; local
168 T t1[] = {10, 11, 12, 13}; local
185 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; local
[all...]
/external/openssl/crypto/bn/asm/
H A Darmv4-gf2m.pl55 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12);
84 ldr $t1,[sp,$i1] @ tab[b >> 3 & 0x7]
87 eor $lo,$lo,$t1,lsl#3 @ stall
88 mov $hi,$t1,lsr#29
89 ldr $t1,[sp,$i1] @ tab[b >> 9 & 0x7]
97 eor $lo,$lo,$t1,lsl#9
98 eor $hi,$hi,$t1,lsr#23
99 ldr $t1,[sp,$i1] @ tab[b >> 15 & 0x7]
107 eor $lo,$lo,$t1,lsl#15
108 eor $hi,$hi,$t1,ls
[all...]
/external/valgrind/main/none/tests/mips64/
H A Dshift_instructions.c24 TEST2("drotr $t0, $t1, 0x00", reg_val1[i], 0x00, t0, t1);
28 TEST2("drotr $t0, $t1, 0x00", reg_val2[i], 0x00, t0, t1);
37 TEST2("drotr32 $t0, $t1, 0x00", reg_val1[i], 0x00, t0, t1);
41 TEST2("drotr32 $t0, $t1, 0x00", reg_val2[i], 0x00, t0, t1);
50 TEST1("drotrv $t0, $t1, $t2", reg_val1[i], reg_val1[N-i-1],
51 t0, t1, t
[all...]
/external/chromium_org/jingle/notifier/listener/
H A Dnotification_defines.cc26 bool ListsEqual(const T& t1, const T& t2) { argument
27 if (t1.size() != t2.size()) {
30 for (size_t i = 0; i < t1.size(); ++i) {
31 if (!t1[i].Equals(t2[i])) {
/external/chromium_org/third_party/libjpeg_turbo/
H A Drrtimer.h30 rrtimer(void) : t1(0.0)
45 t1=time();
68 return time()-t1;
76 double t1; member in class:rrtimer
/external/clang/test/CodeGen/
H A Darm-asm-diag.c9 int64x2x4_t t1(const long long a[]) { function
H A Darm-neon-misc.c14 void t1(uint64_t *src, uint8_t *dst) { function
15 // CHECK: @t1
H A Darm-vaarg-align.c9 long long t1(int i, ...) { function
10 // AAPCS: t1
11 // APCS-GNU: t1

Completed in 4960 milliseconds

1234567891011>>