Slide 1: CS110 Lecture 08: Concurrency and Race Conditions

Principles of Computer Systems

Winter 2020

Stanford University

Computer Science Department

Instructors: Chris Gregg and

                            Nick Troccoli

https://comic.browserling.com/53​

Slide 2: CS110 Topic 2: How can our programs create and interact with other programs?

Slide 3: Learning About Processes

Creating processes and running other programs

Inter-process communication

Signals

Concurrency and Race Conditions

1/15

1/22

1/27

Today

Slide 4: Today's Learning Goals

• Understand what a race condition is and how they can cause problems in programs
• Learn about the race condition checklist for identifying and avoiding race conditions
• Learn more about sigsuspend and how it helps us avoid race conditions

Slide 5: Plan For Today

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

Slide 6: Plan For Today

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

Slide 7: Signals

A signal is a way to notify a process that an event has occurred

• There is a list of defined signals that can be sent (or you can define your own): SIGINT, SIGSTOP, SIGKILL, SIGCONT, etc.
• A signal is really a number (e.g. SIGSEGV is 11)
• A program can have a function executed when a type of signal is received
• Signals are sent either by the operating system, or by another process
  • e.g. SIGCHLD sent by OS to parent when child changes state
• You can send a signal to yourself or to another process you own

Slide 8: Sending Signals

The operating system sends many signals, but we can also send signals manually.

• kill sends the specified signal to the specified process (poorly-named; previously, default was to just terminate target process)
• pid parameter can be > 0 (specify single pid), < -1 (specify process group abs(pid)), or 0/-1 (we ignore these).
• raise sends the specified signal to yourself

int kill(pid_t pid, int signum);

// same as kill(getpid(), signum)
int raise(int signum);

Slide 9:

waitpid()

Waitpid can be used to wait on children to terminate or change state:

• pid: the PID of the child to wait on, or -1 to wait on any of our children
• status: where to put info about the child's status (or NULL)
• the return value is the PID of the child that was waited on, -1 on error, or 0 if there are other children to wait for, but we are not blocking.

The default behavior is to wait for the specified child process to exit.  options lets us customize this further (can combine these flags using | ):

• WUNTRACED - also wait on a child to be stopped
• WCONTINUED - also wait on a child to be continued
• WNOHANG - don't block

Slide 10: Signal Handlers

We can have a function of our choice execute when a certain signal is received.

• We must register this "signal handler" with the operating system, and then it will be called for us.

• signum is the signal (e.g. SIGCHLD) we are interested in.  
• handler is a function pointer for the function to call when this signal is received.
• (Note: no handlers allowed for SIGSTOP or SIGKILL)

typedef void (*sighandler_t)(int);
...
sighandler_t signal(int signum, sighandler_t handler);

Slide 11: Signal Handlers

A signal can be received at any time, and a signal handler can execute at any time.

• Signals aren't handled immediately (there can be delays)
• Signal handlers can execute at any point during the program execution (eg. pause main() execution, execute handler, resume main() execution)
  • Goal: keep signal handlers simple!
• Similar to hardware interrupts -- POSIX brings that model to software

Slide 12: Signal Handlers

Key Idea: a signal handler is called if one or more signals of a type are sent.

• Like a notification that "one or more signals of this type are waiting for you!"
• The kernel tracks only what signals should be sent to you, not how many

Solution: signal handler should clean up as many children as possible, using WNOHANG, which means don't block.  If there are children we would have waited on but aren't, returns 0.  -1 typically means no children left.

static void reapChild(int sig) {
  while (true) {
    pid_t pid = waitpid(-1, NULL, WNOHANG);
    if (pid <= 0) break;
    numDone++;
  } 
}

Slide 13: Do Not Disturb

The sigprocmask function lets us temporarily block signals of the specified types.  Instead, they will be delivered when the block is removed.

• To add signals to the blocked list, how = SIG_BLOCK, set points to the signals to add
• To remove signals from the blocked list, how = SIG_UNBLOCK, set points to the signals to remove
• To set the whole blocked list, how = SIG_SETMASK, set is the location of the new blocked list
• In all cases, oldset is where to store the old blocked list (or NULL).

Slide 14: Do Not Disturb

sigset_t is a special type (usually a 32-bit int) used as a bit vector.  It must be created and initialized using special functions (we generally ignore the return values).

// Initialize to the empty set of signals
int sigemptyset(sigset_t *set);

// Set to contain all signals
int sigfillset(sigset_t *set);

// Add the specified signal
int sigaddset(sigset_t *set, int signum);

// Remove the specified signal
int sigdelset(sigset_t *set, int signum);

static void imposeSIGCHLDBlock() { 
    sigset_t set;
    sigemptyset(&set);
    sigaddset(&set, SIGCHLD); 
    sigprocmask(SIG_BLOCK, &set, NULL);
}

Slide 15: Plan For Today

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

Slide 16: Concurrency

Concurrency means performing multiple actions at the same time.

• Concurrency is extremely powerful: it can make your systems faster, more responsive, and more efficient. It's fundamental to all modern software.
• ​​When you introduce multiprocessing (e.g. fork) and asynchronous signal handling (e.g. signal), it's possible to have concurrency issues.  These are tricky!
• Most challenges come with shared data - e.g. two routines using the same variable.
• Many large systems parallelize computations by trying to eliminate shared data - e.g. split the data into independent chunks and process in parallel.
• A race condition is an unpredictable ordering of events (due to e.g. OS scheduling) where some orderings may cause undesired behavior.

Slide 17: Off To The Races

// job-list-broken.c
static void reapProcesses(int sig) {
  while (true) {
    pid_t pid = waitpid(-1, NULL, WNOHANG);
    if (pid <= 0) break;
    printf("Job %d removed from job list.\n", pid);
  }
}

char * const kArguments[] = {"date", NULL};
int main(int argc, char *argv[]) {
  signal(SIGCHLD, reapProcesses);
  for (size_t i = 0; i < 3; i++) {
    pid_t pid = fork();
    if (pid == 0) execvp(kArguments[0], kArguments);
    sleep(1); // force parent off CPU
    printf("Job %d added to job list.\n", pid);
  }
  return 0;
}

myth60$ ./job-list-broken
Sun Jan 27 03:57:30 PDT 2019
Job 27981 removed from job list.
Job 27981 added to job list.
Sun Jan 27 03:57:31 PDT 2019
Job 27982 removed from job list.
Job 27982 added to job list.
Sun Jan 27 03:57:32 PDT 2019
Job 27985 removed from job list.
Job 27985 added to job list.
myth60$ ./job-list-broken
Sun Jan 27 03:59:33 PDT 2019
Job 28380 removed from job list.
Job 28380 added to job list.
Sun Jan 27 03:59:34 PDT 2019
Job 28381 removed from job list.
Job 28381 added to job list.
Sun Jan 27 03:59:35 PDT 2019
Job 28382 removed from job list.
Job 28382 added to job list.
myth60$

Symptom: it looks like jobs are being removed from the list before being added!  How is this possible?

Slide 18: Off To The Races

// job-list-broken.c
static void reapProcesses(int sig) {
  while (true) {
    pid_t pid = waitpid(-1, NULL, WNOHANG);
    if (pid <= 0) break;
    printf("Job %d removed from job list.\n", pid);
  }
}

char * const kArguments[] = {"date", NULL};
int main(int argc, char *argv[]) {
  signal(SIGCHLD, reapProcesses);
  for (size_t i = 0; i < 3; i++) {
    pid_t pid = fork();
    if (pid == 0) execvp(kArguments[0], kArguments);
    sleep(1); // force parent off CPU
    printf("Job %d added to job list.\n", pid);
  }
  return 0;
}

Issue: the signal handler is being called before the parent adds to the job list.

Solution: block SIGCHLD from lines 14-17 to force the parent to always add to the job list first.

This is called a critical section - a piece of code that is indivisible.  It cannot be interrupted midway by our other code.

block

unblock

Slide 19: Off To The Races

• This is called a critical section - a piece of code that is indivisible.  It cannot be interrupted midway by our other code.
• If something is atomic, it means it cannot be interrupted by something else.
• Code that executes while a signal is blocked is atomic with respect to that signal's handler - the handler executes before or after the code, but never during.

// job-list-fixed.c
char * const kArguments[] = {"date", NULL};
int main(int argc, char *argv[]) {
  signal(SIGCHLD, reapProcesses);
  
  // Create set with just SIGCHLD
  sigset_t set;
  sigemptyset(&set);
  sigaddset(&set, SIGCHLD);
  
  for (size_t i = 0; i < 3; i++) {
    sigprocmask(SIG_BLOCK, &set, NULL);
    pid_t pid = fork();
    if (pid == 0) {
      sigprocmask(SIG_UNBLOCK, &set, NULL);
      execvp(kArguments[0], kArguments);
    }
    sleep(1); // force parent off CPU
    printf("Job %d added to job list.\n", pid);
    sigprocmask(SIG_UNBLOCK, &set, NULL);
  }
  return 0;
}

Slide 20: Race Conditions and Concurrency

Race conditions are a fundamental problem in concurrent code.

• Decades of research in how to detect and deal with them
• They can corrupt your data and violate its integrity, so it is no longer consistent
• Critical sections can prevent race conditions, but there are two major challenges
  • Figuring out where to put critical sections
    • E.g. You have a global linked list. A signal handler prints out the list. Your main code inserts and deletes from the list. You need to make sure every update to the list executes atomically, so a signal handler never sees a bad pointer.
  • Structuring your code so critical sections don't limit performance
    • E.g. if your code spends most of its time in critical sections, then signals may be delayed for a long time (making your program less responsive).

☐ Identify shared data that may be modified concurrently.  What global variables are used in both the main code and signal handlers?

☐ Document and confirm an ordering of events that causes unexpected behavior.  What assumptions are made in the code that can be broken by certain orderings?

☐ Use concurrency directives to force expected orderings.  How can we use signal blocking and atomic operations to force the correct ordering(s)?

Slide 21: Plan For Today

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

static void executeCommand(char *command, bool inBackground) {
    pid_t pidOrZero = fork();
    if (pidOrZero == 0) {
        char *arguments[] = {"/bin/sh", "-c", command, NULL};
        execvp(arguments[0], arguments);
        exit(1);
    }

    // If we are the parent, either wait or return immediately
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitpid(pidOrZero, NULL, 0);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
    }
}

int main(int argc, char *argv[]) {
    signal(SIGCHLD, reapProcesses);
    ...
}

Slide 22: Revisiting Our Shell

Last time, we added a handler that cleans up terminated children, to clean up background commands.

Issue: this handler will be called to clean up all children, even foreground commands.  Why?Signal handlers are first when waking up processes.

static void executeCommand(char *command, bool inBackground) {
    pid_t pidOrZero = fork();
    if (pidOrZero == 0) {
        char *arguments[] = {"/bin/sh", "-c", command, NULL};
        execvp(arguments[0], arguments);
        exit(1);
    }

    // If we are the parent, either wait or return immediately
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitpid(pidOrZero, NULL, 0);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
    }
}

int main(int argc, char *argv[]) {
    signal(SIGCHLD, reapProcesses);
    ...
}

Slide 23: Revisiting Our Shell

Issue: this handler will be called to clean up all children, even foreground commands.

Therefore, the waitpid on line 13 may block, but it always returns -1.  Can we get rid of it?

Goal: only call waitpid in signal handler.

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    while (foregroundPID == pid) {;}
}

static void executeCommand(char *command, bool inBackground) {
    // ...(omitted for brevity)...
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitForForegroundCommand(pidOrZero);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
        if (result == foregroundPID) foregroundPID = 0;
    }
}

Slide 24: Revisiting Our Shell

• In this version, we only call waitpid in the signal handler.
• We don't control the signature of reapProcesses, so we must make shared state like fgpid global variables  ☹
• Every time a new foreground process is created, fgpid is set to hold that process's pid. The shell then blocks by spinning in place until fgpid is cleared by reapProcesses.
• Are there any race conditions?

☐ Identify shared data that may be modified concurrently.  What global variables are used in both the main code and signal handlers?

☐ Document and confirm an ordering of events that causes unexpected behavior.  What assumptions are made in the code that can be broken by certain orderings?

☐ Use concurrency directives to force expected orderings.  How can we use signal blocking and atomic operations to force the correct ordering(s)?

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    while (foregroundPID == pid) {;}
}

static void executeCommand(char *command, bool inBackground) {
    // ...(omitted for brevity)...
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitForForegroundCommand(pidOrZero);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
        if (result == foregroundPID) foregroundPID = 0;
    }
}

Slide 25: Step 1: Identify At-Risk Shared Data

Thought: foregroundPID is used in the main code and signal handler.  Maybe there's a race condition because of that.

☑ Identify shared data that may be modified concurrently.  What global variables are used in both the main code and signal handlers?

☐ Document and confirm an ordering of events that causes unexpected behavior.  What assumptions are made in the code that can be broken by certain orderings?

☐ Use concurrency directives to force expected orderings.  How can we use signal blocking and atomic operations to force the correct ordering(s)?

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    while (foregroundPID == pid) {;}
}

static void executeCommand(char *command, bool inBackground) {
    // ...(omitted for brevity)...
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitForForegroundCommand(pidOrZero);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
        if (result == foregroundPID) foregroundPID = 0;
    }
}

Slide 26: Step 2: Identify Operation Ordering

waitForForegroundCommand waits for the handler to change foregroundPID to 0.  It assumes this ordering:

1. it will set foregroundPID to the pid of interest
2. the handler will execute
3. meanwhile, waitForForegroundCommand waits for foregroundPID to be 0.

How can races break this

assumption?

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    while (foregroundPID == pid) {;}
}

static void executeCommand(char *command, bool inBackground) {
    // ...(omitted for brevity)...
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitForForegroundCommand(pidOrZero);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
        if (result == foregroundPID) foregroundPID = 0;
    }
}

Slide 27: Step 2: Identify Operation Ordering

1. spawn child process
2. execute line 14 (function call)
3. child finishes, SIGCHLD received
4. reapProcess completes, not modifying foregroundPID.
5. main code resumes, calling waitForForegroundCommand
6. line 5 executed
7. enter loop on line 6
8. loop never terminates because foregroundPID will never again change!

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    while (foregroundPID == pid) {;}
}

static void executeCommand(char *command, bool inBackground) {
    // ...(omitted for brevity)...
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitForForegroundCommand(pidOrZero);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
        if (result == foregroundPID) foregroundPID = 0;
    }
}

Slide 28: Step 2: Identify Operation Ordering

waitForForegroundCommand waits for the handler to change foregroundPID to 0.  It assumes this ordering:

1. it will set foregroundPID to the pid of interest
2. the handler will execute
3. meanwhile, waitForForegroundCommand waits for foregroundPID to be 0.

Problem: steps 1 & 2 could be flipped, causing deadlock.

Slide 29: Deadlock

Deadlock is a program state in which no progress can be made - it is caused by code waiting for something that will never happen.

E.g. waitForForegroundProcess loops until foregroundPID is set to 0.  But it never will be set to 0 in this case!

☑ Identify shared data that may be modified concurrently.  What global variables are used in both the main code and signal handlers?

☑ Document and confirm an ordering of events that causes unexpected behavior.  What assumptions are made in the code that can be broken by certain orderings?

☐ Use concurrency directives to force expected orderings.  How can we use signal blocking and atomic operations to force the correct ordering(s)?

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    while (foregroundPID == pid) {;}
}

static void executeCommand(char *command, bool inBackground) {
    // ...(omitted for brevity)...
    if (inBackground) {
        printf("%d %s\n", pidOrZero, command);
    } else {
        waitForForegroundCommand(pidOrZero);
    }
}

static void reapProcesses(int signum) {
    while (true) {
        pid_t result = waitpid(-1, NULL, WNOHANG);
        if (result <= 0) break;
        if (result == foregroundPID) foregroundPID = 0;
    }
}

Slide 30: Step 3: Force Expected Orderings

We want to force this ordering:

1. it will set foregroundPID to the pid of interest
2. the handler will execute
3. meanwhile, waitForForegroundCommand waits for foregroundPID to be 0.

How can we force the handler to only execute after step 1? 

☑ Identify shared data that may be modified concurrently.  What global variables are used in both the main code and signal handlers?

☑ Document and confirm an ordering of events that causes unexpected behavior.  What assumptions are made in the code that can be broken by certain orderings?

☑ Use concurrency directives to force expected orderings.  How can we use signal blocking and atomic operations to force the correct ordering(s)?

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    setSIGCHLDBlock(false);
    while (foregroundPID == pid) {;}
}

// ...omitted for brevity...

Slide 31: Waiting For SIGCHLD

• The while (fgpid == pid) {;}  is not good. This allows the shell to spin on the CPU even when it can't do any meaningful work.
• Goal: we want to yield the CPU until we receive a SIGCHLD signal.

Slide 32: Plan For Today

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

Slide 33: Announcements

• New debugging tips and resources posted for assign3
• In case you're curious: when using ptrace, waitpid on tracee automatically includes WUNTRACED (to listen for stops)

Slide 34: Mid-Lecture Checkin:

We can now answer the following questions:

• What is a race condition?
• How can signals cause race conditions?
• How can we block signals to prevent race conditions?
• Why shouldn't we just block signals by default and unblock when needed?

Slide 35: Plan For Today

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

// The currently-running foreground command PID
static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    setSIGCHLDBlock(false);
    while (foregroundPID == pid) {
    	pause();
    }
}

// ...omitted for brevity...

Slide 36: Waiting For SIGCHLD

• The while (fgpid == pid) {;}  is not good. This allows the shell to spin on the CPU even when it can't do any meaningful work.
• Goal: we want to yield the CPU until we receive a SIGCHLD signal.
• Idea: let's pause (like sleep, but until signaled)

☐ Identify shared data that may be modified concurrently.  What global variables are used in both the main code and signal handlers?

☐ Document and confirm an ordering of events that causes unexpected behavior.  What assumptions are made in the code that can be broken by certain orderings?

☐ Use concurrency directives to force expected orderings.  How can we use signal blocking and atomic operations to force the correct ordering(s)?

static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    setSIGCHLDBlock(false);
    while (foregroundPID == pid) {
    	pause();
    }
}

☑ Identify shared data that may be modified concurrently.  What global variables are used in both the main code and signal handlers?   Whether we've received SIGCHLD.

☐ Document and confirm an ordering of events that causes unexpected behavior.  What assumptions are made in the code that can be broken by certain orderings?

☐ Use concurrency directives to force expected orderings.  How can we use signal blocking and atomic operations to force the correct ordering(s)?

static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    setSIGCHLDBlock(false);
    while (foregroundPID == pid) {
    	pause();
    }
}

waitForForegroundCommand waits for SIGCHLD and then checks the global state.  It assumes this ordering:

1. it will set foregroundPID to the pid of interest
2. it will allow SIGCHLD signals
3. it will loop until a SIGCHLD is received
4. a SIGCHLD signal will come in that causes the loop to break

Problem: steps 3 & 4 could be flipped, causing deadlock (pause never returns)

static pid_t foregroundPID = 0;

static void waitForForegroundCommand(pid_t pid) {
    foregroundPID = pid;
    setSIGCHLDBlock(false);
    while (foregroundPID == pid) {
    	pause();
    }
}

sigsuspend, atomically both adjusts the blocked signal set and goes to sleep until a signal is received.  When some unblocked signal arrives, the process gets the CPU, the signal is handled, the original blocked set is restored, and sigsuspend returns.
 

• This function takes the process off the CPU until a signal is sent that is NOT in the specified mask.
• This is the model solution to our problem, and one you should emulate in your Assignment 3 farm    and your Assignment 4 stsh.

// simplesh-all-better.c                                                                                                                                                           
static void waitForForegroundProcess(pid_t pid) {
  fgpid = pid;
  sigset_t empty;
  sigemptyset(&empty);
  while (fgpid == pid) {
    sigsuspend(&empty);
  }
  updateSIGCHLDBlock(false);
}

Slide 37: Waiting For Signals

static void waitForForegroundProcess(pid_t pid) {
  fgpid = pid;
  sigset_t empty;
  sigemptyset(&empty);
  while (fgpid == pid) {
    /* sigsuspend does (in one atomic operation)
     * 1) update blocked set to this mask
     * 2) go to sleep until signal
     * 3) when woken up, restore original mask
     */
    sigsuspend(&empty);
  }
  updateSIGCHLDBlock(false);
}

Slide 38: Waiting For Signals

Slide 39: Plan For Today

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

Consider this program and its execution. Assume that all processes run to completion, all system and printf calls succeed, and that all calls to printf are atomic. Assume nothing about scheduling or time slice durations.

static void bat(int unused) { 
  printf("pirate\n"); 
  exit(0);
}

int main(int argc, char *argv[]) {
  signal(SIGUSR1, bat);
  pid_t pid = fork();
  if (pid == 0) { 
    printf("ghost\n"); 
    return 0;
  }
  kill(pid, SIGUSR1); 
  printf("ninja\n"); return 0;
}

• For each of the five output orders, Place a yes if the text represents a possible output, and place a no otherwise.
  • ghost ninja pirate
  • pirate ninja
  • ninja ghost
  • ninja pirate ninja
  • ninja pirate ghost

Slide 40: Practice Problem 1

Consider this program and its execution. Assume that all processes run to completion, all system and printf calls succeed, and that all calls to printf are atomic. Assume nothing about scheduling or time slice durations.

static void bat(int unused) { 
  printf("pirate\n"); 
  exit(0);
}

int main(int argc, char *argv[]) {
  signal(SIGUSR1, bat);
  pid_t pid = fork();
  if (pid == 0) { 
    printf("ghost\n"); 
    return 0;
  }
  kill(pid, SIGUSR1); 
  printf("ninja\n"); return 0;
}

• For each of the five output orders, Place a yes if the text represents a possible output, and place a no otherwise.
  • ghost ninja pirate.  yes
  • pirate ninja.    yes
  • ninja ghost.   no
  • ninja pirate ninja.    no
  • ninja pirate ghost.   no

Slide 41: Practice Problem 1

Consider this program and its execution. Assume that all processes run to completion, all system and printf calls succeed, and that all calls to printf are atomic. Assume nothing about scheduling or time slice durations.

int main(int argc, char *argv[]) {
    pid_t pid;
    int counter = 0;
    while (counter < 2) {
        pid = fork();
        if (pid > 0) break;
        counter++;
        printf("%d", counter);
    }
    if (counter > 0) printf("%d", counter);
    if (pid > 0) {
        waitpid(pid, NULL, 0);
        counter += 5;
        printf("%d", counter);
    }
    return 0;
}

• List all possible outputs

Slide 42: Practice Problem 2

• Consider this program and its execution. Assume that all processes run to completion, all system and printf calls succeed, and that all calls to printf are atomic. Assume nothing about scheduling or time slice durations.

Slide 43: Example midterm question #2

int main(int argc, char *argv[]) {
    pid_t pid;
    int counter = 0;
    while (counter < 2) {
        pid = fork();
        if (pid > 0) break;
        counter++;
        printf("%d", counter);
    }
    if (counter > 0) printf("%d", counter);
    if (pid > 0) {
        waitpid(pid, NULL, 0);
        counter += 5;
        printf("%d", counter);
    }
    return 0;
}

• List all possible outputs

• Possible Output 1: 112265 Possible Output 2: 121265 Possible Output 3: 122165

• The grandparent that starts with counter 0 exits last, because it waits on its child; the last output is 5
• The parent that starts with counter 1 exits second to last, after waiting for its child; the second-to-last output is 6
• The parent that starts with counter 1 outputs first
• The second parent (1) output and the two child (2)
  outputs are up to the scheduler

• Let's go through another example that is the kind of signals problem you may see on the midterm exam.
  • Consider this program and its execution. Assume that all processes run to completion, all system and printf calls succeed, and that all calls to printf are atomic. Assume nothing about scheduling or time slice durations.

int main(int argc, char *argv[]) {
    pid_t pid;
    int counter = 0;
    while (counter < 2) {
        pid = fork();
        if (pid > 0) break;
        counter++;
        printf("%d", counter);
    }
    if (counter > 0) printf("%d", counter);
    if (pid > 0) {
        waitpid(pid, NULL, 0);
        counter += 5;
        printf("%d", counter);
    }
    return 0;
}

• List all possible outputs

• Possible Output 1: 112265 Possible Output 2: 121265 Possible Output 3: 122165

• If the > of the counter > 0 test is changed to a >=, then counter values of zeroes would be included in each possible output. How many different outputs are now possible? (No need to list the outputs—just present the number.)

Slide 44: Practice Midterm Problem 2

• Let's go through another example that is the kind of signals problem you may see on the midterm exam.
  • Consider this program and its execution. Assume that all processes run to completion, all system and printf calls succeed, and that all calls to printf are atomic. Assume nothing about scheduling or time slice durations.

int main(int argc, char *argv[]) {
    pid_t pid;
    int counter = 0;
    while (counter < 2) {
        pid = fork();
        if (pid > 0) break;
        counter++;
        printf("%d", counter);
    }
    if (counter > 0) printf("%d", counter);
    if (pid > 0) {
        waitpid(pid, NULL, 0);
        counter += 5;
        printf("%d", counter);
    }
    return 0;
}

• List all possible outputs

• Possible Output 1: 112265 Possible Output 2: 121265 Possible Output 3: 122165

• If the > of the counter > 0 test is changed to a >=, then counter values of zeroes would be included in each possible output. How many different outputs are now possible? (No need to list the outputs—just present the number.)

• 18 outputs now (6 x the first number)

Slide 45: Practice Midterm Problem 2

• Consider the following program. Assume that each call to printf flushes its output to the console in full, and further assume that none of the system calls fail in any unpredictable way (e.g. fork never fails, and waitpid only returns -1 because there aren’t any child processes at the moment it decides on its return value).

static pid_t pid; // necessarily global so handler1 has
                  // access to it 
static int counter = 0;
static void handler1(int unused) { 
	counter++;
	printf("counter = %d\n", counter); 
	kill(pid, SIGUSR1);
}
static void handler2(int unused) { 
	counter += 10;
	printf("counter = %d\n", counter); 
	exit(0);
}
int main(int argc, char *argv[]) { 
	signal(SIGUSR1, handler1);
	if ((pid = fork()) == 0) {
		signal(SIGUSR1, handler2); 
		kill(getppid(), SIGUSR1); 
		while (true) {}
	}
	if (waitpid(-1, NULL, 0) > 0) { 
		counter += 1000;
		printf("counter = %d\n", counter);
	}
	return 0; 
}

Slide 46: Practice Midterm Problem 3

• What is the output of the program?
• What are the two potential outputs of the above program if the while (true) loop is completely eliminated?
• Describe how the two processes would need to be scheduled in order for each of the two outputs to be presented.

• Now further assume the call to exit(0) has also been removed from the handler2 function . Are there any other potential program outputs? If not, explain why. If so, what are they?

• Consider the following program. Assume that each call to printf flushes its output to the console in full, and further assume that none of the system calls fail in any unpredictable way (e.g. fork never fails, and waitpid only returns -1 because there aren’t any child processes at the moment it decides on its return value).

Slide 47: Practice Midterm Problem 3

• What is the output of the program?

    counter = 1
    counter = 10
    counter = 1001

• This is the only possible output based on the program's logic

static pid_t pid; // necessarily global so handler1 has
                  // access to it 
static int counter = 0;
static void handler1(int unused) { 
	counter++;
	printf("counter = %d\n", counter); 
	kill(pid, SIGUSR1);
}
static void handler2(int unused) { 
	counter += 10;
	printf("counter = %d\n", counter); 
	exit(0);
}
int main(int argc, char *argv[]) { 
	signal(SIGUSR1, handler1);
	if ((pid = fork()) == 0) {
		signal(SIGUSR1, handler2); 
		kill(getppid(), SIGUSR1); 
		while (true) {}
	}
	if (waitpid(-1, NULL, 0) > 0) { 
		counter += 1000;
		printf("counter = %d\n", counter);
	}
	return 0; 
}

• Consider the following program. Assume that each call to printf flushes its output to the console in full, and further assume that none of the system calls fail in any unpredictable way (e.g. fork never fails, and waitpid only returns -1 because there aren’t any child processes at the moment it decides on its return value).

static pid_t pid; // necessarily global so handler1 has
                  // access to it 
static int counter = 0;
static void handler1(int unused) { 
	counter++;
	printf("counter = %d\n", counter); 
	kill(pid, SIGUSR1);
}
static void handler2(int unused) { 
	counter += 10;
	printf("counter = %d\n", counter); 
	exit(0);
}
int main(int argc, char *argv[]) { 
	signal(SIGUSR1, handler1);
	if ((pid = fork()) == 0) {
		signal(SIGUSR1, handler2); 
		kill(getppid(), SIGUSR1); 
		while (true) {}
	}
	if (waitpid(-1, NULL, 0) > 0) { 
		counter += 1000;
		printf("counter = %d\n", counter);
	}
	return 0; 
}

Slide 48: Practice Midterm Problem 3

• What are the two potential outputs of the above program if the while (true) loop is completely eliminated?
  • The output from before (the 1 / 10 / 1001) output is still possible, because the child process can be swapped out just after the kill(getppid(), SIGUSR1) call, and effectively emulate the stall that came with the while (true) loop when it was present.
  • Now, though, the child process could complete and exit normally before the parent process—via its handler1 function— has the opportunity to signal the child. That would mean handler2 wouldn’t even execute, and we wouldn’t expect to see counter = 10. (Note that the child process’s call to waitpid returns -1, since it itself has no grandchild processes of its own).

• So, another possible output would be:

  counter = 1
  counter = 1001
  

• Consider the following program. Assume that each call to printf flushes its output to the console in full, and further assume that none of the system calls fail in any unpredictable way (e.g. fork never fails, and waitpid only returns -1 because there aren’t any child processes at the moment it decides on its return value).

Slide 49: Practice Midterm Problem 3

• Now further assume the call to exit(0) has also been removed from the handler2 function . Are there any other potential program outputs? If not, explain why. If so, what are they?
• ​No other potential outputs, because:
  • ​counter = 1 is still printed exactly once, just in the parent, before the parent fires a SIGUSR1 signal at the child (which may or may not have run to completion).
  • counter = 10 is potentially printed if the child is still running at the time the parent fires that SIGUSR1 signal at it. The 10 can only appear after the 1, and if it appears, it must appear before the 1001. 
  • counter = 1001 is always printed last, after the child process exits. It’s possible that the child existed at the time the parent signaled it to inspire handler2 to print a 10, but that would happen before the 1001 is printed.

     

• Note that the child process either prints nothing at all, or it prints a 10. The child process can never print 1001, because its waitpid call would return -1 and circumvent the code capable of printing the 1001.

static pid_t pid; // necessarily global so handler1 has
                  // access to it 
static int counter = 0;
static void handler1(int unused) { 
	counter++;
	printf("counter = %d\n", counter); 
	kill(pid, SIGUSR1);
}
static void handler2(int unused) { 
	counter += 10;
	printf("counter = %d\n", counter); 
	exit(0);
}
int main(int argc, char *argv[]) { 
	signal(SIGUSR1, handler1);
	if ((pid = fork()) == 0) {
		signal(SIGUSR1, handler2); 
		kill(getppid(), SIGUSR1); 
		while (true) {}
	}
	if (waitpid(-1, NULL, 0) > 0) { 
		counter += 1000;
		printf("counter = %d\n", counter);
	}
	return 0; 
}

• Concurrency is powerful: it lets our code do many things at the same time
  • It can run faster (more cores!)
  • It can do more (run many programs in background)
  • It can respond faster (don't have to wait for current action to complete)
• Signals are a way for concurrent processes to interact
  • Send signals with kill and raise
  • Handle signals with signal
  • Control signal delivery with sigprocmask, sigsuspend
  • Preempt running code
  • Making sure code running in a signal handler works correctly is difficult
  • Race conditions occur when code can see data in an intermediate and invalid state (often KABOOM)
• Assignments 3 and 4 use signals, as a way to start easing into concurrency before we tackle multithreading
• Take CS149 if you want to learn how to write high concurrency code that runs 100x faster

Slide 50: Overview: Signals and Concurrency

Slide 51: Recap

• Recap: Signals
• Race Conditions and Atomicity
• Demo: Shell
• Break: Announcements
• Revisiting sigsuspend
• More Practice: Race Conditions

Next Time: Introduction to Threads