contrib/bmake/make.c

201  *	must be considered out-of-date since at least one of its children
240      *	it has no children, was on the lhs of an operator and doesn't exist
265 	 * always out of date if no children and :: target
273 	 * out-of-date if any of its children was out-of-date.
304 	 * youngest child or that has no children (cmgn == NULL) and
345      * have their mtime stay below their children's mtime to keep parents from
403  *	updated; the unmade children count of the parent is decremented.
426  *	type flags and children to the parent node.
448     LstNode	ln; 	/* An element in the children list */
476     if (Lst_Open(cgn->children) == SUCCESS) {
477 	while ((ln = Lst_Next(cgn->children)) != NULL) {
500 	    (void)Lst_AtEnd(pgn->children, gn);
504 	Lst_Close(cgn->children);
514  *	pass to handle .USE nodes. Should be called before the children
517  *	type flags and children to the parent node.
536     LstNode	ln; 	/* An element in the children list */
550      * unmade children in the parent... We also remove the child
552      * children the parent has. This is used by Make_Run to decide
553      * whether to queue the parent or examine its children...
555     if ((ln = Lst_Member(pgn->children, cgn)) != NULL) {
556 	Lst_Remove(pgn->children, ln);
606      * check for gn->children being empty as well...
608     if (!Lst_IsEmpty(gn->commands) || Lst_IsEmpty(gn->children)) {
756 	     * children - and so we mustn't do any processing here when
798 		    fprintf(debug_file, "- unmade children\n");
858  *	.EXEC and .USE children are very rarely going to be files, so...
935 	     * XXX: This will cause all made children to go in the OODATE
977     Lst_ForEach(gn->children, MakeUnmark, gn);
978     Lst_ForEach(gn->children, MakeAddAllSrc, gn);
1118 	     * We can't build this yet, add all unmade children to toBeMade,
1122 	    Lst_ForEach(gn->children, MakeBuildChild, Lst_First(toBeMade));
1253 	fprintf(debug_file, "MakePrintStatus: %s%s has %d unmade children\n",
1256      * If printing cycles and came to one that has unmade children,
1257      * print out the cycle by recursing on its children.
1260 	/* Fist time we've seen this node, check all children */
1262 	Lst_ForEach(gn->children, MakePrintStatus, errors);
1275     /* Reporting for our children will give the rest of the loop */
1276     Lst_ForEach(gn->children, MakePrintStatus, errors);
1304      * to get some children for it if it has none and also has no commands.
1306      * be looked at in a minute, otherwise we add its children to our queue
1350 	Lst_ForEach(gn->children, MakeUnmark, gn);
1351 	Lst_ForEach(gn->children, MakeHandleUse, gn);
1356 	    /* Pretend we made all this node's children */
1357 	    Lst_ForEach(gn->children, MakeFindChild, gn);
1359 		    printf("Warning: %s%s still has %d unmade children\n",
1364 	    Lst_ForEach(gn->children, MakeAddChild, examine);
1387     Lst_AtEnd(pn->children, cn);
1410     Lst_AtEnd(wn->children, cn);
1463 	owln = Lst_First(pgn->children);
1464 	Lst_Open(pgn->children);
1465 	for (; (ln = Lst_Next(pgn->children)) != NULL; ) {
1468 		/* Make the .WAIT node depend on the previous children */
1469 		Lst_ForEachFrom(pgn->children, owln, add_wait_dep, cgn);
1475 	Lst_Close(pgn->children);
1541      * will cause us to be idle most of the time while our children run as