forked from KDE/ghostwriter
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMemoryArena.cpp
More file actions
98 lines (83 loc) · 2.1 KB
/
Copy pathMemoryArena.cpp
File metadata and controls
98 lines (83 loc) · 2.1 KB
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
/***********************************************************************
*
* Copyright (C) 2020 wereturtle
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
***********************************************************************/
#include <QLinkedListIterator>
#include "MemoryArena.h"
template<class T>
MemoryArena<T>::MemoryArena() :
currentChunk(arena), slotIndex(0), chunkSize(256)
{
;
}
template<class T>
MemoryArena<T>::MemoryArena(const size_t chunkSize) :
currentChunk(arena), slotIndex(0), chunkSize(chunkSize)
{
;
}
template<class T>
MemoryArena<T>::~MemoryArena()
{
freeAll();
}
template<class T>
T* MemoryArena<T>::allocate()
{
if
(
arena.isEmpty() || (slotIndex >= (int)chunkSize)
)
{
if (!currentChunk.hasNext())
{
currentChunk.insert(new Chunk(chunkSize));
}
else
{
currentChunk.next();
}
slotIndex = 0;
}
else if (0 == slotIndex && currentChunk.hasNext())
{
currentChunk.next();
}
T* data = currentChunk.peekPrevious()->data();
if (NULL != data)
{
int index = slotIndex;
slotIndex++;
return &(data[index]);
}
return NULL;
}
template<class T>
void MemoryArena<T>::freeAll()
{
currentChunk.toFront();
while (currentChunk.hasNext())
{
Chunk* chunk = currentChunk.next();
if (NULL != chunk)
{
delete chunk;
}
currentChunk.remove();
}
slotIndex = 0;
}