| /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()
|
| D | SkPathOpsCubic.h | 78 bool hullIntersects(const SkDCubic& c2, bool* isLinear) const;
79 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
80 bool hullIntersects(const SkDQuad& c2, bool* isLinear) const;
81 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
82 bool isLinear(int startIndex, int endIndex) const;
|
| D | SkPathOpsQuad.h | 80 bool hullIntersects(const SkDQuad& , bool* isLinear) const;
81 bool hullIntersects(const SkDConic& , bool* isLinear) const;
82 bool hullIntersects(const SkDCubic& , bool* isLinear) const;
83 bool isLinear(int startIndex, int endIndex) const;
|
| D | SkPathOpsQuad.cpp | 43 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const { in hullIntersects()
77 *isLinear = linear; in hullIntersects()
81 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
82 return conic.hullIntersects(*this, isLinear); in hullIntersects()
85 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
86 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
175 bool SkDQuad::isLinear(int startIndex, int endIndex) const { in isLinear() function in SkDQuad
|
| D | SkPathOpsCubic.cpp | 149 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, c2.kPointCount, isLinear); in hullIntersects()
202 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
203 return hullIntersects(quad.fPts, quad.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()
|
| D | SkPathOpsConic.cpp | 83 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
84 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
|
| D | SkReduceOrder.cpp | 40 if (!quad.isLinear(0, 2)) { in check_linear()
153 if (!cubic.isLinear(0, 3)) { in check_linear()
|
| /external/skia/src/gpu/vk/ |
| D | GrVkImage.cpp | 74 bool isLinear = VK_IMAGE_TILING_LINEAR == imageDesc.fImageTiling; in InitImageInfo() local
75 VkImageLayout initialLayout = isLinear ? VK_IMAGE_LAYOUT_PREINITIALIZED in InitImageInfo()
112 if (!GrVkMemory::AllocAndBindImageMemory(gpu, image, isLinear, &alloc)) { in InitImageInfo()
128 bool isLinear = VK_IMAGE_TILING_LINEAR == info->fImageTiling; in DestroyImageInfo() local
129 GrVkMemory::FreeImageMemory(gpu, isLinear, info->fAlloc); in DestroyImageInfo()
157 bool isLinear = (VK_IMAGE_TILING_LINEAR == fImageTiling); in freeGPUData() local
158 GrVkMemory::FreeImageMemory(gpu, isLinear, fAlloc); in freeGPUData()
|
| /external/skia/src/gpu/ops/ |
| D | GrTessellatingPathRenderer.cpp | 237 bool isLinear; in draw() local
241 false, GrColor(), false, &isLinear); in draw()
247 info.fTolerance = isLinear ? 0 : tol; in draw()
262 bool isLinear; in drawAA() local
266 &isLinear); in drawAA()
|
| /external/skia/src/gpu/ |
| D | GrTessellator.h | 50 bool canTweakAlphaForCoverage, bool *isLinear);
|
| D | GrTessellator.cpp | 688 VertexList* contours, SkArenaAlloc& alloc, bool *isLinear) { in path_to_contours() argument
692 *isLinear = true; in path_to_contours()
716 *isLinear = false; in path_to_contours()
733 *isLinear = false; in path_to_contours()
740 *isLinear = false; in path_to_contours()
1749 int contourCnt, SkArenaAlloc& alloc, bool antialias, bool* isLinear, in path_to_polys() argument
1757 path_to_contours(path, tolerance, clipBounds, contours.get(), alloc, isLinear); in path_to_polys()
1817 bool canTweakAlphaForCoverage, bool* isLinear) { in PathToTriangles() argument
1820 *isLinear = true; in PathToTriangles()
1826 isLinear, &outerMesh); in PathToTriangles()
[all …]
|
| /external/deqp/modules/gles31/functional/ |
| D | es31fTextureFilteringTests.cpp | 602 const bool isLinear = isLinearI != 0; in init() local
603 const deUint32 filter = isLinear ? GL_LINEAR : GL_NEAREST; in init()
606 isLinear ? "linear" : "nearest", "", in init()
|
| /external/deqp/external/vulkancts/modules/vulkan/texture/ |
| D | vktTextureFilteringTests.cpp | 1174 const bool isLinear = isLinearI != 0; in populateTextureFilteringTests() local
1175 const string name = isLinear ? "linear" : "nearest"; in populateTextureFilteringTests()
1179 testParameters.minFilter = isLinear ? Sampler::LINEAR : Sampler::NEAREST; in populateTextureFilteringTests()
1180 testParameters.magFilter = isLinear ? Sampler::LINEAR : Sampler::NEAREST; in populateTextureFilteringTests()
|
| /external/deqp/modules/gles3/functional/ |
| D | es3fTextureFilteringTests.cpp | 1525 bool isLinear = isLinearI != 0; in init() local
1526 deUint32 filter = isLinear ? GL_LINEAR : GL_NEAREST; in init()
1529 isLinear ? "linear" : "nearest", "", in init()
|
| /external/deqp/external/vulkancts/modules/vulkan/api/ |
| D | vktApiCopiesAndBlittingTests.cpp | 1879 const bool isLinear = m_params.filter == VK_FILTER_LINEAR; in checkClampedAndUnclampedResult() local
1886 if (isLinear) in checkClampedAndUnclampedResult()
1898 if (isLinear) in checkClampedAndUnclampedResult()
1901 if (!isOk && isLinear) in checkClampedAndUnclampedResult()
1918 if (isLinear) in checkClampedAndUnclampedResult()
1921 if (!isOk && isLinear) in checkClampedAndUnclampedResult()
|