mirror of
https://github.com/upx/upx
synced 2025-09-28 19:06:07 +08:00
l_lx_exec.c l_lx_pti.c l_lx_sep.c l_lx_sh.c committer: jreiser <jreiser> 1131565060 +0000
436 lines
14 KiB
C
436 lines
14 KiB
C
/* l_lx_pti.c -- stub loader for Linux x86 separate PT_INTERP
|
|
|
|
This file is part of the UPX executable compressor.
|
|
|
|
Copyright (C) 1996-2004 Markus Franz Xaver Johannes Oberhumer
|
|
Copyright (C) 1996-2004 Laszlo Molnar
|
|
Copyright (C) 2000-2004 John F. Reiser
|
|
All Rights Reserved.
|
|
|
|
UPX and the UCL library are free software; you can redistribute them
|
|
and/or modify them under the terms of the GNU General Public License as
|
|
published by the Free Software Foundation; either version 2 of
|
|
the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; see the file COPYING.
|
|
If not, write to the Free Software Foundation, Inc.,
|
|
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
Markus F.X.J. Oberhumer Laszlo Molnar
|
|
<mfx@users.sourceforge.net> <ml1050@users.sourceforge.net>
|
|
|
|
John F. Reiser
|
|
<jreiser@users.sourceforge.net>
|
|
*/
|
|
|
|
|
|
#include "linux.hh"
|
|
|
|
|
|
/*************************************************************************
|
|
// configuration section
|
|
**************************************************************************/
|
|
|
|
// In order to make it much easier to move this code at runtime and execute
|
|
// it at an address different from it load address: there must be no
|
|
// static data, and no string constants.
|
|
|
|
#define MAX_ELF_HDR 512 // Elf32_Ehdr + n*Elf32_Phdr must fit in this
|
|
|
|
|
|
/*************************************************************************
|
|
// "file" util
|
|
**************************************************************************/
|
|
|
|
struct Extent {
|
|
size_t size; // must be first to match size[0] uncompressed size
|
|
char *buf;
|
|
};
|
|
|
|
|
|
static void
|
|
#if (ACC_CC_GNUC >= 0x030300)
|
|
__attribute__((__noinline__, __used__, regparm(3), stdcall))
|
|
#endif
|
|
xread(struct Extent *x, char *buf, size_t count)
|
|
{
|
|
char *p=x->buf, *q=buf;
|
|
size_t j;
|
|
if (x->size < count) {
|
|
exit(127);
|
|
}
|
|
for (j = count; 0!=j--; ++p, ++q) {
|
|
*q = *p;
|
|
}
|
|
x->buf += count;
|
|
x->size -= count;
|
|
}
|
|
|
|
|
|
/*************************************************************************
|
|
// util
|
|
**************************************************************************/
|
|
|
|
#if 1 //{ save space
|
|
#define ERR_LAB error: exit(127);
|
|
#define err_exit(a) goto error
|
|
#else //}{ save debugging time
|
|
#define ERR_LAB
|
|
static void
|
|
err_exit(int a)
|
|
{
|
|
(void)a; // debugging convenience
|
|
exit(127);
|
|
}
|
|
#endif //}
|
|
|
|
static void *
|
|
do_brk(void *addr)
|
|
{
|
|
return brk(addr);
|
|
}
|
|
|
|
static char *
|
|
__attribute_cdecl
|
|
do_mmap(void *addr, size_t len, int prot, int flags, int fd, off_t offset)
|
|
{
|
|
(void)len; (void)prot; (void)flags; (void)fd; (void)offset;
|
|
return mmap((void *)&addr);
|
|
}
|
|
|
|
|
|
/*************************************************************************
|
|
// UPX & NRV stuff
|
|
**************************************************************************/
|
|
|
|
typedef void f_unfilter(
|
|
nrv_byte *, // also addvalue
|
|
nrv_uint,
|
|
unsigned cto8 // junk in high 24 bits
|
|
);
|
|
typedef int f_expand(
|
|
const nrv_byte *, nrv_uint,
|
|
nrv_byte *, nrv_uint *, int method
|
|
);
|
|
|
|
static void
|
|
unpackExtent(
|
|
struct Extent *const xi, // input
|
|
struct Extent *const xo, // output
|
|
f_expand *(*get_fexp(int)),
|
|
f_unfilter *(*get_funf(int))
|
|
)
|
|
{
|
|
while (xo->size) {
|
|
struct b_info h;
|
|
// Note: if h.sz_unc == h.sz_cpr then the block was not
|
|
// compressible and is stored in its uncompressed form.
|
|
|
|
// Read and check block sizes.
|
|
xread(xi, (char *)&h, sizeof(h));
|
|
if (h.sz_unc == 0) { // uncompressed size 0 -> EOF
|
|
if (h.sz_cpr != UPX_MAGIC_LE32) // h.sz_cpr must be h->magic
|
|
err_exit(2);
|
|
if (xi->size != 0) // all bytes must be written
|
|
err_exit(3);
|
|
break;
|
|
}
|
|
if (h.sz_cpr <= 0) {
|
|
err_exit(4);
|
|
ERR_LAB
|
|
}
|
|
if (h.sz_cpr > h.sz_unc
|
|
|| h.sz_unc > xo->size ) {
|
|
err_exit(5);
|
|
}
|
|
// Now we have:
|
|
// assert(h.sz_cpr <= h.sz_unc);
|
|
// assert(h.sz_unc > 0 && h.sz_unc <= blocksize);
|
|
// assert(h.sz_cpr > 0 && h.sz_cpr <= blocksize);
|
|
|
|
if (h.sz_cpr < h.sz_unc) { // Decompress block
|
|
nrv_uint out_len;
|
|
int const j = (*get_fexp(h.b_method))((unsigned char *)xi->buf, h.sz_cpr,
|
|
(unsigned char *)xo->buf, &out_len, h.b_method);
|
|
if (j != 0 || out_len != (nrv_uint)h.sz_unc)
|
|
err_exit(7);
|
|
if (h.b_ftid!=0) {
|
|
(*get_funf(h.b_ftid))((unsigned char *)xo->buf, out_len, h.b_cto8);
|
|
}
|
|
xi->buf += h.sz_cpr;
|
|
xi->size -= h.sz_cpr;
|
|
}
|
|
else { // copy literal block
|
|
xread(xi, xo->buf, h.sz_cpr);
|
|
}
|
|
xo->buf += h.sz_unc;
|
|
xo->size -= h.sz_unc;
|
|
}
|
|
}
|
|
|
|
// Create (or find) an escape hatch to use when munmapping ourselves the stub.
|
|
// Called by do_xmap to create it, and by assembler code to find it.
|
|
static void *
|
|
make_hatch(Elf32_Phdr const *const phdr)
|
|
{
|
|
unsigned *hatch = 0;
|
|
if (phdr->p_type==PT_LOAD && phdr->p_flags & PF_X) {
|
|
// The format of the 'if' is
|
|
// if ( ( (hatch = loc1), test_loc1 )
|
|
// || ( (hatch = loc2), test_loc2 ) ) {
|
|
// action
|
|
// }
|
|
// which uses the comma to save bytes when test_locj involves locj
|
|
// and the action is the same when either test succeeds.
|
|
|
|
// Try page fragmentation just beyond .text .
|
|
if ( ( (hatch = (void *)(phdr->p_memsz + phdr->p_vaddr)),
|
|
( phdr->p_memsz==phdr->p_filesz // don't pollute potential .bss
|
|
&& 4<=(~PAGE_MASK & -(int)hatch) ) ) // space left on page
|
|
// Try Elf32_Ehdr.e_ident[12..15] . warning: 'const' cast away
|
|
|| ( (hatch = (void *)(&((Elf32_Ehdr *)phdr->p_vaddr)->e_ident[12])),
|
|
(phdr->p_offset==0) ) ) {
|
|
// Omitting 'const' saves repeated literal in gcc.
|
|
unsigned /*const*/ escape = 0xc36180cd; // "int $0x80; popa; ret"
|
|
// Don't store into read-only page if value is already there.
|
|
if (* (volatile unsigned*) hatch != escape) {
|
|
* hatch = escape;
|
|
}
|
|
}
|
|
}
|
|
return hatch;
|
|
}
|
|
|
|
static void
|
|
__attribute__((regparm(2), stdcall))
|
|
upx_bzero(char *p, size_t len)
|
|
{
|
|
if (len) do {
|
|
*p++= 0;
|
|
} while (--len);
|
|
}
|
|
#define bzero upx_bzero
|
|
|
|
|
|
static void
|
|
__attribute__((regparm(3), stdcall))
|
|
auxv_up(Elf32_auxv_t *av, unsigned const type, unsigned const value)
|
|
{
|
|
if (av && 0==(1&(int)av)) /* PT_INTERP usually inhibits, except for hatch */
|
|
for (;; ++av) {
|
|
if (av->a_type==type || (av->a_type==AT_IGNORE && type!=AT_NULL)) {
|
|
av->a_type = type;
|
|
av->a_un.a_val = value;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
// The PF_* and PROT_* bits are {1,2,4}; the conversion table fits in 32 bits.
|
|
#define REP8(x) \
|
|
((x)|((x)<<4)|((x)<<8)|((x)<<12)|((x)<<16)|((x)<<20)|((x)<<24)|((x)<<28))
|
|
#define EXP8(y) \
|
|
((1&(y)) ? 0xf0f0f0f0 : (2&(y)) ? 0xff00ff00 : (4&(y)) ? 0xffff0000 : 0)
|
|
#define PF_TO_PROT(pf) \
|
|
((PROT_READ|PROT_WRITE|PROT_EXEC) & ( \
|
|
( (REP8(PROT_EXEC ) & EXP8(PF_X)) \
|
|
|(REP8(PROT_READ ) & EXP8(PF_R)) \
|
|
|(REP8(PROT_WRITE) & EXP8(PF_W)) \
|
|
) >> ((pf & (PF_R|PF_W|PF_X))<<2) ))
|
|
|
|
|
|
// Find convex hull of PT_LOAD (the minimal interval which covers all PT_LOAD),
|
|
// and mmap that much, to be sure that a kernel using exec-shield-randomize
|
|
// won't place the first piece in a way that leaves no room for the rest.
|
|
static unsigned long // returns relocation constant
|
|
__attribute__((regparm(3), stdcall))
|
|
xfind_pages(unsigned mflags, Elf32_Phdr const *phdr, int phnum,
|
|
char **const p_brk
|
|
)
|
|
{
|
|
size_t lo= ~0, hi= 0, szlo= 0;
|
|
char *addr;
|
|
mflags += MAP_PRIVATE | MAP_ANONYMOUS; // '+' can optimize better than '|'
|
|
for (; --phnum>=0; ++phdr) if (PT_LOAD==phdr->p_type) {
|
|
if (phdr->p_vaddr < lo) {
|
|
lo = phdr->p_vaddr;
|
|
szlo = phdr->p_filesz;
|
|
}
|
|
if (hi < (phdr->p_memsz + phdr->p_vaddr)) {
|
|
hi = phdr->p_memsz + phdr->p_vaddr;
|
|
}
|
|
}
|
|
szlo += ~PAGE_MASK & lo; // page fragment on lo edge
|
|
lo -= ~PAGE_MASK & lo; // round down to page boundary
|
|
hi = PAGE_MASK & (hi - lo - PAGE_MASK -1); // page length
|
|
szlo = PAGE_MASK & (szlo - PAGE_MASK -1); // page length
|
|
addr = do_mmap((void *)lo, hi, PROT_READ|PROT_WRITE|PROT_EXEC, mflags, 0, 0);
|
|
*p_brk = hi + addr; // the logical value of brk(0)
|
|
munmap(szlo + addr, hi - szlo); // desirable if PT_LOAD non-contiguous
|
|
return (unsigned long)addr - lo;
|
|
}
|
|
|
|
static Elf32_Addr // entry address
|
|
do_xmap(
|
|
int const fdi,
|
|
f_unfilter *(*get_funf(int)),
|
|
Elf32_Ehdr const *const ehdr,
|
|
struct Extent *const xi,
|
|
Elf32_auxv_t *const av)
|
|
{
|
|
f_expand *(*(*get_fexp)(int));
|
|
Elf32_Phdr const *phdr = (Elf32_Phdr const *) (ehdr->e_phoff +
|
|
(char const *)ehdr);
|
|
char *v_brk;
|
|
unsigned long const reloc = xfind_pages(
|
|
((ET_DYN!=ehdr->e_type) ? MAP_FIXED : 0), phdr, ehdr->e_phnum, &v_brk);
|
|
int j;
|
|
|
|
*(int *)(void *)&get_fexp = fdi;
|
|
for (j=0; j < ehdr->e_phnum; ++phdr, ++j)
|
|
if (PT_PHDR==phdr->p_type) {
|
|
auxv_up(av, AT_PHDR, phdr->p_vaddr + reloc);
|
|
}
|
|
else if (PT_LOAD==phdr->p_type) {
|
|
unsigned const prot = PF_TO_PROT(phdr->p_flags);
|
|
struct Extent xo;
|
|
size_t mlen = xo.size = phdr->p_filesz;
|
|
char *addr = xo.buf = (char *)phdr->p_vaddr;
|
|
char *haddr = phdr->p_memsz + addr;
|
|
size_t frag = (int)addr &~ PAGE_MASK;
|
|
mlen += frag;
|
|
addr -= frag;
|
|
addr += reloc;
|
|
haddr += reloc;
|
|
|
|
// Decompressor can overrun the destination by 3 bytes.
|
|
if (addr != do_mmap(addr, mlen + (xi ? 3 : 0), PROT_READ | PROT_WRITE,
|
|
MAP_FIXED | MAP_PRIVATE | (xi ? MAP_ANONYMOUS : 0),
|
|
fdi, phdr->p_offset - frag) ) {
|
|
err_exit(8);
|
|
}
|
|
if (xi) {
|
|
unpackExtent(xi, &xo, get_fexp, get_funf);
|
|
}
|
|
bzero(addr, frag); // fragment at lo end
|
|
frag = (-mlen) &~ PAGE_MASK; // distance to next page boundary
|
|
bzero(mlen+addr, frag); // fragment at hi end
|
|
if (xi) {
|
|
void *const hatch = make_hatch(phdr);
|
|
if (0!=hatch) {
|
|
/* always update AT_NULL, especially for compressed PT_INTERP */
|
|
auxv_up((Elf32_auxv_t *)(~1 & (int)av), AT_NULL, (unsigned)hatch);
|
|
}
|
|
}
|
|
if (0!=mprotect(addr, mlen, prot)) {
|
|
err_exit(10);
|
|
ERR_LAB
|
|
}
|
|
addr += mlen + frag; /* page boundary on hi end */
|
|
if (addr < haddr) { // need pages for .bss
|
|
if (addr != do_mmap(addr, haddr - addr, prot,
|
|
MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS, 0, 0 ) ) {
|
|
err_exit(9);
|
|
}
|
|
}
|
|
else if (xi) { // cleanup if decompressor overrun crosses page boundary
|
|
mlen = ~PAGE_MASK & (3+ mlen);
|
|
if (mlen<=3) { // page fragment was overrun buffer only
|
|
munmap(addr, mlen);
|
|
}
|
|
}
|
|
}
|
|
if (!xi) { // 2nd call (PT_INTERP); close()+check is smaller here
|
|
if (0!=close((int)fdi)) {
|
|
err_exit(11);
|
|
}
|
|
}
|
|
else { // 1st call (main); also have (0!=av) here
|
|
if (ET_DYN!=ehdr->e_type) {
|
|
// Needed only if compressed shell script invokes compressed shell.
|
|
do_brk(v_brk);
|
|
}
|
|
}
|
|
return ehdr->e_entry + reloc;
|
|
}
|
|
|
|
|
|
/*************************************************************************
|
|
// pti_main - called by our entry code
|
|
//
|
|
// This function is optimized for size.
|
|
**************************************************************************/
|
|
|
|
void *pti_main(
|
|
Elf32_auxv_t *const av,
|
|
unsigned const sz_compressed,
|
|
f_expand *(*get_fexp(int)),
|
|
Elf32_Ehdr *const ehdr,
|
|
struct Extent xo,
|
|
struct Extent xi,
|
|
f_unfilter *(*get_funf(int))
|
|
) __asm__("pti_main");
|
|
|
|
void *pti_main(
|
|
Elf32_auxv_t *const av,
|
|
unsigned const sz_compressed,
|
|
f_expand *(*get_fexp(int)),
|
|
Elf32_Ehdr *const ehdr, // temp char[MAX_ELF_HDR+OVERHEAD]
|
|
struct Extent xo, // {sz_unc, ehdr} for ELF headers
|
|
struct Extent xi, // {sz_cpr, &b_info} for ELF headers
|
|
f_unfilter *(*get_funf(int))
|
|
)
|
|
{
|
|
Elf32_Phdr const *phdr = (Elf32_Phdr const *)(1+ ehdr);
|
|
Elf32_Addr entry;
|
|
|
|
// sizeof(Ehdr+Phdrs), compressed; including b_info header
|
|
size_t const sz_pckhdrs = xi.size;
|
|
|
|
// Uncompress Ehdr and Phdrs.
|
|
unpackExtent(&xi, &xo, get_fexp, get_funf);
|
|
|
|
// Prepare to decompress the Elf headers again, into the first PT_LOAD.
|
|
xi.buf -= sz_pckhdrs;
|
|
xi.size = sz_compressed;
|
|
|
|
// AT_PHDR.a_un.a_val is set again by do_xmap if PT_PHDR is present.
|
|
auxv_up(av, AT_PHDR , (unsigned)(1+(Elf32_Ehdr *)phdr->p_vaddr));
|
|
auxv_up(av, AT_PHENT , ehdr->e_phentsize);
|
|
auxv_up(av, AT_PHNUM , ehdr->e_phnum);
|
|
//auxv_up(av, AT_PAGESZ, PAGE_SIZE); /* ld-linux.so.2 does not need this */
|
|
auxv_up(av, AT_ENTRY , (unsigned)ehdr->e_entry);
|
|
entry = do_xmap((int)get_fexp, get_funf, ehdr, &xi, av);
|
|
|
|
{ // Map PT_INTERP program interpreter
|
|
int j;
|
|
for (j=0; j < ehdr->e_phnum; ++phdr, ++j) if (PT_INTERP==phdr->p_type) {
|
|
char const *const iname = (char const *)phdr->p_vaddr;
|
|
int const fdi = open(iname, O_RDONLY, 0);
|
|
if (0 > fdi) {
|
|
err_exit(18);
|
|
}
|
|
if (MAX_ELF_HDR!=read(fdi, (void *)ehdr, MAX_ELF_HDR)) {
|
|
ERR_LAB
|
|
err_exit(19);
|
|
}
|
|
entry = do_xmap(fdi, 0, ehdr, 0, 0);
|
|
break;
|
|
}
|
|
}
|
|
|
|
return (void *)entry;
|
|
}
|
|
|
|
|
|
/*
|
|
vi:ts=4:et:nowrap
|
|
*/
|
|
|