WebSVN – HelenOS – Diff – /branches/dynload/uspace/lib/rtld/dynamic.c


/*
 * Copyright (c) 2008 Jiri Svoboda
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup rtld rtld
 * @brief
 * @{
 */
/**
 * @file
 */
 
#include <stdio.h>
#include <string.h>
 
#include <elf_dyn.h>
#include <dynamic.h>
#include <rtld.h>
 
void dynamic_parse(elf_dyn_t *dyn_ptr, size_t bias, dyn_info_t *info)
{
    elf_dyn_t *dp = dyn_ptr;
 
    void *d_ptr;
    elf_word d_val;
 
    elf_word soname_idx;
    elf_word rpath_idx;
 
    DPRINTF("memset\n");
    memset(info, 0, sizeof(info));
 
    soname_idx = 0;
    rpath_idx = 0;
 
    DPRINTF("pass 1\n");
    while (dp->d_tag != DT_NULL) {
        d_ptr = (void *)((uint8_t *)dp->d_un.d_ptr + bias);
        d_val = dp->d_un.d_val;
 
        switch (dp->d_tag) {
 
        case DT_PLTRELSZ:   info->plt_rel_sz = d_val; break;
        case DT_PLTGOT:     info->plt_got = d_ptr; break;
        case DT_HASH:       info->hash = d_ptr; break;
        case DT_STRTAB:     info->str_tab = d_ptr; break;
        case DT_SYMTAB:     info->sym_tab = d_ptr; break;
        case DT_RELA:       info->rela = d_ptr; break;
        case DT_RELASZ:     info->rela_sz = d_val; break;
        case DT_RELAENT:    info->rela_ent = d_val; break;
        case DT_STRSZ:      info->str_sz = d_val; break;
        case DT_SYMENT:     info->sym_ent = d_val; break;
        case DT_INIT:       info->init = d_ptr; break;
        case DT_FINI:       info->fini = d_ptr; break;
        case DT_SONAME:     soname_idx = d_val; break;
        case DT_RPATH:      rpath_idx = d_val; break;
        case DT_SYMBOLIC:   info->symbolic = true; break;
        case DT_REL:        info->rel = d_ptr; break;
        case DT_RELSZ:      info->rel_sz = d_val; break;
        case DT_RELENT:     info->rel_ent = d_val; break;
        case DT_PLTREL:     info->plt_rel = d_val; break;
        case DT_TEXTREL:    info->text_rel = true; break;
        case DT_JMPREL:     info->jmp_rel = d_ptr; break;
        case DT_BIND_NOW:   info->bind_now = true; break;
 
        default:
            if (dp->d_tag >= DT_LOPROC && dp->d_tag <= DT_HIPROC)
                dyn_parse_arch(dp, bias, info);
            break;
        }
 
        ++dp;
    }
 
    info->soname = info->str_tab + soname_idx;
    info->rpath = info->str_tab + rpath_idx;
 
    /* This will be useful for parsing dependencies later */
    info->dynamic = dyn_ptr;
 
    DPRINTF("str_tab=0x%x, soname_idx=0x%x, soname=0x%x\n",
        (uintptr_t)info->soname, soname_idx, (uintptr_t)info->soname);
    DPRINTF("soname='%s'\n", info->soname);
    DPRINTF("rpath='%s'\n", info->rpath);
    DPRINTF("hash=0x%x\n", (uintptr_t)info->hash);
 
    /*
     * Now that we have a pointer to the string table,
     * we can parse DT_NEEDED fields (which contain offsets into it).
     */
 
    DPRINTF("pass 2\n");
    dp = dyn_ptr;
    while (dp->d_tag != DT_NULL) {
        d_val = dp->d_un.d_val;
 
        switch (dp->d_tag) {
        case DT_NEEDED:
            /* Assume just for now there's only one dependency */
            info->needed = info->str_tab + d_val;
            DPRINTF("needed:'%s'\n", info->needed);
            break;
 
        default: break;
        }
 
        ++dp;
    }
}
 
/** @}
 */
 

Subversion Repositories HelenOS

(root)/branches/dynload/uspace/lib/rtld/dynamic.c – Rev 3562 → 3772

Rev 3562		Rev 3772
1	/*	1	/*
2	* Copyright (c) 2008 Jiri Svoboda	2	* Copyright (c) 2008 Jiri Svoboda
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/** @addtogroup rtld rtld	29	/** @addtogroup rtld rtld
30	* @brief	30	* @brief
31	* @{	31	* @{
32	*/	32	*/
33	/**	33	/**
34	* @file	34	* @file
35	*/	35	*/
36		36
37	#include <stdio.h>	37	#include <stdio.h>
38	#include <string.h>	38	#include <string.h>
39		39
40	#include <elf_dyn.h>	40	#include <elf_dyn.h>
41	#include <dynamic.h>	41	#include <dynamic.h>
42	#include <rtld.h>	42	#include <rtld.h>
43		43
44	void dynamic_parse(elf_dyn_t dyn_ptr, size_t bias, dyn_info_t info)	44	void dynamic_parse(elf_dyn_t dyn_ptr, size_t bias, dyn_info_t info)
45	{	45	{
46	elf_dyn_t *dp = dyn_ptr;	46	elf_dyn_t *dp = dyn_ptr;
47		47
48	void *d_ptr;	48	void *d_ptr;
49	elf_word d_val;	49	elf_word d_val;
50		50
51	elf_word soname_idx;	51	elf_word soname_idx;
52	elf_word rpath_idx;	52	elf_word rpath_idx;
53		53
54	DPRINTF("memset\n");	54	DPRINTF("memset\n");
55	memset(info, 0, sizeof(info));	55	memset(info, 0, sizeof(info));
56		56
57	soname_idx = 0;	57	soname_idx = 0;
58	rpath_idx = 0;	58	rpath_idx = 0;
59		59
60	DPRINTF("pass 1\n");	60	DPRINTF("pass 1\n");
61	while (dp->d_tag != DT_NULL) {	61	while (dp->d_tag != DT_NULL) {
62	d_ptr = (void )((uint8_t )dp->d_un.d_ptr + bias);	62	d_ptr = (void )((uint8_t )dp->d_un.d_ptr + bias);
63	d_val = dp->d_un.d_val;	63	d_val = dp->d_un.d_val;
64		64
65	switch (dp->d_tag) {	65	switch (dp->d_tag) {
66		66
67	case DT_PLTRELSZ: info->plt_rel_sz = d_val; break;	67	case DT_PLTRELSZ: info->plt_rel_sz = d_val; break;
68	case DT_PLTGOT: info->plt_got = d_ptr; break;	68	case DT_PLTGOT: info->plt_got = d_ptr; break;
69	case DT_HASH: info->hash = d_ptr; break;	69	case DT_HASH: info->hash = d_ptr; break;
70	case DT_STRTAB: info->str_tab = d_ptr; break;	70	case DT_STRTAB: info->str_tab = d_ptr; break;
71	case DT_SYMTAB: info->sym_tab = d_ptr; break;	71	case DT_SYMTAB: info->sym_tab = d_ptr; break;
72	case DT_RELA: info->rela = d_ptr; break;	72	case DT_RELA: info->rela = d_ptr; break;
73	case DT_RELASZ: info->rela_sz = d_val; break;	73	case DT_RELASZ: info->rela_sz = d_val; break;
74	case DT_RELAENT: info->rela_ent = d_val; break;	74	case DT_RELAENT: info->rela_ent = d_val; break;
75	case DT_STRSZ: info->str_sz = d_val; break;	75	case DT_STRSZ: info->str_sz = d_val; break;
76	case DT_SYMENT: info->sym_ent = d_val; break;	76	case DT_SYMENT: info->sym_ent = d_val; break;
77	case DT_INIT: info->init = d_ptr; break;	77	case DT_INIT: info->init = d_ptr; break;
78	case DT_FINI: info->fini = d_ptr; break;	78	case DT_FINI: info->fini = d_ptr; break;
79	case DT_SONAME: soname_idx = d_val; break;	79	case DT_SONAME: soname_idx = d_val; break;
80	case DT_RPATH: rpath_idx = d_val; break;	80	case DT_RPATH: rpath_idx = d_val; break;
81	case DT_SYMBOLIC: info->symbolic = true; break;	81	case DT_SYMBOLIC: info->symbolic = true; break;
82	case DT_REL: info->rel = d_ptr; break;	82	case DT_REL: info->rel = d_ptr; break;
83	case DT_RELSZ: info->rel_sz = d_val; break;	83	case DT_RELSZ: info->rel_sz = d_val; break;
84	case DT_RELENT: info->rel_ent = d_val; break;	84	case DT_RELENT: info->rel_ent = d_val; break;
85	case DT_PLTREL: info->plt_rel = d_val; break;	85	case DT_PLTREL: info->plt_rel = d_val; break;
86	case DT_TEXTREL: info->text_rel = true; break;	86	case DT_TEXTREL: info->text_rel = true; break;
87	case DT_JMPREL: info->jmp_rel = d_ptr; break;	87	case DT_JMPREL: info->jmp_rel = d_ptr; break;
88	case DT_BIND_NOW: info->bind_now = true; break;	88	case DT_BIND_NOW: info->bind_now = true; break;
89		89
90	default: break;	90	default:
-		91	if (dp->d_tag >= DT_LOPROC && dp->d_tag <= DT_HIPROC)
-		92	dyn_parse_arch(dp, bias, info);
-		93	break;
91	}	94	}
92		95
93	++dp;	96	++dp;
94	}	97	}
95		98
96	info->soname = info->str_tab + soname_idx;	99	info->soname = info->str_tab + soname_idx;
97	info->rpath = info->str_tab + rpath_idx;	100	info->rpath = info->str_tab + rpath_idx;
98		101
99	/* This will be useful for parsing dependencies later */	102	/* This will be useful for parsing dependencies later */
100	info->dynamic = dyn_ptr;	103	info->dynamic = dyn_ptr;
101		104
102	DPRINTF("str_tab=0x%x, soname_idx=0x%x, soname=0x%x\n",	105	DPRINTF("str_tab=0x%x, soname_idx=0x%x, soname=0x%x\n",
103	(uintptr_t)info->soname, soname_idx, (uintptr_t)info->soname);	106	(uintptr_t)info->soname, soname_idx, (uintptr_t)info->soname);
104	DPRINTF("soname='%s'\n", info->soname);	107	DPRINTF("soname='%s'\n", info->soname);
105	DPRINTF("rpath='%s'\n", info->rpath);	108	DPRINTF("rpath='%s'\n", info->rpath);
106	DPRINTF("hash=0x%x\n", (uintptr_t)info->hash);	109	DPRINTF("hash=0x%x\n", (uintptr_t)info->hash);
107		110
108	/*	111	/*
109	* Now that we have a pointer to the string table,	112	* Now that we have a pointer to the string table,
110	* we can parse DT_NEEDED fields (which contain offsets into it).	113	* we can parse DT_NEEDED fields (which contain offsets into it).
111	*/	114	*/
112		115
113	DPRINTF("pass 2\n");	116	DPRINTF("pass 2\n");
114	dp = dyn_ptr;	117	dp = dyn_ptr;
115	while (dp->d_tag != DT_NULL) {	118	while (dp->d_tag != DT_NULL) {
116	d_val = dp->d_un.d_val;	119	d_val = dp->d_un.d_val;
117		120
118	switch (dp->d_tag) {	121	switch (dp->d_tag) {
119	case DT_NEEDED:	122	case DT_NEEDED:
120	/* Assume just for now there's only one dependency */	123	/* Assume just for now there's only one dependency */
121	info->needed = info->str_tab + d_val;	124	info->needed = info->str_tab + d_val;
122	DPRINTF("needed:'%s'\n", info->needed);	125	DPRINTF("needed:'%s'\n", info->needed);
123	break;	126	break;
124		127
125	default: break;	128	default: break;
126	}	129	}
127		130
128	++dp;	131	++dp;
129	}	132	}
130	}	133	}
131		134
132	/** @}	135	/** @}
133	*/	136	*/
134		137