Home
last modified time | relevance | path

Searched refs:eagerCount (Results 1 – 5 of 5) sorted by relevance

/third_party/skia/src/gpu/
DGrEagerVertexAllocator.cpp13 void* GrEagerDynamicVertexAllocator::lock(size_t stride, int eagerCount) { in lock() argument
15 SkASSERT(eagerCount); in lock()
16 if (void* data = fTarget->makeVertexSpace(stride, eagerCount, fVertexBuffer, fBaseVertex)) { in lock()
18 fLockCount = eagerCount; in lock()
38 void* GrCpuVertexAllocator::lock(size_t stride, int eagerCount) { in lock() argument
40 SkASSERT(stride && eagerCount); in lock()
42 fVertices = sk_malloc_throw(eagerCount * stride); in lock()
DGrEagerVertexAllocator.h26 template<typename T> T* lock(int eagerCount) { in lock() argument
27 return static_cast<T*>(this->lock(sizeof(T), eagerCount)); in lock()
29 virtual void* lock(size_t stride, int eagerCount) = 0;
58 void* lock(size_t stride, int eagerCount) final;
82 void* lock(size_t stride, int eagerCount) override;
/third_party/skia/bench/
DTriangulatorBench.cpp75 void* lock(size_t stride, int eagerCount) override { in lock() argument
76 size_t allocSize = eagerCount * stride; in lock()
/third_party/skia/src/gpu/ops/
DTriangulatingPathRenderer.cpp108 void* lock(size_t stride, int eagerCount) override { in lock() argument
110 SkASSERT(stride && eagerCount); in lock()
112 size_t size = eagerCount * stride; in lock()
122 fVertices = sk_malloc_throw(eagerCount * stride); in lock()
/third_party/skia/tests/
DTriangulatingPathRendererTests.cpp784 void* lock(size_t stride, int eagerCount) override { in lock() argument
787 fPoints.reset(eagerCount); in lock()