aboutsummaryrefslogtreecommitdiffhomepage
path: root/include/core/SkChunkAlloc.h
blob: bb4ec8faecad9cb499d7156604f836c6549f8d0e (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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

/*
 * Copyright 2006 The Android Open Source Project
 *
 * Use of this source code is governed by a BSD-style license that can be
 * found in the LICENSE file.
 */


#ifndef SkChunkAlloc_DEFINED
#define SkChunkAlloc_DEFINED

#include "SkTypes.h"

class SkChunkAlloc : SkNoncopyable {
public:
    SkChunkAlloc(size_t minSize);
    ~SkChunkAlloc();

    /**
     *  Free up all allocated blocks. This invalidates all returned
     *  pointers.
     */
    void reset();
    /**
     *  Reset to 0 used bytes preserving as much memory as possible.
     *  This invalidates all returned pointers.
     */
    void rewind();

    enum AllocFailType {
        kReturnNil_AllocFailType,
        kThrow_AllocFailType
    };

    /**
     *  Allocates a memory block of size bytes.
     *  On success: returns a pointer to beginning of memory block that is
     *  8 byte aligned. The content of allocated block is not initialized.
     *  On failure: calls abort() if called with kThrow_AllocFailType,
     *  otherwise returns NULL pointer.
     */
    void* alloc(size_t bytes, AllocFailType);

    /**
     *  Shortcut for calling alloc with kThrow_AllocFailType.
     */
    void* allocThrow(size_t bytes) {
        return this->alloc(bytes, kThrow_AllocFailType);
    }

    /** Call this to unalloc the most-recently allocated ptr by alloc(). On
        success, the number of bytes freed is returned, or 0 if the block could
        not be unallocated. This is a hint to the underlying allocator that
        the previous allocation may be reused, but the implementation is free
        to ignore this call (and return 0).
     */
    size_t unalloc(void* ptr);

    size_t totalCapacity() const { return fTotalCapacity; }
    size_t totalUsed() const { return fTotalUsed; }
    SkDEBUGCODE(int blockCount() const { return fBlockCount; })
    SkDEBUGCODE(size_t totalLost() const { return fTotalLost; })

    /**
     *  Returns true if the specified address is within one of the chunks, and
     *  has at least 1-byte following the address (i.e. if addr points to the
     *  end of a chunk, then contains() will return false).
     */
    bool contains(const void* addr) const;

private:
    struct Block;

    Block*  fBlock;
    size_t  fMinSize;
    size_t  fChunkSize;
    size_t  fTotalCapacity;
    size_t  fTotalUsed;     // will be <= fTotalCapacity
    SkDEBUGCODE(int     fBlockCount;)
    SkDEBUGCODE(size_t  fTotalLost;)     // will be <= fTotalCapacity

    Block* newBlock(size_t bytes, AllocFailType ftype);
    Block* addBlockIfNecessary(size_t bytes, AllocFailType ftype);

    SkDEBUGCODE(void validate();)
};

#endif