Home
last modified time | relevance | path

Searched refs:isLinear (Results 1 – 25 of 47) sorted by relevance

12

/external/skia/src/pathops/
DSkPathOpsConic.h69 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
70 return fPts.hullIntersects(quad, isLinear); in hullIntersects()
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
74 return fPts.hullIntersects(conic.fPts, isLinear); in hullIntersects()
77 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
79 bool isLinear(int startIndex, int endIndex) const { in isLinear() function
80 return fPts.isLinear(startIndex, endIndex); in isLinear()
161 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
163 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override { in hullIntersects() argument
164 return conic.hullIntersects(fConic, isLinear); in hullIntersects()
[all …]
DSkPathOpsQuad.h81 bool hullIntersects(const SkDQuad& , bool* isLinear) const;
82 bool hullIntersects(const SkDConic& , bool* isLinear) const;
83 bool hullIntersects(const SkDCubic& , bool* isLinear) const;
84 bool isLinear(int startIndex, int endIndex) const;
153 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override { in hullIntersects() argument
154 return quad.hullIntersects(fQuad, isLinear); in hullIntersects()
157 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
158 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const override;
160 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override { in hullIntersects() argument
161 return curve.hullIntersects(fQuad, isLinear); in hullIntersects()
DSkPathOpsCubic.h79 bool hullIntersects(const SkDCubic& c2, bool* isLinear) const;
80 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
81 bool hullIntersects(const SkDQuad& c2, bool* isLinear) const;
82 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
83 bool isLinear(int startIndex, int endIndex) const;
209 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
210 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
212 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const override { in hullIntersects() argument
213 return cubic.hullIntersects(fCubic, isLinear); in hullIntersects()
216 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override { in hullIntersects() argument
[all …]
DSkPathOpsTCurve.h29 virtual bool hullIntersects(const SkDQuad& , bool* isLinear) const = 0;
30 virtual bool hullIntersects(const SkDConic& , bool* isLinear) const = 0;
31 virtual bool hullIntersects(const SkDCubic& , bool* isLinear) const = 0;
32 virtual bool hullIntersects(const SkTCurve& , bool* isLinear) const = 0;
DSkPathOpsQuad.cpp47 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const { in hullIntersects()
81 *isLinear = linear; in hullIntersects()
85 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
86 return conic.hullIntersects(*this, isLinear); in hullIntersects()
89 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
90 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
185 bool SkDQuad::isLinear(int startIndex, int endIndex) const { in isLinear() function in SkDQuad
406 bool SkTQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
407 return conic.hullIntersects(fQuad, isLinear); in hullIntersects()
410 bool SkTQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
[all …]
DSkPathOpsConic.cpp84 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
85 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
180 bool SkTConic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
181 return quad.hullIntersects(fConic, isLinear); in hullIntersects()
184 bool SkTConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
185 return cubic.hullIntersects(fConic, isLinear); in hullIntersects()
DSkPathOpsCubic.cpp149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects()
194 *isLinear = linear; in hullIntersects()
198 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const { in hullIntersects()
199 return hullIntersects(c2.fPts, SkDCubic::kPointCount, isLinear); in hullIntersects()
202 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
203 return hullIntersects(quad.fPts, SkDQuad::kPointCount, isLinear); in hullIntersects()
206 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
208 return hullIntersects(conic.fPts, isLinear); in hullIntersects()
211 bool SkDCubic::isLinear(int startIndex, int endIndex) const { in isLinear() function in SkDCubic
213 return ((const SkDQuad *) this)->isLinear(0, 2); in isLinear()
[all …]
/external/skqp/src/pathops/
DSkPathOpsConic.h69 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
70 return fPts.hullIntersects(quad, isLinear); in hullIntersects()
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
74 return fPts.hullIntersects(conic.fPts, isLinear); in hullIntersects()
77 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
79 bool isLinear(int startIndex, int endIndex) const { in isLinear() function
80 return fPts.isLinear(startIndex, endIndex); in isLinear()
161 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
163 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override { in hullIntersects() argument
164 return conic.hullIntersects(fConic, isLinear); in hullIntersects()
[all …]
DSkPathOpsQuad.h81 bool hullIntersects(const SkDQuad& , bool* isLinear) const;
82 bool hullIntersects(const SkDConic& , bool* isLinear) const;
83 bool hullIntersects(const SkDCubic& , bool* isLinear) const;
84 bool isLinear(int startIndex, int endIndex) const;
153 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override { in hullIntersects() argument
154 return quad.hullIntersects(fQuad, isLinear); in hullIntersects()
157 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
158 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const override;
160 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override { in hullIntersects() argument
161 return curve.hullIntersects(fQuad, isLinear); in hullIntersects()
DSkPathOpsCubic.h79 bool hullIntersects(const SkDCubic& c2, bool* isLinear) const;
80 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
81 bool hullIntersects(const SkDQuad& c2, bool* isLinear) const;
82 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
83 bool isLinear(int startIndex, int endIndex) const;
209 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
210 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
212 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const override { in hullIntersects() argument
213 return cubic.hullIntersects(fCubic, isLinear); in hullIntersects()
216 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override { in hullIntersects() argument
[all …]
DSkPathOpsTCurve.h29 virtual bool hullIntersects(const SkDQuad& , bool* isLinear) const = 0;
30 virtual bool hullIntersects(const SkDConic& , bool* isLinear) const = 0;
31 virtual bool hullIntersects(const SkDCubic& , bool* isLinear) const = 0;
32 virtual bool hullIntersects(const SkTCurve& , bool* isLinear) const = 0;
DSkPathOpsQuad.cpp47 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const { in hullIntersects()
81 *isLinear = linear; in hullIntersects()
85 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
86 return conic.hullIntersects(*this, isLinear); in hullIntersects()
89 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
90 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
185 bool SkDQuad::isLinear(int startIndex, int endIndex) const { in isLinear() function in SkDQuad
406 bool SkTQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
407 return conic.hullIntersects(fQuad, isLinear); in hullIntersects()
410 bool SkTQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
[all …]
DSkPathOpsConic.cpp84 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
85 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
180 bool SkTConic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
181 return quad.hullIntersects(fConic, isLinear); in hullIntersects()
184 bool SkTConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
185 return cubic.hullIntersects(fConic, isLinear); in hullIntersects()
DSkPathOpsCubic.cpp148 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects()
193 *isLinear = linear; in hullIntersects()
197 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const { in hullIntersects()
198 return hullIntersects(c2.fPts, c2.kPointCount, isLinear); in hullIntersects()
201 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
202 return hullIntersects(quad.fPts, quad.kPointCount, isLinear); in hullIntersects()
205 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
207 return hullIntersects(conic.fPts, isLinear); in hullIntersects()
210 bool SkDCubic::isLinear(int startIndex, int endIndex) const { in isLinear() function in SkDCubic
212 return ((const SkDQuad *) this)->isLinear(0, 2); in isLinear()
[all …]
/external/skia/src/gpu/
DGrInnerFanTriangulator.h27 bool* isLinear) const { in pathToTriangles() argument
28 Poly* polys = this->pathToPolys(breadcrumbList, isLinear); in pathToTriangles()
32 Poly* pathToPolys(BreadcrumbTriangleList* breadcrumbList, bool* isLinear) const { in pathToPolys() argument
33 Poly* polys = this->GrTriangulator::pathToPolys(0, SkRect::MakeEmpty(), isLinear); in pathToPolys()
DGrAATriangulator.h22 bool isLinear; in PathToAATriangles() local
23 Poly* polys = aaTriangulator.pathToPolys(tolerance, clipBounds, &isLinear); in PathToAATriangles()
/external/skqp/src/gpu/vk/
DGrVkImage.cpp157 bool isLinear = VK_IMAGE_TILING_LINEAR == imageDesc.fImageTiling; in InitImageInfo() local
158 VkImageLayout initialLayout = isLinear ? VK_IMAGE_LAYOUT_PREINITIALIZED in InitImageInfo()
191 if (!GrVkMemory::AllocAndBindImageMemory(gpu, image, isLinear, &alloc)) { in InitImageInfo()
208 bool isLinear = VK_IMAGE_TILING_LINEAR == info->fImageTiling; in DestroyImageInfo() local
209 GrVkMemory::FreeImageMemory(gpu, isLinear, info->fAlloc); in DestroyImageInfo()
245 bool isLinear = (VK_IMAGE_TILING_LINEAR == fImageTiling); in freeGPUData() local
246 GrVkMemory::FreeImageMemory(gpu, isLinear, fAlloc); in freeGPUData()
/external/skia/bench/
DTriangulatorBench.cpp100 bool isLinear; in doLoop() local
102 &isLinear); in doLoop()
114 bool isLinear; in doLoop() local
117 GrInnerFanTriangulator(path, &fArena).pathToTriangles(this, &breadcrumbList, &isLinear); in doLoop()
/external/skia/src/gpu/vk/
DGrVkImage.cpp219 bool isLinear = VK_IMAGE_TILING_LINEAR == imageDesc.fImageTiling; in InitImageInfo() local
220 VkImageLayout initialLayout = isLinear ? VK_IMAGE_LAYOUT_PREINITIALIZED in InitImageInfo()
260 if (!GrVkMemory::AllocAndBindImageMemory(gpu, image, isLinear, &alloc)) { in InitImageInfo()
282 bool isLinear = VK_IMAGE_TILING_LINEAR == info->fImageTiling; in DestroyImageInfo() local
283 GrVkMemory::FreeImageMemory(gpu, isLinear, info->fAlloc); in DestroyImageInfo()
325 bool isLinear = (VK_IMAGE_TILING_LINEAR == fImageTiling); in freeGPUData() local
326 GrVkMemory::FreeImageMemory(fGpu, isLinear, fAlloc); in freeGPUData()
/external/skia/src/gpu/tessellate/
DGrPathInnerTriangulateOp.cpp78 bool isLinear; in prePreparePrograms() local
80 fFanPolys = fFanTriangulator->pathToPolys(&fFanBreadcrumbs, &isLinear); in prePreparePrograms()
84 if (forceRedbookStencilPass || !isLinear) { // Curves always get stencilled. in prePreparePrograms()
97 if (!isLinear) { in prePreparePrograms()
120 } else if (isLinear) { in prePreparePrograms()
202 if (doFill && !isLinear) { in prePreparePrograms()
/external/skia/src/gpu/ops/
DGrTriangulatingPathRenderer.cpp58 static sk_sp<SkData> create_data(int numVertices, bool isLinear, SkScalar tol) { in create_data() argument
59 TessInfo info { numVertices, isLinear, tol }; in create_data()
335 bool* isLinear) { in Triangulate() argument
348 return GrTriangulator::PathToTriangles(path, tol, clipBounds, allocator, isLinear); in Triangulate()
391 bool isLinear; in createNonAAMesh() local
393 &isLinear); in createNonAAMesh()
400 key.setCustomData(create_data(vertexCount, isLinear, tol)); in createNonAAMesh()
527 bool isLinear; in onPrePrepareDraws() local
529 &isLinear); in onPrePrepareDraws()
536 key.setCustomData(create_data(vertexCount, isLinear, tol)); in onPrePrepareDraws()
/external/skia/fuzz/
DFuzzTriangulation.cpp29 bool isLinear; in DEF_FUZZ() local
31 GrTriangulator::PathToTriangles(path, tol, clipBounds, &allocator, &isLinear); in DEF_FUZZ()
/external/mesa3d/src/amd/addrlib/src/core/
Daddrlib1.h65 UINT_32 isLinear : 1; member
237 BOOL_32 isTcCompatible, BOOL_32 isLinear, ADDR_TILEINFO* pTileInfo) const = 0;
246 BOOL_32 isLinear, UINT_32 numSlices, UINT_64* pSliceBytes, UINT_32 baseAlign) const = 0;
318 BOOL_32 isLinear, BOOL_32 isWidth8, BOOL_32 isHeight8,
327 UINT_32 pitchIn, UINT_32 heightIn, UINT_32 numSlices, BOOL_32 isLinear,
339 UINT_32 numSlices, UINT_32 factor, BOOL_32 isLinear, BOOL_32 isWidth8,
345 UINT_32 factor, BOOL_32 isLinear, BOOL_32 isWidth8, BOOL_32 isHeight8,
Daddrlib1.cpp1325 pIn->isLinear, in ComputeHtileInfo()
1395 pIn->isLinear, in ComputeCmaskInfo()
1527 pIn->isLinear, in ComputeHtileAddrFromCoord()
1595 pIn->isLinear, in ComputeHtileCoordFromAddr()
1667 pIn->isLinear, in ComputeCmaskAddrFromCoord()
1732 pIn->isLinear, in ComputeCmaskCoordFromAddr()
1833 BOOL_32 isLinear, ///< [in] if it is linear mode in ComputeHtileInfo() argument
1858 if (isLinear) in ComputeHtileInfo()
1877 baseAlign = HwlComputeHtileBaseAlign(flags.tcCompatible, isLinear, pTileInfo); in ComputeHtileInfo()
1882 isLinear, in ComputeHtileInfo()
[all …]
/external/skqp/src/gpu/ops/
DGrTessellatingPathRenderer.cpp281 bool isLinear; in draw() local
285 &isLinear); in draw()
291 info.fTolerance = isLinear ? 0 : tol; in draw()
309 bool isLinear; in drawAA() local
312 &isLinear); in drawAA()

12