4 * Copyright 1996 Alexandre Julliard
5 * Copyright 1998 Ulrich Weigand
12 #include "wine/winbase16.h"
13 #include "wine/winestring.h"
14 #include "wine/unicode.h"
15 #include "selectors.h"
22 #include "debugtools.h"
25 DEFAULT_DEBUG_CHANNEL(heap
);
27 /* Note: the heap data structures are based on what Pietrek describes in his
28 * book 'Windows 95 System Programming Secrets'. The layout is not exactly
29 * the same, but could be easily adapted if it turns out some programs
33 typedef struct tagARENA_INUSE
35 DWORD size
; /* Block size; must be the first field */
36 WORD magic
; /* Magic number */
37 WORD threadId
; /* Allocating thread id */
38 void *callerEIP
; /* EIP of caller upon allocation */
41 typedef struct tagARENA_FREE
43 DWORD size
; /* Block size; must be the first field */
44 WORD magic
; /* Magic number */
45 WORD threadId
; /* Freeing thread id */
46 struct tagARENA_FREE
*next
; /* Next free arena */
47 struct tagARENA_FREE
*prev
; /* Prev free arena */
50 #define ARENA_FLAG_FREE 0x00000001 /* flags OR'ed with arena size */
51 #define ARENA_FLAG_PREV_FREE 0x00000002
52 #define ARENA_SIZE_MASK 0xfffffffc
53 #define ARENA_INUSE_MAGIC 0x4842 /* Value for arena 'magic' field */
54 #define ARENA_FREE_MAGIC 0x4846 /* Value for arena 'magic' field */
56 #define ARENA_INUSE_FILLER 0x55
57 #define ARENA_FREE_FILLER 0xaa
59 #define QUIET 1 /* Suppress messages */
60 #define NOISY 0 /* Report all errors */
62 #define HEAP_NB_FREE_LISTS 4 /* Number of free lists */
64 /* Max size of the blocks on the free lists */
65 static const DWORD HEAP_freeListSizes
[HEAP_NB_FREE_LISTS
] =
67 0x20, 0x80, 0x200, 0xffffffff
78 typedef struct tagSUBHEAP
80 DWORD size
; /* Size of the whole sub-heap */
81 DWORD commitSize
; /* Committed size of the sub-heap */
82 DWORD headerSize
; /* Size of the heap header */
83 struct tagSUBHEAP
*next
; /* Next sub-heap */
84 struct tagHEAP
*heap
; /* Main heap structure */
85 DWORD magic
; /* Magic number */
86 WORD selector
; /* Selector for HEAP_WINE_SEGPTR heaps */
89 #define SUBHEAP_MAGIC ((DWORD)('S' | ('U'<<8) | ('B'<<16) | ('H'<<24)))
91 typedef struct tagHEAP
93 SUBHEAP subheap
; /* First sub-heap */
94 struct tagHEAP
*next
; /* Next heap for this process */
95 FREE_LIST_ENTRY freeList
[HEAP_NB_FREE_LISTS
]; /* Free lists */
96 CRITICAL_SECTION critSection
; /* Critical section for serialization */
97 DWORD flags
; /* Heap flags */
98 DWORD magic
; /* Magic number */
99 void *private; /* Private pointer for the user of the heap */
102 #define HEAP_MAGIC ((DWORD)('H' | ('E'<<8) | ('A'<<16) | ('P'<<24)))
104 #define HEAP_DEF_SIZE 0x110000 /* Default heap size = 1Mb + 64Kb */
105 #define HEAP_MIN_BLOCK_SIZE (8+sizeof(ARENA_FREE)) /* Min. heap block size */
106 #define COMMIT_MASK 0xffff /* bitmask for commit/decommit granularity */
108 HANDLE SystemHeap
= 0;
109 HANDLE SegptrHeap
= 0;
111 SYSTEM_HEAP_DESCR
*SystemHeapDescr
= 0;
113 static HEAP
*processHeap
; /* main process heap */
114 static HEAP
*firstHeap
; /* head of secondary heaps list */
116 /* address where we try to map the system heap */
117 #define SYSTEM_HEAP_BASE ((void*)0x65430000)
119 static BOOL
HEAP_IsRealArena( HANDLE heap
, DWORD flags
, LPCVOID block
, BOOL quiet
);
122 #define GET_EIP() (__builtin_return_address(0))
123 #define SET_EIP(ptr) ((ARENA_INUSE*)(ptr) - 1)->callerEIP = GET_EIP()
126 #define SET_EIP(ptr) /* nothing */
127 #endif /* __GNUC__ */
129 /***********************************************************************
132 void HEAP_Dump( HEAP
*heap
)
138 DPRINTF( "Heap: %08lx\n", (DWORD
)heap
);
139 DPRINTF( "Next: %08lx Sub-heaps: %08lx",
140 (DWORD
)heap
->next
, (DWORD
)&heap
->subheap
);
141 subheap
= &heap
->subheap
;
142 while (subheap
->next
)
144 DPRINTF( " -> %08lx", (DWORD
)subheap
->next
);
145 subheap
= subheap
->next
;
148 DPRINTF( "\nFree lists:\n Block Stat Size Id\n" );
149 for (i
= 0; i
< HEAP_NB_FREE_LISTS
; i
++)
150 DPRINTF( "%08lx free %08lx %04x prev=%08lx next=%08lx\n",
151 (DWORD
)&heap
->freeList
[i
].arena
, heap
->freeList
[i
].arena
.size
,
152 heap
->freeList
[i
].arena
.threadId
,
153 (DWORD
)heap
->freeList
[i
].arena
.prev
,
154 (DWORD
)heap
->freeList
[i
].arena
.next
);
156 subheap
= &heap
->subheap
;
159 DWORD freeSize
= 0, usedSize
= 0, arenaSize
= subheap
->headerSize
;
160 DPRINTF( "\n\nSub-heap %08lx: size=%08lx committed=%08lx\n",
161 (DWORD
)subheap
, subheap
->size
, subheap
->commitSize
);
163 DPRINTF( "\n Block Stat Size Id\n" );
164 ptr
= (char*)subheap
+ subheap
->headerSize
;
165 while (ptr
< (char *)subheap
+ subheap
->size
)
167 if (*(DWORD
*)ptr
& ARENA_FLAG_FREE
)
169 ARENA_FREE
*pArena
= (ARENA_FREE
*)ptr
;
170 DPRINTF( "%08lx free %08lx %04x prev=%08lx next=%08lx\n",
171 (DWORD
)pArena
, pArena
->size
& ARENA_SIZE_MASK
,
172 pArena
->threadId
, (DWORD
)pArena
->prev
,
173 (DWORD
)pArena
->next
);
174 ptr
+= sizeof(*pArena
) + (pArena
->size
& ARENA_SIZE_MASK
);
175 arenaSize
+= sizeof(ARENA_FREE
);
176 freeSize
+= pArena
->size
& ARENA_SIZE_MASK
;
178 else if (*(DWORD
*)ptr
& ARENA_FLAG_PREV_FREE
)
180 ARENA_INUSE
*pArena
= (ARENA_INUSE
*)ptr
;
181 DPRINTF( "%08lx Used %08lx %04x back=%08lx EIP=%p\n",
182 (DWORD
)pArena
, pArena
->size
& ARENA_SIZE_MASK
,
183 pArena
->threadId
, *((DWORD
*)pArena
- 1),
185 ptr
+= sizeof(*pArena
) + (pArena
->size
& ARENA_SIZE_MASK
);
186 arenaSize
+= sizeof(ARENA_INUSE
);
187 usedSize
+= pArena
->size
& ARENA_SIZE_MASK
;
191 ARENA_INUSE
*pArena
= (ARENA_INUSE
*)ptr
;
192 DPRINTF( "%08lx used %08lx %04x EIP=%p\n",
193 (DWORD
)pArena
, pArena
->size
& ARENA_SIZE_MASK
,
194 pArena
->threadId
, pArena
->callerEIP
);
195 ptr
+= sizeof(*pArena
) + (pArena
->size
& ARENA_SIZE_MASK
);
196 arenaSize
+= sizeof(ARENA_INUSE
);
197 usedSize
+= pArena
->size
& ARENA_SIZE_MASK
;
200 DPRINTF( "\nTotal: Size=%08lx Committed=%08lx Free=%08lx Used=%08lx Arenas=%08lx (%ld%%)\n\n",
201 subheap
->size
, subheap
->commitSize
, freeSize
, usedSize
,
202 arenaSize
, (arenaSize
* 100) / subheap
->size
);
203 subheap
= subheap
->next
;
208 /***********************************************************************
211 * Pointer to the heap
214 static HEAP
*HEAP_GetPtr(
215 HANDLE heap
/* [in] Handle to the heap */
217 HEAP
*heapPtr
= (HEAP
*)heap
;
218 if (!heapPtr
|| (heapPtr
->magic
!= HEAP_MAGIC
))
220 ERR("Invalid heap %08x!\n", heap
);
221 SetLastError( ERROR_INVALID_HANDLE
);
224 if (TRACE_ON(heap
) && !HEAP_IsRealArena( heap
, 0, NULL
, NOISY
))
226 HEAP_Dump( heapPtr
);
228 SetLastError( ERROR_INVALID_HANDLE
);
235 /***********************************************************************
236 * HEAP_InsertFreeBlock
238 * Insert a free block into the free list.
240 static void HEAP_InsertFreeBlock( HEAP
*heap
, ARENA_FREE
*pArena
)
242 FREE_LIST_ENTRY
*pEntry
= heap
->freeList
;
243 while (pEntry
->size
< pArena
->size
) pEntry
++;
244 pArena
->size
|= ARENA_FLAG_FREE
;
245 pArena
->next
= pEntry
->arena
.next
;
246 pArena
->next
->prev
= pArena
;
247 pArena
->prev
= &pEntry
->arena
;
248 pEntry
->arena
.next
= pArena
;
252 /***********************************************************************
254 * Find the sub-heap containing a given address.
260 static SUBHEAP
*HEAP_FindSubHeap(
261 HEAP
*heap
, /* [in] Heap pointer */
262 LPCVOID ptr
/* [in] Address */
264 SUBHEAP
*sub
= &heap
->subheap
;
267 if (((char *)ptr
>= (char *)sub
) &&
268 ((char *)ptr
< (char *)sub
+ sub
->size
)) return sub
;
275 /***********************************************************************
278 * Make sure the heap storage is committed up to (not including) ptr.
280 static inline BOOL
HEAP_Commit( SUBHEAP
*subheap
, void *ptr
)
282 DWORD size
= (DWORD
)((char *)ptr
- (char *)subheap
);
283 size
= (size
+ COMMIT_MASK
) & ~COMMIT_MASK
;
284 if (size
> subheap
->size
) size
= subheap
->size
;
285 if (size
<= subheap
->commitSize
) return TRUE
;
286 if (!VirtualAlloc( (char *)subheap
+ subheap
->commitSize
,
287 size
- subheap
->commitSize
, MEM_COMMIT
,
288 PAGE_EXECUTE_READWRITE
))
290 WARN("Could not commit %08lx bytes at %08lx for heap %08lx\n",
291 size
- subheap
->commitSize
,
292 (DWORD
)((char *)subheap
+ subheap
->commitSize
),
293 (DWORD
)subheap
->heap
);
296 subheap
->commitSize
= size
;
301 /***********************************************************************
304 * If possible, decommit the heap storage from (including) 'ptr'.
306 static inline BOOL
HEAP_Decommit( SUBHEAP
*subheap
, void *ptr
)
308 DWORD size
= (DWORD
)((char *)ptr
- (char *)subheap
);
309 /* round to next block and add one full block */
310 size
= ((size
+ COMMIT_MASK
) & ~COMMIT_MASK
) + COMMIT_MASK
+ 1;
311 if (size
>= subheap
->commitSize
) return TRUE
;
312 if (!VirtualFree( (char *)subheap
+ size
,
313 subheap
->commitSize
- size
, MEM_DECOMMIT
))
315 WARN("Could not decommit %08lx bytes at %08lx for heap %08lx\n",
316 subheap
->commitSize
- size
,
317 (DWORD
)((char *)subheap
+ size
),
318 (DWORD
)subheap
->heap
);
321 subheap
->commitSize
= size
;
326 /***********************************************************************
327 * HEAP_CreateFreeBlock
329 * Create a free block at a specified address. 'size' is the size of the
330 * whole block, including the new arena.
332 static void HEAP_CreateFreeBlock( SUBHEAP
*subheap
, void *ptr
, DWORD size
)
336 /* Create a free arena */
338 pFree
= (ARENA_FREE
*)ptr
;
339 pFree
->threadId
= GetCurrentTask();
340 pFree
->magic
= ARENA_FREE_MAGIC
;
342 /* If debugging, erase the freed block content */
346 char *pEnd
= (char *)ptr
+ size
;
347 if (pEnd
> (char *)subheap
+ subheap
->commitSize
)
348 pEnd
= (char *)subheap
+ subheap
->commitSize
;
349 if (pEnd
> (char *)(pFree
+ 1))
350 memset( pFree
+ 1, ARENA_FREE_FILLER
, pEnd
- (char *)(pFree
+ 1) );
353 /* Check if next block is free also */
355 if (((char *)ptr
+ size
< (char *)subheap
+ subheap
->size
) &&
356 (*(DWORD
*)((char *)ptr
+ size
) & ARENA_FLAG_FREE
))
358 /* Remove the next arena from the free list */
359 ARENA_FREE
*pNext
= (ARENA_FREE
*)((char *)ptr
+ size
);
360 pNext
->next
->prev
= pNext
->prev
;
361 pNext
->prev
->next
= pNext
->next
;
362 size
+= (pNext
->size
& ARENA_SIZE_MASK
) + sizeof(*pNext
);
364 memset( pNext
, ARENA_FREE_FILLER
, sizeof(ARENA_FREE
) );
367 /* Set the next block PREV_FREE flag and pointer */
369 if ((char *)ptr
+ size
< (char *)subheap
+ subheap
->size
)
371 DWORD
*pNext
= (DWORD
*)((char *)ptr
+ size
);
372 *pNext
|= ARENA_FLAG_PREV_FREE
;
373 *(ARENA_FREE
**)(pNext
- 1) = pFree
;
376 /* Last, insert the new block into the free list */
378 pFree
->size
= size
- sizeof(*pFree
);
379 HEAP_InsertFreeBlock( subheap
->heap
, pFree
);
383 /***********************************************************************
384 * HEAP_MakeInUseBlockFree
386 * Turn an in-use block into a free block. Can also decommit the end of
387 * the heap, and possibly even free the sub-heap altogether.
389 static void HEAP_MakeInUseBlockFree( SUBHEAP
*subheap
, ARENA_INUSE
*pArena
)
392 DWORD size
= (pArena
->size
& ARENA_SIZE_MASK
) + sizeof(*pArena
);
394 /* Check if we can merge with previous block */
396 if (pArena
->size
& ARENA_FLAG_PREV_FREE
)
398 pFree
= *((ARENA_FREE
**)pArena
- 1);
399 size
+= (pFree
->size
& ARENA_SIZE_MASK
) + sizeof(ARENA_FREE
);
400 /* Remove it from the free list */
401 pFree
->next
->prev
= pFree
->prev
;
402 pFree
->prev
->next
= pFree
->next
;
404 else pFree
= (ARENA_FREE
*)pArena
;
406 /* Create a free block */
408 HEAP_CreateFreeBlock( subheap
, pFree
, size
);
409 size
= (pFree
->size
& ARENA_SIZE_MASK
) + sizeof(ARENA_FREE
);
410 if ((char *)pFree
+ size
< (char *)subheap
+ subheap
->size
)
411 return; /* Not the last block, so nothing more to do */
413 /* Free the whole sub-heap if it's empty and not the original one */
415 if (((char *)pFree
== (char *)subheap
+ subheap
->headerSize
) &&
416 (subheap
!= &subheap
->heap
->subheap
))
418 SUBHEAP
*pPrev
= &subheap
->heap
->subheap
;
419 /* Remove the free block from the list */
420 pFree
->next
->prev
= pFree
->prev
;
421 pFree
->prev
->next
= pFree
->next
;
422 /* Remove the subheap from the list */
423 while (pPrev
&& (pPrev
->next
!= subheap
)) pPrev
= pPrev
->next
;
424 if (pPrev
) pPrev
->next
= subheap
->next
;
425 /* Free the memory */
427 if (subheap
->selector
) FreeSelector16( subheap
->selector
);
428 VirtualFree( subheap
, 0, MEM_RELEASE
);
432 /* Decommit the end of the heap */
434 if (!(subheap
->heap
->flags
& HEAP_SHARED
)) HEAP_Decommit( subheap
, pFree
+ 1 );
438 /***********************************************************************
441 * Shrink an in-use block.
443 static void HEAP_ShrinkBlock(SUBHEAP
*subheap
, ARENA_INUSE
*pArena
, DWORD size
)
445 if ((pArena
->size
& ARENA_SIZE_MASK
) >= size
+ HEAP_MIN_BLOCK_SIZE
)
447 HEAP_CreateFreeBlock( subheap
, (char *)(pArena
+ 1) + size
,
448 (pArena
->size
& ARENA_SIZE_MASK
) - size
);
449 /* assign size plus previous arena flags */
450 pArena
->size
= size
| (pArena
->size
& ~ARENA_SIZE_MASK
);
454 /* Turn off PREV_FREE flag in next block */
455 char *pNext
= (char *)(pArena
+ 1) + (pArena
->size
& ARENA_SIZE_MASK
);
456 if (pNext
< (char *)subheap
+ subheap
->size
)
457 *(DWORD
*)pNext
&= ~ARENA_FLAG_PREV_FREE
;
461 /***********************************************************************
464 static BOOL
HEAP_InitSubHeap( HEAP
*heap
, LPVOID address
, DWORD flags
,
465 DWORD commitSize
, DWORD totalSize
)
467 SUBHEAP
*subheap
= (SUBHEAP
*)address
;
469 FREE_LIST_ENTRY
*pEntry
;
474 if (flags
& HEAP_SHARED
)
475 commitSize
= totalSize
; /* always commit everything in a shared heap */
476 if (!VirtualAlloc(address
, commitSize
, MEM_COMMIT
, PAGE_EXECUTE_READWRITE
))
478 WARN("Could not commit %08lx bytes for sub-heap %08lx\n",
479 commitSize
, (DWORD
)address
);
483 /* Allocate a selector if needed */
485 if (flags
& HEAP_WINE_SEGPTR
)
487 selector
= SELECTOR_AllocBlock( address
, totalSize
,
488 (flags
& (HEAP_WINE_CODESEG
|HEAP_WINE_CODE16SEG
))
489 ? SEGMENT_CODE
: SEGMENT_DATA
,
490 (flags
& HEAP_WINE_CODESEG
) != 0, FALSE
);
493 ERR("Could not allocate selector\n" );
498 /* Fill the sub-heap structure */
500 subheap
->heap
= heap
;
501 subheap
->selector
= selector
;
502 subheap
->size
= totalSize
;
503 subheap
->commitSize
= commitSize
;
504 subheap
->magic
= SUBHEAP_MAGIC
;
506 if ( subheap
!= (SUBHEAP
*)heap
)
508 /* If this is a secondary subheap, insert it into list */
510 subheap
->headerSize
= sizeof(SUBHEAP
);
511 subheap
->next
= heap
->subheap
.next
;
512 heap
->subheap
.next
= subheap
;
516 /* If this is a primary subheap, initialize main heap */
518 subheap
->headerSize
= sizeof(HEAP
);
519 subheap
->next
= NULL
;
522 heap
->magic
= HEAP_MAGIC
;
524 /* Build the free lists */
526 for (i
= 0, pEntry
= heap
->freeList
; i
< HEAP_NB_FREE_LISTS
; i
++, pEntry
++)
528 pEntry
->size
= HEAP_freeListSizes
[i
];
529 pEntry
->arena
.size
= 0 | ARENA_FLAG_FREE
;
530 pEntry
->arena
.next
= i
< HEAP_NB_FREE_LISTS
-1 ?
531 &heap
->freeList
[i
+1].arena
: &heap
->freeList
[0].arena
;
532 pEntry
->arena
.prev
= i
? &heap
->freeList
[i
-1].arena
:
533 &heap
->freeList
[HEAP_NB_FREE_LISTS
-1].arena
;
534 pEntry
->arena
.threadId
= 0;
535 pEntry
->arena
.magic
= ARENA_FREE_MAGIC
;
538 /* Initialize critical section */
540 InitializeCriticalSection( &heap
->critSection
);
541 if (!SystemHeap
) MakeCriticalSectionGlobal( &heap
->critSection
);
544 /* Create the first free block */
546 HEAP_CreateFreeBlock( subheap
, (LPBYTE
)subheap
+ subheap
->headerSize
,
547 subheap
->size
- subheap
->headerSize
);
552 /***********************************************************************
555 * Create a sub-heap of the given size.
556 * If heap == NULL, creates a main heap.
558 static SUBHEAP
*HEAP_CreateSubHeap( HEAP
*heap
, DWORD flags
,
559 DWORD commitSize
, DWORD totalSize
)
563 /* Round-up sizes on a 64K boundary */
565 if (flags
& HEAP_WINE_SEGPTR
)
567 totalSize
= commitSize
= 0x10000; /* Only 64K at a time for SEGPTRs */
571 totalSize
= (totalSize
+ 0xffff) & 0xffff0000;
572 commitSize
= (commitSize
+ 0xffff) & 0xffff0000;
573 if (!commitSize
) commitSize
= 0x10000;
574 if (totalSize
< commitSize
) totalSize
= commitSize
;
577 /* Allocate the memory block */
579 if (!(address
= VirtualAlloc( NULL
, totalSize
,
580 MEM_RESERVE
, PAGE_EXECUTE_READWRITE
)))
582 WARN("Could not VirtualAlloc %08lx bytes\n",
587 /* Initialize subheap */
589 if (!HEAP_InitSubHeap( heap
? heap
: (HEAP
*)address
,
590 address
, flags
, commitSize
, totalSize
))
592 VirtualFree( address
, 0, MEM_RELEASE
);
596 return (SUBHEAP
*)address
;
600 /***********************************************************************
603 * Find a free block at least as large as the requested size, and make sure
604 * the requested size is committed.
606 static ARENA_FREE
*HEAP_FindFreeBlock( HEAP
*heap
, DWORD size
,
607 SUBHEAP
**ppSubHeap
)
611 FREE_LIST_ENTRY
*pEntry
= heap
->freeList
;
613 /* Find a suitable free list, and in it find a block large enough */
615 while (pEntry
->size
< size
) pEntry
++;
616 pArena
= pEntry
->arena
.next
;
617 while (pArena
!= &heap
->freeList
[0].arena
)
619 if (pArena
->size
> size
)
621 subheap
= HEAP_FindSubHeap( heap
, pArena
);
622 if (!HEAP_Commit( subheap
, (char *)pArena
+ sizeof(ARENA_INUSE
)
623 + size
+ HEAP_MIN_BLOCK_SIZE
))
625 *ppSubHeap
= subheap
;
629 pArena
= pArena
->next
;
632 /* If no block was found, attempt to grow the heap */
634 if (!(heap
->flags
& HEAP_GROWABLE
))
636 WARN("Not enough space in heap %08lx for %08lx bytes\n",
640 /* make sure that we have a big enough size *committed* to fit another
641 * last free arena in !
642 * So just one heap struct, one first free arena which will eventually
643 * get inuse, and HEAP_MIN_BLOCK_SIZE for the second free arena that
644 * might get assigned all remaining free space in HEAP_ShrinkBlock() */
645 size
+= sizeof(SUBHEAP
) + sizeof(ARENA_INUSE
) + HEAP_MIN_BLOCK_SIZE
;
646 if (!(subheap
= HEAP_CreateSubHeap( heap
, heap
->flags
, size
,
647 max( HEAP_DEF_SIZE
, size
) )))
650 TRACE("created new sub-heap %08lx of %08lx bytes for heap %08lx\n",
651 (DWORD
)subheap
, size
, (DWORD
)heap
);
653 *ppSubHeap
= subheap
;
654 return (ARENA_FREE
*)(subheap
+ 1);
658 /***********************************************************************
659 * HEAP_IsValidArenaPtr
661 * Check that the pointer is inside the range possible for arenas.
663 static BOOL
HEAP_IsValidArenaPtr( HEAP
*heap
, void *ptr
)
666 SUBHEAP
*subheap
= HEAP_FindSubHeap( heap
, ptr
);
667 if (!subheap
) return FALSE
;
668 if ((char *)ptr
>= (char *)subheap
+ subheap
->headerSize
) return TRUE
;
669 if (subheap
!= &heap
->subheap
) return FALSE
;
670 for (i
= 0; i
< HEAP_NB_FREE_LISTS
; i
++)
671 if (ptr
== (void *)&heap
->freeList
[i
].arena
) return TRUE
;
676 /***********************************************************************
677 * HEAP_ValidateFreeArena
679 static BOOL
HEAP_ValidateFreeArena( SUBHEAP
*subheap
, ARENA_FREE
*pArena
)
681 char *heapEnd
= (char *)subheap
+ subheap
->size
;
683 /* Check magic number */
684 if (pArena
->magic
!= ARENA_FREE_MAGIC
)
686 ERR("Heap %08lx: invalid free arena magic for %08lx\n",
687 (DWORD
)subheap
->heap
, (DWORD
)pArena
);
690 /* Check size flags */
691 if (!(pArena
->size
& ARENA_FLAG_FREE
) ||
692 (pArena
->size
& ARENA_FLAG_PREV_FREE
))
694 ERR("Heap %08lx: bad flags %lx for free arena %08lx\n",
695 (DWORD
)subheap
->heap
, pArena
->size
& ~ARENA_SIZE_MASK
, (DWORD
)pArena
);
697 /* Check arena size */
698 if ((char *)(pArena
+ 1) + (pArena
->size
& ARENA_SIZE_MASK
) > heapEnd
)
700 ERR("Heap %08lx: bad size %08lx for free arena %08lx\n",
701 (DWORD
)subheap
->heap
, (DWORD
)pArena
->size
& ARENA_SIZE_MASK
, (DWORD
)pArena
);
704 /* Check that next pointer is valid */
705 if (!HEAP_IsValidArenaPtr( subheap
->heap
, pArena
->next
))
707 ERR("Heap %08lx: bad next ptr %08lx for arena %08lx\n",
708 (DWORD
)subheap
->heap
, (DWORD
)pArena
->next
, (DWORD
)pArena
);
711 /* Check that next arena is free */
712 if (!(pArena
->next
->size
& ARENA_FLAG_FREE
) ||
713 (pArena
->next
->magic
!= ARENA_FREE_MAGIC
))
715 ERR("Heap %08lx: next arena %08lx invalid for %08lx\n",
716 (DWORD
)subheap
->heap
, (DWORD
)pArena
->next
, (DWORD
)pArena
);
719 /* Check that prev pointer is valid */
720 if (!HEAP_IsValidArenaPtr( subheap
->heap
, pArena
->prev
))
722 ERR("Heap %08lx: bad prev ptr %08lx for arena %08lx\n",
723 (DWORD
)subheap
->heap
, (DWORD
)pArena
->prev
, (DWORD
)pArena
);
726 /* Check that prev arena is free */
727 if (!(pArena
->prev
->size
& ARENA_FLAG_FREE
) ||
728 (pArena
->prev
->magic
!= ARENA_FREE_MAGIC
))
730 /* this often means that the prev arena got overwritten
731 * by a memory write before that prev arena */
732 ERR("Heap %08lx: prev arena %08lx invalid for %08lx\n",
733 (DWORD
)subheap
->heap
, (DWORD
)pArena
->prev
, (DWORD
)pArena
);
736 /* Check that next block has PREV_FREE flag */
737 if ((char *)(pArena
+ 1) + (pArena
->size
& ARENA_SIZE_MASK
) < heapEnd
)
739 if (!(*(DWORD
*)((char *)(pArena
+ 1) +
740 (pArena
->size
& ARENA_SIZE_MASK
)) & ARENA_FLAG_PREV_FREE
))
742 ERR("Heap %08lx: free arena %08lx next block has no PREV_FREE flag\n",
743 (DWORD
)subheap
->heap
, (DWORD
)pArena
);
746 /* Check next block back pointer */
747 if (*((ARENA_FREE
**)((char *)(pArena
+ 1) +
748 (pArena
->size
& ARENA_SIZE_MASK
)) - 1) != pArena
)
750 ERR("Heap %08lx: arena %08lx has wrong back ptr %08lx\n",
751 (DWORD
)subheap
->heap
, (DWORD
)pArena
,
752 *((DWORD
*)((char *)(pArena
+1)+ (pArena
->size
& ARENA_SIZE_MASK
)) - 1));
760 /***********************************************************************
761 * HEAP_ValidateInUseArena
763 static BOOL
HEAP_ValidateInUseArena( SUBHEAP
*subheap
, ARENA_INUSE
*pArena
, BOOL quiet
)
765 char *heapEnd
= (char *)subheap
+ subheap
->size
;
767 /* Check magic number */
768 if (pArena
->magic
!= ARENA_INUSE_MAGIC
)
770 if (quiet
== NOISY
) {
771 ERR("Heap %08lx: invalid in-use arena magic for %08lx\n",
772 (DWORD
)subheap
->heap
, (DWORD
)pArena
);
774 HEAP_Dump( subheap
->heap
);
775 } else if (WARN_ON(heap
)) {
776 WARN("Heap %08lx: invalid in-use arena magic for %08lx\n",
777 (DWORD
)subheap
->heap
, (DWORD
)pArena
);
779 HEAP_Dump( subheap
->heap
);
783 /* Check size flags */
784 if (pArena
->size
& ARENA_FLAG_FREE
)
786 ERR("Heap %08lx: bad flags %lx for in-use arena %08lx\n",
787 (DWORD
)subheap
->heap
, pArena
->size
& ~ARENA_SIZE_MASK
, (DWORD
)pArena
);
789 /* Check arena size */
790 if ((char *)(pArena
+ 1) + (pArena
->size
& ARENA_SIZE_MASK
) > heapEnd
)
792 ERR("Heap %08lx: bad size %08lx for in-use arena %08lx\n",
793 (DWORD
)subheap
->heap
, (DWORD
)pArena
->size
& ARENA_SIZE_MASK
, (DWORD
)pArena
);
796 /* Check next arena PREV_FREE flag */
797 if (((char *)(pArena
+ 1) + (pArena
->size
& ARENA_SIZE_MASK
) < heapEnd
) &&
798 (*(DWORD
*)((char *)(pArena
+ 1) + (pArena
->size
& ARENA_SIZE_MASK
)) & ARENA_FLAG_PREV_FREE
))
800 ERR("Heap %08lx: in-use arena %08lx next block has PREV_FREE flag\n",
801 (DWORD
)subheap
->heap
, (DWORD
)pArena
);
804 /* Check prev free arena */
805 if (pArena
->size
& ARENA_FLAG_PREV_FREE
)
807 ARENA_FREE
*pPrev
= *((ARENA_FREE
**)pArena
- 1);
808 /* Check prev pointer */
809 if (!HEAP_IsValidArenaPtr( subheap
->heap
, pPrev
))
811 ERR("Heap %08lx: bad back ptr %08lx for arena %08lx\n",
812 (DWORD
)subheap
->heap
, (DWORD
)pPrev
, (DWORD
)pArena
);
815 /* Check that prev arena is free */
816 if (!(pPrev
->size
& ARENA_FLAG_FREE
) ||
817 (pPrev
->magic
!= ARENA_FREE_MAGIC
))
819 ERR("Heap %08lx: prev arena %08lx invalid for in-use %08lx\n",
820 (DWORD
)subheap
->heap
, (DWORD
)pPrev
, (DWORD
)pArena
);
823 /* Check that prev arena is really the previous block */
824 if ((char *)(pPrev
+ 1) + (pPrev
->size
& ARENA_SIZE_MASK
) != (char *)pArena
)
826 ERR("Heap %08lx: prev arena %08lx is not prev for in-use %08lx\n",
827 (DWORD
)subheap
->heap
, (DWORD
)pPrev
, (DWORD
)pArena
);
835 /***********************************************************************
837 * Checks whether the pointer points to a block inside a given heap.
840 * Should this return BOOL32?
846 int HEAP_IsInsideHeap(
847 HANDLE heap
, /* [in] Heap */
848 DWORD flags
, /* [in] Flags */
849 LPCVOID ptr
/* [in] Pointer */
851 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
855 /* Validate the parameters */
857 if (!heapPtr
) return 0;
858 flags
|= heapPtr
->flags
;
859 if (!(flags
& HEAP_NO_SERIALIZE
)) EnterCriticalSection( &heapPtr
->critSection
);
860 ret
= (((subheap
= HEAP_FindSubHeap( heapPtr
, ptr
)) != NULL
) &&
861 (((char *)ptr
>= (char *)subheap
+ subheap
->headerSize
862 + sizeof(ARENA_INUSE
))));
863 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
868 /***********************************************************************
871 * Transform a linear pointer into a SEGPTR. The pointer must have been
872 * allocated from a HEAP_WINE_SEGPTR heap.
874 SEGPTR
HEAP_GetSegptr( HANDLE heap
, DWORD flags
, LPCVOID ptr
)
876 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
880 /* Validate the parameters */
882 if (!heapPtr
) return 0;
883 flags
|= heapPtr
->flags
;
884 if (!(flags
& HEAP_WINE_SEGPTR
))
886 ERR("Heap %08x is not a SEGPTR heap\n",
890 if (!(flags
& HEAP_NO_SERIALIZE
)) EnterCriticalSection( &heapPtr
->critSection
);
892 /* Get the subheap */
894 if (!(subheap
= HEAP_FindSubHeap( heapPtr
, ptr
)))
896 ERR("%p is not inside heap %08x\n",
898 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
902 /* Build the SEGPTR */
904 ret
= PTR_SEG_OFF_TO_SEGPTR(subheap
->selector
, (DWORD
)ptr
-(DWORD
)subheap
);
905 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
909 /***********************************************************************
910 * HEAP_IsRealArena [Internal]
911 * Validates a block is a valid arena.
917 static BOOL
HEAP_IsRealArena(
918 HANDLE heap
, /* [in] Handle to the heap */
919 DWORD flags
, /* [in] Bit flags that control access during operation */
920 LPCVOID block
, /* [in] Optional pointer to memory block to validate */
921 BOOL quiet
/* [in] Flag - if true, HEAP_ValidateInUseArena
922 * does not complain */
925 HEAP
*heapPtr
= (HEAP
*)(heap
);
928 if (!heapPtr
|| (heapPtr
->magic
!= HEAP_MAGIC
))
930 ERR("Invalid heap %08x!\n", heap
);
934 flags
&= HEAP_NO_SERIALIZE
;
935 flags
|= heapPtr
->flags
;
936 /* calling HeapLock may result in infinite recursion, so do the critsect directly */
937 if (!(flags
& HEAP_NO_SERIALIZE
))
938 EnterCriticalSection( &heapPtr
->critSection
);
942 /* Only check this single memory block */
944 /* The following code is really HEAP_IsInsideHeap *
945 * with serialization already done. */
946 if (!(subheap
= HEAP_FindSubHeap( heapPtr
, block
)) ||
947 ((char *)block
< (char *)subheap
+ subheap
->headerSize
948 + sizeof(ARENA_INUSE
)))
951 ERR("Heap %08lx: block %08lx is not inside heap\n",
952 (DWORD
)heap
, (DWORD
)block
);
953 else if (WARN_ON(heap
))
954 WARN("Heap %08lx: block %08lx is not inside heap\n",
955 (DWORD
)heap
, (DWORD
)block
);
958 ret
= HEAP_ValidateInUseArena( subheap
, (ARENA_INUSE
*)block
- 1, quiet
);
960 if (!(flags
& HEAP_NO_SERIALIZE
))
961 LeaveCriticalSection( &heapPtr
->critSection
);
965 subheap
= &heapPtr
->subheap
;
966 while (subheap
&& ret
)
968 char *ptr
= (char *)subheap
+ subheap
->headerSize
;
969 while (ptr
< (char *)subheap
+ subheap
->size
)
971 if (*(DWORD
*)ptr
& ARENA_FLAG_FREE
)
973 if (!HEAP_ValidateFreeArena( subheap
, (ARENA_FREE
*)ptr
)) {
977 ptr
+= sizeof(ARENA_FREE
) + (*(DWORD
*)ptr
& ARENA_SIZE_MASK
);
981 if (!HEAP_ValidateInUseArena( subheap
, (ARENA_INUSE
*)ptr
, NOISY
)) {
985 ptr
+= sizeof(ARENA_INUSE
) + (*(DWORD
*)ptr
& ARENA_SIZE_MASK
);
988 subheap
= subheap
->next
;
991 if (!(flags
& HEAP_NO_SERIALIZE
))
992 LeaveCriticalSection( &heapPtr
->critSection
);
997 /***********************************************************************
998 * HeapCreate (KERNEL32.336)
1000 * Handle of heap: Success
1003 HANDLE WINAPI
HeapCreate(
1004 DWORD flags
, /* [in] Heap allocation flag */
1005 DWORD initialSize
, /* [in] Initial heap size */
1006 DWORD maxSize
/* [in] Maximum heap size */
1010 if ( flags
& HEAP_SHARED
) {
1011 WARN( "Shared Heap requested, returning system heap.\n" );
1015 /* Allocate the heap block */
1019 maxSize
= HEAP_DEF_SIZE
;
1020 flags
|= HEAP_GROWABLE
;
1022 if (!(subheap
= HEAP_CreateSubHeap( NULL
, flags
, initialSize
, maxSize
)))
1024 SetLastError( ERROR_OUTOFMEMORY
);
1028 /* link it into the per-process heap list */
1031 HEAP
*heapPtr
= subheap
->heap
;
1032 EnterCriticalSection( &processHeap
->critSection
);
1033 heapPtr
->next
= firstHeap
;
1034 firstHeap
= heapPtr
;
1035 LeaveCriticalSection( &processHeap
->critSection
);
1037 else /* assume the first heap we create is the process main heap */
1039 processHeap
= subheap
->heap
;
1042 return (HANDLE
)subheap
;
1045 /***********************************************************************
1046 * HeapDestroy (KERNEL32.337)
1051 BOOL WINAPI
HeapDestroy( HANDLE heap
/* [in] Handle of heap */ )
1053 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
1056 if ( heap
== SystemHeap
) {
1057 WARN( "attempt to destroy system heap, returning TRUE!\n" );
1061 TRACE("%08x\n", heap
);
1062 if (!heapPtr
) return FALSE
;
1064 if (heapPtr
== processHeap
) /* cannot delete the main process heap */
1066 SetLastError( ERROR_INVALID_PARAMETER
);
1069 else /* remove it from the per-process list */
1072 EnterCriticalSection( &processHeap
->critSection
);
1074 while (*pptr
&& *pptr
!= heapPtr
) pptr
= &(*pptr
)->next
;
1075 if (*pptr
) *pptr
= (*pptr
)->next
;
1076 LeaveCriticalSection( &processHeap
->critSection
);
1079 DeleteCriticalSection( &heapPtr
->critSection
);
1080 subheap
= &heapPtr
->subheap
;
1083 SUBHEAP
*next
= subheap
->next
;
1084 if (subheap
->selector
) FreeSelector16( subheap
->selector
);
1085 VirtualFree( subheap
, 0, MEM_RELEASE
);
1092 /***********************************************************************
1093 * HeapAlloc (KERNEL32.334)
1095 * Pointer to allocated memory block
1098 LPVOID WINAPI
HeapAlloc(
1099 HANDLE heap
, /* [in] Handle of private heap block */
1100 DWORD flags
, /* [in] Heap allocation control flags */
1101 DWORD size
/* [in] Number of bytes to allocate */
1104 ARENA_INUSE
*pInUse
;
1106 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
1108 /* Validate the parameters */
1110 if (!heapPtr
) return NULL
;
1111 flags
&= HEAP_GENERATE_EXCEPTIONS
| HEAP_NO_SERIALIZE
| HEAP_ZERO_MEMORY
;
1112 flags
|= heapPtr
->flags
;
1113 size
= (size
+ 3) & ~3;
1114 if (size
< HEAP_MIN_BLOCK_SIZE
) size
= HEAP_MIN_BLOCK_SIZE
;
1116 if (!(flags
& HEAP_NO_SERIALIZE
)) EnterCriticalSection( &heapPtr
->critSection
);
1117 /* Locate a suitable free block */
1119 if (!(pArena
= HEAP_FindFreeBlock( heapPtr
, size
, &subheap
)))
1121 TRACE("(%08x,%08lx,%08lx): returning NULL\n",
1122 heap
, flags
, size
);
1123 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1124 SetLastError( ERROR_COMMITMENT_LIMIT
);
1128 /* Remove the arena from the free list */
1130 pArena
->next
->prev
= pArena
->prev
;
1131 pArena
->prev
->next
= pArena
->next
;
1133 /* Build the in-use arena */
1135 pInUse
= (ARENA_INUSE
*)pArena
;
1137 /* in-use arena is smaller than free arena,
1138 * so we have to add the difference to the size */
1139 pInUse
->size
= (pInUse
->size
& ~ARENA_FLAG_FREE
)
1140 + sizeof(ARENA_FREE
) - sizeof(ARENA_INUSE
);
1141 pInUse
->callerEIP
= GET_EIP();
1142 pInUse
->threadId
= GetCurrentTask();
1143 pInUse
->magic
= ARENA_INUSE_MAGIC
;
1145 /* Shrink the block */
1147 HEAP_ShrinkBlock( subheap
, pInUse
, size
);
1149 if (flags
& HEAP_ZERO_MEMORY
)
1150 memset( pInUse
+ 1, 0, pInUse
->size
& ARENA_SIZE_MASK
);
1151 else if (TRACE_ON(heap
))
1152 memset( pInUse
+ 1, ARENA_INUSE_FILLER
, pInUse
->size
& ARENA_SIZE_MASK
);
1154 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1156 TRACE("(%08x,%08lx,%08lx): returning %08lx\n",
1157 heap
, flags
, size
, (DWORD
)(pInUse
+ 1) );
1158 return (LPVOID
)(pInUse
+ 1);
1162 /***********************************************************************
1163 * HeapFree (KERNEL32.338)
1168 BOOL WINAPI
HeapFree(
1169 HANDLE heap
, /* [in] Handle of heap */
1170 DWORD flags
, /* [in] Heap freeing flags */
1171 LPVOID ptr
/* [in] Address of memory to free */
1173 ARENA_INUSE
*pInUse
;
1175 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
1177 /* Validate the parameters */
1179 if (!heapPtr
) return FALSE
;
1180 if (!ptr
) /* Freeing a NULL ptr is doesn't indicate an error in Win2k */
1182 WARN("(%08x,%08lx,%08lx): asked to free NULL\n",
1183 heap
, flags
, (DWORD
)ptr
);
1187 flags
&= HEAP_NO_SERIALIZE
;
1188 flags
|= heapPtr
->flags
;
1189 if (!(flags
& HEAP_NO_SERIALIZE
)) EnterCriticalSection( &heapPtr
->critSection
);
1190 if (!HEAP_IsRealArena( heap
, HEAP_NO_SERIALIZE
, ptr
, QUIET
))
1192 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1193 SetLastError( ERROR_INVALID_PARAMETER
);
1194 TRACE("(%08x,%08lx,%08lx): returning FALSE\n",
1195 heap
, flags
, (DWORD
)ptr
);
1199 /* Turn the block into a free block */
1201 pInUse
= (ARENA_INUSE
*)ptr
- 1;
1202 subheap
= HEAP_FindSubHeap( heapPtr
, pInUse
);
1203 HEAP_MakeInUseBlockFree( subheap
, pInUse
);
1205 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1207 TRACE("(%08x,%08lx,%08lx): returning TRUE\n",
1208 heap
, flags
, (DWORD
)ptr
);
1213 /***********************************************************************
1214 * HeapReAlloc (KERNEL32.340)
1216 * Pointer to reallocated memory block
1219 LPVOID WINAPI
HeapReAlloc(
1220 HANDLE heap
, /* [in] Handle of heap block */
1221 DWORD flags
, /* [in] Heap reallocation flags */
1222 LPVOID ptr
, /* [in] Address of memory to reallocate */
1223 DWORD size
/* [in] Number of bytes to reallocate */
1225 ARENA_INUSE
*pArena
;
1230 if (!ptr
) return HeapAlloc( heap
, flags
, size
); /* FIXME: correct? */
1231 if (!(heapPtr
= HEAP_GetPtr( heap
))) return FALSE
;
1233 /* Validate the parameters */
1235 flags
&= HEAP_GENERATE_EXCEPTIONS
| HEAP_NO_SERIALIZE
| HEAP_ZERO_MEMORY
|
1236 HEAP_REALLOC_IN_PLACE_ONLY
;
1237 flags
|= heapPtr
->flags
;
1238 size
= (size
+ 3) & ~3;
1239 if (size
< HEAP_MIN_BLOCK_SIZE
) size
= HEAP_MIN_BLOCK_SIZE
;
1241 if (!(flags
& HEAP_NO_SERIALIZE
)) EnterCriticalSection( &heapPtr
->critSection
);
1242 if (!HEAP_IsRealArena( heap
, HEAP_NO_SERIALIZE
, ptr
, QUIET
))
1244 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1245 SetLastError( ERROR_INVALID_PARAMETER
);
1246 TRACE("(%08x,%08lx,%08lx,%08lx): returning NULL\n",
1247 heap
, flags
, (DWORD
)ptr
, size
);
1251 /* Check if we need to grow the block */
1253 pArena
= (ARENA_INUSE
*)ptr
- 1;
1254 pArena
->threadId
= GetCurrentTask();
1255 subheap
= HEAP_FindSubHeap( heapPtr
, pArena
);
1256 oldSize
= (pArena
->size
& ARENA_SIZE_MASK
);
1259 char *pNext
= (char *)(pArena
+ 1) + oldSize
;
1260 if ((pNext
< (char *)subheap
+ subheap
->size
) &&
1261 (*(DWORD
*)pNext
& ARENA_FLAG_FREE
) &&
1262 (oldSize
+ (*(DWORD
*)pNext
& ARENA_SIZE_MASK
) + sizeof(ARENA_FREE
) >= size
))
1264 /* The next block is free and large enough */
1265 ARENA_FREE
*pFree
= (ARENA_FREE
*)pNext
;
1266 pFree
->next
->prev
= pFree
->prev
;
1267 pFree
->prev
->next
= pFree
->next
;
1268 pArena
->size
+= (pFree
->size
& ARENA_SIZE_MASK
) + sizeof(*pFree
);
1269 if (!HEAP_Commit( subheap
, (char *)pArena
+ sizeof(ARENA_INUSE
)
1270 + size
+ HEAP_MIN_BLOCK_SIZE
))
1272 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1273 SetLastError( ERROR_OUTOFMEMORY
);
1276 HEAP_ShrinkBlock( subheap
, pArena
, size
);
1278 else /* Do it the hard way */
1281 ARENA_INUSE
*pInUse
;
1282 SUBHEAP
*newsubheap
;
1284 if ((flags
& HEAP_REALLOC_IN_PLACE_ONLY
) ||
1285 !(pNew
= HEAP_FindFreeBlock( heapPtr
, size
, &newsubheap
)))
1287 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1288 SetLastError( ERROR_OUTOFMEMORY
);
1292 /* Build the in-use arena */
1294 pNew
->next
->prev
= pNew
->prev
;
1295 pNew
->prev
->next
= pNew
->next
;
1296 pInUse
= (ARENA_INUSE
*)pNew
;
1297 pInUse
->size
= (pInUse
->size
& ~ARENA_FLAG_FREE
)
1298 + sizeof(ARENA_FREE
) - sizeof(ARENA_INUSE
);
1299 pInUse
->threadId
= GetCurrentTask();
1300 pInUse
->magic
= ARENA_INUSE_MAGIC
;
1301 HEAP_ShrinkBlock( newsubheap
, pInUse
, size
);
1302 memcpy( pInUse
+ 1, pArena
+ 1, oldSize
);
1304 /* Free the previous block */
1306 HEAP_MakeInUseBlockFree( subheap
, pArena
);
1307 subheap
= newsubheap
;
1311 else HEAP_ShrinkBlock( subheap
, pArena
, size
); /* Shrink the block */
1313 /* Clear the extra bytes if needed */
1317 if (flags
& HEAP_ZERO_MEMORY
)
1318 memset( (char *)(pArena
+ 1) + oldSize
, 0,
1319 (pArena
->size
& ARENA_SIZE_MASK
) - oldSize
);
1320 else if (TRACE_ON(heap
))
1321 memset( (char *)(pArena
+ 1) + oldSize
, ARENA_INUSE_FILLER
,
1322 (pArena
->size
& ARENA_SIZE_MASK
) - oldSize
);
1325 /* Return the new arena */
1327 pArena
->callerEIP
= GET_EIP();
1328 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1330 TRACE("(%08x,%08lx,%08lx,%08lx): returning %08lx\n",
1331 heap
, flags
, (DWORD
)ptr
, size
, (DWORD
)(pArena
+ 1) );
1332 return (LPVOID
)(pArena
+ 1);
1336 /***********************************************************************
1337 * HeapCompact (KERNEL32.335)
1339 DWORD WINAPI
HeapCompact( HANDLE heap
, DWORD flags
)
1341 SetLastError(ERROR_CALL_NOT_IMPLEMENTED
);
1346 /***********************************************************************
1347 * HeapLock (KERNEL32.339)
1348 * Attempts to acquire the critical section object for a specified heap.
1354 BOOL WINAPI
HeapLock(
1355 HANDLE heap
/* [in] Handle of heap to lock for exclusive access */
1357 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
1358 if (!heapPtr
) return FALSE
;
1359 EnterCriticalSection( &heapPtr
->critSection
);
1364 /***********************************************************************
1365 * HeapUnlock (KERNEL32.342)
1366 * Releases ownership of the critical section object.
1372 BOOL WINAPI
HeapUnlock(
1373 HANDLE heap
/* [in] Handle to the heap to unlock */
1375 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
1376 if (!heapPtr
) return FALSE
;
1377 LeaveCriticalSection( &heapPtr
->critSection
);
1382 /***********************************************************************
1383 * HeapSize (KERNEL32.341)
1385 * Size in bytes of allocated memory
1386 * 0xffffffff: Failure
1388 DWORD WINAPI
HeapSize(
1389 HANDLE heap
, /* [in] Handle of heap */
1390 DWORD flags
, /* [in] Heap size control flags */
1391 LPVOID ptr
/* [in] Address of memory to return size for */
1394 HEAP
*heapPtr
= HEAP_GetPtr( heap
);
1396 if (!heapPtr
) return FALSE
;
1397 flags
&= HEAP_NO_SERIALIZE
;
1398 flags
|= heapPtr
->flags
;
1399 if (!(flags
& HEAP_NO_SERIALIZE
)) EnterCriticalSection( &heapPtr
->critSection
);
1400 if (!HEAP_IsRealArena( heap
, HEAP_NO_SERIALIZE
, ptr
, QUIET
))
1402 SetLastError( ERROR_INVALID_PARAMETER
);
1407 ARENA_INUSE
*pArena
= (ARENA_INUSE
*)ptr
- 1;
1408 ret
= pArena
->size
& ARENA_SIZE_MASK
;
1410 if (!(flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1412 TRACE("(%08x,%08lx,%08lx): returning %08lx\n",
1413 heap
, flags
, (DWORD
)ptr
, ret
);
1418 /***********************************************************************
1419 * HeapValidate (KERNEL32.343)
1420 * Validates a specified heap.
1429 BOOL WINAPI
HeapValidate(
1430 HANDLE heap
, /* [in] Handle to the heap */
1431 DWORD flags
, /* [in] Bit flags that control access during operation */
1432 LPCVOID block
/* [in] Optional pointer to memory block to validate */
1435 return HEAP_IsRealArena( heap
, flags
, block
, QUIET
);
1439 /***********************************************************************
1440 * HeapWalk (KERNEL32.344)
1441 * Enumerates the memory blocks in a specified heap.
1442 * See HEAP_Dump() for info on heap structure.
1445 * - handling of PROCESS_HEAP_ENTRY_MOVEABLE and
1446 * PROCESS_HEAP_ENTRY_DDESHARE (needs heap.c support)
1452 BOOL WINAPI
HeapWalk(
1453 HANDLE heap
, /* [in] Handle to heap to enumerate */
1454 LPPROCESS_HEAP_ENTRY entry
/* [out] Pointer to structure of enumeration info */
1456 HEAP
*heapPtr
= HEAP_GetPtr(heap
);
1457 SUBHEAP
*sub
, *currentheap
= NULL
;
1460 int region_index
= 0;
1462 if (!heapPtr
|| !entry
)
1464 SetLastError(ERROR_INVALID_PARAMETER
);
1468 if (!(heapPtr
->flags
& HEAP_NO_SERIALIZE
)) EnterCriticalSection( &heapPtr
->critSection
);
1470 /* set ptr to the next arena to be examined */
1472 if (!entry
->lpData
) /* first call (init) ? */
1474 TRACE("begin walking of heap 0x%08x.\n", heap
);
1475 /*HEAP_Dump(heapPtr);*/
1476 currentheap
= &heapPtr
->subheap
;
1477 ptr
= (char*)currentheap
+ currentheap
->headerSize
;
1481 ptr
= entry
->lpData
;
1482 sub
= &heapPtr
->subheap
;
1485 if (((char *)ptr
>= (char *)sub
) &&
1486 ((char *)ptr
< (char *)sub
+ sub
->size
))
1494 if (currentheap
== NULL
)
1496 ERR("no matching subheap found, shouldn't happen !\n");
1497 SetLastError(ERROR_NO_MORE_ITEMS
);
1501 ptr
+= entry
->cbData
; /* point to next arena */
1502 if (ptr
> (char *)currentheap
+ currentheap
->size
- 1)
1503 { /* proceed with next subheap */
1504 if (!(currentheap
= currentheap
->next
))
1505 { /* successfully finished */
1506 TRACE("end reached.\n");
1507 SetLastError(ERROR_NO_MORE_ITEMS
);
1510 ptr
= (char*)currentheap
+ currentheap
->headerSize
;
1515 if (*(DWORD
*)ptr
& ARENA_FLAG_FREE
)
1517 ARENA_FREE
*pArena
= (ARENA_FREE
*)ptr
;
1519 /*TRACE("free, magic: %04x\n", pArena->magic);*/
1521 entry
->lpData
= pArena
+ 1;
1522 entry
->cbData
= pArena
->size
& ARENA_SIZE_MASK
;
1523 entry
->cbOverhead
= sizeof(ARENA_FREE
);
1524 entry
->wFlags
= PROCESS_HEAP_UNCOMMITTED_RANGE
;
1528 ARENA_INUSE
*pArena
= (ARENA_INUSE
*)ptr
;
1530 /*TRACE("busy, magic: %04x\n", pArena->magic);*/
1532 entry
->lpData
= pArena
+ 1;
1533 entry
->cbData
= pArena
->size
& ARENA_SIZE_MASK
;
1534 entry
->cbOverhead
= sizeof(ARENA_INUSE
);
1535 entry
->wFlags
= PROCESS_HEAP_ENTRY_BUSY
;
1536 /* FIXME: can't handle PROCESS_HEAP_ENTRY_MOVEABLE
1537 and PROCESS_HEAP_ENTRY_DDESHARE yet */
1540 entry
->iRegionIndex
= region_index
;
1542 /* first element of heap ? */
1543 if (ptr
== (char *)(currentheap
+ currentheap
->headerSize
))
1545 entry
->wFlags
|= PROCESS_HEAP_REGION
;
1546 entry
->Foo
.Region
.dwCommittedSize
= currentheap
->commitSize
;
1547 entry
->Foo
.Region
.dwUnCommittedSize
=
1548 currentheap
->size
- currentheap
->commitSize
;
1549 entry
->Foo
.Region
.lpFirstBlock
= /* first valid block */
1550 currentheap
+ currentheap
->headerSize
;
1551 entry
->Foo
.Region
.lpLastBlock
= /* first invalid block */
1552 currentheap
+ currentheap
->size
;
1557 if (!(heapPtr
->flags
& HEAP_NO_SERIALIZE
)) LeaveCriticalSection( &heapPtr
->critSection
);
1563 /***********************************************************************
1564 * HEAP_CreateSystemHeap
1566 * Create the system heap.
1568 BOOL
HEAP_CreateSystemHeap(void)
1570 SYSTEM_HEAP_DESCR
*descr
;
1575 HANDLE map
= CreateFileMappingA( INVALID_HANDLE_VALUE
, NULL
, SEC_COMMIT
| PAGE_READWRITE
,
1576 0, HEAP_DEF_SIZE
, "__SystemHeap" );
1577 if (!map
) return FALSE
;
1578 created
= (GetLastError() != ERROR_ALREADY_EXISTS
);
1580 if (!(heapPtr
= MapViewOfFileEx( map
, FILE_MAP_ALL_ACCESS
, 0, 0, 0, SYSTEM_HEAP_BASE
)))
1582 /* pre-defined address not available, use any one */
1583 fprintf( stderr
, "Warning: system heap base address %p not available\n",
1585 if (!(heapPtr
= MapViewOfFile( map
, FILE_MAP_ALL_ACCESS
, 0, 0, 0 )))
1591 heap
= (HANDLE
)heapPtr
;
1593 if (created
) /* newly created heap */
1595 HEAP_InitSubHeap( heapPtr
, heapPtr
, HEAP_SHARED
, 0, HEAP_DEF_SIZE
);
1597 descr
= heapPtr
->private = HeapAlloc( heap
, HEAP_ZERO_MEMORY
, sizeof(*descr
) );
1602 /* wait for the heap to be initialized */
1603 while (!heapPtr
->private) Sleep(1);
1605 /* remap it to the right address if necessary */
1606 if (heapPtr
->subheap
.heap
!= heapPtr
)
1608 void *base
= heapPtr
->subheap
.heap
;
1610 UnmapViewOfFile( heapPtr
);
1611 if (!(heapPtr
= MapViewOfFileEx( map
, FILE_MAP_ALL_ACCESS
, 0, 0, 0, base
)))
1613 fprintf( stderr
, "Couldn't map system heap at the correct address (%p)\n", base
);
1617 heap
= (HANDLE
)heapPtr
;
1620 descr
= heapPtr
->private;
1624 SystemHeapDescr
= descr
;
1631 /***********************************************************************
1632 * GetProcessHeap (KERNEL32.259)
1634 HANDLE WINAPI
GetProcessHeap(void)
1636 return (HANDLE
)processHeap
;
1640 /***********************************************************************
1641 * GetProcessHeaps (KERNEL32.376)
1643 DWORD WINAPI
GetProcessHeaps( DWORD count
, HANDLE
*heaps
)
1648 if (!processHeap
) return 0; /* should never happen */
1649 total
= 1; /* main heap */
1650 EnterCriticalSection( &processHeap
->critSection
);
1651 for (ptr
= firstHeap
; ptr
; ptr
= ptr
->next
) total
++;
1654 *heaps
++ = (HANDLE
)processHeap
;
1655 for (ptr
= firstHeap
; ptr
; ptr
= ptr
->next
) *heaps
++ = (HANDLE
)ptr
;
1657 LeaveCriticalSection( &processHeap
->critSection
);
1662 /***********************************************************************
1665 LPSTR
HEAP_strdupA( HANDLE heap
, DWORD flags
, LPCSTR str
)
1667 LPSTR p
= HeapAlloc( heap
, flags
, strlen(str
) + 1 );
1676 /***********************************************************************
1679 LPWSTR
HEAP_strdupW( HANDLE heap
, DWORD flags
, LPCWSTR str
)
1681 INT len
= strlenW(str
) + 1;
1682 LPWSTR p
= HeapAlloc( heap
, flags
, len
* sizeof(WCHAR
) );
1691 /***********************************************************************
1694 LPWSTR
HEAP_strdupAtoW( HANDLE heap
, DWORD flags
, LPCSTR str
)
1699 if (!str
) return NULL
;
1700 len
= MultiByteToWideChar( CP_ACP
, 0, str
, -1, NULL
, 0 );
1701 ret
= HeapAlloc( heap
, flags
, len
* sizeof(WCHAR
) );
1704 MultiByteToWideChar( CP_ACP
, 0, str
, -1, ret
, len
);
1710 /***********************************************************************
1713 LPSTR
HEAP_strdupWtoA( HANDLE heap
, DWORD flags
, LPCWSTR str
)
1718 if (!str
) return NULL
;
1719 len
= WideCharToMultiByte( CP_ACP
, 0, str
, -1, NULL
, 0, NULL
, NULL
);
1720 ret
= HeapAlloc( heap
, flags
, len
);
1723 WideCharToMultiByte( CP_ACP
, 0, str
, -1, ret
, len
, NULL
, NULL
);
1730 /***********************************************************************
1731 * 32-bit local heap functions (Win95; undocumented)
1734 #define HTABLE_SIZE 0x10000
1735 #define HTABLE_PAGESIZE 0x1000
1736 #define HTABLE_NPAGES (HTABLE_SIZE / HTABLE_PAGESIZE)
1738 #include "pshpack1.h"
1739 typedef struct _LOCAL32HEADER
1741 WORD freeListFirst
[HTABLE_NPAGES
];
1742 WORD freeListSize
[HTABLE_NPAGES
];
1743 WORD freeListLast
[HTABLE_NPAGES
];
1745 DWORD selectorTableOffset
;
1746 WORD selectorTableSize
;
1759 #include "poppack.h"
1761 #define LOCAL32_MAGIC ((DWORD)('L' | ('H'<<8) | ('3'<<16) | ('2'<<24)))
1763 /***********************************************************************
1764 * Local32Init (KERNEL.208)
1766 HANDLE WINAPI
Local32Init16( WORD segment
, DWORD tableSize
,
1767 DWORD heapSize
, DWORD flags
)
1769 DWORD totSize
, segSize
= 0;
1771 LOCAL32HEADER
*header
;
1773 WORD
*selectorTable
;
1774 WORD selectorEven
, selectorOdd
;
1777 /* Determine new heap size */
1781 if ( (segSize
= GetSelectorLimit16( segment
)) == 0 )
1787 if ( heapSize
== -1L )
1788 heapSize
= 1024L*1024L; /* FIXME */
1790 heapSize
= (heapSize
+ 0xffff) & 0xffff0000;
1791 segSize
= (segSize
+ 0x0fff) & 0xfffff000;
1792 totSize
= segSize
+ HTABLE_SIZE
+ heapSize
;
1795 /* Allocate memory and initialize heap */
1797 if ( !(base
= VirtualAlloc( NULL
, totSize
, MEM_RESERVE
, PAGE_READWRITE
)) )
1800 if ( !VirtualAlloc( base
, segSize
+ HTABLE_PAGESIZE
,
1801 MEM_COMMIT
, PAGE_READWRITE
) )
1803 VirtualFree( base
, 0, MEM_RELEASE
);
1807 heap
= (HEAP
*)(base
+ segSize
+ HTABLE_SIZE
);
1808 if ( !HEAP_InitSubHeap( heap
, (LPVOID
)heap
, 0, 0x10000, heapSize
) )
1810 VirtualFree( base
, 0, MEM_RELEASE
);
1815 /* Set up header and handle table */
1817 header
= (LOCAL32HEADER
*)(base
+ segSize
);
1818 header
->base
= base
;
1819 header
->limit
= HTABLE_PAGESIZE
-1;
1821 header
->magic
= LOCAL32_MAGIC
;
1822 header
->heap
= (HANDLE
)heap
;
1824 header
->freeListFirst
[0] = sizeof(LOCAL32HEADER
);
1825 header
->freeListLast
[0] = HTABLE_PAGESIZE
- 4;
1826 header
->freeListSize
[0] = (HTABLE_PAGESIZE
- sizeof(LOCAL32HEADER
)) / 4;
1828 for (i
= header
->freeListFirst
[0]; i
< header
->freeListLast
[0]; i
+= 4)
1829 *(DWORD
*)((LPBYTE
)header
+ i
) = i
+4;
1831 header
->freeListFirst
[1] = 0xffff;
1834 /* Set up selector table */
1836 nrBlocks
= (totSize
+ 0x7fff) >> 15;
1837 selectorTable
= (LPWORD
) HeapAlloc( header
->heap
, 0, nrBlocks
* 2 );
1838 selectorEven
= SELECTOR_AllocBlock( base
, totSize
,
1839 SEGMENT_DATA
, FALSE
, FALSE
);
1840 selectorOdd
= SELECTOR_AllocBlock( base
+ 0x8000, totSize
- 0x8000,
1841 SEGMENT_DATA
, FALSE
, FALSE
);
1843 if ( !selectorTable
|| !selectorEven
|| !selectorOdd
)
1845 if ( selectorTable
) HeapFree( header
->heap
, 0, selectorTable
);
1846 if ( selectorEven
) SELECTOR_FreeBlock( selectorEven
, totSize
>> 16 );
1847 if ( selectorOdd
) SELECTOR_FreeBlock( selectorOdd
, (totSize
-0x8000) >> 16 );
1848 HeapDestroy( header
->heap
);
1849 VirtualFree( base
, 0, MEM_RELEASE
);
1853 header
->selectorTableOffset
= (LPBYTE
)selectorTable
- header
->base
;
1854 header
->selectorTableSize
= nrBlocks
* 4; /* ??? Win95 does it this way! */
1855 header
->selectorDelta
= selectorEven
- selectorOdd
;
1856 header
->segment
= segment
? segment
: selectorEven
;
1858 for (i
= 0; i
< nrBlocks
; i
++)
1859 selectorTable
[i
] = (i
& 1)? selectorOdd
+ ((i
>> 1) << __AHSHIFT
)
1860 : selectorEven
+ ((i
>> 1) << __AHSHIFT
);
1862 /* Move old segment */
1866 /* FIXME: This is somewhat ugly and relies on implementation
1867 details about 16-bit global memory handles ... */
1869 LPBYTE oldBase
= (LPBYTE
)GetSelectorBase( segment
);
1870 memcpy( base
, oldBase
, segSize
);
1871 GLOBAL_MoveBlock( segment
, base
, totSize
);
1872 HeapFree( SystemHeap
, 0, oldBase
);
1875 return (HANDLE
)header
;
1878 /***********************************************************************
1879 * Local32_SearchHandle
1881 static LPDWORD
Local32_SearchHandle( LOCAL32HEADER
*header
, DWORD addr
)
1885 for ( handle
= (LPDWORD
)((LPBYTE
)header
+ sizeof(LOCAL32HEADER
));
1886 handle
< (LPDWORD
)((LPBYTE
)header
+ header
->limit
);
1889 if (*handle
== addr
)
1896 /***********************************************************************
1899 static VOID
Local32_ToHandle( LOCAL32HEADER
*header
, INT16 type
,
1900 DWORD addr
, LPDWORD
*handle
, LPBYTE
*ptr
)
1907 case -2: /* 16:16 pointer, no handles */
1908 *ptr
= PTR_SEG_TO_LIN( addr
);
1909 *handle
= (LPDWORD
)*ptr
;
1912 case -1: /* 32-bit offset, no handles */
1913 *ptr
= header
->base
+ addr
;
1914 *handle
= (LPDWORD
)*ptr
;
1917 case 0: /* handle */
1918 if ( addr
>= sizeof(LOCAL32HEADER
)
1919 && addr
< header
->limit
&& !(addr
& 3)
1920 && *(LPDWORD
)((LPBYTE
)header
+ addr
) >= HTABLE_SIZE
)
1922 *handle
= (LPDWORD
)((LPBYTE
)header
+ addr
);
1923 *ptr
= header
->base
+ **handle
;
1927 case 1: /* 16:16 pointer */
1928 *ptr
= PTR_SEG_TO_LIN( addr
);
1929 *handle
= Local32_SearchHandle( header
, *ptr
- header
->base
);
1932 case 2: /* 32-bit offset */
1933 *ptr
= header
->base
+ addr
;
1934 *handle
= Local32_SearchHandle( header
, *ptr
- header
->base
);
1939 /***********************************************************************
1940 * Local32_FromHandle
1942 static VOID
Local32_FromHandle( LOCAL32HEADER
*header
, INT16 type
,
1943 DWORD
*addr
, LPDWORD handle
, LPBYTE ptr
)
1947 case -2: /* 16:16 pointer */
1950 WORD
*selTable
= (LPWORD
)(header
->base
+ header
->selectorTableOffset
);
1951 DWORD offset
= (LPBYTE
)ptr
- header
->base
;
1952 *addr
= MAKELONG( offset
& 0x7fff, selTable
[offset
>> 15] );
1956 case -1: /* 32-bit offset */
1958 *addr
= ptr
- header
->base
;
1961 case 0: /* handle */
1962 *addr
= (LPBYTE
)handle
- (LPBYTE
)header
;
1967 /***********************************************************************
1968 * Local32Alloc (KERNEL.209)
1970 DWORD WINAPI
Local32Alloc16( HANDLE heap
, DWORD size
, INT16 type
, DWORD flags
)
1972 LOCAL32HEADER
*header
= (LOCAL32HEADER
*)heap
;
1977 /* Allocate memory */
1978 ptr
= HeapAlloc( header
->heap
,
1979 (flags
& LMEM_MOVEABLE
)? HEAP_ZERO_MEMORY
: 0, size
);
1983 /* Allocate handle if requested */
1988 /* Find first page of handle table with free slots */
1989 for (page
= 0; page
< HTABLE_NPAGES
; page
++)
1990 if (header
->freeListFirst
[page
] != 0)
1992 if (page
== HTABLE_NPAGES
)
1994 WARN("Out of handles!\n" );
1995 HeapFree( header
->heap
, 0, ptr
);
1999 /* If virgin page, initialize it */
2000 if (header
->freeListFirst
[page
] == 0xffff)
2002 if ( !VirtualAlloc( (LPBYTE
)header
+ (page
<< 12),
2003 0x1000, MEM_COMMIT
, PAGE_READWRITE
) )
2005 WARN("Cannot grow handle table!\n" );
2006 HeapFree( header
->heap
, 0, ptr
);
2010 header
->limit
+= HTABLE_PAGESIZE
;
2012 header
->freeListFirst
[page
] = 0;
2013 header
->freeListLast
[page
] = HTABLE_PAGESIZE
- 4;
2014 header
->freeListSize
[page
] = HTABLE_PAGESIZE
/ 4;
2016 for (i
= 0; i
< HTABLE_PAGESIZE
; i
+= 4)
2017 *(DWORD
*)((LPBYTE
)header
+ i
) = i
+4;
2019 if (page
< HTABLE_NPAGES
-1)
2020 header
->freeListFirst
[page
+1] = 0xffff;
2023 /* Allocate handle slot from page */
2024 handle
= (LPDWORD
)((LPBYTE
)header
+ header
->freeListFirst
[page
]);
2025 if (--header
->freeListSize
[page
] == 0)
2026 header
->freeListFirst
[page
] = header
->freeListLast
[page
] = 0;
2028 header
->freeListFirst
[page
] = *handle
;
2030 /* Store 32-bit offset in handle slot */
2031 *handle
= ptr
- header
->base
;
2035 handle
= (LPDWORD
)ptr
;
2040 /* Convert handle to requested output type */
2041 Local32_FromHandle( header
, type
, &addr
, handle
, ptr
);
2045 /***********************************************************************
2046 * Local32ReAlloc (KERNEL.210)
2048 DWORD WINAPI
Local32ReAlloc16( HANDLE heap
, DWORD addr
, INT16 type
,
2049 DWORD size
, DWORD flags
)
2051 LOCAL32HEADER
*header
= (LOCAL32HEADER
*)heap
;
2056 return Local32Alloc16( heap
, size
, type
, flags
);
2058 /* Retrieve handle and pointer */
2059 Local32_ToHandle( header
, type
, addr
, &handle
, &ptr
);
2060 if (!handle
) return FALSE
;
2062 /* Reallocate memory block */
2063 ptr
= HeapReAlloc( header
->heap
,
2064 (flags
& LMEM_MOVEABLE
)? HEAP_ZERO_MEMORY
: 0,
2070 *handle
= ptr
- header
->base
;
2072 handle
= (LPDWORD
)ptr
;
2074 /* Convert handle to requested output type */
2075 Local32_FromHandle( header
, type
, &addr
, handle
, ptr
);
2079 /***********************************************************************
2080 * Local32Free (KERNEL.211)
2082 BOOL WINAPI
Local32Free16( HANDLE heap
, DWORD addr
, INT16 type
)
2084 LOCAL32HEADER
*header
= (LOCAL32HEADER
*)heap
;
2088 /* Retrieve handle and pointer */
2089 Local32_ToHandle( header
, type
, addr
, &handle
, &ptr
);
2090 if (!handle
) return FALSE
;
2092 /* Free handle if necessary */
2095 int offset
= (LPBYTE
)handle
- (LPBYTE
)header
;
2096 int page
= offset
>> 12;
2098 /* Return handle slot to page free list */
2099 if (header
->freeListSize
[page
]++ == 0)
2100 header
->freeListFirst
[page
] = header
->freeListLast
[page
] = offset
;
2102 *(LPDWORD
)((LPBYTE
)header
+ header
->freeListLast
[page
]) = offset
,
2103 header
->freeListLast
[page
] = offset
;
2107 /* Shrink handle table when possible */
2108 while (page
> 0 && header
->freeListSize
[page
] == HTABLE_PAGESIZE
/ 4)
2110 if ( VirtualFree( (LPBYTE
)header
+
2111 (header
->limit
& ~(HTABLE_PAGESIZE
-1)),
2112 HTABLE_PAGESIZE
, MEM_DECOMMIT
) )
2115 header
->limit
-= HTABLE_PAGESIZE
;
2116 header
->freeListFirst
[page
] = 0xffff;
2122 return HeapFree( header
->heap
, 0, ptr
);
2125 /***********************************************************************
2126 * Local32Translate (KERNEL.213)
2128 DWORD WINAPI
Local32Translate16( HANDLE heap
, DWORD addr
, INT16 type1
, INT16 type2
)
2130 LOCAL32HEADER
*header
= (LOCAL32HEADER
*)heap
;
2134 Local32_ToHandle( header
, type1
, addr
, &handle
, &ptr
);
2135 if (!handle
) return 0;
2137 Local32_FromHandle( header
, type2
, &addr
, handle
, ptr
);
2141 /***********************************************************************
2142 * Local32Size (KERNEL.214)
2144 DWORD WINAPI
Local32Size16( HANDLE heap
, DWORD addr
, INT16 type
)
2146 LOCAL32HEADER
*header
= (LOCAL32HEADER
*)heap
;
2150 Local32_ToHandle( header
, type
, addr
, &handle
, &ptr
);
2151 if (!handle
) return 0;
2153 return HeapSize( header
->heap
, 0, ptr
);
2156 /***********************************************************************
2157 * Local32ValidHandle (KERNEL.215)
2159 BOOL WINAPI
Local32ValidHandle16( HANDLE heap
, WORD addr
)
2161 LOCAL32HEADER
*header
= (LOCAL32HEADER
*)heap
;
2165 Local32_ToHandle( header
, 0, addr
, &handle
, &ptr
);
2166 return handle
!= NULL
;
2169 /***********************************************************************
2170 * Local32GetSegment (KERNEL.229)
2172 WORD WINAPI
Local32GetSegment16( HANDLE heap
)
2174 LOCAL32HEADER
*header
= (LOCAL32HEADER
*)heap
;
2175 return header
->segment
;
2178 /***********************************************************************
2181 static LOCAL32HEADER
*Local32_GetHeap( HGLOBAL16 handle
)
2183 WORD selector
= GlobalHandleToSel16( handle
);
2184 DWORD base
= GetSelectorBase( selector
);
2185 DWORD limit
= GetSelectorLimit16( selector
);
2187 /* Hmmm. This is a somewhat stupid heuristic, but Windows 95 does
2190 if ( limit
> 0x10000 && ((LOCAL32HEADER
*)base
)->magic
== LOCAL32_MAGIC
)
2191 return (LOCAL32HEADER
*)base
;
2196 if ( limit
> 0x10000 && ((LOCAL32HEADER
*)base
)->magic
== LOCAL32_MAGIC
)
2197 return (LOCAL32HEADER
*)base
;
2202 /***********************************************************************
2203 * Local32Info (KERNEL.444) (TOOLHELP.84)
2205 BOOL16 WINAPI
Local32Info16( LOCAL32INFO
*pLocal32Info
, HGLOBAL16 handle
)
2211 LOCAL32HEADER
*header
= Local32_GetHeap( handle
);
2212 if ( !header
) return FALSE
;
2214 if ( !pLocal32Info
|| pLocal32Info
->dwSize
< sizeof(LOCAL32INFO
) )
2217 heapPtr
= (SUBHEAP
*)HEAP_GetPtr( header
->heap
);
2218 pLocal32Info
->dwMemReserved
= heapPtr
->size
;
2219 pLocal32Info
->dwMemCommitted
= heapPtr
->commitSize
;
2220 pLocal32Info
->dwTotalFree
= 0L;
2221 pLocal32Info
->dwLargestFreeBlock
= 0L;
2223 /* Note: Local32 heaps always have only one subheap! */
2224 ptr
= (LPBYTE
)heapPtr
+ heapPtr
->headerSize
;
2225 while ( ptr
< (LPBYTE
)heapPtr
+ heapPtr
->size
)
2227 if (*(DWORD
*)ptr
& ARENA_FLAG_FREE
)
2229 ARENA_FREE
*pArena
= (ARENA_FREE
*)ptr
;
2230 DWORD size
= (pArena
->size
& ARENA_SIZE_MASK
);
2231 ptr
+= sizeof(*pArena
) + size
;
2233 pLocal32Info
->dwTotalFree
+= size
;
2234 if ( size
> pLocal32Info
->dwLargestFreeBlock
)
2235 pLocal32Info
->dwLargestFreeBlock
= size
;
2239 ARENA_INUSE
*pArena
= (ARENA_INUSE
*)ptr
;
2240 DWORD size
= (pArena
->size
& ARENA_SIZE_MASK
);
2241 ptr
+= sizeof(*pArena
) + size
;
2245 pLocal32Info
->dwcFreeHandles
= 0;
2246 for ( i
= 0; i
< HTABLE_NPAGES
; i
++ )
2248 if ( header
->freeListFirst
[i
] == 0xffff ) break;
2249 pLocal32Info
->dwcFreeHandles
+= header
->freeListSize
[i
];
2251 pLocal32Info
->dwcFreeHandles
+= (HTABLE_NPAGES
- i
) * HTABLE_PAGESIZE
/4;
2256 /***********************************************************************
2257 * Local32First (KERNEL.445) (TOOLHELP.85)
2259 BOOL16 WINAPI
Local32First16( LOCAL32ENTRY
*pLocal32Entry
, HGLOBAL16 handle
)
2261 FIXME("(%p, %04X): stub!\n", pLocal32Entry
, handle
);
2265 /***********************************************************************
2266 * Local32Next (KERNEL.446) (TOOLHELP.86)
2268 BOOL16 WINAPI
Local32Next16( LOCAL32ENTRY
*pLocal32Entry
)
2270 FIXME("(%p): stub!\n", pLocal32Entry
);