Lines Matching full:children
256 * must be considered out-of-date since at least one of its children
291 * it has no children, was on the lhs of an operator and doesn't in GNode_IsOODate()
311 * always out of date if no children and :: target in GNode_IsOODate()
320 * out-of-date if any of its children was out-of-date. in GNode_IsOODate()
367 * have their mtime stay below their children's mtime to keep parents in GNode_IsOODate()
384 for (ln = pgn->children.first; ln != NULL; ln = ln->next) { in PretendAllChildrenAreMade()
397 * flags and children to the parent node.
411 GNodeListNode *ln; /* An element in the children list */ in Make_HandleUse()
433 for (ln = cgn->children.first; ln != NULL; ln = ln->next) { in Make_HandleUse()
455 Lst_Append(&pgn->children, gn); in Make_HandleUse()
466 * called before the children are enqueued to be looked at by MakeAddChild.
468 * For a .USE child, the commands, type flags and children are copied to the
492 * unmade children in the parent... We also remove the child in MakeHandleUse()
494 * children the parent has. This is used by Make_Run to decide in MakeHandleUse()
495 * whether to queue the parent or examine its children... in MakeHandleUse()
497 Lst_Remove(&pgn->children, ln); in MakeHandleUse()
505 for (ln = gn->children.first; ln != NULL; ln = nln) { in HandleUseNodes()
544 * depend on FRC to be made, so we have to check for gn->children in Make_Recheck()
547 if (!Lst_IsEmpty(gn->commands) || Lst_IsEmpty(gn->children)) in Make_Recheck()
736 * children - and so we mustn't do any processing here when in Make_Update()
780 DEBUG0(MAKE, "- unmade children\n"); in Make_Update()
815 for (ln = gn->children.first; ln != NULL; ln = ln->next) { in UnmarkChildren()
824 * attributes. .EXEC and .USE children are very rarely going to be files,
883 * XXX: This will cause all made children to go in in MakeAddAllSrc()
916 for (ln = gn->children.first; ln != NULL; ln = ln->next) in GNode_SetLocalVars()
992 * If this node is a .WAIT node with unmade children in MakeBuildChild()
1004 for (ln = gn->children.first; ln != NULL; ln = ln->next) in MakeChildren()
1057 * We can't build this yet, add all unmade children in MakeStartJobs()
1183 DEBUG3(MAKE, "MakePrintStatus: %s%s has %d unmade children\n", in MakePrintStatus()
1186 * If printing cycles and came to one that has unmade children, in MakePrintStatus()
1187 * print out the cycle by recursing on its children. in MakePrintStatus()
1190 /* First time we've seen this node, check all children */ in MakePrintStatus()
1192 MakePrintStatusList(&gn->children, errors); in MakePrintStatus()
1205 /* Reporting for our children will give the rest of the loop */ in MakePrintStatus()
1206 MakePrintStatusList(&gn->children, errors); in MakePrintStatus()
1256 * children for it if it has none and also has no commands. If the in Make_ExpandUse()
1258 * at in a minute, otherwise we add its children to our queue and in Make_ExpandUse()
1307 "%s%s still has %d unmade children\n", in Make_ExpandUse()
1313 ExamineLater(&examine, &gn->children); in Make_ExpandUse()
1319 /* Make the .WAIT node depend on the previous children */
1333 Lst_Append(&wn->children, cn); in add_wait_dependency()
1364 Lst_Append(&pgn->children, cgn); in Make_ProcessWait()
1390 owln = pgn->children.first; in Make_ProcessWait()
1391 for (ln = pgn->children.first; ln != NULL; ln = ln->next) { in Make_ProcessWait()
1463 * children run as much as possible. Because the job table is kept in Make_Run()