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
39 * $FreeBSD: src/usr.bin/make/arch.c,v 1.15.2.1 2001/02/13 03:13:57 will Exp $
40 * $DragonFly: src/usr.bin/make/arch.c,v 1.2 2003/06/17 04:29:28 dillon Exp $
45 * Functions to manipulate libraries, archives and their members.
47 * Once again, cacheing/hashing comes into play in the manipulation
48 * of archives. The first time an archive is referenced, all of its members'
49 * headers are read and hashed and the archive closed again. All hashed
50 * archives are kept on a list which is searched each time an archive member
53 * The interface to this module is:
54 * Arch_ParseArchive Given an archive specification, return a list
55 * of GNode's, one for each member in the spec.
56 * FAILURE is returned if the specification is
57 * invalid for some reason.
59 * Arch_Touch Alter the modification time of the archive
60 * member described by the given node to be
63 * Arch_TouchLib Update the modification time of the library
64 * described by the given node. This is special
65 * because it also updates the modification time
66 * of the library's table of contents.
68 * Arch_MTime Find the modification time of a member of
69 * an archive *in the archive*. The time is also
70 * placed in the member's GNode. Returns the
73 * Arch_MemTime Find the modification time of a member of
74 * an archive. Called when the member doesn't
75 * already exist. Looks in the archive for the
76 * modification time. Returns the modification
79 * Arch_FindLib Search for a library along a path. The
80 * library name in the GNode should be in
83 * Arch_LibOODate Special function to decide if a library node
86 * Arch_Init Initialize this module.
88 * Arch_End Cleanup this module.
91 #include <sys/types.h>
94 #include <sys/param.h>
105 static Lst archives; /* Lst of archives we've already examined */
107 typedef struct Arch {
108 char *name; /* Name of archive */
109 Hash_Table members; /* All the members of the archive described
110 * by <name, struct ar_hdr *> key/value pairs */
111 char *fnametab; /* Extended name table strings */
112 size_t fnamesize; /* Size of the string table */
115 static int ArchFindArchive __P((ClientData, ClientData));
116 static void ArchFree __P((ClientData));
117 static struct ar_hdr *ArchStatMember __P((char *, char *, Boolean));
118 static FILE *ArchFindMember __P((char *, char *, struct ar_hdr *, char *));
119 #if defined(__svr4__) || defined(__SVR4) || defined(__ELF__)
121 static int ArchSVR4Entry __P((Arch *, char *, size_t, FILE *));
125 *-----------------------------------------------------------------------
127 * Free memory used by an archive
135 *-----------------------------------------------------------------------
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((Address) 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
167 * SUCCESS if it was a valid specification. The linePtr is updated
168 * to point to the first non-space after the archive spec. The
169 * nodes for the members are placed on the given list.
172 * Some nodes may be created. The given list is extended.
174 *-----------------------------------------------------------------------
177 Arch_ParseArchive (linePtr, nodeLst, ctxt)
178 char **linePtr; /* Pointer to start of specification */
179 Lst nodeLst; /* Lst on which to place the nodes */
180 GNode *ctxt; /* Context in which to expand variables */
182 register char *cp; /* Pointer into line */
183 GNode *gn; /* New node */
184 char *libName; /* Library-part of specification */
185 char *memName; /* Member-part of specification */
186 char *nameBuf; /* temporary place for node name */
187 char saveChar; /* Ending delimiter of member-name */
188 Boolean subLibName; /* TRUE if libName should have/had
189 * variable substitution performed on it */
195 for (cp = libName; *cp != '(' && *cp != '\0'; cp++) {
198 * Variable spec, so call the Var module to parse the puppy
199 * so we can safely advance beyond it...
205 result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
206 if (result == var_Error) {
221 libName = Var_Subst(NULL, libName, ctxt, TRUE);
227 * First skip to the start of the member's name, mark that
228 * place and skip to the end of it (either white-space or
231 Boolean doSubst = FALSE; /* TRUE if need to substitute in memName */
233 while (*cp != '\0' && *cp != ')' && isspace (*cp)) {
237 while (*cp != '\0' && *cp != ')' && !isspace (*cp)) {
240 * Variable spec, so call the Var module to parse the puppy
241 * so we can safely advance beyond it...
247 result=Var_Parse(cp, ctxt, TRUE, &length, &freeIt);
248 if (result == var_Error) {
264 * If the specification ends without a closing parenthesis,
265 * chances are there's something wrong (like a missing backslash),
266 * so it's better to return failure than allow such things to happen
269 printf("No closing parenthesis in archive specification\n");
274 * If we didn't move anywhere, we must be done
284 * XXX: This should be taken care of intelligently by
285 * SuffExpandChildren, both for the archive and the member portions.
288 * If member contains variables, try and substitute for them.
289 * This will slow down archive specs with dynamic sources, of course,
290 * since we'll be (non-)substituting them three times, but them's
291 * the breaks -- we need to do this since SuffExpandChildren calls
292 * us, otherwise we could assume the thing would be taken care of
298 char *oldMemName = memName;
301 memName = Var_Subst(NULL, memName, ctxt, TRUE);
304 * Now form an archive spec and recurse to deal with nested
305 * variables and multi-word variable values.... The results
306 * are just placed at the end of the nodeLst we're returning.
308 sz = strlen(memName) + strlen(libName) + 3;
309 buf = sacrifice = emalloc(sz);
310 snprintf(buf, sz, "%s(%s)", libName, memName);
312 if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) {
314 * Must contain dynamic sources, so we can't deal with it now.
315 * Just create an ARCHV node for the thing and let
316 * SuffExpandChildren handle it...
318 gn = Targ_FindNode(buf, TARG_CREATE);
320 if (gn == NILGNODE) {
324 gn->type |= OP_ARCHV;
325 (void)Lst_AtEnd(nodeLst, (ClientData)gn);
327 } else if (Arch_ParseArchive(&sacrifice, nodeLst, ctxt)!=SUCCESS) {
329 * Error in nested call -- free buffer and return FAILURE
336 * Free buffer and continue with our work.
339 } else if (Dir_HasWildcards(memName)) {
340 Lst members = Lst_Init(FALSE);
342 size_t sz = MAXPATHLEN;
344 nameBuf = emalloc(sz);
346 Dir_Expand(memName, dirSearchPath, members);
347 while (!Lst_IsEmpty(members)) {
348 member = (char *)Lst_DeQueue(members);
349 nsz = strlen(libName) + strlen(member) + 3;
351 nameBuf = erealloc(nameBuf, sz = nsz * 2);
353 snprintf(nameBuf, sz, "%s(%s)", libName, member);
355 gn = Targ_FindNode (nameBuf, TARG_CREATE);
356 if (gn == NILGNODE) {
361 * We've found the node, but have to make sure the rest of
362 * the world knows it's an archive member, without having
363 * to constantly check for parentheses, so we type the
364 * thing with the OP_ARCHV bit before we place it on the
365 * end of the provided list.
367 gn->type |= OP_ARCHV;
368 (void) Lst_AtEnd (nodeLst, (ClientData)gn);
371 Lst_Destroy(members, NOFREE);
374 size_t sz = strlen(libName) + strlen(memName) + 3;
375 nameBuf = emalloc(sz);
376 snprintf(nameBuf, sz, "%s(%s)", libName, memName);
377 gn = Targ_FindNode (nameBuf, TARG_CREATE);
379 if (gn == NILGNODE) {
383 * We've found the node, but have to make sure the rest of the
384 * world knows it's an archive member, without having to
385 * constantly check for parentheses, so we type the thing with
386 * the OP_ARCHV bit before we place it on the end of the
389 gn->type |= OP_ARCHV;
390 (void) Lst_AtEnd (nodeLst, (ClientData)gn);
401 * If substituted libName, free it now, since we need it no longer.
408 * We promised the pointer would be set up at the next non-space, so
409 * we must advance cp there before setting *linePtr... (note that on
410 * entrance to the loop, cp is guaranteed to point at a ')')
414 } while (*cp != '\0' && isspace (*cp));
421 *-----------------------------------------------------------------------
423 * See if the given archive is the one we are looking for. Called
424 * From ArchStatMember and ArchFindMember via Lst_Find.
427 * 0 if it is, non-zero if it isn't.
432 *-----------------------------------------------------------------------
435 ArchFindArchive (ar, archName)
436 ClientData ar; /* Current list element */
437 ClientData archName; /* Name we want */
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.
449 * A pointer to the current struct ar_hdr structure for the member. Note
450 * That no position is returned, so this is not useful for touching
451 * archive members. This is mostly because we have no assurances that
452 * The archive will remain constant after we read all the headers, so
453 * there's not much point in remembering the position...
457 *-----------------------------------------------------------------------
459 static struct ar_hdr *
460 ArchStatMember (archive, member, hash)
461 char *archive; /* Path to the archive */
462 char *member; /* Name of member. If it is a path, only the
463 * last component is used. */
464 Boolean hash; /* TRUE if archive should be hashed if not
467 #define AR_MAX_NAME_LEN (sizeof(arh.ar_name)-1)
468 FILE * arch; /* Stream to archive */
469 int size; /* Size of archive member */
470 char *cp; /* Useful character pointer */
472 LstNode ln; /* Lst member containing archive descriptor */
473 Arch *ar; /* Archive descriptor */
474 Hash_Entry *he; /* Entry containing member's description */
475 struct ar_hdr arh; /* archive-member header for reading archive */
476 char memName[MAXPATHLEN+1];
477 /* Current member name while hashing. */
480 * Because of space constraints and similar things, files are archived
481 * using their final path components, not the entire thing, so we need
482 * to point 'member' to the final component, if there is one, to make
483 * the comparisons easier...
485 cp = strrchr (member, '/');
486 if ((cp != NULL) && (strcmp(member, RANLIBMAG) != 0))
489 ln = Lst_Find (archives, (ClientData) archive, ArchFindArchive);
490 if (ln != NILLNODE) {
491 ar = (Arch *) Lst_Datum (ln);
493 he = Hash_FindEntry (&ar->members, member);
496 return ((struct ar_hdr *) Hash_GetValue (he));
498 /* Try truncated name */
499 char copy[AR_MAX_NAME_LEN+1];
500 int len = strlen (member);
502 if (len > AR_MAX_NAME_LEN) {
503 len = AR_MAX_NAME_LEN;
504 strncpy(copy, member, AR_MAX_NAME_LEN);
505 copy[AR_MAX_NAME_LEN] = '\0';
507 if ((he = Hash_FindEntry (&ar->members, copy)) != NULL)
508 return ((struct ar_hdr *) Hash_GetValue (he));
515 * Caller doesn't want the thing hashed, just use ArchFindMember
516 * to read the header for the member out and close down the stream
517 * again. Since the archive is not to be hashed, we assume there's
518 * no need to allocate extra room for the header we're returning,
519 * so just declare it static.
521 static struct ar_hdr sarh;
523 arch = ArchFindMember(archive, member, &sarh, "r");
534 * We don't have this archive on the list yet, so we want to find out
535 * everything that's in it and cache it so we can get at it quickly.
537 arch = fopen (archive, "r");
543 * We use the ARMAG string to make sure this is an archive we
546 if ((fread (magic, SARMAG, 1, arch) != 1) ||
547 (strncmp (magic, ARMAG, SARMAG) != 0)) {
552 ar = (Arch *)emalloc (sizeof (Arch));
553 ar->name = estrdup (archive);
556 Hash_InitTable (&ar->members, -1);
557 memName[AR_MAX_NAME_LEN] = '\0';
559 while (fread ((char *)&arh, sizeof (struct ar_hdr), 1, arch) == 1) {
560 if (strncmp ( arh.ar_fmag, ARFMAG, sizeof (arh.ar_fmag)) != 0) {
562 * The header is bogus, so the archive is bad
563 * and there's no way we can recover...
568 * We need to advance the stream's pointer to the start of the
569 * next header. Files are padded with newlines to an even-byte
570 * boundary, so we need to extract the size of the file from the
571 * 'size' field of the header and round it up during the seek.
573 arh.ar_size[sizeof(arh.ar_size)-1] = '\0';
574 size = (int) strtol(arh.ar_size, NULL, 10);
576 (void) strncpy (memName, arh.ar_name, sizeof(arh.ar_name));
577 for (cp = &memName[AR_MAX_NAME_LEN]; *cp == ' '; cp--) {
584 * svr4 names are slash terminated. Also svr4 extended AR format.
586 if (memName[0] == '/') {
588 * svr4 magic mode; handle it
590 switch (ArchSVR4Entry(ar, memName, size, arch)) {
591 case -1: /* Invalid data */
593 case 0: /* List of files entry */
595 default: /* Got the entry */
607 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
608 * first <namelen> bytes of the file
610 if (strncmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
611 isdigit(memName[sizeof(AR_EFMT1) - 1])) {
613 unsigned int elen = atoi(&memName[sizeof(AR_EFMT1)-1]);
615 if (elen > MAXPATHLEN)
617 if (fread (memName, elen, 1, arch) != 1)
619 memName[elen] = '\0';
620 fseek (arch, -elen, SEEK_CUR);
621 if (DEBUG(ARCH) || DEBUG(MAKE)) {
622 printf("ArchStat: Extended format entry for %s\n", memName);
627 he = Hash_CreateEntry (&ar->members, memName, NULL);
628 Hash_SetValue (he, (ClientData)emalloc (sizeof (struct ar_hdr)));
629 memcpy ((Address)Hash_GetValue (he), (Address)&arh,
630 sizeof (struct ar_hdr));
632 fseek (arch, (size + 1) & ~1, SEEK_CUR);
637 (void) Lst_AtEnd (archives, (ClientData) ar);
640 * Now that the archive has been read and cached, we can look into
641 * the hash table to find the desired member's header.
643 he = Hash_FindEntry (&ar->members, member);
646 return ((struct ar_hdr *) Hash_GetValue (he));
653 Hash_DeleteTable (&ar->members);
661 *-----------------------------------------------------------------------
663 * Parse an SVR4 style entry that begins with a slash.
664 * If it is "//", then load the table of filenames
665 * If it is "/<offset>", then try to substitute the long file name
666 * from offset of a table previously read.
669 * -1: Bad data in archive
670 * 0: A table was loaded from the file
671 * 1: Name was successfully substituted from table
672 * 2: Name was not successfully substituted from table
675 * If a table is read, the file pointer is moved to the next archive
678 *-----------------------------------------------------------------------
681 ArchSVR4Entry(ar, name, size, arch)
687 #define ARLONGNAMES1 "//"
688 #define ARLONGNAMES2 "/ARFILENAMES"
692 if (strncmp(name, ARLONGNAMES1, sizeof(ARLONGNAMES1) - 1) == 0 ||
693 strncmp(name, ARLONGNAMES2, sizeof(ARLONGNAMES2) - 1) == 0) {
695 if (ar->fnametab != NULL) {
697 printf("Attempted to redefine an SVR4 name table\n");
703 * This is a table of archive names, so we build one for
706 ar->fnametab = emalloc(size);
707 ar->fnamesize = size;
709 if (fread(ar->fnametab, size, 1, arch) != 1) {
711 printf("Reading an SVR4 name table failed\n");
715 eptr = ar->fnametab + size;
716 for (entry = 0, ptr = ar->fnametab; ptr < eptr; ptr++)
730 printf("Found svr4 archive name table with %d entries\n", entry);
735 if (name[1] == ' ' || name[1] == '\0')
738 entry = (size_t) strtol(&name[1], &eptr, 0);
739 if ((*eptr != ' ' && *eptr != '\0') || eptr == &name[1]) {
741 printf("Could not parse SVR4 name %s\n", name);
745 if (entry >= ar->fnamesize) {
747 printf("SVR4 entry offset %s is greater than %d\n",
748 name, ar->fnamesize);
754 printf("Replaced %s with %s\n", name, &ar->fnametab[entry]);
757 (void) strncpy(name, &ar->fnametab[entry], MAXPATHLEN);
758 name[MAXPATHLEN] = '\0';
765 *-----------------------------------------------------------------------
767 * Locate a member of an archive, given the path of the archive and
768 * the path of the desired member. If the archive is to be modified,
769 * the mode should be "r+", if not, it should be "r".
772 * An FILE *, opened for reading and writing, positioned at the
773 * start of the member's struct ar_hdr, or NULL if the member was
774 * nonexistent. The current struct ar_hdr for member.
777 * The passed struct ar_hdr structure is filled in.
779 *-----------------------------------------------------------------------
782 ArchFindMember (archive, member, arhPtr, mode)
783 char *archive; /* Path to the archive */
784 char *member; /* Name of member. If it is a path, only the
785 * last component is used. */
786 struct ar_hdr *arhPtr; /* Pointer to header structure to be filled in */
787 char *mode; /* The mode for opening the stream */
789 FILE * arch; /* Stream to archive */
790 int size; /* Size of archive member */
791 char *cp; /* Useful character pointer */
795 arch = fopen (archive, mode);
801 * We use the ARMAG string to make sure this is an archive we
804 if ((fread (magic, SARMAG, 1, arch) != 1) ||
805 (strncmp (magic, ARMAG, SARMAG) != 0)) {
811 * Because of space constraints and similar things, files are archived
812 * using their final path components, not the entire thing, so we need
813 * to point 'member' to the final component, if there is one, to make
814 * the comparisons easier...
816 cp = strrchr (member, '/');
817 if ((cp != NULL) && (strcmp(member, RANLIBMAG) != 0)) {
820 len = tlen = strlen (member);
821 if (len > sizeof (arhPtr->ar_name)) {
822 tlen = sizeof (arhPtr->ar_name);
825 while (fread ((char *)arhPtr, sizeof (struct ar_hdr), 1, arch) == 1) {
826 if (strncmp(arhPtr->ar_fmag, ARFMAG, sizeof (arhPtr->ar_fmag) ) != 0) {
828 * The header is bogus, so the archive is bad
829 * and there's no way we can recover...
833 } else if (strncmp (member, arhPtr->ar_name, tlen) == 0) {
835 * If the member's name doesn't take up the entire 'name' field,
836 * we have to be careful of matching prefixes. Names are space-
837 * padded to the right, so if the character in 'name' at the end
838 * of the matched string is anything but a space, this isn't the
841 if (tlen != sizeof(arhPtr->ar_name) && arhPtr->ar_name[tlen] != ' '){
845 * To make life easier, we reposition the file at the start
846 * of the header we just read before we return the stream.
847 * In a more general situation, it might be better to leave
848 * the file at the actual member, rather than its header, but
851 fseek (arch, -sizeof(struct ar_hdr), SEEK_CUR);
857 * BSD 4.4 extended AR format: #1/<namelen>, with name as the
858 * first <namelen> bytes of the file
860 if (strncmp(arhPtr->ar_name, AR_EFMT1,
861 sizeof(AR_EFMT1) - 1) == 0 &&
862 isdigit(arhPtr->ar_name[sizeof(AR_EFMT1) - 1])) {
864 unsigned int elen = atoi(&arhPtr->ar_name[sizeof(AR_EFMT1)-1]);
865 char ename[MAXPATHLEN];
867 if (elen > MAXPATHLEN) {
871 if (fread (ename, elen, 1, arch) != 1) {
876 if (DEBUG(ARCH) || DEBUG(MAKE)) {
877 printf("ArchFind: Extended format entry for %s\n", ename);
879 if (strncmp(ename, member, len) == 0) {
880 /* Found as extended name */
881 fseek (arch, -sizeof(struct ar_hdr) - elen, SEEK_CUR);
884 fseek (arch, -elen, SEEK_CUR);
891 * This isn't the member we're after, so we need to advance the
892 * stream's pointer to the start of the next header. Files are
893 * padded with newlines to an even-byte boundary, so we need to
894 * extract the size of the file from the 'size' field of the
895 * header and round it up during the seek.
897 arhPtr->ar_size[sizeof(arhPtr->ar_size)-1] = '\0';
898 size = (int) strtol(arhPtr->ar_size, NULL, 10);
899 fseek (arch, (size + 1) & ~1, SEEK_CUR);
904 * We've looked everywhere, but the member is not to be found. Close the
905 * archive and return NULL -- an error.
912 *-----------------------------------------------------------------------
914 * Touch a member of an archive.
917 * The 'time' field of the member's header is updated.
920 * The modification time of the entire archive is also changed.
921 * For a library, this could necessitate the re-ranlib'ing of the
924 *-----------------------------------------------------------------------
928 GNode *gn; /* Node of member to touch */
930 FILE * arch; /* Stream open to archive, positioned properly */
931 struct ar_hdr arh; /* Current header describing member */
934 arch = ArchFindMember(Var_Value (ARCHIVE, gn, &p1),
935 Var_Value (TARGET, gn, &p2),
939 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now);
942 (void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
948 *-----------------------------------------------------------------------
950 * Given a node which represents a library, touch the thing, making
951 * sure that the table of contents also is touched.
957 * Both the modification time of the library and of the RANLIBMAG
958 * member are set to 'now'.
960 *-----------------------------------------------------------------------
964 GNode *gn; /* The node of the library to touch */
967 FILE * arch; /* Stream open to archive */
968 struct ar_hdr arh; /* Header describing table of contents */
969 struct utimbuf times; /* Times for utime() call */
971 arch = ArchFindMember (gn->path, RANLIBMAG, &arh, "r+");
972 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now);
975 (void)fwrite ((char *)&arh, sizeof (struct ar_hdr), 1, arch);
978 times.actime = times.modtime = now;
979 utime(gn->path, ×);
985 *-----------------------------------------------------------------------
987 * Return the modification time of a member of an archive.
990 * The modification time (seconds).
993 * The mtime field of the given node is filled in with the value
994 * returned by the function.
996 *-----------------------------------------------------------------------
1000 GNode *gn; /* Node describing archive member */
1002 struct ar_hdr *arhPtr; /* Header of desired member */
1003 int modTime; /* Modification time as an integer */
1006 arhPtr = ArchStatMember (Var_Value (ARCHIVE, gn, &p1),
1007 Var_Value (TARGET, gn, &p2),
1012 if (arhPtr != NULL) {
1013 modTime = (int) strtol(arhPtr->ar_date, NULL, 10);
1018 gn->mtime = modTime;
1023 *-----------------------------------------------------------------------
1025 * Given a non-existent archive member's node, get its modification
1026 * time from its archived form, if it exists.
1029 * The modification time.
1032 * The mtime field is filled in.
1034 *-----------------------------------------------------------------------
1045 if (Lst_Open (gn->parents) != SUCCESS) {
1049 while ((ln = Lst_Next (gn->parents)) != NILLNODE) {
1050 pgn = (GNode *) Lst_Datum (ln);
1052 if (pgn->type & OP_ARCHV) {
1054 * If the parent is an archive specification and is being made
1055 * and its member's name matches the name of the node we were
1056 * given, record the modification time of the parent in the
1057 * child. We keep searching its parents in case some other
1058 * parent requires this child to exist...
1060 nameStart = strchr (pgn->name, '(') + 1;
1061 nameEnd = strchr (nameStart, ')');
1064 strncmp(nameStart, gn->name, nameEnd - nameStart) == 0) {
1065 gn->mtime = Arch_MTime(pgn);
1067 } else if (pgn->make) {
1069 * Something which isn't a library depends on the existence of
1070 * this target, so it needs to exist.
1077 Lst_Close (gn->parents);
1083 *-----------------------------------------------------------------------
1085 * Search for a library along the given search path.
1091 * The node's 'path' field is set to the found path (including the
1092 * actual file name, not -l...). If the system can handle the -L
1093 * flag when linking (or we cannot find the library), we assume that
1094 * the user has placed the .LIBRARIES variable in the final linking
1095 * command (or the linker will know where to find it) and set the
1096 * TARGET variable for this node to be the node's name. Otherwise,
1097 * we set the TARGET variable to be the full path of the library,
1098 * as returned by Dir_FindFile.
1100 *-----------------------------------------------------------------------
1103 Arch_FindLib (gn, path)
1104 GNode *gn; /* Node of library to find */
1105 Lst path; /* Search path */
1107 char *libName; /* file name for archive */
1110 sz = strlen(gn->name) + 4;
1111 libName = (char *)emalloc(sz);
1112 snprintf(libName, sz, "lib%s.a", &gn->name[2]);
1114 gn->path = Dir_FindFile (libName, path);
1119 Var_Set (TARGET, gn->name, gn);
1121 Var_Set (TARGET, gn->path == NULL ? gn->name : gn->path, gn);
1122 #endif /* LIBRARIES */
1126 *-----------------------------------------------------------------------
1128 * Decide if a node with the OP_LIB attribute is out-of-date. Called
1129 * from Make_OODate to make its life easier.
1131 * There are several ways for a library to be out-of-date that are
1132 * not available to ordinary files. In addition, there are ways
1133 * that are open to regular files that are not available to
1134 * libraries. A library that is only used as a source is never
1135 * considered out-of-date by itself. This does not preclude the
1136 * library's modification time from making its parent be out-of-date.
1137 * A library will be considered out-of-date for any of these reasons,
1138 * given that it is a target on a dependency line somewhere:
1139 * Its modification time is less than that of one of its
1140 * sources (gn->mtime < gn->cmtime).
1141 * Its modification time is greater than the time at which the
1142 * make began (i.e. it's been modified in the course
1143 * of the make, probably by archiving).
1144 * The modification time of one of its sources is greater than
1145 * the one of its RANLIBMAG member (i.e. its table of contents
1146 * is out-of-date). We don't compare of the archive time
1147 * vs. TOC time because they can be too close. In my
1148 * opinion we should not bother with the TOC at all since
1149 * this is used by 'ar' rules that affect the data contents
1150 * of the archive, not by ranlib rules, which affect the
1154 * TRUE if the library is out-of-date. FALSE otherwise.
1157 * The library will be hashed if it hasn't been already.
1159 *-----------------------------------------------------------------------
1163 GNode *gn; /* The library's graph node */
1167 if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) {
1169 } else if ((gn->mtime > now) || (gn->mtime < gn->cmtime)) {
1173 struct ar_hdr *arhPtr; /* Header for __.SYMDEF */
1174 int modTimeTOC; /* The table-of-contents's mod time */
1176 arhPtr = ArchStatMember (gn->path, RANLIBMAG, FALSE);
1178 if (arhPtr != NULL) {
1179 modTimeTOC = (int) strtol(arhPtr->ar_date, NULL, 10);
1181 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1182 printf("%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC));
1184 oodate = (gn->cmtime > modTimeTOC);
1187 * A library w/o a table of contents is out-of-date
1189 if (DEBUG(ARCH) || DEBUG(MAKE)) {
1190 printf("No t.o.c....");
1195 oodate = (gn->mtime == 0); /* out-of-date if not present */
1202 *-----------------------------------------------------------------------
1204 * Initialize things for this module.
1210 * The 'archives' list is initialized.
1212 *-----------------------------------------------------------------------
1217 archives = Lst_Init (FALSE);
1223 *-----------------------------------------------------------------------
1225 * Cleanup things for this module.
1231 * The 'archives' list is freed
1233 *-----------------------------------------------------------------------
1238 Lst_Destroy(archives, ArchFree);