mdreloc.c revision 1.39 1 1.39 mrg /* $NetBSD: mdreloc.c,v 1.39 2006/05/20 07:09:44 mrg Exp $ */
2 1.1 christos
3 1.1 christos /*-
4 1.27 mycroft * Copyright (c) 1999, 2002 The NetBSD Foundation, Inc.
5 1.1 christos * All rights reserved.
6 1.1 christos *
7 1.1 christos * This code is derived from software contributed to The NetBSD Foundation
8 1.29 mycroft * by Paul Kranenburg and by Charles M. Hannum.
9 1.1 christos *
10 1.1 christos * Redistribution and use in source and binary forms, with or without
11 1.1 christos * modification, are permitted provided that the following conditions
12 1.1 christos * are met:
13 1.1 christos * 1. Redistributions of source code must retain the above copyright
14 1.1 christos * notice, this list of conditions and the following disclaimer.
15 1.1 christos * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 christos * notice, this list of conditions and the following disclaimer in the
17 1.1 christos * documentation and/or other materials provided with the distribution.
18 1.1 christos * 3. All advertising materials mentioning features or use of this software
19 1.1 christos * must display the following acknowledgement:
20 1.1 christos * This product includes software developed by the NetBSD
21 1.1 christos * Foundation, Inc. and its contributors.
22 1.1 christos * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 christos * contributors may be used to endorse or promote products derived
24 1.1 christos * from this software without specific prior written permission.
25 1.1 christos *
26 1.1 christos * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 christos * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 christos * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 christos * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 christos * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 christos * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 christos * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 christos * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 christos * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 christos * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 christos * POSSIBILITY OF SUCH DAMAGE.
37 1.1 christos */
38 1.1 christos
39 1.37 skrll #include <sys/cdefs.h>
40 1.37 skrll #ifndef lint
41 1.39 mrg __RCSID("$NetBSD: mdreloc.c,v 1.39 2006/05/20 07:09:44 mrg Exp $");
42 1.37 skrll #endif /* not lint */
43 1.37 skrll
44 1.1 christos #include <errno.h>
45 1.1 christos #include <stdio.h>
46 1.1 christos #include <stdlib.h>
47 1.1 christos #include <string.h>
48 1.1 christos #include <unistd.h>
49 1.9 mycroft #include <sys/stat.h>
50 1.1 christos
51 1.1 christos #include "rtldenv.h"
52 1.1 christos #include "debug.h"
53 1.1 christos #include "rtld.h"
54 1.1 christos
55 1.1 christos /*
56 1.1 christos * The following table holds for each relocation type:
57 1.1 christos * - the width in bits of the memory location the relocation
58 1.1 christos * applies to (not currently used)
59 1.1 christos * - the number of bits the relocation value must be shifted to the
60 1.1 christos * right (i.e. discard least significant bits) to fit into
61 1.1 christos * the appropriate field in the instruction word.
62 1.1 christos * - flags indicating whether
63 1.1 christos * * the relocation involves a symbol
64 1.1 christos * * the relocation is relative to the current position
65 1.1 christos * * the relocation is for a GOT entry
66 1.1 christos * * the relocation is relative to the load address
67 1.1 christos *
68 1.1 christos */
69 1.1 christos #define _RF_S 0x80000000 /* Resolve symbol */
70 1.1 christos #define _RF_A 0x40000000 /* Use addend */
71 1.1 christos #define _RF_P 0x20000000 /* Location relative */
72 1.1 christos #define _RF_G 0x10000000 /* GOT offset */
73 1.1 christos #define _RF_B 0x08000000 /* Load address relative */
74 1.34 martin #define _RF_U 0x04000000 /* Unaligned */
75 1.1 christos #define _RF_SZ(s) (((s) & 0xff) << 8) /* memory target size */
76 1.1 christos #define _RF_RS(s) ( (s) & 0xff) /* right shift */
77 1.21 mycroft static const int reloc_target_flags[] = {
78 1.1 christos 0, /* NONE */
79 1.1 christos _RF_S|_RF_A| _RF_SZ(8) | _RF_RS(0), /* RELOC_8 */
80 1.1 christos _RF_S|_RF_A| _RF_SZ(16) | _RF_RS(0), /* RELOC_16 */
81 1.1 christos _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* RELOC_32 */
82 1.1 christos _RF_S|_RF_A|_RF_P| _RF_SZ(8) | _RF_RS(0), /* DISP_8 */
83 1.1 christos _RF_S|_RF_A|_RF_P| _RF_SZ(16) | _RF_RS(0), /* DISP_16 */
84 1.1 christos _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(0), /* DISP_32 */
85 1.1 christos _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WDISP_30 */
86 1.1 christos _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WDISP_22 */
87 1.1 christos _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(10), /* HI22 */
88 1.1 christos _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 22 */
89 1.1 christos _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 13 */
90 1.1 christos _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* LO10 */
91 1.1 christos _RF_G| _RF_SZ(32) | _RF_RS(0), /* GOT10 */
92 1.1 christos _RF_G| _RF_SZ(32) | _RF_RS(0), /* GOT13 */
93 1.1 christos _RF_G| _RF_SZ(32) | _RF_RS(10), /* GOT22 */
94 1.1 christos _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(0), /* PC10 */
95 1.1 christos _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(10), /* PC22 */
96 1.1 christos _RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WPLT30 */
97 1.1 christos _RF_SZ(32) | _RF_RS(0), /* COPY */
98 1.1 christos _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* GLOB_DAT */
99 1.1 christos _RF_SZ(32) | _RF_RS(0), /* JMP_SLOT */
100 1.2 pk _RF_A| _RF_B| _RF_SZ(32) | _RF_RS(0), /* RELATIVE */
101 1.34 martin _RF_S|_RF_A| _RF_U| _RF_SZ(32) | _RF_RS(0), /* UA_32 */
102 1.1 christos };
103 1.1 christos
104 1.1 christos #ifdef RTLD_DEBUG_RELOC
105 1.1 christos static const char *reloc_names[] = {
106 1.1 christos "NONE", "RELOC_8", "RELOC_16", "RELOC_32", "DISP_8",
107 1.1 christos "DISP_16", "DISP_32", "WDISP_30", "WDISP_22", "HI22",
108 1.1 christos "22", "13", "LO10", "GOT10", "GOT13",
109 1.1 christos "GOT22", "PC10", "PC22", "WPLT30", "COPY",
110 1.35 martin "GLOB_DAT", "JMP_SLOT", "RELATIVE", "UA_32"
111 1.1 christos };
112 1.1 christos #endif
113 1.1 christos
114 1.1 christos #define RELOC_RESOLVE_SYMBOL(t) ((reloc_target_flags[t] & _RF_S) != 0)
115 1.1 christos #define RELOC_PC_RELATIVE(t) ((reloc_target_flags[t] & _RF_P) != 0)
116 1.2 pk #define RELOC_BASE_RELATIVE(t) ((reloc_target_flags[t] & _RF_B) != 0)
117 1.34 martin #define RELOC_UNALIGNED(t) ((reloc_target_flags[t] & _RF_U) != 0)
118 1.34 martin #define RELOC_USE_ADDEND(t) ((reloc_target_flags[t] & _RF_A) != 0)
119 1.1 christos #define RELOC_TARGET_SIZE(t) ((reloc_target_flags[t] >> 8) & 0xff)
120 1.1 christos #define RELOC_VALUE_RIGHTSHIFT(t) (reloc_target_flags[t] & 0xff)
121 1.1 christos
122 1.21 mycroft static const int reloc_target_bitmask[] = {
123 1.1 christos #define _BM(x) (~(-(1ULL << (x))))
124 1.1 christos 0, /* NONE */
125 1.1 christos _BM(8), _BM(16), _BM(32), /* RELOC_8, _16, _32 */
126 1.1 christos _BM(8), _BM(16), _BM(32), /* DISP8, DISP16, DISP32 */
127 1.1 christos _BM(30), _BM(22), /* WDISP30, WDISP22 */
128 1.1 christos _BM(22), _BM(22), /* HI22, _22 */
129 1.1 christos _BM(13), _BM(10), /* RELOC_13, _LO10 */
130 1.1 christos _BM(10), _BM(13), _BM(22), /* GOT10, GOT13, GOT22 */
131 1.1 christos _BM(10), _BM(22), /* _PC10, _PC22 */
132 1.1 christos _BM(30), 0, /* _WPLT30, _COPY */
133 1.4 pk -1, -1, -1, /* _GLOB_DAT, JMP_SLOT, _RELATIVE */
134 1.35 martin _BM(32) /* _UA32 */
135 1.1 christos #undef _BM
136 1.1 christos };
137 1.1 christos #define RELOC_VALUE_BITMASK(t) (reloc_target_bitmask[t])
138 1.1 christos
139 1.25 mycroft void _rtld_bind_start(void);
140 1.24 mycroft void _rtld_relocate_nonplt_self(Elf_Dyn *, Elf_Addr);
141 1.33 skrll caddr_t _rtld_bind(const Obj_Entry *, Elf_Word);
142 1.36 skrll static inline int _rtld_relocate_plt_object(const Obj_Entry *,
143 1.36 skrll const Elf_Rela *, Elf_Addr *);
144 1.13 mycroft
145 1.13 mycroft void
146 1.13 mycroft _rtld_setup_pltgot(const Obj_Entry *obj)
147 1.13 mycroft {
148 1.13 mycroft /*
149 1.13 mycroft * PLTGOT is the PLT on the sparc.
150 1.13 mycroft * The first entry holds the call the dynamic linker.
151 1.13 mycroft * We construct a `call' sequence that transfers
152 1.13 mycroft * to `_rtld_bind_start()'.
153 1.13 mycroft * The second entry holds the object identification.
154 1.13 mycroft * Note: each PLT entry is three words long.
155 1.13 mycroft */
156 1.30 mycroft #define SAVE 0x9de3bfa0 /* i.e. `save %sp,-96,%sp' */
157 1.13 mycroft #define CALL 0x40000000
158 1.13 mycroft #define NOP 0x01000000
159 1.13 mycroft obj->pltgot[0] = SAVE;
160 1.13 mycroft obj->pltgot[1] = CALL |
161 1.13 mycroft ((Elf_Addr) &_rtld_bind_start - (Elf_Addr) &obj->pltgot[1]) >> 2;
162 1.13 mycroft obj->pltgot[2] = NOP;
163 1.13 mycroft obj->pltgot[3] = (Elf_Addr) obj;
164 1.13 mycroft }
165 1.13 mycroft
166 1.24 mycroft void
167 1.33 skrll _rtld_relocate_nonplt_self(Elf_Dyn *dynp, Elf_Addr relocbase)
168 1.24 mycroft {
169 1.24 mycroft const Elf_Rela *rela = 0, *relalim;
170 1.24 mycroft Elf_Addr relasz = 0;
171 1.24 mycroft Elf_Addr *where;
172 1.24 mycroft
173 1.24 mycroft for (; dynp->d_tag != DT_NULL; dynp++) {
174 1.24 mycroft switch (dynp->d_tag) {
175 1.24 mycroft case DT_RELA:
176 1.24 mycroft rela = (const Elf_Rela *)(relocbase + dynp->d_un.d_ptr);
177 1.24 mycroft break;
178 1.24 mycroft case DT_RELASZ:
179 1.24 mycroft relasz = dynp->d_un.d_val;
180 1.24 mycroft break;
181 1.24 mycroft }
182 1.24 mycroft }
183 1.24 mycroft relalim = (const Elf_Rela *)((caddr_t)rela + relasz);
184 1.24 mycroft for (; rela < relalim; rela++) {
185 1.24 mycroft where = (Elf_Addr *)(relocbase + rela->r_offset);
186 1.24 mycroft *where += (Elf_Addr)(relocbase + rela->r_addend);
187 1.24 mycroft }
188 1.24 mycroft }
189 1.24 mycroft
190 1.13 mycroft int
191 1.33 skrll _rtld_relocate_nonplt_objects(const Obj_Entry *obj)
192 1.1 christos {
193 1.14 mycroft const Elf_Rela *rela;
194 1.24 mycroft
195 1.14 mycroft for (rela = obj->rela; rela < obj->relalim; rela++) {
196 1.14 mycroft Elf_Addr *where;
197 1.14 mycroft Elf_Word type, value, mask;
198 1.14 mycroft const Elf_Sym *def = NULL;
199 1.14 mycroft const Obj_Entry *defobj = NULL;
200 1.15 mycroft unsigned long symnum;
201 1.14 mycroft
202 1.14 mycroft where = (Elf_Addr *) (obj->relocbase + rela->r_offset);
203 1.15 mycroft symnum = ELF_R_SYM(rela->r_info);
204 1.14 mycroft
205 1.14 mycroft type = ELF_R_TYPE(rela->r_info);
206 1.14 mycroft if (type == R_TYPE(NONE))
207 1.17 mycroft continue;
208 1.14 mycroft
209 1.27 mycroft /* We do JMP_SLOTs in _rtld_bind() below */
210 1.14 mycroft if (type == R_TYPE(JMP_SLOT))
211 1.17 mycroft continue;
212 1.14 mycroft
213 1.14 mycroft /* COPY relocs are also handled elsewhere */
214 1.14 mycroft if (type == R_TYPE(COPY))
215 1.17 mycroft continue;
216 1.1 christos
217 1.14 mycroft /*
218 1.14 mycroft * We use the fact that relocation types are an `enum'
219 1.14 mycroft * Note: R_SPARC_6 is currently numerically largest.
220 1.14 mycroft */
221 1.14 mycroft if (type > R_TYPE(6))
222 1.14 mycroft return (-1);
223 1.4 pk
224 1.14 mycroft value = rela->r_addend;
225 1.1 christos
226 1.14 mycroft /*
227 1.24 mycroft * Handle relative relocs here, as an optimization.
228 1.14 mycroft */
229 1.22 mycroft if (type == R_TYPE(RELATIVE)) {
230 1.24 mycroft *where += (Elf_Addr)(obj->relocbase + value);
231 1.26 mycroft rdbg(("RELATIVE in %s --> %p", obj->path,
232 1.24 mycroft (void *)*where));
233 1.17 mycroft continue;
234 1.14 mycroft }
235 1.1 christos
236 1.14 mycroft if (RELOC_RESOLVE_SYMBOL(type)) {
237 1.1 christos
238 1.14 mycroft /* Find the symbol */
239 1.15 mycroft def = _rtld_find_symdef(symnum, obj, &defobj, false);
240 1.14 mycroft if (def == NULL)
241 1.14 mycroft return (-1);
242 1.1 christos
243 1.14 mycroft /* Add in the symbol's absolute address */
244 1.14 mycroft value += (Elf_Word)(defobj->relocbase + def->st_value);
245 1.14 mycroft }
246 1.1 christos
247 1.14 mycroft if (RELOC_PC_RELATIVE(type)) {
248 1.14 mycroft value -= (Elf_Word)where;
249 1.14 mycroft }
250 1.2 pk
251 1.14 mycroft if (RELOC_BASE_RELATIVE(type)) {
252 1.14 mycroft /*
253 1.14 mycroft * Note that even though sparcs use `Elf_rela'
254 1.14 mycroft * exclusively we still need the implicit memory addend
255 1.14 mycroft * in relocations referring to GOT entries.
256 1.14 mycroft * Undoubtedly, someone f*cked this up in the distant
257 1.14 mycroft * past, and now we're stuck with it in the name of
258 1.14 mycroft * compatibility for all eternity..
259 1.14 mycroft *
260 1.14 mycroft * In any case, the implicit and explicit should be
261 1.14 mycroft * mutually exclusive. We provide a check for that
262 1.14 mycroft * here.
263 1.14 mycroft */
264 1.5 pk #define DIAGNOSTIC
265 1.5 pk #ifdef DIAGNOSTIC
266 1.14 mycroft if (value != 0 && *where != 0) {
267 1.14 mycroft xprintf("BASE_REL(%s): where=%p, *where 0x%x, "
268 1.14 mycroft "addend=0x%x, base %p\n",
269 1.14 mycroft obj->path, where, *where,
270 1.14 mycroft rela->r_addend, obj->relocbase);
271 1.14 mycroft }
272 1.14 mycroft #endif
273 1.14 mycroft value += (Elf_Word)(obj->relocbase + *where);
274 1.5 pk }
275 1.1 christos
276 1.14 mycroft mask = RELOC_VALUE_BITMASK(type);
277 1.14 mycroft value >>= RELOC_VALUE_RIGHTSHIFT(type);
278 1.14 mycroft value &= mask;
279 1.14 mycroft
280 1.34 martin if (RELOC_UNALIGNED(type)) {
281 1.34 martin /* Handle unaligned relocations. */
282 1.34 martin Elf_Addr tmp = 0;
283 1.34 martin char *ptr = (char *)where;
284 1.34 martin int i, size = RELOC_TARGET_SIZE(type)/8;
285 1.34 martin
286 1.34 martin /* Read it in one byte at a time. */
287 1.34 martin for (i=0; i<size; i++)
288 1.34 martin tmp = (tmp << 8) | ptr[i];
289 1.34 martin
290 1.34 martin tmp &= ~mask;
291 1.34 martin tmp |= value;
292 1.34 martin
293 1.34 martin /* Write it back out. */
294 1.34 martin for (i=0; i<size; i++)
295 1.34 martin ptr[i] = ((tmp >> (8*i)) & 0xff);
296 1.34 martin #ifdef RTLD_DEBUG_RELOC
297 1.34 martin value = (Elf_Word)tmp;
298 1.34 martin #endif
299 1.34 martin
300 1.34 martin } else {
301 1.34 martin *where &= ~mask;
302 1.34 martin *where |= value;
303 1.34 martin #ifdef RTLD_DEBUG_RELOC
304 1.34 martin value = (Elf_Word)*where;
305 1.34 martin #endif
306 1.34 martin }
307 1.1 christos #ifdef RTLD_DEBUG_RELOC
308 1.14 mycroft if (RELOC_RESOLVE_SYMBOL(type)) {
309 1.26 mycroft rdbg(("%s %s in %s --> %p in %s", reloc_names[type],
310 1.16 mycroft obj->strtab + obj->symtab[symnum].st_name,
311 1.34 martin obj->path, (void *)value, defobj->path));
312 1.16 mycroft } else {
313 1.26 mycroft rdbg(("%s in %s --> %p", reloc_names[type],
314 1.34 martin obj->path, (void *)value));
315 1.14 mycroft }
316 1.14 mycroft #endif
317 1.1 christos }
318 1.18 mycroft return (0);
319 1.18 mycroft }
320 1.18 mycroft
321 1.18 mycroft int
322 1.33 skrll _rtld_relocate_plt_lazy(const Obj_Entry *obj)
323 1.18 mycroft {
324 1.1 christos return (0);
325 1.27 mycroft }
326 1.27 mycroft
327 1.27 mycroft caddr_t
328 1.33 skrll _rtld_bind(const Obj_Entry *obj, Elf_Word reloff)
329 1.27 mycroft {
330 1.27 mycroft const Elf_Rela *rela = (const Elf_Rela *)((caddr_t)obj->pltrela + reloff);
331 1.35 martin Elf_Addr value;
332 1.35 martin int err;
333 1.35 martin
334 1.39 mrg value = 0; /* XXX gcc */
335 1.39 mrg
336 1.35 martin err = _rtld_relocate_plt_object(obj, rela, &value);
337 1.35 martin if (err)
338 1.35 martin _rtld_die();
339 1.35 martin
340 1.35 martin return (caddr_t)value;
341 1.35 martin }
342 1.35 martin
343 1.35 martin int
344 1.35 martin _rtld_relocate_plt_objects(const Obj_Entry *obj)
345 1.35 martin {
346 1.35 martin const Elf_Rela *rela = obj->pltrela;
347 1.35 martin
348 1.35 martin for (; rela < obj->pltrelalim; rela++)
349 1.35 martin if (_rtld_relocate_plt_object(obj, rela, NULL) < 0)
350 1.35 martin return -1;
351 1.35 martin
352 1.35 martin return 0;
353 1.35 martin }
354 1.35 martin
355 1.35 martin static inline int
356 1.35 martin _rtld_relocate_plt_object(const Obj_Entry *obj, const Elf_Rela *rela, Elf_Addr *tp)
357 1.35 martin {
358 1.27 mycroft const Elf_Sym *def;
359 1.27 mycroft const Obj_Entry *defobj;
360 1.28 mycroft Elf_Word *where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
361 1.27 mycroft Elf_Addr value;
362 1.27 mycroft
363 1.27 mycroft /* Fully resolve procedure addresses now */
364 1.27 mycroft
365 1.27 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
366 1.27 mycroft
367 1.27 mycroft def = _rtld_find_symdef(ELF_R_SYM(rela->r_info), obj, &defobj, true);
368 1.27 mycroft if (def == NULL)
369 1.35 martin return -1;
370 1.27 mycroft
371 1.27 mycroft value = (Elf_Addr)(defobj->relocbase + def->st_value);
372 1.31 mycroft rdbg(("bind now/fixup in %s --> new=%p",
373 1.31 mycroft defobj->strtab + def->st_name, (void *)value));
374 1.27 mycroft
375 1.27 mycroft /*
376 1.27 mycroft * At the PLT entry pointed at by `where', we now construct
377 1.27 mycroft * a direct transfer to the now fully resolved function
378 1.27 mycroft * address. The resulting code in the jump slot is:
379 1.27 mycroft *
380 1.27 mycroft * sethi %hi(roffset), %g1
381 1.27 mycroft * sethi %hi(addr), %g1
382 1.27 mycroft * jmp %g1+%lo(addr)
383 1.27 mycroft *
384 1.27 mycroft * We write the third instruction first, since that leaves the
385 1.27 mycroft * previous `b,a' at the second word in place. Hence the whole
386 1.27 mycroft * PLT slot can be atomically change to the new sequence by
387 1.27 mycroft * writing the `sethi' instruction at word 2.
388 1.27 mycroft */
389 1.27 mycroft #define SETHI 0x03000000
390 1.27 mycroft #define JMP 0x81c06000
391 1.27 mycroft #define NOP 0x01000000
392 1.27 mycroft where[2] = JMP | (value & 0x000003ff);
393 1.27 mycroft where[1] = SETHI | ((value >> 10) & 0x003fffff);
394 1.38 perry __asm volatile("iflush %0+8" : : "r" (where));
395 1.38 perry __asm volatile("iflush %0+4" : : "r" (where));
396 1.27 mycroft
397 1.35 martin if (tp)
398 1.35 martin *tp = value;
399 1.35 martin
400 1.35 martin return 0;
401 1.1 christos }
402