1 /* $NetBSD: ldd.c,v 1.4 2009/01/07 00:39:24 mrg Exp $ */ 2 3 /*- 4 * Copyright (c) 1998, 2000 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Paul Kranenburg. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 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 * 19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 * POSSIBILITY OF SUCH DAMAGE. 30 */ 31 32 /* 33 * Copyright 1996 John D. Polstra. 34 * Copyright 1996 Matt Thomas <matt@3am-software.com> 35 * All rights reserved. 36 * 37 * Redistribution and use in source and binary forms, with or without 38 * modification, are permitted provided that the following conditions 39 * are met: 40 * 1. Redistributions of source code must retain the above copyright 41 * notice, this list of conditions and the following disclaimer. 42 * 2. Redistributions in binary form must reproduce the above copyright 43 * notice, this list of conditions and the following disclaimer in the 44 * documentation and/or other materials provided with the distribution. 45 * 3. All advertising materials mentioning features or use of this software 46 * must display the following acknowledgement: 47 * This product includes software developed by John Polstra. 48 * 4. The name of the author may not be used to endorse or promote products 49 * derived from this software without specific prior written permission. 50 * 51 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 52 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 53 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 54 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 55 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 56 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 57 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 58 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 59 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 60 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 61 */ 62 63 #include <sys/cdefs.h> 64 #ifndef lint 65 __RCSID("$NetBSD: ldd.c,v 1.4 2009/01/07 00:39:24 mrg Exp $"); 66 #endif /* not lint */ 67 68 #include <sys/types.h> 69 #include <sys/mman.h> 70 #include <sys/wait.h> 71 72 #include <a.out.h> 73 #include <dirent.h> 74 #include <err.h> 75 #include <errno.h> 76 #include <fcntl.h> 77 #include <stdarg.h> 78 #include <stdio.h> 79 #include <stdlib.h> 80 #include <string.h> 81 #include <unistd.h> 82 #include <ctype.h> 83 84 #include "debug.h" 85 #include "rtld.h" 86 #include "ldd.h" 87 88 /* 89 * Data declarations. 90 */ 91 static char *error_message; /* Message for dlopen(), or NULL */ 92 bool _rtld_trust; /* False for setuid and setgid programs */ 93 Obj_Entry *_rtld_objlist; /* Head of linked list of shared objects */ 94 Obj_Entry **_rtld_objtail = &_rtld_objlist; 95 /* Link field of last object in list */ 96 Obj_Entry *_rtld_objmain; /* The main program shared object */ 97 int _rtld_pagesz; 98 99 Search_Path *_rtld_default_paths; 100 Search_Path *_rtld_paths; 101 Library_Xform *_rtld_xforms; 102 103 static void usage(void) __dead; 104 char *main_local; 105 char *main_progname; 106 107 static void 108 usage(void) 109 { 110 fprintf(stderr, "Usage: %s [-f <format 1>] [-f <format 2>] <filename>" 111 " ...\n", getprogname()); 112 exit(1); 113 } 114 115 int 116 main(int argc, char **argv) 117 { 118 char *fmt1 = NULL, *fmt2 = NULL; 119 int c; 120 121 #ifdef DEBUG 122 debug = 1; 123 #endif 124 while ((c = getopt(argc, argv, "f:")) != -1) { 125 switch (c) { 126 case 'f': 127 if (fmt1) { 128 if (fmt2) 129 errx(1, "Too many formats"); 130 fmt2 = optarg; 131 } else 132 fmt1 = optarg; 133 break; 134 default: 135 usage(); 136 /*NOTREACHED*/ 137 } 138 } 139 argc -= optind; 140 argv += optind; 141 142 if (argc <= 0) { 143 usage(); 144 /*NOTREACHED*/ 145 } 146 147 for (; argc != 0; argc--, argv++) 148 if (elf_ldd(*argv, fmt1, fmt2) == -1 && 149 /* Alpha never had 32 bit support. */ 150 #if defined(_LP64) && !defined(__alpha__) 151 elf32_ldd(*argv, fmt1, fmt2) == -1 && 152 #endif 153 aout_ldd(*argv, fmt1, fmt2) == -1) 154 warnx("%s", error_message); 155 156 return 0; 157 } 158 159 /* 160 * Error reporting function. Use it like printf. If formats the message 161 * into a buffer, and sets things up so that the next call to dlerror() 162 * will return the message. 163 */ 164 void 165 _rtld_error(const char *fmt, ...) 166 { 167 static char buf[512]; 168 va_list ap; 169 va_start(ap, fmt); 170 xvsnprintf(buf, sizeof buf, fmt, ap); 171 error_message = buf; 172 va_end(ap); 173 } 174 175 char * 176 dlerror() 177 { 178 char *msg = error_message; 179 error_message = NULL; 180 return msg; 181 } 182 183 void 184 fmtprint(const char *libname, Obj_Entry *obj, const char *fmt1, 185 const char *fmt2) 186 { 187 const char *libpath = obj ? obj->path : "not found"; 188 char libnamebuf[200]; 189 char *libmajor = NULL; 190 const char *fmt; 191 char *cp; 192 int c; 193 194 if (strncmp(libname, "lib", 3) == 0 && 195 (cp = strstr(libname, ".so")) != NULL) { 196 int i = cp - (libname + 3); 197 198 if (i >= sizeof(libnamebuf)) 199 i = sizeof(libnamebuf) - 1; 200 (void)memcpy(libnamebuf, libname + 3, i); 201 libnamebuf[i] = '\0'; 202 if (cp[3] && isdigit((unsigned char)cp[4])) 203 libmajor = &cp[4]; 204 libname = libnamebuf; 205 } 206 207 if (fmt1 == NULL) 208 fmt1 = libmajor != NULL ? 209 "\t-l%o.%m => %p\n" : 210 "\t-l%o => %p\n"; 211 if (fmt2 == NULL) 212 fmt2 = "\t%o => %p\n"; 213 214 fmt = libname == libnamebuf ? fmt1 : fmt2; 215 while ((c = *fmt++) != '\0') { 216 switch (c) { 217 default: 218 putchar(c); 219 continue; 220 case '\\': 221 switch (c = *fmt) { 222 case '\0': 223 continue; 224 case 'n': 225 putchar('\n'); 226 break; 227 case 't': 228 putchar('\t'); 229 break; 230 } 231 break; 232 case '%': 233 switch (c = *fmt) { 234 case '\0': 235 continue; 236 case '%': 237 default: 238 putchar(c); 239 break; 240 case 'A': 241 printf("%s", main_local); 242 break; 243 case 'a': 244 printf("%s", main_progname); 245 break; 246 case 'o': 247 printf("%s", libname); 248 break; 249 case 'm': 250 printf("%s", libmajor); 251 break; 252 case 'n': 253 /* XXX: not supported for elf */ 254 break; 255 case 'p': 256 printf("%s", libpath); 257 break; 258 case 'x': 259 printf("%p", obj ? obj->mapbase : 0); 260 break; 261 } 262 break; 263 } 264 ++fmt; 265 } 266 } 267 268 void 269 print_needed(Obj_Entry *obj, const char *fmt1, const char *fmt2) 270 { 271 const Needed_Entry *needed; 272 273 for (needed = obj->needed; needed != NULL; needed = needed->next) { 274 const char *libname = obj->strtab + needed->name; 275 276 if (needed->obj != NULL) { 277 print_needed(needed->obj, fmt1, fmt2); 278 if (!needed->obj->printed) { 279 fmtprint(libname, needed->obj, fmt1, fmt2); 280 needed->obj->printed = 1; 281 } 282 } else { 283 fmtprint(libname, needed->obj, fmt1, fmt2); 284 } 285 } 286 } 287