Home | History | Annotate | Line # | Download | only in make
arch.c revision 1.10
      1  1.10  christos /*	$NetBSD: arch.c,v 1.10 1995/11/02 23:54:35 christos Exp $	*/
      2   1.9  christos 
      3   1.1       cgd /*
      4   1.1       cgd  * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
      5   1.1       cgd  * Copyright (c) 1988, 1989 by Adam de Boor
      6   1.1       cgd  * Copyright (c) 1989 by Berkeley Softworks
      7   1.1       cgd  * All rights reserved.
      8   1.1       cgd  *
      9   1.1       cgd  * This code is derived from software contributed to Berkeley by
     10   1.1       cgd  * Adam de Boor.
     11   1.1       cgd  *
     12   1.1       cgd  * Redistribution and use in source and binary forms, with or without
     13   1.1       cgd  * modification, are permitted provided that the following conditions
     14   1.1       cgd  * are met:
     15   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     16   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     17   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     18   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     19   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     20   1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     21   1.1       cgd  *    must display the following acknowledgement:
     22   1.1       cgd  *	This product includes software developed by the University of
     23   1.1       cgd  *	California, Berkeley and its contributors.
     24   1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     25   1.1       cgd  *    may be used to endorse or promote products derived from this software
     26   1.1       cgd  *    without specific prior written permission.
     27   1.1       cgd  *
     28   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     29   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     30   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     31   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     32   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     33   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     34   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     35   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     36   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     37   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     38   1.1       cgd  * SUCH DAMAGE.
     39   1.1       cgd  */
     40   1.1       cgd 
     41   1.1       cgd #ifndef lint
     42   1.9  christos #if 0
     43   1.9  christos static char sccsid[] = "@(#)arch.c	5.7 (Berkeley) 12/28/90";
     44   1.9  christos #else
     45  1.10  christos static char rcsid[] = "$NetBSD: arch.c,v 1.10 1995/11/02 23:54:35 christos Exp $";
     46   1.9  christos #endif
     47   1.1       cgd #endif /* not lint */
     48   1.1       cgd 
     49   1.1       cgd /*-
     50   1.1       cgd  * arch.c --
     51   1.1       cgd  *	Functions to manipulate libraries, archives and their members.
     52   1.1       cgd  *
     53   1.1       cgd  *	Once again, cacheing/hashing comes into play in the manipulation
     54   1.1       cgd  * of archives. The first time an archive is referenced, all of its members'
     55   1.1       cgd  * headers are read and hashed and the archive closed again. All hashed
     56   1.1       cgd  * archives are kept on a list which is searched each time an archive member
     57   1.1       cgd  * is referenced.
     58   1.1       cgd  *
     59   1.1       cgd  * The interface to this module is:
     60   1.1       cgd  *	Arch_ParseArchive   	Given an archive specification, return a list
     61   1.1       cgd  *	    	  	    	of GNode's, one for each member in the spec.
     62   1.1       cgd  *	    	  	    	FAILURE is returned if the specification is
     63   1.1       cgd  *	    	  	    	invalid for some reason.
     64   1.1       cgd  *
     65   1.1       cgd  *	Arch_Touch	    	Alter the modification time of the archive
     66   1.1       cgd  *	    	  	    	member described by the given node to be
     67   1.1       cgd  *	    	  	    	the current time.
     68   1.1       cgd  *
     69   1.1       cgd  *	Arch_TouchLib	    	Update the modification time of the library
     70   1.1       cgd  *	    	  	    	described by the given node. This is special
     71   1.1       cgd  *	    	  	    	because it also updates the modification time
     72   1.1       cgd  *	    	  	    	of the library's table of contents.
     73   1.1       cgd  *
     74   1.1       cgd  *	Arch_MTime	    	Find the modification time of a member of
     75   1.1       cgd  *	    	  	    	an archive *in the archive*. The time is also
     76   1.1       cgd  *	    	  	    	placed in the member's GNode. Returns the
     77   1.1       cgd  *	    	  	    	modification time.
     78   1.1       cgd  *
     79   1.1       cgd  *	Arch_MemTime	    	Find the modification time of a member of
     80   1.1       cgd  *	    	  	    	an archive. Called when the member doesn't
     81   1.1       cgd  *	    	  	    	already exist. Looks in the archive for the
     82   1.1       cgd  *	    	  	    	modification time. Returns the modification
     83   1.1       cgd  *	    	  	    	time.
     84   1.1       cgd  *
     85   1.1       cgd  *	Arch_FindLib	    	Search for a library along a path. The
     86   1.1       cgd  *	    	  	    	library name in the GNode should be in
     87   1.1       cgd  *	    	  	    	-l<name> format.
     88   1.1       cgd  *
     89   1.1       cgd  *	Arch_LibOODate	    	Special function to decide if a library node
     90   1.1       cgd  *	    	  	    	is out-of-date.
     91   1.1       cgd  *
     92   1.1       cgd  *	Arch_Init 	    	Initialize this module.
     93   1.7       jtc  *
     94   1.7       jtc  *	Arch_End 	    	Cleanup this module.
     95   1.1       cgd  */
     96   1.1       cgd 
     97   1.1       cgd #include    <sys/types.h>
     98   1.1       cgd #include    <sys/stat.h>
     99   1.1       cgd #include    <sys/time.h>
    100   1.6        pk #include    <sys/param.h>
    101   1.1       cgd #include    <ctype.h>
    102   1.1       cgd #include    <ar.h>
    103   1.4       jtc #include    <ranlib.h>
    104   1.1       cgd #include    <stdio.h>
    105   1.6        pk #include    <stdlib.h>
    106   1.1       cgd #include    "make.h"
    107   1.1       cgd #include    "hash.h"
    108   1.5       cgd #include    "dir.h"
    109   1.5       cgd #include    "config.h"
    110   1.2     glass 
    111   1.1       cgd static Lst	  archives;   /* Lst of archives we've already examined */
    112   1.1       cgd 
    113   1.1       cgd typedef struct Arch {
    114   1.1       cgd     char	  *name;      /* Name of archive */
    115   1.1       cgd     Hash_Table	  members;    /* All the members of the archive described
    116   1.1       cgd 			       * by <name, struct ar_hdr *> key/value pairs */
    117   1.1       cgd } Arch;
    118   1.1       cgd 
    119   1.7       jtc static int ArchFindArchive __P((ClientData, ClientData));
    120   1.7       jtc static void ArchFree __P((ClientData));
    121   1.5       cgd static struct ar_hdr *ArchStatMember __P((char *, char *, Boolean));
    122   1.5       cgd static FILE *ArchFindMember __P((char *, char *, struct ar_hdr *, char *));
    123   1.1       cgd 
    124   1.1       cgd /*-
    125   1.1       cgd  *-----------------------------------------------------------------------
    126   1.7       jtc  * ArchFree --
    127   1.7       jtc  *	Free memory used by an archive
    128   1.7       jtc  *
    129   1.7       jtc  * Results:
    130   1.7       jtc  *	None.
    131   1.7       jtc  *
    132   1.7       jtc  * Side Effects:
    133   1.7       jtc  *	None.
    134   1.7       jtc  *
    135   1.7       jtc  *-----------------------------------------------------------------------
    136   1.7       jtc  */
    137   1.7       jtc static void
    138   1.7       jtc ArchFree(ap)
    139   1.7       jtc     ClientData ap;
    140   1.7       jtc {
    141   1.7       jtc     Arch *a = (Arch *) ap;
    142   1.7       jtc     Hash_Search	  search;
    143   1.7       jtc     Hash_Entry	  *entry;
    144   1.7       jtc 
    145   1.7       jtc     /* Free memory from hash entries */
    146   1.7       jtc     for (entry = Hash_EnumFirst(&a->members, &search);
    147   1.7       jtc 	 entry != (Hash_Entry *)NULL;
    148   1.7       jtc 	 entry = Hash_EnumNext(&search))
    149   1.7       jtc 	free((Address) Hash_GetValue (entry));
    150   1.7       jtc 
    151   1.7       jtc     free(a->name);
    152   1.7       jtc     Hash_DeleteTable(&a->members);
    153   1.7       jtc     free((Address) a);
    154   1.7       jtc }
    155   1.7       jtc 
    156   1.7       jtc 
    157   1.7       jtc 
    158   1.7       jtc /*-
    159   1.7       jtc  *-----------------------------------------------------------------------
    160   1.1       cgd  * Arch_ParseArchive --
    161   1.1       cgd  *	Parse the archive specification in the given line and find/create
    162   1.1       cgd  *	the nodes for the specified archive members, placing their nodes
    163   1.1       cgd  *	on the given list.
    164   1.1       cgd  *
    165   1.1       cgd  * Results:
    166   1.1       cgd  *	SUCCESS if it was a valid specification. The linePtr is updated
    167   1.1       cgd  *	to point to the first non-space after the archive spec. The
    168   1.1       cgd  *	nodes for the members are placed on the given list.
    169   1.1       cgd  *
    170   1.1       cgd  * Side Effects:
    171   1.1       cgd  *	Some nodes may be created. The given list is extended.
    172   1.1       cgd  *
    173   1.1       cgd  *-----------------------------------------------------------------------
    174   1.1       cgd  */
    175   1.1       cgd ReturnStatus
    176   1.1       cgd Arch_ParseArchive (linePtr, nodeLst, ctxt)
    177   1.1       cgd     char	    **linePtr;      /* Pointer to start of specification */
    178   1.1       cgd     Lst	    	    nodeLst;   	    /* Lst on which to place the nodes */
    179   1.1       cgd     GNode   	    *ctxt;  	    /* Context in which to expand variables */
    180   1.1       cgd {
    181   1.1       cgd     register char   *cp;	    /* Pointer into line */
    182   1.1       cgd     GNode	    *gn;     	    /* New node */
    183   1.1       cgd     char	    *libName;  	    /* Library-part of specification */
    184   1.1       cgd     char	    *memName;  	    /* Member-part of specification */
    185   1.5       cgd     char	    nameBuf[MAKE_BSIZE]; /* temporary place for node name */
    186   1.1       cgd     char	    saveChar;  	    /* Ending delimiter of member-name */
    187   1.1       cgd     Boolean 	    subLibName;	    /* TRUE if libName should have/had
    188   1.1       cgd 				     * variable substitution performed on it */
    189   1.1       cgd 
    190   1.1       cgd     libName = *linePtr;
    191   1.1       cgd 
    192   1.1       cgd     subLibName = FALSE;
    193   1.1       cgd 
    194   1.1       cgd     for (cp = libName; *cp != '(' && *cp != '\0'; cp++) {
    195   1.1       cgd 	if (*cp == '$') {
    196   1.1       cgd 	    /*
    197   1.1       cgd 	     * Variable spec, so call the Var module to parse the puppy
    198   1.1       cgd 	     * so we can safely advance beyond it...
    199   1.1       cgd 	     */
    200   1.1       cgd 	    int 	length;
    201   1.1       cgd 	    Boolean	freeIt;
    202   1.1       cgd 	    char	*result;
    203   1.1       cgd 
    204   1.1       cgd 	    result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
    205   1.1       cgd 	    if (result == var_Error) {
    206   1.1       cgd 		return(FAILURE);
    207   1.1       cgd 	    } else {
    208   1.1       cgd 		subLibName = TRUE;
    209   1.1       cgd 	    }
    210   1.1       cgd 
    211   1.1       cgd 	    if (freeIt) {
    212   1.1       cgd 		free(result);
    213   1.1       cgd 	    }
    214   1.1       cgd 	    cp += length-1;
    215   1.1       cgd 	}
    216   1.1       cgd     }
    217   1.1       cgd 
    218   1.1       cgd     *cp++ = '\0';
    219   1.1       cgd     if (subLibName) {
    220   1.5       cgd 	libName = Var_Subst(NULL, libName, ctxt, TRUE);
    221   1.1       cgd     }
    222   1.1       cgd 
    223   1.1       cgd 
    224   1.5       cgd     for (;;) {
    225   1.1       cgd 	/*
    226   1.1       cgd 	 * First skip to the start of the member's name, mark that
    227   1.1       cgd 	 * place and skip to the end of it (either white-space or
    228   1.1       cgd 	 * a close paren).
    229   1.1       cgd 	 */
    230   1.1       cgd 	Boolean	doSubst = FALSE; /* TRUE if need to substitute in memName */
    231   1.1       cgd 
    232   1.1       cgd 	while (*cp != '\0' && *cp != ')' && isspace (*cp)) {
    233   1.1       cgd 	    cp++;
    234   1.1       cgd 	}
    235   1.1       cgd 	memName = cp;
    236   1.1       cgd 	while (*cp != '\0' && *cp != ')' && !isspace (*cp)) {
    237   1.1       cgd 	    if (*cp == '$') {
    238   1.1       cgd 		/*
    239   1.1       cgd 		 * Variable spec, so call the Var module to parse the puppy
    240   1.1       cgd 		 * so we can safely advance beyond it...
    241   1.1       cgd 		 */
    242   1.1       cgd 		int 	length;
    243   1.1       cgd 		Boolean	freeIt;
    244   1.1       cgd 		char	*result;
    245   1.1       cgd 
    246   1.1       cgd 		result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
    247   1.1       cgd 		if (result == var_Error) {
    248   1.1       cgd 		    return(FAILURE);
    249   1.1       cgd 		} else {
    250   1.1       cgd 		    doSubst = TRUE;
    251   1.1       cgd 		}
    252   1.1       cgd 
    253   1.1       cgd 		if (freeIt) {
    254   1.1       cgd 		    free(result);
    255   1.1       cgd 		}
    256   1.1       cgd 		cp += length;
    257   1.1       cgd 	    } else {
    258   1.1       cgd 		cp++;
    259   1.1       cgd 	    }
    260   1.1       cgd 	}
    261   1.1       cgd 
    262   1.1       cgd 	/*
    263   1.1       cgd 	 * If the specification ends without a closing parenthesis,
    264   1.1       cgd 	 * chances are there's something wrong (like a missing backslash),
    265   1.1       cgd 	 * so it's better to return failure than allow such things to happen
    266   1.1       cgd 	 */
    267   1.1       cgd 	if (*cp == '\0') {
    268   1.1       cgd 	    printf("No closing parenthesis in archive specification\n");
    269   1.1       cgd 	    return (FAILURE);
    270   1.1       cgd 	}
    271   1.1       cgd 
    272   1.1       cgd 	/*
    273   1.1       cgd 	 * If we didn't move anywhere, we must be done
    274   1.1       cgd 	 */
    275   1.1       cgd 	if (cp == memName) {
    276   1.1       cgd 	    break;
    277   1.1       cgd 	}
    278   1.1       cgd 
    279   1.1       cgd 	saveChar = *cp;
    280   1.1       cgd 	*cp = '\0';
    281   1.1       cgd 
    282   1.1       cgd 	/*
    283   1.1       cgd 	 * XXX: This should be taken care of intelligently by
    284   1.1       cgd 	 * SuffExpandChildren, both for the archive and the member portions.
    285   1.1       cgd 	 */
    286   1.1       cgd 	/*
    287   1.1       cgd 	 * If member contains variables, try and substitute for them.
    288   1.1       cgd 	 * This will slow down archive specs with dynamic sources, of course,
    289   1.1       cgd 	 * since we'll be (non-)substituting them three times, but them's
    290   1.1       cgd 	 * the breaks -- we need to do this since SuffExpandChildren calls
    291   1.1       cgd 	 * us, otherwise we could assume the thing would be taken care of
    292   1.1       cgd 	 * later.
    293   1.1       cgd 	 */
    294   1.1       cgd 	if (doSubst) {
    295   1.1       cgd 	    char    *buf;
    296   1.1       cgd 	    char    *sacrifice;
    297   1.1       cgd 	    char    *oldMemName = memName;
    298   1.1       cgd 
    299   1.5       cgd 	    memName = Var_Subst(NULL, memName, ctxt, TRUE);
    300   1.1       cgd 
    301   1.1       cgd 	    /*
    302   1.1       cgd 	     * Now form an archive spec and recurse to deal with nested
    303   1.1       cgd 	     * variables and multi-word variable values.... The results
    304   1.1       cgd 	     * are just placed at the end of the nodeLst we're returning.
    305   1.1       cgd 	     */
    306   1.1       cgd 	    buf = sacrifice = emalloc(strlen(memName)+strlen(libName)+3);
    307   1.1       cgd 
    308   1.1       cgd 	    sprintf(buf, "%s(%s)", libName, memName);
    309   1.1       cgd 
    310   1.5       cgd 	    if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) {
    311   1.1       cgd 		/*
    312   1.1       cgd 		 * Must contain dynamic sources, so we can't deal with it now.
    313   1.1       cgd 		 * Just create an ARCHV node for the thing and let
    314   1.1       cgd 		 * SuffExpandChildren handle it...
    315   1.1       cgd 		 */
    316   1.1       cgd 		gn = Targ_FindNode(buf, TARG_CREATE);
    317   1.1       cgd 
    318   1.1       cgd 		if (gn == NILGNODE) {
    319   1.1       cgd 		    free(buf);
    320   1.1       cgd 		    return(FAILURE);
    321   1.1       cgd 		} else {
    322   1.1       cgd 		    gn->type |= OP_ARCHV;
    323   1.1       cgd 		    (void)Lst_AtEnd(nodeLst, (ClientData)gn);
    324   1.1       cgd 		}
    325   1.1       cgd 	    } else if (Arch_ParseArchive(&sacrifice, nodeLst, ctxt)!=SUCCESS) {
    326   1.1       cgd 		/*
    327   1.1       cgd 		 * Error in nested call -- free buffer and return FAILURE
    328   1.1       cgd 		 * ourselves.
    329   1.1       cgd 		 */
    330   1.1       cgd 		free(buf);
    331   1.1       cgd 		return(FAILURE);
    332   1.1       cgd 	    }
    333   1.1       cgd 	    /*
    334   1.1       cgd 	     * Free buffer and continue with our work.
    335   1.1       cgd 	     */
    336   1.1       cgd 	    free(buf);
    337   1.1       cgd 	} else if (Dir_HasWildcards(memName)) {
    338   1.1       cgd 	    Lst	  members = Lst_Init(FALSE);
    339   1.1       cgd 	    char  *member;
    340   1.1       cgd 
    341   1.1       cgd 	    Dir_Expand(memName, dirSearchPath, members);
    342   1.1       cgd 	    while (!Lst_IsEmpty(members)) {
    343   1.1       cgd 		member = (char *)Lst_DeQueue(members);
    344   1.1       cgd 
    345   1.1       cgd 		sprintf(nameBuf, "%s(%s)", libName, member);
    346   1.1       cgd 		free(member);
    347   1.1       cgd 		gn = Targ_FindNode (nameBuf, TARG_CREATE);
    348   1.1       cgd 		if (gn == NILGNODE) {
    349   1.1       cgd 		    return (FAILURE);
    350   1.1       cgd 		} else {
    351   1.1       cgd 		    /*
    352   1.1       cgd 		     * We've found the node, but have to make sure the rest of
    353   1.1       cgd 		     * the world knows it's an archive member, without having
    354   1.1       cgd 		     * to constantly check for parentheses, so we type the
    355   1.1       cgd 		     * thing with the OP_ARCHV bit before we place it on the
    356   1.1       cgd 		     * end of the provided list.
    357   1.1       cgd 		     */
    358   1.1       cgd 		    gn->type |= OP_ARCHV;
    359   1.1       cgd 		    (void) Lst_AtEnd (nodeLst, (ClientData)gn);
    360   1.1       cgd 		}
    361   1.1       cgd 	    }
    362   1.1       cgd 	    Lst_Destroy(members, NOFREE);
    363   1.1       cgd 	} else {
    364   1.1       cgd 	    sprintf(nameBuf, "%s(%s)", libName, memName);
    365   1.1       cgd 	    gn = Targ_FindNode (nameBuf, TARG_CREATE);
    366   1.1       cgd 	    if (gn == NILGNODE) {
    367   1.1       cgd 		return (FAILURE);
    368   1.1       cgd 	    } else {
    369   1.1       cgd 		/*
    370   1.1       cgd 		 * We've found the node, but have to make sure the rest of the
    371   1.1       cgd 		 * world knows it's an archive member, without having to
    372   1.1       cgd 		 * constantly check for parentheses, so we type the thing with
    373   1.1       cgd 		 * the OP_ARCHV bit before we place it on the end of the
    374   1.1       cgd 		 * provided list.
    375   1.1       cgd 		 */
    376   1.1       cgd 		gn->type |= OP_ARCHV;
    377   1.1       cgd 		(void) Lst_AtEnd (nodeLst, (ClientData)gn);
    378   1.1       cgd 	    }
    379   1.1       cgd 	}
    380   1.1       cgd 	if (doSubst) {
    381   1.1       cgd 	    free(memName);
    382   1.1       cgd 	}
    383   1.1       cgd 
    384   1.1       cgd 	*cp = saveChar;
    385   1.1       cgd     }
    386   1.1       cgd 
    387   1.1       cgd     /*
    388   1.1       cgd      * If substituted libName, free it now, since we need it no longer.
    389   1.1       cgd      */
    390   1.1       cgd     if (subLibName) {
    391   1.1       cgd 	free(libName);
    392   1.1       cgd     }
    393   1.1       cgd 
    394   1.1       cgd     /*
    395   1.1       cgd      * We promised the pointer would be set up at the next non-space, so
    396   1.1       cgd      * we must advance cp there before setting *linePtr... (note that on
    397   1.1       cgd      * entrance to the loop, cp is guaranteed to point at a ')')
    398   1.1       cgd      */
    399   1.1       cgd     do {
    400   1.1       cgd 	cp++;
    401   1.1       cgd     } while (*cp != '\0' && isspace (*cp));
    402   1.1       cgd 
    403   1.1       cgd     *linePtr = cp;
    404   1.1       cgd     return (SUCCESS);
    405   1.1       cgd }
    406   1.1       cgd 
    407   1.1       cgd /*-
    408   1.1       cgd  *-----------------------------------------------------------------------
    409   1.1       cgd  * ArchFindArchive --
    410   1.1       cgd  *	See if the given archive is the one we are looking for. Called
    411   1.1       cgd  *	From ArchStatMember and ArchFindMember via Lst_Find.
    412   1.1       cgd  *
    413   1.1       cgd  * Results:
    414   1.1       cgd  *	0 if it is, non-zero if it isn't.
    415   1.1       cgd  *
    416   1.1       cgd  * Side Effects:
    417   1.1       cgd  *	None.
    418   1.1       cgd  *
    419   1.1       cgd  *-----------------------------------------------------------------------
    420   1.1       cgd  */
    421   1.1       cgd static int
    422   1.1       cgd ArchFindArchive (ar, archName)
    423   1.7       jtc     ClientData	  ar;	      	  /* Current list element */
    424   1.7       jtc     ClientData	  archName;  	  /* Name we want */
    425   1.1       cgd {
    426   1.7       jtc     return (strcmp ((char *) archName, ((Arch *) ar)->name));
    427   1.1       cgd }
    428   1.1       cgd 
    429   1.1       cgd /*-
    430   1.1       cgd  *-----------------------------------------------------------------------
    431   1.1       cgd  * ArchStatMember --
    432   1.1       cgd  *	Locate a member of an archive, given the path of the archive and
    433   1.1       cgd  *	the path of the desired member.
    434   1.1       cgd  *
    435   1.1       cgd  * Results:
    436   1.1       cgd  *	A pointer to the current struct ar_hdr structure for the member. Note
    437   1.1       cgd  *	That no position is returned, so this is not useful for touching
    438   1.1       cgd  *	archive members. This is mostly because we have no assurances that
    439   1.1       cgd  *	The archive will remain constant after we read all the headers, so
    440   1.1       cgd  *	there's not much point in remembering the position...
    441   1.1       cgd  *
    442   1.1       cgd  * Side Effects:
    443   1.1       cgd  *
    444   1.1       cgd  *-----------------------------------------------------------------------
    445   1.1       cgd  */
    446   1.1       cgd static struct ar_hdr *
    447   1.1       cgd ArchStatMember (archive, member, hash)
    448   1.1       cgd     char	  *archive;   /* Path to the archive */
    449   1.1       cgd     char	  *member;    /* Name of member. If it is a path, only the
    450   1.1       cgd 			       * last component is used. */
    451   1.1       cgd     Boolean	  hash;	      /* TRUE if archive should be hashed if not
    452   1.1       cgd     			       * already so. */
    453   1.1       cgd {
    454   1.1       cgd #define AR_MAX_NAME_LEN	    (sizeof(arh.ar_name)-1)
    455   1.1       cgd     FILE *	  arch;	      /* Stream to archive */
    456   1.1       cgd     int		  size;       /* Size of archive member */
    457   1.1       cgd     char	  *cp;	      /* Useful character pointer */
    458   1.1       cgd     char	  magic[SARMAG];
    459   1.1       cgd     LstNode	  ln;	      /* Lst member containing archive descriptor */
    460   1.1       cgd     Arch	  *ar;	      /* Archive descriptor */
    461   1.1       cgd     Hash_Entry	  *he;	      /* Entry containing member's description */
    462   1.1       cgd     struct ar_hdr arh;        /* archive-member header for reading archive */
    463   1.6        pk     char	  memName[MAXPATHLEN+1];
    464   1.6        pk     	    	    	    /* Current member name while hashing. */
    465   1.1       cgd 
    466   1.1       cgd     /*
    467   1.1       cgd      * Because of space constraints and similar things, files are archived
    468   1.1       cgd      * using their final path components, not the entire thing, so we need
    469   1.1       cgd      * to point 'member' to the final component, if there is one, to make
    470   1.1       cgd      * the comparisons easier...
    471   1.1       cgd      */
    472   1.5       cgd     cp = strrchr (member, '/');
    473   1.1       cgd     if (cp != (char *) NULL) {
    474   1.1       cgd 	member = cp + 1;
    475   1.1       cgd     }
    476   1.1       cgd 
    477   1.1       cgd     ln = Lst_Find (archives, (ClientData) archive, ArchFindArchive);
    478   1.1       cgd     if (ln != NILLNODE) {
    479   1.1       cgd 	ar = (Arch *) Lst_Datum (ln);
    480   1.1       cgd 
    481   1.1       cgd 	he = Hash_FindEntry (&ar->members, member);
    482   1.1       cgd 
    483   1.1       cgd 	if (he != (Hash_Entry *) NULL) {
    484   1.1       cgd 	    return ((struct ar_hdr *) Hash_GetValue (he));
    485   1.1       cgd 	} else {
    486   1.6        pk 	    /* Try truncated name */
    487   1.6        pk 	    char copy[AR_MAX_NAME_LEN+1];
    488   1.6        pk 	    int len = strlen (member);
    489   1.6        pk 
    490   1.6        pk 	    if (len > AR_MAX_NAME_LEN) {
    491   1.6        pk 		len = AR_MAX_NAME_LEN;
    492   1.6        pk 		strncpy(copy, member, AR_MAX_NAME_LEN);
    493   1.6        pk 		copy[AR_MAX_NAME_LEN] = '\0';
    494   1.6        pk 	    }
    495  1.10  christos 	    if ((he = Hash_FindEntry (&ar->members, copy)) != NULL)
    496   1.6        pk 		return ((struct ar_hdr *) Hash_GetValue (he));
    497   1.1       cgd 	    return ((struct ar_hdr *) NULL);
    498   1.1       cgd 	}
    499   1.1       cgd     }
    500   1.1       cgd 
    501   1.1       cgd     if (!hash) {
    502   1.1       cgd 	/*
    503   1.1       cgd 	 * Caller doesn't want the thing hashed, just use ArchFindMember
    504   1.1       cgd 	 * to read the header for the member out and close down the stream
    505   1.1       cgd 	 * again. Since the archive is not to be hashed, we assume there's
    506   1.1       cgd 	 * no need to allocate extra room for the header we're returning,
    507   1.1       cgd 	 * so just declare it static.
    508   1.1       cgd 	 */
    509   1.1       cgd 	 static struct ar_hdr	sarh;
    510   1.1       cgd 
    511   1.1       cgd 	 arch = ArchFindMember(archive, member, &sarh, "r");
    512   1.1       cgd 
    513   1.1       cgd 	 if (arch == (FILE *)NULL) {
    514   1.1       cgd 	    return ((struct ar_hdr *)NULL);
    515   1.1       cgd 	} else {
    516   1.1       cgd 	    fclose(arch);
    517   1.1       cgd 	    return (&sarh);
    518   1.1       cgd 	}
    519   1.1       cgd     }
    520   1.1       cgd 
    521   1.1       cgd     /*
    522   1.1       cgd      * We don't have this archive on the list yet, so we want to find out
    523   1.1       cgd      * everything that's in it and cache it so we can get at it quickly.
    524   1.1       cgd      */
    525   1.1       cgd     arch = fopen (archive, "r");
    526   1.1       cgd     if (arch == (FILE *) NULL) {
    527   1.1       cgd 	return ((struct ar_hdr *) NULL);
    528   1.1       cgd     }
    529   1.1       cgd 
    530   1.1       cgd     /*
    531   1.1       cgd      * We use the ARMAG string to make sure this is an archive we
    532   1.1       cgd      * can handle...
    533   1.1       cgd      */
    534   1.1       cgd     if ((fread (magic, SARMAG, 1, arch) != 1) ||
    535   1.1       cgd     	(strncmp (magic, ARMAG, SARMAG) != 0)) {
    536   1.1       cgd 	    fclose (arch);
    537   1.1       cgd 	    return ((struct ar_hdr *) NULL);
    538   1.1       cgd     }
    539   1.1       cgd 
    540   1.1       cgd     ar = (Arch *)emalloc (sizeof (Arch));
    541   1.1       cgd     ar->name = strdup (archive);
    542   1.1       cgd     Hash_InitTable (&ar->members, -1);
    543   1.1       cgd     memName[AR_MAX_NAME_LEN] = '\0';
    544   1.1       cgd 
    545   1.1       cgd     while (fread ((char *)&arh, sizeof (struct ar_hdr), 1, arch) == 1) {
    546   1.1       cgd 	if (strncmp ( arh.ar_fmag, ARFMAG, sizeof (arh.ar_fmag)) != 0) {
    547   1.1       cgd 				 /*
    548   1.1       cgd 				  * The header is bogus, so the archive is bad
    549   1.1       cgd 				  * and there's no way we can recover...
    550   1.1       cgd 				  */
    551   1.1       cgd 				 fclose (arch);
    552   1.1       cgd 				 Hash_DeleteTable (&ar->members);
    553   1.1       cgd 				 free ((Address)ar);
    554   1.1       cgd 				 return ((struct ar_hdr *) NULL);
    555   1.1       cgd 	} else {
    556   1.1       cgd 	    (void) strncpy (memName, arh.ar_name, sizeof(arh.ar_name));
    557   1.1       cgd 	    for (cp = &memName[AR_MAX_NAME_LEN]; *cp == ' '; cp--) {
    558   1.1       cgd 		continue;
    559   1.1       cgd 	    }
    560   1.1       cgd 	    cp[1] = '\0';
    561   1.1       cgd 
    562   1.6        pk #ifdef AR_EFMT1
    563   1.6        pk 	    /*
    564   1.6        pk 	     * BSD 4.4 extended AR format: #1/<namelen>, with name as the
    565   1.6        pk 	     * first <namelen> bytes of the file
    566   1.6        pk 	     */
    567   1.6        pk 	    if (strncmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
    568   1.6        pk 		isdigit(memName[sizeof(AR_EFMT1) - 1])) {
    569   1.6        pk 
    570   1.6        pk 		unsigned int elen = atoi(&memName[sizeof(AR_EFMT1)-1]);
    571   1.6        pk 
    572   1.6        pk 		if (elen > MAXPATHLEN) {
    573   1.6        pk 			fclose (arch);
    574   1.6        pk 			Hash_DeleteTable (&ar->members);
    575   1.6        pk 			free ((Address)ar);
    576   1.6        pk 			return ((struct ar_hdr *) NULL);
    577   1.6        pk 		}
    578   1.6        pk 		if (fread (memName, elen, 1, arch) != 1) {
    579   1.6        pk 			fclose (arch);
    580   1.6        pk 			Hash_DeleteTable (&ar->members);
    581   1.6        pk 			free ((Address)ar);
    582   1.6        pk 			return ((struct ar_hdr *) NULL);
    583   1.6        pk 		}
    584   1.6        pk 		memName[elen] = '\0';
    585   1.6        pk 		fseek (arch, -elen, 1);
    586   1.6        pk 		if (DEBUG(ARCH) || DEBUG(MAKE)) {
    587   1.6        pk 		    printf("ArchStat: Extended format entry for %s\n", memName);
    588   1.6        pk 		}
    589   1.6        pk 	    }
    590   1.6        pk #endif
    591   1.6        pk 
    592   1.7       jtc 	    he = Hash_CreateEntry (&ar->members, memName, (Boolean *)NULL);
    593   1.1       cgd 	    Hash_SetValue (he, (ClientData)emalloc (sizeof (struct ar_hdr)));
    594   1.6        pk 	    memcpy ((Address)Hash_GetValue (he), (Address)&arh,
    595   1.1       cgd 		sizeof (struct ar_hdr));
    596   1.1       cgd 	}
    597   1.1       cgd 	/*
    598   1.1       cgd 	 * We need to advance the stream's pointer to the start of the
    599   1.1       cgd 	 * next header. Files are padded with newlines to an even-byte
    600   1.1       cgd 	 * boundary, so we need to extract the size of the file from the
    601   1.1       cgd 	 * 'size' field of the header and round it up during the seek.
    602   1.1       cgd 	 */
    603   1.1       cgd 	arh.ar_size[sizeof(arh.ar_size)-1] = '\0';
    604   1.7       jtc 	size = (int) strtol(arh.ar_size, NULL, 10);
    605   1.1       cgd 	fseek (arch, (size + 1) & ~1, 1);
    606   1.1       cgd     }
    607   1.1       cgd 
    608   1.1       cgd     fclose (arch);
    609   1.1       cgd 
    610   1.1       cgd     (void) Lst_AtEnd (archives, (ClientData) ar);
    611   1.1       cgd 
    612   1.1       cgd     /*
    613   1.1       cgd      * Now that the archive has been read and cached, we can look into
    614   1.1       cgd      * the hash table to find the desired member's header.
    615   1.1       cgd      */
    616   1.1       cgd     he = Hash_FindEntry (&ar->members, member);
    617   1.1       cgd 
    618   1.1       cgd     if (he != (Hash_Entry *) NULL) {
    619   1.1       cgd 	return ((struct ar_hdr *) Hash_GetValue (he));
    620   1.1       cgd     } else {
    621   1.1       cgd 	return ((struct ar_hdr *) NULL);
    622   1.1       cgd     }
    623   1.1       cgd }
    624   1.1       cgd 
    625   1.1       cgd /*-
    626   1.1       cgd  *-----------------------------------------------------------------------
    627   1.1       cgd  * ArchFindMember --
    628   1.1       cgd  *	Locate a member of an archive, given the path of the archive and
    629   1.1       cgd  *	the path of the desired member. If the archive is to be modified,
    630   1.1       cgd  *	the mode should be "r+", if not, it should be "r".
    631   1.1       cgd  *
    632   1.1       cgd  * Results:
    633   1.1       cgd  *	An FILE *, opened for reading and writing, positioned at the
    634   1.1       cgd  *	start of the member's struct ar_hdr, or NULL if the member was
    635   1.1       cgd  *	nonexistent. The current struct ar_hdr for member.
    636   1.1       cgd  *
    637   1.1       cgd  * Side Effects:
    638   1.1       cgd  *	The passed struct ar_hdr structure is filled in.
    639   1.1       cgd  *
    640   1.1       cgd  *-----------------------------------------------------------------------
    641   1.1       cgd  */
    642   1.1       cgd static FILE *
    643   1.1       cgd ArchFindMember (archive, member, arhPtr, mode)
    644   1.1       cgd     char	  *archive;   /* Path to the archive */
    645   1.1       cgd     char	  *member;    /* Name of member. If it is a path, only the
    646   1.1       cgd 			       * last component is used. */
    647   1.1       cgd     struct ar_hdr *arhPtr;    /* Pointer to header structure to be filled in */
    648   1.1       cgd     char	  *mode;      /* The mode for opening the stream */
    649   1.1       cgd {
    650   1.1       cgd     FILE *	  arch;	      /* Stream to archive */
    651   1.1       cgd     int		  size;       /* Size of archive member */
    652   1.1       cgd     char	  *cp;	      /* Useful character pointer */
    653   1.1       cgd     char	  magic[SARMAG];
    654   1.6        pk     int		  len, tlen;
    655   1.1       cgd 
    656   1.1       cgd     arch = fopen (archive, mode);
    657   1.1       cgd     if (arch == (FILE *) NULL) {
    658   1.1       cgd 	return ((FILE *) NULL);
    659   1.1       cgd     }
    660   1.1       cgd 
    661   1.1       cgd     /*
    662   1.1       cgd      * We use the ARMAG string to make sure this is an archive we
    663   1.1       cgd      * can handle...
    664   1.1       cgd      */
    665   1.1       cgd     if ((fread (magic, SARMAG, 1, arch) != 1) ||
    666   1.1       cgd     	(strncmp (magic, ARMAG, SARMAG) != 0)) {
    667   1.1       cgd 	    fclose (arch);
    668   1.1       cgd 	    return ((FILE *) NULL);
    669   1.1       cgd     }
    670   1.1       cgd 
    671   1.1       cgd     /*
    672   1.1       cgd      * Because of space constraints and similar things, files are archived
    673   1.1       cgd      * using their final path components, not the entire thing, so we need
    674   1.1       cgd      * to point 'member' to the final component, if there is one, to make
    675   1.1       cgd      * the comparisons easier...
    676   1.1       cgd      */
    677   1.5       cgd     cp = strrchr (member, '/');
    678   1.1       cgd     if (cp != (char *) NULL) {
    679   1.1       cgd 	member = cp + 1;
    680   1.1       cgd     }
    681   1.6        pk     len = tlen = strlen (member);
    682   1.1       cgd     if (len > sizeof (arhPtr->ar_name)) {
    683   1.6        pk 	tlen = sizeof (arhPtr->ar_name);
    684   1.1       cgd     }
    685   1.1       cgd 
    686   1.1       cgd     while (fread ((char *)arhPtr, sizeof (struct ar_hdr), 1, arch) == 1) {
    687   1.1       cgd 	if (strncmp(arhPtr->ar_fmag, ARFMAG, sizeof (arhPtr->ar_fmag) ) != 0) {
    688   1.1       cgd 	     /*
    689   1.1       cgd 	      * The header is bogus, so the archive is bad
    690   1.1       cgd 	      * and there's no way we can recover...
    691   1.1       cgd 	      */
    692   1.1       cgd 	     fclose (arch);
    693   1.1       cgd 	     return ((FILE *) NULL);
    694   1.6        pk 	} else if (strncmp (member, arhPtr->ar_name, tlen) == 0) {
    695   1.1       cgd 	    /*
    696   1.1       cgd 	     * If the member's name doesn't take up the entire 'name' field,
    697   1.1       cgd 	     * we have to be careful of matching prefixes. Names are space-
    698   1.1       cgd 	     * padded to the right, so if the character in 'name' at the end
    699   1.1       cgd 	     * of the matched string is anything but a space, this isn't the
    700   1.1       cgd 	     * member we sought.
    701   1.1       cgd 	     */
    702   1.6        pk 	    if (tlen != sizeof(arhPtr->ar_name) && arhPtr->ar_name[tlen] != ' '){
    703   1.6        pk 		goto skip;
    704   1.1       cgd 	    } else {
    705   1.1       cgd 		/*
    706   1.1       cgd 		 * To make life easier, we reposition the file at the start
    707   1.1       cgd 		 * of the header we just read before we return the stream.
    708   1.1       cgd 		 * In a more general situation, it might be better to leave
    709   1.1       cgd 		 * the file at the actual member, rather than its header, but
    710   1.1       cgd 		 * not here...
    711   1.1       cgd 		 */
    712   1.1       cgd 		fseek (arch, -sizeof(struct ar_hdr), 1);
    713   1.1       cgd 		return (arch);
    714   1.1       cgd 	    }
    715   1.6        pk 	} else
    716   1.6        pk #ifdef AR_EFMT1
    717   1.6        pk 		/*
    718   1.6        pk 		 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
    719   1.6        pk 		 * first <namelen> bytes of the file
    720   1.6        pk 		 */
    721   1.6        pk 	    if (strncmp(arhPtr->ar_name, AR_EFMT1,
    722   1.6        pk 					sizeof(AR_EFMT1) - 1) == 0 &&
    723   1.6        pk 		isdigit(arhPtr->ar_name[sizeof(AR_EFMT1) - 1])) {
    724   1.6        pk 
    725   1.6        pk 		unsigned int elen = atoi(&arhPtr->ar_name[sizeof(AR_EFMT1)-1]);
    726   1.6        pk 		char ename[MAXPATHLEN];
    727   1.6        pk 
    728   1.6        pk 		if (elen > MAXPATHLEN) {
    729   1.6        pk 			fclose (arch);
    730   1.6        pk 			return NULL;
    731   1.6        pk 		}
    732   1.6        pk 		if (fread (ename, elen, 1, arch) != 1) {
    733   1.6        pk 			fclose (arch);
    734   1.6        pk 			return NULL;
    735   1.6        pk 		}
    736   1.6        pk 		ename[elen] = '\0';
    737   1.6        pk 		if (DEBUG(ARCH) || DEBUG(MAKE)) {
    738   1.6        pk 		    printf("ArchFind: Extended format entry for %s\n", ename);
    739   1.6        pk 		}
    740   1.6        pk 		if (strncmp(ename, member, len) == 0) {
    741   1.6        pk 			/* Found as extended name */
    742   1.6        pk 			fseek (arch, -sizeof(struct ar_hdr) - elen, 1);
    743   1.6        pk 			return (arch);
    744   1.6        pk 		}
    745   1.6        pk 		fseek (arch, -elen, 1);
    746   1.6        pk 		goto skip;
    747   1.6        pk 	} else
    748   1.6        pk #endif
    749   1.6        pk 	{
    750   1.6        pk skip:
    751   1.1       cgd 	    /*
    752   1.1       cgd 	     * This isn't the member we're after, so we need to advance the
    753   1.1       cgd 	     * stream's pointer to the start of the next header. Files are
    754   1.1       cgd 	     * padded with newlines to an even-byte boundary, so we need to
    755   1.1       cgd 	     * extract the size of the file from the 'size' field of the
    756   1.1       cgd 	     * header and round it up during the seek.
    757   1.1       cgd 	     */
    758   1.1       cgd 	    arhPtr->ar_size[sizeof(arhPtr->ar_size)-1] = '\0';
    759   1.7       jtc 	    size = (int) strtol(arhPtr->ar_size, NULL, 10);
    760   1.1       cgd 	    fseek (arch, (size + 1) & ~1, 1);
    761   1.1       cgd 	}
    762   1.1       cgd     }
    763   1.1       cgd 
    764   1.1       cgd     /*
    765   1.1       cgd      * We've looked everywhere, but the member is not to be found. Close the
    766   1.1       cgd      * archive and return NULL -- an error.
    767   1.1       cgd      */
    768   1.1       cgd     fclose (arch);
    769   1.1       cgd     return ((FILE *) NULL);
    770   1.1       cgd }
    771   1.1       cgd 
    772   1.1       cgd /*-
    773   1.1       cgd  *-----------------------------------------------------------------------
    774   1.1       cgd  * Arch_Touch --
    775   1.1       cgd  *	Touch a member of an archive.
    776   1.1       cgd  *
    777   1.1       cgd  * Results:
    778   1.1       cgd  *	The 'time' field of the member's header is updated.
    779   1.1       cgd  *
    780   1.1       cgd  * Side Effects:
    781   1.1       cgd  *	The modification time of the entire archive is also changed.
    782   1.1       cgd  *	For a library, this could necessitate the re-ranlib'ing of the
    783   1.1       cgd  *	whole thing.
    784   1.1       cgd  *
    785   1.1       cgd  *-----------------------------------------------------------------------
    786   1.1       cgd  */
    787   1.1       cgd void
    788   1.1       cgd Arch_Touch (gn)
    789   1.1       cgd     GNode	  *gn;	  /* Node of member to touch */
    790   1.1       cgd {
    791   1.1       cgd     FILE *	  arch;	  /* Stream open to archive, positioned properly */
    792   1.1       cgd     struct ar_hdr arh;	  /* Current header describing member */
    793   1.7       jtc     char *p1, *p2;
    794   1.1       cgd 
    795   1.7       jtc     arch = ArchFindMember(Var_Value (ARCHIVE, gn, &p1),
    796   1.7       jtc 			  Var_Value (TARGET, gn, &p2),
    797   1.1       cgd 			  &arh, "r+");
    798   1.7       jtc     if (p1)
    799   1.7       jtc 	free(p1);
    800   1.7       jtc     if (p2)
    801   1.7       jtc 	free(p2);
    802   1.5       cgd     sprintf(arh.ar_date, "%-12ld", (long) now);
    803   1.1       cgd 
    804   1.1       cgd     if (arch != (FILE *) NULL) {
    805   1.1       cgd 	(void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
    806   1.1       cgd 	fclose (arch);
    807   1.1       cgd     }
    808   1.1       cgd }
    809   1.1       cgd 
    810   1.1       cgd /*-
    811   1.1       cgd  *-----------------------------------------------------------------------
    812   1.1       cgd  * Arch_TouchLib --
    813   1.1       cgd  *	Given a node which represents a library, touch the thing, making
    814   1.1       cgd  *	sure that the table of contents also is touched.
    815   1.1       cgd  *
    816   1.1       cgd  * Results:
    817   1.1       cgd  *	None.
    818   1.1       cgd  *
    819   1.1       cgd  * Side Effects:
    820   1.1       cgd  *	Both the modification time of the library and of the RANLIBMAG
    821   1.1       cgd  *	member are set to 'now'.
    822   1.1       cgd  *
    823   1.1       cgd  *-----------------------------------------------------------------------
    824   1.1       cgd  */
    825   1.1       cgd void
    826   1.1       cgd Arch_TouchLib (gn)
    827   1.1       cgd     GNode	    *gn;      	/* The node of the library to touch */
    828   1.1       cgd {
    829   1.1       cgd     FILE *	    arch;	/* Stream open to archive */
    830   1.1       cgd     struct ar_hdr   arh;      	/* Header describing table of contents */
    831   1.1       cgd     struct timeval  times[2];	/* Times for utimes() call */
    832   1.1       cgd 
    833   1.1       cgd     arch = ArchFindMember (gn->path, RANLIBMAG, &arh, "r+");
    834   1.5       cgd     sprintf(arh.ar_date, "%-12ld", (long) now);
    835   1.1       cgd 
    836   1.1       cgd     if (arch != (FILE *) NULL) {
    837   1.1       cgd 	(void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
    838   1.1       cgd 	fclose (arch);
    839   1.1       cgd 
    840   1.1       cgd 	times[0].tv_sec = times[1].tv_sec = now;
    841   1.1       cgd 	times[0].tv_usec = times[1].tv_usec = 0;
    842   1.1       cgd 	utimes(gn->path, times);
    843   1.1       cgd     }
    844   1.1       cgd }
    845   1.1       cgd 
    846   1.1       cgd /*-
    847   1.1       cgd  *-----------------------------------------------------------------------
    848   1.1       cgd  * Arch_MTime --
    849   1.1       cgd  *	Return the modification time of a member of an archive.
    850   1.1       cgd  *
    851   1.1       cgd  * Results:
    852   1.1       cgd  *	The modification time (seconds).
    853   1.1       cgd  *
    854   1.1       cgd  * Side Effects:
    855   1.1       cgd  *	The mtime field of the given node is filled in with the value
    856   1.1       cgd  *	returned by the function.
    857   1.1       cgd  *
    858   1.1       cgd  *-----------------------------------------------------------------------
    859   1.1       cgd  */
    860   1.1       cgd int
    861   1.1       cgd Arch_MTime (gn)
    862   1.1       cgd     GNode	  *gn;	      /* Node describing archive member */
    863   1.1       cgd {
    864   1.1       cgd     struct ar_hdr *arhPtr;    /* Header of desired member */
    865   1.1       cgd     int		  modTime;    /* Modification time as an integer */
    866   1.7       jtc     char *p1, *p2;
    867   1.1       cgd 
    868   1.7       jtc     arhPtr = ArchStatMember (Var_Value (ARCHIVE, gn, &p1),
    869   1.7       jtc 			     Var_Value (TARGET, gn, &p2),
    870   1.1       cgd 			     TRUE);
    871   1.7       jtc     if (p1)
    872   1.7       jtc 	free(p1);
    873   1.7       jtc     if (p2)
    874   1.7       jtc 	free(p2);
    875   1.7       jtc 
    876   1.1       cgd     if (arhPtr != (struct ar_hdr *) NULL) {
    877   1.7       jtc 	modTime = (int) strtol(arhPtr->ar_date, NULL, 10);
    878   1.1       cgd     } else {
    879   1.1       cgd 	modTime = 0;
    880   1.1       cgd     }
    881   1.1       cgd 
    882   1.1       cgd     gn->mtime = modTime;
    883   1.1       cgd     return (modTime);
    884   1.1       cgd }
    885   1.1       cgd 
    886   1.1       cgd /*-
    887   1.1       cgd  *-----------------------------------------------------------------------
    888   1.1       cgd  * Arch_MemMTime --
    889   1.1       cgd  *	Given a non-existent archive member's node, get its modification
    890   1.1       cgd  *	time from its archived form, if it exists.
    891   1.1       cgd  *
    892   1.1       cgd  * Results:
    893   1.1       cgd  *	The modification time.
    894   1.1       cgd  *
    895   1.1       cgd  * Side Effects:
    896   1.1       cgd  *	The mtime field is filled in.
    897   1.1       cgd  *
    898   1.1       cgd  *-----------------------------------------------------------------------
    899   1.1       cgd  */
    900   1.1       cgd int
    901   1.1       cgd Arch_MemMTime (gn)
    902   1.1       cgd     GNode   	  *gn;
    903   1.1       cgd {
    904   1.1       cgd     LstNode 	  ln;
    905   1.1       cgd     GNode   	  *pgn;
    906   1.1       cgd     char    	  *nameStart,
    907   1.1       cgd 		  *nameEnd;
    908   1.1       cgd 
    909   1.1       cgd     if (Lst_Open (gn->parents) != SUCCESS) {
    910   1.1       cgd 	gn->mtime = 0;
    911   1.1       cgd 	return (0);
    912   1.1       cgd     }
    913   1.1       cgd     while ((ln = Lst_Next (gn->parents)) != NILLNODE) {
    914   1.1       cgd 	pgn = (GNode *) Lst_Datum (ln);
    915   1.1       cgd 
    916   1.1       cgd 	if (pgn->type & OP_ARCHV) {
    917   1.1       cgd 	    /*
    918   1.1       cgd 	     * If the parent is an archive specification and is being made
    919   1.1       cgd 	     * and its member's name matches the name of the node we were
    920   1.1       cgd 	     * given, record the modification time of the parent in the
    921   1.1       cgd 	     * child. We keep searching its parents in case some other
    922   1.1       cgd 	     * parent requires this child to exist...
    923   1.1       cgd 	     */
    924   1.5       cgd 	    nameStart = strchr (pgn->name, '(') + 1;
    925   1.5       cgd 	    nameEnd = strchr (nameStart, ')');
    926   1.1       cgd 
    927   1.1       cgd 	    if (pgn->make &&
    928   1.1       cgd 		strncmp(nameStart, gn->name, nameEnd - nameStart) == 0) {
    929   1.1       cgd 				     gn->mtime = Arch_MTime(pgn);
    930   1.1       cgd 	    }
    931   1.1       cgd 	} else if (pgn->make) {
    932   1.1       cgd 	    /*
    933   1.1       cgd 	     * Something which isn't a library depends on the existence of
    934   1.1       cgd 	     * this target, so it needs to exist.
    935   1.1       cgd 	     */
    936   1.1       cgd 	    gn->mtime = 0;
    937   1.1       cgd 	    break;
    938   1.1       cgd 	}
    939   1.1       cgd     }
    940   1.1       cgd 
    941   1.1       cgd     Lst_Close (gn->parents);
    942   1.1       cgd 
    943   1.1       cgd     return (gn->mtime);
    944   1.1       cgd }
    945   1.1       cgd 
    946   1.1       cgd /*-
    947   1.1       cgd  *-----------------------------------------------------------------------
    948   1.1       cgd  * Arch_FindLib --
    949   1.1       cgd  *	Search for a library along the given search path.
    950   1.1       cgd  *
    951   1.1       cgd  * Results:
    952   1.1       cgd  *	None.
    953   1.1       cgd  *
    954   1.1       cgd  * Side Effects:
    955   1.1       cgd  *	The node's 'path' field is set to the found path (including the
    956   1.1       cgd  *	actual file name, not -l...). If the system can handle the -L
    957   1.1       cgd  *	flag when linking (or we cannot find the library), we assume that
    958   1.1       cgd  *	the user has placed the .LIBRARIES variable in the final linking
    959   1.1       cgd  *	command (or the linker will know where to find it) and set the
    960   1.1       cgd  *	TARGET variable for this node to be the node's name. Otherwise,
    961   1.1       cgd  *	we set the TARGET variable to be the full path of the library,
    962   1.1       cgd  *	as returned by Dir_FindFile.
    963   1.1       cgd  *
    964   1.1       cgd  *-----------------------------------------------------------------------
    965   1.1       cgd  */
    966   1.1       cgd void
    967   1.1       cgd Arch_FindLib (gn, path)
    968   1.1       cgd     GNode	    *gn;	      /* Node of library to find */
    969   1.1       cgd     Lst	    	    path;	      /* Search path */
    970   1.1       cgd {
    971   1.1       cgd     char	    *libName;   /* file name for archive */
    972   1.1       cgd 
    973   1.1       cgd     libName = (char *)emalloc (strlen (gn->name) + 6 - 2);
    974   1.1       cgd     sprintf(libName, "lib%s.a", &gn->name[2]);
    975   1.1       cgd 
    976   1.1       cgd     gn->path = Dir_FindFile (libName, path);
    977   1.1       cgd 
    978   1.1       cgd     free (libName);
    979   1.1       cgd 
    980   1.1       cgd #ifdef LIBRARIES
    981   1.1       cgd     Var_Set (TARGET, gn->name, gn);
    982   1.1       cgd #else
    983   1.1       cgd     Var_Set (TARGET, gn->path == (char *) NULL ? gn->name : gn->path, gn);
    984   1.1       cgd #endif LIBRARIES
    985   1.1       cgd }
    986   1.1       cgd 
    987   1.1       cgd /*-
    988   1.1       cgd  *-----------------------------------------------------------------------
    989   1.1       cgd  * Arch_LibOODate --
    990   1.1       cgd  *	Decide if a node with the OP_LIB attribute is out-of-date. Called
    991   1.1       cgd  *	from Make_OODate to make its life easier.
    992   1.1       cgd  *
    993   1.1       cgd  *	There are several ways for a library to be out-of-date that are
    994   1.1       cgd  *	not available to ordinary files. In addition, there are ways
    995   1.1       cgd  *	that are open to regular files that are not available to
    996   1.1       cgd  *	libraries. A library that is only used as a source is never
    997   1.1       cgd  *	considered out-of-date by itself. This does not preclude the
    998   1.1       cgd  *	library's modification time from making its parent be out-of-date.
    999   1.1       cgd  *	A library will be considered out-of-date for any of these reasons,
   1000   1.1       cgd  *	given that it is a target on a dependency line somewhere:
   1001   1.1       cgd  *	    Its modification time is less than that of one of its
   1002   1.1       cgd  *	    	  sources (gn->mtime < gn->cmtime).
   1003   1.1       cgd  *	    Its modification time is greater than the time at which the
   1004   1.1       cgd  *	    	  make began (i.e. it's been modified in the course
   1005   1.1       cgd  *	    	  of the make, probably by archiving).
   1006   1.8  christos  *	    The modification time of one of its sources is greater than
   1007   1.8  christos  *		  the one of its RANLIBMAG member (i.e. its table of contents
   1008   1.8  christos  *	    	  is out-of-date). We don't compare of the archive time
   1009   1.8  christos  *		  vs. TOC time because they can be too close. In my
   1010   1.8  christos  *		  opinion we should not bother with the TOC at all since
   1011   1.8  christos  *		  this is used by 'ar' rules that affect the data contents
   1012   1.8  christos  *		  of the archive, not by ranlib rules, which affect the
   1013   1.8  christos  *		  TOC.
   1014   1.1       cgd  *
   1015   1.1       cgd  * Results:
   1016   1.1       cgd  *	TRUE if the library is out-of-date. FALSE otherwise.
   1017   1.1       cgd  *
   1018   1.1       cgd  * Side Effects:
   1019   1.1       cgd  *	The library will be hashed if it hasn't been already.
   1020   1.1       cgd  *
   1021   1.1       cgd  *-----------------------------------------------------------------------
   1022   1.1       cgd  */
   1023   1.1       cgd Boolean
   1024   1.1       cgd Arch_LibOODate (gn)
   1025   1.1       cgd     GNode   	  *gn;  	/* The library's graph node */
   1026   1.1       cgd {
   1027   1.1       cgd     Boolean 	  oodate;
   1028   1.1       cgd 
   1029   1.1       cgd     if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) {
   1030   1.1       cgd 	oodate = FALSE;
   1031   1.1       cgd     } else if ((gn->mtime > now) || (gn->mtime < gn->cmtime)) {
   1032   1.1       cgd 	oodate = TRUE;
   1033   1.1       cgd     } else {
   1034   1.1       cgd 	struct ar_hdr  	*arhPtr;    /* Header for __.SYMDEF */
   1035   1.1       cgd 	int 	  	modTimeTOC; /* The table-of-contents's mod time */
   1036   1.1       cgd 
   1037   1.1       cgd 	arhPtr = ArchStatMember (gn->path, RANLIBMAG, FALSE);
   1038   1.1       cgd 
   1039   1.1       cgd 	if (arhPtr != (struct ar_hdr *)NULL) {
   1040   1.7       jtc 	    modTimeTOC = (int) strtol(arhPtr->ar_date, NULL, 10);
   1041   1.1       cgd 
   1042   1.1       cgd 	    if (DEBUG(ARCH) || DEBUG(MAKE)) {
   1043   1.1       cgd 		printf("%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC));
   1044   1.1       cgd 	    }
   1045   1.8  christos 	    oodate = (gn->cmtime > modTimeTOC);
   1046   1.1       cgd 	} else {
   1047   1.1       cgd 	    /*
   1048   1.1       cgd 	     * A library w/o a table of contents is out-of-date
   1049   1.1       cgd 	     */
   1050   1.1       cgd 	    if (DEBUG(ARCH) || DEBUG(MAKE)) {
   1051   1.1       cgd 		printf("No t.o.c....");
   1052   1.1       cgd 	    }
   1053   1.1       cgd 	    oodate = TRUE;
   1054   1.1       cgd 	}
   1055   1.1       cgd     }
   1056   1.1       cgd     return (oodate);
   1057   1.1       cgd }
   1058   1.1       cgd 
   1059   1.1       cgd /*-
   1060   1.1       cgd  *-----------------------------------------------------------------------
   1061   1.1       cgd  * Arch_Init --
   1062   1.1       cgd  *	Initialize things for this module.
   1063   1.1       cgd  *
   1064   1.1       cgd  * Results:
   1065   1.1       cgd  *	None.
   1066   1.1       cgd  *
   1067   1.1       cgd  * Side Effects:
   1068   1.1       cgd  *	The 'archives' list is initialized.
   1069   1.1       cgd  *
   1070   1.1       cgd  *-----------------------------------------------------------------------
   1071   1.1       cgd  */
   1072   1.1       cgd void
   1073   1.1       cgd Arch_Init ()
   1074   1.1       cgd {
   1075   1.1       cgd     archives = Lst_Init (FALSE);
   1076   1.7       jtc }
   1077   1.7       jtc 
   1078   1.7       jtc 
   1079   1.7       jtc 
   1080   1.7       jtc /*-
   1081   1.7       jtc  *-----------------------------------------------------------------------
   1082   1.7       jtc  * Arch_End --
   1083   1.7       jtc  *	Cleanup things for this module.
   1084   1.7       jtc  *
   1085   1.7       jtc  * Results:
   1086   1.7       jtc  *	None.
   1087   1.7       jtc  *
   1088   1.7       jtc  * Side Effects:
   1089   1.7       jtc  *	The 'archives' list is freed
   1090   1.7       jtc  *
   1091   1.7       jtc  *-----------------------------------------------------------------------
   1092   1.7       jtc  */
   1093   1.7       jtc void
   1094   1.7       jtc Arch_End ()
   1095   1.7       jtc {
   1096   1.7       jtc     Lst_Destroy(archives, ArchFree);
   1097   1.1       cgd }
   1098