memory/heap.c

   1 /*
   2  * Win32 heap functions
   3  *
   4  * Copyright 1996 Alexandre Julliard
   5  */
   6
   7 #include <stdio.h>
   8 #include <stdlib.h>
   9 #include <string.h>
  10 #include "windows.h"
  11 #include "debugger.h"
  12 #include "selectors.h"
  13 #include "winbase.h"
  14 #include "winerror.h"
  15 #include "winnt.h"
  16 #include "stddebug.h"
  17 #include "debug.h"
  18
  19 /* Note: the heap data structures are based on what Pietrek describes in his
  20  * book 'Windows 95 System Programming Secrets'. The layout is not exactly
  21  * the same, but could be easily adapted if it turns out some programs
  22  * require it.
  23  */
  24
  25 typedef struct tagARENA_INUSE
  26 {
  27     DWORD  size;                    /* Block size; must be the first field */
  28     WORD   threadId;                /* Allocating thread id */
  29     WORD   magic;                   /* Magic number */
  30     DWORD  callerEIP;               /* EIP of caller upon allocation */
  31 } ARENA_INUSE;
  32
  33 typedef struct tagARENA_FREE
  34 {
  35     DWORD                 size;     /* Block size; must be the first field */
  36     WORD                  threadId; /* Freeing thread id */
  37     WORD                  magic;    /* Magic number */
  38     struct tagARENA_FREE *next;     /* Next free arena */
  39     struct tagARENA_FREE *prev;     /* Prev free arena */
  40 } ARENA_FREE;
  41
  42 #define ARENA_FLAG_FREE        0x00000001  /* flags OR'ed with arena size */
  43 #define ARENA_FLAG_PREV_FREE   0x00000002
  44 #define ARENA_SIZE_MASK        0xfffffffc
  45 #define ARENA_INUSE_MAGIC      0x4842      /* Value for arena 'magic' field */
  46 #define ARENA_FREE_MAGIC       0x4846      /* Value for arena 'magic' field */
  47
  48 #define ARENA_INUSE_FILLER     0x55
  49 #define ARENA_FREE_FILLER      0xaa
  50
  51 #define HEAP_NB_FREE_LISTS   4   /* Number of free lists */
  52
  53 /* Max size of the blocks on the free lists */
  54 static const DWORD HEAP_freeListSizes[HEAP_NB_FREE_LISTS] =
  55 {
  56     0x20, 0x80, 0x200, 0xffffffff
  57 };
  58
  59 typedef struct
  60 {
  61     DWORD       size;
  62     ARENA_FREE  arena;
  63 } FREE_LIST_ENTRY;
  64
  65 struct tagHEAP;
  66
  67 typedef struct tagSUBHEAP
  68 {
  69     DWORD               size;       /* Size of the whole sub-heap */
  70     DWORD               commitSize; /* Committed size of the sub-heap */
  71     DWORD               headerSize; /* Size of the heap header */
  72     struct tagSUBHEAP  *next;       /* Next sub-heap */
  73     struct tagHEAP     *heap;       /* Main heap structure */
  74     DWORD               magic;      /* Magic number */
  75     WORD                selector;   /* Selector for HEAP_WINE_SEGPTR heaps */
  76 } SUBHEAP;
  77
  78 #define SUBHEAP_MAGIC    ((DWORD)('S' | ('U'<<8) | ('B'<<16) | ('H'<<24)))
  79
  80 typedef struct tagHEAP
  81 {
  82     SUBHEAP          subheap;       /* First sub-heap */
  83     struct tagHEAP  *next;          /* Next heap for this process */
  84     FREE_LIST_ENTRY  freeList[HEAP_NB_FREE_LISTS];  /* Free lists */
  85     CRITICAL_SECTION critSection;   /* Critical section for serialization */
  86     DWORD            flags;         /* Heap flags */
  87     DWORD            magic;         /* Magic number */
  88 } HEAP;
  89
  90 #define HEAP_MAGIC       ((DWORD)('H' | ('E'<<8) | ('A'<<16) | ('P'<<24)))
  91
  92 #define HEAP_DEF_SIZE        0x110000   /* Default heap size = 1Mb + 64Kb */
  93 #define HEAP_MIN_BLOCK_SIZE  (8+sizeof(ARENA_FREE))  /* Min. heap block size */
  94
  95
  96 /***********************************************************************
  97  *           HEAP_Dump
  98  */
  99 void HEAP_Dump( HEAP *heap )
 100 {
 101     int i;
 102     SUBHEAP *subheap;
 103     char *ptr;
 104
 105     printf( "Heap: %08lx\n", (DWORD)heap );
 106     printf( "Next: %08lx  Sub-heaps: %08lx",
 107             (DWORD)heap->next, (DWORD)&heap->subheap );
 108     subheap = &heap->subheap;
 109     while (subheap->next)
 110     {
 111         printf( " -> %08lx", (DWORD)subheap->next );
 112         subheap = subheap->next;
 113     }
 114
 115     printf( "\nFree lists:\n Block   Stat   Size    Id\n" );
 116     for (i = 0; i < HEAP_NB_FREE_LISTS; i++)
 117         printf( "%08lx free %08lx %04x prev=%08lx next=%08lx\n",
 118                 (DWORD)&heap->freeList[i].arena, heap->freeList[i].arena.size,
 119                 heap->freeList[i].arena.threadId,
 120                 (DWORD)heap->freeList[i].arena.prev,
 121                 (DWORD)heap->freeList[i].arena.next );
 122
 123     subheap = &heap->subheap;
 124     while (subheap)
 125     {
 126         DWORD freeSize = 0, usedSize = 0, arenaSize = subheap->headerSize;
 127         printf( "\n\nSub-heap %08lx: size=%08lx committed=%08lx\n",
 128                 (DWORD)subheap, subheap->size, subheap->commitSize );
 129
 130         printf( "\n Block   Stat   Size    Id\n" );
 131         ptr = (char*)subheap + subheap->headerSize;
 132         while (ptr < (char *)subheap + subheap->size)
 133         {
 134             if (*(DWORD *)ptr & ARENA_FLAG_FREE)
 135             {
 136                 ARENA_FREE *pArena = (ARENA_FREE *)ptr;
 137                 printf( "%08lx free %08lx %04x prev=%08lx next=%08lx\n",
 138                         (DWORD)pArena, pArena->size & ARENA_SIZE_MASK,
 139                         pArena->threadId, (DWORD)pArena->prev,
 140                         (DWORD)pArena->next);
 141                 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
 142                 arenaSize += sizeof(ARENA_FREE);
 143                 freeSize += pArena->size & ARENA_SIZE_MASK;
 144             }
 145             else if (*(DWORD *)ptr & ARENA_FLAG_PREV_FREE)
 146             {
 147                 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
 148                 printf( "%08lx Used %08lx %04x back=%08lx EIP=%08lx\n",
 149                         (DWORD)pArena, pArena->size & ARENA_SIZE_MASK,
 150                         pArena->threadId, *((DWORD *)pArena - 1),
 151                         pArena->callerEIP );
 152                 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
 153                 arenaSize += sizeof(ARENA_INUSE);
 154                 usedSize += pArena->size & ARENA_SIZE_MASK;
 155             }
 156             else
 157             {
 158                 ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
 159                 printf( "%08lx used %08lx %04x EIP=%08lx\n",
 160                         (DWORD)pArena, pArena->size & ARENA_SIZE_MASK,
 161                         pArena->threadId, pArena->callerEIP );
 162                 ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
 163                 arenaSize += sizeof(ARENA_INUSE);
 164                 usedSize += pArena->size & ARENA_SIZE_MASK;
 165             }
 166         }
 167         printf( "\nTotal: Size=%08lx Committed=%08lx Free=%08lx Used=%08lx Arenas=%08lx (%ld%%)\n\n",
 168                 subheap->size, subheap->commitSize, freeSize, usedSize,
 169                 arenaSize, (arenaSize * 100) / subheap->size );
 170         subheap = subheap->next;
 171     }
 172 }
 173
 174
 175 /***********************************************************************
 176  *           HEAP_GetPtr
 177  */
 178 static HEAP *HEAP_GetPtr( HANDLE32 heap )
 179 {
 180     HEAP *heapPtr = (HEAP *)heap;
 181     if (!heapPtr || (heapPtr->magic != HEAP_MAGIC))
 182     {
 183         fprintf( stderr, "Invalid heap %08x!\n", heap );
 184         SetLastError( ERROR_INVALID_HANDLE );
 185         return NULL;
 186     }
 187     if (debugging_heap && !HeapValidate( heap, 0, NULL ))
 188     {
 189         HEAP_Dump( heapPtr );
 190         DEBUG_EnterDebugger();
 191         SetLastError( ERROR_INVALID_HANDLE );
 192         return NULL;
 193     }
 194     return heapPtr;
 195 }
 196
 197
 198 /***********************************************************************
 199  *           HEAP_InsertFreeBlock
 200  *
 201  * Insert a free block into the free list.
 202  */
 203 static void HEAP_InsertFreeBlock( HEAP *heap, ARENA_FREE *pArena )
 204 {
 205     FREE_LIST_ENTRY *pEntry = heap->freeList;
 206     while (pEntry->size < pArena->size) pEntry++;
 207     pArena->size      |= ARENA_FLAG_FREE;
 208     pArena->next       = pEntry->arena.next;
 209     pArena->next->prev = pArena;
 210     pArena->prev       = &pEntry->arena;
 211     pEntry->arena.next = pArena;
 212 }
 213
 214
 215 /***********************************************************************
 216  *           HEAP_FindSubHeap
 217  *
 218  * Find the sub-heap containing a given address.
 219  */
 220 static SUBHEAP *HEAP_FindSubHeap( HEAP *heap, LPCVOID ptr )
 221 {
 222     SUBHEAP *sub = &heap->subheap;
 223     while (sub)
 224     {
 225         if (((char *)ptr >= (char *)sub) &&
 226             ((char *)ptr < (char *)sub + sub->size)) return sub;
 227         sub = sub->next;
 228     }
 229     return NULL;
 230 }
 231
 232
 233 /***********************************************************************
 234  *           HEAP_Commit
 235  *
 236  * Make sure the heap storage is committed up to (not including) ptr.
 237  */
 238 static BOOL32 HEAP_Commit( SUBHEAP *subheap, void *ptr )
 239 {
 240     DWORD size = (DWORD)((char *)ptr - (char *)subheap);
 241     size = (size + 0xfff) & 0xfffff000;  /* Align size on a page boundary */
 242     if (size > subheap->size) size = subheap->size;
 243     if (size <= subheap->commitSize) return TRUE;
 244     if (!VirtualAlloc( (char *)subheap + subheap->commitSize,
 245                        size - subheap->commitSize, MEM_COMMIT,
 246                        PAGE_EXECUTE_READWRITE))
 247     {
 248         fprintf( stderr, "HEAP_Commit: could not commit %08lx bytes at %08lx for heap %08lx\n",
 249                  size - subheap->commitSize,
 250                  (DWORD)((char *)subheap + subheap->commitSize),
 251                  (DWORD)subheap->heap );
 252         return FALSE;
 253     }
 254     subheap->commitSize = size;
 255     return TRUE;
 256 }
 257
 258
 259 /***********************************************************************
 260  *           HEAP_Decommit
 261  *
 262  * If possible, decommit the heap storage from (including) 'ptr'.
 263  */
 264 static BOOL32 HEAP_Decommit( SUBHEAP *subheap, void *ptr )
 265 {
 266     DWORD size = (DWORD)((char *)ptr - (char *)subheap);
 267     size = (size + 0xfff) & 0xfffff000;  /* Align size on a page boundary */
 268     if (size >= subheap->commitSize) return TRUE;
 269     if (!VirtualFree( (char *)subheap + subheap->commitSize,
 270                       size - subheap->commitSize, MEM_DECOMMIT ))
 271     {
 272         fprintf( stderr, "HEAP_Decommit: could not decommit %08lx bytes at %08lx for heap %08lx\n",
 273                  size - subheap->commitSize,
 274                  (DWORD)((char *)subheap + subheap->commitSize),
 275                  (DWORD)subheap->heap );
 276         return FALSE;
 277     }
 278     subheap->commitSize = size;
 279     return TRUE;
 280 }
 281
 282
 283 /***********************************************************************
 284  *           HEAP_CreateFreeBlock
 285  *
 286  * Create a free block at a specified address. 'size' is the size of the
 287  * whole block, including the new arena.
 288  */
 289 static void HEAP_CreateFreeBlock( SUBHEAP *subheap, void *ptr, DWORD size )
 290 {
 291     ARENA_FREE *pFree;
 292
 293     /* Create a free arena */
 294
 295     pFree = (ARENA_FREE *)ptr;
 296     pFree->threadId = GetCurrentTask();
 297     pFree->magic = ARENA_FREE_MAGIC;
 298
 299     /* If debugging, erase the freed block content */
 300
 301     if (debugging_heap)
 302     {
 303         char *pEnd = (char *)ptr + size;
 304         if (pEnd > (char *)subheap + subheap->commitSize)
 305             pEnd = (char *)subheap + subheap->commitSize;
 306         if (pEnd > (char *)(pFree + 1))
 307             memset( pFree + 1, ARENA_FREE_FILLER, pEnd - (char *)(pFree + 1) );
 308     }
 309
 310     /* Check if next block is free also */
 311
 312     if (((char *)ptr + size < (char *)subheap + subheap->size) &&
 313         (*(DWORD *)((char *)ptr + size) & ARENA_FLAG_FREE))
 314     {
 315         /* Remove the next arena from the free list */
 316         ARENA_FREE *pNext = (ARENA_FREE *)((char *)ptr + size);
 317         pNext->next->prev = pNext->prev;
 318         pNext->prev->next = pNext->next;
 319         size += (pNext->size & ARENA_SIZE_MASK) + sizeof(*pNext);
 320         if (debugging_heap)
 321             memset( pNext, ARENA_FREE_FILLER, sizeof(ARENA_FREE) );
 322     }
 323
 324     /* Set the next block PREV_FREE flag and pointer */
 325
 326     if ((char *)ptr + size < (char *)subheap + subheap->size)
 327     {
 328         DWORD *pNext = (DWORD *)((char *)ptr + size);
 329         *pNext |= ARENA_FLAG_PREV_FREE;
 330         *(ARENA_FREE **)(pNext - 1) = pFree;
 331     }
 332
 333     /* Last, insert the new block into the free list */
 334
 335     pFree->size = size - sizeof(*pFree);
 336     HEAP_InsertFreeBlock( subheap->heap, pFree );
 337 }
 338
 339
 340 /***********************************************************************
 341  *           HEAP_MakeInUseBlockFree
 342  *
 343  * Turn an in-use block into a free block. Can also decommit the end of
 344  * the heap, and possibly even free the sub-heap altogether.
 345  */
 346 static void HEAP_MakeInUseBlockFree( SUBHEAP *subheap, ARENA_INUSE *pArena )
 347 {
 348     ARENA_FREE *pFree;
 349     DWORD size = (pArena->size & ARENA_SIZE_MASK) + sizeof(*pArena);
 350
 351     /* Check if we can merge with previous block */
 352
 353     if (pArena->size & ARENA_FLAG_PREV_FREE)
 354     {
 355         pFree = *((ARENA_FREE **)pArena - 1);
 356         size += (pFree->size & ARENA_SIZE_MASK) + sizeof(ARENA_FREE);
 357         /* Remove it from the free list */
 358         pFree->next->prev = pFree->prev;
 359         pFree->prev->next = pFree->next;
 360     }
 361     else pFree = (ARENA_FREE *)pArena;
 362
 363     /* Create a free block */
 364
 365     HEAP_CreateFreeBlock( subheap, pFree, size );
 366     size = (pFree->size & ARENA_SIZE_MASK) + sizeof(ARENA_FREE);
 367     if ((char *)pFree + size < (char *)subheap + subheap->size)
 368         return;  /* Not the last block, so nothing more to do */
 369
 370     /* Free the whole sub-heap if it's empty and not the original one */
 371
 372     if (((char *)pFree == (char *)subheap + subheap->headerSize) &&
 373         (subheap != &subheap->heap->subheap))
 374     {
 375         SUBHEAP *pPrev = &subheap->heap->subheap;
 376         /* Remove the free block from the list */
 377         pFree->next->prev = pFree->prev;
 378         pFree->prev->next = pFree->next;
 379         /* Remove the subheap from the list */
 380         while (pPrev && (pPrev->next != subheap)) pPrev = pPrev->next;
 381         if (pPrev) pPrev->next = subheap->next;
 382         /* Free the memory */
 383         subheap->magic = 0;
 384         if (subheap->selector) FreeSelector( subheap->selector );
 385         VirtualFree( subheap, subheap->size, MEM_DECOMMIT );
 386         VirtualFree( subheap, 0, MEM_RELEASE );
 387         return;
 388     }
 389
 390     /* Decommit the end of the heap */
 391
 392     HEAP_Decommit( subheap, pFree + 1 );
 393 }
 394
 395
 396 /***********************************************************************
 397  *           HEAP_ShrinkBlock
 398  *
 399  * Shrink an in-use block.
 400  */
 401 static void HEAP_ShrinkBlock(SUBHEAP *subheap, ARENA_INUSE *pArena, DWORD size)
 402 {
 403     if ((pArena->size & ARENA_SIZE_MASK) >= size + HEAP_MIN_BLOCK_SIZE)
 404     {
 405         HEAP_CreateFreeBlock( subheap, (char *)(pArena + 1) + size,
 406                               (pArena->size & ARENA_SIZE_MASK) - size );
 407         pArena->size = (pArena->size & ~ARENA_SIZE_MASK) | size;
 408     }
 409     else
 410     {
 411         /* Turn off PREV_FREE flag in next block */
 412         char *pNext = (char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK);
 413         if (pNext < (char *)subheap + subheap->size)
 414             *(DWORD *)pNext &= ~ARENA_FLAG_PREV_FREE;
 415     }
 416 }
 417
 418
 419 /***********************************************************************
 420  *           HEAP_CreateSubHeap
 421  *
 422  * Create a sub-heap of the given size.
 423  */
 424 static SUBHEAP *HEAP_CreateSubHeap( DWORD flags, DWORD commitSize,
 425                                     DWORD totalSize )
 426 {
 427     SUBHEAP *subheap;
 428     WORD selector = 0;
 429
 430     /* Round-up sizes on a 64K boundary */
 431
 432     if (flags & HEAP_WINE_SEGPTR)
 433     {
 434         totalSize = commitSize = 0x10000;  /* Only 64K at a time for SEGPTRs */
 435     }
 436     else
 437     {
 438         totalSize  = (totalSize + 0xffff) & 0xffff0000;
 439         commitSize = (commitSize + 0xffff) & 0xffff0000;
 440         if (!commitSize) commitSize = 0x10000;
 441         if (totalSize < commitSize) totalSize = commitSize;
 442     }
 443
 444     /* Allocate the memory block */
 445
 446     if (!(subheap = VirtualAlloc( NULL, totalSize,
 447                                   MEM_RESERVE, PAGE_EXECUTE_READWRITE )))
 448     {
 449         fprintf( stderr, "HEAP_CreateSubHeap: could not VirtualAlloc %08lx bytes\n",
 450                  totalSize );
 451         return NULL;
 452     }
 453     if (!VirtualAlloc(subheap, commitSize, MEM_COMMIT, PAGE_EXECUTE_READWRITE))
 454     {
 455         fprintf( stderr, "HEAP_CreateSubHeap: could not commit %08lx bytes for sub-heap %08lx\n",
 456                  commitSize, (DWORD)subheap );
 457         VirtualFree( subheap, 0, MEM_RELEASE );
 458         return NULL;
 459     }
 460
 461     /* Allocate a selector if needed */
 462
 463     if (flags & HEAP_WINE_SEGPTR)
 464     {
 465         selector = SELECTOR_AllocBlock( subheap, totalSize,
 466                      (flags & HEAP_WINE_CODESEG) ? SEGMENT_CODE : SEGMENT_DATA,
 467                      (flags & HEAP_WINE_CODESEG) != 0, FALSE );
 468         if (!selector)
 469         {
 470             fprintf( stderr, "HEAP_CreateSubHeap: could not allocate selector\n" );
 471             VirtualFree( subheap, 0, MEM_RELEASE );
 472             return NULL;
 473         }
 474     }
 475
 476     /* Fill the sub-heap structure */
 477
 478     subheap->size       = totalSize;
 479     subheap->commitSize = commitSize;
 480     subheap->headerSize = sizeof(*subheap);
 481     subheap->next       = NULL;
 482     subheap->heap       = NULL;
 483     subheap->magic      = SUBHEAP_MAGIC;
 484     subheap->selector   = selector;
 485     return subheap;
 486 }
 487
 488
 489 /***********************************************************************
 490  *           HEAP_FindFreeBlock
 491  *
 492  * Find a free block at least as large as the requested size, and make sure
 493  * the requested size is committed.
 494  */
 495 static ARENA_FREE *HEAP_FindFreeBlock( HEAP *heap, DWORD size,
 496                                        SUBHEAP **ppSubHeap )
 497 {
 498     SUBHEAP *subheap;
 499     ARENA_FREE *pArena;
 500     FREE_LIST_ENTRY *pEntry = heap->freeList;
 501
 502     /* Find a suitable free list, and in it find a block large enough */
 503
 504     while (pEntry->size < size) pEntry++;
 505     pArena = pEntry->arena.next;
 506     while (pArena != &heap->freeList[0].arena)
 507     {
 508         if (pArena->size > size)
 509         {
 510             subheap = HEAP_FindSubHeap( heap, pArena );
 511             if (!HEAP_Commit( subheap, (char *)pArena + sizeof(ARENA_INUSE)
 512                                                + size + HEAP_MIN_BLOCK_SIZE))
 513                 return NULL;
 514             *ppSubHeap = subheap;
 515             return pArena;
 516         }
 517
 518         pArena = pArena->next;
 519     }
 520
 521     /* If no block was found, attempt to grow the heap */
 522
 523     if (!(heap->flags & HEAP_GROWABLE))
 524     {
 525         fprintf( stderr, "HEAP_FindFreeBlock: Not enough space in heap %08lx for %08lx bytes\n",
 526                  (DWORD)heap, size );
 527         return NULL;
 528     }
 529     size += sizeof(SUBHEAP) + sizeof(ARENA_FREE);
 530     if (!(subheap = HEAP_CreateSubHeap( heap->flags, size,
 531                                         MAX( HEAP_DEF_SIZE, size ) )))
 532         return NULL;
 533
 534     /* Insert the new sub-heap in the list */
 535
 536     subheap->heap = heap;
 537     subheap->next = heap->subheap.next;
 538     heap->subheap.next = subheap;
 539     size = subheap->size;
 540     dprintf_heap( stddeb, "HEAP_FindFreeBlock: created new sub-heap %08lx of %08lx bytes for heap %08lx\n",
 541                   (DWORD)subheap, size, (DWORD)heap );
 542
 543     HEAP_CreateFreeBlock( subheap, subheap + 1, size - sizeof(*subheap) );
 544     *ppSubHeap = subheap;
 545     return (ARENA_FREE *)(subheap + 1);
 546 }
 547
 548
 549 /***********************************************************************
 550  *           HEAP_IsValidArenaPtr
 551  *
 552  * Check that the pointer is inside the range possible for arenas.
 553  */
 554 static BOOL32 HEAP_IsValidArenaPtr( HEAP *heap, void *ptr )
 555 {
 556     int i;
 557     SUBHEAP *subheap = HEAP_FindSubHeap( heap, ptr );
 558     if (!subheap) return FALSE;
 559     if ((char *)ptr >= (char *)subheap + subheap->headerSize) return TRUE;
 560     if (subheap != &heap->subheap) return FALSE;
 561     for (i = 0; i < HEAP_NB_FREE_LISTS; i++)
 562         if (ptr == (void *)&heap->freeList[i].arena) return TRUE;
 563     return FALSE;
 564 }
 565
 566
 567 /***********************************************************************
 568  *           HEAP_ValidateFreeArena
 569  */
 570 static BOOL32 HEAP_ValidateFreeArena( SUBHEAP *subheap, ARENA_FREE *pArena )
 571 {
 572     char *heapEnd = (char *)subheap + subheap->size;
 573
 574     /* Check magic number */
 575     if (pArena->magic != ARENA_FREE_MAGIC)
 576     {
 577         fprintf( stderr, "Heap %08lx: invalid free arena magic for %08lx\n",
 578                  (DWORD)subheap->heap, (DWORD)pArena );
 579         return FALSE;
 580     }
 581     /* Check size flags */
 582     if (!(pArena->size & ARENA_FLAG_FREE) ||
 583         (pArena->size & ARENA_FLAG_PREV_FREE))
 584     {
 585         fprintf( stderr, "Heap %08lx: bad flags %lx for free arena %08lx\n",
 586                  (DWORD)subheap->heap, pArena->size & ~ARENA_SIZE_MASK, (DWORD)pArena );
 587     }
 588     /* Check arena size */
 589     if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) > heapEnd)
 590     {
 591         fprintf( stderr, "Heap %08lx: bad size %08lx for free arena %08lx\n",
 592                  (DWORD)subheap->heap, (DWORD)pArena->size & ARENA_SIZE_MASK, (DWORD)pArena );
 593         return FALSE;
 594     }
 595     /* Check that next pointer is valid */
 596     if (!HEAP_IsValidArenaPtr( subheap->heap, pArena->next ))
 597     {
 598         fprintf( stderr, "Heap %08lx: bad next ptr %08lx for arena %08lx\n",
 599                  (DWORD)subheap->heap, (DWORD)pArena->next, (DWORD)pArena );
 600         return FALSE;
 601     }
 602     /* Check that next arena is free */
 603     if (!(pArena->next->size & ARENA_FLAG_FREE) ||
 604         (pArena->next->magic != ARENA_FREE_MAGIC))
 605     {
 606         fprintf( stderr, "Heap %08lx: next arena %08lx invalid for %08lx\n",
 607                  (DWORD)subheap->heap, (DWORD)pArena->next, (DWORD)pArena );
 608         return FALSE;
 609     }
 610     /* Check that prev pointer is valid */
 611     if (!HEAP_IsValidArenaPtr( subheap->heap, pArena->prev ))
 612     {
 613         fprintf( stderr, "Heap %08lx: bad prev ptr %08lx for arena %08lx\n",
 614                  (DWORD)subheap->heap, (DWORD)pArena->prev, (DWORD)pArena );
 615         return FALSE;
 616     }
 617     /* Check that prev arena is free */
 618     if (!(pArena->prev->size & ARENA_FLAG_FREE) ||
 619         (pArena->prev->magic != ARENA_FREE_MAGIC))
 620     {
 621         fprintf( stderr, "Heap %08lx: prev arena %08lx invalid for %08lx\n",
 622                  (DWORD)subheap->heap, (DWORD)pArena->prev, (DWORD)pArena );
 623         return FALSE;
 624     }
 625     /* Check that next block has PREV_FREE flag */
 626     if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) < heapEnd)
 627     {
 628         if (!(*(DWORD *)((char *)(pArena + 1) +
 629             (pArena->size & ARENA_SIZE_MASK)) & ARENA_FLAG_PREV_FREE))
 630         {
 631             fprintf( stderr, "Heap %08lx: free arena %08lx next block has no PREV_FREE flag\n",
 632                      (DWORD)subheap->heap, (DWORD)pArena );
 633             return FALSE;
 634         }
 635         /* Check next block back pointer */
 636         if (*((ARENA_FREE **)((char *)(pArena + 1) +
 637             (pArena->size & ARENA_SIZE_MASK)) - 1) != pArena)
 638         {
 639             fprintf( stderr, "Heap %08lx: arena %08lx has wrong back ptr %08lx\n",
 640                      (DWORD)subheap->heap, (DWORD)pArena,
 641                      *((DWORD *)((char *)(pArena+1)+ (pArena->size & ARENA_SIZE_MASK)) - 1));
 642             return FALSE;
 643         }
 644     }
 645     return TRUE;
 646 }
 647
 648
 649 /***********************************************************************
 650  *           HEAP_ValidateInUseArena
 651  */
 652 static BOOL32 HEAP_ValidateInUseArena( SUBHEAP *subheap, ARENA_INUSE *pArena )
 653 {
 654     char *heapEnd = (char *)subheap + subheap->size;
 655
 656     /* Check magic number */
 657     if (pArena->magic != ARENA_INUSE_MAGIC)
 658     {
 659         fprintf( stderr, "Heap %08lx: invalid in-use arena magic for %08lx\n",
 660                  (DWORD)subheap->heap, (DWORD)pArena );
 661         return FALSE;
 662     }
 663     /* Check size flags */
 664     if (pArena->size & ARENA_FLAG_FREE)
 665     {
 666         fprintf( stderr, "Heap %08lx: bad flags %lx for in-use arena %08lx\n",
 667                  (DWORD)subheap->heap, pArena->size & ~ARENA_SIZE_MASK, (DWORD)pArena );
 668     }
 669     /* Check arena size */
 670     if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) > heapEnd)
 671     {
 672         fprintf( stderr, "Heap %08lx: bad size %08lx for in-use arena %08lx\n",
 673                  (DWORD)subheap->heap, (DWORD)pArena->size & ARENA_SIZE_MASK, (DWORD)pArena );
 674         return FALSE;
 675     }
 676     /* Check next arena PREV_FREE flag */
 677     if (((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) < heapEnd) &&
 678         (*(DWORD *)((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK)) & ARENA_FLAG_PREV_FREE))
 679     {
 680         fprintf( stderr, "Heap %08lx: in-use arena %08lx next block has PREV_FREE flag\n",
 681                  (DWORD)subheap->heap, (DWORD)pArena );
 682         return FALSE;
 683     }
 684     /* Check prev free arena */
 685     if (pArena->size & ARENA_FLAG_PREV_FREE)
 686     {
 687         ARENA_FREE *pPrev = *((ARENA_FREE **)pArena - 1);
 688         /* Check prev pointer */
 689         if (!HEAP_IsValidArenaPtr( subheap->heap, pPrev ))
 690         {
 691             fprintf(stderr, "Heap %08lx: bad back ptr %08lx for arena %08lx\n",
 692                     (DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
 693             return FALSE;
 694         }
 695         /* Check that prev arena is free */
 696         if (!(pPrev->size & ARENA_FLAG_FREE) ||
 697             (pPrev->magic != ARENA_FREE_MAGIC))
 698         {
 699             fprintf( stderr, "Heap %08lx: prev arena %08lx invalid for in-use %08lx\n",
 700                      (DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
 701             return FALSE;
 702         }
 703         /* Check that prev arena is really the previous block */
 704         if ((char *)(pPrev + 1) + (pPrev->size & ARENA_SIZE_MASK) != (char *)pArena)
 705         {
 706             fprintf( stderr, "Heap %08lx: prev arena %08lx is not prev for in-use %08lx\n",
 707                      (DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
 708             return FALSE;
 709         }
 710     }
 711     return TRUE;
 712 }
 713
 714
 715 /***********************************************************************
 716  *           HEAP_IsInsideHeap
 717  *
 718  * Check whether the pointer is to a block inside a given heap.
 719  */
 720 int HEAP_IsInsideHeap( HANDLE32 heap, DWORD flags, LPCVOID ptr )
 721 {
 722     HEAP *heapPtr = HEAP_GetPtr( heap );
 723     SUBHEAP *subheap;
 724     int ret;
 725
 726     /* Validate the parameters */
 727
 728     if (!heapPtr) return 0;
 729     flags |= heapPtr->flags;
 730     if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
 731     ret = (((subheap = HEAP_FindSubHeap( heapPtr, ptr )) != NULL) &&
 732            (((char *)ptr >= (char *)subheap + subheap->headerSize
 733                               + sizeof(ARENA_INUSE))));
 734     if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 735     return ret;
 736 }
 737
 738
 739 /***********************************************************************
 740  *           HEAP_GetSegptr
 741  *
 742  * Transform a linear pointer into a SEGPTR. The pointer must have been
 743  * allocated from a HEAP_WINE_SEGPTR heap.
 744  */
 745 SEGPTR HEAP_GetSegptr( HANDLE32 heap, DWORD flags, LPCVOID ptr )
 746 {
 747     HEAP *heapPtr = HEAP_GetPtr( heap );
 748     SUBHEAP *subheap;
 749     SEGPTR ret;
 750
 751     /* Validate the parameters */
 752
 753     if (!heapPtr) return 0;
 754     flags |= heapPtr->flags;
 755     if (!(flags & HEAP_WINE_SEGPTR))
 756     {
 757         fprintf( stderr, "HEAP_GetSegptr: heap %08x is not a SEGPTR heap\n",
 758                  heap );
 759         return 0;
 760     }
 761     if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
 762
 763     /* Get the subheap */
 764
 765     if (!(subheap = HEAP_FindSubHeap( heapPtr, ptr )))
 766     {
 767         fprintf( stderr, "HEAP_GetSegptr: %p is not inside heap %08x\n",
 768                  ptr, heap );
 769         if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 770         return 0;
 771     }
 772
 773     /* Build the SEGPTR */
 774
 775     ret = PTR_SEG_OFF_TO_SEGPTR(subheap->selector, (DWORD)ptr-(DWORD)subheap);
 776     if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 777     return ret;
 778 }
 779
 780
 781 /***********************************************************************
 782  *           HeapCreate   (KERNEL32.336)
 783  */
 784 HANDLE32 HeapCreate( DWORD flags, DWORD initialSize, DWORD maxSize )
 785 {
 786     int i;
 787     HEAP *heap;
 788     SUBHEAP *subheap;
 789     FREE_LIST_ENTRY *pEntry;
 790
 791     /* Allocate the heap block */
 792
 793     if (!maxSize)
 794     {
 795         maxSize = HEAP_DEF_SIZE;
 796         flags |= HEAP_GROWABLE;
 797     }
 798     if (!(subheap = HEAP_CreateSubHeap( flags, initialSize, maxSize )))
 799     {
 800         SetLastError( ERROR_OUTOFMEMORY );
 801         return 0;
 802     }
 803
 804     /* Fill the heap structure */
 805
 806     heap = (HEAP *)subheap;
 807     subheap->heap       = heap;
 808     subheap->headerSize = sizeof(HEAP);
 809     heap->next          = NULL;
 810     heap->flags         = flags;
 811     heap->magic         = HEAP_MAGIC;
 812     InitializeCriticalSection( &heap->critSection );
 813
 814     /* Build the free lists */
 815
 816     for (i = 0, pEntry = heap->freeList; i < HEAP_NB_FREE_LISTS; i++, pEntry++)
 817     {
 818         pEntry->size           = HEAP_freeListSizes[i];
 819         pEntry->arena.size     = 0 | ARENA_FLAG_FREE;
 820         pEntry->arena.next     = i < HEAP_NB_FREE_LISTS-1 ?
 821                          &heap->freeList[i+1].arena : &heap->freeList[0].arena;
 822         pEntry->arena.prev     = i ? &heap->freeList[i-1].arena :
 823                                    &heap->freeList[HEAP_NB_FREE_LISTS-1].arena;
 824         pEntry->arena.threadId = 0;
 825         pEntry->arena.magic    = ARENA_FREE_MAGIC;
 826     }
 827
 828     /* Create the first free block */
 829
 830     HEAP_CreateFreeBlock( subheap, heap + 1, subheap->size - sizeof(*heap) );
 831
 832     /* We are done */
 833
 834     SetLastError( 0 );
 835     return (HANDLE32)heap;
 836 }
 837
 838
 839 /***********************************************************************
 840  *           HeapDestroy   (KERNEL32.337)
 841  */
 842 BOOL32 HeapDestroy( HANDLE32 heap )
 843 {
 844     HEAP *heapPtr = HEAP_GetPtr( heap );
 845     SUBHEAP *subheap;
 846
 847     dprintf_heap( stddeb, "HeapDestroy: %08x\n", heap );
 848     if (!heapPtr) return FALSE;
 849
 850     DeleteCriticalSection( &heapPtr->critSection );
 851     subheap = &heapPtr->subheap;
 852     while (subheap)
 853     {
 854         SUBHEAP *next = subheap->next;
 855         if (subheap->selector) FreeSelector( subheap->selector );
 856         VirtualFree( subheap, subheap->commitSize, MEM_DECOMMIT );
 857         VirtualFree( subheap, 0, MEM_RELEASE );
 858         subheap = next;
 859     }
 860     return TRUE;
 861 }
 862
 863
 864 /***********************************************************************
 865  *           HeapAlloc   (KERNEL32.334)
 866  */
 867 LPVOID HeapAlloc( HANDLE32 heap, DWORD flags, DWORD size )
 868 {
 869     ARENA_FREE *pArena;
 870     ARENA_INUSE *pInUse;
 871     SUBHEAP *subheap;
 872     HEAP *heapPtr = HEAP_GetPtr( heap );
 873
 874     /* Validate the parameters */
 875
 876     if (!heapPtr) return NULL;
 877     flags &= HEAP_GENERATE_EXCEPTIONS | HEAP_NO_SERIALIZE | HEAP_ZERO_MEMORY;
 878     flags |= heapPtr->flags;
 879     if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
 880     size = (size + 3) & ~3;
 881     if (size < HEAP_MIN_BLOCK_SIZE) size = HEAP_MIN_BLOCK_SIZE;
 882
 883     /* Locate a suitable free block */
 884
 885     if (!(pArena = HEAP_FindFreeBlock( heapPtr, size, &subheap )))
 886     {
 887         dprintf_heap( stddeb, "HeapAlloc(%08x,%08lx,%08lx): returning NULL\n",
 888                   heap, flags, size  );
 889         if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 890         SetLastError( ERROR_OUTOFMEMORY );
 891         return NULL;
 892     }
 893
 894     /* Remove the arena from the free list */
 895
 896     pArena->next->prev = pArena->prev;
 897     pArena->prev->next = pArena->next;
 898
 899     /* Build the in-use arena */
 900
 901     pInUse = (ARENA_INUSE *)pArena;
 902     pInUse->size      = (pInUse->size & ~ARENA_FLAG_FREE)
 903                         + sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
 904     pInUse->callerEIP = *((DWORD *)&heap - 1);  /* hack hack */
 905     pInUse->threadId  = GetCurrentTask();
 906     pInUse->magic     = ARENA_INUSE_MAGIC;
 907
 908     /* Shrink the block */
 909
 910     HEAP_ShrinkBlock( subheap, pInUse, size );
 911
 912     if (flags & HEAP_ZERO_MEMORY) memset( pInUse + 1, 0, size );
 913     else if (debugging_heap) memset( pInUse + 1, ARENA_INUSE_FILLER, size );
 914
 915     if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 916     SetLastError( 0 );
 917
 918     dprintf_heap( stddeb, "HeapAlloc(%08x,%08lx,%08lx): returning %08lx\n",
 919                   heap, flags, size, (DWORD)(pInUse + 1) );
 920     return (LPVOID)(pInUse + 1);
 921 }
 922
 923
 924 /***********************************************************************
 925  *           HeapFree   (KERNEL32.338)
 926  */
 927 BOOL32 HeapFree( HANDLE32 heap, DWORD flags, LPVOID ptr )
 928 {
 929     ARENA_INUSE *pInUse;
 930     SUBHEAP *subheap;
 931     HEAP *heapPtr = HEAP_GetPtr( heap );
 932
 933     /* Validate the parameters */
 934
 935     if (!heapPtr) return FALSE;
 936     flags &= HEAP_NO_SERIALIZE;
 937     flags |= heapPtr->flags;
 938     if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
 939     if (!ptr || !HeapValidate( heap, HEAP_NO_SERIALIZE, ptr ))
 940     {
 941         if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 942         SetLastError( ERROR_INVALID_PARAMETER );
 943         dprintf_heap( stddeb, "HeapFree(%08x,%08lx,%08lx): returning FALSE\n",
 944                       heap, flags, (DWORD)ptr );
 945         return FALSE;
 946     }
 947
 948     /* Turn the block into a free block */
 949
 950     pInUse  = (ARENA_INUSE *)ptr - 1;
 951     subheap = HEAP_FindSubHeap( heapPtr, pInUse );
 952     HEAP_MakeInUseBlockFree( subheap, pInUse );
 953
 954     if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 955     SetLastError( 0 );
 956
 957     dprintf_heap( stddeb, "HeapFree(%08x,%08lx,%08lx): returning TRUE\n",
 958                   heap, flags, (DWORD)ptr );
 959     return TRUE;
 960 }
 961
 962
 963 /***********************************************************************
 964  *           HeapReAlloc   (KERNEL32.340)
 965  */
 966 LPVOID HeapReAlloc( HANDLE32 heap, DWORD flags, LPVOID ptr, DWORD size )
 967 {
 968     ARENA_INUSE *pArena;
 969     DWORD oldSize;
 970     HEAP *heapPtr;
 971     SUBHEAP *subheap;
 972
 973     if (!ptr) return HeapAlloc( heap, flags, size );  /* FIXME: correct? */
 974     if (!(heapPtr = HEAP_GetPtr( heap ))) return FALSE;
 975
 976     /* Validate the parameters */
 977
 978     flags &= HEAP_GENERATE_EXCEPTIONS | HEAP_NO_SERIALIZE | HEAP_ZERO_MEMORY |
 979              HEAP_REALLOC_IN_PLACE_ONLY;
 980     flags |= heapPtr->flags;
 981     size = (size + 3) & ~3;
 982     if (size < HEAP_MIN_BLOCK_SIZE) size = HEAP_MIN_BLOCK_SIZE;
 983
 984     if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
 985     if (!HeapValidate( heap, HEAP_NO_SERIALIZE, ptr ))
 986     {
 987         if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
 988         SetLastError( ERROR_INVALID_PARAMETER );
 989         dprintf_heap( stddeb, "HeapReAlloc(%08x,%08lx,%08lx,%08lx): returning NULL\n",
 990                       heap, flags, (DWORD)ptr, size );
 991         return NULL;
 992     }
 993
 994     /* Check if we need to grow the block */
 995
 996     pArena = (ARENA_INUSE *)ptr - 1;
 997     pArena->threadId = GetCurrentTask();
 998     subheap = HEAP_FindSubHeap( heapPtr, pArena );
 999     oldSize = (pArena->size & ARENA_SIZE_MASK);
1000     if (size > oldSize)
1001     {
1002         char *pNext = (char *)(pArena + 1) + oldSize;
1003         if ((pNext < (char *)subheap + subheap->size) &&
1004             (*(DWORD *)pNext & ARENA_FLAG_FREE) &&
1005             (oldSize + (*(DWORD *)pNext & ARENA_SIZE_MASK) + sizeof(ARENA_FREE) >= size))
1006         {
1007             /* The next block is free and large enough */
1008             ARENA_FREE *pFree = (ARENA_FREE *)pNext;
1009             pFree->next->prev = pFree->prev;
1010             pFree->prev->next = pFree->next;
1011             pArena->size += (pFree->size & ARENA_SIZE_MASK) + sizeof(*pFree);
1012             if (!HEAP_Commit( subheap, (char *)pArena + sizeof(ARENA_INUSE)
1013                                                + size + HEAP_MIN_BLOCK_SIZE))
1014             {
1015                 if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
1016                 SetLastError( ERROR_OUTOFMEMORY );
1017                 return NULL;
1018             }
1019             HEAP_ShrinkBlock( subheap, pArena, size );
1020         }
1021         else  /* Do it the hard way */
1022         {
1023             ARENA_FREE *pNew;
1024             ARENA_INUSE *pInUse;
1025             SUBHEAP *newsubheap;
1026
1027             if ((flags & HEAP_REALLOC_IN_PLACE_ONLY) ||
1028                 !(pNew = HEAP_FindFreeBlock( heapPtr, size, &newsubheap )))
1029             {
1030                 if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
1031                 SetLastError( ERROR_OUTOFMEMORY );
1032                 return NULL;
1033             }
1034
1035             /* Build the in-use arena */
1036
1037             pNew->next->prev = pNew->prev;
1038             pNew->prev->next = pNew->next;
1039             pInUse = (ARENA_INUSE *)pNew;
1040             pInUse->size     = (pInUse->size & ~ARENA_FLAG_FREE)
1041                                + sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
1042             pInUse->threadId = GetCurrentTask();
1043             pInUse->magic    = ARENA_INUSE_MAGIC;
1044             HEAP_ShrinkBlock( newsubheap, pInUse, size );
1045             memcpy( pInUse + 1, pArena + 1, oldSize );
1046
1047             /* Free the previous block */
1048
1049             HEAP_MakeInUseBlockFree( subheap, pArena );
1050             subheap = newsubheap;
1051             pArena  = pInUse;
1052         }
1053     }
1054     else HEAP_ShrinkBlock( subheap, pArena, size );  /* Shrink the block */
1055
1056     /* Clear the extra bytes if needed */
1057
1058     if (size > oldSize)
1059     {
1060         if (flags & HEAP_ZERO_MEMORY)
1061             memset( (char *)(pArena + 1) + oldSize, 0,
1062                     (pArena->size & ARENA_SIZE_MASK) - oldSize );
1063         else if (debugging_heap)
1064             memset( (char *)(pArena + 1) + oldSize, ARENA_INUSE_FILLER,
1065                     (pArena->size & ARENA_SIZE_MASK) - oldSize );
1066     }
1067
1068     /* Return the new arena */
1069
1070     pArena->callerEIP = *((DWORD *)&heap - 1);  /* hack hack */
1071     if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
1072
1073     dprintf_heap( stddeb, "HeapReAlloc(%08x,%08lx,%08lx,%08lx): returning %08lx\n",
1074                   heap, flags, (DWORD)ptr, size, (DWORD)(pArena + 1) );
1075     return (LPVOID)(pArena + 1);
1076 }
1077
1078
1079 /***********************************************************************
1080  *           HeapCompact   (KERNEL32.335)
1081  */
1082 DWORD HeapCompact( HANDLE32 heap, DWORD flags )
1083 {
1084     return 0;
1085 }
1086
1087
1088 /***********************************************************************
1089  *           HeapLock   (KERNEL32.339)
1090  */
1091 BOOL32 HeapLock( HANDLE32 heap )
1092 {
1093     HEAP *heapPtr = HEAP_GetPtr( heap );
1094
1095     if (!heapPtr) return FALSE;
1096     EnterCriticalSection( &heapPtr->critSection );
1097     return TRUE;
1098 }
1099
1100
1101 /***********************************************************************
1102  *           HeapUnlock   (KERNEL32.342)
1103  */
1104 BOOL32 HeapUnlock( HANDLE32 heap )
1105 {
1106     HEAP *heapPtr = HEAP_GetPtr( heap );
1107
1108     if (!heapPtr) return FALSE;
1109     LeaveCriticalSection( &heapPtr->critSection );
1110     return TRUE;
1111 }
1112
1113
1114 /***********************************************************************
1115  *           HeapSize   (KERNEL32.341)
1116  */
1117 DWORD HeapSize( HANDLE32 heap, DWORD flags, LPVOID ptr )
1118 {
1119     DWORD ret;
1120     HEAP *heapPtr = HEAP_GetPtr( heap );
1121
1122     if (!heapPtr) return FALSE;
1123     flags &= HEAP_NO_SERIALIZE;
1124     flags |= heapPtr->flags;
1125     if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
1126     if (!HeapValidate( heap, HEAP_NO_SERIALIZE, ptr ))
1127     {
1128         SetLastError( ERROR_INVALID_PARAMETER );
1129         ret = 0xffffffff;
1130     }
1131     else
1132     {
1133         ARENA_INUSE *pArena = (ARENA_INUSE *)ptr - 1;
1134         ret = pArena->size & ARENA_SIZE_MASK;
1135     }
1136     if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
1137
1138     dprintf_heap( stddeb, "HeapSize(%08x,%08lx,%08lx): returning %08lx\n",
1139                   heap, flags, (DWORD)ptr, ret );
1140     return ret;
1141 }
1142
1143
1144 /***********************************************************************
1145  *           HeapValidate   (KERNEL32.343)
1146  */
1147 BOOL32 HeapValidate( HANDLE32 heap, DWORD flags, LPVOID block )
1148 {
1149     SUBHEAP *subheap;
1150     HEAP *heapPtr = (HEAP *)heap;
1151
1152     if (!heapPtr || (heapPtr->magic != HEAP_MAGIC))
1153     {
1154         fprintf( stderr, "Invalid heap %08x!\n", heap );
1155         return FALSE;
1156     }
1157
1158     if (block)
1159     {
1160         if (!(subheap = HEAP_FindSubHeap( heapPtr, block )) ||
1161             ((char *)block < (char *)subheap + subheap->headerSize
1162                               + sizeof(ARENA_INUSE)))
1163         {
1164             fprintf( stderr, "Heap %08lx: block %08lx is not inside heap\n",
1165                      (DWORD)heap, (DWORD)block );
1166             return FALSE;
1167         }
1168         return HEAP_ValidateInUseArena( subheap, (ARENA_INUSE *)block - 1 );
1169     }
1170
1171     subheap = &heapPtr->subheap;
1172     while (subheap)
1173     {
1174         char *ptr = (char *)subheap + subheap->headerSize;
1175         while (ptr < (char *)subheap + subheap->size)
1176         {
1177             if (*(DWORD *)ptr & ARENA_FLAG_FREE)
1178             {
1179                 if (!HEAP_ValidateFreeArena( subheap, (ARENA_FREE *)ptr ))
1180                     return FALSE;
1181                 ptr += sizeof(ARENA_FREE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
1182             }
1183             else
1184             {
1185                 if (!HEAP_ValidateInUseArena( subheap, (ARENA_INUSE *)ptr ))
1186                     return FALSE;
1187                 ptr += sizeof(ARENA_INUSE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
1188             }
1189         }
1190         subheap = subheap->next;
1191     }
1192     return TRUE;
1193 }
1194
1195
1196 /***********************************************************************
1197  *           HeapWalk   (KERNEL32.344)
1198  */
1199 BOOL32 HeapWalk( HANDLE32 heap, void *entry )
1200 {
1201     fprintf( stderr, "HeapWalk(%08x): not implemented\n", heap );
1202     return FALSE;
1203 }
1204
1205
1206 /***********************************************************************
1207  *           HEAP_strdupA
1208  */
1209 LPSTR HEAP_strdupA( HANDLE32 heap, DWORD flags, LPCSTR str )
1210 {
1211     INT32 len = lstrlen32A(str) + 1;
1212     LPSTR p = HeapAlloc( heap, flags, len );
1213     lstrcpy32A( p, str );
1214     return p;
1215 }
1216
1217
1218 /***********************************************************************
1219  *           HEAP_strdupW
1220  */
1221 LPWSTR HEAP_strdupW( HANDLE32 heap, DWORD flags, LPCWSTR str )
1222 {
1223     INT32 len = lstrlen32W(str) + 1;
1224     LPWSTR p = HeapAlloc( heap, flags, len * sizeof(WCHAR) );
1225     lstrcpy32W( p, str );
1226     return p;
1227 }
1228
1229
1230 /***********************************************************************
1231  *           HEAP_strdupAtoW
1232  */
1233 LPWSTR HEAP_strdupAtoW( HANDLE32 heap, DWORD flags, LPCSTR str )
1234 {
1235     LPWSTR ret;
1236
1237     if (!str) return NULL;
1238     if (!(ret = HeapAlloc( heap, flags, (lstrlen32A(str)+1) * sizeof(WCHAR) )))
1239     {
1240         fprintf( stderr, "Virtual memory exhausted.\n" );
1241         exit(1);
1242     }
1243     lstrcpyAtoW( ret, str );
1244     return ret;
1245 }
1246
1247
1248 /***********************************************************************
1249  *           HEAP_strdupWtoA
1250  */
1251 LPSTR HEAP_strdupWtoA( HANDLE32 heap, DWORD flags, LPCWSTR str )
1252 {
1253     LPSTR ret;
1254
1255     if (!str) return NULL;
1256     if (!(ret = HeapAlloc( heap, flags, lstrlen32W(str) + 1 )))
1257     {
1258         fprintf( stderr, "Virtual memory exhausted.\n" );
1259         exit(1);
1260     }
1261     lstrcpyWtoA( ret, str );
1262     return ret;
1263 }