VirtualBox

source: vbox/trunk/include/iprt/heap.h@ 28718

Last change on this file since 28718 was 26558, checked in by vboxsync, 15 years ago

include: svn:eol-style.

  • Property svn:eol-style set to native
File size: 13.2 KB
Line 
1/** @file
2 * IPRT - Heap Implementations
3 */
4
5/*
6 * Copyright (C) 2006-2009 Sun Microsystems, Inc.
7 *
8 * This file is part of VirtualBox Open Source Edition (OSE), as
9 * available from http://www.virtualbox.org. This file is free software;
10 * you can redistribute it and/or modify it under the terms of the GNU
11 * General Public License (GPL) as published by the Free Software
12 * Foundation, in version 2 as it comes in the "COPYING" file of the
13 * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
14 * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
15 *
16 * The contents of this file may alternatively be used under the terms
17 * of the Common Development and Distribution License Version 1.0
18 * (CDDL) only, as it comes in the "COPYING.CDDL" file of the
19 * VirtualBox OSE distribution, in which case the provisions of the
20 * CDDL are applicable instead of those of the GPL.
21 *
22 * You may elect to license modified versions of this file under the
23 * terms and conditions of either the GPL or the CDDL or both.
24 *
25 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa
26 * Clara, CA 95054 USA or visit http://www.sun.com if you need
27 * additional information or have any questions.
28 */
29
30#ifndef ___iprt_heap_h
31#define ___iprt_heap_h
32
33#include <iprt/cdefs.h>
34#include <iprt/types.h>
35
36RT_C_DECLS_BEGIN
37
38/** @defgroup grp_rt_heap RTHeap - Heap Implementations
39 * @ingroup grp_rt
40 * @{
41 */
42
43
44/** @defgroup grp_rt_heap_simple RTHeapSimple - Simple Heap
45 * @{
46 */
47
48/**
49 * Initializes the heap.
50 *
51 * @returns IPRT status code.
52 * @param pHeap Where to store the heap anchor block on success.
53 * @param pvMemory Pointer to the heap memory.
54 * @param cbMemory The size of the heap memory.
55 */
56RTDECL(int) RTHeapSimpleInit(PRTHEAPSIMPLE pHeap, void *pvMemory, size_t cbMemory);
57
58/**
59 * Merge two simple heaps into one.
60 *
61 * The requirement is of course that they next two each other memory wise.
62 *
63 * @returns IPRT status code.
64 * @param pHeap Where to store the handle to the merged heap on success.
65 * @param Heap1 Handle to the first heap.
66 * @param Heap2 Handle to the second heap.
67 * @remark This API isn't implemented yet.
68 */
69RTDECL(int) RTHeapSimpleMerge(PRTHEAPSIMPLE pHeap, RTHEAPSIMPLE Heap1, RTHEAPSIMPLE Heap2);
70
71/**
72 * Relocater the heap internal structures after copying it to a new location.
73 *
74 * This can be used when loading a saved heap.
75 *
76 * @returns IPRT status code.
77 * @param hHeap Heap handle that has already been adjusted by to the new
78 * location. That is to say, when calling
79 * RTHeapSimpleInit, the caller must note the offset of the
80 * returned heap handle into the heap memory. This offset
81 * must be used when calcuating the handle value for the
82 * new location. The offset may in some cases not be zero!
83 * @param offDelta The delta between the new and old location, i.e. what
84 * should be added to the internal pointers.
85 */
86RTDECL(int) RTHeapSimpleRelocate(RTHEAPSIMPLE hHeap, uintptr_t offDelta);
87
88/**
89 * Allocates memory from the specified simple heap.
90 *
91 * @returns Pointer to the allocated memory block on success.
92 * @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
93 *
94 * @param Heap The heap to allocate the memory on.
95 * @param cb The requested heap block size.
96 * @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
97 * Must be a power of 2.
98 */
99RTDECL(void *) RTHeapSimpleAlloc(RTHEAPSIMPLE Heap, size_t cb, size_t cbAlignment);
100
101/**
102 * Allocates zeroed memory from the specified simple heap.
103 *
104 * @returns Pointer to the allocated memory block on success.
105 * @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
106 *
107 * @param Heap The heap to allocate the memory on.
108 * @param cb The requested heap block size.
109 * @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
110 * Must be a power of 2.
111 */
112RTDECL(void *) RTHeapSimpleAllocZ(RTHEAPSIMPLE Heap, size_t cb, size_t cbAlignment);
113
114/**
115 * Reallocates / Allocates / Frees a heap block.
116 *
117 * @param Heap The heap. This is optional and will only be used for strict assertions.
118 * @param pv The heap block returned by RTHeapSimple. If NULL it behaves like RTHeapSimpleAlloc().
119 * @param cbNew The new size of the heap block. If NULL it behaves like RTHeapSimpleFree().
120 * @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
121 * Must be a power of 2.
122 * @remark This API isn't implemented yet.
123 */
124RTDECL(void *) RTHeapSimpleRealloc(RTHEAPSIMPLE Heap, void *pv, size_t cbNew, size_t cbAlignment);
125
126/**
127 * Reallocates / Allocates / Frees a heap block, zeroing any new bits.
128 *
129 * @param Heap The heap. This is optional and will only be used for strict assertions.
130 * @param pv The heap block returned by RTHeapSimple. If NULL it behaves like RTHeapSimpleAllocZ().
131 * @param cbNew The new size of the heap block. If NULL it behaves like RTHeapSimpleFree().
132 * @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
133 * Must be a power of 2.
134 * @remark This API isn't implemented yet.
135 */
136RTDECL(void *) RTHeapSimpleReallocZ(RTHEAPSIMPLE Heap, void *pv, size_t cbNew, size_t cbAlignment);
137
138/**
139 * Frees memory allocated from a simple heap.
140 *
141 * @param Heap The heap. This is optional and will only be used for strict assertions.
142 * @param pv The heap block returned by RTHeapSimple
143 */
144RTDECL(void) RTHeapSimpleFree(RTHEAPSIMPLE Heap, void *pv);
145
146/**
147 * Gets the size of the specified heap block.
148 *
149 * @returns The actual size of the heap block.
150 * @returns 0 if \a pv is NULL or it doesn't point to a valid heap block. An invalid \a pv
151 * can also cause traps or trigger assertions.
152 * @param Heap The heap. This is optional and will only be used for strict assertions.
153 * @param pv The heap block returned by RTHeapSimple
154 */
155RTDECL(size_t) RTHeapSimpleSize(RTHEAPSIMPLE Heap, void *pv);
156
157/**
158 * Gets the size of the heap.
159 *
160 * This size includes all the internal heap structures. So, even if the heap is
161 * empty the RTHeapSimpleGetFreeSize() will never reach the heap size returned
162 * by this function.
163 *
164 * @returns The heap size.
165 * @returns 0 if heap was safely detected as being bad.
166 * @param Heap The heap.
167 */
168RTDECL(size_t) RTHeapSimpleGetHeapSize(RTHEAPSIMPLE Heap);
169
170/**
171 * Returns the sum of all free heap blocks.
172 *
173 * This is the amount of memory you can theoretically allocate
174 * if you do allocations exactly matching the free blocks.
175 *
176 * @returns The size of the free blocks.
177 * @returns 0 if heap was safely detected as being bad.
178 * @param Heap The heap.
179 */
180RTDECL(size_t) RTHeapSimpleGetFreeSize(RTHEAPSIMPLE Heap);
181
182/**
183 * Printf like callbaclk function for RTHeapSimpleDump.
184 * @param pszFormat IPRT format string.
185 * @param ... Format arguments.
186 */
187typedef DECLCALLBACK(void) FNRTHEAPSIMPLEPRINTF(const char *pszFormat, ...);
188/** Pointer to a FNRTHEAPSIMPLEPRINTF function. */
189typedef FNRTHEAPSIMPLEPRINTF *PFNRTHEAPSIMPLEPRINTF;
190
191/**
192 * Dumps the hypervisor heap.
193 *
194 * @param Heap The heap handle.
195 * @param pfnPrintf Printf like function that groks IPRT formatting.
196 */
197RTDECL(void) RTHeapSimpleDump(RTHEAPSIMPLE Heap, PFNRTHEAPSIMPLEPRINTF pfnPrintf);
198
199/** @} */
200
201
202
203/** @defgroup grp_rt_heap_offset RTHeapOffset - Offset Based Heap
204 *
205 * This is a variation on the simple heap that doesn't use pointers internally
206 * and therefore can be saved and restored without any extra effort.
207 *
208 * @{
209 */
210
211/**
212 * Initializes the heap.
213 *
214 * @returns IPRT status code.
215 * @param phHeap Where to store the heap anchor block on success.
216 * @param pvMemory Pointer to the heap memory.
217 * @param cbMemory The size of the heap memory.
218 */
219RTDECL(int) RTHeapOffsetInit(PRTHEAPOFFSET phHeap, void *pvMemory, size_t cbMemory);
220
221/**
222 * Merge two simple heaps into one.
223 *
224 * The requirement is of course that they next two each other memory wise.
225 *
226 * @returns IPRT status code.
227 * @param phHeap Where to store the handle to the merged heap on success.
228 * @param hHeap1 Handle to the first heap.
229 * @param hHeap2 Handle to the second heap.
230 * @remark This API isn't implemented yet.
231 */
232RTDECL(int) RTHeapOffsetMerge(PRTHEAPOFFSET phHeap, RTHEAPOFFSET hHeap1, RTHEAPOFFSET hHeap2);
233
234/**
235 * Allocates memory from the specified simple heap.
236 *
237 * @returns Pointer to the allocated memory block on success.
238 * @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
239 *
240 * @param hHeap The heap to allocate the memory on.
241 * @param cb The requested heap block size.
242 * @param cbAlignment The requested heap block alignment. Pass 0 for default alignment.
243 * Must be a power of 2.
244 */
245RTDECL(void *) RTHeapOffsetAlloc(RTHEAPOFFSET hHeap, size_t cb, size_t cbAlignment);
246
247/**
248 * Allocates zeroed memory from the specified simple heap.
249 *
250 * @returns Pointer to the allocated memory block on success.
251 * @returns NULL if the request cannot be satisfied. (A VERR_NO_MEMORY condition.)
252 *
253 * @param hHeap The heap to allocate the memory on.
254 * @param cb The requested heap block size.
255 * @param cbAlignment The requested heap block alignment. Pass 0 for default
256 * alignment. Must be a power of 2.
257 */
258RTDECL(void *) RTHeapOffsetAllocZ(RTHEAPOFFSET hHeap, size_t cb, size_t cbAlignment);
259
260/**
261 * Reallocates / Allocates / Frees a heap block.
262 *
263 * @param hHeap The heap handle. This is optional and will only be used
264 * for strict assertions.
265 * @param pv The heap block returned by RTHeapOffset. If NULL it
266 * behaves like RTHeapOffsetAlloc().
267 * @param cbNew The new size of the heap block. If NULL it behaves like
268 * RTHeapOffsetFree().
269 * @param cbAlignment The requested heap block alignment. Pass 0 for default
270 * alignment. Must be a power of 2.
271 * @remark This API isn't implemented yet.
272 */
273RTDECL(void *) RTHeapOffsetRealloc(RTHEAPOFFSET hHeap, void *pv, size_t cbNew, size_t cbAlignment);
274
275/**
276 * Reallocates / Allocates / Frees a heap block, zeroing any new bits.
277 *
278 * @param hHeap The heap handle. This is optional and will only be used
279 * for strict assertions.
280 * @param pv The heap block returned by RTHeapOffset. If NULL it
281 * behaves like RTHeapOffsetAllocZ().
282 * @param cbNew The new size of the heap block. If NULL it behaves like
283 * RTHeapOffsetFree().
284 * @param cbAlignment The requested heap block alignment. Pass 0 for default
285 * alignment. Must be a power of 2.
286 * @remark This API isn't implemented yet.
287 */
288RTDECL(void *) RTHeapOffsetReallocZ(RTHEAPOFFSET hHeap, void *pv, size_t cbNew, size_t cbAlignment);
289
290/**
291 * Frees memory allocated from a simple heap.
292 *
293 * @param hHeap The heap handle. This is optional and will only be used
294 * for strict assertions.
295 * @param pv The heap block returned by RTHeapOffset
296 */
297RTDECL(void) RTHeapOffsetFree(RTHEAPOFFSET hHeap, void *pv);
298
299/**
300 * Gets the size of the specified heap block.
301 *
302 * @returns The actual size of the heap block.
303 * @returns 0 if \a pv is NULL or it doesn't point to a valid heap block. An
304 * invalid \a pv can also cause traps or trigger assertions.
305 *
306 * @param hHeap The heap handle. This is optional and will only be used
307 * for strict assertions.
308 * @param pv The heap block returned by RTHeapOffset
309 */
310RTDECL(size_t) RTHeapOffsetSize(RTHEAPOFFSET hHeap, void *pv);
311
312/**
313 * Gets the size of the heap.
314 *
315 * This size includes all the internal heap structures. So, even if the heap is
316 * empty the RTHeapOffsetGetFreeSize() will never reach the heap size returned
317 * by this function.
318 *
319 * @returns The heap size.
320 * @returns 0 if heap was safely detected as being bad.
321 * @param hHeap The heap handle.
322 */
323RTDECL(size_t) RTHeapOffsetGetHeapSize(RTHEAPOFFSET hHeap);
324
325/**
326 * Returns the sum of all free heap blocks.
327 *
328 * This is the amount of memory you can theoretically allocate
329 * if you do allocations exactly matching the free blocks.
330 *
331 * @returns The size of the free blocks.
332 * @returns 0 if heap was safely detected as being bad.
333 * @param hHeap The heap handle.
334 */
335RTDECL(size_t) RTHeapOffsetGetFreeSize(RTHEAPOFFSET hHeap);
336
337/**
338 * Printf like callbaclk function for RTHeapOffsetDump.
339 * @param pszFormat IPRT format string.
340 * @param ... Format arguments.
341 */
342typedef DECLCALLBACK(void) FNRTHEAPOFFSETPRINTF(const char *pszFormat, ...);
343/** Pointer to a FNRTHEAPOFFSETPRINTF function. */
344typedef FNRTHEAPOFFSETPRINTF *PFNRTHEAPOFFSETPRINTF;
345
346/**
347 * Dumps the hypervisor heap.
348 *
349 * @param hHeap The heap handle.
350 * @param pfnPrintf Printf like function that groks IPRT formatting.
351 */
352RTDECL(void) RTHeapOffsetDump(RTHEAPOFFSET hHeap, PFNRTHEAPOFFSETPRINTF pfnPrintf);
353
354/** @} */
355
356/** @} */
357RT_C_DECLS_END
358
359#endif
360
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette