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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
// MIT License, Copyright (c) 2020 Marvin Borner
#include <def.h>
#include <mem.h>
#include <sys.h>
// Taken from jgraef at osdev
void *memcpy(void *dest, const void *src, u32 n)
{
u32 num_dwords = n / 4;
u32 num_bytes = n % 4;
u32 *dest32 = (u32 *)dest;
u32 *src32 = (u32 *)src;
u8 *dest8 = ((u8 *)dest) + num_dwords * 4;
u8 *src8 = ((u8 *)src) + num_dwords * 4;
u32 i;
for (i = 0; i < num_dwords; i++) {
dest32[i] = src32[i];
}
for (i = 0; i < num_bytes; i++) {
dest8[i] = src8[i];
}
return dest;
}
void *memset(void *dest, int val, u32 n)
{
u32 num_dwords = n / 4;
u32 num_bytes = n % 4;
u32 *dest32 = (u32 *)dest;
u8 *dest8 = ((u8 *)dest) + num_dwords * 4;
u8 val8 = (u8)val;
u32 val32 = val | (val << 8) | (val << 16) | (val << 24);
u32 i;
for (i = 0; i < num_dwords; i++) {
dest32[i] = val32;
}
for (i = 0; i < num_bytes; i++) {
dest8[i] = val8;
}
return dest;
}
void *memchr(void *src, int c, u32 n)
{
const u8 *s = (const u8 *)src;
while (n-- > 0) {
if (*s == c)
return (void *)s;
s++;
}
return NULL;
}
int memcmp(const void *s1, const void *s2, u32 n)
{
const u8 *a = (const u8 *)s1;
const u8 *b = (const u8 *)s2;
for (u32 i = 0; i < n; i++) {
if (a[i] < b[i])
return -1;
else if (b[i] < a[i])
return 1;
}
return 0;
}
#define ALIGNMENT 16ul
#define ALIGN_TYPE char
#define ALIGN_INFO sizeof(ALIGN_TYPE) * 16
#define ALIGN(ptr) \
if (ALIGNMENT > 1) { \
u32 diff; \
ptr = (void *)((u32)ptr + ALIGN_INFO); \
diff = (u32)ptr & (ALIGNMENT - 1); \
if (diff != 0) { \
diff = ALIGNMENT - diff; \
ptr = (void *)((u32)ptr + diff); \
} \
*((ALIGN_TYPE *)((u32)ptr - ALIGN_INFO)) = diff + ALIGN_INFO; \
}
#define UNALIGN(ptr) \
if (ALIGNMENT > 1) { \
u32 diff = *((ALIGN_TYPE *)((u32)ptr - ALIGN_INFO)); \
if (diff < (ALIGNMENT + ALIGN_INFO)) { \
ptr = (void *)((u32)ptr - diff); \
} \
}
#ifdef kernel
static u32 *heap;
static u32 index;
void heap_init(u32 start)
{
heap = (u32 *)start;
for (int i = 0; i < HEAP_SIZE; i++)
heap[i] = 0;
heap[0] = HEAP_MAGIC;
index = 1;
}
int count()
{
int i = 0;
u32 *iterator = heap + 1;
do {
iterator += iterator[0] + 1;
i++;
} while (iterator[0] != 0);
return i;
}
// TODO: Identify by pid (for freeing)
void *malloc(u32 size)
{
if (size < 1)
return NULL;
size = size + ALIGNMENT + ALIGN_INFO;
heap[index] = size;
index += size + 1;
void *p = (void *)(heap + index - size);
ALIGN(p);
return p;
}
// TODO: Implement free, realloc and find_smallest_hole
void free(void *ptr)
{
(void)ptr;
/* UNALIGN(ptr); */
}
void *realloc(void *ptr, u32 size)
{
(void)size;
return ptr;
}
#elif defined(userspace)
#define HEAP_SIZE 100000
#define kmalloc(n) (void *)sys1(SYS_MALLOC, n)
#define kfree(ptr) (void)(sys1(SYS_FREE, (int)ptr))
/* static u32 *heap = NULL; */
/* static u32 index = 0; */
/* static u32 malloced = 0; */
// TODO: Fix userspace malloc (for size > HEAP_SIZE)!
void *malloc(u32 size)
{
return kmalloc(size);
/* if (size < 1) */
/* return NULL; */
/* size = size + ALIGNMENT + ALIGN_INFO; */
/* if (!malloced || size > malloced) { */
/* heap = kmalloc(HEAP_SIZE); */
/* malloced = HEAP_SIZE; */
/* } */
/* malloced -= size; */
/* heap[index] = size; */
/* index += size + 1; */
/* void *p = (void *)(heap + index - size); */
/* ALIGN(p); */
/* return p; */
}
// TODO: Implement free, realloc and find_smallest_hole
void free(void *ptr)
{
(void)ptr;
/* UNALIGN(ptr); */
}
#endif
|
