1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/*
* Really really *really* Q&D malloc() and free() implementations
* just to get going. Don't ever let anyone see this shit. :^)
*/
#include "types.h"
#include "kmalloc.h"
#include "StdLib.h"
#include "i386.h"
#include "VGA.h"
#include "system.h"
#include "Assertions.h"
#include <AK/Lock.h>
#define SANITIZE_KMALLOC
typedef struct
{
DWORD start;
DWORD nchunk;
} PACKED allocation_t;
#define CHUNK_SIZE 128
#define POOL_SIZE (512 * 1024)
#define BASE_PHYS 0x200000
PRIVATE BYTE alloc_map[POOL_SIZE / CHUNK_SIZE / 8];
DWORD sum_alloc = 0;
DWORD sum_free = POOL_SIZE;
static SpinLock s_kmallocLock;
PUBLIC void
kmalloc_init()
{
s_kmallocLock.init();
memset( &alloc_map, 0, sizeof(alloc_map) );
memset( (void *)BASE_PHYS, 0, POOL_SIZE );
sum_alloc = 0;
sum_free = POOL_SIZE;
}
PUBLIC void *
kmalloc( DWORD size )
{
Locker locker(s_kmallocLock);
DWORD chunks_needed, chunks_here, first_chunk;
DWORD real_size;
DWORD i, j, k;
/* We need space for the allocation_t structure at the head of the block. */
real_size = size + sizeof(allocation_t);
if (sum_free < real_size) {
kprintf("kmalloc(): PANIC! Out of memory (sucks, dude)\nsum_free=%u, real_size=%x\n", sum_free, real_size);
HANG;
return 0L;
}
chunks_needed = real_size / CHUNK_SIZE;
if( real_size % CHUNK_SIZE )
chunks_needed++;
chunks_here = 0;
first_chunk = 0;
for( i = 0; i < (POOL_SIZE / CHUNK_SIZE / 8); ++i )
{
for( j = 0; j < 8; ++j )
{
if( !(alloc_map[i] & (1<<j)) )
{
if( chunks_here == 0 )
{
/* Mark where potential allocation starts. */
first_chunk = i * 8 + j;
}
chunks_here++;
if( chunks_here == chunks_needed )
{
auto* a = (allocation_t *)(BASE_PHYS + (first_chunk * CHUNK_SIZE));
BYTE *ptr = (BYTE *)a;
ptr += sizeof(allocation_t);
a->nchunk = chunks_needed;
a->start = first_chunk;
for( k = first_chunk; k < (first_chunk + chunks_needed); ++k )
{
alloc_map[k / 8] |= 1 << (k % 8);
}
sum_alloc += a->nchunk * CHUNK_SIZE;
sum_free -= a->nchunk * CHUNK_SIZE;
#ifdef SANITIZE_KMALLOC
memset(ptr, 0xbb, (a->nchunk * CHUNK_SIZE) - sizeof(allocation_t));
#endif
return ptr;
}
}
else
{
/* This is in use, so restart chunks_here counter. */
chunks_here = 0;
}
}
}
kprintf( "kmalloc(): PANIC! Out of memory (no suitable block)" );
HANG;
return 0L;
}
PUBLIC void
kfree( void *ptr )
{
if( !ptr )
return;
Locker locker(s_kmallocLock);
allocation_t *a = (allocation_t *)((((BYTE *)ptr) - sizeof(allocation_t)));
#if 0
DWORD hdr = (DWORD)a;
DWORD mhdr = hdr & ~0x7;
kprintf("hdr / mhdr %p / %p\n", hdr, mhdr);
ASSERT(hdr == mhdr);
#endif
for (DWORD k = a->start; k < (a->start + a->nchunk); ++k) {
alloc_map[k / 8] &= ~(1 << (k % 8));
}
sum_alloc -= a->nchunk * CHUNK_SIZE;
sum_free += a->nchunk * CHUNK_SIZE;
#ifdef SANITIZE_KMALLOC
memset(a, 0xaa, a->nchunk * CHUNK_SIZE);
#endif
}
void* operator new(unsigned int size)
{
return kmalloc(size);
}
void* operator new[](unsigned int size)
{
return kmalloc(size);
}
void operator delete(void* ptr)
{
return kfree(ptr);
}
void operator delete[](void* ptr)
{
return kfree(ptr);
}
void operator delete(void* ptr, unsigned int)
{
return kfree(ptr);
}
void operator delete[](void* ptr, unsigned int)
{
return kfree(ptr);
}
|
