blob: 62c6a876dddb93d32e494695f039f435f6b092a5 (
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
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
/********************* */
/*! \file context_mm.cpp
** \verbatim
** Top contributors (to current version):
** Clark Barrett, Andres Noetzli, Morgan Deters
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Implementation of Context Memory Manager.
**
** Implementation of Context Memory Manager
**/
#include <cstdlib>
#include <vector>
#include <deque>
#include <new>
#ifdef CVC4_VALGRIND
#include <valgrind/memcheck.h>
#endif /* CVC4_VALGRIND */
#include "base/check.h"
#include "base/output.h"
#include "context/context_mm.h"
namespace CVC4 {
namespace context {
#ifndef CVC4_DEBUG_CONTEXT_MEMORY_MANAGER
void ContextMemoryManager::newChunk() {
// Increment index to chunk list
++d_indexChunkList;
Assert(d_chunkList.size() == d_indexChunkList)
<< "Index should be at the end of the list";
// Create new chunk if no free chunk available
if(d_freeChunks.empty()) {
d_chunkList.push_back((char*)malloc(chunkSizeBytes));
if(d_chunkList.back() == NULL) {
throw std::bad_alloc();
}
#ifdef CVC4_VALGRIND
VALGRIND_MAKE_MEM_NOACCESS(d_chunkList.back(), chunkSizeBytes);
#endif /* CVC4_VALGRIND */
}
// If there is a free chunk, use that
else {
d_chunkList.push_back(d_freeChunks.back());
d_freeChunks.pop_back();
}
// Set up the current chunk pointers
d_nextFree = d_chunkList.back();
d_endChunk = d_nextFree + chunkSizeBytes;
}
ContextMemoryManager::ContextMemoryManager() : d_indexChunkList(0) {
// Create initial chunk
d_chunkList.push_back((char*)malloc(chunkSizeBytes));
d_nextFree = d_chunkList.back();
if(d_nextFree == NULL) {
throw std::bad_alloc();
}
d_endChunk = d_nextFree + chunkSizeBytes;
#ifdef CVC4_VALGRIND
VALGRIND_CREATE_MEMPOOL(this, 0, false);
VALGRIND_MAKE_MEM_NOACCESS(d_nextFree, chunkSizeBytes);
d_allocations.push_back(std::vector<char*>());
#endif /* CVC4_VALGRIND */
}
ContextMemoryManager::~ContextMemoryManager() {
#ifdef CVC4_VALGRIND
VALGRIND_DESTROY_MEMPOOL(this);
#endif /* CVC4_VALGRIND */
// Delete all chunks
while(!d_chunkList.empty()) {
free(d_chunkList.back());
d_chunkList.pop_back();
}
while(!d_freeChunks.empty()) {
free(d_freeChunks.back());
d_freeChunks.pop_back();
}
}
void* ContextMemoryManager::newData(size_t size) {
// Use next available free location in current chunk
void* res = (void*)d_nextFree;
d_nextFree += size;
// Check if the request is too big for the chunk
if(d_nextFree > d_endChunk) {
newChunk();
res = (void*)d_nextFree;
d_nextFree += size;
AlwaysAssert(d_nextFree <= d_endChunk)
<< "Request is bigger than memory chunk size";
}
Debug("context") << "ContextMemoryManager::newData(" << size
<< ") returning " << res << " at level "
<< d_chunkList.size() << std::endl;
#ifdef CVC4_VALGRIND
VALGRIND_MEMPOOL_ALLOC(this, static_cast<char*>(res), size);
d_allocations.back().push_back(static_cast<char*>(res));
#endif /* CVC4_VALGRIND */
return res;
}
void ContextMemoryManager::push() {
#ifdef CVC4_VALGRIND
d_allocations.push_back(std::vector<char*>());
#endif /* CVC4_VALGRIND */
// Store current state on the stack
d_nextFreeStack.push_back(d_nextFree);
d_endChunkStack.push_back(d_endChunk);
d_indexChunkListStack.push_back(d_indexChunkList);
}
void ContextMemoryManager::pop() {
#ifdef CVC4_VALGRIND
for (auto allocation : d_allocations.back())
{
VALGRIND_MEMPOOL_FREE(this, allocation);
}
d_allocations.pop_back();
#endif /* CVC4_VALGRIND */
Assert(d_nextFreeStack.size() > 0 && d_endChunkStack.size() > 0);
// Restore state from stack
d_nextFree = d_nextFreeStack.back();
d_nextFreeStack.pop_back();
d_endChunk = d_endChunkStack.back();
d_endChunkStack.pop_back();
// Free all the new chunks since the last push
while(d_indexChunkList > d_indexChunkListStack.back()) {
d_freeChunks.push_back(d_chunkList.back());
#ifdef CVC4_VALGRIND
VALGRIND_MAKE_MEM_NOACCESS(d_chunkList.back(), chunkSizeBytes);
#endif /* CVC4_VALGRIND */
d_chunkList.pop_back();
--d_indexChunkList;
}
d_indexChunkListStack.pop_back();
// Delete excess free chunks
while(d_freeChunks.size() > maxFreeChunks) {
free(d_freeChunks.front());
d_freeChunks.pop_front();
}
}
#endif /* CVC4_DEBUG_CONTEXT_MEMORY_MANAGER */
} /* CVC4::context namespace */
} /* CVC4 namespace */
|
