Home
last modified time | relevance | path

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

12

/external/chromium_org/third_party/skia/tests/
DPathOpsAngleIdeas.cpp127 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2)… in checkParallel() argument
129 setQuadHullSweep(quad1, sweep); in checkParallel()
147 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2)); in checkParallel()
151 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
161 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1, in quadHullsOverlap() argument
164 setQuadHullSweep(quad1, sweep); in quadHullsOverlap()
195 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
205 return checkParallel(reporter, quad1, quad2); in quadHullsOverlap()
226 static bool orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in orderTRange() argument
229 orderQuads(reporter, quad1, r, &t1Array); in orderTRange()
[all …]
DPathOpsQuadIntersectionTest.cpp17 const SkDQuad& quad1 = quadraticTests[index][0]; in standardTestCases() local
18 SkASSERT(ValidQuad(quad1)); in standardTestCases()
22 int order1 = reduce1.reduce(quad1); in standardTestCases()
36 intersections.intersect(quad1, quad2); in standardTestCases()
40 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
268 const SkDQuad& quad1 = testSet[outer]; in oneOffTest1() local
269 SkASSERT(ValidQuad(quad1)); in oneOffTest1()
273 intersections2.intersect(quad1, quad2); in oneOffTest1()
276 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
318 const SkDQuad& quad1 = coincidentTestSet[test1]; in coincidentTestOne() local
[all …]
DPathOpsDebug.cpp844 static void dumpTestCase(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in dumpTestCase() argument
846 quad1.dumpComma(","); in dumpTestCase()
864 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in DumpQ() argument
866 dumpTestCase(quad1, quad2, testNo); in DumpQ()
/external/skia/tests/
DPathOpsAngleIdeas.cpp127 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2)… in checkParallel() argument
129 setQuadHullSweep(quad1, sweep); in checkParallel()
147 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2)); in checkParallel()
151 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
161 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1, in quadHullsOverlap() argument
164 setQuadHullSweep(quad1, sweep); in quadHullsOverlap()
195 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
205 return checkParallel(reporter, quad1, quad2); in quadHullsOverlap()
226 static bool orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in orderTRange() argument
229 orderQuads(reporter, quad1, r, &t1Array); in orderTRange()
[all …]
DPathOpsQuadIntersectionTest.cpp17 const SkDQuad& quad1 = quadraticTests[index][0]; in standardTestCases() local
18 SkASSERT(ValidQuad(quad1)); in standardTestCases()
22 int order1 = reduce1.reduce(quad1); in standardTestCases()
36 intersections.intersect(quad1, quad2); in standardTestCases()
40 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
265 const SkDQuad& quad1 = testSet[outer]; in oneOffTest1() local
266 SkASSERT(ValidQuad(quad1)); in oneOffTest1()
270 intersections2.intersect(quad1, quad2); in oneOffTest1()
273 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
315 const SkDQuad& quad1 = coincidentTestSet[test1]; in coincidentTestOne() local
[all …]
DPathOpsDebug.cpp712 static void dumpTestCase(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in dumpTestCase() argument
714 quad1.dumpComma(","); in dumpTestCase()
732 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { in DumpQ() argument
734 dumpTestCase(quad1, quad2, testNo); in DumpQ()
/external/chromium_org/third_party/skia/experimental/Intersection/
DQuadraticBezierClip_Test.cpp29 const Quadratic& quad1 = testSet[2]; in oneAtEndTest() local
33 bezier_clip(quad1, quad2, minT, maxT); in oneAtEndTest()
38 const Quadratic& quad1 = testSet[0]; in oneOffTest() local
42 bezier_clip(quad1, quad2, minT, maxT); in oneOffTest()
47 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases() local
50 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); in standardTestCases()
DQuadraticIntersection_Test.cpp20 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases() local
23 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); in standardTestCases()
38 xy_at_t(quad1, tt1, tx1, ty1); in standardTestCases()
203 const Quadratic& quad1 = testSet[outer]; in oneOffTest1() local
206 intersect2(quad1, quad2, intersections2); in oneOffTest1()
214 xy_at_t(quad1, tt1, tx1, ty1); in oneOffTest1()
260 const Quadratic& quad1 = coincidentTestSet[testIndex]; in coincidentTest() local
263 intersect2(quad1, quad2, intersections2); in coincidentTest()
341 const Quadratic& quad1 = testSet[test1]; in intersectionFinder() local
351 xy_at_t(quad1, t1Seed - t1Step, t1[0].x, t1[0].y); in intersectionFinder()
[all …]
DQuadraticIntersection.cpp22 : quad1(q1) in QuadraticIntersections()
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) { in intersect()
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) { in intersect()
38 quad1Divisions = 1 / subDivisions(quad1); in intersect()
64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); in intersect()
74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y); in intersect()
78 xy_at_t(quad1, maxT1, q1pt.x, q1pt.y); // FIXME: debug code in intersect()
84 xy_at_t(quad1, smallT, q1pt.x, q1pt.y); in intersect()
150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y); in intersectAsLine()
151 xy_at_t(quad1, maxT1, line1[1].x, line1[1].y); in intersectAsLine()
[all …]
DQuadraticParameterization.cpp115 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2) { in implicit_matches() argument
116 QuadImplicitForm i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f in implicit_matches()
DQuadraticImplicit.cpp336 static bool binarySearch(const Quadratic& quad1, const Quadratic& quad2, double& t1Seed, in binarySearch() argument
342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed); in binarySearch()
352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep); in binarySearch()
353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad1, t1Seed + tStep); in binarySearch()
/external/skia/experimental/Intersection/
DQuadraticBezierClip_Test.cpp29 const Quadratic& quad1 = testSet[2]; in oneAtEndTest() local
33 bezier_clip(quad1, quad2, minT, maxT); in oneAtEndTest()
38 const Quadratic& quad1 = testSet[0]; in oneOffTest() local
42 bezier_clip(quad1, quad2, minT, maxT); in oneOffTest()
47 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases() local
50 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); in standardTestCases()
DQuadraticIntersection_Test.cpp20 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases() local
23 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); in standardTestCases()
38 xy_at_t(quad1, tt1, tx1, ty1); in standardTestCases()
203 const Quadratic& quad1 = testSet[outer]; in oneOffTest1() local
206 intersect2(quad1, quad2, intersections2); in oneOffTest1()
214 xy_at_t(quad1, tt1, tx1, ty1); in oneOffTest1()
260 const Quadratic& quad1 = coincidentTestSet[testIndex]; in coincidentTest() local
263 intersect2(quad1, quad2, intersections2); in coincidentTest()
341 const Quadratic& quad1 = testSet[test1]; in intersectionFinder() local
351 xy_at_t(quad1, t1Seed - t1Step, t1[0].x, t1[0].y); in intersectionFinder()
[all …]
DQuadraticIntersection.cpp22 : quad1(q1) in QuadraticIntersections()
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) { in intersect()
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) { in intersect()
38 quad1Divisions = 1 / subDivisions(quad1); in intersect()
64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); in intersect()
74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y); in intersect()
78 xy_at_t(quad1, maxT1, q1pt.x, q1pt.y); // FIXME: debug code in intersect()
84 xy_at_t(quad1, smallT, q1pt.x, q1pt.y); in intersect()
150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y); in intersectAsLine()
151 xy_at_t(quad1, maxT1, line1[1].x, line1[1].y); in intersectAsLine()
[all …]
DQuadraticParameterization.cpp115 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2) { in implicit_matches() argument
116 QuadImplicitForm i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f in implicit_matches()
DQuadraticImplicit.cpp336 static bool binarySearch(const Quadratic& quad1, const Quadratic& quad2, double& t1Seed, in binarySearch() argument
342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed); in binarySearch()
352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep); in binarySearch()
353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad1, t1Seed + tStep); in binarySearch()
/external/opencv/cvaux/src/
Dcvepilines.cpp195 int icvComputeCoeffForStereoV3( double quad1[4][2], in icvComputeCoeffForStereoV3()
222 point1.x = (1.0 - alpha) * quad1[0][0] + alpha * quad1[3][0]; in icvComputeCoeffForStereoV3()
223 point1.y = (1.0 - alpha) * quad1[0][1] + alpha * quad1[3][1]; in icvComputeCoeffForStereoV3()
225 point2.x = (1.0 - alpha) * quad1[1][0] + alpha * quad1[2][0]; in icvComputeCoeffForStereoV3()
226 point2.y = (1.0 - alpha) * quad1[1][1] + alpha * quad1[2][1]; in icvComputeCoeffForStereoV3()
251 int icvComputeCoeffForStereoNew( double quad1[4][2], in icvComputeCoeffForStereoNew()
292 int status = icvComputeCoeffForStereoV3( quad1, in icvComputeCoeffForStereoNew()
311 double quad1[4][2]; in icvComputeCoeffForStereo() local
317 quad1[i][0] = stereoCamera->quad[0][i].x; in icvComputeCoeffForStereo()
318 quad1[i][1] = stereoCamera->quad[0][i].y; in icvComputeCoeffForStereo()
[all …]
/external/chromium_org/third_party/skia/src/pathops/
DSkDQuadImplicit.cpp113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) { in Match() argument
114 SkDQuadImplicit i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f in Match()
DSkDQuadImplicit.h17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, in binary_search() argument
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed); in binary_search()
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep)); in binary_search()
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep)); in binary_search()
/external/skia/src/pathops/
DSkDQuadImplicit.cpp113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) { in Match() argument
114 SkDQuadImplicit i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f in Match()
DSkDQuadImplicit.h17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, in binary_search() argument
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed); in binary_search()
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep)); in binary_search()
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep)); in binary_search()
/external/deqp/framework/common/
DtcuTexLookupVerifier.cpp225 …ds (const LookupPrecision& prec, const ColorQuad& quad0, const ColorQuad& quad1, const Vec4& resul… in isInColorBounds() argument
227 const tcu::Vec4 minVal = min(min(quad0), min(quad1)) - prec.colorThreshold; in isInColorBounds()
228 const tcu::Vec4 maxVal = max(max(quad0), max(quad1)) + prec.colorThreshold; in isInColorBounds()
320 const ColorQuad& quad1, in isTrilinearRangeValid() argument
331 if (!isInColorBounds(prec, quad0, quad1, result)) in isTrilinearRangeValid()
341 …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()
386 const ColorQuad& quad1, in is2DTrilinearFilterResultValid() argument
400 if (!isInColorBounds(prec, quad0, quad1, result)) in is2DTrilinearFilterResultValid()
417 …const Vec4 c1 = quad1.p00*(1.0f-a1)*(1.0f-b1) + quad1.p10*a1*(1.0f-b1) + quad1.p01*(1.0f-a1)*b1 +… in is2DTrilinearFilterResultValid()
738 ColorQuad quad0, quad1; in isLinearSampleResultValid() local
[all …]
/external/chromium_org/cc/trees/
Dlayer_tree_host_unittest_delegated.cc770 const TextureDrawQuad* quad1 = TextureDrawQuad::MaterialCast( in DidActivateTreeOnThread() local
772 EXPECT_EQ(parent_resource_id1, quad1->resource_id); in DidActivateTreeOnThread()
1138 const TextureDrawQuad* quad1 = in DidActivateTreeOnThread() local
1140 EXPECT_EQ(map.find(999)->second, quad1->resource_id); in DidActivateTreeOnThread()
1261 const TextureDrawQuad* quad1 = in SwapBuffersOnThread() local
1263 EXPECT_EQ(map.find(999)->second, quad1->resource_id); in SwapBuffersOnThread()
1283 const TextureDrawQuad* quad1 = in SwapBuffersOnThread() local
1285 EXPECT_EQ(map.find(999)->second, quad1->resource_id); in SwapBuffersOnThread()
1301 const TextureDrawQuad* quad1 = in SwapBuffersOnThread() local
1303 EXPECT_EQ(map.find(999)->second, quad1->resource_id); in SwapBuffersOnThread()

12