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.3 2003/11/03 19:31:30 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))
666 (void)SuffParseTransform(gn->name, &s, &t);
669 printf("deleting transformation from `%s' to `%s'\n",
674 * Remove the source from the target's children list. We check for a
675 * nil return to handle a beanhead saying something like
678 * We'll be called twice when the next target is seen, but .c and .o
679 * are only linked once...
681 SuffRemove(t->children, s);
684 * Remove the target from the source's parents list
686 SuffRemove(s->parents, t);
687 } else if ((gn->type & OP_TRANSFORM) && DEBUG(SUFF)) {
688 printf("transformation %s complete\n", gn->name);
691 return(dummy ? 0 : 0);
695 *-----------------------------------------------------------------------
696 * SuffRebuildGraph --
697 * Called from Suff_AddSuffix via Lst_ForEach to search through the
698 * list of existing transformation rules and rebuild the transformation
699 * graph when it has been destroyed by Suff_ClearSuffixes. If the
700 * given rule is a transformation involving this suffix and another,
701 * existing suffix, the proper relationship is established between
708 * The appropriate links will be made between this suffix and
709 * others if transformation rules exist for it.
711 *-----------------------------------------------------------------------
714 SuffRebuildGraph(transformp, sp)
715 ClientData transformp; /* Transformation to test */
716 ClientData sp; /* Suffix to rebuild */
718 GNode *transform = (GNode *) transformp;
719 Suff *s = (Suff *) sp;
725 * First see if it is a transformation from this suffix.
727 cp = SuffStrIsPrefix(s->name, transform->name);
728 if (cp != (char *)NULL) {
729 if (cp[0] == '\0') /* null rule */
732 ln = Lst_Find(sufflist, (ClientData)cp, SuffSuffHasNameP);
734 s2 = (Suff *)Lst_Datum(ln);
738 * Found target. Link in and return, since it can't be anything
741 SuffInsert(s2->children, s);
742 SuffInsert(s->parents, s2);
748 * Not from, maybe to?
750 cp = SuffSuffIsSuffix(s, transform->name + strlen(transform->name));
751 if (cp != (char *)NULL) {
753 * Null-terminate the source suffix in order to find it.
756 ln = Lst_Find(sufflist, (ClientData)transform->name, SuffSuffHasNameP);
758 * Replace the start of the target suffix
761 if (ln != NILLNODE) {
763 * Found it -- establish the proper relationship
765 s2 = (Suff *)Lst_Datum(ln);
766 SuffInsert(s->children, s2);
767 SuffInsert(s2->parents, s);
774 *-----------------------------------------------------------------------
776 * Add the suffix in string to the end of the list of known suffixes.
777 * Should we restructure the suffix graph? Make doesn't...
783 * A GNode is created for the suffix and a Suff structure is created and
784 * added to the suffixes list unless the suffix was already known.
785 *-----------------------------------------------------------------------
789 char *str; /* the name of the suffix to add */
791 Suff *s; /* new suffix descriptor */
794 ln = Lst_Find (sufflist, (ClientData)str, SuffSuffHasNameP);
795 if (ln == NILLNODE) {
796 s = (Suff *) emalloc (sizeof (Suff));
798 s->name = estrdup (str);
799 s->nameLen = strlen (s->name);
800 s->searchPath = Lst_Init (FALSE);
801 s->children = Lst_Init (FALSE);
802 s->parents = Lst_Init (FALSE);
803 s->ref = Lst_Init (FALSE);
808 (void)Lst_AtEnd (sufflist, (ClientData)s);
810 * Look for any existing transformations from or to this suffix.
811 * XXX: Only do this after a Suff_ClearSuffixes?
813 Lst_ForEach (transforms, SuffRebuildGraph, (ClientData)s);
818 *-----------------------------------------------------------------------
820 * Return the search path for the given suffix, if it's defined.
823 * The searchPath for the desired suffix or NILLST if the suffix isn't
828 *-----------------------------------------------------------------------
837 ln = Lst_Find (sufflist, (ClientData)sname, SuffSuffHasNameP);
838 if (ln == NILLNODE) {
841 s = (Suff *) Lst_Datum (ln);
842 return (s->searchPath);
847 *-----------------------------------------------------------------------
849 * Extend the search paths for all suffixes to include the default
856 * The searchPath field of all the suffixes is extended by the
857 * directories in dirSearchPath. If paths were specified for the
858 * ".h" suffix, the directories are stuffed into a global variable
859 * called ".INCLUDES" with each directory preceeded by a -I. The same
860 * is done for the ".a" suffix, except the variable is called
861 * ".LIBS" and the flag is -L.
862 *-----------------------------------------------------------------------
870 Lst inIncludes; /* Cumulative .INCLUDES path */
871 Lst inLibs; /* Cumulative .LIBS path */
873 if (Lst_Open (sufflist) == FAILURE) {
877 inIncludes = Lst_Init(FALSE);
878 inLibs = Lst_Init(FALSE);
880 while ((ln = Lst_Next (sufflist)) != NILLNODE) {
881 s = (Suff *) Lst_Datum (ln);
882 if (!Lst_IsEmpty (s->searchPath)) {
884 if (s->flags & SUFF_INCLUDE) {
885 Dir_Concat(inIncludes, s->searchPath);
887 #endif /* INCLUDES */
889 if (s->flags & SUFF_LIBRARY) {
890 Dir_Concat(inLibs, s->searchPath);
892 #endif /* LIBRARIES */
893 Dir_Concat(s->searchPath, dirSearchPath);
895 Lst_Destroy (s->searchPath, Dir_Destroy);
896 s->searchPath = Lst_Duplicate(dirSearchPath, Dir_CopyDir);
900 Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", inIncludes), VAR_GLOBAL);
902 Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", inLibs), VAR_GLOBAL);
905 Lst_Destroy(inIncludes, Dir_Destroy);
906 Lst_Destroy(inLibs, Dir_Destroy);
908 Lst_Close (sufflist);
912 *-----------------------------------------------------------------------
914 * Add the given suffix as a type of file which gets included.
915 * Called from the parse module when a .INCLUDES line is parsed.
916 * The suffix must have already been defined.
922 * The SUFF_INCLUDE bit is set in the suffix's flags field
924 *-----------------------------------------------------------------------
927 Suff_AddInclude (sname)
928 char *sname; /* Name of suffix to mark */
933 ln = Lst_Find (sufflist, (ClientData)sname, SuffSuffHasNameP);
934 if (ln != NILLNODE) {
935 s = (Suff *) Lst_Datum (ln);
936 s->flags |= SUFF_INCLUDE;
941 *-----------------------------------------------------------------------
943 * Add the given suffix as a type of file which is a library.
944 * Called from the parse module when parsing a .LIBS line. The
945 * suffix must have been defined via .SUFFIXES before this is
952 * The SUFF_LIBRARY bit is set in the suffix's flags field
954 *-----------------------------------------------------------------------
958 char *sname; /* Name of suffix to mark */
963 ln = Lst_Find (sufflist, (ClientData)sname, SuffSuffHasNameP);
964 if (ln != NILLNODE) {
965 s = (Suff *) Lst_Datum (ln);
966 s->flags |= SUFF_LIBRARY;
970 /********** Implicit Source Search Functions *********/
973 *-----------------------------------------------------------------------
975 * Add a suffix as a Src structure to the given list with its parent
976 * being the given Src structure. If the suffix is the null suffix,
977 * the prefix is used unaltered as the file name in the Src structure.
983 * A Src structure is created and tacked onto the end of the list
984 *-----------------------------------------------------------------------
988 ClientData sp; /* suffix for which to create a Src structure */
989 ClientData lsp; /* list and parent for the new Src */
991 Suff *s = (Suff *) sp;
992 LstSrc *ls = (LstSrc *) lsp;
993 Src *s2; /* new Src structure */
994 Src *targ; /* Target structure */
998 if ((s->flags & SUFF_NULL) && (*s->name != '\0')) {
1000 * If the suffix has been marked as the NULL suffix, also create a Src
1001 * structure for a file with no suffix attached. Two birds, and all
1004 s2 = (Src *) emalloc (sizeof (Src));
1005 s2->file = estrdup(targ->pref);
1006 s2->pref = targ->pref;
1008 s2->node = NILGNODE;
1012 targ->children += 1;
1013 (void)Lst_AtEnd (ls->l, (ClientData)s2);
1015 s2->cp = Lst_Init(FALSE);
1016 Lst_AtEnd(targ->cp, (ClientData) s2);
1017 printf("1 add %x %x to %x:", targ, s2, ls->l);
1018 Lst_ForEach(ls->l, PrintAddr, (ClientData) 0);
1022 s2 = (Src *) emalloc (sizeof (Src));
1023 s2->file = str_concat (targ->pref, s->name, 0);
1024 s2->pref = targ->pref;
1026 s2->node = NILGNODE;
1030 targ->children += 1;
1031 (void)Lst_AtEnd (ls->l, (ClientData)s2);
1033 s2->cp = Lst_Init(FALSE);
1034 Lst_AtEnd(targ->cp, (ClientData) s2);
1035 printf("2 add %x %x to %x:", targ, s2, ls->l);
1036 Lst_ForEach(ls->l, PrintAddr, (ClientData) 0);
1044 *-----------------------------------------------------------------------
1046 * Add all the children of targ as Src structures to the given list
1052 * Lots of structures are created and added to the list
1053 *-----------------------------------------------------------------------
1056 SuffAddLevel (l, targ)
1057 Lst l; /* list to which to add the new level */
1058 Src *targ; /* Src structure to use as the parent */
1065 Lst_ForEach (targ->suff->children, SuffAddSrc, (ClientData)&ls);
1069 *----------------------------------------------------------------------
1071 * Free all src structures in list that don't have a reference count
1074 * Ture if an src was removed
1077 * The memory is free'd.
1078 *----------------------------------------------------------------------
1088 if (Lst_Open (l) == FAILURE) {
1092 printf("cleaning %lx: ", (unsigned long) l);
1093 Lst_ForEach(l, PrintAddr, (ClientData) 0);
1098 while ((ln = Lst_Next (l)) != NILLNODE) {
1099 s = (Src *) Lst_Datum (ln);
1100 if (s->children == 0) {
1101 free ((Address)s->file);
1103 free((Address)s->pref);
1106 LstNode ln = Lst_Member(s->parent->cp, (ClientData)s);
1108 Lst_Remove(s->parent->cp, ln);
1110 --s->parent->children;
1113 printf("free: [l=%x] p=%x %d\n", l, s, s->children);
1114 Lst_Destroy(s->cp, NOFREE);
1124 printf("keep: [l=%x] p=%x %d: ", l, s, s->children);
1125 Lst_ForEach(s->cp, PrintAddr, (ClientData) 0);
1137 *-----------------------------------------------------------------------
1139 * Find the first existing file/target in the list srcs
1142 * The lowest structure in the chain of transformations
1146 *-----------------------------------------------------------------------
1149 SuffFindThem (srcs, slst)
1150 Lst srcs; /* list of Src structures to search through */
1153 Src *s; /* current Src */
1154 Src *rs; /* returned Src */
1159 while (!Lst_IsEmpty (srcs)) {
1160 s = (Src *) Lst_DeQueue (srcs);
1163 printf ("\ttrying %s...", s->file);
1167 * A file is considered to exist if either a node exists in the
1168 * graph for it or the file actually exists.
1170 if (Targ_FindNode(s->file, TARG_NOCREATE) != NILGNODE) {
1172 printf("remove %x from %x\n", s, srcs);
1178 if ((ptr = Dir_FindFile (s->file, s->suff->searchPath)) != NULL) {
1181 printf("remove %x from %x\n", s, srcs);
1188 printf ("not there\n");
1191 SuffAddLevel (srcs, s);
1192 Lst_AtEnd(slst, (ClientData) s);
1195 if (DEBUG(SUFF) && rs) {
1196 printf ("got it\n");
1202 *-----------------------------------------------------------------------
1204 * See if any of the children of the target in the Src structure is
1205 * one from which the target can be transformed. If there is one,
1206 * a Src structure is put together for it and returned.
1209 * The Src structure of the "winning" child, or NIL if no such beast.
1212 * A Src structure may be allocated.
1214 *-----------------------------------------------------------------------
1217 SuffFindCmds (targ, slst)
1218 Src *targ; /* Src structure to play with */
1221 LstNode ln; /* General-purpose list node */
1222 register GNode *t, /* Target GNode */
1223 *s; /* Source GNode */
1224 int prefLen;/* The length of the defined prefix */
1225 Suff *suff; /* Suffix on matching beastie */
1226 Src *ret; /* Return value */
1230 (void) Lst_Open (t->children);
1231 prefLen = strlen (targ->pref);
1233 while ((ln = Lst_Next (t->children)) != NILLNODE) {
1234 s = (GNode *)Lst_Datum (ln);
1236 cp = strrchr (s->name, '/');
1237 if (cp == (char *)NULL) {
1242 if (strncmp (cp, targ->pref, prefLen) == 0) {
1244 * The node matches the prefix ok, see if it has a known
1247 ln = Lst_Find (sufflist, (ClientData)&cp[prefLen],
1249 if (ln != NILLNODE) {
1251 * It even has a known suffix, see if there's a transformation
1252 * defined between the node's suffix and the target's suffix.
1254 * XXX: Handle multi-stage transformations here, too.
1256 suff = (Suff *)Lst_Datum (ln);
1258 if (Lst_Member (suff->parents,
1259 (ClientData)targ->suff) != NILLNODE)
1262 * Hot Damn! Create a new Src structure to describe
1263 * this transformation (making sure to duplicate the
1264 * source node's name so Suff_FindDeps can free it
1265 * again (ick)), and return the new structure.
1267 ret = (Src *)emalloc (sizeof (Src));
1268 ret->file = estrdup(s->name);
1269 ret->pref = targ->pref;
1275 targ->children += 1;
1277 ret->cp = Lst_Init(FALSE);
1278 printf("3 add %x %x\n", targ, ret);
1279 Lst_AtEnd(targ->cp, (ClientData) ret);
1281 Lst_AtEnd(slst, (ClientData) ret);
1283 printf ("\tusing existing source %s\n", s->name);
1290 Lst_Close (t->children);
1291 return ((Src *)NULL);
1295 *-----------------------------------------------------------------------
1296 * SuffExpandChildren --
1297 * Expand the names of any children of a given node that contain
1298 * variable invocations or file wildcards into actual targets.
1304 * The expanded node is removed from the parent's list of children,
1305 * and the parent's unmade counter is decremented, but other nodes
1308 *-----------------------------------------------------------------------
1311 SuffExpandChildren(cgnp, pgnp)
1312 ClientData cgnp; /* Child to examine */
1313 ClientData pgnp; /* Parent node being processed */
1315 GNode *cgn = (GNode *) cgnp;
1316 GNode *pgn = (GNode *) pgnp;
1317 GNode *gn; /* New source 8) */
1318 LstNode prevLN; /* Node after which new source should be put */
1319 LstNode ln; /* List element for old source */
1320 char *cp; /* Expanded value */
1323 * New nodes effectively take the place of the child, so place them
1326 prevLN = Lst_Member(pgn->children, (ClientData)cgn);
1329 * First do variable expansion -- this takes precedence over
1330 * wildcard expansion. If the result contains wildcards, they'll be gotten
1331 * to later since the resulting words are tacked on to the end of
1332 * the children list.
1334 if (strchr(cgn->name, '$') != (char *)NULL) {
1336 printf("Expanding \"%s\"...", cgn->name);
1338 cp = Var_Subst(NULL, cgn->name, pgn, TRUE);
1340 if (cp != (char *)NULL) {
1341 Lst members = Lst_Init(FALSE);
1343 if (cgn->type & OP_ARCHV) {
1345 * Node was an archive(member) target, so we want to call
1346 * on the Arch module to find the nodes for us, expanding
1347 * variables in the parent's context.
1349 char *sacrifice = cp;
1351 (void)Arch_ParseArchive(&sacrifice, members, pgn);
1354 * Break the result into a vector of strings whose nodes
1355 * we can find, then add those nodes to the members list.
1356 * Unfortunately, we can't use brk_string b/c it
1357 * doesn't understand about variable specifications with
1361 char *initcp = cp; /* For freeing... */
1363 for (start = cp; *start == ' ' || *start == '\t'; start++)
1365 for (cp = start; *cp != '\0'; cp++) {
1366 if (*cp == ' ' || *cp == '\t') {
1368 * White-space -- terminate element, find the node,
1369 * add it, skip any further spaces.
1372 gn = Targ_FindNode(start, TARG_CREATE);
1373 (void)Lst_AtEnd(members, (ClientData)gn);
1374 while (*cp == ' ' || *cp == '\t') {
1378 * Adjust cp for increment at start of loop, but
1379 * set start to first non-space.
1382 } else if (*cp == '$') {
1384 * Start of a variable spec -- contact variable module
1385 * to find the end so we can skip over it.
1391 junk = Var_Parse(cp, pgn, TRUE, &len, &doFree);
1392 if (junk != var_Error) {
1399 } else if (*cp == '\\' && *cp != '\0') {
1401 * Escaped something -- skip over it
1409 * Stuff left over -- add it to the list too
1411 gn = Targ_FindNode(start, TARG_CREATE);
1412 (void)Lst_AtEnd(members, (ClientData)gn);
1415 * Point cp back at the beginning again so the variable value
1421 * Add all elements of the members list to the parent node.
1423 while(!Lst_IsEmpty(members)) {
1424 gn = (GNode *)Lst_DeQueue(members);
1427 printf("%s...", gn->name);
1429 if (Lst_Member(pgn->children, (ClientData)gn) == NILLNODE) {
1430 (void)Lst_Append(pgn->children, prevLN, (ClientData)gn);
1431 prevLN = Lst_Succ(prevLN);
1432 (void)Lst_AtEnd(gn->parents, (ClientData)pgn);
1436 Lst_Destroy(members, NOFREE);
1443 * Now the source is expanded, remove it from the list of children to
1444 * keep it from being processed.
1446 ln = Lst_Member(pgn->children, (ClientData)cgn);
1448 Lst_Remove(pgn->children, ln);
1452 } else if (Dir_HasWildcards(cgn->name)) {
1453 Lst exp; /* List of expansions */
1454 Lst path; /* Search path along which to expand */
1457 * Find a path along which to expand the word.
1459 * If the word has a known suffix, use that path.
1460 * If it has no known suffix and we're allowed to use the null
1461 * suffix, use its path.
1462 * Else use the default system search path.
1464 cp = cgn->name + strlen(cgn->name);
1465 ln = Lst_Find(sufflist, (ClientData)cp, SuffSuffIsSuffixP);
1468 printf("Wildcard expanding \"%s\"...", cgn->name);
1471 if (ln != NILLNODE) {
1472 Suff *s = (Suff *)Lst_Datum(ln);
1475 printf("suffix is \"%s\"...", s->name);
1477 path = s->searchPath;
1480 * Use default search path
1482 path = dirSearchPath;
1486 * Expand the word along the chosen path
1488 exp = Lst_Init(FALSE);
1489 Dir_Expand(cgn->name, path, exp);
1491 while (!Lst_IsEmpty(exp)) {
1493 * Fetch next expansion off the list and find its GNode
1495 cp = (char *)Lst_DeQueue(exp);
1498 printf("%s...", cp);
1500 gn = Targ_FindNode(cp, TARG_CREATE);
1503 * If gn isn't already a child of the parent, make it so and
1504 * up the parent's count of unmade children.
1506 if (Lst_Member(pgn->children, (ClientData)gn) == NILLNODE) {
1507 (void)Lst_Append(pgn->children, prevLN, (ClientData)gn);
1508 prevLN = Lst_Succ(prevLN);
1509 (void)Lst_AtEnd(gn->parents, (ClientData)pgn);
1515 * Nuke what's left of the list
1517 Lst_Destroy(exp, NOFREE);
1520 * Now the source is expanded, remove it from the list of children to
1521 * keep it from being processed.
1523 ln = Lst_Member(pgn->children, (ClientData)cgn);
1525 Lst_Remove(pgn->children, ln);
1535 *-----------------------------------------------------------------------
1536 * SuffApplyTransform --
1537 * Apply a transformation rule, given the source and target nodes
1541 * TRUE if successful, FALSE if not.
1544 * The source and target are linked and the commands from the
1545 * transformation are added to the target node's commands list.
1546 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1547 * to the target. The target also inherits all the sources for
1548 * the transformation rule.
1550 *-----------------------------------------------------------------------
1553 SuffApplyTransform(tGn, sGn, t, s)
1554 GNode *tGn; /* Target node */
1555 GNode *sGn; /* Source node */
1556 Suff *t; /* Target suffix */
1557 Suff *s; /* Source suffix */
1559 LstNode ln; /* General node */
1560 char *tname; /* Name of transformation rule */
1561 GNode *gn; /* Node for same */
1563 if (Lst_Member(tGn->children, (ClientData)sGn) == NILLNODE) {
1565 * Not already linked, so form the proper links between the
1566 * target and source.
1568 (void)Lst_AtEnd(tGn->children, (ClientData)sGn);
1569 (void)Lst_AtEnd(sGn->parents, (ClientData)tGn);
1573 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1575 * When a :: node is used as the implied source of a node, we have
1576 * to link all its cohorts in as sources as well. Only the initial
1577 * sGn gets the target in its iParents list, however, as that
1578 * will be sufficient to get the .IMPSRC variable set for tGn
1580 for (ln=Lst_First(sGn->cohorts); ln != NILLNODE; ln=Lst_Succ(ln)) {
1581 gn = (GNode *)Lst_Datum(ln);
1583 if (Lst_Member(tGn->children, (ClientData)gn) == NILLNODE) {
1585 * Not already linked, so form the proper links between the
1586 * target and source.
1588 (void)Lst_AtEnd(tGn->children, (ClientData)gn);
1589 (void)Lst_AtEnd(gn->parents, (ClientData)tGn);
1595 * Locate the transformation rule itself
1597 tname = str_concat(s->name, t->name, 0);
1598 ln = Lst_Find(transforms, (ClientData)tname, SuffGNHasNameP);
1601 if (ln == NILLNODE) {
1603 * Not really such a transformation rule (can happen when we're
1604 * called to link an OP_MEMBER and OP_ARCHV node), so return
1610 gn = (GNode *)Lst_Datum(ln);
1613 printf("\tapplying %s -> %s to \"%s\"\n", s->name, t->name, tGn->name);
1617 * Record last child for expansion purposes
1619 ln = Lst_Last(tGn->children);
1622 * Pass the buck to Make_HandleUse to apply the rule
1624 (void)Make_HandleUse(gn, tGn);
1627 * Deal with wildcards and variables in any acquired sources
1630 if (ln != NILLNODE) {
1631 Lst_ForEachFrom(tGn->children, ln,
1632 SuffExpandChildren, (ClientData)tGn);
1636 * Keep track of another parent to which this beast is transformed so
1637 * the .IMPSRC variable can be set correctly for the parent.
1639 (void)Lst_AtEnd(sGn->iParents, (ClientData)tGn);
1646 *-----------------------------------------------------------------------
1647 * SuffFindArchiveDeps --
1648 * Locate dependencies for an OP_ARCHV node.
1654 * Same as Suff_FindDeps
1656 *-----------------------------------------------------------------------
1659 SuffFindArchiveDeps(gn, slst)
1660 GNode *gn; /* Node for which to locate dependencies */
1663 char *eoarch; /* End of archive portion */
1664 char *eoname; /* End of member portion */
1665 GNode *mem; /* Node for member */
1666 static char *copy[] = { /* Variables to be copied from the member node */
1667 TARGET, /* Must be first */
1668 PREFIX, /* Must be second */
1670 int i; /* Index into copy and vals */
1671 Suff *ms; /* Suffix descriptor for member */
1672 char *name; /* Start of member's name */
1675 * The node is an archive(member) pair. so we must find a
1676 * suffix for both of them.
1678 eoarch = strchr (gn->name, '(');
1679 eoname = strchr (eoarch, ')');
1681 *eoname = '\0'; /* Nuke parentheses during suffix search */
1682 *eoarch = '\0'; /* So a suffix can be found */
1687 * To simplify things, call Suff_FindDeps recursively on the member now,
1688 * so we can simply compare the member's .PREFIX and .TARGET variables
1689 * to locate its suffix. This allows us to figure out the suffix to
1690 * use for the archive without having to do a quadratic search over the
1691 * suffix list, backtracking for each one...
1693 mem = Targ_FindNode(name, TARG_CREATE);
1694 SuffFindDeps(mem, slst);
1697 * Create the link between the two nodes right off
1699 if (Lst_Member(gn->children, (ClientData)mem) == NILLNODE) {
1700 (void)Lst_AtEnd(gn->children, (ClientData)mem);
1701 (void)Lst_AtEnd(mem->parents, (ClientData)gn);
1706 * Copy in the variables from the member node to this one.
1708 for (i = (sizeof(copy)/sizeof(copy[0]))-1; i >= 0; i--) {
1710 Var_Set(copy[i], Var_Value(copy[i], mem, &p1), gn);
1718 * Didn't know what it was -- use .NULL suffix if not in make mode
1721 printf("using null suffix\n");
1728 * Set the other two local variables required for this target.
1730 Var_Set (MEMBER, name, gn);
1731 Var_Set (ARCHIVE, gn->name, gn);
1735 * Member has a known suffix, so look for a transformation rule from
1736 * it to a possible suffix of the archive. Rather than searching
1737 * through the entire list, we just look at suffixes to which the
1738 * member's suffix may be transformed...
1743 * Use first matching suffix...
1745 ln = Lst_Find(ms->parents, eoarch, SuffSuffIsSuffixP);
1747 if (ln != NILLNODE) {
1749 * Got one -- apply it
1751 if (!SuffApplyTransform(gn, mem, (Suff *)Lst_Datum(ln), ms) &&
1754 printf("\tNo transformation from %s -> %s\n",
1755 ms->name, ((Suff *)Lst_Datum(ln))->name);
1761 * Replace the opening and closing parens now we've no need of the separate
1764 *eoarch = '('; *eoname = ')';
1767 * Pretend gn appeared to the left of a dependency operator so
1768 * the user needn't provide a transformation from the member to the
1771 if (OP_NOP(gn->type)) {
1772 gn->type |= OP_DEPENDS;
1776 * Flag the member as such so we remember to look in the archive for
1777 * its modification time.
1779 mem->type |= OP_MEMBER;
1783 *-----------------------------------------------------------------------
1784 * SuffFindNormalDeps --
1785 * Locate implicit dependencies for regular targets.
1791 * Same as Suff_FindDeps...
1793 *-----------------------------------------------------------------------
1796 SuffFindNormalDeps(gn, slst)
1797 GNode *gn; /* Node for which to find sources */
1800 char *eoname; /* End of name */
1801 char *sopref; /* Start of prefix */
1802 LstNode ln; /* Next suffix node to check */
1803 Lst srcs; /* List of sources at which to look */
1804 Lst targs; /* List of targets to which things can be
1805 * transformed. They all have the same file,
1806 * but different suff and pref fields */
1807 Src *bottom; /* Start of found transformation path */
1808 Src *src; /* General Src pointer */
1809 char *pref; /* Prefix to use */
1810 Src *targ; /* General Src target pointer */
1813 eoname = gn->name + strlen(gn->name);
1818 * Begin at the beginning...
1820 ln = Lst_First(sufflist);
1821 srcs = Lst_Init(FALSE);
1822 targs = Lst_Init(FALSE);
1825 * We're caught in a catch-22 here. On the one hand, we want to use any
1826 * transformation implied by the target's sources, but we can't examine
1827 * the sources until we've expanded any variables/wildcards they may hold,
1828 * and we can't do that until we've set up the target's local variables
1829 * and we can't do that until we know what the proper suffix for the
1830 * target is (in case there are two suffixes one of which is a suffix of
1831 * the other) and we can't know that until we've found its implied
1832 * source, which we may not want to use if there's an existing source
1833 * that implies a different transformation.
1835 * In an attempt to get around this, which may not work all the time,
1836 * but should work most of the time, we look for implied sources first,
1837 * checking transformations to all possible suffixes of the target,
1838 * use what we find to set the target's local variables, expand the
1839 * children, then look for any overriding transformations they imply.
1840 * Should we find one, we discard the one we found before.
1843 while (ln != NILLNODE) {
1845 * Look for next possible suffix...
1847 ln = Lst_FindFrom(sufflist, ln, eoname, SuffSuffIsSuffixP);
1849 if (ln != NILLNODE) {
1850 int prefLen; /* Length of the prefix */
1854 * Allocate a Src structure to which things can be transformed
1856 targ = (Src *)emalloc(sizeof (Src));
1857 targ->file = estrdup(gn->name);
1858 targ->suff = (Suff *)Lst_Datum(ln);
1859 targ->suff->refCount++;
1861 targ->parent = (Src *)NULL;
1864 targ->cp = Lst_Init(FALSE);
1868 * Allocate room for the prefix, whose end is found by subtracting
1869 * the length of the suffix from the end of the name.
1871 prefLen = (eoname - targ->suff->nameLen) - sopref;
1872 targ->pref = emalloc(prefLen + 1);
1873 memcpy(targ->pref, sopref, prefLen);
1874 targ->pref[prefLen] = '\0';
1877 * Add nodes from which the target can be made
1879 SuffAddLevel(srcs, targ);
1882 * Record the target so we can nuke it
1884 (void)Lst_AtEnd(targs, (ClientData)targ);
1887 * Search from this suffix's successor...
1894 * Handle target of unknown suffix...
1896 if (Lst_IsEmpty(targs) && suffNull != NULL) {
1898 printf("\tNo known suffix on %s. Using .NULL suffix\n", gn->name);
1901 targ = (Src *)emalloc(sizeof (Src));
1902 targ->file = estrdup(gn->name);
1903 targ->suff = suffNull;
1904 targ->suff->refCount++;
1906 targ->parent = (Src *)NULL;
1908 targ->pref = estrdup(sopref);
1910 targ->cp = Lst_Init(FALSE);
1914 * Only use the default suffix rules if we don't have commands
1915 * or dependencies defined for this gnode
1917 if (Lst_IsEmpty(gn->commands) && Lst_IsEmpty(gn->children))
1918 SuffAddLevel(srcs, targ);
1925 printf("adding suffix rules\n");
1927 (void)Lst_AtEnd(targs, (ClientData)targ);
1931 * Using the list of possible sources built up from the target suffix(es),
1932 * try and find an existing file/target that matches.
1934 bottom = SuffFindThem(srcs, slst);
1936 if (bottom == (Src *)NULL) {
1938 * No known transformations -- use the first suffix found for setting
1939 * the local variables.
1941 if (!Lst_IsEmpty(targs)) {
1942 targ = (Src *)Lst_Datum(Lst_First(targs));
1948 * Work up the transformation path to find the suffix of the
1949 * target to which the transformation was made.
1951 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1956 * The .TARGET variable we always set to be the name at this point,
1957 * since it's only set to the path if the thing is only a source and
1958 * if it's only a source, it doesn't matter what we put here as far
1959 * as expanding sources is concerned, since it has none...
1961 Var_Set(TARGET, gn->name, gn);
1963 pref = (targ != NULL) ? targ->pref : gn->name;
1964 Var_Set(PREFIX, pref, gn);
1967 * Now we've got the important local variables set, expand any sources
1968 * that still contain variables or wildcards in their names.
1970 Lst_ForEach(gn->children, SuffExpandChildren, (ClientData)gn);
1974 printf("\tNo valid suffix on %s\n", gn->name);
1979 * Deal with finding the thing on the default search path if the
1980 * node is only a source (not on the lhs of a dependency operator
1981 * or [XXX] it has neither children or commands).
1983 if (OP_NOP(gn->type) ||
1984 (Lst_IsEmpty(gn->children) && Lst_IsEmpty(gn->commands)))
1986 gn->path = Dir_FindFile(gn->name,
1987 (targ == NULL ? dirSearchPath :
1988 targ->suff->searchPath));
1989 if (gn->path != NULL) {
1991 Var_Set(TARGET, gn->path, gn);
1995 * Suffix known for the thing -- trim the suffix off
1996 * the path to form the proper .PREFIX variable.
1998 int savep = strlen(gn->path) - targ->suff->nameLen;
2002 gn->suffix->refCount--;
2003 gn->suffix = targ->suff;
2004 gn->suffix->refCount++;
2006 savec = gn->path[savep];
2007 gn->path[savep] = '\0';
2009 if ((ptr = strrchr(gn->path, '/')) != NULL)
2014 Var_Set(PREFIX, ptr, gn);
2016 gn->path[savep] = savec;
2019 * The .PREFIX gets the full path if the target has
2023 gn->suffix->refCount--;
2026 if ((ptr = strrchr(gn->path, '/')) != NULL)
2031 Var_Set(PREFIX, ptr, gn);
2036 * Not appropriate to search for the thing -- set the
2037 * path to be the name so Dir_MTime won't go grovelling for
2041 gn->suffix->refCount--;
2042 gn->suffix = (targ == NULL) ? NULL : targ->suff;
2044 gn->suffix->refCount++;
2046 gn->path = estrdup(gn->name);
2053 * If the suffix indicates that the target is a library, mark that in
2054 * the node's type field.
2056 if (targ->suff->flags & SUFF_LIBRARY) {
2061 * Check for overriding transformation rule implied by sources
2063 if (!Lst_IsEmpty(gn->children)) {
2064 src = SuffFindCmds(targ, slst);
2066 if (src != (Src *)NULL) {
2068 * Free up all the Src structures in the transformation path
2069 * up to, but not including, the parent node.
2071 while (bottom && bottom->parent != NULL) {
2072 if (Lst_Member(slst, (ClientData) bottom) == NILLNODE) {
2073 Lst_AtEnd(slst, (ClientData) bottom);
2075 bottom = bottom->parent;
2081 if (bottom == NULL) {
2083 * No idea from where it can come -- return now.
2089 * We now have a list of Src structures headed by 'bottom' and linked via
2090 * their 'parent' pointers. What we do next is create links between
2091 * source and target nodes (which may or may not have been created)
2092 * and set the necessary local variables in each target. The
2093 * commands for each target are set from the commands of the
2094 * transformation rule used to get from the src suffix to the targ
2095 * suffix. Note that this causes the commands list of the original
2096 * node, gn, to be replaced by the commands of the final
2097 * transformation rule. Also, the unmade field of gn is incremented.
2100 if (bottom->node == NILGNODE) {
2101 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
2104 for (src = bottom; src->parent != (Src *)NULL; src = src->parent) {
2107 if (src->node->suffix)
2108 src->node->suffix->refCount--;
2109 src->node->suffix = src->suff;
2110 src->node->suffix->refCount++;
2112 if (targ->node == NILGNODE) {
2113 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
2116 SuffApplyTransform(targ->node, src->node,
2117 targ->suff, src->suff);
2119 if (targ->node != gn) {
2121 * Finish off the dependency-search process for any nodes
2122 * between bottom and gn (no point in questing around the
2123 * filesystem for their implicit source when it's already
2124 * known). Note that the node can't have any sources that
2125 * need expanding, since SuffFindThem will stop on an existing
2126 * node, so all we need to do is set the standard and System V
2129 targ->node->type |= OP_DEPS_FOUND;
2131 Var_Set(PREFIX, targ->pref, targ->node);
2133 Var_Set(TARGET, targ->node->name, targ->node);
2138 gn->suffix->refCount--;
2139 gn->suffix = src->suff;
2140 gn->suffix->refCount++;
2143 * So Dir_MTime doesn't go questing for it...
2146 gn->path = estrdup(gn->name);
2149 * Nuke the transformation path and the Src structures left over in the
2154 if (Lst_Member(slst, (ClientData) bottom) == NILLNODE)
2155 Lst_AtEnd(slst, (ClientData) bottom);
2157 while (SuffRemoveSrc(srcs) || SuffRemoveSrc(targs))
2160 Lst_Concat(slst, srcs, LST_CONCLINK);
2161 Lst_Concat(slst, targs, LST_CONCLINK);
2166 *-----------------------------------------------------------------------
2168 * Find implicit sources for the target described by the graph node
2175 * Nodes are added to the graph below the passed-in node. The nodes
2176 * are marked to have their IMPSRC variable filled in. The
2177 * PREFIX variable is set for the given node and all its
2181 * The path found by this target is the shortest path in the
2182 * transformation graph, which may pass through non-existent targets,
2183 * to an existing target. The search continues on all paths from the
2184 * root suffix until a file is found. I.e. if there's a path
2185 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2186 * the .c and .l files don't, the search will branch out in
2187 * all directions from .o and again from all the nodes on the
2188 * next level until the .l,v node is encountered.
2190 *-----------------------------------------------------------------------
2198 SuffFindDeps(gn, srclist);
2199 while (SuffRemoveSrc(srclist))
2205 SuffFindDeps (gn, slst)
2206 GNode *gn; /* node we're dealing with */
2209 if (gn->type & OP_DEPS_FOUND) {
2211 * If dependencies already found, no need to do it again...
2215 gn->type |= OP_DEPS_FOUND;
2219 printf ("SuffFindDeps (%s)\n", gn->name);
2222 if (gn->type & OP_ARCHV) {
2223 SuffFindArchiveDeps(gn, slst);
2224 } else if (gn->type & OP_LIB) {
2226 * If the node is a library, it is the arch module's job to find it
2227 * and set the TARGET variable accordingly. We merely provide the
2228 * search path, assuming all libraries end in ".a" (if the suffix
2229 * hasn't been defined, there's nothing we can do for it, so we just
2230 * set the TARGET variable to the node's name in order to give it a
2236 ln = Lst_Find (sufflist, (ClientData)LIBSUFF, SuffSuffHasNameP);
2238 gn->suffix->refCount--;
2239 if (ln != NILLNODE) {
2240 gn->suffix = s = (Suff *) Lst_Datum (ln);
2241 gn->suffix->refCount++;
2242 Arch_FindLib (gn, s->searchPath);
2245 Var_Set (TARGET, gn->name, gn);
2248 * Because a library (-lfoo) target doesn't follow the standard
2249 * filesystem conventions, we don't set the regular variables for
2250 * the thing. .PREFIX is simply made empty...
2252 Var_Set(PREFIX, "", gn);
2254 SuffFindNormalDeps(gn, slst);
2259 *-----------------------------------------------------------------------
2261 * Define which suffix is the null suffix.
2267 * 'suffNull' is altered.
2270 * Need to handle the changing of the null suffix gracefully so the
2271 * old transformation rules don't just go away.
2273 *-----------------------------------------------------------------------
2277 char *name; /* Name of null suffix */
2282 ln = Lst_Find(sufflist, (ClientData)name, SuffSuffHasNameP);
2283 if (ln != NILLNODE) {
2284 s = (Suff *)Lst_Datum(ln);
2285 if (suffNull != (Suff *)NULL) {
2286 suffNull->flags &= ~SUFF_NULL;
2288 s->flags |= SUFF_NULL;
2290 * XXX: Here's where the transformation mangling would take place
2294 Parse_Error (PARSE_WARNING, "Desired null suffix %s not defined.",
2300 *-----------------------------------------------------------------------
2302 * Initialize suffixes module
2309 *-----------------------------------------------------------------------
2314 sufflist = Lst_Init (FALSE);
2315 suffClean = Lst_Init(FALSE);
2316 srclist = Lst_Init (FALSE);
2317 transforms = Lst_Init (FALSE);
2321 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2322 * actually go on the suffix list or everyone will think that's its
2325 emptySuff = suffNull = (Suff *) emalloc (sizeof (Suff));
2327 suffNull->name = estrdup ("");
2328 suffNull->nameLen = 0;
2329 suffNull->searchPath = Lst_Init (FALSE);
2330 Dir_Concat(suffNull->searchPath, dirSearchPath);
2331 suffNull->children = Lst_Init (FALSE);
2332 suffNull->parents = Lst_Init (FALSE);
2333 suffNull->ref = Lst_Init (FALSE);
2334 suffNull->sNum = sNum++;
2335 suffNull->flags = SUFF_NULL;
2336 suffNull->refCount = 1;
2342 *----------------------------------------------------------------------
2344 * Cleanup the this module
2350 * The memory is free'd.
2351 *----------------------------------------------------------------------
2357 Lst_Destroy(sufflist, SuffFree);
2358 Lst_Destroy(suffClean, SuffFree);
2361 Lst_Destroy(srclist, NOFREE);
2362 Lst_Destroy(transforms, NOFREE);
2366 /********************* DEBUGGING FUNCTIONS **********************/
2368 static int SuffPrintName(s, dummy)
2372 printf ("`%s' ", ((Suff *) s)->name);
2373 return (dummy ? 0 : 0);
2377 SuffPrintSuff (sp, dummy)
2381 Suff *s = (Suff *) sp;
2385 printf ("# `%s' [%d] ", s->name, s->refCount);
2389 fputs (" (", stdout);
2391 flag = 1 << (ffs(flags) - 1);
2404 fputc(flags ? '|' : ')', stdout);
2407 fputc ('\n', stdout);
2409 Lst_ForEach (s->parents, SuffPrintName, (ClientData)0);
2410 fputc ('\n', stdout);
2411 printf ("#\tFrom: ");
2412 Lst_ForEach (s->children, SuffPrintName, (ClientData)0);
2413 fputc ('\n', stdout);
2414 printf ("#\tSearch Path: ");
2415 Dir_PrintPath (s->searchPath);
2416 fputc ('\n', stdout);
2417 return (dummy ? 0 : 0);
2421 SuffPrintTrans (tp, dummy)
2425 GNode *t = (GNode *) tp;
2427 printf ("%-16s: ", t->name);
2428 Targ_PrintType (t->type);
2429 fputc ('\n', stdout);
2430 Lst_ForEach (t->commands, Targ_PrintCmd, (ClientData)0);
2431 fputc ('\n', stdout);
2432 return(dummy ? 0 : 0);
2438 printf ("#*** Suffixes:\n");
2439 Lst_ForEach (sufflist, SuffPrintSuff, (ClientData)0);
2441 printf ("#*** Transformations:\n");
2442 Lst_ForEach (transforms, SuffPrintTrans, (ClientData)0);