HomeSort by relevance Sort by last modified time
    Searched refs:isLinear (Results 1 - 25 of 35) sorted by null

1 2

  /external/skia/src/pathops/
SkPathOpsTCurve.h 29 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;
SkPathOpsConic.h 69 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const {
70 return fPts.hullIntersects(quad, isLinear);
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const {
74 return fPts.hullIntersects(conic.fPts, isLinear);
77 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
79 bool isLinear(int startIndex, int endIndex) const {
80 return fPts.isLinear(startIndex, endIndex);
161 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
163 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override {
164 return conic.hullIntersects(fConic, isLinear);
    [all...]
SkPathOpsCubic.h 79 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 {
213 return cubic.hullIntersects(fCubic, isLinear);
216 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override
    [all...]
SkPathOpsQuad.h 81 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 {
154 return quad.hullIntersects(fQuad, isLinear);
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 {
161 return curve.hullIntersects(fQuad, isLinear);
    [all...]
SkPathOpsQuad.cpp 47 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const {
81 *isLinear = linear;
85 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const {
86 return conic.hullIntersects(*this, isLinear);
89 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const {
90 return cubic.hullIntersects(*this, isLinear);
185 bool SkDQuad::isLinear(int startIndex, int endIndex) const {
406 bool SkTQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const {
407 return conic.hullIntersects(fQuad, isLinear);
410 bool SkTQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const
    [all...]
SkPathOpsConic.cpp 84 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const {
85 return cubic.hullIntersects(*this, isLinear);
180 bool SkTConic::hullIntersects(const SkDQuad& quad, bool* isLinear) const {
181 return quad.hullIntersects(fConic, isLinear);
184 bool SkTConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const {
185 return cubic.hullIntersects(fConic, isLinear);
SkPathOpsCubic.cpp 148 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const {
193 *isLinear = linear;
197 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const {
198 return hullIntersects(c2.fPts, c2.kPointCount, isLinear);
201 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const {
202 return hullIntersects(quad.fPts, quad.kPointCount, isLinear);
205 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const {
207 return hullIntersects(conic.fPts, isLinear);
210 bool SkDCubic::isLinear(int startIndex, int endIndex) const {
212 return ((const SkDQuad *) this)->isLinear(0, 2)
    [all...]
SkReduceOrder.cpp 40 if (!quad.isLinear(0, 2)) {
153 if (!cubic.isLinear(0, 3)) {
  /external/skqp/src/pathops/
SkPathOpsTCurve.h 29 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;
SkPathOpsConic.h 69 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const {
70 return fPts.hullIntersects(quad, isLinear);
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const {
74 return fPts.hullIntersects(conic.fPts, isLinear);
77 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
79 bool isLinear(int startIndex, int endIndex) const {
80 return fPts.isLinear(startIndex, endIndex);
161 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
163 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override {
164 return conic.hullIntersects(fConic, isLinear);
    [all...]
SkPathOpsCubic.h 79 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 {
213 return cubic.hullIntersects(fCubic, isLinear);
216 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override
    [all...]
SkPathOpsQuad.h 81 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 {
154 return quad.hullIntersects(fQuad, isLinear);
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 {
161 return curve.hullIntersects(fQuad, isLinear);
    [all...]
SkPathOpsQuad.cpp 47 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const {
81 *isLinear = linear;
85 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const {
86 return conic.hullIntersects(*this, isLinear);
89 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const {
90 return cubic.hullIntersects(*this, isLinear);
185 bool SkDQuad::isLinear(int startIndex, int endIndex) const {
406 bool SkTQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const {
407 return conic.hullIntersects(fQuad, isLinear);
410 bool SkTQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const
    [all...]
SkPathOpsConic.cpp 84 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const {
85 return cubic.hullIntersects(*this, isLinear);
180 bool SkTConic::hullIntersects(const SkDQuad& quad, bool* isLinear) const {
181 return quad.hullIntersects(fConic, isLinear);
184 bool SkTConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const {
185 return cubic.hullIntersects(fConic, isLinear);
SkPathOpsCubic.cpp 148 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const {
193 *isLinear = linear;
197 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const {
198 return hullIntersects(c2.fPts, c2.kPointCount, isLinear);
201 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const {
202 return hullIntersects(quad.fPts, quad.kPointCount, isLinear);
205 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const {
207 return hullIntersects(conic.fPts, isLinear);
210 bool SkDCubic::isLinear(int startIndex, int endIndex) const {
212 return ((const SkDQuad *) this)->isLinear(0, 2)
    [all...]
SkReduceOrder.cpp 40 if (!quad.isLinear(0, 2)) {
153 if (!cubic.isLinear(0, 3)) {
  /external/skia/src/gpu/
GrTessellator.h 50 VertexAllocator*, bool antialias, bool *isLinear);
  /external/skqp/src/gpu/
GrTessellator.h 50 VertexAllocator*, bool antialias, bool *isLinear);
  /external/skia/src/gpu/vk/
GrVkImage.cpp 163 bool isLinear = VK_IMAGE_TILING_LINEAR == imageDesc.fImageTiling;
164 VkImageLayout initialLayout = isLinear ? VK_IMAGE_LAYOUT_PREINITIALIZED
197 if (!GrVkMemory::AllocAndBindImageMemory(gpu, image, isLinear, &alloc)) {
214 bool isLinear = VK_IMAGE_TILING_LINEAR == info->fImageTiling;
215 GrVkMemory::FreeImageMemory(gpu, isLinear, info->fAlloc);
268 bool isLinear = (VK_IMAGE_TILING_LINEAR == fImageTiling);
269 GrVkMemory::FreeImageMemory(gpu, isLinear, fAlloc);
  /external/skqp/src/gpu/vk/
GrVkImage.cpp 157 bool isLinear = VK_IMAGE_TILING_LINEAR == imageDesc.fImageTiling;
158 VkImageLayout initialLayout = isLinear ? VK_IMAGE_LAYOUT_PREINITIALIZED
191 if (!GrVkMemory::AllocAndBindImageMemory(gpu, image, isLinear, &alloc)) {
208 bool isLinear = VK_IMAGE_TILING_LINEAR == info->fImageTiling;
209 GrVkMemory::FreeImageMemory(gpu, isLinear, info->fAlloc);
245 bool isLinear = (VK_IMAGE_TILING_LINEAR == fImageTiling);
246 GrVkMemory::FreeImageMemory(gpu, isLinear, fAlloc);
  /external/mesa3d/src/amd/addrlib/core/
addrlib1.h 65 UINT_32 isLinear : 1;
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,
458 static BOOL_32 IsLinear(AddrTileMode tileMode);
addrlib1.cpp 264 ADDR_ASSERT(IsLinear(localIn.tileMode));
    [all...]
  /external/skia/src/gpu/ops/
GrTessellatingPathRenderer.cpp 282 bool isLinear;
286 &isLinear);
292 info.fTolerance = isLinear ? 0 : tol;
310 bool isLinear;
313 &isLinear);
  /external/skqp/src/gpu/ops/
GrTessellatingPathRenderer.cpp 281 bool isLinear;
285 &isLinear);
291 info.fTolerance = isLinear ? 0 : tol;
309 bool isLinear;
312 &isLinear);
  /external/mesa3d/src/amd/addrlib/r800/
siaddrlib.h 125 UINT_32 factor, BOOL_32 isLinear, BOOL_32 isWidth8, BOOL_32 isHeight8,
130 UINT_32 factor, BOOL_32 isLinear, BOOL_32 isWidth8, BOOL_32 isHeight8,
156 BOOL_32 isLinear, UINT_32 numSlices, UINT_64* pSliceBytes, UINT_32 baseAlign) const;

Completed in 1507 milliseconds

1 2