mirror of
https://github.com/reactos/reactos.git
synced 2024-11-01 20:32:36 +00:00
e1d334794a
This was a MinGW-specific, non-MS-DDK/WDK-compatible define, that was used to mark NTOS kernel/hal exports, instead of NTSYSAPI etc. We have since fixed that, and changed the way Freeldr (and rossym) manages these, see commits:186c8b72d(r16028),51f0dfd30(r17651) and526efd2ee(r24359)
385 lines
8.7 KiB
C
385 lines
8.7 KiB
C
/*
|
|
* Dwarf pc to source line conversion.
|
|
*
|
|
* Maybe should do the reverse here, but what should the interface look like?
|
|
* One possibility is to use the Plan 9 line2addr interface:
|
|
*
|
|
* long line2addr(ulong line, ulong basepc)
|
|
*
|
|
* which returns the smallest pc > basepc with line number line (ignoring file name).
|
|
*
|
|
* The encoding may be small, but it sure isn't simple!
|
|
*/
|
|
|
|
#include <ntddk.h>
|
|
#include <reactos/rossym.h>
|
|
#include "rossympriv.h"
|
|
#include <ntimage.h>
|
|
|
|
#define NDEBUG
|
|
#include <debug.h>
|
|
|
|
#include "dwarf.h"
|
|
#include "pe.h"
|
|
|
|
#define trace 0
|
|
|
|
enum
|
|
{
|
|
Isstmt = 1<<0,
|
|
BasicDwarfBlock = 1<<1,
|
|
EndSequence = 1<<2,
|
|
PrologueEnd = 1<<3,
|
|
EpilogueBegin = 1<<4
|
|
};
|
|
|
|
typedef struct State State;
|
|
struct State
|
|
{
|
|
ulong addr;
|
|
ulong file;
|
|
ulong line;
|
|
ulong column;
|
|
ulong flags;
|
|
ulong isa;
|
|
};
|
|
|
|
int
|
|
dwarfpctoline(Dwarf *d, ulong pc, char **cdir, char **dir, char **file, char **function, ulong *line, ulong *mtime, ulong *length)
|
|
{
|
|
uchar *prog, *opcount, *end, *dirs;
|
|
ulong off, unit, len, vers, x, start, lastline;
|
|
int i, first, firstline, op, a, l, quantum, isstmt, linebase, linerange, opcodebase, nf;
|
|
char *files, *s;
|
|
DwarfBuf b;
|
|
DwarfSym sym;
|
|
State emit, cur, reset;
|
|
uchar **f, **newf;
|
|
|
|
f = nil;
|
|
|
|
if(dwarfaddrtounit(d, pc, &unit) < 0
|
|
|| dwarflookuptag(d, unit, TagCompileUnit, &sym) < 0)
|
|
return -1;
|
|
|
|
if(!sym.attrs.have.stmtlist){
|
|
werrstr("no line mapping information for 0x%x", pc);
|
|
return -1;
|
|
}
|
|
off = sym.attrs.stmtlist;
|
|
if(off >= d->line.len){
|
|
werrstr("bad stmtlist\n");
|
|
goto bad;
|
|
}
|
|
|
|
if(trace) werrstr("unit 0x%x stmtlist 0x%x", unit, sym.attrs.stmtlist);
|
|
|
|
memset(&b, 0, sizeof b);
|
|
b.d = d;
|
|
b.p = d->line.data + off;
|
|
b.ep = b.p + d->line.len;
|
|
b.addrsize = sym.b.addrsize; /* should i get this from somewhere else? */
|
|
|
|
len = dwarfget4(&b);
|
|
if(b.p==nil || b.p+len > b.ep || b.p+len < b.p){
|
|
werrstr("bad len\n");
|
|
goto bad;
|
|
}
|
|
|
|
b.ep = b.p+len;
|
|
vers = dwarfget2(&b);
|
|
if(vers != 2){
|
|
werrstr("bad dwarf version 0x%x", vers);
|
|
return -1;
|
|
}
|
|
|
|
len = dwarfget4(&b);
|
|
if(b.p==nil || b.p+len > b.ep || b.p+len < b.p){
|
|
werrstr("another bad len\n");
|
|
goto bad;
|
|
}
|
|
prog = b.p+len;
|
|
|
|
quantum = dwarfget1(&b);
|
|
isstmt = dwarfget1(&b);
|
|
linebase = (schar)dwarfget1(&b);
|
|
linerange = (schar)dwarfget1(&b);
|
|
opcodebase = dwarfget1(&b);
|
|
|
|
opcount = b.p-1;
|
|
dwarfgetnref(&b, opcodebase-1);
|
|
if(b.p == nil){
|
|
werrstr("bad opcode chart\n");
|
|
goto bad;
|
|
}
|
|
|
|
/* just skip the files and dirs for now; we'll come back */
|
|
dirs = b.p;
|
|
while (b.p && *b.p)
|
|
dwarfgetstring(&b);
|
|
dwarfget1(&b);
|
|
|
|
files = (char*)b.p;
|
|
while(b.p!=nil && *b.p!=0){
|
|
dwarfgetstring(&b);
|
|
dwarfget128(&b);
|
|
dwarfget128(&b);
|
|
dwarfget128(&b);
|
|
}
|
|
dwarfget1(&b);
|
|
|
|
/* move on to the program */
|
|
if(b.p == nil || b.p > prog){
|
|
werrstr("bad header\n");
|
|
goto bad;
|
|
}
|
|
b.p = prog;
|
|
|
|
reset.addr = 0;
|
|
reset.file = 1;
|
|
reset.line = 1;
|
|
reset.column = 0;
|
|
reset.flags = isstmt ? Isstmt : 0;
|
|
reset.isa = 0;
|
|
|
|
cur = reset;
|
|
emit = reset;
|
|
nf = 0;
|
|
start = 0;
|
|
if(trace) werrstr("program @ %lu ... %.*H opbase = %d\n", b.p - d->line.data, b.ep-b.p, b.p, opcodebase);
|
|
first = 1;
|
|
while(b.p != nil){
|
|
firstline = 0;
|
|
op = dwarfget1(&b);
|
|
if(trace) werrstr("\tline %lu, addr 0x%x, op %d %.10H", cur.line, cur.addr, op, b.p);
|
|
if(op >= opcodebase){
|
|
a = (op - opcodebase) / linerange;
|
|
l = (op - opcodebase) % linerange + linebase;
|
|
cur.line += l;
|
|
cur.addr += a * quantum;
|
|
if(trace) werrstr(" +%d,%d\n", a, l);
|
|
emit:
|
|
if(first){
|
|
if(cur.addr > pc){
|
|
werrstr("found wrong line mapping 0x%x for pc 0x%x", cur.addr, pc);
|
|
/* This is an overzealous check. gcc can produce discontiguous ranges
|
|
and reorder statements, so it's possible for a future line to start
|
|
ahead of pc and still find a matching one. */
|
|
/*goto out;*/
|
|
firstline = 1;
|
|
}
|
|
first = 0;
|
|
start = cur.addr;
|
|
}
|
|
if(cur.addr > pc && !firstline)
|
|
break;
|
|
if(b.p == nil){
|
|
werrstr("buffer underflow in line mapping");
|
|
goto out;
|
|
}
|
|
emit = cur;
|
|
if(emit.flags & EndSequence){
|
|
werrstr("found wrong line mapping 0x%x-0x%x for pc 0x%x", start, cur.addr, pc);
|
|
goto out;
|
|
}
|
|
cur.flags &= ~(BasicDwarfBlock|PrologueEnd|EpilogueBegin);
|
|
}else{
|
|
switch(op){
|
|
case 0: /* extended op code */
|
|
if(trace) werrstr(" ext");
|
|
len = dwarfget128(&b);
|
|
end = b.p+len;
|
|
if(b.p == nil || end > b.ep || end < b.p || len < 1)
|
|
goto bad;
|
|
switch(dwarfget1(&b)){
|
|
case 1: /* end sequence */
|
|
if(trace) werrstr(" end\n");
|
|
cur.flags |= EndSequence;
|
|
goto emit;
|
|
case 2: /* set address */
|
|
cur.addr = dwarfgetaddr(&b);
|
|
if(trace) werrstr(" set pc 0x%x\n", cur.addr);
|
|
break;
|
|
case 3: /* define file */
|
|
newf = malloc(nf+1*sizeof(f[0]));
|
|
if (newf)
|
|
RtlMoveMemory(newf, f, nf*sizeof(f[0]));
|
|
if(newf == nil)
|
|
goto out;
|
|
f[nf++] = b.p;
|
|
s = dwarfgetstring(&b);
|
|
dwarfget128(&b);
|
|
dwarfget128(&b);
|
|
dwarfget128(&b);
|
|
if(trace) werrstr(" def file %s\n", s);
|
|
break;
|
|
}
|
|
if(b.p == nil || b.p > end)
|
|
goto bad;
|
|
b.p = end;
|
|
break;
|
|
case 1: /* emit */
|
|
if(trace) werrstr(" emit\n");
|
|
goto emit;
|
|
case 2: /* advance pc */
|
|
a = dwarfget128(&b);
|
|
if(trace) werrstr(" advance pc + %lu\n", a*quantum);
|
|
cur.addr += a * quantum;
|
|
break;
|
|
case 3: /* advance line */
|
|
l = dwarfget128s(&b);
|
|
if(trace) werrstr(" advance line + %ld\n", l);
|
|
cur.line += l;
|
|
break;
|
|
case 4: /* set file */
|
|
if(trace) werrstr(" set file\n");
|
|
cur.file = dwarfget128s(&b);
|
|
break;
|
|
case 5: /* set column */
|
|
if(trace) werrstr(" set column\n");
|
|
cur.column = dwarfget128(&b);
|
|
break;
|
|
case 6: /* negate stmt */
|
|
if(trace) werrstr(" negate stmt\n");
|
|
cur.flags ^= Isstmt;
|
|
break;
|
|
case 7: /* set basic block */
|
|
if(trace) werrstr(" set basic block\n");
|
|
cur.flags |= BasicDwarfBlock;
|
|
break;
|
|
case 8: /* const add pc */
|
|
a = (255 - opcodebase) / linerange * quantum;
|
|
if(trace) werrstr(" const add pc + %d\n", a);
|
|
cur.addr += a;
|
|
break;
|
|
case 9: /* fixed advance pc */
|
|
a = dwarfget2(&b);
|
|
if(trace) werrstr(" fixed advance pc + %d\n", a);
|
|
cur.addr += a;
|
|
break;
|
|
case 10: /* set prologue end */
|
|
if(trace) werrstr(" set prologue end\n");
|
|
cur.flags |= PrologueEnd;
|
|
break;
|
|
case 11: /* set epilogue begin */
|
|
if(trace) werrstr(" set epilogue begin\n");
|
|
cur.flags |= EpilogueBegin;
|
|
break;
|
|
case 12: /* set isa */
|
|
if(trace) werrstr(" set isa\n");
|
|
cur.isa = dwarfget128(&b);
|
|
break;
|
|
default: /* something new - skip it */
|
|
if(trace) werrstr(" unknown %d\n", opcount[op]);
|
|
for(i=0; i<opcount[op]; i++)
|
|
dwarfget128(&b);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if(b.p == nil)
|
|
goto bad;
|
|
|
|
/* finally! the data we seek is in "emit" */
|
|
|
|
if(emit.file == 0){
|
|
werrstr("invalid file index in mapping data");
|
|
goto out;
|
|
}
|
|
if(line)
|
|
*line = emit.line;
|
|
|
|
/* skip over first emit.file-2 guys */
|
|
b.p = (uchar*)files;
|
|
for(i=emit.file-1; i > 0 && b.p!=nil && *b.p!=0; i--){
|
|
dwarfgetstring(&b);
|
|
dwarfget128(&b);
|
|
dwarfget128(&b);
|
|
dwarfget128(&b);
|
|
}
|
|
if(b.p == nil){
|
|
werrstr("problem parsing file data second time (cannot happen)");
|
|
goto bad;
|
|
}
|
|
if(*b.p == 0){
|
|
if(i >= nf){
|
|
werrstr("bad file index in mapping data");
|
|
goto bad;
|
|
}
|
|
b.p = f[i];
|
|
}
|
|
s = dwarfgetstring(&b);
|
|
if(file)
|
|
*file = s;
|
|
i = dwarfget128(&b); /* directory */
|
|
x = dwarfget128(&b);
|
|
if(mtime)
|
|
*mtime = x;
|
|
x = dwarfget128(&b);
|
|
if(length)
|
|
*length = x;
|
|
|
|
/* fetch dir name */
|
|
if(cdir)
|
|
*cdir = sym.attrs.compdir;
|
|
|
|
if(dir){
|
|
*dir = nil;
|
|
b.p = dirs;
|
|
for (x = 1; b.p && *b.p; x++)
|
|
if (x == i) {
|
|
*dir = dwarfgetstring(&b);
|
|
break;
|
|
}
|
|
}
|
|
|
|
*function = nil;
|
|
lastline = 0;
|
|
#if 0
|
|
if (dwarfenumunit(d, unit, &proc) >= 0) {
|
|
dwarfnextsymat(d, &proc, 0);
|
|
while (dwarfnextsymat(d, &proc, 1) == 1) {
|
|
if (proc.attrs.tag == TagSubprogram &&
|
|
proc.attrs.have.name &&
|
|
proc.attrs.declfile == emit.file &&
|
|
proc.attrs.declline <= *line &&
|
|
proc.attrs.declline > lastline) {
|
|
lastline = proc.attrs.declline;
|
|
free(*function);
|
|
*function = malloc(strlen(proc.attrs.name)+1);
|
|
strcpy(*function, proc.attrs.name);
|
|
}
|
|
}
|
|
}
|
|
#elif 1
|
|
ulong lastaddr = 0;
|
|
*function = NULL;
|
|
for (i = 0; i < d->pe->nsymbols; i++) {
|
|
if (d->pe->symtab[i].address > lastaddr &&
|
|
d->pe->symtab[i].address <= pc - d->pe->imagebase &&
|
|
d->pe->symtab[i].address < d->pe->imagesize) {
|
|
lastaddr = d->pe->symtab[i].address;
|
|
*function = d->pe->symtab[i].name;
|
|
}
|
|
}
|
|
#else
|
|
// *sigh* we get unrelocated low_pc and high_pc because the dwarf symbols
|
|
// are not 'loaded' in the PE sense.
|
|
if (dwarflookupfn(d, unit, pc, &proc) >= 0) {
|
|
*function = malloc(strlen(proc.attrs.name)+1);
|
|
strcpy(*function, proc.attrs.name);
|
|
}
|
|
#endif
|
|
|
|
/* free at last, free at last */
|
|
free(f);
|
|
return 0;
|
|
|
|
bad:
|
|
werrstr("corrupted line mapping for 0x%x", pc);
|
|
out:
|
|
free(f);
|
|
return -1;
|
|
}
|
|
|