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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
//-----------------------------------------------------------------------------
// Name: block_allocator.cpp
// Developer: Wolfire Games LLC
// Description:
// License: Read below
//-----------------------------------------------------------------------------
//
// Copyright 2022 Wolfire Games LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
//-----------------------------------------------------------------------------
#include "block_allocator.h"
#include <Memory/allocation.h>
#include <Internal/integer.h>
#include <Logging/logdata.h>
#include <Threading/thread_sanity.h>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <climits>
using std::endl;
using std::vector;
BlockAllocator::BlockAllocator() : base_mem(NULL), block_count(0), blocksize(0), allocations(NULL), allocations_placements(0), no_log(false) {
}
void BlockAllocator::Init(void* mem, size_t _blocks, size_t _blocksize) {
base_mem = mem;
block_count = _blocks;
blocksize = _blocksize;
allocations_placements.ResizeAndReset(block_count);
allocations = new BlockAllocation[_blocks];
}
BlockAllocator::~BlockAllocator() {
base_mem = NULL;
delete[] allocations;
allocations = NULL;
}
void* BlockAllocator::Alloc(size_t size) {
// AssertMainThread();
size_t slots = size / blocksize + (size % blocksize ? 1 : 0);
int start_pos = allocations_placements.GetFirstFreeSlot(slots);
if (start_pos >= 0) {
allocations_placements.SetBits(start_pos, slots);
void* ptr = ((char*)base_mem) + (size_t)(blocksize * start_pos);
for (size_t i = 0; i < block_count; i++) {
if (allocations[i].IsValid() == false) {
allocations[i] = BlockAllocation(start_pos, slots, ptr);
return ptr;
}
}
if (!no_log) {
LOGW << "Out of block allocator memory, returning NULL." << endl;
}
return NULL;
} else {
if (!no_log) {
LOGW << "Out of block allocator memory slots (" << start_pos << "), falling back to normal heap." << endl;
}
void* ptr = OG_MALLOC(size);
if (ptr != NULL) {
backup.push_back(ptr);
return ptr;
} else {
if (!no_log) {
LOGE << "Unable to allocate with OG_MALLOC()" << endl;
}
}
return NULL;
}
}
bool BlockAllocator::CanAlloc(size_t size) {
// AssertMainThread();
size_t slots = size / blocksize + (size % blocksize ? 1 : 0);
int start_pos = allocations_placements.GetFirstFreeSlot(slots);
if (start_pos >= 0) {
return true;
} else {
return false;
}
}
void BlockAllocator::Free(void* ptr) {
// AssertMainThread();
for (size_t i = 0; i < block_count; i++) {
if (allocations[i].ptr == ptr) {
allocations_placements.FreeBits(allocations[i].block_index, allocations[i].block_count);
allocations[i] = BlockAllocation();
return;
}
}
vector<void*>::iterator backupit;
for (backupit = backup.begin(); backupit != backup.end(); backupit++) {
if (*backupit == ptr) {
OG_FREE(ptr);
backup.erase(backupit);
return;
}
}
if (!no_log) {
LOGF << "Could not find an allocation for " << ptr << " unable to free." << endl;
}
}
|
