[CSE]  Advanced Operating Systems 
 COMP9242 2005/S2 
UNSW
CRICOS Provider
Number: 00098G

PRINTER Printer-Friendly Version
Administration               
- Notices
- Course Intro
- Consultations
- Survey Results
 
Work
- Lectures
- Selected Papers
- Project Spec
- Project FAQ
- Exam
 
Forums
- Forums
- Can't Login?
 
Documentation
- Project Resources
- ASysT Lab
- Using Sulima
- L4 Debugging Guide
- L4Ka::Pistachio FAQ
- L4 source browser
- SOS source browser
- L4 reference manual
- L4 user manual
- Sulima ISA Simulator
R4x00 ISA Summary 
MIPS R4700 ReferenceMIPS R4000 User Manual 
- GT64111

 
Related Info
- Aurema OS Prize
- OS Hall of Fame
 
History
- 2004
- 2003
- 2002
- 2000
- 1999
- 1998
- 1997
 
Staff
- Gernot Heiser (LiC)
- Kevin Elphinstone
- Guest Lecturers (TBA)
 
Stureps
- Student Reps

 
Valid HTML 4.0!

M2: A pager

Use your memory manager from M1 to write a simple pager. The pager should allow ELF files to run from the boot file, however rather than having their stack allocated in physical memory, it should just use virtual memory. This should allow you to execute user processes in place, i.e. from the boot image. Note that in general a program can ony be executed in-place once, afterwards global variables may have incorrect values.

process layout

Design alternatives

Probably 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 UTCBs.

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.

The other, obvious, thing you will want to think about is the type of page table to use. You should take into account the fact that you are going to be running this on a 64-bit machine, so you should have a page table structure that supports large address spaces.

Assessment

The main demonstration here will be to show a user process running with a high stack pointer (> 0x800000). You should also demonstrate a user process using malloc() from a heap.

Update: This example user code should test some simple functions of your page table and VM system.


#define NPAGES 128

/* called from pt_test */
static void
do_pt_test( char *buf )
{
	int i;
	L4_Fpage_t fp;

	/* set */
	for( i = 0; i < NPAGES; i+=4 )
	        buf[i*1024] = i;

	/* flush */
	fp = L4_CompleteAddressSpace;
	L4_Set_Rights( &fp, L4_FullyAccessible );
	L4_Flush( fp );

	/* 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*)0x800000 );

	/* stack test */
	do_pt_test( buf1 );

	/* heap test */
	buf2 = malloc( NPAGES*1024 );
	assert( buf2 != NULL );
	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: 16 Aug 2005.