usr.bin/make/suff.c

142 	Lst	children;	/* Suffixes we have a transformation from */
155 	int	children;	/* Count of existing children (so we don't free
158 	Lst	cp;		/* Debug; children list */
283 	Lst_Destroy(&s->children, NOFREE);
386 	 * Clear suffNull's children list (the other suffixes are built new, but
391 	Lst_Destroy(&suffNull->children, NOFREE);
535 		Lst_Destroy(&gn->children, NOFREE);
547 	SuffInsert(&t->children, s);
562  *	If the node has no commands or children, the children and parents
572 	if (!Lst_IsEmpty(&gn->commands) || !Lst_IsEmpty(&gn->children)) {
588 	 * Remove the source from the target's children list. We check
595 	SuffRemove(&t->children, s);
640 			SuffInsert(&s2->children, s);
665 			SuffInsert(&s->children, s2);
702 	Lst_Init(&s->children);
863 	s->children = 0;
877  *	Add all the children of targ as Src structures to the given list:
899 	LST_FOREACH(ln, &targ->suff->children) {
911 			targ->children += 1;
924 		targ->children += 1;
967 		if (s->children == 0) {
977 				--s->parent->children;
980 			printf("free: [l=%p] p=%p %d\n", l, s, s->children);
992 			printf("keep: [l=%p] p=%p %d: ", l, s, s->children);
1066  *	See if any of the children of the target in the Src structure is
1092 	for (ln = Lst_First(&t->children); ln != NULL; ln = Lst_Succ(ln)) {
1129 					targ->children += 1;
1298  *	Expand the names of any children of a given node that contain
1305  *	The expanded node is removed from the parent's list of children,
1320 		/* start from begin of parent's children list */
1321 		current = Lst_First(&parent->children);
1331 		 * instead of the current child onto the children list.
1356 		 * already children of it.
1362 			if (Lst_Member(&parent->children, gn) == NULL) {
1363 				Lst_Append(&parent->children, prev, gn);
1372 		 * of children to keep it from being processed.
1379 		Lst_Remove(&parent->children, prev);
1409 	if (Lst_Member(&tGn->children, sGn) == NULL) {
1414 		Lst_AtEnd(&tGn->children, sGn);
1431 			if (Lst_Member(&tGn->children, gn) == NULL) {
1436 				Lst_AtEnd(&tGn->children, gn);
1464 	ln = Lst_Last(&tGn->children);
1541 	if (Lst_Member(&gn->children, mem) == NULL) {
1542 		Lst_AtEnd(&gn->children, mem);
1674 	 * children, then look for any overriding transformations they imply.
1743 		if (Lst_IsEmpty(&gn->commands) && Lst_IsEmpty(&gn->children))
1803 		 * operator or [XXX] it has neither children or commands).
1805 		if (OP_NOP(gn->type) || (Lst_IsEmpty(&gn->children) &&
1886 	if (!Lst_IsEmpty(&gn->children)) {
2001  *	implied children.
2146 	Lst_Init(&suffNull->children);
2186 		LST_FOREACH(tln, &s->children)