2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1989 by Berkeley Softworks
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)suff.c 8.4 (Berkeley) 3/21/94
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
46 * Functions to maintain suffix lists and find implicit dependents
47 * using suffix transformation rules
50 * Suff_Init Initialize all things to do with suffixes.
52 * Suff_DoPaths This function is used to make life easier
53 * when searching for a file according to its
54 * suffix. It takes the global search path,
55 * as defined using the .PATH: target, and appends
56 * its directories to the path of each of the
57 * defined suffixes, as specified using
58 * .PATH<suffix>: targets. In addition, all
59 * directories given for suffixes labeled as
60 * include files or libraries, using the .INCLUDES
61 * or .LIBS targets, are played with using
62 * Dir_MakeFlags to create the .INCLUDES and
63 * .LIBS global variables.
65 * Suff_ClearSuffixes Clear out all the suffixes and defined
68 * Suff_IsTransform Return TRUE if the passed string is the lhs
69 * of a transformation rule.
71 * Suff_AddSuffix Add the passed string as another known suffix.
73 * Suff_GetPath Return the search path for the given suffix.
75 * Suff_AddInclude Mark the given suffix as denoting an include
78 * Suff_AddLib Mark the given suffix as denoting a library.
80 * Suff_AddTransform Add another transformation to the suffix
81 * graph. Returns GNode suitable for framing, I
82 * mean, tacking commands, attributes, etc. on.
84 * Suff_SetNull Define the suffix to consider the suffix of
85 * any file that doesn't have a known one.
87 * Suff_FindDeps Find implicit sources for and the location of
88 * a target based on its suffix. Returns the
89 * bottom-most node added to the graph or NULL
90 * if the target had no implicit sources.
93 #include <sys/queue.h>
113 /* Lst of suffixes */
114 static Lst sufflist = Lst_Initializer(sufflist);
116 /* Lst of suffixes to be cleaned */
117 static Lst suffClean = Lst_Initializer(suffClean);
120 static Lst srclist = Lst_Initializer(srclist);
122 /* Lst of transformation rules */
123 static Lst transforms = Lst_Initializer(transforms);
125 /* Counter for assigning suffix numbers */
129 * Structure describing an individual suffix.
131 typedef struct Suff {
132 char *name; /* The suffix itself */
133 int nameLen; /* Length of the suffix */
134 short flags; /* Type of suffix */
135 #define SUFF_INCLUDE 0x01 /* One which is #include'd */
136 #define SUFF_LIBRARY 0x02 /* One which contains a library */
137 #define SUFF_NULL 0x04 /* The empty suffix */
138 struct Path searchPath; /* Path for files with this suffix */
139 int sNum; /* The suffix number */
140 int refCount; /* Reference count of list membership */
141 Lst parents; /* Suffixes we have a transformation to */
142 Lst children; /* Suffixes we have a transformation from */
143 Lst ref; /* List of lists this suffix is referenced */
147 * Structure used in the search for implied sources.
150 char *file; /* The file to look for */
151 char *pref; /* Prefix from which file was formed */
152 Suff *suff; /* The suffix on the file */
153 struct Src *parent; /* The Src for which this is a source */
154 GNode *node; /* The node describing the file */
155 int children; /* Count of existing children (so we don't free
156 * this thing too early or never nuke it) */
158 Lst cp; /* Debug; children list */
162 /* The NULL suffix for this run */
163 static Suff *suffNull;
165 /* The empty suffix required for POSIX single-suffix transformation rules */
166 static Suff *emptySuff;
168 static void SuffFindDeps(GNode *, Lst *);
172 *-----------------------------------------------------------------------
173 * SuffSuffIsSuffix --
174 * See if suff is a suffix of str.
177 * NULL if it ain't, pointer to character in str before suffix if
182 *-----------------------------------------------------------------------
185 SuffSuffIsSuffix(const Suff *s, char *str)
187 const char *p1; /* Pointer into suffix name */
188 char *p2; /* Pointer into string being examined */
192 p1 = s->name + s->nameLen;
195 while (p1 >= s->name && len > 0 && *p1 == *p2) {
201 return (p1 == s->name - 1 ? p2 : NULL);
205 *-----------------------------------------------------------------------
207 * Find a suffix given its name.
210 * The suffix or NULL.
214 *-----------------------------------------------------------------------
217 SuffSuffFind(const char *s)
221 LST_FOREACH(ln, &sufflist) {
222 if (strcmp(s, ((const Suff *)Lst_Datum(ln))->name) == 0)
223 return (Lst_Datum(ln));
229 *-----------------------------------------------------------------------
238 *-----------------------------------------------------------------------
241 SuffTransFind(const char *name)
245 LST_FOREACH(ln, &transforms) {
246 if (strcmp(name, ((const GNode *)Lst_Datum(ln))->name) == 0)
247 return (Lst_Datum(ln));
252 /*********** Maintenance Functions ************/
256 * Keep this function for now until it is clear why a .SUFFIXES: doesn't
257 * actually delete the suffixes but just puts them on the suffClean list.
260 *-----------------------------------------------------------------------
262 * Free up all memory associated with the given suffix structure.
268 * the suffix entry is detroyed
269 *-----------------------------------------------------------------------
282 Lst_Destroy(&s->ref, NOFREE);
283 Lst_Destroy(&s->children, NOFREE);
284 Lst_Destroy(&s->parents, NOFREE);
285 Lst_Destroy(&s->searchPath, Dir_Destroy);
293 *-----------------------------------------------------------------------
295 * Remove the suffix into the list
301 * The reference count for the suffix is decremented
302 *-----------------------------------------------------------------------
305 SuffRemove(Lst *l, Suff *s)
307 LstNode *ln = Lst_Member(l, s);
316 *-----------------------------------------------------------------------
318 * Insert the suffix into the list keeping the list ordered by suffix
325 * The reference count of the suffix is incremented
326 *-----------------------------------------------------------------------
329 SuffInsert(Lst *l, Suff *s)
331 LstNode *ln; /* current element in l we're examining */
332 Suff *s2; /* the suffix descriptor in this element */
335 for (ln = Lst_First(l); ln != NULL; ln = Lst_Succ(ln)) {
337 if (s2->sNum >= s->sNum)
341 DEBUGF(SUFF, ("inserting an empty list?..."));
344 DEBUGF(SUFF, ("inserting %s(%d)...", s->name, s->sNum));
346 DEBUGF(SUFF, ("at end of list\n"));
349 Lst_AtEnd(&s->ref, l);
350 } else if (s2->sNum != s->sNum) {
351 DEBUGF(SUFF, ("before %s(%d)\n", s2->name, s2->sNum));
352 Lst_Insert(l, ln, s);
354 Lst_AtEnd(&s->ref, l);
356 DEBUGF(SUFF, ("already there\n"));
361 *-----------------------------------------------------------------------
362 * Suff_ClearSuffixes --
363 * This is gross. Nuke the list of suffixes but keep all transformation
364 * rules around. The transformation graph is destroyed in this process,
365 * but we leave the list of rules so when a new graph is formed the rules
367 * This function is called from the parse module when a
368 * .SUFFIXES:\n line is encountered.
374 * the sufflist and its graph nodes are destroyed
375 *-----------------------------------------------------------------------
378 Suff_ClearSuffixes(void)
381 Lst_Concat(&suffClean, &sufflist, LST_CONCLINK);
384 suffNull = emptySuff;
386 * Clear suffNull's children list (the other suffixes are built new, but
387 * suffNull is used as is).
388 * NOFREE is used because all suffixes are are on the suffClean list.
389 * suffNull should not have parents.
391 Lst_Destroy(&suffNull->children, NOFREE);
395 *-----------------------------------------------------------------------
396 * SuffParseTransform --
397 * Parse a transformation string to find its two component suffixes.
400 * TRUE if the string is a valid transformation and FALSE otherwise.
403 * The passed pointers are overwritten.
405 *-----------------------------------------------------------------------
408 SuffParseTransform(char *str, Suff **srcPtr, Suff **targPtr)
410 LstNode *srcLn; /* element in suffix list of trans source*/
411 Suff *src; /* Source of transformation */
412 char *str2; /* Extra pointer (maybe target suffix) */
413 LstNode *singleLn; /* element in suffix list of any suffix
414 * that exactly matches str */
415 Suff *single = NULL; /* Source of possible transformation to
421 * Loop looking first for a suffix that matches the start of the
422 * string and then for one that exactly matches the rest of it. If
423 * we can find two that meet these criteria, we've successfully
426 srcLn = Lst_First(&sufflist);
428 /* advance to next possible suffix */
429 while (srcLn != NULL) {
430 src = Lst_Datum(srcLn);
431 if (strncmp(str, src->name, strlen(src->name)) == 0)
433 srcLn = LST_NEXT(srcLn);
438 * Ran out of source suffixes -- no such rule
440 if (singleLn != NULL) {
442 * Not so fast Mr. Smith! There was a suffix
443 * that encompassed the entire string, so we
444 * assume it was a transformation to the null
445 * suffix (thank you POSIX). We still prefer to
446 * find a double rule over a singleton, hence we
447 * leave this check until the end.
449 * XXX: Use emptySuff over suffNull?
457 str2 = str + src->nameLen;
463 *targPtr = SuffSuffFind(str2);
464 if (*targPtr != NULL) {
470 srcLn = LST_NEXT(srcLn);
475 *-----------------------------------------------------------------------
476 * Suff_IsTransform --
477 * Return TRUE if the given string is a transformation rule
481 * TRUE if the string is a concatenation of two known suffixes.
486 *-----------------------------------------------------------------------
489 Suff_IsTransform(char *str)
493 return (SuffParseTransform(str, &src, &targ));
497 *-----------------------------------------------------------------------
498 * Suff_AddTransform --
499 * Add the transformation rule described by the line to the
500 * list of rules and place the transformation itself in the graph
503 * The node created for the transformation in the transforms list
506 * The node is placed on the end of the transforms Lst and links are
507 * made between the two suffixes mentioned in the target name
508 *-----------------------------------------------------------------------
511 Suff_AddTransform(char *line)
513 GNode *gn; /* GNode of transformation rule */
514 Suff *s; /* source suffix */
515 Suff *t; /* target suffix */
517 gn = SuffTransFind(line);
520 * Make a new graph node for the transformation.
521 * It will be filled in by the Parse module.
523 gn = Targ_NewGN(line);
524 Lst_AtEnd(&transforms, gn);
527 * New specification for transformation rule. Just nuke the
528 * old list of commands so they can be filled in again...
529 * We don't actually free the commands themselves, because a
530 * given command can be attached to several different
533 Lst_Destroy(&gn->commands, NOFREE);
534 Lst_Destroy(&gn->children, NOFREE);
537 gn->type = OP_TRANSFORM;
539 SuffParseTransform(line, &s, &t);
542 * link the two together in the proper relationship and order
544 DEBUGF(SUFF, ("defining transformation from `%s' to `%s'\n",
546 SuffInsert(&t->children, s);
547 SuffInsert(&s->parents, t);
553 *-----------------------------------------------------------------------
554 * Suff_EndTransform --
555 * Handle the finish of a transformation definition, removing the
556 * transformation from the graph if it has neither commands nor
557 * sources. This is called from the Parse module at the end of
558 * a dependency block.
561 * If the node has no commands or children, the children and parents
562 * lists of the affected suffices are altered.
564 *-----------------------------------------------------------------------
567 Suff_EndTransform(const GNode *gn)
571 if (!Lst_IsEmpty(&gn->commands) || !Lst_IsEmpty(&gn->children)) {
572 DEBUGF(SUFF, ("transformation %s complete\n", gn->name));
577 * SuffParseTransform() may fail for special rules which are not
578 * actual transformation rules (e.g., .DEFAULT).
580 if (!SuffParseTransform(gn->name, &s, &t))
583 DEBUGF(SUFF, ("deleting transformation from `%s' to `%s'\n",
587 * Remove the source from the target's children list. We check
588 * for a NULL return to handle a beanhead saying something like
591 * We'll be called twice when the next target is seen, but .c
592 * and .o are only linked once...
594 SuffRemove(&t->children, s);
597 * Remove the target from the source's parents list
599 SuffRemove(&s->parents, t);
603 *-----------------------------------------------------------------------
604 * SuffRebuildGraph --
605 * Called from Suff_AddSuffix via LST_FOREACH to search through the
606 * list of existing transformation rules and rebuild the transformation
607 * graph when it has been destroyed by Suff_ClearSuffixes. If the
608 * given rule is a transformation involving this suffix and another,
609 * existing suffix, the proper relationship is established between
613 * The appropriate links will be made between this suffix and
614 * others if transformation rules exist for it.
616 *-----------------------------------------------------------------------
619 SuffRebuildGraph(const GNode *transform, Suff *s)
625 * First see if it is a transformation from this suffix.
627 if (strncmp(transform->name, s->name, strlen(s->name)) == 0) {
628 cp = transform->name + strlen(s->name);
630 if (cp[0] == '\0') /* null rule */
633 s2 = SuffSuffFind(cp);
636 * Found target. Link in and return, since it can't be
639 SuffInsert(&s2->children, s);
640 SuffInsert(&s->parents, s2);
646 * Not from, maybe to?
648 cp = SuffSuffIsSuffix(s, transform->name);
651 * Null-terminate the source suffix in order to find it.
654 s2 = SuffSuffFind(transform->name);
657 * Replace the start of the target suffix
662 * Found it -- establish the proper relationship
664 SuffInsert(&s->children, s2);
665 SuffInsert(&s2->parents, s);
671 *-----------------------------------------------------------------------
673 * Add the suffix in string to the end of the list of known suffixes.
674 * Should we restructure the suffix graph? Make doesn't...
680 * A GNode is created for the suffix and a Suff structure is created and
681 * added to the suffixes list unless the suffix was already known.
682 *-----------------------------------------------------------------------
685 Suff_AddSuffix(char *str)
687 Suff *s; /* new suffix descriptor */
690 if (SuffSuffFind(str) != NULL)
696 s = emalloc(sizeof(Suff));
698 s->name = estrdup(str);
699 s->nameLen = strlen(s->name);
700 TAILQ_INIT(&s->searchPath);
701 Lst_Init(&s->children);
702 Lst_Init(&s->parents);
708 Lst_AtEnd(&sufflist, s);
711 * Look for any existing transformations from or to this suffix.
712 * XXX: Only do this after a Suff_ClearSuffixes?
714 LST_FOREACH(ln, &transforms)
715 SuffRebuildGraph(Lst_Datum(ln), s);
719 *-----------------------------------------------------------------------
721 * Return the search path for the given suffix, if it's defined.
724 * The searchPath for the desired suffix or NULL if the suffix isn't
729 *-----------------------------------------------------------------------
732 Suff_GetPath(char *sname)
736 s = SuffSuffFind(sname);
739 return (&s->searchPath);
743 *-----------------------------------------------------------------------
745 * Extend the search paths for all suffixes to include the default
752 * The searchPath field of all the suffixes is extended by the
753 * directories in dirSearchPath. If paths were specified for the
754 * ".h" suffix, the directories are stuffed into a global variable
755 * called ".INCLUDES" with each directory preceded by a -I. The same
756 * is done for the ".a" suffix, except the variable is called
757 * ".LIBS" and the flag is -L.
758 *-----------------------------------------------------------------------
766 struct Path inIncludes; /* Cumulative .INCLUDES path */
767 struct Path inLibs; /* Cumulative .LIBS path */
769 TAILQ_INIT(&inIncludes);
772 for (ln = Lst_First(&sufflist); ln != NULL; ln = Lst_Succ(ln)) {
775 if (s->flags & SUFF_INCLUDE) {
776 Path_Concat(&inIncludes, &s->searchPath);
778 #endif /* INCLUDES */
780 if (s->flags & SUFF_LIBRARY) {
781 Path_Concat(&inLibs, &s->searchPath);
783 #endif /* LIBRARIES */
784 Path_Concat(&s->searchPath, &dirSearchPath);
787 ptr = Path_MakeFlags("-I", &inIncludes);
788 Var_Set(".INCLUDES", ptr, VAR_GLOBAL);
791 ptr = Path_MakeFlags("-L", &inLibs);
792 Var_Set(".LIBS", ptr, VAR_GLOBAL);
795 Path_Clear(&inIncludes);
800 *-----------------------------------------------------------------------
802 * Add the given suffix as a type of file which gets included.
803 * Called from the parse module when a .INCLUDES line is parsed.
804 * The suffix must have already been defined.
810 * The SUFF_INCLUDE bit is set in the suffix's flags field
812 *-----------------------------------------------------------------------
815 Suff_AddInclude(char *sname)
819 if ((s = SuffSuffFind(sname)) != NULL)
820 s->flags |= SUFF_INCLUDE;
824 *-----------------------------------------------------------------------
826 * Add the given suffix as a type of file which is a library.
827 * Called from the parse module when parsing a .LIBS line. The
828 * suffix must have been defined via .SUFFIXES before this is
835 * The SUFF_LIBRARY bit is set in the suffix's flags field
837 *-----------------------------------------------------------------------
840 Suff_AddLib(char *sname)
844 if ((s = SuffSuffFind(sname)) != NULL)
845 s->flags |= SUFF_LIBRARY;
849 * Create a new Src structure
852 SuffSrcCreate(char *file, char *prefix, Suff *suff, Src *parent, GNode *node)
856 s = emalloc(sizeof(*s));
871 /********** Implicit Source Search Functions *********/
874 *-----------------------------------------------------------------------
876 * Add all the children of targ as Src structures to the given list:
877 * Add a suffix as a Src structure to the given list with its parent
878 * being the given Src structure. If the suffix is the null suffix,
879 * the prefix is used unaltered as the file name in the Src structure.
885 * Lots of structures are created and added to the list
886 *-----------------------------------------------------------------------
889 SuffAddLevel(Lst *l, Src *targ)
898 LST_FOREACH(ln, &targ->suff->children) {
899 suff = Lst_Datum(ln);
901 if ((suff->flags & SUFF_NULL) && *suff->name != '\0') {
903 * If the suffix has been marked as the NULL suffix,
904 * also create a Src structure for a file with no suffix
905 * attached. Two birds, and all that...
907 s2 = SuffSrcCreate(estrdup(targ->pref), targ->pref,
913 Lst_AtEnd(&targ->cp, s2);
914 printf("1 add %p %p to %p:", targ, s2, l);
916 printf("%p ", (const void *)Lst_Datum(ln1));
920 s2 = SuffSrcCreate(str_concat(targ->pref, suff->name, 0),
921 targ->pref, suff, targ, NULL);
926 Lst_AtEnd(&targ->cp, s2);
927 printf("2 add %p %p to %p:", targ, s2, l);
929 printf("%p ", (const void *)Lst_Datum(ln1));
936 *----------------------------------------------------------------------
938 * Free all src structures in list that don't have a reference count
939 * XXX this actually frees only the first of these.
942 * True if a src was removed
945 * The memory is free'd.
946 *----------------------------------------------------------------------
949 SuffRemoveSrc(Lst *l)
956 printf("cleaning %lx: ", (unsigned long) l);
958 printf("%p ", (const void *)Lst_Datum(ln));
962 for (ln = Lst_First(l); ln != NULL; ln = ln1) {
965 s = (Src *)Lst_Datum(ln);
966 if (s->children == 0) {
972 LstNode *ln = Lst_Member(&s->parent->cp, s);
974 Lst_Remove(&s->parent->cp, ln);
976 --s->parent->children;
979 printf("free: [l=%p] p=%p %d\n", l, s, s->children);
980 Lst_Destroy(&s->cp, NOFREE);
991 printf("keep: [l=%p] p=%p %d: ", l, s, s->children);
992 LST_FOREACH(tln, &s->cp)
993 printf("%p ", (const void *)Lst_Datum(tln));
1003 *-----------------------------------------------------------------------
1005 * Find the first existing file/target in the list srcs
1008 * The lowest structure in the chain of transformations
1012 *-----------------------------------------------------------------------
1015 SuffFindThem(Lst *srcs, Lst *slst)
1017 Src *s; /* current Src */
1018 Src *rs; /* returned Src */
1023 while (!Lst_IsEmpty (srcs)) {
1024 s = Lst_DeQueue(srcs);
1026 DEBUGF(SUFF, ("\ttrying %s...", s->file));
1029 * A file is considered to exist if either a node exists in the
1030 * graph for it or the file actually exists.
1032 if (Targ_FindNode(s->file, TARG_NOCREATE) != NULL) {
1034 printf("remove %p from %p\n", s, srcs);
1040 if ((ptr = Path_FindFile(s->file,
1041 &s->suff->searchPath)) != NULL) {
1044 printf("remove %p from %p\n", s, srcs);
1050 DEBUGF(SUFF, ("not there\n"));
1052 SuffAddLevel(srcs, s);
1057 DEBUGF(SUFF, ("got it\n"));
1063 *-----------------------------------------------------------------------
1065 * See if any of the children of the target in the Src structure is
1066 * one from which the target can be transformed. If there is one,
1067 * a Src structure is put together for it and returned.
1070 * The Src structure of the "winning" child, or NULL if no such beast.
1073 * A Src structure may be allocated.
1075 *-----------------------------------------------------------------------
1078 SuffFindCmds(Src *targ, Lst *slst)
1080 LstNode *ln; /* General-purpose list node */
1081 GNode *t; /* Target GNode */
1082 GNode *s; /* Source GNode */
1083 int prefLen;/* The length of the defined prefix */
1084 Suff *suff; /* Suffix on matching beastie */
1085 Src *ret; /* Return value */
1089 prefLen = strlen(targ->pref);
1091 for (ln = Lst_First(&t->children); ln != NULL; ln = Lst_Succ(ln)) {
1094 cp = strrchr(s->name, '/');
1100 if (strncmp(cp, targ->pref, prefLen) == 0) {
1102 * The node matches the prefix ok, see if it has
1105 suff = SuffSuffFind(&cp[prefLen]);
1108 * It even has a known suffix, see if there's
1109 * a transformation defined between the node's
1110 * suffix and the target's suffix.
1112 * XXX: Handle multi-stage transformations
1115 if (Lst_Member(&suff->parents,
1116 targ->suff) != NULL) {
1118 * Hot Damn! Create a new Src structure
1119 * to describe this transformation
1120 * (making sure to duplicate the
1121 * source node's name so Suff_FindDeps
1122 * can free it again (ick)), and return
1123 * the new structure.
1125 ret = SuffSrcCreate(estrdup(s->name),
1126 targ->pref, suff, targ, s);
1128 targ->children += 1;
1130 printf("3 add %p %p\n", &targ, ret);
1131 Lst_AtEnd(&targ->cp, ret);
1133 Lst_AtEnd(slst, ret);
1134 DEBUGF(SUFF, ("\tusing existing source "
1145 * The child node contains variable references. Expand them and return
1146 * a list of expansions.
1149 SuffExpandVariables(GNode *parent, GNode *child, Lst *members)
1157 DEBUGF(SUFF, ("Expanding \"%s\"...", child->name));
1158 buf = Var_Subst(child->name, parent, TRUE);
1161 if (child->type & OP_ARCHV) {
1163 * Node was an archive(member) target, so we
1164 * want to call on the Arch module to find the
1165 * nodes for us, expanding variables in the
1168 Arch_ParseArchive(&cp, members, parent);
1169 Buf_Destroy(buf, TRUE);
1173 * Break the result into a vector of strings whose nodes we can find,
1174 * then add those nodes to the members list. Unfortunately, we can't use
1175 * brk_string b/c it doesn't understand about variable specifications
1176 * with spaces in them... XXX
1178 for (start = cp; *start == ' ' || *start == '\t'; start++)
1181 for (cp = start; *cp != '\0'; cp++) {
1182 if (*cp == ' ' || *cp == '\t') {
1184 * White-space -- terminate element, find the node,
1185 * add it, skip any further spaces.
1188 Lst_AtEnd(members, Targ_FindNode(start, TARG_CREATE));
1190 while (*cp == ' ' || *cp == '\t') {
1194 * Adjust cp for increment at
1195 * start of loop, but set start
1196 * to first non-space.
1200 } else if (*cp == '$') {
1202 * Start of a variable spec -- contact variable module
1203 * to find the end so we can skip over it.
1209 junk = Var_Parse(cp, parent, TRUE, &len, &doFree);
1210 if (junk != var_Error) {
1217 } else if (*cp == '\\' && *cp != '\0') {
1219 * Escaped something -- skip over it
1227 * Stuff left over -- add it to the
1230 Lst_AtEnd(members, Targ_FindNode(start, TARG_CREATE));
1233 Buf_Destroy(buf, TRUE);
1237 * The child node contains wildcards. Expand them and return a list of
1241 SuffExpandWildcards(GNode *child, Lst *members)
1244 Lst exp; /* List of expansions */
1246 struct Path *path; /* Search path along which to expand */
1251 * Find a path along which to expand the word.
1253 * If the word has a known suffix, use that path.
1254 * If it has no known suffix and we're allowed to use the null
1255 * suffix, use its path.
1256 * Else use the default system search path.
1258 LST_FOREACH(ln, &sufflist) {
1259 if (SuffSuffIsSuffix(Lst_Datum(ln), child->name) != NULL)
1263 DEBUGF(SUFF, ("Wildcard expanding \"%s\"...", child->name));
1266 Suff *s = Lst_Datum(ln);
1268 DEBUGF(SUFF, ("suffix is \"%s\"...", s->name));
1269 path = &s->searchPath;
1272 * Use default search path
1274 path = &dirSearchPath;
1278 * Expand the word along the chosen path
1281 Path_Expand(child->name, path, &exp);
1283 while (!Lst_IsEmpty(&exp)) {
1285 * Fetch next expansion off the list and find its GNode
1287 cp = Lst_DeQueue(&exp);
1289 DEBUGF(SUFF, ("%s...", cp));
1290 Lst_AtEnd(members, Targ_FindNode(cp, TARG_CREATE));
1295 *-----------------------------------------------------------------------
1296 * SuffExpandChildren --
1297 * Expand the names of any children of a given node that contain
1298 * variable invocations or file wildcards into actual targets.
1304 * The expanded node is removed from the parent's list of children,
1305 * and the parent's unmade counter is decremented, but other nodes
1308 *-----------------------------------------------------------------------
1311 SuffExpandChildren(GNode *parent, LstNode *current)
1313 GNode *cchild; /* current child */
1315 LstNode *prev; /* node after which to append new source */
1316 Lst members; /* expanded nodes */
1318 if (current == NULL) {
1319 /* start from begin of parent's children list */
1320 current = Lst_First(&parent->children);
1323 while (current != NULL) {
1324 cchild = Lst_Datum(current);
1327 * First do variable expansion -- this takes precedence over
1328 * wildcard expansion. If the result contains wildcards, they'll
1329 * be gotten to later since the resulting words are tacked
1330 * instead of the current child onto the children list.
1332 * XXXHB what if cchild contains lib.a(t1.o t2.o t3.o) but
1335 if (strchr(cchild->name, '$') != NULL) {
1336 SuffExpandVariables(parent, cchild, &members);
1338 } else if (Dir_HasWildcards(cchild->name)) {
1339 SuffExpandWildcards(cchild, &members);
1342 /* nothing special just advance to next child */
1343 current = LST_NEXT(current);
1348 * New nodes effectively take the place of the child,
1349 * so place them after the child
1354 * Add all new elements to the parent node if they aren't
1355 * already children of it.
1357 while(!Lst_IsEmpty(&members)) {
1358 gn = Lst_DeQueue(&members);
1360 DEBUGF(SUFF, ("%s...", gn->name));
1361 if (Lst_Member(&parent->children, gn) == NULL) {
1362 Lst_Append(&parent->children, prev, gn);
1363 prev = Lst_Succ(prev);
1364 Lst_AtEnd(&gn->parents, parent);
1370 * Now the source is expanded, remove it from the list
1371 * of children to keep it from being processed.
1372 * Advance to the next child.
1375 current = LST_NEXT(current);
1378 Lst_Remove(&parent->children, prev);
1379 DEBUGF(SUFF, ("\n"));
1384 *-----------------------------------------------------------------------
1385 * SuffApplyTransform --
1386 * Apply a transformation rule, given the source and target nodes
1390 * TRUE if successful, FALSE if not.
1393 * The source and target are linked and the commands from the
1394 * transformation are added to the target node's commands list.
1395 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1396 * to the target. The target also inherits all the sources for
1397 * the transformation rule.
1399 *-----------------------------------------------------------------------
1402 SuffApplyTransform(GNode *tGn, GNode *sGn, Suff *t, Suff *s)
1404 LstNode *ln; /* General node */
1405 char *tname; /* Name of transformation rule */
1406 GNode *gn; /* Node for same */
1408 if (Lst_Member(&tGn->children, sGn) == NULL) {
1410 * Not already linked, so form the proper links between the
1411 * target and source.
1413 Lst_AtEnd(&tGn->children, sGn);
1414 Lst_AtEnd(&sGn->parents, tGn);
1418 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1420 * When a :: node is used as the implied source of a node,
1421 * we have to link all its cohorts in as sources as well. Only
1422 * the initial sGn gets the target in its iParents list, however
1423 * as that will be sufficient to get the .IMPSRC variable set
1426 for (ln = Lst_First(&sGn->cohorts); ln != NULL;
1427 ln = Lst_Succ(ln)) {
1430 if (Lst_Member(&tGn->children, gn) == NULL) {
1432 * Not already linked, so form the proper
1433 * links between the target and source.
1435 Lst_AtEnd(&tGn->children, gn);
1436 Lst_AtEnd(&gn->parents, tGn);
1442 * Locate the transformation rule itself
1444 tname = str_concat(s->name, t->name, 0);
1445 gn = SuffTransFind(tname);
1450 * Not really such a transformation rule (can happen when we're
1451 * called to link an OP_MEMBER and OP_ARCHV node), so return
1457 DEBUGF(SUFF, ("\tapplying %s -> %s to \"%s\"\n",
1458 s->name, t->name, tGn->name));
1461 * Record last child for expansion purposes
1463 ln = Lst_Last(&tGn->children);
1466 * Pass the buck to Make_HandleUse to apply the rule
1468 Make_HandleUse(gn, tGn);
1471 * Deal with wildcards and variables in any acquired sources
1475 SuffExpandChildren(tGn, ln);
1479 * Keep track of another parent to which this beast is transformed so
1480 * the .IMPSRC variable can be set correctly for the parent.
1482 Lst_AtEnd(&sGn->iParents, tGn);
1489 *-----------------------------------------------------------------------
1490 * SuffFindArchiveDeps --
1491 * Locate dependencies for an OP_ARCHV node.
1497 * Same as Suff_FindDeps
1499 *-----------------------------------------------------------------------
1502 SuffFindArchiveDeps(GNode *gn, Lst *slst)
1504 char *eoarch; /* End of archive portion */
1505 char *eoname; /* End of member portion */
1506 char *name; /* Start of member's name */
1507 GNode *mem; /* Node for member */
1508 Suff *ms; /* Suffix descriptor for member */
1510 static const char *copy[] = {
1511 TARGET, /* Must be first */
1512 PREFIX, /* Must be second */
1516 * The node is an archive(member) pair. so we must find a
1517 * suffix for both of them.
1519 eoarch = strchr(gn->name, '(');
1520 eoname = strchr(eoarch, ')');
1522 *eoname = '\0'; /* Nuke parentheses during suffix search */
1523 *eoarch = '\0'; /* So a suffix can be found */
1528 * To simplify things, call Suff_FindDeps recursively on the member now,
1529 * so we can simply compare the member's .PREFIX and .TARGET variables
1530 * to locate its suffix. This allows us to figure out the suffix to
1531 * use for the archive without having to do a quadratic search over the
1532 * suffix list, backtracking for each one...
1534 mem = Targ_FindNode(name, TARG_CREATE);
1535 SuffFindDeps(mem, slst);
1538 * Create the link between the two nodes right off
1540 if (Lst_Member(&gn->children, mem) == NULL) {
1541 Lst_AtEnd(&gn->children, mem);
1542 Lst_AtEnd(&mem->parents, gn);
1547 * Copy in the variables from the member node to this one.
1549 Var_Set(copy[1], Var_Value(copy[1], mem), gn);
1550 Var_Set(copy[0], Var_Value(copy[0], mem), gn);
1555 * Didn't know what it was -- use .NULL suffix if not in
1558 DEBUGF(SUFF, ("using null suffix\n"));
1563 * Set the other two local variables required for this target.
1565 Var_Set(MEMBER, name, gn);
1566 Var_Set(ARCHIVE, gn->name, gn);
1570 * Member has a known suffix, so look for a transformation rule
1571 * from it to a possible suffix of the archive. Rather than
1572 * searching through the entire list, we just look at suffixes
1573 * to which the member's suffix may be transformed...
1578 * Use first matching suffix...
1580 LST_FOREACH(ln, &ms->parents) {
1581 if (SuffSuffIsSuffix(Lst_Datum(ln), gn->name) != NULL)
1587 * Got one -- apply it
1589 if (!SuffApplyTransform(gn, mem, Lst_Datum(ln), ms)) {
1590 DEBUGF(SUFF, ("\tNo transformation from "
1591 "%s -> %s\n", ms->name,
1592 ((Suff *)Lst_Datum(ln))->name));
1598 * Replace the opening and closing parens now we've no need
1599 * of the separate pieces.
1605 * Pretend gn appeared to the left of a dependency operator so
1606 * the user needn't provide a transformation from the member to the
1609 if (OP_NOP(gn->type)) {
1610 gn->type |= OP_DEPENDS;
1614 * Flag the member as such so we remember to look in the archive for
1615 * its modification time.
1617 mem->type |= OP_MEMBER;
1621 *-----------------------------------------------------------------------
1622 * SuffFindNormalDeps --
1623 * Locate implicit dependencies for regular targets.
1629 * Same as Suff_FindDeps...
1631 *-----------------------------------------------------------------------
1634 SuffFindNormalDeps(GNode *gn, Lst *slst)
1636 char *eoname; /* End of name */
1637 char *sopref; /* Start of prefix */
1638 LstNode *ln; /* Next suffix node to check */
1639 Lst srcs; /* List of sources at which to look */
1640 Lst targs; /* List of targets to which things can be
1641 * transformed. They all have the same file,
1642 * but different suff and pref fields */
1643 Src *bottom; /* Start of found transformation path */
1644 Src *src; /* General Src pointer */
1645 char *pref; /* Prefix to use */
1646 Src *targ; /* General Src target pointer */
1648 eoname = gn->name + strlen(gn->name);
1652 * Begin at the beginning...
1654 ln = Lst_First(&sufflist);
1659 * We're caught in a catch-22 here. On the one hand, we want to use any
1660 * transformation implied by the target's sources, but we can't examine
1661 * the sources until we've expanded any variables/wildcards they may
1662 * hold, and we can't do that until we've set up the target's local
1663 * variables and we can't do that until we know what the proper suffix
1664 * for the target is (in case there are two suffixes one of which is a
1665 * suffix of the other) and we can't know that until we've found its
1666 * implied source, which we may not want to use if there's an existing
1667 * source that implies a different transformation.
1669 * In an attempt to get around this, which may not work all the time,
1670 * but should work most of the time, we look for implied sources first,
1671 * checking transformations to all possible suffixes of the target,
1672 * use what we find to set the target's local variables, expand the
1673 * children, then look for any overriding transformations they imply.
1674 * Should we find one, we discard the one we found before.
1677 while (ln != NULL) {
1679 * Look for next possible suffix...
1681 while (ln != NULL) {
1682 if (SuffSuffIsSuffix(Lst_Datum(ln), gn->name) != NULL)
1688 int prefLen; /* Length of the prefix */
1692 * Allocate a Src structure to which things can be
1695 target = SuffSrcCreate(estrdup(gn->name), NULL,
1696 Lst_Datum(ln), NULL, gn);
1697 target->suff->refCount++;
1700 * Allocate room for the prefix, whose end is found
1701 * by subtracting the length of the suffix from
1702 * the end of the name.
1704 prefLen = (eoname - target->suff->nameLen) - sopref;
1705 assert(prefLen >= 0);
1706 target->pref = emalloc(prefLen + 1);
1707 memcpy(target->pref, sopref, prefLen);
1708 target->pref[prefLen] = '\0';
1711 * Add nodes from which the target can be made
1713 SuffAddLevel(&srcs, target);
1716 * Record the target so we can nuke it
1718 Lst_AtEnd(&targs, target);
1721 * Search from this suffix's successor...
1728 * Handle target of unknown suffix...
1730 if (Lst_IsEmpty(&targs) && suffNull != NULL) {
1731 DEBUGF(SUFF, ("\tNo known suffix on %s. Using .NULL suffix\n",
1734 targ = SuffSrcCreate(estrdup(gn->name), estrdup(sopref),
1735 suffNull, NULL, gn);
1736 targ->suff->refCount++;
1739 * Only use the default suffix rules if we don't have commands
1740 * or dependencies defined for this gnode
1742 if (Lst_IsEmpty(&gn->commands) && Lst_IsEmpty(&gn->children))
1743 SuffAddLevel(&srcs, targ);
1745 DEBUGF(SUFF, ("not "));
1748 DEBUGF(SUFF, ("adding suffix rules\n"));
1750 Lst_AtEnd(&targs, targ);
1754 * Using the list of possible sources built up from the target
1755 * suffix(es), try and find an existing file/target that matches.
1757 bottom = SuffFindThem(&srcs, slst);
1759 if (bottom == NULL) {
1761 * No known transformations -- use the first suffix found for
1762 * setting the local variables.
1764 if (!Lst_IsEmpty(&targs)) {
1765 targ = Lst_Datum(Lst_First(&targs));
1771 * Work up the transformation path to find the suffix of the
1772 * target to which the transformation was made.
1774 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1779 * The .TARGET variable we always set to be the name at this point,
1780 * since it's only set to the path if the thing is only a source and
1781 * if it's only a source, it doesn't matter what we put here as far
1782 * as expanding sources is concerned, since it has none...
1784 Var_Set(TARGET, gn->name, gn);
1786 pref = (targ != NULL) ? targ->pref : gn->name;
1787 Var_Set(PREFIX, pref, gn);
1790 * Now we've got the important local variables set, expand any sources
1791 * that still contain variables or wildcards in their names.
1793 SuffExpandChildren(gn, NULL);
1796 DEBUGF(SUFF, ("\tNo valid suffix on %s\n", gn->name));
1800 * Deal with finding the thing on the default search path if the
1801 * node is only a source (not on the lhs of a dependency
1802 * operator or [XXX] it has neither children or commands).
1804 if (OP_NOP(gn->type) || (Lst_IsEmpty(&gn->children) &&
1805 Lst_IsEmpty(&gn->commands))) {
1806 gn->path = Path_FindFile(gn->name,
1807 (targ == NULL ? &dirSearchPath :
1808 &targ->suff->searchPath));
1809 if (gn->path != NULL) {
1811 Var_Set(TARGET, gn->path, gn);
1815 * Suffix known for the thing -- trim
1816 * the suffix off the path to form the
1817 * proper .PREFIX variable.
1819 int savep = strlen(gn->path) -
1820 targ->suff->nameLen;
1824 gn->suffix->refCount--;
1825 gn->suffix = targ->suff;
1826 gn->suffix->refCount++;
1828 savec = gn->path[savep];
1829 gn->path[savep] = '\0';
1831 if ((ptr = strrchr(gn->path, '/')) != NULL)
1836 Var_Set(PREFIX, ptr, gn);
1838 gn->path[savep] = savec;
1841 * The .PREFIX gets the full path if
1842 * the target has no known suffix.
1845 gn->suffix->refCount--;
1848 if ((ptr = strrchr(gn->path, '/')) != NULL)
1853 Var_Set(PREFIX, ptr, gn);
1858 * Not appropriate to search for the thing -- set the
1859 * path to be the name so Dir_MTime won't go
1860 * grovelling for it.
1863 gn->suffix->refCount--;
1864 gn->suffix = (targ == NULL) ? NULL : targ->suff;
1866 gn->suffix->refCount++;
1868 gn->path = estrdup(gn->name);
1875 * If the suffix indicates that the target is a library, mark that in
1876 * the node's type field.
1878 if (targ->suff->flags & SUFF_LIBRARY) {
1883 * Check for overriding transformation rule implied by sources
1885 if (!Lst_IsEmpty(&gn->children)) {
1886 src = SuffFindCmds(targ, slst);
1890 * Free up all the Src structures in the
1891 * transformation path up to, but not including,
1894 while (bottom && bottom->parent != NULL) {
1895 if (Lst_Member(slst, bottom) == NULL) {
1896 Lst_AtEnd(slst, bottom);
1898 bottom = bottom->parent;
1904 if (bottom == NULL) {
1906 * No idea from where it can come -- return now.
1912 * We now have a list of Src structures headed by 'bottom' and linked
1913 * via their 'parent' pointers. What we do next is create links between
1914 * source and target nodes (which may or may not have been created)
1915 * and set the necessary local variables in each target. The
1916 * commands for each target are set from the commands of the
1917 * transformation rule used to get from the src suffix to the targ
1918 * suffix. Note that this causes the commands list of the original
1919 * node, gn, to be replaced by the commands of the final
1920 * transformation rule. Also, the unmade field of gn is incremented.
1923 if (bottom->node == NULL) {
1924 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
1927 for (src = bottom; src->parent != NULL; src = src->parent) {
1930 if (src->node->suffix)
1931 src->node->suffix->refCount--;
1932 src->node->suffix = src->suff;
1933 src->node->suffix->refCount++;
1935 if (targ->node == NULL) {
1936 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
1939 SuffApplyTransform(targ->node, src->node,
1940 targ->suff, src->suff);
1942 if (targ->node != gn) {
1944 * Finish off the dependency-search process for any
1945 * nodes between bottom and gn (no point in questing
1946 * around the filesystem for their implicit source
1947 * when it's already known). Note that the node can't
1948 * have any sources that need expanding, since
1949 * SuffFindThem will stop on an existing
1950 * node, so all we need to do is set the standard and
1951 * System V variables.
1953 targ->node->type |= OP_DEPS_FOUND;
1955 Var_Set(PREFIX, targ->pref, targ->node);
1956 Var_Set(TARGET, targ->node->name, targ->node);
1961 gn->suffix->refCount--;
1962 gn->suffix = src->suff;
1963 gn->suffix->refCount++;
1966 * So Dir_MTime doesn't go questing for it...
1969 gn->path = estrdup(gn->name);
1972 * Nuke the transformation path and the Src structures left over in the
1977 if (Lst_Member(slst, bottom) == NULL)
1978 Lst_AtEnd(slst, bottom);
1980 while (SuffRemoveSrc(&srcs) || SuffRemoveSrc(&targs))
1983 Lst_Concat(slst, &srcs, LST_CONCLINK);
1984 Lst_Concat(slst, &targs, LST_CONCLINK);
1988 *-----------------------------------------------------------------------
1990 * Find implicit sources for the target described by the graph node
1997 * Nodes are added to the graph below the passed-in node. The nodes
1998 * are marked to have their IMPSRC variable filled in. The
1999 * PREFIX variable is set for the given node and all its
2003 * The path found by this target is the shortest path in the
2004 * transformation graph, which may pass through non-existent targets,
2005 * to an existing target. The search continues on all paths from the
2006 * root suffix until a file is found. I.e. if there's a path
2007 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2008 * the .c and .l files don't, the search will branch out in
2009 * all directions from .o and again from all the nodes on the
2010 * next level until the .l,v node is encountered.
2012 *-----------------------------------------------------------------------
2015 Suff_FindDeps(GNode *gn)
2018 SuffFindDeps(gn, &srclist);
2019 while (SuffRemoveSrc(&srclist))
2025 SuffFindDeps(GNode *gn, Lst *slst)
2028 if (gn->type & OP_DEPS_FOUND) {
2030 * If dependencies already found, no need to do it again...
2034 gn->type |= OP_DEPS_FOUND;
2037 DEBUGF(SUFF, ("SuffFindDeps (%s)\n", gn->name));
2039 if (gn->type & OP_ARCHV) {
2040 SuffFindArchiveDeps(gn, slst);
2042 } else if (gn->type & OP_LIB) {
2044 * If the node is a library, it is the arch module's job to find
2045 * it and set the TARGET variable accordingly. We merely provide
2046 * the search path, assuming all libraries end in ".a" (if the
2047 * suffix hasn't been defined, there's nothing we can do for it,
2048 * so we just set the TARGET variable to the node's name in order
2049 * to give it a value).
2053 s = SuffSuffFind(LIBSUFF);
2055 gn->suffix->refCount--;
2058 gn->suffix->refCount++;
2059 Arch_FindLib(gn, &s->searchPath);
2062 Var_Set(TARGET, gn->name, gn);
2066 * Because a library (-lfoo) target doesn't follow the standard
2067 * filesystem conventions, we don't set the regular variables for
2068 * the thing. .PREFIX is simply made empty...
2070 Var_Set(PREFIX, "", gn);
2073 SuffFindNormalDeps(gn, slst);
2078 *-----------------------------------------------------------------------
2080 * Define which suffix is the null suffix.
2086 * 'suffNull' is altered.
2089 * Need to handle the changing of the null suffix gracefully so the
2090 * old transformation rules don't just go away.
2092 *-----------------------------------------------------------------------
2095 Suff_SetNull(char *name)
2099 if ((s = SuffSuffFind(name)) == NULL) {
2100 Parse_Error(PARSE_WARNING, "Desired null suffix %s "
2101 "not defined.", name);
2105 if (suffNull != NULL) {
2106 suffNull->flags &= ~SUFF_NULL;
2108 s->flags |= SUFF_NULL;
2111 * XXX: Here's where the transformation mangling
2118 *-----------------------------------------------------------------------
2120 * Initialize suffixes module
2127 *-----------------------------------------------------------------------
2135 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2136 * actually go on the suffix list or everyone will think that's its
2139 emptySuff = suffNull = emalloc(sizeof(Suff));
2141 suffNull->name = estrdup("");
2142 suffNull->nameLen = 0;
2143 TAILQ_INIT(&suffNull->searchPath);
2144 Path_Concat(&suffNull->searchPath, &dirSearchPath);
2145 Lst_Init(&suffNull->children);
2146 Lst_Init(&suffNull->parents);
2147 Lst_Init(&suffNull->ref);
2148 suffNull->sNum = sNum++;
2149 suffNull->flags = SUFF_NULL;
2150 suffNull->refCount = 1;
2153 /********************* DEBUGGING FUNCTIONS **********************/
2163 static const struct flag2str suff_flags[] = {
2164 { SUFF_INCLUDE, "INCLUDE" },
2165 { SUFF_LIBRARY, "LIBRARY" },
2166 { SUFF_NULL, "NULL" },
2170 printf("#*** Suffixes:\n");
2171 LST_FOREACH(ln, &sufflist) {
2173 printf("# `%s' [%d] ", s->name, s->refCount);
2175 if (s->flags != 0) {
2177 print_flags(stdout, suff_flags, s->flags, 1);
2180 printf("\n#\tTo: ");
2181 LST_FOREACH(tln, &s->parents)
2182 printf("`%s' ", ((const Suff *)Lst_Datum(tln))->name);
2184 printf("\n#\tFrom: ");
2185 LST_FOREACH(tln, &s->children)
2186 printf("`%s' ", ((const Suff *)Lst_Datum(tln))->name);
2188 printf("\n#\tSearch Path: ");
2189 Path_Print(&s->searchPath);
2194 printf("#*** Transformations:\n");
2195 LST_FOREACH(ln, &transforms) {
2197 printf("%-16s: ", gn->name);
2198 Targ_PrintType(gn->type);
2200 LST_FOREACH(tln, &gn->commands)
2201 printf("\t%s\n", (const char *)Lst_Datum(tln));