1
0
mirror of https://gitlab.os-k.eu/os-k-team/os-k.git synced 2023-08-25 14:03:10 +02:00
os-k/kaleid/kernel/mm/map.c

163 lines
6.2 KiB
C
Raw Normal View History

2019-03-18 17:43:54 +01:00
//----------------------------------------------------------------------------//
// GNU GPL OS/K //
// //
2019-03-24 20:25:11 +01:00
// Desc: Mapping and checking memory related functions //
2019-03-18 17:43:54 +01:00
// //
// //
// Copyright © 2018-2019 The OS/K Team //
// //
// This file is part of OS/K. //
// //
// OS/K is free software: you can redistribute it and/or modify //
// it under the terms of the GNU General Public License as published by //
// the Free Software Foundation, either version 3 of the License, or //
// any later version. //
// //
// OS/K is distributed in the hope that it will be useful, //
// but WITHOUT ANY WARRANTY//without even the implied warranty of //
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the //
// GNU General Public License for more details. //
// //
// You should have received a copy of the GNU General Public License //
// along with OS/K. If not, see <https://www.gnu.org/licenses/>. //
//----------------------------------------------------------------------------//
#include <kernel/mm.h>
2019-03-18 17:49:34 +01:00
#include <kernel/term.h>
2019-03-24 20:25:11 +01:00
#include <kernel/multiboot.h>
2019-03-18 17:43:54 +01:00
2019-03-24 20:25:11 +01:00
2019-03-24 21:16:19 +01:00
MemoryMap_t memoryMap = { 0 };
2019-03-24 20:25:11 +01:00
//
// Initilization of the memory map, and computation of the available ram size
//
2019-03-24 14:44:59 +01:00
error_t MmInitMemoryMap(void)
2019-03-18 17:43:54 +01:00
{
2019-03-24 20:25:11 +01:00
multiboot_memory_map_t *currentEntry;
multiboot_memory_map_t *mapEnd;
uint i = 0;
// sanity checks
2019-03-24 14:44:59 +01:00
if (!BtGetBootInfo(memory).memValid && BtGetBootInfo(memory).mapValid)
2019-03-21 13:30:17 +01:00
return ENXIO;
2019-03-24 14:44:59 +01:00
if ((BtGetBootInfo(memory).upMemory / (MB/KB)) <= MINIMUM_RAM_SIZE)
2019-03-21 13:30:17 +01:00
return ENOMEM;
2019-03-24 20:25:11 +01:00
// Ok then we can work ------------------------------------------------------ //
// the memory map provided by GRUB via the BIOS
2019-03-24 21:16:19 +01:00
currentEntry = (multiboot_memory_map_t*)BtGetBootInfo(memory).mapAddr;
2019-03-24 20:25:11 +01:00
// End address of the map
mapEnd = (multiboot_memory_map_t*)
2019-03-25 17:33:51 +01:00
((ulong)currentEntry + (ulong)BtGetBootInfo(memory).mapLength);
2019-03-24 20:25:11 +01:00
// fill the map
while (currentEntry < mapEnd) {
// memory zone address
2019-03-25 17:33:51 +01:00
memoryMap.entry[i].addr = (void*)((ulong)currentEntry->addr_low +
(((ulong)currentEntry->addr_high) << 32 ));
2019-03-24 20:25:11 +01:00
// memory zone size in bytes
2019-03-25 17:33:51 +01:00
memoryMap.entry[i].length = (ulong)currentEntry->len_low +
(((ulong)currentEntry->len_high) << 32);
2019-03-24 20:25:11 +01:00
// memory availability
memoryMap.entry[i].type = (uint)currentEntry->type;
// Adding the size to the size (yup)
memoryMap.length++;
// moving up !
2019-03-25 17:33:51 +01:00
currentEntry = (multiboot_memory_map_t*) ((ulong)currentEntry +
currentEntry->size + sizeof(currentEntry->size));
2019-03-24 20:25:11 +01:00
i++;
}
DebugLog("[InitMemoryMap] %d entries detected in the memory map\n",
memoryMap.length);
// compute the free ram size
for (i = 0; i < memoryMap.length; i++) {
if (memoryMap.entry[i].type == AVAILABLE_ZONE) {
memoryMap.freeRamSize += memoryMap.entry[i].length;
} else {
memoryMap.nonfreeRamSize += memoryMap.entry[i].length;
}
}
// Trully strange if it happens...
if (memoryMap.freeRamSize < MINIMUM_RAM_SIZE)
return ENOMEM;
KernLog("[InitMemoryMap] Available Ram Size : %u Mio, Used Ram Size : %u Kio\n",
memoryMap.freeRamSize / MB, memoryMap.nonfreeRamSize / KB);
KernLog("[InitMemoryMap] Physical Ram Size : %d Mio\n\n",
(memoryMap.freeRamSize + memoryMap.nonfreeRamSize) / MB);
2019-03-21 13:30:17 +01:00
2019-03-19 13:38:09 +01:00
return EOK;
2019-03-18 17:43:54 +01:00
}
2019-03-24 21:16:19 +01:00
size_t MmGetAvailZoneSize(void *start) {
2019-03-24 20:25:11 +01:00
uint i;
// Because the kernel is the kernel
2019-03-24 21:16:19 +01:00
if (start < BtGetBootInfo(btldr).kernelEndAddr)
2019-03-24 20:25:11 +01:00
return 0;
// Search the zone where the start address is
for (i = 0; i < memoryMap.length; i++) {
// if the address is in an available zone, we can return the length
if (
memoryMap.entry[i].type == AVAILABLE_ZONE &&
2019-03-25 17:33:51 +01:00
(ulong)start >= (ulong)memoryMap.entry[i].addr &&
(ulong)start < ((ulong)memoryMap.entry[i].addr +
(ulong)memoryMap.entry[i].length)
2019-03-24 20:25:11 +01:00
) {
2019-03-25 17:33:51 +01:00
return (size_t)((ulong)memoryMap.entry[i].length - (ulong)start);
2019-03-24 20:25:11 +01:00
}
}
// If there is no zone, we return a 0 size
return 0;
}
2019-03-24 21:16:19 +01:00
void *MmGetFirstAvailZone(void *start) {
2019-03-24 20:25:11 +01:00
uint i;
void *current = 0;
// Because the kernel is the kernel
2019-03-25 17:33:51 +01:00
if ((ulong)start < (ulong)BtGetBootInfo(btldr).kernelEndAddr) {
2019-03-24 21:24:21 +01:00
return MmGetFirstAvailZone(BtGetBootInfo(btldr).kernelEndAddr);
2019-03-24 20:25:11 +01:00
}
// Search the zone where the start address is
for (i = 0; i < memoryMap.length; i++) {
// if the address is in an available zone, we can return the start address
if (
memoryMap.entry[i].type == AVAILABLE_ZONE &&
2019-03-25 17:33:51 +01:00
(ulong)start >= (ulong)memoryMap.entry[i].addr &&
(ulong)start < ((ulong)memoryMap.entry[i].addr +
(ulong)memoryMap.entry[i].length)
2019-03-24 20:25:11 +01:00
) {
current = start;
break;
}
}
if (current)
return current;
// Search the first zone from start
for (i = 0; i < memoryMap.length; i++) {
// Return the first zone that is after start
if (
memoryMap.entry[i].type == AVAILABLE_ZONE &&
2019-03-25 17:33:51 +01:00
(ulong)start <= (ulong)memoryMap.entry[i].addr
2019-03-24 20:25:11 +01:00
) {
current = memoryMap.entry[i].addr;
break;
}
}
return current;
2019-03-18 17:43:54 +01:00
}