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.55 2005/05/05 09:08:42 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 */
166 /* The NULL suffix for this run */
167 static Suff *suffNull;
169 /* The empty suffix required for POSIX single-suffix transformation rules */
170 static Suff *emptySuff;
172 static void SuffFindDeps(GNode *, Lst *);
176 *-----------------------------------------------------------------------
177 * SuffSuffIsSuffix --
178 * See if suff is a suffix of str.
181 * NULL if it ain't, pointer to character in str before suffix if
186 *-----------------------------------------------------------------------
189 SuffSuffIsSuffix(const Suff *s, char *str)
191 const char *p1; /* Pointer into suffix name */
192 char *p2; /* Pointer into string being examined */
196 p1 = s->name + s->nameLen;
199 while (p1 >= s->name && len > 0 && *p1 == *p2) {
205 return (p1 == s->name - 1 ? p2 : NULL);
209 *-----------------------------------------------------------------------
211 * Find a suffix given its name.
214 * The suffix or NULL.
218 *-----------------------------------------------------------------------
221 SuffSuffFind(const char *s)
225 LST_FOREACH(ln, &sufflist) {
226 if (strcmp(s, ((const Suff *)Lst_Datum(ln))->name) == 0)
227 return (Lst_Datum(ln));
233 *-----------------------------------------------------------------------
242 *-----------------------------------------------------------------------
245 SuffTransFind(const char *name)
249 LST_FOREACH(ln, &transforms) {
250 if (strcmp(name, ((const GNode *)Lst_Datum(ln))->name) == 0)
251 return (Lst_Datum(ln));
256 /*********** Maintenance Functions ************/
260 * Keep this function for now until it is clear why a .SUFFIXES: doesn't
261 * actually delete the suffixes but just puts them on the suffClean list.
264 *-----------------------------------------------------------------------
266 * Free up all memory associated with the given suffix structure.
272 * the suffix entry is detroyed
273 *-----------------------------------------------------------------------
286 Lst_Destroy(&s->ref, NOFREE);
287 Lst_Destroy(&s->children, NOFREE);
288 Lst_Destroy(&s->parents, NOFREE);
289 Lst_Destroy(&s->searchPath, Dir_Destroy);
297 *-----------------------------------------------------------------------
299 * Remove the suffix into the list
305 * The reference count for the suffix is decremented
306 *-----------------------------------------------------------------------
309 SuffRemove(Lst *l, Suff *s)
311 LstNode *ln = Lst_Member(l, s);
320 *-----------------------------------------------------------------------
322 * Insert the suffix into the list keeping the list ordered by suffix
329 * The reference count of the suffix is incremented
330 *-----------------------------------------------------------------------
333 SuffInsert(Lst *l, Suff *s)
335 LstNode *ln; /* current element in l we're examining */
336 Suff *s2; /* the suffix descriptor in this element */
339 for (ln = Lst_First(l); ln != NULL; ln = Lst_Succ(ln)) {
341 if (s2->sNum >= s->sNum)
345 DEBUGF(SUFF, ("inserting an empty list?..."));
348 DEBUGF(SUFF, ("inserting %s(%d)...", s->name, s->sNum));
350 DEBUGF(SUFF, ("at end of list\n"));
353 Lst_AtEnd(&s->ref, l);
354 } else if (s2->sNum != s->sNum) {
355 DEBUGF(SUFF, ("before %s(%d)\n", s2->name, s2->sNum));
356 Lst_Insert(l, ln, s);
358 Lst_AtEnd(&s->ref, l);
360 DEBUGF(SUFF, ("already there\n"));
365 *-----------------------------------------------------------------------
366 * Suff_ClearSuffixes --
367 * This is gross. Nuke the list of suffixes but keep all transformation
368 * rules around. The transformation graph is destroyed in this process,
369 * but we leave the list of rules so when a new graph is formed the rules
371 * This function is called from the parse module when a
372 * .SUFFIXES:\n line is encountered.
378 * the sufflist and its graph nodes are destroyed
379 *-----------------------------------------------------------------------
382 Suff_ClearSuffixes(void)
385 Lst_Concat(&suffClean, &sufflist, LST_CONCLINK);
388 suffNull = emptySuff;
390 * Clear suffNull's children list (the other suffixes are built new, but
391 * suffNull is used as is).
392 * NOFREE is used because all suffixes are are on the suffClean list.
393 * suffNull should not have parents.
395 Lst_Destroy(&suffNull->children, NOFREE);
399 *-----------------------------------------------------------------------
400 * SuffParseTransform --
401 * Parse a transformation string to find its two component suffixes.
404 * TRUE if the string is a valid transformation and FALSE otherwise.
407 * The passed pointers are overwritten.
409 *-----------------------------------------------------------------------
412 SuffParseTransform(char *str, Suff **srcPtr, Suff **targPtr)
414 LstNode *srcLn; /* element in suffix list of trans source*/
415 Suff *src; /* Source of transformation */
416 char *str2; /* Extra pointer (maybe target suffix) */
417 LstNode *singleLn; /* element in suffix list of any suffix
418 * that exactly matches str */
419 Suff *single = NULL; /* Source of possible transformation to
425 * Loop looking first for a suffix that matches the start of the
426 * string and then for one that exactly matches the rest of it. If
427 * we can find two that meet these criteria, we've successfully
430 srcLn = Lst_First(&sufflist);
432 /* advance to next possible suffix */
433 while (srcLn != NULL) {
434 src = Lst_Datum(srcLn);
435 if (strncmp(str, src->name, strlen(src->name)) == 0)
437 srcLn = LST_NEXT(srcLn);
442 * Ran out of source suffixes -- no such rule
444 if (singleLn != NULL) {
446 * Not so fast Mr. Smith! There was a suffix
447 * that encompassed the entire string, so we
448 * assume it was a transformation to the null
449 * suffix (thank you POSIX). We still prefer to
450 * find a double rule over a singleton, hence we
451 * leave this check until the end.
453 * XXX: Use emptySuff over suffNull?
461 str2 = str + src->nameLen;
467 *targPtr = SuffSuffFind(str2);
468 if (*targPtr != NULL) {
474 srcLn = LST_NEXT(srcLn);
479 *-----------------------------------------------------------------------
480 * Suff_IsTransform --
481 * Return TRUE if the given string is a transformation rule
485 * TRUE if the string is a concatenation of two known suffixes.
490 *-----------------------------------------------------------------------
493 Suff_IsTransform(char *str)
497 return (SuffParseTransform(str, &src, &targ));
501 *-----------------------------------------------------------------------
502 * Suff_AddTransform --
503 * Add the transformation rule described by the line to the
504 * list of rules and place the transformation itself in the graph
507 * The node created for the transformation in the transforms list
510 * The node is placed on the end of the transforms Lst and links are
511 * made between the two suffixes mentioned in the target name
512 *-----------------------------------------------------------------------
515 Suff_AddTransform(char *line)
517 GNode *gn; /* GNode of transformation rule */
518 Suff *s; /* source suffix */
519 Suff *t; /* target suffix */
521 gn = SuffTransFind(line);
524 * Make a new graph node for the transformation.
525 * It will be filled in by the Parse module.
527 gn = Targ_NewGN(line);
528 Lst_AtEnd(&transforms, gn);
531 * New specification for transformation rule. Just nuke the
532 * old list of commands so they can be filled in again...
533 * We don't actually free the commands themselves, because a
534 * given command can be attached to several different
537 Lst_Destroy(&gn->commands, NOFREE);
538 Lst_Destroy(&gn->children, NOFREE);
541 gn->type = OP_TRANSFORM;
543 SuffParseTransform(line, &s, &t);
546 * link the two together in the proper relationship and order
548 DEBUGF(SUFF, ("defining transformation from `%s' to `%s'\n",
550 SuffInsert(&t->children, s);
551 SuffInsert(&s->parents, t);
557 *-----------------------------------------------------------------------
558 * Suff_EndTransform --
559 * Handle the finish of a transformation definition, removing the
560 * transformation from the graph if it has neither commands nor
561 * sources. This is called from the Parse module at the end of
562 * a dependency block.
565 * If the node has no commands or children, the children and parents
566 * lists of the affected suffices are altered.
568 *-----------------------------------------------------------------------
571 Suff_EndTransform(const GNode *gn)
575 if (!Lst_IsEmpty(&gn->commands) || !Lst_IsEmpty(&gn->children)) {
576 DEBUGF(SUFF, ("transformation %s complete\n", gn->name));
581 * SuffParseTransform() may fail for special rules which are not
582 * actual transformation rules (e.g., .DEFAULT).
584 if (!SuffParseTransform(gn->name, &s, &t))
587 DEBUGF(SUFF, ("deleting transformation from `%s' to `%s'\n",
591 * Remove the source from the target's children list. We check
592 * for a NULL return to handle a beanhead saying something like
595 * We'll be called twice when the next target is seen, but .c
596 * and .o are only linked once...
598 SuffRemove(&t->children, s);
601 * Remove the target from the source's parents list
603 SuffRemove(&s->parents, t);
607 *-----------------------------------------------------------------------
608 * SuffRebuildGraph --
609 * Called from Suff_AddSuffix via LST_FOREACH to search through the
610 * list of existing transformation rules and rebuild the transformation
611 * graph when it has been destroyed by Suff_ClearSuffixes. If the
612 * given rule is a transformation involving this suffix and another,
613 * existing suffix, the proper relationship is established between
617 * The appropriate links will be made between this suffix and
618 * others if transformation rules exist for it.
620 *-----------------------------------------------------------------------
623 SuffRebuildGraph(const GNode *transform, Suff *s)
629 * First see if it is a transformation from this suffix.
631 if (strncmp(transform->name, s->name, strlen(s->name)) == 0) {
632 cp = transform->name + strlen(s->name);
634 if (cp[0] == '\0') /* null rule */
637 s2 = SuffSuffFind(cp);
640 * Found target. Link in and return, since it can't be
643 SuffInsert(&s2->children, s);
644 SuffInsert(&s->parents, s2);
650 * Not from, maybe to?
652 cp = SuffSuffIsSuffix(s, transform->name);
655 * Null-terminate the source suffix in order to find it.
658 s2 = SuffSuffFind(transform->name);
661 * Replace the start of the target suffix
666 * Found it -- establish the proper relationship
668 SuffInsert(&s->children, s2);
669 SuffInsert(&s2->parents, s);
675 *-----------------------------------------------------------------------
677 * Add the suffix in string to the end of the list of known suffixes.
678 * Should we restructure the suffix graph? Make doesn't...
684 * A GNode is created for the suffix and a Suff structure is created and
685 * added to the suffixes list unless the suffix was already known.
686 *-----------------------------------------------------------------------
689 Suff_AddSuffix(char *str)
691 Suff *s; /* new suffix descriptor */
694 if (SuffSuffFind(str) != NULL)
700 s = emalloc(sizeof(Suff));
702 s->name = estrdup(str);
703 s->nameLen = strlen(s->name);
704 TAILQ_INIT(&s->searchPath);
705 Lst_Init(&s->children);
706 Lst_Init(&s->parents);
712 Lst_AtEnd(&sufflist, s);
715 * Look for any existing transformations from or to this suffix.
716 * XXX: Only do this after a Suff_ClearSuffixes?
718 LST_FOREACH(ln, &transforms)
719 SuffRebuildGraph(Lst_Datum(ln), s);
723 *-----------------------------------------------------------------------
725 * Return the search path for the given suffix, if it's defined.
728 * The searchPath for the desired suffix or NULL if the suffix isn't
733 *-----------------------------------------------------------------------
736 Suff_GetPath(char *sname)
740 s = SuffSuffFind(sname);
743 return (&s->searchPath);
747 *-----------------------------------------------------------------------
749 * Extend the search paths for all suffixes to include the default
756 * The searchPath field of all the suffixes is extended by the
757 * directories in dirSearchPath. If paths were specified for the
758 * ".h" suffix, the directories are stuffed into a global variable
759 * called ".INCLUDES" with each directory preceded by a -I. The same
760 * is done for the ".a" suffix, except the variable is called
761 * ".LIBS" and the flag is -L.
762 *-----------------------------------------------------------------------
770 struct Path inIncludes; /* Cumulative .INCLUDES path */
771 struct Path inLibs; /* Cumulative .LIBS path */
773 TAILQ_INIT(&inIncludes);
776 for (ln = Lst_First(&sufflist); ln != NULL; ln = Lst_Succ(ln)) {
779 if (s->flags & SUFF_INCLUDE) {
780 Path_Concat(&inIncludes, &s->searchPath);
782 #endif /* INCLUDES */
784 if (s->flags & SUFF_LIBRARY) {
785 Path_Concat(&inLibs, &s->searchPath);
787 #endif /* LIBRARIES */
788 Path_Concat(&s->searchPath, &dirSearchPath);
791 ptr = Path_MakeFlags("-I", &inIncludes);
792 Var_Set(".INCLUDES", ptr, VAR_GLOBAL);
795 ptr = Path_MakeFlags("-L", &inLibs);
796 Var_Set(".LIBS", ptr, VAR_GLOBAL);
799 Path_Clear(&inIncludes);
804 *-----------------------------------------------------------------------
806 * Add the given suffix as a type of file which gets included.
807 * Called from the parse module when a .INCLUDES line is parsed.
808 * The suffix must have already been defined.
814 * The SUFF_INCLUDE bit is set in the suffix's flags field
816 *-----------------------------------------------------------------------
819 Suff_AddInclude(char *sname)
823 if ((s = SuffSuffFind(sname)) != NULL)
824 s->flags |= SUFF_INCLUDE;
828 *-----------------------------------------------------------------------
830 * Add the given suffix as a type of file which is a library.
831 * Called from the parse module when parsing a .LIBS line. The
832 * suffix must have been defined via .SUFFIXES before this is
839 * The SUFF_LIBRARY bit is set in the suffix's flags field
841 *-----------------------------------------------------------------------
844 Suff_AddLib(char *sname)
848 if ((s = SuffSuffFind(sname)) != NULL)
849 s->flags |= SUFF_LIBRARY;
853 * Create a new Src structure
856 SuffSrcCreate(char *file, char *prefix, Suff *suff, Src *parent, GNode *node)
860 s = emalloc(sizeof(*s));
875 /********** Implicit Source Search Functions *********/
878 *-----------------------------------------------------------------------
880 * Add all the children of targ as Src structures to the given list:
881 * Add a suffix as a Src structure to the given list with its parent
882 * being the given Src structure. If the suffix is the null suffix,
883 * the prefix is used unaltered as the file name in the Src structure.
889 * Lots of structures are created and added to the list
890 *-----------------------------------------------------------------------
893 SuffAddLevel(Lst *l, Src *targ)
902 LST_FOREACH(ln, &targ->suff->children) {
903 suff = Lst_Datum(ln);
905 if ((suff->flags & SUFF_NULL) && *suff->name != '\0') {
907 * If the suffix has been marked as the NULL suffix,
908 * also create a Src structure for a file with no suffix
909 * attached. Two birds, and all that...
911 s2 = SuffSrcCreate(estrdup(targ->pref), targ->pref,
917 Lst_AtEnd(&targ->cp, s2);
918 printf("1 add %p %p to %p:", targ, s2, l);
920 printf("%p ", (const void *)Lst_Datum(ln1));
924 s2 = SuffSrcCreate(str_concat(targ->pref, suff->name, 0),
925 targ->pref, suff, targ, NULL);
930 Lst_AtEnd(&targ->cp, s2);
931 printf("2 add %p %p to %p:", targ, s2, l);
933 printf("%p ", (const void *)Lst_Datum(ln1));
940 *----------------------------------------------------------------------
942 * Free all src structures in list that don't have a reference count
943 * XXX this actually frees only the first of these.
946 * True if a src was removed
949 * The memory is free'd.
950 *----------------------------------------------------------------------
953 SuffRemoveSrc(Lst *l)
960 printf("cleaning %lx: ", (unsigned long) l);
962 printf("%p ", (const void *)Lst_Datum(ln));
966 for (ln = Lst_First(l); ln != NULL; ln = ln1) {
969 s = (Src *)Lst_Datum(ln);
970 if (s->children == 0) {
976 LstNode *ln = Lst_Member(&s->parent->cp, s);
978 Lst_Remove(&s->parent->cp, ln);
980 --s->parent->children;
983 printf("free: [l=%p] p=%p %d\n", l, s, s->children);
984 Lst_Destroy(&s->cp, NOFREE);
995 printf("keep: [l=%p] p=%p %d: ", l, s, s->children);
996 LST_FOREACH(tln, &s->cp)
997 printf("%p ", (const void *)Lst_Datum(tln));
1007 *-----------------------------------------------------------------------
1009 * Find the first existing file/target in the list srcs
1012 * The lowest structure in the chain of transformations
1016 *-----------------------------------------------------------------------
1019 SuffFindThem(Lst *srcs, Lst *slst)
1021 Src *s; /* current Src */
1022 Src *rs; /* returned Src */
1027 while (!Lst_IsEmpty (srcs)) {
1028 s = Lst_DeQueue(srcs);
1030 DEBUGF(SUFF, ("\ttrying %s...", s->file));
1033 * A file is considered to exist if either a node exists in the
1034 * graph for it or the file actually exists.
1036 if (Targ_FindNode(s->file, TARG_NOCREATE) != NULL) {
1038 printf("remove %p from %p\n", s, srcs);
1044 if ((ptr = Path_FindFile(s->file,
1045 &s->suff->searchPath)) != NULL) {
1048 printf("remove %p from %p\n", s, srcs);
1054 DEBUGF(SUFF, ("not there\n"));
1056 SuffAddLevel(srcs, s);
1061 DEBUGF(SUFF, ("got it\n"));
1067 *-----------------------------------------------------------------------
1069 * See if any of the children of the target in the Src structure is
1070 * one from which the target can be transformed. If there is one,
1071 * a Src structure is put together for it and returned.
1074 * The Src structure of the "winning" child, or NULL if no such beast.
1077 * A Src structure may be allocated.
1079 *-----------------------------------------------------------------------
1082 SuffFindCmds(Src *targ, Lst *slst)
1084 LstNode *ln; /* General-purpose list node */
1085 GNode *t; /* Target GNode */
1086 GNode *s; /* Source GNode */
1087 int prefLen;/* The length of the defined prefix */
1088 Suff *suff; /* Suffix on matching beastie */
1089 Src *ret; /* Return value */
1093 prefLen = strlen(targ->pref);
1095 for (ln = Lst_First(&t->children); ln != NULL; ln = Lst_Succ(ln)) {
1098 cp = strrchr(s->name, '/');
1104 if (strncmp(cp, targ->pref, prefLen) == 0) {
1106 * The node matches the prefix ok, see if it has
1109 suff = SuffSuffFind(&cp[prefLen]);
1112 * It even has a known suffix, see if there's
1113 * a transformation defined between the node's
1114 * suffix and the target's suffix.
1116 * XXX: Handle multi-stage transformations
1119 if (Lst_Member(&suff->parents,
1120 targ->suff) != NULL) {
1122 * Hot Damn! Create a new Src structure
1123 * to describe this transformation
1124 * (making sure to duplicate the
1125 * source node's name so Suff_FindDeps
1126 * can free it again (ick)), and return
1127 * the new structure.
1129 ret = SuffSrcCreate(estrdup(s->name),
1130 targ->pref, suff, targ, s);
1132 targ->children += 1;
1134 printf("3 add %p %p\n", &targ, ret);
1135 Lst_AtEnd(&targ->cp, ret);
1137 Lst_AtEnd(slst, ret);
1138 DEBUGF(SUFF, ("\tusing existing source "
1149 * The child node contains variable references. Expand them and return
1150 * a list of expansions.
1153 SuffExpandVariables(GNode *parent, GNode *child, Lst *members)
1161 DEBUGF(SUFF, ("Expanding \"%s\"...", child->name));
1162 buf = Var_Subst(child->name, parent, TRUE);
1165 if (child->type & OP_ARCHV) {
1167 * Node was an archive(member) target, so we
1168 * want to call on the Arch module to find the
1169 * nodes for us, expanding variables in the
1172 Arch_ParseArchive(&cp, members, parent);
1173 Buf_Destroy(buf, TRUE);
1177 * Break the result into a vector of strings whose nodes we can find,
1178 * then add those nodes to the members list.
1180 for (start = cp; *start == ' ' || *start == '\t'; start++)
1183 for (cp = start; *cp != '\0'; cp++) {
1184 if (*cp == ' ' || *cp == '\t') {
1186 * White-space -- terminate element, find the node,
1187 * add it, skip any further spaces.
1190 Lst_AtEnd(members, Targ_FindNode(start, TARG_CREATE));
1192 while (*cp == ' ' || *cp == '\t') {
1196 * Adjust cp for increment at
1197 * start of loop, but set start
1198 * to first non-space.
1202 } else if (*cp == '$') {
1204 * Start of a variable spec -- contact variable module
1205 * to find the end so we can skip over it.
1211 junk = Var_Parse(cp, parent, TRUE, &len, &doFree);
1212 if (junk != var_Error) {
1219 } else if (*cp == '\\' && *cp != '\0') {
1221 * Escaped something -- skip over it
1229 * Stuff left over -- add it to the
1232 Lst_AtEnd(members, Targ_FindNode(start, TARG_CREATE));
1235 Buf_Destroy(buf, TRUE);
1239 * The child node contains wildcards. Expand them and return a list of
1243 SuffExpandWildcards(GNode *child, Lst *members)
1246 Lst exp; /* List of expansions */
1248 struct Path *path; /* Search path along which to expand */
1253 * Find a path along which to expand the word.
1255 * If the word has a known suffix, use that path.
1256 * If it has no known suffix and we're allowed to use the null
1257 * suffix, use its path.
1258 * Else use the default system search path.
1260 LST_FOREACH(ln, &sufflist) {
1261 if (SuffSuffIsSuffix(Lst_Datum(ln), child->name) != NULL)
1265 DEBUGF(SUFF, ("Wildcard expanding \"%s\"...", child->name));
1268 Suff *s = Lst_Datum(ln);
1270 DEBUGF(SUFF, ("suffix is \"%s\"...", s->name));
1271 path = &s->searchPath;
1274 * Use default search path
1276 path = &dirSearchPath;
1280 * Expand the word along the chosen path
1283 Path_Expand(child->name, path, &exp);
1285 while (!Lst_IsEmpty(&exp)) {
1287 * Fetch next expansion off the list and find its GNode
1289 cp = Lst_DeQueue(&exp);
1291 DEBUGF(SUFF, ("%s...", cp));
1292 Lst_AtEnd(members, Targ_FindNode(cp, TARG_CREATE));
1297 *-----------------------------------------------------------------------
1298 * SuffExpandChildren --
1299 * Expand the names of any children of a given node that contain
1300 * variable invocations or file wildcards into actual targets.
1306 * The expanded node is removed from the parent's list of children,
1307 * and the parent's unmade counter is decremented, but other nodes
1310 *-----------------------------------------------------------------------
1313 SuffExpandChildren(GNode *parent, LstNode *current)
1315 GNode *cchild; /* current child */
1317 LstNode *prev; /* node after which to append new source */
1318 Lst members; /* expanded nodes */
1320 if (current == NULL) {
1321 /* start from begin of parent's children list */
1322 current = Lst_First(&parent->children);
1325 while (current != NULL) {
1326 cchild = Lst_Datum(current);
1329 * First do variable expansion -- this takes precedence over
1330 * wildcard expansion. If the result contains wildcards, they'll
1331 * be gotten to later since the resulting words are tacked
1332 * instead of the current child onto the children list.
1334 * XXXHB what if cchild contains lib.a(t1.o t2.o t3.o) but
1337 if (strchr(cchild->name, '$') != NULL) {
1338 SuffExpandVariables(parent, cchild, &members);
1340 } else if (Dir_HasWildcards(cchild->name)) {
1341 SuffExpandWildcards(cchild, &members);
1344 /* nothing special just advance to next child */
1345 current = LST_NEXT(current);
1350 * New nodes effectively take the place of the child,
1351 * so place them after the child
1356 * Add all new elements to the parent node if they aren't
1357 * already children of it.
1359 while(!Lst_IsEmpty(&members)) {
1360 gn = Lst_DeQueue(&members);
1362 DEBUGF(SUFF, ("%s...", gn->name));
1363 if (Lst_Member(&parent->children, gn) == NULL) {
1364 Lst_Append(&parent->children, prev, gn);
1365 prev = Lst_Succ(prev);
1366 Lst_AtEnd(&gn->parents, parent);
1372 * Now the source is expanded, remove it from the list
1373 * of children to keep it from being processed.
1374 * Advance to the next child.
1377 current = LST_NEXT(current);
1380 Lst_Remove(&parent->children, prev);
1381 DEBUGF(SUFF, ("\n"));
1386 *-----------------------------------------------------------------------
1387 * SuffApplyTransform --
1388 * Apply a transformation rule, given the source and target nodes
1392 * TRUE if successful, FALSE if not.
1395 * The source and target are linked and the commands from the
1396 * transformation are added to the target node's commands list.
1397 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1398 * to the target. The target also inherits all the sources for
1399 * the transformation rule.
1401 *-----------------------------------------------------------------------
1404 SuffApplyTransform(GNode *tGn, GNode *sGn, Suff *t, Suff *s)
1406 LstNode *ln; /* General node */
1407 char *tname; /* Name of transformation rule */
1408 GNode *gn; /* Node for same */
1410 if (Lst_Member(&tGn->children, sGn) == NULL) {
1412 * Not already linked, so form the proper links between the
1413 * target and source.
1415 Lst_AtEnd(&tGn->children, sGn);
1416 Lst_AtEnd(&sGn->parents, tGn);
1420 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1422 * When a :: node is used as the implied source of a node,
1423 * we have to link all its cohorts in as sources as well. Only
1424 * the initial sGn gets the target in its iParents list, however
1425 * as that will be sufficient to get the .IMPSRC variable set
1428 for (ln = Lst_First(&sGn->cohorts); ln != NULL;
1429 ln = Lst_Succ(ln)) {
1432 if (Lst_Member(&tGn->children, gn) == NULL) {
1434 * Not already linked, so form the proper
1435 * links between the target and source.
1437 Lst_AtEnd(&tGn->children, gn);
1438 Lst_AtEnd(&gn->parents, tGn);
1444 * Locate the transformation rule itself
1446 tname = str_concat(s->name, t->name, 0);
1447 gn = SuffTransFind(tname);
1452 * Not really such a transformation rule (can happen when we're
1453 * called to link an OP_MEMBER and OP_ARCHV node), so return
1459 DEBUGF(SUFF, ("\tapplying %s -> %s to \"%s\"\n",
1460 s->name, t->name, tGn->name));
1463 * Record last child for expansion purposes
1465 ln = Lst_Last(&tGn->children);
1468 * Pass the buck to Make_HandleUse to apply the rule
1470 Make_HandleUse(gn, tGn);
1473 * Deal with wildcards and variables in any acquired sources
1477 SuffExpandChildren(tGn, ln);
1481 * Keep track of another parent to which this beast is transformed so
1482 * the .IMPSRC variable can be set correctly for the parent.
1484 Lst_AtEnd(&sGn->iParents, tGn);
1491 *-----------------------------------------------------------------------
1492 * SuffFindArchiveDeps --
1493 * Locate dependencies for an OP_ARCHV node.
1499 * Same as Suff_FindDeps
1501 *-----------------------------------------------------------------------
1504 SuffFindArchiveDeps(GNode *gn, Lst *slst)
1506 char *eoarch; /* End of archive portion */
1507 char *eoname; /* End of member portion */
1508 char *name; /* Start of member's name */
1509 GNode *mem; /* Node for member */
1510 Suff *ms; /* Suffix descriptor for member */
1513 * The node is an archive(member) pair. so we must find a
1514 * suffix for both of them.
1516 eoarch = strchr(gn->name, '(');
1517 eoname = strchr(eoarch, ')');
1519 *eoname = '\0'; /* Nuke parentheses during suffix search */
1520 *eoarch = '\0'; /* So a suffix can be found */
1525 * To simplify things, call Suff_FindDeps recursively on the member now,
1526 * so we can simply compare the member's .PREFIX and .TARGET variables
1527 * to locate its suffix. This allows us to figure out the suffix to
1528 * use for the archive without having to do a quadratic search over the
1529 * suffix list, backtracking for each one...
1531 mem = Targ_FindNode(name, TARG_CREATE);
1532 SuffFindDeps(mem, slst);
1535 * Create the link between the two nodes right off
1537 if (Lst_Member(&gn->children, mem) == NULL) {
1538 Lst_AtEnd(&gn->children, mem);
1539 Lst_AtEnd(&mem->parents, gn);
1544 * Copy in the variables from the member node to this one.
1547 const char *copy[] = {
1548 TARGET, /* Must be first */
1549 PREFIX, /* Must be second */
1553 Var_Set(copy[1], Var_Value(copy[1], mem, &p1), gn);
1555 Var_Set(copy[0], Var_Value(copy[0], mem, &p1), gn);
1562 * Didn't know what it was -- use .NULL suffix if not in
1565 DEBUGF(SUFF, ("using null suffix\n"));
1571 * Set the other two local variables required for this target.
1573 Var_Set(MEMBER, name, gn);
1574 Var_Set(ARCHIVE, gn->name, gn);
1578 * Member has a known suffix, so look for a transformation rule
1579 * from it to a possible suffix of the archive. Rather than
1580 * searching through the entire list, we just look at suffixes
1581 * to which the member's suffix may be transformed...
1586 * Use first matching suffix...
1588 LST_FOREACH(ln, &ms->parents) {
1589 if (SuffSuffIsSuffix(Lst_Datum(ln), gn->name) != NULL)
1595 * Got one -- apply it
1597 if (!SuffApplyTransform(gn, mem, Lst_Datum(ln), ms)) {
1598 DEBUGF(SUFF, ("\tNo transformation from "
1599 "%s -> %s\n", ms->name,
1600 ((Suff *)Lst_Datum(ln))->name));
1606 * Replace the opening and closing parens now we've no need
1607 * of the separate pieces.
1613 * Pretend gn appeared to the left of a dependency operator so
1614 * the user needn't provide a transformation from the member to the
1617 if (OP_NOP(gn->type)) {
1618 gn->type |= OP_DEPENDS;
1622 * Flag the member as such so we remember to look in the archive for
1623 * its modification time.
1625 mem->type |= OP_MEMBER;
1629 *-----------------------------------------------------------------------
1630 * SuffFindNormalDeps --
1631 * Locate implicit dependencies for regular targets.
1637 * Same as Suff_FindDeps...
1639 *-----------------------------------------------------------------------
1642 SuffFindNormalDeps(GNode *gn, Lst *slst)
1644 char *eoname; /* End of name */
1645 char *sopref; /* Start of prefix */
1646 LstNode *ln; /* Next suffix node to check */
1647 Lst srcs; /* List of sources at which to look */
1648 Lst targs; /* List of targets to which things can be
1649 * transformed. They all have the same file,
1650 * but different suff and pref fields */
1651 Src *bottom; /* Start of found transformation path */
1652 Src *src; /* General Src pointer */
1653 char *pref; /* Prefix to use */
1654 Src *targ; /* General Src target pointer */
1656 eoname = gn->name + strlen(gn->name);
1660 * Begin at the beginning...
1662 ln = Lst_First(&sufflist);
1667 * We're caught in a catch-22 here. On the one hand, we want to use any
1668 * transformation implied by the target's sources, but we can't examine
1669 * the sources until we've expanded any variables/wildcards they may
1670 * hold, and we can't do that until we've set up the target's local
1671 * variables and we can't do that until we know what the proper suffix
1672 * for the target is (in case there are two suffixes one of which is a
1673 * suffix of the other) and we can't know that until we've found its
1674 * implied source, which we may not want to use if there's an existing
1675 * source that implies a different transformation.
1677 * In an attempt to get around this, which may not work all the time,
1678 * but should work most of the time, we look for implied sources first,
1679 * checking transformations to all possible suffixes of the target,
1680 * use what we find to set the target's local variables, expand the
1681 * children, then look for any overriding transformations they imply.
1682 * Should we find one, we discard the one we found before.
1685 while (ln != NULL) {
1687 * Look for next possible suffix...
1689 while (ln != NULL) {
1690 if (SuffSuffIsSuffix(Lst_Datum(ln), gn->name) != NULL)
1696 int prefLen; /* Length of the prefix */
1700 * Allocate a Src structure to which things can be
1703 target = SuffSrcCreate(estrdup(gn->name), NULL,
1704 Lst_Datum(ln), NULL, gn);
1705 target->suff->refCount++;
1708 * Allocate room for the prefix, whose end is found
1709 * by subtracting the length of the suffix from
1710 * the end of the name.
1712 prefLen = (eoname - target->suff->nameLen) - sopref;
1713 assert(prefLen >= 0);
1714 target->pref = emalloc(prefLen + 1);
1715 memcpy(target->pref, sopref, prefLen);
1716 target->pref[prefLen] = '\0';
1719 * Add nodes from which the target can be made
1721 SuffAddLevel(&srcs, target);
1724 * Record the target so we can nuke it
1726 Lst_AtEnd(&targs, target);
1729 * Search from this suffix's successor...
1736 * Handle target of unknown suffix...
1738 if (Lst_IsEmpty(&targs) && suffNull != NULL) {
1739 DEBUGF(SUFF, ("\tNo known suffix on %s. Using .NULL suffix\n",
1742 targ = SuffSrcCreate(estrdup(gn->name), estrdup(sopref),
1743 suffNull, NULL, gn);
1744 targ->suff->refCount++;
1747 * Only use the default suffix rules if we don't have commands
1748 * or dependencies defined for this gnode
1750 if (Lst_IsEmpty(&gn->commands) && Lst_IsEmpty(&gn->children))
1751 SuffAddLevel(&srcs, targ);
1753 DEBUGF(SUFF, ("not "));
1756 DEBUGF(SUFF, ("adding suffix rules\n"));
1758 Lst_AtEnd(&targs, targ);
1762 * Using the list of possible sources built up from the target
1763 * suffix(es), try and find an existing file/target that matches.
1765 bottom = SuffFindThem(&srcs, slst);
1767 if (bottom == NULL) {
1769 * No known transformations -- use the first suffix found for
1770 * setting the local variables.
1772 if (!Lst_IsEmpty(&targs)) {
1773 targ = Lst_Datum(Lst_First(&targs));
1779 * Work up the transformation path to find the suffix of the
1780 * target to which the transformation was made.
1782 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1787 * The .TARGET variable we always set to be the name at this point,
1788 * since it's only set to the path if the thing is only a source and
1789 * if it's only a source, it doesn't matter what we put here as far
1790 * as expanding sources is concerned, since it has none...
1792 Var_Set(TARGET, gn->name, gn);
1794 pref = (targ != NULL) ? targ->pref : gn->name;
1795 Var_Set(PREFIX, pref, gn);
1798 * Now we've got the important local variables set, expand any sources
1799 * that still contain variables or wildcards in their names.
1801 SuffExpandChildren(gn, NULL);
1804 DEBUGF(SUFF, ("\tNo valid suffix on %s\n", gn->name));
1808 * Deal with finding the thing on the default search path if the
1809 * node is only a source (not on the lhs of a dependency
1810 * operator or [XXX] it has neither children or commands).
1812 if (OP_NOP(gn->type) || (Lst_IsEmpty(&gn->children) &&
1813 Lst_IsEmpty(&gn->commands))) {
1814 gn->path = Path_FindFile(gn->name,
1815 (targ == NULL ? &dirSearchPath :
1816 &targ->suff->searchPath));
1817 if (gn->path != NULL) {
1819 Var_Set(TARGET, gn->path, gn);
1823 * Suffix known for the thing -- trim
1824 * the suffix off the path to form the
1825 * proper .PREFIX variable.
1827 int savep = strlen(gn->path) -
1828 targ->suff->nameLen;
1832 gn->suffix->refCount--;
1833 gn->suffix = targ->suff;
1834 gn->suffix->refCount++;
1836 savec = gn->path[savep];
1837 gn->path[savep] = '\0';
1839 if ((ptr = strrchr(gn->path, '/')) != NULL)
1844 Var_Set(PREFIX, ptr, gn);
1846 gn->path[savep] = savec;
1849 * The .PREFIX gets the full path if
1850 * the target has no known suffix.
1853 gn->suffix->refCount--;
1856 if ((ptr = strrchr(gn->path, '/')) != NULL)
1861 Var_Set(PREFIX, ptr, gn);
1866 * Not appropriate to search for the thing -- set the
1867 * path to be the name so Dir_MTime won't go
1868 * grovelling for it.
1871 gn->suffix->refCount--;
1872 gn->suffix = (targ == NULL) ? NULL : targ->suff;
1874 gn->suffix->refCount++;
1876 gn->path = estrdup(gn->name);
1883 * If the suffix indicates that the target is a library, mark that in
1884 * the node's type field.
1886 if (targ->suff->flags & SUFF_LIBRARY) {
1891 * Check for overriding transformation rule implied by sources
1893 if (!Lst_IsEmpty(&gn->children)) {
1894 src = SuffFindCmds(targ, slst);
1898 * Free up all the Src structures in the
1899 * transformation path up to, but not including,
1902 while (bottom && bottom->parent != NULL) {
1903 if (Lst_Member(slst, bottom) == NULL) {
1904 Lst_AtEnd(slst, bottom);
1906 bottom = bottom->parent;
1912 if (bottom == NULL) {
1914 * No idea from where it can come -- return now.
1920 * We now have a list of Src structures headed by 'bottom' and linked
1921 * via their 'parent' pointers. What we do next is create links between
1922 * source and target nodes (which may or may not have been created)
1923 * and set the necessary local variables in each target. The
1924 * commands for each target are set from the commands of the
1925 * transformation rule used to get from the src suffix to the targ
1926 * suffix. Note that this causes the commands list of the original
1927 * node, gn, to be replaced by the commands of the final
1928 * transformation rule. Also, the unmade field of gn is incremented.
1931 if (bottom->node == NULL) {
1932 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
1935 for (src = bottom; src->parent != NULL; src = src->parent) {
1938 if (src->node->suffix)
1939 src->node->suffix->refCount--;
1940 src->node->suffix = src->suff;
1941 src->node->suffix->refCount++;
1943 if (targ->node == NULL) {
1944 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
1947 SuffApplyTransform(targ->node, src->node,
1948 targ->suff, src->suff);
1950 if (targ->node != gn) {
1952 * Finish off the dependency-search process for any
1953 * nodes between bottom and gn (no point in questing
1954 * around the filesystem for their implicit source
1955 * when it's already known). Note that the node can't
1956 * have any sources that need expanding, since
1957 * SuffFindThem will stop on an existing
1958 * node, so all we need to do is set the standard and
1959 * System V variables.
1961 targ->node->type |= OP_DEPS_FOUND;
1963 Var_Set(PREFIX, targ->pref, targ->node);
1964 Var_Set(TARGET, targ->node->name, targ->node);
1969 gn->suffix->refCount--;
1970 gn->suffix = src->suff;
1971 gn->suffix->refCount++;
1974 * So Dir_MTime doesn't go questing for it...
1977 gn->path = estrdup(gn->name);
1980 * Nuke the transformation path and the Src structures left over in the
1985 if (Lst_Member(slst, bottom) == NULL)
1986 Lst_AtEnd(slst, bottom);
1988 while (SuffRemoveSrc(&srcs) || SuffRemoveSrc(&targs))
1991 Lst_Concat(slst, &srcs, LST_CONCLINK);
1992 Lst_Concat(slst, &targs, LST_CONCLINK);
1996 *-----------------------------------------------------------------------
1998 * Find implicit sources for the target described by the graph node
2005 * Nodes are added to the graph below the passed-in node. The nodes
2006 * are marked to have their IMPSRC variable filled in. The
2007 * PREFIX variable is set for the given node and all its
2011 * The path found by this target is the shortest path in the
2012 * transformation graph, which may pass through non-existent targets,
2013 * to an existing target. The search continues on all paths from the
2014 * root suffix until a file is found. I.e. if there's a path
2015 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2016 * the .c and .l files don't, the search will branch out in
2017 * all directions from .o and again from all the nodes on the
2018 * next level until the .l,v node is encountered.
2020 *-----------------------------------------------------------------------
2023 Suff_FindDeps(GNode *gn)
2026 SuffFindDeps(gn, &srclist);
2027 while (SuffRemoveSrc(&srclist))
2033 SuffFindDeps(GNode *gn, Lst *slst)
2036 if (gn->type & OP_DEPS_FOUND) {
2038 * If dependencies already found, no need to do it again...
2042 gn->type |= OP_DEPS_FOUND;
2045 DEBUGF(SUFF, ("SuffFindDeps (%s)\n", gn->name));
2047 if (gn->type & OP_ARCHV) {
2048 SuffFindArchiveDeps(gn, slst);
2050 } else if (gn->type & OP_LIB) {
2052 * If the node is a library, it is the arch module's job to find
2053 * it and set the TARGET variable accordingly. We merely provide
2054 * the search path, assuming all libraries end in ".a" (if the
2055 * suffix hasn't been defined, there's nothing we can do for it,
2056 * so we just set the TARGET variable to the node's name in order
2057 * to give it a value).
2061 s = SuffSuffFind(LIBSUFF);
2063 gn->suffix->refCount--;
2066 gn->suffix->refCount++;
2067 Arch_FindLib(gn, &s->searchPath);
2070 Var_Set(TARGET, gn->name, gn);
2074 * Because a library (-lfoo) target doesn't follow the standard
2075 * filesystem conventions, we don't set the regular variables for
2076 * the thing. .PREFIX is simply made empty...
2078 Var_Set(PREFIX, "", gn);
2081 SuffFindNormalDeps(gn, slst);
2086 *-----------------------------------------------------------------------
2088 * Define which suffix is the null suffix.
2094 * 'suffNull' is altered.
2097 * Need to handle the changing of the null suffix gracefully so the
2098 * old transformation rules don't just go away.
2100 *-----------------------------------------------------------------------
2103 Suff_SetNull(char *name)
2107 if ((s = SuffSuffFind(name)) == NULL) {
2108 Parse_Error(PARSE_WARNING, "Desired null suffix %s "
2109 "not defined.", name);
2113 if (suffNull != NULL) {
2114 suffNull->flags &= ~SUFF_NULL;
2116 s->flags |= SUFF_NULL;
2119 * XXX: Here's where the transformation mangling
2126 *-----------------------------------------------------------------------
2128 * Initialize suffixes module
2135 *-----------------------------------------------------------------------
2143 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2144 * actually go on the suffix list or everyone will think that's its
2147 emptySuff = suffNull = emalloc(sizeof(Suff));
2149 suffNull->name = estrdup("");
2150 suffNull->nameLen = 0;
2151 TAILQ_INIT(&suffNull->searchPath);
2152 Path_Concat(&suffNull->searchPath, &dirSearchPath);
2153 Lst_Init(&suffNull->children);
2154 Lst_Init(&suffNull->parents);
2155 Lst_Init(&suffNull->ref);
2156 suffNull->sNum = sNum++;
2157 suffNull->flags = SUFF_NULL;
2158 suffNull->refCount = 1;
2161 /********************* DEBUGGING FUNCTIONS **********************/
2164 * Convert a flag word to a printable thing and print it
2167 print_flags(FILE *fp, const struct flag2str *tab, u_int flags)
2172 while (tab->str != NULL) {
2173 if (flags & tab->flag) {
2177 fprintf(fp, "%s", tab->str);
2192 static const struct flag2str suff_flags[] = {
2193 { SUFF_INCLUDE, "INCLUDE" },
2194 { SUFF_LIBRARY, "LIBRARY" },
2195 { SUFF_NULL, "NULL" },
2199 printf("#*** Suffixes:\n");
2200 LST_FOREACH(ln, &sufflist) {
2202 printf("# `%s' [%d] ", s->name, s->refCount);
2204 if (s->flags != 0) {
2206 print_flags(stdout, suff_flags, s->flags);
2209 printf("\n#\tTo: ");
2210 LST_FOREACH(tln, &s->parents)
2211 printf("`%s' ", ((const Suff *)Lst_Datum(tln))->name);
2213 printf("\n#\tFrom: ");
2214 LST_FOREACH(tln, &s->children)
2215 printf("`%s' ", ((const Suff *)Lst_Datum(tln))->name);
2217 printf("\n#\tSearch Path: ");
2218 Path_Print(&s->searchPath);
2223 printf("#*** Transformations:\n");
2224 LST_FOREACH(ln, &transforms) {
2226 printf("%-16s: ", gn->name);
2227 Targ_PrintType(gn->type);
2229 LST_FOREACH(tln, &gn->commands)
2230 printf("\t%s\n", (const char *)Lst_Datum(tln));