Home | History | Annotate | Line # | Download | only in hppa
hppa_reloc.c revision 1.1
      1 /*	$NetBSD: hppa_reloc.c,v 1.1 2002/07/10 15:12:38 fredette Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 2002 The NetBSD Foundation, Inc.
      5  * All rights reserved.
      6  *
      7  * This code is derived from software contributed to The NetBSD Foundation
      8  * by Matt Fredette.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *        This product includes software developed by the NetBSD
     21  *        Foundation, Inc. and its contributors.
     22  * 4. Neither the name of The NetBSD Foundation nor the names of its
     23  *    contributors may be used to endorse or promote products derived
     24  *    from this software without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     27  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     28  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     29  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     30  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     31  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     32  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     33  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     34  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     35  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     36  * POSSIBILITY OF SUCH DAMAGE.
     37  */
     38 
     39 #include <stdlib.h>
     40 #include <sys/types.h>
     41 #include <sys/stat.h>
     42 #include <sys/queue.h>
     43 
     44 #include "rtld.h"
     45 #include "debug.h"
     46 
     47 #ifdef RTLD_DEBUG_HPPA
     48 #define	hdbg(x)		if (dodebug) xprintf x
     49 #else
     50 #define	hdbg(x)		/* nothing */
     51 #endif
     52 
     53 /*
     54  * In the runtime architecture (ABI), PLABEL function
     55  * pointers are distinguished from normal function
     56  * pointers by having the next-least-significant bit
     57  * set.  (This bit is referred to as the L field in
     58  * HP documentation).  The $$dyncall millicode is
     59  * aware of this.
     60  */
     61 #define	RTLD_MAKE_PLABEL(plabel)	(((Elf_Addr)(plabel)) | (1 << 1))
     62 #define RTLD_IS_PLABEL(addr)		(((Elf_Addr)(addr)) & (1 << 1))
     63 #define	RTLD_GET_PLABEL(addr)	((hppa_plabel *) (((Elf_Addr)addr) & ~3))
     64 
     65 /*
     66  * This is the PLABEL structure.  The function PC and
     67  * shared linkage members must come first, as they are
     68  * the actual PLABEL.
     69  */
     70 typedef struct _hppa_plabel {
     71 	Elf_Addr	hppa_plabel_pc;
     72 	Elf_Addr	hppa_plabel_sl;
     73 	SLIST_ENTRY(_hppa_plabel)	hppa_plabel_next;
     74 } hppa_plabel;
     75 
     76 /*
     77  * For now allocated PLABEL structures are tracked on a
     78  * singly linked list.  This maybe should be revisited.
     79  */
     80 static SLIST_HEAD(hppa_plabel_head, _hppa_plabel) hppa_plabel_list
     81     = SLIST_HEAD_INITIALIZER(hppa_plabel_list);
     82 
     83 /*
     84  * Because I'm hesitant to use NEW while relocating self,
     85  * this is a small pool of preallocated PLABELs.
     86  */
     87 #define	HPPA_PLABEL_PRE	(10)
     88 static hppa_plabel hppa_plabel_pre[HPPA_PLABEL_PRE];
     89 static int hppa_plabel_pre_next = 0;
     90 
     91 /*
     92  * The DT_PLTGOT _DYNAMIC entry always gives the linkage table
     93  * pointer for an object.  This is often, but not always, the
     94  * same as the object's value for _GLOBAL_OFFSET_TABLE_.  We
     95  * cache one object's GOT value, otherwise we look it up.
     96  * XXX it would be nice to be able to keep this in the Obj_Entry.
     97  */
     98 static const Obj_Entry *hppa_got_cache_obj = NULL;
     99 static Elf_Addr *hppa_got_cache_got;
    100 #define HPPA_OBJ_SL(obj)	((obj)->pltgot)
    101 #define	HPPA_OBJ_GOT(obj)	((obj) == hppa_got_cache_obj ?		\
    102 				  hppa_got_cache_got :			\
    103 				  _rtld_fill_hppa_got_cache(obj))
    104 static Elf_Addr *_rtld_fill_hppa_got_cache __P((const Obj_Entry *));
    105 
    106 /*
    107  * This bootstraps the dynamic linker by relocating its GOT.
    108  * On the hppa, unlike on other architectures, static strings
    109  * are found through the GOT.  Static strings are essential
    110  * for RTLD_DEBUG, and I suspect they're used early even when
    111  * !defined(RTLD_DEBUG), making relocating the GOT essential.
    112  *
    113  * It gets worse.  Relocating the GOT doesn't mean just walking
    114  * it and adding the relocbase to all of the entries.  You must
    115  * find and use the GOT relocations, since those RELA relocations
    116  * have the necessary addends - the GOT comes initialized as
    117  * zeroes.
    118  */
    119 void
    120 _rtld_bootstrap_hppa_got(Elf_Dyn *dynp, Elf_Addr relocbase,
    121     Elf_Addr got_begin, Elf_Addr got_end)
    122 {
    123 	const Elf_Rela	*relafirst, *rela, *relalim;
    124 	Elf_Addr        relasz = 0;
    125 	Elf_Addr	where;
    126 
    127 	/*
    128 	 * Process the DYNAMIC section, looking for the non-PLT
    129 	 * relocations.
    130 	 */
    131 	relafirst = NULL;
    132 	for (; dynp->d_tag != DT_NULL; ++dynp) {
    133 		switch (dynp->d_tag) {
    134 
    135 		case DT_RELA:
    136 			relafirst = (const Elf_Rela *)
    137 			    (relocbase + dynp->d_un.d_ptr);
    138 			break;
    139 
    140 		case DT_RELASZ:
    141 			relasz = dynp->d_un.d_val;
    142 			break;
    143 		}
    144 	}
    145 	relalim = (const Elf_Rela *)((caddr_t)relafirst + relasz);
    146 
    147 	/*
    148 	 * Process all relocations that look like they're in
    149 	 * the GOT.
    150 	 */
    151 	for(rela = relafirst; rela < relalim; rela++) {
    152 		where = (Elf_Addr)(relocbase + rela->r_offset);
    153 		if (where >= got_begin && where < got_end)
    154 			*((Elf_Addr *)where) = relocbase + rela->r_addend;
    155 	}
    156 
    157 #if defined(RTLD_DEBUG_HPPA)
    158 	for(rela = relafirst; rela < relalim; rela++) {
    159 		where = (Elf_Addr)(relocbase + rela->r_offset);
    160 		if (where >= got_begin && where < got_end)
    161 			xprintf("GOT rela @%p(%p) -> %p(%p)\n",
    162 			    (void *)rela->r_offset,
    163 			    (void *)where,
    164 			    (void *)rela->r_addend,
    165 			    (void *)*((Elf_Addr *)where));
    166 	}
    167 #endif /* RTLD_DEBUG_HPPA */
    168 }
    169 
    170 /*
    171  * This looks up the object's _GLOBAL_OFFSET_TABLE_
    172  * and caches the result.
    173  */
    174 static Elf_Addr *
    175 _rtld_fill_hppa_got_cache(const Obj_Entry *obj)
    176 {
    177 	const char *name = "_GLOBAL_OFFSET_TABLE_";
    178 	unsigned long hash;
    179 	const Elf_Sym *def;
    180 
    181 	hash = _rtld_elf_hash(name);
    182 	def = _rtld_symlook_obj(name, hash, obj, true);
    183 	assert(def != NULL);
    184 	hppa_got_cache_obj = obj;
    185 	return hppa_got_cache_got =
    186 	    (Elf_Addr *)(obj->relocbase + def->st_value);
    187 }
    188 
    189 /* This sets up an object's GOT. */
    190 void
    191 _rtld_setup_hppa_pltgot(const Obj_Entry *obj)
    192 {
    193 	__rtld_setup_hppa_pltgot(obj, HPPA_OBJ_GOT(obj));
    194 }
    195 
    196 /*
    197  * This allocates a PLABEL.  If called with a non-NULL def, the
    198  * plabel is for the function associated with that definition
    199  * in the defining object defobj, plus the given addend.  If
    200  * called with a NULL def, the plabel is for the function at
    201  * the (unrelocated) address in addend in the object defobj.
    202  */
    203 Elf_Addr
    204 _rtld_function_descriptor_alloc(const Obj_Entry *defobj, const Elf_Sym *def,
    205     Elf_Addr addend)
    206 {
    207 	Elf_Addr	func_pc, func_sl;
    208 	hppa_plabel	*plabel;
    209 
    210 	if (def != NULL) {
    211 
    212 		/*
    213 		 * We assume that symbols of type STT_NOTYPE
    214 		 * are undefined.  Return NULL for these.
    215 		 */
    216 		if (ELF_ST_TYPE(def->st_info) == STT_NOTYPE)
    217 			return (Elf_Addr)NULL;
    218 
    219 		/* Otherwise assert that this symbol must be a function. */
    220 		assert(ELF_ST_TYPE(def->st_info) == STT_FUNC);
    221 
    222 		func_pc = (Elf_Addr)(defobj->relocbase + def->st_value +
    223 		    addend);
    224 	} else
    225 		func_pc = (Elf_Addr)(defobj->relocbase + addend);
    226 
    227 	/*
    228 	 * Search the existing PLABELs for one matching
    229 	 * this function.  If there is one, return it.
    230 	 */
    231 	func_sl = (Elf_Addr)HPPA_OBJ_SL(defobj);
    232 	SLIST_FOREACH(plabel, &hppa_plabel_list, hppa_plabel_next)
    233 		if (plabel->hppa_plabel_pc == func_pc &&
    234 		    plabel->hppa_plabel_sl == func_sl)
    235 			return RTLD_MAKE_PLABEL(plabel);
    236 
    237 	/*
    238 	 * XXX - this assumes that the dynamic linker doesn't
    239 	 * have more than HPPA_PLABEL_PRE PLABEL relocations.
    240 	 * Once we've used up the preallocated set, we start
    241 	 * using NEW to allocate plabels.
    242 	 */
    243 	if (hppa_plabel_pre_next < HPPA_PLABEL_PRE)
    244 		plabel = &hppa_plabel_pre[hppa_plabel_pre_next++];
    245 	else {
    246 		plabel = NEW(hppa_plabel);
    247 		if (plabel == NULL)
    248 			return (Elf_Addr)-1;
    249 	}
    250 
    251 	/* Fill the new entry and insert it on the list. */
    252 	plabel->hppa_plabel_pc = func_pc;
    253 	plabel->hppa_plabel_sl = func_sl;
    254 	SLIST_INSERT_HEAD(&hppa_plabel_list, plabel, hppa_plabel_next);
    255 
    256 	return RTLD_MAKE_PLABEL(plabel);
    257 }
    258 
    259 /*
    260  * If a pointer is a PLABEL, this unwraps it.
    261  */
    262 const void *
    263 _rtld_function_descriptor_function(const void *addr)
    264 {
    265 	return (RTLD_IS_PLABEL(addr) ?
    266 	    (const void *) RTLD_GET_PLABEL(addr)->hppa_plabel_pc :
    267 	    addr);
    268 }
    269 
    270 /*
    271  * This handles an IPLT relocation, with or without a symbol.
    272  */
    273 int
    274 _rtld_relocate_plt_object(Obj_Entry *obj, const Elf_Rela *rela, caddr_t *addrp,
    275     bool bind_now, bool dodebug)
    276 {
    277 	Elf_Addr	*where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
    278 	const Elf_Sym	*def;
    279 	const Obj_Entry	*defobj;
    280 	Elf_Addr	func_pc, func_sl;
    281 
    282 	assert(ELF_R_TYPE(rela->r_info) == R_TYPE(IPLT));
    283 
    284 	/*
    285 	 * If this is an IPLT reloc for a static function,
    286 	 * fully resolve the PLT entry now.
    287 	 */
    288 	if (ELF_R_SYM(rela->r_info) == 0) {
    289 		func_pc = (Elf_Addr)(obj->relocbase + rela->r_addend);
    290 		func_sl = (Elf_Addr)HPPA_OBJ_SL(obj);
    291 	}
    292 
    293 	/*
    294 	 * If we must bind now, fully resolve the PLT entry.
    295 	 */
    296 	else if (bind_now) {
    297 
    298 		/*
    299 		 * Look up the symbol.  While we're relocating self,
    300 		 * _rtld_objlist is NULL, so just pass in self.
    301 		 */
    302 		def = _rtld_find_symdef((_rtld_objlist == NULL ?
    303 				    obj : _rtld_objlist), rela->r_info,
    304 				    NULL, obj, &defobj, false);
    305 		if (def == NULL)
    306 			return -1;
    307 		func_pc = (Elf_Addr)(defobj->relocbase + def->st_value +
    308 		    rela->r_addend);
    309 		func_sl = (Elf_Addr)HPPA_OBJ_SL(defobj);
    310 	}
    311 
    312 	/*
    313 	 * Otherwise set up for lazy binding.
    314 	 */
    315 	else {
    316 
    317 		/*
    318 		 * This function pointer points to the PLT
    319 		 * stub added by the linker, and instead of
    320 		 * a shared linkage value, we stash this
    321 		 * relocation's offset.  The PLT stub has
    322 		 * already been set up to transfer to
    323 		 * _rtld_bind_start.
    324 		 */
    325 		func_pc = ((Elf_Addr)HPPA_OBJ_GOT(obj)) - 16;
    326 		func_sl = (Elf_Addr)((caddr_t)rela - (caddr_t)obj->pltrela);
    327 	}
    328 
    329 	/*
    330 	 * Fill this PLT entry and return.
    331 	 */
    332 	where[0] = func_pc;
    333 	where[1] = func_sl;
    334 	if (addrp != NULL)
    335 		*addrp = (caddr_t)where;
    336 	return 0;
    337 }
    338