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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
|
/** @file
* IPRT - Heap Implementations
*/
/*
* Copyright (C) 2006-2022 Oracle and/or its affiliates.
*
* This file is part of VirtualBox base platform packages, as
* available from https://www.virtualbox.org.
*
* 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, in version 3 of the
* License.
*
* 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 <https://www.gnu.org/licenses>.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL), a copy of it is provided in the "COPYING.CDDL" file included
* in the VirtualBox distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*
* SPDX-License-Identifier: GPL-3.0-only OR CDDL-1.0
*/
#ifndef IPRT_INCLUDED_heap_h
#define IPRT_INCLUDED_heap_h
#ifndef RT_WITHOUT_PRAGMA_ONCE
# pragma once
#endif
#include <iprt/cdefs.h>
#include <iprt/types.h>
RT_C_DECLS_BEGIN
/** @defgroup grp_rt_heap RTHeap - Heap Implementations
* @ingroup grp_rt
* @{
*/
/** @defgroup grp_rt_heap_simple RTHeapSimple - Simple Heap
* @{
*/
/**
* Initializes the heap.
*
* @returns IPRT status code.
* @param pHeap Where to store the heap anchor block on success.
* @param pvMemory Pointer to the heap memory.
* @param cbMemory The size of the heap memory.
*/
RTDECL(int) RTHeapSimpleInit(PRTHEAPSIMPLE pHeap, void *pvMemory, size_t cbMemory);
/**
* Merge two simple heaps into one.
*
* The requirement is of course that they next two each other memory wise.
*
* @returns IPRT status code.
* @param pHeap Where to store the handle to the merged heap on success.
* @param Heap1 Handle to the first heap.
* @param Heap2 Handle to the second heap.
* @remark This API isn't implemented yet.
*/
RTDECL(int) RTHeapSimpleMerge(PRTHEAPSIMPLE pHeap, RTHEAPSIMPLE Heap1, RTHEAPSIMPLE Heap2);
/**
* Relocater the heap internal structures after copying it to a new location.
*
* This can be used when loading a saved heap.
*
* @returns IPRT status code.
* @param hHeap Heap handle that has already been adjusted by to the new
* location. That is to say, when calling
* RTHeapSimpleInit, the caller must note the offset of the
* returned heap handle into the heap memory. This offset
* must be used when calcuating the handle value for the
* new location. The offset may in some cases not be zero!
* @param offDelta The delta between the new and old location, i.e. what
* should be added to the internal pointers.
*/
RTDECL(int) RTHeapSimpleRelocate(RTHEAPSIMPLE hHeap, uintptr_t offDelta);
/**
* Allocates memory from the specified simple heap.
*
* @returns Pointer to the allocated memory block on success.
* @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
*
* @param Heap The heap to allocate the memory on.
* @param cb The requested heap block size.
* @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
* Must be a power of 2.
*/
RTDECL(void *) RTHeapSimpleAlloc(RTHEAPSIMPLE Heap, size_t cb, size_t cbAlignment);
/**
* Allocates zeroed memory from the specified simple heap.
*
* @returns Pointer to the allocated memory block on success.
* @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
*
* @param Heap The heap to allocate the memory on.
* @param cb The requested heap block size.
* @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
* Must be a power of 2.
*/
RTDECL(void *) RTHeapSimpleAllocZ(RTHEAPSIMPLE Heap, size_t cb, size_t cbAlignment);
/**
* Reallocates / Allocates / Frees a heap block.
*
* @param Heap The heap. This is optional and will only be used for strict assertions.
* @param pv The heap block returned by RTHeapSimple. If NULL it behaves like RTHeapSimpleAlloc().
* @param cbNew The new size of the heap block. If NULL it behaves like RTHeapSimpleFree().
* @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
* Must be a power of 2.
* @remark This API isn't implemented yet.
*/
RTDECL(void *) RTHeapSimpleRealloc(RTHEAPSIMPLE Heap, void *pv, size_t cbNew, size_t cbAlignment);
/**
* Reallocates / Allocates / Frees a heap block, zeroing any new bits.
*
* @param Heap The heap. This is optional and will only be used for strict assertions.
* @param pv The heap block returned by RTHeapSimple. If NULL it behaves like RTHeapSimpleAllocZ().
* @param cbNew The new size of the heap block. If NULL it behaves like RTHeapSimpleFree().
* @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
* Must be a power of 2.
* @remark This API isn't implemented yet.
*/
RTDECL(void *) RTHeapSimpleReallocZ(RTHEAPSIMPLE Heap, void *pv, size_t cbNew, size_t cbAlignment);
/**
* Frees memory allocated from a simple heap.
*
* @param Heap The heap. This is optional and will only be used for strict assertions.
* @param pv The heap block returned by RTHeapSimple
*/
RTDECL(void) RTHeapSimpleFree(RTHEAPSIMPLE Heap, void *pv);
/**
* Gets the size of the specified heap block.
*
* @returns The actual size of the heap block.
* @returns 0 if \a pv is NULL or it doesn't point to a valid heap block. An invalid \a pv
* can also cause traps or trigger assertions.
* @param Heap The heap. This is optional and will only be used for strict assertions.
* @param pv The heap block returned by RTHeapSimple
*/
RTDECL(size_t) RTHeapSimpleSize(RTHEAPSIMPLE Heap, void *pv);
/**
* Gets the size of the heap.
*
* This size includes all the internal heap structures. So, even if the heap is
* empty the RTHeapSimpleGetFreeSize() will never reach the heap size returned
* by this function.
*
* @returns The heap size.
* @returns 0 if heap was safely detected as being bad.
* @param Heap The heap.
*/
RTDECL(size_t) RTHeapSimpleGetHeapSize(RTHEAPSIMPLE Heap);
/**
* Returns the sum of all free heap blocks.
*
* This is the amount of memory you can theoretically allocate
* if you do allocations exactly matching the free blocks.
*
* @returns The size of the free blocks.
* @returns 0 if heap was safely detected as being bad.
* @param Heap The heap.
*/
RTDECL(size_t) RTHeapSimpleGetFreeSize(RTHEAPSIMPLE Heap);
/**
* Printf like callbaclk function for RTHeapSimpleDump.
* @param pszFormat IPRT format string.
* @param ... Format arguments.
*/
typedef DECLCALLBACKTYPE(void, FNRTHEAPSIMPLEPRINTF,(const char *pszFormat, ...)) RT_IPRT_FORMAT_ATTR(1, 2);
/** Pointer to a FNRTHEAPSIMPLEPRINTF function. */
typedef FNRTHEAPSIMPLEPRINTF *PFNRTHEAPSIMPLEPRINTF;
/**
* Dumps the hypervisor heap.
*
* @param Heap The heap handle.
* @param pfnPrintf Printf like function that groks IPRT formatting.
*/
RTDECL(void) RTHeapSimpleDump(RTHEAPSIMPLE Heap, PFNRTHEAPSIMPLEPRINTF pfnPrintf);
/** @} */
/** @defgroup grp_rt_heap_offset RTHeapOffset - Offset Based Heap
*
* This is a variation on the simple heap that doesn't use pointers internally
* and therefore can be saved and restored without any extra effort.
*
* @{
*/
/**
* Initializes the heap.
*
* @returns IPRT status code.
* @param phHeap Where to store the heap anchor block on success.
* @param pvMemory Pointer to the heap memory.
* @param cbMemory The size of the heap memory.
*/
RTDECL(int) RTHeapOffsetInit(PRTHEAPOFFSET phHeap, void *pvMemory, size_t cbMemory);
/**
* Merge two simple heaps into one.
*
* The requirement is of course that they next two each other memory wise.
*
* @returns IPRT status code.
* @param phHeap Where to store the handle to the merged heap on success.
* @param hHeap1 Handle to the first heap.
* @param hHeap2 Handle to the second heap.
* @remark This API isn't implemented yet.
*/
RTDECL(int) RTHeapOffsetMerge(PRTHEAPOFFSET phHeap, RTHEAPOFFSET hHeap1, RTHEAPOFFSET hHeap2);
/**
* Allocates memory from the specified simple heap.
*
* @returns Pointer to the allocated memory block on success.
* @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
*
* @param hHeap The heap to allocate the memory on.
* @param cb The requested heap block size.
* @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
* Must be a power of 2.
*/
RTDECL(void *) RTHeapOffsetAlloc(RTHEAPOFFSET hHeap, size_t cb, size_t cbAlignment);
/**
* Allocates zeroed memory from the specified simple heap.
*
* @returns Pointer to the allocated memory block on success.
* @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
*
* @param hHeap The heap to allocate the memory on.
* @param cb The requested heap block size.
* @param cbAlignment The requested heap block alignment. Pass 0 for default
* alignment. Must be a power of 2.
*/
RTDECL(void *) RTHeapOffsetAllocZ(RTHEAPOFFSET hHeap, size_t cb, size_t cbAlignment);
/**
* Reallocates / Allocates / Frees a heap block.
*
* @param hHeap The heap handle. This is optional and will only be used
* for strict assertions.
* @param pv The heap block returned by RTHeapOffset. If NULL it
* behaves like RTHeapOffsetAlloc().
* @param cbNew The new size of the heap block. If NULL it behaves like
* RTHeapOffsetFree().
* @param cbAlignment The requested heap block alignment. Pass 0 for default
* alignment. Must be a power of 2.
* @remark This API isn't implemented yet.
*/
RTDECL(void *) RTHeapOffsetRealloc(RTHEAPOFFSET hHeap, void *pv, size_t cbNew, size_t cbAlignment);
/**
* Reallocates / Allocates / Frees a heap block, zeroing any new bits.
*
* @param hHeap The heap handle. This is optional and will only be used
* for strict assertions.
* @param pv The heap block returned by RTHeapOffset. If NULL it
* behaves like RTHeapOffsetAllocZ().
* @param cbNew The new size of the heap block. If NULL it behaves like
* RTHeapOffsetFree().
* @param cbAlignment The requested heap block alignment. Pass 0 for default
* alignment. Must be a power of 2.
* @remark This API isn't implemented yet.
*/
RTDECL(void *) RTHeapOffsetReallocZ(RTHEAPOFFSET hHeap, void *pv, size_t cbNew, size_t cbAlignment);
/**
* Frees memory allocated from a simple heap.
*
* @param hHeap The heap handle. This is optional and will only be used
* for strict assertions.
* @param pv The heap block returned by RTHeapOffset
*/
RTDECL(void) RTHeapOffsetFree(RTHEAPOFFSET hHeap, void *pv);
/**
* Gets the size of the specified heap block.
*
* @returns The actual size of the heap block.
* @returns 0 if \a pv is NULL or it doesn't point to a valid heap block. An
* invalid \a pv can also cause traps or trigger assertions.
*
* @param hHeap The heap handle. This is optional and will only be used
* for strict assertions.
* @param pv The heap block returned by RTHeapOffset
*/
RTDECL(size_t) RTHeapOffsetSize(RTHEAPOFFSET hHeap, void *pv);
/**
* Gets the size of the heap.
*
* This size includes all the internal heap structures. So, even if the heap is
* empty the RTHeapOffsetGetFreeSize() will never reach the heap size returned
* by this function.
*
* @returns The heap size.
* @returns 0 if heap was safely detected as being bad.
* @param hHeap The heap handle.
*/
RTDECL(size_t) RTHeapOffsetGetHeapSize(RTHEAPOFFSET hHeap);
/**
* Returns the sum of all free heap blocks.
*
* This is the amount of memory you can theoretically allocate
* if you do allocations exactly matching the free blocks.
*
* @returns The size of the free blocks.
* @returns 0 if heap was safely detected as being bad.
* @param hHeap The heap handle.
*/
RTDECL(size_t) RTHeapOffsetGetFreeSize(RTHEAPOFFSET hHeap);
/**
* Printf like callbaclk function for RTHeapOffsetDump.
* @param pszFormat IPRT format string.
* @param ... Format arguments.
*/
typedef DECLCALLBACKTYPE(void, FNRTHEAPOFFSETPRINTF,(const char *pszFormat, ...)) RT_IPRT_FORMAT_ATTR(1, 2);
/** Pointer to a FNRTHEAPOFFSETPRINTF function. */
typedef FNRTHEAPOFFSETPRINTF *PFNRTHEAPOFFSETPRINTF;
/**
* Dumps the hypervisor heap.
*
* @param hHeap The heap handle.
* @param pfnPrintf Printf like function that groks IPRT formatting.
*/
RTDECL(void) RTHeapOffsetDump(RTHEAPOFFSET hHeap, PFNRTHEAPOFFSETPRINTF pfnPrintf);
/** @} */
/** @} */
RT_C_DECLS_END
#endif /* !IPRT_INCLUDED_heap_h */
|