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.1 2001/03/09 01:13:24 tmm Exp $
40 * $DragonFly: src/usr.bin/make/suff.c,v 1.4 2004/04/13 13:49:00 eirikn 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 NILGNODE
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(ClientData, ClientData);
158 static int SuffSuffHasNameP(ClientData, ClientData);
159 static int SuffSuffIsPrefix(ClientData, ClientData);
160 static int SuffGNHasNameP(ClientData, ClientData);
161 static void SuffFree(ClientData);
162 static void SuffInsert(Lst, Suff *);
163 static void SuffRemove(Lst, Suff *);
164 static Boolean SuffParseTransform(char *, Suff **, Suff **);
165 static int SuffRebuildGraph(ClientData, ClientData);
166 static int SuffAddSrc(ClientData, ClientData);
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(ClientData, ClientData);
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(ClientData, ClientData);
177 static int SuffPrintSuff(ClientData, ClientData);
178 static int SuffPrintTrans(ClientData, ClientData);
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 (pref, str)
195 register char *pref; /* possible prefix */
196 register char *str; /* string to check */
198 while (*str && *pref == *str) {
203 return (*pref ? NULL : str);
207 *-----------------------------------------------------------------------
208 * SuffSuffIsSuffix --
209 * See if suff is a suffix of str. Str should point to THE END of the
210 * string to check. (THE END == the null byte)
213 * NULL if it ain't, pointer to character in str before suffix if
218 *-----------------------------------------------------------------------
221 SuffSuffIsSuffix (s, str)
222 register Suff *s; /* possible suffix */
223 char *str; /* string to examine */
225 register char *p1; /* Pointer into suffix name */
226 register char *p2; /* Pointer into string being examined */
228 p1 = s->name + s->nameLen;
231 while (p1 >= s->name && *p1 == *p2) {
236 return (p1 == s->name - 1 ? p2 : NULL);
240 *-----------------------------------------------------------------------
241 * SuffSuffIsSuffixP --
242 * Predicate form of SuffSuffIsSuffix. Passed as the callback function
246 * 0 if the suffix is the one desired, non-zero if not.
251 *-----------------------------------------------------------------------
254 SuffSuffIsSuffixP(s, str)
258 return(!SuffSuffIsSuffix((Suff *) s, (char *) str));
262 *-----------------------------------------------------------------------
263 * SuffSuffHasNameP --
264 * Callback procedure for finding a suffix based on its name. Used by
268 * 0 if the suffix is of the given name. non-zero otherwise.
272 *-----------------------------------------------------------------------
275 SuffSuffHasNameP (s, sname)
276 ClientData s; /* Suffix to check */
277 ClientData sname; /* Desired name */
279 return (strcmp ((char *) sname, ((Suff *) s)->name));
283 *-----------------------------------------------------------------------
284 * SuffSuffIsPrefix --
285 * See if the suffix described by s is a prefix of the string. Care
286 * must be taken when using this to search for transformations and
287 * what-not, since there could well be two suffixes, one of which
288 * is a prefix of the other...
291 * 0 if s is a prefix of str. non-zero otherwise
295 *-----------------------------------------------------------------------
298 SuffSuffIsPrefix (s, str)
299 ClientData s; /* suffix to compare */
300 ClientData str; /* string to examine */
302 return (SuffStrIsPrefix (((Suff *) s)->name, (char *) str) == NULL ? 1 : 0);
306 *-----------------------------------------------------------------------
308 * See if the graph node has the desired name
311 * 0 if it does. non-zero if it doesn't
315 *-----------------------------------------------------------------------
318 SuffGNHasNameP (gn, name)
319 ClientData gn; /* current node we're looking at */
320 ClientData name; /* name we're looking for */
322 return (strcmp ((char *) name, ((GNode *) gn)->name));
325 /*********** Maintenance Functions ************/
328 *-----------------------------------------------------------------------
330 * Free up all memory associated with the given suffix structure.
336 * the suffix entry is detroyed
337 *-----------------------------------------------------------------------
343 Suff *s = (Suff *) sp;
351 Lst_Destroy (s->ref, NOFREE);
352 Lst_Destroy (s->children, NOFREE);
353 Lst_Destroy (s->parents, NOFREE);
354 Lst_Destroy (s->searchPath, Dir_Destroy);
356 free ((Address)s->name);
361 *-----------------------------------------------------------------------
363 * Remove the suffix into the list
369 * The reference count for the suffix is decremented
370 *-----------------------------------------------------------------------
377 LstNode ln = Lst_Member(l, (ClientData)s);
378 if (ln != NILLNODE) {
385 *-----------------------------------------------------------------------
387 * Insert the suffix into the list keeping the list ordered by suffix
394 * The reference count of the suffix is incremented
395 *-----------------------------------------------------------------------
399 Lst l; /* the list where in s should be inserted */
400 Suff *s; /* the suffix to insert */
402 LstNode ln; /* current element in l we're examining */
403 Suff *s2 = NULL; /* the suffix descriptor in this element */
405 if (Lst_Open (l) == FAILURE) {
408 while ((ln = Lst_Next (l)) != NILLNODE) {
409 s2 = (Suff *) Lst_Datum (ln);
410 if (s2->sNum >= s->sNum) {
417 printf("inserting %s(%d)...", s->name, s->sNum);
419 if (ln == NILLNODE) {
421 printf("at end of list\n");
423 (void)Lst_AtEnd (l, (ClientData)s);
425 (void)Lst_AtEnd(s->ref, (ClientData) l);
426 } else if (s2->sNum != s->sNum) {
428 printf("before %s(%d)\n", s2->name, s2->sNum);
430 (void)Lst_Insert (l, ln, (ClientData)s);
432 (void)Lst_AtEnd(s->ref, (ClientData) l);
433 } else if (DEBUG(SUFF)) {
434 printf("already there\n");
439 *-----------------------------------------------------------------------
440 * Suff_ClearSuffixes --
441 * This is gross. Nuke the list of suffixes but keep all transformation
442 * rules around. The transformation graph is destroyed in this process,
443 * but we leave the list of rules so when a new graph is formed the rules
445 * This function is called from the parse module when a
446 * .SUFFIXES:\n line is encountered.
452 * the sufflist and its graph nodes are destroyed
453 *-----------------------------------------------------------------------
456 Suff_ClearSuffixes ()
458 Lst_Concat (suffClean, sufflist, LST_CONCLINK);
459 sufflist = Lst_Init(FALSE);
461 suffNull = emptySuff;
463 * Clear suffNull's children list (the other suffixes are built new, but
464 * suffNull is used as is).
465 * NOFREE is used because all suffixes are are on the suffClean list.
466 * suffNull should not have parents.
468 Lst_Destroy(suffNull->children, NOFREE);
469 suffNull->children = Lst_Init(FALSE);
473 *-----------------------------------------------------------------------
474 * SuffParseTransform --
475 * Parse a transformation string to find its two component suffixes.
478 * TRUE if the string is a valid transformation and FALSE otherwise.
481 * The passed pointers are overwritten.
483 *-----------------------------------------------------------------------
486 SuffParseTransform(str, srcPtr, targPtr)
487 char *str; /* String being parsed */
488 Suff **srcPtr; /* Place to store source of trans. */
489 Suff **targPtr; /* Place to store target of trans. */
491 register LstNode srcLn; /* element in suffix list of trans source*/
492 register Suff *src; /* Source of transformation */
493 register LstNode targLn; /* element in suffix list of trans target*/
494 register char *str2; /* Extra pointer (maybe target suffix) */
495 LstNode singleLn; /* element in suffix list of any suffix
496 * that exactly matches str */
497 Suff *single = NULL;/* Source of possible transformation to
504 * Loop looking first for a suffix that matches the start of the
505 * string and then for one that exactly matches the rest of it. If
506 * we can find two that meet these criteria, we've successfully
510 if (srcLn == NILLNODE) {
511 srcLn = Lst_Find(sufflist, (ClientData)str, SuffSuffIsPrefix);
513 srcLn = Lst_FindFrom (sufflist, Lst_Succ(srcLn), (ClientData)str,
516 if (srcLn == NILLNODE) {
518 * Ran out of source suffixes -- no such rule
520 if (singleLn != NILLNODE) {
522 * Not so fast Mr. Smith! There was a suffix that encompassed
523 * the entire string, so we assume it was a transformation
524 * to the null suffix (thank you POSIX). We still prefer to
525 * find a double rule over a singleton, hence we leave this
526 * check until the end.
528 * XXX: Use emptySuff over suffNull?
536 src = (Suff *) Lst_Datum (srcLn);
537 str2 = str + src->nameLen;
542 targLn = Lst_Find(sufflist, (ClientData)str2, SuffSuffHasNameP);
543 if (targLn != NILLNODE) {
545 *targPtr = (Suff *)Lst_Datum(targLn);
553 *-----------------------------------------------------------------------
554 * Suff_IsTransform --
555 * Return TRUE if the given string is a transformation rule
559 * TRUE if the string is a concatenation of two known suffixes.
564 *-----------------------------------------------------------------------
567 Suff_IsTransform (str)
568 char *str; /* string to check */
572 return (SuffParseTransform(str, &src, &targ));
576 *-----------------------------------------------------------------------
577 * Suff_AddTransform --
578 * Add the transformation rule described by the line to the
579 * list of rules and place the transformation itself in the graph
582 * The node created for the transformation in the transforms list
585 * The node is placed on the end of the transforms Lst and links are
586 * made between the two suffixes mentioned in the target name
587 *-----------------------------------------------------------------------
590 Suff_AddTransform (line)
591 char *line; /* name of transformation to add */
593 GNode *gn; /* GNode of transformation rule */
594 Suff *s, /* source suffix */
595 *t; /* target suffix */
596 LstNode ln; /* Node for existing transformation */
598 ln = Lst_Find (transforms, (ClientData)line, SuffGNHasNameP);
599 if (ln == NILLNODE) {
601 * Make a new graph node for the transformation. It will be filled in
602 * by the Parse module.
604 gn = Targ_NewGN (line);
605 (void)Lst_AtEnd (transforms, (ClientData)gn);
608 * New specification for transformation rule. Just nuke the old list
609 * of commands so they can be filled in again... We don't actually
610 * free the commands themselves, because a given command can be
611 * attached to several different transformations.
613 gn = (GNode *) Lst_Datum (ln);
614 Lst_Destroy (gn->commands, NOFREE);
615 Lst_Destroy (gn->children, NOFREE);
616 gn->commands = Lst_Init (FALSE);
617 gn->children = Lst_Init (FALSE);
620 gn->type = OP_TRANSFORM;
622 (void)SuffParseTransform(line, &s, &t);
625 * link the two together in the proper relationship and order
628 printf("defining transformation from `%s' to `%s'\n",
631 SuffInsert (t->children, s);
632 SuffInsert (s->parents, t);
638 *-----------------------------------------------------------------------
639 * Suff_EndTransform --
640 * Handle the finish of a transformation definition, removing the
641 * transformation from the graph if it has neither commands nor
642 * sources. This is a callback procedure for the Parse module via
649 * If the node has no commands or children, the children and parents
650 * lists of the affected suffices are altered.
652 *-----------------------------------------------------------------------
655 Suff_EndTransform(gnp, dummy)
656 ClientData gnp; /* Node for transformation */
657 ClientData dummy; /* Node for transformation */
659 GNode *gn = (GNode *) gnp;
661 if ((gn->type & OP_TRANSFORM) && Lst_IsEmpty(gn->commands) &&
662 Lst_IsEmpty(gn->children))
667 * SuffParseTransform() may fail for special rules which are not
668 * actual transformation rules (e.g., .DEFAULT).
670 if (!SuffParseTransform(gn->name, &s, &t))
674 printf("deleting transformation from `%s' to `%s'\n",
679 * Remove the source from the target's children list. We check for a
680 * nil return to handle a beanhead saying something like
683 * We'll be called twice when the next target is seen, but .c and .o
684 * are only linked once...
686 SuffRemove(t->children, s);
689 * Remove the target from the source's parents list
691 SuffRemove(s->parents, t);
692 } else if ((gn->type & OP_TRANSFORM) && DEBUG(SUFF)) {
693 printf("transformation %s complete\n", gn->name);
696 return(dummy ? 0 : 0);
700 *-----------------------------------------------------------------------
701 * SuffRebuildGraph --
702 * Called from Suff_AddSuffix via Lst_ForEach to search through the
703 * list of existing transformation rules and rebuild the transformation
704 * graph when it has been destroyed by Suff_ClearSuffixes. If the
705 * given rule is a transformation involving this suffix and another,
706 * existing suffix, the proper relationship is established between
713 * The appropriate links will be made between this suffix and
714 * others if transformation rules exist for it.
716 *-----------------------------------------------------------------------
719 SuffRebuildGraph(transformp, sp)
720 ClientData transformp; /* Transformation to test */
721 ClientData sp; /* Suffix to rebuild */
723 GNode *transform = (GNode *) transformp;
724 Suff *s = (Suff *) sp;
730 * First see if it is a transformation from this suffix.
732 cp = SuffStrIsPrefix(s->name, transform->name);
733 if (cp != (char *)NULL) {
734 if (cp[0] == '\0') /* null rule */
737 ln = Lst_Find(sufflist, (ClientData)cp, SuffSuffHasNameP);
739 s2 = (Suff *)Lst_Datum(ln);
743 * Found target. Link in and return, since it can't be anything
746 SuffInsert(s2->children, s);
747 SuffInsert(s->parents, s2);
753 * Not from, maybe to?
755 cp = SuffSuffIsSuffix(s, transform->name + strlen(transform->name));
756 if (cp != (char *)NULL) {
758 * Null-terminate the source suffix in order to find it.
761 ln = Lst_Find(sufflist, (ClientData)transform->name, SuffSuffHasNameP);
763 * Replace the start of the target suffix
766 if (ln != NILLNODE) {
768 * Found it -- establish the proper relationship
770 s2 = (Suff *)Lst_Datum(ln);
771 SuffInsert(s->children, s2);
772 SuffInsert(s2->parents, s);
779 *-----------------------------------------------------------------------
781 * Add the suffix in string to the end of the list of known suffixes.
782 * Should we restructure the suffix graph? Make doesn't...
788 * A GNode is created for the suffix and a Suff structure is created and
789 * added to the suffixes list unless the suffix was already known.
790 *-----------------------------------------------------------------------
794 char *str; /* the name of the suffix to add */
796 Suff *s; /* new suffix descriptor */
799 ln = Lst_Find (sufflist, (ClientData)str, SuffSuffHasNameP);
800 if (ln == NILLNODE) {
801 s = (Suff *) emalloc (sizeof (Suff));
803 s->name = estrdup (str);
804 s->nameLen = strlen (s->name);
805 s->searchPath = Lst_Init (FALSE);
806 s->children = Lst_Init (FALSE);
807 s->parents = Lst_Init (FALSE);
808 s->ref = Lst_Init (FALSE);
813 (void)Lst_AtEnd (sufflist, (ClientData)s);
815 * Look for any existing transformations from or to this suffix.
816 * XXX: Only do this after a Suff_ClearSuffixes?
818 Lst_ForEach (transforms, SuffRebuildGraph, (ClientData)s);
823 *-----------------------------------------------------------------------
825 * Return the search path for the given suffix, if it's defined.
828 * The searchPath for the desired suffix or NILLST if the suffix isn't
833 *-----------------------------------------------------------------------
842 ln = Lst_Find (sufflist, (ClientData)sname, SuffSuffHasNameP);
843 if (ln == NILLNODE) {
846 s = (Suff *) Lst_Datum (ln);
847 return (s->searchPath);
852 *-----------------------------------------------------------------------
854 * Extend the search paths for all suffixes to include the default
861 * The searchPath field of all the suffixes is extended by the
862 * directories in dirSearchPath. If paths were specified for the
863 * ".h" suffix, the directories are stuffed into a global variable
864 * called ".INCLUDES" with each directory preceeded by a -I. The same
865 * is done for the ".a" suffix, except the variable is called
866 * ".LIBS" and the flag is -L.
867 *-----------------------------------------------------------------------
875 Lst inIncludes; /* Cumulative .INCLUDES path */
876 Lst inLibs; /* Cumulative .LIBS path */
878 if (Lst_Open (sufflist) == FAILURE) {
882 inIncludes = Lst_Init(FALSE);
883 inLibs = Lst_Init(FALSE);
885 while ((ln = Lst_Next (sufflist)) != NILLNODE) {
886 s = (Suff *) Lst_Datum (ln);
887 if (!Lst_IsEmpty (s->searchPath)) {
889 if (s->flags & SUFF_INCLUDE) {
890 Dir_Concat(inIncludes, s->searchPath);
892 #endif /* INCLUDES */
894 if (s->flags & SUFF_LIBRARY) {
895 Dir_Concat(inLibs, s->searchPath);
897 #endif /* LIBRARIES */
898 Dir_Concat(s->searchPath, dirSearchPath);
900 Lst_Destroy (s->searchPath, Dir_Destroy);
901 s->searchPath = Lst_Duplicate(dirSearchPath, Dir_CopyDir);
905 Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", inIncludes), VAR_GLOBAL);
907 Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", inLibs), VAR_GLOBAL);
910 Lst_Destroy(inIncludes, Dir_Destroy);
911 Lst_Destroy(inLibs, Dir_Destroy);
913 Lst_Close (sufflist);
917 *-----------------------------------------------------------------------
919 * Add the given suffix as a type of file which gets included.
920 * Called from the parse module when a .INCLUDES line is parsed.
921 * The suffix must have already been defined.
927 * The SUFF_INCLUDE bit is set in the suffix's flags field
929 *-----------------------------------------------------------------------
932 Suff_AddInclude (sname)
933 char *sname; /* Name of suffix to mark */
938 ln = Lst_Find (sufflist, (ClientData)sname, SuffSuffHasNameP);
939 if (ln != NILLNODE) {
940 s = (Suff *) Lst_Datum (ln);
941 s->flags |= SUFF_INCLUDE;
946 *-----------------------------------------------------------------------
948 * Add the given suffix as a type of file which is a library.
949 * Called from the parse module when parsing a .LIBS line. The
950 * suffix must have been defined via .SUFFIXES before this is
957 * The SUFF_LIBRARY bit is set in the suffix's flags field
959 *-----------------------------------------------------------------------
963 char *sname; /* Name of suffix to mark */
968 ln = Lst_Find (sufflist, (ClientData)sname, SuffSuffHasNameP);
969 if (ln != NILLNODE) {
970 s = (Suff *) Lst_Datum (ln);
971 s->flags |= SUFF_LIBRARY;
975 /********** Implicit Source Search Functions *********/
978 *-----------------------------------------------------------------------
980 * Add a suffix as a Src structure to the given list with its parent
981 * being the given Src structure. If the suffix is the null suffix,
982 * the prefix is used unaltered as the file name in the Src structure.
988 * A Src structure is created and tacked onto the end of the list
989 *-----------------------------------------------------------------------
993 ClientData sp; /* suffix for which to create a Src structure */
994 ClientData lsp; /* list and parent for the new Src */
996 Suff *s = (Suff *) sp;
997 LstSrc *ls = (LstSrc *) lsp;
998 Src *s2; /* new Src structure */
999 Src *targ; /* Target structure */
1003 if ((s->flags & SUFF_NULL) && (*s->name != '\0')) {
1005 * If the suffix has been marked as the NULL suffix, also create a Src
1006 * structure for a file with no suffix attached. Two birds, and all
1009 s2 = (Src *) emalloc (sizeof (Src));
1010 s2->file = estrdup(targ->pref);
1011 s2->pref = targ->pref;
1013 s2->node = NILGNODE;
1017 targ->children += 1;
1018 (void)Lst_AtEnd (ls->l, (ClientData)s2);
1020 s2->cp = Lst_Init(FALSE);
1021 Lst_AtEnd(targ->cp, (ClientData) s2);
1022 printf("1 add %x %x to %x:", targ, s2, ls->l);
1023 Lst_ForEach(ls->l, PrintAddr, (ClientData) 0);
1027 s2 = (Src *) emalloc (sizeof (Src));
1028 s2->file = str_concat (targ->pref, s->name, 0);
1029 s2->pref = targ->pref;
1031 s2->node = NILGNODE;
1035 targ->children += 1;
1036 (void)Lst_AtEnd (ls->l, (ClientData)s2);
1038 s2->cp = Lst_Init(FALSE);
1039 Lst_AtEnd(targ->cp, (ClientData) s2);
1040 printf("2 add %x %x to %x:", targ, s2, ls->l);
1041 Lst_ForEach(ls->l, PrintAddr, (ClientData) 0);
1049 *-----------------------------------------------------------------------
1051 * Add all the children of targ as Src structures to the given list
1057 * Lots of structures are created and added to the list
1058 *-----------------------------------------------------------------------
1061 SuffAddLevel (l, targ)
1062 Lst l; /* list to which to add the new level */
1063 Src *targ; /* Src structure to use as the parent */
1070 Lst_ForEach (targ->suff->children, SuffAddSrc, (ClientData)&ls);
1074 *----------------------------------------------------------------------
1076 * Free all src structures in list that don't have a reference count
1079 * Ture if an src was removed
1082 * The memory is free'd.
1083 *----------------------------------------------------------------------
1093 if (Lst_Open (l) == FAILURE) {
1097 printf("cleaning %lx: ", (unsigned long) l);
1098 Lst_ForEach(l, PrintAddr, (ClientData) 0);
1103 while ((ln = Lst_Next (l)) != NILLNODE) {
1104 s = (Src *) Lst_Datum (ln);
1105 if (s->children == 0) {
1106 free ((Address)s->file);
1108 free((Address)s->pref);
1111 LstNode ln = Lst_Member(s->parent->cp, (ClientData)s);
1113 Lst_Remove(s->parent->cp, ln);
1115 --s->parent->children;
1118 printf("free: [l=%x] p=%x %d\n", l, s, s->children);
1119 Lst_Destroy(s->cp, NOFREE);
1129 printf("keep: [l=%x] p=%x %d: ", l, s, s->children);
1130 Lst_ForEach(s->cp, PrintAddr, (ClientData) 0);
1142 *-----------------------------------------------------------------------
1144 * Find the first existing file/target in the list srcs
1147 * The lowest structure in the chain of transformations
1151 *-----------------------------------------------------------------------
1154 SuffFindThem (srcs, slst)
1155 Lst srcs; /* list of Src structures to search through */
1158 Src *s; /* current Src */
1159 Src *rs; /* returned Src */
1164 while (!Lst_IsEmpty (srcs)) {
1165 s = (Src *) Lst_DeQueue (srcs);
1168 printf ("\ttrying %s...", s->file);
1172 * A file is considered to exist if either a node exists in the
1173 * graph for it or the file actually exists.
1175 if (Targ_FindNode(s->file, TARG_NOCREATE) != NILGNODE) {
1177 printf("remove %x from %x\n", s, srcs);
1183 if ((ptr = Dir_FindFile (s->file, s->suff->searchPath)) != NULL) {
1186 printf("remove %x from %x\n", s, srcs);
1193 printf ("not there\n");
1196 SuffAddLevel (srcs, s);
1197 Lst_AtEnd(slst, (ClientData) s);
1200 if (DEBUG(SUFF) && rs) {
1201 printf ("got it\n");
1207 *-----------------------------------------------------------------------
1209 * See if any of the children of the target in the Src structure is
1210 * one from which the target can be transformed. If there is one,
1211 * a Src structure is put together for it and returned.
1214 * The Src structure of the "winning" child, or NIL if no such beast.
1217 * A Src structure may be allocated.
1219 *-----------------------------------------------------------------------
1222 SuffFindCmds (targ, slst)
1223 Src *targ; /* Src structure to play with */
1226 LstNode ln; /* General-purpose list node */
1227 register GNode *t, /* Target GNode */
1228 *s; /* Source GNode */
1229 int prefLen;/* The length of the defined prefix */
1230 Suff *suff; /* Suffix on matching beastie */
1231 Src *ret; /* Return value */
1235 (void) Lst_Open (t->children);
1236 prefLen = strlen (targ->pref);
1238 while ((ln = Lst_Next (t->children)) != NILLNODE) {
1239 s = (GNode *)Lst_Datum (ln);
1241 cp = strrchr (s->name, '/');
1242 if (cp == (char *)NULL) {
1247 if (strncmp (cp, targ->pref, prefLen) == 0) {
1249 * The node matches the prefix ok, see if it has a known
1252 ln = Lst_Find (sufflist, (ClientData)&cp[prefLen],
1254 if (ln != NILLNODE) {
1256 * It even has a known suffix, see if there's a transformation
1257 * defined between the node's suffix and the target's suffix.
1259 * XXX: Handle multi-stage transformations here, too.
1261 suff = (Suff *)Lst_Datum (ln);
1263 if (Lst_Member (suff->parents,
1264 (ClientData)targ->suff) != NILLNODE)
1267 * Hot Damn! Create a new Src structure to describe
1268 * this transformation (making sure to duplicate the
1269 * source node's name so Suff_FindDeps can free it
1270 * again (ick)), and return the new structure.
1272 ret = (Src *)emalloc (sizeof (Src));
1273 ret->file = estrdup(s->name);
1274 ret->pref = targ->pref;
1280 targ->children += 1;
1282 ret->cp = Lst_Init(FALSE);
1283 printf("3 add %x %x\n", targ, ret);
1284 Lst_AtEnd(targ->cp, (ClientData) ret);
1286 Lst_AtEnd(slst, (ClientData) ret);
1288 printf ("\tusing existing source %s\n", s->name);
1295 Lst_Close (t->children);
1296 return ((Src *)NULL);
1300 *-----------------------------------------------------------------------
1301 * SuffExpandChildren --
1302 * Expand the names of any children of a given node that contain
1303 * variable invocations or file wildcards into actual targets.
1309 * The expanded node is removed from the parent's list of children,
1310 * and the parent's unmade counter is decremented, but other nodes
1313 *-----------------------------------------------------------------------
1316 SuffExpandChildren(cgnp, pgnp)
1317 ClientData cgnp; /* Child to examine */
1318 ClientData pgnp; /* Parent node being processed */
1320 GNode *cgn = (GNode *) cgnp;
1321 GNode *pgn = (GNode *) pgnp;
1322 GNode *gn; /* New source 8) */
1323 LstNode prevLN; /* Node after which new source should be put */
1324 LstNode ln; /* List element for old source */
1325 char *cp; /* Expanded value */
1328 * New nodes effectively take the place of the child, so place them
1331 prevLN = Lst_Member(pgn->children, (ClientData)cgn);
1334 * First do variable expansion -- this takes precedence over
1335 * wildcard expansion. If the result contains wildcards, they'll be gotten
1336 * to later since the resulting words are tacked on to the end of
1337 * the children list.
1339 if (strchr(cgn->name, '$') != (char *)NULL) {
1341 printf("Expanding \"%s\"...", cgn->name);
1343 cp = Var_Subst(NULL, cgn->name, pgn, TRUE);
1345 if (cp != (char *)NULL) {
1346 Lst members = Lst_Init(FALSE);
1348 if (cgn->type & OP_ARCHV) {
1350 * Node was an archive(member) target, so we want to call
1351 * on the Arch module to find the nodes for us, expanding
1352 * variables in the parent's context.
1354 char *sacrifice = cp;
1356 (void)Arch_ParseArchive(&sacrifice, members, pgn);
1359 * Break the result into a vector of strings whose nodes
1360 * we can find, then add those nodes to the members list.
1361 * Unfortunately, we can't use brk_string b/c it
1362 * doesn't understand about variable specifications with
1366 char *initcp = cp; /* For freeing... */
1368 for (start = cp; *start == ' ' || *start == '\t'; start++)
1370 for (cp = start; *cp != '\0'; cp++) {
1371 if (*cp == ' ' || *cp == '\t') {
1373 * White-space -- terminate element, find the node,
1374 * add it, skip any further spaces.
1377 gn = Targ_FindNode(start, TARG_CREATE);
1378 (void)Lst_AtEnd(members, (ClientData)gn);
1379 while (*cp == ' ' || *cp == '\t') {
1383 * Adjust cp for increment at start of loop, but
1384 * set start to first non-space.
1387 } else if (*cp == '$') {
1389 * Start of a variable spec -- contact variable module
1390 * to find the end so we can skip over it.
1396 junk = Var_Parse(cp, pgn, TRUE, &len, &doFree);
1397 if (junk != var_Error) {
1404 } else if (*cp == '\\' && *cp != '\0') {
1406 * Escaped something -- skip over it
1414 * Stuff left over -- add it to the list too
1416 gn = Targ_FindNode(start, TARG_CREATE);
1417 (void)Lst_AtEnd(members, (ClientData)gn);
1420 * Point cp back at the beginning again so the variable value
1426 * Add all elements of the members list to the parent node.
1428 while(!Lst_IsEmpty(members)) {
1429 gn = (GNode *)Lst_DeQueue(members);
1432 printf("%s...", gn->name);
1434 if (Lst_Member(pgn->children, (ClientData)gn) == NILLNODE) {
1435 (void)Lst_Append(pgn->children, prevLN, (ClientData)gn);
1436 prevLN = Lst_Succ(prevLN);
1437 (void)Lst_AtEnd(gn->parents, (ClientData)pgn);
1441 Lst_Destroy(members, NOFREE);
1448 * Now the source is expanded, remove it from the list of children to
1449 * keep it from being processed.
1451 ln = Lst_Member(pgn->children, (ClientData)cgn);
1453 Lst_Remove(pgn->children, ln);
1457 } else if (Dir_HasWildcards(cgn->name)) {
1458 Lst exp; /* List of expansions */
1459 Lst path; /* Search path along which to expand */
1462 * Find a path along which to expand the word.
1464 * If the word has a known suffix, use that path.
1465 * If it has no known suffix and we're allowed to use the null
1466 * suffix, use its path.
1467 * Else use the default system search path.
1469 cp = cgn->name + strlen(cgn->name);
1470 ln = Lst_Find(sufflist, (ClientData)cp, SuffSuffIsSuffixP);
1473 printf("Wildcard expanding \"%s\"...", cgn->name);
1476 if (ln != NILLNODE) {
1477 Suff *s = (Suff *)Lst_Datum(ln);
1480 printf("suffix is \"%s\"...", s->name);
1482 path = s->searchPath;
1485 * Use default search path
1487 path = dirSearchPath;
1491 * Expand the word along the chosen path
1493 exp = Lst_Init(FALSE);
1494 Dir_Expand(cgn->name, path, exp);
1496 while (!Lst_IsEmpty(exp)) {
1498 * Fetch next expansion off the list and find its GNode
1500 cp = (char *)Lst_DeQueue(exp);
1503 printf("%s...", cp);
1505 gn = Targ_FindNode(cp, TARG_CREATE);
1508 * If gn isn't already a child of the parent, make it so and
1509 * up the parent's count of unmade children.
1511 if (Lst_Member(pgn->children, (ClientData)gn) == NILLNODE) {
1512 (void)Lst_Append(pgn->children, prevLN, (ClientData)gn);
1513 prevLN = Lst_Succ(prevLN);
1514 (void)Lst_AtEnd(gn->parents, (ClientData)pgn);
1520 * Nuke what's left of the list
1522 Lst_Destroy(exp, NOFREE);
1525 * Now the source is expanded, remove it from the list of children to
1526 * keep it from being processed.
1528 ln = Lst_Member(pgn->children, (ClientData)cgn);
1530 Lst_Remove(pgn->children, ln);
1540 *-----------------------------------------------------------------------
1541 * SuffApplyTransform --
1542 * Apply a transformation rule, given the source and target nodes
1546 * TRUE if successful, FALSE if not.
1549 * The source and target are linked and the commands from the
1550 * transformation are added to the target node's commands list.
1551 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1552 * to the target. The target also inherits all the sources for
1553 * the transformation rule.
1555 *-----------------------------------------------------------------------
1558 SuffApplyTransform(tGn, sGn, t, s)
1559 GNode *tGn; /* Target node */
1560 GNode *sGn; /* Source node */
1561 Suff *t; /* Target suffix */
1562 Suff *s; /* Source suffix */
1564 LstNode ln; /* General node */
1565 char *tname; /* Name of transformation rule */
1566 GNode *gn; /* Node for same */
1568 if (Lst_Member(tGn->children, (ClientData)sGn) == NILLNODE) {
1570 * Not already linked, so form the proper links between the
1571 * target and source.
1573 (void)Lst_AtEnd(tGn->children, (ClientData)sGn);
1574 (void)Lst_AtEnd(sGn->parents, (ClientData)tGn);
1578 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1580 * When a :: node is used as the implied source of a node, we have
1581 * to link all its cohorts in as sources as well. Only the initial
1582 * sGn gets the target in its iParents list, however, as that
1583 * will be sufficient to get the .IMPSRC variable set for tGn
1585 for (ln=Lst_First(sGn->cohorts); ln != NILLNODE; ln=Lst_Succ(ln)) {
1586 gn = (GNode *)Lst_Datum(ln);
1588 if (Lst_Member(tGn->children, (ClientData)gn) == NILLNODE) {
1590 * Not already linked, so form the proper links between the
1591 * target and source.
1593 (void)Lst_AtEnd(tGn->children, (ClientData)gn);
1594 (void)Lst_AtEnd(gn->parents, (ClientData)tGn);
1600 * Locate the transformation rule itself
1602 tname = str_concat(s->name, t->name, 0);
1603 ln = Lst_Find(transforms, (ClientData)tname, SuffGNHasNameP);
1606 if (ln == NILLNODE) {
1608 * Not really such a transformation rule (can happen when we're
1609 * called to link an OP_MEMBER and OP_ARCHV node), so return
1615 gn = (GNode *)Lst_Datum(ln);
1618 printf("\tapplying %s -> %s to \"%s\"\n", s->name, t->name, tGn->name);
1622 * Record last child for expansion purposes
1624 ln = Lst_Last(tGn->children);
1627 * Pass the buck to Make_HandleUse to apply the rule
1629 (void)Make_HandleUse(gn, tGn);
1632 * Deal with wildcards and variables in any acquired sources
1635 if (ln != NILLNODE) {
1636 Lst_ForEachFrom(tGn->children, ln,
1637 SuffExpandChildren, (ClientData)tGn);
1641 * Keep track of another parent to which this beast is transformed so
1642 * the .IMPSRC variable can be set correctly for the parent.
1644 (void)Lst_AtEnd(sGn->iParents, (ClientData)tGn);
1651 *-----------------------------------------------------------------------
1652 * SuffFindArchiveDeps --
1653 * Locate dependencies for an OP_ARCHV node.
1659 * Same as Suff_FindDeps
1661 *-----------------------------------------------------------------------
1664 SuffFindArchiveDeps(gn, slst)
1665 GNode *gn; /* Node for which to locate dependencies */
1668 char *eoarch; /* End of archive portion */
1669 char *eoname; /* End of member portion */
1670 GNode *mem; /* Node for member */
1671 static char *copy[] = { /* Variables to be copied from the member node */
1672 TARGET, /* Must be first */
1673 PREFIX, /* Must be second */
1675 int i; /* Index into copy and vals */
1676 Suff *ms; /* Suffix descriptor for member */
1677 char *name; /* Start of member's name */
1680 * The node is an archive(member) pair. so we must find a
1681 * suffix for both of them.
1683 eoarch = strchr (gn->name, '(');
1684 eoname = strchr (eoarch, ')');
1686 *eoname = '\0'; /* Nuke parentheses during suffix search */
1687 *eoarch = '\0'; /* So a suffix can be found */
1692 * To simplify things, call Suff_FindDeps recursively on the member now,
1693 * so we can simply compare the member's .PREFIX and .TARGET variables
1694 * to locate its suffix. This allows us to figure out the suffix to
1695 * use for the archive without having to do a quadratic search over the
1696 * suffix list, backtracking for each one...
1698 mem = Targ_FindNode(name, TARG_CREATE);
1699 SuffFindDeps(mem, slst);
1702 * Create the link between the two nodes right off
1704 if (Lst_Member(gn->children, (ClientData)mem) == NILLNODE) {
1705 (void)Lst_AtEnd(gn->children, (ClientData)mem);
1706 (void)Lst_AtEnd(mem->parents, (ClientData)gn);
1711 * Copy in the variables from the member node to this one.
1713 for (i = (sizeof(copy)/sizeof(copy[0]))-1; i >= 0; i--) {
1715 Var_Set(copy[i], Var_Value(copy[i], mem, &p1), gn);
1723 * Didn't know what it was -- use .NULL suffix if not in make mode
1726 printf("using null suffix\n");
1733 * Set the other two local variables required for this target.
1735 Var_Set (MEMBER, name, gn);
1736 Var_Set (ARCHIVE, gn->name, gn);
1740 * Member has a known suffix, so look for a transformation rule from
1741 * it to a possible suffix of the archive. Rather than searching
1742 * through the entire list, we just look at suffixes to which the
1743 * member's suffix may be transformed...
1748 * Use first matching suffix...
1750 ln = Lst_Find(ms->parents, eoarch, SuffSuffIsSuffixP);
1752 if (ln != NILLNODE) {
1754 * Got one -- apply it
1756 if (!SuffApplyTransform(gn, mem, (Suff *)Lst_Datum(ln), ms) &&
1759 printf("\tNo transformation from %s -> %s\n",
1760 ms->name, ((Suff *)Lst_Datum(ln))->name);
1766 * Replace the opening and closing parens now we've no need of the separate
1769 *eoarch = '('; *eoname = ')';
1772 * Pretend gn appeared to the left of a dependency operator so
1773 * the user needn't provide a transformation from the member to the
1776 if (OP_NOP(gn->type)) {
1777 gn->type |= OP_DEPENDS;
1781 * Flag the member as such so we remember to look in the archive for
1782 * its modification time.
1784 mem->type |= OP_MEMBER;
1788 *-----------------------------------------------------------------------
1789 * SuffFindNormalDeps --
1790 * Locate implicit dependencies for regular targets.
1796 * Same as Suff_FindDeps...
1798 *-----------------------------------------------------------------------
1801 SuffFindNormalDeps(gn, slst)
1802 GNode *gn; /* Node for which to find sources */
1805 char *eoname; /* End of name */
1806 char *sopref; /* Start of prefix */
1807 LstNode ln; /* Next suffix node to check */
1808 Lst srcs; /* List of sources at which to look */
1809 Lst targs; /* List of targets to which things can be
1810 * transformed. They all have the same file,
1811 * but different suff and pref fields */
1812 Src *bottom; /* Start of found transformation path */
1813 Src *src; /* General Src pointer */
1814 char *pref; /* Prefix to use */
1815 Src *targ; /* General Src target pointer */
1818 eoname = gn->name + strlen(gn->name);
1823 * Begin at the beginning...
1825 ln = Lst_First(sufflist);
1826 srcs = Lst_Init(FALSE);
1827 targs = Lst_Init(FALSE);
1830 * We're caught in a catch-22 here. On the one hand, we want to use any
1831 * transformation implied by the target's sources, but we can't examine
1832 * the sources until we've expanded any variables/wildcards they may hold,
1833 * and we can't do that until we've set up the target's local variables
1834 * and we can't do that until we know what the proper suffix for the
1835 * target is (in case there are two suffixes one of which is a suffix of
1836 * the other) and we can't know that until we've found its implied
1837 * source, which we may not want to use if there's an existing source
1838 * that implies a different transformation.
1840 * In an attempt to get around this, which may not work all the time,
1841 * but should work most of the time, we look for implied sources first,
1842 * checking transformations to all possible suffixes of the target,
1843 * use what we find to set the target's local variables, expand the
1844 * children, then look for any overriding transformations they imply.
1845 * Should we find one, we discard the one we found before.
1848 while (ln != NILLNODE) {
1850 * Look for next possible suffix...
1852 ln = Lst_FindFrom(sufflist, ln, eoname, SuffSuffIsSuffixP);
1854 if (ln != NILLNODE) {
1855 int prefLen; /* Length of the prefix */
1859 * Allocate a Src structure to which things can be transformed
1861 targ = (Src *)emalloc(sizeof (Src));
1862 targ->file = estrdup(gn->name);
1863 targ->suff = (Suff *)Lst_Datum(ln);
1864 targ->suff->refCount++;
1866 targ->parent = (Src *)NULL;
1869 targ->cp = Lst_Init(FALSE);
1873 * Allocate room for the prefix, whose end is found by subtracting
1874 * the length of the suffix from the end of the name.
1876 prefLen = (eoname - targ->suff->nameLen) - sopref;
1877 targ->pref = emalloc(prefLen + 1);
1878 memcpy(targ->pref, sopref, prefLen);
1879 targ->pref[prefLen] = '\0';
1882 * Add nodes from which the target can be made
1884 SuffAddLevel(srcs, targ);
1887 * Record the target so we can nuke it
1889 (void)Lst_AtEnd(targs, (ClientData)targ);
1892 * Search from this suffix's successor...
1899 * Handle target of unknown suffix...
1901 if (Lst_IsEmpty(targs) && suffNull != NULL) {
1903 printf("\tNo known suffix on %s. Using .NULL suffix\n", gn->name);
1906 targ = (Src *)emalloc(sizeof (Src));
1907 targ->file = estrdup(gn->name);
1908 targ->suff = suffNull;
1909 targ->suff->refCount++;
1911 targ->parent = (Src *)NULL;
1913 targ->pref = estrdup(sopref);
1915 targ->cp = Lst_Init(FALSE);
1919 * Only use the default suffix rules if we don't have commands
1920 * or dependencies defined for this gnode
1922 if (Lst_IsEmpty(gn->commands) && Lst_IsEmpty(gn->children))
1923 SuffAddLevel(srcs, targ);
1930 printf("adding suffix rules\n");
1932 (void)Lst_AtEnd(targs, (ClientData)targ);
1936 * Using the list of possible sources built up from the target suffix(es),
1937 * try and find an existing file/target that matches.
1939 bottom = SuffFindThem(srcs, slst);
1941 if (bottom == (Src *)NULL) {
1943 * No known transformations -- use the first suffix found for setting
1944 * the local variables.
1946 if (!Lst_IsEmpty(targs)) {
1947 targ = (Src *)Lst_Datum(Lst_First(targs));
1953 * Work up the transformation path to find the suffix of the
1954 * target to which the transformation was made.
1956 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1961 * The .TARGET variable we always set to be the name at this point,
1962 * since it's only set to the path if the thing is only a source and
1963 * if it's only a source, it doesn't matter what we put here as far
1964 * as expanding sources is concerned, since it has none...
1966 Var_Set(TARGET, gn->name, gn);
1968 pref = (targ != NULL) ? targ->pref : gn->name;
1969 Var_Set(PREFIX, pref, gn);
1972 * Now we've got the important local variables set, expand any sources
1973 * that still contain variables or wildcards in their names.
1975 Lst_ForEach(gn->children, SuffExpandChildren, (ClientData)gn);
1979 printf("\tNo valid suffix on %s\n", gn->name);
1984 * Deal with finding the thing on the default search path if the
1985 * node is only a source (not on the lhs of a dependency operator
1986 * or [XXX] it has neither children or commands).
1988 if (OP_NOP(gn->type) ||
1989 (Lst_IsEmpty(gn->children) && Lst_IsEmpty(gn->commands)))
1991 gn->path = Dir_FindFile(gn->name,
1992 (targ == NULL ? dirSearchPath :
1993 targ->suff->searchPath));
1994 if (gn->path != NULL) {
1996 Var_Set(TARGET, gn->path, gn);
2000 * Suffix known for the thing -- trim the suffix off
2001 * the path to form the proper .PREFIX variable.
2003 int savep = strlen(gn->path) - targ->suff->nameLen;
2007 gn->suffix->refCount--;
2008 gn->suffix = targ->suff;
2009 gn->suffix->refCount++;
2011 savec = gn->path[savep];
2012 gn->path[savep] = '\0';
2014 if ((ptr = strrchr(gn->path, '/')) != NULL)
2019 Var_Set(PREFIX, ptr, gn);
2021 gn->path[savep] = savec;
2024 * The .PREFIX gets the full path if the target has
2028 gn->suffix->refCount--;
2031 if ((ptr = strrchr(gn->path, '/')) != NULL)
2036 Var_Set(PREFIX, ptr, gn);
2041 * Not appropriate to search for the thing -- set the
2042 * path to be the name so Dir_MTime won't go grovelling for
2046 gn->suffix->refCount--;
2047 gn->suffix = (targ == NULL) ? NULL : targ->suff;
2049 gn->suffix->refCount++;
2051 gn->path = estrdup(gn->name);
2058 * If the suffix indicates that the target is a library, mark that in
2059 * the node's type field.
2061 if (targ->suff->flags & SUFF_LIBRARY) {
2066 * Check for overriding transformation rule implied by sources
2068 if (!Lst_IsEmpty(gn->children)) {
2069 src = SuffFindCmds(targ, slst);
2071 if (src != (Src *)NULL) {
2073 * Free up all the Src structures in the transformation path
2074 * up to, but not including, the parent node.
2076 while (bottom && bottom->parent != NULL) {
2077 if (Lst_Member(slst, (ClientData) bottom) == NILLNODE) {
2078 Lst_AtEnd(slst, (ClientData) bottom);
2080 bottom = bottom->parent;
2086 if (bottom == NULL) {
2088 * No idea from where it can come -- return now.
2094 * We now have a list of Src structures headed by 'bottom' and linked via
2095 * their 'parent' pointers. What we do next is create links between
2096 * source and target nodes (which may or may not have been created)
2097 * and set the necessary local variables in each target. The
2098 * commands for each target are set from the commands of the
2099 * transformation rule used to get from the src suffix to the targ
2100 * suffix. Note that this causes the commands list of the original
2101 * node, gn, to be replaced by the commands of the final
2102 * transformation rule. Also, the unmade field of gn is incremented.
2105 if (bottom->node == NILGNODE) {
2106 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
2109 for (src = bottom; src->parent != (Src *)NULL; src = src->parent) {
2112 if (src->node->suffix)
2113 src->node->suffix->refCount--;
2114 src->node->suffix = src->suff;
2115 src->node->suffix->refCount++;
2117 if (targ->node == NILGNODE) {
2118 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
2121 SuffApplyTransform(targ->node, src->node,
2122 targ->suff, src->suff);
2124 if (targ->node != gn) {
2126 * Finish off the dependency-search process for any nodes
2127 * between bottom and gn (no point in questing around the
2128 * filesystem for their implicit source when it's already
2129 * known). Note that the node can't have any sources that
2130 * need expanding, since SuffFindThem will stop on an existing
2131 * node, so all we need to do is set the standard and System V
2134 targ->node->type |= OP_DEPS_FOUND;
2136 Var_Set(PREFIX, targ->pref, targ->node);
2138 Var_Set(TARGET, targ->node->name, targ->node);
2143 gn->suffix->refCount--;
2144 gn->suffix = src->suff;
2145 gn->suffix->refCount++;
2148 * So Dir_MTime doesn't go questing for it...
2151 gn->path = estrdup(gn->name);
2154 * Nuke the transformation path and the Src structures left over in the
2159 if (Lst_Member(slst, (ClientData) bottom) == NILLNODE)
2160 Lst_AtEnd(slst, (ClientData) bottom);
2162 while (SuffRemoveSrc(srcs) || SuffRemoveSrc(targs))
2165 Lst_Concat(slst, srcs, LST_CONCLINK);
2166 Lst_Concat(slst, targs, LST_CONCLINK);
2171 *-----------------------------------------------------------------------
2173 * Find implicit sources for the target described by the graph node
2180 * Nodes are added to the graph below the passed-in node. The nodes
2181 * are marked to have their IMPSRC variable filled in. The
2182 * PREFIX variable is set for the given node and all its
2186 * The path found by this target is the shortest path in the
2187 * transformation graph, which may pass through non-existent targets,
2188 * to an existing target. The search continues on all paths from the
2189 * root suffix until a file is found. I.e. if there's a path
2190 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2191 * the .c and .l files don't, the search will branch out in
2192 * all directions from .o and again from all the nodes on the
2193 * next level until the .l,v node is encountered.
2195 *-----------------------------------------------------------------------
2203 SuffFindDeps(gn, srclist);
2204 while (SuffRemoveSrc(srclist))
2210 SuffFindDeps (gn, slst)
2211 GNode *gn; /* node we're dealing with */
2214 if (gn->type & OP_DEPS_FOUND) {
2216 * If dependencies already found, no need to do it again...
2220 gn->type |= OP_DEPS_FOUND;
2224 printf ("SuffFindDeps (%s)\n", gn->name);
2227 if (gn->type & OP_ARCHV) {
2228 SuffFindArchiveDeps(gn, slst);
2229 } else if (gn->type & OP_LIB) {
2231 * If the node is a library, it is the arch module's job to find it
2232 * and set the TARGET variable accordingly. We merely provide the
2233 * search path, assuming all libraries end in ".a" (if the suffix
2234 * hasn't been defined, there's nothing we can do for it, so we just
2235 * set the TARGET variable to the node's name in order to give it a
2241 ln = Lst_Find (sufflist, (ClientData)LIBSUFF, SuffSuffHasNameP);
2243 gn->suffix->refCount--;
2244 if (ln != NILLNODE) {
2245 gn->suffix = s = (Suff *) Lst_Datum (ln);
2246 gn->suffix->refCount++;
2247 Arch_FindLib (gn, s->searchPath);
2250 Var_Set (TARGET, gn->name, gn);
2253 * Because a library (-lfoo) target doesn't follow the standard
2254 * filesystem conventions, we don't set the regular variables for
2255 * the thing. .PREFIX is simply made empty...
2257 Var_Set(PREFIX, "", gn);
2259 SuffFindNormalDeps(gn, slst);
2264 *-----------------------------------------------------------------------
2266 * Define which suffix is the null suffix.
2272 * 'suffNull' is altered.
2275 * Need to handle the changing of the null suffix gracefully so the
2276 * old transformation rules don't just go away.
2278 *-----------------------------------------------------------------------
2282 char *name; /* Name of null suffix */
2287 ln = Lst_Find(sufflist, (ClientData)name, SuffSuffHasNameP);
2288 if (ln != NILLNODE) {
2289 s = (Suff *)Lst_Datum(ln);
2290 if (suffNull != (Suff *)NULL) {
2291 suffNull->flags &= ~SUFF_NULL;
2293 s->flags |= SUFF_NULL;
2295 * XXX: Here's where the transformation mangling would take place
2299 Parse_Error (PARSE_WARNING, "Desired null suffix %s not defined.",
2305 *-----------------------------------------------------------------------
2307 * Initialize suffixes module
2314 *-----------------------------------------------------------------------
2319 sufflist = Lst_Init (FALSE);
2320 suffClean = Lst_Init(FALSE);
2321 srclist = Lst_Init (FALSE);
2322 transforms = Lst_Init (FALSE);
2326 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2327 * actually go on the suffix list or everyone will think that's its
2330 emptySuff = suffNull = (Suff *) emalloc (sizeof (Suff));
2332 suffNull->name = estrdup ("");
2333 suffNull->nameLen = 0;
2334 suffNull->searchPath = Lst_Init (FALSE);
2335 Dir_Concat(suffNull->searchPath, dirSearchPath);
2336 suffNull->children = Lst_Init (FALSE);
2337 suffNull->parents = Lst_Init (FALSE);
2338 suffNull->ref = Lst_Init (FALSE);
2339 suffNull->sNum = sNum++;
2340 suffNull->flags = SUFF_NULL;
2341 suffNull->refCount = 1;
2347 *----------------------------------------------------------------------
2349 * Cleanup the this module
2355 * The memory is free'd.
2356 *----------------------------------------------------------------------
2362 Lst_Destroy(sufflist, SuffFree);
2363 Lst_Destroy(suffClean, SuffFree);
2366 Lst_Destroy(srclist, NOFREE);
2367 Lst_Destroy(transforms, NOFREE);
2371 /********************* DEBUGGING FUNCTIONS **********************/
2373 static int SuffPrintName(s, dummy)
2377 printf ("`%s' ", ((Suff *) s)->name);
2378 return (dummy ? 0 : 0);
2382 SuffPrintSuff (sp, dummy)
2386 Suff *s = (Suff *) sp;
2390 printf ("# `%s' [%d] ", s->name, s->refCount);
2394 fputs (" (", stdout);
2396 flag = 1 << (ffs(flags) - 1);
2409 fputc(flags ? '|' : ')', stdout);
2412 fputc ('\n', stdout);
2414 Lst_ForEach (s->parents, SuffPrintName, (ClientData)0);
2415 fputc ('\n', stdout);
2416 printf ("#\tFrom: ");
2417 Lst_ForEach (s->children, SuffPrintName, (ClientData)0);
2418 fputc ('\n', stdout);
2419 printf ("#\tSearch Path: ");
2420 Dir_PrintPath (s->searchPath);
2421 fputc ('\n', stdout);
2422 return (dummy ? 0 : 0);
2426 SuffPrintTrans (tp, dummy)
2430 GNode *t = (GNode *) tp;
2432 printf ("%-16s: ", t->name);
2433 Targ_PrintType (t->type);
2434 fputc ('\n', stdout);
2435 Lst_ForEach (t->commands, Targ_PrintCmd, (ClientData)0);
2436 fputc ('\n', stdout);
2437 return(dummy ? 0 : 0);
2443 printf ("#*** Suffixes:\n");
2444 Lst_ForEach (sufflist, SuffPrintSuff, (ClientData)0);
2446 printf ("#*** Transformations:\n");
2447 Lst_ForEach (transforms, SuffPrintTrans, (ClientData)0);