Lines Matching refs:children
259 * must be considered out-of-date since at least one of its children
294 * it has no children, was on the lhs of an operator and doesn't
314 * always out of date if no children and :: target
323 * out-of-date if any of its children was out-of-date.
370 * have their mtime stay below their children's mtime to keep parents
387 for (ln = pgn->children.first; ln != NULL; ln = ln->next) {
400 * type flags and children to the parent node.
414 GNodeListNode *ln; /* An element in the children list */
436 for (ln = cgn->children.first; ln != NULL; ln = ln->next) {
458 Lst_Append(&pgn->children, gn);
469 * be called before the children are enqueued to be looked at by MakeAddChild.
471 * For a .USE child, the commands, type flags and children are copied to the
493 Lst_Remove(&pgn->children, ln);
501 for (ln = gn->children.first; ln != NULL; ln = nln) {
540 * depend on FRC to be made, so we have to check for gn->children
543 if (!Lst_IsEmpty(gn->commands) || Lst_IsEmpty(gn->children))
732 * children - and so we mustn't do any processing here when
776 DEBUG0(MAKE, "- unmade children\n");
811 for (ln = gn->children.first; ln != NULL; ln = ln->next) {
820 * attributes. .EXEC and .USE children are very rarely going to be files,
879 * XXX: This will cause all made children to go in
912 for (ln = gn->children.first; ln != NULL; ln = ln->next)
988 * If this node is a .WAIT node with unmade children
1000 for (ln = gn->children.first; ln != NULL; ln = ln->next)
1172 DEBUG3(MAKE, "MakePrintStatus: %s%s has %d unmade children\n",
1175 * If printing cycles and came to one that has unmade children,
1176 * print out the cycle by recursing on its children.
1179 /* First time we've seen this node, check all children */
1181 MakePrintStatusList(&gn->children, errors);
1194 /* Reporting for our children will give the rest of the loop */
1195 MakePrintStatusList(&gn->children, errors);
1240 * children for it if it has none and also has no commands. If the
1242 * at in a minute, otherwise we add its children to our queue and
1291 "%s%s still has %d unmade children\n",
1297 ExamineLater(&examine, &gn->children);
1303 /* Make the .WAIT node depend on the previous children */
1313 Lst_Append(&waitNode->children, gn);
1343 Lst_Append(&pgn->children, cgn);
1369 waitNode = pgn->children.first;
1370 for (ln = pgn->children.first; ln != NULL; ln = ln->next) {