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