/usr/src/usr.bin/make/arch.c

Bug Summary

File:	src/usr.bin/make/arch.c
Warning:	line 666, column 12 The right operand of '>=' is a garbage value
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -cc1 -triple amd64-unknown-openbsd7.4 -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name arch.c -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 1 -pic-is-pie -mframe-pointer=all -relaxed-aliasing -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -target-feature +retpoline-indirect-calls -target-feature +retpoline-indirect-branches -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/usr.bin/make/obj -resource-dir /usr/local/llvm16/lib/clang/16 -I /usr/src/usr.bin/make/obj -I /usr/src/usr.bin/make -D MAKE_BSIZE=256 -D DEFMAXJOBS=4 -I /usr/src/usr.bin/make/lst.lib -internal-isystem /usr/local/llvm16/lib/clang/16/include -internal-externc-isystem /usr/include -O2 -fdebug-compilation-dir=/usr/src/usr.bin/make/obj -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fcf-protection=branch -fno-jump-tables -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/scan/2024-01-11-140451-98009-1 -x c /usr/src/usr.bin/make/arch.c
1/*	$OpenBSD: arch.c,v 1.94 2023/09/04 11:35:11 espie Exp $ */
2/*	$NetBSD: arch.c,v 1.17 1996/11/06 17:58:59 christos Exp $	*/

4/*
* Copyright (c) 1999,2000 Marc Espie.
*
* Extensive code changes for the OpenBSD project.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
*    notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
*    notice, this list of conditions and the following disclaimer in the
*    documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OPENBSD
* PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
30/*
* Copyright (c) 1988, 1989, 1990, 1993
*	The Regents of the University of California.  All rights reserved.
* Copyright (c) 1989 by Berkeley Softworks
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Adam de Boor.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
*    notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
*    notice, this list of conditions and the following disclaimer in the
*    documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
*    may be used to endorse or promote products derived from this software
*    without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/

64/*
*	Once again, cacheing/hashing comes into play in the manipulation
* of archives. The first time an archive is referenced, all of its members'
* headers are read and hashed and the archive closed again. All hashed
* archives are kept in a hash (archives) which is searched each time
* an archive member is referenced.
*
*/

73#include <ar.h>
74#include <assert.h>
75#include <ctype.h>
76#include <fcntl.h>
77#include <limits.h>
78#include <stddef.h>
79#include <stdint.h>
80#include <stdio.h>
81#include <stdlib.h>
82#include <string.h>
83#include <unistd.h>
84#include <ohash.h>
85#include "defines.h"
86#include "buf.h"
87#include "dir.h"
88#include "direxpand.h"
89#include "arch.h"
90#include "var.h"
91#include "targ.h"
92#include "memory.h"
93#include "gnode.h"
94#include "timestamp.h"
95#include "lst.h"

97#ifdef TARGET_MACHINE
98#undef MACHINE
99#define MACHINE TARGET_MACHINE
100#endif
101#ifdef TARGET_MACHINE_ARCH
102#undef MACHINE_ARCH
103#define MACHINE_ARCH TARGET_MACHINE_ARCH
104#endif
105#ifdef TARGET_MACHINE_CPU
106#undef MACHINE_CPU
107#define MACHINE_CPU TARGET_MACHINE_CPU
108#endif

110static struct ohash archives;	/* Archives we've already examined.  */

112typedef struct Arch_ {
struct ohash members;	/* All the members of this archive, as
		 * struct arch_member entries.  */
char name[1];		/* Archive name. */
116} Arch;

118#define AR_NAME_SIZE(sizeof(((struct ar_hdr *)0)->ar_name))		(sizeof(((struct ar_hdr *)0)->ar_name))
119#define AR_DATE_SIZE(sizeof(((struct ar_hdr *)0)->ar_date))		(sizeof(((struct ar_hdr *)0)->ar_date))

121/* Each archive member is tied to an arch_member structure,
* suitable for hashing.  */
123struct arch_member {
struct timespec mtime;		/* Member modification date.  */
char date[AR_DATE_SIZE(sizeof(((struct ar_hdr *)0)->ar_date))+1];	/* Same, before conversion to numeric
			 * value.  */
char name[1];			/* Member name.  */
128};

130static struct ohash_info members_info = {
offsetof(struct arch_member, name)__builtin_offsetof(struct arch_member, name), NULL((void *)0),
hash_calloc, hash_free, element_alloc
133};

135static struct ohash_info arch_info = {
offsetof(Arch, name)__builtin_offsetof(Arch, name), NULL((void *)0), hash_calloc, hash_free, element_alloc
137};



141static struct arch_member *new_arch_member(struct ar_hdr *, const char *);
142static struct timespec mtime_of_member(struct arch_member *);
143static long field2long(const char *, size_t);
144static Arch *read_archive(const char *, const char *);

146static struct timespec ArchMTimeMember(const char *, const char *, bool_Bool);
147static FILE *ArchFindMember(const char *, const char *, struct ar_hdr *, const char *);
148static void ArchTouch(const char *, const char *);
149#if defined(__svr4__) || defined(__SVR4) || \
  (defined(__OpenBSD__1) && defined(__ELF__1))
151#define SVR4ARCHIVES
152#endif
153static bool_Bool parse_archive(Buffer, const char **, Lst, SymTable *);
154static void add_archive_node(Lst, const char *);

156struct SVR4namelist {
char *fnametab;		/* Extended name table strings */
size_t fnamesize;	/* Size of the string table */
159};

161#ifdef SVR4ARCHIVES
162static const char *svr4list = "Archive list";

164static char *ArchSVR4Entry(struct SVR4namelist *, const char *, size_t, FILE *);
165#endif

167static struct arch_member *
168new_arch_member(struct ar_hdr *hdr, const char *name)
169{
const char *end = NULL((void *)0);
struct arch_member *n;

n = ohash_create_entry(&members_info, name, &end);
/* XXX ar entries are NOT null terminated.	*/
memcpy(n->date, &(hdr->ar_date), AR_DATE_SIZE(sizeof(((struct ar_hdr *)0)->ar_date)));
n->date[AR_DATE_SIZE(sizeof(((struct ar_hdr *)0)->ar_date))] = '\0';
/* Don't compute mtime before it is needed. */
ts_set_out_of_date(n->mtime)(n->mtime).tv_sec = (sizeof(time_t) == sizeof(int32_t) ? (
-0x7fffffff - 1) : (-0x7fffffffffffffffLL - 1)), (n->mtime
).tv_nsec = 0;
return n;
180}

182static struct timespec
183mtime_of_member(struct arch_member *m)
184{
if (is_out_of_date(m->mtime)((m->mtime).tv_sec == (sizeof(time_t) == sizeof(int32_t) ?
 (-0x7fffffff - 1) : (-0x7fffffffffffffffLL - 1)) && (
m->mtime).tv_nsec == 0))
ts_set_from_time_t((time_t) strtoll(m->date, NULL, 10),do { (m->mtime).tv_sec = (time_t) strtoll(m->date, ((void
 *)0), 10); (m->mtime).tv_nsec = 0; if (((m->mtime).tv_sec
 == (sizeof(time_t) == sizeof(int32_t) ? (-0x7fffffff - 1) : (
-0x7fffffffffffffffLL - 1)) && (m->mtime).tv_nsec ==
 0)) (m->mtime).tv_nsec++; } while (0)
    m->mtime)do { (m->mtime).tv_sec = (time_t) strtoll(m->date, ((void
 *)0), 10); (m->mtime).tv_nsec = 0; if (((m->mtime).tv_sec
 == (sizeof(time_t) == sizeof(int32_t) ? (-0x7fffffff - 1) : (
-0x7fffffffffffffffLL - 1)) && (m->mtime).tv_nsec ==
 0)) (m->mtime).tv_nsec++; } while (0);
return m->mtime;
189}

191bool_Bool
192Arch_ParseArchive(const char **line, Lst nodes, SymTable *ctxt)
193{
bool_Bool result;
static BUFFER expand;

Buf_Reinit(&expand, MAKE_BSIZE256);
result = parse_archive(&expand, line, nodes, ctxt);
return result;
200}

202static void
203add_archive_node(Lst nodes, const char *name)
204{
GNode *gn;

gn = Targ_FindNode(name, TARG_CREATE)Targ_FindNodei(name, ((void *)0), 0x01);
gn->type |= OP_ARCHV0x00200000;
Lst_AtEnd(nodes, gn);
210}

212static bool_Bool
213parse_archive(Buffer expand, const char **linePtr, Lst nodeLst, SymTable *ctxt)
214{
const char *cp;    	/* Pointer into line */
const char *lib;	/* Library-part of specification */
const char *elib;
const char *member;    	/* Member-part of specification */
const char *emember;
bool_Bool subst_lib;

/* figure out the library name part */
lib = *linePtr;
subst_lib = false0;

for (cp = lib; *cp != '(' && *cp != '\0';) {
if (*cp == '$') {
	if (!Var_ParseSkip(&cp, ctxt))
		return false0;
	subst_lib = true1;
} else
	cp++;
}

elib = cp;
if (subst_lib) {
lib = Var_Substi(lib, elib, ctxt, true1);
elib = lib + strlen(lib);
}

if (*cp == '\0') {
printf("Unclosed parenthesis in archive specification\n");
return false0;
}
cp++;
/* iterate on members, that may be separated by spaces */
for (;;) {
/* First skip to the start of the member's name, mark that
 * place and skip to the end of it (either white-space or
 * a close paren).  */
bool_Bool subst_member = false0;

while (ISSPACE(*cp)(isspace((unsigned char)(*cp))))
	cp++;
member = cp;
while (*cp != '\0' && *cp != ')' && !ISSPACE(*cp)(isspace((unsigned char)(*cp)))) {
	if (*cp == '$') {
		if (!Var_ParseSkip(&cp, ctxt))
			return false0;
		subst_member = true1;
	} else
		cp++;
}

/* If the specification ends without a closing parenthesis,
 * chances are there's something wrong (like a missing
 * backslash), so it's better to return failure than allow such
 * things to happen.  */
if (*cp == '\0' || ISSPACE(*cp)(isspace((unsigned char)(*cp)))) {
	printf("No closing parenthesis in archive specification\n");
	return false0;
}

/* If we didn't move anywhere, we must be done.  */
if (cp == member)
	break;

emember = cp;

/* XXX: This should be taken care of intelligently by
 * SuffExpandChildren, both for the archive and the member
 * portions.  */

/* If member contains variables, try and substitute for them.
 * This will slow down archive specs with dynamic sources, of
 * course, since we'll be (non-)substituting them three times,
 * but them's the breaks -- we need to do this since
 * SuffExpandChildren calls us, otherwise we could assume the
 * thing would be taken care of later.  */
if (subst_member) {
	const char *oldMemberName = member;
	const char *result;

	member = Var_Substi(member, emember, ctxt, true1);

	/* Now form an archive spec and recurse to deal with
	 * nested variables and multi-word variable values....
	 * The results are just placed at the end of the
	 * nodeLst we're returning.  */
	Buf_Addi(expand, lib, elib)Buf_AddChars((expand), (elib) - (lib), (lib));
	Buf_AddChar(expand, '(')do { if ((expand)->endPtr - (expand)->inPtr <= 1) BufExpand
(expand, 1); *(expand)->inPtr++ = ('('); } while (0);
	Buf_AddString(expand, member)Buf_AddChars((expand), strlen(member), (member));
	Buf_AddChar(expand, ')')do { if ((expand)->endPtr - (expand)->inPtr <= 1) BufExpand
(expand, 1); *(expand)->inPtr++ = (')'); } while (0);
	result = Buf_Retrieve(expand)(*(expand)->inPtr = '\0', (expand)->buffer);

	if (strchr(member, '$') &&
	    memcmp(member, oldMemberName,
		emember - oldMemberName) == 0) {
		/* Must contain dynamic sources, so we can't
		 * deal with it now.  let SuffExpandChildren
		 * handle it later  */
		add_archive_node(nodeLst, result);
	} else if (!Arch_ParseArchive(&result, nodeLst, ctxt))
		return false0;
	Buf_Reset(expand)((void)((expand)->inPtr = (expand)->buffer + (0)));
} else if (Dir_HasWildcardsi(member, emember)) {
	LIST  members;
	char  *m;

	Lst_Init(&members)(&members)->firstPtr = (&members)->lastPtr = ((
void *)0);

	Dir_Expandi(member, emember, defaultPath, &members);
	while ((m = Lst_DeQueue(&members)) != NULL((void *)0)) {
		Buf_Addi(expand, lib, elib)Buf_AddChars((expand), (elib) - (lib), (lib));
		Buf_AddChar(expand, '(')do { if ((expand)->endPtr - (expand)->inPtr <= 1) BufExpand
(expand, 1); *(expand)->inPtr++ = ('('); } while (0);
		Buf_AddString(expand, m)Buf_AddChars((expand), strlen(m), (m));
		Buf_AddChar(expand, ')')do { if ((expand)->endPtr - (expand)->inPtr <= 1) BufExpand
(expand, 1); *(expand)->inPtr++ = (')'); } while (0);
		free(m);
		add_archive_node(nodeLst, Buf_Retrieve(expand)(*(expand)->inPtr = '\0', (expand)->buffer));
		Buf_Reset(expand)((void)((expand)->inPtr = (expand)->buffer + (0)));
	}
} else {
	Buf_Addi(expand, lib, elib)Buf_AddChars((expand), (elib) - (lib), (lib));
	Buf_AddChar(expand, '(')do { if ((expand)->endPtr - (expand)->inPtr <= 1) BufExpand
(expand, 1); *(expand)->inPtr++ = ('('); } while (0);
	Buf_Addi(expand, member, emember)Buf_AddChars((expand), (emember) - (member), (member));
	Buf_AddChar(expand, ')')do { if ((expand)->endPtr - (expand)->inPtr <= 1) BufExpand
(expand, 1); *(expand)->inPtr++ = (')'); } while (0);
	add_archive_node(nodeLst, Buf_Retrieve(expand)(*(expand)->inPtr = '\0', (expand)->buffer));
	Buf_Reset(expand)((void)((expand)->inPtr = (expand)->buffer + (0)));
}
if (subst_member)
	free((char *)member);

}

if (subst_lib)
free((char *)lib);

/* We promised the pointer would be set up at the next non-space, so
* we must advance cp there before setting *linePtr... (note that on
* entrance to the loop, cp is guaranteed to point at a ')') */
do {
cp++;
} while (ISSPACE(*cp)(isspace((unsigned char)(*cp))));

*linePtr = cp;
return true1;
357}

359/* Helper function: ar fields are not null terminated.	*/
360static long
361field2long(const char *field, size_t length)
362{
static char enough[32];

assert(length < sizeof(enough))((length < sizeof(enough)) ? (void)0 : __assert2("/usr/src/usr.bin/make/arch.c"
, 365, __func__, "length < sizeof(enough)"));
memcpy(enough, field, length);
enough[length] = '\0';
return strtol(enough, NULL((void *)0), 10);
369}

371static Arch *
372read_archive(const char *archive, const char *earchive)
373{
FILE *arch;       /* Stream to archive */
char magic[SARMAG8];
Arch *ar;
struct SVR4namelist list;

list.fnametab = NULL((void *)0);

/* When we encounter an archive for the first time, we read its
* whole contents, to place it in the cache.  */
arch = fopen(archive, "r");
if (arch == NULL((void *)0))
20
←
Assuming 'arch' is not equal to NULL→
return NULL((void *)0);

/* Make sure this is an archive we can handle.  */
if ((fread(magic, SARMAG8, 1, arch) != 1) ||
21
←
Assuming the condition is false→
23
←
Taking false branch→
   (strncmp(magic, ARMAG"!<arch>\n", SARMAG8) != 0)) {
22
←
Assuming the condition is false→
fclose(arch);
return NULL((void *)0);
}

ar = ohash_create_entry(&arch_info, archive, &earchive);
ohash_init(&ar->members, 8, &members_info);

for (;;) {
24
←
Loop condition is true.  Entering loop body→
size_t n;
struct ar_hdr arHeader;	/* Archive-member header */
off_t size;		/* Size of archive member */
char buffer[PATH_MAX1024];
char *memberName; 	/* Current member name while hashing. */
char *cp;

memberName = buffer;
n = fread(&arHeader, 1, sizeof(struct ar_hdr), arch);

/*  Whole archive read ok.  */
if (n == 0 && feof(arch)(!__isthreaded ? (((arch)->_flags & 0x0020) != 0) : (feof
)(arch))) {
25
←
Assuming 'n' is not equal to 0→
	free(list.fnametab);
	fclose(arch);
	return ar;
}
if (n < sizeof(struct ar_hdr))
26
←
Assuming the condition is false→
27
←
Taking false branch→
	break;

if (memcmp(arHeader.ar_fmag, ARFMAG"`\n", sizeof(arHeader.ar_fmag))
28
←
Assuming the condition is false→
29
←
Taking false branch→
    != 0) {
	/* header is bogus.  */
	break;
} else {
	/* We need to advance the stream's pointer to the start
	 * of the next header.  Records are padded with
	 * newlines to an even-byte boundary, so we need to
	 * extract the size of the record and round it up
	 * during the seek.  */
	size = (off_t) field2long(arHeader.ar_size,
	    sizeof(arHeader.ar_size));

	(void)memcpy(memberName, arHeader.ar_name,
	    AR_NAME_SIZE(sizeof(((struct ar_hdr *)0)->ar_name)));
	/* Find real end of name (strip extraneous ' ')  */
	for (cp = memberName + AR_NAME_SIZE(sizeof(((struct ar_hdr *)0)->ar_name)) - 1; *cp == ' ';)
30
←
Assuming the condition is false→
31
←
Loop condition is false. Execution continues on line 435→
		cp--;
	cp[1] = '\0';

437#ifdef SVR4ARCHIVES
	/* SVR4 names are slash terminated.  Also svr4 extended
	 * AR format.
	 */
	if (memberName[0] == '/') {
32
←
Assuming the condition is true→
33
←
Taking true branch→
		/* SVR4 magic mode.  */
		memberName = ArchSVR4Entry(&list, memberName,
34
←
Calling 'ArchSVR4Entry'→
		    size, arch);
		if (memberName == NULL((void *)0))
			/* Invalid data */
			break;
		else if (memberName == svr4list)
			/* List of files entry */
			continue;
		/* Got the entry.  */
		/* XXX this assumes further processing, such as
		 * AR_EFMT1, also applies to SVR4ARCHIVES.  */
	}
	else {
		if (cp[0] == '/')
			cp[0] = '\0';
	}
459#endif

461#ifdef AR_EFMT1"#1/"
	/* BSD 4.4 extended AR format: #1/<namelen>, with name
	 * as the first <namelen> bytes of the file.  */
	if (memcmp(memberName, AR_EFMT1"#1/", sizeof(AR_EFMT1"#1/") - 1)
	    == 0 && ISDIGIT(memberName[sizeof(AR_EFMT1) - 1])(isdigit((unsigned char)(memberName[sizeof("#1/") - 1])))) {

		int elen = atoi(memberName +
		    sizeof(AR_EFMT1"#1/")-1);

		if (elen <= 0 || elen >= PATH_MAX1024)
			break;
		memberName = buffer;
		if (fread(memberName, elen, 1, arch) != 1)
			break;
		memberName[elen] = '\0';
		if (fseek(arch, -elen, SEEK_CUR1) != 0)
			break;
		if (DEBUG(ARCH)(debug & 0x0001) || DEBUG(MAKE)(debug & 0x0040))
			printf("ArchStat: Extended format entry for %s\n",
			    memberName);
	}
482#endif

	ohash_insert(&ar->members,
	    ohash_qlookup(&ar->members, memberName),
		new_arch_member(&arHeader, memberName));
}
if (fseek(arch, (size + 1) & ~1, SEEK_CUR1) != 0)
	break;
}

fclose(arch);
ohash_delete(&ar->members);
free(list.fnametab);
free(ar);
return NULL((void *)0);
497}

499/*-
*-----------------------------------------------------------------------
* ArchMTimeMember --
*	Find the modification time of an archive's member, given the
*	path to the archive and the path to the desired member.
*
* Results:
*	The archive member's modification time, or OUT_OF_DATE if member
*	was not found (convenient, so that missing members are always
*	out of date).
*
* Side Effects:
*	Cache the whole archive contents if hash is true.
*-----------------------------------------------------------------------
*/
514static struct timespec
515ArchMTimeMember(
  const char *archive,	/* Path to the archive */
  const char *member, 	/* Name of member. If it is a path, only the
		 * last component is used. */
  bool_Bool hash)       		/* true if archive should be hashed if not
		 * already so. */
521{
FILE *arch;     	/* Stream to archive */
Arch *ar;		/* Archive descriptor */
unsigned int slot;	/* Place of archive in the archives hash */
const char *end = NULL((void *)0);
const char *cp;
struct timespec result;

ts_set_out_of_date(result)(result).tv_sec = (sizeof(time_t) == sizeof(int32_t) ? (-0x7fffffff
 - 1) : (-0x7fffffffffffffffLL - 1)), (result).tv_nsec = 0;
13
←
'?' condition is false→
/* Because of space constraints and similar things, files are archived
* using their final path components, not the entire thing, so we need
* to point 'member' to the final component, if there is one, to make
* the comparisons easier...  */
cp = strrchr(member, '/');
if (cp != NULL((void *)0))
14
←
Assuming 'cp' is equal to NULL→
15
←
Taking false branch→
member = cp + 1;

/* Try to find archive in cache.  */
slot = ohash_qlookupi(&archives, archive, &end);
ar = ohash_find(&archives, slot);

/* If not found, get it now.  */
if (ar == NULL((void *)0)) {
16
←
Assuming 'ar' is equal to NULL→
17
←
Taking true branch→
if (!hash17.1
'hash' is true
) {
18
←
Taking false branch→
	/* Quick path:  no need to hash the whole archive, just
	 * use ArchFindMember to get the member's header and
	 * close the stream again.  */
	struct ar_hdr arHeader;

	arch = ArchFindMember(archive, member, &arHeader, "r");

	if (arch != NULL((void *)0)) {
		fclose(arch);
		ts_set_from_time_t(do { (result).tv_sec = (time_t)strtol(arHeader.ar_date, ((void
 *)0), 10); (result).tv_nsec = 0; if (((result).tv_sec == (sizeof
(time_t) == sizeof(int32_t) ? (-0x7fffffff - 1) : (-0x7fffffffffffffffLL
 - 1)) && (result).tv_nsec == 0)) (result).tv_nsec++;
 } while (0)
		    (time_t)strtol(arHeader.ar_date, NULL, 10),do { (result).tv_sec = (time_t)strtol(arHeader.ar_date, ((void
 *)0), 10); (result).tv_nsec = 0; if (((result).tv_sec == (sizeof
(time_t) == sizeof(int32_t) ? (-0x7fffffff - 1) : (-0x7fffffffffffffffLL
 - 1)) && (result).tv_nsec == 0)) (result).tv_nsec++;
 } while (0)
		    result)do { (result).tv_sec = (time_t)strtol(arHeader.ar_date, ((void
 *)0), 10); (result).tv_nsec = 0; if (((result).tv_sec == (sizeof
(time_t) == sizeof(int32_t) ? (-0x7fffffff - 1) : (-0x7fffffffffffffffLL
 - 1)) && (result).tv_nsec == 0)) (result).tv_nsec++;
 } while (0);
	}
	return result;
}
ar = read_archive(archive, end);
19
←
Calling 'read_archive'→
if (ar != NULL((void *)0))
	ohash_insert(&archives, slot, ar);
}

/* If archive was found, get entry we seek.  */
if (ar != NULL((void *)0)) {
struct arch_member *he;
end = NULL((void *)0);

he = ohash_find(&ar->members, ohash_qlookupi(&ar->members,
    member, &end));
if (he != NULL((void *)0))
	return mtime_of_member(he);
else {
	if ((size_t)(end - member) > AR_NAME_SIZE(sizeof(((struct ar_hdr *)0)->ar_name))) {
		/* Try truncated name.	*/
		end = member + AR_NAME_SIZE(sizeof(((struct ar_hdr *)0)->ar_name));
		he = ohash_find(&ar->members,
		    ohash_qlookupi(&ar->members, member, &end));
		if (he != NULL((void *)0))
			return mtime_of_member(he);
	}
}
}
return result;
586}

588#ifdef SVR4ARCHIVES
589/*-
*-----------------------------------------------------------------------
* ArchSVR4Entry --
*	Parse an SVR4 style entry that begins with a slash.
*	If it is "//", then load the table of filenames
*	If it is "/<offset>", then try to substitute the long file name
*	from offset of a table previously read.
*
* Results:
*	svr4list: just read a list of names
*	NULL:	  error occurred
*	extended name
*
* Side-effect:
*	For a list of names, store the list in l.
*-----------------------------------------------------------------------
*/

607static char *
608ArchSVR4Entry(struct SVR4namelist *l, const char *name, size_t size, FILE *arch)
609{
610#define ARLONGNAMES1"/" "/"
611#define ARLONGNAMES2"ARFILENAMES" "ARFILENAMES"
size_t entry;
char *ptr, *eptr;

assert(name[0] == '/')((name[0] == '/') ? (void)0 : __assert2("/usr/src/usr.bin/make/arch.c"
, 615, __func__, "name[0] == '/'"));
35
←
'?' condition is true→
name++;
/* First comes a table of archive names, to be used by subsequent
* calls.  */
if (memcmp(name, ARLONGNAMES1"/", sizeof(ARLONGNAMES1"/") - 1) == 0 ||
36
←
Assuming the condition is false→
   memcmp(name, ARLONGNAMES2"ARFILENAMES", sizeof(ARLONGNAMES2"ARFILENAMES") - 1) == 0) {
37
←
Assuming the condition is false→

if (l->fnametab != NULL((void *)0)) {
	if (DEBUG(ARCH)(debug & 0x0001))
		printf("Attempted to redefine an SVR4 name table\n");
	return NULL((void *)0);
}

l->fnametab = emalloc(size);
l->fnamesize = size;

if (fread(l->fnametab, size, 1, arch) != 1) {
	if (DEBUG(ARCH)(debug & 0x0001))
		printf("Reading an SVR4 name table failed\n");
	return NULL((void *)0);
}

eptr = l->fnametab + size;
for (entry = 0, ptr = l->fnametab; ptr < eptr; ptr++)
	switch (*ptr) {
	case '/':
		entry++;
		*ptr = '\0';
		break;

	case '\n':
		break;

	default:
		break;
	}
if (DEBUG(ARCH)(debug & 0x0001))
	printf("Found svr4 archive name table with %zu entries\n",
	    entry);
return (char *)svr4list;
}
/* Then the names themselves are given as offsets in this table.  */
if (*name == ' ' || *name == '\0')
38
←
Assuming the condition is false→
39
←
Assuming the condition is false→
40
←
Taking false branch→
return NULL((void *)0);

entry = (size_t) strtol(name, &eptr, 0);
if ((*eptr != ' ' && *eptr != '\0') || eptr41.1
'eptr' is not equal to 'name'
 == name) {
41
←
Assuming the condition is false→
42
←
Taking false branch→
if (DEBUG(ARCH)(debug & 0x0001))
	printf("Could not parse SVR4 name /%s\n", name);
return NULL((void *)0);
}
if (entry >= l->fnamesize) {
43
←
The right operand of '>=' is a garbage value
if (DEBUG(ARCH)(debug & 0x0001))
	printf("SVR4 entry offset /%s is greater than %zu\n",
	    name, l->fnamesize);
return NULL((void *)0);
}

if (DEBUG(ARCH)(debug & 0x0001))
printf("Replaced /%s with %s\n", name, l->fnametab + entry);

return l->fnametab + entry;
677}
678#endif


681/*-
*-----------------------------------------------------------------------
* ArchFindMember --
*	Locate a member of an archive, given the path of the archive and
*	the path of the desired member. If the archive is to be modified,
*	the mode should be "r+", if not, it should be "r".
*
* Results:
*	A FILE *, opened for reading and writing, positioned right after
*	the member's header, or NULL if the member was nonexistent.
*
* Side Effects:
*	Fill the struct ar_hdr pointed by arHeaderPtr.
*-----------------------------------------------------------------------
*/
696static FILE *
697ArchFindMember(
  const char	  *archive,   /* Path to the archive */
  const char	  *member,    /* Name of member. If it is a path, only the
	       * last component is used. */
  struct ar_hdr *arHeaderPtr,/* Pointer to header structure to be filled in */
  const char	  *mode)      /* mode for opening the stream */
703{
FILE *	  arch;       /* Stream to archive */
char	  *cp;
char	  magic[SARMAG8];
size_t	  length;
struct SVR4namelist list;

list.fnametab = NULL((void *)0);

arch = fopen(archive, mode);
if (arch == NULL((void *)0))
return NULL((void *)0);

/* Make sure this is an archive we can handle.  */
if (fread(magic, SARMAG8, 1, arch) != 1 ||
   strncmp(magic, ARMAG"!<arch>\n", SARMAG8) != 0) {
fclose(arch);
return NULL((void *)0);
}

/* Because of space constraints and similar things, files are archived
* using their final path components, not the entire thing, so we need
* to point 'member' to the final component, if there is one, to make
* the comparisons easier...  */
cp = strrchr(member, '/');
if (cp != NULL((void *)0))
member = cp + 1;

length = strlen(member);
if (length >= AR_NAME_SIZE(sizeof(((struct ar_hdr *)0)->ar_name)))
length = AR_NAME_SIZE(sizeof(((struct ar_hdr *)0)->ar_name));

/* Error handling is simpler than for read_archive, since we just
* look for a given member.  */
while (fread(arHeaderPtr, sizeof(struct ar_hdr), 1, arch) == 1) {
off_t size;       /* Size of archive member */
char *memberName;

if (memcmp(arHeaderPtr->ar_fmag, ARFMAG"`\n",
    sizeof(arHeaderPtr->ar_fmag) ) != 0)
	 /* The header is bogus, so the archive is bad.  */
	 break;

memberName = arHeaderPtr->ar_name;
if (memcmp(member, memberName, length) == 0) {
	/* If the member's name doesn't take up the entire
	 * 'name' field, we have to be careful of matching
	 * prefixes. Names are space- padded to the right, so
	 * if the character in 'name' at the end of the matched
	 * string is anything but a space, this isn't the
	 * member we sought.  */
754#ifdef SVR4ARCHIVES
	if (length < sizeof(arHeaderPtr->ar_name) &&
	    memberName[length] == '/')
		length++;
758#endif
	if (length == sizeof(arHeaderPtr->ar_name) ||
	    memberName[length] == ' ') {
		free(list.fnametab);
		return arch;
	}
}

size = (off_t) field2long(arHeaderPtr->ar_size,
    sizeof(arHeaderPtr->ar_size));

769#ifdef SVR4ARCHIVES
/* svr4 names are slash terminated. Also svr4 extended AR
 * format.
 */
if (memberName[0] == '/') {
	/* svr4 magic mode.  */
	memberName = ArchSVR4Entry(&list, arHeaderPtr->ar_name,
	    size, arch);
	if (memberName == NULL((void *)0))
		/* Invalid data */
		break;
	else if (memberName == svr4list)
		/* List of files entry */
		continue;
	/* Got the entry.  */
	if (strcmp(memberName, member) == 0) {
		free(list.fnametab);
		return arch;
	}
}
789#endif

791#ifdef AR_EFMT1"#1/"
/* BSD 4.4 extended AR format: #1/<namelen>, with name as the
 * first <namelen> bytes of the file.  */
if (memcmp(memberName, AR_EFMT1"#1/", sizeof(AR_EFMT1"#1/") - 1) == 0 &&
    ISDIGIT(memberName[sizeof(AR_EFMT1) - 1])(isdigit((unsigned char)(memberName[sizeof("#1/") - 1])))) {
	char ename[PATH_MAX1024];

	int elength = atoi(memberName + sizeof(AR_EFMT1"#1/")-1);

	if (elength <= 0 || elength >= PATH_MAX1024)
		break;
	if (fread(ename, elength, 1, arch) != 1)
		break;
	if (fseek(arch, -elength, SEEK_CUR1) != 0)
		break;
	ename[elength] = '\0';
	if (DEBUG(ARCH)(debug & 0x0001) || DEBUG(MAKE)(debug & 0x0040))
		printf("ArchFind: Extended format entry for %s\n", ename);
	/* Found as extended name.	*/
	if (strcmp(ename, member) == 0) {
		free(list.fnametab);
		return arch;
	}
}
815#endif
/* This isn't the member we're after, so we need to advance the
 * stream's pointer to the start of the next header.  */
if (fseek(arch, (size + 1) & ~1, SEEK_CUR1) != 0)
	break;
}

/* We did not find the member, or we ran into an error while reading
* the archive.  */
824#ifdef SVRARCHIVES
free(list.fnametab);
826#endif
fclose(arch);
return NULL((void *)0);
829}

831static void
832ArchTouch(const char *archive, const char *member)
833{
FILE *arch;
struct ar_hdr arHeader;

arch = ArchFindMember(archive, member, &arHeader, "r+");
if (arch != NULL((void *)0)) {
snprintf(arHeader.ar_date, sizeof(arHeader.ar_date),
    "%-12ld", (long) time(NULL((void *)0)));
if (fseek(arch, -sizeof(struct ar_hdr), SEEK_CUR1) == 0)
	(void)fwrite(&arHeader, sizeof(struct ar_hdr), 1, arch);
fclose(arch);
}
845}

847/*
* Side Effects:
*	The modification time of the entire archive is also changed.
*	For a library, this could necessitate the re-ranlib'ing of the
*	whole thing.
*/
853void
854Arch_Touch(GNode *gn)
855{
ArchTouch(Var(ARCHIVE_INDEX, gn)((gn)->localvars.locals[2]), Var(MEMBER_INDEX, gn)((gn)->localvars.locals[3]));
857}

859struct timespec
860Arch_MTime(GNode *gn)
861{
gn->mtime = ArchMTimeMember(Var(ARCHIVE_INDEX, gn)((gn)->localvars.locals[2]),
12
←
Calling 'ArchMTimeMember'→
    Var(MEMBER_INDEX, gn)((gn)->localvars.locals[3]), true1);

return gn->mtime;
866}

868struct timespec
869Arch_MemMTime(GNode *gn)
870{
LstNode ln;

for (ln = Lst_First(&gn->parents)((&gn->parents)->firstPtr); ln != NULL((void *)0); ln = Lst_Adv(ln)((ln)->nextPtr)) {
1
Assuming 'ln' is not equal to NULL→
2
←
Loop condition is true.  Entering loop body→
GNode *pgn;
char *nameStart;
char *nameEnd;

pgn = Lst_Datum(ln)((ln)->datum);

if (pgn->type & OP_ARCHV0x00200000) {
3
←
Assuming the condition is true→
4
←
Taking true branch→
	/* If the parent is an archive specification and is
	 * being built and its member's name matches the name of
	 * the node we were given, record the modification time
	 * of the parent in the child. We keep searching its
	 * parents in case some other parent requires this
	 * child to exist...  */
	if ((nameStart = strchr(pgn->name, '(') ) != NULL((void *)0)) {
5
←
Assuming the condition is true→
6
←
Taking true branch→
		nameStart++;
		nameEnd = strchr(nameStart, ')');
	} else
		nameEnd = NULL((void *)0);

	if (pgn->must_make && nameEnd != NULL((void *)0) &&
7
←
Assuming field 'must_make' is true→
8
←
Assuming 'nameEnd' is not equal to NULL→
10
←
Taking true branch→
	    strncmp(nameStart, gn->name, nameEnd - nameStart)
	    == 0 && gn->name[nameEnd-nameStart] == '\0')
9
←
Assuming the condition is true→
		gn->mtime = Arch_MTime(pgn);
11
←
Calling 'Arch_MTime'→
} else if (pgn->must_make) {
	/* Something which isn't a library depends on the
	 * existence of this target, so it needs to exist.  */
	ts_set_out_of_date(gn->mtime)(gn->mtime).tv_sec = (sizeof(time_t) == sizeof(int32_t) ? (
-0x7fffffff - 1) : (-0x7fffffffffffffffLL - 1)), (gn->mtime
).tv_nsec = 0;
	break;
}
}
return gn->mtime;
905}

907void
908Arch_Init(void)
909{
ohash_init(&archives, 4, &arch_info);
911}