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.12.2.2 2004/06/10 13:07:53 ru Exp $
40 * $DragonFly: src/usr.bin/make/suff.c,v 1.11 2004/11/13 22:42:39 dillon 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_End Cleanup the module
53 * Suff_DoPaths This function is used to make life easier
54 * when searching for a file according to its
55 * suffix. It takes the global search path,
56 * as defined using the .PATH: target, and appends
57 * its directories to the path of each of the
58 * defined suffixes, as specified using
59 * .PATH<suffix>: targets. In addition, all
60 * directories given for suffixes labeled as
61 * include files or libraries, using the .INCLUDES
62 * or .LIBS targets, are played with using
63 * Dir_MakeFlags to create the .INCLUDES and
64 * .LIBS global variables.
66 * Suff_ClearSuffixes Clear out all the suffixes and defined
69 * Suff_IsTransform Return TRUE if the passed string is the lhs
70 * of a transformation rule.
72 * Suff_AddSuffix Add the passed string as another known suffix.
74 * Suff_GetPath Return the search path for the given suffix.
76 * Suff_AddInclude Mark the given suffix as denoting an include
79 * Suff_AddLib Mark the given suffix as denoting a library.
81 * Suff_AddTransform Add another transformation to the suffix
82 * graph. Returns GNode suitable for framing, I
83 * mean, tacking commands, attributes, etc. on.
85 * Suff_SetNull Define the suffix to consider the suffix of
86 * any file that doesn't have a known one.
88 * Suff_FindDeps Find implicit sources for and the location of
89 * a target based on its suffix. Returns the
90 * bottom-most node added to the graph or NULL
91 * if the target had no implicit sources.
99 static Lst sufflist; /* Lst of suffixes */
100 static Lst suffClean; /* Lst of suffixes to be cleaned */
101 static Lst srclist; /* Lst of sources */
102 static Lst transforms; /* Lst of transformation rules */
104 static int sNum = 0; /* Counter for assigning suffix numbers */
107 * Structure describing an individual suffix.
109 typedef struct _Suff {
110 char *name; /* The suffix itself */
111 int nameLen; /* Length of the suffix */
112 short flags; /* Type of suffix */
113 #define SUFF_INCLUDE 0x01 /* One which is #include'd */
114 #define SUFF_LIBRARY 0x02 /* One which contains a library */
115 #define SUFF_NULL 0x04 /* The empty suffix */
116 Lst searchPath; /* The path along which files of this suffix
118 int sNum; /* The suffix number */
119 int refCount; /* Reference count of list membership */
120 Lst parents; /* Suffixes we have a transformation to */
121 Lst children; /* Suffixes we have a transformation from */
122 Lst ref; /* List of lists this suffix is referenced */
126 * Structure used in the search for implied sources.
128 typedef struct _Src {
129 char *file; /* The file to look for */
130 char *pref; /* Prefix from which file was formed */
131 Suff *suff; /* The suffix on the file */
132 struct _Src *parent; /* The Src for which this is a source */
133 GNode *node; /* The node describing the file */
134 int children; /* Count of existing children (so we don't free
135 * this thing too early or never nuke it) */
137 Lst cp; /* Debug; children list */
142 * A structure for passing more than one argument to the Lst-library-invoked
150 static Suff *suffNull; /* The NULL suffix for this run */
151 static Suff *emptySuff; /* The empty suffix required for POSIX
152 * single-suffix transformation rules */
155 static char *SuffStrIsPrefix(char *, char *);
156 static char *SuffSuffIsSuffix(Suff *, char *);
157 static int SuffSuffIsSuffixP(void *, void *);
158 static int SuffSuffHasNameP(void *, void *);
159 static int SuffSuffIsPrefix(void *, void *);
160 static int SuffGNHasNameP(void *, void *);
161 static void SuffFree(void *);
162 static void SuffInsert(Lst, Suff *);
163 static void SuffRemove(Lst, Suff *);
164 static Boolean SuffParseTransform(char *, Suff **, Suff **);
165 static int SuffRebuildGraph(void *, void *);
166 static int SuffAddSrc(void *, void *);
167 static int SuffRemoveSrc(Lst);
168 static void SuffAddLevel(Lst, Src *);
169 static Src *SuffFindThem(Lst, Lst);
170 static Src *SuffFindCmds(Src *, Lst);
171 static int SuffExpandChildren(void *, void *);
172 static Boolean SuffApplyTransform(GNode *, GNode *, Suff *, Suff *);
173 static void SuffFindDeps(GNode *, Lst);
174 static void SuffFindArchiveDeps(GNode *, Lst);
175 static void SuffFindNormalDeps(GNode *, Lst);
176 static int SuffPrintName(void *, void *);
177 static int SuffPrintSuff(void *, void *);
178 static int SuffPrintTrans(void *, void *);
180 /*************** Lst Predicates ****************/
182 *-----------------------------------------------------------------------
184 * See if pref is a prefix of str.
187 * NULL if it ain't, pointer to character in str after prefix if so
191 *-----------------------------------------------------------------------
194 SuffStrIsPrefix (char *pref, char *str)
196 while (*str && *pref == *str) {
201 return (*pref ? NULL : str);
205 *-----------------------------------------------------------------------
206 * SuffSuffIsSuffix --
207 * See if suff is a suffix of str. Str should point to THE END of the
208 * string to check. (THE END == the null byte)
211 * NULL if it ain't, pointer to character in str before suffix if
216 *-----------------------------------------------------------------------
219 SuffSuffIsSuffix (Suff *s, char *str)
221 char *p1; /* Pointer into suffix name */
222 char *p2; /* Pointer into string being examined */
224 p1 = s->name + s->nameLen;
227 while (p1 >= s->name && *p1 == *p2) {
232 return (p1 == s->name - 1 ? p2 : NULL);
236 *-----------------------------------------------------------------------
237 * SuffSuffIsSuffixP --
238 * Predicate form of SuffSuffIsSuffix. Passed as the callback function
242 * 0 if the suffix is the one desired, non-zero if not.
247 *-----------------------------------------------------------------------
250 SuffSuffIsSuffixP(void *s, void *str)
252 return(!SuffSuffIsSuffix((Suff *) s, (char *) str));
256 *-----------------------------------------------------------------------
257 * SuffSuffHasNameP --
258 * Callback procedure for finding a suffix based on its name. Used by
262 * 0 if the suffix is of the given name. non-zero otherwise.
266 *-----------------------------------------------------------------------
269 SuffSuffHasNameP (void *s, void *sname)
271 return (strcmp ((char *) sname, ((Suff *) s)->name));
275 *-----------------------------------------------------------------------
276 * SuffSuffIsPrefix --
277 * See if the suffix described by s is a prefix of the string. Care
278 * must be taken when using this to search for transformations and
279 * what-not, since there could well be two suffixes, one of which
280 * is a prefix of the other...
283 * 0 if s is a prefix of str. non-zero otherwise
287 *-----------------------------------------------------------------------
290 SuffSuffIsPrefix (void *s, void *str)
292 return (SuffStrIsPrefix (((Suff *) s)->name, (char *) str) == NULL ? 1 : 0);
296 *-----------------------------------------------------------------------
298 * See if the graph node has the desired name
301 * 0 if it does. non-zero if it doesn't
305 *-----------------------------------------------------------------------
308 SuffGNHasNameP (void *gn, void *name)
310 return (strcmp ((char *) name, ((GNode *) gn)->name));
313 /*********** Maintenance Functions ************/
316 *-----------------------------------------------------------------------
318 * Free up all memory associated with the given suffix structure.
324 * the suffix entry is detroyed
325 *-----------------------------------------------------------------------
330 Suff *s = (Suff *) sp;
338 Lst_Destroy (s->ref, NOFREE);
339 Lst_Destroy (s->children, NOFREE);
340 Lst_Destroy (s->parents, NOFREE);
341 Lst_Destroy (s->searchPath, Dir_Destroy);
348 *-----------------------------------------------------------------------
350 * Remove the suffix into the list
356 * The reference count for the suffix is decremented
357 *-----------------------------------------------------------------------
360 SuffRemove(Lst l, Suff *s)
362 LstNode ln = Lst_Member(l, (void *)s);
370 *-----------------------------------------------------------------------
372 * Insert the suffix into the list keeping the list ordered by suffix
379 * The reference count of the suffix is incremented
380 *-----------------------------------------------------------------------
383 SuffInsert (Lst l, Suff *s)
385 LstNode ln; /* current element in l we're examining */
386 Suff *s2 = NULL; /* the suffix descriptor in this element */
388 if (Lst_Open (l) == FAILURE) {
391 while ((ln = Lst_Next (l)) != NULL) {
392 s2 = (Suff *) Lst_Datum (ln);
393 if (s2->sNum >= s->sNum) {
399 DEBUGF(SUFF, ("inserting %s(%d)...", s->name, s->sNum));
401 DEBUGF(SUFF, ("at end of list\n"));
402 (void)Lst_AtEnd (l, (void *)s);
404 (void)Lst_AtEnd(s->ref, (void *) l);
405 } else if (s2->sNum != s->sNum) {
406 DEBUGF(SUFF, ("before %s(%d)\n", s2->name, s2->sNum));
407 (void)Lst_Insert (l, ln, (void *)s);
409 (void)Lst_AtEnd(s->ref, (void *) l);
411 DEBUGF(SUFF, ("already there\n"));
416 *-----------------------------------------------------------------------
417 * Suff_ClearSuffixes --
418 * This is gross. Nuke the list of suffixes but keep all transformation
419 * rules around. The transformation graph is destroyed in this process,
420 * but we leave the list of rules so when a new graph is formed the rules
422 * This function is called from the parse module when a
423 * .SUFFIXES:\n line is encountered.
429 * the sufflist and its graph nodes are destroyed
430 *-----------------------------------------------------------------------
433 Suff_ClearSuffixes (void)
435 Lst_Concat (suffClean, sufflist, LST_CONCLINK);
436 sufflist = Lst_Init(FALSE);
438 suffNull = emptySuff;
440 * Clear suffNull's children list (the other suffixes are built new, but
441 * suffNull is used as is).
442 * NOFREE is used because all suffixes are are on the suffClean list.
443 * suffNull should not have parents.
445 Lst_Destroy(suffNull->children, NOFREE);
446 suffNull->children = Lst_Init(FALSE);
450 *-----------------------------------------------------------------------
451 * SuffParseTransform --
452 * Parse a transformation string to find its two component suffixes.
455 * TRUE if the string is a valid transformation and FALSE otherwise.
458 * The passed pointers are overwritten.
460 *-----------------------------------------------------------------------
463 SuffParseTransform(char *str, Suff **srcPtr, Suff **targPtr)
465 LstNode srcLn; /* element in suffix list of trans source*/
466 Suff *src; /* Source of transformation */
467 LstNode targLn; /* element in suffix list of trans target*/
468 char *str2; /* Extra pointer (maybe target suffix) */
469 LstNode singleLn; /* element in suffix list of any suffix
470 * that exactly matches str */
471 Suff *single = NULL;/* Source of possible transformation to
478 * Loop looking first for a suffix that matches the start of the
479 * string and then for one that exactly matches the rest of it. If
480 * we can find two that meet these criteria, we've successfully
485 srcLn = Lst_Find(sufflist, (void *)str, SuffSuffIsPrefix);
487 srcLn = Lst_FindFrom (sufflist, Lst_Succ(srcLn), (void *)str,
492 * Ran out of source suffixes -- no such rule
494 if (singleLn != NULL) {
496 * Not so fast Mr. Smith! There was a suffix that encompassed
497 * the entire string, so we assume it was a transformation
498 * to the null suffix (thank you POSIX). We still prefer to
499 * find a double rule over a singleton, hence we leave this
500 * check until the end.
502 * XXX: Use emptySuff over suffNull?
510 src = (Suff *) Lst_Datum (srcLn);
511 str2 = str + src->nameLen;
516 targLn = Lst_Find(sufflist, (void *)str2, SuffSuffHasNameP);
517 if (targLn != NULL) {
519 *targPtr = (Suff *)Lst_Datum(targLn);
527 *-----------------------------------------------------------------------
528 * Suff_IsTransform --
529 * Return TRUE if the given string is a transformation rule
533 * TRUE if the string is a concatenation of two known suffixes.
538 *-----------------------------------------------------------------------
541 Suff_IsTransform (char *str)
545 return (SuffParseTransform(str, &src, &targ));
549 *-----------------------------------------------------------------------
550 * Suff_AddTransform --
551 * Add the transformation rule described by the line to the
552 * list of rules and place the transformation itself in the graph
555 * The node created for the transformation in the transforms list
558 * The node is placed on the end of the transforms Lst and links are
559 * made between the two suffixes mentioned in the target name
560 *-----------------------------------------------------------------------
563 Suff_AddTransform (char *line)
565 GNode *gn; /* GNode of transformation rule */
566 Suff *s, /* source suffix */
567 *t; /* target suffix */
568 LstNode ln; /* Node for existing transformation */
570 ln = Lst_Find (transforms, (void *)line, SuffGNHasNameP);
573 * Make a new graph node for the transformation. It will be filled in
574 * by the Parse module.
576 gn = Targ_NewGN (line);
577 (void)Lst_AtEnd (transforms, (void *)gn);
580 * New specification for transformation rule. Just nuke the old list
581 * of commands so they can be filled in again... We don't actually
582 * free the commands themselves, because a given command can be
583 * attached to several different transformations.
585 gn = (GNode *) Lst_Datum (ln);
586 Lst_Destroy (gn->commands, NOFREE);
587 Lst_Destroy (gn->children, NOFREE);
588 gn->commands = Lst_Init (FALSE);
589 gn->children = Lst_Init (FALSE);
592 gn->type = OP_TRANSFORM;
594 (void)SuffParseTransform(line, &s, &t);
597 * link the two together in the proper relationship and order
599 DEBUGF(SUFF, ("defining transformation from `%s' to `%s'\n",
601 SuffInsert (t->children, s);
602 SuffInsert (s->parents, t);
608 *-----------------------------------------------------------------------
609 * Suff_EndTransform --
610 * Handle the finish of a transformation definition, removing the
611 * transformation from the graph if it has neither commands nor
612 * sources. This is a callback procedure for the Parse module via
619 * If the node has no commands or children, the children and parents
620 * lists of the affected suffices are altered.
622 *-----------------------------------------------------------------------
625 Suff_EndTransform(void *gnp, void *dummy __unused)
627 GNode *gn = (GNode *) gnp;
629 if ((gn->type & OP_TRANSFORM) && Lst_IsEmpty(gn->commands) &&
630 Lst_IsEmpty(gn->children))
635 * SuffParseTransform() may fail for special rules which are not
636 * actual transformation rules (e.g., .DEFAULT).
638 if (!SuffParseTransform(gn->name, &s, &t))
641 DEBUGF(SUFF, ("deleting transformation from `%s' to `%s'\n",
645 * Remove the source from the target's children list. We check for a
646 * NULL return to handle a beanhead saying something like
649 * We'll be called twice when the next target is seen, but .c and .o
650 * are only linked once...
652 SuffRemove(t->children, s);
655 * Remove the target from the source's parents list
657 SuffRemove(s->parents, t);
658 } else if (gn->type & OP_TRANSFORM) {
659 DEBUGF(SUFF, ("transformation %s complete\n", gn->name));
666 *-----------------------------------------------------------------------
667 * SuffRebuildGraph --
668 * Called from Suff_AddSuffix via Lst_ForEach to search through the
669 * list of existing transformation rules and rebuild the transformation
670 * graph when it has been destroyed by Suff_ClearSuffixes. If the
671 * given rule is a transformation involving this suffix and another,
672 * existing suffix, the proper relationship is established between
679 * The appropriate links will be made between this suffix and
680 * others if transformation rules exist for it.
682 *-----------------------------------------------------------------------
685 SuffRebuildGraph(void *transformp, void *sp)
687 GNode *transform = (GNode *) transformp;
688 Suff *s = (Suff *) sp;
694 * First see if it is a transformation from this suffix.
696 cp = SuffStrIsPrefix(s->name, transform->name);
697 if (cp != (char *)NULL) {
698 if (cp[0] == '\0') /* null rule */
701 ln = Lst_Find(sufflist, (void *)cp, SuffSuffHasNameP);
703 s2 = (Suff *)Lst_Datum(ln);
707 * Found target. Link in and return, since it can't be anything
710 SuffInsert(s2->children, s);
711 SuffInsert(s->parents, s2);
717 * Not from, maybe to?
719 cp = SuffSuffIsSuffix(s, transform->name + strlen(transform->name));
720 if (cp != (char *)NULL) {
722 * Null-terminate the source suffix in order to find it.
725 ln = Lst_Find(sufflist, (void *)transform->name, SuffSuffHasNameP);
727 * Replace the start of the target suffix
732 * Found it -- establish the proper relationship
734 s2 = (Suff *)Lst_Datum(ln);
735 SuffInsert(s->children, s2);
736 SuffInsert(s2->parents, s);
743 *-----------------------------------------------------------------------
745 * Add the suffix in string to the end of the list of known suffixes.
746 * Should we restructure the suffix graph? Make doesn't...
752 * A GNode is created for the suffix and a Suff structure is created and
753 * added to the suffixes list unless the suffix was already known.
754 *-----------------------------------------------------------------------
757 Suff_AddSuffix (char *str)
759 Suff *s; /* new suffix descriptor */
762 ln = Lst_Find (sufflist, (void *)str, SuffSuffHasNameP);
764 s = (Suff *) emalloc (sizeof (Suff));
766 s->name = estrdup (str);
767 s->nameLen = strlen (s->name);
768 s->searchPath = Lst_Init (FALSE);
769 s->children = Lst_Init (FALSE);
770 s->parents = Lst_Init (FALSE);
771 s->ref = Lst_Init (FALSE);
776 (void)Lst_AtEnd (sufflist, (void *)s);
778 * Look for any existing transformations from or to this suffix.
779 * XXX: Only do this after a Suff_ClearSuffixes?
781 Lst_ForEach (transforms, SuffRebuildGraph, (void *)s);
786 *-----------------------------------------------------------------------
788 * Return the search path for the given suffix, if it's defined.
791 * The searchPath for the desired suffix or NULL if the suffix isn't
796 *-----------------------------------------------------------------------
799 Suff_GetPath (char *sname)
804 ln = Lst_Find (sufflist, (void *)sname, SuffSuffHasNameP);
808 s = (Suff *) Lst_Datum (ln);
809 return (s->searchPath);
814 *-----------------------------------------------------------------------
816 * Extend the search paths for all suffixes to include the default
823 * The searchPath field of all the suffixes is extended by the
824 * directories in dirSearchPath. If paths were specified for the
825 * ".h" suffix, the directories are stuffed into a global variable
826 * called ".INCLUDES" with each directory preceded by a -I. The same
827 * is done for the ".a" suffix, except the variable is called
828 * ".LIBS" and the flag is -L.
829 *-----------------------------------------------------------------------
837 Lst inIncludes; /* Cumulative .INCLUDES path */
838 Lst inLibs; /* Cumulative .LIBS path */
840 if (Lst_Open (sufflist) == FAILURE) {
844 inIncludes = Lst_Init(FALSE);
845 inLibs = Lst_Init(FALSE);
847 while ((ln = Lst_Next (sufflist)) != NULL) {
848 s = (Suff *) Lst_Datum (ln);
849 if (!Lst_IsEmpty (s->searchPath)) {
851 if (s->flags & SUFF_INCLUDE) {
852 Dir_Concat(inIncludes, s->searchPath);
854 #endif /* INCLUDES */
856 if (s->flags & SUFF_LIBRARY) {
857 Dir_Concat(inLibs, s->searchPath);
859 #endif /* LIBRARIES */
860 Dir_Concat(s->searchPath, dirSearchPath);
862 Lst_Destroy (s->searchPath, Dir_Destroy);
863 s->searchPath = Lst_Duplicate(dirSearchPath, Dir_CopyDir);
867 Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", inIncludes), VAR_GLOBAL);
869 Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", inLibs), VAR_GLOBAL);
872 Lst_Destroy(inIncludes, Dir_Destroy);
873 Lst_Destroy(inLibs, Dir_Destroy);
875 Lst_Close (sufflist);
879 *-----------------------------------------------------------------------
881 * Add the given suffix as a type of file which gets included.
882 * Called from the parse module when a .INCLUDES line is parsed.
883 * The suffix must have already been defined.
889 * The SUFF_INCLUDE bit is set in the suffix's flags field
891 *-----------------------------------------------------------------------
894 Suff_AddInclude (char *sname)
899 ln = Lst_Find (sufflist, (void *)sname, SuffSuffHasNameP);
901 s = (Suff *) Lst_Datum (ln);
902 s->flags |= SUFF_INCLUDE;
907 *-----------------------------------------------------------------------
909 * Add the given suffix as a type of file which is a library.
910 * Called from the parse module when parsing a .LIBS line. The
911 * suffix must have been defined via .SUFFIXES before this is
918 * The SUFF_LIBRARY bit is set in the suffix's flags field
920 *-----------------------------------------------------------------------
923 Suff_AddLib (char *sname)
928 ln = Lst_Find (sufflist, (void *)sname, SuffSuffHasNameP);
930 s = (Suff *) Lst_Datum (ln);
931 s->flags |= SUFF_LIBRARY;
935 /********** Implicit Source Search Functions *********/
938 *-----------------------------------------------------------------------
940 * Add a suffix as a Src structure to the given list with its parent
941 * being the given Src structure. If the suffix is the null suffix,
942 * the prefix is used unaltered as the file name in the Src structure.
948 * A Src structure is created and tacked onto the end of the list
949 *-----------------------------------------------------------------------
952 SuffAddSrc (void *sp, void *lsp)
954 Suff *s = (Suff *) sp;
955 LstSrc *ls = (LstSrc *) lsp;
956 Src *s2; /* new Src structure */
957 Src *targ; /* Target structure */
961 if ((s->flags & SUFF_NULL) && (*s->name != '\0')) {
963 * If the suffix has been marked as the NULL suffix, also create a Src
964 * structure for a file with no suffix attached. Two birds, and all
967 s2 = (Src *) emalloc (sizeof (Src));
968 s2->file = estrdup(targ->pref);
969 s2->pref = targ->pref;
976 (void)Lst_AtEnd (ls->l, (void *)s2);
978 s2->cp = Lst_Init(FALSE);
979 Lst_AtEnd(targ->cp, (void *) s2);
980 printf("1 add %x %x to %x:", targ, s2, ls->l);
981 Lst_ForEach(ls->l, PrintAddr, (void *) 0);
985 s2 = (Src *) emalloc (sizeof (Src));
986 s2->file = str_concat (targ->pref, s->name, 0);
987 s2->pref = targ->pref;
994 (void)Lst_AtEnd (ls->l, (void *)s2);
996 s2->cp = Lst_Init(FALSE);
997 Lst_AtEnd(targ->cp, (void *) s2);
998 printf("2 add %x %x to %x:", targ, s2, ls->l);
999 Lst_ForEach(ls->l, PrintAddr, (void *) 0);
1007 *-----------------------------------------------------------------------
1009 * Add all the children of targ as Src structures to the given list
1015 * Lots of structures are created and added to the list
1016 *-----------------------------------------------------------------------
1019 SuffAddLevel (Lst l, Src *targ)
1026 Lst_ForEach (targ->suff->children, SuffAddSrc, (void *)&ls);
1030 *----------------------------------------------------------------------
1032 * Free all src structures in list that don't have a reference count
1035 * Ture if an src was removed
1038 * The memory is free'd.
1039 *----------------------------------------------------------------------
1042 SuffRemoveSrc (Lst l)
1048 if (Lst_Open (l) == FAILURE) {
1052 printf("cleaning %lx: ", (unsigned long) l);
1053 Lst_ForEach(l, PrintAddr, (void *) 0);
1058 while ((ln = Lst_Next (l)) != NULL) {
1059 s = (Src *) Lst_Datum (ln);
1060 if (s->children == 0) {
1066 LstNode ln = Lst_Member(s->parent->cp, (void *)s);
1068 Lst_Remove(s->parent->cp, ln);
1070 --s->parent->children;
1073 printf("free: [l=%x] p=%x %d\n", l, s, s->children);
1074 Lst_Destroy(s->cp, NOFREE);
1084 printf("keep: [l=%x] p=%x %d: ", l, s, s->children);
1085 Lst_ForEach(s->cp, PrintAddr, (void *) 0);
1097 *-----------------------------------------------------------------------
1099 * Find the first existing file/target in the list srcs
1102 * The lowest structure in the chain of transformations
1106 *-----------------------------------------------------------------------
1109 SuffFindThem (Lst srcs, Lst slst)
1111 Src *s; /* current Src */
1112 Src *rs; /* returned Src */
1117 while (!Lst_IsEmpty (srcs)) {
1118 s = (Src *) Lst_DeQueue (srcs);
1120 DEBUGF(SUFF, ("\ttrying %s...", s->file));
1123 * A file is considered to exist if either a node exists in the
1124 * graph for it or the file actually exists.
1126 if (Targ_FindNode(s->file, TARG_NOCREATE) != NULL) {
1128 printf("remove %x from %x\n", s, srcs);
1134 if ((ptr = Dir_FindFile (s->file, s->suff->searchPath)) != NULL) {
1137 printf("remove %x from %x\n", s, srcs);
1143 DEBUGF(SUFF, ("not there\n"));
1145 SuffAddLevel (srcs, s);
1146 Lst_AtEnd(slst, (void *) s);
1150 DEBUGF(SUFF, ("got it\n"));
1156 *-----------------------------------------------------------------------
1158 * See if any of the children of the target in the Src structure is
1159 * one from which the target can be transformed. If there is one,
1160 * a Src structure is put together for it and returned.
1163 * The Src structure of the "winning" child, or NULL if no such beast.
1166 * A Src structure may be allocated.
1168 *-----------------------------------------------------------------------
1171 SuffFindCmds (Src *targ, Lst slst)
1173 LstNode ln; /* General-purpose list node */
1174 GNode *t, /* Target GNode */
1175 *s; /* Source GNode */
1176 int prefLen;/* The length of the defined prefix */
1177 Suff *suff; /* Suffix on matching beastie */
1178 Src *ret; /* Return value */
1182 (void) Lst_Open (t->children);
1183 prefLen = strlen (targ->pref);
1185 while ((ln = Lst_Next (t->children)) != NULL) {
1186 s = (GNode *)Lst_Datum (ln);
1188 cp = strrchr (s->name, '/');
1189 if (cp == (char *)NULL) {
1194 if (strncmp (cp, targ->pref, prefLen) == 0) {
1196 * The node matches the prefix ok, see if it has a known
1199 ln = Lst_Find (sufflist, (void *)&cp[prefLen],
1203 * It even has a known suffix, see if there's a transformation
1204 * defined between the node's suffix and the target's suffix.
1206 * XXX: Handle multi-stage transformations here, too.
1208 suff = (Suff *)Lst_Datum (ln);
1210 if (Lst_Member (suff->parents,
1211 (void *)targ->suff) != NULL)
1214 * Hot Damn! Create a new Src structure to describe
1215 * this transformation (making sure to duplicate the
1216 * source node's name so Suff_FindDeps can free it
1217 * again (ick)), and return the new structure.
1219 ret = (Src *)emalloc (sizeof (Src));
1220 ret->file = estrdup(s->name);
1221 ret->pref = targ->pref;
1227 targ->children += 1;
1229 ret->cp = Lst_Init(FALSE);
1230 printf("3 add %x %x\n", targ, ret);
1231 Lst_AtEnd(targ->cp, (void *) ret);
1233 Lst_AtEnd(slst, (void *) ret);
1234 DEBUGF(SUFF, ("\tusing existing source %s\n", s->name));
1240 Lst_Close (t->children);
1241 return ((Src *)NULL);
1245 *-----------------------------------------------------------------------
1246 * SuffExpandChildren --
1247 * Expand the names of any children of a given node that contain
1248 * variable invocations or file wildcards into actual targets.
1254 * The expanded node is removed from the parent's list of children,
1255 * and the parent's unmade counter is decremented, but other nodes
1258 *-----------------------------------------------------------------------
1261 SuffExpandChildren(void *cgnp, void *pgnp)
1263 GNode *cgn = (GNode *) cgnp;
1264 GNode *pgn = (GNode *) pgnp;
1265 GNode *gn; /* New source 8) */
1266 LstNode prevLN; /* Node after which new source should be put */
1267 LstNode ln; /* List element for old source */
1268 char *cp; /* Expanded value */
1271 * New nodes effectively take the place of the child, so place them
1274 prevLN = Lst_Member(pgn->children, (void *)cgn);
1277 * First do variable expansion -- this takes precedence over
1278 * wildcard expansion. If the result contains wildcards, they'll be gotten
1279 * to later since the resulting words are tacked on to the end of
1280 * the children list.
1282 if (strchr(cgn->name, '$') != (char *)NULL) {
1283 DEBUGF(SUFF, ("Expanding \"%s\"...", cgn->name));
1284 cp = Var_Subst(NULL, cgn->name, pgn, TRUE);
1286 if (cp != (char *)NULL) {
1287 Lst members = Lst_Init(FALSE);
1289 if (cgn->type & OP_ARCHV) {
1291 * Node was an archive(member) target, so we want to call
1292 * on the Arch module to find the nodes for us, expanding
1293 * variables in the parent's context.
1295 char *sacrifice = cp;
1297 (void)Arch_ParseArchive(&sacrifice, members, pgn);
1300 * Break the result into a vector of strings whose nodes
1301 * we can find, then add those nodes to the members list.
1302 * Unfortunately, we can't use brk_string b/c it
1303 * doesn't understand about variable specifications with
1307 char *initcp = cp; /* For freeing... */
1309 for (start = cp; *start == ' ' || *start == '\t'; start++)
1311 for (cp = start; *cp != '\0'; cp++) {
1312 if (*cp == ' ' || *cp == '\t') {
1314 * White-space -- terminate element, find the node,
1315 * add it, skip any further spaces.
1318 gn = Targ_FindNode(start, TARG_CREATE);
1319 (void)Lst_AtEnd(members, (void *)gn);
1320 while (*cp == ' ' || *cp == '\t') {
1324 * Adjust cp for increment at start of loop, but
1325 * set start to first non-space.
1328 } else if (*cp == '$') {
1330 * Start of a variable spec -- contact variable module
1331 * to find the end so we can skip over it.
1337 junk = Var_Parse(cp, pgn, TRUE, &len, &doFree);
1338 if (junk != var_Error) {
1345 } else if (*cp == '\\' && *cp != '\0') {
1347 * Escaped something -- skip over it
1355 * Stuff left over -- add it to the list too
1357 gn = Targ_FindNode(start, TARG_CREATE);
1358 (void)Lst_AtEnd(members, (void *)gn);
1361 * Point cp back at the beginning again so the variable value
1367 * Add all elements of the members list to the parent node.
1369 while(!Lst_IsEmpty(members)) {
1370 gn = (GNode *)Lst_DeQueue(members);
1372 DEBUGF(SUFF, ("%s...", gn->name));
1373 if (Lst_Member(pgn->children, (void *)gn) == NULL) {
1374 (void)Lst_Append(pgn->children, prevLN, (void *)gn);
1375 prevLN = Lst_Succ(prevLN);
1376 (void)Lst_AtEnd(gn->parents, (void *)pgn);
1380 Lst_Destroy(members, NOFREE);
1387 * Now the source is expanded, remove it from the list of children to
1388 * keep it from being processed.
1390 ln = Lst_Member(pgn->children, (void *)cgn);
1392 Lst_Remove(pgn->children, ln);
1393 DEBUGF(SUFF, ("\n"));
1394 } else if (Dir_HasWildcards(cgn->name)) {
1395 Lst exp; /* List of expansions */
1396 Lst path; /* Search path along which to expand */
1399 * Find a path along which to expand the word.
1401 * If the word has a known suffix, use that path.
1402 * If it has no known suffix and we're allowed to use the null
1403 * suffix, use its path.
1404 * Else use the default system search path.
1406 cp = cgn->name + strlen(cgn->name);
1407 ln = Lst_Find(sufflist, (void *)cp, SuffSuffIsSuffixP);
1409 DEBUGF(SUFF, ("Wildcard expanding \"%s\"...", cgn->name));
1412 Suff *s = (Suff *)Lst_Datum(ln);
1414 DEBUGF(SUFF, ("suffix is \"%s\"...", s->name));
1415 path = s->searchPath;
1418 * Use default search path
1420 path = dirSearchPath;
1424 * Expand the word along the chosen path
1426 exp = Lst_Init(FALSE);
1427 Dir_Expand(cgn->name, path, exp);
1429 while (!Lst_IsEmpty(exp)) {
1431 * Fetch next expansion off the list and find its GNode
1433 cp = (char *)Lst_DeQueue(exp);
1435 DEBUGF(SUFF, ("%s...", cp));
1436 gn = Targ_FindNode(cp, TARG_CREATE);
1439 * If gn isn't already a child of the parent, make it so and
1440 * up the parent's count of unmade children.
1442 if (Lst_Member(pgn->children, (void *)gn) == NULL) {
1443 (void)Lst_Append(pgn->children, prevLN, (void *)gn);
1444 prevLN = Lst_Succ(prevLN);
1445 (void)Lst_AtEnd(gn->parents, (void *)pgn);
1451 * Nuke what's left of the list
1453 Lst_Destroy(exp, NOFREE);
1456 * Now the source is expanded, remove it from the list of children to
1457 * keep it from being processed.
1459 ln = Lst_Member(pgn->children, (void *)cgn);
1461 Lst_Remove(pgn->children, ln);
1462 DEBUGF(SUFF, ("\n"));
1469 *-----------------------------------------------------------------------
1470 * SuffApplyTransform --
1471 * Apply a transformation rule, given the source and target nodes
1475 * TRUE if successful, FALSE if not.
1478 * The source and target are linked and the commands from the
1479 * transformation are added to the target node's commands list.
1480 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1481 * to the target. The target also inherits all the sources for
1482 * the transformation rule.
1484 *-----------------------------------------------------------------------
1487 SuffApplyTransform(GNode *tGn, GNode *sGn, Suff *t, Suff *s)
1489 LstNode ln; /* General node */
1490 char *tname; /* Name of transformation rule */
1491 GNode *gn; /* Node for same */
1493 if (Lst_Member(tGn->children, (void *)sGn) == NULL) {
1495 * Not already linked, so form the proper links between the
1496 * target and source.
1498 (void)Lst_AtEnd(tGn->children, (void *)sGn);
1499 (void)Lst_AtEnd(sGn->parents, (void *)tGn);
1503 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1505 * When a :: node is used as the implied source of a node, we have
1506 * to link all its cohorts in as sources as well. Only the initial
1507 * sGn gets the target in its iParents list, however, as that
1508 * will be sufficient to get the .IMPSRC variable set for tGn
1510 for (ln=Lst_First(sGn->cohorts); ln != NULL; ln=Lst_Succ(ln)) {
1511 gn = (GNode *)Lst_Datum(ln);
1513 if (Lst_Member(tGn->children, (void *)gn) == NULL) {
1515 * Not already linked, so form the proper links between the
1516 * target and source.
1518 (void)Lst_AtEnd(tGn->children, (void *)gn);
1519 (void)Lst_AtEnd(gn->parents, (void *)tGn);
1525 * Locate the transformation rule itself
1527 tname = str_concat(s->name, t->name, 0);
1528 ln = Lst_Find(transforms, (void *)tname, SuffGNHasNameP);
1533 * Not really such a transformation rule (can happen when we're
1534 * called to link an OP_MEMBER and OP_ARCHV node), so return
1540 gn = (GNode *)Lst_Datum(ln);
1542 DEBUGF(SUFF, ("\tapplying %s -> %s to \"%s\"\n", s->name, t->name, tGn->name));
1545 * Record last child for expansion purposes
1547 ln = Lst_Last(tGn->children);
1550 * Pass the buck to Make_HandleUse to apply the rule
1552 (void)Make_HandleUse(gn, tGn);
1555 * Deal with wildcards and variables in any acquired sources
1559 Lst_ForEachFrom(tGn->children, ln,
1560 SuffExpandChildren, (void *)tGn);
1564 * Keep track of another parent to which this beast is transformed so
1565 * the .IMPSRC variable can be set correctly for the parent.
1567 (void)Lst_AtEnd(sGn->iParents, (void *)tGn);
1574 *-----------------------------------------------------------------------
1575 * SuffFindArchiveDeps --
1576 * Locate dependencies for an OP_ARCHV node.
1582 * Same as Suff_FindDeps
1584 *-----------------------------------------------------------------------
1587 SuffFindArchiveDeps(GNode *gn, Lst slst)
1589 char *eoarch; /* End of archive portion */
1590 char *eoname; /* End of member portion */
1591 GNode *mem; /* Node for member */
1592 static char *copy[] = { /* Variables to be copied from the member node */
1593 TARGET, /* Must be first */
1594 PREFIX, /* Must be second */
1596 int i; /* Index into copy and vals */
1597 Suff *ms; /* Suffix descriptor for member */
1598 char *name; /* Start of member's name */
1601 * The node is an archive(member) pair. so we must find a
1602 * suffix for both of them.
1604 eoarch = strchr (gn->name, '(');
1605 eoname = strchr (eoarch, ')');
1607 *eoname = '\0'; /* Nuke parentheses during suffix search */
1608 *eoarch = '\0'; /* So a suffix can be found */
1613 * To simplify things, call Suff_FindDeps recursively on the member now,
1614 * so we can simply compare the member's .PREFIX and .TARGET variables
1615 * to locate its suffix. This allows us to figure out the suffix to
1616 * use for the archive without having to do a quadratic search over the
1617 * suffix list, backtracking for each one...
1619 mem = Targ_FindNode(name, TARG_CREATE);
1620 SuffFindDeps(mem, slst);
1623 * Create the link between the two nodes right off
1625 if (Lst_Member(gn->children, (void *)mem) == NULL) {
1626 (void)Lst_AtEnd(gn->children, (void *)mem);
1627 (void)Lst_AtEnd(mem->parents, (void *)gn);
1632 * Copy in the variables from the member node to this one.
1634 for (i = (sizeof(copy)/sizeof(copy[0]))-1; i >= 0; i--) {
1636 Var_Set(copy[i], Var_Value(copy[i], mem, &p1), gn);
1644 * Didn't know what it was -- use .NULL suffix if not in make mode
1646 DEBUGF(SUFF, ("using null suffix\n"));
1652 * Set the other two local variables required for this target.
1654 Var_Set (MEMBER, name, gn);
1655 Var_Set (ARCHIVE, gn->name, gn);
1659 * Member has a known suffix, so look for a transformation rule from
1660 * it to a possible suffix of the archive. Rather than searching
1661 * through the entire list, we just look at suffixes to which the
1662 * member's suffix may be transformed...
1667 * Use first matching suffix...
1669 ln = Lst_Find(ms->parents, eoarch, SuffSuffIsSuffixP);
1673 * Got one -- apply it
1675 if (!SuffApplyTransform(gn, mem, (Suff *)Lst_Datum(ln), ms)) {
1676 DEBUGF(SUFF, ("\tNo transformation from %s -> %s\n",
1677 ms->name, ((Suff *)Lst_Datum(ln))->name));
1683 * Replace the opening and closing parens now we've no need of the separate
1686 *eoarch = '('; *eoname = ')';
1689 * Pretend gn appeared to the left of a dependency operator so
1690 * the user needn't provide a transformation from the member to the
1693 if (OP_NOP(gn->type)) {
1694 gn->type |= OP_DEPENDS;
1698 * Flag the member as such so we remember to look in the archive for
1699 * its modification time.
1701 mem->type |= OP_MEMBER;
1705 *-----------------------------------------------------------------------
1706 * SuffFindNormalDeps --
1707 * Locate implicit dependencies for regular targets.
1713 * Same as Suff_FindDeps...
1715 *-----------------------------------------------------------------------
1718 SuffFindNormalDeps(GNode *gn, Lst slst)
1720 char *eoname; /* End of name */
1721 char *sopref; /* Start of prefix */
1722 LstNode ln; /* Next suffix node to check */
1723 Lst srcs; /* List of sources at which to look */
1724 Lst targs; /* List of targets to which things can be
1725 * transformed. They all have the same file,
1726 * but different suff and pref fields */
1727 Src *bottom; /* Start of found transformation path */
1728 Src *src; /* General Src pointer */
1729 char *pref; /* Prefix to use */
1730 Src *targ; /* General Src target pointer */
1733 eoname = gn->name + strlen(gn->name);
1738 * Begin at the beginning...
1740 ln = Lst_First(sufflist);
1741 srcs = Lst_Init(FALSE);
1742 targs = Lst_Init(FALSE);
1745 * We're caught in a catch-22 here. On the one hand, we want to use any
1746 * transformation implied by the target's sources, but we can't examine
1747 * the sources until we've expanded any variables/wildcards they may hold,
1748 * and we can't do that until we've set up the target's local variables
1749 * and we can't do that until we know what the proper suffix for the
1750 * target is (in case there are two suffixes one of which is a suffix of
1751 * the other) and we can't know that until we've found its implied
1752 * source, which we may not want to use if there's an existing source
1753 * that implies a different transformation.
1755 * In an attempt to get around this, which may not work all the time,
1756 * but should work most of the time, we look for implied sources first,
1757 * checking transformations to all possible suffixes of the target,
1758 * use what we find to set the target's local variables, expand the
1759 * children, then look for any overriding transformations they imply.
1760 * Should we find one, we discard the one we found before.
1763 while (ln != NULL) {
1765 * Look for next possible suffix...
1767 ln = Lst_FindFrom(sufflist, ln, eoname, SuffSuffIsSuffixP);
1770 int prefLen; /* Length of the prefix */
1774 * Allocate a Src structure to which things can be transformed
1776 targ = (Src *)emalloc(sizeof (Src));
1777 targ->file = estrdup(gn->name);
1778 targ->suff = (Suff *)Lst_Datum(ln);
1779 targ->suff->refCount++;
1781 targ->parent = (Src *)NULL;
1784 targ->cp = Lst_Init(FALSE);
1788 * Allocate room for the prefix, whose end is found by subtracting
1789 * the length of the suffix from the end of the name.
1791 prefLen = (eoname - targ->suff->nameLen) - sopref;
1792 targ->pref = emalloc(prefLen + 1);
1793 memcpy(targ->pref, sopref, prefLen);
1794 targ->pref[prefLen] = '\0';
1797 * Add nodes from which the target can be made
1799 SuffAddLevel(srcs, targ);
1802 * Record the target so we can nuke it
1804 (void)Lst_AtEnd(targs, (void *)targ);
1807 * Search from this suffix's successor...
1814 * Handle target of unknown suffix...
1816 if (Lst_IsEmpty(targs) && suffNull != NULL) {
1817 DEBUGF(SUFF, ("\tNo known suffix on %s. Using .NULL suffix\n", gn->name));
1819 targ = (Src *)emalloc(sizeof (Src));
1820 targ->file = estrdup(gn->name);
1821 targ->suff = suffNull;
1822 targ->suff->refCount++;
1824 targ->parent = (Src *)NULL;
1826 targ->pref = estrdup(sopref);
1828 targ->cp = Lst_Init(FALSE);
1832 * Only use the default suffix rules if we don't have commands
1833 * or dependencies defined for this gnode
1835 if (Lst_IsEmpty(gn->commands) && Lst_IsEmpty(gn->children))
1836 SuffAddLevel(srcs, targ);
1838 DEBUGF(SUFF, ("not "));
1841 DEBUGF(SUFF, ("adding suffix rules\n"));
1843 (void)Lst_AtEnd(targs, (void *)targ);
1847 * Using the list of possible sources built up from the target suffix(es),
1848 * try and find an existing file/target that matches.
1850 bottom = SuffFindThem(srcs, slst);
1852 if (bottom == (Src *)NULL) {
1854 * No known transformations -- use the first suffix found for setting
1855 * the local variables.
1857 if (!Lst_IsEmpty(targs)) {
1858 targ = (Src *)Lst_Datum(Lst_First(targs));
1864 * Work up the transformation path to find the suffix of the
1865 * target to which the transformation was made.
1867 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1872 * The .TARGET variable we always set to be the name at this point,
1873 * since it's only set to the path if the thing is only a source and
1874 * if it's only a source, it doesn't matter what we put here as far
1875 * as expanding sources is concerned, since it has none...
1877 Var_Set(TARGET, gn->name, gn);
1879 pref = (targ != NULL) ? targ->pref : gn->name;
1880 Var_Set(PREFIX, pref, gn);
1883 * Now we've got the important local variables set, expand any sources
1884 * that still contain variables or wildcards in their names.
1886 Lst_ForEach(gn->children, SuffExpandChildren, (void *)gn);
1889 DEBUGF(SUFF, ("\tNo valid suffix on %s\n", gn->name));
1893 * Deal with finding the thing on the default search path if the
1894 * node is only a source (not on the lhs of a dependency operator
1895 * or [XXX] it has neither children or commands).
1897 if (OP_NOP(gn->type) ||
1898 (Lst_IsEmpty(gn->children) && Lst_IsEmpty(gn->commands)))
1900 gn->path = Dir_FindFile(gn->name,
1901 (targ == NULL ? dirSearchPath :
1902 targ->suff->searchPath));
1903 if (gn->path != NULL) {
1905 Var_Set(TARGET, gn->path, gn);
1909 * Suffix known for the thing -- trim the suffix off
1910 * the path to form the proper .PREFIX variable.
1912 int savep = strlen(gn->path) - targ->suff->nameLen;
1916 gn->suffix->refCount--;
1917 gn->suffix = targ->suff;
1918 gn->suffix->refCount++;
1920 savec = gn->path[savep];
1921 gn->path[savep] = '\0';
1923 if ((ptr = strrchr(gn->path, '/')) != NULL)
1928 Var_Set(PREFIX, ptr, gn);
1930 gn->path[savep] = savec;
1933 * The .PREFIX gets the full path if the target has
1937 gn->suffix->refCount--;
1940 if ((ptr = strrchr(gn->path, '/')) != NULL)
1945 Var_Set(PREFIX, ptr, gn);
1950 * Not appropriate to search for the thing -- set the
1951 * path to be the name so Dir_MTime won't go grovelling for
1955 gn->suffix->refCount--;
1956 gn->suffix = (targ == NULL) ? NULL : targ->suff;
1958 gn->suffix->refCount++;
1960 gn->path = estrdup(gn->name);
1967 * If the suffix indicates that the target is a library, mark that in
1968 * the node's type field.
1970 if (targ->suff->flags & SUFF_LIBRARY) {
1975 * Check for overriding transformation rule implied by sources
1977 if (!Lst_IsEmpty(gn->children)) {
1978 src = SuffFindCmds(targ, slst);
1980 if (src != (Src *)NULL) {
1982 * Free up all the Src structures in the transformation path
1983 * up to, but not including, the parent node.
1985 while (bottom && bottom->parent != NULL) {
1986 if (Lst_Member(slst, (void *) bottom) == NULL) {
1987 Lst_AtEnd(slst, (void *) bottom);
1989 bottom = bottom->parent;
1995 if (bottom == NULL) {
1997 * No idea from where it can come -- return now.
2003 * We now have a list of Src structures headed by 'bottom' and linked via
2004 * their 'parent' pointers. What we do next is create links between
2005 * source and target nodes (which may or may not have been created)
2006 * and set the necessary local variables in each target. The
2007 * commands for each target are set from the commands of the
2008 * transformation rule used to get from the src suffix to the targ
2009 * suffix. Note that this causes the commands list of the original
2010 * node, gn, to be replaced by the commands of the final
2011 * transformation rule. Also, the unmade field of gn is incremented.
2014 if (bottom->node == NULL) {
2015 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
2018 for (src = bottom; src->parent != (Src *)NULL; src = src->parent) {
2021 if (src->node->suffix)
2022 src->node->suffix->refCount--;
2023 src->node->suffix = src->suff;
2024 src->node->suffix->refCount++;
2026 if (targ->node == NULL) {
2027 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
2030 SuffApplyTransform(targ->node, src->node,
2031 targ->suff, src->suff);
2033 if (targ->node != gn) {
2035 * Finish off the dependency-search process for any nodes
2036 * between bottom and gn (no point in questing around the
2037 * filesystem for their implicit source when it's already
2038 * known). Note that the node can't have any sources that
2039 * need expanding, since SuffFindThem will stop on an existing
2040 * node, so all we need to do is set the standard and System V
2043 targ->node->type |= OP_DEPS_FOUND;
2045 Var_Set(PREFIX, targ->pref, targ->node);
2047 Var_Set(TARGET, targ->node->name, targ->node);
2052 gn->suffix->refCount--;
2053 gn->suffix = src->suff;
2054 gn->suffix->refCount++;
2057 * So Dir_MTime doesn't go questing for it...
2060 gn->path = estrdup(gn->name);
2063 * Nuke the transformation path and the Src structures left over in the
2068 if (Lst_Member(slst, (void *) bottom) == NULL)
2069 Lst_AtEnd(slst, (void *) bottom);
2071 while (SuffRemoveSrc(srcs) || SuffRemoveSrc(targs))
2074 Lst_Concat(slst, srcs, LST_CONCLINK);
2075 Lst_Concat(slst, targs, LST_CONCLINK);
2080 *-----------------------------------------------------------------------
2082 * Find implicit sources for the target described by the graph node
2089 * Nodes are added to the graph below the passed-in node. The nodes
2090 * are marked to have their IMPSRC variable filled in. The
2091 * PREFIX variable is set for the given node and all its
2095 * The path found by this target is the shortest path in the
2096 * transformation graph, which may pass through non-existent targets,
2097 * to an existing target. The search continues on all paths from the
2098 * root suffix until a file is found. I.e. if there's a path
2099 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2100 * the .c and .l files don't, the search will branch out in
2101 * all directions from .o and again from all the nodes on the
2102 * next level until the .l,v node is encountered.
2104 *-----------------------------------------------------------------------
2108 Suff_FindDeps(GNode *gn)
2111 SuffFindDeps(gn, srclist);
2112 while (SuffRemoveSrc(srclist))
2118 SuffFindDeps (GNode *gn, Lst slst)
2120 if (gn->type & OP_DEPS_FOUND) {
2122 * If dependencies already found, no need to do it again...
2126 gn->type |= OP_DEPS_FOUND;
2129 DEBUGF(SUFF, ("SuffFindDeps (%s)\n", gn->name));
2131 if (gn->type & OP_ARCHV) {
2132 SuffFindArchiveDeps(gn, slst);
2133 } else if (gn->type & OP_LIB) {
2135 * If the node is a library, it is the arch module's job to find it
2136 * and set the TARGET variable accordingly. We merely provide the
2137 * search path, assuming all libraries end in ".a" (if the suffix
2138 * hasn't been defined, there's nothing we can do for it, so we just
2139 * set the TARGET variable to the node's name in order to give it a
2145 ln = Lst_Find (sufflist, (void *)LIBSUFF, SuffSuffHasNameP);
2147 gn->suffix->refCount--;
2149 gn->suffix = s = (Suff *) Lst_Datum (ln);
2150 gn->suffix->refCount++;
2151 Arch_FindLib (gn, s->searchPath);
2154 Var_Set (TARGET, gn->name, gn);
2157 * Because a library (-lfoo) target doesn't follow the standard
2158 * filesystem conventions, we don't set the regular variables for
2159 * the thing. .PREFIX is simply made empty...
2161 Var_Set(PREFIX, "", gn);
2163 SuffFindNormalDeps(gn, slst);
2168 *-----------------------------------------------------------------------
2170 * Define which suffix is the null suffix.
2176 * 'suffNull' is altered.
2179 * Need to handle the changing of the null suffix gracefully so the
2180 * old transformation rules don't just go away.
2182 *-----------------------------------------------------------------------
2185 Suff_SetNull(char *name)
2190 ln = Lst_Find(sufflist, (void *)name, SuffSuffHasNameP);
2192 s = (Suff *)Lst_Datum(ln);
2193 if (suffNull != (Suff *)NULL) {
2194 suffNull->flags &= ~SUFF_NULL;
2196 s->flags |= SUFF_NULL;
2198 * XXX: Here's where the transformation mangling would take place
2202 Parse_Error (PARSE_WARNING, "Desired null suffix %s not defined.",
2208 *-----------------------------------------------------------------------
2210 * Initialize suffixes module
2217 *-----------------------------------------------------------------------
2222 sufflist = Lst_Init (FALSE);
2223 suffClean = Lst_Init(FALSE);
2224 srclist = Lst_Init (FALSE);
2225 transforms = Lst_Init (FALSE);
2229 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2230 * actually go on the suffix list or everyone will think that's its
2233 emptySuff = suffNull = (Suff *) emalloc (sizeof (Suff));
2235 suffNull->name = estrdup ("");
2236 suffNull->nameLen = 0;
2237 suffNull->searchPath = Lst_Init (FALSE);
2238 Dir_Concat(suffNull->searchPath, dirSearchPath);
2239 suffNull->children = Lst_Init (FALSE);
2240 suffNull->parents = Lst_Init (FALSE);
2241 suffNull->ref = Lst_Init (FALSE);
2242 suffNull->sNum = sNum++;
2243 suffNull->flags = SUFF_NULL;
2244 suffNull->refCount = 1;
2250 *----------------------------------------------------------------------
2252 * Cleanup the this module
2258 * The memory is free'd.
2259 *----------------------------------------------------------------------
2265 Lst_Destroy(sufflist, SuffFree);
2266 Lst_Destroy(suffClean, SuffFree);
2269 Lst_Destroy(srclist, NOFREE);
2270 Lst_Destroy(transforms, NOFREE);
2274 /********************* DEBUGGING FUNCTIONS **********************/
2277 SuffPrintName(void *s, void *dummy __unused)
2279 printf ("`%s' ", ((Suff *) s)->name);
2284 SuffPrintSuff (void *sp, void *dummy __unused)
2286 Suff *s = (Suff *) sp;
2290 printf ("# `%s' [%d] ", s->name, s->refCount);
2294 fputs (" (", stdout);
2296 flag = 1 << (ffs(flags) - 1);
2309 fputc(flags ? '|' : ')', stdout);
2312 fputc ('\n', stdout);
2314 Lst_ForEach (s->parents, SuffPrintName, (void *)0);
2315 fputc ('\n', stdout);
2316 printf ("#\tFrom: ");
2317 Lst_ForEach (s->children, SuffPrintName, (void *)0);
2318 fputc ('\n', stdout);
2319 printf ("#\tSearch Path: ");
2320 Dir_PrintPath (s->searchPath);
2321 fputc ('\n', stdout);
2326 SuffPrintTrans (void *tp, void *dummy __unused)
2328 GNode *t = (GNode *) tp;
2330 printf ("%-16s: ", t->name);
2331 Targ_PrintType (t->type);
2332 fputc ('\n', stdout);
2333 Lst_ForEach (t->commands, Targ_PrintCmd, (void *)0);
2334 fputc ('\n', stdout);
2341 printf ("#*** Suffixes:\n");
2342 Lst_ForEach (sufflist, SuffPrintSuff, (void *)0);
2344 printf ("#*** Transformations:\n");
2345 Lst_ForEach (transforms, SuffPrintTrans, (void *)0);