| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2015 Google Inc. | 2 * Copyright 2015 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 "SkVarAlloc.h" | 8 #include "SkVarAlloc.h" |
| 9 | 9 |
| 10 // We use non-standard malloc diagnostic methods to make sure our allocations ar
e sized well. | 10 // We use non-standard malloc diagnostic methods to make sure our allocations ar
e sized well. |
| 11 #if defined(SK_BUILD_FOR_MAC) | 11 #if defined(SK_BUILD_FOR_MAC) |
| 12 #include <malloc/malloc.h> | 12 #include <malloc/malloc.h> |
| 13 #elif defined(SK_BUILD_FOR_UNIX) || defined(SK_BUILD_FOR_WIN32) | 13 #elif defined(SK_BUILD_FOR_UNIX) || defined(SK_BUILD_FOR_WIN32) |
| 14 #include <malloc.h> | 14 #include <malloc.h> |
| 15 #endif | 15 #endif |
| 16 | 16 |
| 17 struct SkVarAlloc::Block { | 17 struct SkVarAlloc::Block { |
| 18 Block* prev; | 18 Block* prev; |
| 19 char* data() { return (char*)(this + 1); } | 19 char* data() { return (char*)(this + 1); } |
| 20 | 20 |
| 21 static Block* Alloc(Block* prev, size_t size, unsigned flags) { | 21 static Block* Alloc(Block* prev, size_t size, unsigned flags) { |
| 22 SkASSERT(size >= sizeof(Block)); | 22 SkASSERT(size >= sizeof(Block)); |
| 23 Block* b = (Block*)sk_malloc_flags(size, flags); | 23 Block* b = (Block*)sk_malloc_flags(size, flags); |
| 24 b->prev = prev; | 24 b->prev = prev; |
| 25 return b; | 25 return b; |
| 26 } | 26 } |
| 27 }; | 27 }; |
| 28 | 28 |
| 29 SkVarAlloc::SkVarAlloc(size_t minLgSize) | 29 SkVarAlloc::SkVarAlloc(size_t minLgSize) |
| 30 : fByte(NULL) | 30 : fBytesAllocated(0) |
| 31 , fByte(NULL) |
| 31 , fRemaining(0) | 32 , fRemaining(0) |
| 32 , fLgSize(minLgSize) | 33 , fLgSize(minLgSize) |
| 33 , fBlock(NULL) {} | 34 , fBlock(NULL) {} |
| 34 | 35 |
| 35 SkVarAlloc::SkVarAlloc(size_t minLgSize, char* storage, size_t len) | 36 SkVarAlloc::SkVarAlloc(size_t minLgSize, char* storage, size_t len) |
| 36 : fByte(storage) | 37 : fBytesAllocated(0) |
| 38 , fByte(storage) |
| 37 , fRemaining(len) | 39 , fRemaining(len) |
| 38 , fLgSize(minLgSize) | 40 , fLgSize(minLgSize) |
| 39 , fBlock(NULL) {} | 41 , fBlock(NULL) {} |
| 40 | 42 |
| 41 SkVarAlloc::~SkVarAlloc() { | 43 SkVarAlloc::~SkVarAlloc() { |
| 42 Block* b = fBlock; | 44 Block* b = fBlock; |
| 43 while (b) { | 45 while (b) { |
| 44 Block* prev = b->prev; | 46 Block* prev = b->prev; |
| 45 sk_free(b); | 47 sk_free(b); |
| 46 b = prev; | 48 b = prev; |
| 47 } | 49 } |
| 48 } | 50 } |
| 49 | 51 |
| 50 void SkVarAlloc::makeSpace(size_t bytes, unsigned flags) { | 52 void SkVarAlloc::makeSpace(size_t bytes, unsigned flags) { |
| 51 SkASSERT(SkIsAlignPtr(bytes)); | 53 SkASSERT(SkIsAlignPtr(bytes)); |
| 52 | 54 |
| 53 size_t alloc = 1<<fLgSize++; | 55 size_t alloc = 1<<fLgSize++; |
| 54 while (alloc < bytes + sizeof(Block)) { | 56 while (alloc < bytes + sizeof(Block)) { |
| 55 alloc *= 2; | 57 alloc *= 2; |
| 56 } | 58 } |
| 59 fBytesAllocated += alloc; |
| 57 fBlock = Block::Alloc(fBlock, alloc, flags); | 60 fBlock = Block::Alloc(fBlock, alloc, flags); |
| 58 fByte = fBlock->data(); | 61 fByte = fBlock->data(); |
| 59 fRemaining = alloc - sizeof(Block); | 62 fRemaining = alloc - sizeof(Block); |
| 60 | 63 |
| 61 #if defined(SK_BUILD_FOR_MAC) | 64 #if defined(SK_BUILD_FOR_MAC) |
| 62 SkASSERT(alloc == malloc_good_size(alloc)); | 65 SkASSERT(alloc == malloc_good_size(alloc)); |
| 63 #elif defined(SK_BUILD_FOR_UNIX) && !defined(__UCLIBC__) | 66 #elif defined(SK_BUILD_FOR_UNIX) && !defined(__UCLIBC__) |
| 64 // TODO(mtklein): tune so we can assert something like this | 67 // TODO(mtklein): tune so we can assert something like this |
| 65 //SkASSERT(alloc == malloc_usable_size(fBlock)); | 68 //SkASSERT(alloc == malloc_usable_size(fBlock)); |
| 66 #endif | 69 #endif |
| 67 } | 70 } |
| 68 | |
| 69 static size_t heap_size(void* p) { | |
| 70 #if defined(SK_BUILD_FOR_MAC) | |
| 71 return malloc_size(p); | |
| 72 #elif defined(SK_BUILD_FOR_UNIX) && !defined(__UCLIBC__) | |
| 73 return malloc_usable_size(p); | |
| 74 #elif defined(SK_BUILD_FOR_WIN32) | |
| 75 return _msize(p); | |
| 76 #else | |
| 77 return 0; // Tough luck. | |
| 78 #endif | |
| 79 } | |
| 80 | |
| 81 size_t SkVarAlloc::approxBytesAllocated() const { | |
| 82 size_t sum = 0; | |
| 83 for (Block* b = fBlock; b; b = b->prev) { | |
| 84 sum += heap_size(b); | |
| 85 } | |
| 86 return sum; | |
| 87 } | |
| OLD | NEW |