Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 201 Exceptions and System calls Part II. – 2 – Shell Programs A shell is an application program that runs programs on behalf of the user. sh – Original.

Similar presentations


Presentation on theme: "CS 201 Exceptions and System calls Part II. – 2 – Shell Programs A shell is an application program that runs programs on behalf of the user. sh – Original."— Presentation transcript:

1 CS 201 Exceptions and System calls Part II

2 – 2 – 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 bash – Bourne-Again Shell int main() { char cmdline[MAXLINE]; while (1) { /* read */ printf("> "); Fgets(cmdline, MAXLINE, stdin); if (feof(stdin)) exit(0); /* evaluate */ eval(cmdline); } Execution is a sequence of read/evaluate steps

3 – 3 – Simple Shell eval Function void eval(char *cmdline) { char *argv[MAXARGS]; /* argv for execve() */ 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 */ if (execve(argv[0], argv, environ) < 0) { printf("%s: Command not found.\n", argv[0]); exit(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); }

4 – 4 – Problem with Simple Shell Example 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 terminate. Creates a memory leak that will eventually crash the kernel when it runs out of memory. Solution: Reaping background jobs requires a mechanism called a signal.

5 – 5 – Signals 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 the kernel (sometimes at the 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 arrived. IDName 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

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

7 – 7 – 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. Three possible ways to react: Ignore the signal (do nothing) Terminate the process. Catch the signal by executing a user-level function called a signal handler. »Akin to a hardware exception handler being called in response to an asynchronous interrupt.

8 – 8 – Signal Concepts (cont) A signal is pending if it has been sent but not yet received. There can be at most one pending signal of any particular type. Important: Signals are not queued If a process has a pending signal of type k, then subsequent signals of type k that are sent to that process are discarded. A pending signal is received at most once. A process can block the receipt of certain signals. Blocked signals can eventually be delivered, but will not be received until the signal is unblocked.

9 – 9 – Signal Concepts Kernel maintains pending and blocked bit vectors in the context of each process. pending – represents the set of pending signals Kernel sets bit k in pending whenever a signal of type k is delivered. Kernel clears bit k in pending whenever a signal of type k is received blocked – represents the set of blocked signals Can be set and cleared by the application using the sigprocmask function.

10 – 10 – Process Groups Signals can be sent to every process in a process group Every process belongs to exactly one process group Fore- ground job Back- ground job #1 Back- ground job #2 Shell Child pid=10 pgid=10 Foreground process group 20 Background process group 32 Background process group 40 pid=20 pgid=20 pid=32 pgid=32 pid=40 pgid=40 pid=21 pgid=20 pid=22 pgid=20 getpgrp() setpgrp()

11 – 11 – C interface getpgrp() Returns the process group ID of calling process #include pid_t getpgrp(void);setpgrp() Sets the process group of process pid to pgid Returns 0 on success, -1 on error #include pid_t setpgrp(pid_t pid, pid_t pgid);

12 – 12 – Sending Signals with kill Program kill program sends arbitrary signal to a process or process group Examples kill –9 24818 Send SIGKILL to process 24818 kill –9 –24817 Send SIGKILL to every process in process group 24817. linux>./forks 16 linux> Child1: pid=24818 pgrp=24817 Child2: pid=24819 pgrp=24817 linux> ps PID TTY TIME CMD 24788 pts/2 00:00:00 tcsh 24818 pts/2 00:00:02 forks 24819 pts/2 00:00:02 forks 24820 pts/2 00:00:00 ps linux> kill -9 -24817 linux> ps PID TTY TIME CMD 24788 pts/2 00:00:00 tcsh 24823 pts/2 00:00:00 ps linux>

13 – 13 – Sending Signals from the Keyboard Typing ctrl-c (ctrl-z) sends a SIGINT (SIGTSTP) to every job in the foreground process group. SIGTERM – default action is to terminate each process SIGTSTP – default action is to stop (suspend) each process Fore- ground job Back- ground job #1 Back- ground job #2 Shell Child pid=10 pgid=10 Foreground process group 20 Background process group 32 Background process group 40 pid=20 pgid=20 pid=32 pgid=32 pid=40 pgid=40 pid=21 pgid=20 pid=22 pgid=20

14 – 14 – Example of ctrl-c and ctrl-z linux>./forks 17 Child: pid=24868 pgrp=24867 Parent: pid=24867 pgrp=24867 Suspended linux> ps a PID TTY STAT TIME COMMAND 24788 pts/2 S 0:00 -usr/local/bin/tcsh -i 24867 pts/2 T 0:01./forks 17 24868 pts/2 T 0:01./forks 17 24869 pts/2 R 0:00 ps a bass> fg./forks 17 linux> ps a PID TTY STAT TIME COMMAND 24788 pts/2 S 0:00 -usr/local/bin/tcsh -i 24870 pts/2 R 0:00 ps a

15 – 15 – C interface kill() Sends signal number sig to process pid if pid is greater than 0 Sends signal number sig to process group pid if pid is less than 0 Returns 0 on success, -1 on error #include int kill(pid_t pid, int sig);

16 – 16 – Sending Signals with kill Function int main() { pid_t pid[N]; int i, child_status; for (i = 0; i < N; i++) if ((pid[i] = fork()) == 0) while(1); /* Child infinite loop */ /* Parent terminates the child processes */ for (i = 0; i < N; i++) { printf("Killing process %d\n", pid[i]); kill(pid[i], SIGINT); } /* Parent reaps terminated children */ for (i = 0; i < N; i++) { pid_t wpid = wait(&child_status); if (WIFEXITED(child_status)) printf("Child %d terminated with exit status %d\n", wpid, WEXITSTATUS(child_status)); else printf("Child %d terminated abnormally\n", wpid); } http://thefengs.com/wuchang/courses/cs201/class/17/sigint_nocatch linux>./sigint_nocatch Killing process 18860 Killing process 18861 Killing process 18862 Killing process 18863 Killing process 18864 Killing process 18865 Killing process 18866 Killing process 18867 Killing process 18868 Killing process 18869 Child 18862 terminated abnormally Child 18863 terminated abnormally Child 18860 terminated abnormally Child 18866 terminated abnormally Child 18867 terminated abnormally Child 18861 terminated abnormally Child 18869 terminated abnormally Child 18865 terminated abnormally Child 18868 terminated abnormally Child 18864 terminated abnormally linux>

17 – 17 – Receiving Signals Suppose the kernel is returning from an 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 the logical flow for p.else Choose least significant nonzero bit k in pnb and force process p to receive signal k. The receipt of the signal triggers some action by p Repeat for all nonzero k in pnb.

18 – 18 – Default Actions Each signal type has a predefined default action, which is one of: The process terminates The process terminates and dumps core. The process stops until restarted by a SIGCONT signal. The process ignores the signal.

19 – 19 – Installing Signal Handlers The signal function modifies the default action associated with the 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 the default action on receipt of signals of type signum. Otherwise, handler is the address of a signal handler Called when process receives signal of type signum Referred to as “installing” the handler. Executing handler is called “catching” or “handling” the signal. When the handler executes its return statement, control passes back to instruction of the process that was interrupted by receipt of the signal.

20 – 20 – Signal Handling Example linux>./sigint ^CYou think hitting ctrl-c works? 5 more left! ^CYou think hitting ctrl-c works? 4 more left! ^CYou think hitting ctrl-c works? 3 more left! ^CYou think hitting ctrl-c works? 2 more left! ^CYou think hitting ctrl-c works? 1 more left! linux> #include int count = 5; void handler(int sig) { printf("You think hitting ctrl-c works? %d more left!\n", count); count--; if (count == 0) exit(0); } int main() { signal(SIGINT, handler); /* installs ctrl-c handler */ while (1) {} } http://thefengs.com/wuchang/courses/cs201/class/17/sigint_count

21 – 21 – Signal Handling Example void int_handler(int sig) { printf("Process %d received signal %d\n", getpid(), sig); exit(0); } int main() { pid_t pid[N]; int i, child_status; signal(SIGINT, int_handler); for (i = 0; i < N; i++) if ((pid[i] = fork()) == 0) while(1); /* Child infinite loop */ /* Parent terminates the child processes */ for (i = 0; i < N; i++) { printf("Killing process %d\n", pid[i]); kill(pid[i], SIGINT); } /* Parent reaps terminated children */ for (i = 0; i < N; i++) { pid_t wpid = wait(&child_status); if (WIFEXITED(child_status)) printf("Child %d terminated with exit status %d\n", wpid, WEXITSTATUS(child_status)); else printf("Child %d terminated abnormally\n", wpid); } linux>./forks 13 Killing process 24973 Killing process 24974 Killing process 24975 Killing process 24976 Killing process 24977 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 linux> http://thefengs.com/wuchang/courses/cs201/class/17/sigint_catch

22 – 22 – Signal Handler Funkiness int ccount = N; void child_handler(int sig) { int child_status; pid_t pid; printf("In child handler\n"); while ((pid = wait(&child_status)) > 0) { ccount--; printf("Received signal %d from process %d\n", sig, pid); } int main() { pid_t pid[N]; int i; signal(SIGCHLD, child_handler); for (i = 0; i < N; i++) if ((pid[i] = fork()) == 0) { /* Child: Exit */ exit(0); } while (ccount > 0) pause();/* Suspend until signal occurs */ exit(0); } Pending signals are not queued Each signal type has a single bit indicating whether or not signal is pending even if multiple processes have sent a signal Parent can hang waiting for more signals if two are delivered at the same time (and only one wait is called in handler) Must check for all terminated children Call wait in loop http://thefengs.com/wuchang/courses/cs201/class/17/sigint_noq

23 – 23 – Signal Handler Funkiness int ccount = N; void child_handler(int sig) { int child_status; pid_t pid; printf("In child handler\n"); while ((pid = wait(&child_status)) > 0) { ccount--; printf("Received signal %d from process %d\n", sig, pid); } int main() { pid_t pid[N]; int i; signal(SIGCHLD, child_handler); for (i = 0; i < N; i++) if ((pid[i] = fork()) == 0) { /* Child: Exit */ exit(0); } while (ccount > 0) pause();/* Suspend until signal occurs */ exit(0); } linux>./sigchld_noq In child handler Received signal 17 from process 19415 In child handler Received signal 17 from process 19416 Received signal 17 from process 19417 In child handler Received signal 17 from process 19418 Received signal 17 from process 19419 In child handler Received signal 17 from process 19420 Received signal 17 from process 19421 In child handler Received signal 17 from process 19422 Received signal 17 from process 19423 In child handler Received signal 17 from process 19424 linux> http://thefengs.com/wuchang/courses/cs201/class/17/sigint_noq

24 – 24 – Timer signals Similar to sleep, but delivers a signal instead of returning control to program C interface #include unsigned int alarm(unsigned int secs); Sends a SIGALRM signal to current process after a specified time interval has elapsed Returns remaining secs of previous alarm or 0 if no previous alarm

25 – 25 – Example #include int beeps = 0; /* SIGALRM handler */ void handler(int sig) { printf("BEEP\n"); fflush(stdout); if (++beeps < 5) alarm(1); else { printf("BOOM!\n"); exit(0); } main() { signal(SIGALRM, handler); alarm(1); /* send SIGALRM in 1 second */ while (1) { /* handler returns here */ } linux> a.out BEEP BOOM! bass>

26 – 26 – Nonlocal Jumps: setjmp/longjmp Powerful (but dangerous) user-level mechanism for transferring control to an arbitrary location. Controlled to way to break the procedure call/return discipline Useful for error recovery and signal handling int setjmp(jmp_buf j) Must be called before longjmp Identifies a return site for a subsequent longjmp. Called once, returns one or more timesImplementation: Remember where you are by storing the current register context, stack pointer, and PC value in jmp_buf. Return 0

27 – 27 – setjmp/longjmp (cont) void longjmp(jmp_buf j, int i) Meaning: return from the setjmp remembered by jump buffer j again... …this time returning i instead of 0 Called after setjmp Called once, but never returns longjmp Implementation: Restore register context from jump buffer j Set %eax (the return value) to i Jump to the location indicated by the PC stored in jump buf j.

28 – 28 – setjmp / longjmp Example #include jmp_buf buf; main() { if (setjmp(buf) != 0) { printf("back in main due to an error\n"); else printf("first time through\n"); p1(); /* p1 calls p2, which calls p3 */ }... p3() { if (error) longjmp(buf, 1) }

29 – 29 – Putting It All Together: A Program That Restarts Itself When ctrl-c ’d #include sigjmp_buf buf; void handler(int sig) { longjmp(buf, 1); } main() { signal(SIGINT, handler); if (setjmp(buf)==0) printf("starting\n"); else printf("restarting\n"); while(1) { sleep(1); printf("processing...\n"); } bass> a.out starting processing... restarting processing... restarting processing... restarting processing... Ctrl-c

30 – 30 – Limitations of Nonlocal Jumps Works within stack discipline Can only long jump to environment of function that has been called but not yet completed Good: P1's stack frame still valid jmp_buf env; P1() { if (setjmp(env)) { /* Long Jump to here */ } else { P2(); } P2() {... P2();... P3(); } P3() { longjmp(env, 1); } P1 P2 P3 env P1 Before longjmp After longjmp

31 – 31 – Limitations of Long Jumps (cont.) Works within stack discipline Can only long jump to environment of function that has been called but not yet completed Bad: Need P2's stack frame to be valid! jmp_buf env; P1() { P2(); P3(); } P2() { if (setjmp(env)) { /* Long Jump to here */ } P3() { longjmp(env, 1); } env P1 P2 At setjmp P1 P3 env At longjmp X P1 P2 P2 returns env X

32 – 32 – Summary 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 Nonlocal jumps provide exceptional control flow within process Within constraints of stack discipline

33 – 33 – Chapter summary Exceptions Hardware and operating system kernel software Concurrent processes Hardware timer and kernel softwareSignals Kernel software Non-local jumps Application code

34 – 34 – Extra slides

35 – 35 – Unix Process Hierarchy Login shell Child Grandchild [0] Daemon e.g. httpd init [1]

36 – 36 – Unix Startup: Step 1 init [1] [0] Process 0: handcrafted kernel process Child process 1 execs /sbin/init 1. Pushing reset button loads the PC with the address of a small bootstrap program. 2. Bootstrap program loads the boot block (disk block 0). 3. Boot block program loads kernel binary (e.g., /boot/vmlinux ) 4. Boot block program passes control to kernel. 5. Kernel handcrafts the data structures for process 0. Process 0 forks child process 1

37 – 37 – Unix Startup: Step 2 init [1] [0] getty Daemons e.g. ftpd, httpd /etc/inittab init forks and execs daemons per /etc/inittab, and forks and execs a getty program for the console

38 – 38 – Unix Startup: Step 3 init [1] [0] The getty process execs a login program login

39 – 39 – Unix Startup: Step 4 init [1] [0] login reads login and passwd. if OK, it execs a shell. if not OK, it execs another getty tcsh


Download ppt "CS 201 Exceptions and System calls Part II. – 2 – Shell Programs A shell is an application program that runs programs on behalf of the user. sh – Original."

Similar presentations


Ads by Google