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 * FAILURE 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.
89 * Arch_End Cleanup this module.
92 #include <sys/types.h>
95 #include <sys/param.h>
106 static Lst archives; /* Lst of archives we've already examined */
108 typedef struct Arch {
109 char *name; /* Name of archive */
110 Hash_Table members; /* All the members of the archive described
111 * by <name, struct ar_hdr *> key/value pairs */
112 char *fnametab; /* Extended name table strings */
113 size_t fnamesize; /* Size of the string table */
116 static int ArchFindArchive(void *, void *);
117 static void ArchFree(void *);
118 static struct ar_hdr *ArchStatMember(char *, char *, Boolean);
119 static FILE *ArchFindMember(char *, char *, struct ar_hdr *, char *);
120 #if defined(__svr4__) || defined(__SVR4) || defined(__ELF__)
122 static int ArchSVR4Entry(Arch *, char *, size_t, FILE *);
126 *-----------------------------------------------------------------------
128 * Free memory used by an archive
136 *-----------------------------------------------------------------------
141 Arch *a = (Arch *) ap;
145 /* Free memory from hash entries */
146 for (entry = Hash_EnumFirst(&a->members, &search);
148 entry = Hash_EnumNext(&search))
149 free(Hash_GetValue(entry));
153 Hash_DeleteTable(&a->members);
160 *-----------------------------------------------------------------------
161 * Arch_ParseArchive --
162 * Parse the archive specification in the given line and find/create
163 * the nodes for the specified archive members, placing their nodes
164 * on the given list, given the pointer to the start of the
165 * specification, a Lst on which to place the nodes, and a context
166 * in which to expand variables.
169 * SUCCESS if it was a valid specification. The linePtr is updated
170 * to point to the first non-space after the archive spec. The
171 * nodes for the members are placed on the given list.
174 * Some nodes may be created. The given list is extended.
176 *-----------------------------------------------------------------------
179 Arch_ParseArchive (char **linePtr, Lst nodeLst, GNode *ctxt)
181 char *cp; /* Pointer into line */
182 GNode *gn; /* New node */
183 char *libName; /* Library-part of specification */
184 char *memName; /* Member-part of specification */
185 char *nameBuf; /* temporary place for node name */
186 char saveChar; /* Ending delimiter of member-name */
187 Boolean subLibName; /* TRUE if libName should have/had
188 * variable substitution performed on it */
194 for (cp = libName; *cp != '(' && *cp != '\0'; cp++) {
197 * Variable spec, so call the Var module to parse the puppy
198 * so we can safely advance beyond it...
204 result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
205 if (result == var_Error) {
220 libName = Var_Subst(NULL, libName, ctxt, TRUE);
226 * First skip to the start of the member's name, mark that
227 * place and skip to the end of it (either white-space or
230 Boolean doSubst = FALSE; /* TRUE if need to substitute in memName */
232 while (*cp != '\0' && *cp != ')' && isspace ((unsigned char) *cp)) {
236 while (*cp != '\0' && *cp != ')' && !isspace ((unsigned char) *cp)) {
239 * Variable spec, so call the Var module to parse the puppy
240 * so we can safely advance beyond it...
246 result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
247 if (result == var_Error) {
263 * If the specification ends without a closing parenthesis,
264 * chances are there's something wrong (like a missing backslash),
265 * so it's better to return failure than allow such things to happen
268 printf("No closing parenthesis in archive specification\n");
273 * If we didn't move anywhere, we must be done
283 * XXX: This should be taken care of intelligently by
284 * SuffExpandChildren, both for the archive and the member portions.
287 * If member contains variables, try and substitute for them.
288 * This will slow down archive specs with dynamic sources, of course,
289 * since we'll be (non-)substituting them three times, but them's
290 * the breaks -- we need to do this since SuffExpandChildren calls
291 * us, otherwise we could assume the thing would be taken care of
297 char *oldMemName = memName;
300 memName = Var_Subst(NULL, memName, ctxt, TRUE);
303 * Now form an archive spec and recurse to deal with nested
304 * variables and multi-word variable values.... The results
305 * are just placed at the end of the nodeLst we're returning.
308 sz = strlen(memName) + strlen(libName) + 3;
309 buf = sacrifice = emalloc(sz);
311 snprintf(buf, sz, "%s(%s)", libName, memName);
313 if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) {
315 * Must contain dynamic sources, so we can't deal with it now.
316 * Just create an ARCHV node for the thing and let
317 * SuffExpandChildren handle it...
319 gn = Targ_FindNode(buf, TARG_CREATE);
325 gn->type |= OP_ARCHV;
326 (void)Lst_AtEnd(nodeLst, (void *)gn);
328 } else if (Arch_ParseArchive(&sacrifice, nodeLst, ctxt)!=SUCCESS) {
330 * Error in nested call -- free buffer and return FAILURE
337 * Free buffer and continue with our work.
340 } else if (Dir_HasWildcards(memName)) {
341 Lst members = Lst_Init(FALSE);
343 size_t sz = MAXPATHLEN;
345 nameBuf = emalloc(sz);
347 Dir_Expand(memName, dirSearchPath, members);
348 while (!Lst_IsEmpty(members)) {
349 member = (char *)Lst_DeQueue(members);
350 nsz = strlen(libName) + strlen(member) + 3;
352 nameBuf = erealloc(nameBuf, sz = nsz * 2);
354 snprintf(nameBuf, sz, "%s(%s)", libName, member);
356 gn = Targ_FindNode (nameBuf, TARG_CREATE);
362 * We've found the node, but have to make sure the rest of
363 * the world knows it's an archive member, without having
364 * to constantly check for parentheses, so we type the
365 * thing with the OP_ARCHV bit before we place it on the
366 * end of the provided list.
368 gn->type |= OP_ARCHV;
369 (void) Lst_AtEnd (nodeLst, (void *)gn);
372 Lst_Destroy(members, NOFREE);
375 size_t sz = strlen(libName) + strlen(memName) + 3;
376 nameBuf = emalloc(sz);
377 snprintf(nameBuf, sz, "%s(%s)", libName, memName);
378 gn = Targ_FindNode (nameBuf, TARG_CREATE);
384 * We've found the node, but have to make sure the rest of the
385 * world knows it's an archive member, without having to
386 * constantly check for parentheses, so we type the thing with
387 * the OP_ARCHV bit before we place it on the end of the
390 gn->type |= OP_ARCHV;
391 (void) Lst_AtEnd (nodeLst, (void *)gn);
402 * If substituted libName, free it now, since we need it no longer.
409 * We promised the pointer would be set up at the next non-space, so
410 * we must advance cp there before setting *linePtr... (note that on
411 * entrance to the loop, cp is guaranteed to point at a ')')
415 } while (*cp != '\0' && isspace ((unsigned char) *cp));
422 *-----------------------------------------------------------------------
424 * See if the given archive is the one we are looking for. Called
425 * From ArchStatMember and ArchFindMember via Lst_Find with the
426 * current list element and the name we want.
429 * 0 if it is, non-zero if it isn't.
434 *-----------------------------------------------------------------------
437 ArchFindArchive (void *ar, void *archName)
439 return (strcmp ((char *) archName, ((Arch *) ar)->name));
443 *-----------------------------------------------------------------------
445 * Locate a member of an archive, given the path of the archive and
446 * the path of the desired member, and a boolean representing whether
447 * or not the archive should be hashed (if not already hashed).
450 * A pointer to the current struct ar_hdr structure for the member. Note
451 * That no position is returned, so this is not useful for touching
452 * archive members. This is mostly because we have no assurances that
453 * The archive will remain constant after we read all the headers, so
454 * there's not much point in remembering the position...
458 *-----------------------------------------------------------------------
460 static struct ar_hdr *
461 ArchStatMember (char *archive, char *member, Boolean hash)
463 #define AR_MAX_NAME_LEN (sizeof(arh.ar_name)-1)
464 FILE * arch; /* Stream to archive */
465 int size; /* Size of archive member */
466 char *cp; /* Useful character pointer */
468 LstNode ln; /* Lst member containing archive descriptor */
469 Arch *ar; /* Archive descriptor */
470 Hash_Entry *he; /* Entry containing member's description */
471 struct ar_hdr arh; /* archive-member header for reading archive */
472 char memName[MAXPATHLEN+1];
473 /* Current member name while hashing. */
476 * Because of space constraints and similar things, files are archived
477 * using their final path components, not the entire thing, so we need
478 * to point 'member' to the final component, if there is one, to make
479 * the comparisons easier...
481 cp = strrchr (member, '/');
482 if ((cp != NULL) && (strcmp(member, RANLIBMAG) != 0))
485 ln = Lst_Find (archives, (void *) archive, ArchFindArchive);
487 ar = (Arch *) Lst_Datum (ln);
489 he = Hash_FindEntry (&ar->members, member);
492 return ((struct ar_hdr *) Hash_GetValue (he));
494 /* Try truncated name */
495 char copy[AR_MAX_NAME_LEN+1];
496 size_t len = strlen (member);
498 if (len > AR_MAX_NAME_LEN) {
499 len = AR_MAX_NAME_LEN;
500 strncpy(copy, member, AR_MAX_NAME_LEN);
501 copy[AR_MAX_NAME_LEN] = '\0';
503 if ((he = Hash_FindEntry (&ar->members, copy)) != NULL)
504 return ((struct ar_hdr *) Hash_GetValue (he));
511 * Caller doesn't want the thing hashed, just use ArchFindMember
512 * to read the header for the member out and close down the stream
513 * again. Since the archive is not to be hashed, we assume there's
514 * no need to allocate extra room for the header we're returning,
515 * so just declare it static.
517 static struct ar_hdr sarh;
519 arch = ArchFindMember(archive, member, &sarh, "r");
530 * We don't have this archive on the list yet, so we want to find out
531 * everything that's in it and cache it so we can get at it quickly.
533 arch = fopen (archive, "r");
539 * We use the ARMAG string to make sure this is an archive we
542 if ((fread (magic, SARMAG, 1, arch) != 1) ||
543 (strncmp (magic, ARMAG, SARMAG) != 0)) {
548 ar = (Arch *)emalloc (sizeof (Arch));
549 ar->name = estrdup (archive);
552 Hash_InitTable (&ar->members, -1);
553 memName[AR_MAX_NAME_LEN] = '\0';
555 while (fread ((char *)&arh, sizeof (struct ar_hdr), 1, arch) == 1) {
556 if (strncmp ( arh.ar_fmag, ARFMAG, sizeof (arh.ar_fmag)) != 0) {
558 * The header is bogus, so the archive is bad
559 * and there's no way we can recover...
564 * We need to advance the stream's pointer to the start of the
565 * next header. Files are padded with newlines to an even-byte
566 * boundary, so we need to extract the size of the file from the
567 * 'size' field of the header and round it up during the seek.
569 arh.ar_size[sizeof(arh.ar_size)-1] = '\0';
570 size = (int) strtol(arh.ar_size, NULL, 10);
572 (void) strncpy (memName, arh.ar_name, sizeof(arh.ar_name));
573 for (cp = &memName[AR_MAX_NAME_LEN]; *cp == ' '; cp--) {
580 * svr4 names are slash terminated. Also svr4 extended AR format.
582 if (memName[0] == '/') {
584 * svr4 magic mode; handle it
586 switch (ArchSVR4Entry(ar, memName, size, arch)) {
587 case -1: /* Invalid data */
589 case 0: /* List of files entry */
591 default: /* Got the entry */
603 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
604 * first <namelen> bytes of the file
606 if (strncmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
607 isdigit(memName[sizeof(AR_EFMT1) - 1])) {
609 unsigned int elen = atoi(&memName[sizeof(AR_EFMT1)-1]);
611 if (elen > MAXPATHLEN)
613 if (fread (memName, elen, 1, arch) != 1)
615 memName[elen] = '\0';
616 fseek (arch, -elen, SEEK_CUR);
617 /* XXX Multiple levels may be asked for, make this conditional
618 * on one, and use DEBUGF.
620 if (DEBUG(ARCH) || DEBUG(MAKE)) {
621 fprintf(stderr, "ArchStat: Extended format entry for %s\n", memName);
626 he = Hash_CreateEntry (&ar->members, memName, NULL);
627 Hash_SetValue (he, (void *)emalloc (sizeof (struct ar_hdr)));
628 memcpy (Hash_GetValue (he), &arh,
629 sizeof (struct ar_hdr));
631 fseek (arch, (size + 1) & ~1, SEEK_CUR);
636 (void) Lst_AtEnd (archives, (void *) ar);
639 * Now that the archive has been read and cached, we can look into
640 * the hash table to find the desired member's header.
642 he = Hash_FindEntry (&ar->members, member);
645 return ((struct ar_hdr *) Hash_GetValue (he));
652 Hash_DeleteTable (&ar->members);
660 *-----------------------------------------------------------------------
662 * Parse an SVR4 style entry that begins with a slash.
663 * If it is "//", then load the table of filenames
664 * If it is "/<offset>", then try to substitute the long file name
665 * from offset of a table previously read.
668 * -1: Bad data in archive
669 * 0: A table was loaded from the file
670 * 1: Name was successfully substituted from table
671 * 2: Name was not successfully substituted from table
674 * If a table is read, the file pointer is moved to the next archive
677 *-----------------------------------------------------------------------
680 ArchSVR4Entry(Arch *ar, char *name, size_t size, FILE *arch)
682 #define ARLONGNAMES1 "//"
683 #define ARLONGNAMES2 "/ARFILENAMES"
687 if (strncmp(name, ARLONGNAMES1, sizeof(ARLONGNAMES1) - 1) == 0 ||
688 strncmp(name, ARLONGNAMES2, sizeof(ARLONGNAMES2) - 1) == 0) {
690 if (ar->fnametab != NULL) {
691 DEBUGF(ARCH, ("Attempted to redefine an SVR4 name table\n"));
696 * This is a table of archive names, so we build one for
699 ar->fnametab = emalloc(size);
700 ar->fnamesize = size;
702 if (fread(ar->fnametab, size, 1, arch) != 1) {
703 DEBUGF(ARCH, ("Reading an SVR4 name table failed\n"));
706 eptr = ar->fnametab + size;
707 for (entry = 0, ptr = ar->fnametab; ptr < eptr; ptr++)
720 DEBUGF(ARCH, ("Found svr4 archive name table with %zu entries\n", entry));
724 if (name[1] == ' ' || name[1] == '\0')
727 entry = (size_t) strtol(&name[1], &eptr, 0);
728 if ((*eptr != ' ' && *eptr != '\0') || eptr == &name[1]) {
729 DEBUGF(ARCH, ("Could not parse SVR4 name %s\n", name));
732 if (entry >= ar->fnamesize) {
733 DEBUGF(ARCH, ("SVR4 entry offset %s is greater than %zu\n",
734 name, ar->fnamesize));
738 DEBUGF(ARCH, ("Replaced %s with %s\n", name, &ar->fnametab[entry]));
740 (void) strncpy(name, &ar->fnametab[entry], MAXPATHLEN);
741 name[MAXPATHLEN] = '\0';
748 *-----------------------------------------------------------------------
750 * Locate a member of an archive, given the path of the archive and
751 * the path of the desired member. If the archive is to be modified,
752 * the mode should be "r+", if not, it should be "r". arhPtr is a
753 * poitner to the header structure to fill in.
756 * An FILE *, opened for reading and writing, positioned at the
757 * start of the member's struct ar_hdr, or NULL if the member was
758 * nonexistent. The current struct ar_hdr for member.
761 * The passed struct ar_hdr structure is filled in.
763 *-----------------------------------------------------------------------
766 ArchFindMember (char *archive, char *member, struct ar_hdr *arhPtr, char *mode)
768 FILE * arch; /* Stream to archive */
769 int size; /* Size of archive member */
770 char *cp; /* Useful character pointer */
774 arch = fopen (archive, mode);
780 * We use the ARMAG string to make sure this is an archive we
783 if ((fread (magic, SARMAG, 1, arch) != 1) ||
784 (strncmp (magic, ARMAG, SARMAG) != 0)) {
790 * Because of space constraints and similar things, files are archived
791 * using their final path components, not the entire thing, so we need
792 * to point 'member' to the final component, if there is one, to make
793 * the comparisons easier...
795 cp = strrchr (member, '/');
796 if ((cp != NULL) && (strcmp(member, RANLIBMAG) != 0)) {
799 len = tlen = strlen (member);
800 if (len > sizeof (arhPtr->ar_name)) {
801 tlen = sizeof (arhPtr->ar_name);
804 while (fread ((char *)arhPtr, sizeof (struct ar_hdr), 1, arch) == 1) {
805 if (strncmp(arhPtr->ar_fmag, ARFMAG, sizeof (arhPtr->ar_fmag) ) != 0) {
807 * The header is bogus, so the archive is bad
808 * and there's no way we can recover...
812 } else if (strncmp (member, arhPtr->ar_name, tlen) == 0) {
814 * If the member's name doesn't take up the entire 'name' field,
815 * we have to be careful of matching prefixes. Names are space-
816 * padded to the right, so if the character in 'name' at the end
817 * of the matched string is anything but a space, this isn't the
820 if (tlen != sizeof(arhPtr->ar_name) && arhPtr->ar_name[tlen] != ' '){
824 * To make life easier, we reposition the file at the start
825 * of the header we just read before we return the stream.
826 * In a more general situation, it might be better to leave
827 * the file at the actual member, rather than its header, but
830 fseek (arch, -sizeof(struct ar_hdr), SEEK_CUR);
836 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
837 * first <namelen> bytes of the file
839 if (strncmp(arhPtr->ar_name, AR_EFMT1,
840 sizeof(AR_EFMT1) - 1) == 0 &&
841 isdigit(arhPtr->ar_name[sizeof(AR_EFMT1) - 1])) {
843 unsigned int elen = atoi(&arhPtr->ar_name[sizeof(AR_EFMT1)-1]);
844 char ename[MAXPATHLEN];
846 if (elen > MAXPATHLEN) {
850 if (fread (ename, elen, 1, arch) != 1) {
858 if (DEBUG(ARCH) || DEBUG(MAKE)) {
859 printf("ArchFind: Extended format entry for %s\n", ename);
861 if (strncmp(ename, member, len) == 0) {
862 /* Found as extended name */
863 fseek (arch, -sizeof(struct ar_hdr) - elen, SEEK_CUR);
866 fseek (arch, -elen, SEEK_CUR);
873 * This isn't the member we're after, so we need to advance the
874 * stream's pointer to the start of the next header. Files are
875 * padded with newlines to an even-byte boundary, so we need to
876 * extract the size of the file from the 'size' field of the
877 * header and round it up during the seek.
879 arhPtr->ar_size[sizeof(arhPtr->ar_size)-1] = '\0';
880 size = (int) strtol(arhPtr->ar_size, NULL, 10);
881 fseek (arch, (size + 1) & ~1, SEEK_CUR);
886 * We've looked everywhere, but the member is not to be found. Close the
887 * archive and return NULL -- an error.
894 *-----------------------------------------------------------------------
896 * Touch a member of an archive.
899 * The 'time' field of the member's header is updated.
902 * The modification time of the entire archive is also changed.
903 * For a library, this could necessitate the re-ranlib'ing of the
906 *-----------------------------------------------------------------------
909 Arch_Touch (GNode *gn)
911 FILE * arch; /* Stream open to archive, positioned properly */
912 struct ar_hdr arh; /* Current header describing member */
915 arch = ArchFindMember(Var_Value (ARCHIVE, gn, &p1),
916 Var_Value (TARGET, gn, &p2),
920 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now);
923 (void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
929 *-----------------------------------------------------------------------
931 * Given a node which represents a library, touch the thing, making
932 * sure that the table of contents also is touched.
938 * Both the modification time of the library and of the RANLIBMAG
939 * member are set to 'now'.
941 *-----------------------------------------------------------------------
944 Arch_TouchLib (GNode *gn)
947 FILE * arch; /* Stream open to archive */
948 struct ar_hdr arh; /* Header describing table of contents */
949 struct utimbuf times; /* Times for utime() call */
951 arch = ArchFindMember (gn->path, RANLIBMAG, &arh, "r+");
952 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now);
955 (void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
958 times.actime = times.modtime = now;
959 utime(gn->path, ×);
965 *-----------------------------------------------------------------------
967 * Return the modification time of a member of an archive, given its
971 * The modification time (seconds).
974 * The mtime field of the given node is filled in with the value
975 * returned by the function.
977 *-----------------------------------------------------------------------
980 Arch_MTime(GNode *gn)
982 struct ar_hdr *arhPtr; /* Header of desired member */
983 int modTime; /* Modification time as an integer */
986 arhPtr = ArchStatMember (Var_Value (ARCHIVE, gn, &p1),
987 Var_Value (TARGET, gn, &p2),
992 if (arhPtr != NULL) {
993 modTime = (int) strtol(arhPtr->ar_date, NULL, 10);
1003 *-----------------------------------------------------------------------
1005 * Given a non-existent archive member's node, get its modification
1006 * time from its archived form, if it exists.
1009 * The modification time.
1012 * The mtime field is filled in.
1014 *-----------------------------------------------------------------------
1017 Arch_MemMTime (GNode *gn)
1024 if (Lst_Open (gn->parents) != SUCCESS) {
1028 while ((ln = Lst_Next (gn->parents)) != NULL) {
1029 pgn = (GNode *) Lst_Datum (ln);
1031 if (pgn->type & OP_ARCHV) {
1033 * If the parent is an archive specification and is being made
1034 * and its member's name matches the name of the node we were
1035 * given, record the modification time of the parent in the
1036 * child. We keep searching its parents in case some other
1037 * parent requires this child to exist...
1039 nameStart = strchr (pgn->name, '(') + 1;
1040 nameEnd = strchr (nameStart, ')');
1043 strncmp(nameStart, gn->name, nameEnd - nameStart) == 0) {
1044 gn->mtime = Arch_MTime(pgn);
1046 } else if (pgn->make) {
1048 * Something which isn't a library depends on the existence of
1049 * this target, so it needs to exist.
1056 Lst_Close (gn->parents);
1062 *-----------------------------------------------------------------------
1064 * Search for a named library along the given search path.
1070 * The node's 'path' field is set to the found path (including the
1071 * actual file name, not -l...). If the system can handle the -L
1072 * flag when linking (or we cannot find the library), we assume that
1073 * the user has placed the .LIBRARIES variable in the final linking
1074 * command (or the linker will know where to find it) and set the
1075 * TARGET variable for this node to be the node's name. Otherwise,
1076 * we set the TARGET variable to be the full path of the library,
1077 * as returned by Dir_FindFile.
1079 *-----------------------------------------------------------------------
1082 Arch_FindLib (GNode *gn, Lst path)
1084 char *libName; /* file name for archive */
1087 sz = strlen(gn->name) + 4;
1088 libName = (char *)emalloc(sz);
1089 snprintf(libName, sz, "lib%s.a", &gn->name[2]);
1091 gn->path = Dir_FindFile (libName, path);
1096 Var_Set (TARGET, gn->name, gn);
1098 Var_Set (TARGET, gn->path == NULL ? gn->name : gn->path, gn);
1099 #endif /* LIBRARIES */
1103 *-----------------------------------------------------------------------
1105 * Decide if a node with the OP_LIB attribute is out-of-date. Called
1106 * from Make_OODate to make its life easier, with the library's
1109 * There are several ways for a library to be out-of-date that are
1110 * not available to ordinary files. In addition, there are ways
1111 * that are open to regular files that are not available to
1112 * libraries. A library that is only used as a source is never
1113 * considered out-of-date by itself. This does not preclude the
1114 * library's modification time from making its parent be out-of-date.
1115 * A library will be considered out-of-date for any of these reasons,
1116 * given that it is a target on a dependency line somewhere:
1117 * Its modification time is less than that of one of its
1118 * sources (gn->mtime < gn->cmtime).
1119 * Its modification time is greater than the time at which the
1120 * make began (i.e. it's been modified in the course
1121 * of the make, probably by archiving).
1122 * The modification time of one of its sources is greater than
1123 * the one of its RANLIBMAG member (i.e. its table of contents
1124 * is out-of-date). We don't compare of the archive time
1125 * vs. TOC time because they can be too close. In my
1126 * opinion we should not bother with the TOC at all since
1127 * this is used by 'ar' rules that affect the data contents
1128 * of the archive, not by ranlib rules, which affect the
1132 * TRUE if the library is out-of-date. FALSE otherwise.
1135 * The library will be hashed if it hasn't been already.
1137 *-----------------------------------------------------------------------
1140 Arch_LibOODate (GNode *gn)
1144 if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) {
1146 } else if ((gn->mtime > now) || (gn->mtime < gn->cmtime)) {
1150 struct ar_hdr *arhPtr; /* Header for __.SYMDEF */
1151 int modTimeTOC; /* The table-of-contents's mod time */
1153 arhPtr = ArchStatMember (gn->path, RANLIBMAG, FALSE);
1155 if (arhPtr != NULL) {
1156 modTimeTOC = (int) strtol(arhPtr->ar_date, NULL, 10);
1158 /* XXX choose one. */
1159 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1160 printf("%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC));
1162 oodate = (gn->cmtime > modTimeTOC);
1165 * A library w/o a table of contents is out-of-date
1167 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1168 printf("No t.o.c....");
1173 oodate = (gn->mtime == 0); /* out-of-date if not present */
1180 *-----------------------------------------------------------------------
1182 * Initialize things for this module.
1188 * The 'archives' list is initialized.
1190 *-----------------------------------------------------------------------
1195 archives = Lst_Init (FALSE);
1201 *-----------------------------------------------------------------------
1203 * Cleanup things for this module.
1209 * The 'archives' list is freed
1211 *-----------------------------------------------------------------------
1216 Lst_Destroy(archives, ArchFree);