blob: 840cf28347283632ec4a8ad810afdb52e1ea8228 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/*
* Copyright 2015 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkVarAlloc.h"
// We use non-standard malloc diagnostic methods to make sure our allocations are sized well.
#if defined(SK_BUILD_FOR_MAC)
#include <malloc/malloc.h>
#elif defined(SK_BUILD_FOR_UNIX) || defined(SK_BUILD_FOR_WIN32)
#include <malloc.h>
#endif
struct SkVarAlloc::Block {
Block* prev;
char* data() { return (char*)(this + 1); }
static Block* Alloc(Block* prev, size_t size) {
SkASSERT(size >= sizeof(Block));
Block* b = (Block*)sk_malloc_throw(size);
b->prev = prev;
return b;
}
};
SkVarAlloc::SkVarAlloc(size_t minLgSize)
: fBytesAllocated(0)
, fByte(nullptr)
, fRemaining(0)
, fLgSize(minLgSize)
, fBlock(nullptr) {}
SkVarAlloc::SkVarAlloc(size_t minLgSize, char* storage, size_t len)
: fBytesAllocated(0)
, fByte(storage)
, fRemaining(len)
, fLgSize(minLgSize)
, fBlock(nullptr) {}
SkVarAlloc::~SkVarAlloc() {
Block* b = fBlock;
while (b) {
Block* prev = b->prev;
sk_free(b);
b = prev;
}
}
void SkVarAlloc::makeSpace(size_t bytes) {
SkASSERT(SkIsAlignPtr(bytes));
size_t alloc = 1<<fLgSize++;
while (alloc < bytes + sizeof(Block)) {
alloc *= 2;
}
fBytesAllocated += alloc;
fBlock = Block::Alloc(fBlock, alloc);
fByte = fBlock->data();
fRemaining = alloc - sizeof(Block);
#if defined(SK_BUILD_FOR_MAC)
SkASSERT(alloc == malloc_good_size(alloc));
#elif defined(SK_BUILD_FOR_UNIX) && !defined(__UCLIBC__)
// TODO(mtklein): tune so we can assert something like this
//SkASSERT(alloc == malloc_usable_size(fBlock));
#endif
}
|
