* Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
* Copyright (c) 1988, 1989 by Adam de Boor
* Copyright (c) 1989 by Berkeley Softworks
* This code is derived from software contributed to Berkeley by
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
static char sccsid
[] = "@(#)suff.c 5.6 (Berkeley) 6/1/90";
* Functions to maintain suffix lists and find implicit dependents
* using suffix transformation rules
* Suff_Init Initialize all things to do with suffixes.
* Suff_DoPaths This function is used to make life easier
* when searching for a file according to its
* suffix. It takes the global search path,
* as defined using the .PATH: target, and appends
* its directories to the path of each of the
* defined suffixes, as specified using
* .PATH<suffix>: targets. In addition, all
* directories given for suffixes labeled as
* include files or libraries, using the .INCLUDES
* or .LIBS targets, are played with using
* Dir_MakeFlags to create the .INCLUDES and
* .LIBS global variables.
* Suff_ClearSuffixes Clear out all the suffixes and defined
* Suff_IsTransform Return TRUE if the passed string is the lhs
* of a transformation rule.
* Suff_AddSuffix Add the passed string as another known suffix.
* Suff_GetPath Return the search path for the given suffix.
* Suff_AddInclude Mark the given suffix as denoting an include
* Suff_AddLib Mark the given suffix as denoting a library.
* Suff_AddTransform Add another transformation to the suffix
* graph. Returns GNode suitable for framing, I
* mean, tacking commands, attributes, etc. on.
* Suff_SetNull Define the suffix to consider the suffix of
* any file that doesn't have a known one.
* Suff_FindDeps Find implicit sources for and the location of
* a target based on its suffix. Returns the
* bottom-most node added to the graph or NILGNODE
* if the target had no implicit sources.
static Lst sufflist
; /* Lst of suffixes */
static Lst transforms
; /* Lst of transformation rules */
static int sNum
= 0; /* Counter for assigning suffix numbers */
* Structure describing an individual suffix.
char *name
; /* The suffix itself */
int nameLen
; /* Length of the suffix */
short flags
; /* Type of suffix */
#define SUFF_INCLUDE 0x01 /* One which is #include'd */
#define SUFF_LIBRARY 0x02 /* One which contains a library */
#define SUFF_NULL 0x04 /* The empty suffix */
Lst searchPath
; /* The path along which files of this suffix
int sNum
; /* The suffix number */
Lst parents
; /* Suffixes we have a transformation to */
Lst children
; /* Suffixes we have a transformation from */
* Structure used in the search for implied sources.
char *file
; /* The file to look for */
char *pref
; /* Prefix from which file was formed */
Suff
*suff
; /* The suffix on the file */
struct _Src
*parent
; /* The Src for which this is a source */
GNode
*node
; /* The node describing the file */
int children
; /* Count of existing children (so we don't free
* this thing too early or never nuke it) */
static Suff
*suffNull
; /* The NULL suffix for this run */
static Suff
*emptySuff
; /* The empty suffix required for POSIX
* single-suffix transformation rules */
/*************** Lst Predicates ****************/
*-----------------------------------------------------------------------
* See if pref is a prefix of str.
* NULL if it ain't, pointer to character in str after prefix if so
*-----------------------------------------------------------------------
SuffStrIsPrefix (pref
, str
)
register char *pref
; /* possible prefix */
register char *str
; /* string to check */
while (*str
&& *pref
== *str
) {
return (*pref
? NULL
: str
);
*-----------------------------------------------------------------------
* See if suff is a suffix of str. Str should point to THE END of the
* string to check. (THE END == the null byte)
* NULL if it ain't, pointer to character in str before suffix if
*-----------------------------------------------------------------------
SuffSuffIsSuffix (s
, str
)
register Suff
*s
; /* possible suffix */
char *str
; /* string to examine */
register char *p1
; /* Pointer into suffix name */
register char *p2
; /* Pointer into string being examined */
p1
= s
->name
+ s
->nameLen
;
while (p1
>= s
->name
&& *p1
== *p2
) {
return (p1
== s
->name
- 1 ? p2
: NULL
);
*-----------------------------------------------------------------------
* Predicate form of SuffSuffIsSuffix. Passed as the callback function
* 0 if the suffix is the one desired, non-zero if not.
*-----------------------------------------------------------------------
SuffSuffIsSuffixP(s
, str
)
return(!SuffSuffIsSuffix(s
, str
));
*-----------------------------------------------------------------------
* Callback procedure for finding a suffix based on its name. Used by
* 0 if the suffix is of the given name. non-zero otherwise.
*-----------------------------------------------------------------------
SuffSuffHasNameP (s
, sname
)
Suff
*s
; /* Suffix to check */
char *sname
; /* Desired name */
return (strcmp (sname
, s
->name
));
*-----------------------------------------------------------------------
* See if the suffix described by s is a prefix of the string. Care
* must be taken when using this to search for transformations and
* what-not, since there could well be two suffixes, one of which
* is a prefix of the other...
* 0 if s is a prefix of str. non-zero otherwise
*-----------------------------------------------------------------------
SuffSuffIsPrefix (s
, str
)
Suff
*s
; /* suffix to compare */
char *str
; /* string to examine */
return (SuffStrIsPrefix (s
->name
, str
) == NULL
? 1 : 0);
*-----------------------------------------------------------------------
* See if the graph node has the desired name
* 0 if it does. non-zero if it doesn't
*-----------------------------------------------------------------------
SuffGNHasNameP (gn
, name
)
GNode
*gn
; /* current node we're looking at */
char *name
; /* name we're looking for */
return (strcmp (name
, gn
->name
));
/*********** Maintenance Functions ************/
*-----------------------------------------------------------------------
* Free up all memory associated with the given suffix structure.
* the suffix entry is detroyed
*-----------------------------------------------------------------------
Lst_Destroy (s
->children
, NOFREE
);
Lst_Destroy (s
->parents
, NOFREE
);
Lst_Destroy (s
->searchPath
, Dir_Destroy
);
*-----------------------------------------------------------------------
* Insert the suffix into the list keeping the list ordered by suffix
*-----------------------------------------------------------------------
Lst l
; /* the list where in s should be inserted */
Suff
*s
; /* the suffix to insert */
LstNode ln
; /* current element in l we're examining */
Suff
*s2
; /* the suffix descriptor in this element */
if (Lst_Open (l
) == FAILURE
) {
while ((ln
= Lst_Next (l
)) != NILLNODE
) {
s2
= (Suff
*) Lst_Datum (ln
);
if (s2
->sNum
>= s
->sNum
) {
printf("inserting %s(%d)...", s
->name
, s
->sNum
);
printf("at end of list\n");
(void)Lst_AtEnd (l
, (ClientData
)s
);
} else if (s2
->sNum
!= s
->sNum
) {
printf("before %s(%d)\n", s2
->name
, s2
->sNum
);
(void)Lst_Insert (l
, ln
, (ClientData
)s
);
} else if (DEBUG(SUFF
)) {
printf("already there\n");
*-----------------------------------------------------------------------
* This is gross. Nuke the list of suffixes but keep all transformation
* rules around. The transformation graph is destroyed in this process,
* but we leave the list of rules so when a new graph is formed the rules
* This function is called from the parse module when a
* .SUFFIXES:\n line is encountered.
* the sufflist and its graph nodes are destroyed
*-----------------------------------------------------------------------
Lst_Destroy (sufflist
, SuffFree
);
sufflist
= Lst_Init(FALSE
);
*-----------------------------------------------------------------------
* Parse a transformation string to find its two component suffixes.
* TRUE if the string is a valid transformation and FALSE otherwise.
* The passed pointers are overwritten.
*-----------------------------------------------------------------------
SuffParseTransform(str
, srcPtr
, targPtr
)
char *str
; /* String being parsed */
Suff
**srcPtr
; /* Place to store source of trans. */
Suff
**targPtr
; /* Place to store target of trans. */
register LstNode srcLn
; /* element in suffix list of trans source*/
register Suff
*src
; /* Source of transformation */
register LstNode targLn
; /* element in suffix list of trans target*/
register char *str2
; /* Extra pointer (maybe target suffix) */
LstNode singleLn
; /* element in suffix list of any suffix
* that exactly matches str */
Suff
*single
; /* Source of possible transformation to
* Loop looking first for a suffix that matches the start of the
* string and then for one that exactly matches the rest of it. If
* we can find two that meet these criteria, we've successfully
srcLn
= Lst_Find(sufflist
, (ClientData
)str
, SuffSuffIsPrefix
);
srcLn
= Lst_FindFrom (sufflist
, Lst_Succ(srcLn
), (ClientData
)str
,
* Ran out of source suffixes -- no such rule
if (singleLn
!= NILLNODE
) {
* Not so fast Mr. Smith! There was a suffix that encompassed
* the entire string, so we assume it was a transformation
* to the null suffix (thank you POSIX). We still prefer to
* find a double rule over a singleton, hence we leave this
* XXX: Use emptySuff over suffNull?
src
= (Suff
*) Lst_Datum (srcLn
);
str2
= str
+ src
->nameLen
;
targLn
= Lst_Find(sufflist
, (ClientData
)str2
, SuffSuffHasNameP
);
if (targLn
!= NILLNODE
) {
*targPtr
= (Suff
*)Lst_Datum(targLn
);
*-----------------------------------------------------------------------
* Return TRUE if the given string is a transformation rule
* TRUE if the string is a concatenation of two known suffixes.
*-----------------------------------------------------------------------
char *str
; /* string to check */
return (SuffParseTransform(str
, &src
, &targ
));
*-----------------------------------------------------------------------
* Add the transformation rule described by the line to the
* list of rules and place the transformation itself in the graph
* The node created for the transformation in the transforms list
* The node is placed on the end of the transforms Lst and links are
* made between the two suffixes mentioned in the target name
*-----------------------------------------------------------------------
char *line
; /* name of transformation to add */
GNode
*gn
; /* GNode of transformation rule */
Suff
*s
, /* source suffix */
LstNode ln
; /* Node for existing transformation */
ln
= Lst_Find (transforms
, (ClientData
)line
, SuffGNHasNameP
);
* Make a new graph node for the transformation. It will be filled in
(void)Lst_AtEnd (transforms
, (ClientData
)gn
);
* New specification for transformation rule. Just nuke the old list
* of commands so they can be filled in again... We don't actually
* free the commands themselves, because a given command can be
* attached to several different transformations.
gn
= (GNode
*) Lst_Datum (ln
);
Lst_Destroy (gn
->commands
, NOFREE
);
Lst_Destroy (gn
->children
, NOFREE
);
gn
->commands
= Lst_Init (FALSE
);
gn
->children
= Lst_Init (FALSE
);
(void)SuffParseTransform(line
, &s
, &t
);
* link the two together in the proper relationship and order
printf("defining transformation from `%s' to `%s'\n",
SuffInsert (t
->children
, s
);
SuffInsert (s
->parents
, t
);
*-----------------------------------------------------------------------
* Handle the finish of a transformation definition, removing the
* transformation from the graph if it has neither commands nor
* sources. This is a callback procedure for the Parse module via
* If the node has no commands or children, the children and parents
* lists of the affected suffices are altered.
*-----------------------------------------------------------------------
GNode
*gn
; /* Node for transformation */
if ((gn
->type
& OP_TRANSFORM
) && Lst_IsEmpty(gn
->commands
) &&
Lst_IsEmpty(gn
->children
))
(void)SuffParseTransform(gn
->name
, &s
, &t
);
printf("deleting transformation from %s to %s\n",
* Remove the source from the target's children list. We check for a
* nil return to handle a beanhead saying something like
* We'll be called twice when the next target is seen, but .c and .o
* are only linked once...
ln
= Lst_Member(t
->children
, (ClientData
)s
);
(void)Lst_Remove(t
->children
, ln
);
* Remove the target from the source's parents list
ln
= Lst_Member(s
->parents
, (ClientData
)t
);
(void)Lst_Remove(s
->parents
, ln
);
} else if ((gn
->type
& OP_TRANSFORM
) && DEBUG(SUFF
)) {
printf("transformation %s complete\n", gn
->name
);
*-----------------------------------------------------------------------
* Called from Suff_AddSuffix via Lst_ForEach to search through the
* list of existing transformation rules and rebuild the transformation
* graph when it has been destroyed by Suff_ClearSuffixes. If the
* given rule is a transformation involving this suffix and another,
* existing suffix, the proper relationship is established between
* The appropriate links will be made between this suffix and
* others if transformation rules exist for it.
*-----------------------------------------------------------------------
SuffRebuildGraph(transform
, s
)
GNode
*transform
; /* Transformation to test */
Suff
*s
; /* Suffix to rebuild */
* First see if it is a transformation from this suffix.
cp
= SuffStrIsPrefix(s
->name
, transform
->name
);
if (cp
!= (char *)NULL
) {
ln
= Lst_Find(sufflist
, (ClientData
)cp
, SuffSuffHasNameP
);
* Found target. Link in and return, since it can't be anything
s2
= (Suff
*)Lst_Datum(ln
);
SuffInsert(s2
->children
, s
);
SuffInsert(s
->parents
, s2
);
cp
= SuffSuffIsSuffix(s
, transform
->name
+ strlen(transform
->name
));
if (cp
!= (char *)NULL
) {
* Null-terminate the source suffix in order to find it.
ln
= Lst_Find(sufflist
, (ClientData
)transform
->name
, SuffSuffHasNameP
);
* Replace the start of the target suffix
* Found it -- establish the proper relationship
s2
= (Suff
*)Lst_Datum(ln
);
SuffInsert(s
->children
, s2
);
SuffInsert(s2
->parents
, s
);
*-----------------------------------------------------------------------
* Add the suffix in string to the end of the list of known suffixes.
* Should we restructure the suffix graph? Make doesn't...
* A GNode is created for the suffix and a Suff structure is created and
* added to the suffixes list unless the suffix was already known.
*-----------------------------------------------------------------------
char *str
; /* the name of the suffix to add */
Suff
*s
; /* new suffix descriptor */
ln
= Lst_Find (sufflist
, (ClientData
)str
, SuffSuffHasNameP
);
s
= (Suff
*) emalloc (sizeof (Suff
));
s
->nameLen
= strlen (s
->name
);
s
->searchPath
= Lst_Init (FALSE
);
s
->children
= Lst_Init (FALSE
);
s
->parents
= Lst_Init (FALSE
);
(void)Lst_AtEnd (sufflist
, (ClientData
)s
);
* Look for any existing transformations from or to this suffix.
* XXX: Only do this after a Suff_ClearSuffixes?
Lst_ForEach (transforms
, SuffRebuildGraph
, (ClientData
)s
);
*-----------------------------------------------------------------------
* Return the search path for the given suffix, if it's defined.
* The searchPath for the desired suffix or NILLST if the suffix isn't
*-----------------------------------------------------------------------
ln
= Lst_Find (sufflist
, (ClientData
)sname
, SuffSuffHasNameP
);
s
= (Suff
*) Lst_Datum (ln
);
*-----------------------------------------------------------------------
* Extend the search paths for all suffixes to include the default
* The searchPath field of all the suffixes is extended by the
* directories in dirSearchPath. If paths were specified for the
* ".h" suffix, the directories are stuffed into a global variable
* called ".INCLUDES" with each directory preceeded by a -I. The same
* is done for the ".a" suffix, except the variable is called
* ".LIBS" and the flag is -L.
*-----------------------------------------------------------------------
Lst inIncludes
; /* Cumulative .INCLUDES path */
Lst inLibs
; /* Cumulative .LIBS path */
if (Lst_Open (sufflist
) == FAILURE
) {
inIncludes
= Lst_Init(FALSE
);
inLibs
= Lst_Init(FALSE
);
while ((ln
= Lst_Next (sufflist
)) != NILLNODE
) {
s
= (Suff
*) Lst_Datum (ln
);
if (!Lst_IsEmpty (s
->searchPath
)) {
if (s
->flags
& SUFF_INCLUDE
) {
Dir_Concat(inIncludes
, s
->searchPath
);
if (s
->flags
& SUFF_LIBRARY
) {
Dir_Concat(inLibs
, s
->searchPath
);
Dir_Concat(s
->searchPath
, dirSearchPath
);
Lst_Destroy (s
->searchPath
, Dir_Destroy
);
s
->searchPath
= Lst_Duplicate(dirSearchPath
, Dir_CopyDir
);
Var_Set(".INCLUDES", Dir_MakeFlags("-I", inIncludes
), VAR_GLOBAL
);
Var_Set(".LIBS", Dir_MakeFlags("-L", inLibs
), VAR_GLOBAL
);
Lst_Destroy(inIncludes
, Dir_Destroy
);
Lst_Destroy(inLibs
, Dir_Destroy
);
*-----------------------------------------------------------------------
* Add the given suffix as a type of file which gets included.
* Called from the parse module when a .INCLUDES line is parsed.
* The suffix must have already been defined.
* The SUFF_INCLUDE bit is set in the suffix's flags field
*-----------------------------------------------------------------------
char *sname
; /* Name of suffix to mark */
ln
= Lst_Find (sufflist
, (ClientData
)sname
, SuffSuffHasNameP
);
s
= (Suff
*) Lst_Datum (ln
);
s
->flags
|= SUFF_INCLUDE
;
*-----------------------------------------------------------------------
* Add the given suffix as a type of file which is a library.
* Called from the parse module when parsing a .LIBS line. The
* suffix must have been defined via .SUFFIXES before this is
* The SUFF_LIBRARY bit is set in the suffix's flags field
*-----------------------------------------------------------------------
char *sname
; /* Name of suffix to mark */
ln
= Lst_Find (sufflist
, (ClientData
)sname
, SuffSuffHasNameP
);
s
= (Suff
*) Lst_Datum (ln
);
s
->flags
|= SUFF_LIBRARY
;
/********** Implicit Source Search Functions *********/
* A structure for passing more than one argument to the Lst-library-invoked
*-----------------------------------------------------------------------
* Add a suffix as a Src structure to the given list with its parent
* being the given Src structure. If the suffix is the null suffix,
* the prefix is used unaltered as the file name in the Src structure.
* A Src structure is created and tacked onto the end of the list
*-----------------------------------------------------------------------
Suff
*s
; /* suffix for which to create a Src structure */
LstSrc
*ls
; /* list and parent for the new Src */
Src
*s2
; /* new Src structure */
Src
*targ
; /* Target structure */
if ((s
->flags
& SUFF_NULL
) && (*s
->name
!= '\0')) {
* If the suffix has been marked as the NULL suffix, also create a Src
* structure for a file with no suffix attached. Two birds, and all
s2
= (Src
*) emalloc (sizeof (Src
));
s2
->file
= strdup(targ
->pref
);
(void)Lst_AtEnd (ls
->l
, (ClientData
)s2
);
s2
= (Src
*) emalloc (sizeof (Src
));
s2
->file
= str_concat (targ
->pref
, s
->name
, 0);
(void)Lst_AtEnd (ls
->l
, (ClientData
)s2
);
*-----------------------------------------------------------------------
* Add all the children of targ as Src structures to the given list
* Lots of structures are created and added to the list
*-----------------------------------------------------------------------
Lst l
; /* list to which to add the new level */
Src
*targ
; /* Src structure to use as the parent */
Lst_ForEach (targ
->suff
->children
, SuffAddSrc
, (ClientData
)&ls
);
*----------------------------------------------------------------------
* Free all memory associated with a Src structure
*----------------------------------------------------------------------
} else if (--s
->parent
->children
== 0 && s
->parent
->parent
) {
* Parent has no more children, now we're gone, and it's not
* at the top of the tree, so blow it away too.
*-----------------------------------------------------------------------
* Find the first existing file/target in the list srcs
* The lowest structure in the chain of transformations
*-----------------------------------------------------------------------
Lst srcs
; /* list of Src structures to search through */
Src
*s
; /* current Src */
Src
*rs
; /* returned Src */
while (!Lst_IsEmpty (srcs
)) {
s
= (Src
*) Lst_DeQueue (srcs
);
printf ("\ttrying %s...", s
->file
);
* A file is considered to exist if either a node exists in the
* graph for it or the file actually exists.
if ((Targ_FindNode(s
->file
, TARG_NOCREATE
) != NILGNODE
) ||
(Dir_FindFile (s
->file
, s
->suff
->searchPath
) != (char *) NULL
))
*-----------------------------------------------------------------------
* See if any of the children of the target in the Src structure is
* one from which the target can be transformed. If there is one,
* a Src structure is put together for it and returned.
* The Src structure of the "winning" child, or NIL if no such beast.
* A Src structure may be allocated.
*-----------------------------------------------------------------------
Src
*targ
; /* Src structure to play with */
LstNode ln
; /* General-purpose list node */
register GNode
*t
, /* Target GNode */
int prefLen
;/* The length of the defined prefix */
Suff
*suff
; /* Suffix on matching beastie */
Src
*ret
; /* Return value */
(void) Lst_Open (t
->children
);
prefLen
= strlen (targ
->pref
);
while ((ln
= Lst_Next (t
->children
)) != NILLNODE
) {
s
= (GNode
*)Lst_Datum (ln
);
cp
= rindex (s
->name
, '/');
if (cp
== (char *)NULL
) {
if (strncmp (cp
, targ
->pref
, prefLen
) == 0) {
* The node matches the prefix ok, see if it has a known
ln
= Lst_Find (sufflist
, (ClientData
)&cp
[prefLen
],
* It even has a known suffix, see if there's a transformation
* defined between the node's suffix and the target's suffix.
* XXX: Handle multi-stage transformations here, too.
suff
= (Suff
*)Lst_Datum (ln
);
if (Lst_Member (suff
->parents
,
(ClientData
)targ
->suff
) != NILLNODE
)
* Hot Damn! Create a new Src structure to describe
* this transformation (making sure to duplicate the
* source node's name so Suff_FindDeps can free it
* again (ick)), and return the new structure.
ret
= (Src
*)emalloc (sizeof(Src
));
ret
->file
= strdup(s
->name
);
printf ("\tusing existing source %s\n", s
->name
);
*-----------------------------------------------------------------------
* Expand the names of any children of a given node that contain
* variable invocations or file wildcards into actual targets.
* The expanded node is removed from the parent's list of children,
* and the parent's unmade counter is decremented, but other nodes
*-----------------------------------------------------------------------
SuffExpandChildren(cgn
, pgn
)
GNode
*cgn
; /* Child to examine */
GNode
*pgn
; /* Parent node being processed */
GNode
*gn
; /* New source 8) */
LstNode prevLN
; /* Node after which new source should be put */
LstNode ln
; /* List element for old source */
char *cp
; /* Expanded value */
* New nodes effectively take the place of the child, so place them
prevLN
= Lst_Member(pgn
->children
, (ClientData
)cgn
);
* First do variable expansion -- this takes precedence over
* wildcard expansion. If the result contains wildcards, they'll be gotten
* to later since the resulting words are tacked on to the end of
if (index(cgn
->name
, '$') != (char *)NULL
) {
printf("Expanding \"%s\"...", cgn
->name
);
cp
= Var_Subst(cgn
->name
, pgn
, TRUE
);
if (cp
!= (char *)NULL
) {
Lst members
= Lst_Init(FALSE
);
if (cgn
->type
& OP_ARCHV
) {
* Node was an archive(member) target, so we want to call
* on the Arch module to find the nodes for us, expanding
* variables in the parent's context.
(void)Arch_ParseArchive(&sacrifice
, members
, pgn
);
* Break the result into a vector of strings whose nodes
* we can find, then add those nodes to the members list.
* Unfortunately, we can't use brk_string b/c it
* doesn't understand about variable specifications with
char *initcp
= cp
; /* For freeing... */
for (start
= cp
; *start
== ' ' || *start
== '\t'; start
++) {
for (cp
= start
; *cp
!= '\0'; cp
++) {
if (*cp
== ' ' || *cp
== '\t') {
* White-space -- terminate element, find the node,
* add it, skip any further spaces.
gn
= Targ_FindNode(start
, TARG_CREATE
);
(void)Lst_AtEnd(members
, (ClientData
)gn
);
while (*cp
== ' ' || *cp
== '\t') {
* Adjust cp for increment at start of loop, but
* set start to first non-space.
* Start of a variable spec -- contact variable module
* to find the end so we can skip over it.
junk
= Var_Parse(cp
, pgn
, TRUE
, &len
, &doFree
);
} else if (*cp
== '\\' && *cp
!= '\0') {
* Escaped something -- skip over it
* Stuff left over -- add it to the list too
gn
= Targ_FindNode(start
, TARG_CREATE
);
(void)Lst_AtEnd(members
, (ClientData
)gn
);
* Point cp back at the beginning again so the variable value
* Add all elements of the members list to the parent node.
while(!Lst_IsEmpty(members
)) {
gn
= (GNode
*)Lst_DeQueue(members
);
printf("%s...", gn
->name
);
if (Lst_Member(pgn
->children
, (ClientData
)gn
) == NILLNODE
) {
(void)Lst_Append(pgn
->children
, prevLN
, (ClientData
)gn
);
prevLN
= Lst_Succ(prevLN
);
(void)Lst_AtEnd(gn
->parents
, (ClientData
)pgn
);
Lst_Destroy(members
, NOFREE
);
* Now the source is expanded, remove it from the list of children to
* keep it from being processed.
ln
= Lst_Member(pgn
->children
, (ClientData
)cgn
);
Lst_Remove(pgn
->children
, ln
);
} else if (Dir_HasWildcards(cgn
->name
)) {
Lst exp
; /* List of expansions */
Lst path
; /* Search path along which to expand */
* Find a path along which to expand the word.
* If the word has a known suffix, use that path.
* If it has no known suffix and we're allowed to use the null
* Else use the default system search path.
cp
= cgn
->name
+ strlen(cgn
->name
);
ln
= Lst_Find(sufflist
, (ClientData
)cp
, SuffSuffIsSuffixP
);
printf("Wildcard expanding \"%s\"...", cgn
->name
);
Suff
*s
= (Suff
*)Lst_Datum(ln
);
printf("suffix is \"%s\"...", s
->name
);
* Use default search path
* Expand the word along the chosen path
Dir_Expand(cgn
->name
, path
, exp
);
while (!Lst_IsEmpty(exp
)) {
* Fetch next expansion off the list and find its GNode
cp
= (char *)Lst_DeQueue(exp
);
gn
= Targ_FindNode(cp
, TARG_CREATE
);
* If gn isn't already a child of the parent, make it so and
* up the parent's count of unmade children.
if (Lst_Member(pgn
->children
, (ClientData
)gn
) == NILLNODE
) {
(void)Lst_Append(pgn
->children
, prevLN
, (ClientData
)gn
);
prevLN
= Lst_Succ(prevLN
);
(void)Lst_AtEnd(gn
->parents
, (ClientData
)pgn
);
* Nuke what's left of the list
Lst_Destroy(exp
, NOFREE
);
* Now the source is expanded, remove it from the list of children to
* keep it from being processed.
ln
= Lst_Member(pgn
->children
, (ClientData
)cgn
);
Lst_Remove(pgn
->children
, ln
);
*-----------------------------------------------------------------------
* Apply a transformation rule, given the source and target nodes
* TRUE if successful, FALSE if not.
* The source and target are linked and the commands from the
* transformation are added to the target node's commands list.
* All attributes but OP_DEPMASK and OP_TRANSFORM are applied
* to the target. The target also inherits all the sources for
* the transformation rule.
*-----------------------------------------------------------------------
SuffApplyTransform(tGn
, sGn
, t
, s
)
GNode
*tGn
; /* Target node */
GNode
*sGn
; /* Source node */
Suff
*t
; /* Target suffix */
Suff
*s
; /* Source suffix */
LstNode ln
; /* General node */
char *tname
; /* Name of transformation rule */
GNode
*gn
; /* Node for same */
if (Lst_Member(tGn
->children
, (ClientData
)sGn
) == NILLNODE
) {
* Not already linked, so form the proper links between the
(void)Lst_AtEnd(tGn
->children
, (ClientData
)sGn
);
(void)Lst_AtEnd(sGn
->parents
, (ClientData
)tGn
);
if ((sGn
->type
& OP_OPMASK
) == OP_DOUBLEDEP
) {
* When a :: node is used as the implied source of a node, we have
* to link all its cohorts in as sources as well. Only the initial
* sGn gets the target in its iParents list, however, as that
* will be sufficient to get the .IMPSRC variable set for tGn
for (ln
=Lst_First(sGn
->cohorts
); ln
!= NILLNODE
; ln
=Lst_Succ(ln
)) {
gn
= (GNode
*)Lst_Datum(ln
);
if (Lst_Member(tGn
->children
, (ClientData
)gn
) == NILLNODE
) {
* Not already linked, so form the proper links between the
(void)Lst_AtEnd(tGn
->children
, (ClientData
)gn
);
(void)Lst_AtEnd(gn
->parents
, (ClientData
)tGn
);
* Locate the transformation rule itself
tname
= str_concat(s
->name
, t
->name
, 0);
ln
= Lst_Find(transforms
, (ClientData
)tname
, SuffGNHasNameP
);
* Not really such a transformation rule (can happen when we're
* called to link an OP_MEMBER and OP_ARCHV node), so return
gn
= (GNode
*)Lst_Datum(ln
);
printf("\tapplying %s -> %s to \"%s\"\n", s
->name
, t
->name
, tGn
->name
);
* Record last child for expansion purposes
ln
= Lst_Last(tGn
->children
);
* Pass the buck to Make_HandleUse to apply the rule
(void)Make_HandleUse(gn
, tGn
);
* Deal with wildcards and variables in any acquired sources
Lst_ForEachFrom(tGn
->children
, ln
,
SuffExpandChildren
, (ClientData
)tGn
);
* Keep track of another parent to which this beast is transformed so
* the .IMPSRC variable can be set correctly for the parent.
(void)Lst_AtEnd(sGn
->iParents
, (ClientData
)tGn
);
*-----------------------------------------------------------------------
* Locate dependencies for an OP_ARCHV node.
*-----------------------------------------------------------------------
GNode
*gn
; /* Node for which to locate dependencies */
char *eoarch
; /* End of archive portion */
char *eoname
; /* End of member portion */
GNode
*mem
; /* Node for member */
static char *copy
[] = { /* Variables to be copied from the member node */
TARGET
, /* Must be first */
PREFIX
, /* Must be second */
char *vals
[sizeof(copy
)/sizeof(copy
[0])];
int i
; /* Index into copy and vals */
char *cp
; /* Suffix for member */
Suff
*ms
; /* Suffix descriptor for member */
char *name
; /* Start of member's name */
* The node is an archive(member) pair. so we must find a
* suffix for both of them.
eoarch
= index (gn
->name
, '(');
eoname
= index (eoarch
, ')');
*eoname
= '\0'; /* Nuke parentheses during suffix search */
*eoarch
= '\0'; /* So a suffix can be found */
* To simplify things, call Suff_FindDeps recursively on the member now,
* so we can simply compare the member's .PREFIX and .TARGET variables
* to locate its suffix. This allows us to figure out the suffix to
* use for the archive without having to do a quadratic search over the
* suffix list, backtracking for each one...
mem
= Targ_FindNode(name
, TARG_CREATE
);
* Create the link between the two nodes right off
if (Lst_Member(gn
->children
, (ClientData
)mem
) == NILLNODE
) {
(void)Lst_AtEnd(gn
->children
, (ClientData
)mem
);
(void)Lst_AtEnd(mem
->parents
, (ClientData
)gn
);
* Copy in the variables from the member node to this one.
for (i
= (sizeof(copy
)/sizeof(copy
[0]))-1; i
>= 0; i
--) {
vals
[i
] = Var_Value(copy
[i
], mem
);
Var_Set(copy
[i
], vals
[i
], gn
);
* Didn't know what it was -- use .NULL suffix if not in make mode
printf("using null suffix\n");
* Set the other two local variables required for this target.
Var_Set (MEMBER
, name
, gn
);
Var_Set (ARCHIVE
, gn
->name
, gn
);
* Member has a known suffix, so look for a transformation rule from
* it to a possible suffix of the archive. Rather than searching
* through the entire list, we just look at suffixes to which the
* member's suffix may be transformed...
* Use first matching suffix...
ln
= Lst_Find(ms
->parents
, eoarch
, SuffSuffIsSuffixP
);
if (!SuffApplyTransform(gn
, mem
, (Suff
*)Lst_Datum(ln
), ms
) &&
printf("\tNo transformation from %s -> %s\n",
ms
->name
, ((Suff
*)Lst_Datum(ln
))->name
);
* Replace the opening and closing parens now we've no need of the separate
*eoarch
= '('; *eoname
= ')';
* Pretend gn appeared to the left of a dependency operator so
* the user needn't provide a transformation from the member to the
* Flag the member as such so we remember to look in the archive for
*-----------------------------------------------------------------------
* Locate implicit dependencies for regular targets.
* Same as Suff_FindDeps...
*-----------------------------------------------------------------------
GNode
*gn
; /* Node for which to find sources */
char *eoname
; /* End of name */
char *sopref
; /* Start of prefix */
Suff
*s
; /* Current suffix */
LstNode ln
; /* Next suffix node to check */
Lst srcs
; /* List of sources at which to look */
Lst targs
; /* List of targets to which things can be
* transformed. They all have the same file,
* but different suff and pref fields */
Src
*bottom
; /* Start of found transformation path */
Src
*src
; /* General Src pointer */
char *pref
; /* Prefix to use */
Src
*targ
; /* General Src target pointer */
eoname
= gn
->name
+ strlen(gn
->name
);
* Begin at the beginning...
ln
= Lst_First(sufflist
);
* We're caught in a catch-22 here. On the one hand, we want to use any
* transformation implied by the target's sources, but we can't examine
* the sources until we've expanded any variables/wildcards they may hold,
* and we can't do that until we've set up the target's local variables
* and we can't do that until we know what the proper suffix for the
* target is (in case there are two suffixes one of which is a suffix of
* the other) and we can't know that until we've found its implied
* source, which we may not want to use if there's an existing source
* that implies a different transformation.
* In an attempt to get around this, which may not work all the time,
* but should work most of the time, we look for implied sources first,
* checking transformations to all possible suffixes of the target,
* use what we find to set the target's local variables, expand the
* children, then look for any overriding transformations they imply.
* Should we find one, we discard the one we found before.
* Look for next possible suffix...
ln
= Lst_FindFrom(sufflist
, ln
, eoname
, SuffSuffIsSuffixP
);
int prefLen
; /* Length of the prefix */
* Allocate a Src structure to which things can be transformed
targ
= (Src
*)emalloc(sizeof(Src
));
targ
->file
= strdup(gn
->name
);
targ
->suff
= (Suff
*)Lst_Datum(ln
);
targ
->parent
= (Src
*)NULL
;
* Allocate room for the prefix, whose end is found by subtracting
* the length of the suffix from the end of the name.
prefLen
= (eoname
- targ
->suff
->nameLen
) - sopref
;
targ
->pref
= emalloc(prefLen
+ 1);
bcopy(sopref
, targ
->pref
, prefLen
);
targ
->pref
[prefLen
] = '\0';
* Add nodes from which the target can be made
SuffAddLevel(srcs
, targ
);
* Record the target so we can nuke it
(void)Lst_AtEnd(targs
, (ClientData
)targ
);
* Search from this suffix's successor...
* Handle target of unknown suffix...
if (Lst_IsEmpty(targs
) && suffNull
!= NULL
) {
printf("\tNo known suffix on %s. Using .NULL suffix\n", gn
->name
);
targ
= (Src
*)emalloc(sizeof(Src
));
targ
->file
= strdup(gn
->name
);
targ
->parent
= (Src
*)NULL
;
targ
->pref
= strdup(sopref
);
SuffAddLevel(srcs
, targ
);
(void)Lst_AtEnd(targs
, (ClientData
)targ
);
* Using the list of possible sources built up from the target suffix(es),
* try and find an existing file/target that matches.
bottom
= SuffFindThem(srcs
);
if (bottom
== (Src
*)NULL
) {
* No known transformations -- use the first suffix found for setting
if (!Lst_IsEmpty(targs
)) {
targ
= (Src
*)Lst_Datum(Lst_First(targs
));
* Work up the transformation path to find the suffix of the
* target to which the transformation was made.
for (targ
= bottom
; targ
->parent
!= NULL
; targ
= targ
->parent
) {
* The .TARGET variable we always set to be the name at this point,
* since it's only set to the path if the thing is only a source and
* if it's only a source, it doesn't matter what we put here as far
* as expanding sources is concerned, since it has none...
Var_Set(TARGET
, gn
->name
, gn
);
pref
= (targ
!= NULL
) ? targ
->pref
: gn
->name
;
Var_Set(PREFIX
, pref
, gn
);
* Now we've got the important local variables set, expand any sources
* that still contain variables or wildcards in their names.
Lst_ForEach(gn
->children
, SuffExpandChildren
, (ClientData
)gn
);
printf("\tNo valid suffix on %s\n", gn
->name
);
* Deal with finding the thing on the default search path if the
* node is only a source (not on the lhs of a dependency operator
* or [XXX] it has neither children or commands).
(Lst_IsEmpty(gn
->children
) && Lst_IsEmpty(gn
->commands
)))
gn
->path
= Dir_FindFile(gn
->name
,
(targ
== NULL
? dirSearchPath
:
targ
->suff
->searchPath
));
Var_Set(TARGET
, gn
->path
, gn
);
* Suffix known for the thing -- trim the suffix off
* the path to form the proper .PREFIX variable.
int len
= strlen(gn
->path
);
savec
= gn
->path
[len
-targ
->suff
->nameLen
];
gn
->path
[len
-targ
->suff
->nameLen
] = '\0';
Var_Set(PREFIX
, gn
->path
, gn
);
gn
->path
[len
-targ
->suff
->nameLen
] = savec
;
* The .PREFIX gets the full path if the target has
Var_Set(PREFIX
, gn
->path
, gn
);
* Not appropriate to search for the thing -- set the
* path to be the name so Dir_MTime won't go grovelling for
gn
->suffix
= (targ
== NULL
) ? NULL
: targ
->suff
;
* If the suffix indicates that the target is a library, mark that in
if (targ
->suff
->flags
& SUFF_LIBRARY
) {
* Check for overriding transformation rule implied by sources
if (!Lst_IsEmpty(gn
->children
)) {
src
= SuffFindCmds(targ
);
if (src
!= (Src
*)NULL
) {
* Free up all the Src structures in the transformation path
* up to, but not including, the parent node.
while (bottom
&& bottom
->parent
!= NULL
) {
* No idea from where it can come -- return now.
* We now have a list of Src structures headed by 'bottom' and linked via
* their 'parent' pointers. What we do next is create links between
* source and target nodes (which may or may not have been created)
* and set the necessary local variables in each target. The
* commands for each target are set from the commands of the
* transformation rule used to get from the src suffix to the targ
* suffix. Note that this causes the commands list of the original
* node, gn, to be replaced by the commands of the final
* transformation rule. Also, the unmade field of gn is incremented.
if (bottom
->node
== NILGNODE
) {
bottom
->node
= Targ_FindNode(bottom
->file
, TARG_CREATE
);
for (src
= bottom
; src
->parent
!= (Src
*)NULL
; src
= src
->parent
) {
src
->node
->suffix
= src
->suff
;
if (targ
->node
== NILGNODE
) {
targ
->node
= Targ_FindNode(targ
->file
, TARG_CREATE
);
SuffApplyTransform(targ
->node
, src
->node
,
* Finish off the dependency-search process for any nodes
* between bottom and gn (no point in questing around the
* filesystem for their implicit source when it's already
* known). Note that the node can't have any sources that
* need expanding, since SuffFindThem will stop on an existing
* node, so all we need to do is set the standard and System V
targ
->node
->type
|= OP_DEPS_FOUND
;
Var_Set(PREFIX
, targ
->pref
, targ
->node
);
Var_Set(TARGET
, targ
->node
->name
, targ
->node
);
* So Dir_MTime doesn't go questing for it...
* Nuke the transformation path and the Src structures left over in the
Lst_Destroy(srcs
, SuffFreeSrc
);
Lst_Destroy(targs
, SuffFreeSrc
);
*-----------------------------------------------------------------------
* Find implicit sources for the target described by the graph node
* Nodes are added to the graph below the passed-in node. The nodes
* are marked to have their IMPSRC variable filled in. The
* PREFIX variable is set for the given node and all its
* The path found by this target is the shortest path in the
* transformation graph, which may pass through non-existent targets,
* to an existing target. The search continues on all paths from the
* root suffix until a file is found. I.e. if there's a path
* .o -> .c -> .l -> .l,v from the root and the .l,v file exists but
* the .c and .l files don't, the search will branch out in
* all directions from .o and again from all the nodes on the
* next level until the .l,v node is encountered.
*-----------------------------------------------------------------------
GNode
*gn
; /* node we're dealing with */
if (gn
->type
& OP_DEPS_FOUND
) {
* If dependencies already found, no need to do it again...
gn
->type
|= OP_DEPS_FOUND
;
printf ("Suff_FindDeps (%s)\n", gn
->name
);
if (gn
->type
& OP_ARCHV
) {
} else if (gn
->type
& OP_LIB
) {
* If the node is a library, it is the arch module's job to find it
* and set the TARGET variable accordingly. We merely provide the
* search path, assuming all libraries end in ".a" (if the suffix
* hasn't been defined, there's nothing we can do for it, so we just
* set the TARGET variable to the node's name in order to give it a
ln
= Lst_Find (sufflist
, (ClientData
)LIBSUFF
, SuffSuffHasNameP
);
gn
->suffix
= s
= (Suff
*) Lst_Datum (ln
);
Arch_FindLib (gn
, s
->searchPath
);
Var_Set (TARGET
, gn
->name
, gn
);
* Because a library (-lfoo) target doesn't follow the standard
* filesystem conventions, we don't set the regular variables for
* the thing. .PREFIX is simply made empty...
*-----------------------------------------------------------------------
* Define which suffix is the null suffix.
* Need to handle the changing of the null suffix gracefully so the
* old transformation rules don't just go away.
*-----------------------------------------------------------------------
char *name
; /* Name of null suffix */
ln
= Lst_Find(sufflist
, (ClientData
)name
, SuffSuffHasNameP
);
s
= (Suff
*)Lst_Datum(ln
);
if (suffNull
!= (Suff
*)NULL
) {
suffNull
->flags
&= ~SUFF_NULL
;
* XXX: Here's where the transformation mangling would take place
Parse_Error (PARSE_WARNING
, "Desired null suffix %s not defined.",
*-----------------------------------------------------------------------
* Initialize suffixes module
*-----------------------------------------------------------------------
sufflist
= Lst_Init (FALSE
);
transforms
= Lst_Init (FALSE
);
* Create null suffix for single-suffix rules (POSIX). The thing doesn't
* actually go on the suffix list or everyone will think that's its
emptySuff
= suffNull
= (Suff
*) emalloc (sizeof (Suff
));
suffNull
->name
= strdup ("");
suffNull
->searchPath
= Lst_Init (FALSE
);
suffNull
->children
= Lst_Init (FALSE
);
suffNull
->parents
= Lst_Init (FALSE
);
suffNull
->flags
= SUFF_NULL
;
/********************* DEBUGGING FUNCTIONS **********************/
static int SuffPrintName(s
) Suff
*s
; {printf ("%s ", s
->name
); return (0);}
printf ("# `%s'", s
->name
);
flag
= 1 << (ffs(flags
) - 1);
putc(flags
? '|' : ')', stdout
);
Lst_ForEach (s
->parents
, SuffPrintName
, (ClientData
)0);
Lst_ForEach (s
->children
, SuffPrintName
, (ClientData
)0);
printf ("#\tSearch Path: ");
Dir_PrintPath (s
->searchPath
);
extern int Targ_PrintCmd();
printf ("%-16s: ", t
->name
);
Targ_PrintType (t
->type
);
Lst_ForEach (t
->commands
, Targ_PrintCmd
, (ClientData
)0);
printf ("#*** Suffixes:\n");
Lst_ForEach (sufflist
, SuffPrintSuff
, (ClientData
)0);
printf ("#*** Transformations:\n");
Lst_ForEach (transforms
, SuffPrintTrans
, (ClientData
)0);