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
39 * $FreeBSD: src/usr.bin/make/suff.c,v 1.43 2005/02/04 13:23:39 harti Exp $
40 * $DragonFly: src/usr.bin/make/suff.c,v 1.60 2005/05/20 11:48:55 okumoto Exp $
45 * Functions to maintain suffix lists and find implicit dependents
46 * using suffix transformation rules
49 * Suff_Init Initialize all things to do with suffixes.
51 * Suff_DoPaths This function is used to make life easier
52 * when searching for a file according to its
53 * suffix. It takes the global search path,
54 * as defined using the .PATH: target, and appends
55 * its directories to the path of each of the
56 * defined suffixes, as specified using
57 * .PATH<suffix>: targets. In addition, all
58 * directories given for suffixes labeled as
59 * include files or libraries, using the .INCLUDES
60 * or .LIBS targets, are played with using
61 * Dir_MakeFlags to create the .INCLUDES and
62 * .LIBS global variables.
64 * Suff_ClearSuffixes Clear out all the suffixes and defined
67 * Suff_IsTransform Return TRUE if the passed string is the lhs
68 * of a transformation rule.
70 * Suff_AddSuffix Add the passed string as another known suffix.
72 * Suff_GetPath Return the search path for the given suffix.
74 * Suff_AddInclude Mark the given suffix as denoting an include
77 * Suff_AddLib Mark the given suffix as denoting a library.
79 * Suff_AddTransform Add another transformation to the suffix
80 * graph. Returns GNode suitable for framing, I
81 * mean, tacking commands, attributes, etc. on.
83 * Suff_SetNull Define the suffix to consider the suffix of
84 * any file that doesn't have a known one.
86 * Suff_FindDeps Find implicit sources for and the location of
87 * a target based on its suffix. Returns the
88 * bottom-most node added to the graph or NULL
89 * if the target had no implicit sources.
92 #include <sys/queue.h>
112 /* Lst of suffixes */
113 static Lst sufflist = Lst_Initializer(sufflist);
115 /* Lst of suffixes to be cleaned */
116 static Lst suffClean = Lst_Initializer(suffClean);
119 static Lst srclist = Lst_Initializer(srclist);
121 /* Lst of transformation rules */
122 static Lst transforms = Lst_Initializer(transforms);
124 /* Counter for assigning suffix numbers */
128 * Structure describing an individual suffix.
130 typedef struct Suff {
131 char *name; /* The suffix itself */
132 int nameLen; /* Length of the suffix */
133 short flags; /* Type of suffix */
134 #define SUFF_INCLUDE 0x01 /* One which is #include'd */
135 #define SUFF_LIBRARY 0x02 /* One which contains a library */
136 #define SUFF_NULL 0x04 /* The empty suffix */
137 struct Path searchPath; /* Path for files with this suffix */
138 int sNum; /* The suffix number */
139 int refCount; /* Reference count of list membership */
140 Lst parents; /* Suffixes we have a transformation to */
141 Lst children; /* Suffixes we have a transformation from */
142 Lst ref; /* List of lists this suffix is referenced */
146 * Structure used in the search for implied sources.
149 char *file; /* The file to look for */
150 char *pref; /* Prefix from which file was formed */
151 Suff *suff; /* The suffix on the file */
152 struct Src *parent; /* The Src for which this is a source */
153 GNode *node; /* The node describing the file */
154 int children; /* Count of existing children (so we don't free
155 * this thing too early or never nuke it) */
157 Lst cp; /* Debug; children list */
161 /* The NULL suffix for this run */
162 static Suff *suffNull;
164 /* The empty suffix required for POSIX single-suffix transformation rules */
165 static Suff *emptySuff;
167 static void SuffFindDeps(GNode *, Lst *);
171 *-----------------------------------------------------------------------
172 * SuffSuffIsSuffix --
173 * See if suff is a suffix of str.
176 * NULL if it ain't, pointer to character in str before suffix if
181 *-----------------------------------------------------------------------
184 SuffSuffIsSuffix(const Suff *s, char *str)
186 const char *p1; /* Pointer into suffix name */
187 char *p2; /* Pointer into string being examined */
191 p1 = s->name + s->nameLen;
194 while (p1 >= s->name && len > 0 && *p1 == *p2) {
200 return (p1 == s->name - 1 ? p2 : NULL);
204 *-----------------------------------------------------------------------
206 * Find a suffix given its name.
209 * The suffix or NULL.
213 *-----------------------------------------------------------------------
216 SuffSuffFind(const char *s)
220 LST_FOREACH(ln, &sufflist) {
221 if (strcmp(s, ((const Suff *)Lst_Datum(ln))->name) == 0)
222 return (Lst_Datum(ln));
228 *-----------------------------------------------------------------------
237 *-----------------------------------------------------------------------
240 SuffTransFind(const char *name)
244 LST_FOREACH(ln, &transforms) {
245 if (strcmp(name, ((const GNode *)Lst_Datum(ln))->name) == 0)
246 return (Lst_Datum(ln));
251 /*********** Maintenance Functions ************/
255 * Keep this function for now until it is clear why a .SUFFIXES: doesn't
256 * actually delete the suffixes but just puts them on the suffClean list.
259 *-----------------------------------------------------------------------
261 * Free up all memory associated with the given suffix structure.
267 * the suffix entry is detroyed
268 *-----------------------------------------------------------------------
281 Lst_Destroy(&s->ref, NOFREE);
282 Lst_Destroy(&s->children, NOFREE);
283 Lst_Destroy(&s->parents, NOFREE);
284 Lst_Destroy(&s->searchPath, Dir_Destroy);
292 *-----------------------------------------------------------------------
294 * Remove the suffix into the list
300 * The reference count for the suffix is decremented
301 *-----------------------------------------------------------------------
304 SuffRemove(Lst *l, Suff *s)
306 LstNode *ln = Lst_Member(l, s);
315 *-----------------------------------------------------------------------
317 * Insert the suffix into the list keeping the list ordered by suffix
324 * The reference count of the suffix is incremented
325 *-----------------------------------------------------------------------
328 SuffInsert(Lst *l, Suff *s)
330 LstNode *ln; /* current element in l we're examining */
331 Suff *s2; /* the suffix descriptor in this element */
334 for (ln = Lst_First(l); ln != NULL; ln = Lst_Succ(ln)) {
336 if (s2->sNum >= s->sNum)
340 DEBUGF(SUFF, ("inserting an empty list?..."));
343 DEBUGF(SUFF, ("inserting %s(%d)...", s->name, s->sNum));
345 DEBUGF(SUFF, ("at end of list\n"));
348 Lst_AtEnd(&s->ref, l);
349 } else if (s2->sNum != s->sNum) {
350 DEBUGF(SUFF, ("before %s(%d)\n", s2->name, s2->sNum));
351 Lst_Insert(l, ln, s);
353 Lst_AtEnd(&s->ref, l);
355 DEBUGF(SUFF, ("already there\n"));
360 *-----------------------------------------------------------------------
361 * Suff_ClearSuffixes --
362 * This is gross. Nuke the list of suffixes but keep all transformation
363 * rules around. The transformation graph is destroyed in this process,
364 * but we leave the list of rules so when a new graph is formed the rules
366 * This function is called from the parse module when a
367 * .SUFFIXES:\n line is encountered.
373 * the sufflist and its graph nodes are destroyed
374 *-----------------------------------------------------------------------
377 Suff_ClearSuffixes(void)
380 Lst_Concat(&suffClean, &sufflist, LST_CONCLINK);
383 suffNull = emptySuff;
385 * Clear suffNull's children list (the other suffixes are built new, but
386 * suffNull is used as is).
387 * NOFREE is used because all suffixes are are on the suffClean list.
388 * suffNull should not have parents.
390 Lst_Destroy(&suffNull->children, NOFREE);
394 *-----------------------------------------------------------------------
395 * SuffParseTransform --
396 * Parse a transformation string to find its two component suffixes.
399 * TRUE if the string is a valid transformation and FALSE otherwise.
402 * The passed pointers are overwritten.
404 *-----------------------------------------------------------------------
407 SuffParseTransform(char *str, Suff **srcPtr, Suff **targPtr)
409 LstNode *srcLn; /* element in suffix list of trans source*/
410 Suff *src; /* Source of transformation */
411 char *str2; /* Extra pointer (maybe target suffix) */
412 LstNode *singleLn; /* element in suffix list of any suffix
413 * that exactly matches str */
414 Suff *single = NULL; /* Source of possible transformation to
420 * Loop looking first for a suffix that matches the start of the
421 * string and then for one that exactly matches the rest of it. If
422 * we can find two that meet these criteria, we've successfully
425 srcLn = Lst_First(&sufflist);
427 /* advance to next possible suffix */
428 while (srcLn != NULL) {
429 src = Lst_Datum(srcLn);
430 if (strncmp(str, src->name, strlen(src->name)) == 0)
432 srcLn = LST_NEXT(srcLn);
437 * Ran out of source suffixes -- no such rule
439 if (singleLn != NULL) {
441 * Not so fast Mr. Smith! There was a suffix
442 * that encompassed the entire string, so we
443 * assume it was a transformation to the null
444 * suffix (thank you POSIX). We still prefer to
445 * find a double rule over a singleton, hence we
446 * leave this check until the end.
448 * XXX: Use emptySuff over suffNull?
456 str2 = str + src->nameLen;
462 *targPtr = SuffSuffFind(str2);
463 if (*targPtr != NULL) {
469 srcLn = LST_NEXT(srcLn);
474 *-----------------------------------------------------------------------
475 * Suff_IsTransform --
476 * Return TRUE if the given string is a transformation rule
480 * TRUE if the string is a concatenation of two known suffixes.
485 *-----------------------------------------------------------------------
488 Suff_IsTransform(char *str)
492 return (SuffParseTransform(str, &src, &targ));
496 *-----------------------------------------------------------------------
497 * Suff_AddTransform --
498 * Add the transformation rule described by the line to the
499 * list of rules and place the transformation itself in the graph
502 * The node created for the transformation in the transforms list
505 * The node is placed on the end of the transforms Lst and links are
506 * made between the two suffixes mentioned in the target name
507 *-----------------------------------------------------------------------
510 Suff_AddTransform(char *line)
512 GNode *gn; /* GNode of transformation rule */
513 Suff *s; /* source suffix */
514 Suff *t; /* target suffix */
516 gn = SuffTransFind(line);
519 * Make a new graph node for the transformation.
520 * It will be filled in by the Parse module.
522 gn = Targ_NewGN(line);
523 Lst_AtEnd(&transforms, gn);
526 * New specification for transformation rule. Just nuke the
527 * old list of commands so they can be filled in again...
528 * We don't actually free the commands themselves, because a
529 * given command can be attached to several different
532 Lst_Destroy(&gn->commands, NOFREE);
533 Lst_Destroy(&gn->children, NOFREE);
536 gn->type = OP_TRANSFORM;
538 SuffParseTransform(line, &s, &t);
541 * link the two together in the proper relationship and order
543 DEBUGF(SUFF, ("defining transformation from `%s' to `%s'\n",
545 SuffInsert(&t->children, s);
546 SuffInsert(&s->parents, t);
552 *-----------------------------------------------------------------------
553 * Suff_EndTransform --
554 * Handle the finish of a transformation definition, removing the
555 * transformation from the graph if it has neither commands nor
556 * sources. This is called from the Parse module at the end of
557 * a dependency block.
560 * If the node has no commands or children, the children and parents
561 * lists of the affected suffices are altered.
563 *-----------------------------------------------------------------------
566 Suff_EndTransform(const GNode *gn)
570 if (!Lst_IsEmpty(&gn->commands) || !Lst_IsEmpty(&gn->children)) {
571 DEBUGF(SUFF, ("transformation %s complete\n", gn->name));
576 * SuffParseTransform() may fail for special rules which are not
577 * actual transformation rules (e.g., .DEFAULT).
579 if (!SuffParseTransform(gn->name, &s, &t))
582 DEBUGF(SUFF, ("deleting transformation from `%s' to `%s'\n",
586 * Remove the source from the target's children list. We check
587 * for a NULL return to handle a beanhead saying something like
590 * We'll be called twice when the next target is seen, but .c
591 * and .o are only linked once...
593 SuffRemove(&t->children, s);
596 * Remove the target from the source's parents list
598 SuffRemove(&s->parents, t);
602 *-----------------------------------------------------------------------
603 * SuffRebuildGraph --
604 * Called from Suff_AddSuffix via LST_FOREACH to search through the
605 * list of existing transformation rules and rebuild the transformation
606 * graph when it has been destroyed by Suff_ClearSuffixes. If the
607 * given rule is a transformation involving this suffix and another,
608 * existing suffix, the proper relationship is established between
612 * The appropriate links will be made between this suffix and
613 * others if transformation rules exist for it.
615 *-----------------------------------------------------------------------
618 SuffRebuildGraph(const GNode *transform, Suff *s)
624 * First see if it is a transformation from this suffix.
626 if (strncmp(transform->name, s->name, strlen(s->name)) == 0) {
627 cp = transform->name + strlen(s->name);
629 if (cp[0] == '\0') /* null rule */
632 s2 = SuffSuffFind(cp);
635 * Found target. Link in and return, since it can't be
638 SuffInsert(&s2->children, s);
639 SuffInsert(&s->parents, s2);
645 * Not from, maybe to?
647 cp = SuffSuffIsSuffix(s, transform->name);
650 * Null-terminate the source suffix in order to find it.
653 s2 = SuffSuffFind(transform->name);
656 * Replace the start of the target suffix
661 * Found it -- establish the proper relationship
663 SuffInsert(&s->children, s2);
664 SuffInsert(&s2->parents, s);
670 *-----------------------------------------------------------------------
672 * Add the suffix in string to the end of the list of known suffixes.
673 * Should we restructure the suffix graph? Make doesn't...
679 * A GNode is created for the suffix and a Suff structure is created and
680 * added to the suffixes list unless the suffix was already known.
681 *-----------------------------------------------------------------------
684 Suff_AddSuffix(char *str)
686 Suff *s; /* new suffix descriptor */
689 if (SuffSuffFind(str) != NULL)
695 s = emalloc(sizeof(Suff));
697 s->name = estrdup(str);
698 s->nameLen = strlen(s->name);
699 TAILQ_INIT(&s->searchPath);
700 Lst_Init(&s->children);
701 Lst_Init(&s->parents);
707 Lst_AtEnd(&sufflist, s);
710 * Look for any existing transformations from or to this suffix.
711 * XXX: Only do this after a Suff_ClearSuffixes?
713 LST_FOREACH(ln, &transforms)
714 SuffRebuildGraph(Lst_Datum(ln), s);
718 *-----------------------------------------------------------------------
720 * Return the search path for the given suffix, if it's defined.
723 * The searchPath for the desired suffix or NULL if the suffix isn't
728 *-----------------------------------------------------------------------
731 Suff_GetPath(char *sname)
735 s = SuffSuffFind(sname);
738 return (&s->searchPath);
742 *-----------------------------------------------------------------------
744 * Extend the search paths for all suffixes to include the default
751 * The searchPath field of all the suffixes is extended by the
752 * directories in dirSearchPath. If paths were specified for the
753 * ".h" suffix, the directories are stuffed into a global variable
754 * called ".INCLUDES" with each directory preceded by a -I. The same
755 * is done for the ".a" suffix, except the variable is called
756 * ".LIBS" and the flag is -L.
757 *-----------------------------------------------------------------------
765 struct Path inIncludes; /* Cumulative .INCLUDES path */
766 struct Path inLibs; /* Cumulative .LIBS path */
768 TAILQ_INIT(&inIncludes);
771 for (ln = Lst_First(&sufflist); ln != NULL; ln = Lst_Succ(ln)) {
774 if (s->flags & SUFF_INCLUDE) {
775 Path_Concat(&inIncludes, &s->searchPath);
777 #endif /* INCLUDES */
779 if (s->flags & SUFF_LIBRARY) {
780 Path_Concat(&inLibs, &s->searchPath);
782 #endif /* LIBRARIES */
783 Path_Concat(&s->searchPath, &dirSearchPath);
786 ptr = Path_MakeFlags("-I", &inIncludes);
787 Var_Set(".INCLUDES", ptr, VAR_GLOBAL);
790 ptr = Path_MakeFlags("-L", &inLibs);
791 Var_Set(".LIBS", ptr, VAR_GLOBAL);
794 Path_Clear(&inIncludes);
799 *-----------------------------------------------------------------------
801 * Add the given suffix as a type of file which gets included.
802 * Called from the parse module when a .INCLUDES line is parsed.
803 * The suffix must have already been defined.
809 * The SUFF_INCLUDE bit is set in the suffix's flags field
811 *-----------------------------------------------------------------------
814 Suff_AddInclude(char *sname)
818 if ((s = SuffSuffFind(sname)) != NULL)
819 s->flags |= SUFF_INCLUDE;
823 *-----------------------------------------------------------------------
825 * Add the given suffix as a type of file which is a library.
826 * Called from the parse module when parsing a .LIBS line. The
827 * suffix must have been defined via .SUFFIXES before this is
834 * The SUFF_LIBRARY bit is set in the suffix's flags field
836 *-----------------------------------------------------------------------
839 Suff_AddLib(char *sname)
843 if ((s = SuffSuffFind(sname)) != NULL)
844 s->flags |= SUFF_LIBRARY;
848 * Create a new Src structure
851 SuffSrcCreate(char *file, char *prefix, Suff *suff, Src *parent, GNode *node)
855 s = emalloc(sizeof(*s));
870 /********** Implicit Source Search Functions *********/
873 *-----------------------------------------------------------------------
875 * Add all the children of targ as Src structures to the given list:
876 * Add a suffix as a Src structure to the given list with its parent
877 * being the given Src structure. If the suffix is the null suffix,
878 * the prefix is used unaltered as the file name in the Src structure.
884 * Lots of structures are created and added to the list
885 *-----------------------------------------------------------------------
888 SuffAddLevel(Lst *l, Src *targ)
897 LST_FOREACH(ln, &targ->suff->children) {
898 suff = Lst_Datum(ln);
900 if ((suff->flags & SUFF_NULL) && *suff->name != '\0') {
902 * If the suffix has been marked as the NULL suffix,
903 * also create a Src structure for a file with no suffix
904 * attached. Two birds, and all that...
906 s2 = SuffSrcCreate(estrdup(targ->pref), targ->pref,
912 Lst_AtEnd(&targ->cp, s2);
913 printf("1 add %p %p to %p:", targ, s2, l);
915 printf("%p ", (const void *)Lst_Datum(ln1));
920 str_concat(targ->pref, '\0', suff->name),
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.
1176 for (start = cp; *start == ' ' || *start == '\t'; start++)
1179 for (cp = start; *cp != '\0'; cp++) {
1180 if (*cp == ' ' || *cp == '\t') {
1182 * White-space -- terminate element, find the node,
1183 * add it, skip any further spaces.
1186 Lst_AtEnd(members, Targ_FindNode(start, TARG_CREATE));
1188 while (*cp == ' ' || *cp == '\t') {
1192 * Adjust cp for increment at
1193 * start of loop, but set start
1194 * to first non-space.
1198 } else if (*cp == '$') {
1200 * Start of a variable spec -- contact variable module
1201 * to find the end so we can skip over it.
1207 junk = Var_Parse(cp, parent, TRUE, &len, &doFree);
1208 if (junk != var_Error) {
1215 } else if (*cp == '\\' && *cp != '\0') {
1217 * Escaped something -- skip over it
1225 * Stuff left over -- add it to the
1228 Lst_AtEnd(members, Targ_FindNode(start, TARG_CREATE));
1231 Buf_Destroy(buf, TRUE);
1235 * The child node contains wildcards. Expand them and return a list of
1239 SuffExpandWildcards(GNode *child, Lst *members)
1242 Lst exp; /* List of expansions */
1244 struct Path *path; /* Search path along which to expand */
1249 * Find a path along which to expand the word.
1251 * If the word has a known suffix, use that path.
1252 * If it has no known suffix and we're allowed to use the null
1253 * suffix, use its path.
1254 * Else use the default system search path.
1256 LST_FOREACH(ln, &sufflist) {
1257 if (SuffSuffIsSuffix(Lst_Datum(ln), child->name) != NULL)
1261 DEBUGF(SUFF, ("Wildcard expanding \"%s\"...", child->name));
1264 Suff *s = Lst_Datum(ln);
1266 DEBUGF(SUFF, ("suffix is \"%s\"...", s->name));
1267 path = &s->searchPath;
1270 * Use default search path
1272 path = &dirSearchPath;
1276 * Expand the word along the chosen path
1279 Path_Expand(child->name, path, &exp);
1281 while (!Lst_IsEmpty(&exp)) {
1283 * Fetch next expansion off the list and find its GNode
1285 cp = Lst_DeQueue(&exp);
1287 DEBUGF(SUFF, ("%s...", cp));
1288 Lst_AtEnd(members, Targ_FindNode(cp, TARG_CREATE));
1293 *-----------------------------------------------------------------------
1294 * SuffExpandChildren --
1295 * Expand the names of any children of a given node that contain
1296 * variable invocations or file wildcards into actual targets.
1302 * The expanded node is removed from the parent's list of children,
1303 * and the parent's unmade counter is decremented, but other nodes
1306 *-----------------------------------------------------------------------
1309 SuffExpandChildren(GNode *parent, LstNode *current)
1311 GNode *cchild; /* current child */
1313 LstNode *prev; /* node after which to append new source */
1314 Lst members; /* expanded nodes */
1316 if (current == NULL) {
1317 /* start from begin of parent's children list */
1318 current = Lst_First(&parent->children);
1321 while (current != NULL) {
1322 cchild = Lst_Datum(current);
1325 * First do variable expansion -- this takes precedence over
1326 * wildcard expansion. If the result contains wildcards, they'll
1327 * be gotten to later since the resulting words are tacked
1328 * instead of the current child onto the children list.
1330 * XXXHB what if cchild contains lib.a(t1.o t2.o t3.o) but
1333 if (strchr(cchild->name, '$') != NULL) {
1334 SuffExpandVariables(parent, cchild, &members);
1336 } else if (Dir_HasWildcards(cchild->name)) {
1337 SuffExpandWildcards(cchild, &members);
1340 /* nothing special just advance to next child */
1341 current = LST_NEXT(current);
1346 * New nodes effectively take the place of the child,
1347 * so place them after the child
1352 * Add all new elements to the parent node if they aren't
1353 * already children of it.
1355 while(!Lst_IsEmpty(&members)) {
1356 gn = Lst_DeQueue(&members);
1358 DEBUGF(SUFF, ("%s...", gn->name));
1359 if (Lst_Member(&parent->children, gn) == NULL) {
1360 Lst_Append(&parent->children, prev, gn);
1361 prev = Lst_Succ(prev);
1362 Lst_AtEnd(&gn->parents, parent);
1368 * Now the source is expanded, remove it from the list
1369 * of children to keep it from being processed.
1370 * Advance to the next child.
1373 current = LST_NEXT(current);
1376 Lst_Remove(&parent->children, prev);
1377 DEBUGF(SUFF, ("\n"));
1382 *-----------------------------------------------------------------------
1383 * SuffApplyTransform --
1384 * Apply a transformation rule, given the source and target nodes
1388 * TRUE if successful, FALSE if not.
1391 * The source and target are linked and the commands from the
1392 * transformation are added to the target node's commands list.
1393 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1394 * to the target. The target also inherits all the sources for
1395 * the transformation rule.
1397 *-----------------------------------------------------------------------
1400 SuffApplyTransform(GNode *tGn, GNode *sGn, Suff *t, Suff *s)
1402 LstNode *ln; /* General node */
1403 char *tname; /* Name of transformation rule */
1404 GNode *gn; /* Node for same */
1406 if (Lst_Member(&tGn->children, sGn) == NULL) {
1408 * Not already linked, so form the proper links between the
1409 * target and source.
1411 Lst_AtEnd(&tGn->children, sGn);
1412 Lst_AtEnd(&sGn->parents, tGn);
1416 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1418 * When a :: node is used as the implied source of a node,
1419 * we have to link all its cohorts in as sources as well. Only
1420 * the initial sGn gets the target in its iParents list, however
1421 * as that will be sufficient to get the .IMPSRC variable set
1424 for (ln = Lst_First(&sGn->cohorts); ln != NULL;
1425 ln = Lst_Succ(ln)) {
1428 if (Lst_Member(&tGn->children, gn) == NULL) {
1430 * Not already linked, so form the proper
1431 * links between the target and source.
1433 Lst_AtEnd(&tGn->children, gn);
1434 Lst_AtEnd(&gn->parents, tGn);
1440 * Locate the transformation rule itself
1442 tname = str_concat(s->name, '\0', t->name);
1443 gn = SuffTransFind(tname);
1448 * Not really such a transformation rule (can happen when we're
1449 * called to link an OP_MEMBER and OP_ARCHV node), so return
1455 DEBUGF(SUFF, ("\tapplying %s -> %s to \"%s\"\n",
1456 s->name, t->name, tGn->name));
1459 * Record last child for expansion purposes
1461 ln = Lst_Last(&tGn->children);
1464 * Pass the buck to Make_HandleUse to apply the rule
1466 Make_HandleUse(gn, tGn);
1469 * Deal with wildcards and variables in any acquired sources
1473 SuffExpandChildren(tGn, ln);
1477 * Keep track of another parent to which this beast is transformed so
1478 * the .IMPSRC variable can be set correctly for the parent.
1480 Lst_AtEnd(&sGn->iParents, tGn);
1487 *-----------------------------------------------------------------------
1488 * SuffFindArchiveDeps --
1489 * Locate dependencies for an OP_ARCHV node.
1495 * Same as Suff_FindDeps
1497 *-----------------------------------------------------------------------
1500 SuffFindArchiveDeps(GNode *gn, Lst *slst)
1502 char *eoarch; /* End of archive portion */
1503 char *eoname; /* End of member portion */
1504 char *name; /* Start of member's name */
1505 GNode *mem; /* Node for member */
1506 Suff *ms; /* Suffix descriptor for member */
1509 * The node is an archive(member) pair. so we must find a
1510 * suffix for both of them.
1512 eoarch = strchr(gn->name, '(');
1513 eoname = strchr(eoarch, ')');
1515 *eoname = '\0'; /* Nuke parentheses during suffix search */
1516 *eoarch = '\0'; /* So a suffix can be found */
1521 * To simplify things, call Suff_FindDeps recursively on the member now,
1522 * so we can simply compare the member's .PREFIX and .TARGET variables
1523 * to locate its suffix. This allows us to figure out the suffix to
1524 * use for the archive without having to do a quadratic search over the
1525 * suffix list, backtracking for each one...
1527 mem = Targ_FindNode(name, TARG_CREATE);
1528 SuffFindDeps(mem, slst);
1531 * Create the link between the two nodes right off
1533 if (Lst_Member(&gn->children, mem) == NULL) {
1534 Lst_AtEnd(&gn->children, mem);
1535 Lst_AtEnd(&mem->parents, gn);
1540 * Copy in the variables from the member node to this one.
1542 Var_Set(PREFIX, Var_Value(PREFIX, mem), gn);
1543 Var_Set(TARGET, Var_Value(TARGET, mem), gn);
1548 * Didn't know what it was -- use .NULL suffix if not in
1551 DEBUGF(SUFF, ("using null suffix\n"));
1557 * Set the other two local variables required for this target.
1559 Var_Set(MEMBER, name, gn);
1560 Var_Set(ARCHIVE, gn->name, gn);
1564 * Member has a known suffix, so look for a transformation rule
1565 * from it to a possible suffix of the archive. Rather than
1566 * searching through the entire list, we just look at suffixes
1567 * to which the member's suffix may be transformed...
1572 * Use first matching suffix...
1574 LST_FOREACH(ln, &ms->parents) {
1575 if (SuffSuffIsSuffix(Lst_Datum(ln), gn->name) != NULL)
1581 * Got one -- apply it
1583 if (!SuffApplyTransform(gn, mem, Lst_Datum(ln), ms)) {
1584 DEBUGF(SUFF, ("\tNo transformation from "
1585 "%s -> %s\n", ms->name,
1586 ((Suff *)Lst_Datum(ln))->name));
1592 * Replace the opening and closing parens now we've no need
1593 * of the separate pieces.
1599 * Pretend gn appeared to the left of a dependency operator so
1600 * the user needn't provide a transformation from the member to the
1603 if (OP_NOP(gn->type)) {
1604 gn->type |= OP_DEPENDS;
1608 * Flag the member as such so we remember to look in the archive for
1609 * its modification time.
1611 mem->type |= OP_MEMBER;
1615 *-----------------------------------------------------------------------
1616 * SuffFindNormalDeps --
1617 * Locate implicit dependencies for regular targets.
1623 * Same as Suff_FindDeps...
1625 *-----------------------------------------------------------------------
1628 SuffFindNormalDeps(GNode *gn, Lst *slst)
1630 char *eoname; /* End of name */
1631 char *sopref; /* Start of prefix */
1632 LstNode *ln; /* Next suffix node to check */
1633 Lst srcs; /* List of sources at which to look */
1634 Lst targs; /* List of targets to which things can be
1635 * transformed. They all have the same file,
1636 * but different suff and pref fields */
1637 Src *bottom; /* Start of found transformation path */
1638 Src *src; /* General Src pointer */
1639 char *pref; /* Prefix to use */
1640 Src *targ; /* General Src target pointer */
1642 eoname = gn->name + strlen(gn->name);
1646 * Begin at the beginning...
1648 ln = Lst_First(&sufflist);
1653 * We're caught in a catch-22 here. On the one hand, we want to use any
1654 * transformation implied by the target's sources, but we can't examine
1655 * the sources until we've expanded any variables/wildcards they may
1656 * hold, and we can't do that until we've set up the target's local
1657 * variables and we can't do that until we know what the proper suffix
1658 * for the target is (in case there are two suffixes one of which is a
1659 * suffix of the other) and we can't know that until we've found its
1660 * implied source, which we may not want to use if there's an existing
1661 * source that implies a different transformation.
1663 * In an attempt to get around this, which may not work all the time,
1664 * but should work most of the time, we look for implied sources first,
1665 * checking transformations to all possible suffixes of the target,
1666 * use what we find to set the target's local variables, expand the
1667 * children, then look for any overriding transformations they imply.
1668 * Should we find one, we discard the one we found before.
1671 while (ln != NULL) {
1673 * Look for next possible suffix...
1675 while (ln != NULL) {
1676 if (SuffSuffIsSuffix(Lst_Datum(ln), gn->name) != NULL)
1682 int prefLen; /* Length of the prefix */
1686 * Allocate a Src structure to which things can be
1689 target = SuffSrcCreate(estrdup(gn->name), NULL,
1690 Lst_Datum(ln), NULL, gn);
1691 target->suff->refCount++;
1694 * Allocate room for the prefix, whose end is found
1695 * by subtracting the length of the suffix from
1696 * the end of the name.
1698 prefLen = (eoname - target->suff->nameLen) - sopref;
1699 assert(prefLen >= 0);
1700 target->pref = emalloc(prefLen + 1);
1701 memcpy(target->pref, sopref, prefLen);
1702 target->pref[prefLen] = '\0';
1705 * Add nodes from which the target can be made
1707 SuffAddLevel(&srcs, target);
1710 * Record the target so we can nuke it
1712 Lst_AtEnd(&targs, target);
1715 * Search from this suffix's successor...
1722 * Handle target of unknown suffix...
1724 if (Lst_IsEmpty(&targs) && suffNull != NULL) {
1725 DEBUGF(SUFF, ("\tNo known suffix on %s. Using .NULL suffix\n",
1728 targ = SuffSrcCreate(estrdup(gn->name), estrdup(sopref),
1729 suffNull, NULL, gn);
1730 targ->suff->refCount++;
1733 * Only use the default suffix rules if we don't have commands
1734 * or dependencies defined for this gnode
1736 if (Lst_IsEmpty(&gn->commands) && Lst_IsEmpty(&gn->children))
1737 SuffAddLevel(&srcs, targ);
1739 DEBUGF(SUFF, ("not "));
1742 DEBUGF(SUFF, ("adding suffix rules\n"));
1744 Lst_AtEnd(&targs, targ);
1748 * Using the list of possible sources built up from the target
1749 * suffix(es), try and find an existing file/target that matches.
1751 bottom = SuffFindThem(&srcs, slst);
1753 if (bottom == NULL) {
1755 * No known transformations -- use the first suffix found for
1756 * setting the local variables.
1758 if (!Lst_IsEmpty(&targs)) {
1759 targ = Lst_Datum(Lst_First(&targs));
1765 * Work up the transformation path to find the suffix of the
1766 * target to which the transformation was made.
1768 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1773 * The .TARGET variable we always set to be the name at this point,
1774 * since it's only set to the path if the thing is only a source and
1775 * if it's only a source, it doesn't matter what we put here as far
1776 * as expanding sources is concerned, since it has none...
1778 Var_Set(TARGET, gn->name, gn);
1780 pref = (targ != NULL) ? targ->pref : gn->name;
1781 Var_Set(PREFIX, pref, gn);
1784 * Now we've got the important local variables set, expand any sources
1785 * that still contain variables or wildcards in their names.
1787 SuffExpandChildren(gn, NULL);
1790 DEBUGF(SUFF, ("\tNo valid suffix on %s\n", gn->name));
1794 * Deal with finding the thing on the default search path if the
1795 * node is only a source (not on the lhs of a dependency
1796 * operator or [XXX] it has neither children or commands).
1798 if (OP_NOP(gn->type) || (Lst_IsEmpty(&gn->children) &&
1799 Lst_IsEmpty(&gn->commands))) {
1800 gn->path = Path_FindFile(gn->name,
1801 (targ == NULL ? &dirSearchPath :
1802 &targ->suff->searchPath));
1803 if (gn->path != NULL) {
1805 Var_Set(TARGET, gn->path, gn);
1809 * Suffix known for the thing -- trim
1810 * the suffix off the path to form the
1811 * proper .PREFIX variable.
1813 int savep = strlen(gn->path) -
1814 targ->suff->nameLen;
1818 gn->suffix->refCount--;
1819 gn->suffix = targ->suff;
1820 gn->suffix->refCount++;
1822 savec = gn->path[savep];
1823 gn->path[savep] = '\0';
1825 if ((ptr = strrchr(gn->path, '/')) != NULL)
1830 Var_Set(PREFIX, ptr, gn);
1832 gn->path[savep] = savec;
1835 * The .PREFIX gets the full path if
1836 * the target has no known suffix.
1839 gn->suffix->refCount--;
1842 if ((ptr = strrchr(gn->path, '/')) != NULL)
1847 Var_Set(PREFIX, ptr, gn);
1852 * Not appropriate to search for the thing -- set the
1853 * path to be the name so Dir_MTime won't go
1854 * grovelling for it.
1857 gn->suffix->refCount--;
1858 gn->suffix = (targ == NULL) ? NULL : targ->suff;
1860 gn->suffix->refCount++;
1862 gn->path = estrdup(gn->name);
1869 * If the suffix indicates that the target is a library, mark that in
1870 * the node's type field.
1872 if (targ->suff->flags & SUFF_LIBRARY) {
1877 * Check for overriding transformation rule implied by sources
1879 if (!Lst_IsEmpty(&gn->children)) {
1880 src = SuffFindCmds(targ, slst);
1884 * Free up all the Src structures in the
1885 * transformation path up to, but not including,
1888 while (bottom && bottom->parent != NULL) {
1889 if (Lst_Member(slst, bottom) == NULL) {
1890 Lst_AtEnd(slst, bottom);
1892 bottom = bottom->parent;
1898 if (bottom == NULL) {
1900 * No idea from where it can come -- return now.
1906 * We now have a list of Src structures headed by 'bottom' and linked
1907 * via their 'parent' pointers. What we do next is create links between
1908 * source and target nodes (which may or may not have been created)
1909 * and set the necessary local variables in each target. The
1910 * commands for each target are set from the commands of the
1911 * transformation rule used to get from the src suffix to the targ
1912 * suffix. Note that this causes the commands list of the original
1913 * node, gn, to be replaced by the commands of the final
1914 * transformation rule. Also, the unmade field of gn is incremented.
1917 if (bottom->node == NULL) {
1918 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
1921 for (src = bottom; src->parent != NULL; src = src->parent) {
1924 if (src->node->suffix)
1925 src->node->suffix->refCount--;
1926 src->node->suffix = src->suff;
1927 src->node->suffix->refCount++;
1929 if (targ->node == NULL) {
1930 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
1933 SuffApplyTransform(targ->node, src->node,
1934 targ->suff, src->suff);
1936 if (targ->node != gn) {
1938 * Finish off the dependency-search process for any
1939 * nodes between bottom and gn (no point in questing
1940 * around the filesystem for their implicit source
1941 * when it's already known). Note that the node can't
1942 * have any sources that need expanding, since
1943 * SuffFindThem will stop on an existing
1944 * node, so all we need to do is set the standard and
1945 * System V variables.
1947 targ->node->type |= OP_DEPS_FOUND;
1949 Var_Set(PREFIX, targ->pref, targ->node);
1950 Var_Set(TARGET, targ->node->name, targ->node);
1955 gn->suffix->refCount--;
1956 gn->suffix = src->suff;
1957 gn->suffix->refCount++;
1960 * So Dir_MTime doesn't go questing for it...
1963 gn->path = estrdup(gn->name);
1966 * Nuke the transformation path and the Src structures left over in the
1971 if (Lst_Member(slst, bottom) == NULL)
1972 Lst_AtEnd(slst, bottom);
1974 while (SuffRemoveSrc(&srcs) || SuffRemoveSrc(&targs))
1977 Lst_Concat(slst, &srcs, LST_CONCLINK);
1978 Lst_Concat(slst, &targs, LST_CONCLINK);
1982 *-----------------------------------------------------------------------
1984 * Find implicit sources for the target described by the graph node
1991 * Nodes are added to the graph below the passed-in node. The nodes
1992 * are marked to have their IMPSRC variable filled in. The
1993 * PREFIX variable is set for the given node and all its
1997 * The path found by this target is the shortest path in the
1998 * transformation graph, which may pass through non-existent targets,
1999 * to an existing target. The search continues on all paths from the
2000 * root suffix until a file is found. I.e. if there's a path
2001 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2002 * the .c and .l files don't, the search will branch out in
2003 * all directions from .o and again from all the nodes on the
2004 * next level until the .l,v node is encountered.
2006 *-----------------------------------------------------------------------
2009 Suff_FindDeps(GNode *gn)
2012 SuffFindDeps(gn, &srclist);
2013 while (SuffRemoveSrc(&srclist))
2019 SuffFindDeps(GNode *gn, Lst *slst)
2022 if (gn->type & OP_DEPS_FOUND) {
2024 * If dependencies already found, no need to do it again...
2028 gn->type |= OP_DEPS_FOUND;
2031 DEBUGF(SUFF, ("SuffFindDeps (%s)\n", gn->name));
2033 if (gn->type & OP_ARCHV) {
2034 SuffFindArchiveDeps(gn, slst);
2036 } else if (gn->type & OP_LIB) {
2038 * If the node is a library, it is the arch module's job to find
2039 * it and set the TARGET variable accordingly. We merely provide
2040 * the search path, assuming all libraries end in ".a" (if the
2041 * suffix hasn't been defined, there's nothing we can do for it,
2042 * so we just set the TARGET variable to the node's name in order
2043 * to give it a value).
2047 s = SuffSuffFind(LIBSUFF);
2049 gn->suffix->refCount--;
2052 gn->suffix->refCount++;
2053 Arch_FindLib(gn, &s->searchPath);
2056 Var_Set(TARGET, gn->name, gn);
2060 * Because a library (-lfoo) target doesn't follow the standard
2061 * filesystem conventions, we don't set the regular variables for
2062 * the thing. .PREFIX is simply made empty...
2064 Var_Set(PREFIX, "", gn);
2067 SuffFindNormalDeps(gn, slst);
2072 *-----------------------------------------------------------------------
2074 * Define which suffix is the null suffix.
2080 * 'suffNull' is altered.
2083 * Need to handle the changing of the null suffix gracefully so the
2084 * old transformation rules don't just go away.
2086 *-----------------------------------------------------------------------
2089 Suff_SetNull(char *name)
2093 if ((s = SuffSuffFind(name)) == NULL) {
2094 Parse_Error(PARSE_WARNING, "Desired null suffix %s "
2095 "not defined.", name);
2099 if (suffNull != NULL) {
2100 suffNull->flags &= ~SUFF_NULL;
2102 s->flags |= SUFF_NULL;
2105 * XXX: Here's where the transformation mangling
2112 *-----------------------------------------------------------------------
2114 * Initialize suffixes module
2121 *-----------------------------------------------------------------------
2129 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2130 * actually go on the suffix list or everyone will think that's its
2133 emptySuff = suffNull = emalloc(sizeof(Suff));
2135 suffNull->name = estrdup("");
2136 suffNull->nameLen = 0;
2137 TAILQ_INIT(&suffNull->searchPath);
2138 Path_Concat(&suffNull->searchPath, &dirSearchPath);
2139 Lst_Init(&suffNull->children);
2140 Lst_Init(&suffNull->parents);
2141 Lst_Init(&suffNull->ref);
2142 suffNull->sNum = sNum++;
2143 suffNull->flags = SUFF_NULL;
2144 suffNull->refCount = 1;
2147 /********************* DEBUGGING FUNCTIONS **********************/
2157 static const struct flag2str suff_flags[] = {
2158 { SUFF_INCLUDE, "INCLUDE" },
2159 { SUFF_LIBRARY, "LIBRARY" },
2160 { SUFF_NULL, "NULL" },
2164 printf("#*** Suffixes:\n");
2165 LST_FOREACH(ln, &sufflist) {
2167 printf("# `%s' [%d] ", s->name, s->refCount);
2169 if (s->flags != 0) {
2171 print_flags(stdout, suff_flags, s->flags, 1);
2174 printf("\n#\tTo: ");
2175 LST_FOREACH(tln, &s->parents)
2176 printf("`%s' ", ((const Suff *)Lst_Datum(tln))->name);
2178 printf("\n#\tFrom: ");
2179 LST_FOREACH(tln, &s->children)
2180 printf("`%s' ", ((const Suff *)Lst_Datum(tln))->name);
2182 printf("\n#\tSearch Path: ");
2183 Path_Print(&s->searchPath);
2188 printf("#*** Transformations:\n");
2189 LST_FOREACH(ln, &transforms) {
2191 printf("%-16s: ", gn->name);
2192 Targ_PrintType(gn->type);
2194 LST_FOREACH(tln, &gn->commands)
2195 printf("\t%s\n", (const char *)Lst_Datum(tln));