Lines Matching refs:job
0 /* Job execution and handling for GNU Make.
23 #include "job.h"
831 /* If the job failed, and the -k flag was not given, die,
856 job, put a token back into the pipe for it. */
863 /* Write a job token back to the pipe. */
965 /* Start a job to run the commands specified in CHILD.
1190 /* start_waiting_job has set CHILD->remote if we can start a remote job. */
1198 so, simply run the job locally. */
1306 /* We call `system' to do the job of the SHELL, since stock DOS
1431 /* If we can start a job remotely, we always want to, and don't care about
1432 the local load average. We record that the job should be started
1437 /* If we are running at least one job already and the load average
1465 /* One more job slot is in use. */
1626 /* Wait for a job slot to be freed up. If we allow an infinite number
1637 /* This can be inefficient. There's a decent chance that this job won't
1642 token (since start_job_command is called for each line of the job, not
1644 this is where the old parallel job code waits, so... */
1653 DB (DB_JOBS, ("Need a job token; we %shave children\n",
1656 /* If we don't already have a job started, use our "free" token. */
1685 DB (DB_JOBS, ("Duplicate the job FD\n"));
1706 /* Set interruptible system calls, and read() for a job token. */
1732 /* The job is now primed. Start it running.
1737 /* Since there is only one job slot, make things run linearly.
1768 /* Determine if the load average on the system is too high to start a new job.
1783 ! - every job started increases jobctr;
1784 ! - every dying job decreases a positive jobctr;
1877 struct child *job;
1887 /* Take a job off the waiting list. */
1888 job = waiting_jobs;
1889 waiting_jobs = job->next;
1891 /* Try to start that job. We break out of the loop as soon
1894 while (start_waiting_job (job) && waiting_jobs != 0);
