Advanced Operating Systems
COMP9242 2012/S2 |
UNSW
CRICOS Provider Number: 00098G |
Printer-Friendly
Version
|
M3: A pagerUse your memory manager from M2 to write a simple pager. Current Implementation The current implementation simply pre-maps in the pages for
the single binary that our initial code supports. Any actual VM
faults simply trigger an assert() which halts the system. The
executable itself is mapped in with untracked frames (i.e. we leak
them), and finally, the current sos
application The MilestoneIn this milestone you will:
Design alternativesProbably the main thing that you should consider here is the layout of your processes address space. Some things you will want to consider is where you place various parts of memory such as the stack, heap and code segments. You may also have some other regions in your process address space, one of these is the IPC Buffer. You should also think about if you want to make different ranges of the address space have different permissions, eg: you may want to make code read-only to prevent bugs, or have a guard page at the end of your stack to prevent overflow. AssessmentThe main demonstration here will be to show a user process running with a high stack pointer (> 0x2000000). You should also demonstrate a user process using malloc() from a heap. #define NPAGES 128 /* called from pt_test */ static void do_pt_test( char *buf ) { int i; /* set */ for(i = 0; i < NPAGES; i += 4) buf[i * 1024] = i; /* check */ for(i = 0; i < NPAGES; i += 4) assert(buf[i*1024] == i); } static void pt_test( void ) { /* need a decent sized stack */ char buf1[NPAGES * 1024], *buf2 = NULL; /* check the stack is above phys mem */ assert((void *) buf1 > (void *) 0x2000000); /* stack test */ do_pt_test(buf1); /* heap test */ buf2 = malloc(NPAGES * 1024); assert(buf2); do_pt_test(buf2); free(buf2); } You should also be able to explain to the tutor how your code works and any design decisions you took. Last modified: 24 Jul 2012. |