HomeSort by relevance Sort by last modified time
    Searched defs:tt2 (Results 1 - 24 of 24) sorted by null

  /external/skia/tests/
PathOpsConicQuadIntersectionTest.cpp 53 double tt2 = i[1][pt]; local
54 SkDPoint xy2 = quad.ptAtT(tt2);
57 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicConicIntersectionTest.cpp 57 double tt2 = i[1][pt]; local
58 SkDPoint xy2 = conic.ptAtT(tt2);
61 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicQuadIntersectionTest.cpp 81 double tt2 = i[1][pt]; local
82 SkDPoint xy2 = quad.ptAtT(tt2);
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsConicLineIntersectionTest.cpp 134 double tt2 = intersections[1][pt]; local
135 REPORTER_ASSERT(reporter, tt2 >= 0 && tt2 <= 1);
136 SkDPoint t2 = line.ptAtT(tt2);
139 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsCubicLineIntersectionTest.cpp 152 double tt2 = i[1][pt]; local
153 SkDPoint xy2 = line.ptAtT(tt2);
156 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsQuadLineIntersectionTest.cpp 139 double tt2 = intersections[1][pt]; local
140 REPORTER_ASSERT(reporter, tt2 >= 0 && tt2 <= 1);
141 SkDPoint t2 = line.ptAtT(tt2);
144 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsConicIntersectionTest.cpp 320 double tt1, tt2; local
325 tt2 = intersections[1][pt3];
326 xy2 = c2.ptAtT(tt2);
PathOpsQuadIntersectionTest.cpp 45 double tt2 = intersections[1][pt]; local
46 SkDPoint xy2 = quad2.ptAtT(tt2);
50 tt2, xy2.fX, xy2.fY);
349 double tt2 = intersections[1][pt]; local
350 SkDPoint xy2 = quad2.ptAtT(tt2);
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2);
402 double tt2 = intersections2[1][pt]; local
404 SkDPoint pt2 = quad2.ptAtT(tt2);
PathOpsCubicIntersectionTest.cpp 60 double tt2 = tIntersections[1][pt]; local
61 SkDPoint xy2 = c2.ptAtT(tt2);
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
418 double tt1, tt2; local
423 tt2 = intersections[1][pt3];
424 xy2 = c2.ptAtT(tt2);
429 iPt.fY, xy2.fX, xy2.fY, tt2);
519 double tt2 = intersections2[1][pt]; local
520 SkDPoint xy2 = c2.ptAtT(tt2);
  /external/skqp/tests/
PathOpsConicQuadIntersectionTest.cpp 53 double tt2 = i[1][pt]; local
54 SkDPoint xy2 = quad.ptAtT(tt2);
57 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicConicIntersectionTest.cpp 57 double tt2 = i[1][pt]; local
58 SkDPoint xy2 = conic.ptAtT(tt2);
61 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicQuadIntersectionTest.cpp 81 double tt2 = i[1][pt]; local
82 SkDPoint xy2 = quad.ptAtT(tt2);
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsConicLineIntersectionTest.cpp 134 double tt2 = intersections[1][pt]; local
135 REPORTER_ASSERT(reporter, tt2 >= 0 && tt2 <= 1);
136 SkDPoint t2 = line.ptAtT(tt2);
139 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsCubicLineIntersectionTest.cpp 152 double tt2 = i[1][pt]; local
153 SkDPoint xy2 = line.ptAtT(tt2);
156 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsQuadLineIntersectionTest.cpp 139 double tt2 = intersections[1][pt]; local
140 REPORTER_ASSERT(reporter, tt2 >= 0 && tt2 <= 1);
141 SkDPoint t2 = line.ptAtT(tt2);
144 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsConicIntersectionTest.cpp 320 double tt1, tt2; local
325 tt2 = intersections[1][pt3];
326 xy2 = c2.ptAtT(tt2);
PathOpsQuadIntersectionTest.cpp 45 double tt2 = intersections[1][pt]; local
46 SkDPoint xy2 = quad2.ptAtT(tt2);
50 tt2, xy2.fX, xy2.fY);
349 double tt2 = intersections[1][pt]; local
350 SkDPoint xy2 = quad2.ptAtT(tt2);
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2);
402 double tt2 = intersections2[1][pt]; local
404 SkDPoint pt2 = quad2.ptAtT(tt2);
PathOpsCubicIntersectionTest.cpp 60 double tt2 = tIntersections[1][pt]; local
61 SkDPoint xy2 = c2.ptAtT(tt2);
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
417 double tt1, tt2; local
422 tt2 = intersections[1][pt3];
423 xy2 = c2.ptAtT(tt2);
428 iPt.fY, xy2.fX, xy2.fY, tt2);
518 double tt2 = intersections2[1][pt]; local
519 SkDPoint xy2 = c2.ptAtT(tt2);
  /external/libvpx/libvpx/vpx_dsp/arm/
vpx_convolve8_neon.c 77 int16x8_t tt0, tt1, tt2, tt3; local
89 tt2 = vreinterpretq_s16_u16(vmovl_u8(t2));
93 s2 = vget_low_s16(tt2);
97 s6 = vget_high_s16(tt2);
109 tt2 = vreinterpretq_s16_u16(vmovl_u8(t2));
113 s9 = vget_low_s16(tt2);
330 int16x8_t tt0, tt1, tt2, tt3; local
343 tt2 = vreinterpretq_s16_u16(vmovl_u8(t2));
347 s2 = vget_low_s16(tt2);
351 s6 = vget_high_s16(tt2);
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/
SecP384R1Point.java 92 int[] tt2 = Nat.create(24); local
108 U2 = tt2;
174 Nat384.mul(Y3.x, R, tt2);
175 SecP384R1Field.addExt(tt1, tt2, tt1);
  /external/clang/test/Misc/
diag-template-diffing.cpp 356 template<class> class tt2 {}; class
359 set12(class_template_templates<tt2>());
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
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, template tt1>' for 1st argument
373 // CHECK-ELIDE-TREE: [template tt2 != template tt1],
383 // CHECK-NOELIDE-TREE: [template tt2 != template tt1],
    [all...]
  /external/valgrind/VEX/priv/
guest_arm_toIR.c 13277 UInt tt2 = 16; \/\/ invalid local
    [all...]
guest_arm64_toIR.c 5409 UInt tt2 = INSN(14,10); local
    [all...]
  /prebuilts/sdk/tools/lib/
signapk.jar 

Completed in 442 milliseconds