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>
|
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>
|
2011-06-18 23:48:42 +00:00
|
|
|
|
|
|
|
#include "reloc.h"
|
|
|
|
|
|
|
|
#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
|
|
|
|
|
|
|
|
struct dso
|
|
|
|
{
|
|
|
|
struct dso *next, *prev;
|
|
|
|
int refcnt;
|
|
|
|
size_t *dynv;
|
|
|
|
Sym *syms;
|
2011-06-19 02:52:01 +00:00
|
|
|
uint32_t *hashtab;
|
2011-06-18 23:48:42 +00:00
|
|
|
char *strings;
|
|
|
|
unsigned char *base;
|
|
|
|
unsigned char *map;
|
|
|
|
size_t map_len;
|
|
|
|
dev_t dev;
|
|
|
|
ino_t ino;
|
|
|
|
int global;
|
|
|
|
int relocated;
|
2011-06-26 23:23:28 +00:00
|
|
|
struct dso **deps;
|
2011-06-26 21:39:17 +00:00
|
|
|
char *name;
|
|
|
|
char buf[];
|
2011-06-18 23:48:42 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct dso *head, *tail, *libc;
|
2011-07-01 03:02:27 +00:00
|
|
|
static char *env_path, *sys_path, *r_path;
|
2011-06-26 23:23:28 +00:00
|
|
|
static int rtld_used;
|
2011-06-26 21:39:17 +00:00
|
|
|
static int runtime;
|
|
|
|
static jmp_buf rtld_fail;
|
2011-06-26 23:23:28 +00:00
|
|
|
static pthread_rwlock_t lock;
|
2011-06-18 23:48:42 +00:00
|
|
|
|
2011-08-16 11:46:42 +00:00
|
|
|
#define AUX_CNT 24
|
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];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint32_t hash(const char *s)
|
|
|
|
{
|
|
|
|
uint_fast32_t h = 0;
|
|
|
|
while (*s) {
|
|
|
|
h = 16*h + *s++;
|
|
|
|
h ^= h>>24 & 0xf0;
|
|
|
|
}
|
|
|
|
return h & 0xfffffff;
|
|
|
|
}
|
|
|
|
|
2011-06-19 02:52:01 +00:00
|
|
|
static Sym *lookup(const char *s, uint32_t h, Sym *syms, uint32_t *hashtab, char *strings)
|
2011-06-18 23:48:42 +00:00
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define OK_TYPES (1<<STT_NOTYPE | 1<<STT_OBJECT | 1<<STT_FUNC | 1<<STT_COMMON)
|
2011-07-24 06:19:47 +00:00
|
|
|
#define OK_BINDS (1<<STB_GLOBAL | 1<<STB_WEAK)
|
2011-06-18 23:48:42 +00:00
|
|
|
|
|
|
|
static void *find_sym(struct dso *dso, const char *s, int need_def)
|
|
|
|
{
|
|
|
|
uint32_t h = hash(s);
|
2011-07-24 06:19:47 +00:00
|
|
|
void *def = 0;
|
2011-06-26 23:23:28 +00:00
|
|
|
if (h==0x6b366be && !strcmp(s, "dlopen")) rtld_used = 1;
|
|
|
|
if (h==0x6b3afd && !strcmp(s, "dlsym")) rtld_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;
|
|
|
|
sym = lookup(s, h, dso->syms, dso->hashtab, dso->strings);
|
2011-06-18 23:48:42 +00:00
|
|
|
if (sym && (!need_def || sym->st_shndx) && sym->st_value
|
2011-07-24 06:19:47 +00:00
|
|
|
&& (1<<(sym->st_info&0xf) & OK_TYPES)
|
|
|
|
&& (1<<(sym->st_info>>4) & OK_BINDS)) {
|
2011-07-25 13:22:05 +00:00
|
|
|
if (def && sym->st_info>>4 == STB_WEAK) continue;
|
2011-07-24 06:19:47 +00:00
|
|
|
def = dso->base + sym->st_value;
|
|
|
|
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
|
|
|
}
|
|
|
|
|
|
|
|
static void do_relocs(unsigned char *base, size_t *rel, size_t rel_size, size_t stride, Sym *syms, char *strings, struct dso *dso)
|
|
|
|
{
|
|
|
|
Sym *sym;
|
|
|
|
const char *name;
|
|
|
|
size_t sym_val, sym_size;
|
|
|
|
size_t *reloc_addr;
|
|
|
|
void *ctx;
|
|
|
|
int type;
|
|
|
|
int sym_index;
|
|
|
|
|
|
|
|
for (; rel_size; rel+=stride, rel_size-=stride*sizeof(size_t)) {
|
|
|
|
reloc_addr = (void *)(base + rel[0]);
|
|
|
|
type = R_TYPE(rel[1]);
|
|
|
|
sym_index = R_SYM(rel[1]);
|
|
|
|
if (sym_index) {
|
|
|
|
sym = syms + sym_index;
|
|
|
|
name = strings + sym->st_name;
|
|
|
|
ctx = IS_COPY(type) ? dso->next : dso;
|
2011-06-26 02:36:21 +00:00
|
|
|
sym_val = (size_t)find_sym(ctx, name, IS_PLT(type));
|
2011-06-26 21:39:17 +00:00
|
|
|
if (!sym_val && sym->st_info>>4 != STB_WEAK) {
|
|
|
|
if (runtime) longjmp(rtld_fail, 1);
|
|
|
|
dprintf(2, "%s: symbol not found\n", name);
|
|
|
|
_exit(127);
|
|
|
|
}
|
2011-06-18 23:48:42 +00:00
|
|
|
sym_size = sym->st_size;
|
|
|
|
}
|
|
|
|
do_single_reloc(reloc_addr, type, sym_val, sym_size, base, rel[2]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
static void *map_library(int fd, size_t *lenp, unsigned char **basep, size_t *dynp)
|
|
|
|
{
|
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;
|
|
|
|
Phdr *ph;
|
|
|
|
unsigned prot;
|
|
|
|
unsigned char *map, *base;
|
|
|
|
size_t dyn;
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
ssize_t l = read(fd, buf, sizeof buf);
|
|
|
|
if (l<sizeof *eh) return 0;
|
2011-06-25 16:26:08 +00:00
|
|
|
eh = buf;
|
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;
|
|
|
|
eh->e_phoff = sizeof *eh;
|
|
|
|
}
|
|
|
|
ph = (void *)((char *)buf + eh->e_phoff);
|
|
|
|
for (i=eh->e_phnum; i; i--, ph=(void *)((char *)ph+eh->e_phentsize)) {
|
|
|
|
if (ph->p_type == PT_DYNAMIC)
|
|
|
|
dyn = ph->p_vaddr;
|
|
|
|
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;
|
|
|
|
base = map - addr_min;
|
|
|
|
ph = (void *)((char *)buf + eh->e_phoff);
|
|
|
|
for (i=eh->e_phnum; i; i--, ph=(void *)((char *)ph+eh->e_phentsize)) {
|
|
|
|
if (ph->p_type != PT_LOAD) continue;
|
|
|
|
/* 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));
|
|
|
|
if (mmap(base+this_min, this_max-this_min, prot, MAP_PRIVATE|MAP_FIXED, fd, off_start) == MAP_FAILED) {
|
|
|
|
munmap(map, map_len);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
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);
|
|
|
|
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) {
|
|
|
|
munmap(map, map_len);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
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) {
|
|
|
|
mprotect(map, map_len, PROT_READ|PROT_WRITE|PROT_EXEC);
|
|
|
|
break;
|
|
|
|
}
|
2011-06-28 23:40:14 +00:00
|
|
|
if (!runtime) reclaim_gaps(base, (void *)((char *)buf + eh->e_phoff),
|
|
|
|
eh->e_phentsize, eh->e_phnum);
|
2011-06-18 23:48:42 +00:00
|
|
|
*lenp = map_len;
|
|
|
|
*basep = base;
|
|
|
|
*dynp = dyn;
|
|
|
|
return map;
|
|
|
|
}
|
|
|
|
|
2011-06-25 05:56:34 +00:00
|
|
|
static int path_open(const char *name, const char *search)
|
|
|
|
{
|
|
|
|
char buf[2*NAME_MAX+2];
|
2011-06-25 21:49:16 +00:00
|
|
|
const char *s=search, *z;
|
2011-06-25 05:56:34 +00:00
|
|
|
int l, fd;
|
2011-06-25 21:49:16 +00:00
|
|
|
for (;;) {
|
|
|
|
while (*s==':') s++;
|
|
|
|
if (!*s) return -1;
|
2011-06-25 05:56:34 +00:00
|
|
|
z = strchr(s, ':');
|
|
|
|
l = z ? z-s : strlen(s);
|
|
|
|
snprintf(buf, sizeof buf, "%.*s/%s", l, s, name);
|
|
|
|
if ((fd = open(buf, O_RDONLY))>=0) return fd;
|
2011-06-25 21:49:16 +00:00
|
|
|
s += l;
|
2011-06-25 05:56:34 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
static struct dso *load_library(const char *name)
|
|
|
|
{
|
|
|
|
unsigned char *base, *map;
|
|
|
|
size_t dyno, map_len;
|
|
|
|
struct dso *p;
|
|
|
|
size_t dyn[DYN_CNT] = {0};
|
|
|
|
int fd;
|
|
|
|
struct stat st;
|
|
|
|
|
|
|
|
/* 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) {
|
|
|
|
if (!libc->prev) {
|
|
|
|
tail->next = libc;
|
|
|
|
libc->prev = tail;
|
2011-07-24 04:54:55 +00:00
|
|
|
tail = libc->next ? libc->next : libc;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
return libc;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* Search for the name to see if it's already loaded */
|
|
|
|
for (p=head->next; p; p=p->next) {
|
|
|
|
if (!strcmp(p->name, name)) {
|
|
|
|
p->refcnt++;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
}
|
2011-06-26 23:23:28 +00:00
|
|
|
if (strchr(name, '/')) {
|
2011-06-18 23:48:42 +00:00
|
|
|
fd = open(name, O_RDONLY);
|
|
|
|
} else {
|
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;
|
2011-07-01 03:02:27 +00:00
|
|
|
if (r_path) fd = path_open(name, r_path);
|
|
|
|
if (fd < 0 && env_path) fd = path_open(name, env_path);
|
2011-06-25 05:56:34 +00:00
|
|
|
if (fd < 0) {
|
|
|
|
if (!sys_path) {
|
|
|
|
FILE *f = fopen(ETC_LDSO_PATH, "r");
|
|
|
|
if (f) {
|
|
|
|
if (getline(&sys_path, (size_t[1]){0}, f) > 0)
|
|
|
|
sys_path[strlen(sys_path)-1]=0;
|
|
|
|
fclose(f);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (sys_path) fd = path_open(name, sys_path);
|
|
|
|
else fd = path_open(name, "/lib:/usr/local/lib:/usr/lib");
|
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) {
|
|
|
|
close(fd);
|
|
|
|
p->refcnt++;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
map = map_library(fd, &map_len, &base, &dyno);
|
|
|
|
close(fd);
|
|
|
|
if (!map) return 0;
|
|
|
|
p = calloc(1, sizeof *p + strlen(name) + 1);
|
|
|
|
if (!p) {
|
|
|
|
munmap(map, map_len);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
p->map = map;
|
|
|
|
p->map_len = map_len;
|
|
|
|
p->base = base;
|
|
|
|
p->dynv = (void *)(base + dyno);
|
|
|
|
decode_vec(p->dynv, dyn, DYN_CNT);
|
|
|
|
|
|
|
|
p->syms = (void *)(base + dyn[DT_SYMTAB]);
|
|
|
|
p->hashtab = (void *)(base + dyn[DT_HASH]);
|
|
|
|
p->strings = (void *)(base + dyn[DT_STRTAB]);
|
|
|
|
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;
|
2011-06-18 23:48:42 +00:00
|
|
|
strcpy(p->name, name);
|
|
|
|
|
|
|
|
tail->next = p;
|
|
|
|
p->prev = tail;
|
|
|
|
tail = p;
|
|
|
|
|
|
|
|
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) {
|
2011-06-26 21:39:17 +00:00
|
|
|
if (runtime) longjmp(rtld_fail, 1);
|
|
|
|
dprintf(2, "%s: %m (needed by %s)\n",
|
|
|
|
p->strings + p->dynv[i+1], p->name);
|
|
|
|
_exit(127);
|
|
|
|
}
|
2011-06-26 23:23:28 +00:00
|
|
|
if (runtime) {
|
|
|
|
tmp = realloc(*deps, sizeof(*tmp)*(ndeps+2));
|
|
|
|
if (!tmp) longjmp(rtld_fail, 1);
|
|
|
|
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);
|
|
|
|
do_relocs(p->base, (void *)(p->base+dyn[DT_JMPREL]), dyn[DT_PLTRELSZ],
|
2011-06-26 02:36:21 +00:00
|
|
|
2+(dyn[DT_PLTREL]==DT_RELA), p->syms, p->strings, head);
|
2011-06-18 23:48:42 +00:00
|
|
|
do_relocs(p->base, (void *)(p->base+dyn[DT_REL]), dyn[DT_RELSZ],
|
2011-06-26 02:36:21 +00:00
|
|
|
2, p->syms, p->strings, head);
|
2011-06-18 23:48:42 +00:00
|
|
|
do_relocs(p->base, (void *)(p->base+dyn[DT_RELA]), dyn[DT_RELASZ],
|
2011-06-26 02:36:21 +00:00
|
|
|
3, p->syms, p->strings, head);
|
2011-06-25 04:18:19 +00:00
|
|
|
p->relocated = 1;
|
2011-06-18 23:48:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-25 04:47:28 +00:00
|
|
|
static void free_all(struct dso *p)
|
|
|
|
{
|
|
|
|
struct dso *n;
|
|
|
|
while (p) {
|
|
|
|
n = p->next;
|
|
|
|
if (p->map) free(p);
|
|
|
|
p = n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
void *__dynlink(int argc, char **argv, size_t *got)
|
|
|
|
{
|
|
|
|
size_t *auxv, aux[AUX_CNT] = {0};
|
|
|
|
size_t app_dyn[DYN_CNT] = {0};
|
|
|
|
size_t lib_dyn[DYN_CNT] = {0};
|
2011-07-24 04:54:55 +00:00
|
|
|
size_t vdso_dyn[DYN_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;
|
|
|
|
size_t vdso_base=0;
|
2011-08-16 04:24:36 +00:00
|
|
|
char *env_preload=0;
|
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-07-24 04:54:55 +00:00
|
|
|
for (i=0; auxv[i]; i+=2) {
|
|
|
|
if (auxv[i]==AT_SYSINFO_EHDR) {
|
|
|
|
vdso_base = auxv[i+1];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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
|
|
|
}
|
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
/* Relocate ldso's DYNAMIC pointer and load vector */
|
|
|
|
decode_vec((void *)(got[0] += aux[AT_BASE]), lib_dyn, DYN_CNT);
|
|
|
|
|
|
|
|
/* Find the program image's DYNAMIC section and decode it */
|
|
|
|
phdr = (void *)aux[AT_PHDR];
|
|
|
|
for (i=aux[AT_PHNUM]; i--; phdr=(void *)((char *)phdr + aux[AT_PHENT])) {
|
|
|
|
if (phdr->p_type == PT_DYNAMIC) {
|
|
|
|
decode_vec((void *)phdr->p_vaddr, app_dyn, DYN_CNT);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-24 04:26:12 +00:00
|
|
|
*app = (struct dso){
|
2011-06-18 23:48:42 +00:00
|
|
|
.base = 0,
|
|
|
|
.strings = (void *)(app_dyn[DT_STRTAB]),
|
|
|
|
.hashtab = (void *)(app_dyn[DT_HASH]),
|
|
|
|
.syms = (void *)(app_dyn[DT_SYMTAB]),
|
|
|
|
.dynv = (void *)(phdr->p_vaddr),
|
2011-06-26 21:39:17 +00:00
|
|
|
.name = argv[0],
|
2011-06-26 23:23:28 +00:00
|
|
|
.global = 1,
|
2011-07-24 04:26:12 +00:00
|
|
|
.next = lib
|
2011-06-18 23:48:42 +00:00
|
|
|
};
|
|
|
|
|
2011-07-24 04:26:12 +00:00
|
|
|
*lib = (struct dso){
|
2011-06-18 23:48:42 +00:00
|
|
|
.base = (void *)aux[AT_BASE],
|
|
|
|
.strings = (void *)(aux[AT_BASE]+lib_dyn[DT_STRTAB]),
|
|
|
|
.hashtab = (void *)(aux[AT_BASE]+lib_dyn[DT_HASH]),
|
|
|
|
.syms = (void *)(aux[AT_BASE]+lib_dyn[DT_SYMTAB]),
|
|
|
|
.dynv = (void *)(got[0]),
|
2011-06-26 21:39:17 +00:00
|
|
|
.name = "libc.so",
|
2011-06-26 23:23:28 +00:00
|
|
|
.global = 1,
|
2011-06-18 23:48:42 +00:00
|
|
|
.relocated = 1
|
|
|
|
};
|
|
|
|
|
2011-07-24 04:54:55 +00:00
|
|
|
if (vdso_base) {
|
|
|
|
ehdr = (void *)vdso_base;
|
|
|
|
phdr = (void *)(vdso_base + ehdr->e_phoff);
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
decode_vec(vdso->dynv, vdso_dyn, DYN_CNT);
|
|
|
|
vdso->syms = (void *)(vdso->base + vdso_dyn[DT_SYMTAB]);
|
|
|
|
vdso->hashtab = (void *)(vdso->base + vdso_dyn[DT_HASH]);
|
|
|
|
vdso->strings = (void *)(vdso->base + vdso_dyn[DT_STRTAB]);
|
|
|
|
vdso->name = "linux-gate.so.1";
|
2011-07-24 06:19:47 +00:00
|
|
|
vdso->global = 1;
|
2011-07-24 04:54:55 +00:00
|
|
|
|
|
|
|
vdso->prev = lib;
|
|
|
|
lib->next = vdso;
|
|
|
|
}
|
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
/* Relocate the dynamic linker/libc */
|
|
|
|
do_relocs((void *)aux[AT_BASE], (void *)(aux[AT_BASE]+lib_dyn[DT_REL]),
|
2011-07-24 04:26:12 +00:00
|
|
|
lib_dyn[DT_RELSZ], 2, lib->syms, lib->strings, app);
|
2011-06-18 23:48:42 +00:00
|
|
|
do_relocs((void *)aux[AT_BASE], (void *)(aux[AT_BASE]+lib_dyn[DT_RELA]),
|
2011-07-24 04:26:12 +00:00
|
|
|
lib_dyn[DT_RELASZ], 3, lib->syms, lib->strings, app);
|
2011-06-18 23:48:42 +00:00
|
|
|
|
|
|
|
/* At this point the standard library is fully functional */
|
|
|
|
|
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);
|
|
|
|
|
2011-07-24 04:26:12 +00:00
|
|
|
head = tail = app;
|
|
|
|
libc = lib;
|
|
|
|
app->next = 0;
|
2011-08-16 04:24:36 +00:00
|
|
|
if (env_preload) load_preload(env_preload);
|
2011-06-18 23:48:42 +00:00
|
|
|
load_deps(head);
|
|
|
|
|
2011-06-26 23:23:28 +00:00
|
|
|
make_global(head);
|
2011-06-28 18:13:51 +00:00
|
|
|
reloc_all(head->next);
|
2011-06-18 23:48:42 +00:00
|
|
|
reloc_all(head);
|
|
|
|
|
2011-07-24 04:26:12 +00:00
|
|
|
runtime = 1;
|
|
|
|
if (!rtld_used) {
|
2011-06-26 23:23:28 +00:00
|
|
|
free_all(head);
|
|
|
|
free(sys_path);
|
2011-07-24 04:26:12 +00:00
|
|
|
reclaim((void *)builtin_dsos, 0, sizeof builtin_dsos);
|
2011-06-26 23:23:28 +00:00
|
|
|
}
|
2011-06-25 04:47:28 +00:00
|
|
|
|
2011-06-18 23:48:42 +00:00
|
|
|
errno = 0;
|
|
|
|
return (void *)aux[AT_ENTRY];
|
|
|
|
}
|
2011-06-26 23:23:28 +00:00
|
|
|
|
|
|
|
void *dlopen(const char *file, int mode)
|
|
|
|
{
|
2011-07-02 02:40:00 +00:00
|
|
|
struct dso *volatile p, *orig_tail = tail, *next;
|
2011-06-26 23:23:28 +00:00
|
|
|
size_t i;
|
|
|
|
|
|
|
|
if (!file) return head;
|
|
|
|
|
|
|
|
pthread_rwlock_wrlock(&lock);
|
|
|
|
|
|
|
|
if (setjmp(rtld_fail)) {
|
|
|
|
/* Clean up anything new that was (partially) loaded */
|
2011-06-27 01:21:04 +00:00
|
|
|
if (p->deps) for (i=0; p->deps[i]; i++)
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
tail = orig_tail;
|
|
|
|
tail->next = 0;
|
|
|
|
pthread_rwlock_unlock(&lock);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
p = load_library(file);
|
2011-06-27 02:09:32 +00:00
|
|
|
if (!p) 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;
|
|
|
|
}
|
|
|
|
|
2011-06-27 02:09:32 +00:00
|
|
|
end:
|
2011-06-26 23:23:28 +00:00
|
|
|
pthread_rwlock_unlock(&lock);
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
uint32_t h;
|
|
|
|
Sym *sym;
|
2011-08-16 04:42:13 +00:00
|
|
|
if (p == RTLD_NEXT) {
|
|
|
|
for (p=head; p && (unsigned char *)ra-p->map>p->map_len; p=p->next);
|
|
|
|
if (!p) p=head;
|
|
|
|
p=p->next;
|
|
|
|
}
|
2011-06-27 01:50:01 +00:00
|
|
|
if (p == head || p == RTLD_DEFAULT)
|
|
|
|
return find_sym(head, s, 0);
|
2011-06-26 23:23:28 +00:00
|
|
|
h = hash(s);
|
|
|
|
sym = lookup(s, h, p->syms, p->hashtab, p->strings);
|
|
|
|
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++) {
|
|
|
|
sym = lookup(s, h, p->deps[i]->syms,
|
|
|
|
p->deps[i]->hashtab, p->deps[i]->strings);
|
|
|
|
if (sym && sym->st_value && (1<<(sym->st_info&0xf) & OK_TYPES))
|
|
|
|
return p->deps[i]->base + sym->st_value;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-08-16 04:42:13 +00:00
|
|
|
void *__dlsym(void *p, const char *s, void *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;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *dlerror()
|
|
|
|
{
|
|
|
|
return "unknown error";
|
|
|
|
}
|
|
|
|
|
|
|
|
int dlclose(void *p)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|