mirror of
git://source.winehq.org/git/wine.git
synced 2024-10-05 01:24:05 +00:00
d30dfd24d6
Sun Sep 27 14:25:38 1998 Petter Reinholdtsen <pere@td.org.uit.no> * [files/drive.c] Make sure GetDriveType32A() handles param NULL. Added some doc on function. Sun Sep 27 14:07:26 1998 Huw D M Davies <daviesh@abacus.physics.ox.ac.uk> * [controls/edit.c] [windows/win.c] Don't call SetWindowLong() in EDIT_WM_NCREATE. Fix SetWindowLong(GWL_[EX]STYLE) to work for 16bit windows. Remove UpdateWindow() call. Sun Sep 27 13:41:22 1998 Alexandre Julliard <julliard@lrc.epfl.ch> * [scheduler/*.c] [server/event.c] [server/mutex.c] [server/semaphore.c] Implemented server-side synchronisation objects. Sun Sep 27 01:13:35 1998 Alex Priem <alexp@sci.kun.nl> * [dlls/comctl32/treeview.c] [include/treeview.h] [include/comctl.h] Treeview implementation. * [dlls/comctl32/trackbar.c] [include/trackbar.h] Trackbar implementation. Sat Sep 26 20:49:13 1998 Ulrich Weigand <weigand@informatik.uni-erlangen.de> * [if1632/thunk.c] [tools/build.c] [win32/kernel32.c] Bugfix: several problems with flat thunks fixed. * [memory/selector.c] Bugfix: IsBad...Ptr16 didn't work for limit_in_pages segments. * [scheduler/thread.c] Bugfix: CreateThread: Allow id parameter == NULL. * [objects/gdiobj.c] Bugfix: IsGDIObject: Return correct object type for stock objects. * [msdos/dpmi.c] Bugfix: fixed typo in INT_DoRealModeInt. * [msdos/int21.c] Bugfix: int21 READ *must* use WIN16_hread, not _hread16. * [if1632/kernel.spec] [if1632/dummy.c] [if1632/thunk.c] [loader/ne/module.c] [scheduler/event.c] [scheduler/synchro.c] [scheduler/thread.c] [win32/kernel32.c] [win32/ordinals.c] Added names/stubs for all undocumented KERNEL routines (Win95). Added the following undoc. 16-bit equivalents to Win32 routines: KERNEL.441-443,449-453,456-462,471-476,479-486,488. Added stubs for some other KERNEL routines. * [memory/heap.c] [memory/global.c] [include/global.h] Implemented Local32... 32-bit local heap routines (KERNEL.208-215, 229). * [miscemu/instr.c] [loader/module.c] [include/module.h] Implemented __GP fault handling and HasGPHandler (KERNEL.338). * [misc/error.c] Implemented LogParamErrorRegs (KERNEL.327). * [loader/task.c] [include/windows.h] Implemented GetCodeInfo (KERNEL.104). * [loader/task.c] [scheduler/thread.c] [include/thread.h] Implemented [GS]etThreadQueue and [GS]etFastQueue (KERNEL.463/4, 624/5). * [if1632/gdi.spec] [objects/dc.c] [objects/dib.c] [objects/bitmap.c] [include/windows.h] Bugfix: fixed wrong parameter for CreateDIBSection16. Added [GS]etDIBColorTable16, stub for GetBoundsRect16. Partially implemented BITMAP_GetObject16 for DIBs. * [if1632/gdi.spec] [relay32/gdi32.spec] [objects/palette.c] Added some GDI stubs. * [if1632/Makefile.in] [if1632/display.spec] [if1632/mouse.spec] [if1632/keyboard.spec] [if1632/builtin.c] [windows/keyboard.c] Added some stubs for Win16 drivers: KEYBOARD, MOUSE, DISPLAY. * [if1632/wprocs.spec] [msdos/vxd.c] Added some stubs for VxDs: VMM, ConfigMG, TimerAPI. * [msdos/int2f.c] Added some stubs for real-mode network drivers. Sat Sep 26 18:18:18 1998 Marcus Meissner <marcus@jet.franken.de> * [configure.in] Merged in some more of the FreeBSD ports/emulators/wine patches. (Maintainer(s) of this port: You can just submit these patches to Alexandre directly.) * [loader/pe_image.c] Check filesize of image against size derived from header to spot truncated executeables without crashing. * [files/directory.c] Set envvar "COMSPEC". One win32(!!) program crashes without it. * [multimedia/mmio.c] Added mmioSetInfo32. * [include/file.h] Return STD_ERROR_HANDLE for AUX and PRT dos handles. * [loader/module.c] Handle executeables with spaces in their names a bit better in CreateProcess. * [relay32/msvfw32.spec][if1632/msvideo.spec][multimedia/msvideo.c][include/vfw.h] Started on MS Video support (can load Win32 ICMs). * [tools/testrun] A bit smarter use of ps. * [memory/virtual.c] Report PAGE_GUARDed pages as PAGE_PROTECTED (AutoCAD LT R17 fails without that check (since Win95 doesn't know about PAGE_GUARD)). Sat Sep 26 15:04:05 1998 Ove Kaaven <ovek@arcticnet.no> * [include/miscemu.h] [if1632/builtin.c] [loader/task.c] [miscemu/instr.c] [msdos/dpmi.c] [msdos/int21.c] [msdos/interrupts.c] [windows/user.c] INT_[S|G]etHandler was renamed to INT_[S|G]etPMHandler. Added handlers to deal with real-mode interrupts; DOS programs are now able to hook real-mode interrupts. * [loader/dos/module.c] [msdos/dosmem.c] [msdos/int21.c] Moved real-mode interrupt table initialization to msdos/dosmem.c, and made new V86 tasks get a full copy of the existing "system memory" instead of almost empty space. Misc fixes. * [include/dosexe.h] [loader/dos/module.c] [msdos/dpmi.c] [msdos/int2f.c] First shot at letting DOS programs start up DPMI (but DPMI is still disabled for DOS programs, for pkunzip's sake). * [include/debugger.h] [debugger/break.c] [debugger/dbg.y] [debugger/registers.c] [debugger/memory.c] [debugger/info.c] [loader/dos/dosvm.c] First shot at making Wine's debugger work for DOS programs. The -debug flag works, as do "nexti" and "stepi". Sat Sep 26 13:13:13 1998 Juergen Schmied <juergen.schmied@metronet.de> * [dlls/shell32/dataobject.c] New classes IEnumFORMATETC implemented, IDataObject stubs. * [dlls/shell32/*.*][relay32/shell32.spec] Bugfixes. New: ICM_InsertItem(), ILCreateFromPath(). Implemented: ILCloneFirst(). Stubs: ILIsEqual(), ILFindChild(), SHLogILFromFSIL(), PathMatchSpec(), PathIsExe(). Changed: ILGetSize(), _ILIsDesktop(), PathCombine(). * [include/shlobj.h] New SHLGUID's New structures: DVTARGETDEVICE32, STGMEDIUM32, FORMATETC32, CLIPFORMAT32. New interfaces: IEnumFORMATETC, IDataObject, ICommDlgBrowser IDockingWindowFrame, IServiceProvider. * [dlls/shell32/folders.c] Stubs for IShellLink. * [loader/resource.c] Small fixes. * [misc/crtdll.c][relay32/crtdll.spec] New __dllonexit(). * [windows/message.c] SendNotifyMessageA, SendMessageCallBack32A half implemented. * [controls/edit.c] EDIT_WM_SetText set EF_UPDATE flag not for ES_MULTILINE. * [files/file.c] Handling of fileposition fixed. Fri Sep 25 18:13:30 1998 Patrik Stridvall <ps@leissner.se> * [include/windows.h] [include/wintypes.h] [ole/ole2nls.h] [relay32/kernel32.spec] Implemented EnumDateFormats and EnumTimeFormats. Only adds US English support. * [Makefile.in] [configure.in] [dlls/Makefile.in] [dlls/psapi/Makefile.in] [dlls/psapi/psapi_main.c] New files to implement stubs for PSAPI.DLL (NT only). * [relay32/Makefile.in] [relay32/builtin32.c] [relay32/psapi.spec] New spec file for PSAPI.DLL (NT only). * [scheduler/handle.c] HANDLE_GetObjPtr should only interpret the pseudo handles as the current thread or the current process if a thread or a process is requested. * [include/winversion.h] [misc/version.c] Adds the global function VERSION_GetVersion() so functions can have different behavior depending on the -winver flag. * [include/oledlg.h] [ole/oledlg.c] Minor fixes. * [windows/winproc.c] Minor changes. * [include/imm.h] [misc/imm.c] Now returns correct values under both Windows 95 and NT 4.0. Thu Sep 24 22:11:44 1998 Kristian Nielsen <kristian.nielsen@risoe.dk> * [configure.in] [include/acconfig.h] [include/thread.h] [scheduler/sysdeps.c] Autoconfig test for non-reentrant libc. Wed Sep 23 19:52:12 1998 Matthew Becker <mbecker@glasscity.net> * [*/*.c] Miscellaneous documentation updates and debugging output standardizations. * [objects/clipping.c] Added ExtSelectClipRgn. Wed Sep 23 00:03:28 EDT 1998 Pete Ratzlaff <pratzlaff@cfa.harvard.edu> * [include/windows.h] [if1632/user.spec] [relay32/user32.spec] [windows/keyboard.c] Added, marginally implemented, GetKeyboardLayoutName(). Only returns US English keyboard name. Tue Sep 22 16:32:41 1998 Marcel Baur <mbaur@iiic.ethz.ch> * [programs/control/*] New Winelib application. Mon Sep 21 00:29:18 1998 Peter Hunnisett <hunnise@nortel.ca> * [include/dplay.h][multimedia/dplay.c][ole/compobj.c] Added all DirectPlayLobby interfaces and enhanced DirectPlay and DirectPlayLobby support. Still not all that much. Useful enough if you just need to start a program, don't try any real dplay/lobby stuff. * [documentation/status/directplay] Added a very little bit. * [graphics/ddraw.c] - Call to SetWindowLong32A wasn't working because there was no memory set aside when the window class was registered. - Fixed some xlib reference counting and change the behaviour of DirectDrawSurface3_SetPalette to mimic observed behaviour (palette is associated will all backbuffers) - Also stored all palette colour fields and spit back our saved colour fields rather than query X for them. - Added plenty of AddRef and Release traces. - Added Xlib support for using -desktop option. - Fixed Xlib message handling. Messages weren't being passed to the application. Fixes mouse movements in some xlib DDraw games. - Added a few stubs. * [windows/win.c][include/winerror.h] Fixed up some error handling in WIN_SetWindowLong. SetLastError wasn't being used. Could cause problems with 0 return codes. Added new error in winerror (1400). * [AUTHORS] [include/authors.h] Added myself as a Wine author. Sun Sep 20 21:22:44 1998 Alexander Larsson <alla@lysator.liu.se> * [loader/module.c] Changed GetModuleFileName32A so that is returns the long version of the filename. Note that just the name is long, not the directories. Sat Sep 19 20:05:30 1998 Per Ångström <pang@mind.nu> * [controls/menu.c] Made a couple of fixes to make life easier for applications that alter their menus at runtime. * [windows/defdlg.c] Removed the cast of the return value from dialog procedures to a 16-bit bool. The return value needs to retain all its 32 bits, since it is not always a bool, such as when responding to the WM_NCHITTEST message. Fri Sep 18 11:30:38 1998 Sergey Turchanov <turchanov@usa.net> * [loader/resource.c] Fixed very funny bug (though gravely affecting further excecution) with FindResource[Ex]32 functions. * [include/multimon.h] [windows/multimon.c] [relay32/user32.spec] [include/windows.h] [windows/sysmetrics.c] Default implementation for Multimonitor API. * [include/windows.h] [windows/winpos.c] Fixed incorrect declaration (and behaviour) of GetWindowRect32. Wed Sep 16 10:21:15 1998 Gerard Patel <G.Patel@Wanadoo.fr> * [controls/edit.c] Fixed EDIT_EM_GetLine to use correctly length of lines. Tue Sep 15 20:40:16 1998 Eric Kohl <ekohl@abo.rhein-zeitung.de> * [misc/tweak.c][include/tweak.h][controls/menu.c] Replaced the tweak graphic routines by calls to DrawEdge32(). * [misc/tweak.c][include/tweak.h][documentation/win95look] [wine.ini][*/*] Changed "look and feel" selection. Allows Win3.1, Win95 and Win98 (no GUI code implemented) look and feel. * [dlls/comctl32/header.c][include/header.h][include/commctrl.h] Started callback item support and did some minor improvements. * [dlls/comctl32/imagelist.c] Fixed bug in transparent image display. ImageList_GetIcon is still buggy :-( * [dlls/comctl32/toolbar.c] Fixed button drawing (partial hack). * [dlls/comctl32/commctrl.c] Fixed MenuHelp(). * [controls/button.c] Added 3d effect for groupbox. * [windows/msgbox.c] Added font support for message boxes. * [windows/nonclient.c] Fixed window moving bug. * [dlls/comctl32/*.c] Various improvements. * [dlls/comctl32/listview.c][dlls/comctl32/rebar.c] [include/commctrl.h] More messages. * [windows/syscolor.c][include/windows.h] Introduced new Win98 system colors. Tue Sep 15 18:29:45 1998 Wesley Filardo <eightknots@aol.com> * [files/profile.c] Added support in PROFILE_LoadWineIni for -config option * [misc/main.c] [include/options.h] Added -config option. Tue Sep 15 18:22:26 1998 Petter Reinholdtsen <pere@td.org.uit.no> * [documentation/Makefile.in] Make sure directory exists before installing into it. Tue Sep 15 01:47:33 1998 Pablo Saratxaga <pablo.sarachaga@ping.be> * [ole/nls/*] [ole/ole2nls.c] [include/winnls.h] Fixed a few errors and completed some NLS files. Mon Sep 14 01:23:45 1998 Joseph Pranevich <knight@baltimore.wwaves.com> * [include/miscemu.h] [msdos/interrupts.c] Removed a compilation warning, added INT 25 to the list of interrupts callable from DOS applications, added a debug message when unsupported interrupts are used. Sun Sep 13 19:55:22 1998 Lawson Whitney <lawson_whitney@juno.com> * [if1632/relay.c] CallProcEx32W should not reverse arguments. Sun Aug 17 21:18:12 1998 Eric Pouech <eric.pouech@lemel.fr> * [multimedia/midi.c] [multimedia/init.c] [multimedia/mmsys.c] [include/multimedia.h] [include/mmsystem.h] [multimedia/Makefile.in] [multimedia/midipatch.c] [if1632/multimedia.spec] Made MIDI input and output functional on OSS capable systems. * [multimedia/timer.c] Changes to trigger callbacks at the accurate pace even when fake timers are used.
1829 lines
56 KiB
C
1829 lines
56 KiB
C
/*
|
|
* Win32 heap functions
|
|
*
|
|
* Copyright 1996 Alexandre Julliard
|
|
* Copyright 1998 Ulrich Weigand
|
|
*/
|
|
|
|
#include <assert.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "windows.h"
|
|
#include "selectors.h"
|
|
#include "global.h"
|
|
#include "winbase.h"
|
|
#include "winerror.h"
|
|
#include "winnt.h"
|
|
#include "heap.h"
|
|
#include "debug.h"
|
|
|
|
/* Note: the heap data structures are based on what Pietrek describes in his
|
|
* book 'Windows 95 System Programming Secrets'. The layout is not exactly
|
|
* the same, but could be easily adapted if it turns out some programs
|
|
* require it.
|
|
*/
|
|
|
|
typedef struct tagARENA_INUSE
|
|
{
|
|
DWORD size; /* Block size; must be the first field */
|
|
WORD threadId; /* Allocating thread id */
|
|
WORD magic; /* Magic number */
|
|
DWORD callerEIP; /* EIP of caller upon allocation */
|
|
} ARENA_INUSE;
|
|
|
|
typedef struct tagARENA_FREE
|
|
{
|
|
DWORD size; /* Block size; must be the first field */
|
|
WORD threadId; /* Freeing thread id */
|
|
WORD magic; /* Magic number */
|
|
struct tagARENA_FREE *next; /* Next free arena */
|
|
struct tagARENA_FREE *prev; /* Prev free arena */
|
|
} ARENA_FREE;
|
|
|
|
#define ARENA_FLAG_FREE 0x00000001 /* flags OR'ed with arena size */
|
|
#define ARENA_FLAG_PREV_FREE 0x00000002
|
|
#define ARENA_SIZE_MASK 0xfffffffc
|
|
#define ARENA_INUSE_MAGIC 0x4842 /* Value for arena 'magic' field */
|
|
#define ARENA_FREE_MAGIC 0x4846 /* Value for arena 'magic' field */
|
|
|
|
#define ARENA_INUSE_FILLER 0x55
|
|
#define ARENA_FREE_FILLER 0xaa
|
|
|
|
#define HEAP_NB_FREE_LISTS 4 /* Number of free lists */
|
|
|
|
/* Max size of the blocks on the free lists */
|
|
static const DWORD HEAP_freeListSizes[HEAP_NB_FREE_LISTS] =
|
|
{
|
|
0x20, 0x80, 0x200, 0xffffffff
|
|
};
|
|
|
|
typedef struct
|
|
{
|
|
DWORD size;
|
|
ARENA_FREE arena;
|
|
} FREE_LIST_ENTRY;
|
|
|
|
struct tagHEAP;
|
|
|
|
typedef struct tagSUBHEAP
|
|
{
|
|
DWORD size; /* Size of the whole sub-heap */
|
|
DWORD commitSize; /* Committed size of the sub-heap */
|
|
DWORD headerSize; /* Size of the heap header */
|
|
struct tagSUBHEAP *next; /* Next sub-heap */
|
|
struct tagHEAP *heap; /* Main heap structure */
|
|
DWORD magic; /* Magic number */
|
|
WORD selector; /* Selector for HEAP_WINE_SEGPTR heaps */
|
|
} SUBHEAP;
|
|
|
|
#define SUBHEAP_MAGIC ((DWORD)('S' | ('U'<<8) | ('B'<<16) | ('H'<<24)))
|
|
|
|
typedef struct tagHEAP
|
|
{
|
|
SUBHEAP subheap; /* First sub-heap */
|
|
struct tagHEAP *next; /* Next heap for this process */
|
|
FREE_LIST_ENTRY freeList[HEAP_NB_FREE_LISTS]; /* Free lists */
|
|
CRITICAL_SECTION critSection; /* Critical section for serialization */
|
|
DWORD flags; /* Heap flags */
|
|
DWORD magic; /* Magic number */
|
|
} HEAP;
|
|
|
|
#define HEAP_MAGIC ((DWORD)('H' | ('E'<<8) | ('A'<<16) | ('P'<<24)))
|
|
|
|
#define HEAP_DEF_SIZE 0x110000 /* Default heap size = 1Mb + 64Kb */
|
|
#define HEAP_MIN_BLOCK_SIZE (8+sizeof(ARENA_FREE)) /* Min. heap block size */
|
|
|
|
HANDLE32 SystemHeap = 0;
|
|
HANDLE32 SegptrHeap = 0;
|
|
CRITICAL_SECTION *HEAP_SystemLock = NULL;
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_Dump
|
|
*/
|
|
void HEAP_Dump( HEAP *heap )
|
|
{
|
|
int i;
|
|
SUBHEAP *subheap;
|
|
char *ptr;
|
|
|
|
DUMP( "Heap: %08lx\n", (DWORD)heap );
|
|
DUMP( "Next: %08lx Sub-heaps: %08lx",
|
|
(DWORD)heap->next, (DWORD)&heap->subheap );
|
|
subheap = &heap->subheap;
|
|
while (subheap->next)
|
|
{
|
|
DUMP( " -> %08lx", (DWORD)subheap->next );
|
|
subheap = subheap->next;
|
|
}
|
|
|
|
DUMP( "\nFree lists:\n Block Stat Size Id\n" );
|
|
for (i = 0; i < HEAP_NB_FREE_LISTS; i++)
|
|
DUMP( "%08lx free %08lx %04x prev=%08lx next=%08lx\n",
|
|
(DWORD)&heap->freeList[i].arena, heap->freeList[i].arena.size,
|
|
heap->freeList[i].arena.threadId,
|
|
(DWORD)heap->freeList[i].arena.prev,
|
|
(DWORD)heap->freeList[i].arena.next );
|
|
|
|
subheap = &heap->subheap;
|
|
while (subheap)
|
|
{
|
|
DWORD freeSize = 0, usedSize = 0, arenaSize = subheap->headerSize;
|
|
DUMP( "\n\nSub-heap %08lx: size=%08lx committed=%08lx\n",
|
|
(DWORD)subheap, subheap->size, subheap->commitSize );
|
|
|
|
DUMP( "\n Block Stat Size Id\n" );
|
|
ptr = (char*)subheap + subheap->headerSize;
|
|
while (ptr < (char *)subheap + subheap->size)
|
|
{
|
|
if (*(DWORD *)ptr & ARENA_FLAG_FREE)
|
|
{
|
|
ARENA_FREE *pArena = (ARENA_FREE *)ptr;
|
|
DUMP( "%08lx free %08lx %04x prev=%08lx next=%08lx\n",
|
|
(DWORD)pArena, pArena->size & ARENA_SIZE_MASK,
|
|
pArena->threadId, (DWORD)pArena->prev,
|
|
(DWORD)pArena->next);
|
|
ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
|
|
arenaSize += sizeof(ARENA_FREE);
|
|
freeSize += pArena->size & ARENA_SIZE_MASK;
|
|
}
|
|
else if (*(DWORD *)ptr & ARENA_FLAG_PREV_FREE)
|
|
{
|
|
ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
|
|
DUMP( "%08lx Used %08lx %04x back=%08lx EIP=%08lx\n",
|
|
(DWORD)pArena, pArena->size & ARENA_SIZE_MASK,
|
|
pArena->threadId, *((DWORD *)pArena - 1),
|
|
pArena->callerEIP );
|
|
ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
|
|
arenaSize += sizeof(ARENA_INUSE);
|
|
usedSize += pArena->size & ARENA_SIZE_MASK;
|
|
}
|
|
else
|
|
{
|
|
ARENA_INUSE *pArena = (ARENA_INUSE *)ptr;
|
|
DUMP( "%08lx used %08lx %04x EIP=%08lx\n",
|
|
(DWORD)pArena, pArena->size & ARENA_SIZE_MASK,
|
|
pArena->threadId, pArena->callerEIP );
|
|
ptr += sizeof(*pArena) + (pArena->size & ARENA_SIZE_MASK);
|
|
arenaSize += sizeof(ARENA_INUSE);
|
|
usedSize += pArena->size & ARENA_SIZE_MASK;
|
|
}
|
|
}
|
|
DUMP( "\nTotal: Size=%08lx Committed=%08lx Free=%08lx Used=%08lx Arenas=%08lx (%ld%%)\n\n",
|
|
subheap->size, subheap->commitSize, freeSize, usedSize,
|
|
arenaSize, (arenaSize * 100) / subheap->size );
|
|
subheap = subheap->next;
|
|
}
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_GetPtr
|
|
* RETURNS
|
|
* Pointer to the heap
|
|
* NULL: Failure
|
|
*/
|
|
static HEAP *HEAP_GetPtr(
|
|
HANDLE32 heap /* [in] Handle to the heap */
|
|
) {
|
|
HEAP *heapPtr = (HEAP *)heap;
|
|
if (!heapPtr || (heapPtr->magic != HEAP_MAGIC))
|
|
{
|
|
WARN(heap, "Invalid heap %08x!\n", heap );
|
|
SetLastError( ERROR_INVALID_HANDLE );
|
|
return NULL;
|
|
}
|
|
if (TRACE_ON(heap) && !HeapValidate( heap, 0, NULL ))
|
|
{
|
|
HEAP_Dump( heapPtr );
|
|
assert( FALSE );
|
|
SetLastError( ERROR_INVALID_HANDLE );
|
|
return NULL;
|
|
}
|
|
return heapPtr;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_InsertFreeBlock
|
|
*
|
|
* Insert a free block into the free list.
|
|
*/
|
|
static void HEAP_InsertFreeBlock( HEAP *heap, ARENA_FREE *pArena )
|
|
{
|
|
FREE_LIST_ENTRY *pEntry = heap->freeList;
|
|
while (pEntry->size < pArena->size) pEntry++;
|
|
pArena->size |= ARENA_FLAG_FREE;
|
|
pArena->next = pEntry->arena.next;
|
|
pArena->next->prev = pArena;
|
|
pArena->prev = &pEntry->arena;
|
|
pEntry->arena.next = pArena;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_FindSubHeap
|
|
* Find the sub-heap containing a given address.
|
|
*
|
|
* RETURNS
|
|
* Pointer: Success
|
|
* NULL: Failure
|
|
*/
|
|
static SUBHEAP *HEAP_FindSubHeap(
|
|
HEAP *heap, /* [in] Heap pointer */
|
|
LPCVOID ptr /* [in] Address */
|
|
) {
|
|
SUBHEAP *sub = &heap->subheap;
|
|
while (sub)
|
|
{
|
|
if (((char *)ptr >= (char *)sub) &&
|
|
((char *)ptr < (char *)sub + sub->size)) return sub;
|
|
sub = sub->next;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_Commit
|
|
*
|
|
* Make sure the heap storage is committed up to (not including) ptr.
|
|
*/
|
|
static BOOL32 HEAP_Commit( SUBHEAP *subheap, void *ptr )
|
|
{
|
|
DWORD size = (DWORD)((char *)ptr - (char *)subheap);
|
|
size = (size + 0xfff) & 0xfffff000; /* Align size on a page boundary */
|
|
if (size > subheap->size) size = subheap->size;
|
|
if (size <= subheap->commitSize) return TRUE;
|
|
if (!VirtualAlloc( (char *)subheap + subheap->commitSize,
|
|
size - subheap->commitSize, MEM_COMMIT,
|
|
PAGE_EXECUTE_READWRITE))
|
|
{
|
|
WARN(heap, "Could not commit %08lx bytes at %08lx for heap %08lx\n",
|
|
size - subheap->commitSize,
|
|
(DWORD)((char *)subheap + subheap->commitSize),
|
|
(DWORD)subheap->heap );
|
|
return FALSE;
|
|
}
|
|
subheap->commitSize = size;
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_Decommit
|
|
*
|
|
* If possible, decommit the heap storage from (including) 'ptr'.
|
|
*/
|
|
static BOOL32 HEAP_Decommit( SUBHEAP *subheap, void *ptr )
|
|
{
|
|
DWORD size = (DWORD)((char *)ptr - (char *)subheap);
|
|
size = (size + 0xfff) & 0xfffff000; /* Align size on a page boundary */
|
|
if (size >= subheap->commitSize) return TRUE;
|
|
if (!VirtualFree( (char *)subheap + size,
|
|
subheap->commitSize - size, MEM_DECOMMIT ))
|
|
{
|
|
WARN(heap, "Could not decommit %08lx bytes at %08lx for heap %08lx\n",
|
|
subheap->commitSize - size,
|
|
(DWORD)((char *)subheap + size),
|
|
(DWORD)subheap->heap );
|
|
return FALSE;
|
|
}
|
|
subheap->commitSize = size;
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_CreateFreeBlock
|
|
*
|
|
* Create a free block at a specified address. 'size' is the size of the
|
|
* whole block, including the new arena.
|
|
*/
|
|
static void HEAP_CreateFreeBlock( SUBHEAP *subheap, void *ptr, DWORD size )
|
|
{
|
|
ARENA_FREE *pFree;
|
|
|
|
/* Create a free arena */
|
|
|
|
pFree = (ARENA_FREE *)ptr;
|
|
pFree->threadId = GetCurrentTask();
|
|
pFree->magic = ARENA_FREE_MAGIC;
|
|
|
|
/* If debugging, erase the freed block content */
|
|
|
|
if (TRACE_ON(heap))
|
|
{
|
|
char *pEnd = (char *)ptr + size;
|
|
if (pEnd > (char *)subheap + subheap->commitSize)
|
|
pEnd = (char *)subheap + subheap->commitSize;
|
|
if (pEnd > (char *)(pFree + 1))
|
|
memset( pFree + 1, ARENA_FREE_FILLER, pEnd - (char *)(pFree + 1) );
|
|
}
|
|
|
|
/* Check if next block is free also */
|
|
|
|
if (((char *)ptr + size < (char *)subheap + subheap->size) &&
|
|
(*(DWORD *)((char *)ptr + size) & ARENA_FLAG_FREE))
|
|
{
|
|
/* Remove the next arena from the free list */
|
|
ARENA_FREE *pNext = (ARENA_FREE *)((char *)ptr + size);
|
|
pNext->next->prev = pNext->prev;
|
|
pNext->prev->next = pNext->next;
|
|
size += (pNext->size & ARENA_SIZE_MASK) + sizeof(*pNext);
|
|
if (TRACE_ON(heap))
|
|
memset( pNext, ARENA_FREE_FILLER, sizeof(ARENA_FREE) );
|
|
}
|
|
|
|
/* Set the next block PREV_FREE flag and pointer */
|
|
|
|
if ((char *)ptr + size < (char *)subheap + subheap->size)
|
|
{
|
|
DWORD *pNext = (DWORD *)((char *)ptr + size);
|
|
*pNext |= ARENA_FLAG_PREV_FREE;
|
|
*(ARENA_FREE **)(pNext - 1) = pFree;
|
|
}
|
|
|
|
/* Last, insert the new block into the free list */
|
|
|
|
pFree->size = size - sizeof(*pFree);
|
|
HEAP_InsertFreeBlock( subheap->heap, pFree );
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_MakeInUseBlockFree
|
|
*
|
|
* Turn an in-use block into a free block. Can also decommit the end of
|
|
* the heap, and possibly even free the sub-heap altogether.
|
|
*/
|
|
static void HEAP_MakeInUseBlockFree( SUBHEAP *subheap, ARENA_INUSE *pArena )
|
|
{
|
|
ARENA_FREE *pFree;
|
|
DWORD size = (pArena->size & ARENA_SIZE_MASK) + sizeof(*pArena);
|
|
|
|
/* Check if we can merge with previous block */
|
|
|
|
if (pArena->size & ARENA_FLAG_PREV_FREE)
|
|
{
|
|
pFree = *((ARENA_FREE **)pArena - 1);
|
|
size += (pFree->size & ARENA_SIZE_MASK) + sizeof(ARENA_FREE);
|
|
/* Remove it from the free list */
|
|
pFree->next->prev = pFree->prev;
|
|
pFree->prev->next = pFree->next;
|
|
}
|
|
else pFree = (ARENA_FREE *)pArena;
|
|
|
|
/* Create a free block */
|
|
|
|
HEAP_CreateFreeBlock( subheap, pFree, size );
|
|
size = (pFree->size & ARENA_SIZE_MASK) + sizeof(ARENA_FREE);
|
|
if ((char *)pFree + size < (char *)subheap + subheap->size)
|
|
return; /* Not the last block, so nothing more to do */
|
|
|
|
/* Free the whole sub-heap if it's empty and not the original one */
|
|
|
|
if (((char *)pFree == (char *)subheap + subheap->headerSize) &&
|
|
(subheap != &subheap->heap->subheap))
|
|
{
|
|
SUBHEAP *pPrev = &subheap->heap->subheap;
|
|
/* Remove the free block from the list */
|
|
pFree->next->prev = pFree->prev;
|
|
pFree->prev->next = pFree->next;
|
|
/* Remove the subheap from the list */
|
|
while (pPrev && (pPrev->next != subheap)) pPrev = pPrev->next;
|
|
if (pPrev) pPrev->next = subheap->next;
|
|
/* Free the memory */
|
|
subheap->magic = 0;
|
|
if (subheap->selector) FreeSelector( subheap->selector );
|
|
VirtualFree( subheap, 0, MEM_RELEASE );
|
|
return;
|
|
}
|
|
|
|
/* Decommit the end of the heap */
|
|
|
|
HEAP_Decommit( subheap, pFree + 1 );
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_ShrinkBlock
|
|
*
|
|
* Shrink an in-use block.
|
|
*/
|
|
static void HEAP_ShrinkBlock(SUBHEAP *subheap, ARENA_INUSE *pArena, DWORD size)
|
|
{
|
|
if ((pArena->size & ARENA_SIZE_MASK) >= size + HEAP_MIN_BLOCK_SIZE)
|
|
{
|
|
HEAP_CreateFreeBlock( subheap, (char *)(pArena + 1) + size,
|
|
(pArena->size & ARENA_SIZE_MASK) - size );
|
|
pArena->size = (pArena->size & ~ARENA_SIZE_MASK) | size;
|
|
}
|
|
else
|
|
{
|
|
/* Turn off PREV_FREE flag in next block */
|
|
char *pNext = (char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK);
|
|
if (pNext < (char *)subheap + subheap->size)
|
|
*(DWORD *)pNext &= ~ARENA_FLAG_PREV_FREE;
|
|
}
|
|
}
|
|
|
|
/***********************************************************************
|
|
* HEAP_InitSubHeap
|
|
*/
|
|
static BOOL32 HEAP_InitSubHeap( HEAP *heap, LPVOID address, DWORD flags,
|
|
DWORD commitSize, DWORD totalSize )
|
|
{
|
|
SUBHEAP *subheap = (SUBHEAP *)address;
|
|
WORD selector = 0;
|
|
FREE_LIST_ENTRY *pEntry;
|
|
int i;
|
|
|
|
/* Commit memory */
|
|
|
|
if (!VirtualAlloc(address, commitSize, MEM_COMMIT, PAGE_EXECUTE_READWRITE))
|
|
{
|
|
WARN(heap, "Could not commit %08lx bytes for sub-heap %08lx\n",
|
|
commitSize, (DWORD)address );
|
|
return FALSE;
|
|
}
|
|
|
|
/* Allocate a selector if needed */
|
|
|
|
if (flags & HEAP_WINE_SEGPTR)
|
|
{
|
|
selector = SELECTOR_AllocBlock( address, totalSize,
|
|
(flags & HEAP_WINE_CODESEG) ? SEGMENT_CODE : SEGMENT_DATA,
|
|
(flags & HEAP_WINE_CODESEG) != 0, FALSE );
|
|
if (!selector)
|
|
{
|
|
WARN(heap, "Could not allocate selector\n" );
|
|
return FALSE;
|
|
}
|
|
}
|
|
|
|
/* Fill the sub-heap structure */
|
|
|
|
subheap->heap = heap;
|
|
subheap->selector = selector;
|
|
subheap->size = totalSize;
|
|
subheap->commitSize = commitSize;
|
|
subheap->magic = SUBHEAP_MAGIC;
|
|
|
|
if ( subheap != (SUBHEAP *)heap )
|
|
{
|
|
/* If this is a secondary subheap, insert it into list */
|
|
|
|
subheap->headerSize = sizeof(SUBHEAP);
|
|
subheap->next = heap->subheap.next;
|
|
heap->subheap.next = subheap;
|
|
}
|
|
else
|
|
{
|
|
/* If this is a primary subheap, initialize main heap */
|
|
|
|
subheap->headerSize = sizeof(HEAP);
|
|
subheap->next = NULL;
|
|
heap->next = NULL;
|
|
heap->flags = flags;
|
|
heap->magic = HEAP_MAGIC;
|
|
|
|
/* Build the free lists */
|
|
|
|
for (i = 0, pEntry = heap->freeList; i < HEAP_NB_FREE_LISTS; i++, pEntry++)
|
|
{
|
|
pEntry->size = HEAP_freeListSizes[i];
|
|
pEntry->arena.size = 0 | ARENA_FLAG_FREE;
|
|
pEntry->arena.next = i < HEAP_NB_FREE_LISTS-1 ?
|
|
&heap->freeList[i+1].arena : &heap->freeList[0].arena;
|
|
pEntry->arena.prev = i ? &heap->freeList[i-1].arena :
|
|
&heap->freeList[HEAP_NB_FREE_LISTS-1].arena;
|
|
pEntry->arena.threadId = 0;
|
|
pEntry->arena.magic = ARENA_FREE_MAGIC;
|
|
}
|
|
|
|
/* Initialize critical section */
|
|
|
|
InitializeCriticalSection( &heap->critSection );
|
|
if (!SystemHeap) HEAP_SystemLock = &heap->critSection;
|
|
}
|
|
|
|
/* Create the first free block */
|
|
|
|
HEAP_CreateFreeBlock( subheap, (LPBYTE)subheap + subheap->headerSize,
|
|
subheap->size - subheap->headerSize );
|
|
|
|
return TRUE;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* HEAP_CreateSubHeap
|
|
*
|
|
* Create a sub-heap of the given size.
|
|
* If heap == NULL, creates a main heap.
|
|
*/
|
|
static SUBHEAP *HEAP_CreateSubHeap( HEAP *heap, DWORD flags,
|
|
DWORD commitSize, DWORD totalSize )
|
|
{
|
|
LPVOID address;
|
|
|
|
/* Round-up sizes on a 64K boundary */
|
|
|
|
if (flags & HEAP_WINE_SEGPTR)
|
|
{
|
|
totalSize = commitSize = 0x10000; /* Only 64K at a time for SEGPTRs */
|
|
}
|
|
else
|
|
{
|
|
totalSize = (totalSize + 0xffff) & 0xffff0000;
|
|
commitSize = (commitSize + 0xffff) & 0xffff0000;
|
|
if (!commitSize) commitSize = 0x10000;
|
|
if (totalSize < commitSize) totalSize = commitSize;
|
|
}
|
|
|
|
/* Allocate the memory block */
|
|
|
|
if (!(address = VirtualAlloc( NULL, totalSize,
|
|
MEM_RESERVE, PAGE_EXECUTE_READWRITE )))
|
|
{
|
|
WARN(heap, "Could not VirtualAlloc %08lx bytes\n",
|
|
totalSize );
|
|
return NULL;
|
|
}
|
|
|
|
/* Initialize subheap */
|
|
|
|
if (!HEAP_InitSubHeap( heap? heap : (HEAP *)address,
|
|
address, flags, commitSize, totalSize ))
|
|
{
|
|
VirtualFree( address, 0, MEM_RELEASE );
|
|
return NULL;
|
|
}
|
|
|
|
return (SUBHEAP *)address;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_FindFreeBlock
|
|
*
|
|
* Find a free block at least as large as the requested size, and make sure
|
|
* the requested size is committed.
|
|
*/
|
|
static ARENA_FREE *HEAP_FindFreeBlock( HEAP *heap, DWORD size,
|
|
SUBHEAP **ppSubHeap )
|
|
{
|
|
SUBHEAP *subheap;
|
|
ARENA_FREE *pArena;
|
|
FREE_LIST_ENTRY *pEntry = heap->freeList;
|
|
|
|
/* Find a suitable free list, and in it find a block large enough */
|
|
|
|
while (pEntry->size < size) pEntry++;
|
|
pArena = pEntry->arena.next;
|
|
while (pArena != &heap->freeList[0].arena)
|
|
{
|
|
if (pArena->size > size)
|
|
{
|
|
subheap = HEAP_FindSubHeap( heap, pArena );
|
|
if (!HEAP_Commit( subheap, (char *)pArena + sizeof(ARENA_INUSE)
|
|
+ size + HEAP_MIN_BLOCK_SIZE))
|
|
return NULL;
|
|
*ppSubHeap = subheap;
|
|
return pArena;
|
|
}
|
|
|
|
pArena = pArena->next;
|
|
}
|
|
|
|
/* If no block was found, attempt to grow the heap */
|
|
|
|
if (!(heap->flags & HEAP_GROWABLE))
|
|
{
|
|
WARN(heap, "Not enough space in heap %08lx for %08lx bytes\n",
|
|
(DWORD)heap, size );
|
|
return NULL;
|
|
}
|
|
size += sizeof(SUBHEAP) + sizeof(ARENA_FREE);
|
|
if (!(subheap = HEAP_CreateSubHeap( heap, heap->flags, size,
|
|
MAX( HEAP_DEF_SIZE, size ) )))
|
|
return NULL;
|
|
|
|
TRACE(heap, "created new sub-heap %08lx of %08lx bytes for heap %08lx\n",
|
|
(DWORD)subheap, size, (DWORD)heap );
|
|
|
|
*ppSubHeap = subheap;
|
|
return (ARENA_FREE *)(subheap + 1);
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_IsValidArenaPtr
|
|
*
|
|
* Check that the pointer is inside the range possible for arenas.
|
|
*/
|
|
static BOOL32 HEAP_IsValidArenaPtr( HEAP *heap, void *ptr )
|
|
{
|
|
int i;
|
|
SUBHEAP *subheap = HEAP_FindSubHeap( heap, ptr );
|
|
if (!subheap) return FALSE;
|
|
if ((char *)ptr >= (char *)subheap + subheap->headerSize) return TRUE;
|
|
if (subheap != &heap->subheap) return FALSE;
|
|
for (i = 0; i < HEAP_NB_FREE_LISTS; i++)
|
|
if (ptr == (void *)&heap->freeList[i].arena) return TRUE;
|
|
return FALSE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_ValidateFreeArena
|
|
*/
|
|
static BOOL32 HEAP_ValidateFreeArena( SUBHEAP *subheap, ARENA_FREE *pArena )
|
|
{
|
|
char *heapEnd = (char *)subheap + subheap->size;
|
|
|
|
/* Check magic number */
|
|
if (pArena->magic != ARENA_FREE_MAGIC)
|
|
{
|
|
WARN(heap, "Heap %08lx: invalid free arena magic for %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check size flags */
|
|
if (!(pArena->size & ARENA_FLAG_FREE) ||
|
|
(pArena->size & ARENA_FLAG_PREV_FREE))
|
|
{
|
|
WARN(heap, "Heap %08lx: bad flags %lx for free arena %08lx\n",
|
|
(DWORD)subheap->heap, pArena->size & ~ARENA_SIZE_MASK, (DWORD)pArena );
|
|
}
|
|
/* Check arena size */
|
|
if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) > heapEnd)
|
|
{
|
|
WARN(heap, "Heap %08lx: bad size %08lx for free arena %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena->size & ARENA_SIZE_MASK, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check that next pointer is valid */
|
|
if (!HEAP_IsValidArenaPtr( subheap->heap, pArena->next ))
|
|
{
|
|
WARN(heap, "Heap %08lx: bad next ptr %08lx for arena %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena->next, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check that next arena is free */
|
|
if (!(pArena->next->size & ARENA_FLAG_FREE) ||
|
|
(pArena->next->magic != ARENA_FREE_MAGIC))
|
|
{
|
|
WARN(heap, "Heap %08lx: next arena %08lx invalid for %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena->next, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check that prev pointer is valid */
|
|
if (!HEAP_IsValidArenaPtr( subheap->heap, pArena->prev ))
|
|
{
|
|
WARN(heap, "Heap %08lx: bad prev ptr %08lx for arena %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena->prev, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check that prev arena is free */
|
|
if (!(pArena->prev->size & ARENA_FLAG_FREE) ||
|
|
(pArena->prev->magic != ARENA_FREE_MAGIC))
|
|
{
|
|
WARN(heap, "Heap %08lx: prev arena %08lx invalid for %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena->prev, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check that next block has PREV_FREE flag */
|
|
if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) < heapEnd)
|
|
{
|
|
if (!(*(DWORD *)((char *)(pArena + 1) +
|
|
(pArena->size & ARENA_SIZE_MASK)) & ARENA_FLAG_PREV_FREE))
|
|
{
|
|
WARN(heap, "Heap %08lx: free arena %08lx next block has no PREV_FREE flag\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check next block back pointer */
|
|
if (*((ARENA_FREE **)((char *)(pArena + 1) +
|
|
(pArena->size & ARENA_SIZE_MASK)) - 1) != pArena)
|
|
{
|
|
WARN(heap, "Heap %08lx: arena %08lx has wrong back ptr %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena,
|
|
*((DWORD *)((char *)(pArena+1)+ (pArena->size & ARENA_SIZE_MASK)) - 1));
|
|
return FALSE;
|
|
}
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_ValidateInUseArena
|
|
*/
|
|
static BOOL32 HEAP_ValidateInUseArena( SUBHEAP *subheap, ARENA_INUSE *pArena )
|
|
{
|
|
char *heapEnd = (char *)subheap + subheap->size;
|
|
|
|
/* Check magic number */
|
|
if (pArena->magic != ARENA_INUSE_MAGIC)
|
|
{
|
|
WARN(heap, "Heap %08lx: invalid in-use arena magic for %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check size flags */
|
|
if (pArena->size & ARENA_FLAG_FREE)
|
|
{
|
|
WARN(heap, "Heap %08lx: bad flags %lx for in-use arena %08lx\n",
|
|
(DWORD)subheap->heap, pArena->size & ~ARENA_SIZE_MASK, (DWORD)pArena );
|
|
}
|
|
/* Check arena size */
|
|
if ((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) > heapEnd)
|
|
{
|
|
WARN(heap, "Heap %08lx: bad size %08lx for in-use arena %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena->size & ARENA_SIZE_MASK, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check next arena PREV_FREE flag */
|
|
if (((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK) < heapEnd) &&
|
|
(*(DWORD *)((char *)(pArena + 1) + (pArena->size & ARENA_SIZE_MASK)) & ARENA_FLAG_PREV_FREE))
|
|
{
|
|
WARN(heap, "Heap %08lx: in-use arena %08lx next block has PREV_FREE flag\n",
|
|
(DWORD)subheap->heap, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check prev free arena */
|
|
if (pArena->size & ARENA_FLAG_PREV_FREE)
|
|
{
|
|
ARENA_FREE *pPrev = *((ARENA_FREE **)pArena - 1);
|
|
/* Check prev pointer */
|
|
if (!HEAP_IsValidArenaPtr( subheap->heap, pPrev ))
|
|
{
|
|
WARN(heap, "Heap %08lx: bad back ptr %08lx for arena %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check that prev arena is free */
|
|
if (!(pPrev->size & ARENA_FLAG_FREE) ||
|
|
(pPrev->magic != ARENA_FREE_MAGIC))
|
|
{
|
|
WARN(heap, "Heap %08lx: prev arena %08lx invalid for in-use %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
/* Check that prev arena is really the previous block */
|
|
if ((char *)(pPrev + 1) + (pPrev->size & ARENA_SIZE_MASK) != (char *)pArena)
|
|
{
|
|
WARN(heap, "Heap %08lx: prev arena %08lx is not prev for in-use %08lx\n",
|
|
(DWORD)subheap->heap, (DWORD)pPrev, (DWORD)pArena );
|
|
return FALSE;
|
|
}
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_IsInsideHeap
|
|
* Checks whether the pointer points to a block inside a given heap.
|
|
*
|
|
* NOTES
|
|
* Should this return BOOL32?
|
|
*
|
|
* RETURNS
|
|
* !0: Success
|
|
* 0: Failure
|
|
*/
|
|
int HEAP_IsInsideHeap(
|
|
HANDLE32 heap, /* [in] Heap */
|
|
DWORD flags, /* [in] Flags */
|
|
LPCVOID ptr /* [in] Pointer */
|
|
) {
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
SUBHEAP *subheap;
|
|
int ret;
|
|
|
|
/* Validate the parameters */
|
|
|
|
if (!heapPtr) return 0;
|
|
flags |= heapPtr->flags;
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
|
|
ret = (((subheap = HEAP_FindSubHeap( heapPtr, ptr )) != NULL) &&
|
|
(((char *)ptr >= (char *)subheap + subheap->headerSize
|
|
+ sizeof(ARENA_INUSE))));
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
return ret;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_GetSegptr
|
|
*
|
|
* Transform a linear pointer into a SEGPTR. The pointer must have been
|
|
* allocated from a HEAP_WINE_SEGPTR heap.
|
|
*/
|
|
SEGPTR HEAP_GetSegptr( HANDLE32 heap, DWORD flags, LPCVOID ptr )
|
|
{
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
SUBHEAP *subheap;
|
|
SEGPTR ret;
|
|
|
|
/* Validate the parameters */
|
|
|
|
if (!heapPtr) return 0;
|
|
flags |= heapPtr->flags;
|
|
if (!(flags & HEAP_WINE_SEGPTR))
|
|
{
|
|
WARN(heap, "Heap %08x is not a SEGPTR heap\n",
|
|
heap );
|
|
return 0;
|
|
}
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
|
|
|
|
/* Get the subheap */
|
|
|
|
if (!(subheap = HEAP_FindSubHeap( heapPtr, ptr )))
|
|
{
|
|
WARN(heap, "%p is not inside heap %08x\n",
|
|
ptr, heap );
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
return 0;
|
|
}
|
|
|
|
/* Build the SEGPTR */
|
|
|
|
ret = PTR_SEG_OFF_TO_SEGPTR(subheap->selector, (DWORD)ptr-(DWORD)subheap);
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
return ret;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapCreate (KERNEL32.336)
|
|
* RETURNS
|
|
* Handle of heap: Success
|
|
* NULL: Failure
|
|
*/
|
|
HANDLE32 WINAPI HeapCreate(
|
|
DWORD flags, /* [in] Heap allocation flag */
|
|
DWORD initialSize, /* [in] Initial heap size */
|
|
DWORD maxSize /* [in] Maximum heap size */
|
|
) {
|
|
SUBHEAP *subheap;
|
|
|
|
/* Allocate the heap block */
|
|
|
|
if (!maxSize)
|
|
{
|
|
maxSize = HEAP_DEF_SIZE;
|
|
flags |= HEAP_GROWABLE;
|
|
}
|
|
if (!(subheap = HEAP_CreateSubHeap( NULL, flags, initialSize, maxSize )))
|
|
{
|
|
SetLastError( ERROR_OUTOFMEMORY );
|
|
return 0;
|
|
}
|
|
|
|
return (HANDLE32)subheap;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* HeapDestroy (KERNEL32.337)
|
|
* RETURNS
|
|
* TRUE: Success
|
|
* FALSE: Failure
|
|
*/
|
|
BOOL32 WINAPI HeapDestroy(
|
|
HANDLE32 heap /* [in] Handle of heap */
|
|
) {
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
SUBHEAP *subheap;
|
|
|
|
TRACE(heap, "%08x\n", heap );
|
|
if (!heapPtr) return FALSE;
|
|
|
|
DeleteCriticalSection( &heapPtr->critSection );
|
|
subheap = &heapPtr->subheap;
|
|
while (subheap)
|
|
{
|
|
SUBHEAP *next = subheap->next;
|
|
if (subheap->selector) FreeSelector( subheap->selector );
|
|
VirtualFree( subheap, 0, MEM_RELEASE );
|
|
subheap = next;
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapAlloc (KERNEL32.334)
|
|
* RETURNS
|
|
* Pointer to allocated memory block
|
|
* NULL: Failure
|
|
*/
|
|
LPVOID WINAPI HeapAlloc(
|
|
HANDLE32 heap, /* [in] Handle of private heap block */
|
|
DWORD flags, /* [in] Heap allocation control flags */
|
|
DWORD size /* [in] Number of bytes to allocate */
|
|
) {
|
|
ARENA_FREE *pArena;
|
|
ARENA_INUSE *pInUse;
|
|
SUBHEAP *subheap;
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
|
|
/* Validate the parameters */
|
|
|
|
if (!heapPtr) return NULL;
|
|
flags &= HEAP_GENERATE_EXCEPTIONS | HEAP_NO_SERIALIZE | HEAP_ZERO_MEMORY;
|
|
flags |= heapPtr->flags;
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
|
|
size = (size + 3) & ~3;
|
|
if (size < HEAP_MIN_BLOCK_SIZE) size = HEAP_MIN_BLOCK_SIZE;
|
|
|
|
/* Locate a suitable free block */
|
|
|
|
if (!(pArena = HEAP_FindFreeBlock( heapPtr, size, &subheap )))
|
|
{
|
|
TRACE(heap, "(%08x,%08lx,%08lx): returning NULL\n",
|
|
heap, flags, size );
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
SetLastError( ERROR_COMMITMENT_LIMIT );
|
|
return NULL;
|
|
}
|
|
|
|
/* Remove the arena from the free list */
|
|
|
|
pArena->next->prev = pArena->prev;
|
|
pArena->prev->next = pArena->next;
|
|
|
|
/* Build the in-use arena */
|
|
|
|
pInUse = (ARENA_INUSE *)pArena;
|
|
pInUse->size = (pInUse->size & ~ARENA_FLAG_FREE)
|
|
+ sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
|
|
pInUse->callerEIP = *((DWORD *)&heap - 1); /* hack hack */
|
|
pInUse->threadId = GetCurrentTask();
|
|
pInUse->magic = ARENA_INUSE_MAGIC;
|
|
|
|
/* Shrink the block */
|
|
|
|
HEAP_ShrinkBlock( subheap, pInUse, size );
|
|
|
|
if (flags & HEAP_ZERO_MEMORY) memset( pInUse + 1, 0, size );
|
|
else if (TRACE_ON(heap)) memset( pInUse + 1, ARENA_INUSE_FILLER, size );
|
|
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
|
|
TRACE(heap, "(%08x,%08lx,%08lx): returning %08lx\n",
|
|
heap, flags, size, (DWORD)(pInUse + 1) );
|
|
return (LPVOID)(pInUse + 1);
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapFree (KERNEL32.338)
|
|
* RETURNS
|
|
* TRUE: Success
|
|
* FALSE: Failure
|
|
*/
|
|
BOOL32 WINAPI HeapFree(
|
|
HANDLE32 heap, /* [in] Handle of heap */
|
|
DWORD flags, /* [in] Heap freeing flags */
|
|
LPVOID ptr /* [in] Address of memory to free */
|
|
) {
|
|
ARENA_INUSE *pInUse;
|
|
SUBHEAP *subheap;
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
|
|
/* Validate the parameters */
|
|
|
|
if (!heapPtr) return FALSE;
|
|
flags &= HEAP_NO_SERIALIZE;
|
|
flags |= heapPtr->flags;
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
|
|
if (!ptr || !HeapValidate( heap, HEAP_NO_SERIALIZE, ptr ))
|
|
{
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
SetLastError( ERROR_INVALID_PARAMETER );
|
|
TRACE(heap, "(%08x,%08lx,%08lx): returning FALSE\n",
|
|
heap, flags, (DWORD)ptr );
|
|
return FALSE;
|
|
}
|
|
|
|
/* Turn the block into a free block */
|
|
|
|
pInUse = (ARENA_INUSE *)ptr - 1;
|
|
subheap = HEAP_FindSubHeap( heapPtr, pInUse );
|
|
HEAP_MakeInUseBlockFree( subheap, pInUse );
|
|
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
/* SetLastError( 0 ); */
|
|
|
|
TRACE(heap, "(%08x,%08lx,%08lx): returning TRUE\n",
|
|
heap, flags, (DWORD)ptr );
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapReAlloc (KERNEL32.340)
|
|
* RETURNS
|
|
* Pointer to reallocated memory block
|
|
* NULL: Failure
|
|
*/
|
|
LPVOID WINAPI HeapReAlloc(
|
|
HANDLE32 heap, /* [in] Handle of heap block */
|
|
DWORD flags, /* [in] Heap reallocation flags */
|
|
LPVOID ptr, /* [in] Address of memory to reallocate */
|
|
DWORD size /* [in] Number of bytes to reallocate */
|
|
) {
|
|
ARENA_INUSE *pArena;
|
|
DWORD oldSize;
|
|
HEAP *heapPtr;
|
|
SUBHEAP *subheap;
|
|
|
|
if (!ptr) return HeapAlloc( heap, flags, size ); /* FIXME: correct? */
|
|
if (!(heapPtr = HEAP_GetPtr( heap ))) return FALSE;
|
|
|
|
/* Validate the parameters */
|
|
|
|
flags &= HEAP_GENERATE_EXCEPTIONS | HEAP_NO_SERIALIZE | HEAP_ZERO_MEMORY |
|
|
HEAP_REALLOC_IN_PLACE_ONLY;
|
|
flags |= heapPtr->flags;
|
|
size = (size + 3) & ~3;
|
|
if (size < HEAP_MIN_BLOCK_SIZE) size = HEAP_MIN_BLOCK_SIZE;
|
|
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
|
|
if (!HeapValidate( heap, HEAP_NO_SERIALIZE, ptr ))
|
|
{
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
SetLastError( ERROR_INVALID_PARAMETER );
|
|
TRACE(heap, "(%08x,%08lx,%08lx,%08lx): returning NULL\n",
|
|
heap, flags, (DWORD)ptr, size );
|
|
return NULL;
|
|
}
|
|
|
|
/* Check if we need to grow the block */
|
|
|
|
pArena = (ARENA_INUSE *)ptr - 1;
|
|
pArena->threadId = GetCurrentTask();
|
|
subheap = HEAP_FindSubHeap( heapPtr, pArena );
|
|
oldSize = (pArena->size & ARENA_SIZE_MASK);
|
|
if (size > oldSize)
|
|
{
|
|
char *pNext = (char *)(pArena + 1) + oldSize;
|
|
if ((pNext < (char *)subheap + subheap->size) &&
|
|
(*(DWORD *)pNext & ARENA_FLAG_FREE) &&
|
|
(oldSize + (*(DWORD *)pNext & ARENA_SIZE_MASK) + sizeof(ARENA_FREE) >= size))
|
|
{
|
|
/* The next block is free and large enough */
|
|
ARENA_FREE *pFree = (ARENA_FREE *)pNext;
|
|
pFree->next->prev = pFree->prev;
|
|
pFree->prev->next = pFree->next;
|
|
pArena->size += (pFree->size & ARENA_SIZE_MASK) + sizeof(*pFree);
|
|
if (!HEAP_Commit( subheap, (char *)pArena + sizeof(ARENA_INUSE)
|
|
+ size + HEAP_MIN_BLOCK_SIZE))
|
|
{
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
SetLastError( ERROR_OUTOFMEMORY );
|
|
return NULL;
|
|
}
|
|
HEAP_ShrinkBlock( subheap, pArena, size );
|
|
}
|
|
else /* Do it the hard way */
|
|
{
|
|
ARENA_FREE *pNew;
|
|
ARENA_INUSE *pInUse;
|
|
SUBHEAP *newsubheap;
|
|
|
|
if ((flags & HEAP_REALLOC_IN_PLACE_ONLY) ||
|
|
!(pNew = HEAP_FindFreeBlock( heapPtr, size, &newsubheap )))
|
|
{
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
SetLastError( ERROR_OUTOFMEMORY );
|
|
return NULL;
|
|
}
|
|
|
|
/* Build the in-use arena */
|
|
|
|
pNew->next->prev = pNew->prev;
|
|
pNew->prev->next = pNew->next;
|
|
pInUse = (ARENA_INUSE *)pNew;
|
|
pInUse->size = (pInUse->size & ~ARENA_FLAG_FREE)
|
|
+ sizeof(ARENA_FREE) - sizeof(ARENA_INUSE);
|
|
pInUse->threadId = GetCurrentTask();
|
|
pInUse->magic = ARENA_INUSE_MAGIC;
|
|
HEAP_ShrinkBlock( newsubheap, pInUse, size );
|
|
memcpy( pInUse + 1, pArena + 1, oldSize );
|
|
|
|
/* Free the previous block */
|
|
|
|
HEAP_MakeInUseBlockFree( subheap, pArena );
|
|
subheap = newsubheap;
|
|
pArena = pInUse;
|
|
}
|
|
}
|
|
else HEAP_ShrinkBlock( subheap, pArena, size ); /* Shrink the block */
|
|
|
|
/* Clear the extra bytes if needed */
|
|
|
|
if (size > oldSize)
|
|
{
|
|
if (flags & HEAP_ZERO_MEMORY)
|
|
memset( (char *)(pArena + 1) + oldSize, 0,
|
|
(pArena->size & ARENA_SIZE_MASK) - oldSize );
|
|
else if (TRACE_ON(heap))
|
|
memset( (char *)(pArena + 1) + oldSize, ARENA_INUSE_FILLER,
|
|
(pArena->size & ARENA_SIZE_MASK) - oldSize );
|
|
}
|
|
|
|
/* Return the new arena */
|
|
|
|
pArena->callerEIP = *((DWORD *)&heap - 1); /* hack hack */
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
|
|
TRACE(heap, "(%08x,%08lx,%08lx,%08lx): returning %08lx\n",
|
|
heap, flags, (DWORD)ptr, size, (DWORD)(pArena + 1) );
|
|
return (LPVOID)(pArena + 1);
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapCompact (KERNEL32.335)
|
|
*/
|
|
DWORD WINAPI HeapCompact( HANDLE32 heap, DWORD flags )
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapLock (KERNEL32.339)
|
|
* Attempts to acquire the critical section object for a specified heap.
|
|
*
|
|
* RETURNS
|
|
* TRUE: Success
|
|
* FALSE: Failure
|
|
*/
|
|
BOOL32 WINAPI HeapLock(
|
|
HANDLE32 heap /* [in] Handle of heap to lock for exclusive access */
|
|
) {
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
if (!heapPtr) return FALSE;
|
|
EnterCriticalSection( &heapPtr->critSection );
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapUnlock (KERNEL32.342)
|
|
* Releases ownership of the critical section object.
|
|
*
|
|
* RETURNS
|
|
* TRUE: Success
|
|
* FALSE: Failure
|
|
*/
|
|
BOOL32 WINAPI HeapUnlock(
|
|
HANDLE32 heap /* [in] Handle to the heap to unlock */
|
|
) {
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
if (!heapPtr) return FALSE;
|
|
LeaveCriticalSection( &heapPtr->critSection );
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapSize (KERNEL32.341)
|
|
* RETURNS
|
|
* Size in bytes of allocated memory
|
|
* 0: Failure
|
|
*/
|
|
DWORD WINAPI HeapSize(
|
|
HANDLE32 heap, /* [in] Handle of heap */
|
|
DWORD flags, /* [in] Heap size control flags */
|
|
LPVOID ptr /* [in] Address of memory to return size for */
|
|
) {
|
|
DWORD ret;
|
|
HEAP *heapPtr = HEAP_GetPtr( heap );
|
|
|
|
if (!heapPtr) return FALSE;
|
|
flags &= HEAP_NO_SERIALIZE;
|
|
flags |= heapPtr->flags;
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapLock( heap );
|
|
if (!HeapValidate( heap, HEAP_NO_SERIALIZE, ptr ))
|
|
{
|
|
SetLastError( ERROR_INVALID_PARAMETER );
|
|
ret = 0xffffffff;
|
|
}
|
|
else
|
|
{
|
|
ARENA_INUSE *pArena = (ARENA_INUSE *)ptr - 1;
|
|
ret = pArena->size & ARENA_SIZE_MASK;
|
|
}
|
|
if (!(flags & HEAP_NO_SERIALIZE)) HeapUnlock( heap );
|
|
|
|
TRACE(heap, "(%08x,%08lx,%08lx): returning %08lx\n",
|
|
heap, flags, (DWORD)ptr, ret );
|
|
return ret;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapValidate (KERNEL32.343)
|
|
* Validates a specified heap.
|
|
*
|
|
* NOTES
|
|
* Flags is ignored.
|
|
*
|
|
* RETURNS
|
|
* TRUE: Success
|
|
* FALSE: Failure
|
|
*/
|
|
BOOL32 WINAPI HeapValidate(
|
|
HANDLE32 heap, /* [in] Handle to the heap */
|
|
DWORD flags, /* [in] Bit flags that control access during operation */
|
|
LPCVOID block /* [in] Optional pointer to memory block to validate */
|
|
) {
|
|
SUBHEAP *subheap;
|
|
HEAP *heapPtr = (HEAP *)(heap);
|
|
|
|
if (!heapPtr || (heapPtr->magic != HEAP_MAGIC))
|
|
{
|
|
WARN(heap, "Invalid heap %08x!\n", heap );
|
|
return FALSE;
|
|
}
|
|
|
|
if (block)
|
|
{
|
|
/* Only check this single memory block */
|
|
if (!(subheap = HEAP_FindSubHeap( heapPtr, block )) ||
|
|
((char *)block < (char *)subheap + subheap->headerSize
|
|
+ sizeof(ARENA_INUSE)))
|
|
{
|
|
WARN(heap, "Heap %08lx: block %08lx is not inside heap\n",
|
|
(DWORD)heap, (DWORD)block );
|
|
return FALSE;
|
|
}
|
|
return HEAP_ValidateInUseArena( subheap, (ARENA_INUSE *)block - 1 );
|
|
}
|
|
|
|
subheap = &heapPtr->subheap;
|
|
while (subheap)
|
|
{
|
|
char *ptr = (char *)subheap + subheap->headerSize;
|
|
while (ptr < (char *)subheap + subheap->size)
|
|
{
|
|
if (*(DWORD *)ptr & ARENA_FLAG_FREE)
|
|
{
|
|
if (!HEAP_ValidateFreeArena( subheap, (ARENA_FREE *)ptr ))
|
|
return FALSE;
|
|
ptr += sizeof(ARENA_FREE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
|
|
}
|
|
else
|
|
{
|
|
if (!HEAP_ValidateInUseArena( subheap, (ARENA_INUSE *)ptr ))
|
|
return FALSE;
|
|
ptr += sizeof(ARENA_INUSE) + (*(DWORD *)ptr & ARENA_SIZE_MASK);
|
|
}
|
|
}
|
|
subheap = subheap->next;
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HeapWalk (KERNEL32.344)
|
|
* Enumerates the memory blocks in a specified heap.
|
|
*
|
|
* RETURNS
|
|
* TRUE: Success
|
|
* FALSE: Failure
|
|
*/
|
|
BOOL32 WINAPI HeapWalk(
|
|
HANDLE32 heap, /* [in] Handle to heap to enumerate */
|
|
LPPROCESS_HEAP_ENTRY *entry /* [out] Pointer to structure of enumeration info */
|
|
) {
|
|
FIXME(heap, "(%08x): stub.\n", heap );
|
|
return FALSE;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_xalloc
|
|
*
|
|
* Same as HeapAlloc(), but die on failure.
|
|
*/
|
|
LPVOID HEAP_xalloc( HANDLE32 heap, DWORD flags, DWORD size )
|
|
{
|
|
LPVOID p = HeapAlloc( heap, flags, size );
|
|
if (!p)
|
|
{
|
|
MSG("Virtual memory exhausted.\n" );
|
|
exit(1);
|
|
}
|
|
return p;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_strdupA
|
|
*/
|
|
LPSTR HEAP_strdupA( HANDLE32 heap, DWORD flags, LPCSTR str )
|
|
{
|
|
LPSTR p = HEAP_xalloc( heap, flags, strlen(str) + 1 );
|
|
strcpy( p, str );
|
|
return p;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_strdupW
|
|
*/
|
|
LPWSTR HEAP_strdupW( HANDLE32 heap, DWORD flags, LPCWSTR str )
|
|
{
|
|
INT32 len = lstrlen32W(str) + 1;
|
|
LPWSTR p = HEAP_xalloc( heap, flags, len * sizeof(WCHAR) );
|
|
lstrcpy32W( p, str );
|
|
return p;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_strdupAtoW
|
|
*/
|
|
LPWSTR HEAP_strdupAtoW( HANDLE32 heap, DWORD flags, LPCSTR str )
|
|
{
|
|
LPWSTR ret;
|
|
|
|
if (!str) return NULL;
|
|
ret = HEAP_xalloc( heap, flags, (strlen(str)+1) * sizeof(WCHAR) );
|
|
lstrcpyAtoW( ret, str );
|
|
return ret;
|
|
}
|
|
|
|
|
|
/***********************************************************************
|
|
* HEAP_strdupWtoA
|
|
*/
|
|
LPSTR HEAP_strdupWtoA( HANDLE32 heap, DWORD flags, LPCWSTR str )
|
|
{
|
|
LPSTR ret;
|
|
|
|
if (!str) return NULL;
|
|
ret = HEAP_xalloc( heap, flags, lstrlen32W(str) + 1 );
|
|
lstrcpyWtoA( ret, str );
|
|
return ret;
|
|
}
|
|
|
|
|
|
|
|
/***********************************************************************
|
|
* 32-bit local heap functions (Win95; undocumented)
|
|
*/
|
|
|
|
#define HTABLE_SIZE 0x10000
|
|
#define HTABLE_PAGESIZE 0x1000
|
|
#define HTABLE_NPAGES (HTABLE_SIZE / HTABLE_PAGESIZE)
|
|
|
|
#pragma pack(1)
|
|
typedef struct _LOCAL32HEADER
|
|
{
|
|
WORD freeListFirst[HTABLE_NPAGES];
|
|
WORD freeListSize[HTABLE_NPAGES];
|
|
WORD freeListLast[HTABLE_NPAGES];
|
|
|
|
DWORD selectorTableOffset;
|
|
WORD selectorTableSize;
|
|
WORD selectorDelta;
|
|
|
|
DWORD segment;
|
|
LPBYTE base;
|
|
|
|
DWORD limit;
|
|
DWORD flags;
|
|
|
|
DWORD magic;
|
|
HANDLE32 heap;
|
|
|
|
} LOCAL32HEADER;
|
|
#pragma pack(4)
|
|
|
|
#define LOCAL32_MAGIC ((DWORD)('L' | ('H'<<8) | ('3'<<16) | ('2'<<24)))
|
|
|
|
/***********************************************************************
|
|
* Local32Init (KERNEL.208)
|
|
*/
|
|
HANDLE32 WINAPI Local32Init( WORD segment, DWORD tableSize,
|
|
DWORD heapSize, DWORD flags )
|
|
{
|
|
DWORD totSize, segSize = 0;
|
|
LPBYTE base;
|
|
LOCAL32HEADER *header;
|
|
HEAP *heap;
|
|
WORD *selectorTable;
|
|
WORD selectorEven, selectorOdd;
|
|
int i, nrBlocks;
|
|
|
|
/* Determine new heap size */
|
|
|
|
if ( segment )
|
|
if ( (segSize = GetSelectorLimit( segment )) == 0 )
|
|
return 0;
|
|
else
|
|
segSize++;
|
|
|
|
if ( heapSize == -1L )
|
|
heapSize = 1024L*1024L; /* FIXME */
|
|
|
|
heapSize = (heapSize + 0xffff) & 0xffff0000;
|
|
segSize = (segSize + 0x0fff) & 0xfffff000;
|
|
totSize = segSize + HTABLE_SIZE + heapSize;
|
|
|
|
|
|
/* Allocate memory and initialize heap */
|
|
|
|
if ( !(base = VirtualAlloc( NULL, totSize, MEM_RESERVE, PAGE_READWRITE )) )
|
|
return 0;
|
|
|
|
if ( !VirtualAlloc( base, segSize + HTABLE_PAGESIZE,
|
|
MEM_COMMIT, PAGE_READWRITE ) )
|
|
{
|
|
VirtualFree( base, 0, MEM_RELEASE );
|
|
return 0;
|
|
}
|
|
|
|
heap = (HEAP *)(base + segSize + HTABLE_SIZE);
|
|
if ( !HEAP_InitSubHeap( heap, (LPVOID)heap, 0, 0x10000, heapSize ) )
|
|
{
|
|
VirtualFree( base, 0, MEM_RELEASE );
|
|
return 0;
|
|
}
|
|
|
|
|
|
/* Set up header and handle table */
|
|
|
|
header = (LOCAL32HEADER *)(base + segSize);
|
|
header->base = base;
|
|
header->limit = HTABLE_PAGESIZE-1;
|
|
header->flags = 0;
|
|
header->magic = LOCAL32_MAGIC;
|
|
header->heap = (HANDLE32)heap;
|
|
|
|
header->freeListFirst[0] = sizeof(LOCAL32HEADER);
|
|
header->freeListLast[0] = HTABLE_PAGESIZE - 4;
|
|
header->freeListSize[0] = (HTABLE_PAGESIZE - sizeof(LOCAL32HEADER)) / 4;
|
|
|
|
for (i = header->freeListFirst[0]; i < header->freeListLast[0]; i += 4)
|
|
*(DWORD *)((LPBYTE)header + i) = i+4;
|
|
|
|
header->freeListFirst[1] = 0xffff;
|
|
|
|
|
|
/* Set up selector table */
|
|
|
|
nrBlocks = (totSize + 0x7fff) >> 15;
|
|
selectorTable = (LPWORD) HeapAlloc( header->heap, 0, nrBlocks * 2 );
|
|
selectorEven = SELECTOR_AllocBlock( base, totSize,
|
|
SEGMENT_DATA, FALSE, FALSE );
|
|
selectorOdd = SELECTOR_AllocBlock( base + 0x8000, totSize - 0x8000,
|
|
SEGMENT_DATA, FALSE, FALSE );
|
|
|
|
if ( !selectorTable || !selectorEven || !selectorOdd )
|
|
{
|
|
if ( selectorTable ) HeapFree( header->heap, 0, selectorTable );
|
|
if ( selectorEven ) SELECTOR_FreeBlock( selectorEven, totSize >> 16 );
|
|
if ( selectorOdd ) SELECTOR_FreeBlock( selectorOdd, (totSize-0x8000) >> 16 );
|
|
HeapDestroy( header->heap );
|
|
VirtualFree( base, 0, MEM_RELEASE );
|
|
return 0;
|
|
}
|
|
|
|
header->selectorTableOffset = (LPBYTE)selectorTable - header->base;
|
|
header->selectorTableSize = nrBlocks * 4; /* ??? Win95 does it this way! */
|
|
header->selectorDelta = selectorEven - selectorOdd;
|
|
header->segment = segment? segment : selectorEven;
|
|
|
|
for (i = 0; i < nrBlocks; i++)
|
|
selectorTable[i] = (i & 1)? selectorOdd + ((i >> 1) << __AHSHIFT)
|
|
: selectorEven + ((i >> 1) << __AHSHIFT);
|
|
|
|
/* Move old segment */
|
|
|
|
if ( segment )
|
|
{
|
|
/* FIXME: This is somewhat ugly and relies on implementation
|
|
details about 16-bit global memory handles ... */
|
|
|
|
LPBYTE oldBase = (LPBYTE)GetSelectorBase( segment );
|
|
memcpy( base, oldBase, segSize );
|
|
GLOBAL_MoveBlock( segment, base, totSize );
|
|
HeapFree( SystemHeap, 0, oldBase );
|
|
}
|
|
|
|
return (HANDLE32)header;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32_SearchHandle
|
|
*/
|
|
static LPDWORD Local32_SearchHandle( LOCAL32HEADER *header, DWORD addr )
|
|
{
|
|
LPDWORD handle;
|
|
|
|
for ( handle = (LPDWORD)((LPBYTE)header + sizeof(LOCAL32HEADER));
|
|
handle < (LPDWORD)((LPBYTE)header + header->limit);
|
|
handle++)
|
|
{
|
|
if (*handle == addr)
|
|
return handle;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32_ToHandle
|
|
*/
|
|
static VOID Local32_ToHandle( LOCAL32HEADER *header, INT16 type,
|
|
DWORD addr, LPDWORD *handle, LPBYTE *ptr )
|
|
{
|
|
*handle = NULL;
|
|
*ptr = NULL;
|
|
|
|
switch (type)
|
|
{
|
|
case -2: /* 16:16 pointer, no handles */
|
|
*ptr = PTR_SEG_TO_LIN( addr );
|
|
*handle = (LPDWORD)*ptr;
|
|
break;
|
|
|
|
case -1: /* 32-bit offset, no handles */
|
|
*ptr = header->base + addr;
|
|
*handle = (LPDWORD)*ptr;
|
|
break;
|
|
|
|
case 0: /* handle */
|
|
if ( addr >= sizeof(LOCAL32HEADER)
|
|
&& addr < header->limit && !(addr & 3)
|
|
&& *(LPDWORD)((LPBYTE)header + addr) >= HTABLE_SIZE )
|
|
{
|
|
*handle = (LPDWORD)((LPBYTE)header + addr);
|
|
*ptr = header->base + **handle;
|
|
}
|
|
break;
|
|
|
|
case 1: /* 16:16 pointer */
|
|
*ptr = PTR_SEG_TO_LIN( addr );
|
|
*handle = Local32_SearchHandle( header, *ptr - header->base );
|
|
break;
|
|
|
|
case 2: /* 32-bit offset */
|
|
*ptr = header->base + addr;
|
|
*handle = Local32_SearchHandle( header, *ptr - header->base );
|
|
break;
|
|
}
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32_FromHandle
|
|
*/
|
|
static VOID Local32_FromHandle( LOCAL32HEADER *header, INT16 type,
|
|
DWORD *addr, LPDWORD handle, LPBYTE ptr )
|
|
{
|
|
switch (type)
|
|
{
|
|
case -2: /* 16:16 pointer */
|
|
case 1:
|
|
{
|
|
WORD *selTable = (LPWORD)(header->base + header->selectorTableOffset);
|
|
DWORD offset = (LPBYTE)ptr - header->base;
|
|
*addr = MAKELONG( offset & 0x7fff, selTable[offset >> 15] );
|
|
}
|
|
break;
|
|
|
|
case -1: /* 32-bit offset */
|
|
case 2:
|
|
*addr = ptr - header->base;
|
|
break;
|
|
|
|
case 0: /* handle */
|
|
*addr = (LPBYTE)handle - (LPBYTE)header;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32Alloc (KERNEL.209)
|
|
*/
|
|
DWORD WINAPI Local32Alloc( HANDLE32 heap, DWORD size, INT16 type, DWORD flags )
|
|
{
|
|
LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
|
|
LPDWORD handle;
|
|
LPBYTE ptr;
|
|
DWORD addr;
|
|
|
|
/* Allocate memory */
|
|
ptr = HeapAlloc( header->heap,
|
|
(flags & LMEM_MOVEABLE)? HEAP_ZERO_MEMORY : 0, size );
|
|
if (!ptr) return 0;
|
|
|
|
|
|
/* Allocate handle if requested */
|
|
if (type >= 0)
|
|
{
|
|
int page, i;
|
|
|
|
/* Find first page of handle table with free slots */
|
|
for (page = 0; page < HTABLE_NPAGES; page++)
|
|
if (header->freeListFirst[page] != 0)
|
|
break;
|
|
if (page == HTABLE_NPAGES)
|
|
{
|
|
WARN( heap, "Out of handles!\n" );
|
|
HeapFree( header->heap, 0, ptr );
|
|
return 0;
|
|
}
|
|
|
|
/* If virgin page, initialize it */
|
|
if (header->freeListFirst[page] == 0xffff)
|
|
{
|
|
if ( !VirtualAlloc( (LPBYTE)header + (page << 12),
|
|
0x1000, MEM_COMMIT, PAGE_READWRITE ) )
|
|
{
|
|
WARN( heap, "Cannot grow handle table!\n" );
|
|
HeapFree( header->heap, 0, ptr );
|
|
return 0;
|
|
}
|
|
|
|
header->limit += HTABLE_PAGESIZE;
|
|
|
|
header->freeListFirst[page] = 0;
|
|
header->freeListLast[page] = HTABLE_PAGESIZE - 4;
|
|
header->freeListSize[page] = HTABLE_PAGESIZE / 4;
|
|
|
|
for (i = 0; i < HTABLE_PAGESIZE; i += 4)
|
|
*(DWORD *)((LPBYTE)header + i) = i+4;
|
|
|
|
if (page < 31)
|
|
header->freeListFirst[page+1] = 0xffff;
|
|
}
|
|
|
|
/* Allocate handle slot from page */
|
|
handle = (LPDWORD)((LPBYTE)header + header->freeListFirst[page]);
|
|
if (--header->freeListSize[page] == 0)
|
|
header->freeListFirst[page] = header->freeListLast[page] = 0;
|
|
else
|
|
header->freeListFirst[page] = *handle;
|
|
|
|
/* Store 32-bit offset in handle slot */
|
|
*handle = ptr - header->base;
|
|
}
|
|
else
|
|
{
|
|
handle = (LPDWORD)ptr;
|
|
header->flags |= 1;
|
|
}
|
|
|
|
|
|
/* Convert handle to requested output type */
|
|
Local32_FromHandle( header, type, &addr, handle, ptr );
|
|
return addr;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32ReAlloc (KERNEL.210)
|
|
*/
|
|
DWORD WINAPI Local32ReAlloc( HANDLE32 heap, DWORD addr, INT16 type,
|
|
DWORD size, DWORD flags )
|
|
{
|
|
LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
|
|
LPDWORD handle;
|
|
LPBYTE ptr;
|
|
|
|
if (!addr)
|
|
return Local32Alloc( heap, size, type, flags );
|
|
|
|
/* Retrieve handle and pointer */
|
|
Local32_ToHandle( header, type, addr, &handle, &ptr );
|
|
if (!handle) return FALSE;
|
|
|
|
/* Reallocate memory block */
|
|
ptr = HeapReAlloc( header->heap,
|
|
(flags & LMEM_MOVEABLE)? HEAP_ZERO_MEMORY : 0,
|
|
ptr, size );
|
|
if (!ptr) return 0;
|
|
|
|
/* Modify handle */
|
|
if (type >= 0)
|
|
*handle = ptr - header->base;
|
|
else
|
|
handle = (LPDWORD)ptr;
|
|
|
|
/* Convert handle to requested output type */
|
|
Local32_FromHandle( header, type, &addr, handle, ptr );
|
|
return addr;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32Free (KERNEL.211)
|
|
*/
|
|
BOOL32 WINAPI Local32Free( HANDLE32 heap, DWORD addr, INT16 type )
|
|
{
|
|
LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
|
|
LPDWORD handle;
|
|
LPBYTE ptr;
|
|
|
|
/* Retrieve handle and pointer */
|
|
Local32_ToHandle( header, type, addr, &handle, &ptr );
|
|
if (!handle) return FALSE;
|
|
|
|
/* Free handle if necessary */
|
|
if (type >= 0)
|
|
{
|
|
int offset = (LPBYTE)handle - (LPBYTE)header;
|
|
int page = offset >> 12;
|
|
|
|
/* Return handle slot to page free list */
|
|
if (header->freeListSize[page]++ == 0)
|
|
header->freeListFirst[page] = header->freeListLast[page] = offset;
|
|
else
|
|
*(LPDWORD)((LPBYTE)header + header->freeListLast[page]) = offset,
|
|
header->freeListLast[page] = *handle;
|
|
|
|
*handle = 0;
|
|
|
|
/* Shrink handle table when possible */
|
|
while (page > 0 && header->freeListSize[page] == HTABLE_PAGESIZE / 4)
|
|
{
|
|
if ( VirtualFree( (LPBYTE)header +
|
|
(header->limit & ~(HTABLE_PAGESIZE-1)),
|
|
HTABLE_PAGESIZE, MEM_DECOMMIT ) )
|
|
break;
|
|
|
|
header->limit -= HTABLE_PAGESIZE;
|
|
header->freeListFirst[page] = -1;
|
|
page--;
|
|
}
|
|
}
|
|
|
|
/* Free memory */
|
|
return HeapFree( header->heap, 0, ptr );
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32Translate (KERNEL.213)
|
|
*/
|
|
DWORD WINAPI Local32Translate( HANDLE32 heap, DWORD addr, INT16 type1, INT16 type2 )
|
|
{
|
|
LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
|
|
LPDWORD handle;
|
|
LPBYTE ptr;
|
|
|
|
Local32_ToHandle( header, type1, addr, &handle, &ptr );
|
|
if (!handle) return 0;
|
|
|
|
Local32_FromHandle( header, type2, &addr, handle, ptr );
|
|
return addr;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32Size (KERNEL.214)
|
|
*/
|
|
DWORD WINAPI Local32Size( HANDLE32 heap, DWORD addr, INT16 type )
|
|
{
|
|
LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
|
|
LPDWORD handle;
|
|
LPBYTE ptr;
|
|
|
|
Local32_ToHandle( header, type, addr, &handle, &ptr );
|
|
if (!handle) return 0;
|
|
|
|
return HeapSize( header->heap, 0, ptr );
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32ValidHandle (KERNEL.215)
|
|
*/
|
|
BOOL32 WINAPI Local32ValidHandle( HANDLE32 heap, WORD addr )
|
|
{
|
|
LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
|
|
LPDWORD handle;
|
|
LPBYTE ptr;
|
|
|
|
Local32_ToHandle( header, 0, addr, &handle, &ptr );
|
|
return handle != NULL;
|
|
}
|
|
|
|
/***********************************************************************
|
|
* Local32GetSegment (KERNEL.229)
|
|
*/
|
|
WORD WINAPI Local32GetSegment( HANDLE32 heap )
|
|
{
|
|
LOCAL32HEADER *header = (LOCAL32HEADER *)heap;
|
|
return header->segment;
|
|
}
|
|
|
|
|