Guest User

Untitled

a guest
Feb 20th, 2013
28
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 3.09 KB | None | 0 0
  1. #include <pmm.h>
  2. #include <debug.h>
  3. #include <string.h>
  4. #include <heap.h>
  5.  
  6. #define BITMAP_SIZE 32768
  7. static uint32_t bitmap[BITMAP_SIZE];
  8.  
  9. uint32_t total_memory = 0;
  10. uint32_t free_memory;
  11.  
  12. extern void* kernel_start; // Anfang des Kernels
  13. extern void* kernel_end;   // Ende des Kernels
  14.  
  15. uint32_t get_index(uint32_t addr, uint32_t* offset)
  16. {
  17.     addr = addr / PAGESIZE;
  18.     *offset = addr % 32;
  19.     return addr / 32;
  20. }
  21.  
  22. void pfree(void* addr)
  23. {
  24.     uint32_t offset;
  25.     uint32_t index = get_index((uint32_t) addr, &offset);
  26.     bitmap[index] &= ~(1 << offset);
  27.     free_memory += 0x1000;
  28. }
  29.  
  30. static void use(void* addr)
  31. {
  32.     uint32_t offset;
  33.     uint32_t index = get_index((uint32_t) addr, &offset);
  34.     bitmap[index] |= (1 << offset);
  35.     free_memory -= 0x1000;
  36. }
  37.  
  38. static uint32_t is_free(void* addr)
  39. {
  40.     uint32_t offset;
  41.     uint32_t index = get_index((uint32_t) addr, &offset);
  42.     return (bitmap[index] & (1 << offset));
  43. }
  44.  
  45. void InitPmm(struct multiboot_info* mb_info)
  46. {
  47.     // mbs_mem_upper zählt erst hinter dem ersten Megabyte
  48.     // deshalb muss die Rechnung um eines erhöht werden
  49.     total_memory = (mb_info->mbs_mem_upper / 1024) + 1;
  50.  
  51.     assert(total_memory > MIN_MEMORY);
  52.    
  53.     struct multiboot_mmap* mmap = (struct multiboot_mmap*) mb_info->mbs_mmap_addr;
  54.    
  55.     struct multiboot_mmap* mmap_end = (struct multiboot_mmap*)((uintptr_t)
  56.             mb_info->mbs_mmap_addr + mb_info->mbs_mmap_length);
  57.  
  58.     // Alles als belegt markieren.
  59.     memset(&bitmap, 0, sizeof(uint32_t) * BITMAP_SIZE);
  60.        
  61.     // Nur was laut der BIOS Memory MAP Frei ist, wird wieder freigegeben.
  62.     while(mmap < mmap_end)
  63.     {
  64.         if (mmap->type == 1)
  65.         {
  66.             uintptr_t addr = mmap->base;
  67.             uintptr_t end_addr = addr + mmap->length;
  68.  
  69.             while (addr < end_addr)
  70.             {
  71.                 pfree((void *)addr);
  72.                 addr += 0x1000;
  73.             }
  74.         }
  75.         mmap++;
  76.     }
  77.    
  78.     // Den Kernel als belegt markieren
  79.     uintptr_t addr = (uintptr_t )&kernel_start;
  80.     while (addr < (uintptr_t )&kernel_end)
  81.     {
  82.         use((void *)addr);
  83.         addr += 0x1000;
  84.     }
  85.    
  86.     struct multiboot_module *modules =(struct multiboot_module*) mb_info->mbs_mods_addr;
  87.  
  88.     // Die Multiboot Struktur ist auch belegt.
  89.     use(mb_info);
  90.     // Die Multiboot Modul Struktur ist auch belegt.
  91.     use(modules);
  92.    
  93.     uint32_t i;
  94.     for (i = 0; i < mb_info->mbs_mods_count; i++)
  95.     {
  96.         addr = modules[i].mod_start;
  97.         while (addr < modules[i].mod_end)
  98.         {
  99.             use((void*) addr);
  100.             addr += 0x1000;
  101.         }
  102.     }
  103.  
  104.     // Heap allozieren
  105.     for(i = HEAP_START; i < HEAP_END; i += PAGESIZE)
  106.     {
  107.         use((void*) i);
  108.     }  
  109.  
  110.     // Die IVT vor überschreiben schützen.
  111.     use((void*) 0x0);
  112.    
  113.     DebugPrintf("Info: Total memory: %dMB\nInfo: Free memory: %dMB\n", total_memory, free_memory/1024/1024);
  114.     DebugLog("[ PMM ] Physical Memory management succesfully initialized.");
  115. }
  116.  
  117. /**
  118.  * Sucht eine freie Seite im Speicher, welche zwischen start und end liegt
  119.  * ACHTUNG: start und end MÜSSEN Vielfache von PAGESIZE (0x1000) sein!
  120.  */
  121. void* pmm_alloc(uint32_t start, uint32_t end)
  122. {
  123.     uint32_t i = start;
  124.     assert(start < end);
  125.    
  126.     for(; i < end; i += PAGESIZE)
  127.     {
  128.         if(is_free((void*) i) != 0)
  129.         {
  130.             use((void*) i);
  131.             return (void*) i;
  132.         }
  133.     }
  134.    
  135.     return NULL;
  136. }
Advertisement
Add Comment
Please, Sign In to add comment