|
28
|
1 /* Memory manager functions,
|
|
|
2 *
|
|
|
3 * Uses a bitmap to keep track of 4k pages that are in use.
|
|
|
4 *
|
|
|
5 * */
|
|
26
|
6
|
|
|
7 #include "kernel.h"
|
|
|
8
|
|
29
|
9 static uint64_t *frames = 0;
|
|
|
10 static uint64_t nframes = 0;
|
|
26
|
11
|
|
29
|
12 memmap_t* kernel_map = 0; // kernel memory mapping
|
|
|
13 memmap_t* current_map = 0; // The currently active memory mapping
|
|
|
14
|
|
|
15 static void set_frame(uint64_t frame)
|
|
26
|
16 {
|
|
|
17 uint64_t idx = frame / 64;
|
|
|
18 uint64_t off = frame % 64;
|
|
|
19 frames[idx] |= (0x1 << off);
|
|
|
20 }
|
|
|
21
|
|
29
|
22 static void clear_frame(uint64_t frame)
|
|
26
|
23 {
|
|
|
24 uint64_t idx = frame / 64;
|
|
|
25 uint64_t off = frame % 64;
|
|
|
26 frames[idx] &= ~(0x1 << off);
|
|
|
27 }
|
|
|
28
|
|
|
29 uint64_t test_frame(uint64_t frame)
|
|
|
30 {
|
|
|
31 uint64_t idx = frame / 64;
|
|
|
32 uint64_t off = frame % 64;
|
|
|
33 return (frames[idx] & (0x1 << off));
|
|
|
34 }
|
|
|
35
|
|
29
|
36 static uint64_t first_frame()
|
|
26
|
37 {
|
|
|
38 uint64_t i, j;
|
|
28
|
39 for (i = 0; i < nframes / 64; i++)
|
|
26
|
40 {
|
|
|
41 if (frames[i] != 0xFFFFFFFFFFFFFFFF)
|
|
|
42 {
|
|
|
43 for (j = 0; j < 64; j++)
|
|
|
44 {
|
|
|
45 uint64_t dut = 0x1 << j;
|
|
|
46 if ((frames[i] & dut) != dut)
|
|
|
47 {
|
|
|
48 return i*64+j;
|
|
|
49 }
|
|
|
50 }
|
|
|
51 }
|
|
|
52 }
|
|
29
|
53
|
|
|
54 // No frame found:
|
|
|
55 return (uint64_t) -1;
|
|
26
|
56 }
|
|
|
57
|
|
|
58 // Memory manager functions:
|
|
28
|
59 void init_memory(uint64_t total_mem_size)
|
|
|
60 {
|
|
29
|
61 // Allocate and clear bits to remember which 4kb-frames are in use:
|
|
|
62 nframes = (total_mem_size / 0x1000);
|
|
|
63 frames = (uint64_t*)kmalloc_int( (nframes / 64) * sizeof(uint64_t) );
|
|
|
64 memset(frames, 0, (nframes / 64) * sizeof(uint64_t));
|
|
|
65
|
|
|
66 // Create kernel map:
|
|
|
67 kernel_map = (memmap_t*)kmalloc_aligned_int(sizeof(memmap_t));
|
|
|
68 memset(kernel_map, 0, sizeof(memmap_t));
|
|
|
69
|
|
|
70 // Identity map lower memory and mark as used by the kernel.
|
|
|
71 // Mark as used by the kernel:
|
|
|
72 uint64_t i;
|
|
|
73 i = 0;
|
|
|
74 while ( i <= placement_address)
|
|
|
75 {
|
|
|
76 page_t *page;
|
|
|
77
|
|
|
78 page = get_page(i, kernel_map); // Get page for address
|
|
|
79 page->address = i >> 12; // Set the address of this page.
|
|
|
80 page->present = 1;
|
|
|
81 page->rw = 1;
|
|
|
82 page->us = 1; // Make all things accessable for users for now.
|
|
|
83
|
|
|
84 set_frame(i / 0x1000);
|
|
|
85
|
|
|
86 i += 0x1000; // Increase a 4 k frame
|
|
|
87 }
|
|
|
88
|
|
|
89 // Set the created mapping as active:
|
|
|
90 // switch_mapping(kernel_map);
|
|
|
91 // TODO: debug crash after enable of new memory map
|
|
|
92 // TODO: set the use of placement malloc to invalid after here.
|
|
28
|
93 }
|
|
|
94
|
|
29
|
95 void alloc_frame(page_t *page)
|
|
26
|
96 {
|
|
29
|
97 if (page->address != 0)
|
|
|
98 {
|
|
|
99 return;
|
|
|
100 }
|
|
26
|
101 uint64_t idx = first_frame();
|
|
|
102 if (idx == (uint64_t) -1)
|
|
|
103 {
|
|
|
104 panic("No more memory!");
|
|
|
105 }
|
|
|
106 set_frame(idx);
|
|
29
|
107
|
|
|
108 page->present = 1;
|
|
|
109 page->rw = 1;
|
|
|
110 page->us = 0;
|
|
|
111 page->address = idx; // set address in frame number, the byte address is 0x1000 times this value.
|
|
26
|
112 }
|
|
|
113
|
|
28
|
114 void free_frame(page_t *page)
|
|
|
115 {
|
|
29
|
116 clear_frame(page->address / 0x1000);
|
|
|
117 page->address = 0;
|
|
|
118 page->present = 0;
|
|
|
119 }
|
|
|
120
|
|
|
121 void switch_mapping(memmap_t* mapping)
|
|
|
122 {
|
|
|
123 current_map = mapping;
|
|
|
124 printf("Switching to use of other at %x\n", &mapping->table);
|
|
|
125
|
|
|
126 asm volatile("mov %0, %%cr3" :: "r"(&mapping->table));
|
|
|
127
|
|
|
128 // Enable paging (and flush cache):
|
|
|
129 uint64_t cr0;
|
|
|
130 asm volatile("mov %%cr0, %0": "=r"(cr0));
|
|
|
131 cr0 |= 0x80000000;
|
|
|
132 asm volatile("mov %0, %%cr0":: "r"(cr0));
|
|
28
|
133 }
|
|
26
|
134
|
|
29
|
135 /* Get a page for a virtual address, and create other tables if required */
|
|
|
136 page_t* get_page(uint64_t address, memmap_t *mapping)
|
|
|
137 {
|
|
|
138 // Retrieve the correct PDP (page dir pointer table):
|
|
|
139 uint64_t pml4index = (address >> 39) & 0x1FF;
|
|
|
140 PDPT_t *pdpt = 0;
|
|
|
141 if (mapping->table[pml4index].present == 1)
|
|
|
142 {
|
|
|
143 pdpt = (PDPT_t*)((uint64_t)mapping->table[pml4index].address << 12);
|
|
|
144 }
|
|
|
145 else
|
|
|
146 {
|
|
|
147 // Create new table:
|
|
|
148 pdpt = (PDPT_t*)kmalloc_aligned_int(sizeof(PDPT_t));
|
|
|
149 printf("Creating PDPT %x\n", pdpt);
|
|
|
150 memset(pdpt, 0, sizeof(PDPT_t));
|
|
|
151
|
|
|
152 // TODO: get function like virt2phys or something here
|
|
|
153 uint64_t address = (uint64_t)pdpt; // get the physical address
|
|
|
154 mapping->table[pml4index].address = address >> 12; // shift right
|
|
|
155 mapping->table[pml4index].rw = 1;
|
|
|
156 mapping->table[pml4index].us = 1;
|
|
|
157 mapping->table[pml4index].present = 1;
|
|
|
158 }
|
|
|
159
|
|
|
160 uint64_t pdptindex = (address >> 30) & 0x1FF;
|
|
|
161 // Retrieve the correct page directory:
|
|
|
162 PD_t *pd = 0;
|
|
|
163 if (pdpt->table[pdptindex].present == 1)
|
|
|
164 {
|
|
|
165 pd = (PD_t*)((uint64_t)pdpt->table[pdptindex].address << 12);
|
|
|
166 }
|
|
|
167 else
|
|
|
168 {
|
|
|
169 printf("Creating PD\n");
|
|
|
170 // Create a new table:
|
|
|
171 pd = (PD_t*)kmalloc_aligned_int(sizeof(PD_t));
|
|
|
172 memset(pd, 0, sizeof(PD_t));
|
|
|
173
|
|
|
174 // Enter table into PDPT:
|
|
|
175 // TODO: make virt2phys function:
|
|
|
176 uint64_t address = (uint64_t)pd;
|
|
|
177 pdpt->table[pdptindex].address = address >> 12;
|
|
|
178 pdpt->table[pdptindex].rw = 1;
|
|
|
179 pdpt->table[pdptindex].us = 1;
|
|
|
180 pdpt->table[pdptindex].present = 1;
|
|
|
181 }
|
|
|
182
|
|
|
183 // Retrieve the correct page table:
|
|
|
184 uint64_t pdindex = (address >> 21) & 0x1FF;
|
|
|
185 PT_t *pt = 0;
|
|
|
186 if (pd->table[pdindex].present == 1)
|
|
|
187 {
|
|
|
188 pt = (PT_t*)((uint64_t)pd->table[pdindex].address << 12);
|
|
|
189 }
|
|
|
190 else
|
|
|
191 {
|
|
|
192 printf("Creating PT\n");
|
|
|
193 // Create table:
|
|
|
194 pt = (PT_t*)kmalloc_aligned_int(sizeof(PD_t));
|
|
|
195 memset(pt, 0, sizeof(PT_t));
|
|
|
196
|
|
|
197 // Enter PT into PD:
|
|
|
198 uint64_t address = (uint64_t)pt;
|
|
|
199 pd->table[pdindex].address = address >> 12;
|
|
|
200 pd->table[pdindex].rw = 1;
|
|
|
201 pd->table[pdindex].us = 1;
|
|
|
202 pd->table[pdindex].present = 1;
|
|
|
203 }
|
|
|
204
|
|
|
205 // Finally get the page from the directory:
|
|
|
206 // TODO: convert from physical address to virtual address:
|
|
|
207 uint64_t ptindex = (address >> 12) & 0x1FF;
|
|
|
208 return &pt->table[ptindex];
|
|
|
209 }
|
|
|
210
|
