1 /* $NetBSD: suff.c,v 1.75 2015/12/20 22:44:10 sjg Exp $ */
4 * Copyright (c) 1988, 1989, 1990, 1993
5 * The Regents of the University of California. All rights reserved.
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. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * Copyright (c) 1989 by Berkeley Softworks
37 * All rights reserved.
39 * This code is derived from software contributed to Berkeley by
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by the University of
53 * California, Berkeley and its contributors.
54 * 4. Neither the name of the University nor the names of its contributors
55 * may be used to endorse or promote products derived from this software
56 * without specific prior written permission.
58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
72 static char rcsid[] = "$NetBSD: suff.c,v 1.75 2015/12/20 22:44:10 sjg Exp $";
74 #include <sys/cdefs.h>
77 static char sccsid[] = "@(#)suff.c 8.4 (Berkeley) 3/21/94";
79 __RCSID("$NetBSD: suff.c,v 1.75 2015/12/20 22:44:10 sjg Exp $");
86 * Functions to maintain suffix lists and find implicit dependents
87 * using suffix transformation rules
90 * Suff_Init Initialize all things to do with suffixes.
92 * Suff_End Cleanup the module
94 * Suff_DoPaths This function is used to make life easier
95 * when searching for a file according to its
96 * suffix. It takes the global search path,
97 * as defined using the .PATH: target, and appends
98 * its directories to the path of each of the
99 * defined suffixes, as specified using
100 * .PATH<suffix>: targets. In addition, all
101 * directories given for suffixes labeled as
102 * include files or libraries, using the .INCLUDES
103 * or .LIBS targets, are played with using
104 * Dir_MakeFlags to create the .INCLUDES and
105 * .LIBS global variables.
107 * Suff_ClearSuffixes Clear out all the suffixes and defined
110 * Suff_IsTransform Return TRUE if the passed string is the lhs
111 * of a transformation rule.
113 * Suff_AddSuffix Add the passed string as another known suffix.
115 * Suff_GetPath Return the search path for the given suffix.
117 * Suff_AddInclude Mark the given suffix as denoting an include
120 * Suff_AddLib Mark the given suffix as denoting a library.
122 * Suff_AddTransform Add another transformation to the suffix
123 * graph. Returns GNode suitable for framing, I
124 * mean, tacking commands, attributes, etc. on.
126 * Suff_SetNull Define the suffix to consider the suffix of
127 * any file that doesn't have a known one.
129 * Suff_FindDeps Find implicit sources for and the location of
130 * a target based on its suffix. Returns the
131 * bottom-most node added to the graph or NULL
132 * if the target had no implicit sources.
134 * Suff_FindPath Return the appropriate path to search in
135 * order to find the node.
143 static Lst sufflist; /* Lst of suffixes */
145 static Lst suffClean; /* Lst of suffixes to be cleaned */
147 static Lst srclist; /* Lst of sources */
148 static Lst transforms; /* Lst of transformation rules */
150 static int sNum = 0; /* Counter for assigning suffix numbers */
153 * Structure describing an individual suffix.
155 typedef struct _Suff {
156 char *name; /* The suffix itself */
157 int nameLen; /* Length of the suffix */
158 short flags; /* Type of suffix */
159 #define SUFF_INCLUDE 0x01 /* One which is #include'd */
160 #define SUFF_LIBRARY 0x02 /* One which contains a library */
161 #define SUFF_NULL 0x04 /* The empty suffix */
162 Lst searchPath; /* The path along which files of this suffix
164 int sNum; /* The suffix number */
165 int refCount; /* Reference count of list membership */
166 Lst parents; /* Suffixes we have a transformation to */
167 Lst children; /* Suffixes we have a transformation from */
168 Lst ref; /* List of lists this suffix is referenced */
172 * for SuffSuffIsSuffix
175 char *ename; /* The end of the name */
176 int len; /* Length of the name */
180 * Structure used in the search for implied sources.
182 typedef struct _Src {
183 char *file; /* The file to look for */
184 char *pref; /* Prefix from which file was formed */
185 Suff *suff; /* The suffix on the file */
186 struct _Src *parent; /* The Src for which this is a source */
187 GNode *node; /* The node describing the file */
188 int children; /* Count of existing children (so we don't free
189 * this thing too early or never nuke it) */
191 Lst cp; /* Debug; children list */
196 * A structure for passing more than one argument to the Lst-library-invoked
210 static Suff *suffNull; /* The NULL suffix for this run */
211 static Suff *emptySuff; /* The empty suffix required for POSIX
212 * single-suffix transformation rules */
215 static const char *SuffStrIsPrefix(const char *, const char *);
216 static char *SuffSuffIsSuffix(const Suff *, const SuffixCmpData *);
217 static int SuffSuffIsSuffixP(const void *, const void *);
218 static int SuffSuffHasNameP(const void *, const void *);
219 static int SuffSuffIsPrefix(const void *, const void *);
220 static int SuffGNHasNameP(const void *, const void *);
221 static void SuffUnRef(void *, void *);
222 static void SuffFree(void *);
223 static void SuffInsert(Lst, Suff *);
224 static void SuffRemove(Lst, Suff *);
225 static Boolean SuffParseTransform(char *, Suff **, Suff **);
226 static int SuffRebuildGraph(void *, void *);
227 static int SuffScanTargets(void *, void *);
228 static int SuffAddSrc(void *, void *);
229 static int SuffRemoveSrc(Lst);
230 static void SuffAddLevel(Lst, Src *);
231 static Src *SuffFindThem(Lst, Lst);
232 static Src *SuffFindCmds(Src *, Lst);
233 static void SuffExpandChildren(LstNode, GNode *);
234 static void SuffExpandWildcards(LstNode, GNode *);
235 static Boolean SuffApplyTransform(GNode *, GNode *, Suff *, Suff *);
236 static void SuffFindDeps(GNode *, Lst);
237 static void SuffFindArchiveDeps(GNode *, Lst);
238 static void SuffFindNormalDeps(GNode *, Lst);
239 static int SuffPrintName(void *, void *);
240 static int SuffPrintSuff(void *, void *);
241 static int SuffPrintTrans(void *, void *);
243 /*************** Lst Predicates ****************/
245 *-----------------------------------------------------------------------
247 * See if pref is a prefix of str.
250 * pref possible prefix
251 * str string to check
254 * NULL if it ain't, pointer to character in str after prefix if so
258 *-----------------------------------------------------------------------
261 SuffStrIsPrefix(const char *pref, const char *str)
263 while (*str && *pref == *str) {
268 return (*pref ? NULL : str);
272 *-----------------------------------------------------------------------
273 * SuffSuffIsSuffix --
274 * See if suff is a suffix of str. sd->ename should point to THE END
275 * of the string to check. (THE END == the null byte)
279 * sd string to examine
282 * NULL if it ain't, pointer to character in str before suffix if
287 *-----------------------------------------------------------------------
290 SuffSuffIsSuffix(const Suff *s, const SuffixCmpData *sd)
292 char *p1; /* Pointer into suffix name */
293 char *p2; /* Pointer into string being examined */
295 if (sd->len < s->nameLen)
296 return NULL; /* this string is shorter than the suffix */
298 p1 = s->name + s->nameLen;
301 while (p1 >= s->name && *p1 == *p2) {
306 return (p1 == s->name - 1 ? p2 : NULL);
310 *-----------------------------------------------------------------------
311 * SuffSuffIsSuffixP --
312 * Predicate form of SuffSuffIsSuffix. Passed as the callback function
316 * 0 if the suffix is the one desired, non-zero if not.
321 *-----------------------------------------------------------------------
324 SuffSuffIsSuffixP(const void *s, const void *sd)
326 return(!SuffSuffIsSuffix(s, sd));
330 *-----------------------------------------------------------------------
331 * SuffSuffHasNameP --
332 * Callback procedure for finding a suffix based on its name. Used by
340 * 0 if the suffix is of the given name. non-zero otherwise.
344 *-----------------------------------------------------------------------
347 SuffSuffHasNameP(const void *s, const void *sname)
349 return (strcmp(sname, ((const Suff *)s)->name));
353 *-----------------------------------------------------------------------
354 * SuffSuffIsPrefix --
355 * See if the suffix described by s is a prefix of the string. Care
356 * must be taken when using this to search for transformations and
357 * what-not, since there could well be two suffixes, one of which
358 * is a prefix of the other...
361 * s suffix to compare
362 * str string to examine
365 * 0 if s is a prefix of str. non-zero otherwise
369 *-----------------------------------------------------------------------
372 SuffSuffIsPrefix(const void *s, const void *str)
374 return SuffStrIsPrefix(((const Suff *)s)->name, str) == NULL;
378 *-----------------------------------------------------------------------
380 * See if the graph node has the desired name
383 * gn current node we're looking at
384 * name name we're looking for
387 * 0 if it does. non-zero if it doesn't
391 *-----------------------------------------------------------------------
394 SuffGNHasNameP(const void *gn, const void *name)
396 return (strcmp(name, ((const GNode *)gn)->name));
399 /*********** Maintenance Functions ************/
402 SuffUnRef(void *lp, void *sp)
406 LstNode ln = Lst_Member(l, sp);
409 ((Suff *)sp)->refCount--;
414 *-----------------------------------------------------------------------
416 * Free up all memory associated with the given suffix structure.
422 * the suffix entry is detroyed
423 *-----------------------------------------------------------------------
428 Suff *s = (Suff *)sp;
437 /* We don't delete suffixes in order, so we cannot use this */
439 Punt("Internal error deleting suffix `%s' with refcount = %d", s->name,
443 Lst_Destroy(s->ref, NULL);
444 Lst_Destroy(s->children, NULL);
445 Lst_Destroy(s->parents, NULL);
446 Lst_Destroy(s->searchPath, Dir_Destroy);
453 *-----------------------------------------------------------------------
455 * Remove the suffix into the list
461 * The reference count for the suffix is decremented and the
462 * suffix is possibly freed
463 *-----------------------------------------------------------------------
466 SuffRemove(Lst l, Suff *s)
469 if (s->refCount == 0) {
470 SuffUnRef(sufflist, s);
476 *-----------------------------------------------------------------------
478 * Insert the suffix into the list keeping the list ordered by suffix
482 * l the list where in s should be inserted
483 * s the suffix to insert
489 * The reference count of the suffix is incremented
490 *-----------------------------------------------------------------------
493 SuffInsert(Lst l, Suff *s)
495 LstNode ln; /* current element in l we're examining */
496 Suff *s2 = NULL; /* the suffix descriptor in this element */
498 if (Lst_Open(l) == FAILURE) {
501 while ((ln = Lst_Next(l)) != NULL) {
502 s2 = (Suff *)Lst_Datum(ln);
503 if (s2->sNum >= s->sNum) {
510 fprintf(debug_file, "inserting %s(%d)...", s->name, s->sNum);
514 fprintf(debug_file, "at end of list\n");
516 (void)Lst_AtEnd(l, s);
518 (void)Lst_AtEnd(s->ref, l);
519 } else if (s2->sNum != s->sNum) {
521 fprintf(debug_file, "before %s(%d)\n", s2->name, s2->sNum);
523 (void)Lst_InsertBefore(l, ln, s);
525 (void)Lst_AtEnd(s->ref, l);
526 } else if (DEBUG(SUFF)) {
527 fprintf(debug_file, "already there\n");
532 *-----------------------------------------------------------------------
533 * Suff_ClearSuffixes --
534 * This is gross. Nuke the list of suffixes but keep all transformation
535 * rules around. The transformation graph is destroyed in this process,
536 * but we leave the list of rules so when a new graph is formed the rules
538 * This function is called from the parse module when a
539 * .SUFFIXES:\n line is encountered.
545 * the sufflist and its graph nodes are destroyed
546 *-----------------------------------------------------------------------
549 Suff_ClearSuffixes(void)
552 Lst_Concat(suffClean, sufflist, LST_CONCLINK);
554 sufflist = Lst_Init(FALSE);
558 emptySuff = suffNull = bmake_malloc(sizeof(Suff));
560 suffNull->name = bmake_strdup("");
561 suffNull->nameLen = 0;
562 suffNull->searchPath = Lst_Init(FALSE);
563 Dir_Concat(suffNull->searchPath, dirSearchPath);
564 suffNull->children = Lst_Init(FALSE);
565 suffNull->parents = Lst_Init(FALSE);
566 suffNull->ref = Lst_Init(FALSE);
567 suffNull->sNum = sNum++;
568 suffNull->flags = SUFF_NULL;
569 suffNull->refCount = 1;
573 *-----------------------------------------------------------------------
574 * SuffParseTransform --
575 * Parse a transformation string to find its two component suffixes.
578 * str String being parsed
579 * srcPtr Place to store source of trans.
580 * targPtr Place to store target of trans.
583 * TRUE if the string is a valid transformation and FALSE otherwise.
586 * The passed pointers are overwritten.
588 *-----------------------------------------------------------------------
591 SuffParseTransform(char *str, Suff **srcPtr, Suff **targPtr)
593 LstNode srcLn; /* element in suffix list of trans source*/
594 Suff *src; /* Source of transformation */
595 LstNode targLn; /* element in suffix list of trans target*/
596 char *str2; /* Extra pointer (maybe target suffix) */
597 LstNode singleLn; /* element in suffix list of any suffix
598 * that exactly matches str */
599 Suff *single = NULL;/* Source of possible transformation to
606 * Loop looking first for a suffix that matches the start of the
607 * string and then for one that exactly matches the rest of it. If
608 * we can find two that meet these criteria, we've successfully
613 srcLn = Lst_Find(sufflist, str, SuffSuffIsPrefix);
615 srcLn = Lst_FindFrom(sufflist, Lst_Succ(srcLn), str,
620 * Ran out of source suffixes -- no such rule
622 if (singleLn != NULL) {
624 * Not so fast Mr. Smith! There was a suffix that encompassed
625 * the entire string, so we assume it was a transformation
626 * to the null suffix (thank you POSIX). We still prefer to
627 * find a double rule over a singleton, hence we leave this
628 * check until the end.
630 * XXX: Use emptySuff over suffNull?
638 src = (Suff *)Lst_Datum(srcLn);
639 str2 = str + src->nameLen;
644 targLn = Lst_Find(sufflist, str2, SuffSuffHasNameP);
645 if (targLn != NULL) {
647 *targPtr = (Suff *)Lst_Datum(targLn);
655 *-----------------------------------------------------------------------
656 * Suff_IsTransform --
657 * Return TRUE if the given string is a transformation rule
661 * str string to check
664 * TRUE if the string is a concatenation of two known suffixes.
669 *-----------------------------------------------------------------------
672 Suff_IsTransform(char *str)
676 return (SuffParseTransform(str, &src, &targ));
680 *-----------------------------------------------------------------------
681 * Suff_AddTransform --
682 * Add the transformation rule described by the line to the
683 * list of rules and place the transformation itself in the graph
686 * line name of transformation to add
689 * The node created for the transformation in the transforms list
692 * The node is placed on the end of the transforms Lst and links are
693 * made between the two suffixes mentioned in the target name
694 *-----------------------------------------------------------------------
697 Suff_AddTransform(char *line)
699 GNode *gn; /* GNode of transformation rule */
700 Suff *s, /* source suffix */
701 *t; /* target suffix */
702 LstNode ln; /* Node for existing transformation */
704 ln = Lst_Find(transforms, line, SuffGNHasNameP);
707 * Make a new graph node for the transformation. It will be filled in
708 * by the Parse module.
710 gn = Targ_NewGN(line);
711 (void)Lst_AtEnd(transforms, gn);
714 * New specification for transformation rule. Just nuke the old list
715 * of commands so they can be filled in again... We don't actually
716 * free the commands themselves, because a given command can be
717 * attached to several different transformations.
719 gn = (GNode *)Lst_Datum(ln);
720 Lst_Destroy(gn->commands, NULL);
721 Lst_Destroy(gn->children, NULL);
722 gn->commands = Lst_Init(FALSE);
723 gn->children = Lst_Init(FALSE);
726 gn->type = OP_TRANSFORM;
728 (void)SuffParseTransform(line, &s, &t);
731 * link the two together in the proper relationship and order
734 fprintf(debug_file, "defining transformation from `%s' to `%s'\n",
737 SuffInsert(t->children, s);
738 SuffInsert(s->parents, t);
744 *-----------------------------------------------------------------------
745 * Suff_EndTransform --
746 * Handle the finish of a transformation definition, removing the
747 * transformation from the graph if it has neither commands nor
748 * sources. This is a callback procedure for the Parse module via
752 * gnp Node for transformation
753 * dummy Node for transformation
759 * If the node has no commands or children, the children and parents
760 * lists of the affected suffixes are altered.
762 *-----------------------------------------------------------------------
765 Suff_EndTransform(void *gnp, void *dummy)
767 GNode *gn = (GNode *)gnp;
769 if ((gn->type & OP_DOUBLEDEP) && !Lst_IsEmpty (gn->cohorts))
770 gn = (GNode *)Lst_Datum(Lst_Last(gn->cohorts));
771 if ((gn->type & OP_TRANSFORM) && Lst_IsEmpty(gn->commands) &&
772 Lst_IsEmpty(gn->children))
777 * SuffParseTransform() may fail for special rules which are not
778 * actual transformation rules. (e.g. .DEFAULT)
780 if (SuffParseTransform(gn->name, &s, &t)) {
784 fprintf(debug_file, "deleting transformation from `%s' to `%s'\n",
789 * Store s->parents because s could be deleted in SuffRemove
794 * Remove the source from the target's children list. We check for a
795 * nil return to handle a beanhead saying something like
798 * We'll be called twice when the next target is seen, but .c and .o
799 * are only linked once...
801 SuffRemove(t->children, s);
804 * Remove the target from the source's parents list
808 } else if ((gn->type & OP_TRANSFORM) && DEBUG(SUFF)) {
809 fprintf(debug_file, "transformation %s complete\n", gn->name);
812 return(dummy ? 0 : 0);
816 *-----------------------------------------------------------------------
817 * SuffRebuildGraph --
818 * Called from Suff_AddSuffix via Lst_ForEach to search through the
819 * list of existing transformation rules and rebuild the transformation
820 * graph when it has been destroyed by Suff_ClearSuffixes. If the
821 * given rule is a transformation involving this suffix and another,
822 * existing suffix, the proper relationship is established between
826 * transformp Transformation to test
827 * sp Suffix to rebuild
833 * The appropriate links will be made between this suffix and
834 * others if transformation rules exist for it.
836 *-----------------------------------------------------------------------
839 SuffRebuildGraph(void *transformp, void *sp)
841 GNode *transform = (GNode *)transformp;
842 Suff *s = (Suff *)sp;
849 * First see if it is a transformation from this suffix.
851 cp = UNCONST(SuffStrIsPrefix(s->name, transform->name));
853 ln = Lst_Find(sufflist, cp, SuffSuffHasNameP);
856 * Found target. Link in and return, since it can't be anything
859 s2 = (Suff *)Lst_Datum(ln);
860 SuffInsert(s2->children, s);
861 SuffInsert(s->parents, s2);
867 * Not from, maybe to?
869 sd.len = strlen(transform->name);
870 sd.ename = transform->name + sd.len;
871 cp = SuffSuffIsSuffix(s, &sd);
874 * Null-terminate the source suffix in order to find it.
877 ln = Lst_Find(sufflist, transform->name, SuffSuffHasNameP);
879 * Replace the start of the target suffix
884 * Found it -- establish the proper relationship
886 s2 = (Suff *)Lst_Datum(ln);
887 SuffInsert(s->children, s2);
888 SuffInsert(s2->parents, s);
895 *-----------------------------------------------------------------------
897 * Called from Suff_AddSuffix via Lst_ForEach to search through the
898 * list of existing targets and find if any of the existing targets
899 * can be turned into a transformation rule.
902 * 1 if a new main target has been selected, 0 otherwise.
905 * If such a target is found and the target is the current main
906 * target, the main target is set to NULL and the next target
907 * examined (if that exists) becomes the main target.
909 *-----------------------------------------------------------------------
912 SuffScanTargets(void *targetp, void *gsp)
914 GNode *target = (GNode *)targetp;
915 GNodeSuff *gs = (GNodeSuff *)gsp;
919 if (*gs->gn == NULL && gs->r && (target->type & OP_NOTARGET) == 0) {
921 Targ_SetMain(target);
925 if ((unsigned int)target->type == OP_TRANSFORM)
928 if ((ptr = strstr(target->name, gs->s->name)) == NULL ||
932 if (SuffParseTransform(target->name, &s, &t)) {
933 if (*gs->gn == target) {
938 Lst_Destroy(target->children, NULL);
939 target->children = Lst_Init(FALSE);
940 target->type = OP_TRANSFORM;
942 * link the two together in the proper relationship and order
945 fprintf(debug_file, "defining transformation from `%s' to `%s'\n",
948 SuffInsert(t->children, s);
949 SuffInsert(s->parents, t);
955 *-----------------------------------------------------------------------
957 * Add the suffix in string to the end of the list of known suffixes.
958 * Should we restructure the suffix graph? Make doesn't...
961 * str the name of the suffix to add
967 * A GNode is created for the suffix and a Suff structure is created and
968 * added to the suffixes list unless the suffix was already known.
969 * The mainNode passed can be modified if a target mutated into a
970 * transform and that target happened to be the main target.
971 *-----------------------------------------------------------------------
974 Suff_AddSuffix(char *str, GNode **gn)
976 Suff *s; /* new suffix descriptor */
980 ln = Lst_Find(sufflist, str, SuffSuffHasNameP);
982 s = bmake_malloc(sizeof(Suff));
984 s->name = bmake_strdup(str);
985 s->nameLen = strlen(s->name);
986 s->searchPath = Lst_Init(FALSE);
987 s->children = Lst_Init(FALSE);
988 s->parents = Lst_Init(FALSE);
989 s->ref = Lst_Init(FALSE);
994 (void)Lst_AtEnd(sufflist, s);
996 * We also look at our existing targets list to see if adding
997 * this suffix will make one of our current targets mutate into
998 * a suffix rule. This is ugly, but other makes treat all targets
999 * that start with a . as suffix rules.
1004 Lst_ForEach(Targ_List(), SuffScanTargets, &gs);
1006 * Look for any existing transformations from or to this suffix.
1007 * XXX: Only do this after a Suff_ClearSuffixes?
1009 Lst_ForEach(transforms, SuffRebuildGraph, s);
1014 *-----------------------------------------------------------------------
1016 * Return the search path for the given suffix, if it's defined.
1019 * The searchPath for the desired suffix or NULL if the suffix isn't
1024 *-----------------------------------------------------------------------
1027 Suff_GetPath(char *sname)
1032 ln = Lst_Find(sufflist, sname, SuffSuffHasNameP);
1036 s = (Suff *)Lst_Datum(ln);
1037 return (s->searchPath);
1042 *-----------------------------------------------------------------------
1044 * Extend the search paths for all suffixes to include the default
1051 * The searchPath field of all the suffixes is extended by the
1052 * directories in dirSearchPath. If paths were specified for the
1053 * ".h" suffix, the directories are stuffed into a global variable
1054 * called ".INCLUDES" with each directory preceded by a -I. The same
1055 * is done for the ".a" suffix, except the variable is called
1056 * ".LIBS" and the flag is -L.
1057 *-----------------------------------------------------------------------
1065 Lst inIncludes; /* Cumulative .INCLUDES path */
1066 Lst inLibs; /* Cumulative .LIBS path */
1068 if (Lst_Open(sufflist) == FAILURE) {
1072 inIncludes = Lst_Init(FALSE);
1073 inLibs = Lst_Init(FALSE);
1075 while ((ln = Lst_Next(sufflist)) != NULL) {
1076 s = (Suff *)Lst_Datum(ln);
1077 if (!Lst_IsEmpty (s->searchPath)) {
1079 if (s->flags & SUFF_INCLUDE) {
1080 Dir_Concat(inIncludes, s->searchPath);
1082 #endif /* INCLUDES */
1084 if (s->flags & SUFF_LIBRARY) {
1085 Dir_Concat(inLibs, s->searchPath);
1087 #endif /* LIBRARIES */
1088 Dir_Concat(s->searchPath, dirSearchPath);
1090 Lst_Destroy(s->searchPath, Dir_Destroy);
1091 s->searchPath = Lst_Duplicate(dirSearchPath, Dir_CopyDir);
1095 Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", inIncludes), VAR_GLOBAL, 0);
1097 Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", inLibs), VAR_GLOBAL, 0);
1100 Lst_Destroy(inIncludes, Dir_Destroy);
1101 Lst_Destroy(inLibs, Dir_Destroy);
1103 Lst_Close(sufflist);
1107 *-----------------------------------------------------------------------
1108 * Suff_AddInclude --
1109 * Add the given suffix as a type of file which gets included.
1110 * Called from the parse module when a .INCLUDES line is parsed.
1111 * The suffix must have already been defined.
1114 * sname Name of the suffix to mark
1120 * The SUFF_INCLUDE bit is set in the suffix's flags field
1122 *-----------------------------------------------------------------------
1125 Suff_AddInclude(char *sname)
1130 ln = Lst_Find(sufflist, sname, SuffSuffHasNameP);
1132 s = (Suff *)Lst_Datum(ln);
1133 s->flags |= SUFF_INCLUDE;
1138 *-----------------------------------------------------------------------
1140 * Add the given suffix as a type of file which is a library.
1141 * Called from the parse module when parsing a .LIBS line. The
1142 * suffix must have been defined via .SUFFIXES before this is
1146 * sname Name of the suffix to mark
1152 * The SUFF_LIBRARY bit is set in the suffix's flags field
1154 *-----------------------------------------------------------------------
1157 Suff_AddLib(char *sname)
1162 ln = Lst_Find(sufflist, sname, SuffSuffHasNameP);
1164 s = (Suff *)Lst_Datum(ln);
1165 s->flags |= SUFF_LIBRARY;
1169 /********** Implicit Source Search Functions *********/
1172 *-----------------------------------------------------------------------
1174 * Add a suffix as a Src structure to the given list with its parent
1175 * being the given Src structure. If the suffix is the null suffix,
1176 * the prefix is used unaltered as the file name in the Src structure.
1179 * sp suffix for which to create a Src structure
1180 * lsp list and parent for the new Src
1186 * A Src structure is created and tacked onto the end of the list
1187 *-----------------------------------------------------------------------
1190 SuffAddSrc(void *sp, void *lsp)
1192 Suff *s = (Suff *)sp;
1193 LstSrc *ls = (LstSrc *)lsp;
1194 Src *s2; /* new Src structure */
1195 Src *targ; /* Target structure */
1199 if ((s->flags & SUFF_NULL) && (*s->name != '\0')) {
1201 * If the suffix has been marked as the NULL suffix, also create a Src
1202 * structure for a file with no suffix attached. Two birds, and all
1205 s2 = bmake_malloc(sizeof(Src));
1206 s2->file = bmake_strdup(targ->pref);
1207 s2->pref = targ->pref;
1213 targ->children += 1;
1214 (void)Lst_AtEnd(ls->l, s2);
1216 s2->cp = Lst_Init(FALSE);
1217 Lst_AtEnd(targ->cp, s2);
1218 fprintf(debug_file, "1 add %x %x to %x:", targ, s2, ls->l);
1219 Lst_ForEach(ls->l, PrintAddr, NULL);
1220 fprintf(debug_file, "\n");
1223 s2 = bmake_malloc(sizeof(Src));
1224 s2->file = str_concat(targ->pref, s->name, 0);
1225 s2->pref = targ->pref;
1231 targ->children += 1;
1232 (void)Lst_AtEnd(ls->l, s2);
1234 s2->cp = Lst_Init(FALSE);
1235 Lst_AtEnd(targ->cp, s2);
1236 fprintf(debug_file, "2 add %x %x to %x:", targ, s2, ls->l);
1237 Lst_ForEach(ls->l, PrintAddr, NULL);
1238 fprintf(debug_file, "\n");
1245 *-----------------------------------------------------------------------
1247 * Add all the children of targ as Src structures to the given list
1250 * l list to which to add the new level
1251 * targ Src structure to use as the parent
1257 * Lots of structures are created and added to the list
1258 *-----------------------------------------------------------------------
1261 SuffAddLevel(Lst l, Src *targ)
1268 Lst_ForEach(targ->suff->children, SuffAddSrc, &ls);
1272 *----------------------------------------------------------------------
1274 * Free all src structures in list that don't have a reference count
1277 * Ture if an src was removed
1280 * The memory is free'd.
1281 *----------------------------------------------------------------------
1284 SuffRemoveSrc(Lst l)
1290 if (Lst_Open(l) == FAILURE) {
1294 fprintf(debug_file, "cleaning %lx: ", (unsigned long) l);
1295 Lst_ForEach(l, PrintAddr, NULL);
1296 fprintf(debug_file, "\n");
1300 while ((ln = Lst_Next(l)) != NULL) {
1301 s = (Src *)Lst_Datum(ln);
1302 if (s->children == 0) {
1308 LstNode ln = Lst_Member(s->parent->cp, s);
1310 Lst_Remove(s->parent->cp, ln);
1312 --s->parent->children;
1315 fprintf(debug_file, "free: [l=%x] p=%x %d\n", l, s, s->children);
1316 Lst_Destroy(s->cp, NULL);
1326 fprintf(debug_file, "keep: [l=%x] p=%x %d: ", l, s, s->children);
1327 Lst_ForEach(s->cp, PrintAddr, NULL);
1328 fprintf(debug_file, "\n");
1339 *-----------------------------------------------------------------------
1341 * Find the first existing file/target in the list srcs
1344 * srcs list of Src structures to search through
1347 * The lowest structure in the chain of transformations
1351 *-----------------------------------------------------------------------
1354 SuffFindThem(Lst srcs, Lst slst)
1356 Src *s; /* current Src */
1357 Src *rs; /* returned Src */
1362 while (!Lst_IsEmpty (srcs)) {
1363 s = (Src *)Lst_DeQueue(srcs);
1366 fprintf(debug_file, "\ttrying %s...", s->file);
1370 * A file is considered to exist if either a node exists in the
1371 * graph for it or the file actually exists.
1373 if (Targ_FindNode(s->file, TARG_NOCREATE) != NULL) {
1375 fprintf(debug_file, "remove %x from %x\n", s, srcs);
1381 if ((ptr = Dir_FindFile(s->file, s->suff->searchPath)) != NULL) {
1384 fprintf(debug_file, "remove %x from %x\n", s, srcs);
1391 fprintf(debug_file, "not there\n");
1394 SuffAddLevel(srcs, s);
1398 if (DEBUG(SUFF) && rs) {
1399 fprintf(debug_file, "got it\n");
1405 *-----------------------------------------------------------------------
1407 * See if any of the children of the target in the Src structure is
1408 * one from which the target can be transformed. If there is one,
1409 * a Src structure is put together for it and returned.
1412 * targ Src structure to play with
1415 * The Src structure of the "winning" child, or NULL if no such beast.
1418 * A Src structure may be allocated.
1420 *-----------------------------------------------------------------------
1423 SuffFindCmds(Src *targ, Lst slst)
1425 LstNode ln; /* General-purpose list node */
1426 GNode *t, /* Target GNode */
1427 *s; /* Source GNode */
1428 int prefLen;/* The length of the defined prefix */
1429 Suff *suff; /* Suffix on matching beastie */
1430 Src *ret; /* Return value */
1434 (void)Lst_Open(t->children);
1435 prefLen = strlen(targ->pref);
1438 ln = Lst_Next(t->children);
1440 Lst_Close(t->children);
1443 s = (GNode *)Lst_Datum(ln);
1445 if (s->type & OP_OPTIONAL && Lst_IsEmpty(t->commands)) {
1447 * We haven't looked to see if .OPTIONAL files exist yet, so
1448 * don't use one as the implicit source.
1449 * This allows us to use .OPTIONAL in .depend files so make won't
1450 * complain "don't know how to make xxx.h' when a dependent file
1451 * has been moved/deleted.
1456 cp = strrchr(s->name, '/');
1462 if (strncmp(cp, targ->pref, prefLen) != 0)
1465 * The node matches the prefix ok, see if it has a known
1468 ln = Lst_Find(sufflist, &cp[prefLen], SuffSuffHasNameP);
1472 * It even has a known suffix, see if there's a transformation
1473 * defined between the node's suffix and the target's suffix.
1475 * XXX: Handle multi-stage transformations here, too.
1477 suff = (Suff *)Lst_Datum(ln);
1479 if (Lst_Member(suff->parents, targ->suff) != NULL)
1484 * Hot Damn! Create a new Src structure to describe
1485 * this transformation (making sure to duplicate the
1486 * source node's name so Suff_FindDeps can free it
1487 * again (ick)), and return the new structure.
1489 ret = bmake_malloc(sizeof(Src));
1490 ret->file = bmake_strdup(s->name);
1491 ret->pref = targ->pref;
1497 targ->children += 1;
1499 ret->cp = Lst_Init(FALSE);
1500 fprintf(debug_file, "3 add %x %x\n", targ, ret);
1501 Lst_AtEnd(targ->cp, ret);
1503 Lst_AtEnd(slst, ret);
1505 fprintf(debug_file, "\tusing existing source %s\n", s->name);
1511 *-----------------------------------------------------------------------
1512 * SuffExpandChildren --
1513 * Expand the names of any children of a given node that contain
1514 * variable invocations or file wildcards into actual targets.
1517 * cln Child to examine
1518 * pgn Parent node being processed
1524 * The expanded node is removed from the parent's list of children,
1525 * and the parent's unmade counter is decremented, but other nodes
1528 *-----------------------------------------------------------------------
1531 SuffExpandChildren(LstNode cln, GNode *pgn)
1533 GNode *cgn = (GNode *)Lst_Datum(cln);
1534 GNode *gn; /* New source 8) */
1535 char *cp; /* Expanded value */
1537 if (!Lst_IsEmpty(cgn->order_pred) || !Lst_IsEmpty(cgn->order_succ))
1538 /* It is all too hard to process the result of .ORDER */
1541 if (cgn->type & OP_WAIT)
1542 /* Ignore these (& OP_PHONY ?) */
1546 * First do variable expansion -- this takes precedence over
1547 * wildcard expansion. If the result contains wildcards, they'll be gotten
1548 * to later since the resulting words are tacked on to the end of
1549 * the children list.
1551 if (strchr(cgn->name, '$') == NULL) {
1552 SuffExpandWildcards(cln, pgn);
1557 fprintf(debug_file, "Expanding \"%s\"...", cgn->name);
1559 cp = Var_Subst(NULL, cgn->name, pgn, TRUE, TRUE);
1562 Lst members = Lst_Init(FALSE);
1564 if (cgn->type & OP_ARCHV) {
1566 * Node was an archive(member) target, so we want to call
1567 * on the Arch module to find the nodes for us, expanding
1568 * variables in the parent's context.
1570 char *sacrifice = cp;
1572 (void)Arch_ParseArchive(&sacrifice, members, pgn);
1575 * Break the result into a vector of strings whose nodes
1576 * we can find, then add those nodes to the members list.
1577 * Unfortunately, we can't use brk_string b/c it
1578 * doesn't understand about variable specifications with
1582 char *initcp = cp; /* For freeing... */
1584 for (start = cp; *start == ' ' || *start == '\t'; start++)
1586 for (cp = start; *cp != '\0'; cp++) {
1587 if (*cp == ' ' || *cp == '\t') {
1589 * White-space -- terminate element, find the node,
1590 * add it, skip any further spaces.
1593 gn = Targ_FindNode(start, TARG_CREATE);
1594 (void)Lst_AtEnd(members, gn);
1595 while (*cp == ' ' || *cp == '\t') {
1599 * Adjust cp for increment at start of loop, but
1600 * set start to first non-space.
1603 } else if (*cp == '$') {
1605 * Start of a variable spec -- contact variable module
1606 * to find the end so we can skip over it.
1612 junk = Var_Parse(cp, pgn, TRUE, TRUE, &len, &freeIt);
1613 if (junk != var_Error) {
1619 } else if (*cp == '\\' && *cp != '\0') {
1621 * Escaped something -- skip over it
1629 * Stuff left over -- add it to the list too
1631 gn = Targ_FindNode(start, TARG_CREATE);
1632 (void)Lst_AtEnd(members, gn);
1635 * Point cp back at the beginning again so the variable value
1642 * Add all elements of the members list to the parent node.
1644 while(!Lst_IsEmpty(members)) {
1645 gn = (GNode *)Lst_DeQueue(members);
1648 fprintf(debug_file, "%s...", gn->name);
1650 /* Add gn to the parents child list before the original child */
1651 (void)Lst_InsertBefore(pgn->children, cln, gn);
1652 (void)Lst_AtEnd(gn->parents, pgn);
1654 /* Expand wildcards on new node */
1655 SuffExpandWildcards(Lst_Prev(cln), pgn);
1657 Lst_Destroy(members, NULL);
1665 fprintf(debug_file, "\n");
1669 * Now the source is expanded, remove it from the list of children to
1670 * keep it from being processed.
1673 Lst_Remove(pgn->children, cln);
1674 Lst_Remove(cgn->parents, Lst_Member(cgn->parents, pgn));
1678 SuffExpandWildcards(LstNode cln, GNode *pgn)
1680 GNode *cgn = (GNode *)Lst_Datum(cln);
1681 GNode *gn; /* New source 8) */
1682 char *cp; /* Expanded value */
1683 Lst explist; /* List of expansions */
1685 if (!Dir_HasWildcards(cgn->name))
1689 * Expand the word along the chosen path
1691 explist = Lst_Init(FALSE);
1692 Dir_Expand(cgn->name, Suff_FindPath(cgn), explist);
1694 while (!Lst_IsEmpty(explist)) {
1696 * Fetch next expansion off the list and find its GNode
1698 cp = (char *)Lst_DeQueue(explist);
1701 fprintf(debug_file, "%s...", cp);
1703 gn = Targ_FindNode(cp, TARG_CREATE);
1705 /* Add gn to the parents child list before the original child */
1706 (void)Lst_InsertBefore(pgn->children, cln, gn);
1707 (void)Lst_AtEnd(gn->parents, pgn);
1712 * Nuke what's left of the list
1714 Lst_Destroy(explist, NULL);
1717 fprintf(debug_file, "\n");
1721 * Now the source is expanded, remove it from the list of children to
1722 * keep it from being processed.
1725 Lst_Remove(pgn->children, cln);
1726 Lst_Remove(cgn->parents, Lst_Member(cgn->parents, pgn));
1730 *-----------------------------------------------------------------------
1732 * Find a path along which to expand the node.
1734 * If the word has a known suffix, use that path.
1735 * If it has no known suffix, use the default system search path.
1738 * gn Node being examined
1741 * The appropriate path to search for the GNode.
1744 * XXX: We could set the suffix here so that we don't have to scan
1747 *-----------------------------------------------------------------------
1750 Suff_FindPath(GNode* gn)
1752 Suff *suff = gn->suffix;
1755 SuffixCmpData sd; /* Search string data */
1757 sd.len = strlen(gn->name);
1758 sd.ename = gn->name + sd.len;
1759 ln = Lst_Find(sufflist, &sd, SuffSuffIsSuffixP);
1762 fprintf(debug_file, "Wildcard expanding \"%s\"...", gn->name);
1765 suff = (Suff *)Lst_Datum(ln);
1766 /* XXX: Here we can save the suffix so we don't have to do this again */
1771 fprintf(debug_file, "suffix is \"%s\"...", suff->name);
1773 return suff->searchPath;
1776 * Use default search path
1778 return dirSearchPath;
1783 *-----------------------------------------------------------------------
1784 * SuffApplyTransform --
1785 * Apply a transformation rule, given the source and target nodes
1795 * TRUE if successful, FALSE if not.
1798 * The source and target are linked and the commands from the
1799 * transformation are added to the target node's commands list.
1800 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1801 * to the target. The target also inherits all the sources for
1802 * the transformation rule.
1804 *-----------------------------------------------------------------------
1807 SuffApplyTransform(GNode *tGn, GNode *sGn, Suff *t, Suff *s)
1809 LstNode ln, nln; /* General node */
1810 char *tname; /* Name of transformation rule */
1811 GNode *gn; /* Node for same */
1814 * Form the proper links between the target and source.
1816 (void)Lst_AtEnd(tGn->children, sGn);
1817 (void)Lst_AtEnd(sGn->parents, tGn);
1821 * Locate the transformation rule itself
1823 tname = str_concat(s->name, t->name, 0);
1824 ln = Lst_Find(transforms, tname, SuffGNHasNameP);
1829 * Not really such a transformation rule (can happen when we're
1830 * called to link an OP_MEMBER and OP_ARCHV node), so return
1836 gn = (GNode *)Lst_Datum(ln);
1839 fprintf(debug_file, "\tapplying %s -> %s to \"%s\"\n", s->name, t->name, tGn->name);
1843 * Record last child for expansion purposes
1845 ln = Lst_Last(tGn->children);
1848 * Pass the buck to Make_HandleUse to apply the rule
1850 (void)Make_HandleUse(gn, tGn);
1853 * Deal with wildcards and variables in any acquired sources
1855 for (ln = Lst_Succ(ln); ln != NULL; ln = nln) {
1857 SuffExpandChildren(ln, tGn);
1861 * Keep track of another parent to which this beast is transformed so
1862 * the .IMPSRC variable can be set correctly for the parent.
1864 (void)Lst_AtEnd(sGn->iParents, tGn);
1871 *-----------------------------------------------------------------------
1872 * SuffFindArchiveDeps --
1873 * Locate dependencies for an OP_ARCHV node.
1876 * gn Node for which to locate dependencies
1882 * Same as Suff_FindDeps
1884 *-----------------------------------------------------------------------
1887 SuffFindArchiveDeps(GNode *gn, Lst slst)
1889 char *eoarch; /* End of archive portion */
1890 char *eoname; /* End of member portion */
1891 GNode *mem; /* Node for member */
1892 static const char *copy[] = {
1893 /* Variables to be copied from the member node */
1894 TARGET, /* Must be first */
1895 PREFIX, /* Must be second */
1897 int i; /* Index into copy and vals */
1898 Suff *ms; /* Suffix descriptor for member */
1899 char *name; /* Start of member's name */
1902 * The node is an archive(member) pair. so we must find a
1903 * suffix for both of them.
1905 eoarch = strchr(gn->name, '(');
1906 eoname = strchr(eoarch, ')');
1908 *eoname = '\0'; /* Nuke parentheses during suffix search */
1909 *eoarch = '\0'; /* So a suffix can be found */
1914 * To simplify things, call Suff_FindDeps recursively on the member now,
1915 * so we can simply compare the member's .PREFIX and .TARGET variables
1916 * to locate its suffix. This allows us to figure out the suffix to
1917 * use for the archive without having to do a quadratic search over the
1918 * suffix list, backtracking for each one...
1920 mem = Targ_FindNode(name, TARG_CREATE);
1921 SuffFindDeps(mem, slst);
1924 * Create the link between the two nodes right off
1926 (void)Lst_AtEnd(gn->children, mem);
1927 (void)Lst_AtEnd(mem->parents, gn);
1931 * Copy in the variables from the member node to this one.
1933 for (i = (sizeof(copy)/sizeof(copy[0]))-1; i >= 0; i--) {
1935 Var_Set(copy[i], Var_Value(copy[i], mem, &p1), gn, 0);
1944 * Didn't know what it was -- use .NULL suffix if not in make mode
1947 fprintf(debug_file, "using null suffix\n");
1954 * Set the other two local variables required for this target.
1956 Var_Set(MEMBER, name, gn, 0);
1957 Var_Set(ARCHIVE, gn->name, gn, 0);
1961 * Member has a known suffix, so look for a transformation rule from
1962 * it to a possible suffix of the archive. Rather than searching
1963 * through the entire list, we just look at suffixes to which the
1964 * member's suffix may be transformed...
1967 SuffixCmpData sd; /* Search string data */
1970 * Use first matching suffix...
1972 sd.len = eoarch - gn->name;
1974 ln = Lst_Find(ms->parents, &sd, SuffSuffIsSuffixP);
1978 * Got one -- apply it
1980 if (!SuffApplyTransform(gn, mem, (Suff *)Lst_Datum(ln), ms) &&
1983 fprintf(debug_file, "\tNo transformation from %s -> %s\n",
1984 ms->name, ((Suff *)Lst_Datum(ln))->name);
1990 * Replace the opening and closing parens now we've no need of the separate
1993 *eoarch = '('; *eoname = ')';
1996 * Pretend gn appeared to the left of a dependency operator so
1997 * the user needn't provide a transformation from the member to the
2000 if (OP_NOP(gn->type)) {
2001 gn->type |= OP_DEPENDS;
2005 * Flag the member as such so we remember to look in the archive for
2006 * its modification time.
2008 mem->type |= OP_MEMBER;
2012 *-----------------------------------------------------------------------
2013 * SuffFindNormalDeps --
2014 * Locate implicit dependencies for regular targets.
2017 * gn Node for which to find sources
2023 * Same as Suff_FindDeps...
2025 *-----------------------------------------------------------------------
2028 SuffFindNormalDeps(GNode *gn, Lst slst)
2030 char *eoname; /* End of name */
2031 char *sopref; /* Start of prefix */
2032 LstNode ln, nln; /* Next suffix node to check */
2033 Lst srcs; /* List of sources at which to look */
2034 Lst targs; /* List of targets to which things can be
2035 * transformed. They all have the same file,
2036 * but different suff and pref fields */
2037 Src *bottom; /* Start of found transformation path */
2038 Src *src; /* General Src pointer */
2039 char *pref; /* Prefix to use */
2040 Src *targ; /* General Src target pointer */
2041 SuffixCmpData sd; /* Search string data */
2044 sd.len = strlen(gn->name);
2045 sd.ename = eoname = gn->name + sd.len;
2050 * Begin at the beginning...
2052 ln = Lst_First(sufflist);
2053 srcs = Lst_Init(FALSE);
2054 targs = Lst_Init(FALSE);
2057 * We're caught in a catch-22 here. On the one hand, we want to use any
2058 * transformation implied by the target's sources, but we can't examine
2059 * the sources until we've expanded any variables/wildcards they may hold,
2060 * and we can't do that until we've set up the target's local variables
2061 * and we can't do that until we know what the proper suffix for the
2062 * target is (in case there are two suffixes one of which is a suffix of
2063 * the other) and we can't know that until we've found its implied
2064 * source, which we may not want to use if there's an existing source
2065 * that implies a different transformation.
2067 * In an attempt to get around this, which may not work all the time,
2068 * but should work most of the time, we look for implied sources first,
2069 * checking transformations to all possible suffixes of the target,
2070 * use what we find to set the target's local variables, expand the
2071 * children, then look for any overriding transformations they imply.
2072 * Should we find one, we discard the one we found before.
2077 if (!(gn->type & OP_PHONY)) {
2079 while (ln != NULL) {
2081 * Look for next possible suffix...
2083 ln = Lst_FindFrom(sufflist, ln, &sd, SuffSuffIsSuffixP);
2086 int prefLen; /* Length of the prefix */
2089 * Allocate a Src structure to which things can be transformed
2091 targ = bmake_malloc(sizeof(Src));
2092 targ->file = bmake_strdup(gn->name);
2093 targ->suff = (Suff *)Lst_Datum(ln);
2094 targ->suff->refCount++;
2096 targ->parent = NULL;
2099 targ->cp = Lst_Init(FALSE);
2103 * Allocate room for the prefix, whose end is found by
2104 * subtracting the length of the suffix from
2105 * the end of the name.
2107 prefLen = (eoname - targ->suff->nameLen) - sopref;
2108 targ->pref = bmake_malloc(prefLen + 1);
2109 memcpy(targ->pref, sopref, prefLen);
2110 targ->pref[prefLen] = '\0';
2113 * Add nodes from which the target can be made
2115 SuffAddLevel(srcs, targ);
2118 * Record the target so we can nuke it
2120 (void)Lst_AtEnd(targs, targ);
2123 * Search from this suffix's successor...
2130 * Handle target of unknown suffix...
2132 if (Lst_IsEmpty(targs) && suffNull != NULL) {
2134 fprintf(debug_file, "\tNo known suffix on %s. Using .NULL suffix\n", gn->name);
2137 targ = bmake_malloc(sizeof(Src));
2138 targ->file = bmake_strdup(gn->name);
2139 targ->suff = suffNull;
2140 targ->suff->refCount++;
2142 targ->parent = NULL;
2144 targ->pref = bmake_strdup(sopref);
2146 targ->cp = Lst_Init(FALSE);
2150 * Only use the default suffix rules if we don't have commands
2151 * defined for this gnode; traditional make programs used to
2152 * not define suffix rules if the gnode had children but we
2153 * don't do this anymore.
2155 if (Lst_IsEmpty(gn->commands))
2156 SuffAddLevel(srcs, targ);
2159 fprintf(debug_file, "not ");
2163 fprintf(debug_file, "adding suffix rules\n");
2165 (void)Lst_AtEnd(targs, targ);
2169 * Using the list of possible sources built up from the target
2170 * suffix(es), try and find an existing file/target that matches.
2172 bottom = SuffFindThem(srcs, slst);
2174 if (bottom == NULL) {
2176 * No known transformations -- use the first suffix found
2177 * for setting the local variables.
2179 if (!Lst_IsEmpty(targs)) {
2180 targ = (Src *)Lst_Datum(Lst_First(targs));
2186 * Work up the transformation path to find the suffix of the
2187 * target to which the transformation was made.
2189 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
2194 Var_Set(TARGET, gn->path ? gn->path : gn->name, gn, 0);
2196 pref = (targ != NULL) ? targ->pref : gn->name;
2197 Var_Set(PREFIX, pref, gn, 0);
2200 * Now we've got the important local variables set, expand any sources
2201 * that still contain variables or wildcards in their names.
2203 for (ln = Lst_First(gn->children); ln != NULL; ln = nln) {
2205 SuffExpandChildren(ln, gn);
2210 fprintf(debug_file, "\tNo valid suffix on %s\n", gn->name);
2215 * Deal with finding the thing on the default search path. We
2216 * always do that, not only if the node is only a source (not
2217 * on the lhs of a dependency operator or [XXX] it has neither
2218 * children or commands) as the old pmake did.
2220 if ((gn->type & (OP_PHONY|OP_NOPATH)) == 0) {
2222 gn->path = Dir_FindFile(gn->name,
2223 (targ == NULL ? dirSearchPath :
2224 targ->suff->searchPath));
2225 if (gn->path != NULL) {
2227 Var_Set(TARGET, gn->path, gn, 0);
2231 * Suffix known for the thing -- trim the suffix off
2232 * the path to form the proper .PREFIX variable.
2234 int savep = strlen(gn->path) - targ->suff->nameLen;
2238 gn->suffix->refCount--;
2239 gn->suffix = targ->suff;
2240 gn->suffix->refCount++;
2242 savec = gn->path[savep];
2243 gn->path[savep] = '\0';
2245 if ((ptr = strrchr(gn->path, '/')) != NULL)
2250 Var_Set(PREFIX, ptr, gn, 0);
2252 gn->path[savep] = savec;
2255 * The .PREFIX gets the full path if the target has
2259 gn->suffix->refCount--;
2262 if ((ptr = strrchr(gn->path, '/')) != NULL)
2267 Var_Set(PREFIX, ptr, gn, 0);
2276 * If the suffix indicates that the target is a library, mark that in
2277 * the node's type field.
2279 if (targ->suff->flags & SUFF_LIBRARY) {
2284 * Check for overriding transformation rule implied by sources
2286 if (!Lst_IsEmpty(gn->children)) {
2287 src = SuffFindCmds(targ, slst);
2291 * Free up all the Src structures in the transformation path
2292 * up to, but not including, the parent node.
2294 while (bottom && bottom->parent != NULL) {
2295 if (Lst_Member(slst, bottom) == NULL) {
2296 Lst_AtEnd(slst, bottom);
2298 bottom = bottom->parent;
2304 if (bottom == NULL) {
2306 * No idea from where it can come -- return now.
2312 * We now have a list of Src structures headed by 'bottom' and linked via
2313 * their 'parent' pointers. What we do next is create links between
2314 * source and target nodes (which may or may not have been created)
2315 * and set the necessary local variables in each target. The
2316 * commands for each target are set from the commands of the
2317 * transformation rule used to get from the src suffix to the targ
2318 * suffix. Note that this causes the commands list of the original
2319 * node, gn, to be replaced by the commands of the final
2320 * transformation rule. Also, the unmade field of gn is incremented.
2323 if (bottom->node == NULL) {
2324 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
2327 for (src = bottom; src->parent != NULL; src = src->parent) {
2330 if (src->node->suffix)
2331 src->node->suffix->refCount--;
2332 src->node->suffix = src->suff;
2333 src->node->suffix->refCount++;
2335 if (targ->node == NULL) {
2336 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
2339 SuffApplyTransform(targ->node, src->node,
2340 targ->suff, src->suff);
2342 if (targ->node != gn) {
2344 * Finish off the dependency-search process for any nodes
2345 * between bottom and gn (no point in questing around the
2346 * filesystem for their implicit source when it's already
2347 * known). Note that the node can't have any sources that
2348 * need expanding, since SuffFindThem will stop on an existing
2349 * node, so all we need to do is set the standard and System V
2352 targ->node->type |= OP_DEPS_FOUND;
2354 Var_Set(PREFIX, targ->pref, targ->node, 0);
2356 Var_Set(TARGET, targ->node->name, targ->node, 0);
2361 gn->suffix->refCount--;
2362 gn->suffix = src->suff;
2363 gn->suffix->refCount++;
2366 * Nuke the transformation path and the Src structures left over in the
2371 if (Lst_Member(slst, bottom) == NULL)
2372 Lst_AtEnd(slst, bottom);
2374 while (SuffRemoveSrc(srcs) || SuffRemoveSrc(targs))
2377 Lst_Concat(slst, srcs, LST_CONCLINK);
2378 Lst_Concat(slst, targs, LST_CONCLINK);
2383 *-----------------------------------------------------------------------
2385 * Find implicit sources for the target described by the graph node
2392 * Nodes are added to the graph below the passed-in node. The nodes
2393 * are marked to have their IMPSRC variable filled in. The
2394 * PREFIX variable is set for the given node and all its
2398 * The path found by this target is the shortest path in the
2399 * transformation graph, which may pass through non-existent targets,
2400 * to an existing target. The search continues on all paths from the
2401 * root suffix until a file is found. I.e. if there's a path
2402 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2403 * the .c and .l files don't, the search will branch out in
2404 * all directions from .o and again from all the nodes on the
2405 * next level until the .l,v node is encountered.
2407 *-----------------------------------------------------------------------
2411 Suff_FindDeps(GNode *gn)
2414 SuffFindDeps(gn, srclist);
2415 while (SuffRemoveSrc(srclist))
2422 * gn node we're dealing with
2426 SuffFindDeps(GNode *gn, Lst slst)
2428 if (gn->type & OP_DEPS_FOUND) {
2430 * If dependencies already found, no need to do it again...
2434 gn->type |= OP_DEPS_FOUND;
2437 * Make sure we have these set, may get revised below.
2439 Var_Set(TARGET, gn->path ? gn->path : gn->name, gn, 0);
2440 Var_Set(PREFIX, gn->name, gn, 0);
2443 fprintf(debug_file, "SuffFindDeps (%s)\n", gn->name);
2446 if (gn->type & OP_ARCHV) {
2447 SuffFindArchiveDeps(gn, slst);
2448 } else if (gn->type & OP_LIB) {
2450 * If the node is a library, it is the arch module's job to find it
2451 * and set the TARGET variable accordingly. We merely provide the
2452 * search path, assuming all libraries end in ".a" (if the suffix
2453 * hasn't been defined, there's nothing we can do for it, so we just
2454 * set the TARGET variable to the node's name in order to give it a
2460 ln = Lst_Find(sufflist, LIBSUFF, SuffSuffHasNameP);
2462 gn->suffix->refCount--;
2464 gn->suffix = s = (Suff *)Lst_Datum(ln);
2465 gn->suffix->refCount++;
2466 Arch_FindLib(gn, s->searchPath);
2469 Var_Set(TARGET, gn->name, gn, 0);
2472 * Because a library (-lfoo) target doesn't follow the standard
2473 * filesystem conventions, we don't set the regular variables for
2474 * the thing. .PREFIX is simply made empty...
2476 Var_Set(PREFIX, "", gn, 0);
2478 SuffFindNormalDeps(gn, slst);
2483 *-----------------------------------------------------------------------
2485 * Define which suffix is the null suffix.
2488 * name Name of null suffix
2494 * 'suffNull' is altered.
2497 * Need to handle the changing of the null suffix gracefully so the
2498 * old transformation rules don't just go away.
2500 *-----------------------------------------------------------------------
2503 Suff_SetNull(char *name)
2508 ln = Lst_Find(sufflist, name, SuffSuffHasNameP);
2510 s = (Suff *)Lst_Datum(ln);
2511 if (suffNull != NULL) {
2512 suffNull->flags &= ~SUFF_NULL;
2514 s->flags |= SUFF_NULL;
2516 * XXX: Here's where the transformation mangling would take place
2520 Parse_Error(PARSE_WARNING, "Desired null suffix %s not defined.",
2526 *-----------------------------------------------------------------------
2528 * Initialize suffixes module
2535 *-----------------------------------------------------------------------
2541 suffClean = Lst_Init(FALSE);
2543 srclist = Lst_Init(FALSE);
2544 transforms = Lst_Init(FALSE);
2547 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2548 * actually go on the suffix list or everyone will think that's its
2551 Suff_ClearSuffixes();
2556 *----------------------------------------------------------------------
2558 * Cleanup the this module
2564 * The memory is free'd.
2565 *----------------------------------------------------------------------
2572 Lst_Destroy(sufflist, SuffFree);
2573 Lst_Destroy(suffClean, SuffFree);
2576 Lst_Destroy(srclist, NULL);
2577 Lst_Destroy(transforms, NULL);
2582 /********************* DEBUGGING FUNCTIONS **********************/
2584 static int SuffPrintName(void *s, void *dummy)
2586 fprintf(debug_file, "%s ", ((Suff *)s)->name);
2587 return (dummy ? 0 : 0);
2591 SuffPrintSuff(void *sp, void *dummy)
2593 Suff *s = (Suff *)sp;
2597 fprintf(debug_file, "# `%s' [%d] ", s->name, s->refCount);
2601 fputs(" (", debug_file);
2603 flag = 1 << (ffs(flags) - 1);
2607 fprintf(debug_file, "NULL");
2610 fprintf(debug_file, "INCLUDE");
2613 fprintf(debug_file, "LIBRARY");
2616 fputc(flags ? '|' : ')', debug_file);
2619 fputc('\n', debug_file);
2620 fprintf(debug_file, "#\tTo: ");
2621 Lst_ForEach(s->parents, SuffPrintName, NULL);
2622 fputc('\n', debug_file);
2623 fprintf(debug_file, "#\tFrom: ");
2624 Lst_ForEach(s->children, SuffPrintName, NULL);
2625 fputc('\n', debug_file);
2626 fprintf(debug_file, "#\tSearch Path: ");
2627 Dir_PrintPath(s->searchPath);
2628 fputc('\n', debug_file);
2629 return (dummy ? 0 : 0);
2633 SuffPrintTrans(void *tp, void *dummy)
2635 GNode *t = (GNode *)tp;
2637 fprintf(debug_file, "%-16s: ", t->name);
2638 Targ_PrintType(t->type);
2639 fputc('\n', debug_file);
2640 Lst_ForEach(t->commands, Targ_PrintCmd, NULL);
2641 fputc('\n', debug_file);
2642 return(dummy ? 0 : 0);
2648 fprintf(debug_file, "#*** Suffixes:\n");
2649 Lst_ForEach(sufflist, SuffPrintSuff, NULL);
2651 fprintf(debug_file, "#*** Transformations:\n");
2652 Lst_ForEach(transforms, SuffPrintTrans, NULL);