A poorly written OS for the x86 arch. (WIP)
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
eOS/kernel/memory.c

132 lines
3.2 KiB

3 years ago
#include "memory.h"
3 years ago
#include "../drivers/vga.h"
3 years ago
#include "../lib/conv.h"
3 years ago
// https://wiki.osdev.org/Page_Frame_Allocation
// page = block
// MAX_BLOCK_SIZE_IN_BITS/8 bytes
// i.e. : bit i of byte n define status of block 8n+i
// block = 8n+i
3 years ago
// in 32-bit mode, we have access to 2^32 blocks
// which is (2^32)*BLOCK_SIZE blocks
// and with a blocksize of 1024, we git around 4.3 trillion blocks
// which is more than enough
3 years ago
3 years ago
#define CHECK_BITMAP(map, idx) ((map) & (1<<(idx)))
3 years ago
#define BLOCK_TO_MEMP(idx) (pointer)(PM_MEM_START + (idx*BLOCK_SIZE))
3 years ago
#define MEMP_TO_BLOCK(memp) (uint)((memp - PM_MEM_START)/BLOCK_SIZE)
3 years ago
3 years ago
static int bitmap = 0;
3 years ago
static uint last_block;
3 years ago
void mod_bitmap(uint bit, uint bflag) {
3 years ago
// create a bitmask that will be applied to the bitmap
int bitmask = 1 << bit;
// apply the bitmask, resulting in the bit:n bit will set
3 years ago
// set to bflag
bitmap = (((bitmap & ~bitmask)) | (bflag << bit));
3 years ago
}
3 years ago
3 years ago
pointer block_alloc(uint blockidx) {
int block_bflag;
block_bflag = CHECK_BITMAP(bitmap, blockidx);
3 years ago
if( block_bflag == BM_FREE ) { // check if block is free
mod_bitmap(blockidx, 1);
3 years ago
last_block = blockidx;
3 years ago
return BLOCK_TO_MEMP(blockidx);
3 years ago
} else {
3 years ago
println("[ERROR] Attemped to allocate non-free block.", URGENT_COLOR);
3 years ago
return 0;
3 years ago
}
}
3 years ago
void block_free(uint blockidx) {
println("Dealloc block...", DEFAULT_COLOR);
mod_bitmap(blockidx, BM_FREE);
3 years ago
last_block = blockidx;
}
3 years ago
bool check_block_range(uint start, uint end) {
bool allowed = true;
uint idx;
for(idx = start; idx <= end; idx++) {
3 years ago
if( CHECK_BITMAP(bitmap, idx) != BM_FREE ) {
3 years ago
allowed = false;
break;
3 years ago
}
3 years ago
}
return allowed;
}
int find_free(uint block_count) {
// Loop through bitmap starting at last_block
3 years ago
for( uint lower = 0; lower < MAX_BLOCK_COUNT - block_count; lower++ ) {
3 years ago
bool range_is_free = check_block_range(lower, lower + block_count);
3 years ago
if(range_is_free == true) { // if range is free
3 years ago
return lower;
3 years ago
}
}
3 years ago
return -1; // return the lower block index
3 years ago
}
void pm_malloc_range(ulong start, ulong end, bool force) {
uint idx_start;
uint idx_end;
ulong d_addr = end - start; // memory size
uint num_blocks = (d_addr/BLOCK_SIZE) + 1; // amount of blocks to be allocated
uint start_block = MEMP_TO_BLOCK(start); // start idx, end = start_block + num_blocks - 1
bool allowed = true && check_block_range(start_block, start_block + num_blocks - 1);
// allocate (if permitted)
if( allowed ) {
uint idx;
for(idx=start_block; idx <= start_block + num_blocks - 1; idx++)
block_alloc(idx);
return;
} else {
3 years ago
println("[ERROR] Tried to allocate memory range without permission!", URGENT_COLOR);
return;
}
}
3 years ago
pointer pm_malloc(uint block_count) {
3 years ago
// failsafe if the dev is a moron
if( block_count < 1 ) {
println("[ERROR] Attempted to allocated zero blocks!", URGENT_COLOR);
return 0x0;
}
// find free block range and get lower offset
int lower;
lower = find_free(block_count);
3 years ago
if( lower < 0 ) {
3 years ago
println("malloc: out of memory!", URGENT_COLOR);
// do some out-of-memory interupt
return 0x0;
3 years ago
}
// allocate those blocks
3 years ago
uint i;
3 years ago
for( i = lower; i <= lower + block_count - 1; i++ )
block_alloc(i);
3 years ago
// return pointer to start of first block
3 years ago
return BLOCK_TO_MEMP(lower);
3 years ago
}