| /external/skia/src/pathops/ |
| D | SkPathOpsConic.h | 61 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
62 return fPts.hullIntersects(quad, isLinear); in hullIntersects()
65 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
66 return fPts.hullIntersects(conic.fPts, isLinear); in hullIntersects()
69 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
71 bool isLinear(int startIndex, int endIndex) const { in isLinear() function
72 return fPts.isLinear(startIndex, endIndex); in isLinear()
|
| D | SkPathOpsCubic.h | 75 bool hullIntersects(const SkDCubic& c2, bool* isLinear) const;
76 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
77 bool hullIntersects(const SkDQuad& c2, bool* isLinear) const;
78 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
79 bool isLinear(int startIndex, int endIndex) const;
|
| D | SkPathOpsQuad.h | 72 bool hullIntersects(const SkDQuad& , bool* isLinear) const;
73 bool hullIntersects(const SkDConic& , bool* isLinear) const;
74 bool hullIntersects(const SkDCubic& , bool* isLinear) const;
75 bool isLinear(int startIndex, int endIndex) const;
|
| D | SkPathOpsQuad.cpp | 21 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const { in hullIntersects()
47 *isLinear = linear; in hullIntersects()
51 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
52 return conic.hullIntersects(*this, isLinear); in hullIntersects()
55 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
56 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
145 bool SkDQuad::isLinear(int startIndex, int endIndex) const { in isLinear() function in SkDQuad
|
| D | SkPathOpsCubic.cpp | 152 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects()
197 *isLinear = linear; in hullIntersects()
201 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const { in hullIntersects()
202 return hullIntersects(c2.fPts, c2.kPointCount, isLinear); in hullIntersects()
205 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
206 return hullIntersects(quad.fPts, quad.kPointCount, isLinear); in hullIntersects()
209 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
211 return hullIntersects(conic.fPts, isLinear); in hullIntersects()
214 bool SkDCubic::isLinear(int startIndex, int endIndex) const { in isLinear() function in SkDCubic
|
| D | SkPathOpsConic.cpp | 80 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
81 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
|
| D | SkReduceOrder.cpp | 39 if (!quad.isLinear(0, 2)) { in check_linear()
150 if (!cubic.isLinear(0, 3)) { in check_linear()
|
| /external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/test/js/ |
| D | animation-node.js | 23 function isLinear(f) { function
30 isLinear(f);
33 isLinear(f);
36 isLinear(f);
39 isLinear(f);
|
| /external/skia/src/gpu/batches/ |
| D | GrTessellatingPathRenderer.cpp | 130 bool isLinear; in tessellate() local
132 vertexBuffer, canMapVB, &isLinear); in tessellate()
135 info.fTolerance = isLinear ? 0 : tol; in tessellate()
|
| /external/skia/src/gpu/ |
| D | GrTessellator.h | 36 SkAutoTUnref<GrVertexBuffer>& vertexBuffer, bool canMapVB, bool* isLinear);
|
| D | GrTessellator.cpp | 539 Vertex** contours, SkChunkAlloc& alloc, bool *isLinear) { in path_to_contours() argument
544 *isLinear = true; in path_to_contours()
572 *isLinear = false; in path_to_contours()
592 *isLinear = false; in path_to_contours()
599 *isLinear = false; in path_to_contours()
1331 int contourCnt, SkChunkAlloc& alloc, bool* isLinear) { in path_to_polys() argument
1338 path_to_contours(path, tolerance, clipBounds, contours.get(), alloc, isLinear); in path_to_polys()
1379 SkAutoTUnref<GrVertexBuffer>& vertexBuffer, bool canMapVB, bool* isLinear) { in PathToTriangles() argument
1384 *isLinear = true; in PathToTriangles()
1388 Poly* polys = path_to_polys(path, tolerance, clipBounds, contourCnt, alloc, isLinear); in PathToTriangles()
[all …]
|
| /external/deqp/modules/gles31/functional/ |
| D | es31fTextureFilteringTests.cpp | 601 const bool isLinear = isLinearI != 0; in init() local
602 const deUint32 filter = isLinear ? GL_LINEAR : GL_NEAREST; in init()
605 isLinear ? "linear" : "nearest", "", in init()
|
| /external/skia/include/core/ |
| D | SkImageInfo.h | 233 bool isLinear() const { return kLinear_SkColorProfileType == fProfileType; } in isLinear() function
|
| /external/deqp/modules/gles3/functional/ |
| D | es3fTextureFilteringTests.cpp | 1524 bool isLinear = isLinearI != 0; in init() local
1525 deUint32 filter = isLinear ? GL_LINEAR : GL_NEAREST; in init()
1528 isLinear ? "linear" : "nearest", "", in init()
|
| /external/skia/src/core/ |
| D | SkDraw.cpp | 1560 return fDevice->imageInfo().isLinear() ? SkPaint::FakeGamma::On : SkPaint::FakeGamma::Off; in fakeGamma()
|