2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1989 by Berkeley Softworks
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. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)arch.c 8.2 (Berkeley) 1/2/94
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
46 * Functions to manipulate libraries, archives and their members.
48 * Once again, cacheing/hashing comes into play in the manipulation
49 * of archives. The first time an archive is referenced, all of its members'
50 * headers are read and hashed and the archive closed again. All hashed
51 * archives are kept on a list which is searched each time an archive member
54 * The interface to this module is:
55 * Arch_ParseArchive Given an archive specification, return a list
56 * of GNode's, one for each member in the spec.
57 * FALSE is returned if the specification is
58 * invalid for some reason.
60 * Arch_Touch Alter the modification time of the archive
61 * member described by the given node to be
64 * Arch_TouchLib Update the modification time of the library
65 * described by the given node. This is special
66 * because it also updates the modification time
67 * of the library's table of contents.
69 * Arch_MTime Find the modification time of a member of
70 * an archive *in the archive*. The time is also
71 * placed in the member's GNode. Returns the
74 * Arch_MemTime Find the modification time of a member of
75 * an archive. Called when the member doesn't
76 * already exist. Looks in the archive for the
77 * modification time. Returns the modification
80 * Arch_FindLib Search for a library along a path. The
81 * library name in the GNode should be in
84 * Arch_LibOODate Special function to decide if a library node
87 * Arch_Init Initialize this module.
90 #include <sys/param.h>
91 #include <sys/queue.h>
92 #include <sys/types.h>
116 typedef struct Arch {
117 char *name; /* Name of archive */
120 * All the members of the archive described
121 * by <name, struct ar_hdr *> key/value pairs
125 TAILQ_ENTRY(Arch) link; /* link all cached archives */
128 /* Lst of archives we've already examined */
129 static TAILQ_HEAD(, Arch) archives = TAILQ_HEAD_INITIALIZER(archives);
132 /* size of the name field in the archive member header */
133 #define AR_NAMSIZ sizeof(((struct ar_hdr *)0)->ar_name)
136 * This structure is used while reading/writing an archive
139 FILE *fp; /* archive file */
140 char *fname; /* name of the file */
141 struct ar_hdr hdr; /* current header */
142 char sname[AR_NAMSIZ + 1]; /* short name */
143 char *member; /* (long) member name */
144 size_t mlen; /* size of the above */
145 char *nametab; /* name table */
146 size_t nametablen; /* size of the table */
147 int64_t time; /* from ar_date */
148 uint64_t size; /* from ar_size */
149 off_t pos; /* header pos of current entry */
153 * Name of the symbol table. The original BSD used "__.SYMDEF". Rumours go
154 * that this name may have a slash appended sometimes. Actually FreeBSD
155 * uses "/" which probably came from SVR4.
157 #define SVR4_RANLIBMAG "/"
158 #define BSD_RANLIBMAG "__.SYMDEF"
161 * Name of the filename table. The 4.4BSD ar format did not use this, but
162 * puts long filenames directly between the member header and the object
165 #define SVR4_NAMEMAG "//"
166 #define BSD_NAMEMAG "ARFILENAMES/"
169 * 44BSD long filename key. Use a local define here instead of relying
170 * on ar.h because we want this to continue working even when the
171 * definition is removed from ar.h.
173 #define BSD_EXT1 "#1/"
174 #define BSD_EXT1LEN 3
176 /* if this is TRUE make archive errors fatal */
177 Boolean arch_fatal = TRUE;
181 * An error happend while handling an archive. BSDmake traditionally
182 * ignored these errors. Now this is dependend on the global arch_fatal
183 * which, if true, makes these errors fatal and, if false, just emits an
186 #define ArchError(ARGS) do { \
194 *-----------------------------------------------------------------------
195 * Arch_ParseArchive --
196 * Parse the archive specification in the given line and find/create
197 * the nodes for the specified archive members, placing their nodes
198 * on the given list, given the pointer to the start of the
199 * specification, a Lst on which to place the nodes, and a context
200 * in which to expand variables.
203 * TRUE if it was a valid specification. The linePtr is updated
204 * to point to the first non-space after the archive spec. The
205 * nodes for the members are placed on the given list.
208 * Some nodes may be created. The given list is extended.
210 *-----------------------------------------------------------------------
213 Arch_ParseArchive(char **linePtr, Lst *nodeLst, GNode *ctxt)
215 char *cp; /* Pointer into line */
216 GNode *gn; /* New node */
217 char *libName; /* Library-part of specification */
218 char *memName; /* Member-part of specification */
219 char *nameBuf; /* temporary place for node name */
220 char saveChar; /* Ending delimiter of member-name */
221 Boolean subLibName; /* TRUE if libName should have/had
222 * variable substitution performed on it */
228 for (cp = libName; *cp != '(' && *cp != '\0'; cp++) {
231 * Variable spec, so call the Var module to parse the
232 * puppy so we can safely advance beyond it...
238 result = Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
239 if (result == var_Error) {
253 libName = Buf_Peel(Var_Subst(libName, ctxt, TRUE));
258 * First skip to the start of the member's name, mark that
259 * place and skip to the end of it (either white-space or
264 * TRUE if need to substitute in memName
266 Boolean doSubst = FALSE;
268 while (*cp != '\0' && *cp != ')' &&
269 isspace((unsigned char)*cp)) {
274 while (*cp != '\0' && *cp != ')' &&
275 !isspace((unsigned char)*cp)) {
278 * Variable spec, so call the Var module to
279 * parse the puppy so we can safely advance
286 result = Var_Parse(cp, ctxt, TRUE,
288 if (result == var_Error) {
303 * If the specification ends without a closing parenthesis,
304 * chances are there's something wrong (like a missing
305 * backslash), so it's better to return failure than allow
306 * such things to happen
309 printf("No closing parenthesis in archive "
315 * If we didn't move anywhere, we must be done
325 * XXX: This should be taken care of intelligently by
326 * SuffExpandChildren, both for the archive and the member
330 * If member contains variables, try and substitute for them.
331 * This will slow down archive specs with dynamic sources, of
332 * course, since we'll be (non-)substituting them three times,
333 * but them's the breaks -- we need to do this since
334 * SuffExpandChildren calls us, otherwise we could assume the
335 * thing would be taken care of later.
340 char *oldMemName = memName;
345 * Now form an archive spec and recurse to deal with
346 * nested variables and multi-word variable values....
347 * The results are just placed at the end of the
348 * nodeLst we're returning.
350 buf1 = Var_Subst(memName, ctxt, TRUE);
351 memName = Buf_Data(buf1);
353 sz = strlen(memName) + strlen(libName) + 3;
356 snprintf(buf, sz, "%s(%s)", libName, memName);
360 if (strchr(memName, '$') &&
361 strcmp(memName, oldMemName) == 0) {
363 * Must contain dynamic sources, so we can't
365 * Just create an ARCHV node for the thing and
366 * let SuffExpandChildren handle it...
368 gn = Targ_FindNode(buf, TARG_CREATE);
372 Buf_Destroy(buf1, FALSE);
375 gn->type |= OP_ARCHV;
376 Lst_AtEnd(nodeLst, (void *)gn);
377 } else if (!Arch_ParseArchive(&sacrifice, nodeLst,
380 * Error in nested call -- free buffer and
381 * return FALSE ourselves.
384 Buf_Destroy(buf1, FALSE);
388 /* Free buffer and continue with our work. */
390 Buf_Destroy(buf1, FALSE);
392 } else if (Dir_HasWildcards(memName)) {
393 Lst members = Lst_Initializer(members);
395 size_t sz = MAXPATHLEN;
398 nameBuf = emalloc(sz);
400 Path_Expand(memName, &dirSearchPath, &members);
401 while (!Lst_IsEmpty(&members)) {
402 member = Lst_DeQueue(&members);
403 nsz = strlen(libName) + strlen(member) + 3;
406 nameBuf = erealloc(nameBuf, sz);
409 snprintf(nameBuf, sz, "%s(%s)",
412 gn = Targ_FindNode(nameBuf, TARG_CREATE);
415 /* XXXHB Lst_Destroy(&members) */
419 * We've found the node, but have to make sure
420 * the rest of the world knows it's an archive
421 * member, without having to constantly check
422 * for parentheses, so we type the thing with
423 * the OP_ARCHV bit before we place it on the
424 * end of the provided list.
426 gn->type |= OP_ARCHV;
427 Lst_AtEnd(nodeLst, gn);
431 size_t sz = strlen(libName) + strlen(memName) + 3;
433 nameBuf = emalloc(sz);
434 snprintf(nameBuf, sz, "%s(%s)", libName, memName);
435 gn = Targ_FindNode(nameBuf, TARG_CREATE);
441 * We've found the node, but have to make sure the
442 * rest of the world knows it's an archive member,
443 * without having to constantly check for parentheses,
444 * so we type the thing with the OP_ARCHV bit before
445 * we place it on the end of the provided list.
447 gn->type |= OP_ARCHV;
448 Lst_AtEnd(nodeLst, gn);
458 * If substituted libName, free it now, since we need it no longer.
465 * We promised the pointer would be set up at the next non-space, so
466 * we must advance cp there before setting *linePtr... (note that on
467 * entrance to the loop, cp is guaranteed to point at a ')')
471 } while (*cp != '\0' && isspace((unsigned char)*cp));
478 * Close an archive file an free all resources
481 ArchArchiveClose(struct arfile *ar)
484 if (ar->nametab != NULL)
487 if (ar->fp != NULL) {
488 if (fclose(ar->fp) == EOF)
489 ArchError(("%s: close error", ar->fname));
496 * Open an archive file.
498 static struct arfile *
499 ArchArchiveOpen(const char *archive, const char *mode)
504 ar = emalloc(sizeof(*ar));
505 ar->fname = estrdup(archive);
507 ar->member = emalloc(ar->mlen);
511 if ((ar->fp = fopen(ar->fname, mode)) == NULL) {
512 DEBUGM(ARCH, ("%s", ar->fname));
513 ArchArchiveClose(ar);
518 if (fread(magic, SARMAG, 1, ar->fp) != 1 ||
519 strncmp(magic, ARMAG, SARMAG) != 0) {
520 ArchError(("%s: bad archive magic\n", ar->fname));
521 ArchArchiveClose(ar);
530 * Read the next header from the archive. The return value will be +1 if
531 * the header is read successfully, 0 on EOF and -1 if an error happend.
532 * On a successful return sname contains the truncated member name and
533 * member the full name. hdr contains the member header. For the symbol table
534 * names of length 0 are returned. The entry for the file name table is never
538 ArchArchiveNext(struct arfile *ar)
545 char buf[MAX(sizeof(ar->hdr.ar_size), sizeof(ar->hdr.ar_date)) + 1];
549 * Seek to the next header.
554 ar->pos += sizeof(ar->hdr) + ar->size;
555 if (ar->size % 2 == 1)
559 if (fseeko(ar->fp, ar->pos, SEEK_SET) == -1) {
560 ArchError(("%s: cannot seek to %jd: %s", ar->fname,
561 (intmax_t)ar->pos, strerror(errno)));
566 * Read next member header
568 ret = fread(&ar->hdr, sizeof(ar->hdr), 1, ar->fp);
572 ArchError(("%s: error reading member header: %s", ar->fname,
576 if (strncmp(ar->hdr.ar_fmag, ARFMAG, sizeof(ar->hdr.ar_fmag)) != 0) {
577 ArchError(("%s: bad entry magic", ar->fname));
582 * looks like a member - get name by stripping trailing spaces
583 * and NUL terminating.
585 strncpy(ar->sname, ar->hdr.ar_name, AR_NAMSIZ);
586 ar->sname[AR_NAMSIZ] = '\0';
587 for (ptr = ar->sname + AR_NAMSIZ; ptr > ar->sname; ptr--)
594 * Parse the size. All entries need to have a size. Be careful
595 * to not allow buffer overruns.
597 strncpy(buf, ar->hdr.ar_size, sizeof(ar->hdr.ar_size));
598 buf[sizeof(ar->hdr.ar_size)] = '\0';
601 ar->size = strtoumax(buf, &end, 10);
602 if (errno != 0 || strspn(end, " ") != strlen(end)) {
603 ArchError(("%s: bad size format in archive '%s'",
609 * Look for the extended name table. Do this before parsing
610 * the date because this table doesn't need a date.
612 if (strcmp(ar->sname, BSD_NAMEMAG) == 0 ||
613 strcmp(ar->sname, SVR4_NAMEMAG) == 0) {
614 /* filename table - read it in */
615 ar->nametablen = ar->size;
616 ar->nametab = emalloc(ar->nametablen);
618 ret = fread(ar->nametab, 1, ar->nametablen, ar->fp);
619 if (ret != ar->nametablen) {
620 if (ferror(ar->fp)) {
621 ArchError(("%s: cannot read nametab: %s",
622 ar->fname, strerror(errno)));
624 ArchError(("%s: cannot read nametab: "
625 "short read", ar->fname, strerror(errno)));
631 * NUL terminate the entries. Entries are \n terminated
632 * and may have a trailing / or \.
635 while (ptr < ar->nametab + ar->nametablen) {
637 if (ptr[-1] == '/' || ptr[-1] == '\\')
644 /* get next archive entry */
649 * Now parse the modification date. Be careful to not overrun
652 strncpy(buf, ar->hdr.ar_date, sizeof(ar->hdr.ar_date));
653 buf[sizeof(ar->hdr.ar_date)] = '\0';
656 ar->time = (int64_t)strtoll(buf, &end, 10);
657 if (errno != 0 || strspn(end, " ") != strlen(end)) {
658 ArchError(("%s: bad date format in archive '%s'",
664 * Now check for the symbol table. This should really be the first
665 * entry, but we don't check this.
667 if (strcmp(ar->sname, BSD_RANLIBMAG) == 0 ||
668 strcmp(ar->sname, SVR4_RANLIBMAG) == 0) {
669 /* symbol table - return a zero length name */
670 ar->member[0] = '\0';
678 * Look whether this is a long name. There are several variants
680 * "#1/12 " - 12 length of following filename
681 * "/17 " - index into name table
682 * " 17 " - index into name table
683 * Note that in the last case we must also check that there is no
684 * slash in the name because of filenames with leading spaces:
685 * " 777.o/ " - filename 777.o
687 if (ar->sname[0] == '/' || (ar->sname[0] == ' ' &&
688 strchr(ar->sname, '/') == NULL)) {
689 /* SVR4 extended name */
691 offs = strtoul(ar->sname + 1, &end, 10);
692 if (errno != 0 || *end != '\0' || offs >= ar->nametablen ||
693 end == ar->sname + 1) {
694 ArchError(("%s: bad extended name '%s'", ar->fname,
700 if (ar->mlen <= strlen(ar->nametab + offs)) {
701 ar->mlen = strlen(ar->nametab + offs) + 1;
702 ar->member = erealloc(ar->member, ar->mlen);
704 strcpy(ar->member, ar->nametab + offs);
708 } else if (strncmp(ar->sname, BSD_EXT1, BSD_EXT1LEN) == 0 &&
709 isdigit(ar->sname[BSD_EXT1LEN])) {
710 /* BSD4.4 extended name */
712 offs = strtoul(ar->sname + BSD_EXT1LEN, &end, 10);
713 if (errno != 0 || *end != '\0' ||
714 end == ar->sname + BSD_EXT1LEN) {
715 ArchError(("%s: bad extended name '%s'", ar->fname,
720 /* read it from the archive */
721 if (ar->mlen <= offs) {
723 ar->member = erealloc(ar->member, ar->mlen);
725 ret = fread(ar->member, 1, offs, ar->fp);
727 if (ferror(ar->fp)) {
728 ArchError(("%s: reading extended name: %s",
729 ar->fname, strerror(errno)));
731 ArchError(("%s: reading extended name: "
732 "short read", ar->fname));
736 ar->member[offs] = '\0';
742 * Now remove the trailing slash that Svr4 puts at
743 * the end of the member name to support trailing spaces in names.
745 if (ptr > ar->sname && ptr[-1] == '/')
748 if (!have_long_name) {
749 if (strlen(ar->sname) >= ar->mlen) {
750 ar->mlen = strlen(ar->sname) + 1;
751 ar->member = erealloc(ar->member, ar->mlen);
753 strcpy(ar->member, ar->sname);
760 * Touch the current archive member by writing a new header with an
761 * updated timestamp. The return value is 0 for success and -1 for errors.
764 ArchArchiveTouch(struct arfile *ar, int64_t ts)
767 /* seek to our header */
768 if (fseeko(ar->fp, ar->pos, SEEK_SET) == -1) {
769 ArchError(("%s: cannot seek to %jd: %s", ar->fname,
770 (intmax_t)ar->pos, strerror(errno)));
775 * change timestamp, be sure to not NUL-terminated it, but
776 * to fill with spaces.
778 snprintf(ar->hdr.ar_date, sizeof(ar->hdr.ar_date), "%jd",
780 memset(ar->hdr.ar_date + strlen(ar->hdr.ar_date),
781 ' ', sizeof(ar->hdr.ar_date) - strlen(ar->hdr.ar_date));
783 if (fwrite(&ar->hdr, sizeof(ar->hdr), 1, ar->fp) != 1) {
784 ArchError(("%s: cannot touch: %s", ar->fname, strerror(errno)));
791 *-----------------------------------------------------------------------
793 * Locate a member of an archive, given the path of the archive and
794 * the path of the desired member. If the archive is to be modified,
795 * the mode should be "r+", if not, it should be "r". The archive
796 * file is returned positioned at the correct header.
799 * A struct arfile *, opened for reading and, possibly writing,
800 * positioned at the member's header, or NULL if the member was
803 *-----------------------------------------------------------------------
805 static struct arfile *
806 ArchFindMember(const char *archive, const char *member, const char *mode)
809 const char *cp; /* Useful character pointer */
811 if ((ar = ArchArchiveOpen(archive, mode)) == NULL)
815 * Because of space constraints and similar things, files are archived
816 * using their final path components, not the entire thing, so we need
817 * to point 'member' to the final component, if there is one, to make
818 * the comparisons easier...
820 if (member != NULL) {
821 cp = strrchr(member, '/');
827 while (ArchArchiveNext(ar) > 0) {
829 * When comparing there are actually three cases:
830 * (1) the name fits into the limit og af_name,
831 * (2) the name is longer and the archive supports long names,
832 * (3) the name is longer and the archive doesn't support long
834 * Because we don't know whether the archive supports long
835 * names or not we need to be carefull.
837 if (member == NULL) {
838 /* special case - symbol table */
839 if (ar->member[0] == '\0')
841 } else if (strlen(member) <= AR_NAMSIZ) {
843 if (strcmp(ar->member, member) == 0)
845 } else if (strcmp(ar->member, member) == 0) {
850 if (strlen(ar->member) == AR_NAMSIZ &&
851 strncmp(member, ar->member, AR_NAMSIZ) == 0)
857 ArchArchiveClose(ar);
862 *-----------------------------------------------------------------------
864 * Locate a member of an archive, given the path of the archive and
865 * the path of the desired member, and a boolean representing whether
866 * or not the archive should be hashed (if not already hashed).
869 * A pointer to the current struct ar_hdr structure for the member. Note
870 * That no position is returned, so this is not useful for touching
871 * archive members. This is mostly because we have no assurances that
872 * The archive will remain constant after we read all the headers, so
873 * there's not much point in remembering the position...
877 *-----------------------------------------------------------------------
880 ArchStatMember(const char *archive, const char *member, Boolean hash)
885 char *cp; /* Useful character pointer */
886 Arch *ar; /* Archive descriptor */
887 Hash_Entry *he; /* Entry containing member's description */
888 char copy[AR_NAMSIZ + 1];
891 * Because of space constraints and similar things, files are archived
892 * using their final path components, not the entire thing, so we need
893 * to point 'member' to the final component, if there is one, to make
894 * the comparisons easier...
896 if (member != NULL) {
897 cp = strrchr(member, '/');
902 TAILQ_FOREACH(ar, &archives, link) {
903 if (strcmp(archive, ar->name) == 0)
907 /* archive not found */
910 * Caller doesn't want the thing hashed, just use
911 * ArchFindMember to read the header for the member
912 * out and close down the stream again.
914 arf = ArchFindMember(archive, member, "r");
919 ArchArchiveClose(arf);
924 * We don't have this archive on the list yet, so we want to
925 * find out everything that's in it and cache it so we can get
928 arf = ArchArchiveOpen(archive, "r");
933 /* create archive data structure */
934 ar = emalloc(sizeof(*ar));
935 ar->name = estrdup(archive);
936 Hash_InitTable(&ar->members, -1);
938 while ((t = ArchArchiveNext(arf)) > 0) {
939 he = Hash_CreateEntry(&ar->members, arf->member, NULL);
940 Hash_SetValue(he, emalloc(sizeof(int64_t)));
941 *(int64_t *)Hash_GetValue(he) = arf->time;
944 ArchArchiveClose(arf);
947 /* error happend - throw away everything */
948 Hash_DeleteTable(&ar->members);
954 TAILQ_INSERT_TAIL(&archives, ar, link);
958 * Now that the archive has been read and cached, we can look into
959 * the hash table to find the desired member's header.
961 he = Hash_FindEntry(&ar->members, member);
963 return (*(int64_t *)Hash_GetValue (he));
965 if (member != NULL && strlen(member) > AR_NAMSIZ) {
966 /* Try truncated name */
967 strncpy(copy, member, AR_NAMSIZ);
968 copy[AR_NAMSIZ] = '\0';
970 if ((he = Hash_FindEntry(&ar->members, copy)) != NULL)
971 return (*(int64_t *)Hash_GetValue(he));
978 *-----------------------------------------------------------------------
980 * Touch a member of an archive.
983 * The 'time' field of the member's header is updated.
986 * The modification time of the entire archive is also changed.
987 * For a library, this could necessitate the re-ranlib'ing of the
990 *-----------------------------------------------------------------------
993 Arch_Touch(GNode *gn)
997 ar = ArchFindMember(Var_Value(ARCHIVE, gn),
998 Var_Value(TARGET, gn), "r+");
1001 ArchArchiveTouch(ar, (int64_t)now);
1002 ArchArchiveClose(ar);
1007 *-----------------------------------------------------------------------
1009 * Given a node which represents a library, touch the thing, making
1010 * sure that the table of contents also is touched.
1016 * Both the modification time of the library and of the RANLIBMAG
1017 * member are set to 'now'.
1019 *-----------------------------------------------------------------------
1022 Arch_TouchLib(GNode *gn)
1024 struct arfile *ar; /* Open archive */
1025 struct utimbuf times; /* Times for utime() call */
1027 ar = ArchFindMember(gn->path, NULL, "r+");
1029 ArchArchiveTouch(ar, (int64_t)now);
1030 ArchArchiveClose(ar);
1032 times.actime = times.modtime = now;
1033 utime(gn->path, ×);
1038 *-----------------------------------------------------------------------
1040 * Return the modification time of a member of an archive, given its
1044 * The modification time(seconds).
1045 * XXXHB this should be a long.
1048 * The mtime field of the given node is filled in with the value
1049 * returned by the function.
1051 *-----------------------------------------------------------------------
1054 Arch_MTime(GNode *gn)
1058 mtime = ArchStatMember(Var_Value(ARCHIVE, gn),
1059 Var_Value(TARGET, gn), TRUE);
1061 if (mtime == INT_MIN) {
1064 gn->mtime = (int)mtime; /* XXX */
1069 *-----------------------------------------------------------------------
1071 * Given a non-existent archive member's node, get its modification
1072 * time from its archived form, if it exists.
1075 * The modification time.
1078 * The mtime field is filled in.
1080 *-----------------------------------------------------------------------
1083 Arch_MemMTime(GNode *gn)
1090 for (ln = Lst_First(&gn->parents); ln != NULL; ln = Lst_Succ(ln)) {
1091 pgn = Lst_Datum(ln);
1093 if (pgn->type & OP_ARCHV) {
1095 * If the parent is an archive specification and is
1096 * being made and its member's name matches the name of
1097 * the node we were given, record the modification time
1098 * of the parent in the child. We keep searching its
1099 * parents in case some other parent requires this
1102 nameStart = strchr(pgn->name, '(') + 1;
1103 nameEnd = strchr(nameStart, ')');
1105 if (pgn->make && strncmp(nameStart, gn->name,
1106 nameEnd - nameStart) == 0) {
1107 gn->mtime = Arch_MTime(pgn);
1109 } else if (pgn->make) {
1111 * Something which isn't a library depends on the
1112 * existence of this target, so it needs to exist.
1122 *-----------------------------------------------------------------------
1124 * Search for a named library along the given search path.
1130 * The node's 'path' field is set to the found path (including the
1131 * actual file name, not -l...). If the system can handle the -L
1132 * flag when linking (or we cannot find the library), we assume that
1133 * the user has placed the .LIBRARIES variable in the final linking
1134 * command (or the linker will know where to find it) and set the
1135 * TARGET variable for this node to be the node's name. Otherwise,
1136 * we set the TARGET variable to be the full path of the library,
1137 * as returned by Dir_FindFile.
1139 *-----------------------------------------------------------------------
1142 Arch_FindLib(GNode *gn, struct Path *path)
1144 char *libName; /* file name for archive */
1147 sz = strlen(gn->name) + 4;
1148 libName = emalloc(sz);
1149 snprintf(libName, sz, "lib%s.a", &gn->name[2]);
1151 gn->path = Path_FindFile(libName, path);
1156 Var_Set(TARGET, gn->name, gn);
1158 Var_Set(TARGET, gn->path == NULL ? gn->name : gn->path, gn);
1159 #endif /* LIBRARIES */
1163 *-----------------------------------------------------------------------
1165 * Decide if a node with the OP_LIB attribute is out-of-date. Called
1166 * from Make_OODate to make its life easier, with the library's
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:
1177 * Its modification time is less than that of one of its
1178 * sources (gn->mtime < gn->cmtime).
1179 * Its modification time is greater than the time at which the
1180 * make began (i.e. it's been modified in the course
1181 * of the make, probably by archiving).
1182 * The modification time of one of its sources is greater than
1183 * the one of its RANLIBMAG member (i.e. its table of contents
1184 * is out-of-date). We don't compare of the archive time
1185 * vs. TOC time because they can be too close. In my
1186 * opinion we should not bother with the TOC at all since
1187 * this is used by 'ar' rules that affect the data contents
1188 * of the archive, not by ranlib rules, which affect the
1192 * TRUE if the library is out-of-date. FALSE otherwise.
1195 * The library will be hashed if it hasn't been already.
1197 *-----------------------------------------------------------------------
1200 Arch_LibOODate(GNode *gn)
1202 int64_t mtime; /* The table-of-contents's mod time */
1204 if (OP_NOP(gn->type) && Lst_IsEmpty(&gn->children)) {
1207 if (gn->mtime > now || gn->mtime < gn->cmtime) {
1211 mtime = ArchStatMember(gn->path, NULL, FALSE);
1212 if (mtime == INT64_MIN) {
1214 * Not found. A library w/o a table of contents is out-of-date
1216 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1222 /* XXX choose one. */
1223 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1224 Debug("TOC modified %s...", Targ_FmtTime(mtime));
1226 return (gn->cmtime > mtime);