/external/skia/src/pathops/ |
D | SkPathOpsConic.h | 69 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 …]
|
D | 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 { 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()
|
D | 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 { 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 …]
|
D | 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;
|
D | SkPathOpsQuad.cpp | 47 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 …]
|
D | SkPathOpsConic.cpp | 84 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()
|
D | SkPathOpsCubic.cpp | 148 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 …]
|
D | SkReduceOrder.cpp | 40 if (!quad.isLinear(0, 2)) { in check_linear() 153 if (!cubic.isLinear(0, 3)) { in check_linear()
|
/external/skqp/src/pathops/ |
D | SkPathOpsConic.h | 69 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 …]
|
D | 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 { 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()
|
D | 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 { 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 …]
|
D | 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;
|
D | SkPathOpsQuad.cpp | 47 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 …]
|
D | SkPathOpsConic.cpp | 84 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()
|
D | SkPathOpsCubic.cpp | 148 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 …]
|
D | SkReduceOrder.cpp | 40 if (!quad.isLinear(0, 2)) { in check_linear() 153 if (!cubic.isLinear(0, 3)) { in check_linear()
|
/external/skqp/src/gpu/vk/ |
D | GrVkImage.cpp | 157 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/src/gpu/vk/ |
D | GrVkImage.cpp | 163 bool isLinear = VK_IMAGE_TILING_LINEAR == imageDesc.fImageTiling; in InitImageInfo() local 164 VkImageLayout initialLayout = isLinear ? VK_IMAGE_LAYOUT_PREINITIALIZED in InitImageInfo() 197 if (!GrVkMemory::AllocAndBindImageMemory(gpu, image, isLinear, &alloc)) { in InitImageInfo() 214 bool isLinear = VK_IMAGE_TILING_LINEAR == info->fImageTiling; in DestroyImageInfo() local 215 GrVkMemory::FreeImageMemory(gpu, isLinear, info->fAlloc); in DestroyImageInfo() 268 bool isLinear = (VK_IMAGE_TILING_LINEAR == fImageTiling); in freeGPUData() local 269 GrVkMemory::FreeImageMemory(gpu, isLinear, fAlloc); in freeGPUData()
|
/external/mesa3d/src/amd/addrlib/core/ |
D | addrlib1.h | 65 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,
|
D | addrlib1.cpp | 1321 pIn->isLinear, in ComputeHtileInfo() 1389 pIn->isLinear, in ComputeCmaskInfo() 1517 pIn->isLinear, in ComputeHtileAddrFromCoord() 1585 pIn->isLinear, in ComputeHtileCoordFromAddr() 1657 pIn->isLinear, in ComputeCmaskAddrFromCoord() 1722 pIn->isLinear, in ComputeCmaskCoordFromAddr() 1823 BOOL_32 isLinear, ///< [in] if it is linear mode in ComputeHtileInfo() argument 1848 if (isLinear) in ComputeHtileInfo() 1867 baseAlign = HwlComputeHtileBaseAlign(flags.tcCompatible, isLinear, pTileInfo); in ComputeHtileInfo() 1872 isLinear, in ComputeHtileInfo() [all …]
|
/external/skqp/src/gpu/ops/ |
D | GrTessellatingPathRenderer.cpp | 281 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()
|
/external/skia/src/gpu/ops/ |
D | GrTessellatingPathRenderer.cpp | 282 bool isLinear; in draw() local 286 &isLinear); in draw() 292 info.fTolerance = isLinear ? 0 : tol; in draw() 310 bool isLinear; in drawAA() local 313 &isLinear); in drawAA()
|
/external/mesa3d/src/amd/addrlib/r800/ |
D | 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;
|
/external/skqp/src/gpu/ |
D | GrTessellator.h | 50 VertexAllocator*, bool antialias, bool *isLinear);
|
/external/skia/src/gpu/ |
D | GrTessellator.h | 50 VertexAllocator*, bool antialias, bool *isLinear);
|