Lines Matching refs:children
206 /* Chain of all live (or recently deceased) children. */
208 struct child *children = 0;
210 /* Number of children currently running. */
218 /* Chain of children waiting to run until the load average goes down. */
413 the dead children. In this case we don't need the dead_children count.
416 use the dead_children count to reap children as best we can. */
437 DB (DB_JOBS, (_("Got a SIGCHLD; %u unreaped children.\n"), dead_children));
443 /* Reap all dead children, storing the returned status and the new command
469 We're blocking for a complete child OR there are more children to reap
471 we'll keep reaping children. */
473 while ((children != 0 || shell_function_pid != 0)
518 for (c = children; c != 0; c = c->next)
530 /* First, check for remote children. */
547 /* No remote children. Check for local children. */
584 /* No local children are dead. */
595 /* No remote children either. Finally give up. */
692 for (c = children; c != 0; lastc = c, c = c->next)
779 Loop to reap more children. */
811 children and job_slots_used are always consistent. Otherwise
823 children = c->next;
1097 reaping children from a different target. We want this increment to
1151 This will be used for some children's standard inputs. */
1446 /* Put this child on the chain of children waiting for the load average
1460 c->next = children;
1464 children = c;
1502 /* Reap any children that might have finished recently. */
1653 DB (DB_JOBS, ("Need a job token; we %shave children\n",
1654 children ? "" : "don't "));
1670 reap_children() does its last check for dead children and the time
1703 if (!children)
1704 fatal (NILF, "INTERNAL: no children as we go to sleep on read\n");
1820 /* sub_proc.c cannot wait for more than MAXIMUM_WAIT_OBJECTS children */
