xref: /openbsd-src/lib/libelf/libelf_ar_util.c (revision a1b5ec256a03e12d667837fca8bf42f20675916f)
1*a1b5ec25Sjsg /*-
2*a1b5ec25Sjsg  * Copyright (c) 2006,2009,2010 Joseph Koshy
3*a1b5ec25Sjsg  * All rights reserved.
4*a1b5ec25Sjsg  *
5*a1b5ec25Sjsg  * Redistribution and use in source and binary forms, with or without
6*a1b5ec25Sjsg  * modification, are permitted provided that the following conditions
7*a1b5ec25Sjsg  * are met:
8*a1b5ec25Sjsg  * 1. Redistributions of source code must retain the above copyright
9*a1b5ec25Sjsg  *    notice, this list of conditions and the following disclaimer.
10*a1b5ec25Sjsg  * 2. Redistributions in binary form must reproduce the above copyright
11*a1b5ec25Sjsg  *    notice, this list of conditions and the following disclaimer in the
12*a1b5ec25Sjsg  *    documentation and/or other materials provided with the distribution.
13*a1b5ec25Sjsg  *
14*a1b5ec25Sjsg  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS `AS IS' AND
15*a1b5ec25Sjsg  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*a1b5ec25Sjsg  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*a1b5ec25Sjsg  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*a1b5ec25Sjsg  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*a1b5ec25Sjsg  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*a1b5ec25Sjsg  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*a1b5ec25Sjsg  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*a1b5ec25Sjsg  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*a1b5ec25Sjsg  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*a1b5ec25Sjsg  * SUCH DAMAGE.
25*a1b5ec25Sjsg  */
26*a1b5ec25Sjsg 
27*a1b5ec25Sjsg #include <assert.h>
28*a1b5ec25Sjsg #include <libelf.h>
29*a1b5ec25Sjsg #include <stdlib.h>
30*a1b5ec25Sjsg #include <string.h>
31*a1b5ec25Sjsg 
32*a1b5ec25Sjsg #include "_libelf.h"
33*a1b5ec25Sjsg #include "_libelf_ar.h"
34*a1b5ec25Sjsg 
35*a1b5ec25Sjsg ELFTC_VCSID("$Id: libelf_ar_util.c,v 1.1 2019/02/01 05:27:38 jsg Exp $");
36*a1b5ec25Sjsg 
37*a1b5ec25Sjsg /*
38*a1b5ec25Sjsg  * Convert a string bounded by `start' and `start+sz' (exclusive) to a
39*a1b5ec25Sjsg  * number in the specified base.
40*a1b5ec25Sjsg  */
41*a1b5ec25Sjsg int
_libelf_ar_get_number(const char * src,size_t sz,unsigned int base,size_t * ret)42*a1b5ec25Sjsg _libelf_ar_get_number(const char *src, size_t sz, unsigned int base,
43*a1b5ec25Sjsg     size_t *ret)
44*a1b5ec25Sjsg {
45*a1b5ec25Sjsg 	size_t r;
46*a1b5ec25Sjsg 	unsigned int c, v;
47*a1b5ec25Sjsg 	const unsigned char *e, *s;
48*a1b5ec25Sjsg 
49*a1b5ec25Sjsg 	assert(base <= 10);
50*a1b5ec25Sjsg 
51*a1b5ec25Sjsg 	s = (const unsigned char *) src;
52*a1b5ec25Sjsg 	e = s + sz;
53*a1b5ec25Sjsg 
54*a1b5ec25Sjsg 	/* skip leading blanks */
55*a1b5ec25Sjsg 	for (;s < e && (c = *s) == ' '; s++)
56*a1b5ec25Sjsg 		;
57*a1b5ec25Sjsg 
58*a1b5ec25Sjsg 	r = 0L;
59*a1b5ec25Sjsg 	for (;s < e; s++) {
60*a1b5ec25Sjsg 		if ((c = *s) == ' ')
61*a1b5ec25Sjsg 			break;
62*a1b5ec25Sjsg 		if (c < '0' || c > '9')
63*a1b5ec25Sjsg 			return (0);
64*a1b5ec25Sjsg 		v = c - '0';
65*a1b5ec25Sjsg 		if (v >= base)		/* Illegal digit. */
66*a1b5ec25Sjsg 			break;
67*a1b5ec25Sjsg 		r *= base;
68*a1b5ec25Sjsg 		r += v;
69*a1b5ec25Sjsg 	}
70*a1b5ec25Sjsg 
71*a1b5ec25Sjsg 	*ret = r;
72*a1b5ec25Sjsg 
73*a1b5ec25Sjsg 	return (1);
74*a1b5ec25Sjsg }
75*a1b5ec25Sjsg 
76*a1b5ec25Sjsg /*
77*a1b5ec25Sjsg  * Return the translated name for an archive member.
78*a1b5ec25Sjsg  */
79*a1b5ec25Sjsg char *
_libelf_ar_get_translated_name(const struct ar_hdr * arh,Elf * ar)80*a1b5ec25Sjsg _libelf_ar_get_translated_name(const struct ar_hdr *arh, Elf *ar)
81*a1b5ec25Sjsg {
82*a1b5ec25Sjsg 	char *s;
83*a1b5ec25Sjsg 	unsigned char c;
84*a1b5ec25Sjsg 	size_t len, offset;
85*a1b5ec25Sjsg 	const unsigned char *buf, *p, *q, *r;
86*a1b5ec25Sjsg 	const size_t bufsize = sizeof(arh->ar_name);
87*a1b5ec25Sjsg 
88*a1b5ec25Sjsg 	assert(arh != NULL);
89*a1b5ec25Sjsg 	assert(ar->e_kind == ELF_K_AR);
90*a1b5ec25Sjsg 	assert((const unsigned char *) arh >= ar->e_rawfile &&
91*a1b5ec25Sjsg 	    (const unsigned char *) arh < ar->e_rawfile + ar->e_rawsize);
92*a1b5ec25Sjsg 
93*a1b5ec25Sjsg 	buf = (const unsigned char *) arh->ar_name;
94*a1b5ec25Sjsg 
95*a1b5ec25Sjsg 	/*
96*a1b5ec25Sjsg 	 * Check for extended naming.
97*a1b5ec25Sjsg 	 *
98*a1b5ec25Sjsg 	 * If the name matches the pattern "^/[0-9]+", it is an
99*a1b5ec25Sjsg 	 * SVR4-style extended name.  If the name matches the pattern
100*a1b5ec25Sjsg 	 * "#1/[0-9]+", the entry uses BSD style extended naming.
101*a1b5ec25Sjsg 	 */
102*a1b5ec25Sjsg 	if (buf[0] == '/' && (c = buf[1]) >= '0' && c <= '9') {
103*a1b5ec25Sjsg 		/*
104*a1b5ec25Sjsg 		 * The value in field ar_name is a decimal offset into
105*a1b5ec25Sjsg 		 * the archive string table where the actual name
106*a1b5ec25Sjsg 		 * resides.
107*a1b5ec25Sjsg 		 */
108*a1b5ec25Sjsg 		if (_libelf_ar_get_number((const char *) (buf + 1),
109*a1b5ec25Sjsg 			bufsize - 1, 10, &offset) == 0) {
110*a1b5ec25Sjsg 			LIBELF_SET_ERROR(ARCHIVE, 0);
111*a1b5ec25Sjsg 			return (NULL);
112*a1b5ec25Sjsg 		}
113*a1b5ec25Sjsg 
114*a1b5ec25Sjsg 		if (offset > ar->e_u.e_ar.e_rawstrtabsz) {
115*a1b5ec25Sjsg 			LIBELF_SET_ERROR(ARCHIVE, 0);
116*a1b5ec25Sjsg 			return (NULL);
117*a1b5ec25Sjsg 		}
118*a1b5ec25Sjsg 
119*a1b5ec25Sjsg 		p = q = ar->e_u.e_ar.e_rawstrtab + offset;
120*a1b5ec25Sjsg 		r = ar->e_u.e_ar.e_rawstrtab + ar->e_u.e_ar.e_rawstrtabsz;
121*a1b5ec25Sjsg 
122*a1b5ec25Sjsg 		for (; p < r && *p != '/'; p++)
123*a1b5ec25Sjsg 			;
124*a1b5ec25Sjsg 		len = (size_t) (p - q + 1); /* space for the trailing NUL */
125*a1b5ec25Sjsg 
126*a1b5ec25Sjsg 		if ((s = malloc(len)) == NULL) {
127*a1b5ec25Sjsg 			LIBELF_SET_ERROR(RESOURCE, 0);
128*a1b5ec25Sjsg 			return (NULL);
129*a1b5ec25Sjsg 		}
130*a1b5ec25Sjsg 
131*a1b5ec25Sjsg 		(void) strncpy(s, (const char *) q, len - 1);
132*a1b5ec25Sjsg 		s[len - 1] = '\0';
133*a1b5ec25Sjsg 
134*a1b5ec25Sjsg 		return (s);
135*a1b5ec25Sjsg 	} else if (IS_EXTENDED_BSD_NAME(buf)) {
136*a1b5ec25Sjsg 		r = buf + LIBELF_AR_BSD_EXTENDED_NAME_PREFIX_SIZE;
137*a1b5ec25Sjsg 
138*a1b5ec25Sjsg 		if (_libelf_ar_get_number((const char *) r, bufsize -
139*a1b5ec25Sjsg 			LIBELF_AR_BSD_EXTENDED_NAME_PREFIX_SIZE, 10,
140*a1b5ec25Sjsg 			&len) == 0) {
141*a1b5ec25Sjsg 			LIBELF_SET_ERROR(ARCHIVE, 0);
142*a1b5ec25Sjsg 			return (NULL);
143*a1b5ec25Sjsg 		}
144*a1b5ec25Sjsg 
145*a1b5ec25Sjsg 		/*
146*a1b5ec25Sjsg 		 * Allocate space for the file name plus a
147*a1b5ec25Sjsg 		 * trailing NUL.
148*a1b5ec25Sjsg 		 */
149*a1b5ec25Sjsg 		if ((s = malloc(len + 1)) == NULL) {
150*a1b5ec25Sjsg 			LIBELF_SET_ERROR(RESOURCE, 0);
151*a1b5ec25Sjsg 			return (NULL);
152*a1b5ec25Sjsg 		}
153*a1b5ec25Sjsg 
154*a1b5ec25Sjsg 		/*
155*a1b5ec25Sjsg 		 * The file name follows the archive header.
156*a1b5ec25Sjsg 		 */
157*a1b5ec25Sjsg 		q = (const unsigned char *) (arh + 1);
158*a1b5ec25Sjsg 
159*a1b5ec25Sjsg 		(void) strncpy(s, (const char *) q, len);
160*a1b5ec25Sjsg 		s[len] = '\0';
161*a1b5ec25Sjsg 
162*a1b5ec25Sjsg 		return (s);
163*a1b5ec25Sjsg 	}
164*a1b5ec25Sjsg 
165*a1b5ec25Sjsg 	/*
166*a1b5ec25Sjsg 	 * A 'normal' name.
167*a1b5ec25Sjsg 	 *
168*a1b5ec25Sjsg 	 * Skip back over trailing blanks from the end of the field.
169*a1b5ec25Sjsg 	 * In the SVR4 format, a '/' is used as a terminator for
170*a1b5ec25Sjsg 	 * non-special names.
171*a1b5ec25Sjsg 	 */
172*a1b5ec25Sjsg 	for (q = buf + bufsize - 1; q >= buf && *q == ' '; --q)
173*a1b5ec25Sjsg 		;
174*a1b5ec25Sjsg 
175*a1b5ec25Sjsg 	if (q >= buf) {
176*a1b5ec25Sjsg 		if (*q == '/') {
177*a1b5ec25Sjsg 			/*
178*a1b5ec25Sjsg 			 * SVR4 style names: ignore the trailing
179*a1b5ec25Sjsg 			 * character '/', but only if the name is not
180*a1b5ec25Sjsg 			 * one of the special names "/" and "//".
181*a1b5ec25Sjsg 			 */
182*a1b5ec25Sjsg 			if (q > buf + 1 ||
183*a1b5ec25Sjsg 			    (q == (buf + 1) && *buf != '/'))
184*a1b5ec25Sjsg 				q--;
185*a1b5ec25Sjsg 		}
186*a1b5ec25Sjsg 
187*a1b5ec25Sjsg 		len = (size_t) (q - buf + 2); /* Space for a trailing NUL. */
188*a1b5ec25Sjsg 	} else {
189*a1b5ec25Sjsg 		/* The buffer only had blanks. */
190*a1b5ec25Sjsg 		buf = (const unsigned char *) "";
191*a1b5ec25Sjsg 		len = 1;
192*a1b5ec25Sjsg 	}
193*a1b5ec25Sjsg 
194*a1b5ec25Sjsg 	if ((s = malloc(len)) == NULL) {
195*a1b5ec25Sjsg 		LIBELF_SET_ERROR(RESOURCE, 0);
196*a1b5ec25Sjsg 		return (NULL);
197*a1b5ec25Sjsg 	}
198*a1b5ec25Sjsg 
199*a1b5ec25Sjsg 	(void) strncpy(s, (const char *) buf, len - 1);
200*a1b5ec25Sjsg 	s[len - 1] = '\0';
201*a1b5ec25Sjsg 
202*a1b5ec25Sjsg 	return (s);
203*a1b5ec25Sjsg }
204*a1b5ec25Sjsg 
205*a1b5ec25Sjsg /*
206*a1b5ec25Sjsg  * Return the raw name for an archive member, inclusive of any
207*a1b5ec25Sjsg  * formatting characters.
208*a1b5ec25Sjsg  */
209*a1b5ec25Sjsg char *
_libelf_ar_get_raw_name(const struct ar_hdr * arh)210*a1b5ec25Sjsg _libelf_ar_get_raw_name(const struct ar_hdr *arh)
211*a1b5ec25Sjsg {
212*a1b5ec25Sjsg 	char *rawname;
213*a1b5ec25Sjsg 	const size_t namesz = sizeof(arh->ar_name);
214*a1b5ec25Sjsg 
215*a1b5ec25Sjsg 	if ((rawname = malloc(namesz + 1)) == NULL) {
216*a1b5ec25Sjsg 		LIBELF_SET_ERROR(RESOURCE, 0);
217*a1b5ec25Sjsg 		return (NULL);
218*a1b5ec25Sjsg 	}
219*a1b5ec25Sjsg 
220*a1b5ec25Sjsg 	(void) strncpy(rawname, arh->ar_name, namesz);
221*a1b5ec25Sjsg 	rawname[namesz] = '\0';
222*a1b5ec25Sjsg 	return (rawname);
223*a1b5ec25Sjsg }
224*a1b5ec25Sjsg 
225*a1b5ec25Sjsg /*
226*a1b5ec25Sjsg  * Open an 'ar' archive.
227*a1b5ec25Sjsg  */
228*a1b5ec25Sjsg Elf *
_libelf_ar_open(Elf * e,int reporterror)229*a1b5ec25Sjsg _libelf_ar_open(Elf *e, int reporterror)
230*a1b5ec25Sjsg {
231*a1b5ec25Sjsg 	size_t sz;
232*a1b5ec25Sjsg 	int scanahead;
233*a1b5ec25Sjsg 	struct ar_hdr arh;
234*a1b5ec25Sjsg 	unsigned char *s, *end;
235*a1b5ec25Sjsg 
236*a1b5ec25Sjsg 	_libelf_init_elf(e, ELF_K_AR);
237*a1b5ec25Sjsg 
238*a1b5ec25Sjsg 	e->e_u.e_ar.e_nchildren = 0;
239*a1b5ec25Sjsg 	e->e_u.e_ar.e_next = (off_t) -1;
240*a1b5ec25Sjsg 
241*a1b5ec25Sjsg 	/*
242*a1b5ec25Sjsg 	 * Look for special members.
243*a1b5ec25Sjsg 	 */
244*a1b5ec25Sjsg 
245*a1b5ec25Sjsg 	s = e->e_rawfile + SARMAG;
246*a1b5ec25Sjsg 	end = e->e_rawfile + e->e_rawsize;
247*a1b5ec25Sjsg 
248*a1b5ec25Sjsg 	assert(e->e_rawsize > 0);
249*a1b5ec25Sjsg 
250*a1b5ec25Sjsg 	/*
251*a1b5ec25Sjsg 	 * We use heuristics to determine the flavor of the archive we
252*a1b5ec25Sjsg 	 * are examining.
253*a1b5ec25Sjsg 	 *
254*a1b5ec25Sjsg 	 * SVR4 flavor archives use the name "/ " and "// " for
255*a1b5ec25Sjsg 	 * special members.
256*a1b5ec25Sjsg 	 *
257*a1b5ec25Sjsg 	 * In BSD flavor archives the symbol table, if present, is the
258*a1b5ec25Sjsg 	 * first archive with name "__.SYMDEF".
259*a1b5ec25Sjsg 	 */
260*a1b5ec25Sjsg 
261*a1b5ec25Sjsg #define	READ_AR_HEADER(S, ARH, SZ, END)					\
262*a1b5ec25Sjsg 	do {								\
263*a1b5ec25Sjsg 		if ((S) + sizeof((ARH)) > (END))			\
264*a1b5ec25Sjsg 		        goto error;					\
265*a1b5ec25Sjsg 		(void) memcpy(&(ARH), (S), sizeof((ARH)));		\
266*a1b5ec25Sjsg 		if ((ARH).ar_fmag[0] != '`' || (ARH).ar_fmag[1] != '\n') \
267*a1b5ec25Sjsg 			goto error;					\
268*a1b5ec25Sjsg 		if (_libelf_ar_get_number((char *) (ARH).ar_size,	\
269*a1b5ec25Sjsg 		    sizeof((ARH).ar_size), 10, &(SZ)) == 0)		\
270*a1b5ec25Sjsg 			goto error;					\
271*a1b5ec25Sjsg 	} while (0)
272*a1b5ec25Sjsg 
273*a1b5ec25Sjsg 	READ_AR_HEADER(s, arh, sz, end);
274*a1b5ec25Sjsg 
275*a1b5ec25Sjsg 	/*
276*a1b5ec25Sjsg 	 * Handle special archive members for the SVR4 format.
277*a1b5ec25Sjsg 	 */
278*a1b5ec25Sjsg 	if (arh.ar_name[0] == '/') {
279*a1b5ec25Sjsg 		if (sz == 0)
280*a1b5ec25Sjsg 			goto error;
281*a1b5ec25Sjsg 
282*a1b5ec25Sjsg 		e->e_flags |= LIBELF_F_AR_VARIANT_SVR4;
283*a1b5ec25Sjsg 
284*a1b5ec25Sjsg 		scanahead = 0;
285*a1b5ec25Sjsg 
286*a1b5ec25Sjsg 		/*
287*a1b5ec25Sjsg 		 * The symbol table (file name "/ ") always comes before the
288*a1b5ec25Sjsg 		 * string table (file name "// ").
289*a1b5ec25Sjsg 		 */
290*a1b5ec25Sjsg 		if (arh.ar_name[1] == ' ') {
291*a1b5ec25Sjsg 			/* "/ " => symbol table. */
292*a1b5ec25Sjsg 			scanahead = 1;	/* The string table to follow. */
293*a1b5ec25Sjsg 
294*a1b5ec25Sjsg 			s += sizeof(arh);
295*a1b5ec25Sjsg 			e->e_u.e_ar.e_rawsymtab = s;
296*a1b5ec25Sjsg 			e->e_u.e_ar.e_rawsymtabsz = sz;
297*a1b5ec25Sjsg 
298*a1b5ec25Sjsg 			sz = LIBELF_ADJUST_AR_SIZE(sz);
299*a1b5ec25Sjsg 			s += sz;
300*a1b5ec25Sjsg 
301*a1b5ec25Sjsg 		} else if (arh.ar_name[1] == '/' && arh.ar_name[2] == ' ') {
302*a1b5ec25Sjsg 			/* "// " => string table for long file names. */
303*a1b5ec25Sjsg 			s += sizeof(arh);
304*a1b5ec25Sjsg 			e->e_u.e_ar.e_rawstrtab = s;
305*a1b5ec25Sjsg 			e->e_u.e_ar.e_rawstrtabsz = sz;
306*a1b5ec25Sjsg 
307*a1b5ec25Sjsg 			sz = LIBELF_ADJUST_AR_SIZE(sz);
308*a1b5ec25Sjsg 			s += sz;
309*a1b5ec25Sjsg 		}
310*a1b5ec25Sjsg 
311*a1b5ec25Sjsg 		/*
312*a1b5ec25Sjsg 		 * If the string table hasn't been seen yet, look for
313*a1b5ec25Sjsg 		 * it in the next member.
314*a1b5ec25Sjsg 		 */
315*a1b5ec25Sjsg 		if (scanahead) {
316*a1b5ec25Sjsg 			READ_AR_HEADER(s, arh, sz, end);
317*a1b5ec25Sjsg 
318*a1b5ec25Sjsg 			/* "// " => string table for long file names. */
319*a1b5ec25Sjsg 			if (arh.ar_name[0] == '/' && arh.ar_name[1] == '/' &&
320*a1b5ec25Sjsg 			    arh.ar_name[2] == ' ') {
321*a1b5ec25Sjsg 
322*a1b5ec25Sjsg 				s += sizeof(arh);
323*a1b5ec25Sjsg 
324*a1b5ec25Sjsg 				e->e_u.e_ar.e_rawstrtab = s;
325*a1b5ec25Sjsg 				e->e_u.e_ar.e_rawstrtabsz = sz;
326*a1b5ec25Sjsg 
327*a1b5ec25Sjsg 				sz = LIBELF_ADJUST_AR_SIZE(sz);
328*a1b5ec25Sjsg 				s += sz;
329*a1b5ec25Sjsg 			}
330*a1b5ec25Sjsg 		}
331*a1b5ec25Sjsg 	} else if (strncmp(arh.ar_name, LIBELF_AR_BSD_SYMTAB_NAME,
332*a1b5ec25Sjsg 		sizeof(LIBELF_AR_BSD_SYMTAB_NAME) - 1) == 0) {
333*a1b5ec25Sjsg 		/*
334*a1b5ec25Sjsg 		 * BSD style archive symbol table.
335*a1b5ec25Sjsg 		 */
336*a1b5ec25Sjsg 		s += sizeof(arh);
337*a1b5ec25Sjsg 		e->e_u.e_ar.e_rawsymtab = s;
338*a1b5ec25Sjsg 		e->e_u.e_ar.e_rawsymtabsz = sz;
339*a1b5ec25Sjsg 
340*a1b5ec25Sjsg 		sz = LIBELF_ADJUST_AR_SIZE(sz);
341*a1b5ec25Sjsg 		s += sz;
342*a1b5ec25Sjsg 	}
343*a1b5ec25Sjsg 
344*a1b5ec25Sjsg 	/*
345*a1b5ec25Sjsg 	 * Update the 'next' offset, so that a subsequent elf_begin()
346*a1b5ec25Sjsg 	 * works as expected.
347*a1b5ec25Sjsg 	 */
348*a1b5ec25Sjsg 	e->e_u.e_ar.e_next = (off_t) (s - e->e_rawfile);
349*a1b5ec25Sjsg 
350*a1b5ec25Sjsg 	return (e);
351*a1b5ec25Sjsg 
352*a1b5ec25Sjsg error:
353*a1b5ec25Sjsg 	if (!reporterror) {
354*a1b5ec25Sjsg 		e->e_kind = ELF_K_NONE;
355*a1b5ec25Sjsg 		return (e);
356*a1b5ec25Sjsg 	}
357*a1b5ec25Sjsg 
358*a1b5ec25Sjsg 	LIBELF_SET_ERROR(ARCHIVE, 0);
359*a1b5ec25Sjsg 	return (NULL);
360*a1b5ec25Sjsg }
361