1 /* $NetBSD: arch.c,v 1.107 2020/08/30 11:15:05 rillig 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.107 2020/08/30 11:15:05 rillig 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.107 2020/08/30 11:15:05 rillig 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 * FALSE 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>
143 char ar_name[16]; /* name */
144 char ar_date[12]; /* modification time */
145 char ar_uid[6]; /* user id */
146 char ar_gid[6]; /* group id */
147 char ar_mode[8]; /* octal file permissions */
148 char ar_size[10]; /* size in bytes */
152 char ar_fmag[2]; /* consistency check */
155 #if defined(HAVE_RANLIB_H) && !(defined(__ELF__) || defined(NO_RANLIB))
168 #ifdef TARGET_MACHINE
170 #define MAKE_MACHINE TARGET_MACHINE
172 #ifdef TARGET_MACHINE_ARCH
173 #undef MAKE_MACHINE_ARCH
174 #define MAKE_MACHINE_ARCH TARGET_MACHINE_ARCH
177 static Lst archives; /* Lst of archives we've already examined */
179 typedef struct Arch {
180 char *name; /* Name of archive */
181 Hash_Table members; /* All the members of the archive described
182 * by <name, struct ar_hdr *> key/value pairs */
183 char *fnametab; /* Extended name table strings */
184 size_t fnamesize; /* Size of the string table */
187 static struct ar_hdr *ArchStatMember(const char *, const char *, Boolean);
188 static FILE *ArchFindMember(const char *, const char *,
189 struct ar_hdr *, const char *);
190 #if defined(__svr4__) || defined(__SVR4) || defined(__ELF__)
192 static int ArchSVR4Entry(Arch *, char *, size_t, FILE *);
197 # define AR_NAME _ar_name.ar_name
198 # define AR_FMAG _ar_name.ar_fmag
199 # define SARMAG SAIAMAG
200 # define ARMAG AIAMAG
201 # define ARFMAG AIAFMAG
204 # define AR_NAME ar_name
207 # define AR_DATE ar_date
210 # define AR_SIZE ar_size
213 # define AR_FMAG ar_fmag
216 # define ARMAG "!<arch>\n"
222 #define AR_MAX_NAME_LEN (sizeof(arh.AR_NAME)-1)
228 Arch *a = (Arch *)ap;
232 /* Free memory from hash entries */
233 for (entry = Hash_EnumFirst(&a->members, &search);
235 entry = Hash_EnumNext(&search))
236 free(Hash_GetValue(entry));
240 Hash_DeleteTable(&a->members);
247 *-----------------------------------------------------------------------
248 * Arch_ParseArchive --
249 * Parse the archive specification in the given line and find/create
250 * the nodes for the specified archive members, placing their nodes
254 * linePtr Pointer to start of specification
255 * nodeLst Lst on which to place the nodes
256 * ctxt Context in which to expand variables
259 * TRUE if it was a valid specification. The linePtr is updated
260 * to point to the first non-space after the archive spec. The
261 * nodes for the members are placed on the given list.
262 *-----------------------------------------------------------------------
265 Arch_ParseArchive(char **linePtr, Lst nodeLst, GNode *ctxt)
267 char *cp; /* Pointer into line */
268 GNode *gn; /* New node */
269 char *libName; /* Library-part of specification */
270 char *memName; /* Member-part of specification */
271 char saveChar; /* Ending delimiter of member-name */
272 Boolean subLibName; /* TRUE if libName should have/had
273 * variable substitution performed on it */
279 for (cp = libName; *cp != '(' && *cp != '\0'; cp++) {
282 * Variable spec, so call the Var module to parse the puppy
283 * so we can safely advance beyond it...
290 result = Var_Parse(cp, ctxt, VARE_UNDEFERR|VARE_WANTRES,
291 &length, &result_freeIt);
292 isError = result == var_Error;
304 libName = Var_Subst(libName, ctxt, VARE_UNDEFERR|VARE_WANTRES);
310 * First skip to the start of the member's name, mark that
311 * place and skip to the end of it (either white-space or
314 Boolean doSubst = FALSE; /* TRUE if need to substitute in memName */
316 while (*cp != '\0' && *cp != ')' && isspace ((unsigned char)*cp)) {
320 while (*cp != '\0' && *cp != ')' && !isspace ((unsigned char)*cp)) {
323 * Variable spec, so call the Var module to parse the puppy
324 * so we can safely advance beyond it...
331 result = Var_Parse(cp, ctxt, VARE_UNDEFERR|VARE_WANTRES,
333 isError = result == var_Error;
347 * If the specification ends without a closing parenthesis,
348 * chances are there's something wrong (like a missing backslash),
349 * so it's better to return failure than allow such things to happen
352 printf("No closing parenthesis in archive specification\n");
357 * If we didn't move anywhere, we must be done
367 * XXX: This should be taken care of intelligently by
368 * SuffExpandChildren, both for the archive and the member portions.
371 * If member contains variables, try and substitute for them.
372 * This will slow down archive specs with dynamic sources, of course,
373 * since we'll be (non-)substituting them three times, but them's
374 * the breaks -- we need to do this since SuffExpandChildren calls
375 * us, otherwise we could assume the thing would be taken care of
381 char *oldMemName = memName;
383 memName = Var_Subst(memName, ctxt, VARE_UNDEFERR | VARE_WANTRES);
386 * Now form an archive spec and recurse to deal with nested
387 * variables and multi-word variable values.... The results
388 * are just placed at the end of the nodeLst we're returning.
390 buf = sacrifice = str_concat4(libName, "(", memName, ")");
392 if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) {
394 * Must contain dynamic sources, so we can't deal with it now.
395 * Just create an ARCHV node for the thing and let
396 * SuffExpandChildren handle it...
398 gn = Targ_FindNode(buf, TARG_CREATE);
404 gn->type |= OP_ARCHV;
405 Lst_Append(nodeLst, gn);
407 } else if (!Arch_ParseArchive(&sacrifice, nodeLst, ctxt)) {
409 * Error in nested call -- free buffer and return FALSE
416 * Free buffer and continue with our work.
419 } else if (Dir_HasWildcards(memName)) {
420 Lst members = Lst_Init();
423 Buf_Init(&nameBuf, 0);
424 Dir_Expand(memName, dirSearchPath, members);
425 while (!Lst_IsEmpty(members)) {
426 char *member = Lst_Dequeue(members);
429 Buf_AddStr(&nameBuf, libName);
430 Buf_AddStr(&nameBuf, "(");
431 Buf_AddStr(&nameBuf, member);
432 Buf_AddStr(&nameBuf, ")");
435 gn = Targ_FindNode(Buf_GetAll(&nameBuf, NULL), TARG_CREATE);
437 Buf_Destroy(&nameBuf, TRUE);
441 * We've found the node, but have to make sure the rest of
442 * the world knows it's an archive member, without having
443 * to constantly check for parentheses, so we type the
444 * thing with the OP_ARCHV bit before we place it on the
445 * end of the provided list.
447 gn->type |= OP_ARCHV;
448 Lst_Append(nodeLst, gn);
452 Buf_Destroy(&nameBuf, TRUE);
456 Buf_Init(&nameBuf, 0);
457 Buf_AddStr(&nameBuf, libName);
458 Buf_AddStr(&nameBuf, "(");
459 Buf_AddStr(&nameBuf, memName);
460 Buf_AddStr(&nameBuf, ")");
462 gn = Targ_FindNode(Buf_GetAll(&nameBuf, NULL), TARG_CREATE);
463 Buf_Destroy(&nameBuf, TRUE);
468 * We've found the node, but have to make sure the rest of the
469 * world knows it's an archive member, without having to
470 * constantly check for parentheses, so we type the thing with
471 * the OP_ARCHV bit before we place it on the end of the
474 gn->type |= OP_ARCHV;
475 Lst_Append(nodeLst, gn);
486 * If substituted libName, free it now, since we need it no longer.
493 * We promised the pointer would be set up at the next non-space, so
494 * we must advance cp there before setting *linePtr... (note that on
495 * entrance to the loop, cp is guaranteed to point at a ')')
499 } while (*cp != '\0' && isspace ((unsigned char)*cp));
505 /* See if the given archive is the one we are looking for.
506 * Called via Lst_Find. */
508 ArchFindArchive(const void *ar, const void *desiredName)
510 return strcmp(((const Arch *)ar)->name, desiredName) == 0;
514 *-----------------------------------------------------------------------
516 * Locate a member of an archive, given the path of the archive and
517 * the path of the desired member.
520 * archive Path to the archive
521 * member Name of member. If it is a path, only the last
523 * hash TRUE if archive should be hashed if not already so.
526 * A pointer to the current struct ar_hdr structure for the member. Note
527 * That no position is returned, so this is not useful for touching
528 * archive members. This is mostly because we have no assurances that
529 * The archive will remain constant after we read all the headers, so
530 * there's not much point in remembering the position...
531 *-----------------------------------------------------------------------
533 static struct ar_hdr *
534 ArchStatMember(const char *archive, const char *member, Boolean hash)
536 FILE * arch; /* Stream to archive */
537 size_t size; /* Size of archive member */
539 LstNode ln; /* Lst member containing archive descriptor */
540 Arch *ar; /* Archive descriptor */
541 Hash_Entry *he; /* Entry containing member's description */
542 struct ar_hdr arh; /* archive-member header for reading archive */
543 char memName[MAXPATHLEN+1];
544 /* Current member name while hashing. */
547 * Because of space constraints and similar things, files are archived
548 * using their final path components, not the entire thing, so we need
549 * to point 'member' to the final component, if there is one, to make
550 * the comparisons easier...
552 const char *base = strrchr(member, '/');
557 ln = Lst_Find(archives, ArchFindArchive, archive);
559 ar = LstNode_Datum(ln);
561 he = Hash_FindEntry(&ar->members, member);
564 return (struct ar_hdr *)Hash_GetValue(he);
566 /* Try truncated name */
567 char copy[AR_MAX_NAME_LEN+1];
568 size_t len = strlen(member);
570 if (len > AR_MAX_NAME_LEN) {
571 len = AR_MAX_NAME_LEN;
572 snprintf(copy, sizeof copy, "%s", member);
574 if ((he = Hash_FindEntry(&ar->members, copy)) != NULL)
575 return (struct ar_hdr *)Hash_GetValue(he);
582 * Caller doesn't want the thing hashed, just use ArchFindMember
583 * to read the header for the member out and close down the stream
584 * again. Since the archive is not to be hashed, we assume there's
585 * no need to allocate extra room for the header we're returning,
586 * so just declare it static.
588 static struct ar_hdr sarh;
590 arch = ArchFindMember(archive, member, &sarh, "r");
601 * We don't have this archive on the list yet, so we want to find out
602 * everything that's in it and cache it so we can get at it quickly.
604 arch = fopen(archive, "r");
610 * We use the ARMAG string to make sure this is an archive we
613 if ((fread(magic, SARMAG, 1, arch) != 1) ||
614 (strncmp(magic, ARMAG, SARMAG) != 0)) {
619 ar = bmake_malloc(sizeof(Arch));
620 ar->name = bmake_strdup(archive);
623 Hash_InitTable(&ar->members, -1);
624 memName[AR_MAX_NAME_LEN] = '\0';
626 while (fread((char *)&arh, sizeof(struct ar_hdr), 1, arch) == 1) {
627 if (strncmp( arh.AR_FMAG, ARFMAG, sizeof(arh.AR_FMAG)) != 0) {
629 * The header is bogus, so the archive is bad
630 * and there's no way we can recover...
637 * We need to advance the stream's pointer to the start of the
638 * next header. Files are padded with newlines to an even-byte
639 * boundary, so we need to extract the size of the file from the
640 * 'size' field of the header and round it up during the seek.
642 arh.AR_SIZE[sizeof(arh.AR_SIZE)-1] = '\0';
643 size = (size_t)strtol(arh.ar_size, NULL, 10);
645 memcpy(memName, arh.AR_NAME, sizeof(arh.AR_NAME));
646 nameend = memName + AR_MAX_NAME_LEN;
647 while (*nameend == ' ') {
654 * svr4 names are slash terminated. Also svr4 extended AR format.
656 if (memName[0] == '/') {
658 * svr4 magic mode; handle it
660 switch (ArchSVR4Entry(ar, memName, size, arch)) {
661 case -1: /* Invalid data */
663 case 0: /* List of files entry */
665 default: /* Got the entry */
670 if (nameend[0] == '/')
677 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
678 * first <namelen> bytes of the file
680 if (strncmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
681 isdigit((unsigned char)memName[sizeof(AR_EFMT1) - 1])) {
683 int elen = atoi(&memName[sizeof(AR_EFMT1)-1]);
685 if ((unsigned int)elen > MAXPATHLEN)
687 if (fread(memName, (size_t)elen, 1, arch) != 1)
689 memName[elen] = '\0';
690 if (fseek(arch, -elen, SEEK_CUR) != 0)
692 if (DEBUG(ARCH) || DEBUG(MAKE)) {
693 fprintf(debug_file, "ArchStat: Extended format entry for %s\n", memName);
698 he = Hash_CreateEntry(&ar->members, memName, NULL);
699 Hash_SetValue(he, bmake_malloc(sizeof(struct ar_hdr)));
700 memcpy(Hash_GetValue(he), &arh, sizeof(struct ar_hdr));
702 if (fseek(arch, ((long)size + 1) & ~1, SEEK_CUR) != 0)
708 Lst_Append(archives, ar);
711 * Now that the archive has been read and cached, we can look into
712 * the hash table to find the desired member's header.
714 he = Hash_FindEntry(&ar->members, member);
717 return (struct ar_hdr *)Hash_GetValue(he);
724 Hash_DeleteTable(&ar->members);
732 *-----------------------------------------------------------------------
734 * Parse an SVR4 style entry that begins with a slash.
735 * If it is "//", then load the table of filenames
736 * If it is "/<offset>", then try to substitute the long file name
737 * from offset of a table previously read.
738 * If a table is read, the file pointer is moved to the next archive
742 * -1: Bad data in archive
743 * 0: A table was loaded from the file
744 * 1: Name was successfully substituted from table
745 * 2: Name was not successfully substituted from table
746 *-----------------------------------------------------------------------
749 ArchSVR4Entry(Arch *ar, char *name, size_t size, FILE *arch)
751 #define ARLONGNAMES1 "//"
752 #define ARLONGNAMES2 "/ARFILENAMES"
756 if (strncmp(name, ARLONGNAMES1, sizeof(ARLONGNAMES1) - 1) == 0 ||
757 strncmp(name, ARLONGNAMES2, sizeof(ARLONGNAMES2) - 1) == 0) {
759 if (ar->fnametab != NULL) {
761 fprintf(debug_file, "Attempted to redefine an SVR4 name table\n");
767 * This is a table of archive names, so we build one for
770 ar->fnametab = bmake_malloc(size);
771 ar->fnamesize = size;
773 if (fread(ar->fnametab, size, 1, arch) != 1) {
775 fprintf(debug_file, "Reading an SVR4 name table failed\n");
779 eptr = ar->fnametab + size;
780 for (entry = 0, ptr = ar->fnametab; ptr < eptr; ptr++)
794 fprintf(debug_file, "Found svr4 archive name table with %lu entries\n",
795 (unsigned long)entry);
800 if (name[1] == ' ' || name[1] == '\0')
803 entry = (size_t)strtol(&name[1], &eptr, 0);
804 if ((*eptr != ' ' && *eptr != '\0') || eptr == &name[1]) {
806 fprintf(debug_file, "Could not parse SVR4 name %s\n", name);
810 if (entry >= ar->fnamesize) {
812 fprintf(debug_file, "SVR4 entry offset %s is greater than %lu\n",
813 name, (unsigned long)ar->fnamesize);
819 fprintf(debug_file, "Replaced %s with %s\n", name, &ar->fnametab[entry]);
822 snprintf(name, MAXPATHLEN + 1, "%s", &ar->fnametab[entry]);
829 *-----------------------------------------------------------------------
831 * Locate a member of an archive, given the path of the archive and
832 * the path of the desired member. If the archive is to be modified,
833 * the mode should be "r+", if not, it should be "r".
834 * The passed struct ar_hdr structure is filled in.
837 * archive Path to the archive
838 * member Name of member. If it is a path, only the last
840 * arhPtr Pointer to header structure to be filled in
841 * mode The mode for opening the stream
844 * An FILE *, opened for reading and writing, positioned at the
845 * start of the member's struct ar_hdr, or NULL if the member was
846 * nonexistent. The current struct ar_hdr for member.
847 *-----------------------------------------------------------------------
850 ArchFindMember(const char *archive, const char *member, struct ar_hdr *arhPtr,
853 FILE * arch; /* Stream to archive */
854 int size; /* Size of archive member */
859 arch = fopen(archive, mode);
865 * We use the ARMAG string to make sure this is an archive we
868 if ((fread(magic, SARMAG, 1, arch) != 1) ||
869 (strncmp(magic, ARMAG, SARMAG) != 0)) {
875 * Because of space constraints and similar things, files are archived
876 * using their final path components, not the entire thing, so we need
877 * to point 'member' to the final component, if there is one, to make
878 * the comparisons easier...
880 base = strrchr(member, '/');
884 len = tlen = strlen(member);
885 if (len > sizeof(arhPtr->AR_NAME)) {
886 tlen = sizeof(arhPtr->AR_NAME);
889 while (fread((char *)arhPtr, sizeof(struct ar_hdr), 1, arch) == 1) {
890 if (strncmp(arhPtr->AR_FMAG, ARFMAG, sizeof(arhPtr->AR_FMAG) ) != 0) {
892 * The header is bogus, so the archive is bad
893 * and there's no way we can recover...
897 } else if (strncmp(member, arhPtr->AR_NAME, tlen) == 0) {
899 * If the member's name doesn't take up the entire 'name' field,
900 * we have to be careful of matching prefixes. Names are space-
901 * padded to the right, so if the character in 'name' at the end
902 * of the matched string is anything but a space, this isn't the
905 if (tlen != sizeof(arhPtr->AR_NAME) && arhPtr->AR_NAME[tlen] != ' '){
909 * To make life easier, we reposition the file at the start
910 * of the header we just read before we return the stream.
911 * In a more general situation, it might be better to leave
912 * the file at the actual member, rather than its header, but
915 if (fseek(arch, -(long)sizeof(struct ar_hdr), SEEK_CUR) != 0) {
924 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
925 * first <namelen> bytes of the file
927 if (strncmp(arhPtr->AR_NAME, AR_EFMT1,
928 sizeof(AR_EFMT1) - 1) == 0 &&
929 isdigit((unsigned char)arhPtr->AR_NAME[sizeof(AR_EFMT1) - 1])) {
931 int elen = atoi(&arhPtr->AR_NAME[sizeof(AR_EFMT1)-1]);
932 char ename[MAXPATHLEN + 1];
934 if ((unsigned int)elen > MAXPATHLEN) {
938 if (fread(ename, (size_t)elen, 1, arch) != 1) {
943 if (DEBUG(ARCH) || DEBUG(MAKE)) {
944 fprintf(debug_file, "ArchFind: Extended format entry for %s\n", ename);
946 if (strncmp(ename, member, len) == 0) {
947 /* Found as extended name */
948 if (fseek(arch, -(long)sizeof(struct ar_hdr) - elen,
955 if (fseek(arch, -elen, SEEK_CUR) != 0) {
965 * This isn't the member we're after, so we need to advance the
966 * stream's pointer to the start of the next header. Files are
967 * padded with newlines to an even-byte boundary, so we need to
968 * extract the size of the file from the 'size' field of the
969 * header and round it up during the seek.
971 arhPtr->AR_SIZE[sizeof(arhPtr->AR_SIZE)-1] = '\0';
972 size = (int)strtol(arhPtr->AR_SIZE, NULL, 10);
973 if (fseek(arch, (size + 1) & ~1, SEEK_CUR) != 0) {
981 * We've looked everywhere, but the member is not to be found. Close the
982 * archive and return NULL -- an error.
989 *-----------------------------------------------------------------------
991 * Touch a member of an archive.
992 * The modification time of the entire archive is also changed.
993 * For a library, this could necessitate the re-ranlib'ing of the
997 * gn Node of member to touch
1000 * The 'time' field of the member's header is updated.
1001 *-----------------------------------------------------------------------
1004 Arch_Touch(GNode *gn)
1006 FILE * arch; /* Stream open to archive, positioned properly */
1007 struct ar_hdr arh; /* Current header describing member */
1010 arch = ArchFindMember(Var_Value(ARCHIVE, gn, &p1),
1011 Var_Value(MEMBER, gn, &p2),
1017 snprintf(arh.AR_DATE, sizeof(arh.AR_DATE), "%-12ld", (long) now);
1020 (void)fwrite((char *)&arh, sizeof(struct ar_hdr), 1, arch);
1025 /* Given a node which represents a library, touch the thing, making sure that
1026 * the table of contents also is touched.
1028 * Both the modification time of the library and of the RANLIBMAG member are
1032 * gn The node of the library to touch
1035 Arch_TouchLib(GNode *gn)
1038 FILE * arch; /* Stream open to archive */
1039 struct ar_hdr arh; /* Header describing table of contents */
1040 struct utimbuf times; /* Times for utime() call */
1042 arch = ArchFindMember(gn->path, RANLIBMAG, &arh, "r+");
1043 snprintf(arh.AR_DATE, sizeof(arh.AR_DATE), "%-12ld", (long) now);
1046 (void)fwrite((char *)&arh, sizeof(struct ar_hdr), 1, arch);
1049 times.actime = times.modtime = now;
1050 utime(gn->path, ×);
1057 /* Return the modification time of a member of an archive. The mtime field
1058 * of the given node is filled in with the value returned by the function.
1061 * gn Node describing archive member
1064 Arch_MTime(GNode *gn)
1066 struct ar_hdr *arhPtr; /* Header of desired member */
1067 time_t modTime; /* Modification time as an integer */
1070 arhPtr = ArchStatMember(Var_Value(ARCHIVE, gn, &p1),
1071 Var_Value(MEMBER, gn, &p2),
1077 if (arhPtr != NULL) {
1078 modTime = (time_t)strtol(arhPtr->AR_DATE, NULL, 10);
1083 gn->mtime = modTime;
1087 /* Given a non-existent archive member's node, get its modification time from
1088 * its archived form, if it exists. gn->mtime is filled in as well. */
1090 Arch_MemMTime(GNode *gn)
1095 Lst_Open(gn->parents);
1096 while ((ln = Lst_Next(gn->parents)) != NULL) {
1097 pgn = LstNode_Datum(ln);
1099 if (pgn->type & OP_ARCHV) {
1101 * If the parent is an archive specification and is being made
1102 * and its member's name matches the name of the node we were
1103 * given, record the modification time of the parent in the
1104 * child. We keep searching its parents in case some other
1105 * parent requires this child to exist...
1107 const char *nameStart = strchr(pgn->name, '(') + 1;
1108 const char *nameEnd = strchr(nameStart, ')');
1109 size_t nameLen = (size_t)(nameEnd - nameStart);
1111 if ((pgn->flags & REMAKE) &&
1112 strncmp(nameStart, gn->name, nameLen) == 0) {
1113 gn->mtime = Arch_MTime(pgn);
1115 } else if (pgn->flags & REMAKE) {
1117 * Something which isn't a library depends on the existence of
1118 * this target, so it needs to exist.
1125 Lst_Close(gn->parents);
1130 /* Search for a library along the given search path.
1132 * The node's 'path' field is set to the found path (including the
1133 * actual file name, not -l...). If the system can handle the -L
1134 * flag when linking (or we cannot find the library), we assume that
1135 * the user has placed the .LIBS variable in the final linking
1136 * command (or the linker will know where to find it) and set the
1137 * TARGET variable for this node to be the node's name. Otherwise,
1138 * we set the TARGET variable to be the full path of the library,
1139 * as returned by Dir_FindFile.
1142 * gn Node of library to find
1146 Arch_FindLib(GNode *gn, Lst path)
1148 char *libName; /* file name for archive */
1149 size_t sz = strlen(gn->name) + 6 - 2;
1151 libName = bmake_malloc(sz);
1152 snprintf(libName, sz, "lib%s.a", &gn->name[2]);
1154 gn->path = Dir_FindFile(libName, path);
1159 Var_Set(TARGET, gn->name, gn);
1161 Var_Set(TARGET, gn->path == NULL ? gn->name : gn->path, gn);
1162 #endif /* LIBRARIES */
1165 /* Decide if a node with the OP_LIB attribute is out-of-date. Called from
1166 * Make_OODate to make its life easier.
1167 * The library will be hashed if it hasn't been already.
1169 * There are several ways for a library to be out-of-date that are
1170 * not available to ordinary files. In addition, there are ways
1171 * that are open to regular files that are not available to
1172 * libraries. A library that is only used as a source is never
1173 * considered out-of-date by itself. This does not preclude the
1174 * library's modification time from making its parent be out-of-date.
1175 * A library will be considered out-of-date for any of these reasons,
1176 * given that it is a target on a dependency line somewhere:
1178 * Its modification time is less than that of one of its sources
1179 * (gn->mtime < gn->cmgn->mtime).
1181 * Its modification time is greater than the time at which the make
1182 * began (i.e. it's been modified in the course of the make, probably
1185 * The modification time of one of its sources is greater than the one
1186 * of its RANLIBMAG member (i.e. its table of contents is out-of-date).
1187 * We don't compare of the archive time vs. TOC time because they can be
1188 * too close. In my opinion we should not bother with the TOC at all
1189 * since this is used by 'ar' rules that affect the data contents of the
1190 * archive, not by ranlib rules, which affect the TOC.
1193 * gn The library's graph node
1196 * TRUE if the library is out-of-date. FALSE otherwise.
1199 Arch_LibOODate(GNode *gn)
1203 if (gn->type & OP_PHONY) {
1205 } else if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) {
1207 } else if ((!Lst_IsEmpty(gn->children) && gn->cmgn == NULL) ||
1208 (gn->mtime > now) ||
1209 (gn->cmgn != NULL && gn->mtime < gn->cmgn->mtime)) {
1213 struct ar_hdr *arhPtr; /* Header for __.SYMDEF */
1214 int modTimeTOC; /* The table-of-contents's mod time */
1216 arhPtr = ArchStatMember(gn->path, RANLIBMAG, FALSE);
1218 if (arhPtr != NULL) {
1219 modTimeTOC = (int)strtol(arhPtr->AR_DATE, NULL, 10);
1221 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1222 fprintf(debug_file, "%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC));
1224 oodate = (gn->cmgn == NULL || gn->cmgn->mtime > modTimeTOC);
1227 * A library w/o a table of contents is out-of-date
1229 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1230 fprintf(debug_file, "No t.o.c....");
1241 /* Initialize things for this module. */
1245 archives = Lst_Init();
1248 /* Clean up things for this module. */
1253 Lst_Destroy(archives, ArchFree);
1258 Arch_IsLib(GNode *gn)
1260 static const char armag[] = "!<arch>\n";
1261 char buf[sizeof armag - 1];
1264 if ((fd = open(gn->path, O_RDONLY)) == -1)
1267 if (read(fd, buf, sizeof buf) != sizeof buf) {
1274 return memcmp(buf, armag, sizeof buf) == 0;