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.35 2005/02/28 12:00:10 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.
110 /* Lst of suffixes */
111 static Lst sufflist = Lst_Initializer(sufflist);
113 /* Lst of suffixes to be cleaned */
114 static Lst suffClean = Lst_Initializer(suffClean);
117 static Lst srclist = Lst_Initializer(srclist);
119 /* Lst of transformation rules */
120 static Lst transforms = Lst_Initializer(transforms);
122 static int sNum = 0; /* Counter for assigning suffix numbers */
125 * Structure describing an individual suffix.
127 typedef struct _Suff {
128 char *name; /* The suffix itself */
129 int nameLen; /* Length of the suffix */
130 short flags; /* Type of suffix */
131 #define SUFF_INCLUDE 0x01 /* One which is #include'd */
132 #define SUFF_LIBRARY 0x02 /* One which contains a library */
133 #define SUFF_NULL 0x04 /* The empty suffix */
134 Lst searchPath; /* The path along which files of this suffix
136 int sNum; /* The suffix number */
137 int refCount; /* Reference count of list membership */
138 Lst parents; /* Suffixes we have a transformation to */
139 Lst children; /* Suffixes we have a transformation from */
140 Lst ref; /* List of lists this suffix is referenced */
144 * Structure used in the search for implied sources.
146 typedef struct _Src {
147 char *file; /* The file to look for */
148 char *pref; /* Prefix from which file was formed */
149 Suff *suff; /* The suffix on the file */
150 struct _Src *parent; /* The Src for which this is a source */
151 GNode *node; /* The node describing the file */
152 int children; /* Count of existing children (so we don't free
153 * this thing too early or never nuke it) */
155 Lst cp; /* Debug; children list */
160 * A structure for passing more than one argument to the Lst-library-invoked
168 static Suff *suffNull; /* The NULL suffix for this run */
169 static Suff *emptySuff; /* The empty suffix required for POSIX
170 * single-suffix transformation rules */
173 static void SuffInsert(Lst *, Suff *);
174 static void SuffRemove(Lst *, Suff *);
175 static Boolean SuffParseTransform(char *, Suff **, Suff **);
176 static int SuffRebuildGraph(void *, void *);
177 static int SuffAddSrc(void *, void *);
178 static int SuffRemoveSrc(Lst *);
179 static void SuffAddLevel(Lst *, Src *);
180 static Src *SuffFindThem(Lst *, Lst *);
181 static Src *SuffFindCmds(Src *, Lst *);
182 static int SuffExpandChildren(void *, void *);
183 static Boolean SuffApplyTransform(GNode *, GNode *, Suff *, Suff *);
184 static void SuffFindDeps(GNode *, Lst *);
185 static void SuffFindArchiveDeps(GNode *, Lst *);
186 static void SuffFindNormalDeps(GNode *, Lst *);
187 static int SuffPrintName(void *, void *);
188 static int SuffPrintSuff(void *, void *);
189 static int SuffPrintTrans(void *, void *);
191 static int PrintAddr(void *, void *);
192 #endif /* DEBUG_SRC */
195 /*************** Lst Predicates ****************/
197 *-----------------------------------------------------------------------
199 * See if pref is a prefix of str.
202 * NULL if it ain't, pointer to character in str after prefix if so
206 *-----------------------------------------------------------------------
209 SuffStrIsPrefix(const char *pref, char *str)
212 while (*str && *pref == *str) {
217 return (*pref ? NULL : str);
221 *-----------------------------------------------------------------------
222 * SuffSuffIsSuffix --
223 * See if suff is a suffix of str. Str should point to THE END of the
224 * string to check. (THE END == the null byte)
227 * NULL if it ain't, pointer to character in str before suffix if
232 *-----------------------------------------------------------------------
235 SuffSuffIsSuffix(const Suff *s, char *str)
237 const char *p1; /* Pointer into suffix name */
238 char *p2; /* Pointer into string being examined */
240 p1 = s->name + s->nameLen;
243 while (p1 >= s->name && *p1 == *p2) {
248 return (p1 == s->name - 1 ? p2 : NULL);
252 *-----------------------------------------------------------------------
253 * SuffSuffIsSuffixP --
254 * Predicate form of SuffSuffIsSuffix. Passed as the callback function
258 * 0 if the suffix is the one desired, non-zero if not.
263 * XXX use the function above once constification is complete.
264 *-----------------------------------------------------------------------
267 SuffSuffIsSuffixP(const void *is, const void *str)
270 const char *p1; /* Pointer into suffix name */
271 const char *p2 = str; /* Pointer into string being examined */
273 p1 = s->name + s->nameLen;
275 while (p1 >= s->name && *p1 == *p2) {
280 return (p1 != s->name - 1);
284 *-----------------------------------------------------------------------
285 * SuffSuffHasNameP --
286 * Callback procedure for finding a suffix based on its name. Used by
290 * 0 if the suffix is of the given name. non-zero otherwise.
294 *-----------------------------------------------------------------------
297 SuffSuffHasNameP(const void *s, const void *sname)
300 return (strcmp(sname, ((const Suff *)s)->name));
304 *-----------------------------------------------------------------------
305 * SuffSuffIsPrefix --
306 * See if the suffix described by s is a prefix of the string. Care
307 * must be taken when using this to search for transformations and
308 * what-not, since there could well be two suffixes, one of which
309 * is a prefix of the other...
312 * 0 if s is a prefix of str. non-zero otherwise
317 * XXX use the function above once constification is complete.
318 *-----------------------------------------------------------------------
321 SuffSuffIsPrefix(const void *s, const void *istr)
323 const char *pref = ((const Suff *)s)->name;
324 const char *str = istr;
326 while (*str != '\0' && *pref == *str) {
331 return (*pref != '\0');
335 *-----------------------------------------------------------------------
337 * See if the graph node has the desired name
340 * 0 if it does. non-zero if it doesn't
344 *-----------------------------------------------------------------------
347 SuffGNHasNameP(const void *gn, const void *name)
350 return (strcmp(name, ((const GNode *)gn)->name));
353 /*********** Maintenance Functions ************/
357 * Keep this function for now until it is clear why a .SUFFIXES: doesn't
358 * actually delete the suffixes but just puts them on the suffClean list.
361 *-----------------------------------------------------------------------
363 * Free up all memory associated with the given suffix structure.
369 * the suffix entry is detroyed
370 *-----------------------------------------------------------------------
383 Lst_Destroy(&s->ref, NOFREE);
384 Lst_Destroy(&s->children, NOFREE);
385 Lst_Destroy(&s->parents, NOFREE);
386 Lst_Destroy(&s->searchPath, Dir_Destroy);
394 *-----------------------------------------------------------------------
396 * Remove the suffix into the list
402 * The reference count for the suffix is decremented
403 *-----------------------------------------------------------------------
406 SuffRemove(Lst *l, Suff *s)
408 LstNode *ln = Lst_Member(l, s);
417 *-----------------------------------------------------------------------
419 * Insert the suffix into the list keeping the list ordered by suffix
426 * The reference count of the suffix is incremented
427 *-----------------------------------------------------------------------
430 SuffInsert(Lst *l, Suff *s)
432 LstNode *ln; /* current element in l we're examining */
433 Suff *s2; /* the suffix descriptor in this element */
436 for (ln = Lst_First(l); ln != NULL; ln = Lst_Succ(ln)) {
438 if (s2->sNum >= s->sNum)
442 DEBUGF(SUFF, ("inserting an empty list?..."));
445 DEBUGF(SUFF, ("inserting %s(%d)...", s->name, s->sNum));
447 DEBUGF(SUFF, ("at end of list\n"));
450 Lst_AtEnd(&s->ref, l);
451 } else if (s2->sNum != s->sNum) {
452 DEBUGF(SUFF, ("before %s(%d)\n", s2->name, s2->sNum));
453 Lst_Insert(l, ln, s);
455 Lst_AtEnd(&s->ref, l);
457 DEBUGF(SUFF, ("already there\n"));
462 *-----------------------------------------------------------------------
463 * Suff_ClearSuffixes --
464 * This is gross. Nuke the list of suffixes but keep all transformation
465 * rules around. The transformation graph is destroyed in this process,
466 * but we leave the list of rules so when a new graph is formed the rules
468 * This function is called from the parse module when a
469 * .SUFFIXES:\n line is encountered.
475 * the sufflist and its graph nodes are destroyed
476 *-----------------------------------------------------------------------
479 Suff_ClearSuffixes(void)
482 Lst_Concat(&suffClean, &sufflist, LST_CONCLINK);
485 suffNull = emptySuff;
487 * Clear suffNull's children list (the other suffixes are built new, but
488 * suffNull is used as is).
489 * NOFREE is used because all suffixes are are on the suffClean list.
490 * suffNull should not have parents.
492 Lst_Destroy(&suffNull->children, NOFREE);
496 *-----------------------------------------------------------------------
497 * SuffParseTransform --
498 * Parse a transformation string to find its two component suffixes.
501 * TRUE if the string is a valid transformation and FALSE otherwise.
504 * The passed pointers are overwritten.
506 *-----------------------------------------------------------------------
509 SuffParseTransform(char *str, Suff **srcPtr, Suff **targPtr)
511 LstNode *srcLn; /* element in suffix list of trans source*/
512 Suff *src; /* Source of transformation */
513 LstNode *targLn; /* element in suffix list of trans target*/
514 char *str2; /* Extra pointer (maybe target suffix) */
515 LstNode *singleLn; /* element in suffix list of any suffix
516 * that exactly matches str */
517 Suff *single = NULL;/* Source of possible transformation to
524 * Loop looking first for a suffix that matches the start of the
525 * string and then for one that exactly matches the rest of it. If
526 * we can find two that meet these criteria, we've successfully
531 srcLn = Lst_Find(&sufflist, str, SuffSuffIsPrefix);
533 srcLn = Lst_FindFrom(&sufflist, Lst_Succ(srcLn), str,
538 * Ran out of source suffixes -- no such rule
540 if (singleLn != NULL) {
542 * Not so fast Mr. Smith! There was a suffix that encompassed
543 * the entire string, so we assume it was a transformation
544 * to the null suffix (thank you POSIX). We still prefer to
545 * find a double rule over a singleton, hence we leave this
546 * check until the end.
548 * XXX: Use emptySuff over suffNull?
556 src = Lst_Datum(srcLn);
557 str2 = str + src->nameLen;
562 targLn = Lst_Find(&sufflist, str2, SuffSuffHasNameP);
563 if (targLn != NULL) {
565 *targPtr = Lst_Datum(targLn);
573 *-----------------------------------------------------------------------
574 * Suff_IsTransform --
575 * Return TRUE if the given string is a transformation rule
579 * TRUE if the string is a concatenation of two known suffixes.
584 *-----------------------------------------------------------------------
587 Suff_IsTransform(char *str)
591 return (SuffParseTransform(str, &src, &targ));
595 *-----------------------------------------------------------------------
596 * Suff_AddTransform --
597 * Add the transformation rule described by the line to the
598 * list of rules and place the transformation itself in the graph
601 * The node created for the transformation in the transforms list
604 * The node is placed on the end of the transforms Lst and links are
605 * made between the two suffixes mentioned in the target name
606 *-----------------------------------------------------------------------
609 Suff_AddTransform(char *line)
611 GNode *gn; /* GNode of transformation rule */
612 Suff *s, /* source suffix */
613 *t; /* target suffix */
614 LstNode *ln; /* Node for existing transformation */
616 ln = Lst_Find(&transforms, line, SuffGNHasNameP);
619 * Make a new graph node for the transformation. It will be filled in
620 * by the Parse module.
622 gn = Targ_NewGN(line);
623 Lst_AtEnd(&transforms, gn);
626 * New specification for transformation rule. Just nuke the old list
627 * of commands so they can be filled in again... We don't actually
628 * free the commands themselves, because a given command can be
629 * attached to several different transformations.
632 Lst_Destroy(&gn->commands, NOFREE);
633 Lst_Destroy(&gn->children, NOFREE);
636 gn->type = OP_TRANSFORM;
638 SuffParseTransform(line, &s, &t);
641 * link the two together in the proper relationship and order
643 DEBUGF(SUFF, ("defining transformation from `%s' to `%s'\n",
645 SuffInsert(&t->children, s);
646 SuffInsert(&s->parents, t);
652 *-----------------------------------------------------------------------
653 * Suff_EndTransform --
654 * Handle the finish of a transformation definition, removing the
655 * transformation from the graph if it has neither commands nor
656 * sources. This is a callback procedure for the Parse module via
663 * If the node has no commands or children, the children and parents
664 * lists of the affected suffices are altered.
666 *-----------------------------------------------------------------------
669 Suff_EndTransform(void *gnp, void *dummy __unused)
671 GNode *gn = (GNode *)gnp;
673 if ((gn->type & OP_TRANSFORM) && Lst_IsEmpty(&gn->commands) &&
674 Lst_IsEmpty(&gn->children))
679 * SuffParseTransform() may fail for special rules which are not
680 * actual transformation rules (e.g., .DEFAULT).
682 if (!SuffParseTransform(gn->name, &s, &t))
685 DEBUGF(SUFF, ("deleting transformation from `%s' to `%s'\n",
689 * Remove the source from the target's children list. We check for a
690 * NULL return to handle a beanhead saying something like
693 * We'll be called twice when the next target is seen, but .c and .o
694 * are only linked once...
696 SuffRemove(&t->children, s);
699 * Remove the target from the source's parents list
701 SuffRemove(&s->parents, t);
702 } else if (gn->type & OP_TRANSFORM) {
703 DEBUGF(SUFF, ("transformation %s complete\n", gn->name));
710 *-----------------------------------------------------------------------
711 * SuffRebuildGraph --
712 * Called from Suff_AddSuffix via Lst_ForEach to search through the
713 * list of existing transformation rules and rebuild the transformation
714 * graph when it has been destroyed by Suff_ClearSuffixes. If the
715 * given rule is a transformation involving this suffix and another,
716 * existing suffix, the proper relationship is established between
723 * The appropriate links will be made between this suffix and
724 * others if transformation rules exist for it.
726 *-----------------------------------------------------------------------
729 SuffRebuildGraph(void *transformp, void *sp)
731 GNode *transform = transformp;
738 * First see if it is a transformation from this suffix.
740 cp = SuffStrIsPrefix(s->name, transform->name);
741 if (cp != (char *)NULL) {
742 if (cp[0] == '\0') /* null rule */
745 ln = Lst_Find(&sufflist, cp, SuffSuffHasNameP);
751 * Found target. Link in and return, since it can't be anything
754 SuffInsert(&s2->children, s);
755 SuffInsert(&s->parents, s2);
761 * Not from, maybe to?
763 cp = SuffSuffIsSuffix(s, transform->name + strlen(transform->name));
766 * Null-terminate the source suffix in order to find it.
769 ln = Lst_Find(&sufflist, transform->name, SuffSuffHasNameP);
771 * Replace the start of the target suffix
776 * Found it -- establish the proper relationship
779 SuffInsert(&s->children, s2);
780 SuffInsert(&s2->parents, s);
787 *-----------------------------------------------------------------------
789 * Add the suffix in string to the end of the list of known suffixes.
790 * Should we restructure the suffix graph? Make doesn't...
796 * A GNode is created for the suffix and a Suff structure is created and
797 * added to the suffixes list unless the suffix was already known.
798 *-----------------------------------------------------------------------
801 Suff_AddSuffix(char *str)
803 Suff *s; /* new suffix descriptor */
806 ln = Lst_Find(&sufflist, str, SuffSuffHasNameP);
808 s = emalloc(sizeof(Suff));
810 s->name = estrdup(str);
811 s->nameLen = strlen(s->name);
812 Lst_Init(&s->searchPath);
813 Lst_Init(&s->children);
814 Lst_Init(&s->parents);
820 Lst_AtEnd(&sufflist, s);
823 * Look for any existing transformations from or to this suffix.
824 * XXX: Only do this after a Suff_ClearSuffixes?
826 Lst_ForEach(&transforms, SuffRebuildGraph, s);
831 *-----------------------------------------------------------------------
833 * Return the search path for the given suffix, if it's defined.
836 * The searchPath for the desired suffix or NULL if the suffix isn't
841 *-----------------------------------------------------------------------
844 Suff_GetPath(char *sname)
849 ln = Lst_Find(&sufflist, sname, SuffSuffHasNameP);
854 return (&s->searchPath);
859 *-----------------------------------------------------------------------
861 * Extend the search paths for all suffixes to include the default
868 * The searchPath field of all the suffixes is extended by the
869 * directories in dirSearchPath. If paths were specified for the
870 * ".h" suffix, the directories are stuffed into a global variable
871 * called ".INCLUDES" with each directory preceded by a -I. The same
872 * is done for the ".a" suffix, except the variable is called
873 * ".LIBS" and the flag is -L.
874 *-----------------------------------------------------------------------
882 Lst inIncludes; /* Cumulative .INCLUDES path */
883 Lst inLibs; /* Cumulative .LIBS path */
885 Lst_Init(&inIncludes);
888 for (ln = Lst_First(&sufflist); ln != NULL; ln = Lst_Succ(ln)) {
890 if (!Lst_IsEmpty(&s->searchPath)) {
892 if (s->flags & SUFF_INCLUDE) {
893 Dir_Concat(&inIncludes, &s->searchPath);
895 #endif /* INCLUDES */
897 if (s->flags & SUFF_LIBRARY) {
898 Dir_Concat(&inLibs, &s->searchPath);
900 #endif /* LIBRARIES */
901 Dir_Concat(&s->searchPath, &dirSearchPath);
903 Lst_Destroy(&s->searchPath, Dir_Destroy);
904 Lst_Duplicate(&s->searchPath, &dirSearchPath, Dir_CopyDir);
908 Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", &inIncludes), VAR_GLOBAL);
910 Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", &inLibs), VAR_GLOBAL);
913 Lst_Destroy(&inIncludes, Dir_Destroy);
914 Lst_Destroy(&inLibs, Dir_Destroy);
918 *-----------------------------------------------------------------------
920 * Add the given suffix as a type of file which gets included.
921 * Called from the parse module when a .INCLUDES line is parsed.
922 * The suffix must have already been defined.
928 * The SUFF_INCLUDE bit is set in the suffix's flags field
930 *-----------------------------------------------------------------------
933 Suff_AddInclude(char *sname)
938 ln = Lst_Find(&sufflist, sname, SuffSuffHasNameP);
941 s->flags |= SUFF_INCLUDE;
946 *-----------------------------------------------------------------------
948 * Add the given suffix as a type of file which is a library.
949 * Called from the parse module when parsing a .LIBS line. The
950 * suffix must have been defined via .SUFFIXES before this is
957 * The SUFF_LIBRARY bit is set in the suffix's flags field
959 *-----------------------------------------------------------------------
962 Suff_AddLib(char *sname)
967 ln = Lst_Find(&sufflist, sname, SuffSuffHasNameP);
970 s->flags |= SUFF_LIBRARY;
974 /********** Implicit Source Search Functions *********/
977 *-----------------------------------------------------------------------
979 * Add a suffix as a Src structure to the given list with its parent
980 * being the given Src structure. If the suffix is the null suffix,
981 * the prefix is used unaltered as the file name in the Src structure.
987 * A Src structure is created and tacked onto the end of the list
988 *-----------------------------------------------------------------------
991 SuffAddSrc(void *sp, void *lsp)
995 Src *s2; /* new Src structure */
996 Src *targ; /* Target structure */
1000 if ((s->flags & SUFF_NULL) && (*s->name != '\0')) {
1002 * If the suffix has been marked as the NULL suffix, also create a Src
1003 * structure for a file with no suffix attached. Two birds, and all
1006 s2 = emalloc(sizeof(Src));
1007 s2->file = estrdup(targ->pref);
1008 s2->pref = targ->pref;
1014 targ->children += 1;
1015 Lst_AtEnd(ls->l, s2);
1018 Lst_AtEnd(&targ->cp, s2);
1019 printf("1 add %p %p to %p:", targ, s2, ls->l);
1020 Lst_ForEach(ls->l, PrintAddr, (void *)NULL);
1024 s2 = emalloc(sizeof(Src));
1025 s2->file = str_concat(targ->pref, s->name, 0);
1026 s2->pref = targ->pref;
1032 targ->children += 1;
1033 Lst_AtEnd(ls->l, s2);
1036 Lst_AtEnd(&targ->cp, s2);
1037 printf("2 add %p %p to %p:", targ, s2, ls->l);
1038 Lst_ForEach(ls->l, PrintAddr, (void *)NULL);
1046 *-----------------------------------------------------------------------
1048 * Add all the children of targ as Src structures to the given list
1054 * Lots of structures are created and added to the list
1055 *-----------------------------------------------------------------------
1058 SuffAddLevel(Lst *l, Src *targ)
1065 Lst_ForEach(&targ->suff->children, SuffAddSrc, &ls);
1069 *----------------------------------------------------------------------
1071 * Free all src structures in list that don't have a reference count
1072 * XXX this actually frees only the first of these.
1075 * True if a src was removed
1078 * The memory is free'd.
1079 *----------------------------------------------------------------------
1082 SuffRemoveSrc(Lst *l)
1089 printf("cleaning %lx: ", (unsigned long) l);
1090 Lst_ForEach(l, PrintAddr, (void *)NULL);
1094 for (ln = Lst_First(l); ln != NULL; ln = ln1) {
1097 s = (Src *)Lst_Datum(ln);
1098 if (s->children == 0) {
1104 LstNode *ln = Lst_Member(&s->parent->cp, s);
1106 Lst_Remove(&s->parent->cp, ln);
1108 --s->parent->children;
1111 printf("free: [l=%p] p=%p %d\n", l, s, s->children);
1112 Lst_Destroy(&s->cp, NOFREE);
1121 printf("keep: [l=%p] p=%p %d: ", l, s, s->children);
1122 Lst_ForEach(&s->cp, PrintAddr, (void *)NULL);
1132 *-----------------------------------------------------------------------
1134 * Find the first existing file/target in the list srcs
1137 * The lowest structure in the chain of transformations
1141 *-----------------------------------------------------------------------
1144 SuffFindThem(Lst *srcs, Lst *slst)
1146 Src *s; /* current Src */
1147 Src *rs; /* returned Src */
1152 while (!Lst_IsEmpty (srcs)) {
1153 s = Lst_DeQueue(srcs);
1155 DEBUGF(SUFF, ("\ttrying %s...", s->file));
1158 * A file is considered to exist if either a node exists in the
1159 * graph for it or the file actually exists.
1161 if (Targ_FindNode(s->file, TARG_NOCREATE) != NULL) {
1163 printf("remove %p from %p\n", s, srcs);
1169 if ((ptr = Dir_FindFile(s->file, &s->suff->searchPath)) != NULL) {
1172 printf("remove %p from %p\n", s, srcs);
1178 DEBUGF(SUFF, ("not there\n"));
1180 SuffAddLevel(srcs, s);
1185 DEBUGF(SUFF, ("got it\n"));
1191 *-----------------------------------------------------------------------
1193 * See if any of the children of the target in the Src structure is
1194 * one from which the target can be transformed. If there is one,
1195 * a Src structure is put together for it and returned.
1198 * The Src structure of the "winning" child, or NULL if no such beast.
1201 * A Src structure may be allocated.
1203 *-----------------------------------------------------------------------
1206 SuffFindCmds(Src *targ, Lst *slst)
1208 LstNode *ln; /* General-purpose list node */
1209 GNode *t, /* Target GNode */
1210 *s; /* Source GNode */
1211 int prefLen;/* The length of the defined prefix */
1212 Suff *suff; /* Suffix on matching beastie */
1213 Src *ret; /* Return value */
1217 prefLen = strlen(targ->pref);
1219 for (ln = Lst_First(&t->children); ln != NULL; ln = Lst_Succ(ln)) {
1222 cp = strrchr(s->name, '/');
1228 if (strncmp(cp, targ->pref, prefLen) == 0) {
1230 * The node matches the prefix ok, see if it has a known
1233 ln = Lst_Find(&sufflist, &cp[prefLen], SuffSuffHasNameP);
1236 * It even has a known suffix, see if there's a transformation
1237 * defined between the node's suffix and the target's suffix.
1239 * XXX: Handle multi-stage transformations here, too.
1241 suff = Lst_Datum(ln);
1243 if (Lst_Member(&suff->parents, targ->suff) != NULL) {
1245 * Hot Damn! Create a new Src structure to describe
1246 * this transformation (making sure to duplicate the
1247 * source node's name so Suff_FindDeps can free it
1248 * again (ick)), and return the new structure.
1250 ret = emalloc(sizeof(Src));
1251 ret->file = estrdup(s->name);
1252 ret->pref = targ->pref;
1258 targ->children += 1;
1261 printf("3 add %p %p\n", &targ, ret);
1262 Lst_AtEnd(&targ->cp, ret);
1264 Lst_AtEnd(slst, ret);
1265 DEBUGF(SUFF, ("\tusing existing source %s\n", s->name));
1275 *-----------------------------------------------------------------------
1276 * SuffExpandChildren --
1277 * Expand the names of any children of a given node that contain
1278 * variable invocations or file wildcards into actual targets.
1284 * The expanded node is removed from the parent's list of children,
1285 * and the parent's unmade counter is decremented, but other nodes
1288 *-----------------------------------------------------------------------
1291 SuffExpandChildren(void *cgnp, void *pgnp)
1295 GNode *gn; /* New source 8) */
1296 LstNode *prevLN; /* Node after which new source should be put */
1297 LstNode *ln; /* List element for old source */
1298 char *cp; /* Expanded value */
1302 * New nodes effectively take the place of the child, so place them
1305 prevLN = Lst_Member(&pgn->children, cgn);
1308 * First do variable expansion -- this takes precedence over
1309 * wildcard expansion. If the result contains wildcards, they'll be gotten
1310 * to later since the resulting words are tacked on to the end of
1311 * the children list.
1313 if (strchr(cgn->name, '$') != NULL) {
1314 DEBUGF(SUFF, ("Expanding \"%s\"...", cgn->name));
1315 buf = Var_Subst(NULL, cgn->name, pgn, TRUE);
1316 cp = Buf_GetAll(buf, NULL);
1317 Buf_Destroy(buf, FALSE);
1320 Lst members = Lst_Initializer(members);
1322 if (cgn->type & OP_ARCHV) {
1324 * Node was an archive(member) target, so we want to call
1325 * on the Arch module to find the nodes for us, expanding
1326 * variables in the parent's context.
1328 char *sacrifice = cp;
1330 Arch_ParseArchive(&sacrifice, &members, pgn);
1333 * Break the result into a vector of strings whose nodes
1334 * we can find, then add those nodes to the members list.
1335 * Unfortunately, we can't use brk_string b/c it
1336 * doesn't understand about variable specifications with
1340 char *initcp = cp; /* For freeing... */
1342 for (start = cp; *start == ' ' || *start == '\t'; start++)
1344 for (cp = start; *cp != '\0'; cp++) {
1345 if (*cp == ' ' || *cp == '\t') {
1347 * White-space -- terminate element, find the node,
1348 * add it, skip any further spaces.
1351 gn = Targ_FindNode(start, TARG_CREATE);
1352 Lst_AtEnd(&members, gn);
1353 while (*cp == ' ' || *cp == '\t') {
1357 * Adjust cp for increment at start of loop, but
1358 * set start to first non-space.
1361 } else if (*cp == '$') {
1363 * Start of a variable spec -- contact variable module
1364 * to find the end so we can skip over it.
1370 junk = Var_Parse(cp, pgn, TRUE, &len, &doFree);
1371 if (junk != var_Error) {
1378 } else if (*cp == '\\' && *cp != '\0') {
1380 * Escaped something -- skip over it
1388 * Stuff left over -- add it to the list too
1390 gn = Targ_FindNode(start, TARG_CREATE);
1391 Lst_AtEnd(&members, gn);
1394 * Point cp back at the beginning again so the variable value
1400 * Add all elements of the members list to the parent node.
1402 while(!Lst_IsEmpty(&members)) {
1403 gn = Lst_DeQueue(&members);
1405 DEBUGF(SUFF, ("%s...", gn->name));
1406 if (Lst_Member(&pgn->children, gn) == NULL) {
1407 Lst_Append(&pgn->children, prevLN, gn);
1408 prevLN = Lst_Succ(prevLN);
1409 Lst_AtEnd(&gn->parents, pgn);
1420 * Now the source is expanded, remove it from the list of children to
1421 * keep it from being processed.
1423 ln = Lst_Member(&pgn->children, cgn);
1425 Lst_Remove(&pgn->children, ln);
1426 DEBUGF(SUFF, ("\n"));
1427 } else if (Dir_HasWildcards(cgn->name)) {
1428 Lst exp; /* List of expansions */
1429 Lst *path; /* Search path along which to expand */
1432 * Find a path along which to expand the word.
1434 * If the word has a known suffix, use that path.
1435 * If it has no known suffix and we're allowed to use the null
1436 * suffix, use its path.
1437 * Else use the default system search path.
1439 cp = cgn->name + strlen(cgn->name);
1440 ln = Lst_Find(&sufflist, cp, SuffSuffIsSuffixP);
1442 DEBUGF(SUFF, ("Wildcard expanding \"%s\"...", cgn->name));
1445 Suff *s = Lst_Datum(ln);
1447 DEBUGF(SUFF, ("suffix is \"%s\"...", s->name));
1448 path = &s->searchPath;
1451 * Use default search path
1453 path = &dirSearchPath;
1457 * Expand the word along the chosen path
1460 Dir_Expand(cgn->name, path, &exp);
1462 while (!Lst_IsEmpty(&exp)) {
1464 * Fetch next expansion off the list and find its GNode
1466 cp = Lst_DeQueue(&exp);
1468 DEBUGF(SUFF, ("%s...", cp));
1469 gn = Targ_FindNode(cp, TARG_CREATE);
1472 * If gn isn't already a child of the parent, make it so and
1473 * up the parent's count of unmade children.
1475 if (Lst_Member(&pgn->children, gn) == NULL) {
1476 Lst_Append(&pgn->children, prevLN, gn);
1477 prevLN = Lst_Succ(prevLN);
1478 Lst_AtEnd(&gn->parents, pgn);
1484 * Now the source is expanded, remove it from the list of children to
1485 * keep it from being processed.
1487 ln = Lst_Member(&pgn->children, cgn);
1489 Lst_Remove(&pgn->children, ln);
1490 DEBUGF(SUFF, ("\n"));
1497 *-----------------------------------------------------------------------
1498 * SuffApplyTransform --
1499 * Apply a transformation rule, given the source and target nodes
1503 * TRUE if successful, FALSE if not.
1506 * The source and target are linked and the commands from the
1507 * transformation are added to the target node's commands list.
1508 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1509 * to the target. The target also inherits all the sources for
1510 * the transformation rule.
1512 *-----------------------------------------------------------------------
1515 SuffApplyTransform(GNode *tGn, GNode *sGn, Suff *t, Suff *s)
1517 LstNode *ln; /* General node */
1518 char *tname; /* Name of transformation rule */
1519 GNode *gn; /* Node for same */
1521 if (Lst_Member(&tGn->children, sGn) == NULL) {
1523 * Not already linked, so form the proper links between the
1524 * target and source.
1526 Lst_AtEnd(&tGn->children, sGn);
1527 Lst_AtEnd(&sGn->parents, tGn);
1531 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1533 * When a :: node is used as the implied source of a node, we have
1534 * to link all its cohorts in as sources as well. Only the initial
1535 * sGn gets the target in its iParents list, however, as that
1536 * will be sufficient to get the .IMPSRC variable set for tGn
1538 for (ln = Lst_First(&sGn->cohorts); ln != NULL; ln = Lst_Succ(ln)) {
1541 if (Lst_Member(&tGn->children, gn) == NULL) {
1543 * Not already linked, so form the proper links between the
1544 * target and source.
1546 Lst_AtEnd(&tGn->children, gn);
1547 Lst_AtEnd(&gn->parents, tGn);
1553 * Locate the transformation rule itself
1555 tname = str_concat(s->name, t->name, 0);
1556 ln = Lst_Find(&transforms, tname, SuffGNHasNameP);
1561 * Not really such a transformation rule (can happen when we're
1562 * called to link an OP_MEMBER and OP_ARCHV node), so return
1570 DEBUGF(SUFF, ("\tapplying %s -> %s to \"%s\"\n", s->name, t->name, tGn->name));
1573 * Record last child for expansion purposes
1575 ln = Lst_Last(&tGn->children);
1578 * Pass the buck to Make_HandleUse to apply the rule
1580 Make_HandleUse(gn, tGn);
1583 * Deal with wildcards and variables in any acquired sources
1587 Lst_ForEachFrom(&tGn->children, ln, SuffExpandChildren, tGn);
1591 * Keep track of another parent to which this beast is transformed so
1592 * the .IMPSRC variable can be set correctly for the parent.
1594 Lst_AtEnd(&sGn->iParents, tGn);
1601 *-----------------------------------------------------------------------
1602 * SuffFindArchiveDeps --
1603 * Locate dependencies for an OP_ARCHV node.
1609 * Same as Suff_FindDeps
1611 *-----------------------------------------------------------------------
1614 SuffFindArchiveDeps(GNode *gn, Lst *slst)
1616 char *eoarch; /* End of archive portion */
1617 char *eoname; /* End of member portion */
1618 GNode *mem; /* Node for member */
1619 /* Variables to be copied from the member node */
1620 static const char *copy[] = {
1621 TARGET, /* Must be first */
1622 PREFIX, /* Must be second */
1624 int i; /* Index into copy and vals */
1625 Suff *ms; /* Suffix descriptor for member */
1626 char *name; /* Start of member's name */
1629 * The node is an archive(member) pair. so we must find a
1630 * suffix for both of them.
1632 eoarch = strchr(gn->name, '(');
1633 eoname = strchr(eoarch, ')');
1635 *eoname = '\0'; /* Nuke parentheses during suffix search */
1636 *eoarch = '\0'; /* So a suffix can be found */
1641 * To simplify things, call Suff_FindDeps recursively on the member now,
1642 * so we can simply compare the member's .PREFIX and .TARGET variables
1643 * to locate its suffix. This allows us to figure out the suffix to
1644 * use for the archive without having to do a quadratic search over the
1645 * suffix list, backtracking for each one...
1647 mem = Targ_FindNode(name, TARG_CREATE);
1648 SuffFindDeps(mem, slst);
1651 * Create the link between the two nodes right off
1653 if (Lst_Member(&gn->children, mem) == NULL) {
1654 Lst_AtEnd(&gn->children, mem);
1655 Lst_AtEnd(&mem->parents, gn);
1660 * Copy in the variables from the member node to this one.
1662 for (i = (sizeof(copy) / sizeof(copy[0]))-1; i >= 0; i--) {
1664 Var_Set(copy[i], Var_Value(copy[i], mem, &p1), gn);
1672 * Didn't know what it was -- use .NULL suffix if not in make mode
1674 DEBUGF(SUFF, ("using null suffix\n"));
1680 * Set the other two local variables required for this target.
1682 Var_Set(MEMBER, name, gn);
1683 Var_Set(ARCHIVE, gn->name, gn);
1687 * Member has a known suffix, so look for a transformation rule from
1688 * it to a possible suffix of the archive. Rather than searching
1689 * through the entire list, we just look at suffixes to which the
1690 * member's suffix may be transformed...
1695 * Use first matching suffix...
1697 ln = Lst_Find(&ms->parents, eoarch, SuffSuffIsSuffixP);
1701 * Got one -- apply it
1703 if (!SuffApplyTransform(gn, mem, Lst_Datum(ln), ms)) {
1704 DEBUGF(SUFF, ("\tNo transformation from %s -> %s\n",
1705 ms->name, ((Suff *)Lst_Datum(ln))->name));
1711 * Replace the opening and closing parens now we've no need of the separate
1714 *eoarch = '('; *eoname = ')';
1717 * Pretend gn appeared to the left of a dependency operator so
1718 * the user needn't provide a transformation from the member to the
1721 if (OP_NOP(gn->type)) {
1722 gn->type |= OP_DEPENDS;
1726 * Flag the member as such so we remember to look in the archive for
1727 * its modification time.
1729 mem->type |= OP_MEMBER;
1733 *-----------------------------------------------------------------------
1734 * SuffFindNormalDeps --
1735 * Locate implicit dependencies for regular targets.
1741 * Same as Suff_FindDeps...
1743 *-----------------------------------------------------------------------
1746 SuffFindNormalDeps(GNode *gn, Lst *slst)
1748 char *eoname; /* End of name */
1749 char *sopref; /* Start of prefix */
1750 LstNode *ln; /* Next suffix node to check */
1751 Lst srcs; /* List of sources at which to look */
1752 Lst targs; /* List of targets to which things can be
1753 * transformed. They all have the same file,
1754 * but different suff and pref fields */
1755 Src *bottom; /* Start of found transformation path */
1756 Src *src; /* General Src pointer */
1757 char *pref; /* Prefix to use */
1758 Src *targ; /* General Src target pointer */
1761 eoname = gn->name + strlen(gn->name);
1766 * Begin at the beginning...
1768 ln = Lst_First(&sufflist);
1773 * We're caught in a catch-22 here. On the one hand, we want to use any
1774 * transformation implied by the target's sources, but we can't examine
1775 * the sources until we've expanded any variables/wildcards they may hold,
1776 * and we can't do that until we've set up the target's local variables
1777 * and we can't do that until we know what the proper suffix for the
1778 * target is (in case there are two suffixes one of which is a suffix of
1779 * the other) and we can't know that until we've found its implied
1780 * source, which we may not want to use if there's an existing source
1781 * that implies a different transformation.
1783 * In an attempt to get around this, which may not work all the time,
1784 * but should work most of the time, we look for implied sources first,
1785 * checking transformations to all possible suffixes of the target,
1786 * use what we find to set the target's local variables, expand the
1787 * children, then look for any overriding transformations they imply.
1788 * Should we find one, we discard the one we found before.
1791 while (ln != NULL) {
1793 * Look for next possible suffix...
1795 ln = Lst_FindFrom(&sufflist, ln, eoname, SuffSuffIsSuffixP);
1798 int prefLen; /* Length of the prefix */
1802 * Allocate a Src structure to which things can be transformed
1804 target = emalloc(sizeof(Src));
1805 target->file = estrdup(gn->name);
1806 target->suff = Lst_Datum(ln);
1807 target->suff->refCount++;
1809 target->parent = NULL;
1810 target->children = 0;
1812 Lst_Init(&target->cp);
1816 * Allocate room for the prefix, whose end is found by subtracting
1817 * the length of the suffix from the end of the name.
1819 prefLen = (eoname - target->suff->nameLen) - sopref;
1820 target->pref = emalloc(prefLen + 1);
1821 memcpy(target->pref, sopref, prefLen);
1822 target->pref[prefLen] = '\0';
1825 * Add nodes from which the target can be made
1827 SuffAddLevel(&srcs, target);
1830 * Record the target so we can nuke it
1832 Lst_AtEnd(&targs, target);
1835 * Search from this suffix's successor...
1842 * Handle target of unknown suffix...
1844 if (Lst_IsEmpty(&targs) && suffNull != NULL) {
1845 DEBUGF(SUFF, ("\tNo known suffix on %s. Using .NULL suffix\n", gn->name));
1847 targ = emalloc(sizeof(Src));
1848 targ->file = estrdup(gn->name);
1849 targ->suff = suffNull;
1850 targ->suff->refCount++;
1852 targ->parent = NULL;
1854 targ->pref = estrdup(sopref);
1856 Lst_Init(&targ->cp);
1860 * Only use the default suffix rules if we don't have commands
1861 * or dependencies defined for this gnode
1863 if (Lst_IsEmpty(&gn->commands) && Lst_IsEmpty(&gn->children))
1864 SuffAddLevel(&srcs, targ);
1866 DEBUGF(SUFF, ("not "));
1869 DEBUGF(SUFF, ("adding suffix rules\n"));
1871 Lst_AtEnd(&targs, targ);
1875 * Using the list of possible sources built up from the target suffix(es),
1876 * try and find an existing file/target that matches.
1878 bottom = SuffFindThem(&srcs, slst);
1880 if (bottom == NULL) {
1882 * No known transformations -- use the first suffix found for setting
1883 * the local variables.
1885 if (!Lst_IsEmpty(&targs)) {
1886 targ = Lst_Datum(Lst_First(&targs));
1892 * Work up the transformation path to find the suffix of the
1893 * target to which the transformation was made.
1895 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1900 * The .TARGET variable we always set to be the name at this point,
1901 * since it's only set to the path if the thing is only a source and
1902 * if it's only a source, it doesn't matter what we put here as far
1903 * as expanding sources is concerned, since it has none...
1905 Var_Set(TARGET, gn->name, gn);
1907 pref = (targ != NULL) ? targ->pref : gn->name;
1908 Var_Set(PREFIX, pref, gn);
1911 * Now we've got the important local variables set, expand any sources
1912 * that still contain variables or wildcards in their names.
1914 Lst_ForEach(&gn->children, SuffExpandChildren, (void *)gn);
1917 DEBUGF(SUFF, ("\tNo valid suffix on %s\n", gn->name));
1921 * Deal with finding the thing on the default search path if the
1922 * node is only a source (not on the lhs of a dependency operator
1923 * or [XXX] it has neither children or commands).
1925 if (OP_NOP(gn->type) ||
1926 (Lst_IsEmpty(&gn->children) && Lst_IsEmpty(&gn->commands)))
1928 gn->path = Dir_FindFile(gn->name,
1929 (targ == NULL ? &dirSearchPath :
1930 &targ->suff->searchPath));
1931 if (gn->path != NULL) {
1933 Var_Set(TARGET, gn->path, gn);
1937 * Suffix known for the thing -- trim the suffix off
1938 * the path to form the proper .PREFIX variable.
1940 int savep = strlen(gn->path) - targ->suff->nameLen;
1944 gn->suffix->refCount--;
1945 gn->suffix = targ->suff;
1946 gn->suffix->refCount++;
1948 savec = gn->path[savep];
1949 gn->path[savep] = '\0';
1951 if ((ptr = strrchr(gn->path, '/')) != NULL)
1956 Var_Set(PREFIX, ptr, gn);
1958 gn->path[savep] = savec;
1961 * The .PREFIX gets the full path if the target has
1965 gn->suffix->refCount--;
1968 if ((ptr = strrchr(gn->path, '/')) != NULL)
1973 Var_Set(PREFIX, ptr, gn);
1978 * Not appropriate to search for the thing -- set the
1979 * path to be the name so Dir_MTime won't go grovelling for
1983 gn->suffix->refCount--;
1984 gn->suffix = (targ == NULL) ? NULL : targ->suff;
1986 gn->suffix->refCount++;
1988 gn->path = estrdup(gn->name);
1995 * If the suffix indicates that the target is a library, mark that in
1996 * the node's type field.
1998 if (targ->suff->flags & SUFF_LIBRARY) {
2003 * Check for overriding transformation rule implied by sources
2005 if (!Lst_IsEmpty(&gn->children)) {
2006 src = SuffFindCmds(targ, slst);
2010 * Free up all the Src structures in the transformation path
2011 * up to, but not including, the parent node.
2013 while (bottom && bottom->parent != NULL) {
2014 if (Lst_Member(slst, bottom) == NULL) {
2015 Lst_AtEnd(slst, bottom);
2017 bottom = bottom->parent;
2023 if (bottom == NULL) {
2025 * No idea from where it can come -- return now.
2031 * We now have a list of Src structures headed by 'bottom' and linked via
2032 * their 'parent' pointers. What we do next is create links between
2033 * source and target nodes (which may or may not have been created)
2034 * and set the necessary local variables in each target. The
2035 * commands for each target are set from the commands of the
2036 * transformation rule used to get from the src suffix to the targ
2037 * suffix. Note that this causes the commands list of the original
2038 * node, gn, to be replaced by the commands of the final
2039 * transformation rule. Also, the unmade field of gn is incremented.
2042 if (bottom->node == NULL) {
2043 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
2046 for (src = bottom; src->parent != NULL; src = src->parent) {
2049 if (src->node->suffix)
2050 src->node->suffix->refCount--;
2051 src->node->suffix = src->suff;
2052 src->node->suffix->refCount++;
2054 if (targ->node == NULL) {
2055 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
2058 SuffApplyTransform(targ->node, src->node,
2059 targ->suff, src->suff);
2061 if (targ->node != gn) {
2063 * Finish off the dependency-search process for any nodes
2064 * between bottom and gn (no point in questing around the
2065 * filesystem for their implicit source when it's already
2066 * known). Note that the node can't have any sources that
2067 * need expanding, since SuffFindThem will stop on an existing
2068 * node, so all we need to do is set the standard and System V
2071 targ->node->type |= OP_DEPS_FOUND;
2073 Var_Set(PREFIX, targ->pref, targ->node);
2075 Var_Set(TARGET, targ->node->name, targ->node);
2080 gn->suffix->refCount--;
2081 gn->suffix = src->suff;
2082 gn->suffix->refCount++;
2085 * So Dir_MTime doesn't go questing for it...
2088 gn->path = estrdup(gn->name);
2091 * Nuke the transformation path and the Src structures left over in the
2096 if (Lst_Member(slst, bottom) == NULL)
2097 Lst_AtEnd(slst, bottom);
2099 while (SuffRemoveSrc(&srcs) || SuffRemoveSrc(&targs))
2102 Lst_Concat(slst, &srcs, LST_CONCLINK);
2103 Lst_Concat(slst, &targs, LST_CONCLINK);
2107 *-----------------------------------------------------------------------
2109 * Find implicit sources for the target described by the graph node
2116 * Nodes are added to the graph below the passed-in node. The nodes
2117 * are marked to have their IMPSRC variable filled in. The
2118 * PREFIX variable is set for the given node and all its
2122 * The path found by this target is the shortest path in the
2123 * transformation graph, which may pass through non-existent targets,
2124 * to an existing target. The search continues on all paths from the
2125 * root suffix until a file is found. I.e. if there's a path
2126 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2127 * the .c and .l files don't, the search will branch out in
2128 * all directions from .o and again from all the nodes on the
2129 * next level until the .l,v node is encountered.
2131 *-----------------------------------------------------------------------
2134 Suff_FindDeps(GNode *gn)
2137 SuffFindDeps(gn, &srclist);
2138 while (SuffRemoveSrc(&srclist))
2144 SuffFindDeps(GNode *gn, Lst *slst)
2147 if (gn->type & OP_DEPS_FOUND) {
2149 * If dependencies already found, no need to do it again...
2153 gn->type |= OP_DEPS_FOUND;
2156 DEBUGF(SUFF, ("SuffFindDeps (%s)\n", gn->name));
2158 if (gn->type & OP_ARCHV) {
2159 SuffFindArchiveDeps(gn, slst);
2160 } else if (gn->type & OP_LIB) {
2162 * If the node is a library, it is the arch module's job to find it
2163 * and set the TARGET variable accordingly. We merely provide the
2164 * search path, assuming all libraries end in ".a" (if the suffix
2165 * hasn't been defined, there's nothing we can do for it, so we just
2166 * set the TARGET variable to the node's name in order to give it a
2172 ln = Lst_Find(&sufflist, LIBSUFF, SuffSuffHasNameP);
2174 gn->suffix->refCount--;
2176 gn->suffix = s = Lst_Datum(ln);
2177 gn->suffix->refCount++;
2178 Arch_FindLib(gn, &s->searchPath);
2181 Var_Set(TARGET, gn->name, gn);
2184 * Because a library (-lfoo) target doesn't follow the standard
2185 * filesystem conventions, we don't set the regular variables for
2186 * the thing. .PREFIX is simply made empty...
2188 Var_Set(PREFIX, "", gn);
2190 SuffFindNormalDeps(gn, slst);
2195 *-----------------------------------------------------------------------
2197 * Define which suffix is the null suffix.
2203 * 'suffNull' is altered.
2206 * Need to handle the changing of the null suffix gracefully so the
2207 * old transformation rules don't just go away.
2209 *-----------------------------------------------------------------------
2212 Suff_SetNull(char *name)
2217 ln = Lst_Find(&sufflist, name, SuffSuffHasNameP);
2220 if (suffNull != NULL) {
2221 suffNull->flags &= ~SUFF_NULL;
2223 s->flags |= SUFF_NULL;
2225 * XXX: Here's where the transformation mangling would take place
2229 Parse_Error(PARSE_WARNING, "Desired null suffix %s not defined.",
2235 *-----------------------------------------------------------------------
2237 * Initialize suffixes module
2244 *-----------------------------------------------------------------------
2252 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2253 * actually go on the suffix list or everyone will think that's its
2256 emptySuff = suffNull = emalloc(sizeof(Suff));
2258 suffNull->name = estrdup("");
2259 suffNull->nameLen = 0;
2260 Lst_Init(&suffNull->searchPath);
2261 Dir_Concat(&suffNull->searchPath, &dirSearchPath);
2262 Lst_Init(&suffNull->children);
2263 Lst_Init(&suffNull->parents);
2264 Lst_Init(&suffNull->ref);
2265 suffNull->sNum = sNum++;
2266 suffNull->flags = SUFF_NULL;
2267 suffNull->refCount = 1;
2270 /********************* DEBUGGING FUNCTIONS **********************/
2273 SuffPrintName(void *s, void *dummy __unused)
2276 printf("`%s' ", ((Suff *)s)->name);
2281 SuffPrintSuff(void *sp, void *dummy __unused)
2287 printf("# `%s' [%d] ", s->name, s->refCount);
2291 fputs(" (", stdout);
2293 flag = 1 << (ffs(flags) - 1);
2308 fputc(flags ? '|' : ')', stdout);
2311 fputc('\n', stdout);
2313 Lst_ForEach(&s->parents, SuffPrintName, (void *)NULL);
2314 fputc('\n', stdout);
2315 printf("#\tFrom: ");
2316 Lst_ForEach(&s->children, SuffPrintName, (void *)NULL);
2317 fputc('\n', stdout);
2318 printf("#\tSearch Path: ");
2319 Dir_PrintPath(&s->searchPath);
2320 fputc('\n', stdout);
2325 SuffPrintTrans(void *tp, void *dummy __unused)
2329 printf("%-16s: ", t->name);
2330 Targ_PrintType(t->type);
2331 fputc('\n', stdout);
2332 Lst_ForEach(&t->commands, Targ_PrintCmd, (void *)NULL);
2333 fputc('\n', stdout);
2341 printf("#*** Suffixes:\n");
2342 Lst_ForEach(&sufflist, SuffPrintSuff, (void *)NULL);
2344 printf("#*** Transformations:\n");
2345 Lst_ForEach(&transforms, SuffPrintTrans, (void *)NULL);
2351 * Print the address of a node.
2354 PrintAddr(void *a, void *b __unused)
2359 #endif /* DEBUG_SRC */