mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-07-04 18:28:30 +00:00
Make numerous improvements
- Python static hello world now 1.8mb
- Python static fully loaded now 10mb
- Python HTTPS client now uses MbedTLS
- Python REPL now completes import stmts
- Increase stack size for Python for now
- Begin synthesizing posixpath and ntpath
- Restore Python \N{UNICODE NAME} support
- Restore Python NFKD symbol normalization
- Add optimized code path for Intel SHA-NI
- Get more Python unit tests passing faster
- Get Python help() pagination working on NT
- Python hashlib now supports MbedTLS PBKDF2
- Make memcpy/memmove/memcmp/bcmp/etc. faster
- Add Mersenne Twister and Vigna to LIBC_RAND
- Provide privileged __printf() for error code
- Fix zipos opendir() so that it reports ENOTDIR
- Add basic chmod() implementation for Windows NT
- Add Cosmo's best functions to Python cosmo module
- Pin function trace indent depth to that of caller
- Show memory diagram on invalid access in MODE=dbg
- Differentiate stack overflow on crash in MODE=dbg
- Add stb_truetype and tools for analyzing font files
- Upgrade to UNICODE 13 and reduce its binary footprint
- COMPILE.COM now logs resource usage of build commands
- Start implementing basic poll() support on bare metal
- Set getauxval(AT_EXECFN) to GetModuleFileName() on NT
- Add descriptions to strerror() in non-TINY build modes
- Add COUNTBRANCH() macro to help with micro-optimizations
- Make error / backtrace / asan / memory code more unbreakable
- Add fast perfect C implementation of μ-Law and a-Law audio codecs
- Make strtol() functions consistent with other libc implementations
- Improve Linenoise implementation (see also github.com/jart/bestline)
- COMPILE.COM now suppresses stdout/stderr of successful build commands
This commit is contained in:
Justine Tunney
parent
fa7b4f5bd1
commit
39bf41f4eb
806 changed files with 77494 additions and 63859 deletions
|
|
@ -17,15 +17,24 @@
|
|||
│ PERFORMANCE OF THIS SOFTWARE. │
|
||||
╚─────────────────────────────────────────────────────────────────────────────*/
|
||||
#include "libc/alg/alg.h"
|
||||
#include "libc/bits/bits.h"
|
||||
#include "libc/calls/calls.h"
|
||||
#include "libc/dce.h"
|
||||
#include "libc/elf/def.h"
|
||||
#include "libc/elf/elf.h"
|
||||
#include "libc/runtime/carsort.h"
|
||||
#include "libc/errno.h"
|
||||
#include "libc/intrin/asan.internal.h"
|
||||
#include "libc/limits.h"
|
||||
#include "libc/log/libfatal.internal.h"
|
||||
#include "libc/macros.internal.h"
|
||||
#include "libc/runtime/internal.h"
|
||||
#include "libc/runtime/runtime.h"
|
||||
#include "libc/runtime/symbols.internal.h"
|
||||
#include "libc/str/str.h"
|
||||
#include "libc/sysv/consts/map.h"
|
||||
#include "libc/sysv/consts/o.h"
|
||||
#include "libc/sysv/consts/prot.h"
|
||||
#include "libc/sysv/errfuns.h"
|
||||
|
||||
/**
|
||||
* Maps debuggable binary into memory and indexes symbol addresses.
|
||||
|
|
@ -33,30 +42,88 @@
|
|||
* @return object freeable with CloseSymbolTable(), or NULL w/ errno
|
||||
*/
|
||||
struct SymbolTable *OpenSymbolTable(const char *filename) {
|
||||
unsigned i, j;
|
||||
int fd;
|
||||
void *map;
|
||||
struct stat st;
|
||||
size_t n, m, tsz;
|
||||
unsigned i, j, k, x;
|
||||
const Elf64_Ehdr *elf;
|
||||
const char *name_base;
|
||||
struct SymbolTable *t;
|
||||
const Elf64_Sym *symtab, *sym;
|
||||
t = MAP_FAILED;
|
||||
if (filename && (t = mapanon(BIGPAGESIZE)) != MAP_FAILED &&
|
||||
MapElfRead(filename, &t->mf) &&
|
||||
(t->name_base = GetElfStringTable(t->elf, t->elfsize)) != NULL &&
|
||||
(symtab = GetElfSymbolTable(t->elf, t->elfsize, &t->count)) &&
|
||||
sizeof(struct SymbolTable) + sizeof(struct Symbol) * t->count <
|
||||
(t->scratch = BIGPAGESIZE)) {
|
||||
GetElfVirtualAddressRange(t->elf, t->elfsize, &t->addr_base, &t->addr_end);
|
||||
for (j = i = 0; i < t->count; ++i) {
|
||||
sym = &symtab[i];
|
||||
if (IsElfSymbolContent(sym) &&
|
||||
(sym->st_value >= t->addr_base && sym->st_value <= t->addr_end)) {
|
||||
t->symbols[j].addr_rva = (unsigned)(sym->st_value - t->addr_base);
|
||||
t->symbols[j].name_rva = sym->st_name;
|
||||
j++;
|
||||
}
|
||||
}
|
||||
t->count = j;
|
||||
carsort1000(t->count, (void *)t->symbols);
|
||||
} else {
|
||||
CloseSymbolTable(&t);
|
||||
ptrdiff_t names_offset, name_base_offset, extra_offset;
|
||||
map = MAP_FAILED;
|
||||
if ((fd = open(filename, O_RDONLY)) == -1) return 0;
|
||||
if (fstat(fd, &st) == -1) goto SystemError;
|
||||
if (st.st_size > INT_MAX) goto RaiseE2big;
|
||||
if (st.st_size < 64) goto RaiseEnoexec;
|
||||
elf = map = mmap(0, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
||||
if (map == MAP_FAILED) goto SystemError;
|
||||
if (READ32LE(map) != READ32LE("\177ELF")) goto RaiseEnoexec;
|
||||
if (!(name_base = GetElfStrs(map, st.st_size, &m))) goto RaiseEnobufs;
|
||||
if (!(symtab = GetElfSymbolTable(map, st.st_size, &n))) goto RaiseEnobufs;
|
||||
tsz = 0;
|
||||
tsz += sizeof(struct SymbolTable);
|
||||
tsz += sizeof(struct Symbol) * n;
|
||||
names_offset = tsz;
|
||||
tsz += sizeof(unsigned) * n;
|
||||
name_base_offset = tsz;
|
||||
tsz += m;
|
||||
extra_offset = tsz;
|
||||
tsz = ROUNDUP(tsz, FRAMESIZE);
|
||||
t = mmap(0, tsz, PROT_READ | PROT_WRITE, MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
|
||||
if (t == MAP_FAILED) goto SystemError;
|
||||
if (IsAsan()) {
|
||||
__asan_poison((intptr_t)((char *)t + extra_offset), tsz - extra_offset,
|
||||
kAsanHeapOverrun);
|
||||
}
|
||||
return t == MAP_FAILED ? NULL : t;
|
||||
t->mapsize = tsz;
|
||||
t->names = (const unsigned *)((const char *)t + names_offset);
|
||||
t->name_base = (const char *)((const char *)t + name_base_offset);
|
||||
GetElfVirtualAddressRange(elf, st.st_size, &t->addr_base, &t->addr_end);
|
||||
memcpy(t->name_base, name_base, m);
|
||||
--t->addr_end;
|
||||
for (j = i = 0; i < n; ++i) {
|
||||
sym = symtab + i;
|
||||
if (!(sym->st_size > 0 && (ELF64_ST_TYPE(sym->st_info) == STT_FUNC ||
|
||||
ELF64_ST_TYPE(sym->st_info) == STT_OBJECT))) {
|
||||
continue;
|
||||
}
|
||||
if (sym->st_value > t->addr_end) continue;
|
||||
if (sym->st_value < t->addr_base) continue;
|
||||
x = sym->st_value - t->addr_base;
|
||||
for (k = j; k && x <= t->symbols[k - 1].x; --k) {
|
||||
t->symbols[k] = t->symbols[k - 1];
|
||||
t->names[k] = t->names[k - 1];
|
||||
}
|
||||
if (k && t->symbols[k - 1].y >= x) {
|
||||
t->symbols[k - 1].y = x - 1;
|
||||
}
|
||||
t->names[k] = sym->st_name;
|
||||
t->symbols[k].x = x;
|
||||
if (sym->st_size) {
|
||||
t->symbols[k].y = x + sym->st_size - 1;
|
||||
} else {
|
||||
t->symbols[k].y = t->addr_end - t->addr_base;
|
||||
}
|
||||
j++;
|
||||
}
|
||||
t->count = j;
|
||||
munmap(map, st.st_size);
|
||||
close(fd);
|
||||
return t;
|
||||
RaiseE2big:
|
||||
errno = E2BIG;
|
||||
goto SystemError;
|
||||
RaiseEnobufs:
|
||||
errno = ENOBUFS;
|
||||
goto SystemError;
|
||||
RaiseEnoexec:
|
||||
errno = ENOEXEC;
|
||||
SystemError:
|
||||
if (map != MAP_FAILED) {
|
||||
munmap(map, st.st_size);
|
||||
}
|
||||
close(fd);
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue