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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
|
#define MEM_PRINT_MEMORYMAP
#include "kernel.h"
#include "../lib/logger/log.h" // logger facilities
#define FOOLOS_MODULE_NAME "mem"
//! 8 blocks per byte
#define PMMNGR_BLOCKS_PER_BYTE 8
//! block size (4k)
#define PMMNGR_BLOCK_SIZE 4096
//! block alignment
#define PMMNGR_BLOCK_ALIGN PMMNGR_BLOCK_SIZE
#define MEM_BITMAP_SIZE 32768
//#define MEM_BITMAP_SIZE 327
// memory map bit array. Each bit represents a memory block
//uint32_t _mmngr_memory_map[MEM_BITMAP_SIZE];
uint32_t *_mmngr_memory_map;
static uint32_t mem_free_blocks;
// bit funcs!
void mmap_set(int bit)
{
_mmngr_memory_map[bit / 32] |= (1 << (bit % 32));
}
void mmap_unset(int bit)
{
_mmngr_memory_map[bit / 32] &= ~ (1 << (bit % 32));
}
int mmap_test(int bit)
{
return _mmngr_memory_map[bit / 32] & (1 << (bit % 32));
}
void mmap_show_free ()
{
int last_pos=0;
uint32_t last=_mmngr_memory_map[0];
for (int i=1; i< MEM_BITMAP_SIZE ; i++)
{
if (_mmngr_memory_map[i] != last||i==MEM_BITMAP_SIZE-1)
{
if(last==0)
{
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"%d -%d free",last_pos*32,i*32);
}
else if(last==0xffffffff)
{
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"%d -%d full",last_pos*32,i*32);
}
else
{
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"%d -%d some free",last_pos*32,i*32);
}
last_pos=i;
last=_mmngr_memory_map[i];
}
}
}
//
int mmap_first_free ()
{
//! find the first free bit
uint32_t i;
int j;
for (i=0; i< MEM_BITMAP_SIZE ; i++)
if (_mmngr_memory_map[i] != 0xffffffff)
for (j=0; j<32; j++)
{
//! test each bit in the dword
int bit = 1 << j;
if (! (_mmngr_memory_map[i] & bit) )
return i*4*8+j;
}
return -1;
}
void pmmngr_init ()
{
//! By default, all of memory is in use
// memset (_mmngr_memory_map, 0xf, 128 );
int i;
for(i=0;i<MEM_BITMAP_SIZE;i++)
{
_mmngr_memory_map[i]=0xffffffff;
}
}
void pmmngr_init_region (uint32_t base, uint32_t size)
{
uint32_t align = base / PMMNGR_BLOCK_SIZE;
uint32_t blocks = size / PMMNGR_BLOCK_SIZE;
for (; blocks>0; blocks--)
{
// hack to lock first ~4MB of memory
if(align<1000)
{
align++;
continue;
}
mmap_unset (align++);
mem_free_blocks++;
//_mmngr_used_blocks--;
}
//mmap_set (0); //first block is always set. This insures allocs cant be 0
}
void* pmmngr_alloc_block ()
{
int frame = mmap_first_free ();
if (frame == -1)
{
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"OUT OF MEMORY");
return 0; //out of memory
}
// scr_put_string_nl("MEM ALLOC OK!");
// scr_put_hex32(frame);
// scr_put_string_nl("");
mmap_set (frame);
uint32_t addr = frame * PMMNGR_BLOCK_SIZE;
mem_free_blocks--;
return (void*)addr;
}
void pmmngr_free_block (void* p) {
uint32_t addr = (uint32_t*)p;
int frame = addr / PMMNGR_BLOCK_SIZE;
if(mmap_test(frame))
{
mmap_unset (frame);
mem_free_blocks++;
}
}
/*
void mem_test_3()
{
uint32_t *addr;
addr=pmmngr_alloc_block();
scr_put_string("alloc 1: ");
scr_put_hex32(addr);
scr_put_string_nl("");
addr=pmmngr_alloc_block();
scr_put_string("alloc 2: ");
scr_put_hex32(addr);
scr_put_string_nl("");
}
void mem_test_2()
{
//crossing 512MB boundary!
// (do not do this in real, coz it probably is reserved)
//mem_test(0x1fee1000,0x2000f000,0x800);
int cnt=-1;
uint32_t *addr;
uint32_t *lastaddr;
do{
lastaddr=addr;
addr=pmmngr_alloc_block();
cnt++;
}while(addr!=0);
scr_put_string("no mem after : ");
scr_put_hex32(cnt);
scr_put_string_nl("");
pmmngr_free_block(lastaddr);
cnt=-1;
do{
lastaddr=addr;
addr=pmmngr_alloc_block();
cnt++;
}while(addr!=0);
scr_put_string("no mem after : ");
scr_put_hex32(cnt);
scr_put_string_nl("");
}
void mem_test(int start, int end, int steps)
{
int *p=start;
for(;p<end;p+=steps)
{
scr_put_string("testing memory at ");
scr_put_hex32(p);
//
*p=p;
volatile x=*p;
if(x==p) scr_put_string(" OK");
//
scr_put_string_nl("");
}
}
*/
void mem_init(uint16_t *memmap,uint16_t entries)
{
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"the memory map contains %d entries.",entries);
// hardcoded memory bitmap!!??!
// todo: fix!
_mmngr_memory_map=0x9000;
mem_free_blocks=0;
pmmngr_init ();
// count available memory
uint32_t avail_mem=0;
int i;
//print memory map and init regions!
for(i=0;i<entries;i++)
{
// if(memmap[8]==0)break;
#ifdef MEM_PRINT_MEMORYMAP
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"type: %02d / range: 0x%08x - 0x%08x",
memmap[8],
(((uint32_t)memmap[1])<<16)+memmap[0],
(((uint32_t)memmap[1])<<16)+memmap[0]
+(((uint32_t)memmap[5])<<16)+memmap[4]);
#endif
if(memmap[8]==1)
{
avail_mem+=memmap[4]+(memmap[5]<<16);
pmmngr_init_region(memmap[0]+(memmap[1]<<16),memmap[4]+((memmap[5])<<16));
}
memmap+=12;
}
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"Available Mem: %d bytes. (~%d MB)",avail_mem,avail_mem/1024/1024);
log(FOOLOS_MODULE_NAME,FOOLOS_LOG_INFO,"Available 4K blocks: %d blocks.",mem_free_blocks);
}
|
