Computer Systems: A Programmer's Perspective (3rd Edition)
Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
Question
Book Icon
Chapter 8.5, Problem 8.8PP
Program Plan Intro

Given code:

//Include necessary header files

#include <stdio.h>

#include <stdlib.h>

#include <unistd.h>

#include <wait.h>

#include <signal.h>

#include "csapp.h"

//Initialize the global counter variable as 2

volatile long counter = 2;

//Define a function named handler1()

void handler1(int sig)

{

    //Variable declaration

    sigset_t mask, prev_mask;

    //Call the function sigfillset()

    sigfillset(&mask);

    //Call the function sigprocmask() and block sigs

    sigprocmask(SIG_BLOCK, &mask, &prev_mask);

    //Call the function sio_putl()

    sio_putl(--counter);

    //Call the function sigprocmask() and restore sigs

    sigprocmask(SIG_SETMASK, &prev_mask, NULL);

    //Exit

   _exit(0);

}

//Define a function named main()

int main()

{

    //Variable declaration

    pid_t pid;

    sigset_t mask, prev_mask;

    //Print the counter value

    printf("%ld ", counter);

    //Flush the output buffer using fflush()

    fflush(stdout);

    //Call the function signal()

    signal(SIGUSR1, handler1);

    //Check the condition

    if ((pid = Fork()) == 0)

    {

        //True, execute the statement

        while(1) {};

    }

    //Call the function kill()

    Kill(pid, SIGUSR1);

    //Call the function waitpid()

    Waitpid(-1, NULL, 0);

    //Call the function Sigfillset()

    Sigfillset(&mask);

    //Call the function sigprocmask() and block sigs

    Sigprocmask(SIG_BLOCK, &mask, &prev_mask);

    //Print the counter value

    printf("%ld", ++counter);

    //Call the function sigprocmask() and restore sigs

    Sigprocmask(SIG_SETMASK, &prev_mask, NULL);

    //Exit

    exit(0);

}

Blurred answer
Students have asked these similar questions
Problem 2 (5 pts) Write a Python program that plays the game Ro-Sham-Bo (a.k.a., Rock, Paper, Scissors) for a player and a computer opponent. The player selects one of the options listed in a console prompt, then the computer randomly selects an option as well. The winner of the game is determined as follows: Rock beats Scissors - Scissors beats Paper - Paper beats Rock The same selection results in a tie. Your program must do the following: Prompt the player to enter a selection in the console. Provide instructions to user on what is a valid input. For example, you can have the integers 1, 2, and 3 represent the selection, or use the words rock, paper, scissors, etc. Check that the user entered valid input. If the entry is invalid, the program needs to inform the user of the invalid input and can end, or re-prompt the user for their entry. Generate a random selection for the computer's choice. You can use a random integer and follow the same rules as was stated to the user. - Display…
(QUESTION) Using the required programming language (python, matlab, etc.) plot the variation of pressure on the piston surface as a function of time until the piston moves 9 m, with the help of the following commands below. This problem will be solved for U_p =1, 4, 16, 64, 256 m/s. We'll assume that the time starts at t = 0 when the piston starts moving. (PLEASE TAKE A SCREENSHOT OF THE PLOTTING AND OTHER RESULTS.) Note: Since we don't have the exact time intervals or the rate at which the piston moves, we'll assume a constant speed and divide the distance by the speed to get the time taken.   (QUESTION) COMMANDS import matplotlib.pyplot as plt import numpy as np # Given parameters diameter = 0.1 # meters length = 10 # meters initial_pressure = 10e3 # Pascals initial_temperature = 288 # Kelvin # Convert diameter to radius radius = diameter / 2 # Calculate initial and final volumes initial_volume = np.pi * radius**2 * length final_volume = np.pi * radius**2 * (length - 9) # Calculate…
1. (Shortest Path) Please find the shortest path between the blue triangle and red tri- angle as Figure 1. Please explain your approach and develop the computationally efficient algorithm to get the results. Can you obtain (or estimate) the time com- plexity and memory complexity of your algorithm? 麗
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education