?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Moved LCTYPE, GetLocaleInfo, NUMBERFMT, CURRENCYFMT and the related
[wine/multimedia.git] / memory / heap.c
blob8750588f46e0b00a4942141b0e8720f6f0d71e0e
1 /*
2 * Win32 heap functions
3 *
4 * Copyright 1996 Alexandre Julliard
5 * Copyright 1998 Ulrich Weigand
6 */
7
8 #include <assert.h>
9 #include <stdlib.h>
10 #include <stdio.h>
11 #include <string.h>
12 #include "wine/winbase16.h"
13 #include "wine/winestring.h"
14 #include "wine/unicode.h"
15 #include "selectors.h"
16 #include "global.h"
17 #include "winbase.h"
18 #include "winerror.h"
19 #include "winnt.h"
20 #include "heap.h"
21 #include "toolhelp.h"
22 #include "debugtools.h"
23 #include "winnls.h"
24
25 DEFAULT_DEBUG_CHANNEL(heap);
26
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
30 * require it.
31 */
32
33 typedef struct tagARENA_INUSE
34 {
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 */
39 } ARENA_INUSE;
40
41 typedef struct tagARENA_FREE
42 {
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 */
48 } ARENA_FREE;
49
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 */
55
56 #define ARENA_INUSE_FILLER 0x55
57 #define ARENA_FREE_FILLER 0xaa
58
59 #define QUIET 1 /* Suppress messages */
60 #define NOISY 0 /* Report all errors */
61
62 #define HEAP_NB_FREE_LISTS 4 /* Number of free lists */
63
64 /* Max size of the blocks on the free lists */
65 static const DWORD HEAP_freeListSizes[HEAP_NB_FREE_LISTS] =
66 {
67 0x20, 0x80, 0x200, 0xffffffff
68 };
69
70 typedef struct
71 {
72 DWORD size;
73 ARENA_FREE arena;
74 } FREE_LIST_ENTRY;
75
76 struct tagHEAP;
77
78 typedef struct tagSUBHEAP
79 {
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 */
87 } SUBHEAP;
88
89 #define SUBHEAP_MAGIC ((DWORD)('S' | ('U'<<8) | ('B'<<16) | ('H'<<24)))
90
91 typedef struct tagHEAP
92 {
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 */
100 } HEAP;
101
102 #define HEAP_MAGIC ((DWORD)('H' | ('E'<<8) | ('A'<<16) | ('P'<<24)))
103
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 */
107
108 HANDLE SystemHeap = 0;
109 HANDLE SegptrHeap = 0;
110
111 SYSTEM_HEAP_DESCR *SystemHeapDescr = 0;
112
113 static HEAP *processHeap; /* main process heap */
114 static HEAP *firstHeap; /* head of secondary heaps list */
115
116 /* address where we try to map the system heap */
117 #define SYSTEM_HEAP_BASE ((void*)0x65430000)
118
119 static BOOL HEAP_IsRealArena( HANDLE heap, DWORD flags, LPCVOID block, BOOL quiet );
120
121 #ifdef __GNUC__
122 #define GET_EIP() (__builtin_return_address(0))
123 #define SET_EIP(ptr) ((ARENA_INUSE*)(ptr) - 1)->callerEIP = GET_EIP()
124 #else
125 #define GET_EIP() 0
126 #define SET_EIP(ptr) /* nothing */
127 #endif /* __GNUC__ */
128
129 /***********************************************************************
130 * HEAP_Dump
131 */
132 void HEAP_Dump( HEAP *heap )
133 {
134 int i;
135 SUBHEAP *subheap;
136 char *ptr;
137
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)
143 {
144 DPRINTF( " -> %08lx", (DWORD)subheap->next );
145 subheap = subheap->next;
146 }
147
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 );
155
156 subheap = &heap->subheap;
157 while (subheap)
158 {
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 );
162
163 DPRINTF( "\n Block Stat Size Id\n" );
164 ptr = (char*)subheap + subheap->headerSize;
165 while (ptr < (char *)subheap + subheap->size)
166 {
167 if (*(DWORD *)ptr & ARENA_FLAG_FREE)
168 {
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;
177 }
178 else if (*(DWORD *)ptr & ARENA_FLAG_PREV_FREE)
179 {
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),
184 pArena->callerEIP );
185 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
186 arenaSize += sizeof(ARENA_INUSE);
187 usedSize += pArena->size & ARENA_SIZE_MASK;
188 }
189 else
190 {
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;
198 }
199 }
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;
204 }
205 }
206
207
208 /***********************************************************************
209 * HEAP_GetPtr
210 * RETURNS
211 * Pointer to the heap
212 * NULL: Failure
213 */
214 static HEAP *HEAP_GetPtr(
215 HANDLE heap /* [in] Handle to the heap */
216 ) {
217 HEAP *heapPtr = (HEAP *)heap;
218 if (!heapPtr || (heapPtr->magic != HEAP_MAGIC))
219 {
220 ERR("Invalid heap %08x!\n", heap );
221 SetLastError( ERROR_INVALID_HANDLE );
222 return NULL;
223 }
224 if (TRACE_ON(heap) && !HEAP_IsRealArena( heap, 0, NULL, NOISY ))
225 {
226 HEAP_Dump( heapPtr );
227 assert( FALSE );
228 SetLastError( ERROR_INVALID_HANDLE );
229 return NULL;
230 }
231 return heapPtr;
232 }
233
234
235 /***********************************************************************
236 * HEAP_InsertFreeBlock
237 *
238 * Insert a free block into the free list.
239 */
240 static void HEAP_InsertFreeBlock( HEAP *heap, ARENA_FREE *pArena )
241 {
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;
249 }
250
251
252 /***********************************************************************
253 * HEAP_FindSubHeap
254 * Find the sub-heap containing a given address.
255 *
256 * RETURNS
257 * Pointer: Success
258 * NULL: Failure
259 */
260 static SUBHEAP *HEAP_FindSubHeap(
261 HEAP *heap, /* [in] Heap pointer */
262 LPCVOID ptr /* [in] Address */
263 ) {
264 SUBHEAP *sub = &heap->subheap;
265 while (sub)
266 {
267 if (((char *)ptr >= (char *)sub) &&
268 ((char *)ptr < (char *)sub + sub->size)) return sub;
269 sub = sub->next;
270 }
271 return NULL;
272 }
273
274
275 /***********************************************************************
276 * HEAP_Commit
277 *
278 * Make sure the heap storage is committed up to (not including) ptr.
279 */
280 static inline BOOL HEAP_Commit( SUBHEAP *subheap, void *ptr )
281 {
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))
289 {
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 );
294 return FALSE;
295 }
296 subheap->commitSize = size;
297 return TRUE;
298 }
299
300
301 /***********************************************************************
302 * HEAP_Decommit
303 *
304 * If possible, decommit the heap storage from (including) 'ptr'.
305 */
306 static inline BOOL HEAP_Decommit( SUBHEAP *subheap, void *ptr )
307 {
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 ))
314 {
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 );
319 return FALSE;
320 }
321 subheap->commitSize = size;
322 return TRUE;
323 }
324
325
326 /***********************************************************************
327 * HEAP_CreateFreeBlock
328 *
329 * Create a free block at a specified address. 'size' is the size of the
330 * whole block, including the new arena.
331 */
332 static void HEAP_CreateFreeBlock( SUBHEAP *subheap, void *ptr, DWORD size )
333 {
334 ARENA_FREE *pFree;
335
336 /* Create a free arena */
337
338 pFree = (ARENA_FREE *)ptr;
339 pFree->threadId = GetCurrentTask();
340 pFree->magic = ARENA_FREE_MAGIC;
341
342 /* If debugging, erase the freed block content */
343
344 if (TRACE_ON(heap))
345 {
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) );
351 }
352
353 /* Check if next block is free also */
354
355 if (((char *)ptr + size < (char *)subheap + subheap->size) &&
356 (*(DWORD *)((char *)ptr + size) & ARENA_FLAG_FREE))
357 {
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);
363 if (TRACE_ON(heap))
364 memset( pNext, ARENA_FREE_FILLER, sizeof(ARENA_FREE) );
365 }
366
367 /* Set the next block PREV_FREE flag and pointer */
368
369 if ((char *)ptr + size < (char *)subheap + subheap->size)
370 {
371 DWORD *pNext = (DWORD *)((char *)ptr + size);
372 *pNext |= ARENA_FLAG_PREV_FREE;
373 *(ARENA_FREE **)(pNext - 1) = pFree;
374 }
375
376 /* Last, insert the new block into the free list */
377
378 pFree->size = size - sizeof(*pFree);
379 HEAP_InsertFreeBlock( subheap->heap, pFree );
380 }
381
382
383 /***********************************************************************
384 * HEAP_MakeInUseBlockFree
385 *
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.
388 */
389 static void HEAP_MakeInUseBlockFree( SUBHEAP *subheap, ARENA_INUSE *pArena )
390 {
391 ARENA_FREE *pFree;
392 DWORD size = (pArena->size & ARENA_SIZE_MASK) + sizeof(*pArena);
393
394 /* Check if we can merge with previous block */
395
396 if (pArena->size & ARENA_FLAG_PREV_FREE)
397 {
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;
403 }
404 else pFree = (ARENA_FREE *)pArena;
405
406 /* Create a free block */
407
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 */
412
413 /* Free the whole sub-heap if it's empty and not the original one */
414
415 if (((char *)pFree == (char *)subheap + subheap->headerSize) &&
416 (subheap != &subheap->heap->subheap))
417 {
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 */
426 subheap->magic = 0;
427 if (subheap->selector) FreeSelector16( subheap->selector );
428 VirtualFree( subheap, 0, MEM_RELEASE );
429 return;
430 }
431
432 /* Decommit the end of the heap */
433
434 if (!(subheap->heap->flags & HEAP_SHARED)) HEAP_Decommit( subheap, pFree + 1 );
435 }
436
437
438 /***********************************************************************
439 * HEAP_ShrinkBlock
440 *
441 * Shrink an in-use block.
442 */
443 static void HEAP_ShrinkBlock(SUBHEAP *subheap, ARENA_INUSE *pArena, DWORD size)
444 {
445 if ((pArena->size & ARENA_SIZE_MASK) >= size + HEAP_MIN_BLOCK_SIZE)
446 {
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);
451 }
452 else
453 {
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;
458 }
459 }
460
461 /***********************************************************************
462 * HEAP_InitSubHeap
463 */
464 static BOOL HEAP_InitSubHeap( HEAP *heap, LPVOID address, DWORD flags,
465 DWORD commitSize, DWORD totalSize )
466 {
467 SUBHEAP *subheap = (SUBHEAP *)address;
468 WORD selector = 0;
469 FREE_LIST_ENTRY *pEntry;
470 int i;
471
472 /* Commit memory */
473
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))
477 {
478 WARN("Could not commit %08lx bytes for sub-heap %08lx\n",
479 commitSize, (DWORD)address );
480 return FALSE;
481 }
482
483 /* Allocate a selector if needed */
484
485 if (flags & HEAP_WINE_SEGPTR)
486 {
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 );
491 if (!selector)
492 {
493 ERR("Could not allocate selector\n" );
494 return FALSE;
495 }
496 }
497
498 /* Fill the sub-heap structure */
499
500 subheap->heap = heap;
501 subheap->selector = selector;
502 subheap->size = totalSize;
503 subheap->commitSize = commitSize;
504 subheap->magic = SUBHEAP_MAGIC;
505
506 if ( subheap != (SUBHEAP *)heap )
507 {
508 /* If this is a secondary subheap, insert it into list */
509
510 subheap->headerSize = sizeof(SUBHEAP);
511 subheap->next = heap->subheap.next;
512 heap->subheap.next = subheap;
513 }
514 else
515 {
516 /* If this is a primary subheap, initialize main heap */
517
518 subheap->headerSize = sizeof(HEAP);
519 subheap->next = NULL;
520 heap->next = NULL;
521 heap->flags = flags;
522 heap->magic = HEAP_MAGIC;
523
524 /* Build the free lists */
525
526 for (i = 0, pEntry = heap->freeList; i < HEAP_NB_FREE_LISTS; i++, pEntry++)
527 {
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;
536 }
537
538 /* Initialize critical section */
539
540 InitializeCriticalSection( &heap->critSection );
541 if (!SystemHeap) MakeCriticalSectionGlobal( &heap->critSection );
542 }
543
544 /* Create the first free block */
545
546 HEAP_CreateFreeBlock( subheap, (LPBYTE)subheap + subheap->headerSize,
547 subheap->size - subheap->headerSize );
548
549 return TRUE;
550 }
551
552 /***********************************************************************
553 * HEAP_CreateSubHeap
554 *
555 * Create a sub-heap of the given size.
556 * If heap == NULL, creates a main heap.
557 */
558 static SUBHEAP *HEAP_CreateSubHeap( HEAP *heap, DWORD flags,
559 DWORD commitSize, DWORD totalSize )
560 {
561 LPVOID address;
562
563 /* Round-up sizes on a 64K boundary */
564
565 if (flags & HEAP_WINE_SEGPTR)
566 {
567 totalSize = commitSize = 0x10000; /* Only 64K at a time for SEGPTRs */
568 }
569 else
570 {
571 totalSize = (totalSize + 0xffff) & 0xffff0000;
572 commitSize = (commitSize + 0xffff) & 0xffff0000;
573 if (!commitSize) commitSize = 0x10000;
574 if (totalSize < commitSize) totalSize = commitSize;
575 }
576
577 /* Allocate the memory block */
578
579 if (!(address = VirtualAlloc( NULL, totalSize,
580 MEM_RESERVE, PAGE_EXECUTE_READWRITE )))
581 {
582 WARN("Could not VirtualAlloc %08lx bytes\n",
583 totalSize );
584 return NULL;
585 }
586
587 /* Initialize subheap */
588
589 if (!HEAP_InitSubHeap( heap? heap : (HEAP *)address,
590 address, flags, commitSize, totalSize ))
591 {
592 VirtualFree( address, 0, MEM_RELEASE );
593 return NULL;
594 }
595
596 return (SUBHEAP *)address;
597 }
598
599
600 /***********************************************************************
601 * HEAP_FindFreeBlock
602 *
603 * Find a free block at least as large as the requested size, and make sure
604 * the requested size is committed.
605 */
606 static ARENA_FREE *HEAP_FindFreeBlock( HEAP *heap, DWORD size,
607 SUBHEAP **ppSubHeap )
608 {
609 SUBHEAP *subheap;
610 ARENA_FREE *pArena;
611 FREE_LIST_ENTRY *pEntry = heap->freeList;
612
613 /* Find a suitable free list, and in it find a block large enough */
614
615 while (pEntry->size < size) pEntry++;
616 pArena = pEntry->arena.next;
617 while (pArena != &heap->freeList[0].arena)
618 {
619 if (pArena->size > size)
620 {
621 subheap = HEAP_FindSubHeap( heap, pArena );
622 if (!HEAP_Commit( subheap, (char *)pArena + sizeof(ARENA_INUSE)
623 + size + HEAP_MIN_BLOCK_SIZE))
624 return NULL;
625 *ppSubHeap = subheap;
626 return pArena;
627 }
628
629 pArena = pArena->next;
630 }
631
632 /* If no block was found, attempt to grow the heap */
633
634 if (!(heap->flags & HEAP_GROWABLE))
635 {
636 WARN("Not enough space in heap %08lx for %08lx bytes\n",
637 (DWORD)heap, size );
638 return NULL;
639 }
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_FREE) + HEAP_MIN_BLOCK_SIZE;
646 if (!(subheap = HEAP_CreateSubHeap( heap, heap->flags, size,
647 max( HEAP_DEF_SIZE, size ) )))
648 return NULL;
649
650 TRACE("created new sub-heap %08lx of %08lx bytes for heap %08lx\n",
651 (DWORD)subheap, size, (DWORD)heap );
652
653 *ppSubHeap = subheap;
654 return (ARENA_FREE *)(subheap + 1);
655 }
656
657
658 /***********************************************************************
659 * HEAP_IsValidArenaPtr
660 *
661 * Check that the pointer is inside the range possible for arenas.
662 */
663 static BOOL HEAP_IsValidArenaPtr( HEAP *heap, void *ptr )
664 {
665 int i;
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;
672 return FALSE;
673 }
674
675
676 /***********************************************************************
677 * HEAP_ValidateFreeArena
678 */
679 static BOOL HEAP_ValidateFreeArena( SUBHEAP *subheap, ARENA_FREE *pArena )
680 {
681 char *heapEnd = (char *)subheap + subheap->size;
682
683 /* Check magic number */
684 if (pArena->magic != ARENA_FREE_MAGIC)
685 {
686 ERR("Heap %08lx: invalid free arena magic for %08lx\n",
687 (DWORD)subheap->heap, (DWORD)pArena );
688 return FALSE;
689 }
690 /* Check size flags */
691 if (!(pArena->size & ARENA_FLAG_FREE) ||
692 (pArena->size & ARENA_FLAG_PREV_FREE))
693 {
694 ERR("Heap %08lx: bad flags %lx for free arena %08lx\n",
695 (DWORD)subheap->heap, pArena->size & ~ARENA_SIZE_MASK, (DWORD)pArena );
696 }
697 /* Check arena size */
698 if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) > heapEnd)
699 {
700 ERR("Heap %08lx: bad size %08lx for free arena %08lx\n",
701 (DWORD)subheap->heap, (DWORD)pArena->size & ARENA_SIZE_MASK, (DWORD)pArena );
702 return FALSE;
703 }
704 /* Check that next pointer is valid */
705 if (!HEAP_IsValidArenaPtr( subheap->heap, pArena->next ))
706 {
707 ERR("Heap %08lx: bad next ptr %08lx for arena %08lx\n",
708 (DWORD)subheap->heap, (DWORD)pArena->next, (DWORD)pArena );
709 return FALSE;
710 }
711 /* Check that next arena is free */
712 if (!(pArena->next->size & ARENA_FLAG_FREE) ||
713 (pArena->next->magic != ARENA_FREE_MAGIC))
714 {
715 ERR("Heap %08lx: next arena %08lx invalid for %08lx\n",
716 (DWORD)subheap->heap, (DWORD)pArena->next, (DWORD)pArena );
717 return FALSE;
718 }
719 /* Check that prev pointer is valid */
720 if (!HEAP_IsValidArenaPtr( subheap->heap, pArena->prev ))
721 {
722 ERR("Heap %08lx: bad prev ptr %08lx for arena %08lx\n",
723 (DWORD)subheap->heap, (DWORD)pArena->prev, (DWORD)pArena );
724 return FALSE;
725 }
726 /* Check that prev arena is free */
727 if (!(pArena->prev->size & ARENA_FLAG_FREE) ||
728 (pArena->prev->magic != ARENA_FREE_MAGIC))
729 {
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 );
734 return FALSE;
735 }
736 /* Check that next block has PREV_FREE flag */
737 if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) < heapEnd)
738 {
739 if (!(*(DWORD *)((char *)(pArena + 1) +
740 (pArena->size & ARENA_SIZE_MASK)) & ARENA_FLAG_PREV_FREE))
741 {
742 ERR("Heap %08lx: free arena %08lx next block has no PREV_FREE flag\n",
743 (DWORD)subheap->heap, (DWORD)pArena );
744 return FALSE;
745 }
746 /* Check next block back pointer */
747 if (*((ARENA_FREE **)((char *)(pArena + 1) +
748 (pArena->size & ARENA_SIZE_MASK)) - 1) != pArena)
749 {
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));
753 return FALSE;
754 }
755 }
756 return TRUE;
757 }
758
759
760 /***********************************************************************
761 * HEAP_ValidateInUseArena
762 */
763 static BOOL HEAP_ValidateInUseArena( SUBHEAP *subheap, ARENA_INUSE *pArena, BOOL quiet )
764 {
765 char *heapEnd = (char *)subheap + subheap->size;
766
767 /* Check magic number */
768 if (pArena->magic != ARENA_INUSE_MAGIC)
769 {
770 if (quiet == NOISY) {
771 ERR("Heap %08lx: invalid in-use arena magic for %08lx\n",
772 (DWORD)subheap->heap, (DWORD)pArena );
773 if (TRACE_ON(heap))
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 );
778 if (TRACE_ON(heap))
779 HEAP_Dump( subheap->heap );
780 }
781 return FALSE;
782 }
783 /* Check size flags */
784 if (pArena->size & ARENA_FLAG_FREE)
785 {
786 ERR("Heap %08lx: bad flags %lx for in-use arena %08lx\n",
787 (DWORD)subheap->heap, pArena->size & ~ARENA_SIZE_MASK, (DWORD)pArena );
788 }
789 /* Check arena size */
790 if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) > heapEnd)
791 {
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 );
794 return FALSE;
795 }
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))
799 {
800 ERR("Heap %08lx: in-use arena %08lx next block has PREV_FREE flag\n",
801 (DWORD)subheap->heap, (DWORD)pArena );
802 return FALSE;
803 }
804 /* Check prev free arena */
805 if (pArena->size & ARENA_FLAG_PREV_FREE)
806 {
807 ARENA_FREE *pPrev = *((ARENA_FREE **)pArena - 1);
808 /* Check prev pointer */
809 if (!HEAP_IsValidArenaPtr( subheap->heap, pPrev ))
810 {
811 ERR("Heap %08lx: bad back ptr %08lx for arena %08lx\n",
812 (DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
813 return FALSE;
814 }
815 /* Check that prev arena is free */
816 if (!(pPrev->size & ARENA_FLAG_FREE) ||
817 (pPrev->magic != ARENA_FREE_MAGIC))
818 {
819 ERR("Heap %08lx: prev arena %08lx invalid for in-use %08lx\n",
820 (DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
821 return FALSE;
822 }
823 /* Check that prev arena is really the previous block */
824 if ((char *)(pPrev + 1) + (pPrev->size & ARENA_SIZE_MASK) != (char *)pArena)
825 {
826 ERR("Heap %08lx: prev arena %08lx is not prev for in-use %08lx\n",
827 (DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
828 return FALSE;
829 }
830 }
831 return TRUE;
832 }
833
834
835 /***********************************************************************
836 * HEAP_IsInsideHeap
837 * Checks whether the pointer points to a block inside a given heap.
838 *
839 * NOTES
840 * Should this return BOOL32?
841 *
842 * RETURNS
843 * !0: Success
844 * 0: Failure
845 */
846 int HEAP_IsInsideHeap(
847 HANDLE heap, /* [in] Heap */
848 DWORD flags, /* [in] Flags */
849 LPCVOID ptr /* [in] Pointer */
850 ) {
851 HEAP *heapPtr = HEAP_GetPtr( heap );
852 SUBHEAP *subheap;
853 int ret;
854
855 /* Validate the parameters */
856
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 );
864 return ret;
865 }
866
867
868 /***********************************************************************
869 * HEAP_GetSegptr
870 *
871 * Transform a linear pointer into a SEGPTR. The pointer must have been
872 * allocated from a HEAP_WINE_SEGPTR heap.
873 */
874 SEGPTR HEAP_GetSegptr( HANDLE heap, DWORD flags, LPCVOID ptr )
875 {
876 HEAP *heapPtr = HEAP_GetPtr( heap );
877 SUBHEAP *subheap;
878 SEGPTR ret;
879
880 /* Validate the parameters */
881
882 if (!heapPtr) return 0;
883 flags |= heapPtr->flags;
884 if (!(flags & HEAP_WINE_SEGPTR))
885 {
886 ERR("Heap %08x is not a SEGPTR heap\n",
887 heap );
888 return 0;
889 }
890 if (!(flags & HEAP_NO_SERIALIZE)) EnterCriticalSection( &heapPtr->critSection );
891
892 /* Get the subheap */
893
894 if (!(subheap = HEAP_FindSubHeap( heapPtr, ptr )))
895 {
896 ERR("%p is not inside heap %08x\n",
897 ptr, heap );
898 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
899 return 0;
900 }
901
902 /* Build the SEGPTR */
903
904 ret = PTR_SEG_OFF_TO_SEGPTR(subheap->selector, (DWORD)ptr-(DWORD)subheap);
905 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
906 return ret;
907 }
908
909 /***********************************************************************
910 * HEAP_IsRealArena [Internal]
911 * Validates a block is a valid arena.
912 *
913 * RETURNS
914 * TRUE: Success
915 * FALSE: Failure
916 */
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 */
923 ) {
924 SUBHEAP *subheap;
925 HEAP *heapPtr = (HEAP *)(heap);
926 BOOL ret = TRUE;
927
928 if (!heapPtr || (heapPtr->magic != HEAP_MAGIC))
929 {
930 ERR("Invalid heap %08x!\n", heap );
931 return FALSE;
932 }
933
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 );
939
940 if (block)
941 {
942 /* Only check this single memory block */
943
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)))
949 {
950 if (quiet == NOISY)
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 );
956 ret = FALSE;
957 } else
958 ret = HEAP_ValidateInUseArena( subheap, (ARENA_INUSE *)block - 1, quiet );
959
960 if (!(flags & HEAP_NO_SERIALIZE))
961 LeaveCriticalSection( &heapPtr->critSection );
962 return ret;
963 }
964
965 subheap = &heapPtr->subheap;
966 while (subheap && ret)
967 {
968 char *ptr = (char *)subheap + subheap->headerSize;
969 while (ptr < (char *)subheap + subheap->size)
970 {
971 if (*(DWORD *)ptr & ARENA_FLAG_FREE)
972 {
973 if (!HEAP_ValidateFreeArena( subheap, (ARENA_FREE *)ptr )) {
974 ret = FALSE;
975 break;
976 }
977 ptr += sizeof(ARENA_FREE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
978 }
979 else
980 {
981 if (!HEAP_ValidateInUseArena( subheap, (ARENA_INUSE *)ptr, NOISY )) {
982 ret = FALSE;
983 break;
984 }
985 ptr += sizeof(ARENA_INUSE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
986 }
987 }
988 subheap = subheap->next;
989 }
990
991 if (!(flags & HEAP_NO_SERIALIZE))
992 LeaveCriticalSection( &heapPtr->critSection );
993 return ret;
994 }
995
996
997 /***********************************************************************
998 * HeapCreate (KERNEL32.336)
999 * RETURNS
1000 * Handle of heap: Success
1001 * NULL: Failure
1002 */
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 */
1007 ) {
1008 SUBHEAP *subheap;
1009
1010 if ( flags & HEAP_SHARED ) {
1011 FIXME ( "Shared Heap requested, returning system heap.\n" );
1012 return SystemHeap;
1013 }
1014
1015 /* Allocate the heap block */
1016
1017 if (!maxSize)
1018 {
1019 maxSize = HEAP_DEF_SIZE;
1020 flags |= HEAP_GROWABLE;
1021 }
1022 if (!(subheap = HEAP_CreateSubHeap( NULL, flags, initialSize, maxSize )))
1023 {
1024 SetLastError( ERROR_OUTOFMEMORY );
1025 return 0;
1026 }
1027
1028 /* link it into the per-process heap list */
1029 if (processHeap)
1030 {
1031 HEAP *heapPtr = subheap->heap;
1032 EnterCriticalSection( &processHeap->critSection );
1033 heapPtr->next = firstHeap;
1034 firstHeap = heapPtr;
1035 LeaveCriticalSection( &processHeap->critSection );
1036 }
1037 else /* assume the first heap we create is the process main heap */
1038 {
1039 processHeap = subheap->heap;
1040 }
1041
1042 return (HANDLE)subheap;
1043 }
1044
1045 /***********************************************************************
1046 * HeapDestroy (KERNEL32.337)
1047 * RETURNS
1048 * TRUE: Success
1049 * FALSE: Failure
1050 */
1051 BOOL WINAPI HeapDestroy( HANDLE heap /* [in] Handle of heap */ )
1052 {
1053 HEAP *heapPtr = HEAP_GetPtr( heap );
1054 SUBHEAP *subheap;
1055
1056 if ( heap == SystemHeap ) {
1057 FIXME ( "attempt to destroy system heap, returning TRUE!\n" );
1058 return TRUE;
1059 }
1060
1061 TRACE("%08x\n", heap );
1062 if (!heapPtr) return FALSE;
1063
1064 if (heapPtr == processHeap) /* cannot delete the main process heap */
1065 {
1066 SetLastError( ERROR_INVALID_PARAMETER );
1067 return FALSE;
1068 }
1069 else /* remove it from the per-process list */
1070 {
1071 HEAP **pptr;
1072 EnterCriticalSection( &processHeap->critSection );
1073 pptr = &firstHeap;
1074 while (*pptr && *pptr != heapPtr) pptr = &(*pptr)->next;
1075 if (*pptr) *pptr = (*pptr)->next;
1076 LeaveCriticalSection( &processHeap->critSection );
1077 }
1078
1079 DeleteCriticalSection( &heapPtr->critSection );
1080 subheap = &heapPtr->subheap;
1081 while (subheap)
1082 {
1083 SUBHEAP *next = subheap->next;
1084 if (subheap->selector) FreeSelector16( subheap->selector );
1085 VirtualFree( subheap, 0, MEM_RELEASE );
1086 subheap = next;
1087 }
1088 return TRUE;
1089 }
1090
1091
1092 /***********************************************************************
1093 * HeapAlloc (KERNEL32.334)
1094 * RETURNS
1095 * Pointer to allocated memory block
1096 * NULL: Failure
1097 */
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 */
1102 ) {
1103 ARENA_FREE *pArena;
1104 ARENA_INUSE *pInUse;
1105 SUBHEAP *subheap;
1106 HEAP *heapPtr = HEAP_GetPtr( heap );
1107
1108 /* Validate the parameters */
1109
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;
1115
1116 if (!(flags & HEAP_NO_SERIALIZE)) EnterCriticalSection( &heapPtr->critSection );
1117 /* Locate a suitable free block */
1118
1119 if (!(pArena = HEAP_FindFreeBlock( heapPtr, size, &subheap )))
1120 {
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 );
1125 return NULL;
1126 }
1127
1128 /* Remove the arena from the free list */
1129
1130 pArena->next->prev = pArena->prev;
1131 pArena->prev->next = pArena->next;
1132
1133 /* Build the in-use arena */
1134
1135 pInUse = (ARENA_INUSE *)pArena;
1136 pInUse->size = (pInUse->size & ~ARENA_FLAG_FREE)
1137 + sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
1138 pInUse->callerEIP = GET_EIP();
1139 pInUse->threadId = GetCurrentTask();
1140 pInUse->magic = ARENA_INUSE_MAGIC;
1141
1142 /* Shrink the block */
1143
1144 HEAP_ShrinkBlock( subheap, pInUse, size );
1145
1146 if (flags & HEAP_ZERO_MEMORY)
1147 memset( pInUse + 1, 0, pInUse->size & ARENA_SIZE_MASK );
1148 else if (TRACE_ON(heap))
1149 memset( pInUse + 1, ARENA_INUSE_FILLER, pInUse->size & ARENA_SIZE_MASK );
1150
1151 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1152
1153 TRACE("(%08x,%08lx,%08lx): returning %08lx\n",
1154 heap, flags, size, (DWORD)(pInUse + 1) );
1155 return (LPVOID)(pInUse + 1);
1156 }
1157
1158
1159 /***********************************************************************
1160 * HeapFree (KERNEL32.338)
1161 * RETURNS
1162 * TRUE: Success
1163 * FALSE: Failure
1164 */
1165 BOOL WINAPI HeapFree(
1166 HANDLE heap, /* [in] Handle of heap */
1167 DWORD flags, /* [in] Heap freeing flags */
1168 LPVOID ptr /* [in] Address of memory to free */
1169 ) {
1170 ARENA_INUSE *pInUse;
1171 SUBHEAP *subheap;
1172 HEAP *heapPtr = HEAP_GetPtr( heap );
1173
1174 /* Validate the parameters */
1175
1176 if (!heapPtr) return FALSE;
1177 if (!ptr) /* Freeing a NULL ptr is doesn't indicate an error in Win2k */
1178 {
1179 WARN("(%08x,%08lx,%08lx): asked to free NULL\n",
1180 heap, flags, (DWORD)ptr );
1181 return TRUE;
1182 }
1183
1184 flags &= HEAP_NO_SERIALIZE;
1185 flags |= heapPtr->flags;
1186 if (!(flags & HEAP_NO_SERIALIZE)) EnterCriticalSection( &heapPtr->critSection );
1187 if (!HEAP_IsRealArena( heap, HEAP_NO_SERIALIZE, ptr, QUIET ))
1188 {
1189 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1190 SetLastError( ERROR_INVALID_PARAMETER );
1191 TRACE("(%08x,%08lx,%08lx): returning FALSE\n",
1192 heap, flags, (DWORD)ptr );
1193 return FALSE;
1194 }
1195
1196 /* Turn the block into a free block */
1197
1198 pInUse = (ARENA_INUSE *)ptr - 1;
1199 subheap = HEAP_FindSubHeap( heapPtr, pInUse );
1200 HEAP_MakeInUseBlockFree( subheap, pInUse );
1201
1202 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1203
1204 TRACE("(%08x,%08lx,%08lx): returning TRUE\n",
1205 heap, flags, (DWORD)ptr );
1206 return TRUE;
1207 }
1208
1209
1210 /***********************************************************************
1211 * HeapReAlloc (KERNEL32.340)
1212 * RETURNS
1213 * Pointer to reallocated memory block
1214 * NULL: Failure
1215 */
1216 LPVOID WINAPI HeapReAlloc(
1217 HANDLE heap, /* [in] Handle of heap block */
1218 DWORD flags, /* [in] Heap reallocation flags */
1219 LPVOID ptr, /* [in] Address of memory to reallocate */
1220 DWORD size /* [in] Number of bytes to reallocate */
1221 ) {
1222 ARENA_INUSE *pArena;
1223 DWORD oldSize;
1224 HEAP *heapPtr;
1225 SUBHEAP *subheap;
1226
1227 if (!ptr) return HeapAlloc( heap, flags, size ); /* FIXME: correct? */
1228 if (!(heapPtr = HEAP_GetPtr( heap ))) return FALSE;
1229
1230 /* Validate the parameters */
1231
1232 flags &= HEAP_GENERATE_EXCEPTIONS | HEAP_NO_SERIALIZE | HEAP_ZERO_MEMORY |
1233 HEAP_REALLOC_IN_PLACE_ONLY;
1234 flags |= heapPtr->flags;
1235 size = (size + 3) & ~3;
1236 if (size < HEAP_MIN_BLOCK_SIZE) size = HEAP_MIN_BLOCK_SIZE;
1237
1238 if (!(flags & HEAP_NO_SERIALIZE)) EnterCriticalSection( &heapPtr->critSection );
1239 if (!HEAP_IsRealArena( heap, HEAP_NO_SERIALIZE, ptr, QUIET ))
1240 {
1241 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1242 SetLastError( ERROR_INVALID_PARAMETER );
1243 TRACE("(%08x,%08lx,%08lx,%08lx): returning NULL\n",
1244 heap, flags, (DWORD)ptr, size );
1245 return NULL;
1246 }
1247
1248 /* Check if we need to grow the block */
1249
1250 pArena = (ARENA_INUSE *)ptr - 1;
1251 pArena->threadId = GetCurrentTask();
1252 subheap = HEAP_FindSubHeap( heapPtr, pArena );
1253 oldSize = (pArena->size & ARENA_SIZE_MASK);
1254 if (size > oldSize)
1255 {
1256 char *pNext = (char *)(pArena + 1) + oldSize;
1257 if ((pNext < (char *)subheap + subheap->size) &&
1258 (*(DWORD *)pNext & ARENA_FLAG_FREE) &&
1259 (oldSize + (*(DWORD *)pNext & ARENA_SIZE_MASK) + sizeof(ARENA_FREE) >= size))
1260 {
1261 /* The next block is free and large enough */
1262 ARENA_FREE *pFree = (ARENA_FREE *)pNext;
1263 pFree->next->prev = pFree->prev;
1264 pFree->prev->next = pFree->next;
1265 pArena->size += (pFree->size & ARENA_SIZE_MASK) + sizeof(*pFree);
1266 if (!HEAP_Commit( subheap, (char *)pArena + sizeof(ARENA_INUSE)
1267 + size + HEAP_MIN_BLOCK_SIZE))
1268 {
1269 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1270 SetLastError( ERROR_OUTOFMEMORY );
1271 return NULL;
1272 }
1273 HEAP_ShrinkBlock( subheap, pArena, size );
1274 }
1275 else /* Do it the hard way */
1276 {
1277 ARENA_FREE *pNew;
1278 ARENA_INUSE *pInUse;
1279 SUBHEAP *newsubheap;
1280
1281 if ((flags & HEAP_REALLOC_IN_PLACE_ONLY) ||
1282 !(pNew = HEAP_FindFreeBlock( heapPtr, size, &newsubheap )))
1283 {
1284 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1285 SetLastError( ERROR_OUTOFMEMORY );
1286 return NULL;
1287 }
1288
1289 /* Build the in-use arena */
1290
1291 pNew->next->prev = pNew->prev;
1292 pNew->prev->next = pNew->next;
1293 pInUse = (ARENA_INUSE *)pNew;
1294 pInUse->size = (pInUse->size & ~ARENA_FLAG_FREE)
1295 + sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
1296 pInUse->threadId = GetCurrentTask();
1297 pInUse->magic = ARENA_INUSE_MAGIC;
1298 HEAP_ShrinkBlock( newsubheap, pInUse, size );
1299 memcpy( pInUse + 1, pArena + 1, oldSize );
1300
1301 /* Free the previous block */
1302
1303 HEAP_MakeInUseBlockFree( subheap, pArena );
1304 subheap = newsubheap;
1305 pArena = pInUse;
1306 }
1307 }
1308 else HEAP_ShrinkBlock( subheap, pArena, size ); /* Shrink the block */
1309
1310 /* Clear the extra bytes if needed */
1311
1312 if (size > oldSize)
1313 {
1314 if (flags & HEAP_ZERO_MEMORY)
1315 memset( (char *)(pArena + 1) + oldSize, 0,
1316 (pArena->size & ARENA_SIZE_MASK) - oldSize );
1317 else if (TRACE_ON(heap))
1318 memset( (char *)(pArena + 1) + oldSize, ARENA_INUSE_FILLER,
1319 (pArena->size & ARENA_SIZE_MASK) - oldSize );
1320 }
1321
1322 /* Return the new arena */
1323
1324 pArena->callerEIP = GET_EIP();
1325 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1326
1327 TRACE("(%08x,%08lx,%08lx,%08lx): returning %08lx\n",
1328 heap, flags, (DWORD)ptr, size, (DWORD)(pArena + 1) );
1329 return (LPVOID)(pArena + 1);
1330 }
1331
1332
1333 /***********************************************************************
1334 * HeapCompact (KERNEL32.335)
1335 */
1336 DWORD WINAPI HeapCompact( HANDLE heap, DWORD flags )
1337 {
1338 SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
1339 return 0;
1340 }
1341
1342
1343 /***********************************************************************
1344 * HeapLock (KERNEL32.339)
1345 * Attempts to acquire the critical section object for a specified heap.
1346 *
1347 * RETURNS
1348 * TRUE: Success
1349 * FALSE: Failure
1350 */
1351 BOOL WINAPI HeapLock(
1352 HANDLE heap /* [in] Handle of heap to lock for exclusive access */
1353 ) {
1354 HEAP *heapPtr = HEAP_GetPtr( heap );
1355 if (!heapPtr) return FALSE;
1356 EnterCriticalSection( &heapPtr->critSection );
1357 return TRUE;
1358 }
1359
1360
1361 /***********************************************************************
1362 * HeapUnlock (KERNEL32.342)
1363 * Releases ownership of the critical section object.
1364 *
1365 * RETURNS
1366 * TRUE: Success
1367 * FALSE: Failure
1368 */
1369 BOOL WINAPI HeapUnlock(
1370 HANDLE heap /* [in] Handle to the heap to unlock */
1371 ) {
1372 HEAP *heapPtr = HEAP_GetPtr( heap );
1373 if (!heapPtr) return FALSE;
1374 LeaveCriticalSection( &heapPtr->critSection );
1375 return TRUE;
1376 }
1377
1378
1379 /***********************************************************************
1380 * HeapSize (KERNEL32.341)
1381 * RETURNS
1382 * Size in bytes of allocated memory
1383 * 0xffffffff: Failure
1384 */
1385 DWORD WINAPI HeapSize(
1386 HANDLE heap, /* [in] Handle of heap */
1387 DWORD flags, /* [in] Heap size control flags */
1388 LPVOID ptr /* [in] Address of memory to return size for */
1389 ) {
1390 DWORD ret;
1391 HEAP *heapPtr = HEAP_GetPtr( heap );
1392
1393 if (!heapPtr) return FALSE;
1394 flags &= HEAP_NO_SERIALIZE;
1395 flags |= heapPtr->flags;
1396 if (!(flags & HEAP_NO_SERIALIZE)) EnterCriticalSection( &heapPtr->critSection );
1397 if (!HEAP_IsRealArena( heap, HEAP_NO_SERIALIZE, ptr, QUIET ))
1398 {
1399 SetLastError( ERROR_INVALID_PARAMETER );
1400 ret = 0xffffffff;
1401 }
1402 else
1403 {
1404 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr - 1;
1405 ret = pArena->size & ARENA_SIZE_MASK;
1406 }
1407 if (!(flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1408
1409 TRACE("(%08x,%08lx,%08lx): returning %08lx\n",
1410 heap, flags, (DWORD)ptr, ret );
1411 return ret;
1412 }
1413
1414
1415 /***********************************************************************
1416 * HeapValidate (KERNEL32.343)
1417 * Validates a specified heap.
1418 *
1419 * NOTES
1420 * Flags is ignored.
1421 *
1422 * RETURNS
1423 * TRUE: Success
1424 * FALSE: Failure
1425 */
1426 BOOL WINAPI HeapValidate(
1427 HANDLE heap, /* [in] Handle to the heap */
1428 DWORD flags, /* [in] Bit flags that control access during operation */
1429 LPCVOID block /* [in] Optional pointer to memory block to validate */
1430 ) {
1431
1432 return HEAP_IsRealArena( heap, flags, block, QUIET );
1433 }
1434
1435
1436 /***********************************************************************
1437 * HeapWalk (KERNEL32.344)
1438 * Enumerates the memory blocks in a specified heap.
1439 * See HEAP_Dump() for info on heap structure.
1440 *
1441 * TODO
1442 * - handling of PROCESS_HEAP_ENTRY_MOVEABLE and
1443 * PROCESS_HEAP_ENTRY_DDESHARE (needs heap.c support)
1444 *
1445 * RETURNS
1446 * TRUE: Success
1447 * FALSE: Failure
1448 */
1449 BOOL WINAPI HeapWalk(
1450 HANDLE heap, /* [in] Handle to heap to enumerate */
1451 LPPROCESS_HEAP_ENTRY entry /* [out] Pointer to structure of enumeration info */
1452 ) {
1453 HEAP *heapPtr = HEAP_GetPtr(heap);
1454 SUBHEAP *sub, *currentheap = NULL;
1455 BOOL ret = FALSE;
1456 char *ptr;
1457 int region_index = 0;
1458
1459 if (!heapPtr || !entry)
1460 {
1461 SetLastError(ERROR_INVALID_PARAMETER);
1462 return FALSE;
1463 }
1464
1465 if (!(heapPtr->flags & HEAP_NO_SERIALIZE)) EnterCriticalSection( &heapPtr->critSection );
1466
1467 /* set ptr to the next arena to be examined */
1468
1469 if (!entry->lpData) /* first call (init) ? */
1470 {
1471 TRACE("begin walking of heap 0x%08x.\n", heap);
1472 /*HEAP_Dump(heapPtr);*/
1473 currentheap = &heapPtr->subheap;
1474 ptr = (char*)currentheap + currentheap->headerSize;
1475 }
1476 else
1477 {
1478 ptr = entry->lpData;
1479 sub = &heapPtr->subheap;
1480 while (sub)
1481 {
1482 if (((char *)ptr >= (char *)sub) &&
1483 ((char *)ptr < (char *)sub + sub->size))
1484 {
1485 currentheap = sub;
1486 break;
1487 }
1488 sub = sub->next;
1489 region_index++;
1490 }
1491 if (currentheap == NULL)
1492 {
1493 ERR("no matching subheap found, shouldn't happen !\n");
1494 SetLastError(ERROR_NO_MORE_ITEMS);
1495 goto HW_end;
1496 }
1497
1498 ptr += entry->cbData; /* point to next arena */
1499 if (ptr > (char *)currentheap + currentheap->size - 1)
1500 { /* proceed with next subheap */
1501 if (!(currentheap = currentheap->next))
1502 { /* successfully finished */
1503 TRACE("end reached.\n");
1504 SetLastError(ERROR_NO_MORE_ITEMS);
1505 goto HW_end;
1506 }
1507 ptr = (char*)currentheap + currentheap->headerSize;
1508 }
1509 }
1510
1511 entry->wFlags = 0;
1512 if (*(DWORD *)ptr & ARENA_FLAG_FREE)
1513 {
1514 ARENA_FREE *pArena = (ARENA_FREE *)ptr;
1515
1516 /*TRACE("free, magic: %04x\n", pArena->magic);*/
1517
1518 entry->lpData = pArena + 1;
1519 entry->cbData = pArena->size & ARENA_SIZE_MASK;
1520 entry->cbOverhead = sizeof(ARENA_FREE);
1521 entry->wFlags = PROCESS_HEAP_UNCOMMITTED_RANGE;
1522 }
1523 else
1524 {
1525 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
1526
1527 /*TRACE("busy, magic: %04x\n", pArena->magic);*/
1528
1529 entry->lpData = pArena + 1;
1530 entry->cbData = pArena->size & ARENA_SIZE_MASK;
1531 entry->cbOverhead = sizeof(ARENA_INUSE);
1532 entry->wFlags = PROCESS_HEAP_ENTRY_BUSY;
1533 /* FIXME: can't handle PROCESS_HEAP_ENTRY_MOVEABLE
1534 and PROCESS_HEAP_ENTRY_DDESHARE yet */
1535 }
1536
1537 entry->iRegionIndex = region_index;
1538
1539 /* first element of heap ? */
1540 if (ptr == (char *)(currentheap + currentheap->headerSize))
1541 {
1542 entry->wFlags |= PROCESS_HEAP_REGION;
1543 entry->Foo.Region.dwCommittedSize = currentheap->commitSize;
1544 entry->Foo.Region.dwUnCommittedSize =
1545 currentheap->size - currentheap->commitSize;
1546 entry->Foo.Region.lpFirstBlock = /* first valid block */
1547 currentheap + currentheap->headerSize;
1548 entry->Foo.Region.lpLastBlock = /* first invalid block */
1549 currentheap + currentheap->size;
1550 }
1551 ret = TRUE;
1552
1553 HW_end:
1554 if (!(heapPtr->flags & HEAP_NO_SERIALIZE)) LeaveCriticalSection( &heapPtr->critSection );
1555
1556 return ret;
1557 }
1558
1559
1560 /***********************************************************************
1561 * HEAP_CreateSystemHeap
1562 *
1563 * Create the system heap.
1564 */
1565 BOOL HEAP_CreateSystemHeap(void)
1566 {
1567 SYSTEM_HEAP_DESCR *descr;
1568 HANDLE heap;
1569 HEAP *heapPtr;
1570 int created;
1571
1572 HANDLE map = CreateFileMappingA( INVALID_HANDLE_VALUE, NULL, SEC_COMMIT | PAGE_READWRITE,
1573 0, HEAP_DEF_SIZE, "__SystemHeap" );
1574 if (!map) return FALSE;
1575 created = (GetLastError() != ERROR_ALREADY_EXISTS);
1576
1577 if (!(heapPtr = MapViewOfFileEx( map, FILE_MAP_ALL_ACCESS, 0, 0, 0, SYSTEM_HEAP_BASE )))
1578 {
1579 /* pre-defined address not available, use any one */
1580 fprintf( stderr, "Warning: system heap base address %p not available\n",
1581 SYSTEM_HEAP_BASE );
1582 if (!(heapPtr = MapViewOfFile( map, FILE_MAP_ALL_ACCESS, 0, 0, 0 )))
1583 {
1584 CloseHandle( map );
1585 return FALSE;
1586 }
1587 }
1588 heap = (HANDLE)heapPtr;
1589
1590 if (created) /* newly created heap */
1591 {
1592 HEAP_InitSubHeap( heapPtr, heapPtr, HEAP_SHARED, 0, HEAP_DEF_SIZE );
1593 HeapLock( heap );
1594 descr = heapPtr->private = HeapAlloc( heap, HEAP_ZERO_MEMORY, sizeof(*descr) );
1595 assert( descr );
1596 }
1597 else
1598 {
1599 /* wait for the heap to be initialized */
1600 while (!heapPtr->private) Sleep(1);
1601 HeapLock( heap );
1602 /* remap it to the right address if necessary */
1603 if (heapPtr->subheap.heap != heapPtr)
1604 {
1605 void *base = heapPtr->subheap.heap;
1606 HeapUnlock( heap );
1607 UnmapViewOfFile( heapPtr );
1608 if (!(heapPtr = MapViewOfFileEx( map, FILE_MAP_ALL_ACCESS, 0, 0, 0, base )))
1609 {
1610 fprintf( stderr, "Couldn't map system heap at the correct address (%p)\n", base );
1611 CloseHandle( map );
1612 return FALSE;
1613 }
1614 heap = (HANDLE)heapPtr;
1615 HeapLock( heap );
1616 }
1617 descr = heapPtr->private;
1618 assert( descr );
1619 }
1620 SystemHeap = heap;
1621 SystemHeapDescr = descr;
1622 HeapUnlock( heap );
1623 CloseHandle( map );
1624 return TRUE;
1625 }
1626
1627
1628 /***********************************************************************
1629 * GetProcessHeap (KERNEL32.259)
1630 */
1631 HANDLE WINAPI GetProcessHeap(void)
1632 {
1633 return (HANDLE)processHeap;
1634 }
1635
1636
1637 /***********************************************************************
1638 * GetProcessHeaps (KERNEL32.376)
1639 */
1640 DWORD WINAPI GetProcessHeaps( DWORD count, HANDLE *heaps )
1641 {
1642 DWORD total;
1643 HEAP *ptr;
1644
1645 if (!processHeap) return 0; /* should never happen */
1646 total = 1; /* main heap */
1647 EnterCriticalSection( &processHeap->critSection );
1648 for (ptr = firstHeap; ptr; ptr = ptr->next) total++;
1649 if (total <= count)
1650 {
1651 *heaps++ = (HANDLE)processHeap;
1652 for (ptr = firstHeap; ptr; ptr = ptr->next) *heaps++ = (HANDLE)ptr;
1653 }
1654 LeaveCriticalSection( &processHeap->critSection );
1655 return total;
1656 }
1657
1658
1659 /***********************************************************************
1660 * HEAP_strdupA
1661 */
1662 LPSTR HEAP_strdupA( HANDLE heap, DWORD flags, LPCSTR str )
1663 {
1664 LPSTR p = HeapAlloc( heap, flags, strlen(str) + 1 );
1665 if(p) {
1666 SET_EIP(p);
1667 strcpy( p, str );
1668 }
1669 return p;
1670 }
1671
1672
1673 /***********************************************************************
1674 * HEAP_strdupW
1675 */
1676 LPWSTR HEAP_strdupW( HANDLE heap, DWORD flags, LPCWSTR str )
1677 {
1678 INT len = lstrlenW(str) + 1;
1679 LPWSTR p = HeapAlloc( heap, flags, len * sizeof(WCHAR) );
1680 if(p) {
1681 SET_EIP(p);
1682 strcpyW( p, str );
1683 }
1684 return p;
1685 }
1686
1687
1688 /***********************************************************************
1689 * HEAP_strdupAtoW
1690 */
1691 LPWSTR HEAP_strdupAtoW( HANDLE heap, DWORD flags, LPCSTR str )
1692 {
1693 LPWSTR ret;
1694
1695 if (!str) return NULL;
1696 ret = HeapAlloc( heap, flags, (strlen(str)+1) * sizeof(WCHAR) );
1697 if (ret) {
1698 SET_EIP(ret);
1699 lstrcpyAtoW( ret, str );
1700 }
1701 return ret;
1702 }
1703
1704
1705 /***********************************************************************
1706 * HEAP_strdupWtoA
1707 */
1708 LPSTR HEAP_strdupWtoA( HANDLE heap, DWORD flags, LPCWSTR str )
1709 {
1710 LPSTR ret;
1711 INT len;
1712
1713 if (!str) return NULL;
1714 len = WideCharToMultiByte( CP_ACP, 0, str, -1, NULL, 0, NULL, NULL );
1715 ret = HeapAlloc( heap, flags, len );
1716 if(ret) {
1717 SET_EIP(ret);
1718 WideCharToMultiByte( CP_ACP, 0, str, -1, ret, len, NULL, NULL );
1719 }
1720 return ret;
1721 }
1722
1723
1724
1725 /***********************************************************************
1726 * 32-bit local heap functions (Win95; undocumented)
1727 */
1728
1729 #define HTABLE_SIZE 0x10000
1730 #define HTABLE_PAGESIZE 0x1000
1731 #define HTABLE_NPAGES (HTABLE_SIZE / HTABLE_PAGESIZE)
1732
1733 #include "pshpack1.h"
1734 typedef struct _LOCAL32HEADER
1735 {
1736 WORD freeListFirst[HTABLE_NPAGES];
1737 WORD freeListSize[HTABLE_NPAGES];
1738 WORD freeListLast[HTABLE_NPAGES];
1739
1740 DWORD selectorTableOffset;
1741 WORD selectorTableSize;
1742 WORD selectorDelta;
1743
1744 DWORD segment;
1745 LPBYTE base;
1746
1747 DWORD limit;
1748 DWORD flags;
1749
1750 DWORD magic;
1751 HANDLE heap;
1752
1753 } LOCAL32HEADER;
1754 #include "poppack.h"
1755
1756 #define LOCAL32_MAGIC ((DWORD)('L' | ('H'<<8) | ('3'<<16) | ('2'<<24)))
1757
1758 /***********************************************************************
1759 * Local32Init (KERNEL.208)
1760 */
1761 HANDLE WINAPI Local32Init16( WORD segment, DWORD tableSize,
1762 DWORD heapSize, DWORD flags )
1763 {
1764 DWORD totSize, segSize = 0;
1765 LPBYTE base;
1766 LOCAL32HEADER *header;
1767 HEAP *heap;
1768 WORD *selectorTable;
1769 WORD selectorEven, selectorOdd;
1770 int i, nrBlocks;
1771
1772 /* Determine new heap size */
1773
1774 if ( segment )
1775 {
1776 if ( (segSize = GetSelectorLimit16( segment )) == 0 )
1777 return 0;
1778 else
1779 segSize++;
1780 }
1781
1782 if ( heapSize == -1L )
1783 heapSize = 1024L*1024L; /* FIXME */
1784
1785 heapSize = (heapSize + 0xffff) & 0xffff0000;
1786 segSize = (segSize + 0x0fff) & 0xfffff000;
1787 totSize = segSize + HTABLE_SIZE + heapSize;
1788
1789
1790 /* Allocate memory and initialize heap */
1791
1792 if ( !(base = VirtualAlloc( NULL, totSize, MEM_RESERVE, PAGE_READWRITE )) )
1793 return 0;
1794
1795 if ( !VirtualAlloc( base, segSize + HTABLE_PAGESIZE,
1796 MEM_COMMIT, PAGE_READWRITE ) )
1797 {
1798 VirtualFree( base, 0, MEM_RELEASE );
1799 return 0;
1800 }
1801
1802 heap = (HEAP *)(base + segSize + HTABLE_SIZE);
1803 if ( !HEAP_InitSubHeap( heap, (LPVOID)heap, 0, 0x10000, heapSize ) )
1804 {
1805 VirtualFree( base, 0, MEM_RELEASE );
1806 return 0;
1807 }
1808
1809
1810 /* Set up header and handle table */
1811
1812 header = (LOCAL32HEADER *)(base + segSize);
1813 header->base = base;
1814 header->limit = HTABLE_PAGESIZE-1;
1815 header->flags = 0;
1816 header->magic = LOCAL32_MAGIC;
1817 header->heap = (HANDLE)heap;
1818
1819 header->freeListFirst[0] = sizeof(LOCAL32HEADER);
1820 header->freeListLast[0] = HTABLE_PAGESIZE - 4;
1821 header->freeListSize[0] = (HTABLE_PAGESIZE - sizeof(LOCAL32HEADER)) / 4;
1822
1823 for (i = header->freeListFirst[0]; i < header->freeListLast[0]; i += 4)
1824 *(DWORD *)((LPBYTE)header + i) = i+4;
1825
1826 header->freeListFirst[1] = 0xffff;
1827
1828
1829 /* Set up selector table */
1830
1831 nrBlocks = (totSize + 0x7fff) >> 15;
1832 selectorTable = (LPWORD) HeapAlloc( header->heap, 0, nrBlocks * 2 );
1833 selectorEven = SELECTOR_AllocBlock( base, totSize,
1834 SEGMENT_DATA, FALSE, FALSE );
1835 selectorOdd = SELECTOR_AllocBlock( base + 0x8000, totSize - 0x8000,
1836 SEGMENT_DATA, FALSE, FALSE );
1837
1838 if ( !selectorTable || !selectorEven || !selectorOdd )
1839 {
1840 if ( selectorTable ) HeapFree( header->heap, 0, selectorTable );
1841 if ( selectorEven ) SELECTOR_FreeBlock( selectorEven, totSize >> 16 );
1842 if ( selectorOdd ) SELECTOR_FreeBlock( selectorOdd, (totSize-0x8000) >> 16 );
1843 HeapDestroy( header->heap );
1844 VirtualFree( base, 0, MEM_RELEASE );
1845 return 0;
1846 }
1847
1848 header->selectorTableOffset = (LPBYTE)selectorTable - header->base;
1849 header->selectorTableSize = nrBlocks * 4; /* ??? Win95 does it this way! */
1850 header->selectorDelta = selectorEven - selectorOdd;
1851 header->segment = segment? segment : selectorEven;
1852
1853 for (i = 0; i < nrBlocks; i++)
1854 selectorTable[i] = (i & 1)? selectorOdd + ((i >> 1) << __AHSHIFT)
1855 : selectorEven + ((i >> 1) << __AHSHIFT);
1856
1857 /* Move old segment */
1858
1859 if ( segment )
1860 {
1861 /* FIXME: This is somewhat ugly and relies on implementation
1862 details about 16-bit global memory handles ... */
1863
1864 LPBYTE oldBase = (LPBYTE)GetSelectorBase( segment );
1865 memcpy( base, oldBase, segSize );
1866 GLOBAL_MoveBlock( segment, base, totSize );
1867 HeapFree( SystemHeap, 0, oldBase );
1868 }
1869
1870 return (HANDLE)header;
1871 }
1872
1873 /***********************************************************************
1874 * Local32_SearchHandle
1875 */
1876 static LPDWORD Local32_SearchHandle( LOCAL32HEADER *header, DWORD addr )
1877 {
1878 LPDWORD handle;
1879
1880 for ( handle = (LPDWORD)((LPBYTE)header + sizeof(LOCAL32HEADER));
1881 handle < (LPDWORD)((LPBYTE)header + header->limit);
1882 handle++)
1883 {
1884 if (*handle == addr)
1885 return handle;
1886 }
1887
1888 return NULL;
1889 }
1890
1891 /***********************************************************************
1892 * Local32_ToHandle
1893 */
1894 static VOID Local32_ToHandle( LOCAL32HEADER *header, INT16 type,
1895 DWORD addr, LPDWORD *handle, LPBYTE *ptr )
1896 {
1897 *handle = NULL;
1898 *ptr = NULL;
1899
1900 switch (type)
1901 {
1902 case -2: /* 16:16 pointer, no handles */
1903 *ptr = PTR_SEG_TO_LIN( addr );
1904 *handle = (LPDWORD)*ptr;
1905 break;
1906
1907 case -1: /* 32-bit offset, no handles */
1908 *ptr = header->base + addr;
1909 *handle = (LPDWORD)*ptr;
1910 break;
1911
1912 case 0: /* handle */
1913 if ( addr >= sizeof(LOCAL32HEADER)
1914 && addr < header->limit && !(addr & 3)
1915 && *(LPDWORD)((LPBYTE)header + addr) >= HTABLE_SIZE )
1916 {
1917 *handle = (LPDWORD)((LPBYTE)header + addr);
1918 *ptr = header->base + **handle;
1919 }
1920 break;
1921
1922 case 1: /* 16:16 pointer */
1923 *ptr = PTR_SEG_TO_LIN( addr );
1924 *handle = Local32_SearchHandle( header, *ptr - header->base );
1925 break;
1926
1927 case 2: /* 32-bit offset */
1928 *ptr = header->base + addr;
1929 *handle = Local32_SearchHandle( header, *ptr - header->base );
1930 break;
1931 }
1932 }
1933
1934 /***********************************************************************
1935 * Local32_FromHandle
1936 */
1937 static VOID Local32_FromHandle( LOCAL32HEADER *header, INT16 type,
1938 DWORD *addr, LPDWORD handle, LPBYTE ptr )
1939 {
1940 switch (type)
1941 {
1942 case -2: /* 16:16 pointer */
1943 case 1:
1944 {
1945 WORD *selTable = (LPWORD)(header->base + header->selectorTableOffset);
1946 DWORD offset = (LPBYTE)ptr - header->base;
1947 *addr = MAKELONG( offset & 0x7fff, selTable[offset >> 15] );
1948 }
1949 break;
1950
1951 case -1: /* 32-bit offset */
1952 case 2:
1953 *addr = ptr - header->base;
1954 break;
1955
1956 case 0: /* handle */
1957 *addr = (LPBYTE)handle - (LPBYTE)header;
1958 break;
1959 }
1960 }
1961
1962 /***********************************************************************
1963 * Local32Alloc (KERNEL.209)
1964 */
1965 DWORD WINAPI Local32Alloc16( HANDLE heap, DWORD size, INT16 type, DWORD flags )
1966 {
1967 LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
1968 LPDWORD handle;
1969 LPBYTE ptr;
1970 DWORD addr;
1971
1972 /* Allocate memory */
1973 ptr = HeapAlloc( header->heap,
1974 (flags & LMEM_MOVEABLE)? HEAP_ZERO_MEMORY : 0, size );
1975 if (!ptr) return 0;
1976
1977
1978 /* Allocate handle if requested */
1979 if (type >= 0)
1980 {
1981 int page, i;
1982
1983 /* Find first page of handle table with free slots */
1984 for (page = 0; page < HTABLE_NPAGES; page++)
1985 if (header->freeListFirst[page] != 0)
1986 break;
1987 if (page == HTABLE_NPAGES)
1988 {
1989 WARN("Out of handles!\n" );
1990 HeapFree( header->heap, 0, ptr );
1991 return 0;
1992 }
1993
1994 /* If virgin page, initialize it */
1995 if (header->freeListFirst[page] == 0xffff)
1996 {
1997 if ( !VirtualAlloc( (LPBYTE)header + (page << 12),
1998 0x1000, MEM_COMMIT, PAGE_READWRITE ) )
1999 {
2000 WARN("Cannot grow handle table!\n" );
2001 HeapFree( header->heap, 0, ptr );
2002 return 0;
2003 }
2004
2005 header->limit += HTABLE_PAGESIZE;
2006
2007 header->freeListFirst[page] = 0;
2008 header->freeListLast[page] = HTABLE_PAGESIZE - 4;
2009 header->freeListSize[page] = HTABLE_PAGESIZE / 4;
2010
2011 for (i = 0; i < HTABLE_PAGESIZE; i += 4)
2012 *(DWORD *)((LPBYTE)header + i) = i+4;
2013
2014 if (page < HTABLE_NPAGES-1)
2015 header->freeListFirst[page+1] = 0xffff;
2016 }
2017
2018 /* Allocate handle slot from page */
2019 handle = (LPDWORD)((LPBYTE)header + header->freeListFirst[page]);
2020 if (--header->freeListSize[page] == 0)
2021 header->freeListFirst[page] = header->freeListLast[page] = 0;
2022 else
2023 header->freeListFirst[page] = *handle;
2024
2025 /* Store 32-bit offset in handle slot */
2026 *handle = ptr - header->base;
2027 }
2028 else
2029 {
2030 handle = (LPDWORD)ptr;
2031 header->flags |= 1;
2032 }
2033
2034
2035 /* Convert handle to requested output type */
2036 Local32_FromHandle( header, type, &addr, handle, ptr );
2037 return addr;
2038 }
2039
2040 /***********************************************************************
2041 * Local32ReAlloc (KERNEL.210)
2042 */
2043 DWORD WINAPI Local32ReAlloc16( HANDLE heap, DWORD addr, INT16 type,
2044 DWORD size, DWORD flags )
2045 {
2046 LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
2047 LPDWORD handle;
2048 LPBYTE ptr;
2049
2050 if (!addr)
2051 return Local32Alloc16( heap, size, type, flags );
2052
2053 /* Retrieve handle and pointer */
2054 Local32_ToHandle( header, type, addr, &handle, &ptr );
2055 if (!handle) return FALSE;
2056
2057 /* Reallocate memory block */
2058 ptr = HeapReAlloc( header->heap,
2059 (flags & LMEM_MOVEABLE)? HEAP_ZERO_MEMORY : 0,
2060 ptr, size );
2061 if (!ptr) return 0;
2062
2063 /* Modify handle */
2064 if (type >= 0)
2065 *handle = ptr - header->base;
2066 else
2067 handle = (LPDWORD)ptr;
2068
2069 /* Convert handle to requested output type */
2070 Local32_FromHandle( header, type, &addr, handle, ptr );
2071 return addr;
2072 }
2073
2074 /***********************************************************************
2075 * Local32Free (KERNEL.211)
2076 */
2077 BOOL WINAPI Local32Free16( HANDLE heap, DWORD addr, INT16 type )
2078 {
2079 LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
2080 LPDWORD handle;
2081 LPBYTE ptr;
2082
2083 /* Retrieve handle and pointer */
2084 Local32_ToHandle( header, type, addr, &handle, &ptr );
2085 if (!handle) return FALSE;
2086
2087 /* Free handle if necessary */
2088 if (type >= 0)
2089 {
2090 int offset = (LPBYTE)handle - (LPBYTE)header;
2091 int page = offset >> 12;
2092
2093 /* Return handle slot to page free list */
2094 if (header->freeListSize[page]++ == 0)
2095 header->freeListFirst[page] = header->freeListLast[page] = offset;
2096 else
2097 *(LPDWORD)((LPBYTE)header + header->freeListLast[page]) = offset,
2098 header->freeListLast[page] = offset;
2099
2100 *handle = 0;
2101
2102 /* Shrink handle table when possible */
2103 while (page > 0 && header->freeListSize[page] == HTABLE_PAGESIZE / 4)
2104 {
2105 if ( VirtualFree( (LPBYTE)header +
2106 (header->limit & ~(HTABLE_PAGESIZE-1)),
2107 HTABLE_PAGESIZE, MEM_DECOMMIT ) )
2108 break;
2109
2110 header->limit -= HTABLE_PAGESIZE;
2111 header->freeListFirst[page] = 0xffff;
2112 page--;
2113 }
2114 }
2115
2116 /* Free memory */
2117 return HeapFree( header->heap, 0, ptr );
2118 }
2119
2120 /***********************************************************************
2121 * Local32Translate (KERNEL.213)
2122 */
2123 DWORD WINAPI Local32Translate16( HANDLE heap, DWORD addr, INT16 type1, INT16 type2 )
2124 {
2125 LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
2126 LPDWORD handle;
2127 LPBYTE ptr;
2128
2129 Local32_ToHandle( header, type1, addr, &handle, &ptr );
2130 if (!handle) return 0;
2131
2132 Local32_FromHandle( header, type2, &addr, handle, ptr );
2133 return addr;
2134 }
2135
2136 /***********************************************************************
2137 * Local32Size (KERNEL.214)
2138 */
2139 DWORD WINAPI Local32Size16( HANDLE heap, DWORD addr, INT16 type )
2140 {
2141 LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
2142 LPDWORD handle;
2143 LPBYTE ptr;
2144
2145 Local32_ToHandle( header, type, addr, &handle, &ptr );
2146 if (!handle) return 0;
2147
2148 return HeapSize( header->heap, 0, ptr );
2149 }
2150
2151 /***********************************************************************
2152 * Local32ValidHandle (KERNEL.215)
2153 */
2154 BOOL WINAPI Local32ValidHandle16( HANDLE heap, WORD addr )
2155 {
2156 LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
2157 LPDWORD handle;
2158 LPBYTE ptr;
2159
2160 Local32_ToHandle( header, 0, addr, &handle, &ptr );
2161 return handle != NULL;
2162 }
2163
2164 /***********************************************************************
2165 * Local32GetSegment (KERNEL.229)
2166 */
2167 WORD WINAPI Local32GetSegment16( HANDLE heap )
2168 {
2169 LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
2170 return header->segment;
2171 }
2172
2173 /***********************************************************************
2174 * Local32_GetHeap
2175 */
2176 static LOCAL32HEADER *Local32_GetHeap( HGLOBAL16 handle )
2177 {
2178 WORD selector = GlobalHandleToSel16( handle );
2179 DWORD base = GetSelectorBase( selector );
2180 DWORD limit = GetSelectorLimit16( selector );
2181
2182 /* Hmmm. This is a somewhat stupid heuristic, but Windows 95 does
2183 it this way ... */
2184
2185 if ( limit > 0x10000 && ((LOCAL32HEADER *)base)->magic == LOCAL32_MAGIC )
2186 return (LOCAL32HEADER *)base;
2187
2188 base += 0x10000;
2189 limit -= 0x10000;
2190
2191 if ( limit > 0x10000 && ((LOCAL32HEADER *)base)->magic == LOCAL32_MAGIC )
2192 return (LOCAL32HEADER *)base;
2193
2194 return NULL;
2195 }
2196
2197 /***********************************************************************
2198 * Local32Info (KERNEL.444) (TOOLHELP.84)
2199 */
2200 BOOL16 WINAPI Local32Info16( LOCAL32INFO *pLocal32Info, HGLOBAL16 handle )
2201 {
2202 SUBHEAP *heapPtr;
2203 LPBYTE ptr;
2204 int i;
2205
2206 LOCAL32HEADER *header = Local32_GetHeap( handle );
2207 if ( !header ) return FALSE;
2208
2209 if ( !pLocal32Info || pLocal32Info->dwSize < sizeof(LOCAL32INFO) )
2210 return FALSE;
2211
2212 heapPtr = (SUBHEAP *)HEAP_GetPtr( header->heap );
2213 pLocal32Info->dwMemReserved = heapPtr->size;
2214 pLocal32Info->dwMemCommitted = heapPtr->commitSize;
2215 pLocal32Info->dwTotalFree = 0L;
2216 pLocal32Info->dwLargestFreeBlock = 0L;
2217
2218 /* Note: Local32 heaps always have only one subheap! */
2219 ptr = (LPBYTE)heapPtr + heapPtr->headerSize;
2220 while ( ptr < (LPBYTE)heapPtr + heapPtr->size )
2221 {
2222 if (*(DWORD *)ptr & ARENA_FLAG_FREE)
2223 {
2224 ARENA_FREE *pArena = (ARENA_FREE *)ptr;
2225 DWORD size = (pArena->size & ARENA_SIZE_MASK);
2226 ptr += sizeof(*pArena) + size;
2227
2228 pLocal32Info->dwTotalFree += size;
2229 if ( size > pLocal32Info->dwLargestFreeBlock )
2230 pLocal32Info->dwLargestFreeBlock = size;
2231 }
2232 else
2233 {
2234 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
2235 DWORD size = (pArena->size & ARENA_SIZE_MASK);
2236 ptr += sizeof(*pArena) + size;
2237 }
2238 }
2239
2240 pLocal32Info->dwcFreeHandles = 0;
2241 for ( i = 0; i < HTABLE_NPAGES; i++ )
2242 {
2243 if ( header->freeListFirst[i] == 0xffff ) break;
2244 pLocal32Info->dwcFreeHandles += header->freeListSize[i];
2245 }
2246 pLocal32Info->dwcFreeHandles += (HTABLE_NPAGES - i) * HTABLE_PAGESIZE/4;
2247
2248 return TRUE;
2249 }
2250
2251 /***********************************************************************
2252 * Local32First (KERNEL.445) (TOOLHELP.85)
2253 */
2254 BOOL16 WINAPI Local32First16( LOCAL32ENTRY *pLocal32Entry, HGLOBAL16 handle )
2255 {
2256 FIXME("(%p, %04X): stub!\n", pLocal32Entry, handle );
2257 return FALSE;
2258 }
2259
2260 /***********************************************************************
2261 * Local32Next (KERNEL.446) (TOOLHELP.86)
2262 */
2263 BOOL16 WINAPI Local32Next16( LOCAL32ENTRY *pLocal32Entry )
2264 {
2265 FIXME("(%p): stub!\n", pLocal32Entry );
2266 return FALSE;
2267 }
2268
Maarten's multimedia branch