CS 5204 Operating Systems Linking and Loading Godmar Back.

Slides:



Advertisements
Similar presentations
Programs in Memory Bryce Boe 2012/08/29 CS32, Summer 2012 B.
Advertisements

CS 4284 Systems Capstone Godmar Back Processes and Threads.
Memory Management: Overlays and Virtual Memory
CS 4284 Systems Capstone Godmar Back Virtual Memory – Paging Techniques.
ITEC 352 Lecture 25 Memory(3). Review Questions RAM –What is the difference between register memory, cache memory, and main memory? –What connects the.
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 3 Memory Management Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall,
1 Pintos Project #3 Virtual Memory The following slides were created by Xiaomo Liu and others for CS 3204 Fall And Modified by Nick Ryan for Spring.
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.
Jaishankar Sundararaman
1 Operating Systems and Protection CS Goals of Today’s Lecture How multiple programs can run at once  Processes  Context switching  Process.
Memory Image of Running Programs Executable file on disk, running program in memory, activation record, C-style and Pascal-style parameter passing.
PC hardware and x86 3/3/08 Frans Kaashoek MIT
Stacks and Frames Demystified CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han.
6.828: PC hardware and x86 Frans Kaashoek
Fall 2008CS 334: Computer SecuritySlide #1 Smashing The Stack A detailed look at buffer overflows as described in Smashing the Stack for Fun and Profit.
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-7 Memory Management (1) Department of Computer Science and Software.
CS 3204 Operating Systems Godmar Back Lecture 11.
1 Carnegie Mellon Stacks : Introduction to Computer Systems Recitation 5: September 24, 2012 Joon-Sup Han Section F.
CS 4284 Systems Capstone Godmar Back Virtual Memory – Page Tables.
Chapter 8 – Main Memory (Pgs ). Overview  Everything to do with memory is complicated by the fact that more than 1 program can be in memory.
CS 3204 Operating Systems Godmar Back Lecture 15.
Recitation 6 – 2/26/01 Outline Linking Exam Review –Topics Covered –Your Questions Shaheen Gandhi Office Hours: Wednesday.
Topic 2d High-Level languages and Systems Software
CS 4284 Systems Capstone Godmar Back Virtual Memory – Paging Techniques.
1 CS503: Operating Systems Spring 2014 Part 0: Program Structure Dongyan Xu Department of Computer Science Purdue University.
CS 3204 Operating Systems Godmar Back Lecture 17.
Memory Management: Overlays and Virtual Memory. Agenda Overview of Virtual Memory –Review material based on Computer Architecture and OS concepts Credits.
1 Pintos Virtual Memory Management Project (CS3204 Spring 2006 VT) Yi Ma.
Pintos project 3: Virtual Memory Management
CS 3204 Operating Systems Godmar Back Lecture 16.
University of Amsterdam Computer Systems – the instruction set architecture Arnoud Visser 1 Computer Systems The instruction set architecture.
CSCI 156: Lab 11 Paging. Our Simple Architecture Logical memory space for a process consists of 16 pages of 4k bytes each. Your program thinks it has.
1 Linking. 2 Outline What is linking and why linking Complier driver Static linking Symbols & Symbol Table Suggested reading: 7.1~7.5.
Memory Management. 2 How to create a process? On Unix systems, executable read by loader Compiler: generates one object file per source file Linker: combines.
Linking I Topics Assembly and symbol resolution Static linking Systems I.
LECTURE 3 Translation. PROCESS MEMORY There are four general areas of memory in a process. The text area contains the instructions for the application.
Virtual Memory – Paging Techniques
Lecture 3 Translation.
CS 177 Computer Security Lecture 9
Instruction Set Architecture
MODERN OPERATING SYSTEMS Third Edition ANDREW S
Virtualization Virtualize hardware resources through abstraction CPU
Virtual Memory – Page Tables
Anton Burtsev February, 2017
143A: Principles of Operating Systems Lecture 8: Basic Architecture of a Program Anton Burtsev October, 2017.
Homework In-line Assembly Code Machine Language
ICS143A: Principles of Operating Systems Lecture 21: Program linking and loading Anton Burtsev March, 2017.
Program Execution in Linux
PA1 is out Best by Feb , 10:00 pm Enjoy early
x86 segmentation, page tables, and interrupts
Topic 2e High-Level languages and Systems Software
Computer Architecture and Assembly Language
Computer Organization & Compilation Process
C Prog. To Object Code text text binary binary Code in files p1.c p2.c
More examples How many processes does this piece of code create?
CS 4284 Systems Capstone Linking and Loading Godmar Back.
Assembly Language Programming II: C Compiler Calling Sequences
CS399 New Beginnings Jonathan Walpole.
Memory Allocation CS 217.
Understanding Program Address Space
The Runtime Environment
CS 5204 Operating Systems Lecture 10
Machine-Level Programming: Introduction
Linking & Loading CS-502 Operating Systems
Operating System Chapter 7. Memory Management
Program Execution in Linux
Linking & Loading CS-502 Operating Systems
Computer Organization & Compilation Process
Mechanism: Address Translation
Presentation transcript:

CS 5204 Operating Systems Linking and Loading Godmar Back

Today: what you need to know for Project 2 Compiling, Linking, Loading Where are my variables? How are programs loaded into memory? Virtual Memory Basics How are virtual addresses checked and how are they mapped? What happens on a context-switch with respect to the MMU? CS 5204 Fall 2015

Accessing Information All information a program reads/writes is stored somewhere in memory Programmer uses symbolic names: local variables, global variables, assembly constants CPU instructions use virtual addresses: absolute addresses (at 0xC0000024) relative addresses (at $esp – 16) Actual memory uses physical addresses: Big Question: who does the translation & when? CS 5204 Fall 2015

Physical RAM (physically addressed) The Big Picture .h Header File 1 .h Header File 2 .h Header File 3 Preprocessor Program Code .c/.cc Source File 1 Program Code .c/.cc Source File 2 Compile Time Compiler Assembly Code .s File 1 Assembly Code .s File 2 Assembler Object Code .o File 1 Object Code .o File 2 Link Time Linker Executable Program1 Executable Program2 Load Time Loader Process1 Process2 Process3 Run Time MMU Physical RAM (physically addressed) CS 5204 Fall 2015

Step 1: Compilation .data initialized_variable: .long 1 int initialized_variable = 1; int zero_initialized_variable; int global_function(int argument) { volatile int local_variable = 1; return argument + local_variable + initialized_variable + zero_initialized_variable; } .comm zero_initialized_variable,4,4 global_function: pushl %ebp movl %esp, %ebp subl $16, %esp movl $1, -4(%ebp) /* local_variable */ movl -4(%ebp), %eax addl 8(%ebp), %eax /* argument */ addl initialized_variable, %eax addl zero_initialized_variable, %eax leave ret whereismystuff.c whereismystuff.s Compiler resolves local variable names (and struct field offsets!) CS 5204 Fall 2015

Step 2: Assembly RELOCATION RECORDS FOR [.text]: OFFSET TYPE VALUE 00000015 R_386_32 initialized_variable 0000001b R_386_32 zero_initialized_variable Contents of section .data: 0000 01000000 .... global_function: pushl %ebp movl %esp, %ebp subl $16, %esp movl $1, -4(%ebp) /* local_variable */ movl -4(%ebp), %eax addl 8(%ebp), %eax /* argument */ addl initialized_variable, %eax addl zero_initialized_variable, %eax leave ret 00000000 <global_function>: 0: 55 push %ebp 1: 89 e5 mov %esp,%ebp 3: 83 ec 10 sub $0x10,%esp 6: c7 45 fc 01 00 00 00 movl $0x1,0xfffffffc(%ebp) d: 8b 45 fc mov 0xfffffffc(%ebp),%eax 10: 03 45 08 add 0x8(%ebp),%eax 13: 03 05 00 00 00 00 add 0x0,%eax // initialized_variable 19: 03 05 00 00 00 00 add 0x0,%eax // zero_initialized_variable 1f: c9 leave 20: c3 ret whereismystuff.o whereismystuff.s CS 5204 Fall 2015

Step 3: Linking 0804837c <global_function>: 804837c: 55 push %ebp 804837d: 89 e5 mov %esp,%ebp 804837f: 83 ec 10 sub $0x10,%esp 8048382: c7 45 fc 01 00 00 00 movl $0x1,0xfffffffc(%ebp) 8048389: 8b 45 fc mov 0xfffffffc(%ebp),%eax 804838c: 03 45 08 add 0x8(%ebp),%eax 804838f: 03 05 80 95 04 08 add 0x8049580,%eax 8048395: 03 05 88 95 04 08 add 0x8049588,%eax 804839b: c9 leave 804839c: c3 ret whereismystuff (.exe) Linker resolves global addresses, stores instructions for loader in executable Key: linker links multiple, independently assembled .o files into executable Must decide on layout & then assign addresses & relocate CS 5204 Fall 2015

Step 4: Loading (Conceptual) Code: 0804837c <global_function>: 804837c: 55 push %ebp 804837d: 89 e5 mov %esp,%ebp 804837f: 83 ec 10 sub $0x10,%esp 8048382: c7 45 fc 01 00 00 00 movl $0x1,0xfffffffc(%ebp) 8048389: 8b 45 fc mov 0xfffffffc(%ebp),%eax 804838c: 03 45 08 add 0x8(%ebp),%eax 804838f: 03 05 80 95 04 08 add 0x8049580,%eax 8048395: 03 05 88 95 04 08 add 0x8049588,%eax 804839b: c9 leave 804839c: c3 ret Data: Contents of section .data: 8049574 00000000 00000000 88940408 01000000 ................ ELF Header: start address 0x080482d8 BSS: - size & start of zero initialized data Picture compiler & linker had in mind when building executable sections become segments MAX_VIRTUAL Stack stack segment room for stack to grow room for heap to grow Heap BSS data segment Data Executable = set of instructions stored on disk for loader consists of sections Code code segment start program here CS 5204 Fall 2015

Virtual Memory & Paging (Simplified) MAX_VIRTUAL MAX_PHYSICAL Page Table 0..232-1 range depends on processor architecture IA32: sizeof(void*)=4 range depends on how much RAM you bought MMU pages frames Maps virtual addresses to physical addresses (indirection) x86: page table is called page directory (one per process) mapping at page granularity (x86: 1 page = 4 KB = 4,096 bytes) CS 5204 Fall 2015

Step 5: Loading (For Real) FFFFFFFF Step 5: Loading (For Real) P1 C0400000 1 GB kernel code kernel data kernel bss kernel heap after Pintos boots, all physical memory is mapped at C0000000 and up - part is already used by kernel - part is free (but mapped) kheap kbss kdata free C0000000 kcode ustack (1) user stack user (1) user (1) user (1) kernel 3 GB kernel used kernel Pintos then starts the first process … user data + bss kernel udata (1) ucode (1) user code CS 5204 Fall 2015

Step 5: Loading (2nd Process) FFFFFFFF Step 5: Loading (2nd Process) P2 C0400000 1 GB To load a second process, Pintos creates a new page table - clone boot page table - then add entries … kheap kbss user (2) kdata user (2) free C0000000 kcode user (2) ustack (2) user stack user (1) user (1) user (1) kernel 3 GB kernel used kernel user data + bss kernel udata (2) ucode (2) user code CS 5204 Fall 2015

Context Switching Each process has its own address space This means that the meaning of addresses (say 0x08c4000) may be different depending on which process is active Maps to different page in physical memory When processes switch, address spaces must switch MMU must be reprogrammed CS 5204 Fall 2015

Process 1 Active P1 1 GB 3 GB FFFFFFFF C0400000 free C0000000 used kheap kbss user (2) kdata user (2) free C0000000 kcode user (2) ustack (1) user (1) user (1) user (1) kernel 3 GB kernel used kernel kernel udata (1) ucode (1) CS 5204 Fall 2015

Process 2 Active P2 1 GB 3 GB FFFFFFFF C0400000 access possible in user mode access requires kernel mode 1 GB kheap kbss user (2) kdata user (2) free C0000000 kcode user (2) ustack (2) user (1) user (1) user (1) kernel 3 GB kernel used kernel kernel udata (2) ucode (2) CS 5204 Fall 2015

Context Switching intr_entry: (saves entire CPU state) (switches to kernel stack) intr_exit: (restore entire CPU state) (switch back to user stack) iret Process 1 Process 2 user mode kernel mode Kernel switch_threads: (in) (saves caller’s state) switch_threads: (out) (restores caller’s state) (kernel stack switch) CS 5204 Fall 2015

Process 1 Active in user mode FFFFFFFF Process 1 Active in user mode P1 C0400000 1 GB kheap kbss user (2) kdata user (2) free C0000000 kcode user (2) ustack (1) user (1) user (1) user (1) kernel 3 GB kernel used kernel kernel udata (1) ucode (1) access possible in user mode CS 5204 Fall 2015

Process 1 Active in kernel mode FFFFFFFF Process 1 Active in kernel mode P1 C0400000 access requires kernel mode 1 GB Context Switch schedule_tail() calls process_activate: void process_activate (void) { struct thread *t = thread_current (); /* Activate thread's page tables. */ pagedir_activate (t->pagedir); } kheap kbss user (2) kdata user (2) free C0000000 kcode user (2) ustack (1) user (1) user (1) user (1) kernel 3 GB kernel used kernel kernel udata (1) ucode (1) access possible in user mode CS 5204 Fall 2015

Process 2 Active in kernel mode FFFFFFFF Process 2 Active in kernel mode P2 C0400000 access requires kernel mode 1 GB kheap kbss user (2) kdata user (2) free C0000000 kcode user (2) ustack (2) user (1) user (1) user (1) kernel 3 GB kernel used kernel kernel udata (2) ucode (2) access possible in user mode CS 5204 Fall 2015

Process 2 Active in user mode FFFFFFFF Process 2 Active in user mode P2 C0400000 1 GB kheap kbss user (2) kdata user (2) free C0000000 kcode user (2) ustack (2) user (1) user (1) user (1) kernel 3 GB kernel used kernel kernel udata (2) ucode (2) access possible in user mode CS 5204 Fall 2015

Summary All you have to do in Project 2/3/4 is: Be aware of what memory is currently accessible Your kernel executes in kernel mode, so you can access all memory (if you use >C000000 addresses) But you must set it up such that your programs can run with the memory you allow them to access (at <C0000000) Don’t let user programs fool you into accessing other processes’ (or arbitrary kernel) memory Kill them if they try Keep track of where stuff is Virtually (toolchain’s view): below C0000000 (PHYS_BASE) user space above C0000000 (PHYS_BASE) kernel space Physically (note: “physical” addresses are represented as 0xC0000000 + phys_addr in Pintos b/c of permanent mapping) CS 5204 Fall 2015