1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/gfx/skia/trunk/src/gpu/GrAllocPool.cpp Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,116 @@
1.4 +/*
1.5 + * Copyright 2010 Google Inc.
1.6 + *
1.7 + * Use of this source code is governed by a BSD-style license that can be
1.8 + * found in the LICENSE file.
1.9 + */
1.10 +
1.11 +#include "GrAllocPool.h"
1.12 +
1.13 +#include "GrTypes.h"
1.14 +
1.15 +#define GrAllocPool_MIN_BLOCK_SIZE ((size_t)128)
1.16 +
1.17 +struct GrAllocPool::Block {
1.18 + Block* fNext;
1.19 + char* fPtr;
1.20 + size_t fBytesFree;
1.21 + size_t fBytesTotal;
1.22 +
1.23 + static Block* Create(size_t size, Block* next) {
1.24 + SkASSERT(size >= GrAllocPool_MIN_BLOCK_SIZE);
1.25 +
1.26 + Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size);
1.27 + block->fNext = next;
1.28 + block->fPtr = (char*)block + sizeof(Block);
1.29 + block->fBytesFree = size;
1.30 + block->fBytesTotal = size;
1.31 + return block;
1.32 + }
1.33 +
1.34 + bool canAlloc(size_t bytes) const {
1.35 + return bytes <= fBytesFree;
1.36 + }
1.37 +
1.38 + void* alloc(size_t bytes) {
1.39 + SkASSERT(bytes <= fBytesFree);
1.40 + fBytesFree -= bytes;
1.41 + void* ptr = fPtr;
1.42 + fPtr += bytes;
1.43 + return ptr;
1.44 + }
1.45 +
1.46 + size_t release(size_t bytes) {
1.47 + SkASSERT(bytes > 0);
1.48 + size_t free = GrMin(bytes, fBytesTotal - fBytesFree);
1.49 + fBytesFree += free;
1.50 + fPtr -= free;
1.51 + return bytes - free;
1.52 + }
1.53 +
1.54 + bool empty() const { return fBytesTotal == fBytesFree; }
1.55 +};
1.56 +
1.57 +///////////////////////////////////////////////////////////////////////////////
1.58 +
1.59 +GrAllocPool::GrAllocPool(size_t blockSize) {
1.60 + fBlock = NULL;
1.61 + fMinBlockSize = GrMax(blockSize, GrAllocPool_MIN_BLOCK_SIZE);
1.62 + SkDEBUGCODE(fBlocksAllocated = 0;)
1.63 +}
1.64 +
1.65 +GrAllocPool::~GrAllocPool() {
1.66 + this->reset();
1.67 +}
1.68 +
1.69 +void GrAllocPool::reset() {
1.70 + this->validate();
1.71 +
1.72 + Block* block = fBlock;
1.73 + while (block) {
1.74 + Block* next = block->fNext;
1.75 + sk_free(block);
1.76 + block = next;
1.77 + }
1.78 + fBlock = NULL;
1.79 + SkDEBUGCODE(fBlocksAllocated = 0;)
1.80 +}
1.81 +
1.82 +void* GrAllocPool::alloc(size_t size) {
1.83 + this->validate();
1.84 +
1.85 + if (!fBlock || !fBlock->canAlloc(size)) {
1.86 + size_t blockSize = GrMax(fMinBlockSize, size);
1.87 + fBlock = Block::Create(blockSize, fBlock);
1.88 + SkDEBUGCODE(fBlocksAllocated += 1;)
1.89 + }
1.90 + return fBlock->alloc(size);
1.91 +}
1.92 +
1.93 +void GrAllocPool::release(size_t bytes) {
1.94 + this->validate();
1.95 +
1.96 + while (bytes && NULL != fBlock) {
1.97 + bytes = fBlock->release(bytes);
1.98 + if (fBlock->empty()) {
1.99 + Block* next = fBlock->fNext;
1.100 + sk_free(fBlock);
1.101 + fBlock = next;
1.102 + SkDEBUGCODE(fBlocksAllocated -= 1;)
1.103 + }
1.104 + }
1.105 +}
1.106 +
1.107 +#ifdef SK_DEBUG
1.108 +
1.109 +void GrAllocPool::validate() const {
1.110 + Block* block = fBlock;
1.111 + int count = 0;
1.112 + while (block) {
1.113 + count += 1;
1.114 + block = block->fNext;
1.115 + }
1.116 + SkASSERT(fBlocksAllocated == count);
1.117 +}
1.118 +
1.119 +#endif
