2012-08-27 01:09:26 +00:00
|
|
|
#define _GNU_SOURCE
|
2011-06-18 23:48:42 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <elf.h>
|
|
|
|
#include <sys/mman.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <elf.h>
|
2012-11-01 01:27:48 +00:00
|
|
|
#include <link.h>
|
2011-06-26 21:39:17 +00:00
|
|
|
#include <setjmp.h>
|
2011-06-26 23:23:28 +00:00
|
|
|
#include <pthread.h>
|
2011-08-16 04:24:36 +00:00
|
|
|
#include <ctype.h>
|
2011-06-26 23:23:28 +00:00
|
|
|
#include <dlfcn.h>
|
2012-10-04 20:35:46 +00:00
|
|
|
#include "pthread_impl.h"
|
|
|
|
#include "libc.h"
|
2011-06-18 23:48:42 +00:00
|
|
|
|
2012-03-23 04:28:20 +00:00
|
|
|
static int errflag;
|
2012-04-23 16:03:31 +00:00
|
|
|
static char errbuf[128];
|
2012-03-23 04:28:20 +00:00
|
|
|
|
2012-07-11 05:47:30 +00:00
|
|
|
#ifdef SHARED
|
2012-03-23 04:28:20 +00:00
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
#if ULONG_MAX == 0xffffffff
|
|
|
|
typedef Elf32_Ehdr Ehdr;
|
|
|
|
typedef Elf32_Phdr Phdr;
|
|
|
|
typedef Elf32_Sym Sym;
|
|
|
|
#define R_TYPE(x) ((x)&255)
|
|
|
|
#define R_SYM(x) ((x)>>8)
|
|
|
|
#else
|
|
|
|
typedef Elf64_Ehdr Ehdr;
|
|
|
|
typedef Elf64_Phdr Phdr;
|
|
|
|
typedef Elf64_Sym Sym;
|
|
|
|
#define R_TYPE(x) ((x)&0xffffffff)
|
|
|
|
#define R_SYM(x) ((x)>>32)
|
|
|
|
#endif
|
|
|
|
|
2012-10-06 05:22:51 +00:00
|
|
|
#define MAXP2(a,b) (-(-(a)&-(b)))
|
|
|
|
#define ALIGN(x,y) ((x)+(y)-1 & -(y))
|
|
|
|
|
2012-04-25 04:05:42 +00:00
|
|
|
struct debug {
|
|
|
|
int ver;
|
|
|
|
void *head;
|
|
|
|
void (*bp)(void);
|
|
|
|
int state;
|
|
|
|
void *base;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct dso {
|
|
|
|
unsigned char *base;
|
|
|
|
char *name;
|
|
|
|
size_t *dynv;
|
2011-06-18 23:48:42 +00:00
|
|
|
struct dso *next, *prev;
|
2012-04-25 04:05:42 +00:00
|
|
|
|
2012-11-01 01:27:48 +00:00
|
|
|
Phdr *phdr;
|
|
|
|
int phnum;
|
2011-06-18 23:48:42 +00:00
|
|
|
int refcnt;
|
|
|
|
Sym *syms;
|
2011-06-19 02:52:01 +00:00
|
|
|
uint32_t *hashtab;
|
2012-08-25 21:13:28 +00:00
|
|
|
uint32_t *ghashtab;
|
2011-06-18 23:48:42 +00:00
|
|
|
char *strings;
|
|
|
|
unsigned char *map;
|
|
|
|
size_t map_len;
|
|
|
|
dev_t dev;
|
|
|
|
ino_t ino;
|
2012-06-10 01:20:44 +00:00
|
|
|
signed char global;
|
2012-02-08 01:29:29 +00:00
|
|
|
char relocated;
|
|
|
|
char constructed;
|
2011-06-26 23:23:28 +00:00
|
|
|
struct dso **deps;
|
2012-10-05 00:04:13 +00:00
|
|
|
void *tls_image;
|
2012-10-05 02:48:33 +00:00
|
|
|
size_t tls_len, tls_size, tls_align, tls_id, tls_offset;
|
2012-10-05 15:51:50 +00:00
|
|
|
void **new_dtv;
|
|
|
|
unsigned char *new_tls;
|
|
|
|
int new_dtv_idx, new_tls_idx;
|
2012-10-05 17:09:09 +00:00
|
|
|
struct dso *fini_next;
|
2012-05-27 20:01:44 +00:00
|
|
|
char *shortname;
|
2011-06-26 21:39:17 +00:00
|
|
|
char buf[];
|
2011-06-18 23:48:42 +00:00
|
|
|
};
|
|
|
|
|
2012-10-05 02:48:33 +00:00
|
|
|
struct symdef {
|
|
|
|
Sym *sym;
|
|
|
|
struct dso *dso;
|
|
|
|
};
|
|
|
|
|
2012-08-05 17:46:39 +00:00
|
|
|
#include "reloc.h"
|
|
|
|
|
2012-05-04 00:42:45 +00:00
|
|
|
void __init_ssp(size_t *);
|
2012-10-05 00:04:13 +00:00
|
|
|
void *__install_initial_tls(void *);
|
add support for init/fini array in main program, and greatly simplify
modern (4.7.x and later) gcc uses init/fini arrays, rather than the
legacy _init/_fini function pasting and crtbegin/crtend ctors/dtors
system, on most or all archs. some archs had already switched a long
time ago. without following this change, global ctors/dtors will cease
to work under musl when building with new gcc versions.
the most surprising part of this patch is that it actually reduces the
size of the init code, for both static and shared libc. this is
achieved by (1) unifying the handling main program and shared
libraries in the dynamic linker, and (2) eliminating the
glibc-inspired rube goldberg machine for passing around init and fini
function pointers. to clarify, some background:
the function signature for __libc_start_main was based on glibc, as
part of the original goal of being able to run some glibc-linked
binaries. it worked by having the crt1 code, which is linked into
every application, static or dynamic, obtain and pass pointers to the
init and fini functions, which __libc_start_main is then responsible
for using and recording for later use, as necessary. however, in
neither the static-linked nor dynamic-linked case do we actually need
crt1.o's help. with dynamic linking, all the pointers are available in
the _DYNAMIC block. with static linking, it's safe to simply access
the _init/_fini and __init_array_start, etc. symbols directly.
obviously changing the __libc_start_main function signature in an
incompatible way would break both old musl-linked programs and
glibc-linked programs, so let's not do that. instead, the function can
just ignore the information it doesn't need. new archs need not even
provide the useless args in their versions of crt1.o. existing archs
should continue to provide it as long as there is an interest in
having newly-linked applications be able to run on old versions of
musl; at some point in the future, this support can be removed.
2013-07-21 07:00:54 +00:00
|
|
|
void __init_libc(char **, char *);
|
2012-04-24 22:07:59 +00:00
|
|
|
|
2012-10-14 03:25:20 +00:00
|
|
|
static struct dso *head, *tail, *ldso, *fini_head;
|
2011-07-01 03:02:27 +00:00
|
|
|
static char *env_path, *sys_path, *r_path;
|
2012-11-01 01:27:48 +00:00
|
|
|
static unsigned long long gencnt;
|
2012-04-24 22:07:59 +00:00
|
|
|
static int ssp_used;
|
2011-06-26 21:39:17 +00:00
|
|
|
static int runtime;
|
2012-05-27 20:01:44 +00:00
|
|
|
static int ldd_mode;
|
2012-08-18 20:00:23 +00:00
|
|
|
static int ldso_fail;
|
2013-01-24 03:07:45 +00:00
|
|
|
static int noload;
|
2013-07-24 06:38:05 +00:00
|
|
|
static jmp_buf *rtld_fail;
|
2011-06-26 23:23:28 +00:00
|
|
|
static pthread_rwlock_t lock;
|
2012-04-25 04:05:42 +00:00
|
|
|
static struct debug debug;
|
2012-10-14 23:56:50 +00:00
|
|
|
static size_t tls_cnt, tls_offset, tls_align = 4*sizeof(size_t);
|
2012-10-05 17:09:09 +00:00
|
|
|
static pthread_mutex_t init_fini_lock = { ._m_type = PTHREAD_MUTEX_RECURSIVE };
|
2012-04-25 04:05:42 +00:00
|
|
|
|
|
|
|
struct debug *_dl_debug_addr = &debug;
|
2011-06-18 23:48:42 +00:00
|
|
|
|
2012-10-08 01:43:46 +00:00
|
|
|
#define AUX_CNT 38
|
2011-06-18 23:48:42 +00:00
|
|
|
#define DYN_CNT 34
|
|
|
|
|
|
|
|
static void decode_vec(size_t *v, size_t *a, size_t cnt)
|
|
|
|
{
|
|
|
|
memset(a, 0, cnt*sizeof(size_t));
|
|
|
|
for (; v[0]; v+=2) if (v[0]<cnt) {
|
|
|
|
a[0] |= 1ULL<<v[0];
|
|
|
|
a[v[0]] = v[1];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-25 21:13:28 +00:00
|
|
|
static int search_vec(size_t *v, size_t *r, size_t key)
|
|
|
|
{
|
|
|
|
for (; v[0]!=key; v+=2)
|
|
|
|
if (!v[0]) return 0;
|
|
|
|
*r = v[1];
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint32_t sysv_hash(const char *s0)
|
2011-06-18 23:48:42 +00:00
|
|
|
{
|
2012-01-17 05:34:58 +00:00
|
|
|
const unsigned char *s = (void *)s0;
|
2011-06-18 23:48:42 +00:00
|
|
|
uint_fast32_t h = 0;
|
|
|
|
while (*s) {
|
|
|
|
h = 16*h + *s++;
|
|
|
|
h ^= h>>24 & 0xf0;
|
|
|
|
}
|
|
|
|
return h & 0xfffffff;
|
|
|
|
}
|
|
|
|
|
2012-08-25 21:13:28 +00:00
|
|
|
static uint32_t gnu_hash(const char *s0)
|
|
|
|
{
|
|
|
|
const unsigned char *s = (void *)s0;
|
|
|
|
uint_fast32_t h = 5381;
|
|
|
|
for (; *s; s++)
|
|
|
|
h = h*33 + *s;
|
|
|
|
return h;
|
|
|
|
}
|
|
|
|
|
|
|
|
static Sym *sysv_lookup(const char *s, uint32_t h, struct dso *dso)
|
2011-06-18 23:48:42 +00:00
|
|
|
{
|
|
|
|
size_t i;
|
2012-08-05 06:38:35 +00:00
|
|
|
Sym *syms = dso->syms;
|
|
|
|
uint32_t *hashtab = dso->hashtab;
|
|
|
|
char *strings = dso->strings;
|
2011-06-18 23:48:42 +00:00
|
|
|
for (i=hashtab[2+h%hashtab[0]]; i; i=hashtab[2+hashtab[0]+i]) {
|
|
|
|
if (!strcmp(s, strings+syms[i].st_name))
|
|
|
|
return syms+i;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-08-25 21:13:28 +00:00
|
|
|
static Sym *gnu_lookup(const char *s, uint32_t h1, struct dso *dso)
|
|
|
|
{
|
|
|
|
Sym *sym;
|
|
|
|
char *strings;
|
|
|
|
uint32_t *hashtab = dso->ghashtab;
|
|
|
|
uint32_t nbuckets = hashtab[0];
|
|
|
|
uint32_t *buckets = hashtab + 4 + hashtab[2]*(sizeof(size_t)/4);
|
|
|
|
uint32_t h2;
|
|
|
|
uint32_t *hashval;
|
|
|
|
uint32_t n = buckets[h1 % nbuckets];
|
|
|
|
|
|
|
|
if (!n) return 0;
|
|
|
|
|
|
|
|
strings = dso->strings;
|
|
|
|
sym = dso->syms + n;
|
|
|
|
hashval = buckets + nbuckets + (n - hashtab[1]);
|
|
|
|
|
|
|
|
for (h1 |= 1; ; sym++) {
|
|
|
|
h2 = *hashval++;
|
|
|
|
if ((h1 == (h2|1)) && !strcmp(s, strings + sym->st_name))
|
|
|
|
return sym;
|
|
|
|
if (h2 & 1) break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-10-05 02:48:33 +00:00
|
|
|
#define OK_TYPES (1<<STT_NOTYPE | 1<<STT_OBJECT | 1<<STT_FUNC | 1<<STT_COMMON | 1<<STT_TLS)
|
2013-07-24 15:53:23 +00:00
|
|
|
#define OK_BINDS (1<<STB_GLOBAL | 1<<STB_WEAK | 1<<STB_GNU_UNIQUE)
|
2011-06-18 23:48:42 +00:00
|
|
|
|
2012-10-05 02:48:33 +00:00
|
|
|
static struct symdef find_sym(struct dso *dso, const char *s, int need_def)
|
2011-06-18 23:48:42 +00:00
|
|
|
{
|
2012-08-25 21:13:28 +00:00
|
|
|
uint32_t h = 0, gh = 0;
|
2012-10-05 02:48:33 +00:00
|
|
|
struct symdef def = {0};
|
2012-08-25 21:13:28 +00:00
|
|
|
if (dso->ghashtab) {
|
|
|
|
gh = gnu_hash(s);
|
|
|
|
if (gh == 0x1f4039c9 && !strcmp(s, "__stack_chk_fail")) ssp_used = 1;
|
|
|
|
} else {
|
|
|
|
h = sysv_hash(s);
|
|
|
|
if (h == 0x595a4cc && !strcmp(s, "__stack_chk_fail")) ssp_used = 1;
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
for (; dso; dso=dso->next) {
|
2011-06-26 23:23:28 +00:00
|
|
|
Sym *sym;
|
|
|
|
if (!dso->global) continue;
|
2012-08-25 21:13:28 +00:00
|
|
|
if (dso->ghashtab) {
|
|
|
|
if (!gh) gh = gnu_hash(s);
|
|
|
|
sym = gnu_lookup(s, gh, dso);
|
|
|
|
} else {
|
|
|
|
if (!h) h = sysv_hash(s);
|
|
|
|
sym = sysv_lookup(s, h, dso);
|
|
|
|
}
|
2012-10-06 05:36:11 +00:00
|
|
|
if (!sym) continue;
|
|
|
|
if (!sym->st_shndx)
|
|
|
|
if (need_def || (sym->st_info&0xf) == STT_TLS)
|
|
|
|
continue;
|
|
|
|
if (!sym->st_value)
|
|
|
|
if ((sym->st_info&0xf) != STT_TLS)
|
|
|
|
continue;
|
|
|
|
if (!(1<<(sym->st_info&0xf) & OK_TYPES)) continue;
|
|
|
|
if (!(1<<(sym->st_info>>4) & OK_BINDS)) continue;
|
|
|
|
|
|
|
|
if (def.sym && sym->st_info>>4 == STB_WEAK) continue;
|
|
|
|
def.sym = sym;
|
|
|
|
def.dso = dso;
|
|
|
|
if (sym->st_info>>4 == STB_GLOBAL) break;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
2011-07-24 06:19:47 +00:00
|
|
|
return def;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
|
2012-08-05 06:49:02 +00:00
|
|
|
static void do_relocs(struct dso *dso, size_t *rel, size_t rel_size, size_t stride)
|
2011-06-18 23:48:42 +00:00
|
|
|
{
|
2012-08-05 06:49:02 +00:00
|
|
|
unsigned char *base = dso->base;
|
|
|
|
Sym *syms = dso->syms;
|
|
|
|
char *strings = dso->strings;
|
2011-06-18 23:48:42 +00:00
|
|
|
Sym *sym;
|
|
|
|
const char *name;
|
|
|
|
void *ctx;
|
|
|
|
int type;
|
|
|
|
int sym_index;
|
2012-10-05 02:48:33 +00:00
|
|
|
struct symdef def;
|
2011-06-18 23:48:42 +00:00
|
|
|
|
|
|
|
for (; rel_size; rel+=stride, rel_size-=stride*sizeof(size_t)) {
|
|
|
|
type = R_TYPE(rel[1]);
|
|
|
|
sym_index = R_SYM(rel[1]);
|
|
|
|
if (sym_index) {
|
|
|
|
sym = syms + sym_index;
|
|
|
|
name = strings + sym->st_name;
|
2012-08-05 06:44:32 +00:00
|
|
|
ctx = IS_COPY(type) ? head->next : head;
|
2012-10-05 02:48:33 +00:00
|
|
|
def = find_sym(ctx, name, IS_PLT(type));
|
|
|
|
if (!def.sym && sym->st_info>>4 != STB_WEAK) {
|
2012-04-23 16:03:31 +00:00
|
|
|
snprintf(errbuf, sizeof errbuf,
|
|
|
|
"Error relocating %s: %s: symbol not found",
|
2012-08-05 06:49:02 +00:00
|
|
|
dso->name, name);
|
2013-07-24 06:38:05 +00:00
|
|
|
if (runtime) longjmp(*rtld_fail, 1);
|
2012-04-23 16:03:31 +00:00
|
|
|
dprintf(2, "%s\n", errbuf);
|
2012-08-18 20:00:23 +00:00
|
|
|
ldso_fail = 1;
|
|
|
|
continue;
|
2011-06-26 21:39:17 +00:00
|
|
|
}
|
2012-08-05 18:03:17 +00:00
|
|
|
} else {
|
2012-10-05 02:48:33 +00:00
|
|
|
sym = 0;
|
|
|
|
def.sym = 0;
|
|
|
|
def.dso = 0;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
2012-10-05 02:48:33 +00:00
|
|
|
do_single_reloc(dso, base, (void *)(base + rel[0]), type,
|
|
|
|
stride>2 ? rel[2] : 0, sym, sym?sym->st_size:0, def,
|
|
|
|
def.sym?(size_t)(def.dso->base+def.sym->st_value):0);
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-28 23:40:14 +00:00
|
|
|
/* A huge hack: to make up for the wastefulness of shared libraries
|
|
|
|
* needing at least a page of dirty memory even if they have no global
|
|
|
|
* data, we reclaim the gaps at the beginning and end of writable maps
|
|
|
|
* and "donate" them to the heap by setting up minimal malloc
|
|
|
|
* structures and then freeing them. */
|
|
|
|
|
|
|
|
static void reclaim(unsigned char *base, size_t start, size_t end)
|
|
|
|
{
|
|
|
|
size_t *a, *z;
|
|
|
|
start = start + 6*sizeof(size_t)-1 & -4*sizeof(size_t);
|
|
|
|
end = (end & -4*sizeof(size_t)) - 2*sizeof(size_t);
|
|
|
|
if (start>end || end-start < 4*sizeof(size_t)) return;
|
|
|
|
a = (size_t *)(base + start);
|
|
|
|
z = (size_t *)(base + end);
|
|
|
|
a[-2] = 1;
|
|
|
|
a[-1] = z[0] = end-start + 2*sizeof(size_t) | 1;
|
|
|
|
z[1] = 1;
|
|
|
|
free(a);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void reclaim_gaps(unsigned char *base, Phdr *ph, size_t phent, size_t phcnt)
|
|
|
|
{
|
|
|
|
for (; phcnt--; ph=(void *)((char *)ph+phent)) {
|
|
|
|
if (ph->p_type!=PT_LOAD) continue;
|
|
|
|
if ((ph->p_flags&(PF_R|PF_W))!=(PF_R|PF_W)) continue;
|
|
|
|
reclaim(base, ph->p_vaddr & -PAGE_SIZE, ph->p_vaddr);
|
|
|
|
reclaim(base, ph->p_vaddr+ph->p_memsz,
|
|
|
|
ph->p_vaddr+ph->p_memsz+PAGE_SIZE-1 & -PAGE_SIZE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-05 00:04:13 +00:00
|
|
|
static void *map_library(int fd, struct dso *dso)
|
2011-06-18 23:48:42 +00:00
|
|
|
{
|
2011-06-25 16:26:08 +00:00
|
|
|
Ehdr buf[(896+sizeof(Ehdr))/sizeof(Ehdr)];
|
2011-06-18 23:48:42 +00:00
|
|
|
size_t phsize;
|
|
|
|
size_t addr_min=SIZE_MAX, addr_max=0, map_len;
|
|
|
|
size_t this_min, this_max;
|
|
|
|
off_t off_start;
|
|
|
|
Ehdr *eh;
|
2013-07-10 18:38:20 +00:00
|
|
|
Phdr *ph, *ph0;
|
2011-06-18 23:48:42 +00:00
|
|
|
unsigned prot;
|
|
|
|
unsigned char *map, *base;
|
|
|
|
size_t dyn;
|
2012-10-05 00:04:13 +00:00
|
|
|
size_t tls_image=0;
|
2011-06-18 23:48:42 +00:00
|
|
|
size_t i;
|
|
|
|
|
|
|
|
ssize_t l = read(fd, buf, sizeof buf);
|
2013-07-31 18:05:41 +00:00
|
|
|
if (l<(int)sizeof *eh) return 0;
|
2011-06-25 16:26:08 +00:00
|
|
|
eh = buf;
|
2013-07-31 18:42:08 +00:00
|
|
|
if (eh->e_type != ET_DYN && eh->e_type != ET_EXEC) {
|
|
|
|
errno = ENOEXEC;
|
|
|
|
return 0;
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
phsize = eh->e_phentsize * eh->e_phnum;
|
|
|
|
if (phsize + sizeof *eh > l) return 0;
|
|
|
|
if (eh->e_phoff + phsize > l) {
|
2011-06-25 16:26:08 +00:00
|
|
|
l = pread(fd, buf+1, phsize, eh->e_phoff);
|
2011-06-18 23:48:42 +00:00
|
|
|
if (l != phsize) return 0;
|
2013-07-10 18:38:20 +00:00
|
|
|
ph = ph0 = (void *)(buf + 1);
|
|
|
|
} else {
|
|
|
|
ph = ph0 = (void *)((char *)buf + eh->e_phoff);
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
for (i=eh->e_phnum; i; i--, ph=(void *)((char *)ph+eh->e_phentsize)) {
|
|
|
|
if (ph->p_type == PT_DYNAMIC)
|
|
|
|
dyn = ph->p_vaddr;
|
2012-10-05 00:04:13 +00:00
|
|
|
if (ph->p_type == PT_TLS) {
|
|
|
|
tls_image = ph->p_vaddr;
|
|
|
|
dso->tls_align = ph->p_align;
|
|
|
|
dso->tls_len = ph->p_filesz;
|
|
|
|
dso->tls_size = ph->p_memsz;
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
if (ph->p_type != PT_LOAD) continue;
|
|
|
|
if (ph->p_vaddr < addr_min) {
|
|
|
|
addr_min = ph->p_vaddr;
|
|
|
|
off_start = ph->p_offset;
|
|
|
|
prot = (((ph->p_flags&PF_R) ? PROT_READ : 0) |
|
|
|
|
((ph->p_flags&PF_W) ? PROT_WRITE: 0) |
|
|
|
|
((ph->p_flags&PF_X) ? PROT_EXEC : 0));
|
|
|
|
}
|
|
|
|
if (ph->p_vaddr+ph->p_memsz > addr_max) {
|
|
|
|
addr_max = ph->p_vaddr+ph->p_memsz;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!dyn) return 0;
|
|
|
|
addr_max += PAGE_SIZE-1;
|
|
|
|
addr_max &= -PAGE_SIZE;
|
|
|
|
addr_min &= -PAGE_SIZE;
|
|
|
|
off_start &= -PAGE_SIZE;
|
|
|
|
map_len = addr_max - addr_min + off_start;
|
|
|
|
/* The first time, we map too much, possibly even more than
|
|
|
|
* the length of the file. This is okay because we will not
|
|
|
|
* use the invalid part; we just need to reserve the right
|
|
|
|
* amount of virtual address space to map over later. */
|
2011-06-28 18:20:41 +00:00
|
|
|
map = mmap((void *)addr_min, map_len, prot, MAP_PRIVATE, fd, off_start);
|
2011-06-18 23:48:42 +00:00
|
|
|
if (map==MAP_FAILED) return 0;
|
2013-07-31 18:42:08 +00:00
|
|
|
/* If the loaded file is not relocatable and the requested address is
|
|
|
|
* not available, then the load operation must fail. */
|
|
|
|
if (eh->e_type != ET_DYN && addr_min && map!=(void *)addr_min) {
|
|
|
|
errno = EBUSY;
|
|
|
|
goto error;
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
base = map - addr_min;
|
2013-07-10 18:38:20 +00:00
|
|
|
dso->phdr = 0;
|
|
|
|
dso->phnum = 0;
|
|
|
|
for (ph=ph0, i=eh->e_phnum; i; i--, ph=(void *)((char *)ph+eh->e_phentsize)) {
|
2011-06-18 23:48:42 +00:00
|
|
|
if (ph->p_type != PT_LOAD) continue;
|
2013-07-10 18:38:20 +00:00
|
|
|
/* Check if the programs headers are in this load segment, and
|
|
|
|
* if so, record the address for use by dl_iterate_phdr. */
|
|
|
|
if (!dso->phdr && eh->e_phoff >= ph->p_offset
|
|
|
|
&& eh->e_phoff+phsize <= ph->p_offset+ph->p_filesz) {
|
|
|
|
dso->phdr = (void *)(base + ph->p_vaddr
|
|
|
|
+ (eh->e_phoff-ph->p_offset));
|
|
|
|
dso->phnum = eh->e_phnum;
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
/* Reuse the existing mapping for the lowest-address LOAD */
|
|
|
|
if ((ph->p_vaddr & -PAGE_SIZE) == addr_min) continue;
|
|
|
|
this_min = ph->p_vaddr & -PAGE_SIZE;
|
|
|
|
this_max = ph->p_vaddr+ph->p_memsz+PAGE_SIZE-1 & -PAGE_SIZE;
|
|
|
|
off_start = ph->p_offset & -PAGE_SIZE;
|
|
|
|
prot = (((ph->p_flags&PF_R) ? PROT_READ : 0) |
|
|
|
|
((ph->p_flags&PF_W) ? PROT_WRITE: 0) |
|
|
|
|
((ph->p_flags&PF_X) ? PROT_EXEC : 0));
|
2012-06-06 15:21:28 +00:00
|
|
|
if (mmap(base+this_min, this_max-this_min, prot, MAP_PRIVATE|MAP_FIXED, fd, off_start) == MAP_FAILED)
|
|
|
|
goto error;
|
2011-06-18 23:48:42 +00:00
|
|
|
if (ph->p_memsz > ph->p_filesz) {
|
|
|
|
size_t brk = (size_t)base+ph->p_vaddr+ph->p_filesz;
|
|
|
|
size_t pgbrk = brk+PAGE_SIZE-1 & -PAGE_SIZE;
|
|
|
|
memset((void *)brk, 0, pgbrk-brk & PAGE_SIZE-1);
|
2012-06-06 15:21:28 +00:00
|
|
|
if (pgbrk-(size_t)base < this_max && mmap((void *)pgbrk, (size_t)base+this_max-pgbrk, prot, MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS, -1, 0) == MAP_FAILED)
|
|
|
|
goto error;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
}
|
2011-06-29 04:29:08 +00:00
|
|
|
for (i=0; ((size_t *)(base+dyn))[i]; i+=2)
|
|
|
|
if (((size_t *)(base+dyn))[i]==DT_TEXTREL) {
|
2012-06-06 15:21:28 +00:00
|
|
|
if (mprotect(map, map_len, PROT_READ|PROT_WRITE|PROT_EXEC) < 0)
|
|
|
|
goto error;
|
2011-06-29 04:29:08 +00:00
|
|
|
break;
|
|
|
|
}
|
2013-07-10 18:38:20 +00:00
|
|
|
if (!runtime) reclaim_gaps(base, ph0, eh->e_phentsize, eh->e_phnum);
|
2012-10-05 00:04:13 +00:00
|
|
|
dso->map = map;
|
|
|
|
dso->map_len = map_len;
|
|
|
|
dso->base = base;
|
|
|
|
dso->dynv = (void *)(base+dyn);
|
|
|
|
if (dso->tls_size) dso->tls_image = (void *)(base+tls_image);
|
2011-06-18 23:48:42 +00:00
|
|
|
return map;
|
2012-06-06 15:21:28 +00:00
|
|
|
error:
|
|
|
|
munmap(map, map_len);
|
|
|
|
return 0;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
|
2013-04-20 15:51:58 +00:00
|
|
|
static int path_open(const char *name, const char *s, char *buf, size_t buf_size)
|
2011-06-25 05:56:34 +00:00
|
|
|
{
|
2013-04-20 15:51:58 +00:00
|
|
|
size_t l;
|
|
|
|
int fd;
|
2011-06-25 21:49:16 +00:00
|
|
|
for (;;) {
|
2013-04-20 15:51:58 +00:00
|
|
|
s += strspn(s, ":\n");
|
|
|
|
l = strcspn(s, ":\n");
|
|
|
|
if (l-1 >= INT_MAX) return -1;
|
|
|
|
if (snprintf(buf, buf_size, "%.*s/%s", (int)l, s, name) >= buf_size)
|
|
|
|
continue;
|
2012-09-29 21:59:50 +00:00
|
|
|
if ((fd = open(buf, O_RDONLY|O_CLOEXEC))>=0) return fd;
|
2011-06-25 21:49:16 +00:00
|
|
|
s += l;
|
2011-06-25 05:56:34 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
static void decode_dyn(struct dso *p)
|
|
|
|
{
|
|
|
|
size_t dyn[DYN_CNT] = {0};
|
|
|
|
decode_vec(p->dynv, dyn, DYN_CNT);
|
|
|
|
p->syms = (void *)(p->base + dyn[DT_SYMTAB]);
|
|
|
|
p->strings = (void *)(p->base + dyn[DT_STRTAB]);
|
2012-08-25 21:13:28 +00:00
|
|
|
if (dyn[0]&(1<<DT_HASH))
|
|
|
|
p->hashtab = (void *)(p->base + dyn[DT_HASH]);
|
|
|
|
if (search_vec(p->dynv, dyn, DT_GNU_HASH))
|
|
|
|
p->ghashtab = (void *)(p->base + *dyn);
|
2012-01-23 05:57:38 +00:00
|
|
|
}
|
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
static struct dso *load_library(const char *name)
|
|
|
|
{
|
2012-05-27 20:01:44 +00:00
|
|
|
char buf[2*NAME_MAX+2];
|
2012-07-11 05:41:20 +00:00
|
|
|
const char *pathname;
|
2012-12-16 04:34:08 +00:00
|
|
|
unsigned char *map;
|
2012-10-05 00:04:13 +00:00
|
|
|
struct dso *p, temp_dso = {0};
|
2011-06-18 23:48:42 +00:00
|
|
|
int fd;
|
|
|
|
struct stat st;
|
2012-10-05 15:51:50 +00:00
|
|
|
size_t alloc_size;
|
|
|
|
int n_th = 0;
|
2011-06-18 23:48:42 +00:00
|
|
|
|
|
|
|
/* Catch and block attempts to reload the implementation itself */
|
|
|
|
if (name[0]=='l' && name[1]=='i' && name[2]=='b') {
|
|
|
|
static const char *rp, reserved[] =
|
|
|
|
"c\0pthread\0rt\0m\0dl\0util\0xnet\0";
|
|
|
|
char *z = strchr(name, '.');
|
|
|
|
if (z) {
|
|
|
|
size_t l = z-name;
|
|
|
|
for (rp=reserved; *rp && memcmp(name+3, rp, l-3); rp+=strlen(rp)+1);
|
|
|
|
if (*rp) {
|
2013-07-26 18:41:12 +00:00
|
|
|
if (ldd_mode) {
|
|
|
|
/* Track which names have been resolved
|
|
|
|
* and only report each one once. */
|
|
|
|
static unsigned reported;
|
|
|
|
unsigned mask = 1U<<(rp-reserved);
|
|
|
|
if (!(reported & mask)) {
|
|
|
|
reported |= mask;
|
|
|
|
dprintf(1, "\t%s => %s (%p)\n",
|
|
|
|
name, ldso->name,
|
|
|
|
ldso->base);
|
|
|
|
}
|
|
|
|
}
|
2012-10-14 03:25:20 +00:00
|
|
|
if (!ldso->prev) {
|
|
|
|
tail->next = ldso;
|
|
|
|
ldso->prev = tail;
|
|
|
|
tail = ldso->next ? ldso->next : ldso;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
2012-10-14 03:25:20 +00:00
|
|
|
return ldso;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-06-26 23:23:28 +00:00
|
|
|
if (strchr(name, '/')) {
|
2012-07-11 05:41:20 +00:00
|
|
|
pathname = name;
|
2012-09-29 21:59:50 +00:00
|
|
|
fd = open(name, O_RDONLY|O_CLOEXEC);
|
2011-06-18 23:48:42 +00:00
|
|
|
} else {
|
2012-07-11 05:41:20 +00:00
|
|
|
/* Search for the name to see if it's already loaded */
|
|
|
|
for (p=head->next; p; p=p->next) {
|
|
|
|
if (p->shortname && !strcmp(p->shortname, name)) {
|
|
|
|
p->refcnt++;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
}
|
2011-06-26 23:23:28 +00:00
|
|
|
if (strlen(name) > NAME_MAX) return 0;
|
2011-06-25 05:56:34 +00:00
|
|
|
fd = -1;
|
2012-05-27 20:01:44 +00:00
|
|
|
if (r_path) fd = path_open(name, r_path, buf, sizeof buf);
|
|
|
|
if (fd < 0 && env_path) fd = path_open(name, env_path, buf, sizeof buf);
|
2011-06-25 05:56:34 +00:00
|
|
|
if (fd < 0) {
|
|
|
|
if (!sys_path) {
|
2013-07-18 23:29:44 +00:00
|
|
|
char *prefix = 0;
|
|
|
|
size_t prefix_len;
|
|
|
|
if (ldso->name[0]=='/') {
|
|
|
|
char *s, *t, *z;
|
|
|
|
for (s=t=z=ldso->name; *s; s++)
|
|
|
|
if (*s=='/') z=t, t=s;
|
|
|
|
prefix_len = z-ldso->name;
|
|
|
|
if (prefix_len < PATH_MAX)
|
|
|
|
prefix = ldso->name;
|
|
|
|
}
|
|
|
|
if (!prefix) {
|
|
|
|
prefix = "";
|
|
|
|
prefix_len = 0;
|
|
|
|
}
|
|
|
|
char etc_ldso_path[prefix_len + 1
|
|
|
|
+ sizeof "/etc/ld-musl-" LDSO_ARCH ".path"];
|
|
|
|
snprintf(etc_ldso_path, sizeof etc_ldso_path,
|
|
|
|
"%.*s/etc/ld-musl-" LDSO_ARCH ".path",
|
|
|
|
(int)prefix_len, prefix);
|
|
|
|
FILE *f = fopen(etc_ldso_path, "rbe");
|
2011-06-25 05:56:34 +00:00
|
|
|
if (f) {
|
2013-06-26 14:17:29 +00:00
|
|
|
if (getdelim(&sys_path, (size_t[1]){0}, 0, f) <= 0) {
|
2013-06-26 14:51:36 +00:00
|
|
|
free(sys_path);
|
2013-06-26 14:17:29 +00:00
|
|
|
sys_path = "";
|
2012-11-09 18:49:40 +00:00
|
|
|
}
|
2011-06-25 05:56:34 +00:00
|
|
|
fclose(f);
|
|
|
|
}
|
|
|
|
}
|
2012-11-09 03:41:16 +00:00
|
|
|
if (!sys_path) sys_path = "/lib:/usr/local/lib:/usr/lib";
|
|
|
|
fd = path_open(name, sys_path, buf, sizeof buf);
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
2012-07-11 05:41:20 +00:00
|
|
|
pathname = buf;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
if (fd < 0) return 0;
|
|
|
|
if (fstat(fd, &st) < 0) {
|
|
|
|
close(fd);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
for (p=head->next; p; p=p->next) {
|
|
|
|
if (p->dev == st.st_dev && p->ino == st.st_ino) {
|
2012-07-11 05:41:20 +00:00
|
|
|
/* If this library was previously loaded with a
|
|
|
|
* pathname but a search found the same inode,
|
|
|
|
* setup its shortname so it can be found by name. */
|
2012-10-05 16:09:54 +00:00
|
|
|
if (!p->shortname && pathname != name)
|
|
|
|
p->shortname = strrchr(p->name, '/')+1;
|
2011-06-18 23:48:42 +00:00
|
|
|
close(fd);
|
|
|
|
p->refcnt++;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
}
|
2013-01-24 03:07:45 +00:00
|
|
|
map = noload ? 0 : map_library(fd, &temp_dso);
|
2011-06-18 23:48:42 +00:00
|
|
|
close(fd);
|
|
|
|
if (!map) return 0;
|
2012-10-05 15:51:50 +00:00
|
|
|
|
|
|
|
/* Allocate storage for the new DSO. When there is TLS, this
|
|
|
|
* storage must include a reservation for all pre-existing
|
|
|
|
* threads to obtain copies of both the new TLS, and an
|
|
|
|
* extended DTV capable of storing an additional slot for
|
|
|
|
* the newly-loaded DSO. */
|
|
|
|
alloc_size = sizeof *p + strlen(pathname) + 1;
|
|
|
|
if (runtime && temp_dso.tls_image) {
|
|
|
|
size_t per_th = temp_dso.tls_size + temp_dso.tls_align
|
|
|
|
+ sizeof(void *) * (tls_cnt+3);
|
2012-10-14 03:25:20 +00:00
|
|
|
n_th = libc.threads_minus_1 + 1;
|
2012-10-05 15:51:50 +00:00
|
|
|
if (n_th > SSIZE_MAX / per_th) alloc_size = SIZE_MAX;
|
|
|
|
else alloc_size += n_th * per_th;
|
|
|
|
}
|
|
|
|
p = calloc(1, alloc_size);
|
2011-06-18 23:48:42 +00:00
|
|
|
if (!p) {
|
2013-02-02 05:59:25 +00:00
|
|
|
munmap(map, temp_dso.map_len);
|
2011-06-18 23:48:42 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2012-10-05 00:04:13 +00:00
|
|
|
memcpy(p, &temp_dso, sizeof temp_dso);
|
2012-01-23 05:57:38 +00:00
|
|
|
decode_dyn(p);
|
2011-06-18 23:48:42 +00:00
|
|
|
p->dev = st.st_dev;
|
|
|
|
p->ino = st.st_ino;
|
|
|
|
p->refcnt = 1;
|
2011-06-26 21:39:17 +00:00
|
|
|
p->name = p->buf;
|
2012-07-11 05:41:20 +00:00
|
|
|
strcpy(p->name, pathname);
|
|
|
|
/* Add a shortname only if name arg was not an explicit pathname. */
|
|
|
|
if (pathname != name) p->shortname = strrchr(p->name, '/')+1;
|
2012-10-05 15:51:50 +00:00
|
|
|
if (p->tls_image) {
|
2012-10-08 00:19:11 +00:00
|
|
|
if (runtime && !__pthread_self_init()) {
|
2013-02-02 05:59:25 +00:00
|
|
|
munmap(map, p->map_len);
|
2012-10-06 20:56:35 +00:00
|
|
|
free(p);
|
|
|
|
return 0;
|
|
|
|
}
|
2012-10-05 15:51:50 +00:00
|
|
|
p->tls_id = ++tls_cnt;
|
2012-10-06 05:22:51 +00:00
|
|
|
tls_align = MAXP2(tls_align, p->tls_align);
|
2012-10-15 22:51:53 +00:00
|
|
|
#ifdef TLS_ABOVE_TP
|
|
|
|
p->tls_offset = tls_offset + ( (tls_align-1) &
|
|
|
|
-(tls_offset + (uintptr_t)p->tls_image) );
|
|
|
|
tls_offset += p->tls_size;
|
|
|
|
#else
|
2012-10-06 05:22:51 +00:00
|
|
|
tls_offset += p->tls_size + p->tls_align - 1;
|
|
|
|
tls_offset -= (tls_offset + (uintptr_t)p->tls_image)
|
|
|
|
& (p->tls_align-1);
|
|
|
|
p->tls_offset = tls_offset;
|
2012-10-15 22:51:53 +00:00
|
|
|
#endif
|
2012-10-05 15:51:50 +00:00
|
|
|
p->new_dtv = (void *)(-sizeof(size_t) &
|
|
|
|
(uintptr_t)(p->name+strlen(p->name)+sizeof(size_t)));
|
|
|
|
p->new_tls = (void *)(p->new_dtv + n_th*(tls_cnt+1));
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
|
|
|
|
tail->next = p;
|
|
|
|
p->prev = tail;
|
|
|
|
tail = p;
|
|
|
|
|
2012-12-16 04:34:08 +00:00
|
|
|
if (ldd_mode) dprintf(1, "\t%s => %s (%p)\n", name, pathname, p->base);
|
2012-05-27 20:01:44 +00:00
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void load_deps(struct dso *p)
|
|
|
|
{
|
2011-06-26 23:23:28 +00:00
|
|
|
size_t i, ndeps=0;
|
|
|
|
struct dso ***deps = &p->deps, **tmp, *dep;
|
2011-06-18 23:48:42 +00:00
|
|
|
for (; p; p=p->next) {
|
2011-07-01 03:02:27 +00:00
|
|
|
for (i=0; p->dynv[i]; i+=2) {
|
|
|
|
if (p->dynv[i] != DT_RPATH) continue;
|
|
|
|
r_path = (void *)(p->strings + p->dynv[i+1]);
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
for (i=0; p->dynv[i]; i+=2) {
|
|
|
|
if (p->dynv[i] != DT_NEEDED) continue;
|
2011-06-26 23:23:28 +00:00
|
|
|
dep = load_library(p->strings + p->dynv[i+1]);
|
|
|
|
if (!dep) {
|
2012-04-23 16:03:31 +00:00
|
|
|
snprintf(errbuf, sizeof errbuf,
|
|
|
|
"Error loading shared library %s: %m (needed by %s)",
|
2011-06-26 21:39:17 +00:00
|
|
|
p->strings + p->dynv[i+1], p->name);
|
2013-07-24 06:38:05 +00:00
|
|
|
if (runtime) longjmp(*rtld_fail, 1);
|
2012-04-23 16:03:31 +00:00
|
|
|
dprintf(2, "%s\n", errbuf);
|
2012-08-18 20:00:23 +00:00
|
|
|
ldso_fail = 1;
|
|
|
|
continue;
|
2011-06-26 21:39:17 +00:00
|
|
|
}
|
2011-06-26 23:23:28 +00:00
|
|
|
if (runtime) {
|
|
|
|
tmp = realloc(*deps, sizeof(*tmp)*(ndeps+2));
|
2013-07-24 06:38:05 +00:00
|
|
|
if (!tmp) longjmp(*rtld_fail, 1);
|
2011-06-26 23:23:28 +00:00
|
|
|
tmp[ndeps++] = dep;
|
|
|
|
tmp[ndeps] = 0;
|
|
|
|
*deps = tmp;
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
2011-07-01 03:02:27 +00:00
|
|
|
r_path = 0;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-08-16 04:24:36 +00:00
|
|
|
static void load_preload(char *s)
|
|
|
|
{
|
|
|
|
int tmp;
|
|
|
|
char *z;
|
|
|
|
for (z=s; *z; s=z) {
|
|
|
|
for ( ; *s && isspace(*s); s++);
|
|
|
|
for (z=s; *z && !isspace(*z); z++);
|
|
|
|
tmp = *z;
|
|
|
|
*z = 0;
|
|
|
|
load_library(s);
|
|
|
|
*z = tmp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-26 23:23:28 +00:00
|
|
|
static void make_global(struct dso *p)
|
|
|
|
{
|
|
|
|
for (; p; p=p->next) p->global = 1;
|
|
|
|
}
|
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
static void reloc_all(struct dso *p)
|
|
|
|
{
|
|
|
|
size_t dyn[DYN_CNT] = {0};
|
|
|
|
for (; p; p=p->next) {
|
|
|
|
if (p->relocated) continue;
|
|
|
|
decode_vec(p->dynv, dyn, DYN_CNT);
|
2012-08-05 16:50:26 +00:00
|
|
|
#ifdef NEED_ARCH_RELOCS
|
|
|
|
do_arch_relocs(p, head);
|
|
|
|
#endif
|
2012-08-05 06:49:02 +00:00
|
|
|
do_relocs(p, (void *)(p->base+dyn[DT_JMPREL]), dyn[DT_PLTRELSZ],
|
|
|
|
2+(dyn[DT_PLTREL]==DT_RELA));
|
|
|
|
do_relocs(p, (void *)(p->base+dyn[DT_REL]), dyn[DT_RELSZ], 2);
|
|
|
|
do_relocs(p, (void *)(p->base+dyn[DT_RELA]), dyn[DT_RELASZ], 3);
|
2011-06-25 04:18:19 +00:00
|
|
|
p->relocated = 1;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
static size_t find_dyn(Phdr *ph, size_t cnt, size_t stride)
|
|
|
|
{
|
|
|
|
for (; cnt--; ph = (void *)((char *)ph + stride))
|
|
|
|
if (ph->p_type == PT_DYNAMIC)
|
|
|
|
return ph->p_vaddr;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-08-27 01:09:26 +00:00
|
|
|
static void find_map_range(Phdr *ph, size_t cnt, size_t stride, struct dso *p)
|
|
|
|
{
|
|
|
|
size_t min_addr = -1, max_addr = 0;
|
|
|
|
for (; cnt--; ph = (void *)((char *)ph + stride)) {
|
|
|
|
if (ph->p_type != PT_LOAD) continue;
|
|
|
|
if (ph->p_vaddr < min_addr)
|
|
|
|
min_addr = ph->p_vaddr;
|
|
|
|
if (ph->p_vaddr+ph->p_memsz > max_addr)
|
|
|
|
max_addr = ph->p_vaddr+ph->p_memsz;
|
|
|
|
}
|
|
|
|
min_addr &= -PAGE_SIZE;
|
|
|
|
max_addr = (max_addr + PAGE_SIZE-1) & -PAGE_SIZE;
|
|
|
|
p->map = p->base + min_addr;
|
|
|
|
p->map_len = max_addr - min_addr;
|
|
|
|
}
|
|
|
|
|
2012-10-05 17:09:09 +00:00
|
|
|
static void do_fini()
|
|
|
|
{
|
|
|
|
struct dso *p;
|
|
|
|
size_t dyn[DYN_CNT] = {0};
|
|
|
|
for (p=fini_head; p; p=p->fini_next) {
|
|
|
|
if (!p->constructed) continue;
|
|
|
|
decode_vec(p->dynv, dyn, DYN_CNT);
|
2013-07-20 22:26:17 +00:00
|
|
|
if (dyn[0] & (1<<DT_FINI_ARRAY)) {
|
|
|
|
size_t n = dyn[DT_FINI_ARRAYSZ]/sizeof(size_t);
|
2013-07-21 06:35:46 +00:00
|
|
|
size_t *fn = (size_t *)(p->base + dyn[DT_FINI_ARRAY])+n;
|
|
|
|
while (n--) ((void (*)(void))*--fn)();
|
2013-07-20 22:26:17 +00:00
|
|
|
}
|
2013-07-22 18:08:33 +00:00
|
|
|
#ifndef NO_LEGACY_INITFINI
|
2013-07-31 04:04:10 +00:00
|
|
|
if ((dyn[0] & (1<<DT_FINI)) && dyn[DT_FINI])
|
2013-07-20 22:26:17 +00:00
|
|
|
((void (*)(void))(p->base + dyn[DT_FINI]))();
|
2013-07-22 18:08:33 +00:00
|
|
|
#endif
|
2012-10-05 17:09:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-06 19:39:09 +00:00
|
|
|
static void do_init_fini(struct dso *p)
|
|
|
|
{
|
|
|
|
size_t dyn[DYN_CNT] = {0};
|
2012-10-14 03:25:20 +00:00
|
|
|
int need_locking = libc.threads_minus_1;
|
2012-10-05 17:09:09 +00:00
|
|
|
/* Allow recursive calls that arise when a library calls
|
|
|
|
* dlopen from one of its constructors, but block any
|
|
|
|
* other threads until all ctors have finished. */
|
|
|
|
if (need_locking) pthread_mutex_lock(&init_fini_lock);
|
2012-02-06 19:39:09 +00:00
|
|
|
for (; p; p=p->prev) {
|
2012-10-05 17:09:09 +00:00
|
|
|
if (p->constructed) continue;
|
|
|
|
p->constructed = 1;
|
2012-02-06 19:39:09 +00:00
|
|
|
decode_vec(p->dynv, dyn, DYN_CNT);
|
2013-07-20 22:26:17 +00:00
|
|
|
if (dyn[0] & ((1<<DT_FINI) | (1<<DT_FINI_ARRAY))) {
|
2012-10-05 17:09:09 +00:00
|
|
|
p->fini_next = fini_head;
|
|
|
|
fini_head = p;
|
|
|
|
}
|
2013-07-22 18:08:33 +00:00
|
|
|
#ifndef NO_LEGACY_INITFINI
|
2013-07-31 04:04:10 +00:00
|
|
|
if ((dyn[0] & (1<<DT_INIT)) && dyn[DT_INIT])
|
2012-02-06 19:39:09 +00:00
|
|
|
((void (*)(void))(p->base + dyn[DT_INIT]))();
|
2013-07-22 18:08:33 +00:00
|
|
|
#endif
|
2013-07-20 22:26:17 +00:00
|
|
|
if (dyn[0] & (1<<DT_INIT_ARRAY)) {
|
|
|
|
size_t n = dyn[DT_INIT_ARRAYSZ]/sizeof(size_t);
|
|
|
|
size_t *fn = (void *)(p->base + dyn[DT_INIT_ARRAY]);
|
|
|
|
while (n--) ((void (*)(void))*fn++)();
|
|
|
|
}
|
2013-06-29 06:24:02 +00:00
|
|
|
if (!need_locking && libc.threads_minus_1) {
|
|
|
|
need_locking = 1;
|
|
|
|
pthread_mutex_lock(&init_fini_lock);
|
|
|
|
}
|
2012-02-06 19:39:09 +00:00
|
|
|
}
|
2012-10-05 17:09:09 +00:00
|
|
|
if (need_locking) pthread_mutex_unlock(&init_fini_lock);
|
2012-02-06 19:39:09 +00:00
|
|
|
}
|
|
|
|
|
2012-04-25 04:05:42 +00:00
|
|
|
void _dl_debug_state(void)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2012-10-05 15:51:50 +00:00
|
|
|
void *__copy_tls(unsigned char *mem)
|
2012-10-05 00:04:13 +00:00
|
|
|
{
|
2012-10-06 05:22:51 +00:00
|
|
|
pthread_t td;
|
2012-10-05 00:04:13 +00:00
|
|
|
struct dso *p;
|
2012-10-06 05:22:51 +00:00
|
|
|
|
|
|
|
if (!tls_cnt) return mem;
|
|
|
|
|
2012-10-05 00:04:13 +00:00
|
|
|
void **dtv = (void *)mem;
|
2012-10-05 15:51:50 +00:00
|
|
|
dtv[0] = (void *)tls_cnt;
|
2012-10-06 05:22:51 +00:00
|
|
|
|
2012-10-15 22:51:53 +00:00
|
|
|
#ifdef TLS_ABOVE_TP
|
|
|
|
mem += sizeof(void *) * (tls_cnt+1);
|
|
|
|
mem += -((uintptr_t)mem + sizeof(struct pthread)) & (tls_align-1);
|
|
|
|
td = (pthread_t)mem;
|
|
|
|
mem += sizeof(struct pthread);
|
|
|
|
|
|
|
|
for (p=head; p; p=p->next) {
|
|
|
|
if (!p->tls_id) continue;
|
|
|
|
dtv[p->tls_id] = mem + p->tls_offset;
|
|
|
|
memcpy(dtv[p->tls_id], p->tls_image, p->tls_len);
|
|
|
|
}
|
|
|
|
#else
|
2012-10-14 03:25:20 +00:00
|
|
|
mem += libc.tls_size - sizeof(struct pthread);
|
2012-10-06 05:22:51 +00:00
|
|
|
mem -= (uintptr_t)mem & (tls_align-1);
|
|
|
|
td = (pthread_t)mem;
|
|
|
|
|
|
|
|
for (p=head; p; p=p->next) {
|
2012-10-05 15:51:50 +00:00
|
|
|
if (!p->tls_id) continue;
|
2012-10-06 05:22:51 +00:00
|
|
|
dtv[p->tls_id] = mem - p->tls_offset;
|
|
|
|
memcpy(dtv[p->tls_id], p->tls_image, p->tls_len);
|
2012-10-05 00:04:13 +00:00
|
|
|
}
|
2012-10-15 22:51:53 +00:00
|
|
|
#endif
|
2012-10-06 05:22:51 +00:00
|
|
|
td->dtv = dtv;
|
|
|
|
return td;
|
2012-10-05 00:04:13 +00:00
|
|
|
}
|
|
|
|
|
2012-10-05 15:51:50 +00:00
|
|
|
void *__tls_get_addr(size_t *v)
|
2012-10-05 01:01:56 +00:00
|
|
|
{
|
|
|
|
pthread_t self = __pthread_self();
|
2013-06-03 20:35:59 +00:00
|
|
|
if (v[0]<=(size_t)self->dtv[0] && self->dtv[v[0]])
|
2012-10-05 15:51:50 +00:00
|
|
|
return (char *)self->dtv[v[0]]+v[1];
|
|
|
|
|
|
|
|
/* Block signals to make accessing new TLS async-signal-safe */
|
|
|
|
sigset_t set;
|
2012-10-07 03:57:51 +00:00
|
|
|
pthread_sigmask(SIG_BLOCK, SIGALL_SET, &set);
|
2013-06-03 20:35:59 +00:00
|
|
|
if (v[0]<=(size_t)self->dtv[0] && self->dtv[v[0]]) {
|
2012-10-05 15:51:50 +00:00
|
|
|
pthread_sigmask(SIG_SETMASK, &set, 0);
|
|
|
|
return (char *)self->dtv[v[0]]+v[1];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This is safe without any locks held because, if the caller
|
|
|
|
* is able to request the Nth entry of the DTV, the DSO list
|
|
|
|
* must be valid at least that far out and it was synchronized
|
|
|
|
* at program startup or by an already-completed call to dlopen. */
|
|
|
|
struct dso *p;
|
|
|
|
for (p=head; p->tls_id != v[0]; p=p->next);
|
|
|
|
|
|
|
|
/* Get new DTV space from new DSO if needed */
|
2013-06-03 20:35:59 +00:00
|
|
|
if (v[0] > (size_t)self->dtv[0]) {
|
2012-10-05 15:51:50 +00:00
|
|
|
void **newdtv = p->new_dtv +
|
|
|
|
(v[0]+1)*sizeof(void *)*a_fetch_add(&p->new_dtv_idx,1);
|
2013-06-03 20:35:59 +00:00
|
|
|
memcpy(newdtv, self->dtv,
|
2012-10-05 15:51:50 +00:00
|
|
|
((size_t)self->dtv[0]+1) * sizeof(void *));
|
|
|
|
newdtv[0] = (void *)v[0];
|
|
|
|
self->dtv = newdtv;
|
2012-10-05 01:01:56 +00:00
|
|
|
}
|
2012-10-05 15:51:50 +00:00
|
|
|
|
|
|
|
/* Get new TLS memory from new DSO */
|
|
|
|
unsigned char *mem = p->new_tls +
|
|
|
|
(p->tls_size + p->tls_align) * a_fetch_add(&p->new_tls_idx,1);
|
|
|
|
mem += ((uintptr_t)p->tls_image - (uintptr_t)mem) & (p->tls_align-1);
|
|
|
|
self->dtv[v[0]] = mem;
|
2012-10-06 05:22:51 +00:00
|
|
|
memcpy(mem, p->tls_image, p->tls_len);
|
2012-10-05 15:51:50 +00:00
|
|
|
pthread_sigmask(SIG_SETMASK, &set, 0);
|
|
|
|
return mem + v[1];
|
2012-10-05 01:01:56 +00:00
|
|
|
}
|
|
|
|
|
2012-10-06 05:22:51 +00:00
|
|
|
static void update_tls_size()
|
|
|
|
{
|
2012-10-15 22:51:53 +00:00
|
|
|
libc.tls_size = ALIGN(
|
|
|
|
(1+tls_cnt) * sizeof(void *) +
|
|
|
|
tls_offset +
|
|
|
|
sizeof(struct pthread) +
|
|
|
|
tls_align * 2,
|
|
|
|
tls_align);
|
2012-10-06 05:22:51 +00:00
|
|
|
}
|
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
void *__dynlink(int argc, char **argv)
|
2011-06-18 23:48:42 +00:00
|
|
|
{
|
2012-08-25 21:24:46 +00:00
|
|
|
size_t aux[AUX_CNT] = {0};
|
2011-06-18 23:48:42 +00:00
|
|
|
size_t i;
|
|
|
|
Phdr *phdr;
|
2011-06-28 23:40:14 +00:00
|
|
|
Ehdr *ehdr;
|
2011-07-24 04:54:55 +00:00
|
|
|
static struct dso builtin_dsos[3];
|
2011-07-24 04:26:12 +00:00
|
|
|
struct dso *const app = builtin_dsos+0;
|
|
|
|
struct dso *const lib = builtin_dsos+1;
|
2011-07-24 04:54:55 +00:00
|
|
|
struct dso *const vdso = builtin_dsos+2;
|
2011-08-16 04:24:36 +00:00
|
|
|
char *env_preload=0;
|
2012-08-25 21:31:59 +00:00
|
|
|
size_t vdso_base;
|
2012-11-02 03:49:57 +00:00
|
|
|
size_t *auxv;
|
add support for init/fini array in main program, and greatly simplify
modern (4.7.x and later) gcc uses init/fini arrays, rather than the
legacy _init/_fini function pasting and crtbegin/crtend ctors/dtors
system, on most or all archs. some archs had already switched a long
time ago. without following this change, global ctors/dtors will cease
to work under musl when building with new gcc versions.
the most surprising part of this patch is that it actually reduces the
size of the init code, for both static and shared libc. this is
achieved by (1) unifying the handling main program and shared
libraries in the dynamic linker, and (2) eliminating the
glibc-inspired rube goldberg machine for passing around init and fini
function pointers. to clarify, some background:
the function signature for __libc_start_main was based on glibc, as
part of the original goal of being able to run some glibc-linked
binaries. it worked by having the crt1 code, which is linked into
every application, static or dynamic, obtain and pass pointers to the
init and fini functions, which __libc_start_main is then responsible
for using and recording for later use, as necessary. however, in
neither the static-linked nor dynamic-linked case do we actually need
crt1.o's help. with dynamic linking, all the pointers are available in
the _DYNAMIC block. with static linking, it's safe to simply access
the _init/_fini and __init_array_start, etc. symbols directly.
obviously changing the __libc_start_main function signature in an
incompatible way would break both old musl-linked programs and
glibc-linked programs, so let's not do that. instead, the function can
just ignore the information it doesn't need. new archs need not even
provide the useless args in their versions of crt1.o. existing archs
should continue to provide it as long as there is an interest in
having newly-linked applications be able to run on old versions of
musl; at some point in the future, this support can be removed.
2013-07-21 07:00:54 +00:00
|
|
|
char **envp = argv+argc+1;
|
2011-06-18 23:48:42 +00:00
|
|
|
|
|
|
|
/* Find aux vector just past environ[] */
|
2011-06-25 05:56:34 +00:00
|
|
|
for (i=argc+1; argv[i]; i++)
|
|
|
|
if (!memcmp(argv[i], "LD_LIBRARY_PATH=", 16))
|
|
|
|
env_path = argv[i]+16;
|
2011-08-16 04:24:36 +00:00
|
|
|
else if (!memcmp(argv[i], "LD_PRELOAD=", 11))
|
|
|
|
env_preload = argv[i]+11;
|
2011-06-18 23:48:42 +00:00
|
|
|
auxv = (void *)(argv+i+1);
|
|
|
|
|
|
|
|
decode_vec(auxv, aux, AUX_CNT);
|
|
|
|
|
2011-06-25 05:56:34 +00:00
|
|
|
/* Only trust user/env if kernel says we're not suid/sgid */
|
|
|
|
if ((aux[0]&0x7800)!=0x7800 || aux[AT_UID]!=aux[AT_EUID]
|
2011-08-16 11:46:42 +00:00
|
|
|
|| aux[AT_GID]!=aux[AT_EGID] || aux[AT_SECURE]) {
|
2011-06-25 05:56:34 +00:00
|
|
|
env_path = 0;
|
2011-08-16 04:24:36 +00:00
|
|
|
env_preload = 0;
|
2011-06-25 05:56:34 +00:00
|
|
|
}
|
|
|
|
|
2012-05-27 20:01:44 +00:00
|
|
|
/* If the dynamic linker was invoked as a program itself, AT_BASE
|
|
|
|
* will not be set. In that case, we assume the base address is
|
|
|
|
* the start of the page containing the PHDRs; I don't know any
|
|
|
|
* better approach... */
|
|
|
|
if (!aux[AT_BASE]) {
|
|
|
|
aux[AT_BASE] = aux[AT_PHDR] & -PAGE_SIZE;
|
|
|
|
aux[AT_PHDR] = aux[AT_PHENT] = aux[AT_PHNUM] = 0;
|
|
|
|
}
|
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
/* The dynamic linker load address is passed by the kernel
|
|
|
|
* in the AUX vector, so this is easy. */
|
|
|
|
lib->base = (void *)aux[AT_BASE];
|
2012-05-27 20:01:44 +00:00
|
|
|
lib->name = lib->shortname = "libc.so";
|
2012-01-23 05:57:38 +00:00
|
|
|
lib->global = 1;
|
|
|
|
ehdr = (void *)lib->base;
|
2012-11-01 01:27:48 +00:00
|
|
|
lib->phnum = ehdr->e_phnum;
|
|
|
|
lib->phdr = (void *)(aux[AT_BASE]+ehdr->e_phoff);
|
|
|
|
find_map_range(lib->phdr, ehdr->e_phnum, ehdr->e_phentsize, lib);
|
|
|
|
lib->dynv = (void *)(lib->base + find_dyn(lib->phdr,
|
2013-07-28 01:37:05 +00:00
|
|
|
ehdr->e_phnum, ehdr->e_phentsize));
|
2012-01-23 05:57:38 +00:00
|
|
|
decode_dyn(lib);
|
|
|
|
|
2012-05-27 20:01:44 +00:00
|
|
|
if (aux[AT_PHDR]) {
|
2012-07-13 05:31:02 +00:00
|
|
|
size_t interp_off = 0;
|
2012-10-05 00:04:13 +00:00
|
|
|
size_t tls_image = 0;
|
2012-05-27 20:01:44 +00:00
|
|
|
/* Find load address of the main program, via AT_PHDR vs PT_PHDR. */
|
2012-11-01 01:27:48 +00:00
|
|
|
app->phdr = phdr = (void *)aux[AT_PHDR];
|
|
|
|
app->phnum = aux[AT_PHNUM];
|
2012-05-27 20:01:44 +00:00
|
|
|
for (i=aux[AT_PHNUM]; i; i--, phdr=(void *)((char *)phdr + aux[AT_PHENT])) {
|
|
|
|
if (phdr->p_type == PT_PHDR)
|
|
|
|
app->base = (void *)(aux[AT_PHDR] - phdr->p_vaddr);
|
2012-07-13 05:31:02 +00:00
|
|
|
else if (phdr->p_type == PT_INTERP)
|
|
|
|
interp_off = (size_t)phdr->p_vaddr;
|
2012-10-05 00:04:13 +00:00
|
|
|
else if (phdr->p_type == PT_TLS) {
|
|
|
|
tls_image = phdr->p_vaddr;
|
|
|
|
app->tls_len = phdr->p_filesz;
|
|
|
|
app->tls_size = phdr->p_memsz;
|
|
|
|
app->tls_align = phdr->p_align;
|
|
|
|
}
|
2012-05-27 20:01:44 +00:00
|
|
|
}
|
2012-10-05 00:04:13 +00:00
|
|
|
if (app->tls_size) app->tls_image = (char *)app->base + tls_image;
|
2012-07-13 05:31:02 +00:00
|
|
|
if (interp_off) lib->name = (char *)app->base + interp_off;
|
2012-07-11 05:41:20 +00:00
|
|
|
app->name = argv[0];
|
2012-05-27 20:01:44 +00:00
|
|
|
app->dynv = (void *)(app->base + find_dyn(
|
|
|
|
(void *)aux[AT_PHDR], aux[AT_PHNUM], aux[AT_PHENT]));
|
2012-08-27 01:09:26 +00:00
|
|
|
find_map_range((void *)aux[AT_PHDR],
|
|
|
|
aux[AT_PHNUM], aux[AT_PHENT], app);
|
2012-05-27 20:01:44 +00:00
|
|
|
} else {
|
|
|
|
int fd;
|
|
|
|
char *ldname = argv[0];
|
2012-11-02 03:46:39 +00:00
|
|
|
size_t l = strlen(ldname);
|
2012-05-27 20:01:44 +00:00
|
|
|
if (l >= 3 && !strcmp(ldname+l-3, "ldd")) ldd_mode = 1;
|
|
|
|
*argv++ = (void *)-1;
|
|
|
|
if (argv[0] && !strcmp(argv[0], "--")) *argv++ = (void *)-1;
|
|
|
|
if (!argv[0]) {
|
|
|
|
dprintf(2, "musl libc/dynamic program loader\n");
|
|
|
|
dprintf(2, "usage: %s pathname%s\n", ldname,
|
|
|
|
ldd_mode ? "" : " [args]");
|
|
|
|
_exit(1);
|
|
|
|
}
|
|
|
|
fd = open(argv[0], O_RDONLY);
|
|
|
|
if (fd < 0) {
|
|
|
|
dprintf(2, "%s: cannot load %s: %s\n", ldname, argv[0], strerror(errno));
|
|
|
|
_exit(1);
|
|
|
|
}
|
|
|
|
runtime = 1;
|
2012-10-05 00:04:13 +00:00
|
|
|
ehdr = (void *)map_library(fd, app);
|
2012-05-27 20:01:44 +00:00
|
|
|
if (!ehdr) {
|
|
|
|
dprintf(2, "%s: %s: Not a valid dynamic program\n", ldname, argv[0]);
|
|
|
|
_exit(1);
|
|
|
|
}
|
|
|
|
runtime = 0;
|
|
|
|
close(fd);
|
2012-07-13 05:31:02 +00:00
|
|
|
lib->name = ldname;
|
2012-07-11 05:41:20 +00:00
|
|
|
app->name = argv[0];
|
2013-07-26 18:25:51 +00:00
|
|
|
aux[AT_ENTRY] = (size_t)app->base + ehdr->e_entry;
|
2013-07-26 18:41:12 +00:00
|
|
|
/* Find the name that would have been used for the dynamic
|
|
|
|
* linker had ldd not taken its place. */
|
|
|
|
if (ldd_mode) {
|
|
|
|
for (i=0; i<app->phnum; i++) {
|
|
|
|
if (app->phdr[i].p_type == PT_INTERP)
|
|
|
|
lib->name = (void *)(app->base
|
|
|
|
+ app->phdr[i].p_vaddr);
|
|
|
|
}
|
|
|
|
dprintf(1, "\t%s (%p)\n", lib->name, lib->base);
|
|
|
|
}
|
2012-01-23 07:02:59 +00:00
|
|
|
}
|
2012-10-05 00:04:13 +00:00
|
|
|
if (app->tls_size) {
|
2012-10-06 05:22:51 +00:00
|
|
|
app->tls_id = tls_cnt = 1;
|
2012-10-15 22:51:53 +00:00
|
|
|
#ifdef TLS_ABOVE_TP
|
|
|
|
app->tls_offset = 0;
|
|
|
|
tls_offset = app->tls_size
|
|
|
|
+ ( -((uintptr_t)app->tls_image + app->tls_size)
|
|
|
|
& (app->tls_align-1) );
|
|
|
|
#else
|
2012-10-14 23:56:50 +00:00
|
|
|
tls_offset = app->tls_offset = app->tls_size
|
|
|
|
+ ( -((uintptr_t)app->tls_image + app->tls_size)
|
|
|
|
& (app->tls_align-1) );
|
2012-10-15 22:51:53 +00:00
|
|
|
#endif
|
2012-10-06 05:22:51 +00:00
|
|
|
tls_align = MAXP2(tls_align, app->tls_align);
|
2012-10-05 00:04:13 +00:00
|
|
|
}
|
2012-01-23 05:57:38 +00:00
|
|
|
app->global = 1;
|
|
|
|
decode_dyn(app);
|
|
|
|
|
|
|
|
/* Attach to vdso, if provided by the kernel */
|
2012-08-25 21:31:59 +00:00
|
|
|
if (search_vec(auxv, &vdso_base, AT_SYSINFO_EHDR)) {
|
2011-07-24 04:54:55 +00:00
|
|
|
ehdr = (void *)vdso_base;
|
2012-11-01 01:27:48 +00:00
|
|
|
vdso->phdr = phdr = (void *)(vdso_base + ehdr->e_phoff);
|
|
|
|
vdso->phnum = ehdr->e_phnum;
|
2011-07-24 04:54:55 +00:00
|
|
|
for (i=ehdr->e_phnum; i; i--, phdr=(void *)((char *)phdr + ehdr->e_phentsize)) {
|
|
|
|
if (phdr->p_type == PT_DYNAMIC)
|
|
|
|
vdso->dynv = (void *)(vdso_base + phdr->p_offset);
|
|
|
|
if (phdr->p_type == PT_LOAD)
|
|
|
|
vdso->base = (void *)(vdso_base - phdr->p_vaddr + phdr->p_offset);
|
|
|
|
}
|
2012-11-26 01:56:31 +00:00
|
|
|
vdso->name = "";
|
|
|
|
vdso->shortname = "linux-gate.so.1";
|
2011-07-24 06:19:47 +00:00
|
|
|
vdso->global = 1;
|
2012-01-23 05:57:38 +00:00
|
|
|
decode_dyn(vdso);
|
2011-07-24 04:54:55 +00:00
|
|
|
vdso->prev = lib;
|
|
|
|
lib->next = vdso;
|
|
|
|
}
|
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
/* Initial dso chain consists only of the app. We temporarily
|
|
|
|
* append the dynamic linker/libc so we can relocate it, then
|
|
|
|
* restore the initial chain in preparation for loading third
|
|
|
|
* party libraries (preload/needed). */
|
|
|
|
head = tail = app;
|
2012-10-14 03:25:20 +00:00
|
|
|
ldso = lib;
|
2012-01-23 05:57:38 +00:00
|
|
|
app->next = lib;
|
|
|
|
reloc_all(lib);
|
|
|
|
app->next = 0;
|
2011-06-18 23:48:42 +00:00
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
/* PAST THIS POINT, ALL LIBC INTERFACES ARE FULLY USABLE. */
|
2011-06-18 23:48:42 +00:00
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
/* Donate unused parts of app and library mapping to malloc */
|
2011-07-24 04:26:12 +00:00
|
|
|
reclaim_gaps(app->base, (void *)aux[AT_PHDR], aux[AT_PHENT], aux[AT_PHNUM]);
|
|
|
|
ehdr = (void *)lib->base;
|
|
|
|
reclaim_gaps(lib->base, (void *)(lib->base+ehdr->e_phoff),
|
2011-06-28 23:40:14 +00:00
|
|
|
ehdr->e_phentsize, ehdr->e_phnum);
|
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
/* Load preload/needed libraries, add their symbols to the global
|
2012-01-23 23:32:40 +00:00
|
|
|
* namespace, and perform all remaining relocations. The main
|
|
|
|
* program must be relocated LAST since it may contain copy
|
|
|
|
* relocations which depend on libraries' relocations. */
|
2011-08-16 04:24:36 +00:00
|
|
|
if (env_preload) load_preload(env_preload);
|
2012-01-23 05:57:38 +00:00
|
|
|
load_deps(app);
|
|
|
|
make_global(app);
|
2012-10-05 02:48:33 +00:00
|
|
|
|
2012-10-06 05:22:51 +00:00
|
|
|
reloc_all(app->next);
|
|
|
|
reloc_all(app);
|
|
|
|
|
|
|
|
update_tls_size();
|
2012-10-05 02:48:33 +00:00
|
|
|
if (tls_cnt) {
|
2012-10-14 03:25:20 +00:00
|
|
|
void *mem = mmap(0, libc.tls_size, PROT_READ|PROT_WRITE,
|
2012-10-05 02:48:33 +00:00
|
|
|
MAP_ANONYMOUS|MAP_PRIVATE, -1, 0);
|
|
|
|
if (mem==MAP_FAILED ||
|
2012-10-05 15:51:50 +00:00
|
|
|
!__install_initial_tls(__copy_tls(mem))) {
|
2012-10-05 02:48:33 +00:00
|
|
|
dprintf(2, "%s: Error getting %zu bytes thread-local storage: %m\n",
|
2012-10-14 03:25:20 +00:00
|
|
|
argv[0], libc.tls_size);
|
2012-10-05 02:48:33 +00:00
|
|
|
_exit(127);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-18 20:00:23 +00:00
|
|
|
if (ldso_fail) _exit(127);
|
2012-05-27 20:01:44 +00:00
|
|
|
if (ldd_mode) _exit(0);
|
|
|
|
|
2012-01-23 05:57:38 +00:00
|
|
|
/* Switch to runtime mode: any further failures in the dynamic
|
|
|
|
* linker are a reportable failure rather than a fatal startup
|
|
|
|
* error. If the dynamic loader (dlopen) will not be used, free
|
|
|
|
* all memory used by the dynamic linker. */
|
2011-07-24 04:26:12 +00:00
|
|
|
runtime = 1;
|
2012-02-06 19:39:09 +00:00
|
|
|
|
2012-08-05 18:03:17 +00:00
|
|
|
#ifndef DYNAMIC_IS_RO
|
2012-04-25 04:05:42 +00:00
|
|
|
for (i=0; app->dynv[i]; i+=2)
|
|
|
|
if (app->dynv[i]==DT_DEBUG)
|
|
|
|
app->dynv[i+1] = (size_t)&debug;
|
2012-08-05 18:03:17 +00:00
|
|
|
#endif
|
2012-04-25 04:05:42 +00:00
|
|
|
debug.ver = 1;
|
|
|
|
debug.bp = _dl_debug_state;
|
|
|
|
debug.head = head;
|
|
|
|
debug.base = lib->base;
|
|
|
|
debug.state = 0;
|
|
|
|
_dl_debug_state();
|
|
|
|
|
2012-10-08 01:43:46 +00:00
|
|
|
if (ssp_used) __init_ssp((void *)aux[AT_RANDOM]);
|
add support for init/fini array in main program, and greatly simplify
modern (4.7.x and later) gcc uses init/fini arrays, rather than the
legacy _init/_fini function pasting and crtbegin/crtend ctors/dtors
system, on most or all archs. some archs had already switched a long
time ago. without following this change, global ctors/dtors will cease
to work under musl when building with new gcc versions.
the most surprising part of this patch is that it actually reduces the
size of the init code, for both static and shared libc. this is
achieved by (1) unifying the handling main program and shared
libraries in the dynamic linker, and (2) eliminating the
glibc-inspired rube goldberg machine for passing around init and fini
function pointers. to clarify, some background:
the function signature for __libc_start_main was based on glibc, as
part of the original goal of being able to run some glibc-linked
binaries. it worked by having the crt1 code, which is linked into
every application, static or dynamic, obtain and pass pointers to the
init and fini functions, which __libc_start_main is then responsible
for using and recording for later use, as necessary. however, in
neither the static-linked nor dynamic-linked case do we actually need
crt1.o's help. with dynamic linking, all the pointers are available in
the _DYNAMIC block. with static linking, it's safe to simply access
the _init/_fini and __init_array_start, etc. symbols directly.
obviously changing the __libc_start_main function signature in an
incompatible way would break both old musl-linked programs and
glibc-linked programs, so let's not do that. instead, the function can
just ignore the information it doesn't need. new archs need not even
provide the useless args in their versions of crt1.o. existing archs
should continue to provide it as long as there is an interest in
having newly-linked applications be able to run on old versions of
musl; at some point in the future, this support can be removed.
2013-07-21 07:00:54 +00:00
|
|
|
__init_libc(envp, argv[0]);
|
2012-11-30 22:56:23 +00:00
|
|
|
atexit(do_fini);
|
add support for init/fini array in main program, and greatly simplify
modern (4.7.x and later) gcc uses init/fini arrays, rather than the
legacy _init/_fini function pasting and crtbegin/crtend ctors/dtors
system, on most or all archs. some archs had already switched a long
time ago. without following this change, global ctors/dtors will cease
to work under musl when building with new gcc versions.
the most surprising part of this patch is that it actually reduces the
size of the init code, for both static and shared libc. this is
achieved by (1) unifying the handling main program and shared
libraries in the dynamic linker, and (2) eliminating the
glibc-inspired rube goldberg machine for passing around init and fini
function pointers. to clarify, some background:
the function signature for __libc_start_main was based on glibc, as
part of the original goal of being able to run some glibc-linked
binaries. it worked by having the crt1 code, which is linked into
every application, static or dynamic, obtain and pass pointers to the
init and fini functions, which __libc_start_main is then responsible
for using and recording for later use, as necessary. however, in
neither the static-linked nor dynamic-linked case do we actually need
crt1.o's help. with dynamic linking, all the pointers are available in
the _DYNAMIC block. with static linking, it's safe to simply access
the _init/_fini and __init_array_start, etc. symbols directly.
obviously changing the __libc_start_main function signature in an
incompatible way would break both old musl-linked programs and
glibc-linked programs, so let's not do that. instead, the function can
just ignore the information it doesn't need. new archs need not even
provide the useless args in their versions of crt1.o. existing archs
should continue to provide it as long as there is an interest in
having newly-linked applications be able to run on old versions of
musl; at some point in the future, this support can be removed.
2013-07-21 07:00:54 +00:00
|
|
|
errno = 0;
|
2012-11-30 22:56:23 +00:00
|
|
|
do_init_fini(tail);
|
add support for init/fini array in main program, and greatly simplify
modern (4.7.x and later) gcc uses init/fini arrays, rather than the
legacy _init/_fini function pasting and crtbegin/crtend ctors/dtors
system, on most or all archs. some archs had already switched a long
time ago. without following this change, global ctors/dtors will cease
to work under musl when building with new gcc versions.
the most surprising part of this patch is that it actually reduces the
size of the init code, for both static and shared libc. this is
achieved by (1) unifying the handling main program and shared
libraries in the dynamic linker, and (2) eliminating the
glibc-inspired rube goldberg machine for passing around init and fini
function pointers. to clarify, some background:
the function signature for __libc_start_main was based on glibc, as
part of the original goal of being able to run some glibc-linked
binaries. it worked by having the crt1 code, which is linked into
every application, static or dynamic, obtain and pass pointers to the
init and fini functions, which __libc_start_main is then responsible
for using and recording for later use, as necessary. however, in
neither the static-linked nor dynamic-linked case do we actually need
crt1.o's help. with dynamic linking, all the pointers are available in
the _DYNAMIC block. with static linking, it's safe to simply access
the _init/_fini and __init_array_start, etc. symbols directly.
obviously changing the __libc_start_main function signature in an
incompatible way would break both old musl-linked programs and
glibc-linked programs, so let's not do that. instead, the function can
just ignore the information it doesn't need. new archs need not even
provide the useless args in their versions of crt1.o. existing archs
should continue to provide it as long as there is an interest in
having newly-linked applications be able to run on old versions of
musl; at some point in the future, this support can be removed.
2013-07-21 07:00:54 +00:00
|
|
|
|
|
|
|
return (void *)aux[AT_ENTRY];
|
2012-11-30 22:56:23 +00:00
|
|
|
}
|
|
|
|
|
2011-06-26 23:23:28 +00:00
|
|
|
void *dlopen(const char *file, int mode)
|
|
|
|
{
|
2012-10-05 05:15:25 +00:00
|
|
|
struct dso *volatile p, *orig_tail, *next;
|
2012-10-06 05:22:51 +00:00
|
|
|
size_t orig_tls_cnt, orig_tls_offset, orig_tls_align;
|
2011-06-26 23:23:28 +00:00
|
|
|
size_t i;
|
2012-02-08 01:31:27 +00:00
|
|
|
int cs;
|
2013-07-24 06:38:05 +00:00
|
|
|
jmp_buf jb;
|
2011-06-26 23:23:28 +00:00
|
|
|
|
|
|
|
if (!file) return head;
|
|
|
|
|
2012-02-08 01:31:27 +00:00
|
|
|
pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, &cs);
|
2011-06-26 23:23:28 +00:00
|
|
|
pthread_rwlock_wrlock(&lock);
|
2012-10-05 15:51:50 +00:00
|
|
|
__inhibit_ptc();
|
2011-06-26 23:23:28 +00:00
|
|
|
|
2012-10-05 15:51:50 +00:00
|
|
|
p = 0;
|
|
|
|
orig_tls_cnt = tls_cnt;
|
2012-10-06 05:22:51 +00:00
|
|
|
orig_tls_offset = tls_offset;
|
|
|
|
orig_tls_align = tls_align;
|
2012-10-05 05:15:25 +00:00
|
|
|
orig_tail = tail;
|
2013-01-24 03:07:45 +00:00
|
|
|
noload = mode & RTLD_NOLOAD;
|
2012-10-05 05:15:25 +00:00
|
|
|
|
2013-07-24 06:38:05 +00:00
|
|
|
rtld_fail = &jb;
|
|
|
|
if (setjmp(*rtld_fail)) {
|
2011-06-26 23:23:28 +00:00
|
|
|
/* Clean up anything new that was (partially) loaded */
|
2012-10-05 15:51:50 +00:00
|
|
|
if (p && p->deps) for (i=0; p->deps[i]; i++)
|
2011-06-27 01:21:04 +00:00
|
|
|
if (p->deps[i]->global < 0)
|
|
|
|
p->deps[i]->global = 0;
|
2011-06-26 23:23:28 +00:00
|
|
|
for (p=orig_tail->next; p; p=next) {
|
|
|
|
next = p->next;
|
|
|
|
munmap(p->map, p->map_len);
|
|
|
|
free(p->deps);
|
|
|
|
free(p);
|
|
|
|
}
|
2012-10-05 15:51:50 +00:00
|
|
|
tls_cnt = orig_tls_cnt;
|
2012-10-06 05:22:51 +00:00
|
|
|
tls_offset = orig_tls_offset;
|
|
|
|
tls_align = orig_tls_align;
|
2011-06-26 23:23:28 +00:00
|
|
|
tail = orig_tail;
|
|
|
|
tail->next = 0;
|
2012-02-08 01:31:27 +00:00
|
|
|
p = 0;
|
2012-04-23 16:03:31 +00:00
|
|
|
errflag = 1;
|
|
|
|
goto end;
|
2012-03-23 04:28:20 +00:00
|
|
|
} else p = load_library(file);
|
|
|
|
|
|
|
|
if (!p) {
|
2013-01-24 03:07:45 +00:00
|
|
|
snprintf(errbuf, sizeof errbuf, noload ?
|
|
|
|
"Library %s is not already loaded" :
|
|
|
|
"Error loading shared library %s: %m",
|
|
|
|
file);
|
2012-03-23 04:28:20 +00:00
|
|
|
errflag = 1;
|
2012-02-08 01:31:27 +00:00
|
|
|
goto end;
|
2011-06-26 23:23:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* First load handling */
|
|
|
|
if (!p->deps) {
|
|
|
|
load_deps(p);
|
2011-06-27 01:36:44 +00:00
|
|
|
if (p->deps) for (i=0; p->deps[i]; i++)
|
2011-06-27 01:21:04 +00:00
|
|
|
if (!p->deps[i]->global)
|
|
|
|
p->deps[i]->global = -1;
|
|
|
|
if (!p->global) p->global = -1;
|
2011-06-26 23:23:28 +00:00
|
|
|
reloc_all(p);
|
2011-06-27 01:36:44 +00:00
|
|
|
if (p->deps) for (i=0; p->deps[i]; i++)
|
2011-06-27 01:21:04 +00:00
|
|
|
if (p->deps[i]->global < 0)
|
|
|
|
p->deps[i]->global = 0;
|
|
|
|
if (p->global < 0) p->global = 0;
|
2011-06-26 23:23:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (mode & RTLD_GLOBAL) {
|
2011-06-27 01:36:44 +00:00
|
|
|
if (p->deps) for (i=0; p->deps[i]; i++)
|
2011-06-26 23:23:28 +00:00
|
|
|
p->deps[i]->global = 1;
|
|
|
|
p->global = 1;
|
|
|
|
}
|
|
|
|
|
2012-10-06 05:22:51 +00:00
|
|
|
update_tls_size();
|
2012-10-05 15:51:50 +00:00
|
|
|
|
2012-11-02 03:49:57 +00:00
|
|
|
if (ssp_used) __init_ssp(libc.auxv);
|
2012-08-25 21:24:46 +00:00
|
|
|
|
2012-04-25 04:05:42 +00:00
|
|
|
_dl_debug_state();
|
2012-10-05 17:09:09 +00:00
|
|
|
orig_tail = tail;
|
2011-06-27 02:09:32 +00:00
|
|
|
end:
|
2012-10-05 15:51:50 +00:00
|
|
|
__release_ptc();
|
2012-11-01 01:27:48 +00:00
|
|
|
if (p) gencnt++;
|
2011-06-26 23:23:28 +00:00
|
|
|
pthread_rwlock_unlock(&lock);
|
2012-10-05 17:09:09 +00:00
|
|
|
if (p) do_init_fini(orig_tail);
|
2012-02-08 01:31:27 +00:00
|
|
|
pthread_setcancelstate(cs, 0);
|
2011-06-26 23:23:28 +00:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2013-01-16 16:49:00 +00:00
|
|
|
static int invalid_dso_handle(void *h)
|
2013-01-10 19:05:40 +00:00
|
|
|
{
|
|
|
|
struct dso *p;
|
|
|
|
for (p=head; p; p=p->next) if (h==p) return 0;
|
|
|
|
snprintf(errbuf, sizeof errbuf, "Invalid library handle %p", (void *)h);
|
|
|
|
errflag = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2011-08-16 04:42:13 +00:00
|
|
|
static void *do_dlsym(struct dso *p, const char *s, void *ra)
|
2011-06-26 23:23:28 +00:00
|
|
|
{
|
|
|
|
size_t i;
|
2012-08-25 21:13:28 +00:00
|
|
|
uint32_t h = 0, gh = 0;
|
2011-06-26 23:23:28 +00:00
|
|
|
Sym *sym;
|
2012-10-05 02:48:33 +00:00
|
|
|
if (p == head || p == RTLD_DEFAULT || p == RTLD_NEXT) {
|
2012-10-20 01:41:30 +00:00
|
|
|
if (p == RTLD_DEFAULT) {
|
|
|
|
p = head;
|
|
|
|
} else if (p == RTLD_NEXT) {
|
2012-10-05 02:48:33 +00:00
|
|
|
for (p=head; p && (unsigned char *)ra-p->map>p->map_len; p=p->next);
|
|
|
|
if (!p) p=head;
|
2012-10-20 01:41:30 +00:00
|
|
|
p = p->next;
|
2012-10-05 02:48:33 +00:00
|
|
|
}
|
2012-10-20 01:41:30 +00:00
|
|
|
struct symdef def = find_sym(p, s, 0);
|
2012-10-05 02:48:33 +00:00
|
|
|
if (!def.sym) goto failed;
|
2012-10-20 01:57:56 +00:00
|
|
|
if ((def.sym->st_info&0xf) == STT_TLS)
|
|
|
|
return __tls_get_addr((size_t []){def.dso->tls_id, def.sym->st_value});
|
2012-10-05 02:48:33 +00:00
|
|
|
return def.dso->base + def.sym->st_value;
|
2012-03-23 04:28:20 +00:00
|
|
|
}
|
2013-01-24 01:21:36 +00:00
|
|
|
if (p != RTLD_DEFAULT && p != RTLD_NEXT && invalid_dso_handle(p))
|
|
|
|
return 0;
|
2012-08-25 21:13:28 +00:00
|
|
|
if (p->ghashtab) {
|
|
|
|
gh = gnu_hash(s);
|
|
|
|
sym = gnu_lookup(s, gh, p);
|
|
|
|
} else {
|
|
|
|
h = sysv_hash(s);
|
|
|
|
sym = sysv_lookup(s, h, p);
|
|
|
|
}
|
2012-10-20 01:57:56 +00:00
|
|
|
if (sym && (sym->st_info&0xf) == STT_TLS)
|
|
|
|
return __tls_get_addr((size_t []){p->tls_id, sym->st_value});
|
2011-06-26 23:23:28 +00:00
|
|
|
if (sym && sym->st_value && (1<<(sym->st_info&0xf) & OK_TYPES))
|
|
|
|
return p->base + sym->st_value;
|
|
|
|
if (p->deps) for (i=0; p->deps[i]; i++) {
|
2012-08-25 21:13:28 +00:00
|
|
|
if (p->deps[i]->ghashtab) {
|
|
|
|
if (!gh) gh = gnu_hash(s);
|
2012-08-25 21:40:27 +00:00
|
|
|
sym = gnu_lookup(s, gh, p->deps[i]);
|
2012-08-25 21:13:28 +00:00
|
|
|
} else {
|
|
|
|
if (!h) h = sysv_hash(s);
|
|
|
|
sym = sysv_lookup(s, h, p->deps[i]);
|
|
|
|
}
|
2012-10-20 01:57:56 +00:00
|
|
|
if (sym && (sym->st_info&0xf) == STT_TLS)
|
|
|
|
return __tls_get_addr((size_t []){p->deps[i]->tls_id, sym->st_value});
|
2011-06-26 23:23:28 +00:00
|
|
|
if (sym && sym->st_value && (1<<(sym->st_info&0xf) & OK_TYPES))
|
|
|
|
return p->deps[i]->base + sym->st_value;
|
|
|
|
}
|
2012-05-05 00:18:18 +00:00
|
|
|
failed:
|
2012-03-23 04:28:20 +00:00
|
|
|
errflag = 1;
|
2012-04-23 16:03:31 +00:00
|
|
|
snprintf(errbuf, sizeof errbuf, "Symbol not found: %s", s);
|
2011-06-26 23:23:28 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-08-27 01:09:26 +00:00
|
|
|
int __dladdr(void *addr, Dl_info *info)
|
|
|
|
{
|
|
|
|
struct dso *p;
|
|
|
|
Sym *sym;
|
|
|
|
uint32_t nsym;
|
|
|
|
char *strings;
|
|
|
|
size_t i;
|
|
|
|
void *best = 0;
|
|
|
|
char *bestname;
|
|
|
|
|
|
|
|
pthread_rwlock_rdlock(&lock);
|
|
|
|
for (p=head; p && (unsigned char *)addr-p->map>p->map_len; p=p->next);
|
|
|
|
pthread_rwlock_unlock(&lock);
|
|
|
|
|
|
|
|
if (!p) return 0;
|
|
|
|
|
|
|
|
sym = p->syms;
|
|
|
|
strings = p->strings;
|
|
|
|
if (p->hashtab) {
|
|
|
|
nsym = p->hashtab[1];
|
|
|
|
} else {
|
|
|
|
uint32_t *buckets;
|
|
|
|
uint32_t *hashval;
|
|
|
|
buckets = p->ghashtab + 4 + (p->ghashtab[2]*sizeof(size_t)/4);
|
|
|
|
sym += p->ghashtab[1];
|
|
|
|
for (i = 0; i < p->ghashtab[0]; i++) {
|
|
|
|
if (buckets[i] > nsym)
|
|
|
|
nsym = buckets[i];
|
|
|
|
}
|
|
|
|
if (nsym) {
|
|
|
|
nsym -= p->ghashtab[1];
|
|
|
|
hashval = buckets + p->ghashtab[0] + nsym;
|
|
|
|
do nsym++;
|
|
|
|
while (!(*hashval++ & 1));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (; nsym; nsym--, sym++) {
|
2013-01-16 16:47:35 +00:00
|
|
|
if (sym->st_value
|
2012-08-27 01:09:26 +00:00
|
|
|
&& (1<<(sym->st_info&0xf) & OK_TYPES)
|
|
|
|
&& (1<<(sym->st_info>>4) & OK_BINDS)) {
|
|
|
|
void *symaddr = p->base + sym->st_value;
|
|
|
|
if (symaddr > addr || symaddr < best)
|
|
|
|
continue;
|
|
|
|
best = symaddr;
|
|
|
|
bestname = strings + sym->st_name;
|
|
|
|
if (addr == symaddr)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!best) return 0;
|
|
|
|
|
|
|
|
info->dli_fname = p->name;
|
|
|
|
info->dli_fbase = p->base;
|
|
|
|
info->dli_sname = bestname;
|
|
|
|
info->dli_saddr = best;
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2012-09-07 02:44:55 +00:00
|
|
|
void *__dlsym(void *restrict p, const char *restrict s, void *restrict ra)
|
2011-06-26 23:23:28 +00:00
|
|
|
{
|
|
|
|
void *res;
|
|
|
|
pthread_rwlock_rdlock(&lock);
|
2011-08-16 04:42:13 +00:00
|
|
|
res = do_dlsym(p, s, ra);
|
2011-06-26 23:23:28 +00:00
|
|
|
pthread_rwlock_unlock(&lock);
|
|
|
|
return res;
|
|
|
|
}
|
2012-11-01 01:27:48 +00:00
|
|
|
|
|
|
|
int dl_iterate_phdr(int(*callback)(struct dl_phdr_info *info, size_t size, void *data), void *data)
|
|
|
|
{
|
|
|
|
struct dso *current;
|
|
|
|
struct dl_phdr_info info;
|
|
|
|
int ret = 0;
|
|
|
|
for(current = head; current;) {
|
|
|
|
info.dlpi_addr = (uintptr_t)current->base;
|
|
|
|
info.dlpi_name = current->name;
|
|
|
|
info.dlpi_phdr = current->phdr;
|
|
|
|
info.dlpi_phnum = current->phnum;
|
|
|
|
info.dlpi_adds = gencnt;
|
|
|
|
info.dlpi_subs = 0;
|
|
|
|
info.dlpi_tls_modid = current->tls_id;
|
|
|
|
info.dlpi_tls_data = current->tls_image;
|
|
|
|
|
|
|
|
ret = (callback)(&info, sizeof (info), data);
|
|
|
|
|
|
|
|
if (ret != 0) break;
|
|
|
|
|
|
|
|
pthread_rwlock_rdlock(&lock);
|
|
|
|
current = current->next;
|
|
|
|
pthread_rwlock_unlock(&lock);
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2012-02-03 08:16:07 +00:00
|
|
|
#else
|
2013-01-16 16:49:00 +00:00
|
|
|
static int invalid_dso_handle(void *h)
|
2013-01-10 19:05:40 +00:00
|
|
|
{
|
|
|
|
snprintf(errbuf, sizeof errbuf, "Invalid library handle %p", (void *)h);
|
|
|
|
errflag = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
2012-02-03 08:16:07 +00:00
|
|
|
void *dlopen(const char *file, int mode)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2012-09-07 02:44:55 +00:00
|
|
|
void *__dlsym(void *restrict p, const char *restrict s, void *restrict ra)
|
2012-02-03 08:16:07 +00:00
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2012-08-27 01:09:26 +00:00
|
|
|
int __dladdr (void *addr, Dl_info *info)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2012-02-03 08:16:07 +00:00
|
|
|
#endif
|
2011-06-26 23:23:28 +00:00
|
|
|
|
2013-06-29 16:46:46 +00:00
|
|
|
int __dlinfo(void *dso, int req, void *res)
|
|
|
|
{
|
|
|
|
if (invalid_dso_handle(dso)) return -1;
|
|
|
|
if (req != RTLD_DI_LINKMAP) {
|
|
|
|
snprintf(errbuf, sizeof errbuf, "Unsupported request %d", req);
|
|
|
|
errflag = 1;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
*(struct link_map **)res = dso;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-06-26 23:23:28 +00:00
|
|
|
char *dlerror()
|
|
|
|
{
|
2012-03-23 04:28:20 +00:00
|
|
|
if (!errflag) return 0;
|
|
|
|
errflag = 0;
|
2012-04-23 16:03:31 +00:00
|
|
|
return errbuf;
|
2011-06-26 23:23:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int dlclose(void *p)
|
|
|
|
{
|
2013-01-10 19:05:40 +00:00
|
|
|
return invalid_dso_handle(p);
|
2011-06-26 23:23:28 +00:00
|
|
|
}
|