Linux Operating System

Slides:



Advertisements
Similar presentations
Project 5: Virtual Memory
Advertisements

Memory.
Part IV: Memory Management
CSS430 Memory Management Textbook Ch8
The Linux Kernel: Memory Management
ITEC 352 Lecture 27 Memory(4). Review Questions? Cache control –L1/L2  Main memory example –Formulas for hits.
CS 4284 Systems Capstone Godmar Back Linking and Loading.
Segmentation and Paging Considerations
IA32 Paging Scheme Introduction to the Pentium’s support for “virtual” memory.
UQC152H3 Advanced OS Memory Management under Linux.
IA-32 Processor Architecture
Chapter 8.3: Memory Management
Memory Management (II)
1 CE6105 Linux 作業系統 Linux Operating System 許 富 皓.
CE6105 Linux 作業系統 Linux Operating System 許 富 皓. Chapter 2 Memory Addressing.
Informationsteknologi Friday, November 16, 2007Computer Architecture I - Class 121 Today’s class Operating System Machine Level.
Chapter 3.2 : Virtual Memory
UNIT 2 Memory Management Unit and Segment Description and Paging
Loadable Kernel Modules Dzintars Lepešs The University of Latvia.
CS 346 – Chapter 8 Main memory –Addressing –Swapping –Allocation and fragmentation –Paging –Segmentation Commitment –Please finish chapter 8.
Lecture 21 Last lecture Today’s lecture Cache Memory Virtual memory
Memory Addressing in Linux  Logical Address machine language instruction location  Linear address (virtual address) a single 32 but unsigned integer.
Operating Systems Chapter 8
CSNB334 Advanced Operating Systems 5. Memory Management
Linux Virtual Memory for Intel Processor
8.4 paging Paging is a memory-management scheme that permits the physical address space of a process to be non-contiguous. The basic method for implementation.
Laface Operating System Design Booting a PC to run a kernel from Low memory VGA display.
1 Chapter 3.2 : Virtual Memory What is virtual memory? What is virtual memory? Virtual memory management schemes Virtual memory management schemes Paging.
1 Linux Operating System 許 富 皓. 2 Memory Addressing -- with the assistance of 江瑞敏 and 許齊顯.
1 Linux Operating System 許 富 皓. 2 Memory Addressing.
Chapter 18 Paging Chien-Chung Shen CIS, UD
Memory Addressing in Linux (Chap. 2, Understanding the Linux Kernel) J. H. Wang Oct. 20, 2008.
Topic 2d High-Level languages and Systems Software
Paging Example What is the data corresponding to the logical address below:
1 Memory Management (b). 2 Paging  Logical address space of a process can be noncontiguous; process is allocated physical memory whenever the latter.
By Teacher Asma Aleisa Year 1433 H.   Goals of memory management  To provide a convenient abstraction for programming.  To allocate scarce memory.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Virtual Memory Hardware.
Paging Paging is a memory-management scheme that permits the physical-address space of a process to be noncontiguous. Paging avoids the considerable problem.
OS Memory Addressing. Architecture CPU – Processing units – Caches – Interrupt controllers – MMU Memory Interconnect North bridge South bridge PCI, etc.
1 Memory Management n In most schemes, the kernel occupies some fixed portion of main memory and the rest is shared by multiple processes.
Basic Paging (1) logical address space of a process can be made noncontiguous; process is allocated physical memory whenever the latter is available. Divide.
Memory Management.
Non Contiguous Memory Allocation
CSNB334 Advanced Operating Systems 5. Memory Management
COMBINED PAGING AND SEGMENTATION
Anton Burtsev February, 2017
143A: Principles of Operating Systems Lecture 5: Address translation
CS 5204 Operating Systems Linking and Loading Godmar Back.
x86 segmentation, page tables, and interrupts
Chapter 8: Main Memory.
Operating System Concepts
Memory Management 11/17/2018 A. Berrached:CS4315:UHD.
Practice Six Chapter Eight.
Background Program must be brought into memory and placed within a process for it to be run. Input queue – collection of processes on the disk that are.
CS 4284 Systems Capstone Linking and Loading Godmar Back.
Computer Architecture
Main Memory Background Swapping Contiguous Allocation Paging
Introduction to the Intel x86’s support for “virtual” memory
Virtual Memory Hardware
Lecture 3: Main Memory.
CSE 451: Operating Systems Autumn 2003 Lecture 10 Paging & TLBs
Chapter 8: Memory Management strategies
CSE 451: Operating Systems Autumn 2003 Lecture 10 Paging & TLBs
COMP755 Advanced Operating Systems
Structure of Processes
CS444/544 Operating Systems II Virtual Memory
Virtual Memory 1 1.
Page Main Memory.
Presentation transcript:

Linux Operating System 許 富 皓 1

-- with the assistance of 江瑞敏 and 許齊顯 Memory Addressing -- with the assistance of 江瑞敏 and 許齊顯 2

Entries of Page Global Directory The content of the first entries of the Page Global Directory that map linear addresses lower than 0xc0000000 (the first 768 entries with PAE disabled, or the first 3 entries with PAE enabled) depends on the specific process. Conversely, the remaining entries should be the same for all processes and equal to the corresponding entries of the master kernel Page Global Directory. 3

Kernel Page Tables The kernel maintains a set of page tables for its own use. This set of page tables is rooted at a so-called master kernel Page Global Directory. After system initialization, the set of page tables are never directly used by any process or kernel thread. Rather, the highest entries of the master kernel Page Global Directory are the reference model for the corresponding entries of the Page Global Directories of EVERY regular process in the system. 4

Duplicate the Content of MKPGD copy_prcess() copy_mm() dump_mm() mm_init() mm_alloc_pgd() pgd_alloc() pgd_alloc() pgd_prepopulate_pmd() 5

How Kernel Initializes Its Own page tables A two-phase activity: In the first phase, the kernel creates a limited address space including the kernel’s code segment the kernel’s data segments the initial page tables 128 KB for some dynamic data structures. This minimal address space is just large enough to install the kernel in RAM and to initialize its core data structures. . In the second phase, the kernel takes advantage of all of the existing RAM and sets up the page tables properly. 6

Phase One 7

The Special Dot Symbol [GNU] The special symbol `.' refers to the current address that as is assembling into. Thus, the expression `melvin: .long .' defines melvin to contain its own address. Assigning a value to . is treated the same as a .org directive. Thus, the expression `.=.+4' is the same as saying `.space 4'. 8

initial_page_table and __brk_base The provisional Page Global Directory is contained in the initial_page_table variable. The provisional Page Tables are stored starting from __brk_base. 9

Assumption CPU architecture is x86_32. vmlinux[wikipedia] size is 7MB. On Linux systems, vmlinux is a statically linked executable file that contains the Linux kernel in one of the object file formats supported by Linux, which includes ELF, COFF and a.out. boot loader put linux kernel at physical address 0x01000000. 10

Phase One Mapping Size In order to map 24 MB of RAM, 6 Page Tables are required. 16 MB (reserved memory) + 7 MB (vmlinux size) + 1 MB (MAPPING_BEYOND_END) 11

MAPPING_BEYOND_END Beside mapping the vmlinux, linux kernel will map additional memory for bootmem allocator. In x86_32 with PAE disable, the value of MAPPING_BEYOND_END is 1MB. bootmem allocator: When a system is initialized, there is no buddy system and slab allocator; hence, bootmem allocator is responsible for memory management and memory allocation. 12

Physical Address Layout 0x00000000 1 MB: mapping beyond end 7 MB: vmlinux : 16 MB 0x01000000 0x01700000 0x017fffff 13

initial_page_table in Phase One The objective of this first phase of paging is to allow these 24 MB of RAM to be easily addressed both in protected mode before and after paging is enabled. Therefore, the kernel must create a mapping from both the linear addresses 0x00000000 through 0x017fffff and the linear addresses 0xc0000000 through 0xc17fffff into the physical addresses 0x00000000 through 0x017fffff. In other words, the kernel during its first phase of initialization can address the first 24 MB of RAM by either linear addresses identical to the physical ones or 24 MB worth of linear addresses, starting from 0xc0000000. 14

Mapping Linear Addresses to Physical Addresses in Phase One (1) pt physical address linear address 0x00000000 pgd 4 K … 0x00000000 24M 4 K 24M 0x017fffff 0x017fffff 0xc0000000 24M 0xc17fffff 0xffffffff 15

Mapping Linear Addresses to Physical Addresses in Phase One (2) pt physical address linear address 0x00000000 pgd 4 K … 0x00000000 24M 4 K 24M 0x017fffff 0x017fffff 0xc0000000 24M 0xc17fffff 0xffffffff 16

Contents of initial_page_table in Phase One The Kernel creates the desired mapping by filling all the initial_page_table entries with zeroes, except for entries 0 ~ 5, 0x300 (decimal 768) ~ 0x305 (decimal 773); the latter six entries span all linear addresses between 0xc0000000 and 0xc17fffff. The 0 ~ 5, 0x300 ~ 0x305 entries are initialized as follows: The address field of entries 0 and 0x300 is set to the physical address of __brk_base. 17

Initialize initial_page_table page_pde_offset = (__PAGE_OFFSET >> 20); movl $pa(__brk_base), %edi movl $pa(initial_page_table), %edx movl $PTE_IDENT_ATTR, %eax 10: leal PDE_IDENT_ATTR(%edi),%ecx /* Create PDE entry */ movl %ecx,(%edx) /* Store identity PDE entry */ movl %ecx, page_pde_offset(%edx) /* Store kernel PDE entry */ addl $4,%edx movl $1024, %ecx 11: stosl addl $0x1000,%eax loop 11b /* * End condition: we must map up to the end + MAPPING_BEYOND_END. */ movl $pa(_end) + MAPPING_BEYOND_END + PTE_IDENT_ATTR, %ebp cmpl %ebp,%eax jb 10b addl $__PAGE_OFFSET, %edi movl %edi, pa(_brk_end) shrl $12, %eax movl %eax, pa(max_pfn_mapped) /* Do early initialization of the fixmap area */ movl $pa(initial_pg_fixmap)+PDE_IDENT_ATTR,%eax movl %eax,pa(initial_page_table+0xffc) 0xc00 (=0x300 * 4) number of entries in PTs. 4k 18

Phase 1: Page Table Layout __brk_base (pte) physical address initial_pagr_table (pgd) entry 0 (4 byte) entry 1 entry 2 : entry 5 entry 768 entry 769 entry 770 entry 773 entry 1023 entry 0 (4 byte) entry 1 : entry 1023 4 KB : 0x00000000 … 4 MB entry 0 (4 byte) entry 1 … entry 1023 24 MB : entry 0 (4 byte) entry 1 … entry 1023 … 19 0x017fffff

Objectives of initial_page_table When executing file kernel/head.S, values of eip are within the range between 0x00000000 and 0x017fffff. eip 88 ENTRY(startup_32) /*protected mode code*/ 99 lgdt pa(boot_gdt_descr) : 211 movl $pa(initial_page_table), %edx 390 /* Enable paging */ 391 movl $pa(initial_page_table), %eax 392 movl %eax,%cr3 393 movl $CR0_STATE,%eax 394 movl %eax,%cr0 395 ljmp $__BOOT_CS,$1f 396 1: 398 addl $__PAGE_OFFSET, %esp 448 lgdt early_gdt_descr 449 lidt idt_descr 468 jmp *(initial_code) 679 ENTRY(initial_page_table) 680 .fill 1024,4,0 718 ENTRY(stack_start) 719 .long init_thread_union+THREAD_SIZE 754 boot_gdt_descr: 755 .word __BOOT_DS+7 759 idt_descr: 760 .word IDT_ENTRIES*8-1 … 765 ENTRY(early_gdt_descr) 766 .word GDT_ENTRIES*8-1 logical address || virtual address (segment base address =0) physical address (paging is not enabled yet.) Before paging is enable (before line 190), eip’s values are equal to physical addresses. After paging is enable, eip’s values use entry 0 to entry 5 of initial_page_table to tranfer into physical addresses. eip virtual address physical address Function i386_start_kernel () is inside a pure C program (head32.c); hence, its address is above 0xc0000000;therefore, after this instruction, values of eip will be greater than 0xc0000000. Paging Unit 20

Enable the Paging Unit The startup_32( ) assembly language function also enables the paging unit. This is achieved by loading the physical address of initial_page_table into the cr3 control register and by setting the PG flag of the cr0 control register, as shown in the following equivalent code fragment: movl $pa(initial_page_table), %eax movl %eax,%cr3 movl $CR0_STATE,%eax movl %eax,%cr0 21

Initial Page Global Directories startup_32( ) i386_start_kernel() start_kernel(void) setup_arch() cr3 points to initial_page_table cr3 points to swapper_pg_dir 22

Phase 2 23

Change Page Global Directory setup_arch() initial_page_table copies to swapper_pg_dir first. cr3 points to swapper_pg_dir. Change the content of swapper_pg_dir. After be initialized, the content of swapper_pg_dir will be copied into initial_page_table. cr3 continuously points to swapper_pg_dir. 24

Function Call Chain to kernel_physical_mapping_init() setup_arch() init_mem_mapping() init_memory_mapping() kernel_physical_mapping_init() setup_arch() writes the physical address of swapper_pg_dir in the cr3 control register using load_cr3(swapper_pg_dir). 25

kernel_physical_mapping_init() Reinitialize swapper_pg_dir Invokes __flush_tlb_all() to invalidate all TLB entries. 26

Function Call to paging_init startup_32 start_kernel  setup_arch paging_init paging_init is no longer in charge of initializing swapper_pg_dir which is one of its major work in Linux versions around 2.6.16. But the initialization of swapper_pg_dir is executed by kernel_physical_mapping_init(). [1][2][3][4] [1][2][3][4] 27

paging_init() paging_init(): Invoke pagetable_init() Invokes __flush_tlb_all() to invalidate all TLB entries #ifdef CONFIG_HIGHMEM pagetable_init() : Invokes permanent_kmaps_init() permanent_kmaps_init() Invoke page_table_range_init() #else do nothing. 28

Important Function Call In Phase 2 setup_arch() init_mem_mapping x86_init.paging. pagetable_init paging_init init_memory_mapping early_ioremap_page_ table_range_init pagetable_init kmap_init kernel_pysical_mapping_init permenent_kmaps_init continuous linear mapping others 29

How Kernel Initializes Its Own Page Tables --- Phase 2 Finish the Page Global Directory The final mapping provided by the kernel Page Tables must transform virtual addresses starting from 0xc0000000 to physical addresses starting from 0x00000000. There are two different configurations that will affect the size of the linear mapping region. CONFIG_HIGHMEM CONFIG_NOHIGHMEM 30

CONFIG_NOHIGHMEM If CONFIG_NOHIGHMEM is set, the kernel can only access physical memory less than 1024 MB. There are 2 cases in this configuration: Case 1: RAM size is less than 895 MB. Why 895 MB? Case 2: RAM size is between 895 MB and 1024 MB. 31

CONFIG_HIGHMEM If CONFIG_HIGHMEM is set, the kernel can access physical memory larger than 1024 MB. There are 3 cases in this configuration: Case 1: RAM size is less than 887 MB. Case 2: RAM size is between 887 MB and 4096 MB. Case 3: RAM size is larger than 4096 MB. 32

Assumption We assume that the kernel is configured as CONFIG_HIGHMEM . The following three cases will be discussed: Case 1: RAM size is less than 887 MB. Case 2: RAM size is between 887 MB and 4096 MB. Case 3: RAM size is larger than 4096 MB. P.S.: The operations performed in case 1 and case 2 of configuration CONFIG_NOHIGHMEM are the same as the ones in case 1 and case 2 of configuration CONFIG_HIGHMEM . 33

When RAM Size Is Less Than 887MB Phase 2 Case 1: When RAM Size Is Less Than 887MB 34

Assumption We assume that the CPU is a 80x86 microprocessor supporting 4 MB pages and "global" TLB entries. Notice that the User/Supervisor flags in all Page Global Directory entries referencing linear addresses above 0xc0000000 are cleared, thus denying processes in User Mode access to the kernel address space. Notice also that the Page Size flag is set so that the kernel can address the RAM by making use of large pages. 35

Linear Address and Physical Address Mapping hole Linear address 887MB 0xff7fe000 0xffc00000 0xfffff000 0 0xc0000000 0xc0400000 3M vmalloc pkmap fixmap 4M 880M 0xff800000 0xfffa1000 4k mapping 4M mapping 4k mapping 4 M 880 M 3M 0x00000000 0x00400000 887MB Physical address 36

Clearance of Page Global Directory Entries Created in Phase 1 The identity mapping of the first 24 megabytes of physical memory built by the startup_32( ) function is required to complete the initialization phase of the kernel. When this mapping is no longer necessary, the kernel clears the corresponding page table entries. 37

MKPGD Mapping : : : 4 M physical memory 4M= 1024x4k 3M= 768x4k pt . pt entry 0 (4 byte) : entry 1023 (4 byte) physical memory : 4 KB : 4 M 4M= 1024x4k swapper_pg_dir pt entry 0 : entry 768 (4 byte) entry 769 (4 byte) entry 770 entry 989 entry 1023 . 3M= 768x4k entry 0 (4 byte) : entry 767 (4 byte) entry 1023 (4 byte) : 34 entries pt 38

When RAM Size Is between 887MB and 4096MB Phase 2 Case 2: When RAM Size Is between 887MB and 4096MB 39

Phase 2 – Case 2 Final kernel page table when RAM size is between 887 MB and 4096 MB : In this case, the RAM CNNNOT be mapped entirely into the kernel linear address space, because the address space is only 1GB. Therefore, during the initialization phase Linux only maps a RAM window having size of 887 MB into the kernel linear address space. If a program needs to address other parts of the existing RAM, some other linear address interval (from the 888th MB to the 1st GB) must be mapped to the required RAM. This implies changing the value of some page table entries. 40

Phase 2 – Case 2 Code To initialize the Page Global Directory, the kernel uses the same code as in the previous case. 41

Linear Address and Physical Address Mapping hole Linear address 887MB 0xff7fe000 0xffc00000 0xfffff000 0 0xc0000000 0xc0400000 3M vmalloc pkmap fixmap 4M 880M 0xff800000 0xfffa1000 4k mapping 4M mapping 4k mapping 4 M 880M 3M 0x00000000 0x00400000 887MB Physical address 42

MKPGD Mapping : : : 4 M physical memory 4M= 1024x4k 3M= 768x4k pt . pt entry 0 (4 byte) : entry 1023 (4 byte) physical memory : 4 KB : 4 M 4M= 1024x4k swapper_pg_dir pt entry 0 : entry 768 (4 byte) entry 769 (4 byte) entry 770 entry 989 entry 1023 . 3M= 768x4k entry 0 (4 byte) : entry 767 (4 byte) entry 1023 (4 byte) : 34 entries pt 43

When RAM Size Is More Than 4096MB Phase 2 Case 3: When RAM Size Is More Than 4096MB 44

Assumption Assume: The CPU model supports Physical Address Extension (PAE). The amount of RAM is larger than 4 GB. The kernel is compiled with PAE support. 45

RAM Mapping Principle Although PAE handles 36-bit physical addresses, linear addresses are still 32-bit addresses. As in case 2, Linux maps a 887-MB RAM window into the kernel linear address space; the remaining RAM is left unmapped and handled by dynamic remapping. 46

Layouts of Translation Tables Notice that all CPU models that support PAE also support large 2 MB pages and global pages. As in the previous case, whenever possible, Linux uses large pages to reduce the number of page tables . The first 443 (886/2=443) entries (entry 0 ~ entry 442) in the Page Middle Directory are filled with the physical address of the first 886 MB of RAM. Entry 443 points to a Page Table which contains 512 entries. There are 512 entries in the Page Middle Directory, but the last 68 (512-444=68) are reserved for noncontiguous memory allocation . 47

Layouts of Translation Tables swapper_pg_dir pmd 1 : 443 2M 2M : 2M 887 MB : empyt_zero_page 2M 444 445 : 511 entry 0 (4 byte) : entry 255 (4 byte) entry 511 (4 byte) : 4k 1M : 68 4k pt 48

initial_page_table and swapper_pg_dir After be initialized, the content of swapper_pg_dir will be copied into initial_page_table. But cr3 continuously points to swapper_pg_dir. static inline void clone_pgd_range(pgd_t *dst, pgd_t *src, int count) { memcpy(dst, src, count * sizeof(pgd_t)); } clone_pgd_range(initial_page_table+KERNEL_PGD_BOUNDARY,swapper_pg_dir+KERNEL_PGD _BOUNDARY,KERNEL_PGD_PTRS); 49

Fix-Mapped Linear Addresses 50

Usage of Fix-Mapped Linear Addresses The initial part of the fourth gigabyte of kernel linear addresses maps the physical memory of the system. However, around 129 MB of linear addresses are always left available because the kernel uses them to implement noncontiguous memory allocation and fix-mapped linear addresses. 51

Fix-Mapped Linear Addresses vs. Physical Addresses Basically, a fix-mapped linear address is a constant linear address like 0xffffc000 whose corresponding physical address can be set up in an arbitrary way. Thus, each fix-mapped linear address maps one page frame of the physical memory. Fix-mapped linear addresses are conceptually similar to the linear addresses that map the first 887 MB of RAM. However, a fix-mapped linear address can map any physical address. The mapping established by the linear addresses in the initial portion of the fourth gigabyte is linear Linear address X maps physical address X - PAGE_OFFSET. 52

Data Structure enum fixed_addresses Each fix-mapped linear address is represented by an integer index defined in the enum fixed_addresses data structure: enum fixed_addresses { #ifdef CONFIG_X86_32 FIX_HOLE, FIX_VDSO, #else VSYSCALL_LAST_PAGE, VSYSCALL_FIRST_PAGE=VSYSCALL_LAST_PAGE+((VSYSCALL_END- VSYSCALL_START)>>PAGE_SHIFT)-1, VVAR_PAGE, VSYSCALL_HPET, #endif ... __end_of_fixed_addresses }; 53

How to Obtain the Linear Address Set of a Fix-Mapped Linear Address Fix-mapped linear addresses are placed at the end of the fourth gigabyte of linear addresses. The fix_to_virt( ) function computes the constant linear address starting from the index: unsigned long __FIXADDR_TOP = 0xfffff000; #define FIXADDR_TOP ((unsigned long)__FIXADDR_TOP) #define __fix_to_virt(x) (FIXADDR_TOP - ((x) << PAGE_SHIFT)) P.S.: #define PAGE_SHIFT 12 Therefore, fix-mapped linear addresses are supposed to use with kernel paging mechanism that uses 4 KB page frames. 54

the Linear Address Set of a Fix-Mapped Linear Address 4k : 0xffffc000 3 4k 0xffffd000 2 virtual address 4k 0xffffe000 1 4k 0xfffff000 4k 0xffffffff 55

Associate a Physical Address with a Fix-mapped Linear Address Macros: set_fixmap(idx,phys) and set_fixmap_nocache(idx,phys): Both functions initialize the Page Table entry corresponding to the fix_to_virt(idx) linear address with the physical address phys; however, the second function also sets the PCD flag of the Page Table entry, thus disabling the hardware cache when accessing the data in the page frame . 56