Exceptions and signals Exceptional Control Flow

Document Sample
Exceptions and signals Exceptional Control Flow Powered By Docstoc
					                 CS 105
“Tour of the Black Holes of Computing”

Exceptional Control Flow

      Exceptions
      Process hierarchy
      Shells
      Signals
              Control Flow
Computers 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 system’s physical control flow (or flow
          of control)

                           Physical control flow
                    Time         inst1

–2–                                                             CS 105
Exceptional Control Flow
         Mechanisms for exceptional control flow exist 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)—ignored in this course
         Implemented by either:
            OS software (context switch and signals)
            C language runtime library: nonlocal jumps

–4–                                                                    CS 105

An exception is a transfer of control to the OS in response
  to some event (i.e., change in processor state)

              User Process                       OS

  event      current         exception
                next                                  exception processing
                                                      by exception handler
                             return (optional)

Think of it as a hardware-initiated function call

–5–                                                                  CS 105
Interrupt Vectors

                                             Each type of event has a
                      code for                unique exception number k
                  exception handler 0        Index into jump table (a.k.a.,
                       code for               interrupt vector)
                  exception handler 1        Jump table entry k points to
1                      code for               a function (exception
         ...      exception handler 2         handler).
n-1                        ...               Handler k is called each
                                              time exception k occurs.
                        code for
                  exception handler n-1

–6–                                                               CS 105
Asynchronous Exceptions
Caused by events external to processor
         Indicated by setting the processor’s interrupt pin(s)
         Handler returns to ―next‖ instruction.

         I/O interrupts
            Hitting control-C (or any key) at the keyboard
            Arrival of packet from network
            Arrival of data sector from disk
         Hard-reset interrupt
            Hitting reset button
         Soft-reset interrupt
            Hitting control-alt-delete on a PC

–7–                                                               CS 105
 Synchronous Exceptions
Caused by events that occur as result of executing an
         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
            Either re-executes faulting (―current‖) instruction or aborts
         Aborts
            Unintentional and unrecoverable
            Examples: parity error, machine check
            Aborts current program or entire OS
–8–                                                                     CS 105
     Fault Example #1
                                                          int a[1000];
     Memory Reference                                     main ()
             User writes to memory location              {
                                                              a[500] = 13;
             That portion (page) of user’s memory        }
              is currently on disk
         80483b7:      c7 05 10 9d 04 08 0d       movl   $0xd,0x8049d10

             Page handler must load page into
              physical memory
             Returns to faulting instruction
             Successful on second try
                      User Process                  OS

     event                           page fault
                                                         Create page and load
                                return                   into memory

– 10 –                                                                 CS 105
 ECF Exists at All Levels
 of a System
            Hardware and operating system kernel software

 Concurrent processes
            Hardware timer and kernel software

            Kernel software

 Non-local jumps (ignored in this class)
            Application code
            Evil in C
            C++/Python throw/catch

– 13 –                                                       CS 105
 Shell Programs
A shell is an application program that runs programs on
  behalf of the user
         sh – Original Unix Bourne shell
         csh – BSD Unix C shell, tcsh – Enhanced C shell (both deprecated)
         bash – “Bourne-Again‖ shell, zsh – ―Z‖ shell

     int main()
         char cmdline[MAXLINE];

           while (1) {
              /* read */
              printf("> ");
                                                 Execution is a sequence of
              Fgets(cmdline, MAXLINE, stdin);       read/evaluate steps
              if (feof(stdin))

               /* evaluate */
– 21 –}                                                            CS 105
Simple Shell eval Function
 void eval(char *cmdline)
     char *argv[MAXARGS]; /* argv for execvp() */
     int bg;              /* should the job run in bg or fg? */
     pid_t pid;           /* process id */

         bg = parseline(cmdline, argv);
         if (!builtin_command(argv)) {
            if ((pid = Fork()) == 0) {   /* child runs user job */
                execvp(argv[0], argv);
                fprintf(stderr, "%s: Command not found.\n", argv[0]);

             if (!bg) {    /* parent waits for fg job to terminate */
                 int status;
                  if (waitpid(pid, &status, 0) < 0)
                     unix_error("waitfg: waitpid error");
             else          /* otherwise, don’t wait for bg job */
                  printf("%d %s", pid, cmdline);

– 22 –                                                            CS 105
 Problem with Simple Shell
 Shell correctly waits for and reaps foreground jobs
 But what about background jobs?
            Will become zombies when they terminate
            Will never be reaped because shell (typically) will not
            Eventually you hit process limit and can’t do any work

 Solution: Reaping background jobs requires
   mechanism called a signal

– 23 –                                                                 CS 105
 A signal is a small message that notifies a process that
   an event of some type has occurred in the system
            Kernel abstraction for exceptions and interrupts
            Sent from kernel (sometimes at request of another process)
             to a process
            Different signals are identified by small integer ID’s
            The only information in a signal is its ID and the fact that it

ID         Name        Default Action     Corresponding Event
         2 SIGINT      Terminate          Interrupt from keyboard (ctl-c)
         9 SIGKILL     Terminate          Kill program (cannot override or ignore)
     11 SIGSEGV        Terminate & Dump   Segmentation violation
     14 SIGALRM        Terminate          Timer signal
     17 SIGCHLD        Ignore             Child stopped or terminated

– 24 –                                                                  CS 105
 Signal Concepts
 Sending a signal
            Kernel sends (delivers) a signal to a destination process by
             updating some state in the context of the destination
            Kernel sends a signal for one of the following reasons:
               Kernel has detected a system event such as divide by zero
                (SIGFPE) or termination of a child process (SIGCHLD)
               Another process has invoked the kill system call to explicitly
                request that the kernel send a signal to the destination process

– 25 –                                                                    CS 105
 Signal Concepts (cont.)
 Receiving a signal
            A destination process receives a signal when it is forced by
             the kernel to react in some way to the delivery of the signal
            Five possible ways to react:
               Ignore the signal (do nothing)
               Terminate the process
               Temporarily stop the process from running
               Continue a stopped process (let it run again)
               Catch the signal by executing a user-level function called a
                signal handler
                  » OS-initiated function call
                  » Akin to hardware exception handler being called in
                    response to asynchronous interrupt
                  » Like interrupts, signal handler might or might not return

– 26 –                                                                    CS 105
 Signal Concepts (cont.)
 A signal is pending if it has been sent but not yet
            There can be at most one pending signal of any particular type
            Important: signals are not queued
               If a process has pending signal of type k, then subsequent signals
                of type k for that process are discarded

 Process can block receipt of certain signals
            Blocked signals can be delivered, but won’t be received until
             signal is unblocked

 Pending signal is received at most once

– 27 –                                                                   CS 105
 Receiving Signals
 Suppose kernel is returning from exception handler
   and is ready to pass control to process p
 Kernel computes pnb = pending & ~blocked
            The set of pending nonblocked signals for process p

 If (pnb == 0)
            Pass control to next instruction in logical flow for p

            Choose lowest-numbered signal k in pnb and force process
             p to receive signal k
            Receipt of signal triggers some action by p
            Repeat for all nonzero k in pnb
            Pass control to next instruction in logical flow for p

– 29 –                                                                CS 105
 Sending Signals with kill
 kill sends arbitrary
   signal to a process or         linux> ./forks 16
   process group                  linux> Child1: pid=24818 pgrp=24817
                                  Child2: pid=24819 pgrp=24817

                                  linux> ps
 Examples                           PID TTY          TIME CMD
                                  24788 pts/2    00:00:00 tcsh
            kill –9 24818        24818 pts/2    00:00:02 forks
               Send SIGKILL to   24819 pts/2    00:00:02 forks
               process 24818      24820 pts/2    00:00:00 ps
                                  linux> kill -9 -24817
            kill –9 –24817       linux> ps
               Send SIGKILL to     PID TTY          TIME CMD
               every process in   24788 pts/2    00:00:00 tcsh
                                  24823 pts/2    00:00:00 ps
               process group

– 31 –                                                        CS 105
 Sending Signals
 From the Keyboard
 Typing ctrl-c (ctrl-z) sends a SIGINT (SIGTSTP) to every job in the
    foreground process group.
            SIGINT – default action is to terminate each process
            SIGTSTP – default action is to stop (suspend) each process

                                       pgid=10   Shell

                     pid=20    Fore-              Back-   pid=32
                    pgid=20   ground             ground   pgid=32   ground   pgid=40
                                job              job #1             job #2

                                             Background         Background
                        Child      Child      process            process
                                              group 32           group 40
                       pid=21     pid=22
                      pgid=20    pgid=20

                      process group 20
– 32 –                                                                                 CS 105
 Default Actions
 Each signal type has predefined default action, which is
   one of:
            Process terminates
            Process terminates and dumps core
            Process stops until restarted by a SIGCONT signal
            Process ignores the signal

– 35 –                                                           CS 105
 Installing Signal Handlers
 The signal function modifies the default action
   associated with receipt of signal signum:
            handler_t *signal(int signum, handler_t *handler)

 Different values for handler:
            SIG_IGN: ignore signals of type signum
            SIG_DFL: revert to default action on receipt of signals of type
            Otherwise, handler is address of a signal handler
               Referred to as ―installing‖ the handler
               Called when process receives signal of type signum
               Executing handler is called ―catching‖ or ―handling‖ the signal
               When handler returns, control passes back to instruction in control
                flow of process that was interrupted by receipt of the signal

– 36 –                                                                     CS 105
 Signal Handling Example
void int_handler(int sig)
    printf("Process %d received signal %d\n",
            getpid(), sig);
                                      linux> ./forks 13
void fork13()                         Killing process 24973
{                                     Killing process 24974
    pid_t pid[N];                     Killing process 24975
    int i, child_status;              Killing process 24976
    if (signal(SIGINT, SIG_IGN) != SIG_IGN)
                                      Killing process 24977
         signal(SIGINT, int_handler); Process 24977 received   signal 2
                                      Child 24977 terminated   with exit   status 0
    . . .                             Process 24976 received   signal 2
}                                     Child 24976 terminated   with exit   status 0
                                      Process 24975 received   signal 2
                                      Child 24975 terminated   with exit   status 0
                                      Process 24974 received   signal 2
                                      Child 24974 terminated   with exit   status 0
                                      Process 24973 received   signal 2
                                      Child 24973 terminated   with exit   status 0

– 37 –                                                                     CS 105
 Signal Handler Funkiness
int ccount = 0;
void child_handler(int sig)                            Pending signals are
    int child_status;                                    not queued
    pid_t pid = wait(&child_status);
    ccount--;                                                For each signal
    printf("Received signal %d from process %d\n",            type, just have
           sig, pid);
}                                                             single bit
                                                              indicating whether
void fork14()
                                                              or not signal is
      pid_t pid[N];                                           pending
      int i, child_status;
      ccount = N;                                            Even if multiple
      signal(SIGCHLD, child_handler);                         processes have
      for (i = 0; i < N; i++)
           if ((pid[i] = fork()) == 0) {                      sent this signal!
               /* Child: Exit */
      while (ccount > 0)
           pause();/* Suspend until signal occurs */
– 38 –                                                                CS 105
  Living With Nonqueuing Signals
         Must check for all terminated jobs
               Typically loop with waitpid

    void child_handler2(int sig)
        int child_status;
        pid_t pid;
        while ((pid = waitpid(-1, &child_status, WNOHANG)) != -1) {
           printf("Received signal %d from process %d\n",
             sig, pid);

    void fork15()
        . . .
        signal(SIGCHLD, child_handler2);
        . . .

– 39 –                                                        CS 105
 Signals provide process-level exception handling
            Can generate from user programs
            Can define effect by declaring signal handler

 Some caveats
            Very high overhead
               >10,000 clock cycles
               Only use for exceptional conditions
            Don’t have queues
               Just one bit for each pending signal type

– 40 –                                                       CS 105

Shared By: