mirror of
git://source.winehq.org/git/wine.git
synced 2024-07-21 01:24:09 +00:00
2c25c3e944
WHAT'S NEW with version 0.0.2:
- Again thanks to Eric Youngdale for some very useful comments.
- The Windows startup code created by Micrsoft C 7.0 now runs
to completion.
- Added a new patch to the kernel to increase the usable size of
the ldt to the full 32 entries currently allowed.
- Imported name relocations are now supported.
- Source code for my infamous test program is now included.
- A handful of basic Windows functions are now emulated. See
"kernel.spec" for examples of how to use the build program.
WHAT'S NEW with version 0.0.1:
- Eric Youngdale contributed countless improvements in memory
efficiency, bug fixes, and relocation.
- The build program has been completed. It now lets you specify
how the main DLL entry point should interface to your emulation
library routines. A brief description of how to build these
specifications is included in the file "build-spec.txt".
- The code to dispatch builtin DLL calls is complete, but untested.
94 lines
1.8 KiB
C
94 lines
1.8 KiB
C
static char RCSId[] = "$Id$";
|
|
static char Copyright[] = "Copyright Robert J. Amstadt, 1993";
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "prototypes.h"
|
|
|
|
typedef struct heap_mem_desc_s
|
|
{
|
|
struct heap_mem_desc_s *prev, *next;
|
|
int length;
|
|
} MDESC;
|
|
|
|
MDESC *FreeList;
|
|
|
|
/**********************************************************************
|
|
* HEAP_LocalInit
|
|
*/
|
|
void
|
|
HEAP_LocalInit(void *start, int length)
|
|
{
|
|
FreeList = (MDESC *) start;
|
|
FreeList->prev = NULL;
|
|
FreeList->next = NULL;
|
|
FreeList->length = length - sizeof(MDESC);
|
|
}
|
|
|
|
/**********************************************************************
|
|
* HEAP_LocalAlloc
|
|
*/
|
|
void *
|
|
HEAP_LocalAlloc(int flags, int bytes)
|
|
{
|
|
MDESC *m, *m_new;
|
|
|
|
#ifdef HEAP_DEBUG
|
|
fprintf(stderr, "LocalAlloc: flags %x, bytes %d, ", flags, bytes);
|
|
#endif
|
|
|
|
/*
|
|
* Find free block big enough.
|
|
*/
|
|
for (m = FreeList; m != NULL; m = m->next)
|
|
{
|
|
if (m->length == bytes && m->length < bytes + 4 * sizeof(MDESC))
|
|
{
|
|
break;
|
|
}
|
|
else if (m->length > bytes)
|
|
{
|
|
m_new = m + (bytes / sizeof(MDESC)) + 2;
|
|
if (m->prev == NULL)
|
|
FreeList = m_new;
|
|
else
|
|
m->prev->next = m_new;
|
|
|
|
if (m->next != NULL)
|
|
m->next->prev = m_new;
|
|
|
|
m_new->next = m->next;
|
|
m_new->prev = m->prev;
|
|
m_new->length = m->length - ((int) m_new - (int) m);
|
|
m->length -= (m_new->length + sizeof(MDESC));
|
|
|
|
#ifdef HEAP_DEBUG
|
|
fprintf(stderr, "Returning %x\n", (int) (m + 1));
|
|
#endif
|
|
return (void *) (m + 1);
|
|
}
|
|
}
|
|
|
|
if (m != NULL)
|
|
{
|
|
if (m->prev == NULL)
|
|
FreeList = m->next;
|
|
else
|
|
m->prev->next = m->next;
|
|
|
|
if (m->next != NULL)
|
|
m->next->prev = m->prev;
|
|
|
|
#ifdef HEAP_DEBUG
|
|
fprintf(stderr, "Returning %x\n", (int) (m + 1));
|
|
#endif
|
|
return (void *) (m + 1);
|
|
}
|
|
|
|
#ifdef HEAP_DEBUG
|
|
fprintf(stderr, "Returning 0\n");
|
|
#endif
|
|
return 0;
|
|
}
|
|
|