symbol.c revision 1.26 1 /* $NetBSD: symbol.c,v 1.26 2003/04/23 17:40:25 mycroft Exp $ */
2
3 /*
4 * Copyright 1996 John D. Polstra.
5 * Copyright 1996 Matt Thomas <matt (at) 3am-software.com>
6 * Copyright 2002 Charles M. Hannum <root (at) ihack.net>
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by John Polstra.
20 * 4. The name of the author may not be used to endorse or promote products
21 * derived from this software without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 */
34
35 /*
36 * Dynamic linker for ELF.
37 *
38 * John Polstra <jdp (at) polstra.com>.
39 */
40
41 #include <err.h>
42 #include <errno.h>
43 #include <fcntl.h>
44 #include <stdarg.h>
45 #include <stdio.h>
46 #include <stdlib.h>
47 #include <string.h>
48 #include <unistd.h>
49 #include <sys/types.h>
50 #include <sys/mman.h>
51 #include <dirent.h>
52
53 #include "debug.h"
54 #include "rtld.h"
55
56 /*
57 * Hash function for symbol table lookup. Don't even think about changing
58 * this. It is specified by the System V ABI.
59 */
60 unsigned long
61 _rtld_elf_hash(name)
62 const char *name;
63 {
64 const unsigned char *p = (const unsigned char *) name;
65 unsigned long h = 0;
66 unsigned long g;
67 unsigned long c;
68
69 for (; __predict_true((c = *p) != '\0'); p++) {
70 h <<= 4;
71 h += c;
72 if ((g = h & 0xf0000000) != 0) {
73 h ^= g;
74 h ^= g >> 24;
75 }
76 }
77 return (h);
78 }
79
80 const Elf_Sym *
81 _rtld_symlook_list(const char *name, unsigned long hash, const Objlist *objlist,
82 const Obj_Entry **defobj_out, bool in_plt)
83 {
84 const Elf_Sym *symp;
85 const Elf_Sym *def;
86 const Objlist_Entry *elm;
87
88 def = NULL;
89 SIMPLEQ_FOREACH(elm, objlist, link) {
90 rdbg(("search object %p (%s)", elm->obj, elm->obj->path));
91 if ((symp = _rtld_symlook_obj(name, hash, elm->obj, in_plt))
92 != NULL) {
93 if ((def == NULL) ||
94 (ELF_ST_BIND(symp->st_info) != STB_WEAK)) {
95 def = symp;
96 *defobj_out = elm->obj;
97 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
98 break;
99 }
100 }
101 }
102 return def;
103 }
104
105 /*
106 * Search the symbol table of a single shared object for a symbol of
107 * the given name. Returns a pointer to the symbol, or NULL if no
108 * definition was found.
109 *
110 * The symbol's hash value is passed in for efficiency reasons; that
111 * eliminates many recomputations of the hash value.
112 */
113 const Elf_Sym *
114 _rtld_symlook_obj(name, hash, obj, in_plt)
115 const char *name;
116 unsigned long hash;
117 const Obj_Entry *obj;
118 bool in_plt;
119 {
120 unsigned long symnum;
121
122 for (symnum = obj->buckets[hash % obj->nbuckets];
123 symnum != ELF_SYM_UNDEFINED;
124 symnum = obj->chains[symnum]) {
125 const Elf_Sym *symp;
126 const char *strp;
127
128 assert(symnum < obj->nchains);
129 symp = obj->symtab + symnum;
130 strp = obj->strtab + symp->st_name;
131 rdbg(("check %s vs %s in %p", name, strp, obj));
132 if (name[1] == strp[1] && !strcmp(name, strp)) {
133 if (symp->st_shndx != SHN_UNDEF)
134 return symp;
135 #ifndef __mips__
136 /*
137 * XXX DANGER WILL ROBINSON!
138 * If we have a function pointer in the executable's
139 * data section, it points to the executable's PLT
140 * slot, and there is NO relocation emitted. To make
141 * the function pointer comparable to function pointers
142 * in shared libraries, we must resolve data references
143 * in the libraries to point to PLT slots in the
144 * executable, if they exist.
145 */
146 else if (!in_plt && symp->st_value != 0 &&
147 ELF_ST_TYPE(symp->st_info) == STT_FUNC)
148 return symp;
149 #endif
150 else
151 return NULL;
152 }
153 }
154
155 return NULL;
156 }
157
158 /*
159 * Given a symbol number in a referencing object, find the corresponding
160 * definition of the symbol. Returns a pointer to the symbol, or NULL if
161 * no definition was found. Returns a pointer to the Obj_Entry of the
162 * defining object via the reference parameter DEFOBJ_OUT.
163 */
164 const Elf_Sym *
165 _rtld_find_symname(name, refobj, defobj_out, in_plt)
166 const char *name;
167 const Obj_Entry *refobj;
168 const Obj_Entry **defobj_out;
169 bool in_plt;
170 {
171 const Elf_Sym *def;
172 const Elf_Sym *symp;
173 const Obj_Entry *obj;
174 const Objlist_Entry *elm;
175 unsigned long hash;
176
177 hash = _rtld_elf_hash(name);
178 def = NULL;
179
180 if (refobj->symbolic) { /* Look first in the referencing object */
181 symp = _rtld_symlook_obj(name, hash, refobj, in_plt);
182 if (symp != NULL) {
183 def = symp;
184 *defobj_out = refobj;
185 }
186 }
187
188 /* Search all objects loaded at program start up. */
189 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) {
190 rdbg(("search _rtld_list_main"));
191 symp = _rtld_symlook_list(name, hash, &_rtld_list_main, &obj, in_plt);
192 if (symp != NULL &&
193 (def == NULL || ELF_ST_BIND(symp->st_info) != STB_WEAK)) {
194 def = symp;
195 *defobj_out = obj;
196 }
197 }
198
199 /* Search all dlopened DAGs containing the referencing object. */
200 SIMPLEQ_FOREACH(elm, &refobj->dldags, link) {
201 if (def != NULL && ELF_ST_BIND(def->st_info) != STB_WEAK)
202 break;
203 rdbg(("search DAG with root %p (%s)", elm->obj, elm->obj->path));
204 symp = _rtld_symlook_list(name, hash, &elm->obj->dagmembers, &obj, in_plt);
205 if (symp != NULL &&
206 (def == NULL || ELF_ST_BIND(symp->st_info) != STB_WEAK)) {
207 def = symp;
208 *defobj_out = obj;
209 }
210 }
211
212 /* Search all RTLD_GLOBAL objects. */
213 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) {
214 rdbg(("search _rtld_list_global"));
215 symp = _rtld_symlook_list(name, hash, &_rtld_list_global, &obj, in_plt);
216 if (symp != NULL &&
217 (def == NULL || ELF_ST_BIND(symp->st_info) != STB_WEAK)) {
218 def = symp;
219 *defobj_out = obj;
220 }
221 }
222
223 return def;
224 }
225
226 const Elf_Sym *
227 _rtld_find_symdef(symnum, refobj, defobj_out, in_plt)
228 unsigned long symnum;
229 const Obj_Entry *refobj;
230 const Obj_Entry **defobj_out;
231 bool in_plt;
232 {
233 const Elf_Sym *ref, *def;
234 const char *name;
235
236 ref = refobj->symtab + symnum;
237 name = refobj->strtab + ref->st_name;
238
239 def = _rtld_find_symname(name, refobj, defobj_out, in_plt);
240 if (def == NULL) {
241 if (ELF_ST_BIND(ref->st_info) == STB_WEAK) {
242 /*
243 * If we found no definition and the reference is weak,
244 * treat the symbol as having the value zero.
245 */
246 rdbg((" returning _rtld_sym_zero@_rtld_objmain"));
247 def = &_rtld_sym_zero;
248 *defobj_out = _rtld_objmain;
249 } else {
250 rdbg(("lookup failed"));
251 _rtld_error("%s: Undefined %ssymbol \"%s\" (symnum = %ld)",
252 refobj->path, in_plt ? "PLT " : "", name, symnum);
253 }
254 }
255 return (def);
256 }
257