| 26,7 → 26,7 |
|---|
| #include <ll/i386/x-dosmem.h> |
| #include <ll/i386/error.h> |
| |
| FILE(X - Dos - Memory); |
| FILE(X-Dos-Memory); |
| |
| /* |
| We do not use the standard K&R pointer based memory allocator! |
| 39,12 → 39,12 |
|---|
| since DOS memory is only used for reflection related purposes |
| */ |
| |
| #define MAX_PARTITION 50 /* Max available partition */ |
| #define MAX_PARTITION 50 /* Max available partition */ |
| |
| static struct { |
| BYTE used; |
| LIN_ADDR addr; |
| DWORD size; |
| BYTE used; |
| LIN_ADDR addr; |
| DWORD size; |
| } mem_table[MAX_PARTITION]; |
| |
| static int inited = 0; |
| 53,28 → 53,26 |
|---|
| { |
| register int i; |
| for (i = 0; i < MAX_PARTITION; i++) { |
| if (mem_table[i].used) |
| message("(%d) Addr : %p Size : %lu/%lx\n", |
| i, mem_table[i].addr, |
| mem_table[i].size, mem_table[i].size); |
| if (mem_table[i].used) message("(%d) Addr : %p Size : %lu/%lx\n", |
| i, mem_table[i].addr, |
| mem_table[i].size, mem_table[i].size); |
| } |
| } |
| |
| void DOS_mem_init(void) |
| __attribute__ ((weak)) void DOS_mem_init(void) |
| { |
| register int i; |
| |
| if (inited == 0) { |
| mem_table[0].used = TRUE; |
| X_meminfo(NULL, NULL, &(mem_table[0].addr), &(mem_table[0].size)); |
| for (i = 1; i < MAX_PARTITION; i++) |
| mem_table[i].used = FALSE; |
| mem_table[0].used = TRUE; |
| X_meminfo(NULL,NULL,&(mem_table[0].addr),&(mem_table[0].size)); |
| for (i = 1; i < MAX_PARTITION; i++) mem_table[i].used = FALSE; |
| } else { |
| inited = 1; |
| inited = 1; |
| } |
| } |
| |
| LIN_ADDR DOS_alloc(DWORD s) |
| __attribute__ ((weak)) LIN_ADDR DOS_alloc(DWORD s) |
| { |
| LIN_ADDR p = 0; |
| int i = 0; |
| 81,31 → 79,28 |
|---|
| |
| while (i < MAX_PARTITION && p == NULL) { |
| if (mem_table[i].used && (mem_table[i].size >= s)) |
| p = mem_table[i].addr; |
| else |
| i++; |
| p = mem_table[i].addr; |
| else i++; |
| } |
| if (p != 0) { |
| if (mem_table[i].size > s) { |
| mem_table[i].size -= s; |
| mem_table[i].addr += s; |
| } else |
| mem_table[i].used = FALSE; |
| } |
| else mem_table[i].used = FALSE; |
| } |
| return (p); |
| return(p); |
| } |
| |
| int DOS_free(LIN_ADDR p, DWORD s) |
| __attribute__ ((weak)) int DOS_free(LIN_ADDR p,DWORD s) |
| { |
| register int i = 1; |
| unsigned i1 = 0, i2 = 0; |
| |
| while (i < MAX_PARTITION && ((i1 == 0) || (i2 == 0))) { |
| while (i < MAX_PARTITION && ((i1 == 0) || (i2 == 0)) ) { |
| if (mem_table[i].used) { |
| if (mem_table[i].addr + mem_table[i].size == p) |
| i1 = i; |
| if (mem_table[i].addr == p + s) |
| i2 = i; |
| if (mem_table[i].addr + mem_table[i].size == p) i1 = i; |
| if (mem_table[i].addr == p + s) i2 = i; |
| } |
| i++; |
| } |
| 112,20 → 107,19 |
|---|
| if (i1 != 0 && i2 != 0) { |
| mem_table[i1].size += mem_table[i2].size + s; |
| mem_table[i2].used = FALSE; |
| } else if (i1 == 0 && i2 != 0) { |
| } |
| else if (i1 == 0 && i2 != 0) { |
| mem_table[i2].addr = p; |
| mem_table[i2].size += s; |
| } else if (i1 != 0 && i2 == 0) |
| mem_table[i1].size += s; |
| } |
| else if (i1 != 0 && i2 == 0) mem_table[i1].size += s; |
| else { |
| i = 0; |
| while (i < MAX_PARTITION && (mem_table[i].used == TRUE)) |
| i++; |
| if (i == MAX_PARTITION) |
| return (FALSE); |
| while (i < MAX_PARTITION && (mem_table[i].used == TRUE)) i++; |
| if (i == MAX_PARTITION) return(FALSE); |
| mem_table[i].addr = p; |
| mem_table[i].size = s; |
| mem_table[i].used = TRUE; |
| } |
| return (TRUE); |
| return(TRUE); |
| } |