[apple/libc.git] / gen / nlist.c

/*
 * Copyright (c) 1999, 2008 Apple Inc. All rights reserved.
 *
 * @APPLE_LICENSE_HEADER_START@
 * 
 * This file contains Original Code and/or Modifications of Original Code
 * as defined in and that are subject to the Apple Public Source License
 * Version 2.0 (the 'License'). You may not use this file except in
 * compliance with the License. Please obtain a copy of the License at
 * http://www.opensource.apple.com/apsl/ and read it before using this
 * file.
 * 
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
 * Please see the License for the specific language governing rights and
 * limitations under the License.
 * 
 * @APPLE_LICENSE_HEADER_END@
 */
/*
 * Copyright (c) 1989, 1993
 * The Regents of the University of California.  All rights reserved.
 *
 * 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. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. 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.
 */

/* temporarily comment this file out for LP64, until code can be modified */
#ifndef __LP64__

#include <stdlib.h>
#include <sys/types.h>
#include <sys/file.h>
#include <fcntl.h>
#include <string.h>
#include <unistd.h>
#include <malloc_private.h>

/* Stuff lifted from <a.out.h> and <sys/exec.h> since they are gone */
/*
 * Header prepended to each a.out file.
 */
struct exec {
unsigned short  a_machtype;     /* machine type */
unsigned short  a_magic;        /* magic number */
unsigned long	a_text;		/* size of text segment */
unsigned long	a_data;		/* size of initialized data */
unsigned long	a_bss;		/* size of uninitialized data */
unsigned long	a_syms;		/* size of symbol table */
unsigned long	a_entry;	/* entry point */
unsigned long	a_trsize;	/* size of text relocation */
unsigned long	a_drsize;	/* size of data relocation */
};

#define	OMAGIC	0407		/* old impure format */
#define	NMAGIC	0410		/* read-only text */
#define	ZMAGIC	0413		/* demand load format */

#define	N_BADMAG(x) \
    (((x).a_magic)!=OMAGIC && ((x).a_magic)!=NMAGIC && ((x).a_magic)!=ZMAGIC)
#define	N_TXTOFF(x) \
	((x).a_magic==ZMAGIC ? 0 : sizeof (struct exec))
#define N_SYMOFF(x) \
	(N_TXTOFF(x) + (x).a_text+(x).a_data + (x).a_trsize+(x).a_drsize)

#include <mach/mach.h>
#include <mach-o/nlist.h>
#include <stdio.h>
#include <mach-o/loader.h>
#include <mach-o/fat.h>

/*
 * CPUSUBTYPE_SUPPORT should be changed to non-zero once the
 * cpusubtype_* routines are available in libc.
 */
#define	CPUSUBTYPE_SUPPORT	0

int __fdnlist(int fd, struct nlist *list);

/*
 * nlist - retreive attributes from name list (string table version)
 */

int
nlist(name, list)
	const char *name;
	struct nlist *list;
{
	int fd, n;

	fd = open(name, O_RDONLY, 0);
	if (fd < 0)
		return (-1);
	n = __fdnlist(fd, list);
	(void)close(fd);
	return (n);
}

/* Note: __fdnlist() is called from kvm_nlist in libkvm's kvm.c */

int
__fdnlist(fd, list)
	int fd;
	struct nlist *list;
{
	register struct nlist *p, *q;
	register char *s1, *s2;
	register int n, m;
	int maxlen, nreq;
	off_t sa;		/* symbol address */
	off_t ss;		/* start of strings */
	struct exec buf;
	struct nlist space[BUFSIZ/sizeof (struct nlist)];
	unsigned  arch_offset = 0;

	maxlen = 0;
	for (q = list, nreq = 0; q->n_un.n_name && q->n_un.n_name[0]; q++, nreq++) {
		q->n_type = 0;
		q->n_value = 0;
		q->n_desc = 0;
		q->n_sect = 0;
		n = strlen(q->n_un.n_name);
		if (n > maxlen)
			maxlen = n;
	}
	if (read(fd, (char *)&buf, sizeof(buf)) != sizeof(buf) ||
	    (N_BADMAG(buf) && *((uint32_t *)&buf) != MH_MAGIC &&
	     OSSwapBigToHostInt32(*((uint32_t *)&buf)) != FAT_MAGIC)) {
		return (-1);
	}

	/* Deal with fat file if necessary */
	if (OSSwapBigToHostInt32(*((uint32_t *)&buf)) == FAT_MAGIC) {
		struct host_basic_info hbi;
		struct fat_header fh;
		struct fat_arch *fat_archs, *fap;
		unsigned i;
		host_t host;

		/* Get our host info */
		host = mach_host_self();
		i = HOST_BASIC_INFO_COUNT;
		if (host_info(host, HOST_BASIC_INFO,
			      (host_info_t)(&hbi), &i) != KERN_SUCCESS) {
			return (-1);
		}
		mach_port_deallocate(mach_task_self(), host);
		  
		/* Read in the fat header */
		lseek(fd, 0, SEEK_SET);
		if (read(fd, (char *)&fh, sizeof(fh)) != sizeof(fh)) {
			return (-1);
		}

		/* Convert fat_narchs to host byte order */
		fh.nfat_arch = OSSwapBigToHostInt32(fh.nfat_arch);

		/* Read in the fat archs */
		fat_archs = (struct fat_arch *)reallocarray(NULL, fh.nfat_arch,
				sizeof(struct fat_arch));
		if (fat_archs == NULL) {
			return (-1);
		}
		if (read(fd, (char *)fat_archs,
			 sizeof(struct fat_arch) * fh.nfat_arch) !=
		    sizeof(struct fat_arch) * fh.nfat_arch) {
			free(fat_archs);
			return (-1);
		}

		/*
		 * Convert archs to host byte ordering (a constraint of
		 * cpusubtype_getbestarch()
		 */
		for (i = 0; i < fh.nfat_arch; i++) {
			fat_archs[i].cputype =
				OSSwapBigToHostInt32(fat_archs[i].cputype);
			fat_archs[i].cpusubtype =
			      OSSwapBigToHostInt32(fat_archs[i].cpusubtype);
			fat_archs[i].offset =
				OSSwapBigToHostInt32(fat_archs[i].offset);
			fat_archs[i].size =
				OSSwapBigToHostInt32(fat_archs[i].size);
			fat_archs[i].align =
				OSSwapBigToHostInt32(fat_archs[i].align);
		}

#if	CPUSUBTYPE_SUPPORT
		fap = cpusubtype_getbestarch(hbi.cpu_type, hbi.cpu_subtype,
					     fat_archs, fh.nfat_arch);
#else
		fap = NULL;
		for (i = 0; i < fh.nfat_arch; i++) {
			if (fat_archs[i].cputype == hbi.cpu_type) {
				fap = &fat_archs[i];
				break;
			}
		}
#endif	/* CPUSUBTYPE_SUPPORT */
		if (!fap) {
			free(fat_archs);
			return (-1);
		}
		arch_offset = fap->offset;
		free(fat_archs);

		/* Read in the beginning of the architecture-specific file */
		lseek(fd, arch_offset, SEEK_SET);
		if (read(fd, (char *)&buf, sizeof(buf)) != sizeof(buf)) {
			return (-1);
		}
	}
		
	if (*((uint32_t *)&buf) == MH_MAGIC) {
	    struct mach_header mh;
	    struct load_command *load_commands, *lcp;
	    struct symtab_command *stp;
	    long i;

		lseek(fd, arch_offset, SEEK_SET);
		if (read(fd, (char *)&mh, sizeof(mh)) != sizeof(mh)) {
			return (-1);
		}
		load_commands = (struct load_command *)malloc(mh.sizeofcmds);
		if (load_commands == NULL) {
			return (-1);
		}
		if (read(fd, (char *)load_commands, mh.sizeofcmds) !=
		    mh.sizeofcmds) {
			free(load_commands);
			return (-1);
		}
		stp = NULL;
		lcp = load_commands;
		for (i = 0; i < mh.ncmds; i++) {
			if (lcp->cmdsize % sizeof(uint32_t) != 0 ||
			    lcp->cmdsize <= 0 ||
			    (char *)lcp + lcp->cmdsize >
			    (char *)load_commands + mh.sizeofcmds) {
				free(load_commands);
				return (-1);
			}
			if (lcp->cmd == LC_SYMTAB) {
				if (lcp->cmdsize !=
				   sizeof(struct symtab_command)) {
					free(load_commands);
					return (-1);
				}
				stp = (struct symtab_command *)lcp;
				break;
			}
			lcp = (struct load_command *)
			      ((char *)lcp + lcp->cmdsize);
		}
		if (stp == NULL) {
			free(load_commands);
			return (-1);
		}
		sa = stp->symoff + arch_offset;
		ss = stp->stroff + arch_offset;
		n = stp->nsyms * sizeof(struct nlist);
		free(load_commands);
	}
	else {
		sa = N_SYMOFF(buf) + arch_offset;
		ss = sa + buf.a_syms + arch_offset;
		n = buf.a_syms;
	}

	lseek(fd, sa, SEEK_SET);
	while (n) {
		off_t savpos;

		m = sizeof (space);
		if (n < m)
			m = n;
		if (read(fd, (char *)space, m) != m)
			break;
		n -= m;
		savpos = lseek(fd, 0, SEEK_CUR);
		for (q = space; (m -= sizeof(struct nlist)) >= 0; q++) {
			char nambuf[BUFSIZ];

			if (q->n_un.n_strx == 0 || q->n_type & N_STAB)
				continue;
			lseek(fd, ss+q->n_un.n_strx, SEEK_SET);
			read(fd, nambuf, maxlen+1);
			for (p = list; p->n_un.n_name && p->n_un.n_name[0]; p++) {
				s1 = p->n_un.n_name;
				s2 = nambuf;
				while (*s1) {
					if (*s1++ != *s2++)
						goto cont;
				}
				if (*s2)
					goto cont;
				p->n_value = q->n_value;
				p->n_type = q->n_type;
				p->n_desc = q->n_desc;
				p->n_sect = q->n_sect;
				if (--nreq == 0)
					return (nreq);
				break;
		cont:		;
			}
		}
		lseek(fd, savpos, SEEK_SET);
	}
	return (nreq);
}

#endif /* !__LP64__ */
Commit	Line	Data
e9ce8d39	1	/*
34e8f829	2	* Copyright (c) 1999, 2008 Apple Inc. All rights reserved.
e9ce8d39 A	3	*
	4	* @APPLE_LICENSE_HEADER_START@
	5	*
734aad71 A	6	* This file contains Original Code and/or Modifications of Original Code
	7	* as defined in and that are subject to the Apple Public Source License
	8	* Version 2.0 (the 'License'). You may not use this file except in
	9	* compliance with the License. Please obtain a copy of the License at
	10	* http://www.opensource.apple.com/apsl/ and read it before using this
	11	* file.
	12	*
	13	* The Original Code and all software distributed under the License are
	14	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
e9ce8d39 A	15	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
e9ce8d39 A	16	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
734aad71 A	17	* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
	18	* Please see the License for the specific language governing rights and
	19	* limitations under the License.
e9ce8d39 A	20	*
	21	* @APPLE_LICENSE_HEADER_END@
	22	*/
	23	/*
224c7076 A	24	* Copyright (c) 1989, 1993
224c7076 A	25	* The Regents of the University of California. All rights reserved.
e9ce8d39 A	26	*
	27	* Redistribution and use in source and binary forms, with or without
	28	* modification, are permitted provided that the following conditions
	29	* are met:
	30	* 1. Redistributions of source code must retain the above copyright
	31	* notice, this list of conditions and the following disclaimer.
	32	* 2. Redistributions in binary form must reproduce the above copyright
	33	* notice, this list of conditions and the following disclaimer in the
	34	* documentation and/or other materials provided with the distribution.
	35	* 3. All advertising materials mentioning features or use of this software
	36	* must display the following acknowledgement:
	37	* This product includes software developed by the University of
	38	* California, Berkeley and its contributors.
	39	* 4. Neither the name of the University nor the names of its contributors
	40	* may be used to endorse or promote products derived from this software
	41	* without specific prior written permission.
	42	*
	43	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	44	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	45	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	46	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	47	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	48	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	49	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	50	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	51	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	52	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	53	* SUCH DAMAGE.
	54	*/
	55
3d9156a7 A	56	/* temporarily comment this file out for LP64, until code can be modified */
3d9156a7 A	57	#ifndef __LP64__
e9ce8d39 A	58
	59	#include <stdlib.h>
	60	#include <sys/types.h>
	61	#include <sys/file.h>
	62	#include <fcntl.h>
	63	#include <string.h>
	64	#include <unistd.h>
b061a43b	65	#include <malloc_private.h>
e9ce8d39 A	66
	67	/* Stuff lifted from <a.out.h> and <sys/exec.h> since they are gone */
	68	/*
	69	* Header prepended to each a.out file.
	70	*/
	71	struct exec {
	72	unsigned short a_machtype; /* machine type */
	73	unsigned short a_magic; /* magic number */
	74	unsigned long a_text; /* size of text segment */
	75	unsigned long a_data; /* size of initialized data */
	76	unsigned long a_bss; /* size of uninitialized data */
	77	unsigned long a_syms; /* size of symbol table */
	78	unsigned long a_entry; /* entry point */
	79	unsigned long a_trsize; /* size of text relocation */
	80	unsigned long a_drsize; /* size of data relocation */
	81	};
	82
	83	#define OMAGIC 0407 /* old impure format */
	84	#define NMAGIC 0410 /* read-only text */
	85	#define ZMAGIC 0413 /* demand load format */
	86
	87	#define N_BADMAG(x) \
	88	(((x).a_magic)!=OMAGIC && ((x).a_magic)!=NMAGIC && ((x).a_magic)!=ZMAGIC)
	89	#define N_TXTOFF(x) \
	90	((x).a_magic==ZMAGIC ? 0 : sizeof (struct exec))
	91	#define N_SYMOFF(x) \
	92	(N_TXTOFF(x) + (x).a_text+(x).a_data + (x).a_trsize+(x).a_drsize)
	93
	94	#include <mach/mach.h>
	95	#include <mach-o/nlist.h>
	96	#include <stdio.h>
	97	#include <mach-o/loader.h>
	98	#include <mach-o/fat.h>
	99
	100	/*
	101	* CPUSUBTYPE_SUPPORT should be changed to non-zero once the
	102	* cpusubtype_* routines are available in libc.
	103	*/
	104	#define CPUSUBTYPE_SUPPORT 0
	105
9385eb3d A	106	int __fdnlist(int fd, struct nlist *list);
9385eb3d A	107
e9ce8d39 A	108	/*
	109	* nlist - retreive attributes from name list (string table version)
	110	*/
	111
	112	int
	113	nlist(name, list)
	114	const char *name;
	115	struct nlist *list;
	116	{
	117	int fd, n;
	118
	119	fd = open(name, O_RDONLY, 0);
	120	if (fd < 0)
	121	return (-1);
	122	n = __fdnlist(fd, list);
	123	(void)close(fd);
	124	return (n);
	125	}
	126
	127	/* Note: __fdnlist() is called from kvm_nlist in libkvm's kvm.c */
	128
	129	int
	130	__fdnlist(fd, list)
	131	int fd;
	132	struct nlist *list;
	133	{
	134	register struct nlist p, q;
	135	register char s1, s2;
9385eb3d	136	register int n, m;
e9ce8d39 A	137	int maxlen, nreq;
	138	off_t sa; /* symbol address */
	139	off_t ss; /* start of strings */
	140	struct exec buf;
	141	struct nlist space[BUFSIZ/sizeof (struct nlist)];
	142	unsigned arch_offset = 0;
	143
	144	maxlen = 0;
	145	for (q = list, nreq = 0; q->n_un.n_name && q->n_un.n_name[0]; q++, nreq++) {
	146	q->n_type = 0;
	147	q->n_value = 0;
	148	q->n_desc = 0;
	149	q->n_sect = 0;
	150	n = strlen(q->n_un.n_name);
	151	if (n > maxlen)
	152	maxlen = n;
	153	}
	154	if (read(fd, (char *)&buf, sizeof(buf)) != sizeof(buf) \|\|
34e8f829 A	155	(N_BADMAG(buf) && ((uint32_t )&buf) != MH_MAGIC &&
34e8f829 A	156	OSSwapBigToHostInt32(((uint32_t )&buf)) != FAT_MAGIC)) {
e9ce8d39 A	157	return (-1);
	158	}
	159
	160	/* Deal with fat file if necessary */
34e8f829	161	if (OSSwapBigToHostInt32(((uint32_t )&buf)) == FAT_MAGIC) {
e9ce8d39 A	162	struct host_basic_info hbi;
	163	struct fat_header fh;
	164	struct fat_arch fat_archs, fap;
	165	unsigned i;
5b2abdfb	166	host_t host;
e9ce8d39 A	167
e9ce8d39 A	168	/* Get our host info */
5b2abdfb	169	host = mach_host_self();
e9ce8d39	170	i = HOST_BASIC_INFO_COUNT;
5b2abdfb	171	if (host_info(host, HOST_BASIC_INFO,
e9ce8d39 A	172	(host_info_t)(&hbi), &i) != KERN_SUCCESS) {
	173	return (-1);
	174	}
5b2abdfb	175	mach_port_deallocate(mach_task_self(), host);
e9ce8d39 A	176
	177	/* Read in the fat header */
	178	lseek(fd, 0, SEEK_SET);
	179	if (read(fd, (char *)&fh, sizeof(fh)) != sizeof(fh)) {
	180	return (-1);
	181	}
	182
	183	/* Convert fat_narchs to host byte order */
34e8f829	184	fh.nfat_arch = OSSwapBigToHostInt32(fh.nfat_arch);
e9ce8d39 A	185
e9ce8d39 A	186	/* Read in the fat archs */
b061a43b A	187	fat_archs = (struct fat_arch *)reallocarray(NULL, fh.nfat_arch,
b061a43b A	188	sizeof(struct fat_arch));
e9ce8d39 A	189	if (fat_archs == NULL) {
	190	return (-1);
	191	}
	192	if (read(fd, (char *)fat_archs,
	193	sizeof(struct fat_arch) * fh.nfat_arch) !=
	194	sizeof(struct fat_arch) * fh.nfat_arch) {
	195	free(fat_archs);
	196	return (-1);
	197	}
	198
	199	/*
	200	* Convert archs to host byte ordering (a constraint of
	201	* cpusubtype_getbestarch()
	202	*/
	203	for (i = 0; i < fh.nfat_arch; i++) {
	204	fat_archs[i].cputype =
34e8f829	205	OSSwapBigToHostInt32(fat_archs[i].cputype);
e9ce8d39	206	fat_archs[i].cpusubtype =
34e8f829	207	OSSwapBigToHostInt32(fat_archs[i].cpusubtype);
e9ce8d39	208	fat_archs[i].offset =
34e8f829	209	OSSwapBigToHostInt32(fat_archs[i].offset);
e9ce8d39	210	fat_archs[i].size =
34e8f829	211	OSSwapBigToHostInt32(fat_archs[i].size);
e9ce8d39	212	fat_archs[i].align =
34e8f829	213	OSSwapBigToHostInt32(fat_archs[i].align);
e9ce8d39 A	214	}
	215
	216	#if CPUSUBTYPE_SUPPORT
	217	fap = cpusubtype_getbestarch(hbi.cpu_type, hbi.cpu_subtype,
	218	fat_archs, fh.nfat_arch);
9385eb3d	219	#else
e9ce8d39 A	220	fap = NULL;
	221	for (i = 0; i < fh.nfat_arch; i++) {
	222	if (fat_archs[i].cputype == hbi.cpu_type) {
	223	fap = &fat_archs[i];
	224	break;
	225	}
	226	}
9385eb3d	227	#endif /* CPUSUBTYPE_SUPPORT */
e9ce8d39 A	228	if (!fap) {
	229	free(fat_archs);
	230	return (-1);
	231	}
	232	arch_offset = fap->offset;
	233	free(fat_archs);
	234
	235	/* Read in the beginning of the architecture-specific file */
	236	lseek(fd, arch_offset, SEEK_SET);
	237	if (read(fd, (char *)&buf, sizeof(buf)) != sizeof(buf)) {
	238	return (-1);
	239	}
	240	}
	241
34e8f829	242	if (((uint32_t )&buf) == MH_MAGIC) {
e9ce8d39 A	243	struct mach_header mh;
	244	struct load_command load_commands, lcp;
	245	struct symtab_command *stp;
	246	long i;
	247
	248	lseek(fd, arch_offset, SEEK_SET);
	249	if (read(fd, (char *)&mh, sizeof(mh)) != sizeof(mh)) {
	250	return (-1);
	251	}
	252	load_commands = (struct load_command *)malloc(mh.sizeofcmds);
	253	if (load_commands == NULL) {
	254	return (-1);
	255	}
	256	if (read(fd, (char *)load_commands, mh.sizeofcmds) !=
	257	mh.sizeofcmds) {
	258	free(load_commands);
	259	return (-1);
	260	}
	261	stp = NULL;
	262	lcp = load_commands;
	263	for (i = 0; i < mh.ncmds; i++) {
34e8f829	264	if (lcp->cmdsize % sizeof(uint32_t) != 0 \|\|
e9ce8d39 A	265	lcp->cmdsize <= 0 \|\|
	266	(char *)lcp + lcp->cmdsize >
	267	(char *)load_commands + mh.sizeofcmds) {
	268	free(load_commands);
	269	return (-1);
	270	}
	271	if (lcp->cmd == LC_SYMTAB) {
	272	if (lcp->cmdsize !=
	273	sizeof(struct symtab_command)) {
	274	free(load_commands);
	275	return (-1);
	276	}
	277	stp = (struct symtab_command *)lcp;
	278	break;
	279	}
	280	lcp = (struct load_command *)
	281	((char *)lcp + lcp->cmdsize);
	282	}
	283	if (stp == NULL) {
	284	free(load_commands);
	285	return (-1);
	286	}
	287	sa = stp->symoff + arch_offset;
	288	ss = stp->stroff + arch_offset;
	289	n = stp->nsyms * sizeof(struct nlist);
	290	free(load_commands);
	291	}
	292	else {
	293	sa = N_SYMOFF(buf) + arch_offset;
	294	ss = sa + buf.a_syms + arch_offset;
	295	n = buf.a_syms;
	296	}
	297
	298	lseek(fd, sa, SEEK_SET);
	299	while (n) {
34e8f829	300	off_t savpos;
e9ce8d39 A	301
	302	m = sizeof (space);
	303	if (n < m)
	304	m = n;
	305	if (read(fd, (char *)space, m) != m)
	306	break;
	307	n -= m;
	308	savpos = lseek(fd, 0, SEEK_CUR);
	309	for (q = space; (m -= sizeof(struct nlist)) >= 0; q++) {
	310	char nambuf[BUFSIZ];
	311
	312	if (q->n_un.n_strx == 0 \|\| q->n_type & N_STAB)
	313	continue;
	314	lseek(fd, ss+q->n_un.n_strx, SEEK_SET);
	315	read(fd, nambuf, maxlen+1);
	316	for (p = list; p->n_un.n_name && p->n_un.n_name[0]; p++) {
	317	s1 = p->n_un.n_name;
	318	s2 = nambuf;
	319	while (*s1) {
	320	if (s1++ != s2++)
	321	goto cont;
	322	}
	323	if (*s2)
	324	goto cont;
	325	p->n_value = q->n_value;
	326	p->n_type = q->n_type;
	327	p->n_desc = q->n_desc;
	328	p->n_sect = q->n_sect;
	329	if (--nreq == 0)
	330	return (nreq);
	331	break;
	332	cont: ;
	333	}
	334	}
	335	lseek(fd, savpos, SEEK_SET);
	336	}
	337	return (nreq);
	338	}
3d9156a7 A	339
3d9156a7 A	340	#endif /* !__LP64__ */