link_aout.h revision 1.13 1 1.13 thorpej /* $NetBSD: link_aout.h,v 1.13 1998/05/14 01:55:28 thorpej Exp $ */
2 1.5 cgd
3 1.1 pk /*
4 1.3 pk * Copyright (c) 1993 Paul Kranenburg
5 1.3 pk * All rights reserved.
6 1.3 pk *
7 1.3 pk * Redistribution and use in source and binary forms, with or without
8 1.3 pk * modification, are permitted provided that the following conditions
9 1.3 pk * are met:
10 1.3 pk * 1. Redistributions of source code must retain the above copyright
11 1.3 pk * notice, this list of conditions and the following disclaimer.
12 1.3 pk * 2. Redistributions in binary form must reproduce the above copyright
13 1.3 pk * notice, this list of conditions and the following disclaimer in the
14 1.3 pk * documentation and/or other materials provided with the distribution.
15 1.3 pk * 3. All advertising materials mentioning features or use of this software
16 1.3 pk * must display the following acknowledgement:
17 1.3 pk * This product includes software developed by Paul Kranenburg.
18 1.3 pk * 4. The name of the author may not be used to endorse or promote products
19 1.3 pk * derived from this software withough specific prior written permission
20 1.3 pk *
21 1.3 pk * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22 1.3 pk * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
23 1.3 pk * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
24 1.3 pk * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25 1.3 pk * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 1.3 pk * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 1.3 pk * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 1.3 pk * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 1.3 pk * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30 1.3 pk * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 1.3 pk */
32 1.3 pk
33 1.3 pk /*
34 1.1 pk * RRS section definitions.
35 1.1 pk *
36 1.3 pk * The layout of some data structures defined in this header file is
37 1.3 pk * such that we can provide compatibility with the SunOS 4.x shared
38 1.3 pk * library scheme.
39 1.1 pk */
40 1.1 pk
41 1.1 pk #ifndef _LINK_H_
42 1.1 pk #define _LINK_H_
43 1.13 thorpej
44 1.13 thorpej #include <dlfcn.h> /* for Dl_info */
45 1.1 pk
46 1.1 pk /*
47 1.3 pk * A `Shared Object Descriptor' descibes a shared object that is needed
48 1.1 pk * to complete the link edit process of the object containing it.
49 1.3 pk * A list of such objects (chained through `sod_next') is pointed at
50 1.3 pk * by `sdt_sods' in the section_dispatch_table structure.
51 1.1 pk */
52 1.1 pk
53 1.3 pk struct sod { /* Shared Object Descriptor */
54 1.3 pk long sod_name; /* name (relative to load address) */
55 1.3 pk u_int sod_library : 1, /* Searched for by library rules */
56 1.3 pk sod_reserved : 31;
57 1.3 pk short sod_major; /* major version number */
58 1.3 pk short sod_minor; /* minor version number */
59 1.3 pk long sod_next; /* next sod */
60 1.1 pk };
61 1.1 pk
62 1.1 pk /*
63 1.3 pk * `Shared Object Map's are used by the run-time link editor (ld.so) to
64 1.3 pk * keep track of all shared objects loaded into a process' address space.
65 1.1 pk * These structures are only used at run-time and do not occur within
66 1.1 pk * the text or data segment of an executable or shared library.
67 1.1 pk */
68 1.3 pk struct so_map { /* Shared Object Map */
69 1.3 pk caddr_t som_addr; /* Address at which object mapped */
70 1.3 pk char *som_path; /* Path to mmap'ed file */
71 1.3 pk struct so_map *som_next; /* Next map in chain */
72 1.3 pk struct sod *som_sod; /* Sod responsible for this map */
73 1.3 pk caddr_t som_sodbase; /* Base address of this sod */
74 1.3 pk u_int som_write : 1; /* Text is currently writable */
75 1.3 pk struct _dynamic *som_dynamic; /* _dynamic structure */
76 1.3 pk caddr_t som_spd; /* Private data */
77 1.1 pk };
78 1.1 pk
79 1.1 pk /*
80 1.1 pk * Symbol description with size. This is simply an `nlist' with
81 1.1 pk * one field (nz_size) added.
82 1.1 pk * Used to convey size information on items in the data segment
83 1.1 pk * of shared objects. An array of these live in the shared object's
84 1.3 pk * text segment and is addressed by the `sdt_nzlist' field.
85 1.1 pk */
86 1.1 pk struct nzlist {
87 1.1 pk struct nlist nlist;
88 1.1 pk u_long nz_size;
89 1.1 pk #define nz_un nlist.n_un
90 1.1 pk #define nz_strx nlist.n_un.n_strx
91 1.1 pk #define nz_name nlist.n_un.n_name
92 1.1 pk #define nz_type nlist.n_type
93 1.1 pk #define nz_value nlist.n_value
94 1.1 pk #define nz_desc nlist.n_desc
95 1.1 pk #define nz_other nlist.n_other
96 1.1 pk };
97 1.1 pk
98 1.3 pk #define N_AUX(p) ((p)->n_other & 0xf)
99 1.6 pk #define N_BIND(p) (((unsigned int)(p)->n_other >> 4) & 0xf)
100 1.3 pk #define N_OTHER(r, v) (((unsigned int)(r) << 4) | ((v) & 0xf))
101 1.3 pk
102 1.3 pk #define AUX_OBJECT 1
103 1.3 pk #define AUX_FUNC 2
104 1.6 pk /*#define BIND_LOCAL 0 not used */
105 1.6 pk /*#define BIND_GLOBAL 1 not used */
106 1.6 pk #define BIND_WEAK 2
107 1.3 pk
108 1.3 pk
109 1.1 pk /*
110 1.3 pk * The `section_dispatch_table' structure contains offsets to various data
111 1.1 pk * structures needed to do run-time relocation.
112 1.1 pk */
113 1.3 pk struct section_dispatch_table {
114 1.3 pk struct so_map *sdt_loaded; /* List of loaded objects */
115 1.3 pk long sdt_sods; /* List of shared objects descriptors */
116 1.7 pk long sdt_paths; /* Library search paths */
117 1.3 pk long sdt_got; /* Global offset table */
118 1.3 pk long sdt_plt; /* Procedure linkage table */
119 1.3 pk long sdt_rel; /* Relocation table */
120 1.3 pk long sdt_hash; /* Symbol hash table */
121 1.3 pk long sdt_nzlist; /* Symbol table itself */
122 1.3 pk long sdt_filler2; /* Unused (was: stab_hash) */
123 1.3 pk long sdt_buckets; /* Number of hash buckets */
124 1.3 pk long sdt_strings; /* Symbol strings */
125 1.3 pk long sdt_str_sz; /* Size of symbol strings */
126 1.3 pk long sdt_text_sz; /* Size of text area */
127 1.3 pk long sdt_plt_sz; /* Size of procedure linkage table */
128 1.1 pk };
129 1.1 pk
130 1.1 pk /*
131 1.3 pk * RRS symbol hash table, addressed by `sdt_hash' in section_dispatch_table.
132 1.1 pk * Used to quickly lookup symbols of the shared object by hashing
133 1.1 pk * on the symbol's name. `rh_symbolnum' is the index of the symbol
134 1.3 pk * in the shared object's symbol list (`sdt_nzlist'), `rh_next' is
135 1.1 pk * the next symbol in the hash bucket (in case of collisions).
136 1.1 pk */
137 1.1 pk struct rrs_hash {
138 1.3 pk int rh_symbolnum; /* Symbol number */
139 1.3 pk int rh_next; /* Next hash entry */
140 1.1 pk };
141 1.1 pk
142 1.1 pk /*
143 1.1 pk * `rt_symbols' is used to keep track of run-time allocated commons
144 1.1 pk * and data items copied from shared objects.
145 1.1 pk */
146 1.1 pk struct rt_symbol {
147 1.3 pk struct nzlist *rt_sp; /* The symbol */
148 1.3 pk struct rt_symbol *rt_next; /* Next in linear list */
149 1.3 pk struct rt_symbol *rt_link; /* Next in bucket */
150 1.3 pk caddr_t rt_srcaddr; /* Address of "master" copy */
151 1.3 pk struct so_map *rt_smp; /* Originating map */
152 1.1 pk };
153 1.1 pk
154 1.1 pk /*
155 1.1 pk * Debugger interface structure.
156 1.1 pk */
157 1.3 pk struct so_debug {
158 1.3 pk int dd_version; /* Version # of interface */
159 1.3 pk int dd_in_debugger; /* Set when run by debugger */
160 1.3 pk int dd_sym_loaded; /* Run-time linking brought more
161 1.3 pk symbols into scope */
162 1.3 pk char *dd_bpt_addr; /* Address of rtld-generated bpt */
163 1.3 pk int dd_bpt_shadow; /* Original contents of bpt */
164 1.3 pk struct rt_symbol *dd_cc; /* Allocated commons/copied data */
165 1.1 pk };
166 1.1 pk
167 1.1 pk /*
168 1.1 pk * Entry points into ld.so - user interface to the run-time linker.
169 1.1 pk */
170 1.1 pk struct ld_entry {
171 1.11 scottr void *(*dlopen) __P((const char *, int));
172 1.3 pk int (*dlclose) __P((void *));
173 1.11 scottr void *(*dlsym) __P((void *, const char *));
174 1.3 pk int (*dlctl) __P((void *, int, void *));
175 1.9 pk void (*dlexit) __P((void));
176 1.12 pk int (*dladdr) __P((void *, Dl_info *));
177 1.12 pk void (*dlrsrvd[2]) __P((void));
178 1.1 pk };
179 1.3 pk
180 1.3 pk /*
181 1.1 pk * This is the structure pointed at by the __DYNAMIC symbol if an
182 1.1 pk * executable requires the attention of the run-time link editor.
183 1.1 pk * __DYNAMIC is given the value zero if no run-time linking needs to
184 1.1 pk * be done (it is always present in shared objects).
185 1.3 pk * The union `d_un' provides for different versions of the dynamic
186 1.3 pk * linking mechanism (switched on by `d_version'). The last version
187 1.1 pk * used by Sun is 3. We leave some room here and go to version number
188 1.1 pk * 8 for NetBSD, the main difference lying in the support for the
189 1.1 pk * `nz_list' type of symbols.
190 1.1 pk */
191 1.1 pk
192 1.3 pk struct _dynamic {
193 1.3 pk int d_version; /* version # of this interface */
194 1.3 pk struct so_debug *d_debug;
195 1.1 pk union {
196 1.3 pk struct section_dispatch_table *d_sdt;
197 1.3 pk } d_un;
198 1.9 pk struct ld_entry *d_entry; /* compat - now in crt_ldso */
199 1.1 pk };
200 1.1 pk
201 1.1 pk #define LD_VERSION_SUN (3)
202 1.1 pk #define LD_VERSION_BSD (8)
203 1.1 pk #define LD_VERSION_NZLIST_P(v) ((v) >= 8)
204 1.1 pk
205 1.3 pk #define LD_GOT(x) ((x)->d_un.d_sdt->sdt_got)
206 1.3 pk #define LD_PLT(x) ((x)->d_un.d_sdt->sdt_plt)
207 1.3 pk #define LD_REL(x) ((x)->d_un.d_sdt->sdt_rel)
208 1.3 pk #define LD_SYMBOL(x) ((x)->d_un.d_sdt->sdt_nzlist)
209 1.3 pk #define LD_HASH(x) ((x)->d_un.d_sdt->sdt_hash)
210 1.3 pk #define LD_STRINGS(x) ((x)->d_un.d_sdt->sdt_strings)
211 1.3 pk #define LD_NEED(x) ((x)->d_un.d_sdt->sdt_sods)
212 1.3 pk #define LD_BUCKETS(x) ((x)->d_un.d_sdt->sdt_buckets)
213 1.7 pk #define LD_PATHS(x) ((x)->d_un.d_sdt->sdt_paths)
214 1.3 pk
215 1.3 pk #define LD_GOTSZ(x) ((x)->d_un.d_sdt->sdt_plt - (x)->d_un.d_sdt->sdt_got)
216 1.3 pk #define LD_RELSZ(x) ((x)->d_un.d_sdt->sdt_hash - (x)->d_un.d_sdt->sdt_rel)
217 1.3 pk #define LD_HASHSZ(x) ((x)->d_un.d_sdt->sdt_nzlist - (x)->d_un.d_sdt->sdt_hash)
218 1.3 pk #define LD_STABSZ(x) ((x)->d_un.d_sdt->sdt_strings - (x)->d_un.d_sdt->sdt_nzlist)
219 1.3 pk #define LD_PLTSZ(x) ((x)->d_un.d_sdt->sdt_plt_sz)
220 1.3 pk #define LD_STRSZ(x) ((x)->d_un.d_sdt->sdt_str_sz)
221 1.3 pk #define LD_TEXTSZ(x) ((x)->d_un.d_sdt->sdt_text_sz)
222 1.1 pk
223 1.1 pk /*
224 1.3 pk * Interface to ld.so
225 1.1 pk */
226 1.1 pk struct crt_ldso {
227 1.1 pk int crt_ba; /* Base address of ld.so */
228 1.1 pk int crt_dzfd; /* "/dev/zero" file decriptor (SunOS) */
229 1.1 pk int crt_ldfd; /* ld.so file descriptor */
230 1.3 pk struct _dynamic *crt_dp; /* Main's __DYNAMIC */
231 1.1 pk char **crt_ep; /* environment strings */
232 1.1 pk caddr_t crt_bp; /* Breakpoint if run from debugger */
233 1.6 pk char *crt_prog; /* Program name (v3) */
234 1.6 pk char *crt_ldso; /* Link editor name (v4) */
235 1.6 pk struct ld_entry *crt_ldentry; /* dl*() access (v4) */
236 1.1 pk };
237 1.1 pk
238 1.1 pk /*
239 1.1 pk * Version passed from crt0 to ld.so (1st argument to _rtld()).
240 1.1 pk */
241 1.1 pk #define CRT_VERSION_SUN 1
242 1.3 pk #define CRT_VERSION_BSD_2 2
243 1.3 pk #define CRT_VERSION_BSD_3 3
244 1.6 pk #define CRT_VERSION_BSD_4 4
245 1.2 pk
246 1.2 pk
247 1.2 pk /*
248 1.2 pk * Maximum number of recognized shared object version numbers.
249 1.2 pk */
250 1.2 pk #define MAXDEWEY 8
251 1.2 pk
252 1.2 pk /*
253 1.2 pk * Header of the hints file.
254 1.2 pk */
255 1.2 pk struct hints_header {
256 1.2 pk long hh_magic;
257 1.2 pk #define HH_MAGIC 011421044151
258 1.2 pk long hh_version; /* Interface version number */
259 1.2 pk #define LD_HINTS_VERSION_1 1
260 1.10 pk #define LD_HINTS_VERSION_2 2
261 1.2 pk long hh_hashtab; /* Location of hash table */
262 1.2 pk long hh_nbucket; /* Number of buckets in hashtab */
263 1.2 pk long hh_strtab; /* Location of strings */
264 1.2 pk long hh_strtab_sz; /* Size of strings */
265 1.2 pk long hh_ehints; /* End of hints (max offset in file) */
266 1.10 pk long hh_dirlist; /* Colon-separated list of srch dirs */
267 1.2 pk };
268 1.2 pk
269 1.2 pk #define HH_BADMAG(hdr) ((hdr).hh_magic != HH_MAGIC)
270 1.2 pk
271 1.2 pk /*
272 1.2 pk * Hash table element in hints file.
273 1.2 pk */
274 1.2 pk struct hints_bucket {
275 1.2 pk /* namex and pathx are indices into the string table */
276 1.2 pk int hi_namex; /* Library name */
277 1.2 pk int hi_pathx; /* Full path */
278 1.2 pk int hi_dewey[MAXDEWEY]; /* The versions */
279 1.2 pk int hi_ndewey; /* Number of version numbers */
280 1.2 pk #define hi_major hi_dewey[0]
281 1.2 pk #define hi_minor hi_dewey[1]
282 1.2 pk int hi_next; /* Next in this bucket */
283 1.2 pk };
284 1.2 pk
285 1.2 pk #define _PATH_LD_HINTS "/var/run/ld.so.hints"
286 1.1 pk
287 1.1 pk #endif /* _LINK_H_ */
288 1.1 pk
289