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
41 static char sccsid[] = "@(#)arch.c 8.2 (Berkeley) 1/2/94";
43 static const char rcsid[] =
44 "$FreeBSD: src/usr.bin/make/arch.c,v 1.15.2.1 2001/02/13 03:13:57 will Exp $";
50 * Functions to manipulate libraries, archives and their members.
52 * Once again, cacheing/hashing comes into play in the manipulation
53 * of archives. The first time an archive is referenced, all of its members'
54 * headers are read and hashed and the archive closed again. All hashed
55 * archives are kept on a list which is searched each time an archive member
58 * The interface to this module is:
59 * Arch_ParseArchive Given an archive specification, return a list
60 * of GNode's, one for each member in the spec.
61 * FAILURE is returned if the specification is
62 * invalid for some reason.
64 * Arch_Touch Alter the modification time of the archive
65 * member described by the given node to be
68 * Arch_TouchLib Update the modification time of the library
69 * described by the given node. This is special
70 * because it also updates the modification time
71 * of the library's table of contents.
73 * Arch_MTime Find the modification time of a member of
74 * an archive *in the archive*. The time is also
75 * placed in the member's GNode. Returns the
78 * Arch_MemTime Find the modification time of a member of
79 * an archive. Called when the member doesn't
80 * already exist. Looks in the archive for the
81 * modification time. Returns the modification
84 * Arch_FindLib Search for a library along a path. The
85 * library name in the GNode should be in
88 * Arch_LibOODate Special function to decide if a library node
91 * Arch_Init Initialize this module.
93 * Arch_End Cleanup this module.
96 #include <sys/types.h>
99 #include <sys/param.h>
110 static Lst archives; /* Lst of archives we've already examined */
112 typedef struct Arch {
113 char *name; /* Name of archive */
114 Hash_Table members; /* All the members of the archive described
115 * by <name, struct ar_hdr *> key/value pairs */
116 char *fnametab; /* Extended name table strings */
117 size_t fnamesize; /* Size of the string table */
120 static int ArchFindArchive __P((ClientData, ClientData));
121 static void ArchFree __P((ClientData));
122 static struct ar_hdr *ArchStatMember __P((char *, char *, Boolean));
123 static FILE *ArchFindMember __P((char *, char *, struct ar_hdr *, char *));
124 #if defined(__svr4__) || defined(__SVR4) || defined(__ELF__)
126 static int ArchSVR4Entry __P((Arch *, char *, size_t, FILE *));
130 *-----------------------------------------------------------------------
132 * Free memory used by an archive
140 *-----------------------------------------------------------------------
146 Arch *a = (Arch *) ap;
150 /* Free memory from hash entries */
151 for (entry = Hash_EnumFirst(&a->members, &search);
153 entry = Hash_EnumNext(&search))
154 free((Address) Hash_GetValue (entry));
158 Hash_DeleteTable(&a->members);
165 *-----------------------------------------------------------------------
166 * Arch_ParseArchive --
167 * Parse the archive specification in the given line and find/create
168 * the nodes for the specified archive members, placing their nodes
172 * SUCCESS if it was a valid specification. The linePtr is updated
173 * to point to the first non-space after the archive spec. The
174 * nodes for the members are placed on the given list.
177 * Some nodes may be created. The given list is extended.
179 *-----------------------------------------------------------------------
182 Arch_ParseArchive (linePtr, nodeLst, ctxt)
183 char **linePtr; /* Pointer to start of specification */
184 Lst nodeLst; /* Lst on which to place the nodes */
185 GNode *ctxt; /* Context in which to expand variables */
187 register char *cp; /* Pointer into line */
188 GNode *gn; /* New node */
189 char *libName; /* Library-part of specification */
190 char *memName; /* Member-part of specification */
191 char *nameBuf; /* temporary place for node name */
192 char saveChar; /* Ending delimiter of member-name */
193 Boolean subLibName; /* TRUE if libName should have/had
194 * variable substitution performed on it */
200 for (cp = libName; *cp != '(' && *cp != '\0'; cp++) {
203 * Variable spec, so call the Var module to parse the puppy
204 * so we can safely advance beyond it...
210 result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
211 if (result == var_Error) {
226 libName = Var_Subst(NULL, libName, ctxt, TRUE);
232 * First skip to the start of the member's name, mark that
233 * place and skip to the end of it (either white-space or
236 Boolean doSubst = FALSE; /* TRUE if need to substitute in memName */
238 while (*cp != '\0' && *cp != ')' && isspace (*cp)) {
242 while (*cp != '\0' && *cp != ')' && !isspace (*cp)) {
245 * Variable spec, so call the Var module to parse the puppy
246 * so we can safely advance beyond it...
252 result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
253 if (result == var_Error) {
269 * If the specification ends without a closing parenthesis,
270 * chances are there's something wrong (like a missing backslash),
271 * so it's better to return failure than allow such things to happen
274 printf("No closing parenthesis in archive specification\n");
279 * If we didn't move anywhere, we must be done
289 * XXX: This should be taken care of intelligently by
290 * SuffExpandChildren, both for the archive and the member portions.
293 * If member contains variables, try and substitute for them.
294 * This will slow down archive specs with dynamic sources, of course,
295 * since we'll be (non-)substituting them three times, but them's
296 * the breaks -- we need to do this since SuffExpandChildren calls
297 * us, otherwise we could assume the thing would be taken care of
303 char *oldMemName = memName;
306 memName = Var_Subst(NULL, memName, ctxt, TRUE);
309 * Now form an archive spec and recurse to deal with nested
310 * variables and multi-word variable values.... The results
311 * are just placed at the end of the nodeLst we're returning.
313 sz = strlen(memName) + strlen(libName) + 3;
314 buf = sacrifice = emalloc(sz);
315 snprintf(buf, sz, "%s(%s)", libName, memName);
317 if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) {
319 * Must contain dynamic sources, so we can't deal with it now.
320 * Just create an ARCHV node for the thing and let
321 * SuffExpandChildren handle it...
323 gn = Targ_FindNode(buf, TARG_CREATE);
325 if (gn == NILGNODE) {
329 gn->type |= OP_ARCHV;
330 (void)Lst_AtEnd(nodeLst, (ClientData)gn);
332 } else if (Arch_ParseArchive(&sacrifice, nodeLst, ctxt)!=SUCCESS) {
334 * Error in nested call -- free buffer and return FAILURE
341 * Free buffer and continue with our work.
344 } else if (Dir_HasWildcards(memName)) {
345 Lst members = Lst_Init(FALSE);
347 size_t sz = MAXPATHLEN;
349 nameBuf = emalloc(sz);
351 Dir_Expand(memName, dirSearchPath, members);
352 while (!Lst_IsEmpty(members)) {
353 member = (char *)Lst_DeQueue(members);
354 nsz = strlen(libName) + strlen(member) + 3;
356 nameBuf = erealloc(nameBuf, sz = nsz * 2);
358 snprintf(nameBuf, sz, "%s(%s)", libName, member);
360 gn = Targ_FindNode (nameBuf, TARG_CREATE);
361 if (gn == NILGNODE) {
366 * We've found the node, but have to make sure the rest of
367 * the world knows it's an archive member, without having
368 * to constantly check for parentheses, so we type the
369 * thing with the OP_ARCHV bit before we place it on the
370 * end of the provided list.
372 gn->type |= OP_ARCHV;
373 (void) Lst_AtEnd (nodeLst, (ClientData)gn);
376 Lst_Destroy(members, NOFREE);
379 size_t sz = strlen(libName) + strlen(memName) + 3;
380 nameBuf = emalloc(sz);
381 snprintf(nameBuf, sz, "%s(%s)", libName, memName);
382 gn = Targ_FindNode (nameBuf, TARG_CREATE);
384 if (gn == NILGNODE) {
388 * We've found the node, but have to make sure the rest of the
389 * world knows it's an archive member, without having to
390 * constantly check for parentheses, so we type the thing with
391 * the OP_ARCHV bit before we place it on the end of the
394 gn->type |= OP_ARCHV;
395 (void) Lst_AtEnd (nodeLst, (ClientData)gn);
406 * If substituted libName, free it now, since we need it no longer.
413 * We promised the pointer would be set up at the next non-space, so
414 * we must advance cp there before setting *linePtr... (note that on
415 * entrance to the loop, cp is guaranteed to point at a ')')
419 } while (*cp != '\0' && isspace (*cp));
426 *-----------------------------------------------------------------------
428 * See if the given archive is the one we are looking for. Called
429 * From ArchStatMember and ArchFindMember via Lst_Find.
432 * 0 if it is, non-zero if it isn't.
437 *-----------------------------------------------------------------------
440 ArchFindArchive (ar, archName)
441 ClientData ar; /* Current list element */
442 ClientData archName; /* Name we want */
444 return (strcmp ((char *) archName, ((Arch *) ar)->name));
448 *-----------------------------------------------------------------------
450 * Locate a member of an archive, given the path of the archive and
451 * the path of the desired member.
454 * A pointer to the current struct ar_hdr structure for the member. Note
455 * That no position is returned, so this is not useful for touching
456 * archive members. This is mostly because we have no assurances that
457 * The archive will remain constant after we read all the headers, so
458 * there's not much point in remembering the position...
462 *-----------------------------------------------------------------------
464 static struct ar_hdr *
465 ArchStatMember (archive, member, hash)
466 char *archive; /* Path to the archive */
467 char *member; /* Name of member. If it is a path, only the
468 * last component is used. */
469 Boolean hash; /* TRUE if archive should be hashed if not
472 #define AR_MAX_NAME_LEN (sizeof(arh.ar_name)-1)
473 FILE * arch; /* Stream to archive */
474 int size; /* Size of archive member */
475 char *cp; /* Useful character pointer */
477 LstNode ln; /* Lst member containing archive descriptor */
478 Arch *ar; /* Archive descriptor */
479 Hash_Entry *he; /* Entry containing member's description */
480 struct ar_hdr arh; /* archive-member header for reading archive */
481 char memName[MAXPATHLEN+1];
482 /* Current member name while hashing. */
485 * Because of space constraints and similar things, files are archived
486 * using their final path components, not the entire thing, so we need
487 * to point 'member' to the final component, if there is one, to make
488 * the comparisons easier...
490 cp = strrchr (member, '/');
491 if ((cp != NULL) && (strcmp(member, RANLIBMAG) != 0))
494 ln = Lst_Find (archives, (ClientData) archive, ArchFindArchive);
495 if (ln != NILLNODE) {
496 ar = (Arch *) Lst_Datum (ln);
498 he = Hash_FindEntry (&ar->members, member);
501 return ((struct ar_hdr *) Hash_GetValue (he));
503 /* Try truncated name */
504 char copy[AR_MAX_NAME_LEN+1];
505 int len = strlen (member);
507 if (len > AR_MAX_NAME_LEN) {
508 len = AR_MAX_NAME_LEN;
509 strncpy(copy, member, AR_MAX_NAME_LEN);
510 copy[AR_MAX_NAME_LEN] = '\0';
512 if ((he = Hash_FindEntry (&ar->members, copy)) != NULL)
513 return ((struct ar_hdr *) Hash_GetValue (he));
520 * Caller doesn't want the thing hashed, just use ArchFindMember
521 * to read the header for the member out and close down the stream
522 * again. Since the archive is not to be hashed, we assume there's
523 * no need to allocate extra room for the header we're returning,
524 * so just declare it static.
526 static struct ar_hdr sarh;
528 arch = ArchFindMember(archive, member, &sarh, "r");
539 * We don't have this archive on the list yet, so we want to find out
540 * everything that's in it and cache it so we can get at it quickly.
542 arch = fopen (archive, "r");
548 * We use the ARMAG string to make sure this is an archive we
551 if ((fread (magic, SARMAG, 1, arch) != 1) ||
552 (strncmp (magic, ARMAG, SARMAG) != 0)) {
557 ar = (Arch *)emalloc (sizeof (Arch));
558 ar->name = estrdup (archive);
561 Hash_InitTable (&ar->members, -1);
562 memName[AR_MAX_NAME_LEN] = '\0';
564 while (fread ((char *)&arh, sizeof (struct ar_hdr), 1, arch) == 1) {
565 if (strncmp ( arh.ar_fmag, ARFMAG, sizeof (arh.ar_fmag)) != 0) {
567 * The header is bogus, so the archive is bad
568 * and there's no way we can recover...
573 * We need to advance the stream's pointer to the start of the
574 * next header. Files are padded with newlines to an even-byte
575 * boundary, so we need to extract the size of the file from the
576 * 'size' field of the header and round it up during the seek.
578 arh.ar_size[sizeof(arh.ar_size)-1] = '\0';
579 size = (int) strtol(arh.ar_size, NULL, 10);
581 (void) strncpy (memName, arh.ar_name, sizeof(arh.ar_name));
582 for (cp = &memName[AR_MAX_NAME_LEN]; *cp == ' '; cp--) {
589 * svr4 names are slash terminated. Also svr4 extended AR format.
591 if (memName[0] == '/') {
593 * svr4 magic mode; handle it
595 switch (ArchSVR4Entry(ar, memName, size, arch)) {
596 case -1: /* Invalid data */
598 case 0: /* List of files entry */
600 default: /* Got the entry */
612 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
613 * first <namelen> bytes of the file
615 if (strncmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
616 isdigit(memName[sizeof(AR_EFMT1) - 1])) {
618 unsigned int elen = atoi(&memName[sizeof(AR_EFMT1)-1]);
620 if (elen > MAXPATHLEN)
622 if (fread (memName, elen, 1, arch) != 1)
624 memName[elen] = '\0';
625 fseek (arch, -elen, SEEK_CUR);
626 if (DEBUG(ARCH) || DEBUG(MAKE)) {
627 printf("ArchStat: Extended format entry for %s\n", memName);
632 he = Hash_CreateEntry (&ar->members, memName, NULL);
633 Hash_SetValue (he, (ClientData)emalloc (sizeof (struct ar_hdr)));
634 memcpy ((Address)Hash_GetValue (he), (Address)&arh,
635 sizeof (struct ar_hdr));
637 fseek (arch, (size + 1) & ~1, SEEK_CUR);
642 (void) Lst_AtEnd (archives, (ClientData) ar);
645 * Now that the archive has been read and cached, we can look into
646 * the hash table to find the desired member's header.
648 he = Hash_FindEntry (&ar->members, member);
651 return ((struct ar_hdr *) Hash_GetValue (he));
658 Hash_DeleteTable (&ar->members);
666 *-----------------------------------------------------------------------
668 * Parse an SVR4 style entry that begins with a slash.
669 * If it is "//", then load the table of filenames
670 * If it is "/<offset>", then try to substitute the long file name
671 * from offset of a table previously read.
674 * -1: Bad data in archive
675 * 0: A table was loaded from the file
676 * 1: Name was successfully substituted from table
677 * 2: Name was not successfully substituted from table
680 * If a table is read, the file pointer is moved to the next archive
683 *-----------------------------------------------------------------------
686 ArchSVR4Entry(ar, name, size, arch)
692 #define ARLONGNAMES1 "//"
693 #define ARLONGNAMES2 "/ARFILENAMES"
697 if (strncmp(name, ARLONGNAMES1, sizeof(ARLONGNAMES1) - 1) == 0 ||
698 strncmp(name, ARLONGNAMES2, sizeof(ARLONGNAMES2) - 1) == 0) {
700 if (ar->fnametab != NULL) {
702 printf("Attempted to redefine an SVR4 name table\n");
708 * This is a table of archive names, so we build one for
711 ar->fnametab = emalloc(size);
712 ar->fnamesize = size;
714 if (fread(ar->fnametab, size, 1, arch) != 1) {
716 printf("Reading an SVR4 name table failed\n");
720 eptr = ar->fnametab + size;
721 for (entry = 0, ptr = ar->fnametab; ptr < eptr; ptr++)
735 printf("Found svr4 archive name table with %d entries\n", entry);
740 if (name[1] == ' ' || name[1] == '\0')
743 entry = (size_t) strtol(&name[1], &eptr, 0);
744 if ((*eptr != ' ' && *eptr != '\0') || eptr == &name[1]) {
746 printf("Could not parse SVR4 name %s\n", name);
750 if (entry >= ar->fnamesize) {
752 printf("SVR4 entry offset %s is greater than %d\n",
753 name, ar->fnamesize);
759 printf("Replaced %s with %s\n", name, &ar->fnametab[entry]);
762 (void) strncpy(name, &ar->fnametab[entry], MAXPATHLEN);
763 name[MAXPATHLEN] = '\0';
770 *-----------------------------------------------------------------------
772 * Locate a member of an archive, given the path of the archive and
773 * the path of the desired member. If the archive is to be modified,
774 * the mode should be "r+", if not, it should be "r".
777 * An FILE *, opened for reading and writing, positioned at the
778 * start of the member's struct ar_hdr, or NULL if the member was
779 * nonexistent. The current struct ar_hdr for member.
782 * The passed struct ar_hdr structure is filled in.
784 *-----------------------------------------------------------------------
787 ArchFindMember (archive, member, arhPtr, mode)
788 char *archive; /* Path to the archive */
789 char *member; /* Name of member. If it is a path, only the
790 * last component is used. */
791 struct ar_hdr *arhPtr; /* Pointer to header structure to be filled in */
792 char *mode; /* The mode for opening the stream */
794 FILE * arch; /* Stream to archive */
795 int size; /* Size of archive member */
796 char *cp; /* Useful character pointer */
800 arch = fopen (archive, mode);
806 * We use the ARMAG string to make sure this is an archive we
809 if ((fread (magic, SARMAG, 1, arch) != 1) ||
810 (strncmp (magic, ARMAG, SARMAG) != 0)) {
816 * Because of space constraints and similar things, files are archived
817 * using their final path components, not the entire thing, so we need
818 * to point 'member' to the final component, if there is one, to make
819 * the comparisons easier...
821 cp = strrchr (member, '/');
822 if ((cp != NULL) && (strcmp(member, RANLIBMAG) != 0)) {
825 len = tlen = strlen (member);
826 if (len > sizeof (arhPtr->ar_name)) {
827 tlen = sizeof (arhPtr->ar_name);
830 while (fread ((char *)arhPtr, sizeof (struct ar_hdr), 1, arch) == 1) {
831 if (strncmp(arhPtr->ar_fmag, ARFMAG, sizeof (arhPtr->ar_fmag) ) != 0) {
833 * The header is bogus, so the archive is bad
834 * and there's no way we can recover...
838 } else if (strncmp (member, arhPtr->ar_name, tlen) == 0) {
840 * If the member's name doesn't take up the entire 'name' field,
841 * we have to be careful of matching prefixes. Names are space-
842 * padded to the right, so if the character in 'name' at the end
843 * of the matched string is anything but a space, this isn't the
846 if (tlen != sizeof(arhPtr->ar_name) && arhPtr->ar_name[tlen] != ' '){
850 * To make life easier, we reposition the file at the start
851 * of the header we just read before we return the stream.
852 * In a more general situation, it might be better to leave
853 * the file at the actual member, rather than its header, but
856 fseek (arch, -sizeof(struct ar_hdr), SEEK_CUR);
862 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
863 * first <namelen> bytes of the file
865 if (strncmp(arhPtr->ar_name, AR_EFMT1,
866 sizeof(AR_EFMT1) - 1) == 0 &&
867 isdigit(arhPtr->ar_name[sizeof(AR_EFMT1) - 1])) {
869 unsigned int elen = atoi(&arhPtr->ar_name[sizeof(AR_EFMT1)-1]);
870 char ename[MAXPATHLEN];
872 if (elen > MAXPATHLEN) {
876 if (fread (ename, elen, 1, arch) != 1) {
881 if (DEBUG(ARCH) || DEBUG(MAKE)) {
882 printf("ArchFind: Extended format entry for %s\n", ename);
884 if (strncmp(ename, member, len) == 0) {
885 /* Found as extended name */
886 fseek (arch, -sizeof(struct ar_hdr) - elen, SEEK_CUR);
889 fseek (arch, -elen, SEEK_CUR);
896 * This isn't the member we're after, so we need to advance the
897 * stream's pointer to the start of the next header. Files are
898 * padded with newlines to an even-byte boundary, so we need to
899 * extract the size of the file from the 'size' field of the
900 * header and round it up during the seek.
902 arhPtr->ar_size[sizeof(arhPtr->ar_size)-1] = '\0';
903 size = (int) strtol(arhPtr->ar_size, NULL, 10);
904 fseek (arch, (size + 1) & ~1, SEEK_CUR);
909 * We've looked everywhere, but the member is not to be found. Close the
910 * archive and return NULL -- an error.
917 *-----------------------------------------------------------------------
919 * Touch a member of an archive.
922 * The 'time' field of the member's header is updated.
925 * The modification time of the entire archive is also changed.
926 * For a library, this could necessitate the re-ranlib'ing of the
929 *-----------------------------------------------------------------------
933 GNode *gn; /* Node of member to touch */
935 FILE * arch; /* Stream open to archive, positioned properly */
936 struct ar_hdr arh; /* Current header describing member */
939 arch = ArchFindMember(Var_Value (ARCHIVE, gn, &p1),
940 Var_Value (TARGET, gn, &p2),
944 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now);
947 (void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
953 *-----------------------------------------------------------------------
955 * Given a node which represents a library, touch the thing, making
956 * sure that the table of contents also is touched.
962 * Both the modification time of the library and of the RANLIBMAG
963 * member are set to 'now'.
965 *-----------------------------------------------------------------------
969 GNode *gn; /* The node of the library to touch */
972 FILE * arch; /* Stream open to archive */
973 struct ar_hdr arh; /* Header describing table of contents */
974 struct utimbuf times; /* Times for utime() call */
976 arch = ArchFindMember (gn->path, RANLIBMAG, &arh, "r+");
977 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now);
980 (void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
983 times.actime = times.modtime = now;
984 utime(gn->path, ×);
990 *-----------------------------------------------------------------------
992 * Return the modification time of a member of an archive.
995 * The modification time (seconds).
998 * The mtime field of the given node is filled in with the value
999 * returned by the function.
1001 *-----------------------------------------------------------------------
1005 GNode *gn; /* Node describing archive member */
1007 struct ar_hdr *arhPtr; /* Header of desired member */
1008 int modTime; /* Modification time as an integer */
1011 arhPtr = ArchStatMember (Var_Value (ARCHIVE, gn, &p1),
1012 Var_Value (TARGET, gn, &p2),
1017 if (arhPtr != NULL) {
1018 modTime = (int) strtol(arhPtr->ar_date, NULL, 10);
1023 gn->mtime = modTime;
1028 *-----------------------------------------------------------------------
1030 * Given a non-existent archive member's node, get its modification
1031 * time from its archived form, if it exists.
1034 * The modification time.
1037 * The mtime field is filled in.
1039 *-----------------------------------------------------------------------
1050 if (Lst_Open (gn->parents) != SUCCESS) {
1054 while ((ln = Lst_Next (gn->parents)) != NILLNODE) {
1055 pgn = (GNode *) Lst_Datum (ln);
1057 if (pgn->type & OP_ARCHV) {
1059 * If the parent is an archive specification and is being made
1060 * and its member's name matches the name of the node we were
1061 * given, record the modification time of the parent in the
1062 * child. We keep searching its parents in case some other
1063 * parent requires this child to exist...
1065 nameStart = strchr (pgn->name, '(') + 1;
1066 nameEnd = strchr (nameStart, ')');
1069 strncmp(nameStart, gn->name, nameEnd - nameStart) == 0) {
1070 gn->mtime = Arch_MTime(pgn);
1072 } else if (pgn->make) {
1074 * Something which isn't a library depends on the existence of
1075 * this target, so it needs to exist.
1082 Lst_Close (gn->parents);
1088 *-----------------------------------------------------------------------
1090 * Search for a library along the given search path.
1096 * The node's 'path' field is set to the found path (including the
1097 * actual file name, not -l...). If the system can handle the -L
1098 * flag when linking (or we cannot find the library), we assume that
1099 * the user has placed the .LIBRARIES variable in the final linking
1100 * command (or the linker will know where to find it) and set the
1101 * TARGET variable for this node to be the node's name. Otherwise,
1102 * we set the TARGET variable to be the full path of the library,
1103 * as returned by Dir_FindFile.
1105 *-----------------------------------------------------------------------
1108 Arch_FindLib (gn, path)
1109 GNode *gn; /* Node of library to find */
1110 Lst path; /* Search path */
1112 char *libName; /* file name for archive */
1115 sz = strlen(gn->name) + 4;
1116 libName = (char *)emalloc(sz);
1117 snprintf(libName, sz, "lib%s.a", &gn->name[2]);
1119 gn->path = Dir_FindFile (libName, path);
1124 Var_Set (TARGET, gn->name, gn);
1126 Var_Set (TARGET, gn->path == NULL ? gn->name : gn->path, gn);
1127 #endif /* LIBRARIES */
1131 *-----------------------------------------------------------------------
1133 * Decide if a node with the OP_LIB attribute is out-of-date. Called
1134 * from Make_OODate to make its life easier.
1136 * There are several ways for a library to be out-of-date that are
1137 * not available to ordinary files. In addition, there are ways
1138 * that are open to regular files that are not available to
1139 * libraries. A library that is only used as a source is never
1140 * considered out-of-date by itself. This does not preclude the
1141 * library's modification time from making its parent be out-of-date.
1142 * A library will be considered out-of-date for any of these reasons,
1143 * given that it is a target on a dependency line somewhere:
1144 * Its modification time is less than that of one of its
1145 * sources (gn->mtime < gn->cmtime).
1146 * Its modification time is greater than the time at which the
1147 * make began (i.e. it's been modified in the course
1148 * of the make, probably by archiving).
1149 * The modification time of one of its sources is greater than
1150 * the one of its RANLIBMAG member (i.e. its table of contents
1151 * is out-of-date). We don't compare of the archive time
1152 * vs. TOC time because they can be too close. In my
1153 * opinion we should not bother with the TOC at all since
1154 * this is used by 'ar' rules that affect the data contents
1155 * of the archive, not by ranlib rules, which affect the
1159 * TRUE if the library is out-of-date. FALSE otherwise.
1162 * The library will be hashed if it hasn't been already.
1164 *-----------------------------------------------------------------------
1168 GNode *gn; /* The library's graph node */
1172 if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) {
1174 } else if ((gn->mtime > now) || (gn->mtime < gn->cmtime)) {
1178 struct ar_hdr *arhPtr; /* Header for __.SYMDEF */
1179 int modTimeTOC; /* The table-of-contents's mod time */
1181 arhPtr = ArchStatMember (gn->path, RANLIBMAG, FALSE);
1183 if (arhPtr != NULL) {
1184 modTimeTOC = (int) strtol(arhPtr->ar_date, NULL, 10);
1186 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1187 printf("%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC));
1189 oodate = (gn->cmtime > modTimeTOC);
1192 * A library w/o a table of contents is out-of-date
1194 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1195 printf("No t.o.c....");
1200 oodate = (gn->mtime == 0); /* out-of-date if not present */
1207 *-----------------------------------------------------------------------
1209 * Initialize things for this module.
1215 * The 'archives' list is initialized.
1217 *-----------------------------------------------------------------------
1222 archives = Lst_Init (FALSE);
1228 *-----------------------------------------------------------------------
1230 * Cleanup things for this module.
1236 * The 'archives' list is freed
1238 *-----------------------------------------------------------------------
1243 Lst_Destroy(archives, ArchFree);