2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1989 by Berkeley Softworks
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)suff.c 8.4 (Berkeley) 3/21/94
39 * $FreeBSD: src/usr.bin/make/suff.c,v 1.12.2.2 2004/06/10 13:07:53 ru Exp $
40 * $DragonFly: src/usr.bin/make/suff.c,v 1.9 2004/11/12 22:42:36 dillon Exp $
45 * Functions to maintain suffix lists and find implicit dependents
46 * using suffix transformation rules
49 * Suff_Init Initialize all things to do with suffixes.
51 * Suff_End Cleanup the module
53 * Suff_DoPaths This function is used to make life easier
54 * when searching for a file according to its
55 * suffix. It takes the global search path,
56 * as defined using the .PATH: target, and appends
57 * its directories to the path of each of the
58 * defined suffixes, as specified using
59 * .PATH<suffix>: targets. In addition, all
60 * directories given for suffixes labeled as
61 * include files or libraries, using the .INCLUDES
62 * or .LIBS targets, are played with using
63 * Dir_MakeFlags to create the .INCLUDES and
64 * .LIBS global variables.
66 * Suff_ClearSuffixes Clear out all the suffixes and defined
69 * Suff_IsTransform Return TRUE if the passed string is the lhs
70 * of a transformation rule.
72 * Suff_AddSuffix Add the passed string as another known suffix.
74 * Suff_GetPath Return the search path for the given suffix.
76 * Suff_AddInclude Mark the given suffix as denoting an include
79 * Suff_AddLib Mark the given suffix as denoting a library.
81 * Suff_AddTransform Add another transformation to the suffix
82 * graph. Returns GNode suitable for framing, I
83 * mean, tacking commands, attributes, etc. on.
85 * Suff_SetNull Define the suffix to consider the suffix of
86 * any file that doesn't have a known one.
88 * Suff_FindDeps Find implicit sources for and the location of
89 * a target based on its suffix. Returns the
90 * bottom-most node added to the graph or NULL
91 * if the target had no implicit sources.
99 static Lst sufflist; /* Lst of suffixes */
100 static Lst suffClean; /* Lst of suffixes to be cleaned */
101 static Lst srclist; /* Lst of sources */
102 static Lst transforms; /* Lst of transformation rules */
104 static int sNum = 0; /* Counter for assigning suffix numbers */
107 * Structure describing an individual suffix.
109 typedef struct _Suff {
110 char *name; /* The suffix itself */
111 int nameLen; /* Length of the suffix */
112 short flags; /* Type of suffix */
113 #define SUFF_INCLUDE 0x01 /* One which is #include'd */
114 #define SUFF_LIBRARY 0x02 /* One which contains a library */
115 #define SUFF_NULL 0x04 /* The empty suffix */
116 Lst searchPath; /* The path along which files of this suffix
118 int sNum; /* The suffix number */
119 int refCount; /* Reference count of list membership */
120 Lst parents; /* Suffixes we have a transformation to */
121 Lst children; /* Suffixes we have a transformation from */
122 Lst ref; /* List of lists this suffix is referenced */
126 * Structure used in the search for implied sources.
128 typedef struct _Src {
129 char *file; /* The file to look for */
130 char *pref; /* Prefix from which file was formed */
131 Suff *suff; /* The suffix on the file */
132 struct _Src *parent; /* The Src for which this is a source */
133 GNode *node; /* The node describing the file */
134 int children; /* Count of existing children (so we don't free
135 * this thing too early or never nuke it) */
137 Lst cp; /* Debug; children list */
142 * A structure for passing more than one argument to the Lst-library-invoked
150 static Suff *suffNull; /* The NULL suffix for this run */
151 static Suff *emptySuff; /* The empty suffix required for POSIX
152 * single-suffix transformation rules */
155 static char *SuffStrIsPrefix(char *, char *);
156 static char *SuffSuffIsSuffix(Suff *, char *);
157 static int SuffSuffIsSuffixP(void *, void *);
158 static int SuffSuffHasNameP(void *, void *);
159 static int SuffSuffIsPrefix(void *, void *);
160 static int SuffGNHasNameP(void *, void *);
161 static void SuffFree(void *);
162 static void SuffInsert(Lst, Suff *);
163 static void SuffRemove(Lst, Suff *);
164 static Boolean SuffParseTransform(char *, Suff **, Suff **);
165 static int SuffRebuildGraph(void *, void *);
166 static int SuffAddSrc(void *, void *);
167 static int SuffRemoveSrc(Lst);
168 static void SuffAddLevel(Lst, Src *);
169 static Src *SuffFindThem(Lst, Lst);
170 static Src *SuffFindCmds(Src *, Lst);
171 static int SuffExpandChildren(void *, void *);
172 static Boolean SuffApplyTransform(GNode *, GNode *, Suff *, Suff *);
173 static void SuffFindDeps(GNode *, Lst);
174 static void SuffFindArchiveDeps(GNode *, Lst);
175 static void SuffFindNormalDeps(GNode *, Lst);
176 static int SuffPrintName(void *, void *);
177 static int SuffPrintSuff(void *, void *);
178 static int SuffPrintTrans(void *, void *);
180 /*************** Lst Predicates ****************/
182 *-----------------------------------------------------------------------
184 * See if pref is a prefix of str.
187 * NULL if it ain't, pointer to character in str after prefix if so
191 *-----------------------------------------------------------------------
194 SuffStrIsPrefix (pref, str)
195 char *pref; /* possible prefix */
196 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 Suff *s; /* possible suffix */
223 char *str; /* string to examine */
225 char *p1; /* Pointer into suffix name */
226 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 void * s; /* Suffix to check */
277 void * 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 void * s; /* suffix to compare */
300 void * 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 void * gn; /* current node we're looking at */
320 void * 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);
361 *-----------------------------------------------------------------------
363 * Remove the suffix into the list
369 * The reference count for the suffix is decremented
370 *-----------------------------------------------------------------------
377 LstNode ln = Lst_Member(l, (void *)s);
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)) != NULL) {
409 s2 = (Suff *) Lst_Datum (ln);
410 if (s2->sNum >= s->sNum) {
416 DEBUGF(SUFF, ("inserting %s(%d)...", s->name, s->sNum));
418 DEBUGF(SUFF, ("at end of list\n"));
419 (void)Lst_AtEnd (l, (void *)s);
421 (void)Lst_AtEnd(s->ref, (void *) l);
422 } else if (s2->sNum != s->sNum) {
423 DEBUGF(SUFF, ("before %s(%d)\n", s2->name, s2->sNum));
424 (void)Lst_Insert (l, ln, (void *)s);
426 (void)Lst_AtEnd(s->ref, (void *) l);
428 DEBUGF(SUFF, ("already there\n"));
433 *-----------------------------------------------------------------------
434 * Suff_ClearSuffixes --
435 * This is gross. Nuke the list of suffixes but keep all transformation
436 * rules around. The transformation graph is destroyed in this process,
437 * but we leave the list of rules so when a new graph is formed the rules
439 * This function is called from the parse module when a
440 * .SUFFIXES:\n line is encountered.
446 * the sufflist and its graph nodes are destroyed
447 *-----------------------------------------------------------------------
450 Suff_ClearSuffixes ()
452 Lst_Concat (suffClean, sufflist, LST_CONCLINK);
453 sufflist = Lst_Init(FALSE);
455 suffNull = emptySuff;
457 * Clear suffNull's children list (the other suffixes are built new, but
458 * suffNull is used as is).
459 * NOFREE is used because all suffixes are are on the suffClean list.
460 * suffNull should not have parents.
462 Lst_Destroy(suffNull->children, NOFREE);
463 suffNull->children = Lst_Init(FALSE);
467 *-----------------------------------------------------------------------
468 * SuffParseTransform --
469 * Parse a transformation string to find its two component suffixes.
472 * TRUE if the string is a valid transformation and FALSE otherwise.
475 * The passed pointers are overwritten.
477 *-----------------------------------------------------------------------
480 SuffParseTransform(str, srcPtr, targPtr)
481 char *str; /* String being parsed */
482 Suff **srcPtr; /* Place to store source of trans. */
483 Suff **targPtr; /* Place to store target of trans. */
485 LstNode srcLn; /* element in suffix list of trans source*/
486 Suff *src; /* Source of transformation */
487 LstNode targLn; /* element in suffix list of trans target*/
488 char *str2; /* Extra pointer (maybe target suffix) */
489 LstNode singleLn; /* element in suffix list of any suffix
490 * that exactly matches str */
491 Suff *single = NULL;/* Source of possible transformation to
498 * Loop looking first for a suffix that matches the start of the
499 * string and then for one that exactly matches the rest of it. If
500 * we can find two that meet these criteria, we've successfully
505 srcLn = Lst_Find(sufflist, (void *)str, SuffSuffIsPrefix);
507 srcLn = Lst_FindFrom (sufflist, Lst_Succ(srcLn), (void *)str,
512 * Ran out of source suffixes -- no such rule
514 if (singleLn != NULL) {
516 * Not so fast Mr. Smith! There was a suffix that encompassed
517 * the entire string, so we assume it was a transformation
518 * to the null suffix (thank you POSIX). We still prefer to
519 * find a double rule over a singleton, hence we leave this
520 * check until the end.
522 * XXX: Use emptySuff over suffNull?
530 src = (Suff *) Lst_Datum (srcLn);
531 str2 = str + src->nameLen;
536 targLn = Lst_Find(sufflist, (void *)str2, SuffSuffHasNameP);
537 if (targLn != NULL) {
539 *targPtr = (Suff *)Lst_Datum(targLn);
547 *-----------------------------------------------------------------------
548 * Suff_IsTransform --
549 * Return TRUE if the given string is a transformation rule
553 * TRUE if the string is a concatenation of two known suffixes.
558 *-----------------------------------------------------------------------
561 Suff_IsTransform (str)
562 char *str; /* string to check */
566 return (SuffParseTransform(str, &src, &targ));
570 *-----------------------------------------------------------------------
571 * Suff_AddTransform --
572 * Add the transformation rule described by the line to the
573 * list of rules and place the transformation itself in the graph
576 * The node created for the transformation in the transforms list
579 * The node is placed on the end of the transforms Lst and links are
580 * made between the two suffixes mentioned in the target name
581 *-----------------------------------------------------------------------
584 Suff_AddTransform (line)
585 char *line; /* name of transformation to add */
587 GNode *gn; /* GNode of transformation rule */
588 Suff *s, /* source suffix */
589 *t; /* target suffix */
590 LstNode ln; /* Node for existing transformation */
592 ln = Lst_Find (transforms, (void *)line, SuffGNHasNameP);
595 * Make a new graph node for the transformation. It will be filled in
596 * by the Parse module.
598 gn = Targ_NewGN (line);
599 (void)Lst_AtEnd (transforms, (void *)gn);
602 * New specification for transformation rule. Just nuke the old list
603 * of commands so they can be filled in again... We don't actually
604 * free the commands themselves, because a given command can be
605 * attached to several different transformations.
607 gn = (GNode *) Lst_Datum (ln);
608 Lst_Destroy (gn->commands, NOFREE);
609 Lst_Destroy (gn->children, NOFREE);
610 gn->commands = Lst_Init (FALSE);
611 gn->children = Lst_Init (FALSE);
614 gn->type = OP_TRANSFORM;
616 (void)SuffParseTransform(line, &s, &t);
619 * link the two together in the proper relationship and order
621 DEBUGF(SUFF, ("defining transformation from `%s' to `%s'\n",
623 SuffInsert (t->children, s);
624 SuffInsert (s->parents, t);
630 *-----------------------------------------------------------------------
631 * Suff_EndTransform --
632 * Handle the finish of a transformation definition, removing the
633 * transformation from the graph if it has neither commands nor
634 * sources. This is a callback procedure for the Parse module via
641 * If the node has no commands or children, the children and parents
642 * lists of the affected suffices are altered.
644 *-----------------------------------------------------------------------
647 Suff_EndTransform(gnp, dummy)
648 void * gnp; /* Node for transformation */
649 void * dummy; /* Node for transformation */
651 GNode *gn = (GNode *) gnp;
653 if ((gn->type & OP_TRANSFORM) && Lst_IsEmpty(gn->commands) &&
654 Lst_IsEmpty(gn->children))
659 * SuffParseTransform() may fail for special rules which are not
660 * actual transformation rules (e.g., .DEFAULT).
662 if (!SuffParseTransform(gn->name, &s, &t))
665 DEBUGF(SUFF, ("deleting transformation from `%s' to `%s'\n",
669 * Remove the source from the target's children list. We check for a
670 * NULL return to handle a beanhead saying something like
673 * We'll be called twice when the next target is seen, but .c and .o
674 * are only linked once...
676 SuffRemove(t->children, s);
679 * Remove the target from the source's parents list
681 SuffRemove(s->parents, t);
682 } else if (gn->type & OP_TRANSFORM) {
683 DEBUGF(SUFF, ("transformation %s complete\n", gn->name));
686 return(dummy ? 0 : 0);
690 *-----------------------------------------------------------------------
691 * SuffRebuildGraph --
692 * Called from Suff_AddSuffix via Lst_ForEach to search through the
693 * list of existing transformation rules and rebuild the transformation
694 * graph when it has been destroyed by Suff_ClearSuffixes. If the
695 * given rule is a transformation involving this suffix and another,
696 * existing suffix, the proper relationship is established between
703 * The appropriate links will be made between this suffix and
704 * others if transformation rules exist for it.
706 *-----------------------------------------------------------------------
709 SuffRebuildGraph(transformp, sp)
710 void * transformp; /* Transformation to test */
711 void * sp; /* Suffix to rebuild */
713 GNode *transform = (GNode *) transformp;
714 Suff *s = (Suff *) sp;
720 * First see if it is a transformation from this suffix.
722 cp = SuffStrIsPrefix(s->name, transform->name);
723 if (cp != (char *)NULL) {
724 if (cp[0] == '\0') /* null rule */
727 ln = Lst_Find(sufflist, (void *)cp, SuffSuffHasNameP);
729 s2 = (Suff *)Lst_Datum(ln);
733 * Found target. Link in and return, since it can't be anything
736 SuffInsert(s2->children, s);
737 SuffInsert(s->parents, s2);
743 * Not from, maybe to?
745 cp = SuffSuffIsSuffix(s, transform->name + strlen(transform->name));
746 if (cp != (char *)NULL) {
748 * Null-terminate the source suffix in order to find it.
751 ln = Lst_Find(sufflist, (void *)transform->name, SuffSuffHasNameP);
753 * Replace the start of the target suffix
758 * Found it -- establish the proper relationship
760 s2 = (Suff *)Lst_Datum(ln);
761 SuffInsert(s->children, s2);
762 SuffInsert(s2->parents, s);
769 *-----------------------------------------------------------------------
771 * Add the suffix in string to the end of the list of known suffixes.
772 * Should we restructure the suffix graph? Make doesn't...
778 * A GNode is created for the suffix and a Suff structure is created and
779 * added to the suffixes list unless the suffix was already known.
780 *-----------------------------------------------------------------------
784 char *str; /* the name of the suffix to add */
786 Suff *s; /* new suffix descriptor */
789 ln = Lst_Find (sufflist, (void *)str, SuffSuffHasNameP);
791 s = (Suff *) emalloc (sizeof (Suff));
793 s->name = estrdup (str);
794 s->nameLen = strlen (s->name);
795 s->searchPath = Lst_Init (FALSE);
796 s->children = Lst_Init (FALSE);
797 s->parents = Lst_Init (FALSE);
798 s->ref = Lst_Init (FALSE);
803 (void)Lst_AtEnd (sufflist, (void *)s);
805 * Look for any existing transformations from or to this suffix.
806 * XXX: Only do this after a Suff_ClearSuffixes?
808 Lst_ForEach (transforms, SuffRebuildGraph, (void *)s);
813 *-----------------------------------------------------------------------
815 * Return the search path for the given suffix, if it's defined.
818 * The searchPath for the desired suffix or NULL if the suffix isn't
823 *-----------------------------------------------------------------------
832 ln = Lst_Find (sufflist, (void *)sname, SuffSuffHasNameP);
836 s = (Suff *) Lst_Datum (ln);
837 return (s->searchPath);
842 *-----------------------------------------------------------------------
844 * Extend the search paths for all suffixes to include the default
851 * The searchPath field of all the suffixes is extended by the
852 * directories in dirSearchPath. If paths were specified for the
853 * ".h" suffix, the directories are stuffed into a global variable
854 * called ".INCLUDES" with each directory preceeded by a -I. The same
855 * is done for the ".a" suffix, except the variable is called
856 * ".LIBS" and the flag is -L.
857 *-----------------------------------------------------------------------
865 Lst inIncludes; /* Cumulative .INCLUDES path */
866 Lst inLibs; /* Cumulative .LIBS path */
868 if (Lst_Open (sufflist) == FAILURE) {
872 inIncludes = Lst_Init(FALSE);
873 inLibs = Lst_Init(FALSE);
875 while ((ln = Lst_Next (sufflist)) != NULL) {
876 s = (Suff *) Lst_Datum (ln);
877 if (!Lst_IsEmpty (s->searchPath)) {
879 if (s->flags & SUFF_INCLUDE) {
880 Dir_Concat(inIncludes, s->searchPath);
882 #endif /* INCLUDES */
884 if (s->flags & SUFF_LIBRARY) {
885 Dir_Concat(inLibs, s->searchPath);
887 #endif /* LIBRARIES */
888 Dir_Concat(s->searchPath, dirSearchPath);
890 Lst_Destroy (s->searchPath, Dir_Destroy);
891 s->searchPath = Lst_Duplicate(dirSearchPath, Dir_CopyDir);
895 Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", inIncludes), VAR_GLOBAL);
897 Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", inLibs), VAR_GLOBAL);
900 Lst_Destroy(inIncludes, Dir_Destroy);
901 Lst_Destroy(inLibs, Dir_Destroy);
903 Lst_Close (sufflist);
907 *-----------------------------------------------------------------------
909 * Add the given suffix as a type of file which gets included.
910 * Called from the parse module when a .INCLUDES line is parsed.
911 * The suffix must have already been defined.
917 * The SUFF_INCLUDE bit is set in the suffix's flags field
919 *-----------------------------------------------------------------------
922 Suff_AddInclude (sname)
923 char *sname; /* Name of suffix to mark */
928 ln = Lst_Find (sufflist, (void *)sname, SuffSuffHasNameP);
930 s = (Suff *) Lst_Datum (ln);
931 s->flags |= SUFF_INCLUDE;
936 *-----------------------------------------------------------------------
938 * Add the given suffix as a type of file which is a library.
939 * Called from the parse module when parsing a .LIBS line. The
940 * suffix must have been defined via .SUFFIXES before this is
947 * The SUFF_LIBRARY bit is set in the suffix's flags field
949 *-----------------------------------------------------------------------
953 char *sname; /* Name of suffix to mark */
958 ln = Lst_Find (sufflist, (void *)sname, SuffSuffHasNameP);
960 s = (Suff *) Lst_Datum (ln);
961 s->flags |= SUFF_LIBRARY;
965 /********** Implicit Source Search Functions *********/
968 *-----------------------------------------------------------------------
970 * Add a suffix as a Src structure to the given list with its parent
971 * being the given Src structure. If the suffix is the null suffix,
972 * the prefix is used unaltered as the file name in the Src structure.
978 * A Src structure is created and tacked onto the end of the list
979 *-----------------------------------------------------------------------
983 void * sp; /* suffix for which to create a Src structure */
984 void * lsp; /* list and parent for the new Src */
986 Suff *s = (Suff *) sp;
987 LstSrc *ls = (LstSrc *) lsp;
988 Src *s2; /* new Src structure */
989 Src *targ; /* Target structure */
993 if ((s->flags & SUFF_NULL) && (*s->name != '\0')) {
995 * If the suffix has been marked as the NULL suffix, also create a Src
996 * structure for a file with no suffix attached. Two birds, and all
999 s2 = (Src *) emalloc (sizeof (Src));
1000 s2->file = estrdup(targ->pref);
1001 s2->pref = targ->pref;
1007 targ->children += 1;
1008 (void)Lst_AtEnd (ls->l, (void *)s2);
1010 s2->cp = Lst_Init(FALSE);
1011 Lst_AtEnd(targ->cp, (void *) s2);
1012 printf("1 add %x %x to %x:", targ, s2, ls->l);
1013 Lst_ForEach(ls->l, PrintAddr, (void *) 0);
1017 s2 = (Src *) emalloc (sizeof (Src));
1018 s2->file = str_concat (targ->pref, s->name, 0);
1019 s2->pref = targ->pref;
1025 targ->children += 1;
1026 (void)Lst_AtEnd (ls->l, (void *)s2);
1028 s2->cp = Lst_Init(FALSE);
1029 Lst_AtEnd(targ->cp, (void *) s2);
1030 printf("2 add %x %x to %x:", targ, s2, ls->l);
1031 Lst_ForEach(ls->l, PrintAddr, (void *) 0);
1039 *-----------------------------------------------------------------------
1041 * Add all the children of targ as Src structures to the given list
1047 * Lots of structures are created and added to the list
1048 *-----------------------------------------------------------------------
1051 SuffAddLevel (l, targ)
1052 Lst l; /* list to which to add the new level */
1053 Src *targ; /* Src structure to use as the parent */
1060 Lst_ForEach (targ->suff->children, SuffAddSrc, (void *)&ls);
1064 *----------------------------------------------------------------------
1066 * Free all src structures in list that don't have a reference count
1069 * Ture if an src was removed
1072 * The memory is free'd.
1073 *----------------------------------------------------------------------
1083 if (Lst_Open (l) == FAILURE) {
1087 printf("cleaning %lx: ", (unsigned long) l);
1088 Lst_ForEach(l, PrintAddr, (void *) 0);
1093 while ((ln = Lst_Next (l)) != NULL) {
1094 s = (Src *) Lst_Datum (ln);
1095 if (s->children == 0) {
1101 LstNode ln = Lst_Member(s->parent->cp, (void *)s);
1103 Lst_Remove(s->parent->cp, ln);
1105 --s->parent->children;
1108 printf("free: [l=%x] p=%x %d\n", l, s, s->children);
1109 Lst_Destroy(s->cp, NOFREE);
1119 printf("keep: [l=%x] p=%x %d: ", l, s, s->children);
1120 Lst_ForEach(s->cp, PrintAddr, (void *) 0);
1132 *-----------------------------------------------------------------------
1134 * Find the first existing file/target in the list srcs
1137 * The lowest structure in the chain of transformations
1141 *-----------------------------------------------------------------------
1144 SuffFindThem (srcs, slst)
1145 Lst srcs; /* list of Src structures to search through */
1148 Src *s; /* current Src */
1149 Src *rs; /* returned Src */
1154 while (!Lst_IsEmpty (srcs)) {
1155 s = (Src *) Lst_DeQueue (srcs);
1157 DEBUGF(SUFF, ("\ttrying %s...", s->file));
1160 * A file is considered to exist if either a node exists in the
1161 * graph for it or the file actually exists.
1163 if (Targ_FindNode(s->file, TARG_NOCREATE) != NULL) {
1165 printf("remove %x from %x\n", s, srcs);
1171 if ((ptr = Dir_FindFile (s->file, s->suff->searchPath)) != NULL) {
1174 printf("remove %x from %x\n", s, srcs);
1180 DEBUGF(SUFF, ("not there\n"));
1182 SuffAddLevel (srcs, s);
1183 Lst_AtEnd(slst, (void *) s);
1187 DEBUGF(SUFF, ("got it\n"));
1193 *-----------------------------------------------------------------------
1195 * See if any of the children of the target in the Src structure is
1196 * one from which the target can be transformed. If there is one,
1197 * a Src structure is put together for it and returned.
1200 * The Src structure of the "winning" child, or NULL if no such beast.
1203 * A Src structure may be allocated.
1205 *-----------------------------------------------------------------------
1208 SuffFindCmds (targ, slst)
1209 Src *targ; /* Src structure to play with */
1212 LstNode ln; /* General-purpose list node */
1213 GNode *t, /* Target GNode */
1214 *s; /* Source GNode */
1215 int prefLen;/* The length of the defined prefix */
1216 Suff *suff; /* Suffix on matching beastie */
1217 Src *ret; /* Return value */
1221 (void) Lst_Open (t->children);
1222 prefLen = strlen (targ->pref);
1224 while ((ln = Lst_Next (t->children)) != NULL) {
1225 s = (GNode *)Lst_Datum (ln);
1227 cp = strrchr (s->name, '/');
1228 if (cp == (char *)NULL) {
1233 if (strncmp (cp, targ->pref, prefLen) == 0) {
1235 * The node matches the prefix ok, see if it has a known
1238 ln = Lst_Find (sufflist, (void *)&cp[prefLen],
1242 * It even has a known suffix, see if there's a transformation
1243 * defined between the node's suffix and the target's suffix.
1245 * XXX: Handle multi-stage transformations here, too.
1247 suff = (Suff *)Lst_Datum (ln);
1249 if (Lst_Member (suff->parents,
1250 (void *)targ->suff) != NULL)
1253 * Hot Damn! Create a new Src structure to describe
1254 * this transformation (making sure to duplicate the
1255 * source node's name so Suff_FindDeps can free it
1256 * again (ick)), and return the new structure.
1258 ret = (Src *)emalloc (sizeof (Src));
1259 ret->file = estrdup(s->name);
1260 ret->pref = targ->pref;
1266 targ->children += 1;
1268 ret->cp = Lst_Init(FALSE);
1269 printf("3 add %x %x\n", targ, ret);
1270 Lst_AtEnd(targ->cp, (void *) ret);
1272 Lst_AtEnd(slst, (void *) ret);
1273 DEBUGF(SUFF, ("\tusing existing source %s\n", s->name));
1279 Lst_Close (t->children);
1280 return ((Src *)NULL);
1284 *-----------------------------------------------------------------------
1285 * SuffExpandChildren --
1286 * Expand the names of any children of a given node that contain
1287 * variable invocations or file wildcards into actual targets.
1293 * The expanded node is removed from the parent's list of children,
1294 * and the parent's unmade counter is decremented, but other nodes
1297 *-----------------------------------------------------------------------
1300 SuffExpandChildren(cgnp, pgnp)
1301 void * cgnp; /* Child to examine */
1302 void * pgnp; /* Parent node being processed */
1304 GNode *cgn = (GNode *) cgnp;
1305 GNode *pgn = (GNode *) pgnp;
1306 GNode *gn; /* New source 8) */
1307 LstNode prevLN; /* Node after which new source should be put */
1308 LstNode ln; /* List element for old source */
1309 char *cp; /* Expanded value */
1312 * New nodes effectively take the place of the child, so place them
1315 prevLN = Lst_Member(pgn->children, (void *)cgn);
1318 * First do variable expansion -- this takes precedence over
1319 * wildcard expansion. If the result contains wildcards, they'll be gotten
1320 * to later since the resulting words are tacked on to the end of
1321 * the children list.
1323 if (strchr(cgn->name, '$') != (char *)NULL) {
1324 DEBUGF(SUFF, ("Expanding \"%s\"...", cgn->name));
1325 cp = Var_Subst(NULL, cgn->name, pgn, TRUE);
1327 if (cp != (char *)NULL) {
1328 Lst members = Lst_Init(FALSE);
1330 if (cgn->type & OP_ARCHV) {
1332 * Node was an archive(member) target, so we want to call
1333 * on the Arch module to find the nodes for us, expanding
1334 * variables in the parent's context.
1336 char *sacrifice = cp;
1338 (void)Arch_ParseArchive(&sacrifice, members, pgn);
1341 * Break the result into a vector of strings whose nodes
1342 * we can find, then add those nodes to the members list.
1343 * Unfortunately, we can't use brk_string b/c it
1344 * doesn't understand about variable specifications with
1348 char *initcp = cp; /* For freeing... */
1350 for (start = cp; *start == ' ' || *start == '\t'; start++)
1352 for (cp = start; *cp != '\0'; cp++) {
1353 if (*cp == ' ' || *cp == '\t') {
1355 * White-space -- terminate element, find the node,
1356 * add it, skip any further spaces.
1359 gn = Targ_FindNode(start, TARG_CREATE);
1360 (void)Lst_AtEnd(members, (void *)gn);
1361 while (*cp == ' ' || *cp == '\t') {
1365 * Adjust cp for increment at start of loop, but
1366 * set start to first non-space.
1369 } else if (*cp == '$') {
1371 * Start of a variable spec -- contact variable module
1372 * to find the end so we can skip over it.
1378 junk = Var_Parse(cp, pgn, TRUE, &len, &doFree);
1379 if (junk != var_Error) {
1386 } else if (*cp == '\\' && *cp != '\0') {
1388 * Escaped something -- skip over it
1396 * Stuff left over -- add it to the list too
1398 gn = Targ_FindNode(start, TARG_CREATE);
1399 (void)Lst_AtEnd(members, (void *)gn);
1402 * Point cp back at the beginning again so the variable value
1408 * Add all elements of the members list to the parent node.
1410 while(!Lst_IsEmpty(members)) {
1411 gn = (GNode *)Lst_DeQueue(members);
1413 DEBUGF(SUFF, ("%s...", gn->name));
1414 if (Lst_Member(pgn->children, (void *)gn) == NULL) {
1415 (void)Lst_Append(pgn->children, prevLN, (void *)gn);
1416 prevLN = Lst_Succ(prevLN);
1417 (void)Lst_AtEnd(gn->parents, (void *)pgn);
1421 Lst_Destroy(members, NOFREE);
1428 * Now the source is expanded, remove it from the list of children to
1429 * keep it from being processed.
1431 ln = Lst_Member(pgn->children, (void *)cgn);
1433 Lst_Remove(pgn->children, ln);
1434 DEBUGF(SUFF, ("\n"));
1435 } else if (Dir_HasWildcards(cgn->name)) {
1436 Lst exp; /* List of expansions */
1437 Lst path; /* Search path along which to expand */
1440 * Find a path along which to expand the word.
1442 * If the word has a known suffix, use that path.
1443 * If it has no known suffix and we're allowed to use the null
1444 * suffix, use its path.
1445 * Else use the default system search path.
1447 cp = cgn->name + strlen(cgn->name);
1448 ln = Lst_Find(sufflist, (void *)cp, SuffSuffIsSuffixP);
1450 DEBUGF(SUFF, ("Wildcard expanding \"%s\"...", cgn->name));
1453 Suff *s = (Suff *)Lst_Datum(ln);
1455 DEBUGF(SUFF, ("suffix is \"%s\"...", s->name));
1456 path = s->searchPath;
1459 * Use default search path
1461 path = dirSearchPath;
1465 * Expand the word along the chosen path
1467 exp = Lst_Init(FALSE);
1468 Dir_Expand(cgn->name, path, exp);
1470 while (!Lst_IsEmpty(exp)) {
1472 * Fetch next expansion off the list and find its GNode
1474 cp = (char *)Lst_DeQueue(exp);
1476 DEBUGF(SUFF, ("%s...", cp));
1477 gn = Targ_FindNode(cp, TARG_CREATE);
1480 * If gn isn't already a child of the parent, make it so and
1481 * up the parent's count of unmade children.
1483 if (Lst_Member(pgn->children, (void *)gn) == NULL) {
1484 (void)Lst_Append(pgn->children, prevLN, (void *)gn);
1485 prevLN = Lst_Succ(prevLN);
1486 (void)Lst_AtEnd(gn->parents, (void *)pgn);
1492 * Nuke what's left of the list
1494 Lst_Destroy(exp, NOFREE);
1497 * Now the source is expanded, remove it from the list of children to
1498 * keep it from being processed.
1500 ln = Lst_Member(pgn->children, (void *)cgn);
1502 Lst_Remove(pgn->children, ln);
1503 DEBUGF(SUFF, ("\n"));
1510 *-----------------------------------------------------------------------
1511 * SuffApplyTransform --
1512 * Apply a transformation rule, given the source and target nodes
1516 * TRUE if successful, FALSE if not.
1519 * The source and target are linked and the commands from the
1520 * transformation are added to the target node's commands list.
1521 * All attributes but OP_DEPMASK and OP_TRANSFORM are applied
1522 * to the target. The target also inherits all the sources for
1523 * the transformation rule.
1525 *-----------------------------------------------------------------------
1528 SuffApplyTransform(tGn, sGn, t, s)
1529 GNode *tGn; /* Target node */
1530 GNode *sGn; /* Source node */
1531 Suff *t; /* Target suffix */
1532 Suff *s; /* Source suffix */
1534 LstNode ln; /* General node */
1535 char *tname; /* Name of transformation rule */
1536 GNode *gn; /* Node for same */
1538 if (Lst_Member(tGn->children, (void *)sGn) == NULL) {
1540 * Not already linked, so form the proper links between the
1541 * target and source.
1543 (void)Lst_AtEnd(tGn->children, (void *)sGn);
1544 (void)Lst_AtEnd(sGn->parents, (void *)tGn);
1548 if ((sGn->type & OP_OPMASK) == OP_DOUBLEDEP) {
1550 * When a :: node is used as the implied source of a node, we have
1551 * to link all its cohorts in as sources as well. Only the initial
1552 * sGn gets the target in its iParents list, however, as that
1553 * will be sufficient to get the .IMPSRC variable set for tGn
1555 for (ln=Lst_First(sGn->cohorts); ln != NULL; ln=Lst_Succ(ln)) {
1556 gn = (GNode *)Lst_Datum(ln);
1558 if (Lst_Member(tGn->children, (void *)gn) == NULL) {
1560 * Not already linked, so form the proper links between the
1561 * target and source.
1563 (void)Lst_AtEnd(tGn->children, (void *)gn);
1564 (void)Lst_AtEnd(gn->parents, (void *)tGn);
1570 * Locate the transformation rule itself
1572 tname = str_concat(s->name, t->name, 0);
1573 ln = Lst_Find(transforms, (void *)tname, SuffGNHasNameP);
1578 * Not really such a transformation rule (can happen when we're
1579 * called to link an OP_MEMBER and OP_ARCHV node), so return
1585 gn = (GNode *)Lst_Datum(ln);
1587 DEBUGF(SUFF, ("\tapplying %s -> %s to \"%s\"\n", s->name, t->name, tGn->name));
1590 * Record last child for expansion purposes
1592 ln = Lst_Last(tGn->children);
1595 * Pass the buck to Make_HandleUse to apply the rule
1597 (void)Make_HandleUse(gn, tGn);
1600 * Deal with wildcards and variables in any acquired sources
1604 Lst_ForEachFrom(tGn->children, ln,
1605 SuffExpandChildren, (void *)tGn);
1609 * Keep track of another parent to which this beast is transformed so
1610 * the .IMPSRC variable can be set correctly for the parent.
1612 (void)Lst_AtEnd(sGn->iParents, (void *)tGn);
1619 *-----------------------------------------------------------------------
1620 * SuffFindArchiveDeps --
1621 * Locate dependencies for an OP_ARCHV node.
1627 * Same as Suff_FindDeps
1629 *-----------------------------------------------------------------------
1632 SuffFindArchiveDeps(gn, slst)
1633 GNode *gn; /* Node for which to locate dependencies */
1636 char *eoarch; /* End of archive portion */
1637 char *eoname; /* End of member portion */
1638 GNode *mem; /* Node for member */
1639 static char *copy[] = { /* Variables to be copied from the member node */
1640 TARGET, /* Must be first */
1641 PREFIX, /* Must be second */
1643 int i; /* Index into copy and vals */
1644 Suff *ms; /* Suffix descriptor for member */
1645 char *name; /* Start of member's name */
1648 * The node is an archive(member) pair. so we must find a
1649 * suffix for both of them.
1651 eoarch = strchr (gn->name, '(');
1652 eoname = strchr (eoarch, ')');
1654 *eoname = '\0'; /* Nuke parentheses during suffix search */
1655 *eoarch = '\0'; /* So a suffix can be found */
1660 * To simplify things, call Suff_FindDeps recursively on the member now,
1661 * so we can simply compare the member's .PREFIX and .TARGET variables
1662 * to locate its suffix. This allows us to figure out the suffix to
1663 * use for the archive without having to do a quadratic search over the
1664 * suffix list, backtracking for each one...
1666 mem = Targ_FindNode(name, TARG_CREATE);
1667 SuffFindDeps(mem, slst);
1670 * Create the link between the two nodes right off
1672 if (Lst_Member(gn->children, (void *)mem) == NULL) {
1673 (void)Lst_AtEnd(gn->children, (void *)mem);
1674 (void)Lst_AtEnd(mem->parents, (void *)gn);
1679 * Copy in the variables from the member node to this one.
1681 for (i = (sizeof(copy)/sizeof(copy[0]))-1; i >= 0; i--) {
1683 Var_Set(copy[i], Var_Value(copy[i], mem, &p1), gn);
1691 * Didn't know what it was -- use .NULL suffix if not in make mode
1693 DEBUGF(SUFF, ("using null suffix\n"));
1699 * Set the other two local variables required for this target.
1701 Var_Set (MEMBER, name, gn);
1702 Var_Set (ARCHIVE, gn->name, gn);
1706 * Member has a known suffix, so look for a transformation rule from
1707 * it to a possible suffix of the archive. Rather than searching
1708 * through the entire list, we just look at suffixes to which the
1709 * member's suffix may be transformed...
1714 * Use first matching suffix...
1716 ln = Lst_Find(ms->parents, eoarch, SuffSuffIsSuffixP);
1720 * Got one -- apply it
1722 if (!SuffApplyTransform(gn, mem, (Suff *)Lst_Datum(ln), ms)) {
1723 DEBUGF(SUFF, ("\tNo transformation from %s -> %s\n",
1724 ms->name, ((Suff *)Lst_Datum(ln))->name));
1730 * Replace the opening and closing parens now we've no need of the separate
1733 *eoarch = '('; *eoname = ')';
1736 * Pretend gn appeared to the left of a dependency operator so
1737 * the user needn't provide a transformation from the member to the
1740 if (OP_NOP(gn->type)) {
1741 gn->type |= OP_DEPENDS;
1745 * Flag the member as such so we remember to look in the archive for
1746 * its modification time.
1748 mem->type |= OP_MEMBER;
1752 *-----------------------------------------------------------------------
1753 * SuffFindNormalDeps --
1754 * Locate implicit dependencies for regular targets.
1760 * Same as Suff_FindDeps...
1762 *-----------------------------------------------------------------------
1765 SuffFindNormalDeps(gn, slst)
1766 GNode *gn; /* Node for which to find sources */
1769 char *eoname; /* End of name */
1770 char *sopref; /* Start of prefix */
1771 LstNode ln; /* Next suffix node to check */
1772 Lst srcs; /* List of sources at which to look */
1773 Lst targs; /* List of targets to which things can be
1774 * transformed. They all have the same file,
1775 * but different suff and pref fields */
1776 Src *bottom; /* Start of found transformation path */
1777 Src *src; /* General Src pointer */
1778 char *pref; /* Prefix to use */
1779 Src *targ; /* General Src target pointer */
1782 eoname = gn->name + strlen(gn->name);
1787 * Begin at the beginning...
1789 ln = Lst_First(sufflist);
1790 srcs = Lst_Init(FALSE);
1791 targs = Lst_Init(FALSE);
1794 * We're caught in a catch-22 here. On the one hand, we want to use any
1795 * transformation implied by the target's sources, but we can't examine
1796 * the sources until we've expanded any variables/wildcards they may hold,
1797 * and we can't do that until we've set up the target's local variables
1798 * and we can't do that until we know what the proper suffix for the
1799 * target is (in case there are two suffixes one of which is a suffix of
1800 * the other) and we can't know that until we've found its implied
1801 * source, which we may not want to use if there's an existing source
1802 * that implies a different transformation.
1804 * In an attempt to get around this, which may not work all the time,
1805 * but should work most of the time, we look for implied sources first,
1806 * checking transformations to all possible suffixes of the target,
1807 * use what we find to set the target's local variables, expand the
1808 * children, then look for any overriding transformations they imply.
1809 * Should we find one, we discard the one we found before.
1812 while (ln != NULL) {
1814 * Look for next possible suffix...
1816 ln = Lst_FindFrom(sufflist, ln, eoname, SuffSuffIsSuffixP);
1819 int prefLen; /* Length of the prefix */
1823 * Allocate a Src structure to which things can be transformed
1825 targ = (Src *)emalloc(sizeof (Src));
1826 targ->file = estrdup(gn->name);
1827 targ->suff = (Suff *)Lst_Datum(ln);
1828 targ->suff->refCount++;
1830 targ->parent = (Src *)NULL;
1833 targ->cp = Lst_Init(FALSE);
1837 * Allocate room for the prefix, whose end is found by subtracting
1838 * the length of the suffix from the end of the name.
1840 prefLen = (eoname - targ->suff->nameLen) - sopref;
1841 targ->pref = emalloc(prefLen + 1);
1842 memcpy(targ->pref, sopref, prefLen);
1843 targ->pref[prefLen] = '\0';
1846 * Add nodes from which the target can be made
1848 SuffAddLevel(srcs, targ);
1851 * Record the target so we can nuke it
1853 (void)Lst_AtEnd(targs, (void *)targ);
1856 * Search from this suffix's successor...
1863 * Handle target of unknown suffix...
1865 if (Lst_IsEmpty(targs) && suffNull != NULL) {
1866 DEBUGF(SUFF, ("\tNo known suffix on %s. Using .NULL suffix\n", gn->name));
1868 targ = (Src *)emalloc(sizeof (Src));
1869 targ->file = estrdup(gn->name);
1870 targ->suff = suffNull;
1871 targ->suff->refCount++;
1873 targ->parent = (Src *)NULL;
1875 targ->pref = estrdup(sopref);
1877 targ->cp = Lst_Init(FALSE);
1881 * Only use the default suffix rules if we don't have commands
1882 * or dependencies defined for this gnode
1884 if (Lst_IsEmpty(gn->commands) && Lst_IsEmpty(gn->children))
1885 SuffAddLevel(srcs, targ);
1887 DEBUGF(SUFF, ("not "));
1890 DEBUGF(SUFF, ("adding suffix rules\n"));
1892 (void)Lst_AtEnd(targs, (void *)targ);
1896 * Using the list of possible sources built up from the target suffix(es),
1897 * try and find an existing file/target that matches.
1899 bottom = SuffFindThem(srcs, slst);
1901 if (bottom == (Src *)NULL) {
1903 * No known transformations -- use the first suffix found for setting
1904 * the local variables.
1906 if (!Lst_IsEmpty(targs)) {
1907 targ = (Src *)Lst_Datum(Lst_First(targs));
1913 * Work up the transformation path to find the suffix of the
1914 * target to which the transformation was made.
1916 for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1921 * The .TARGET variable we always set to be the name at this point,
1922 * since it's only set to the path if the thing is only a source and
1923 * if it's only a source, it doesn't matter what we put here as far
1924 * as expanding sources is concerned, since it has none...
1926 Var_Set(TARGET, gn->name, gn);
1928 pref = (targ != NULL) ? targ->pref : gn->name;
1929 Var_Set(PREFIX, pref, gn);
1932 * Now we've got the important local variables set, expand any sources
1933 * that still contain variables or wildcards in their names.
1935 Lst_ForEach(gn->children, SuffExpandChildren, (void *)gn);
1938 DEBUGF(SUFF, ("\tNo valid suffix on %s\n", gn->name));
1942 * Deal with finding the thing on the default search path if the
1943 * node is only a source (not on the lhs of a dependency operator
1944 * or [XXX] it has neither children or commands).
1946 if (OP_NOP(gn->type) ||
1947 (Lst_IsEmpty(gn->children) && Lst_IsEmpty(gn->commands)))
1949 gn->path = Dir_FindFile(gn->name,
1950 (targ == NULL ? dirSearchPath :
1951 targ->suff->searchPath));
1952 if (gn->path != NULL) {
1954 Var_Set(TARGET, gn->path, gn);
1958 * Suffix known for the thing -- trim the suffix off
1959 * the path to form the proper .PREFIX variable.
1961 int savep = strlen(gn->path) - targ->suff->nameLen;
1965 gn->suffix->refCount--;
1966 gn->suffix = targ->suff;
1967 gn->suffix->refCount++;
1969 savec = gn->path[savep];
1970 gn->path[savep] = '\0';
1972 if ((ptr = strrchr(gn->path, '/')) != NULL)
1977 Var_Set(PREFIX, ptr, gn);
1979 gn->path[savep] = savec;
1982 * The .PREFIX gets the full path if the target has
1986 gn->suffix->refCount--;
1989 if ((ptr = strrchr(gn->path, '/')) != NULL)
1994 Var_Set(PREFIX, ptr, gn);
1999 * Not appropriate to search for the thing -- set the
2000 * path to be the name so Dir_MTime won't go grovelling for
2004 gn->suffix->refCount--;
2005 gn->suffix = (targ == NULL) ? NULL : targ->suff;
2007 gn->suffix->refCount++;
2009 gn->path = estrdup(gn->name);
2016 * If the suffix indicates that the target is a library, mark that in
2017 * the node's type field.
2019 if (targ->suff->flags & SUFF_LIBRARY) {
2024 * Check for overriding transformation rule implied by sources
2026 if (!Lst_IsEmpty(gn->children)) {
2027 src = SuffFindCmds(targ, slst);
2029 if (src != (Src *)NULL) {
2031 * Free up all the Src structures in the transformation path
2032 * up to, but not including, the parent node.
2034 while (bottom && bottom->parent != NULL) {
2035 if (Lst_Member(slst, (void *) bottom) == NULL) {
2036 Lst_AtEnd(slst, (void *) bottom);
2038 bottom = bottom->parent;
2044 if (bottom == NULL) {
2046 * No idea from where it can come -- return now.
2052 * We now have a list of Src structures headed by 'bottom' and linked via
2053 * their 'parent' pointers. What we do next is create links between
2054 * source and target nodes (which may or may not have been created)
2055 * and set the necessary local variables in each target. The
2056 * commands for each target are set from the commands of the
2057 * transformation rule used to get from the src suffix to the targ
2058 * suffix. Note that this causes the commands list of the original
2059 * node, gn, to be replaced by the commands of the final
2060 * transformation rule. Also, the unmade field of gn is incremented.
2063 if (bottom->node == NULL) {
2064 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE);
2067 for (src = bottom; src->parent != (Src *)NULL; src = src->parent) {
2070 if (src->node->suffix)
2071 src->node->suffix->refCount--;
2072 src->node->suffix = src->suff;
2073 src->node->suffix->refCount++;
2075 if (targ->node == NULL) {
2076 targ->node = Targ_FindNode(targ->file, TARG_CREATE);
2079 SuffApplyTransform(targ->node, src->node,
2080 targ->suff, src->suff);
2082 if (targ->node != gn) {
2084 * Finish off the dependency-search process for any nodes
2085 * between bottom and gn (no point in questing around the
2086 * filesystem for their implicit source when it's already
2087 * known). Note that the node can't have any sources that
2088 * need expanding, since SuffFindThem will stop on an existing
2089 * node, so all we need to do is set the standard and System V
2092 targ->node->type |= OP_DEPS_FOUND;
2094 Var_Set(PREFIX, targ->pref, targ->node);
2096 Var_Set(TARGET, targ->node->name, targ->node);
2101 gn->suffix->refCount--;
2102 gn->suffix = src->suff;
2103 gn->suffix->refCount++;
2106 * So Dir_MTime doesn't go questing for it...
2109 gn->path = estrdup(gn->name);
2112 * Nuke the transformation path and the Src structures left over in the
2117 if (Lst_Member(slst, (void *) bottom) == NULL)
2118 Lst_AtEnd(slst, (void *) bottom);
2120 while (SuffRemoveSrc(srcs) || SuffRemoveSrc(targs))
2123 Lst_Concat(slst, srcs, LST_CONCLINK);
2124 Lst_Concat(slst, targs, LST_CONCLINK);
2129 *-----------------------------------------------------------------------
2131 * Find implicit sources for the target described by the graph node
2138 * Nodes are added to the graph below the passed-in node. The nodes
2139 * are marked to have their IMPSRC variable filled in. The
2140 * PREFIX variable is set for the given node and all its
2144 * The path found by this target is the shortest path in the
2145 * transformation graph, which may pass through non-existent targets,
2146 * to an existing target. The search continues on all paths from the
2147 * root suffix until a file is found. I.e. if there's a path
2148 * .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
2149 * the .c and .l files don't, the search will branch out in
2150 * all directions from .o and again from all the nodes on the
2151 * next level until the .l,v node is encountered.
2153 *-----------------------------------------------------------------------
2161 SuffFindDeps(gn, srclist);
2162 while (SuffRemoveSrc(srclist))
2168 SuffFindDeps (gn, slst)
2169 GNode *gn; /* node we're dealing with */
2172 if (gn->type & OP_DEPS_FOUND) {
2174 * If dependencies already found, no need to do it again...
2178 gn->type |= OP_DEPS_FOUND;
2181 DEBUGF(SUFF, ("SuffFindDeps (%s)\n", gn->name));
2183 if (gn->type & OP_ARCHV) {
2184 SuffFindArchiveDeps(gn, slst);
2185 } else if (gn->type & OP_LIB) {
2187 * If the node is a library, it is the arch module's job to find it
2188 * and set the TARGET variable accordingly. We merely provide the
2189 * search path, assuming all libraries end in ".a" (if the suffix
2190 * hasn't been defined, there's nothing we can do for it, so we just
2191 * set the TARGET variable to the node's name in order to give it a
2197 ln = Lst_Find (sufflist, (void *)LIBSUFF, SuffSuffHasNameP);
2199 gn->suffix->refCount--;
2201 gn->suffix = s = (Suff *) Lst_Datum (ln);
2202 gn->suffix->refCount++;
2203 Arch_FindLib (gn, s->searchPath);
2206 Var_Set (TARGET, gn->name, gn);
2209 * Because a library (-lfoo) target doesn't follow the standard
2210 * filesystem conventions, we don't set the regular variables for
2211 * the thing. .PREFIX is simply made empty...
2213 Var_Set(PREFIX, "", gn);
2215 SuffFindNormalDeps(gn, slst);
2220 *-----------------------------------------------------------------------
2222 * Define which suffix is the null suffix.
2228 * 'suffNull' is altered.
2231 * Need to handle the changing of the null suffix gracefully so the
2232 * old transformation rules don't just go away.
2234 *-----------------------------------------------------------------------
2238 char *name; /* Name of null suffix */
2243 ln = Lst_Find(sufflist, (void *)name, SuffSuffHasNameP);
2245 s = (Suff *)Lst_Datum(ln);
2246 if (suffNull != (Suff *)NULL) {
2247 suffNull->flags &= ~SUFF_NULL;
2249 s->flags |= SUFF_NULL;
2251 * XXX: Here's where the transformation mangling would take place
2255 Parse_Error (PARSE_WARNING, "Desired null suffix %s not defined.",
2261 *-----------------------------------------------------------------------
2263 * Initialize suffixes module
2270 *-----------------------------------------------------------------------
2275 sufflist = Lst_Init (FALSE);
2276 suffClean = Lst_Init(FALSE);
2277 srclist = Lst_Init (FALSE);
2278 transforms = Lst_Init (FALSE);
2282 * Create null suffix for single-suffix rules (POSIX). The thing doesn't
2283 * actually go on the suffix list or everyone will think that's its
2286 emptySuff = suffNull = (Suff *) emalloc (sizeof (Suff));
2288 suffNull->name = estrdup ("");
2289 suffNull->nameLen = 0;
2290 suffNull->searchPath = Lst_Init (FALSE);
2291 Dir_Concat(suffNull->searchPath, dirSearchPath);
2292 suffNull->children = Lst_Init (FALSE);
2293 suffNull->parents = Lst_Init (FALSE);
2294 suffNull->ref = Lst_Init (FALSE);
2295 suffNull->sNum = sNum++;
2296 suffNull->flags = SUFF_NULL;
2297 suffNull->refCount = 1;
2303 *----------------------------------------------------------------------
2305 * Cleanup the this module
2311 * The memory is free'd.
2312 *----------------------------------------------------------------------
2318 Lst_Destroy(sufflist, SuffFree);
2319 Lst_Destroy(suffClean, SuffFree);
2322 Lst_Destroy(srclist, NOFREE);
2323 Lst_Destroy(transforms, NOFREE);
2327 /********************* DEBUGGING FUNCTIONS **********************/
2329 static int SuffPrintName(s, dummy)
2333 printf ("`%s' ", ((Suff *) s)->name);
2334 return (dummy ? 0 : 0);
2338 SuffPrintSuff (sp, dummy)
2342 Suff *s = (Suff *) sp;
2346 printf ("# `%s' [%d] ", s->name, s->refCount);
2350 fputs (" (", stdout);
2352 flag = 1 << (ffs(flags) - 1);
2365 fputc(flags ? '|' : ')', stdout);
2368 fputc ('\n', stdout);
2370 Lst_ForEach (s->parents, SuffPrintName, (void *)0);
2371 fputc ('\n', stdout);
2372 printf ("#\tFrom: ");
2373 Lst_ForEach (s->children, SuffPrintName, (void *)0);
2374 fputc ('\n', stdout);
2375 printf ("#\tSearch Path: ");
2376 Dir_PrintPath (s->searchPath);
2377 fputc ('\n', stdout);
2378 return (dummy ? 0 : 0);
2382 SuffPrintTrans (tp, dummy)
2386 GNode *t = (GNode *) tp;
2388 printf ("%-16s: ", t->name);
2389 Targ_PrintType (t->type);
2390 fputc ('\n', stdout);
2391 Lst_ForEach (t->commands, Targ_PrintCmd, (void *)0);
2392 fputc ('\n', stdout);
2393 return(dummy ? 0 : 0);
2399 printf ("#*** Suffixes:\n");
2400 Lst_ForEach (sufflist, SuffPrintSuff, (void *)0);
2402 printf ("#*** Transformations:\n");
2403 Lst_ForEach (transforms, SuffPrintTrans, (void *)0);