rtld.h revision 1.5 1 1.5 tv /* $NetBSD: rtld.h,v 1.5 1998/07/01 20:42:47 tv Exp $ */
2 1.1 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright 1996 John D. Polstra.
5 1.1 cgd * Copyright 1996 Matt Thomas <matt (at) 3am-software.com>
6 1.1 cgd * All rights reserved.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by John Polstra.
19 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
20 1.1 cgd * derived from this software without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
23 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
26 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
27 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef RTLD_H /* { */
35 1.1 cgd #define RTLD_H 1
36 1.1 cgd
37 1.1 cgd #include <stddef.h>
38 1.1 cgd #include <sys/param.h>
39 1.1 cgd #include <sys/types.h>
40 1.1 cgd #include <sys/exec_elf.h>
41 1.1 cgd #include "rtldenv.h"
42 1.1 cgd #include "link.h"
43 1.1 cgd
44 1.2 cgd #define RTLD_DEFAULT_LIBRARY_PATH "/usr/lib:/usr/local/lib"
45 1.1 cgd
46 1.1 cgd #if 0
47 1.1 cgd #define SVR4_LIBDIR "/usr/lib"
48 1.1 cgd #endif
49 1.1 cgd
50 1.1 cgd #define LIBDIRLEN (sizeof LIBDIR - 1)
51 1.1 cgd #define SVR4_LIBDIRLEN (sizeof SVR4_LIBDIR - 1)
52 1.1 cgd
53 1.5 tv #ifndef PAGESIZE
54 1.1 cgd #define PAGESIZE CLBYTES
55 1.5 tv #endif
56 1.1 cgd #define round_down(x) ((x) & ~(PAGESIZE-1))
57 1.1 cgd #define round_up(x) round_down((x) + PAGESIZE - 1)
58 1.1 cgd
59 1.1 cgd #define NEW(type) ((type *) xmalloc(sizeof(type)))
60 1.1 cgd #define CNEW(type) ((type *) xcalloc(sizeof(type)))
61 1.1 cgd
62 1.1 cgd /*
63 1.1 cgd * C++ has mandated the use of the following keywords for its new boolean
64 1.1 cgd * type. We might as well follow their lead.
65 1.1 cgd */
66 1.1 cgd typedef unsigned char bool;
67 1.1 cgd #define false 0
68 1.1 cgd #define true 1
69 1.1 cgd
70 1.1 cgd struct Struct_Obj_Entry;
71 1.1 cgd
72 1.1 cgd typedef struct Struct_Needed_Entry {
73 1.1 cgd struct Struct_Needed_Entry *next;
74 1.1 cgd struct Struct_Obj_Entry *obj;
75 1.1 cgd unsigned long name; /* Offset of name in string table */
76 1.1 cgd } Needed_Entry;
77 1.1 cgd
78 1.1 cgd typedef struct _rtld_search_path_t {
79 1.1 cgd struct _rtld_search_path_t *sp_next;
80 1.1 cgd const char *sp_path;
81 1.1 cgd size_t sp_pathlen;
82 1.1 cgd } Search_Path;
83 1.1 cgd
84 1.1 cgd /*
85 1.1 cgd * Shared object descriptor.
86 1.1 cgd *
87 1.1 cgd * Items marked with "(%)" are dynamically allocated, and must be freed
88 1.1 cgd * when the structure is destroyed.
89 1.1 cgd */
90 1.1 cgd
91 1.1 cgd #define RTLD_MAGIC 0xd550b87a
92 1.1 cgd #define RTLD_VERSION 1
93 1.1 cgd
94 1.1 cgd typedef struct Struct_Obj_Entry {
95 1.1 cgd Elf32_Word magic; /* Magic number (sanity check) */
96 1.1 cgd Elf32_Word version; /* Version number of struct format */
97 1.1 cgd
98 1.1 cgd struct Struct_Obj_Entry *next;
99 1.1 cgd char *path; /* Pathname of underlying file (%) */
100 1.1 cgd int refcount;
101 1.1 cgd int dl_refcount; /* Number of times loaded by dlopen */
102 1.1 cgd
103 1.1 cgd /* These items are computed by map_object() or by digest_phdr(). */
104 1.1 cgd caddr_t mapbase; /* Base address of mapped region */
105 1.1 cgd size_t mapsize; /* Size of mapped region in bytes */
106 1.1 cgd size_t textsize; /* Size of text segment in bytes */
107 1.1 cgd Elf_Addr vaddrbase; /* Base address in shared object file */
108 1.1 cgd caddr_t relocbase; /* Relocation constant = mapbase - vaddrbase */
109 1.1 cgd Elf_Dyn *dynamic; /* Dynamic section */
110 1.1 cgd caddr_t entry; /* Entry point */
111 1.1 cgd const Elf_Phdr *phdr; /* Program header if it is mapped, else NULL */
112 1.1 cgd size_t phsize; /* Size of program header in bytes */
113 1.1 cgd
114 1.1 cgd /* Items from the dynamic section. */
115 1.1 cgd Elf_Addr *pltgot; /* PLTGOT table */
116 1.1 cgd const Elf_Rel *rel; /* Relocation entries */
117 1.1 cgd const Elf_Rel *rellim; /* Limit of Relocation entries */
118 1.1 cgd const Elf_RelA *rela; /* Relocation entries */
119 1.1 cgd const Elf_RelA *relalim; /* Limit of Relocation entries */
120 1.1 cgd const Elf_Rel *pltrel; /* PLT relocation entries */
121 1.1 cgd const Elf_Rel *pltrellim; /* Limit of PLT relocation entries */
122 1.1 cgd const Elf_RelA *pltrela; /* PLT relocation entries */
123 1.1 cgd const Elf_RelA *pltrelalim; /* Limit of PLT relocation entries */
124 1.1 cgd const Elf_Sym *symtab; /* Symbol table */
125 1.1 cgd const char *strtab; /* String table */
126 1.1 cgd unsigned long strsize; /* Size in bytes of string table */
127 1.4 mhitch #if defined(__mips__)
128 1.4 mhitch Elf_Word local_gotno; /* Number of local GOT entries */
129 1.4 mhitch Elf_Word symtabno; /* Number of dynamic symbols */
130 1.4 mhitch Elf_Word gotsym; /* First dynamic symbol in GOT */
131 1.4 mhitch #endif
132 1.1 cgd
133 1.1 cgd const Elf_Word *buckets; /* Hash table buckets array */
134 1.1 cgd unsigned long nbuckets; /* Number of buckets */
135 1.1 cgd const Elf_Word *chains; /* Hash table chain array */
136 1.1 cgd unsigned long nchains; /* Number of chains */
137 1.1 cgd
138 1.1 cgd Search_Path *rpaths; /* Search path specified in object */
139 1.1 cgd Needed_Entry *needed; /* Shared objects needed by this one (%) */
140 1.1 cgd
141 1.1 cgd void (*init)(void); /* Initialization function to call */
142 1.1 cgd void (*fini)(void); /* Termination function to call */
143 1.1 cgd
144 1.1 cgd /* Entry points for dlopen() and friends. */
145 1.1 cgd void *(*dlopen)(const char *, int);
146 1.1 cgd void *(*dlsym)(void *, const char *);
147 1.1 cgd char *(*dlerror)(void);
148 1.1 cgd int (*dlclose)(void *);
149 1.1 cgd
150 1.1 cgd int mainprog : 1; /* True if this is the main program */
151 1.1 cgd int rtld : 1; /* True if this is the dynamic linker */
152 1.1 cgd int textrel : 1; /* True if there are relocations to text seg */
153 1.1 cgd int symbolic : 1; /* True if generated with "-Bsymbolic" */
154 1.1 cgd int printed : 1; /* True if ldd has printed it */
155 1.1 cgd
156 1.1 cgd struct link_map linkmap; /* for GDB */
157 1.1 cgd } Obj_Entry;
158 1.1 cgd
159 1.1 cgd extern struct r_debug _rtld_debug;
160 1.1 cgd extern Obj_Entry *_rtld_objlist;
161 1.1 cgd extern Obj_Entry **_rtld_objtail;
162 1.1 cgd extern Obj_Entry _rtld_objself;
163 1.1 cgd extern Search_Path *_rtld_paths;
164 1.1 cgd extern bool _rtld_trust;
165 1.1 cgd extern const char *_rtld_error_message;
166 1.1 cgd
167 1.1 cgd /* rtld_start.S */
168 1.1 cgd extern void _rtld_bind_start(void);
169 1.1 cgd
170 1.1 cgd /* rtld.c */
171 1.1 cgd
172 1.1 cgd extern void _rtld_error(const char *, ...);
173 1.1 cgd extern void _rtld_die(void);
174 1.1 cgd
175 1.1 cgd extern char *_rtld_dlerror(void);
176 1.1 cgd extern void *_rtld_dlopen(const char *, int);
177 1.1 cgd extern void *_rtld_dlsym(void *, const char *);
178 1.1 cgd extern int _rtld_dlclose(void *);
179 1.1 cgd
180 1.1 cgd extern void _rtld_debug_state(void);
181 1.1 cgd
182 1.1 cgd extern void _rtld_linkmap_add(Obj_Entry *);
183 1.1 cgd extern void _rtld_linkmap_delete(Obj_Entry *);
184 1.1 cgd
185 1.1 cgd /* headers.c */
186 1.1 cgd
187 1.1 cgd extern void _rtld_digest_dynamic(Obj_Entry *);
188 1.1 cgd extern Obj_Entry *_rtld_digest_phdr(const Elf_Phdr *, int, caddr_t);
189 1.1 cgd
190 1.1 cgd /* load.c */
191 1.1 cgd
192 1.1 cgd extern Obj_Entry *_rtld_load_object(char *path);
193 1.1 cgd extern int _rtld_load_needed_objects(Obj_Entry *);
194 1.1 cgd
195 1.1 cgd /* path.c */
196 1.1 cgd
197 1.1 cgd extern void _rtld_add_paths(Search_Path **, const char *);
198 1.1 cgd
199 1.1 cgd /* reloc.c */
200 1.1 cgd extern int _rtld_do_copy_relocations(const Obj_Entry *);
201 1.1 cgd extern caddr_t _rtld_bind(const Obj_Entry *, Elf_Word);
202 1.1 cgd extern int _rtld_relocate_objects(Obj_Entry *, bool);
203 1.1 cgd
204 1.1 cgd /* search.c */
205 1.1 cgd
206 1.1 cgd extern char *_rtld_find_library(const char *, const Obj_Entry *);
207 1.1 cgd
208 1.1 cgd /* symbol.c */
209 1.1 cgd extern unsigned long _rtld_elf_hash(const char *);
210 1.1 cgd extern const Elf_Sym *_rtld_symlook_obj(const char *, unsigned long,
211 1.1 cgd const Obj_Entry *, bool);
212 1.1 cgd extern const Elf_Sym *_rtld_find_symdef(const Obj_Entry *, Elf_Word,
213 1.1 cgd const char *, const Obj_Entry *, const Obj_Entry **, bool);
214 1.1 cgd
215 1.1 cgd /* map_object.c */
216 1.1 cgd extern Obj_Entry *_rtld_map_object(const char *, int);
217 1.4 mhitch
218 1.4 mhitch #if defined(__mips__)
219 1.4 mhitch /* mips_reloc.c */
220 1.4 mhitch extern void _rtld_relocate_mips_got(Obj_Entry *);
221 1.4 mhitch extern caddr_t _rtld_bind_mips (Elf_Word, Elf_Addr, Elf_Addr, Elf_Addr);
222 1.4 mhitch #endif
223 1.1 cgd
224 1.1 cgd #endif /* } */
225