1 /* $NetBSD: arch.c,v 1.63 2012/06/12 19:21:50 joerg Exp $ */
4 * Copyright (c) 1988, 1989, 1990, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * Copyright (c) 1989 by Berkeley Softworks
37 * All rights reserved.
39 * This code is derived from software contributed to Berkeley by
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by the University of
53 * California, Berkeley and its contributors.
54 * 4. Neither the name of the University nor the names of its contributors
55 * may be used to endorse or promote products derived from this software
56 * without specific prior written permission.
58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
72 static char rcsid[] = "$NetBSD: arch.c,v 1.63 2012/06/12 19:21:50 joerg Exp $";
74 #include <sys/cdefs.h>
77 static char sccsid[] = "@(#)arch.c 8.2 (Berkeley) 1/2/94";
79 __RCSID("$NetBSD: arch.c,v 1.63 2012/06/12 19:21:50 joerg Exp $");
86 * Functions to manipulate libraries, archives and their members.
88 * Once again, cacheing/hashing comes into play in the manipulation
89 * of archives. The first time an archive is referenced, all of its members'
90 * headers are read and hashed and the archive closed again. All hashed
91 * archives are kept on a list which is searched each time an archive member
94 * The interface to this module is:
95 * Arch_ParseArchive Given an archive specification, return a list
96 * of GNode's, one for each member in the spec.
97 * FAILURE is returned if the specification is
98 * invalid for some reason.
100 * Arch_Touch Alter the modification time of the archive
101 * member described by the given node to be
104 * Arch_TouchLib Update the modification time of the library
105 * described by the given node. This is special
106 * because it also updates the modification time
107 * of the library's table of contents.
109 * Arch_MTime Find the modification time of a member of
110 * an archive *in the archive*. The time is also
111 * placed in the member's GNode. Returns the
114 * Arch_MemTime Find the modification time of a member of
115 * an archive. Called when the member doesn't
116 * already exist. Looks in the archive for the
117 * modification time. Returns the modification
120 * Arch_FindLib Search for a library along a path. The
121 * library name in the GNode should be in
124 * Arch_LibOODate Special function to decide if a library node
127 * Arch_Init Initialize this module.
129 * Arch_End Cleanup this module.
135 #include <sys/types.h>
136 #include <sys/stat.h>
137 #include <sys/time.h>
138 #include <sys/param.h>
144 char ar_name[16]; /* name */
145 char ar_date[12]; /* modification time */
146 char ar_uid[6]; /* user id */
147 char ar_gid[6]; /* group id */
148 char ar_mode[8]; /* octal file permissions */
149 char ar_size[10]; /* size in bytes */
153 char ar_fmag[2]; /* consistency check */
156 #if defined(HAVE_RANLIB_H) && !(defined(__ELF__) || defined(NO_RANLIB))
170 #ifdef TARGET_MACHINE
172 #define MAKE_MACHINE TARGET_MACHINE
174 #ifdef TARGET_MACHINE_ARCH
175 #undef MAKE_MACHINE_ARCH
176 #define MAKE_MACHINE_ARCH TARGET_MACHINE_ARCH
179 static Lst archives; /* Lst of archives we've already examined */
181 typedef struct Arch {
182 char *name; /* Name of archive */
183 Hash_Table members; /* All the members of the archive described
184 * by <name, struct ar_hdr *> key/value pairs */
185 char *fnametab; /* Extended name table strings */
186 size_t fnamesize; /* Size of the string table */
189 static int ArchFindArchive(const void *, const void *);
191 static void ArchFree(void *);
193 static struct ar_hdr *ArchStatMember(char *, char *, Boolean);
194 static FILE *ArchFindMember(char *, char *, struct ar_hdr *, const char *);
195 #if defined(__svr4__) || defined(__SVR4) || defined(__ELF__)
197 static int ArchSVR4Entry(Arch *, char *, size_t, FILE *);
202 # define AR_NAME _ar_name.ar_name
203 # define AR_FMAG _ar_name.ar_fmag
204 # define SARMAG SAIAMAG
205 # define ARMAG AIAMAG
206 # define ARFMAG AIAFMAG
209 # define AR_NAME ar_name
212 # define AR_DATE ar_date
215 # define AR_SIZE ar_size
218 # define AR_FMAG ar_fmag
221 # define ARMAG "!<arch>\n"
227 #define AR_MAX_NAME_LEN (sizeof(arh.AR_NAME)-1)
231 *-----------------------------------------------------------------------
233 * Free memory used by an archive
241 *-----------------------------------------------------------------------
246 Arch *a = (Arch *)ap;
250 /* Free memory from hash entries */
251 for (entry = Hash_EnumFirst(&a->members, &search);
253 entry = Hash_EnumNext(&search))
254 free(Hash_GetValue(entry));
259 Hash_DeleteTable(&a->members);
266 *-----------------------------------------------------------------------
267 * Arch_ParseArchive --
268 * Parse the archive specification in the given line and find/create
269 * the nodes for the specified archive members, placing their nodes
273 * linePtr Pointer to start of specification
274 * nodeLst Lst on which to place the nodes
275 * ctxt Context in which to expand variables
278 * SUCCESS if it was a valid specification. The linePtr is updated
279 * to point to the first non-space after the archive spec. The
280 * nodes for the members are placed on the given list.
283 * Some nodes may be created. The given list is extended.
285 *-----------------------------------------------------------------------
288 Arch_ParseArchive(char **linePtr, Lst nodeLst, GNode *ctxt)
290 char *cp; /* Pointer into line */
291 GNode *gn; /* New node */
292 char *libName; /* Library-part of specification */
293 char *memName; /* Member-part of specification */
294 char *nameBuf; /* temporary place for node name */
295 char saveChar; /* Ending delimiter of member-name */
296 Boolean subLibName; /* TRUE if libName should have/had
297 * variable substitution performed on it */
303 for (cp = libName; *cp != '(' && *cp != '\0'; cp++) {
306 * Variable spec, so call the Var module to parse the puppy
307 * so we can safely advance beyond it...
313 result = Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
316 if (result == var_Error) {
328 libName = Var_Subst(NULL, libName, ctxt, TRUE);
334 * First skip to the start of the member's name, mark that
335 * place and skip to the end of it (either white-space or
338 Boolean doSubst = FALSE; /* TRUE if need to substitute in memName */
340 while (*cp != '\0' && *cp != ')' && isspace ((unsigned char)*cp)) {
344 while (*cp != '\0' && *cp != ')' && !isspace ((unsigned char)*cp)) {
347 * Variable spec, so call the Var module to parse the puppy
348 * so we can safely advance beyond it...
354 result = Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
357 if (result == var_Error) {
370 * If the specification ends without a closing parenthesis,
371 * chances are there's something wrong (like a missing backslash),
372 * so it's better to return failure than allow such things to happen
375 printf("No closing parenthesis in archive specification\n");
380 * If we didn't move anywhere, we must be done
390 * XXX: This should be taken care of intelligently by
391 * SuffExpandChildren, both for the archive and the member portions.
394 * If member contains variables, try and substitute for them.
395 * This will slow down archive specs with dynamic sources, of course,
396 * since we'll be (non-)substituting them three times, but them's
397 * the breaks -- we need to do this since SuffExpandChildren calls
398 * us, otherwise we could assume the thing would be taken care of
404 char *oldMemName = memName;
407 memName = Var_Subst(NULL, memName, ctxt, TRUE);
410 * Now form an archive spec and recurse to deal with nested
411 * variables and multi-word variable values.... The results
412 * are just placed at the end of the nodeLst we're returning.
414 sz = strlen(memName)+strlen(libName)+3;
415 buf = sacrifice = bmake_malloc(sz);
417 snprintf(buf, sz, "%s(%s)", libName, memName);
419 if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) {
421 * Must contain dynamic sources, so we can't deal with it now.
422 * Just create an ARCHV node for the thing and let
423 * SuffExpandChildren handle it...
425 gn = Targ_FindNode(buf, TARG_CREATE);
431 gn->type |= OP_ARCHV;
432 (void)Lst_AtEnd(nodeLst, gn);
434 } else if (Arch_ParseArchive(&sacrifice, nodeLst, ctxt)!=SUCCESS) {
436 * Error in nested call -- free buffer and return FAILURE
443 * Free buffer and continue with our work.
446 } else if (Dir_HasWildcards(memName)) {
447 Lst members = Lst_Init(FALSE);
449 size_t sz = MAXPATHLEN, nsz;
450 nameBuf = bmake_malloc(sz);
452 Dir_Expand(memName, dirSearchPath, members);
453 while (!Lst_IsEmpty(members)) {
454 member = (char *)Lst_DeQueue(members);
455 nsz = strlen(libName) + strlen(member) + 3;
457 nameBuf = bmake_realloc(nameBuf, sz = nsz * 2);
459 snprintf(nameBuf, sz, "%s(%s)", libName, member);
461 gn = Targ_FindNode(nameBuf, TARG_CREATE);
467 * We've found the node, but have to make sure the rest of
468 * the world knows it's an archive member, without having
469 * to constantly check for parentheses, so we type the
470 * thing with the OP_ARCHV bit before we place it on the
471 * end of the provided list.
473 gn->type |= OP_ARCHV;
474 (void)Lst_AtEnd(nodeLst, gn);
477 Lst_Destroy(members, NULL);
480 size_t sz = strlen(libName) + strlen(memName) + 3;
481 nameBuf = bmake_malloc(sz);
482 snprintf(nameBuf, sz, "%s(%s)", libName, memName);
483 gn = Targ_FindNode(nameBuf, TARG_CREATE);
489 * We've found the node, but have to make sure the rest of the
490 * world knows it's an archive member, without having to
491 * constantly check for parentheses, so we type the thing with
492 * the OP_ARCHV bit before we place it on the end of the
495 gn->type |= OP_ARCHV;
496 (void)Lst_AtEnd(nodeLst, gn);
507 * If substituted libName, free it now, since we need it no longer.
514 * We promised the pointer would be set up at the next non-space, so
515 * we must advance cp there before setting *linePtr... (note that on
516 * entrance to the loop, cp is guaranteed to point at a ')')
520 } while (*cp != '\0' && isspace ((unsigned char)*cp));
527 *-----------------------------------------------------------------------
529 * See if the given archive is the one we are looking for. Called
530 * From ArchStatMember and ArchFindMember via Lst_Find.
533 * ar Current list element
534 * archName Name we want
537 * 0 if it is, non-zero if it isn't.
542 *-----------------------------------------------------------------------
545 ArchFindArchive(const void *ar, const void *archName)
547 return (strcmp(archName, ((const Arch *)ar)->name));
551 *-----------------------------------------------------------------------
553 * Locate a member of an archive, given the path of the archive and
554 * the path of the desired member.
557 * archive Path to the archive
558 * member Name of member. If it is a path, only the last
560 * hash TRUE if archive should be hashed if not already so.
563 * A pointer to the current struct ar_hdr structure for the member. Note
564 * That no position is returned, so this is not useful for touching
565 * archive members. This is mostly because we have no assurances that
566 * The archive will remain constant after we read all the headers, so
567 * there's not much point in remembering the position...
571 *-----------------------------------------------------------------------
573 static struct ar_hdr *
574 ArchStatMember(char *archive, char *member, Boolean hash)
576 FILE * arch; /* Stream to archive */
577 int size; /* Size of archive member */
578 char *cp; /* Useful character pointer */
580 LstNode ln; /* Lst member containing archive descriptor */
581 Arch *ar; /* Archive descriptor */
582 Hash_Entry *he; /* Entry containing member's description */
583 struct ar_hdr arh; /* archive-member header for reading archive */
584 char memName[MAXPATHLEN+1];
585 /* Current member name while hashing. */
588 * Because of space constraints and similar things, files are archived
589 * using their final path components, not the entire thing, so we need
590 * to point 'member' to the final component, if there is one, to make
591 * the comparisons easier...
593 cp = strrchr(member, '/');
598 ln = Lst_Find(archives, archive, ArchFindArchive);
600 ar = (Arch *)Lst_Datum(ln);
602 he = Hash_FindEntry(&ar->members, member);
605 return ((struct ar_hdr *)Hash_GetValue(he));
607 /* Try truncated name */
608 char copy[AR_MAX_NAME_LEN+1];
609 size_t len = strlen(member);
611 if (len > AR_MAX_NAME_LEN) {
612 len = AR_MAX_NAME_LEN;
613 strncpy(copy, member, AR_MAX_NAME_LEN);
614 copy[AR_MAX_NAME_LEN] = '\0';
616 if ((he = Hash_FindEntry(&ar->members, copy)) != NULL)
617 return ((struct ar_hdr *)Hash_GetValue(he));
624 * Caller doesn't want the thing hashed, just use ArchFindMember
625 * to read the header for the member out and close down the stream
626 * again. Since the archive is not to be hashed, we assume there's
627 * no need to allocate extra room for the header we're returning,
628 * so just declare it static.
630 static struct ar_hdr sarh;
632 arch = ArchFindMember(archive, member, &sarh, "r");
643 * We don't have this archive on the list yet, so we want to find out
644 * everything that's in it and cache it so we can get at it quickly.
646 arch = fopen(archive, "r");
652 * We use the ARMAG string to make sure this is an archive we
655 if ((fread(magic, SARMAG, 1, arch) != 1) ||
656 (strncmp(magic, ARMAG, SARMAG) != 0)) {
661 ar = bmake_malloc(sizeof(Arch));
662 ar->name = bmake_strdup(archive);
665 Hash_InitTable(&ar->members, -1);
666 memName[AR_MAX_NAME_LEN] = '\0';
668 while (fread((char *)&arh, sizeof(struct ar_hdr), 1, arch) == 1) {
669 if (strncmp( arh.AR_FMAG, ARFMAG, sizeof(arh.AR_FMAG)) != 0) {
671 * The header is bogus, so the archive is bad
672 * and there's no way we can recover...
677 * We need to advance the stream's pointer to the start of the
678 * next header. Files are padded with newlines to an even-byte
679 * boundary, so we need to extract the size of the file from the
680 * 'size' field of the header and round it up during the seek.
682 arh.AR_SIZE[sizeof(arh.AR_SIZE)-1] = '\0';
683 size = (int)strtol(arh.AR_SIZE, NULL, 10);
685 (void)strncpy(memName, arh.AR_NAME, sizeof(arh.AR_NAME));
686 for (cp = &memName[AR_MAX_NAME_LEN]; *cp == ' '; cp--) {
693 * svr4 names are slash terminated. Also svr4 extended AR format.
695 if (memName[0] == '/') {
697 * svr4 magic mode; handle it
699 switch (ArchSVR4Entry(ar, memName, size, arch)) {
700 case -1: /* Invalid data */
702 case 0: /* List of files entry */
704 default: /* Got the entry */
716 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
717 * first <namelen> bytes of the file
719 if (strncmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
720 isdigit((unsigned char)memName[sizeof(AR_EFMT1) - 1])) {
722 unsigned int elen = atoi(&memName[sizeof(AR_EFMT1)-1]);
724 if (elen > MAXPATHLEN)
726 if (fread(memName, elen, 1, arch) != 1)
728 memName[elen] = '\0';
729 fseek(arch, -elen, SEEK_CUR);
730 if (DEBUG(ARCH) || DEBUG(MAKE)) {
731 fprintf(debug_file, "ArchStat: Extended format entry for %s\n", memName);
736 he = Hash_CreateEntry(&ar->members, memName, NULL);
737 Hash_SetValue(he, bmake_malloc(sizeof(struct ar_hdr)));
738 memcpy(Hash_GetValue(he), &arh, sizeof(struct ar_hdr));
740 fseek(arch, (size + 1) & ~1, SEEK_CUR);
745 (void)Lst_AtEnd(archives, ar);
748 * Now that the archive has been read and cached, we can look into
749 * the hash table to find the desired member's header.
751 he = Hash_FindEntry(&ar->members, member);
754 return ((struct ar_hdr *)Hash_GetValue(he));
761 Hash_DeleteTable(&ar->members);
770 *-----------------------------------------------------------------------
772 * Parse an SVR4 style entry that begins with a slash.
773 * If it is "//", then load the table of filenames
774 * If it is "/<offset>", then try to substitute the long file name
775 * from offset of a table previously read.
778 * -1: Bad data in archive
779 * 0: A table was loaded from the file
780 * 1: Name was successfully substituted from table
781 * 2: Name was not successfully substituted from table
784 * If a table is read, the file pointer is moved to the next archive
787 *-----------------------------------------------------------------------
790 ArchSVR4Entry(Arch *ar, char *name, size_t size, FILE *arch)
792 #define ARLONGNAMES1 "//"
793 #define ARLONGNAMES2 "/ARFILENAMES"
797 if (strncmp(name, ARLONGNAMES1, sizeof(ARLONGNAMES1) - 1) == 0 ||
798 strncmp(name, ARLONGNAMES2, sizeof(ARLONGNAMES2) - 1) == 0) {
800 if (ar->fnametab != NULL) {
802 fprintf(debug_file, "Attempted to redefine an SVR4 name table\n");
808 * This is a table of archive names, so we build one for
811 ar->fnametab = bmake_malloc(size);
812 ar->fnamesize = size;
814 if (fread(ar->fnametab, size, 1, arch) != 1) {
816 fprintf(debug_file, "Reading an SVR4 name table failed\n");
820 eptr = ar->fnametab + size;
821 for (entry = 0, ptr = ar->fnametab; ptr < eptr; ptr++)
835 fprintf(debug_file, "Found svr4 archive name table with %lu entries\n",
841 if (name[1] == ' ' || name[1] == '\0')
844 entry = (size_t)strtol(&name[1], &eptr, 0);
845 if ((*eptr != ' ' && *eptr != '\0') || eptr == &name[1]) {
847 fprintf(debug_file, "Could not parse SVR4 name %s\n", name);
851 if (entry >= ar->fnamesize) {
853 fprintf(debug_file, "SVR4 entry offset %s is greater than %lu\n",
854 name, (u_long)ar->fnamesize);
860 fprintf(debug_file, "Replaced %s with %s\n", name, &ar->fnametab[entry]);
863 (void)strncpy(name, &ar->fnametab[entry], MAXPATHLEN);
864 name[MAXPATHLEN] = '\0';
871 *-----------------------------------------------------------------------
873 * Locate a member of an archive, given the path of the archive and
874 * the path of the desired member. If the archive is to be modified,
875 * the mode should be "r+", if not, it should be "r".
878 * archive Path to the archive
879 * member Name of member. If it is a path, only the last
881 * arhPtr Pointer to header structure to be filled in
882 * mode The mode for opening the stream
885 * An FILE *, opened for reading and writing, positioned at the
886 * start of the member's struct ar_hdr, or NULL if the member was
887 * nonexistent. The current struct ar_hdr for member.
890 * The passed struct ar_hdr structure is filled in.
892 *-----------------------------------------------------------------------
895 ArchFindMember(char *archive, char *member, struct ar_hdr *arhPtr,
898 FILE * arch; /* Stream to archive */
899 int size; /* Size of archive member */
900 char *cp; /* Useful character pointer */
904 arch = fopen(archive, mode);
910 * We use the ARMAG string to make sure this is an archive we
913 if ((fread(magic, SARMAG, 1, arch) != 1) ||
914 (strncmp(magic, ARMAG, SARMAG) != 0)) {
920 * Because of space constraints and similar things, files are archived
921 * using their final path components, not the entire thing, so we need
922 * to point 'member' to the final component, if there is one, to make
923 * the comparisons easier...
925 cp = strrchr(member, '/');
929 len = tlen = strlen(member);
930 if (len > sizeof(arhPtr->AR_NAME)) {
931 tlen = sizeof(arhPtr->AR_NAME);
934 while (fread((char *)arhPtr, sizeof(struct ar_hdr), 1, arch) == 1) {
935 if (strncmp(arhPtr->AR_FMAG, ARFMAG, sizeof(arhPtr->AR_FMAG) ) != 0) {
937 * The header is bogus, so the archive is bad
938 * and there's no way we can recover...
942 } else if (strncmp(member, arhPtr->AR_NAME, tlen) == 0) {
944 * If the member's name doesn't take up the entire 'name' field,
945 * we have to be careful of matching prefixes. Names are space-
946 * padded to the right, so if the character in 'name' at the end
947 * of the matched string is anything but a space, this isn't the
950 if (tlen != sizeof(arhPtr->AR_NAME) && arhPtr->AR_NAME[tlen] != ' '){
954 * To make life easier, we reposition the file at the start
955 * of the header we just read before we return the stream.
956 * In a more general situation, it might be better to leave
957 * the file at the actual member, rather than its header, but
960 fseek(arch, -sizeof(struct ar_hdr), SEEK_CUR);
966 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
967 * first <namelen> bytes of the file
969 if (strncmp(arhPtr->AR_NAME, AR_EFMT1,
970 sizeof(AR_EFMT1) - 1) == 0 &&
971 isdigit((unsigned char)arhPtr->AR_NAME[sizeof(AR_EFMT1) - 1])) {
973 unsigned int elen = atoi(&arhPtr->AR_NAME[sizeof(AR_EFMT1)-1]);
974 char ename[MAXPATHLEN + 1];
976 if (elen > MAXPATHLEN) {
980 if (fread(ename, elen, 1, arch) != 1) {
985 if (DEBUG(ARCH) || DEBUG(MAKE)) {
986 fprintf(debug_file, "ArchFind: Extended format entry for %s\n", ename);
988 if (strncmp(ename, member, len) == 0) {
989 /* Found as extended name */
990 fseek(arch, -sizeof(struct ar_hdr) - elen, SEEK_CUR);
993 fseek(arch, -elen, SEEK_CUR);
1000 * This isn't the member we're after, so we need to advance the
1001 * stream's pointer to the start of the next header. Files are
1002 * padded with newlines to an even-byte boundary, so we need to
1003 * extract the size of the file from the 'size' field of the
1004 * header and round it up during the seek.
1006 arhPtr->ar_size[sizeof(arhPtr->AR_SIZE)-1] = '\0';
1007 size = (int)strtol(arhPtr->AR_SIZE, NULL, 10);
1008 fseek(arch, (size + 1) & ~1, SEEK_CUR);
1013 * We've looked everywhere, but the member is not to be found. Close the
1014 * archive and return NULL -- an error.
1021 *-----------------------------------------------------------------------
1023 * Touch a member of an archive.
1026 * gn Node of member to touch
1029 * The 'time' field of the member's header is updated.
1032 * The modification time of the entire archive is also changed.
1033 * For a library, this could necessitate the re-ranlib'ing of the
1036 *-----------------------------------------------------------------------
1039 Arch_Touch(GNode *gn)
1041 FILE * arch; /* Stream open to archive, positioned properly */
1042 struct ar_hdr arh; /* Current header describing member */
1045 arch = ArchFindMember(Var_Value(ARCHIVE, gn, &p1),
1046 Var_Value(MEMBER, gn, &p2),
1052 snprintf(arh.AR_DATE, sizeof(arh.AR_DATE), "%-12ld", (long) now);
1055 (void)fwrite((char *)&arh, sizeof(struct ar_hdr), 1, arch);
1061 *-----------------------------------------------------------------------
1063 * Given a node which represents a library, touch the thing, making
1064 * sure that the table of contents also is touched.
1067 * gn The node of the library to touch
1073 * Both the modification time of the library and of the RANLIBMAG
1074 * member are set to 'now'.
1076 *-----------------------------------------------------------------------
1079 #if !defined(RANLIBMAG)
1080 Arch_TouchLib(GNode *gn MAKE_ATTR_UNUSED)
1082 Arch_TouchLib(GNode *gn)
1086 FILE * arch; /* Stream open to archive */
1087 struct ar_hdr arh; /* Header describing table of contents */
1088 struct utimbuf times; /* Times for utime() call */
1090 arch = ArchFindMember(gn->path, UNCONST(RANLIBMAG), &arh, "r+");
1091 snprintf(arh.AR_DATE, sizeof(arh.AR_DATE), "%-12ld", (long) now);
1094 (void)fwrite((char *)&arh, sizeof(struct ar_hdr), 1, arch);
1097 times.actime = times.modtime = now;
1098 utime(gn->path, ×);
1104 *-----------------------------------------------------------------------
1106 * Return the modification time of a member of an archive.
1109 * gn Node describing archive member
1112 * The modification time(seconds).
1115 * The mtime field of the given node is filled in with the value
1116 * returned by the function.
1118 *-----------------------------------------------------------------------
1121 Arch_MTime(GNode *gn)
1123 struct ar_hdr *arhPtr; /* Header of desired member */
1124 time_t modTime; /* Modification time as an integer */
1127 arhPtr = ArchStatMember(Var_Value(ARCHIVE, gn, &p1),
1128 Var_Value(MEMBER, gn, &p2),
1135 if (arhPtr != NULL) {
1136 modTime = (time_t)strtol(arhPtr->AR_DATE, NULL, 10);
1141 gn->mtime = modTime;
1146 *-----------------------------------------------------------------------
1148 * Given a non-existent archive member's node, get its modification
1149 * time from its archived form, if it exists.
1152 * The modification time.
1155 * The mtime field is filled in.
1157 *-----------------------------------------------------------------------
1160 Arch_MemMTime(GNode *gn)
1167 if (Lst_Open(gn->parents) != SUCCESS) {
1171 while ((ln = Lst_Next(gn->parents)) != NULL) {
1172 pgn = (GNode *)Lst_Datum(ln);
1174 if (pgn->type & OP_ARCHV) {
1176 * If the parent is an archive specification and is being made
1177 * and its member's name matches the name of the node we were
1178 * given, record the modification time of the parent in the
1179 * child. We keep searching its parents in case some other
1180 * parent requires this child to exist...
1182 nameStart = strchr(pgn->name, '(') + 1;
1183 nameEnd = strchr(nameStart, ')');
1185 if ((pgn->flags & REMAKE) &&
1186 strncmp(nameStart, gn->name, nameEnd - nameStart) == 0) {
1187 gn->mtime = Arch_MTime(pgn);
1189 } else if (pgn->flags & REMAKE) {
1191 * Something which isn't a library depends on the existence of
1192 * this target, so it needs to exist.
1199 Lst_Close(gn->parents);
1205 *-----------------------------------------------------------------------
1207 * Search for a library along the given search path.
1210 * gn Node of library to find
1217 * The node's 'path' field is set to the found path (including the
1218 * actual file name, not -l...). If the system can handle the -L
1219 * flag when linking (or we cannot find the library), we assume that
1220 * the user has placed the .LIBRARIES variable in the final linking
1221 * command (or the linker will know where to find it) and set the
1222 * TARGET variable for this node to be the node's name. Otherwise,
1223 * we set the TARGET variable to be the full path of the library,
1224 * as returned by Dir_FindFile.
1226 *-----------------------------------------------------------------------
1229 Arch_FindLib(GNode *gn, Lst path)
1231 char *libName; /* file name for archive */
1232 size_t sz = strlen(gn->name) + 6 - 2;
1234 libName = bmake_malloc(sz);
1235 snprintf(libName, sz, "lib%s.a", &gn->name[2]);
1237 gn->path = Dir_FindFile(libName, path);
1242 Var_Set(TARGET, gn->name, gn, 0);
1244 Var_Set(TARGET, gn->path == NULL ? gn->name : gn->path, gn, 0);
1245 #endif /* LIBRARIES */
1249 *-----------------------------------------------------------------------
1251 * Decide if a node with the OP_LIB attribute is out-of-date. Called
1252 * from Make_OODate to make its life easier.
1254 * There are several ways for a library to be out-of-date that are
1255 * not available to ordinary files. In addition, there are ways
1256 * that are open to regular files that are not available to
1257 * libraries. A library that is only used as a source is never
1258 * considered out-of-date by itself. This does not preclude the
1259 * library's modification time from making its parent be out-of-date.
1260 * A library will be considered out-of-date for any of these reasons,
1261 * given that it is a target on a dependency line somewhere:
1262 * Its modification time is less than that of one of its
1263 * sources (gn->mtime < gn->cmgn->mtime).
1264 * Its modification time is greater than the time at which the
1265 * make began (i.e. it's been modified in the course
1266 * of the make, probably by archiving).
1267 * The modification time of one of its sources is greater than
1268 * the one of its RANLIBMAG member (i.e. its table of contents
1269 * is out-of-date). We don't compare of the archive time
1270 * vs. TOC time because they can be too close. In my
1271 * opinion we should not bother with the TOC at all since
1272 * this is used by 'ar' rules that affect the data contents
1273 * of the archive, not by ranlib rules, which affect the
1277 * gn The library's graph node
1280 * TRUE if the library is out-of-date. FALSE otherwise.
1283 * The library will be hashed if it hasn't been already.
1285 *-----------------------------------------------------------------------
1288 Arch_LibOODate(GNode *gn)
1292 if (gn->type & OP_PHONY) {
1294 } else if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) {
1296 } else if ((!Lst_IsEmpty(gn->children) && gn->cmgn == NULL) ||
1297 (gn->mtime > now) ||
1298 (gn->cmgn != NULL && gn->mtime < gn->cmgn->mtime)) {
1302 struct ar_hdr *arhPtr; /* Header for __.SYMDEF */
1303 int modTimeTOC; /* The table-of-contents's mod time */
1305 arhPtr = ArchStatMember(gn->path, UNCONST(RANLIBMAG), FALSE);
1307 if (arhPtr != NULL) {
1308 modTimeTOC = (int)strtol(arhPtr->AR_DATE, NULL, 10);
1310 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1311 fprintf(debug_file, "%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC));
1313 oodate = (gn->cmgn == NULL || gn->cmgn->mtime > modTimeTOC);
1316 * A library w/o a table of contents is out-of-date
1318 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1319 fprintf(debug_file, "No t.o.c....");
1331 *-----------------------------------------------------------------------
1333 * Initialize things for this module.
1339 * The 'archives' list is initialized.
1341 *-----------------------------------------------------------------------
1346 archives = Lst_Init(FALSE);
1352 *-----------------------------------------------------------------------
1354 * Cleanup things for this module.
1360 * The 'archives' list is freed
1362 *-----------------------------------------------------------------------
1368 Lst_Destroy(archives, ArchFree);
1373 *-----------------------------------------------------------------------
1375 * Check if the node is a library
1383 *-----------------------------------------------------------------------
1386 Arch_IsLib(GNode *gn)
1388 static const char armag[] = "!<arch>\n";
1389 char buf[sizeof(armag)-1];
1392 if ((fd = open(gn->path, O_RDONLY)) == -1)
1395 if (read(fd, buf, sizeof(buf)) != sizeof(buf)) {
1402 return memcmp(buf, armag, sizeof(buf)) == 0;