| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #include "GrMemoryPool.h" | 8 #include "GrMemoryPool.h" |
| 9 | 9 |
| 10 #ifdef SK_DEBUG | 10 #ifdef SK_DEBUG |
| 11 #define VALIDATE this->validate() | 11 #define VALIDATE this->validate() |
| 12 #else | 12 #else |
| 13 #define VALIDATE | 13 #define VALIDATE |
| 14 #endif | 14 #endif |
| 15 | 15 |
| 16 GrMemoryPool::GrMemoryPool(size_t preallocSize, size_t minAllocSize) { | 16 GrMemoryPool::GrMemoryPool(size_t preallocSize, size_t minAllocSize) { |
| 17 SkDEBUGCODE(fAllocationCnt = 0); | 17 SkDEBUGCODE(fAllocationCnt = 0); |
| 18 | 18 |
| 19 minAllocSize = GrMax<size_t>(minAllocSize, 1 << 10); | 19 minAllocSize = SkTMax<size_t>(minAllocSize, 1 << 10); |
| 20 fMinAllocSize = GrSizeAlignUp(minAllocSize + kPerAllocPad, kAlignment), | 20 fMinAllocSize = GrSizeAlignUp(minAllocSize + kPerAllocPad, kAlignment), |
| 21 fPreallocSize = GrSizeAlignUp(preallocSize + kPerAllocPad, kAlignment); | 21 fPreallocSize = GrSizeAlignUp(preallocSize + kPerAllocPad, kAlignment); |
| 22 fPreallocSize = GrMax(fPreallocSize, fMinAllocSize); | 22 fPreallocSize = SkTMax(fPreallocSize, fMinAllocSize); |
| 23 | 23 |
| 24 fHead = CreateBlock(fPreallocSize); | 24 fHead = CreateBlock(fPreallocSize); |
| 25 fTail = fHead; | 25 fTail = fHead; |
| 26 fHead->fNext = NULL; | 26 fHead->fNext = NULL; |
| 27 fHead->fPrev = NULL; | 27 fHead->fPrev = NULL; |
| 28 VALIDATE; | 28 VALIDATE; |
| 29 }; | 29 }; |
| 30 | 30 |
| 31 GrMemoryPool::~GrMemoryPool() { | 31 GrMemoryPool::~GrMemoryPool() { |
| 32 VALIDATE; | 32 VALIDATE; |
| 33 SkASSERT(0 == fAllocationCnt); | 33 SkASSERT(0 == fAllocationCnt); |
| 34 SkASSERT(fHead == fTail); | 34 SkASSERT(fHead == fTail); |
| 35 SkASSERT(0 == fHead->fLiveCount); | 35 SkASSERT(0 == fHead->fLiveCount); |
| 36 DeleteBlock(fHead); | 36 DeleteBlock(fHead); |
| 37 }; | 37 }; |
| 38 | 38 |
| 39 void* GrMemoryPool::allocate(size_t size) { | 39 void* GrMemoryPool::allocate(size_t size) { |
| 40 VALIDATE; | 40 VALIDATE; |
| 41 size = GrSizeAlignUp(size, kAlignment); | 41 size = GrSizeAlignUp(size, kAlignment); |
| 42 size += kPerAllocPad; | 42 size += kPerAllocPad; |
| 43 if (fTail->fFreeSize < size) { | 43 if (fTail->fFreeSize < size) { |
| 44 size_t blockSize = size; | 44 size_t blockSize = size; |
| 45 blockSize = GrMax<size_t>(blockSize, fMinAllocSize); | 45 blockSize = SkTMax<size_t>(blockSize, fMinAllocSize); |
| 46 BlockHeader* block = CreateBlock(blockSize); | 46 BlockHeader* block = CreateBlock(blockSize); |
| 47 | 47 |
| 48 block->fPrev = fTail; | 48 block->fPrev = fTail; |
| 49 block->fNext = NULL; | 49 block->fNext = NULL; |
| 50 SkASSERT(NULL == fTail->fNext); | 50 SkASSERT(NULL == fTail->fNext); |
| 51 fTail->fNext = block; | 51 fTail->fNext = block; |
| 52 fTail = block; | 52 fTail = block; |
| 53 } | 53 } |
| 54 SkASSERT(fTail->fFreeSize >= size); | 54 SkASSERT(fTail->fFreeSize >= size); |
| 55 intptr_t ptr = fTail->fCurrPtr; | 55 intptr_t ptr = fTail->fCurrPtr; |
| (...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 152 SkASSERT(userStart == block->fCurrPtr); | 152 SkASSERT(userStart == block->fCurrPtr); |
| 153 } else { | 153 } else { |
| 154 SkASSERT(block == *reinterpret_cast<BlockHeader**>(userStart)); | 154 SkASSERT(block == *reinterpret_cast<BlockHeader**>(userStart)); |
| 155 } | 155 } |
| 156 prev = block; | 156 prev = block; |
| 157 } while ((block = block->fNext)); | 157 } while ((block = block->fNext)); |
| 158 SkASSERT(allocCount == fAllocationCnt); | 158 SkASSERT(allocCount == fAllocationCnt); |
| 159 SkASSERT(prev == fTail); | 159 SkASSERT(prev == fTail); |
| 160 #endif | 160 #endif |
| 161 } | 161 } |
| OLD | NEW |