Searched refs:eagerCount (Results 1 - 5 of 5) sorted by relevance
| /third_party/skia/src/gpu/ |
| H A D | GrEagerVertexAllocator.cpp | 13 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()
|
| H A D | GrEagerVertexAllocator.h | 18 // 1. Call lock(eagerCount) with an upper bound on the number of required vertices.
26 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/src/gpu/ops/ |
| H A D | TriangulatingPathRenderer.cpp | 108 void* lock(size_t stride, int eagerCount) override {
110 SkASSERT(stride && eagerCount); variable
112 size_t size = eagerCount * stride;
122 fVertices = sk_malloc_throw(eagerCount * stride);
|
| /third_party/skia/tests/ |
| H A D | TriangulatingPathRendererTests.cpp | 784 void* lock(size_t stride, int eagerCount) override {
787 fPoints.reset(eagerCount);
|
| /third_party/skia/bench/ |
| H A D | TriangulatorBench.cpp | 75 void* lock(size_t stride, int eagerCount) override {
76 size_t allocSize = eagerCount * stride;
|
Completed in 5 milliseconds