HomeSort by relevance Sort by last modified time
    Searched defs:tt1 (Results 1 - 25 of 31) sorted by null

1 2

  /external/skia/tests/
PathOpsConicQuadIntersectionTest.cpp 51 double tt1 = i[0][pt]; local
52 SkDPoint xy1 = conic.ptAtT(tt1);
57 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicConicIntersectionTest.cpp 55 double tt1 = i[0][pt]; local
56 SkDPoint xy1 = cubic.ptAtT(tt1);
61 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicQuadIntersectionTest.cpp 79 double tt1 = i[0][pt]; local
80 SkDPoint xy1 = cubic.ptAtT(tt1);
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsConicLineIntersectionTest.cpp 131 double tt1 = intersections[0][pt]; local
132 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1);
133 SkDPoint t1 = conic.ptAtT(tt1);
139 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsCubicLineIntersectionTest.cpp 150 double tt1 = i[0][pt]; local
151 SkDPoint xy1 = cubic.ptAtT(tt1);
156 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsQuadLineIntersectionTest.cpp 136 double tt1 = intersections[0][pt]; local
137 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1);
138 SkDPoint t1 = quad.ptAtT(tt1);
144 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsConicIntersectionTest.cpp 320 double tt1, tt2; local
323 tt1 = intersections[0][pt3];
324 xy1 = c1.ptAtT(tt1);
PathOpsQuadIntersectionTest.cpp 43 double tt1 = intersections[0][pt]; local
44 SkDPoint xy1 = quad1.ptAtT(tt1);
49 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY,
347 double tt1 = intersections[0][pt]; local
348 SkDPoint xy1 = quad1.ptAtT(tt1);
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2);
401 double tt1 = intersections2[0][pt]; local
403 SkDPoint pt1 = quad1.ptAtT(tt1);
PathOpsCubicIntersectionTest.cpp 58 double tt1 = tIntersections[0][pt]; local
59 SkDPoint xy1 = c1.ptAtT(tt1);
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
418 double tt1, tt2; local
421 tt1 = intersections[0][pt3];
422 xy1 = c1.ptAtT(tt1);
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX,
517 double tt1 = intersections2[0][pt]; local
518 SkDPoint xy1 = c1.ptAtT(tt1);
  /external/skqp/tests/
PathOpsConicQuadIntersectionTest.cpp 51 double tt1 = i[0][pt]; local
52 SkDPoint xy1 = conic.ptAtT(tt1);
57 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicConicIntersectionTest.cpp 55 double tt1 = i[0][pt]; local
56 SkDPoint xy1 = cubic.ptAtT(tt1);
61 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsCubicQuadIntersectionTest.cpp 79 double tt1 = i[0][pt]; local
80 SkDPoint xy1 = cubic.ptAtT(tt1);
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsConicLineIntersectionTest.cpp 131 double tt1 = intersections[0][pt]; local
132 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1);
133 SkDPoint t1 = conic.ptAtT(tt1);
139 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsCubicLineIntersectionTest.cpp 150 double tt1 = i[0][pt]; local
151 SkDPoint xy1 = cubic.ptAtT(tt1);
156 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsQuadLineIntersectionTest.cpp 136 double tt1 = intersections[0][pt]; local
137 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1);
138 SkDPoint t1 = quad.ptAtT(tt1);
144 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsConicIntersectionTest.cpp 320 double tt1, tt2; local
323 tt1 = intersections[0][pt3];
324 xy1 = c1.ptAtT(tt1);
PathOpsQuadIntersectionTest.cpp 43 double tt1 = intersections[0][pt]; local
44 SkDPoint xy1 = quad1.ptAtT(tt1);
49 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY,
347 double tt1 = intersections[0][pt]; local
348 SkDPoint xy1 = quad1.ptAtT(tt1);
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2);
401 double tt1 = intersections2[0][pt]; local
403 SkDPoint pt1 = quad1.ptAtT(tt1);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/
SecP192K1Point.java 93 int[] tt1 = Nat192.createExt(); local
129 U1 = tt1;
165 Nat192.mul(S1, G, tt1);
176 SecP192K1Field.multiplyAddToExt(Y3.x, R, tt1);
177 SecP192K1Field.reduce(tt1, Y3.x);
SecP224K1Point.java 93 int[] tt1 = Nat224.createExt(); local
129 U1 = tt1;
165 Nat224.mul(S1, G, tt1);
176 SecP224K1Field.multiplyAddToExt(Y3.x, R, tt1);
177 SecP224K1Field.reduce(tt1, Y3.x);
SecP256K1Point.java 93 int[] tt1 = Nat256.createExt(); local
129 U1 = tt1;
165 Nat256.mul(S1, G, tt1);
176 SecP256K1Field.multiplyAddToExt(Y3.x, R, tt1);
177 SecP256K1Field.reduce(tt1, Y3.x);
SecP192R1Point.java 92 int[] tt1 = Nat192.createExt(); local
128 U1 = tt1;
164 Nat192.mul(S1, G, tt1);
175 SecP192R1Field.multiplyAddToExt(Y3.x, R, tt1);
176 SecP192R1Field.reduce(tt1, Y3.x);
SecP224R1Point.java 91 int[] tt1 = Nat224.createExt(); local
127 U1 = tt1;
163 Nat224.mul(S1, G, tt1);
174 SecP224R1Field.multiplyAddToExt(Y3.x, R, tt1);
175 SecP224R1Field.reduce(tt1, Y3.x);
SecP256R1Point.java 91 int[] tt1 = Nat256.createExt(); local
127 U1 = tt1;
163 Nat256.mul(S1, G, tt1);
174 SecP256R1Field.multiplyAddToExt(Y3.x, R, tt1);
175 SecP256R1Field.reduce(tt1, Y3.x);
SecP384R1Point.java 91 int[] tt1 = Nat.create(24); local
127 U1 = tt1;
163 Nat384.mul(S1, G, tt1);
175 SecP384R1Field.addExt(tt1, tt2, tt1);
176 SecP384R1Field.reduce(tt1, Y3.x);
  /external/libvpx/libvpx/vpx_dsp/arm/
vpx_convolve8_neon.c 77 int16x8_t tt0, tt1, tt2, tt3; local
88 tt1 = vreinterpretq_s16_u16(vmovl_u8(t1));
92 s1 = vget_low_s16(tt1);
96 s5 = vget_high_s16(tt1);
108 tt1 = vreinterpretq_s16_u16(vmovl_u8(t1));
112 s8 = vget_low_s16(tt1);
330 int16x8_t tt0, tt1, tt2, tt3; local
342 tt1 = vreinterpretq_s16_u16(vmovl_u8(t1));
346 s1 = vget_low_s16(tt1);
350 s5 = vget_high_s16(tt1);
    [all...]

Completed in 175 milliseconds

1 2