?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
wined3d: Return void from wined3d_device_set_light_enable().
[wine.git] / dlls / ntdll / heap.c
blobd7232b47d6689c63e629b4906f11c8d61952bd15
1 /*
2 * Win32 heap functions
3 *
4 * Copyright 1996 Alexandre Julliard
5 * Copyright 1998 Ulrich Weigand
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
20 */
21
22 #include "config.h"
23 #include "wine/port.h"
24
25 #include <assert.h>
26 #include <stdlib.h>
27 #include <stdarg.h>
28 #include <stdio.h>
29 #include <string.h>
30 #ifdef HAVE_VALGRIND_MEMCHECK_H
31 #include <valgrind/memcheck.h>
32 #else
33 #define RUNNING_ON_VALGRIND 0
34 #endif
35
36 #include "ntstatus.h"
37 #define WIN32_NO_STATUS
38 #define NONAMELESSUNION
39 #include "windef.h"
40 #include "winnt.h"
41 #include "winternl.h"
42 #include "ntdll_misc.h"
43 #include "wine/list.h"
44 #include "wine/debug.h"
45 #include "wine/server.h"
46
47 WINE_DEFAULT_DEBUG_CHANNEL(heap);
48
49 /* Note: the heap data structures are loosely based on what Pietrek describes in his
50 * book 'Windows 95 System Programming Secrets', with some adaptations for
51 * better compatibility with NT.
52 */
53
54 typedef struct tagARENA_INUSE
55 {
56 DWORD size; /* Block size; must be the first field */
57 DWORD magic : 24; /* Magic number */
58 DWORD unused_bytes : 8; /* Number of bytes in the block not used by user data (max value is HEAP_MIN_DATA_SIZE+HEAP_MIN_SHRINK_SIZE) */
59 } ARENA_INUSE;
60
61 typedef struct tagARENA_FREE
62 {
63 DWORD size; /* Block size; must be the first field */
64 DWORD magic; /* Magic number */
65 struct list entry; /* Entry in free list */
66 } ARENA_FREE;
67
68 typedef struct
69 {
70 struct list entry; /* entry in heap large blocks list */
71 SIZE_T data_size; /* size of user data */
72 SIZE_T block_size; /* total size of virtual memory block */
73 DWORD pad[2]; /* padding to ensure 16-byte alignment of data */
74 DWORD size; /* fields for compatibility with normal arenas */
75 DWORD magic; /* these must remain at the end of the structure */
76 } ARENA_LARGE;
77
78 #define ARENA_FLAG_FREE 0x00000001 /* flags OR'ed with arena size */
79 #define ARENA_FLAG_PREV_FREE 0x00000002
80 #define ARENA_SIZE_MASK (~3)
81 #define ARENA_LARGE_SIZE 0xfedcba90 /* magic value for 'size' field in large blocks */
82
83 /* Value for arena 'magic' field */
84 #define ARENA_INUSE_MAGIC 0x455355
85 #define ARENA_PENDING_MAGIC 0xbedead
86 #define ARENA_FREE_MAGIC 0x45455246
87 #define ARENA_LARGE_MAGIC 0x6752614c
88
89 #define ARENA_INUSE_FILLER 0x55
90 #define ARENA_TAIL_FILLER 0xab
91 #define ARENA_FREE_FILLER 0xfeeefeee
92
93 /* everything is aligned on 8 byte boundaries (16 for Win64) */
94 #define ALIGNMENT (2*sizeof(void*))
95 #define LARGE_ALIGNMENT 16 /* large blocks have stricter alignment */
96 #define ARENA_OFFSET (ALIGNMENT - sizeof(ARENA_INUSE))
97
98 C_ASSERT( sizeof(ARENA_LARGE) % LARGE_ALIGNMENT == 0 );
99
100 #define ROUND_SIZE(size) ((((size) + ALIGNMENT - 1) & ~(ALIGNMENT-1)) + ARENA_OFFSET)
101
102 #define QUIET 1 /* Suppress messages */
103 #define NOISY 0 /* Report all errors */
104
105 /* minimum data size (without arenas) of an allocated block */
106 /* make sure that it's larger than a free list entry */
107 #define HEAP_MIN_DATA_SIZE ROUND_SIZE(2 * sizeof(struct list))
108 #define HEAP_MIN_ARENA_SIZE (HEAP_MIN_DATA_SIZE + sizeof(ARENA_INUSE))
109 /* minimum size that must remain to shrink an allocated block */
110 #define HEAP_MIN_SHRINK_SIZE (HEAP_MIN_DATA_SIZE+sizeof(ARENA_FREE))
111 /* minimum size to start allocating large blocks */
112 #define HEAP_MIN_LARGE_BLOCK_SIZE 0x7f000
113 /* extra size to add at the end of block for tail checking */
114 #define HEAP_TAIL_EXTRA_SIZE(flags) \
115 ((flags & HEAP_TAIL_CHECKING_ENABLED) || RUNNING_ON_VALGRIND ? ALIGNMENT : 0)
116
117 /* There will be a free list bucket for every arena size up to and including this value */
118 #define HEAP_MAX_SMALL_FREE_LIST 0x100
119 C_ASSERT( HEAP_MAX_SMALL_FREE_LIST % ALIGNMENT == 0 );
120 #define HEAP_NB_SMALL_FREE_LISTS (((HEAP_MAX_SMALL_FREE_LIST - HEAP_MIN_ARENA_SIZE) / ALIGNMENT) + 1)
121
122 /* Max size of the blocks on the free lists above HEAP_MAX_SMALL_FREE_LIST */
123 static const SIZE_T HEAP_freeListSizes[] =
124 {
125 0x200, 0x400, 0x1000, ~0UL
126 };
127 #define HEAP_NB_FREE_LISTS (ARRAY_SIZE( HEAP_freeListSizes ) + HEAP_NB_SMALL_FREE_LISTS)
128
129 typedef union
130 {
131 ARENA_FREE arena;
132 void *alignment[4];
133 } FREE_LIST_ENTRY;
134
135 struct tagHEAP;
136
137 typedef struct tagSUBHEAP
138 {
139 void *base; /* Base address of the sub-heap memory block */
140 SIZE_T size; /* Size of the whole sub-heap */
141 SIZE_T min_commit; /* Minimum committed size */
142 SIZE_T commitSize; /* Committed size of the sub-heap */
143 struct list entry; /* Entry in sub-heap list */
144 struct tagHEAP *heap; /* Main heap structure */
145 DWORD headerSize; /* Size of the heap header */
146 DWORD magic; /* Magic number */
147 } SUBHEAP;
148
149 #define SUBHEAP_MAGIC ((DWORD)('S' | ('U'<<8) | ('B'<<16) | ('H'<<24)))
150
151 typedef struct tagHEAP
152 {
153 DWORD_PTR unknown1[2];
154 DWORD unknown2;
155 DWORD flags; /* Heap flags */
156 DWORD force_flags; /* Forced heap flags for debugging */
157 SUBHEAP subheap; /* First sub-heap */
158 struct list entry; /* Entry in process heap list */
159 struct list subheap_list; /* Sub-heap list */
160 struct list large_list; /* Large blocks list */
161 SIZE_T grow_size; /* Size of next subheap for growing heap */
162 DWORD magic; /* Magic number */
163 DWORD pending_pos; /* Position in pending free requests ring */
164 ARENA_INUSE **pending_free; /* Ring buffer for pending free requests */
165 RTL_CRITICAL_SECTION critSection; /* Critical section for serialization */
166 FREE_LIST_ENTRY *freeList; /* Free lists */
167 } HEAP;
168
169 #define HEAP_MAGIC ((DWORD)('H' | ('E'<<8) | ('A'<<16) | ('P'<<24)))
170
171 #define HEAP_DEF_SIZE 0x110000 /* Default heap size = 1Mb + 64Kb */
172 #define COMMIT_MASK 0xffff /* bitmask for commit/decommit granularity */
173 #define MAX_FREE_PENDING 1024 /* max number of free requests to delay */
174
175 /* some undocumented flags (names are made up) */
176 #define HEAP_PAGE_ALLOCS 0x01000000
177 #define HEAP_VALIDATE 0x10000000
178 #define HEAP_VALIDATE_ALL 0x20000000
179 #define HEAP_VALIDATE_PARAMS 0x40000000
180
181 static HEAP *processHeap; /* main process heap */
182
183 static BOOL HEAP_IsRealArena( HEAP *heapPtr, DWORD flags, LPCVOID block, BOOL quiet );
184
185 /* mark a block of memory as free for debugging purposes */
186 static inline void mark_block_free( void *ptr, SIZE_T size, DWORD flags )
187 {
188 if (flags & HEAP_FREE_CHECKING_ENABLED)
189 {
190 SIZE_T i;
191 for (i = 0; i < size / sizeof(DWORD); i++) ((DWORD *)ptr)[i] = ARENA_FREE_FILLER;
192 }
193 #if defined(VALGRIND_MAKE_MEM_NOACCESS)
194 VALGRIND_DISCARD( VALGRIND_MAKE_MEM_NOACCESS( ptr, size ));
195 #elif defined( VALGRIND_MAKE_NOACCESS)
196 VALGRIND_DISCARD( VALGRIND_MAKE_NOACCESS( ptr, size ));
197 #endif
198 }
199
200 /* mark a block of memory as initialized for debugging purposes */
201 static inline void mark_block_initialized( void *ptr, SIZE_T size )
202 {
203 #if defined(VALGRIND_MAKE_MEM_DEFINED)
204 VALGRIND_DISCARD( VALGRIND_MAKE_MEM_DEFINED( ptr, size ));
205 #elif defined(VALGRIND_MAKE_READABLE)
206 VALGRIND_DISCARD( VALGRIND_MAKE_READABLE( ptr, size ));
207 #endif
208 }
209
210 /* mark a block of memory as uninitialized for debugging purposes */
211 static inline void mark_block_uninitialized( void *ptr, SIZE_T size )
212 {
213 #if defined(VALGRIND_MAKE_MEM_UNDEFINED)
214 VALGRIND_DISCARD( VALGRIND_MAKE_MEM_UNDEFINED( ptr, size ));
215 #elif defined(VALGRIND_MAKE_WRITABLE)
216 VALGRIND_DISCARD( VALGRIND_MAKE_WRITABLE( ptr, size ));
217 #endif
218 }
219
220 /* mark a block of memory as a tail block */
221 static inline void mark_block_tail( void *ptr, SIZE_T size, DWORD flags )
222 {
223 if (flags & HEAP_TAIL_CHECKING_ENABLED)
224 {
225 mark_block_uninitialized( ptr, size );
226 memset( ptr, ARENA_TAIL_FILLER, size );
227 }
228 #if defined(VALGRIND_MAKE_MEM_NOACCESS)
229 VALGRIND_DISCARD( VALGRIND_MAKE_MEM_NOACCESS( ptr, size ));
230 #elif defined( VALGRIND_MAKE_NOACCESS)
231 VALGRIND_DISCARD( VALGRIND_MAKE_NOACCESS( ptr, size ));
232 #endif
233 }
234
235 /* initialize contents of a newly created block of memory */
236 static inline void initialize_block( void *ptr, SIZE_T size, SIZE_T unused, DWORD flags )
237 {
238 if (flags & HEAP_ZERO_MEMORY)
239 {
240 mark_block_initialized( ptr, size );
241 memset( ptr, 0, size );
242 }
243 else
244 {
245 mark_block_uninitialized( ptr, size );
246 if (flags & HEAP_FREE_CHECKING_ENABLED)
247 {
248 memset( ptr, ARENA_INUSE_FILLER, size );
249 mark_block_uninitialized( ptr, size );
250 }
251 }
252
253 mark_block_tail( (char *)ptr + size, unused, flags );
254 }
255
256 /* notify that a new block of memory has been allocated for debugging purposes */
257 static inline void notify_alloc( void *ptr, SIZE_T size, BOOL init )
258 {
259 #ifdef VALGRIND_MALLOCLIKE_BLOCK
260 VALGRIND_MALLOCLIKE_BLOCK( ptr, size, 0, init );
261 #endif
262 }
263
264 /* notify that a block of memory has been freed for debugging purposes */
265 static inline void notify_free( void const *ptr )
266 {
267 #ifdef VALGRIND_FREELIKE_BLOCK
268 VALGRIND_FREELIKE_BLOCK( ptr, 0 );
269 #endif
270 }
271
272 static inline void notify_realloc( void const *ptr, SIZE_T size_old, SIZE_T size_new )
273 {
274 #ifdef VALGRIND_RESIZEINPLACE_BLOCK
275 /* zero is not a valid size */
276 VALGRIND_RESIZEINPLACE_BLOCK( ptr, size_old ? size_old : 1, size_new ? size_new : 1, 0 );
277 #endif
278 }
279
280 static void subheap_notify_free_all(SUBHEAP const *subheap)
281 {
282 #ifdef VALGRIND_FREELIKE_BLOCK
283 char const *ptr = (char const *)subheap->base + subheap->headerSize;
284
285 if (!RUNNING_ON_VALGRIND) return;
286
287 while (ptr < (char const *)subheap->base + subheap->size)
288 {
289 if (*(const DWORD *)ptr & ARENA_FLAG_FREE)
290 {
291 ARENA_FREE const *pArena = (ARENA_FREE const *)ptr;
292 if (pArena->magic!=ARENA_FREE_MAGIC) ERR("bad free_magic @%p\n", pArena);
293 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
294 }
295 else
296 {
297 ARENA_INUSE const *pArena = (ARENA_INUSE const *)ptr;
298 if (pArena->magic == ARENA_INUSE_MAGIC) notify_free(pArena + 1);
299 else if (pArena->magic != ARENA_PENDING_MAGIC) ERR("bad inuse_magic @%p\n", pArena);
300 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
301 }
302 }
303 #endif
304 }
305
306 /* locate a free list entry of the appropriate size */
307 /* size is the size of the whole block including the arena header */
308 static inline unsigned int get_freelist_index( SIZE_T size )
309 {
310 unsigned int i;
311
312 if (size <= HEAP_MAX_SMALL_FREE_LIST)
313 return (size - HEAP_MIN_ARENA_SIZE) / ALIGNMENT;
314
315 for (i = HEAP_NB_SMALL_FREE_LISTS; i < HEAP_NB_FREE_LISTS - 1; i++)
316 if (size <= HEAP_freeListSizes[i - HEAP_NB_SMALL_FREE_LISTS]) break;
317 return i;
318 }
319
320 /* get the memory protection type to use for a given heap */
321 static inline ULONG get_protection_type( DWORD flags )
322 {
323 return (flags & HEAP_CREATE_ENABLE_EXECUTE) ? PAGE_EXECUTE_READWRITE : PAGE_READWRITE;
324 }
325
326 static RTL_CRITICAL_SECTION_DEBUG process_heap_critsect_debug =
327 {
328 0, 0, NULL, /* will be set later */
329 { &process_heap_critsect_debug.ProcessLocksList, &process_heap_critsect_debug.ProcessLocksList },
330 0, 0, { (DWORD_PTR)(__FILE__ ": main process heap section") }
331 };
332
333
334 /***********************************************************************
335 * HEAP_Dump
336 */
337 static void HEAP_Dump( HEAP *heap )
338 {
339 unsigned int i;
340 SUBHEAP *subheap;
341 char *ptr;
342
343 TRACE( "Heap: %p\n", heap );
344 TRACE( "Next: %p Sub-heaps:", LIST_ENTRY( heap->entry.next, HEAP, entry ) );
345 LIST_FOR_EACH_ENTRY( subheap, &heap->subheap_list, SUBHEAP, entry ) TRACE( " %p", subheap );
346
347 TRACE( "\nFree lists:\n Block Stat Size Id\n" );
348 for (i = 0; i < HEAP_NB_FREE_LISTS; i++)
349 TRACE( "%p free %08lx prev=%p next=%p\n",
350 &heap->freeList[i].arena, i < HEAP_NB_SMALL_FREE_LISTS ?
351 HEAP_MIN_ARENA_SIZE + i * ALIGNMENT : HEAP_freeListSizes[i - HEAP_NB_SMALL_FREE_LISTS],
352 LIST_ENTRY( heap->freeList[i].arena.entry.prev, ARENA_FREE, entry ),
353 LIST_ENTRY( heap->freeList[i].arena.entry.next, ARENA_FREE, entry ));
354
355 LIST_FOR_EACH_ENTRY( subheap, &heap->subheap_list, SUBHEAP, entry )
356 {
357 SIZE_T freeSize = 0, usedSize = 0, arenaSize = subheap->headerSize;
358 TRACE( "\n\nSub-heap %p: base=%p size=%08lx committed=%08lx\n",
359 subheap, subheap->base, subheap->size, subheap->commitSize );
360
361 TRACE( "\n Block Arena Stat Size Id\n" );
362 ptr = (char *)subheap->base + subheap->headerSize;
363 while (ptr < (char *)subheap->base + subheap->size)
364 {
365 if (*(DWORD *)ptr & ARENA_FLAG_FREE)
366 {
367 ARENA_FREE *pArena = (ARENA_FREE *)ptr;
368 TRACE( "%p %08x free %08x prev=%p next=%p\n",
369 pArena, pArena->magic,
370 pArena->size & ARENA_SIZE_MASK,
371 LIST_ENTRY( pArena->entry.prev, ARENA_FREE, entry ),
372 LIST_ENTRY( pArena->entry.next, ARENA_FREE, entry ) );
373 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
374 arenaSize += sizeof(ARENA_FREE);
375 freeSize += pArena->size & ARENA_SIZE_MASK;
376 }
377 else if (*(DWORD *)ptr & ARENA_FLAG_PREV_FREE)
378 {
379 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
380 TRACE( "%p %08x Used %08x back=%p\n",
381 pArena, pArena->magic, pArena->size & ARENA_SIZE_MASK, *((ARENA_FREE **)pArena - 1) );
382 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
383 arenaSize += sizeof(ARENA_INUSE);
384 usedSize += pArena->size & ARENA_SIZE_MASK;
385 }
386 else
387 {
388 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
389 TRACE( "%p %08x %s %08x\n",
390 pArena, pArena->magic, pArena->magic == ARENA_INUSE_MAGIC ? "used" : "pend",
391 pArena->size & ARENA_SIZE_MASK );
392 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
393 arenaSize += sizeof(ARENA_INUSE);
394 usedSize += pArena->size & ARENA_SIZE_MASK;
395 }
396 }
397 TRACE( "\nTotal: Size=%08lx Committed=%08lx Free=%08lx Used=%08lx Arenas=%08lx (%ld%%)\n\n",
398 subheap->size, subheap->commitSize, freeSize, usedSize,
399 arenaSize, (arenaSize * 100) / subheap->size );
400 }
401 }
402
403
404 static void HEAP_DumpEntry( LPPROCESS_HEAP_ENTRY entry )
405 {
406 WORD rem_flags;
407 TRACE( "Dumping entry %p\n", entry );
408 TRACE( "lpData\t\t: %p\n", entry->lpData );
409 TRACE( "cbData\t\t: %08x\n", entry->cbData);
410 TRACE( "cbOverhead\t: %08x\n", entry->cbOverhead);
411 TRACE( "iRegionIndex\t: %08x\n", entry->iRegionIndex);
412 TRACE( "WFlags\t\t: ");
413 if (entry->wFlags & PROCESS_HEAP_REGION)
414 TRACE( "PROCESS_HEAP_REGION ");
415 if (entry->wFlags & PROCESS_HEAP_UNCOMMITTED_RANGE)
416 TRACE( "PROCESS_HEAP_UNCOMMITTED_RANGE ");
417 if (entry->wFlags & PROCESS_HEAP_ENTRY_BUSY)
418 TRACE( "PROCESS_HEAP_ENTRY_BUSY ");
419 if (entry->wFlags & PROCESS_HEAP_ENTRY_MOVEABLE)
420 TRACE( "PROCESS_HEAP_ENTRY_MOVEABLE ");
421 if (entry->wFlags & PROCESS_HEAP_ENTRY_DDESHARE)
422 TRACE( "PROCESS_HEAP_ENTRY_DDESHARE ");
423 rem_flags = entry->wFlags &
424 ~(PROCESS_HEAP_REGION | PROCESS_HEAP_UNCOMMITTED_RANGE |
425 PROCESS_HEAP_ENTRY_BUSY | PROCESS_HEAP_ENTRY_MOVEABLE|
426 PROCESS_HEAP_ENTRY_DDESHARE);
427 if (rem_flags)
428 TRACE( "Unknown %08x", rem_flags);
429 TRACE( "\n");
430 if ((entry->wFlags & PROCESS_HEAP_ENTRY_BUSY )
431 && (entry->wFlags & PROCESS_HEAP_ENTRY_MOVEABLE))
432 {
433 /* Treat as block */
434 TRACE( "BLOCK->hMem\t\t:%p\n", entry->u.Block.hMem);
435 }
436 if (entry->wFlags & PROCESS_HEAP_REGION)
437 {
438 TRACE( "Region.dwCommittedSize\t:%08x\n",entry->u.Region.dwCommittedSize);
439 TRACE( "Region.dwUnCommittedSize\t:%08x\n",entry->u.Region.dwUnCommittedSize);
440 TRACE( "Region.lpFirstBlock\t:%p\n",entry->u.Region.lpFirstBlock);
441 TRACE( "Region.lpLastBlock\t:%p\n",entry->u.Region.lpLastBlock);
442 }
443 }
444
445 /***********************************************************************
446 * HEAP_GetPtr
447 * RETURNS
448 * Pointer to the heap
449 * NULL: Failure
450 */
451 static HEAP *HEAP_GetPtr(
452 HANDLE heap /* [in] Handle to the heap */
453 ) {
454 HEAP *heapPtr = heap;
455 if (!heapPtr || (heapPtr->magic != HEAP_MAGIC))
456 {
457 ERR("Invalid heap %p!\n", heap );
458 return NULL;
459 }
460 if ((heapPtr->flags & HEAP_VALIDATE_ALL) && !HEAP_IsRealArena( heapPtr, 0, NULL, NOISY ))
461 {
462 if (TRACE_ON(heap))
463 {
464 HEAP_Dump( heapPtr );
465 assert( FALSE );
466 }
467 return NULL;
468 }
469 return heapPtr;
470 }
471
472
473 /***********************************************************************
474 * HEAP_InsertFreeBlock
475 *
476 * Insert a free block into the free list.
477 */
478 static inline void HEAP_InsertFreeBlock( HEAP *heap, ARENA_FREE *pArena, BOOL last )
479 {
480 FREE_LIST_ENTRY *pEntry = heap->freeList + get_freelist_index( pArena->size + sizeof(*pArena) );
481 if (last)
482 {
483 /* insert at end of free list, i.e. before the next free list entry */
484 pEntry++;
485 if (pEntry == &heap->freeList[HEAP_NB_FREE_LISTS]) pEntry = heap->freeList;
486 list_add_before( &pEntry->arena.entry, &pArena->entry );
487 }
488 else
489 {
490 /* insert at head of free list */
491 list_add_after( &pEntry->arena.entry, &pArena->entry );
492 }
493 pArena->size |= ARENA_FLAG_FREE;
494 }
495
496
497 /***********************************************************************
498 * HEAP_FindSubHeap
499 * Find the sub-heap containing a given address.
500 *
501 * RETURNS
502 * Pointer: Success
503 * NULL: Failure
504 */
505 static SUBHEAP *HEAP_FindSubHeap(
506 const HEAP *heap, /* [in] Heap pointer */
507 LPCVOID ptr ) /* [in] Address */
508 {
509 SUBHEAP *sub;
510 LIST_FOR_EACH_ENTRY( sub, &heap->subheap_list, SUBHEAP, entry )
511 if ((ptr >= sub->base) &&
512 ((const char *)ptr < (const char *)sub->base + sub->size - sizeof(ARENA_INUSE)))
513 return sub;
514 return NULL;
515 }
516
517
518 /***********************************************************************
519 * HEAP_Commit
520 *
521 * Make sure the heap storage is committed for a given size in the specified arena.
522 */
523 static inline BOOL HEAP_Commit( SUBHEAP *subheap, ARENA_INUSE *pArena, SIZE_T data_size )
524 {
525 void *ptr = (char *)(pArena + 1) + data_size + sizeof(ARENA_FREE);
526 SIZE_T size = (char *)ptr - (char *)subheap->base;
527 size = (size + COMMIT_MASK) & ~COMMIT_MASK;
528 if (size > subheap->size) size = subheap->size;
529 if (size <= subheap->commitSize) return TRUE;
530 size -= subheap->commitSize;
531 ptr = (char *)subheap->base + subheap->commitSize;
532 if (NtAllocateVirtualMemory( NtCurrentProcess(), &ptr, 0,
533 &size, MEM_COMMIT, get_protection_type( subheap->heap->flags ) ))
534 {
535 WARN("Could not commit %08lx bytes at %p for heap %p\n",
536 size, ptr, subheap->heap );
537 return FALSE;
538 }
539 subheap->commitSize += size;
540 return TRUE;
541 }
542
543
544 /***********************************************************************
545 * HEAP_Decommit
546 *
547 * If possible, decommit the heap storage from (including) 'ptr'.
548 */
549 static inline BOOL HEAP_Decommit( SUBHEAP *subheap, void *ptr )
550 {
551 void *addr;
552 SIZE_T decommit_size;
553 SIZE_T size = (char *)ptr - (char *)subheap->base;
554
555 /* round to next block and add one full block */
556 size = ((size + COMMIT_MASK) & ~COMMIT_MASK) + COMMIT_MASK + 1;
557 size = max( size, subheap->min_commit );
558 if (size >= subheap->commitSize) return TRUE;
559 decommit_size = subheap->commitSize - size;
560 addr = (char *)subheap->base + size;
561
562 if (NtFreeVirtualMemory( NtCurrentProcess(), &addr, &decommit_size, MEM_DECOMMIT ))
563 {
564 WARN("Could not decommit %08lx bytes at %p for heap %p\n",
565 decommit_size, (char *)subheap->base + size, subheap->heap );
566 return FALSE;
567 }
568 subheap->commitSize -= decommit_size;
569 return TRUE;
570 }
571
572
573 /***********************************************************************
574 * HEAP_CreateFreeBlock
575 *
576 * Create a free block at a specified address. 'size' is the size of the
577 * whole block, including the new arena.
578 */
579 static void HEAP_CreateFreeBlock( SUBHEAP *subheap, void *ptr, SIZE_T size )
580 {
581 ARENA_FREE *pFree;
582 char *pEnd;
583 BOOL last;
584 DWORD flags = subheap->heap->flags;
585
586 /* Create a free arena */
587 mark_block_uninitialized( ptr, sizeof(ARENA_FREE) );
588 pFree = ptr;
589 pFree->magic = ARENA_FREE_MAGIC;
590
591 /* If debugging, erase the freed block content */
592
593 pEnd = (char *)ptr + size;
594 if (pEnd > (char *)subheap->base + subheap->commitSize)
595 pEnd = (char *)subheap->base + subheap->commitSize;
596 if (pEnd > (char *)(pFree + 1)) mark_block_free( pFree + 1, pEnd - (char *)(pFree + 1), flags );
597
598 /* Check if next block is free also */
599
600 if (((char *)ptr + size < (char *)subheap->base + subheap->size) &&
601 (*(DWORD *)((char *)ptr + size) & ARENA_FLAG_FREE))
602 {
603 /* Remove the next arena from the free list */
604 ARENA_FREE *pNext = (ARENA_FREE *)((char *)ptr + size);
605 list_remove( &pNext->entry );
606 size += (pNext->size & ARENA_SIZE_MASK) + sizeof(*pNext);
607 mark_block_free( pNext, sizeof(ARENA_FREE), flags );
608 }
609
610 /* Set the next block PREV_FREE flag and pointer */
611
612 last = ((char *)ptr + size >= (char *)subheap->base + subheap->size);
613 if (!last)
614 {
615 DWORD *pNext = (DWORD *)((char *)ptr + size);
616 *pNext |= ARENA_FLAG_PREV_FREE;
617 mark_block_initialized( (ARENA_FREE **)pNext - 1, sizeof( ARENA_FREE * ) );
618 *((ARENA_FREE **)pNext - 1) = pFree;
619 }
620
621 /* Last, insert the new block into the free list */
622
623 pFree->size = size - sizeof(*pFree);
624 HEAP_InsertFreeBlock( subheap->heap, pFree, last );
625 }
626
627
628 /***********************************************************************
629 * HEAP_MakeInUseBlockFree
630 *
631 * Turn an in-use block into a free block. Can also decommit the end of
632 * the heap, and possibly even free the sub-heap altogether.
633 */
634 static void HEAP_MakeInUseBlockFree( SUBHEAP *subheap, ARENA_INUSE *pArena )
635 {
636 HEAP *heap = subheap->heap;
637 ARENA_FREE *pFree;
638 SIZE_T size;
639
640 if (heap->pending_free)
641 {
642 ARENA_INUSE *prev = heap->pending_free[heap->pending_pos];
643 heap->pending_free[heap->pending_pos] = pArena;
644 heap->pending_pos = (heap->pending_pos + 1) % MAX_FREE_PENDING;
645 pArena->magic = ARENA_PENDING_MAGIC;
646 mark_block_free( pArena + 1, pArena->size & ARENA_SIZE_MASK, heap->flags );
647 if (!prev) return;
648 pArena = prev;
649 subheap = HEAP_FindSubHeap( heap, pArena );
650 }
651
652 /* Check if we can merge with previous block */
653
654 size = (pArena->size & ARENA_SIZE_MASK) + sizeof(*pArena);
655 if (pArena->size & ARENA_FLAG_PREV_FREE)
656 {
657 pFree = *((ARENA_FREE **)pArena - 1);
658 size += (pFree->size & ARENA_SIZE_MASK) + sizeof(ARENA_FREE);
659 /* Remove it from the free list */
660 list_remove( &pFree->entry );
661 }
662 else pFree = (ARENA_FREE *)pArena;
663
664 /* Create a free block */
665
666 HEAP_CreateFreeBlock( subheap, pFree, size );
667 size = (pFree->size & ARENA_SIZE_MASK) + sizeof(ARENA_FREE);
668 if ((char *)pFree + size < (char *)subheap->base + subheap->size)
669 return; /* Not the last block, so nothing more to do */
670
671 /* Free the whole sub-heap if it's empty and not the original one */
672
673 if (((char *)pFree == (char *)subheap->base + subheap->headerSize) &&
674 (subheap != &subheap->heap->subheap))
675 {
676 void *addr = subheap->base;
677
678 size = 0;
679 /* Remove the free block from the list */
680 list_remove( &pFree->entry );
681 /* Remove the subheap from the list */
682 list_remove( &subheap->entry );
683 /* Free the memory */
684 subheap->magic = 0;
685 NtFreeVirtualMemory( NtCurrentProcess(), &addr, &size, MEM_RELEASE );
686 return;
687 }
688
689 /* Decommit the end of the heap */
690
691 if (!(subheap->heap->flags & HEAP_SHARED)) HEAP_Decommit( subheap, pFree + 1 );
692 }
693
694
695 /***********************************************************************
696 * HEAP_ShrinkBlock
697 *
698 * Shrink an in-use block.
699 */
700 static void HEAP_ShrinkBlock(SUBHEAP *subheap, ARENA_INUSE *pArena, SIZE_T size)
701 {
702 if ((pArena->size & ARENA_SIZE_MASK) >= size + HEAP_MIN_SHRINK_SIZE)
703 {
704 HEAP_CreateFreeBlock( subheap, (char *)(pArena + 1) + size,
705 (pArena->size & ARENA_SIZE_MASK) - size );
706 /* assign size plus previous arena flags */
707 pArena->size = size | (pArena->size & ~ARENA_SIZE_MASK);
708 }
709 else
710 {
711 /* Turn off PREV_FREE flag in next block */
712 char *pNext = (char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK);
713 if (pNext < (char *)subheap->base + subheap->size)
714 *(DWORD *)pNext &= ~ARENA_FLAG_PREV_FREE;
715 }
716 }
717
718
719 /***********************************************************************
720 * allocate_large_block
721 */
722 static void *allocate_large_block( HEAP *heap, DWORD flags, SIZE_T size )
723 {
724 ARENA_LARGE *arena;
725 SIZE_T block_size = sizeof(*arena) + ROUND_SIZE(size) + HEAP_TAIL_EXTRA_SIZE(flags);
726 LPVOID address = NULL;
727
728 if (block_size < size) return NULL; /* overflow */
729 if (virtual_alloc_aligned( &address, 0, &block_size, MEM_COMMIT, get_protection_type( flags ), 5 ))
730 {
731 WARN("Could not allocate block for %08lx bytes\n", size );
732 return NULL;
733 }
734 arena = address;
735 arena->data_size = size;
736 arena->block_size = block_size;
737 arena->size = ARENA_LARGE_SIZE;
738 arena->magic = ARENA_LARGE_MAGIC;
739 mark_block_tail( (char *)(arena + 1) + size, block_size - sizeof(*arena) - size, flags );
740 list_add_tail( &heap->large_list, &arena->entry );
741 notify_alloc( arena + 1, size, flags & HEAP_ZERO_MEMORY );
742 return arena + 1;
743 }
744
745
746 /***********************************************************************
747 * free_large_block
748 */
749 static void free_large_block( HEAP *heap, DWORD flags, void *ptr )
750 {
751 ARENA_LARGE *arena = (ARENA_LARGE *)ptr - 1;
752 LPVOID address = arena;
753 SIZE_T size = 0;
754
755 list_remove( &arena->entry );
756 NtFreeVirtualMemory( NtCurrentProcess(), &address, &size, MEM_RELEASE );
757 }
758
759
760 /***********************************************************************
761 * realloc_large_block
762 */
763 static void *realloc_large_block( HEAP *heap, DWORD flags, void *ptr, SIZE_T size )
764 {
765 ARENA_LARGE *arena = (ARENA_LARGE *)ptr - 1;
766 void *new_ptr;
767
768 if (arena->block_size - sizeof(*arena) >= size)
769 {
770 SIZE_T unused = arena->block_size - sizeof(*arena) - size;
771
772 /* FIXME: we could remap zero-pages instead */
773 #ifdef VALGRIND_RESIZEINPLACE_BLOCK
774 if (RUNNING_ON_VALGRIND)
775 notify_realloc( arena + 1, arena->data_size, size );
776 else
777 #endif
778 if (size > arena->data_size)
779 initialize_block( (char *)ptr + arena->data_size, size - arena->data_size, unused, flags );
780 else
781 mark_block_tail( (char *)ptr + size, unused, flags );
782 arena->data_size = size;
783 return ptr;
784 }
785 if (flags & HEAP_REALLOC_IN_PLACE_ONLY) return NULL;
786 if (!(new_ptr = allocate_large_block( heap, flags, size )))
787 {
788 WARN("Could not allocate block for %08lx bytes\n", size );
789 return NULL;
790 }
791 memcpy( new_ptr, ptr, arena->data_size );
792 free_large_block( heap, flags, ptr );
793 notify_free( ptr );
794 return new_ptr;
795 }
796
797
798 /***********************************************************************
799 * find_large_block
800 */
801 static ARENA_LARGE *find_large_block( HEAP *heap, const void *ptr )
802 {
803 ARENA_LARGE *arena;
804
805 LIST_FOR_EACH_ENTRY( arena, &heap->large_list, ARENA_LARGE, entry )
806 if (ptr == arena + 1) return arena;
807
808 return NULL;
809 }
810
811
812 /***********************************************************************
813 * validate_large_arena
814 */
815 static BOOL validate_large_arena( HEAP *heap, const ARENA_LARGE *arena, BOOL quiet )
816 {
817 DWORD flags = heap->flags;
818
819 if ((ULONG_PTR)arena % page_size)
820 {
821 if (quiet == NOISY)
822 {
823 ERR( "Heap %p: invalid large arena pointer %p\n", heap, arena );
824 if (TRACE_ON(heap)) HEAP_Dump( heap );
825 }
826 else if (WARN_ON(heap))
827 {
828 WARN( "Heap %p: unaligned arena pointer %p\n", heap, arena );
829 if (TRACE_ON(heap)) HEAP_Dump( heap );
830 }
831 return FALSE;
832 }
833 if (arena->size != ARENA_LARGE_SIZE || arena->magic != ARENA_LARGE_MAGIC)
834 {
835 if (quiet == NOISY)
836 {
837 ERR( "Heap %p: invalid large arena %p values %x/%x\n",
838 heap, arena, arena->size, arena->magic );
839 if (TRACE_ON(heap)) HEAP_Dump( heap );
840 }
841 else if (WARN_ON(heap))
842 {
843 WARN( "Heap %p: invalid large arena %p values %x/%x\n",
844 heap, arena, arena->size, arena->magic );
845 if (TRACE_ON(heap)) HEAP_Dump( heap );
846 }
847 return FALSE;
848 }
849 if (arena->data_size > arena->block_size - sizeof(*arena))
850 {
851 ERR( "Heap %p: invalid large arena %p size %lx/%lx\n",
852 heap, arena, arena->data_size, arena->block_size );
853 return FALSE;
854 }
855 if (flags & HEAP_TAIL_CHECKING_ENABLED)
856 {
857 SIZE_T i, unused = arena->block_size - sizeof(*arena) - arena->data_size;
858 const unsigned char *data = (const unsigned char *)(arena + 1) + arena->data_size;
859
860 for (i = 0; i < unused; i++)
861 {
862 if (data[i] == ARENA_TAIL_FILLER) continue;
863 ERR("Heap %p: block %p tail overwritten at %p (byte %lu/%lu == 0x%02x)\n",
864 heap, arena + 1, data + i, i, unused, data[i] );
865 return FALSE;
866 }
867 }
868 return TRUE;
869 }
870
871
872 /***********************************************************************
873 * HEAP_CreateSubHeap
874 */
875 static SUBHEAP *HEAP_CreateSubHeap( HEAP *heap, LPVOID address, DWORD flags,
876 SIZE_T commitSize, SIZE_T totalSize )
877 {
878 SUBHEAP *subheap;
879 FREE_LIST_ENTRY *pEntry;
880 unsigned int i;
881
882 if (!address)
883 {
884 if (!commitSize) commitSize = COMMIT_MASK + 1;
885 totalSize = min( totalSize, 0xffff0000 ); /* don't allow a heap larger than 4GB */
886 if (totalSize < commitSize) totalSize = commitSize;
887 if (flags & HEAP_SHARED) commitSize = totalSize; /* always commit everything in a shared heap */
888 commitSize = min( totalSize, (commitSize + COMMIT_MASK) & ~COMMIT_MASK );
889
890 /* allocate the memory block */
891 if (NtAllocateVirtualMemory( NtCurrentProcess(), &address, 0, &totalSize,
892 MEM_RESERVE, get_protection_type( flags ) ))
893 {
894 WARN("Could not allocate %08lx bytes\n", totalSize );
895 return NULL;
896 }
897 if (NtAllocateVirtualMemory( NtCurrentProcess(), &address, 0,
898 &commitSize, MEM_COMMIT, get_protection_type( flags ) ))
899 {
900 WARN("Could not commit %08lx bytes for sub-heap %p\n", commitSize, address );
901 return NULL;
902 }
903 }
904
905 if (heap)
906 {
907 /* If this is a secondary subheap, insert it into list */
908
909 subheap = address;
910 subheap->base = address;
911 subheap->heap = heap;
912 subheap->size = totalSize;
913 subheap->min_commit = 0x10000;
914 subheap->commitSize = commitSize;
915 subheap->magic = SUBHEAP_MAGIC;
916 subheap->headerSize = ROUND_SIZE( sizeof(SUBHEAP) );
917 list_add_head( &heap->subheap_list, &subheap->entry );
918 }
919 else
920 {
921 /* If this is a primary subheap, initialize main heap */
922
923 heap = address;
924 heap->flags = flags;
925 heap->magic = HEAP_MAGIC;
926 heap->grow_size = max( HEAP_DEF_SIZE, totalSize );
927 list_init( &heap->subheap_list );
928 list_init( &heap->large_list );
929
930 subheap = &heap->subheap;
931 subheap->base = address;
932 subheap->heap = heap;
933 subheap->size = totalSize;
934 subheap->min_commit = commitSize;
935 subheap->commitSize = commitSize;
936 subheap->magic = SUBHEAP_MAGIC;
937 subheap->headerSize = ROUND_SIZE( sizeof(HEAP) );
938 list_add_head( &heap->subheap_list, &subheap->entry );
939
940 /* Build the free lists */
941
942 heap->freeList = (FREE_LIST_ENTRY *)((char *)heap + subheap->headerSize);
943 subheap->headerSize += HEAP_NB_FREE_LISTS * sizeof(FREE_LIST_ENTRY);
944 list_init( &heap->freeList[0].arena.entry );
945 for (i = 0, pEntry = heap->freeList; i < HEAP_NB_FREE_LISTS; i++, pEntry++)
946 {
947 pEntry->arena.size = 0 | ARENA_FLAG_FREE;
948 pEntry->arena.magic = ARENA_FREE_MAGIC;
949 if (i) list_add_after( &pEntry[-1].arena.entry, &pEntry->arena.entry );
950 }
951
952 /* Initialize critical section */
953
954 if (!processHeap) /* do it by hand to avoid memory allocations */
955 {
956 heap->critSection.DebugInfo = &process_heap_critsect_debug;
957 heap->critSection.LockCount = -1;
958 heap->critSection.RecursionCount = 0;
959 heap->critSection.OwningThread = 0;
960 heap->critSection.LockSemaphore = 0;
961 heap->critSection.SpinCount = 0;
962 process_heap_critsect_debug.CriticalSection = &heap->critSection;
963 }
964 else
965 {
966 RtlInitializeCriticalSection( &heap->critSection );
967 heap->critSection.DebugInfo->Spare[0] = (DWORD_PTR)(__FILE__ ": HEAP.critSection");
968 }
969
970 if (flags & HEAP_SHARED)
971 {
972 /* let's assume that only one thread at a time will try to do this */
973 HANDLE sem = heap->critSection.LockSemaphore;
974 if (!sem) NtCreateSemaphore( &sem, SEMAPHORE_ALL_ACCESS, NULL, 0, 1 );
975
976 NtDuplicateObject( NtCurrentProcess(), sem, NtCurrentProcess(), &sem, 0, 0,
977 DUP_HANDLE_MAKE_GLOBAL | DUP_HANDLE_SAME_ACCESS | DUP_HANDLE_CLOSE_SOURCE );
978 heap->critSection.LockSemaphore = sem;
979 RtlFreeHeap( processHeap, 0, heap->critSection.DebugInfo );
980 heap->critSection.DebugInfo = NULL;
981 }
982 }
983
984 /* Create the first free block */
985
986 HEAP_CreateFreeBlock( subheap, (LPBYTE)subheap->base + subheap->headerSize,
987 subheap->size - subheap->headerSize );
988
989 return subheap;
990 }
991
992
993 /***********************************************************************
994 * HEAP_FindFreeBlock
995 *
996 * Find a free block at least as large as the requested size, and make sure
997 * the requested size is committed.
998 */
999 static ARENA_FREE *HEAP_FindFreeBlock( HEAP *heap, SIZE_T size,
1000 SUBHEAP **ppSubHeap )
1001 {
1002 SUBHEAP *subheap;
1003 struct list *ptr;
1004 SIZE_T total_size;
1005 FREE_LIST_ENTRY *pEntry = heap->freeList + get_freelist_index( size + sizeof(ARENA_INUSE) );
1006
1007 /* Find a suitable free list, and in it find a block large enough */
1008
1009 ptr = &pEntry->arena.entry;
1010 while ((ptr = list_next( &heap->freeList[0].arena.entry, ptr )))
1011 {
1012 ARENA_FREE *pArena = LIST_ENTRY( ptr, ARENA_FREE, entry );
1013 SIZE_T arena_size = (pArena->size & ARENA_SIZE_MASK) +
1014 sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
1015 if (arena_size >= size)
1016 {
1017 subheap = HEAP_FindSubHeap( heap, pArena );
1018 if (!HEAP_Commit( subheap, (ARENA_INUSE *)pArena, size )) return NULL;
1019 *ppSubHeap = subheap;
1020 return pArena;
1021 }
1022 }
1023
1024 /* If no block was found, attempt to grow the heap */
1025
1026 if (!(heap->flags & HEAP_GROWABLE))
1027 {
1028 WARN("Not enough space in heap %p for %08lx bytes\n", heap, size );
1029 return NULL;
1030 }
1031 /* make sure that we have a big enough size *committed* to fit another
1032 * last free arena in !
1033 * So just one heap struct, one first free arena which will eventually
1034 * get used, and a second free arena that might get assigned all remaining
1035 * free space in HEAP_ShrinkBlock() */
1036 total_size = size + ROUND_SIZE(sizeof(SUBHEAP)) + sizeof(ARENA_INUSE) + sizeof(ARENA_FREE);
1037 if (total_size < size) return NULL; /* overflow */
1038
1039 if ((subheap = HEAP_CreateSubHeap( heap, NULL, heap->flags, total_size,
1040 max( heap->grow_size, total_size ) )))
1041 {
1042 if (heap->grow_size < 128 * 1024 * 1024) heap->grow_size *= 2;
1043 }
1044 else while (!subheap) /* shrink the grow size again if we are running out of space */
1045 {
1046 if (heap->grow_size <= total_size || heap->grow_size <= 4 * 1024 * 1024) return NULL;
1047 heap->grow_size /= 2;
1048 subheap = HEAP_CreateSubHeap( heap, NULL, heap->flags, total_size,
1049 max( heap->grow_size, total_size ) );
1050 }
1051
1052 TRACE("created new sub-heap %p of %08lx bytes for heap %p\n",
1053 subheap, subheap->size, heap );
1054
1055 *ppSubHeap = subheap;
1056 return (ARENA_FREE *)((char *)subheap->base + subheap->headerSize);
1057 }
1058
1059
1060 /***********************************************************************
1061 * HEAP_IsValidArenaPtr
1062 *
1063 * Check that the pointer is inside the range possible for arenas.
1064 */
1065 static BOOL HEAP_IsValidArenaPtr( const HEAP *heap, const ARENA_FREE *ptr )
1066 {
1067 unsigned int i;
1068 const SUBHEAP *subheap = HEAP_FindSubHeap( heap, ptr );
1069 if (!subheap) return FALSE;
1070 if ((const char *)ptr >= (const char *)subheap->base + subheap->headerSize) return TRUE;
1071 if (subheap != &heap->subheap) return FALSE;
1072 for (i = 0; i < HEAP_NB_FREE_LISTS; i++)
1073 if (ptr == &heap->freeList[i].arena) return TRUE;
1074 return FALSE;
1075 }
1076
1077
1078 /***********************************************************************
1079 * HEAP_ValidateFreeArena
1080 */
1081 static BOOL HEAP_ValidateFreeArena( SUBHEAP *subheap, ARENA_FREE *pArena )
1082 {
1083 DWORD flags = subheap->heap->flags;
1084 SIZE_T size;
1085 ARENA_FREE *prev, *next;
1086 char *heapEnd = (char *)subheap->base + subheap->size;
1087
1088 /* Check for unaligned pointers */
1089 if ((ULONG_PTR)pArena % ALIGNMENT != ARENA_OFFSET)
1090 {
1091 ERR("Heap %p: unaligned arena pointer %p\n", subheap->heap, pArena );
1092 return FALSE;
1093 }
1094
1095 /* Check magic number */
1096 if (pArena->magic != ARENA_FREE_MAGIC)
1097 {
1098 ERR("Heap %p: invalid free arena magic %08x for %p\n", subheap->heap, pArena->magic, pArena );
1099 return FALSE;
1100 }
1101 /* Check size flags */
1102 if (!(pArena->size & ARENA_FLAG_FREE) ||
1103 (pArena->size & ARENA_FLAG_PREV_FREE))
1104 {
1105 ERR("Heap %p: bad flags %08x for free arena %p\n",
1106 subheap->heap, pArena->size & ~ARENA_SIZE_MASK, pArena );
1107 return FALSE;
1108 }
1109 /* Check arena size */
1110 size = pArena->size & ARENA_SIZE_MASK;
1111 if ((char *)(pArena + 1) + size > heapEnd)
1112 {
1113 ERR("Heap %p: bad size %08lx for free arena %p\n", subheap->heap, size, pArena );
1114 return FALSE;
1115 }
1116 /* Check that next pointer is valid */
1117 next = LIST_ENTRY( pArena->entry.next, ARENA_FREE, entry );
1118 if (!HEAP_IsValidArenaPtr( subheap->heap, next ))
1119 {
1120 ERR("Heap %p: bad next ptr %p for arena %p\n",
1121 subheap->heap, next, pArena );
1122 return FALSE;
1123 }
1124 /* Check that next arena is free */
1125 if (!(next->size & ARENA_FLAG_FREE) || (next->magic != ARENA_FREE_MAGIC))
1126 {
1127 ERR("Heap %p: next arena %p invalid for %p\n",
1128 subheap->heap, next, pArena );
1129 return FALSE;
1130 }
1131 /* Check that prev pointer is valid */
1132 prev = LIST_ENTRY( pArena->entry.prev, ARENA_FREE, entry );
1133 if (!HEAP_IsValidArenaPtr( subheap->heap, prev ))
1134 {
1135 ERR("Heap %p: bad prev ptr %p for arena %p\n",
1136 subheap->heap, prev, pArena );
1137 return FALSE;
1138 }
1139 /* Check that prev arena is free */
1140 if (!(prev->size & ARENA_FLAG_FREE) || (prev->magic != ARENA_FREE_MAGIC))
1141 {
1142 /* this often means that the prev arena got overwritten
1143 * by a memory write before that prev arena */
1144 ERR("Heap %p: prev arena %p invalid for %p\n",
1145 subheap->heap, prev, pArena );
1146 return FALSE;
1147 }
1148 /* Check that next block has PREV_FREE flag */
1149 if ((char *)(pArena + 1) + size < heapEnd)
1150 {
1151 if (!(*(DWORD *)((char *)(pArena + 1) + size) & ARENA_FLAG_PREV_FREE))
1152 {
1153 ERR("Heap %p: free arena %p next block has no PREV_FREE flag\n",
1154 subheap->heap, pArena );
1155 return FALSE;
1156 }
1157 /* Check next block back pointer */
1158 if (*((ARENA_FREE **)((char *)(pArena + 1) + size) - 1) != pArena)
1159 {
1160 ERR("Heap %p: arena %p has wrong back ptr %p\n",
1161 subheap->heap, pArena,
1162 *((ARENA_FREE **)((char *)(pArena+1) + size) - 1));
1163 return FALSE;
1164 }
1165 }
1166 if (flags & HEAP_FREE_CHECKING_ENABLED)
1167 {
1168 DWORD *ptr = (DWORD *)(pArena + 1);
1169 char *end = (char *)(pArena + 1) + size;
1170
1171 if (end >= heapEnd) end = (char *)subheap->base + subheap->commitSize;
1172 else end -= sizeof(ARENA_FREE *);
1173 while (ptr < (DWORD *)end)
1174 {
1175 if (*ptr != ARENA_FREE_FILLER)
1176 {
1177 ERR("Heap %p: free block %p overwritten at %p by %08x\n",
1178 subheap->heap, (ARENA_INUSE *)pArena + 1, ptr, *ptr );
1179 return FALSE;
1180 }
1181 ptr++;
1182 }
1183 }
1184 return TRUE;
1185 }
1186
1187
1188 /***********************************************************************
1189 * HEAP_ValidateInUseArena
1190 */
1191 static BOOL HEAP_ValidateInUseArena( const SUBHEAP *subheap, const ARENA_INUSE *pArena, BOOL quiet )
1192 {
1193 SIZE_T size;
1194 DWORD i, flags = subheap->heap->flags;
1195 const char *heapEnd = (const char *)subheap->base + subheap->size;
1196
1197 /* Check for unaligned pointers */
1198 if ((ULONG_PTR)pArena % ALIGNMENT != ARENA_OFFSET)
1199 {
1200 if ( quiet == NOISY )
1201 {
1202 ERR( "Heap %p: unaligned arena pointer %p\n", subheap->heap, pArena );
1203 if ( TRACE_ON(heap) )
1204 HEAP_Dump( subheap->heap );
1205 }
1206 else if ( WARN_ON(heap) )
1207 {
1208 WARN( "Heap %p: unaligned arena pointer %p\n", subheap->heap, pArena );
1209 if ( TRACE_ON(heap) )
1210 HEAP_Dump( subheap->heap );
1211 }
1212 return FALSE;
1213 }
1214
1215 /* Check magic number */
1216 if (pArena->magic != ARENA_INUSE_MAGIC && pArena->magic != ARENA_PENDING_MAGIC)
1217 {
1218 if (quiet == NOISY) {
1219 ERR("Heap %p: invalid in-use arena magic %08x for %p\n", subheap->heap, pArena->magic, pArena );
1220 if (TRACE_ON(heap))
1221 HEAP_Dump( subheap->heap );
1222 } else if (WARN_ON(heap)) {
1223 WARN("Heap %p: invalid in-use arena magic %08x for %p\n", subheap->heap, pArena->magic, pArena );
1224 if (TRACE_ON(heap))
1225 HEAP_Dump( subheap->heap );
1226 }
1227 return FALSE;
1228 }
1229 /* Check size flags */
1230 if (pArena->size & ARENA_FLAG_FREE)
1231 {
1232 ERR("Heap %p: bad flags %08x for in-use arena %p\n",
1233 subheap->heap, pArena->size & ~ARENA_SIZE_MASK, pArena );
1234 return FALSE;
1235 }
1236 /* Check arena size */
1237 size = pArena->size & ARENA_SIZE_MASK;
1238 if ((const char *)(pArena + 1) + size > heapEnd ||
1239 (const char *)(pArena + 1) + size < (const char *)(pArena + 1))
1240 {
1241 ERR("Heap %p: bad size %08lx for in-use arena %p\n", subheap->heap, size, pArena );
1242 return FALSE;
1243 }
1244 /* Check next arena PREV_FREE flag */
1245 if (((const char *)(pArena + 1) + size < heapEnd) &&
1246 (*(const DWORD *)((const char *)(pArena + 1) + size) & ARENA_FLAG_PREV_FREE))
1247 {
1248 ERR("Heap %p: in-use arena %p next block %p has PREV_FREE flag %x\n",
1249 subheap->heap, pArena, (const char *)(pArena + 1) + size,*(const DWORD *)((const char *)(pArena + 1) + size) );
1250 return FALSE;
1251 }
1252 /* Check prev free arena */
1253 if (pArena->size & ARENA_FLAG_PREV_FREE)
1254 {
1255 const ARENA_FREE *pPrev = *((const ARENA_FREE * const*)pArena - 1);
1256 /* Check prev pointer */
1257 if (!HEAP_IsValidArenaPtr( subheap->heap, pPrev ))
1258 {
1259 ERR("Heap %p: bad back ptr %p for arena %p\n",
1260 subheap->heap, pPrev, pArena );
1261 return FALSE;
1262 }
1263 /* Check that prev arena is free */
1264 if (!(pPrev->size & ARENA_FLAG_FREE) ||
1265 (pPrev->magic != ARENA_FREE_MAGIC))
1266 {
1267 ERR("Heap %p: prev arena %p invalid for in-use %p\n",
1268 subheap->heap, pPrev, pArena );
1269 return FALSE;
1270 }
1271 /* Check that prev arena is really the previous block */
1272 if ((const char *)(pPrev + 1) + (pPrev->size & ARENA_SIZE_MASK) != (const char *)pArena)
1273 {
1274 ERR("Heap %p: prev arena %p is not prev for in-use %p\n",
1275 subheap->heap, pPrev, pArena );
1276 return FALSE;
1277 }
1278 }
1279 /* Check unused size */
1280 if (pArena->unused_bytes > size)
1281 {
1282 ERR("Heap %p: invalid unused size %08x/%08lx\n", subheap->heap, pArena->unused_bytes, size );
1283 return FALSE;
1284 }
1285 /* Check unused bytes */
1286 if (pArena->magic == ARENA_PENDING_MAGIC)
1287 {
1288 const DWORD *ptr = (const DWORD *)(pArena + 1);
1289 const DWORD *end = (const DWORD *)((const char *)ptr + size);
1290
1291 while (ptr < end)
1292 {
1293 if (*ptr != ARENA_FREE_FILLER)
1294 {
1295 ERR("Heap %p: free block %p overwritten at %p by %08x\n",
1296 subheap->heap, pArena + 1, ptr, *ptr );
1297 if (!*ptr) { HEAP_Dump( subheap->heap ); DbgBreakPoint(); }
1298 return FALSE;
1299 }
1300 ptr++;
1301 }
1302 }
1303 else if (flags & HEAP_TAIL_CHECKING_ENABLED)
1304 {
1305 const unsigned char *data = (const unsigned char *)(pArena + 1) + size - pArena->unused_bytes;
1306
1307 for (i = 0; i < pArena->unused_bytes; i++)
1308 {
1309 if (data[i] == ARENA_TAIL_FILLER) continue;
1310 ERR("Heap %p: block %p tail overwritten at %p (byte %u/%u == 0x%02x)\n",
1311 subheap->heap, pArena + 1, data + i, i, pArena->unused_bytes, data[i] );
1312 return FALSE;
1313 }
1314 }
1315 return TRUE;
1316 }
1317
1318
1319 /***********************************************************************
1320 * HEAP_IsRealArena [Internal]
1321 * Validates a block is a valid arena.
1322 *
1323 * RETURNS
1324 * TRUE: Success
1325 * FALSE: Failure
1326 */
1327 static BOOL HEAP_IsRealArena( HEAP *heapPtr, /* [in] ptr to the heap */
1328 DWORD flags, /* [in] Bit flags that control access during operation */
1329 LPCVOID block, /* [in] Optional pointer to memory block to validate */
1330 BOOL quiet ) /* [in] Flag - if true, HEAP_ValidateInUseArena
1331 * does not complain */
1332 {
1333 SUBHEAP *subheap;
1334 BOOL ret = TRUE;
1335 const ARENA_LARGE *large_arena;
1336
1337 flags &= HEAP_NO_SERIALIZE;
1338 flags |= heapPtr->flags;
1339 /* calling HeapLock may result in infinite recursion, so do the critsect directly */
1340 if (!(flags & HEAP_NO_SERIALIZE))
1341 RtlEnterCriticalSection( &heapPtr->critSection );
1342
1343 if (block) /* only check this single memory block */
1344 {
1345 const ARENA_INUSE *arena = (const ARENA_INUSE *)block - 1;
1346
1347 if (!(subheap = HEAP_FindSubHeap( heapPtr, arena )) ||
1348 ((const char *)arena < (char *)subheap->base + subheap->headerSize))
1349 {
1350 if (!(large_arena = find_large_block( heapPtr, block )))
1351 {
1352 if (quiet == NOISY)
1353 ERR("Heap %p: block %p is not inside heap\n", heapPtr, block );
1354 else if (WARN_ON(heap))
1355 WARN("Heap %p: block %p is not inside heap\n", heapPtr, block );
1356 ret = FALSE;
1357 }
1358 else
1359 ret = validate_large_arena( heapPtr, large_arena, quiet );
1360 } else
1361 ret = HEAP_ValidateInUseArena( subheap, arena, quiet );
1362
1363 if (!(flags & HEAP_NO_SERIALIZE))
1364 RtlLeaveCriticalSection( &heapPtr->critSection );
1365 return ret;
1366 }
1367
1368 LIST_FOR_EACH_ENTRY( subheap, &heapPtr->subheap_list, SUBHEAP, entry )
1369 {
1370 char *ptr = (char *)subheap->base + subheap->headerSize;
1371 while (ptr < (char *)subheap->base + subheap->size)
1372 {
1373 if (*(DWORD *)ptr & ARENA_FLAG_FREE)
1374 {
1375 if (!HEAP_ValidateFreeArena( subheap, (ARENA_FREE *)ptr )) {
1376 ret = FALSE;
1377 break;
1378 }
1379 ptr += sizeof(ARENA_FREE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
1380 }
1381 else
1382 {
1383 if (!HEAP_ValidateInUseArena( subheap, (ARENA_INUSE *)ptr, NOISY )) {
1384 ret = FALSE;
1385 break;
1386 }
1387 ptr += sizeof(ARENA_INUSE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
1388 }
1389 }
1390 if (!ret) break;
1391 }
1392
1393 LIST_FOR_EACH_ENTRY( large_arena, &heapPtr->large_list, ARENA_LARGE, entry )
1394 if (!(ret = validate_large_arena( heapPtr, large_arena, quiet ))) break;
1395
1396 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1397 return ret;
1398 }
1399
1400
1401 /***********************************************************************
1402 * validate_block_pointer
1403 *
1404 * Minimum validation needed to catch bad parameters in heap functions.
1405 */
1406 static BOOL validate_block_pointer( HEAP *heap, SUBHEAP **ret_subheap, const ARENA_INUSE *arena )
1407 {
1408 SUBHEAP *subheap;
1409 BOOL ret = FALSE;
1410
1411 if (!(*ret_subheap = subheap = HEAP_FindSubHeap( heap, arena )))
1412 {
1413 ARENA_LARGE *large_arena = find_large_block( heap, arena + 1 );
1414
1415 if (!large_arena)
1416 {
1417 WARN( "Heap %p: pointer %p is not inside heap\n", heap, arena + 1 );
1418 return FALSE;
1419 }
1420 if ((heap->flags & HEAP_VALIDATE) && !validate_large_arena( heap, large_arena, QUIET ))
1421 return FALSE;
1422 return TRUE;
1423 }
1424
1425 if ((const char *)arena < (char *)subheap->base + subheap->headerSize)
1426 WARN( "Heap %p: pointer %p is inside subheap %p header\n", subheap->heap, arena + 1, subheap );
1427 else if (subheap->heap->flags & HEAP_VALIDATE) /* do the full validation */
1428 ret = HEAP_ValidateInUseArena( subheap, arena, QUIET );
1429 else if ((ULONG_PTR)arena % ALIGNMENT != ARENA_OFFSET)
1430 WARN( "Heap %p: unaligned arena pointer %p\n", subheap->heap, arena );
1431 else if (arena->magic == ARENA_PENDING_MAGIC)
1432 WARN( "Heap %p: block %p used after free\n", subheap->heap, arena + 1 );
1433 else if (arena->magic != ARENA_INUSE_MAGIC)
1434 WARN( "Heap %p: invalid in-use arena magic %08x for %p\n", subheap->heap, arena->magic, arena );
1435 else if (arena->size & ARENA_FLAG_FREE)
1436 ERR( "Heap %p: bad flags %08x for in-use arena %p\n",
1437 subheap->heap, arena->size & ~ARENA_SIZE_MASK, arena );
1438 else if ((const char *)(arena + 1) + (arena->size & ARENA_SIZE_MASK) > (const char *)subheap->base + subheap->size ||
1439 (const char *)(arena + 1) + (arena->size & ARENA_SIZE_MASK) < (const char *)(arena + 1))
1440 ERR( "Heap %p: bad size %08x for in-use arena %p\n",
1441 subheap->heap, arena->size & ARENA_SIZE_MASK, arena );
1442 else
1443 ret = TRUE;
1444
1445 return ret;
1446 }
1447
1448
1449 /***********************************************************************
1450 * heap_set_debug_flags
1451 */
1452 void heap_set_debug_flags( HANDLE handle )
1453 {
1454 HEAP *heap = HEAP_GetPtr( handle );
1455 ULONG global_flags = RtlGetNtGlobalFlags();
1456 ULONG flags = 0;
1457
1458 if (TRACE_ON(heap)) global_flags |= FLG_HEAP_VALIDATE_ALL;
1459 if (WARN_ON(heap)) global_flags |= FLG_HEAP_VALIDATE_PARAMETERS;
1460
1461 if (global_flags & FLG_HEAP_ENABLE_TAIL_CHECK) flags |= HEAP_TAIL_CHECKING_ENABLED;
1462 if (global_flags & FLG_HEAP_ENABLE_FREE_CHECK) flags |= HEAP_FREE_CHECKING_ENABLED;
1463 if (global_flags & FLG_HEAP_DISABLE_COALESCING) flags |= HEAP_DISABLE_COALESCE_ON_FREE;
1464 if (global_flags & FLG_HEAP_PAGE_ALLOCS) flags |= HEAP_PAGE_ALLOCS | HEAP_GROWABLE;
1465
1466 if (global_flags & FLG_HEAP_VALIDATE_PARAMETERS)
1467 flags |= HEAP_VALIDATE | HEAP_VALIDATE_PARAMS |
1468 HEAP_TAIL_CHECKING_ENABLED | HEAP_FREE_CHECKING_ENABLED;
1469 if (global_flags & FLG_HEAP_VALIDATE_ALL)
1470 flags |= HEAP_VALIDATE | HEAP_VALIDATE_ALL |
1471 HEAP_TAIL_CHECKING_ENABLED | HEAP_FREE_CHECKING_ENABLED;
1472
1473 if (RUNNING_ON_VALGRIND) flags = 0; /* no sense in validating since Valgrind catches accesses */
1474
1475 heap->flags |= flags;
1476 heap->force_flags |= flags & ~(HEAP_VALIDATE | HEAP_DISABLE_COALESCE_ON_FREE);
1477
1478 if (flags & (HEAP_FREE_CHECKING_ENABLED | HEAP_TAIL_CHECKING_ENABLED)) /* fix existing blocks */
1479 {
1480 SUBHEAP *subheap;
1481 ARENA_LARGE *large;
1482
1483 LIST_FOR_EACH_ENTRY( subheap, &heap->subheap_list, SUBHEAP, entry )
1484 {
1485 char *ptr = (char *)subheap->base + subheap->headerSize;
1486 char *end = (char *)subheap->base + subheap->commitSize;
1487 while (ptr < end)
1488 {
1489 ARENA_INUSE *arena = (ARENA_INUSE *)ptr;
1490 SIZE_T size = arena->size & ARENA_SIZE_MASK;
1491 if (arena->size & ARENA_FLAG_FREE)
1492 {
1493 SIZE_T count = size;
1494
1495 ptr += sizeof(ARENA_FREE) + size;
1496 if (ptr >= end) count = end - (char *)((ARENA_FREE *)arena + 1);
1497 else count -= sizeof(ARENA_FREE *);
1498 mark_block_free( (ARENA_FREE *)arena + 1, count, flags );
1499 }
1500 else
1501 {
1502 if (arena->magic == ARENA_PENDING_MAGIC)
1503 mark_block_free( arena + 1, size, flags );
1504 else
1505 mark_block_tail( (char *)(arena + 1) + size - arena->unused_bytes,
1506 arena->unused_bytes, flags );
1507 ptr += sizeof(ARENA_INUSE) + size;
1508 }
1509 }
1510 }
1511
1512 LIST_FOR_EACH_ENTRY( large, &heap->large_list, ARENA_LARGE, entry )
1513 mark_block_tail( (char *)(large + 1) + large->data_size,
1514 large->block_size - sizeof(*large) - large->data_size, flags );
1515 }
1516
1517 if ((heap->flags & HEAP_GROWABLE) && !heap->pending_free &&
1518 ((flags & HEAP_FREE_CHECKING_ENABLED) || RUNNING_ON_VALGRIND))
1519 {
1520 void *ptr = NULL;
1521 SIZE_T size = MAX_FREE_PENDING * sizeof(*heap->pending_free);
1522
1523 if (!virtual_alloc_aligned( &ptr, 0, &size, MEM_COMMIT, PAGE_READWRITE, 4 ))
1524 {
1525 heap->pending_free = ptr;
1526 heap->pending_pos = 0;
1527 }
1528 }
1529 }
1530
1531
1532 /***********************************************************************
1533 * RtlCreateHeap (NTDLL.@)
1534 *
1535 * Create a new Heap.
1536 *
1537 * PARAMS
1538 * flags [I] HEAP_ flags from "winnt.h"
1539 * addr [I] Desired base address
1540 * totalSize [I] Total size of the heap, or 0 for a growable heap
1541 * commitSize [I] Amount of heap space to commit
1542 * unknown [I] Not yet understood
1543 * definition [I] Heap definition
1544 *
1545 * RETURNS
1546 * Success: A HANDLE to the newly created heap.
1547 * Failure: a NULL HANDLE.
1548 */
1549 HANDLE WINAPI RtlCreateHeap( ULONG flags, PVOID addr, SIZE_T totalSize, SIZE_T commitSize,
1550 PVOID unknown, PRTL_HEAP_DEFINITION definition )
1551 {
1552 SUBHEAP *subheap;
1553
1554 /* Allocate the heap block */
1555
1556 if (!totalSize)
1557 {
1558 totalSize = HEAP_DEF_SIZE;
1559 flags |= HEAP_GROWABLE;
1560 }
1561
1562 if (!(subheap = HEAP_CreateSubHeap( NULL, addr, flags, commitSize, totalSize ))) return 0;
1563
1564 heap_set_debug_flags( subheap->heap );
1565
1566 /* link it into the per-process heap list */
1567 if (processHeap)
1568 {
1569 HEAP *heapPtr = subheap->heap;
1570 RtlEnterCriticalSection( &processHeap->critSection );
1571 list_add_head( &processHeap->entry, &heapPtr->entry );
1572 RtlLeaveCriticalSection( &processHeap->critSection );
1573 }
1574 else if (!addr)
1575 {
1576 processHeap = subheap->heap; /* assume the first heap we create is the process main heap */
1577 list_init( &processHeap->entry );
1578 }
1579
1580 return subheap->heap;
1581 }
1582
1583
1584 /***********************************************************************
1585 * RtlDestroyHeap (NTDLL.@)
1586 *
1587 * Destroy a Heap created with RtlCreateHeap().
1588 *
1589 * PARAMS
1590 * heap [I] Heap to destroy.
1591 *
1592 * RETURNS
1593 * Success: A NULL HANDLE, if heap is NULL or it was destroyed
1594 * Failure: The Heap handle, if heap is the process heap.
1595 */
1596 HANDLE WINAPI RtlDestroyHeap( HANDLE heap )
1597 {
1598 HEAP *heapPtr = HEAP_GetPtr( heap );
1599 SUBHEAP *subheap, *next;
1600 ARENA_LARGE *arena, *arena_next;
1601 SIZE_T size;
1602 void *addr;
1603
1604 TRACE("%p\n", heap );
1605 if (!heapPtr) return heap;
1606
1607 if (heap == processHeap) return heap; /* cannot delete the main process heap */
1608
1609 /* remove it from the per-process list */
1610 RtlEnterCriticalSection( &processHeap->critSection );
1611 list_remove( &heapPtr->entry );
1612 RtlLeaveCriticalSection( &processHeap->critSection );
1613
1614 heapPtr->critSection.DebugInfo->Spare[0] = 0;
1615 RtlDeleteCriticalSection( &heapPtr->critSection );
1616
1617 LIST_FOR_EACH_ENTRY_SAFE( arena, arena_next, &heapPtr->large_list, ARENA_LARGE, entry )
1618 {
1619 list_remove( &arena->entry );
1620 size = 0;
1621 addr = arena;
1622 NtFreeVirtualMemory( NtCurrentProcess(), &addr, &size, MEM_RELEASE );
1623 }
1624 LIST_FOR_EACH_ENTRY_SAFE( subheap, next, &heapPtr->subheap_list, SUBHEAP, entry )
1625 {
1626 if (subheap == &heapPtr->subheap) continue; /* do this one last */
1627 subheap_notify_free_all(subheap);
1628 list_remove( &subheap->entry );
1629 size = 0;
1630 addr = subheap->base;
1631 NtFreeVirtualMemory( NtCurrentProcess(), &addr, &size, MEM_RELEASE );
1632 }
1633 subheap_notify_free_all(&heapPtr->subheap);
1634 if (heapPtr->pending_free)
1635 {
1636 size = 0;
1637 addr = heapPtr->pending_free;
1638 NtFreeVirtualMemory( NtCurrentProcess(), &addr, &size, MEM_RELEASE );
1639 }
1640 size = 0;
1641 addr = heapPtr->subheap.base;
1642 NtFreeVirtualMemory( NtCurrentProcess(), &addr, &size, MEM_RELEASE );
1643 return 0;
1644 }
1645
1646
1647 /***********************************************************************
1648 * RtlAllocateHeap (NTDLL.@)
1649 *
1650 * Allocate a memory block from a Heap.
1651 *
1652 * PARAMS
1653 * heap [I] Heap to allocate block from
1654 * flags [I] HEAP_ flags from "winnt.h"
1655 * size [I] Size of the memory block to allocate
1656 *
1657 * RETURNS
1658 * Success: A pointer to the newly allocated block
1659 * Failure: NULL.
1660 *
1661 * NOTES
1662 * This call does not SetLastError().
1663 */
1664 void * WINAPI DECLSPEC_HOTPATCH RtlAllocateHeap( HANDLE heap, ULONG flags, SIZE_T size )
1665 {
1666 ARENA_FREE *pArena;
1667 ARENA_INUSE *pInUse;
1668 SUBHEAP *subheap;
1669 HEAP *heapPtr = HEAP_GetPtr( heap );
1670 SIZE_T rounded_size;
1671
1672 /* Validate the parameters */
1673
1674 if (!heapPtr) return NULL;
1675 flags &= HEAP_GENERATE_EXCEPTIONS | HEAP_NO_SERIALIZE | HEAP_ZERO_MEMORY;
1676 flags |= heapPtr->flags;
1677 rounded_size = ROUND_SIZE(size) + HEAP_TAIL_EXTRA_SIZE( flags );
1678 if (rounded_size < size) /* overflow */
1679 {
1680 if (flags & HEAP_GENERATE_EXCEPTIONS) RtlRaiseStatus( STATUS_NO_MEMORY );
1681 return NULL;
1682 }
1683 if (rounded_size < HEAP_MIN_DATA_SIZE) rounded_size = HEAP_MIN_DATA_SIZE;
1684
1685 if (!(flags & HEAP_NO_SERIALIZE)) RtlEnterCriticalSection( &heapPtr->critSection );
1686
1687 if (rounded_size >= HEAP_MIN_LARGE_BLOCK_SIZE && (flags & HEAP_GROWABLE))
1688 {
1689 void *ret = allocate_large_block( heap, flags, size );
1690 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1691 if (!ret && (flags & HEAP_GENERATE_EXCEPTIONS)) RtlRaiseStatus( STATUS_NO_MEMORY );
1692 TRACE("(%p,%08x,%08lx): returning %p\n", heap, flags, size, ret );
1693 return ret;
1694 }
1695
1696 /* Locate a suitable free block */
1697
1698 if (!(pArena = HEAP_FindFreeBlock( heapPtr, rounded_size, &subheap )))
1699 {
1700 TRACE("(%p,%08x,%08lx): returning NULL\n",
1701 heap, flags, size );
1702 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1703 if (flags & HEAP_GENERATE_EXCEPTIONS) RtlRaiseStatus( STATUS_NO_MEMORY );
1704 return NULL;
1705 }
1706
1707 /* Remove the arena from the free list */
1708
1709 list_remove( &pArena->entry );
1710
1711 /* Build the in-use arena */
1712
1713 pInUse = (ARENA_INUSE *)pArena;
1714
1715 /* in-use arena is smaller than free arena,
1716 * so we have to add the difference to the size */
1717 pInUse->size = (pInUse->size & ~ARENA_FLAG_FREE) + sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
1718 pInUse->magic = ARENA_INUSE_MAGIC;
1719
1720 /* Shrink the block */
1721
1722 HEAP_ShrinkBlock( subheap, pInUse, rounded_size );
1723 pInUse->unused_bytes = (pInUse->size & ARENA_SIZE_MASK) - size;
1724
1725 notify_alloc( pInUse + 1, size, flags & HEAP_ZERO_MEMORY );
1726 initialize_block( pInUse + 1, size, pInUse->unused_bytes, flags );
1727
1728 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1729
1730 TRACE("(%p,%08x,%08lx): returning %p\n", heap, flags, size, pInUse + 1 );
1731 return pInUse + 1;
1732 }
1733
1734
1735 /***********************************************************************
1736 * RtlFreeHeap (NTDLL.@)
1737 *
1738 * Free a memory block allocated with RtlAllocateHeap().
1739 *
1740 * PARAMS
1741 * heap [I] Heap that block was allocated from
1742 * flags [I] HEAP_ flags from "winnt.h"
1743 * ptr [I] Block to free
1744 *
1745 * RETURNS
1746 * Success: TRUE, if ptr is NULL or was freed successfully.
1747 * Failure: FALSE.
1748 */
1749 BOOLEAN WINAPI DECLSPEC_HOTPATCH RtlFreeHeap( HANDLE heap, ULONG flags, void *ptr )
1750 {
1751 ARENA_INUSE *pInUse;
1752 SUBHEAP *subheap;
1753 HEAP *heapPtr;
1754
1755 /* Validate the parameters */
1756
1757 if (!ptr) return TRUE; /* freeing a NULL ptr isn't an error in Win2k */
1758
1759 heapPtr = HEAP_GetPtr( heap );
1760 if (!heapPtr)
1761 {
1762 RtlSetLastWin32ErrorAndNtStatusFromNtStatus( STATUS_INVALID_HANDLE );
1763 return FALSE;
1764 }
1765
1766 flags &= HEAP_NO_SERIALIZE;
1767 flags |= heapPtr->flags;
1768 if (!(flags & HEAP_NO_SERIALIZE)) RtlEnterCriticalSection( &heapPtr->critSection );
1769
1770 /* Inform valgrind we are trying to free memory, so it can throw up an error message */
1771 notify_free( ptr );
1772
1773 /* Some sanity checks */
1774 pInUse = (ARENA_INUSE *)ptr - 1;
1775 if (!validate_block_pointer( heapPtr, &subheap, pInUse )) goto error;
1776
1777 if (!subheap)
1778 free_large_block( heapPtr, flags, ptr );
1779 else
1780 HEAP_MakeInUseBlockFree( subheap, pInUse );
1781
1782 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1783 TRACE("(%p,%08x,%p): returning TRUE\n", heap, flags, ptr );
1784 return TRUE;
1785
1786 error:
1787 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1788 RtlSetLastWin32ErrorAndNtStatusFromNtStatus( STATUS_INVALID_PARAMETER );
1789 TRACE("(%p,%08x,%p): returning FALSE\n", heap, flags, ptr );
1790 return FALSE;
1791 }
1792
1793
1794 /***********************************************************************
1795 * RtlReAllocateHeap (NTDLL.@)
1796 *
1797 * Change the size of a memory block allocated with RtlAllocateHeap().
1798 *
1799 * PARAMS
1800 * heap [I] Heap that block was allocated from
1801 * flags [I] HEAP_ flags from "winnt.h"
1802 * ptr [I] Block to resize
1803 * size [I] Size of the memory block to allocate
1804 *
1805 * RETURNS
1806 * Success: A pointer to the resized block (which may be different).
1807 * Failure: NULL.
1808 */
1809 PVOID WINAPI RtlReAllocateHeap( HANDLE heap, ULONG flags, PVOID ptr, SIZE_T size )
1810 {
1811 ARENA_INUSE *pArena;
1812 HEAP *heapPtr;
1813 SUBHEAP *subheap;
1814 SIZE_T oldBlockSize, oldActualSize, rounded_size;
1815 void *ret;
1816
1817 if (!ptr) return NULL;
1818 if (!(heapPtr = HEAP_GetPtr( heap )))
1819 {
1820 RtlSetLastWin32ErrorAndNtStatusFromNtStatus( STATUS_INVALID_HANDLE );
1821 return NULL;
1822 }
1823
1824 /* Validate the parameters */
1825
1826 flags &= HEAP_GENERATE_EXCEPTIONS | HEAP_NO_SERIALIZE | HEAP_ZERO_MEMORY |
1827 HEAP_REALLOC_IN_PLACE_ONLY;
1828 flags |= heapPtr->flags;
1829 if (!(flags & HEAP_NO_SERIALIZE)) RtlEnterCriticalSection( &heapPtr->critSection );
1830
1831 rounded_size = ROUND_SIZE(size) + HEAP_TAIL_EXTRA_SIZE(flags);
1832 if (rounded_size < size) goto oom; /* overflow */
1833 if (rounded_size < HEAP_MIN_DATA_SIZE) rounded_size = HEAP_MIN_DATA_SIZE;
1834
1835 pArena = (ARENA_INUSE *)ptr - 1;
1836 if (!validate_block_pointer( heapPtr, &subheap, pArena )) goto error;
1837 if (!subheap)
1838 {
1839 if (!(ret = realloc_large_block( heapPtr, flags, ptr, size ))) goto oom;
1840 goto done;
1841 }
1842
1843 /* Check if we need to grow the block */
1844
1845 oldBlockSize = (pArena->size & ARENA_SIZE_MASK);
1846 oldActualSize = (pArena->size & ARENA_SIZE_MASK) - pArena->unused_bytes;
1847 if (rounded_size > oldBlockSize)
1848 {
1849 char *pNext = (char *)(pArena + 1) + oldBlockSize;
1850
1851 if (rounded_size >= HEAP_MIN_LARGE_BLOCK_SIZE && (flags & HEAP_GROWABLE))
1852 {
1853 if (flags & HEAP_REALLOC_IN_PLACE_ONLY) goto oom;
1854 if (!(ret = allocate_large_block( heapPtr, flags, size ))) goto oom;
1855 memcpy( ret, pArena + 1, oldActualSize );
1856 notify_free( pArena + 1 );
1857 HEAP_MakeInUseBlockFree( subheap, pArena );
1858 goto done;
1859 }
1860 if ((pNext < (char *)subheap->base + subheap->size) &&
1861 (*(DWORD *)pNext & ARENA_FLAG_FREE) &&
1862 (oldBlockSize + (*(DWORD *)pNext & ARENA_SIZE_MASK) + sizeof(ARENA_FREE) >= rounded_size))
1863 {
1864 /* The next block is free and large enough */
1865 ARENA_FREE *pFree = (ARENA_FREE *)pNext;
1866 list_remove( &pFree->entry );
1867 pArena->size += (pFree->size & ARENA_SIZE_MASK) + sizeof(*pFree);
1868 if (!HEAP_Commit( subheap, pArena, rounded_size )) goto oom;
1869 notify_realloc( pArena + 1, oldActualSize, size );
1870 HEAP_ShrinkBlock( subheap, pArena, rounded_size );
1871 }
1872 else /* Do it the hard way */
1873 {
1874 ARENA_FREE *pNew;
1875 ARENA_INUSE *pInUse;
1876 SUBHEAP *newsubheap;
1877
1878 if ((flags & HEAP_REALLOC_IN_PLACE_ONLY) ||
1879 !(pNew = HEAP_FindFreeBlock( heapPtr, rounded_size, &newsubheap )))
1880 goto oom;
1881
1882 /* Build the in-use arena */
1883
1884 list_remove( &pNew->entry );
1885 pInUse = (ARENA_INUSE *)pNew;
1886 pInUse->size = (pInUse->size & ~ARENA_FLAG_FREE)
1887 + sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
1888 pInUse->magic = ARENA_INUSE_MAGIC;
1889 HEAP_ShrinkBlock( newsubheap, pInUse, rounded_size );
1890
1891 mark_block_initialized( pInUse + 1, oldActualSize );
1892 notify_alloc( pInUse + 1, size, FALSE );
1893 memcpy( pInUse + 1, pArena + 1, oldActualSize );
1894
1895 /* Free the previous block */
1896
1897 notify_free( pArena + 1 );
1898 HEAP_MakeInUseBlockFree( subheap, pArena );
1899 subheap = newsubheap;
1900 pArena = pInUse;
1901 }
1902 }
1903 else
1904 {
1905 notify_realloc( pArena + 1, oldActualSize, size );
1906 HEAP_ShrinkBlock( subheap, pArena, rounded_size );
1907 }
1908
1909 pArena->unused_bytes = (pArena->size & ARENA_SIZE_MASK) - size;
1910
1911 /* Clear the extra bytes if needed */
1912
1913 if (size > oldActualSize)
1914 initialize_block( (char *)(pArena + 1) + oldActualSize, size - oldActualSize,
1915 pArena->unused_bytes, flags );
1916 else
1917 mark_block_tail( (char *)(pArena + 1) + size, pArena->unused_bytes, flags );
1918
1919 /* Return the new arena */
1920
1921 ret = pArena + 1;
1922 done:
1923 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1924 TRACE("(%p,%08x,%p,%08lx): returning %p\n", heap, flags, ptr, size, ret );
1925 return ret;
1926
1927 oom:
1928 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1929 if (flags & HEAP_GENERATE_EXCEPTIONS) RtlRaiseStatus( STATUS_NO_MEMORY );
1930 RtlSetLastWin32ErrorAndNtStatusFromNtStatus( STATUS_NO_MEMORY );
1931 TRACE("(%p,%08x,%p,%08lx): returning NULL\n", heap, flags, ptr, size );
1932 return NULL;
1933
1934 error:
1935 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
1936 RtlSetLastWin32ErrorAndNtStatusFromNtStatus( STATUS_INVALID_PARAMETER );
1937 TRACE("(%p,%08x,%p,%08lx): returning NULL\n", heap, flags, ptr, size );
1938 return NULL;
1939 }
1940
1941
1942 /***********************************************************************
1943 * RtlCompactHeap (NTDLL.@)
1944 *
1945 * Compact the free space in a Heap.
1946 *
1947 * PARAMS
1948 * heap [I] Heap that block was allocated from
1949 * flags [I] HEAP_ flags from "winnt.h"
1950 *
1951 * RETURNS
1952 * The number of bytes compacted.
1953 *
1954 * NOTES
1955 * This function is a harmless stub.
1956 */
1957 ULONG WINAPI RtlCompactHeap( HANDLE heap, ULONG flags )
1958 {
1959 static BOOL reported;
1960 if (!reported++) FIXME( "(%p, 0x%x) stub\n", heap, flags );
1961 return 0;
1962 }
1963
1964
1965 /***********************************************************************
1966 * RtlLockHeap (NTDLL.@)
1967 *
1968 * Lock a Heap.
1969 *
1970 * PARAMS
1971 * heap [I] Heap to lock
1972 *
1973 * RETURNS
1974 * Success: TRUE. The Heap is locked.
1975 * Failure: FALSE, if heap is invalid.
1976 */
1977 BOOLEAN WINAPI RtlLockHeap( HANDLE heap )
1978 {
1979 HEAP *heapPtr = HEAP_GetPtr( heap );
1980 if (!heapPtr) return FALSE;
1981 RtlEnterCriticalSection( &heapPtr->critSection );
1982 return TRUE;
1983 }
1984
1985
1986 /***********************************************************************
1987 * RtlUnlockHeap (NTDLL.@)
1988 *
1989 * Unlock a Heap.
1990 *
1991 * PARAMS
1992 * heap [I] Heap to unlock
1993 *
1994 * RETURNS
1995 * Success: TRUE. The Heap is unlocked.
1996 * Failure: FALSE, if heap is invalid.
1997 */
1998 BOOLEAN WINAPI RtlUnlockHeap( HANDLE heap )
1999 {
2000 HEAP *heapPtr = HEAP_GetPtr( heap );
2001 if (!heapPtr) return FALSE;
2002 RtlLeaveCriticalSection( &heapPtr->critSection );
2003 return TRUE;
2004 }
2005
2006
2007 /***********************************************************************
2008 * RtlSizeHeap (NTDLL.@)
2009 *
2010 * Get the actual size of a memory block allocated from a Heap.
2011 *
2012 * PARAMS
2013 * heap [I] Heap that block was allocated from
2014 * flags [I] HEAP_ flags from "winnt.h"
2015 * ptr [I] Block to get the size of
2016 *
2017 * RETURNS
2018 * Success: The size of the block.
2019 * Failure: -1, heap or ptr are invalid.
2020 *
2021 * NOTES
2022 * The size may be bigger than what was passed to RtlAllocateHeap().
2023 */
2024 SIZE_T WINAPI RtlSizeHeap( HANDLE heap, ULONG flags, const void *ptr )
2025 {
2026 SIZE_T ret;
2027 const ARENA_INUSE *pArena;
2028 SUBHEAP *subheap;
2029 HEAP *heapPtr = HEAP_GetPtr( heap );
2030
2031 if (!heapPtr)
2032 {
2033 RtlSetLastWin32ErrorAndNtStatusFromNtStatus( STATUS_INVALID_HANDLE );
2034 return ~0UL;
2035 }
2036 flags &= HEAP_NO_SERIALIZE;
2037 flags |= heapPtr->flags;
2038 if (!(flags & HEAP_NO_SERIALIZE)) RtlEnterCriticalSection( &heapPtr->critSection );
2039
2040 pArena = (const ARENA_INUSE *)ptr - 1;
2041 if (!validate_block_pointer( heapPtr, &subheap, pArena ))
2042 {
2043 RtlSetLastWin32ErrorAndNtStatusFromNtStatus( STATUS_INVALID_PARAMETER );
2044 ret = ~0UL;
2045 }
2046 else if (!subheap)
2047 {
2048 const ARENA_LARGE *large_arena = (const ARENA_LARGE *)ptr - 1;
2049 ret = large_arena->data_size;
2050 }
2051 else
2052 {
2053 ret = (pArena->size & ARENA_SIZE_MASK) - pArena->unused_bytes;
2054 }
2055 if (!(flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
2056
2057 TRACE("(%p,%08x,%p): returning %08lx\n", heap, flags, ptr, ret );
2058 return ret;
2059 }
2060
2061
2062 /***********************************************************************
2063 * RtlValidateHeap (NTDLL.@)
2064 *
2065 * Determine if a block is a valid allocation from a heap.
2066 *
2067 * PARAMS
2068 * heap [I] Heap that block was allocated from
2069 * flags [I] HEAP_ flags from "winnt.h"
2070 * ptr [I] Block to check
2071 *
2072 * RETURNS
2073 * Success: TRUE. The block was allocated from heap.
2074 * Failure: FALSE, if heap is invalid or ptr was not allocated from it.
2075 */
2076 BOOLEAN WINAPI RtlValidateHeap( HANDLE heap, ULONG flags, LPCVOID ptr )
2077 {
2078 HEAP *heapPtr = HEAP_GetPtr( heap );
2079 if (!heapPtr) return FALSE;
2080 return HEAP_IsRealArena( heapPtr, flags, ptr, QUIET );
2081 }
2082
2083
2084 /***********************************************************************
2085 * RtlWalkHeap (NTDLL.@)
2086 *
2087 * FIXME
2088 * The PROCESS_HEAP_ENTRY flag values seem different between this
2089 * function and HeapWalk(). To be checked.
2090 */
2091 NTSTATUS WINAPI RtlWalkHeap( HANDLE heap, PVOID entry_ptr )
2092 {
2093 LPPROCESS_HEAP_ENTRY entry = entry_ptr; /* FIXME */
2094 HEAP *heapPtr = HEAP_GetPtr(heap);
2095 SUBHEAP *sub, *currentheap = NULL;
2096 NTSTATUS ret;
2097 char *ptr;
2098 int region_index = 0;
2099
2100 if (!heapPtr || !entry) return STATUS_INVALID_PARAMETER;
2101
2102 if (!(heapPtr->flags & HEAP_NO_SERIALIZE)) RtlEnterCriticalSection( &heapPtr->critSection );
2103
2104 /* FIXME: enumerate large blocks too */
2105
2106 /* set ptr to the next arena to be examined */
2107
2108 if (!entry->lpData) /* first call (init) ? */
2109 {
2110 TRACE("begin walking of heap %p.\n", heap);
2111 currentheap = &heapPtr->subheap;
2112 ptr = (char*)currentheap->base + currentheap->headerSize;
2113 }
2114 else
2115 {
2116 ptr = entry->lpData;
2117 LIST_FOR_EACH_ENTRY( sub, &heapPtr->subheap_list, SUBHEAP, entry )
2118 {
2119 if ((ptr >= (char *)sub->base) &&
2120 (ptr < (char *)sub->base + sub->size))
2121 {
2122 currentheap = sub;
2123 break;
2124 }
2125 region_index++;
2126 }
2127 if (currentheap == NULL)
2128 {
2129 ERR("no matching subheap found, shouldn't happen !\n");
2130 ret = STATUS_NO_MORE_ENTRIES;
2131 goto HW_end;
2132 }
2133
2134 if (((ARENA_INUSE *)ptr - 1)->magic == ARENA_INUSE_MAGIC ||
2135 ((ARENA_INUSE *)ptr - 1)->magic == ARENA_PENDING_MAGIC)
2136 {
2137 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr - 1;
2138 ptr += pArena->size & ARENA_SIZE_MASK;
2139 }
2140 else if (((ARENA_FREE *)ptr - 1)->magic == ARENA_FREE_MAGIC)
2141 {
2142 ARENA_FREE *pArena = (ARENA_FREE *)ptr - 1;
2143 ptr += pArena->size & ARENA_SIZE_MASK;
2144 }
2145 else
2146 ptr += entry->cbData; /* point to next arena */
2147
2148 if (ptr > (char *)currentheap->base + currentheap->size - 1)
2149 { /* proceed with next subheap */
2150 struct list *next = list_next( &heapPtr->subheap_list, &currentheap->entry );
2151 if (!next)
2152 { /* successfully finished */
2153 TRACE("end reached.\n");
2154 ret = STATUS_NO_MORE_ENTRIES;
2155 goto HW_end;
2156 }
2157 currentheap = LIST_ENTRY( next, SUBHEAP, entry );
2158 ptr = (char *)currentheap->base + currentheap->headerSize;
2159 }
2160 }
2161
2162 entry->wFlags = 0;
2163 if (*(DWORD *)ptr & ARENA_FLAG_FREE)
2164 {
2165 ARENA_FREE *pArena = (ARENA_FREE *)ptr;
2166
2167 /*TRACE("free, magic: %04x\n", pArena->magic);*/
2168
2169 entry->lpData = pArena + 1;
2170 entry->cbData = pArena->size & ARENA_SIZE_MASK;
2171 entry->cbOverhead = sizeof(ARENA_FREE);
2172 entry->wFlags = PROCESS_HEAP_UNCOMMITTED_RANGE;
2173 }
2174 else
2175 {
2176 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
2177
2178 /*TRACE("busy, magic: %04x\n", pArena->magic);*/
2179
2180 entry->lpData = pArena + 1;
2181 entry->cbData = pArena->size & ARENA_SIZE_MASK;
2182 entry->cbOverhead = sizeof(ARENA_INUSE);
2183 entry->wFlags = (pArena->magic == ARENA_PENDING_MAGIC) ?
2184 PROCESS_HEAP_UNCOMMITTED_RANGE : PROCESS_HEAP_ENTRY_BUSY;
2185 /* FIXME: can't handle PROCESS_HEAP_ENTRY_MOVEABLE
2186 and PROCESS_HEAP_ENTRY_DDESHARE yet */
2187 }
2188
2189 entry->iRegionIndex = region_index;
2190
2191 /* first element of heap ? */
2192 if (ptr == (char *)currentheap->base + currentheap->headerSize)
2193 {
2194 entry->wFlags |= PROCESS_HEAP_REGION;
2195 entry->u.Region.dwCommittedSize = currentheap->commitSize;
2196 entry->u.Region.dwUnCommittedSize =
2197 currentheap->size - currentheap->commitSize;
2198 entry->u.Region.lpFirstBlock = /* first valid block */
2199 (char *)currentheap->base + currentheap->headerSize;
2200 entry->u.Region.lpLastBlock = /* first invalid block */
2201 (char *)currentheap->base + currentheap->size;
2202 }
2203 ret = STATUS_SUCCESS;
2204 if (TRACE_ON(heap)) HEAP_DumpEntry(entry);
2205
2206 HW_end:
2207 if (!(heapPtr->flags & HEAP_NO_SERIALIZE)) RtlLeaveCriticalSection( &heapPtr->critSection );
2208 return ret;
2209 }
2210
2211
2212 /***********************************************************************
2213 * RtlGetProcessHeaps (NTDLL.@)
2214 *
2215 * Get the Heaps belonging to the current process.
2216 *
2217 * PARAMS
2218 * count [I] size of heaps
2219 * heaps [O] Destination array for heap HANDLE's
2220 *
2221 * RETURNS
2222 * Success: The number of Heaps allocated by the process.
2223 * Failure: 0.
2224 */
2225 ULONG WINAPI RtlGetProcessHeaps( ULONG count, HANDLE *heaps )
2226 {
2227 ULONG total = 1; /* main heap */
2228 struct list *ptr;
2229
2230 RtlEnterCriticalSection( &processHeap->critSection );
2231 LIST_FOR_EACH( ptr, &processHeap->entry ) total++;
2232 if (total <= count)
2233 {
2234 *heaps++ = processHeap;
2235 LIST_FOR_EACH( ptr, &processHeap->entry )
2236 *heaps++ = LIST_ENTRY( ptr, HEAP, entry );
2237 }
2238 RtlLeaveCriticalSection( &processHeap->critSection );
2239 return total;
2240 }
2241
2242 /***********************************************************************
2243 * RtlQueryHeapInformation (NTDLL.@)
2244 */
2245 NTSTATUS WINAPI RtlQueryHeapInformation( HANDLE heap, HEAP_INFORMATION_CLASS info_class,
2246 PVOID info, SIZE_T size_in, PSIZE_T size_out)
2247 {
2248 switch (info_class)
2249 {
2250 case HeapCompatibilityInformation:
2251 if (size_out) *size_out = sizeof(ULONG);
2252
2253 if (size_in < sizeof(ULONG))
2254 return STATUS_BUFFER_TOO_SMALL;
2255
2256 *(ULONG *)info = 0; /* standard heap */
2257 return STATUS_SUCCESS;
2258
2259 default:
2260 FIXME("Unknown heap information class %u\n", info_class);
2261 return STATUS_INVALID_INFO_CLASS;
2262 }
2263 }
2264
2265 /***********************************************************************
2266 * RtlSetHeapInformation (NTDLL.@)
2267 */
2268 NTSTATUS WINAPI RtlSetHeapInformation( HANDLE heap, HEAP_INFORMATION_CLASS info_class, PVOID info, SIZE_T size)
2269 {
2270 FIXME("%p %d %p %ld stub\n", heap, info_class, info, size);
2271 return STATUS_SUCCESS;
2272 }
Windows API implementation