Home
last modified time | relevance | path

Searched refs:quad1 (Results 1 – 19 of 19) sorted by relevance

/external/skqp/tests/
DPathOpsQuadIntersectionTest.cpp18 SkDQuad quad1; in standardTestCases() local
19 quad1.debugSet(q1.fPts); in standardTestCases()
20 SkASSERT(ValidQuad(quad1)); in standardTestCases()
26 int order1 = reduce1.reduce(quad1); in standardTestCases()
40 intersections.intersect(quad1, quad2); in standardTestCases()
44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
337 SkDQuad quad1; in oneOffTest1() local
338 quad1.debugSet(q1.fPts); in oneOffTest1()
339 SkASSERT(ValidQuad(quad1)); in oneOffTest1()
345 intersections.intersect(quad1, quad2); in oneOffTest1()
[all …]
DPathOpsAngleIdeas.cpp129 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2)… in checkParallel() argument
131 setQuadHullSweep(quad1, sweep); in checkParallel()
149 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2)); in checkParallel()
153 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
163 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1, in quadHullsOverlap() argument
166 setQuadHullSweep(quad1, sweep); in quadHullsOverlap()
197 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
207 return checkParallel(reporter, quad1, quad2); in quadHullsOverlap()
228 static bool orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in orderTRange() argument
231 orderQuads(reporter, quad1, r, &t1Array); in orderTRange()
[all …]
DPathOpsDebug.cpp469 static void dumpTestCase(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in dumpTestCase() argument
471 quad1.dumpInner(); in dumpTestCase()
490 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in DumpQ() argument
492 dumpTestCase(quad1, quad2, testNo); in DumpQ()
/external/skia/tests/
DPathOpsQuadIntersectionTest.cpp18 SkDQuad quad1; in standardTestCases() local
19 quad1.debugSet(q1.fPts); in standardTestCases()
20 SkASSERT(ValidQuad(quad1)); in standardTestCases()
26 int order1 = reduce1.reduce(quad1); in standardTestCases()
40 intersections.intersect(quad1, quad2); in standardTestCases()
44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
337 SkDQuad quad1; in oneOffTest1() local
338 quad1.debugSet(q1.fPts); in oneOffTest1()
339 SkASSERT(ValidQuad(quad1)); in oneOffTest1()
345 intersections.intersect(quad1, quad2); in oneOffTest1()
[all …]
DPathOpsAngleIdeas.cpp129 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2)… in checkParallel() argument
131 setQuadHullSweep(quad1, sweep); in checkParallel()
149 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2)); in checkParallel()
153 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
163 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1, in quadHullsOverlap() argument
166 setQuadHullSweep(quad1, sweep); in quadHullsOverlap()
197 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
207 return checkParallel(reporter, quad1, quad2); in quadHullsOverlap()
228 static bool orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in orderTRange() argument
231 orderQuads(reporter, quad1, r, &t1Array); in orderTRange()
[all …]
DPathOpsDebug.cpp469 static void dumpTestCase(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in dumpTestCase() argument
471 quad1.dumpInner(); in dumpTestCase()
490 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in DumpQ() argument
492 dumpTestCase(quad1, quad2, testNo); in DumpQ()
/external/jackson-core/src/main/java/com/fasterxml/jackson/core/sym/
DName2.java16 Name2(String name, int hash, int quad1, int quad2) { in Name2() argument
18 q1 = quad1; in Name2()
26 public boolean equals(int quad1, int quad2) { return (quad1 == q1) && (quad2 == q2); } in equals() argument
28 @Override public boolean equals(int quad1, int quad2, int q3) { return false; } in equals() argument
DName3.java25 public boolean equals(int quad1, int quad2) { return false; } in equals() argument
28 public boolean equals(int quad1, int quad2, int quad3) { in equals() argument
29 return (q1 == quad1) && (q2 == quad2) && (q3 == quad3); in equals()
DName1.java25 @Override public boolean equals(int quad1, int quad2) { return (quad1 == q) && (quad2 == 0); } in equals() argument
DNameN.java58 public boolean equals(int quad1, int quad2) { return false; } in equals() argument
62 public boolean equals(int quad1, int quad2, int quad3) { return false; } in equals() argument
/external/deqp/framework/common/
DtcuTexLookupVerifier.cpp220 …ds (const LookupPrecision& prec, const ColorQuad& quad0, const ColorQuad& quad1, const Vec4& resul… in isInColorBounds() argument
222 const tcu::Vec4 minVal = min(min(quad0), min(quad1)) - prec.colorThreshold; in isInColorBounds()
223 const tcu::Vec4 maxVal = max(max(quad0), max(quad1)) + prec.colorThreshold; in isInColorBounds()
317 const ColorQuad& quad1, in isTrilinearRangeValid() argument
332 if (!isInColorBounds(prec, quad0, quad1, result)) in isTrilinearRangeValid()
342 …const Vec4 c1 = quad1.p00*(1.0f-a)*(1.0f-b) + quad1.p10*a*(1.0f-b) + quad1.p01*(1.0f-a)*b + quad1… in isTrilinearRangeValid()
380 const ColorQuad& quad1, in isReductionValid() argument
388 …reductionMode == tcu::Sampler::MIN ? tcu::min(quad0.p00, quad1.p00) : tcu::max(quad0.p00, quad1.p0… in isReductionValid()
389 …reductionMode == tcu::Sampler::MIN ? tcu::min(quad0.p01, quad1.p01) : tcu::max(quad0.p01, quad1.p0… in isReductionValid()
390 …reductionMode == tcu::Sampler::MIN ? tcu::min(quad0.p10, quad1.p10) : tcu::max(quad0.p10, quad1.p1… in isReductionValid()
[all …]
/external/s2-geometry-library-java/tests/com/google/common/geometry/
DS1IntervalTest.java70 S1Interval quad1 = new S1Interval(0, S2.M_PI_2); in testBasic() local
160 testIntervalOps(zero, pi2, "FFFF", quad1, empty); in testBasic()
168 testIntervalOps(pi2, zero, "FFFF", quad1, empty); in testBasic()
214 testIntervalOps(quad1, quad23, "FFTF", quad123, new S1Interval(S2.M_PI_2, S2.M_PI_2)); in testBasic()
283 res = quad1.addPoint(-0.9 * S2.M_PI); in testBasic()
/external/skqp/src/pathops/
DSkAddIntersections.cpp286 SkDQuad quad1, quad2; in AddIntersectTs() local
404 pts = ts.intersect(quad1.set(wt.pts()), quad2.set(wn.pts())); in AddIntersectTs()
411 quad1.set(wt.pts())); in AddIntersectTs()
417 pts = ts.intersect(cubic2.set(wn.pts()), quad1.set(wt.pts())); in AddIntersectTs()
DSkPathOpsDebug.h488 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo);
DSkPathOpsTSect.cpp2086 SkTQuad quad1(q1); in intersect() local
2088 SkTSect sect1(quad1 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in intersect()
/external/skia/src/pathops/
DSkAddIntersections.cpp286 SkDQuad quad1, quad2; in AddIntersectTs() local
404 pts = ts.intersect(quad1.set(wt.pts()), quad2.set(wn.pts())); in AddIntersectTs()
411 quad1.set(wt.pts())); in AddIntersectTs()
417 pts = ts.intersect(cubic2.set(wn.pts()), quad1.set(wt.pts())); in AddIntersectTs()
DSkPathOpsDebug.h467 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo);
DSkPathOpsTSect.cpp2086 SkTQuad quad1(q1); in intersect() local
2088 SkTSect sect1(quad1 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in intersect()
/external/mesa3d/src/gallium/drivers/swr/rasterizer/memory/
DStoreTile.h225 simd4scalari quad1 = SIMD128::load_si(&pSrc128[1]); // 4 5 6 7
229 SIMD128::storeu_si(ppDsts128[0], SIMD128::unpacklo_epi64(quad0, quad1)); // 0 1 4 5
230 SIMD128::storeu_si(ppDsts128[1], SIMD128::unpackhi_epi64(quad0, quad1)); // 2 3 6 7