Home | History | Annotate | Line # | Download | only in ldd
ldd_elfxx.c revision 1.1
      1  1.1  mrg /*	$NetBSD: ldd_elfxx.c,v 1.1 2009/01/06 03:59:56 mrg Exp $	*/
      2  1.1  mrg 
      3  1.1  mrg /*-
      4  1.1  mrg  * Copyright (c) 1998, 2000 The NetBSD Foundation, Inc.
      5  1.1  mrg  * All rights reserved.
      6  1.1  mrg  *
      7  1.1  mrg  * This code is derived from software contributed to The NetBSD Foundation
      8  1.1  mrg  * by Paul Kranenburg.
      9  1.1  mrg  *
     10  1.1  mrg  * Redistribution and use in source and binary forms, with or without
     11  1.1  mrg  * modification, are permitted provided that the following conditions
     12  1.1  mrg  * are met:
     13  1.1  mrg  * 1. Redistributions of source code must retain the above copyright
     14  1.1  mrg  *    notice, this list of conditions and the following disclaimer.
     15  1.1  mrg  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1  mrg  *    notice, this list of conditions and the following disclaimer in the
     17  1.1  mrg  *    documentation and/or other materials provided with the distribution.
     18  1.1  mrg  *
     19  1.1  mrg  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20  1.1  mrg  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21  1.1  mrg  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22  1.1  mrg  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23  1.1  mrg  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24  1.1  mrg  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25  1.1  mrg  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26  1.1  mrg  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27  1.1  mrg  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28  1.1  mrg  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29  1.1  mrg  * POSSIBILITY OF SUCH DAMAGE.
     30  1.1  mrg  */
     31  1.1  mrg 
     32  1.1  mrg /*
     33  1.1  mrg  * Copyright 1996 John D. Polstra.
     34  1.1  mrg  * Copyright 1996 Matt Thomas <matt (at) 3am-software.com>
     35  1.1  mrg  * All rights reserved.
     36  1.1  mrg  *
     37  1.1  mrg  * Redistribution and use in source and binary forms, with or without
     38  1.1  mrg  * modification, are permitted provided that the following conditions
     39  1.1  mrg  * are met:
     40  1.1  mrg  * 1. Redistributions of source code must retain the above copyright
     41  1.1  mrg  *    notice, this list of conditions and the following disclaimer.
     42  1.1  mrg  * 2. Redistributions in binary form must reproduce the above copyright
     43  1.1  mrg  *    notice, this list of conditions and the following disclaimer in the
     44  1.1  mrg  *    documentation and/or other materials provided with the distribution.
     45  1.1  mrg  * 3. All advertising materials mentioning features or use of this software
     46  1.1  mrg  *    must display the following acknowledgement:
     47  1.1  mrg  *      This product includes software developed by John Polstra.
     48  1.1  mrg  * 4. The name of the author may not be used to endorse or promote products
     49  1.1  mrg  *    derived from this software without specific prior written permission.
     50  1.1  mrg  *
     51  1.1  mrg  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     52  1.1  mrg  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     53  1.1  mrg  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     54  1.1  mrg  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     55  1.1  mrg  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     56  1.1  mrg  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     57  1.1  mrg  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     58  1.1  mrg  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     59  1.1  mrg  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     60  1.1  mrg  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     61  1.1  mrg  */
     62  1.1  mrg 
     63  1.1  mrg #include <sys/cdefs.h>
     64  1.1  mrg #ifndef lint
     65  1.1  mrg __RCSID("$NetBSD: ldd_elfxx.c,v 1.1 2009/01/06 03:59:56 mrg Exp $");
     66  1.1  mrg #endif /* not lint */
     67  1.1  mrg 
     68  1.1  mrg #include <sys/types.h>
     69  1.1  mrg #include <sys/mman.h>
     70  1.1  mrg #include <sys/wait.h>
     71  1.1  mrg 
     72  1.1  mrg #include <a.out.h>
     73  1.1  mrg #include <dirent.h>
     74  1.1  mrg #include <err.h>
     75  1.1  mrg #include <errno.h>
     76  1.1  mrg #include <fcntl.h>
     77  1.1  mrg #include <stdarg.h>
     78  1.1  mrg #include <stdio.h>
     79  1.1  mrg #include <stdlib.h>
     80  1.1  mrg #include <string.h>
     81  1.1  mrg #include <unistd.h>
     82  1.1  mrg #include <ctype.h>
     83  1.1  mrg 
     84  1.1  mrg #include "debug.h"
     85  1.1  mrg #include "rtld.h"
     86  1.1  mrg #include "ldd.h"
     87  1.1  mrg 
     88  1.1  mrg /*
     89  1.1  mrg  * elfxx_ldd() - bit-size independant ELF ldd implementation.
     90  1.1  mrg  * returns 0 on success and -1 on failure.
     91  1.1  mrg  */
     92  1.1  mrg int
     93  1.1  mrg ELFNAME(ldd)(char *path, char *fmt1, char *fmt2)
     94  1.1  mrg {
     95  1.1  mrg 	struct stat st;
     96  1.1  mrg 	int fd;
     97  1.1  mrg 
     98  1.1  mrg 	fd = open(path, O_RDONLY);
     99  1.1  mrg 	if (fd == -1) {
    100  1.1  mrg 		warn("%s", path);
    101  1.1  mrg 		return -1;
    102  1.1  mrg 	}
    103  1.1  mrg 	if (fstat(fd, &st) < 0) {
    104  1.1  mrg 		warn("%s", path);
    105  1.1  mrg 		close(fd);
    106  1.1  mrg 		return -1;
    107  1.1  mrg 	}
    108  1.1  mrg 
    109  1.1  mrg 	_rtld_pagesz = sysconf(_SC_PAGESIZE);
    110  1.1  mrg 
    111  1.1  mrg #ifdef RTLD_ARCH_SUBDIR
    112  1.1  mrg 	_rtld_add_paths(path, &_rtld_default_paths,
    113  1.1  mrg 	    RTLD_DEFAULT_LIBRARY_PATH "/" RTLD_ARCH_SUBDIR);
    114  1.1  mrg #endif
    115  1.1  mrg 	_rtld_add_paths(path, &_rtld_default_paths, RTLD_DEFAULT_LIBRARY_PATH);
    116  1.1  mrg 
    117  1.1  mrg 	_rtld_paths = NULL;
    118  1.1  mrg 	_rtld_trust = (st.st_mode & (S_ISUID | S_ISGID)) == 0;
    119  1.1  mrg 	if (_rtld_trust)
    120  1.1  mrg 		_rtld_add_paths(path, &_rtld_paths, getenv("LD_LIBRARY_PATH"));
    121  1.1  mrg 
    122  1.1  mrg 	_rtld_process_hints(path, &_rtld_paths, &_rtld_xforms, _PATH_LD_HINTS);
    123  1.1  mrg 	_rtld_objmain = _rtld_map_object(xstrdup(path), fd, &st);
    124  1.1  mrg 	if (_rtld_objmain == NULL) {
    125  1.1  mrg 		close(fd);
    126  1.1  mrg 		return -1;
    127  1.1  mrg 	}
    128  1.1  mrg 	close(fd);
    129  1.1  mrg 
    130  1.1  mrg 	_rtld_objmain->path = xstrdup(path);
    131  1.1  mrg 	_rtld_digest_dynamic(path, _rtld_objmain);
    132  1.1  mrg 
    133  1.1  mrg 	/* Link the main program into the list of objects. */
    134  1.1  mrg 	*_rtld_objtail = _rtld_objmain;
    135  1.1  mrg 	_rtld_objtail = &_rtld_objmain->next;
    136  1.1  mrg 	++_rtld_objmain->refcount;
    137  1.1  mrg 
    138  1.1  mrg 	(void) _rtld_load_needed_objects(_rtld_objmain, 0);
    139  1.1  mrg 
    140  1.1  mrg 	if (fmt1 == NULL)
    141  1.1  mrg 		printf("%s:\n", _rtld_objmain->path);
    142  1.1  mrg 	main_local = path;
    143  1.1  mrg 	main_progname = _rtld_objmain->path;
    144  1.1  mrg 	print_needed(_rtld_objmain, fmt1, fmt2);
    145  1.1  mrg 
    146  1.1  mrg 	while (_rtld_objlist != NULL) {
    147  1.1  mrg 		Obj_Entry *obj = _rtld_objlist;
    148  1.1  mrg 		_rtld_objlist = obj->next;
    149  1.1  mrg 		while (obj->rpaths != NULL) {
    150  1.1  mrg 			const Search_Path *rpath = obj->rpaths;
    151  1.1  mrg 			obj->rpaths = rpath->sp_next;
    152  1.1  mrg 			xfree(__UNCONST(rpath->sp_path));
    153  1.1  mrg 			xfree(__UNCONST(rpath));
    154  1.1  mrg 		}
    155  1.1  mrg 		while (obj->needed != NULL) {
    156  1.1  mrg 			const Needed_Entry *needed = obj->needed;
    157  1.1  mrg 			obj->needed = needed->next;
    158  1.1  mrg 			xfree(__UNCONST(needed));
    159  1.1  mrg 		}
    160  1.1  mrg 		(void) munmap(obj->mapbase, obj->mapsize);
    161  1.1  mrg 		xfree(obj->path);
    162  1.1  mrg 		xfree(obj);
    163  1.1  mrg 	}
    164  1.1  mrg 
    165  1.1  mrg 	_rtld_objmain = NULL;
    166  1.1  mrg 	_rtld_objtail = &_rtld_objlist;
    167  1.1  mrg 	/* Need to free _rtld_paths? */
    168  1.1  mrg 
    169  1.1  mrg 	return 0;
    170  1.1  mrg }
    171