| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| remove_if.pass.cpp | 31 const T t2[] = {5, 5, 5}; local
33 C c2(std::begin(t2), std::end(t2));
50 const T t2[] = {5, 5, 5}; local
52 C c2(std::begin(t2), std::end(t2));
68 const T t2[] = {5, 5, 5}; local
70 C c2(std::begin(t2), std::end(t2));
79 const T t2[] = {5, 5, 5} local
98 const T t2[] = {5, 5, 5}; local
116 const T t2[] = {5, 5, 5}; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_time.h | 71 * Return t2 = t1 + usecs
77 struct util_time *t2)
79 t2->counter = t1->counter + usecs;
89 const struct util_time *t2)
91 return t2->counter - t1->counter;
103 const struct util_time *t2)
105 if (t1->counter < t2->counter)
107 else if(t1->counter > t2->counter)
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_time.h | 71 * Return t2 = t1 + usecs
77 struct util_time *t2)
79 t2->counter = t1->counter + usecs;
89 const struct util_time *t2)
91 return t2->counter - t1->counter;
103 const struct util_time *t2)
105 if (t1->counter < t2->counter)
107 else if(t1->counter > t2->counter)
|
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| calc_cor.cpp | 228 Word32 t2; local
238 t2 = 0;
249 t2 = amrnb_fxp_mac_16_by_16bb((Word32) * (p), (Word32) * (p1), t2);
254 t2 = amrnb_fxp_mac_16_by_16bb((Word32) * (p), (Word32) * (p1), t2);
260 *(corr++) = t2 << 1;
|
| /external/eigen/test/ |
| zerosized.cpp | 40 MatrixType t2(0, 0);
41 VERIFY(t2.rows() == 0);
42 VERIFY(t2.cols() == 0);
44 zeroReduction(t2);
45 VERIFY(t1==t2);
58 VectorType t2(DenseIndex(0)); // DenseIndex disambiguates with 0-the-null-pointer (error with gcc 4.4 and MSVC8)
59 VERIFY(t2.size() == 0);
60 zeroReduction(t2);
62 VERIFY(t1==t2);
|
| /external/valgrind/main/coregrind/ |
| m_vki.c | 106 vki_sigaction_toK_t t2; local
109 vg_assert(sizeof(t1.sa_handler) == sizeof(t2.ksa_handler));
110 vg_assert(sizeof(t1.sa_tramp) == sizeof(t2.sa_tramp));
111 vg_assert(sizeof(t1.sa_mask) == sizeof(t2.sa_mask));
112 vg_assert(sizeof(t1.sa_flags) == sizeof(t2.sa_flags));
117 vg_assert(offsetof(t1,sa_handler) == offsetof(t2.ksa_handler));
118 vg_assert(offsetof(t1.sa_tramp) == offsetof(t2.sa_tramp));
119 vg_assert(offsetof(t1.sa_mask) == offsetof(t2.sa_mask));
120 vg_assert(offsetof(t1.sa_flags) == offsetof(t2.sa_flags));
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| k_logf.h | 29 float hfsq,s,z,R,w,t1,t2; local
35 t2= z*(Lg1+w*Lg3);
36 R = t2+t1;
|
| /external/libcxx/test/input.output/stream.buffers/streambuf/streambuf.protected/streambuf.assign/ |
| swap.pass.cpp | 66 test<char> t2; local
67 swap(t2, t);
71 test<wchar_t> t2; local
72 swap(t2, t);
79 test<char> t2; local
80 swap(t2, t);
87 test<wchar_t> t2; local
88 swap(t2, t);
93 test<char> t2; local
94 swap(t2, t)
98 test<wchar_t> t2; local
[all...] |
| /ndk/sources/android/support/src/msun/ |
| k_logf.h | 29 float hfsq,s,z,R,w,t1,t2; local
35 t2= z*(Lg1+w*Lg3);
36 R = t2+t1;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/stream.buffers/streambuf/streambuf.protected/streambuf.assign/ |
| swap.pass.cpp | 66 test<char> t2; local
67 swap(t2, t);
71 test<wchar_t> t2; local
72 swap(t2, t);
79 test<char> t2; local
80 swap(t2, t);
87 test<wchar_t> t2; local
88 swap(t2, t);
93 test<char> t2; local
94 swap(t2, t)
98 test<wchar_t> t2; local
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkQuarticRoot.h | 10 int SkReducedQuarticRoots(const double t4, const double t3, const double t2, const double t1,
|
| /external/chromium_org/third_party/skia/tests/ |
| TypefaceTest.cpp | 14 SkAutoTUnref<SkTypeface> t2(SkTypeface::RefDefault(SkTypeface::kNormal));
16 REPORTER_ASSERT(reporter, SkTypeface::Equal(t1.get(), t2.get()));
18 REPORTER_ASSERT(reporter, SkTypeface::Equal(0, t2.get()));
20 REPORTER_ASSERT(reporter, SkTypeface::Equal(t2.get(), 0));
|
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
| p7-0x-fixits.cpp | 22 struct {T t;} t2 = {700}; local
|
| /external/clang/test/CXX/except/except.spec/ |
| template.cpp | 9 void (*t2)() throw() = &f1<0>; // expected-error {{not superset}} variable
|
| /external/clang/test/CodeGen/ |
| ms_struct-bitfield-init.c | 32 } ATTR t2 = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i'}; variable in typeref:struct:__anon22489
58 if (sizeof(t2) != 9)
60 if (t2.bar0 != 'a' || t2.bar8 != 'i')
|
| vla-4.c | 13 void t2() { function
|
| /external/clang/test/Sema/ |
| attr-returns-twice.c | 10 void t2() __attribute__((returns_twice(2))); // expected-error {{'returns_twice' attribute takes no arguments}}
|
| /external/skia/src/pathops/ |
| SkQuarticRoot.h | 10 int SkReducedQuarticRoots(const double t4, const double t3, const double t2, const double t1,
|
| /external/skia/tests/ |
| TypefaceTest.cpp | 14 SkAutoTUnref<SkTypeface> t2(SkTypeface::RefDefault(SkTypeface::kNormal));
16 REPORTER_ASSERT(reporter, SkTypeface::Equal(t1.get(), t2.get()));
18 REPORTER_ASSERT(reporter, SkTypeface::Equal(0, t2.get()));
20 REPORTER_ASSERT(reporter, SkTypeface::Equal(t2.get(), 0));
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| QuadraticSubDivide.cpp | 12 Given a quadratic q, t1, and t2, find a small quadratic segment.
18 To find B, compute the point halfway between t1 and t2:
20 q(at (t1 + t2)/2) == D
42 void sub_divide(const Quadratic& src, double t1, double t2, Quadratic& dst) {
45 double dx = interp_quad_coords(&src[0].x, (t1 + t2) / 2);
46 double dy = interp_quad_coords(&src[0].y, (t1 + t2) / 2);
47 double cx = dst[2].x = interp_quad_coords(&src[0].x, t2);
48 double cy = dst[2].y = interp_quad_coords(&src[0].y, t2);
53 _Point sub_divide(const Quadratic& src, const _Point& a, const _Point& c, double t1, double t2) {
55 double dx = interp_quad_coords(&src[0].x, (t1 + t2) / 2)
[all...] |
| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_flist.pass.cpp | 22 const T t2[] = {10, 11, 12, 13, 14, 15}; variable
24 const int size_t2 = std::end(t2) - std::begin(t2);
35 assert(*i == t2[n2]);
51 C c2(t2, t2+l);
67 C c2(t2, t2+l);
|
| /external/libcxx/test/utilities/time/time.point/time.point.comparisons/ |
| op_equal.fail.cpp | 35 typedef std::chrono::time_point<Clock2, Duration2> T2;
38 T2 t2(Duration2(3000));
39 t1 == t2; local
|
| op_less.fail.cpp | 43 typedef std::chrono::time_point<Clock2, Duration2> T2;
46 T2 t2(Duration2(3000));
47 t1 < t2;
|
| /external/qemu/include/exec/ |
| def-helper.h | 122 #define DEF_HELPER_2(name, ret, t1, t2) \
123 DEF_HELPER_FLAGS_2(name, 0, ret, t1, t2)
124 #define DEF_HELPER_3(name, ret, t1, t2, t3) \
125 DEF_HELPER_FLAGS_3(name, 0, ret, t1, t2, t3)
126 #define DEF_HELPER_4(name, ret, t1, t2, t3, t4) \
127 DEF_HELPER_FLAGS_4(name, 0, ret, t1, t2, t3, t4)
128 #define DEF_HELPER_5(name, ret, t1, t2, t3, t4, t5) \
129 DEF_HELPER_FLAGS_5(name, 0, ret, t1, t2, t3, t4, t5)
144 #define DEF_HELPER_FLAGS_2(name, flags, ret, t1, t2) \
145 dh_ctype(ret) HELPER(name) (dh_ctype(t1), dh_ctype(t2));
[all...] |
| /external/skia/experimental/Intersection/ |
| QuadraticSubDivide.cpp | 12 Given a quadratic q, t1, and t2, find a small quadratic segment.
18 To find B, compute the point halfway between t1 and t2:
20 q(at (t1 + t2)/2) == D
42 void sub_divide(const Quadratic& src, double t1, double t2, Quadratic& dst) {
45 double dx = interp_quad_coords(&src[0].x, (t1 + t2) / 2);
46 double dy = interp_quad_coords(&src[0].y, (t1 + t2) / 2);
47 double cx = dst[2].x = interp_quad_coords(&src[0].x, t2);
48 double cy = dst[2].y = interp_quad_coords(&src[0].y, t2);
53 _Point sub_divide(const Quadratic& src, const _Point& a, const _Point& c, double t1, double t2) {
55 double dx = interp_quad_coords(&src[0].x, (t1 + t2) / 2)
[all...] |
