Searched refs:tt1 (Results 1 - 25 of 28) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DLineCubicIntersection_Test.cpp45 double tt1 = range1[pt]; local
47 xy_at_t(cubic, tt1, tx1, ty1);
53 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
57 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
H A DQuadraticIntersection_Test.cpp36 double tt1 = intersections.fT[0][pt]; local
38 xy_at_t(quad1, tt1, tx1, ty1);
44 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
48 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
212 double tt1 = intersections2.fT[0][pt]; local
214 xy_at_t(quad1, tt1, tx1, ty1);
221 __FUNCTION__, (int)outer, (int)inner, tt1, tx1, ty1, tt2, tx2, ty2);
226 __FUNCTION__, (int)outer, (int)inner, tt1, tx1, ty1, tt2, tx2, ty2);
231 outer, inner, tt1, tx1, ty1, tt2);
267 SkDEBUGCODE(double tt1
[all...]
H A DCubicIntersection_Test.cpp46 double tt1 = tIntersections.fT[0][pt]; local
48 xy_at_t(cubic1, tt1, tx1, ty1);
54 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
58 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
232 double tt1, tt2, last = -1;
235 tt1 = intersections2.fT[0][pt1];
236 SkASSERT(!approximately_equal(last, tt1));
237 last = tt1;
238 xy_at_t(cubic1, tt1, xy1.x, xy1.y);
244 __FUNCTION__, tt1, xy
322 double tt1, tt2, last = -1; local
605 double tt1 = intersections2.fT[0][pt]; local
[all...]
H A DLineQuadraticIntersection_Test.cpp116 double tt1 = intersections.fT[0][pt]; local
117 SkASSERT(tt1 >= 0 && tt1 <= 1);
119 xy_at_t(quad, tt1, t1.x, t1.y);
125 __FUNCTION__, (int)index, pt, tt1, t1.x, t1.y, tt2, t2.x, t2.y);
130 __FUNCTION__, (int)index, pt, tt1, t1.x, t1.y, tt2, t2.x, t2.y);
/external/skia/experimental/Intersection/
H A DLineCubicIntersection_Test.cpp45 double tt1 = range1[pt]; local
47 xy_at_t(cubic, tt1, tx1, ty1);
53 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
57 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
H A DQuadraticIntersection_Test.cpp36 double tt1 = intersections.fT[0][pt]; local
38 xy_at_t(quad1, tt1, tx1, ty1);
44 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
48 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
212 double tt1 = intersections2.fT[0][pt]; local
214 xy_at_t(quad1, tt1, tx1, ty1);
221 __FUNCTION__, (int)outer, (int)inner, tt1, tx1, ty1, tt2, tx2, ty2);
226 __FUNCTION__, (int)outer, (int)inner, tt1, tx1, ty1, tt2, tx2, ty2);
231 outer, inner, tt1, tx1, ty1, tt2);
267 SkDEBUGCODE(double tt1
[all...]
H A DCubicIntersection_Test.cpp46 double tt1 = tIntersections.fT[0][pt]; local
48 xy_at_t(cubic1, tt1, tx1, ty1);
54 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
58 __FUNCTION__, (int)index, pt, tt1, tx1, ty1, tt2, tx2, ty2);
232 double tt1, tt2, last = -1;
235 tt1 = intersections2.fT[0][pt1];
236 SkASSERT(!approximately_equal(last, tt1));
237 last = tt1;
238 xy_at_t(cubic1, tt1, xy1.x, xy1.y);
244 __FUNCTION__, tt1, xy
322 double tt1, tt2, last = -1; local
605 double tt1 = intersections2.fT[0][pt]; local
[all...]
H A DLineQuadraticIntersection_Test.cpp116 double tt1 = intersections.fT[0][pt]; local
117 SkASSERT(tt1 >= 0 && tt1 <= 1);
119 xy_at_t(quad, tt1, t1.x, t1.y);
125 __FUNCTION__, (int)index, pt, tt1, t1.x, t1.y, tt2, t2.x, t2.y);
130 __FUNCTION__, (int)index, pt, tt1, t1.x, t1.y, tt2, t2.x, t2.y);
/external/chromium_org/third_party/openmax_dl/dl/sp/src/x86/
H A Dx86SP_FFT_CToC_FC32_Fwd_Radix4_ls.c30 OMX_FC32 tt1; local
44 // CMUL tt1, tw1, in1
45 tt1.Re = tw1[0] * in1[0] - tw1[n_mul_2] * in1[n];
46 tt1.Im = tw1[0] * in1[n] + tw1[n_mul_2] * in1[0];
64 // CADD t2, tt1, tt3
65 t2.Re = tt1.Re + tt3.Re;
66 t2.Im = tt1.Im + tt3.Im;
68 // CSUB t3, tt1, tt3
69 t3.Re = tt1.Re - tt3.Re;
70 t3.Im = tt1
[all...]
H A Dx86SP_FFT_CToC_FC32_Inv_Radix4_ls.c30 OMX_FC32 tt1; local
44 // CMUL tt1, Tw1, in1
45 tt1.Re = tw1[0] * in1[0] + tw1[n_mul_2] * in1[n];
46 tt1.Im = tw1[0] * in1[n] - tw1[n_mul_2] * in1[0];
64 // CADD t2, tt1, tt3
65 t2.Re = tt1.Re + tt3.Re;
66 t2.Im = tt1.Im + tt3.Im;
68 // CSUB t3, tt1, tt3
69 t3.Re = tt1.Re - tt3.Re;
70 t3.Im = tt1
[all...]
H A Dx86SP_FFT_CToC_FC32_Fwd_Radix4_ms.c90 OMX_FC32 tt1; local
102 // CMUL tt1, Tw1, in1
103 tt1.Re = tw1[0] * in1[0] - tw1[n_mul_2] * in1[n];
104 tt1.Im = tw1[0] * in1[n] + tw1[n_mul_2] * in1[0];
122 // CADD t2, tt1, tt3
123 t2.Re = tt1.Re + tt3.Re;
124 t2.Im = tt1.Im + tt3.Im;
126 // CSUB t3, tt1, tt3
127 t3.Re = tt1.Re - tt3.Re;
128 t3.Im = tt1
[all...]
H A Dx86SP_FFT_CToC_FC32_Inv_Radix4_ms.c90 OMX_FC32 tt1; local
102 // CMUL tt1, Tw1, in1
103 tt1.Re = tw1[0] * in1[0] + tw1[n_mul_2] * in1[n];
104 tt1.Im = tw1[0] * in1[n] - tw1[n_mul_2] * in1[0];
122 // CADD t2, tt1, tt3
123 t2.Re = tt1.Re + tt3.Re;
124 t2.Im = tt1.Im + tt3.Im;
126 // CSUB t3, tt1, tt3
127 t3.Re = tt1.Re - tt3.Re;
128 t3.Im = tt1
[all...]
H A Dx86SP_SSE_Math.h348 VC tt1, tt2, tt3; local
350 /* CMUL tt1, Tw1, T1 */
351 VC_MUL(&tt1, Tw1, T1);
365 /* CADD t2, tt1, tt3 */
366 VC_ADD(t2, &tt1, &tt3);
368 /* CSUB t3, tt1, tt3 */
369 VC_SUB(t3, &tt1, &tt3);
385 VC tt1, tt2, tt3; local
387 /* CMUL tt1, Tw1, T1 */
388 VC_CONJ_MUL(&tt1, Tw
[all...]
/external/chromium_org/third_party/skia/tests/
H A DPathOpsQuadLineIntersectionTest.cpp132 double tt1 = intersections[0][pt]; local
133 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1);
134 SkDPoint t1 = quad.ptAtT(tt1);
140 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
H A DPathOpsQuadIntersectionTest.cpp39 double tt1 = intersections[0][pt]; local
40 SkDPoint xy1 = quad1.ptAtT(tt1);
45 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY,
275 double tt1 = intersections2[0][pt]; local
276 SkDPoint xy1 = quad1.ptAtT(tt1);
282 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
287 outer, inner, tt1, xy1.fX, xy1.fY, tt2);
327 double tt1 = intersections2[0][pt]; local
329 SkDPoint pt1 = quad1.ptAtT(tt1);
H A DPathOpsCubicIntersectionTest.cpp52 double tt1 = tIntersections[0][pt]; local
53 SkDPoint xy1 = cubic1.ptAtT(tt1);
58 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
346 double tt1, tt2; local
349 tt1 = intersections[0][pt3];
350 xy1 = cubic1.ptAtT(tt1);
356 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX,
436 double tt1 = intersections2[0][pt]; local
437 SkDPoint xy1 = cubic1.ptAtT(tt1);
H A DPathOpsCubicLineIntersectionTest.cpp140 double tt1 = i[0][pt]; local
141 SkDPoint xy1 = cubic.ptAtT(tt1);
146 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
H A DPathOpsCubicQuadIntersectionTest.cpp82 double tt1 = i[0][pt]; local
83 SkDPoint xy1 = cubic.ptAtT(tt1);
88 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
/external/skia/tests/
H A DPathOpsQuadLineIntersectionTest.cpp132 double tt1 = intersections[0][pt]; local
133 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1);
134 SkDPoint t1 = quad.ptAtT(tt1);
140 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
H A DPathOpsQuadIntersectionTest.cpp39 double tt1 = intersections[0][pt]; local
40 SkDPoint xy1 = quad1.ptAtT(tt1);
45 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY,
272 double tt1 = intersections2[0][pt]; local
273 SkDPoint xy1 = quad1.ptAtT(tt1);
279 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
284 outer, inner, tt1, xy1.fX, xy1.fY, tt2);
324 double tt1 = intersections2[0][pt]; local
326 SkDPoint pt1 = quad1.ptAtT(tt1);
H A DPathOpsCubicIntersectionTest.cpp52 double tt1 = tIntersections[0][pt]; local
53 SkDPoint xy1 = cubic1.ptAtT(tt1);
58 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
346 double tt1, tt2; local
349 tt1 = intersections[0][pt3];
350 xy1 = cubic1.ptAtT(tt1);
356 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX,
436 double tt1 = intersections2[0][pt]; local
437 SkDPoint xy1 = cubic1.ptAtT(tt1);
H A DPathOpsCubicLineIntersectionTest.cpp140 double tt1 = i[0][pt]; local
141 SkDPoint xy1 = cubic.ptAtT(tt1);
146 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
H A DPathOpsCubicQuadIntersectionTest.cpp82 double tt1 = i[0][pt]; local
83 SkDPoint xy1 = cubic.ptAtT(tt1);
88 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
/external/clang/test/Misc/
H A Ddiag-template-diffing.cpp355 template<class> class tt1 {}; class
357 void set12(class_template_templates<tt1, tt1>) {}
360 set12(class_template_templates<tt1, tt1, tt1>());
363 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'class_template_templates<template tt2, template (no argument)>' to 'class_template_templates<template tt1, template tt1>' for 1st argument
365 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'class_template_templates<[2 * ...], template tt1>' to 'class_template_templates<[2 * ...], template (no argument)>' for 1st argument
367 // CHECK-NOELIDE-NOTREE: candidate function not viable: no known conversion from 'class_template_templates<template tt2, template (no argument)>' to 'class_template_templates<template tt1, templat
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Drbtz.cpp299 UDate tt0, tt1; local
301 UBool avail1 = rule1->getNextStart(lastTransitionTime, curRule->getRawOffset(), curRule->getDSTSavings(), false, tt1);
318 if (tt0 < tt1) {
326 final0->time = tt1;
329 rule0->getNextStart(tt1, rule1->getRawOffset(), rule1->getDSTSavings(), false, final1->time);

Completed in 406 milliseconds

12