Lines Matching refs:buffer
48 GrGeometryBuffer* buffer = this->createBuffer(fMinBlockSize);
49 if (NULL != buffer) {
50 *fPreallocBuffers.append() = buffer;
58 GrGeometryBuffer* buffer = fBlocks.back().fBuffer;
59 if (buffer->isLocked()) {
60 buffer->unlock();
81 GrGeometryBuffer* buffer = fBlocks.back().fBuffer;
82 if (buffer->isLocked()) {
83 buffer->unlock();
155 const GrGeometryBuffer** buffer,
159 GrAssert(NULL != buffer);
170 *buffer = back.fBuffer;
181 // the part of the buffer we update. Also, the GL buffer implementation
182 // may be cheating on the actual buffer size by shrinking the buffer on
183 // updateData() if the amount of data passed is less than the full buffer
193 *buffer = back.fBuffer;
300 // If the buffer is CPU-backed we lock it because it is free to do so and saves a copy.
301 // Otherwise when buffer locking is supported:
304 // b) If the hint is not set we lock if the buffer size is greater than the threshold.
346 void GrBufferAllocPool::flushCpuData(GrGeometryBuffer* buffer,
348 GrAssert(NULL != buffer);
349 GrAssert(!buffer->isLocked());
351 GrAssert(flushSize <= buffer->sizeInBytes());
356 void* data = buffer->lock();
359 buffer->unlock();
363 buffer->updateData(fBufferPtr, flushSize);
391 const GrVertexBuffer** buffer,
395 GrAssert(NULL != buffer);
405 *buffer = (const GrVertexBuffer*) geomBuffer;
414 const GrVertexBuffer** buffer,
416 void* space = makeSpace(vertexSize, vertexCount, buffer, startVertex);
449 const GrIndexBuffer** buffer,
453 GrAssert(NULL != buffer);
463 *buffer = (const GrIndexBuffer*) geomBuffer;
471 const GrIndexBuffer** buffer,
473 void* space = makeSpace(indexCount, buffer, startIndex);
