Lines Matching defs:Job
117 /* Job.flags values */
131 typedef struct job Job;
133 Job *next; /* next job in list */
175 static Job *job_list; /* job list */
176 static Job *last_job;
177 static Job *async_job;
212 static void j_set_async ARGS((Job *j));
213 static void j_startjob ARGS((Job *j));
214 static int j_waitj ARGS((Job *j, int flags, const char *where));
216 static void j_print ARGS((Job *j, int how, struct shf *shf));
217 static Job *j_lookup ARGS((const char *cp, int *ecodep));
218 static Job *new_job ARGS((void));
220 static void check_job ARGS((Job *j));
221 static void put_job ARGS((Job *j, int where));
222 static void remove_job ARGS((Job *j, const char *where));
223 static int kill_job ARGS((Job *j, int sig));
280 Job *j;
283 for (j = job_list; j != (Job *) 0; j = j->next) {
439 Job *j;
696 Job *j;
725 Job *j;
777 Job *j;
784 if ((j = j_lookup(cp, &ecode)) == (Job *) 0) {
818 Job *j;
827 if ((j = j_lookup(cp, &ecode)) == (Job *) 0) {
882 async_job = (Job *) 0;
924 Job *j;
927 for (j = job_list; j != (Job *) 0; j = j->next) {
954 Job *j, *tmp;
968 if ((j = j_lookup(cp, &ecode)) == (Job *) 0) {
1001 Job *j, *tmp;
1047 Job *j;
1049 Job *jl, *oldest;
1060 oldest = (Job *) 0;
1083 Job *j;
1112 Job *j;
1249 Job *j;
1276 for (j = job_list; j != (Job *) 0; j = j->next)
1281 if (j == (Job *) 0) {
1323 Job *j;
1432 Job *j;
1541 static Job *
1546 Job *j, *last_match;
1553 for (j = job_list; j != (Job *) 0; j = j->next)
1559 for (j = job_list; j != (Job *) 0; j = j->next)
1564 return (Job *) 0;
1569 return (Job *) 0;
1575 if (job_list != (Job *) 0)
1580 if (job_list != (Job *) 0 && job_list->next)
1587 for (j = job_list; j != (Job *) 0; j = j->next)
1593 last_match = (Job *) 0;
1594 for (j = job_list; j != (Job *) 0; j = j->next)
1600 return (Job *) 0;
1610 last_match = (Job *) 0;
1611 for (j = job_list; j != (Job *) 0; j = j->next)
1616 return (Job *) 0;
1626 return (Job *) 0;
1629 static Job *free_jobs;
1636 static Job *
1640 Job *newj, *j;
1642 if (free_jobs != (Job *) 0) {
1646 newj = (Job *) alloc(sizeof(Job), APERM);
1652 if (j == (Job *) 0)
1685 Job *j;
1689 Job **prev, *curr;
1693 for (; curr != (Job *) 0 && curr != j; prev = &curr->next, curr = *prev)
1715 last_job = (Job *) 0;
1717 async_job = (Job *) 0;
1727 Job *j;
1730 Job **prev, *curr;
1764 Job *j;