Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(75)

Side by Side Diff: src/gpu/GrMemoryPool.h

Issue 21553002: Mark GrMemoryPool methods as static. (Closed) Base URL: https://skia.googlecode.com/svn/trunk
Patch Set: Created 7 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « no previous file | no next file » | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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 #ifndef GrMemoryPool_DEFINED 8 #ifndef GrMemoryPool_DEFINED
9 #define GrMemoryPool_DEFINED 9 #define GrMemoryPool_DEFINED
10 10
(...skipping 28 matching lines...) Expand all
39 void release(void* p); 39 void release(void* p);
40 40
41 /** 41 /**
42 * Returns true if there are no unreleased allocations. 42 * Returns true if there are no unreleased allocations.
43 */ 43 */
44 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; } 44 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
45 45
46 private: 46 private:
47 struct BlockHeader; 47 struct BlockHeader;
48 48
49 BlockHeader* CreateBlock(size_t size); 49 static BlockHeader* CreateBlock(size_t size);
50 50
51 void DeleteBlock(BlockHeader* block); 51 static void DeleteBlock(BlockHeader* block);
52 52
53 void validate(); 53 void validate();
54 54
55 struct BlockHeader { 55 struct BlockHeader {
56 BlockHeader* fNext; ///< doubly-linked list of blocks. 56 BlockHeader* fNext; ///< doubly-linked list of blocks.
57 BlockHeader* fPrev; 57 BlockHeader* fPrev;
58 int fLiveCount; ///< number of outstanding allocations in the 58 int fLiveCount; ///< number of outstanding allocations in the
59 ///< block. 59 ///< block.
60 intptr_t fCurrPtr; ///< ptr to the start of blocks free space. 60 intptr_t fCurrPtr; ///< ptr to the start of blocks free space.
61 intptr_t fPrevPtr; ///< ptr to the last allocation made 61 intptr_t fPrevPtr; ///< ptr to the last allocation made
62 size_t fFreeSize; ///< amount of free space left in the block. 62 size_t fFreeSize; ///< amount of free space left in the block.
63 }; 63 };
64 64
65 enum { 65 enum {
66 // We assume this alignment is good enough for everybody. 66 // We assume this alignment is good enough for everybody.
67 kAlignment = 8, 67 kAlignment = 8,
68 kHeaderSize = GR_CT_ALIGN_UP(sizeof(BlockHeader), kAlignment), 68 kHeaderSize = GR_CT_ALIGN_UP(sizeof(BlockHeader), kAlignment),
69 kPerAllocPad = GR_CT_ALIGN_UP(sizeof(BlockHeader*), kAlignment), 69 kPerAllocPad = GR_CT_ALIGN_UP(sizeof(BlockHeader*), kAlignment),
70 }; 70 };
71 size_t fPreallocSize; 71 size_t fPreallocSize;
72 size_t fMinAllocSize; 72 size_t fMinAllocSize;
73 BlockHeader* fHead; 73 BlockHeader* fHead;
74 BlockHeader* fTail; 74 BlockHeader* fTail;
75 #if GR_DEBUG 75 #if GR_DEBUG
76 int fAllocationCnt; 76 int fAllocationCnt;
77 #endif 77 #endif
78 }; 78 };
79 79
80 #endif 80 #endif
OLDNEW
« no previous file with comments | « no previous file | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698