Programming Assignments will be.. All the PAs are continuous 3 major factors that you should consider

Similar documents
Multitasking. Programmer s model of multitasking. fork() spawns new process. exit() terminates own process

Signals. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Processes & Signals. System Runs Many Processes Concurrently. State consists of memory image + register values + program counter

Shell and Signals. Computer Organization 3/17/2015. CSC252 - Spring The World of Multiprogramming or Multitasking. Unix Process Hierarchy

Lecture 24: Multitasking and Signals

Exceptions, Processes and Signals

Exceptional Control Flow Exists at All Levels of a System. Systemprogrammering 2007 Föreläsning 3 Exceptional Control Flow Part II

ECF Exists at All Levels of a System Exceptional Control Flow Part II Oct. 22, 2002 Topics! Process Hierarchy! Shells! Signals!

Exceptional Control Flow Part II

Giving credit where credit is due

CS213. Exceptional Control Flow Part II. Topics Process Hierarchy Signals

Exceptional Control Flow: Signals and Nonlocal Jumps

Exceptional Control Flow Part II Nov. 2, 2009"

What is an Operating System? Signals, Processes, & Threads. Resource Sharing. Resource Abstraction ... Operating Systems 10/20/2010

ECF Exists at All Levels of a System

CS 201. Processes. Gerson Robboy Portland State University

Excep&onal Control Flow: Signals and Nonlocal Jumps

Processes & Threads. (Chapter 3) CS 4410 Operating Systems. [R. Agarwal, L. Alvisi, A. Bracy, M. George, E. Sirer, R. Van Renesse]

Operating Systems Components. What is an Operating System? Process Management. Memory Management. Operating Systems 9/7/2018 CSC 256/456 1

Q & A (1) Where were string literals stored? Virtual Address. SSE2033: System Software Experiment 2 Spring 2016 Jin-Soo Kim

Mul$tasking and Shells

Program and OS Intera/on: Mul/tasking and Signals

Exceptional Control Flow: Signals and Nonlocal Jumps

Foundations of Computer Systems

Last Class. System Calls, Kernel Mode, and Process Implementation. Processes. Today. Operating Systems 9/11/2018 CSC 256/456 1

Exceptional Control Flow: Signals

Announcement (1) sys.skku.edu is now available

Exceptional Control Flow Part II October 24, 2007

Introduction to Computer Systems , fall th Lecture, Oct. 14 th

Processes. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Processes: Introduction. CS 241 February 13, 2012

CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2018 Lecture 20

Exceptional Control Flow Part I

Control Flow. Systemprogrammering 2007 Föreläsning 2 Exceptional Control Flow Part I. Exceptional Control Flow. Altering the Control Flow

Today. Introduction to Computer Systems /18 243, Fall th Lecture. Control Flow. Altering the Control Flow.

Concurrent Processes. CS 475, Spring 2018 Concurrent & Distributed Systems

Exceptional Control Flow: Exceptions and Processes

Exceptional Control Flow Part I Oct. 17, 2002

Exceptional Control Flow Part I Oct. 28, 2009"

Today. Exceptional Control Flow Processes. Exceptions and Processes. Control Flow. Altering the Control Flow

Exceptional Control Flow Part I September 22, 2008

Signals, Synchronization. CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han

Giving credit where credit is due

CSCI0330 Intro Computer Systems Doeppner. Project Shell 2. Due: November 8, 2017 at 11:59pm. 1 Introduction 2

Are branches/calls the only way we can get the processor to go somewhere in a program? What is a program? A processor? A process?

Signals. Goals of this Lecture. Help you learn about: Sending signals Handling signals

Exceptional Control Flow Part I

Signals. Joseph Cordina

Processes, Signals, I/O, Shell Lab : Introduc>on to Computer Systems Recita>on 9: Monday, Oct. 21, 2013 Marjorie Carlson Sec>on A

Process Control. Philipp Koehn. 23 April 2018

Process. Signal #8. Signals are software interrupts from unexpected events. a power failure. an alarm clock. the death of a child process

Processes, Exceptional

Process Management forks, bombs, zombies, and daemons! Lecture 5, Hands-On Unix System Administration DeCal

University of Washington What is a process?

Computer Science & Engineering Department I. I. T. Kharagpur. Operating System: CS rd Year CSE: 5th Semester (Autumn ) Lecture VII

Lesson 3. The func procedure allows a user to choose the action upon receipt of a signal.

CSC 252: Computer Organization Spring 2018: Lecture 19

Signals: Management and Implementation. Sanjiv K. Bhatia Univ. of Missouri St. Louis

System Programming. Signals I

CS 4410, Fall 2017 Project 1: My First Shell Assigned: August 27, 2017 Due: Monday, September 11:59PM

PROCESS CONTROL BLOCK TWO-STATE MODEL (CONT D)

!"#$%&'()*+,'(-.'*+/*' ()*5+)(6+7'(*'#)*+89:%5 !,/+!"35-5+)-+;**+<$=$*5+'>+)+2?5-$:

CSC374, Spring 2010 Lab Assignment 1: Writing Your Own Unix Shell

HW 1: Shell. Contents CS 162. Due: September 18, Getting started 2. 2 Add support for cd and pwd 2. 3 Program execution 2. 4 Path resolution 3

Preview. Process Termination. wait and waitpid() System Call. wait and waitpid() System Call. waitpid() System Call 10/23/2018

Princeton University. Computer Science 217: Introduction to Programming Systems. Signals

Altering the Control Flow

Operating Systems 9/6/ SIGINT Terminate Interrupt from keyboard (ctl-c) 9 SIGKILL Terminate Kill program (cannot override or ignore)

Exceptions, Processes and Signals

Processes. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Each terminal window has a process group associated with it this defines the current foreground process group. Keyboard-generated signals are sent to

Announcement (1) Due date for PA3 is changed (~ next week) PA4 will also be started in the next class. Not submitted. Not scored

Excep&onal Control Flow: Excep&ons and Processes

KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS Information and Computer Science Department ICS 431 Operating Systems Lab # 6

CSCI Computer Systems Fundamentals Shell Lab: Writing Your Own Unix Shell

CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2017 Lecture 19

Shell Execution of Programs. Process Groups, Session and Signals 1

Kernel and processes

Altering the Control Flow

Introduction to Computer Systems , fall th Lecture, Oct. 7 th

Signals and Session Management. Signals. Mechanism to notify processes of system events

CSE 421: Introduction to Operating Systems

Excep onal Control Flow: Excep ons and Processes

IC221: Systems Programming 12-Week Written Exam [SOLUTIONS]

CSCI2467: Systems Programming Concepts

Programs. Program: Set of commands stored in a file Stored on disk Starting a program creates a process static Process: Program loaded in RAM dynamic

Processes. CSE 351 Autumn Instructor: Justin Hsia

Excep&onal Control Flow: Signals and Nonlocal Jumps

CSci 4061 Introduction to Operating Systems. (Advanced Control Signals)

Exceptional Control Flow: Exceptions and Processes

Program and OS interac0ons: Excep0ons and Processes

CSE351 Inaugural Edi7on Spring

Processes. CSE 351 Autumn Instructor: Justin Hsia

Processes. Processes (cont d)

Excep&onal Control Flow

Advanced Unix Concepts. Satyajit Rai

CS 213, Fall 2002 Lab Assignment L5: Writing Your Own Unix Shell Assigned: Oct. 24, Due: Thu., Oct. 31, 11:59PM

Operating System Structure

Approaches to Concurrency

CS3733: Operating Systems

Transcription:

Signals Prof. Jin-Soo Kim( jinsookim@skku.edu) TA - Dong-Yun Lee (dylee@csl.skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu

NOTICE Programming Assignments will be.. All the PAs are continuous 3 major factors that you should consider 1. Functionality 2. Documentation 3. Code standard Please test your code with uploaded scripts before submit 2

Programming Assignment (1) Make search engine for the holy bible Index builder & Index printer Your code should run correctly in any file in http://www.stewartonbibleschool.org.uk/bible/text/ Bonus : managing index with hashing Please notice me with e-mail if you employ hashing Do not use<string.h>, use my_string.h instead 3

Programming Assignment (2) Do not use {fopen, fread, fwrite,, use system calls instead How to make PDF files DO NOT COPY; I WILL FIND YOU Question? 4

Multitasking Programmer s model of multitasking fork() spawns new process Called once, returns twice exit() terminates own process Called once, never returns Puts it into zombie status wait() and waitpid() wait for and reap terminated children execve() runs new program in existing process Called once, (normally) never returns 5

Shell Definition 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 Execution is a sequence of read/evaluate steps int main() { char cmdline[maxline]; while (1) { /* read */ printf("> "); fgets(cmdline, MAXLINE, stdin); if (feof(stdin)) exit(0); /* evaluate */ eval(cmdline); 6

Simple Shell Example (1) 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); 7

Simple Shell Example (2) 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. 8

Signal Definition 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 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. 9

10

Signal Concepts (1) 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: Generated internally:» Divide-by-zero (SIGFPE)» Termination of a child process (SIGCHLD), Generated externally:» kill system call by another process to request signal to the destination process. 11

Signal Concepts (2) 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: Explicitly ignore the signal Execute the default action Catch the signal by invoking signal-handler function» Akin to a hardware exception handler being called in response to an asynchronous interrupt. 12

Signal Concepts (3) Default actions Abort The process is destroyed Dump The process is destroyed & core dump Ignore The signal is ignored Stop The process is stopped Continue If the process is stopped, it is put into running state 13

Signal Concepts (4) Signal semantics 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. Signals are not queued! A process can block the receipt of certain signals. Blocked signals can be delivered, but will not be received until the signal is unblocked. There is one signal that can not be blocked by the process. (SIGKILL) (One more SIGSTOP) A pending signal is received at most once. Kernel uses a bit vector for indicating pending signals. 14

Signal Concepts (5) Implementation 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. 15

Process Groups Every process belongs to exactly one process group. pid=10 pgid=10 Shell pid=20 pgid=20 Child pid=21 pgid=20 Foreground job Child pid=22 pgid=20 Foreground process group 20 Background job #1 pid=32 pgid=32 Background process group 32 Background job #2 pid=40 pgid=40 Background process group 40 getpgrp() Return process group of current process setpgid() Change process group of a process 16

Sending Signals (1) 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. Foreground process group 20 pid=10 pgid=10 Shell pid=20 pgid=20 Child pid=21 pgid=20 Foreground job Child pid=22 pgid=20 Background job #1 Background process group 32 pid=32 pgid=32 Background job #2 Background process group 40 pid=40 pgid=40 17

Sending Signals (2) int kill(pid_t pid, int sig) Can be used to send any signal to any process group or process. pid > 0, signal sig is sent to pid. pid == 0, sig is sent to every process in the process group of the current process. pid == -1, sig is sent to every process except for process 1. pid < -1, sig is sent to every process in the process group pid. sig == 0, no signal is sent, but error checking is performed. /bin/kill program sends arbitrary signal to a process or process group. $ kill 10231 // SIGTERM : default signal $ kill 9 10231 // SIGKILL 18

Sending Signals (3) void fork12() { 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); 19

Receiving Signals (1) Handling 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) { Choose least 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. Pass control to next instruction in the logical flow for p. 20

Receiving Signals (2) 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. 21

Installing Signal Handlers sighandler_t signal (int sig, sighandler_t handler) typedef void (*sighandler_t)(int); The signal function modifies the default action associated with the receipt of signal sig. Different values for handler: SIG_IGN: ignore signals of type sig. SIG_DFL: revert to the default action. Otherwise, handler is the address of a signal handler. Called when process receives signal of type sig. Referred to as installing the signal handler. Executing handler is called catching or handling the signal. When the handler executes its return statement, control passes back to instruction in the control flow of the process that was interrupted by receipt of the signal. 22

Handling Signals (1) Things to remember Pending signals are not queued. For each signal type, just have single bit indicating whether or not signal is pending. Even if multiple processes have sent this signal. A newly arrived signal is blocked while the handler of the signal is running. Sometimes system calls such as read() are not restarted automatically after they are interrupted by the delivery of a signal. They return prematurely to the calling application with an error condition. (errno == EINTR) 23

Handling Signals (2) What is the problem of the following code? int ccount = 0; void handler (int sig) { pid_t pid = wait(null); ccount--; printf ( Received signal %d from pid %d\n, sig, pid); void fork14() { pid_t pid[n]; int i; ccount = N; signal (SIGCHLD, handler); for (i = 0; i < N; i++) if ((pid[i] = fork()) == 0) /* child */ exit(0); while (ccount > 0) sleep (5); 24

Exercise #1 Deal with non-queueing signals int ccount = 0; void handler (int sig) { pid_t pid = wait(null); ccount--; printf ( Received signal %d from pid %d\n, sig, pid); void fork14() { pid_t pid[n]; int i; ccount = N; signal (SIGCHLD, handler); for (i = 0; i < N; i++) if ((pid[i] = fork()) == 0) /* child */ exit(0); while (ccount > 0) sleep (5); 25

Exercise #2 React to externally generated events Make zombie process When the process get ctrl+c signal from keyboard, it just prints beep to the monitor 5 times with 1-second interval Print I m Alive! to the monitor after 5-times beep 26

Exercise #3 React to internally generated events Make alarm for every 1 second Print BEEP for each second Tip : alarm(int t) send SIGALRM after t seconds 27