15 213 The course that gives CMU its Zip Exceptional Control Flow Processes October 2 2008 Topics lecture 11 ppt Exceptions Processes and context switches Creating and destroying processes Control Flow Processors do only one thing From startup to shutdown a CPU simply reads and executes interprets a sequence of instructions one at a time This sequence is the CPU s control flow or flow of control Physical control flow Time 2 startup inst1 inst2 inst3 instn shutdown 15 213 F 08 Altering the Control Flow Up to now two mechanisms for changing control flow Jumps and branches Call and return Both react to changes in program state Insufficient for a useful system Difficult for the CPU to react to changes in system state data arrives from a disk or a network adapter instruction divides by zero user hits Ctrl C at the keyboard System timer expires System needs mechanisms for exceptional control flow 3 15 213 F 08 Exceptional Control Flow Mechanisms for exceptional control flow exists at all levels of a computer system Low level Mechanism exceptions change in control flow in response to a system event i e change in system state combination of hardware and OS software Higher Level Mechanisms Process context switch Signals Nonlocal jumps setjmp longjmp implemented by either OS software context switch and signals C language runtime library nonlocal jumps 4 15 213 F 08 Exceptions An exception is a transfer of control to the OS in response to some event i e change in processor state User Process event current next OS exception exception processing by exception handler exception return optional 5 15 213 F 08 Interrupt Vectors Exception numbers interrupt vector 0 1 2 n 1 code codefor for exception exceptionhandler handler00 Each type of event has a unique exception number k code codefor for exception handler exception handler11 Index into jump table a k a interrupt vector code codefor for exception exceptionhandler handler22 Entry k points to a function exception handler Handler k is called each time exception k occurs code codefor for exception handler exception handlern 1 n 1 6 15 213 F 08 Asynchronous Exceptions Interrupts Caused by events external to the processor Indicated by setting the processor s interrupt pin handler returns to next instruction Examples I O interrupts hitting Ctrl C at the keyboard arrival of a packet from a network arrival of data from a disk Hard reset interrupt hitting the reset button Soft reset interrupt hitting Ctrl Alt Delete on a PC 7 15 213 F 08 Synchronous Exceptions Caused by events that occur as a result of executing an instruction Traps Intentional Examples system calls breakpoint traps special instructions Returns control to next instruction Faults Unintentional but possibly recoverable Examples page faults recoverable protection faults unrecoverable floating point exceptions Either re executes faulting current instruction or aborts Aborts unintentional and unrecoverable Examples parity error machine check Aborts current program 8 15 213 F 08 Trap Example Opening a File User calls open filename options 0804d070 libc open 804d082 cd 80 804d084 5b int pop 0x80 ebx Function open executes system call instruction int OS must find or create file get it ready for reading or writing Returns integer file descriptor User Process int pop 9 OS exception Open file return 15 213 F 08 Fault Example 1 Memory Reference User writes to memory location That portion page of user s memory is currently on disk Page handler must load page into physical memory Returns to faulting instruction Successful on second try 80483b7 c7 05 10 9d 04 08 0d User Process event movl 0xd 0x8049d10 OS page fault return 10 movl int a 1000 main a 500 13 Create page and load into memory 15 213 F 08 Fault Example 2 int a 1000 main a 5000 13 Invalid Memory Reference User writes to memory location Address is not valid Page handler detects invalid address 80483b7 c7 05 60 e3 04 08 0d Sends SIGSEGV signal to user process User process exits with segmentation fault User Process event 11 movl movl 0xd 0x804e360 OS page fault Detect invalid address Signal process 15 213 F 08 Processes Definition A process is an instance of a running program One of the most profound ideas in computer science Not the same as program or processor Process provides each program with two key abstractions Logical control flow Each program seems to have exclusive use of the CPU Private address space Each program seems to have exclusive use of main memory How are these Illusions maintained Process executions interleaved multitasking Address spaces managed by virtual memory system we ll talk about this in a couple of weeks 12 15 213 F 08 Logical Control Flows Each process has its own logical control flow 13 15 213 F 08 Concurrent Processes Two processes run concurrently are concurrent if their flows overlap in time Otherwise they are sequential Examples Concurrent A B A C Sequential B C Process A Process B Process C Time 14 15 213 F 08 User View of Concurrent Processes Control flows for concurrent processes are physically disjoint in time However we can think of concurrent processes are running in parallel with each other Process A Process B Process C Time 15 15 213 F 08 Context Switching Processes are managed by a shared chunk of OS code called the kernel Important the kernel is not a separate process but rather runs as part of some user process Control flow passes from one process to another via a context switch Process A code Process B code user code Time kernel code context switch user code kernel code context switch user code 16 15 213 F 08 fork Creating New Processes int fork void creates a new process child process that is identical to the calling process parent process returns 0 to the child process returns child s pid to the parent process if fork 0 printf hello from child n else printf hello from parent n 17 Fork is interesting and often confusing because it is called once but returns twice 15 213 F 08 Fork Example 1 Key Points Parent and child both run same code Distinguish parent from child by return value from fork Start with same state but each has private copy Including shared output file descriptor Relative ordering of their print statements undefined void fork1 int x 1 pid t pid fork if pid 0 printf Child has x d n x else printf Parent has x d n x printf Bye from process d with x d n getpid x 18 15 213 F 08 Fork Example 2 Key Points Both parent and child can continue forking void fork2 printf L0 n fork printf L1 n
View Full Document