Memory Management in Linux - Pennsylvania State ….pptVIP

Memory Management in Linux;Two Parts;Architecture Independent Memory Model;;Segment + Offset = 4 GB Linear address (32 bits) Of this, user space = 3 GB (defined by TASK_SIZE macro) and kernel space = 1GB Linear Address converted to physical address using 3 levels ;Page Dir. And Middle Dir. Access Functions (in asm/page.h and asm/pgtable.h);Page Table Entry (pte_t);Page Table Functions;Process Address Space (not to scale!);Address Space Descriptor;Region Descriptors;;;Traditional mmap();How is brk() implemented?;Kernel Segment;Memory Allocn for Kernel Segment;kmalloc() data structures;vmalloc();vmalloc vs kmalloc;Paging;Inform swap space to kernel using int sys_swapon(char * swapfile, int swapflags); Ceates an entry in swap_info table. struct swap_info_struct { unsigned int flags; kdev_t swap_device; struct indoe *swap_file; unsigned char *swap_map; // ptr to table, with 1 byte for each page to indicate how many processes are referring to this page unsigned char *swap_lockmap; // ptr to bitmap, bit indicating lock int lowest_bit, highest_bit; // to calculate maximum page number unsigned long max; // highest_bit + 1 int prio; // priority for this swap space int cluster_nr, cluster_next; // to cluster pages on storage device int next; } ;For each physical frame (mm.h): typedef struct page { struct page *prev, *next; // doubly linked struct inode *inode; unsigned long offset; // where to swap struct page *prev_hash, next_hash; // in hash list of pages in page cache atomic_t count; // number of users of this page unsigned dirty:16, age:8; struct buffer_head * buffers; // if it is part of a block buffer unsigned long map_nr; // frame # struct wait_queue *wait; // Tasks waiting for page to be unlocked unsigned flags; } mem_map_t; ;Finding a Physical Page;First tries to find a free frame using Buddy system. Table free_area[] keeps appropriate data structures. ;If you cannot find a free page, int try_to_free_page(int priority, int dma, int wait) { static int stat