90 lines
4.1 KiB
C
90 lines
4.1 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ This program is free software; you can redistribute it and/or modify │
|
|
│ it under the terms of the GNU General Public License as published by │
|
|
│ the Free Software Foundation; version 2 of the License. │
|
|
│ │
|
|
│ 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; if not, write to the Free Software │
|
|
│ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA │
|
|
│ 02110-1301 USA │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/alg/bisectcarleft.h"
|
|
#include "libc/assert.h"
|
|
#include "libc/bits/weaken.h"
|
|
#include "libc/calls/calls.h"
|
|
#include "libc/conv/itoa.h"
|
|
#include "libc/fmt/fmt.h"
|
|
#include "libc/log/backtrace.h"
|
|
#include "libc/macros.h"
|
|
#include "libc/nexgen32e/gc.h"
|
|
#include "libc/nexgen32e/stackframe.h"
|
|
#include "libc/runtime/missioncritical.h"
|
|
#include "libc/runtime/symbols.h"
|
|
#include "libc/str/str.h"
|
|
|
|
/**
|
|
* Prints stack frames with symbols.
|
|
*
|
|
* PrintBacktraceUsingSymbols(STDOUT_FILENO, NULL, GetSymbolTable());
|
|
*
|
|
* @param f is output stream
|
|
* @param bp is rbp which can be NULL to detect automatically
|
|
* @param st is open symbol table for current executable
|
|
* @return -1 w/ errno if error happened
|
|
*/
|
|
int PrintBacktraceUsingSymbols(int fd, const struct StackFrame *bp,
|
|
struct SymbolTable *st) {
|
|
char *p;
|
|
size_t gi;
|
|
intptr_t addr;
|
|
int64_t addend;
|
|
struct Garbages *garbage;
|
|
char buf[256], ibuf[21];
|
|
const struct Symbol *symbol;
|
|
const struct StackFrame *frame;
|
|
if (!st) return -1;
|
|
if (!bp) bp = __builtin_frame_address(0);
|
|
garbage = weaken(g_garbage);
|
|
gi = garbage ? garbage->i : 0;
|
|
for (frame = bp; frame; frame = frame->next) {
|
|
addr = frame->addr;
|
|
if (addr == weakaddr("CollectGarbage")) {
|
|
do {
|
|
--gi;
|
|
} while ((addr = garbage->p[gi].ret) == weakaddr("CollectGarbage"));
|
|
}
|
|
p = buf;
|
|
p = mempcpy(p, ibuf, uint64toarray_fixed16((intptr_t)frame, ibuf, 48));
|
|
*p++ = ' ';
|
|
p = mempcpy(p, ibuf, uint64toarray_fixed16(addr, ibuf, 48));
|
|
*p++ = ' ';
|
|
if (st->count && ((intptr_t)addr >= (intptr_t)&_base &&
|
|
(intptr_t)addr <= (intptr_t)&_end)) {
|
|
symbol = &st->symbols[bisectcarleft((const int32_t(*)[2])st->symbols,
|
|
st->count, addr - st->addr_base - 1)];
|
|
p = stpcpy(p, &st->name_base[symbol->name_rva]);
|
|
addend = addr - st->addr_base - symbol->addr_rva;
|
|
*p++ = addend >= 0 ? '+' : '-';
|
|
if (addend) *p++ = '0', *p++ = 'x';
|
|
p = mempcpy(p, ibuf, uint64toarray_radix16(ABS(addend), ibuf));
|
|
} else {
|
|
p = stpcpy(p, "UNKNOWN");
|
|
}
|
|
*p++ = '\r';
|
|
*p++ = '\n';
|
|
if (write(fd, buf, p - buf) == -1) {
|
|
return -1;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|