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