proc.h revision 1.7 1 /* $NetBSD: proc.h,v 1.7 1995/04/29 23:21:35 mycroft Exp $ */
2
3 /*-
4 * Copyright (c) 1980, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 *
35 * @(#)proc.h 8.1 (Berkeley) 5/31/93
36 */
37
38 /*
39 * Structure for each process the shell knows about:
40 * allocated and filled by pcreate.
41 * flushed by pflush; freeing always happens at top level
42 * so the interrupt level has less to worry about.
43 * processes are related to "friends" when in a pipeline;
44 * p_friends links makes a circular list of such jobs
45 */
46 struct process {
47 struct process *p_next; /* next in global "proclist" */
48 struct process *p_friends; /* next in job list (or self) */
49 struct directory *p_cwd; /* cwd of the job (only in head) */
50 short unsigned p_flags; /* various job status flags */
51 char p_reason; /* reason for entering this state */
52 int p_index; /* shorthand job index */
53 pid_t p_pid;
54 pid_t p_jobid; /* pid of job leader */
55 /* if a job is stopped/background p_jobid gives its pgrp */
56 struct timeval p_btime; /* begin time */
57 struct timeval p_etime; /* end time */
58 struct rusage p_rusage;
59 Char *p_command; /* first PMAXLEN chars of command */
60 };
61
62 /* flag values for p_flags */
63 #define PRUNNING (1<<0) /* running */
64 #define PSTOPPED (1<<1) /* stopped */
65 #define PNEXITED (1<<2) /* normally exited */
66 #define PAEXITED (1<<3) /* abnormally exited */
67 #define PSIGNALED (1<<4) /* terminated by a signal != SIGINT */
68
69 #define PALLSTATES (PRUNNING|PSTOPPED|PNEXITED|PAEXITED|PSIGNALED|PINTERRUPTED)
70 #define PNOTIFY (1<<5) /* notify async when done */
71 #define PTIME (1<<6) /* job times should be printed */
72 #define PAWAITED (1<<7) /* top level is waiting for it */
73 #define PFOREGND (1<<8) /* started in shells pgrp */
74 #define PDUMPED (1<<9) /* process dumped core */
75 #define PERR (1<<10) /* diagnostic output also piped out */
76 #define PPOU (1<<11) /* piped output */
77 #define PREPORTED (1<<12) /* status has been reported */
78 #define PINTERRUPTED (1<<13) /* job stopped via interrupt signal */
79 #define PPTIME (1<<14) /* time individual process */
80 #define PNEEDNOTE (1<<15) /* notify as soon as practical */
81
82 #define PMAXLEN 80
83
84 /* defines for arguments to pprint */
85 #define NUMBER 01
86 #define NAME 02
87 #define REASON 04
88 #define AMPERSAND 010
89 #define FANCY 020
90 #define SHELLDIR 040 /* print shell's dir if not the same */
91 #define JOBDIR 0100 /* print job's dir if not the same */
92 #define AREASON 0200
93
94 struct process proclist; /* list head of all processes */
95 bool pnoprocesses; /* pchild found nothing to wait for */
96
97 struct process *pholdjob; /* one level stack of current jobs */
98
99 struct process *pcurrjob; /* current job */
100 struct process *pcurrent; /* current job in table */
101 struct process *pprevious; /* previous job in table */
102
103 int pmaxindex; /* current maximum job index */
104