blob: 1dd1732ea97edad53115cc835a639b81a1eaf3a7 [file] [log] [blame]
bsalomon@google.com4da34e32012-06-19 15:40:27 +00001/*
2 * Copyright 2012 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7
8#ifndef GrMemoryPool_DEFINED
9#define GrMemoryPool_DEFINED
10
11#include "GrTypes.h"
12
13/**
14 * Allocates memory in blocks and parcels out space in the blocks for allocation
15 * requests. It is optimized for allocate / release speed over memory
16 * effeciency. The interface is designed to be used to implement operator new
17 * and delete overrides. All allocations are expected to be released before the
18 * pool's destructor is called. Allocations will be 8-byte aligned.
19 */
20class GrMemoryPool {
21public:
22 /**
23 * Prealloc size is the amount of space to make available at pool creation
24 * time and keep around until pool destruction. The min alloc size is the
25 * smallest allowed size of additional allocations.
26 */
27 GrMemoryPool(size_t preallocSize, size_t minAllocSize);
28
29 ~GrMemoryPool();
30
31 /**
32 * Allocates memory. The memory must be freed with release().
33 */
34 void* allocate(size_t size);
35
36 /**
37 * p must have been returned by allocate()
38 */
39 void release(void* p);
40
41 /**
42 * Returns true if there are no unreleased allocations.
43 */
44 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
45
joshualittb7133be2015-04-08 09:08:31 -070046 /**
joshualitt22c6f5c2016-01-05 08:07:18 -080047 * Returns the total allocated size of the GrMemoryPool minus any preallocated amount
joshualittb7133be2015-04-08 09:08:31 -070048 */
49 size_t size() const { return fSize; }
50
bsalomon@google.com4da34e32012-06-19 15:40:27 +000051private:
52 struct BlockHeader;
53
commit-bot@chromium.org8743b8f2013-08-01 14:23:33 +000054 static BlockHeader* CreateBlock(size_t size);
bsalomon@google.com4da34e32012-06-19 15:40:27 +000055
commit-bot@chromium.org8743b8f2013-08-01 14:23:33 +000056 static void DeleteBlock(BlockHeader* block);
bsalomon@google.com4da34e32012-06-19 15:40:27 +000057
58 void validate();
59
60 struct BlockHeader {
tomhudson@google.comdcba4c22012-07-24 21:36:16 +000061 BlockHeader* fNext; ///< doubly-linked list of blocks.
bsalomon@google.com4da34e32012-06-19 15:40:27 +000062 BlockHeader* fPrev;
tomhudson@google.comdcba4c22012-07-24 21:36:16 +000063 int fLiveCount; ///< number of outstanding allocations in the
64 ///< block.
65 intptr_t fCurrPtr; ///< ptr to the start of blocks free space.
66 intptr_t fPrevPtr; ///< ptr to the last allocation made
67 size_t fFreeSize; ///< amount of free space left in the block.
joshualittb7133be2015-04-08 09:08:31 -070068 size_t fSize; ///< total allocated size of the block
bsalomon@google.com4da34e32012-06-19 15:40:27 +000069 };
70
robertphillips19c62502016-01-06 07:04:46 -080071 static const uint32_t kAssignedMarker = 0xCDCDCDCD;
72 static const uint32_t kFreedMarker = 0xEFEFEFEF;
73
74 struct AllocHeader {
75#ifdef SK_DEBUG
76 uint32_t fSentinal; ///< known value to check for memory stomping (e.g., (CD)*)
77#endif
78 BlockHeader* fHeader; ///< pointer back to the block header in which an alloc resides
79 };
80
bsalomon@google.com4da34e32012-06-19 15:40:27 +000081 enum {
82 // We assume this alignment is good enough for everybody.
83 kAlignment = 8,
84 kHeaderSize = GR_CT_ALIGN_UP(sizeof(BlockHeader), kAlignment),
robertphillips19c62502016-01-06 07:04:46 -080085 kPerAllocPad = GR_CT_ALIGN_UP(sizeof(AllocHeader), kAlignment),
bsalomon@google.com4da34e32012-06-19 15:40:27 +000086 };
joshualittb7133be2015-04-08 09:08:31 -070087 size_t fSize;
bsalomon@google.com4da34e32012-06-19 15:40:27 +000088 size_t fPreallocSize;
89 size_t fMinAllocSize;
90 BlockHeader* fHead;
91 BlockHeader* fTail;
commit-bot@chromium.org515dcd32013-08-28 14:17:03 +000092#ifdef SK_DEBUG
bsalomon@google.com4da34e32012-06-19 15:40:27 +000093 int fAllocationCnt;
joshualittb7133be2015-04-08 09:08:31 -070094 int fAllocBlockCnt;
bsalomon@google.com4da34e32012-06-19 15:40:27 +000095#endif
96};
97
98#endif