Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

I have this code : /****************************/ #include #include #include #include #include #define MAX_LINE 80 int main(void) { char *args[MAX_LINE/2 + 1]; char ss[MAX_LINE]; int should_run

I have this code : /****************************/ #include  #include  #include  #include  #include  #define MAX_LINE 80 int main(void) { char *args[MAX_LINE/2 + 1]; char ss[MAX_LINE]; int should_run = 1; int i = 0; int j; while(should_run) { printf("OSH> "); fflush(stdout); scanf ("%[^ ]%*c", ss); printf("input:%s ",ss); i = 0; int j; args[i] = strtok(ss," "); while (args[i] != NULL) { i++; args[i] = strtok(NULL, " "); } if(strcmp(args[0], "exit") == 0) break; if(strcmp(args[i-1], "&") != 0) { pid_t pid; pid = fork(); if(pid < 0) { fprintf(stderr,"FORK Failed "); return 1; } else if (pid == 0) { execvp(args[0],args); for(int j=0;j 

/*******************************/

How can I do this:

Part I Creating a Child Process The first task is to modify the main() function in Figure 3.36 so that a child process is forked and executes the command specified by the user. This will require parsing what the user has entered into separate tokens and storing the tokens in an array of character strings (args in Figure 3.36). For example, if the user enters the command ps -ael at the osh> prompt, the values stored in the args array are:

args[0] = "ps"

args[1] = "-ael"

args[2] = NULL

This args array will be passed to the execvp() function, which has the following prototype:

execvp(char *command, char *params[]);

Here, command represents the command to be performed and params stores the parameters to this command. For this project, the execvp() function should be invoked as execvp(args[0], args). Be sure to check whether the user included an & to determine whether or not the parent process is to wait for the child to exit.

Part IICreating a History Feature The next task is to modify the shell interface program so that it provides a history feature that allows the user to access the most recently entered commands. The user will be able to access up to 10 commands by using the feature. The commands will be consecutively numbered starting at 1, and the numbering will continue past 10. For example, if the user has entered 35 commands, the 10 most recent commands will be numbered 26 to 35. The user will be able to list the command history by entering the command

history

at the osh> prompt. As an example, assume that the history consists of the commands (from most to least recent):

ps, ls -l, top, cal, who, date

The command history will output:

6 ps

5 ls -l

4 top

3 cal

2 who

1 date

Your program should support two techniques for retrieving commands from the command history:

1. When the user enters !!, the most recent command in the history is executed.

2. When the user enters a single ! followed by an integer N, the Nth command in the history is executed.

Continuing our example from above, if the user enters !!, the ps command will be performed; if the user enters !3, the command cal will be executed. Any command executed in this fashion should be echoed on the users screen. The command should also be placed in the history buffer as the next command. The program should also manage basic error handling. If there are no commands in the history, entering !! should result in a message No commands in history. If there is no command corresponding to the number entered with the single !, the program should output "No such command in history."

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Professional IPhone And IPad Database Application Programming

Authors: Patrick Alessi

1st Edition

0470636173, 978-0470636176

More Books

Students also viewed these Databases questions