1436 lines
24 KiB
C
1436 lines
24 KiB
C
#define EXTERN
|
|
#include "l.h"
|
|
#include <ar.h>
|
|
|
|
#ifndef DEFAULT
|
|
#define DEFAULT '9'
|
|
#endif
|
|
|
|
char *noname = "<none>";
|
|
char symname[] = SYMDEF;
|
|
char thechar = '2';
|
|
char *thestring = "68020";
|
|
|
|
/*
|
|
* -H0 -T0x40004C -D0x10000000 is garbage unix
|
|
* -H1 -T0x80020000 -R4 is garbage format
|
|
* -H2 -T8224 -R8192 is plan9 format
|
|
* -H3 -Tx -Rx is next boot
|
|
*/
|
|
|
|
void
|
|
main(int argc, char *argv[])
|
|
{
|
|
int i, c;
|
|
char *a;
|
|
|
|
Binit(&bso, 1, OWRITE);
|
|
cout = -1;
|
|
listinit();
|
|
memset(debug, 0, sizeof(debug));
|
|
nerrors = 0;
|
|
outfile = "2.out";
|
|
HEADTYPE = -1;
|
|
INITTEXT = -1;
|
|
INITDAT = -1;
|
|
INITRND = -1;
|
|
INITENTRY = 0;
|
|
|
|
ARGBEGIN {
|
|
default:
|
|
c = ARGC();
|
|
if(c >= 0 && c < sizeof(debug))
|
|
debug[c]++;
|
|
break;
|
|
case 'o': /* output to (next arg) */
|
|
outfile = ARGF();
|
|
break;
|
|
case 'E':
|
|
a = ARGF();
|
|
if(a)
|
|
INITENTRY = a;
|
|
break;
|
|
case 'H':
|
|
a = ARGF();
|
|
if(a)
|
|
HEADTYPE = atolwhex(a);
|
|
break;
|
|
case 'T':
|
|
a = ARGF();
|
|
if(a)
|
|
INITTEXT = atolwhex(a);
|
|
break;
|
|
case 'D':
|
|
a = ARGF();
|
|
if(a)
|
|
INITDAT = atolwhex(a);
|
|
break;
|
|
case 'R':
|
|
a = ARGF();
|
|
if(a)
|
|
INITRND = atolwhex(a);
|
|
break;
|
|
} ARGEND
|
|
|
|
USED(argc);
|
|
|
|
if(*argv == 0) {
|
|
diag("usage: 2l [-options] objects");
|
|
errorexit();
|
|
}
|
|
if(!debug['9'] && !debug['U'] && !debug['B'])
|
|
debug[DEFAULT] = 1;
|
|
if(HEADTYPE == -1) {
|
|
if(debug['U'])
|
|
HEADTYPE = 2;
|
|
if(debug['B'])
|
|
HEADTYPE = 2;
|
|
if(debug['9'])
|
|
HEADTYPE = 2;
|
|
}
|
|
if(INITDAT != -1 && INITRND == -1)
|
|
INITRND = 0;
|
|
switch(HEADTYPE) {
|
|
default:
|
|
diag("unknown -H option %ld", HEADTYPE);
|
|
errorexit();
|
|
|
|
case 0: /* this is garbage */
|
|
HEADR = 20L+56L;
|
|
if(INITTEXT == -1)
|
|
INITTEXT = 0x40004CL;
|
|
if(INITDAT == -1)
|
|
INITDAT = 0x10000000L;
|
|
if(INITDAT != 0 && INITRND == -1)
|
|
INITRND = 0;
|
|
if(INITRND == -1)
|
|
INITRND = 0;
|
|
break;
|
|
case 1: /* plan9 boot data goes into text */
|
|
HEADR = 32L;
|
|
if(INITTEXT == -1)
|
|
INITTEXT = 8224;
|
|
if(INITDAT == -1)
|
|
INITDAT = 0;
|
|
if(INITDAT != 0 && INITRND == -1)
|
|
INITRND = 0;
|
|
if(INITRND == -1)
|
|
INITRND = 8192;
|
|
break;
|
|
case 2: /* plan 9 */
|
|
HEADR = 32L;
|
|
if(INITTEXT == -1)
|
|
INITTEXT = 8224;
|
|
if(INITDAT == -1)
|
|
INITDAT = 0;
|
|
if(INITDAT != 0 && INITRND == -1)
|
|
INITRND = 0;
|
|
if(INITRND == -1)
|
|
INITRND = 8192;
|
|
break;
|
|
case 3: /* next boot */
|
|
HEADR = 28+124+192+24;
|
|
if(INITTEXT == -1)
|
|
INITTEXT = 0x04002000;
|
|
if(INITDAT == -1)
|
|
INITDAT = 0;
|
|
if(INITDAT != 0 && INITRND == -1)
|
|
INITRND = 0;
|
|
if(INITRND == -1)
|
|
INITRND = 8192L;
|
|
break;
|
|
case 4: /* preprocess pilot */
|
|
HEADR = 32L;
|
|
if(INITTEXT == -1)
|
|
INITTEXT = 0;
|
|
if(INITDAT == -1)
|
|
INITDAT = 0;
|
|
if(INITDAT != 0 && INITRND == -1)
|
|
INITRND = 0;
|
|
if(INITRND == -1)
|
|
INITRND = 32;
|
|
break;
|
|
}
|
|
if(INITDAT != 0 && INITRND != 0)
|
|
print("warning: -D0x%lux is ignored because of -R0x%lux\n",
|
|
INITDAT, INITRND);
|
|
if(debug['v'])
|
|
Bprint(&bso, "HEADER = -H0x%ld -T0x%lux -D0x%lux -R0x%lux\n",
|
|
HEADTYPE, INITTEXT, INITDAT, INITRND);
|
|
Bflush(&bso);
|
|
for(i=1; optab[i].as; i++)
|
|
if(i != optab[i].as) {
|
|
diag("phase error in optab: %d", i);
|
|
errorexit();
|
|
}
|
|
|
|
zprg.link = P;
|
|
zprg.pcond = P;
|
|
zprg.back = 2;
|
|
zprg.as = AGOK;
|
|
zprg.from.type = D_NONE;
|
|
zprg.from.index = D_NONE;
|
|
zprg.to = zprg.from;
|
|
|
|
memset(special, 0, sizeof(special));
|
|
special[D_CCR] = 1;
|
|
special[D_SR] = 1;
|
|
special[D_SFC] = 1;
|
|
special[D_CACR] = 1;
|
|
special[D_USP] = 1;
|
|
special[D_VBR] = 1;
|
|
special[D_CAAR] = 1;
|
|
special[D_MSP] = 1;
|
|
special[D_ISP] = 1;
|
|
special[D_DFC] = 1;
|
|
special[D_FPCR] = 1;
|
|
special[D_FPSR] = 1;
|
|
special[D_FPIAR] = 1;
|
|
special[D_TC] = 1;
|
|
special[D_ITT0] = 1;
|
|
special[D_ITT1] = 1;
|
|
special[D_DTT0] = 1;
|
|
special[D_DTT1] = 1;
|
|
special[D_MMUSR] = 1;
|
|
special[D_URP] = 1;
|
|
special[D_SRP] = 1;
|
|
memset(simple, 0177, sizeof(simple));
|
|
for(i=0; i<8; i++) {
|
|
simple[D_R0+i] = i;
|
|
simple[D_F0+i] = i+0100;
|
|
simple[D_A0+i] = i+010;
|
|
simple[D_A0+I_INDIR+i] = i+020;
|
|
simple[D_A0+I_INDINC+i] = i+030;
|
|
simple[D_A0+I_INDDEC+i] = i+040;
|
|
}
|
|
nuxiinit();
|
|
histgen = 0;
|
|
textp = P;
|
|
datap = P;
|
|
pc = 0;
|
|
cout = create(outfile, 1, 0775);
|
|
if(cout < 0) {
|
|
diag("cannot create %s", outfile);
|
|
errorexit();
|
|
}
|
|
version = 0;
|
|
cbp = buf.cbuf;
|
|
cbc = sizeof(buf.cbuf);
|
|
firstp = prg();
|
|
lastp = firstp;
|
|
|
|
if(INITENTRY == 0) {
|
|
INITENTRY = "_main";
|
|
if(debug['p'])
|
|
INITENTRY = "_mainp";
|
|
if(!debug['l'])
|
|
lookup(INITENTRY, 0)->type = SXREF;
|
|
} else
|
|
lookup(INITENTRY, 0)->type = SXREF;
|
|
|
|
while(*argv)
|
|
objfile(*argv++);
|
|
if(!debug['l'])
|
|
loadlib();
|
|
firstp = firstp->link;
|
|
if(firstp == P)
|
|
errorexit();
|
|
patch();
|
|
if(debug['p'])
|
|
if(debug['1'])
|
|
doprof1();
|
|
else
|
|
doprof2();
|
|
follow();
|
|
dodata();
|
|
dostkoff();
|
|
span();
|
|
asmb();
|
|
undef();
|
|
if(debug['v']) {
|
|
Bprint(&bso, "%5.2f cpu time\n", cputime());
|
|
Bprint(&bso, "%ld+%ld = %ld data statements\n",
|
|
ndata, ncase, ndata+ncase);
|
|
Bprint(&bso, "%ld symbols\n", nsymbol);
|
|
Bprint(&bso, "%ld memory used\n", thunk);
|
|
Bprint(&bso, "%d sizeof adr\n", sizeof(Adr));
|
|
Bprint(&bso, "%d sizeof prog\n", sizeof(Prog));
|
|
}
|
|
Bflush(&bso);
|
|
|
|
errorexit();
|
|
}
|
|
|
|
void
|
|
loadlib(void)
|
|
{
|
|
int i;
|
|
long h;
|
|
Sym *s;
|
|
|
|
loop:
|
|
xrefresolv = 0;
|
|
for(i=0; i<libraryp; i++) {
|
|
if(debug['v'])
|
|
Bprint(&bso, "%5.2f autolib: %s (from %s)\n", cputime(), library[i], libraryobj[i]);
|
|
objfile(library[i]);
|
|
}
|
|
if(xrefresolv)
|
|
for(h=0; h<nelem(hash); h++)
|
|
for(s = hash[h]; s != S; s = s->link)
|
|
if(s->type == SXREF)
|
|
goto loop;
|
|
}
|
|
|
|
void
|
|
errorexit(void)
|
|
{
|
|
|
|
Bflush(&bso);
|
|
if(nerrors) {
|
|
if(cout >= 0)
|
|
remove(outfile);
|
|
exits("error");
|
|
}
|
|
exits(0);
|
|
}
|
|
|
|
void
|
|
objfile(char *file)
|
|
{
|
|
long off, esym, cnt, l;
|
|
int f, work;
|
|
Sym *s;
|
|
char magbuf[SARMAG];
|
|
char name[100], pname[150];
|
|
struct ar_hdr arhdr;
|
|
char *e, *start, *stop;
|
|
|
|
if(file[0] == '-' && file[1] == 'l') {
|
|
if(debug['9'])
|
|
sprint(name, "/%s/lib/lib", thestring);
|
|
else
|
|
sprint(name, "/usr/%clib/lib", thechar);
|
|
strcat(name, file+2);
|
|
strcat(name, ".a");
|
|
file = name;
|
|
}
|
|
if(debug['v'])
|
|
Bprint(&bso, "%5.2f ldobj: %s\n", cputime(), file);
|
|
Bflush(&bso);
|
|
f = open(file, 0);
|
|
if(f < 0) {
|
|
diag("cannot open file: %s", file);
|
|
errorexit();
|
|
}
|
|
l = read(f, magbuf, SARMAG);
|
|
if(l != SARMAG || strncmp(magbuf, ARMAG, SARMAG)){
|
|
/* load it as a regular file */
|
|
l = seek(f, 0L, 2);
|
|
seek(f, 0L, 0);
|
|
ldobj(f, l, file);
|
|
close(f);
|
|
return;
|
|
}
|
|
|
|
l = read(f, &arhdr, SAR_HDR);
|
|
if(l != SAR_HDR) {
|
|
diag("%s: short read on archive file symbol header", file);
|
|
goto out;
|
|
}
|
|
if(strncmp(arhdr.name, symname, strlen(symname))) {
|
|
diag("%s: first entry not symbol header", file);
|
|
goto out;
|
|
}
|
|
|
|
esym = SARMAG + SAR_HDR + atolwhex(arhdr.size);
|
|
off = SARMAG + SAR_HDR;
|
|
|
|
/*
|
|
* just bang the whole symbol file into memory
|
|
*/
|
|
seek(f, off, 0);
|
|
cnt = esym - off;
|
|
start = malloc(cnt + 10);
|
|
cnt = read(f, start, cnt);
|
|
if(cnt <= 0){
|
|
close(f);
|
|
return;
|
|
}
|
|
stop = &start[cnt];
|
|
memset(stop, 0, 10);
|
|
|
|
work = 1;
|
|
while(work){
|
|
if(debug['v'])
|
|
Bprint(&bso, "%5.2f library pass: %s\n", cputime(), file);
|
|
Bflush(&bso);
|
|
work = 0;
|
|
for(e = start; e < stop; e = strchr(e+5, 0) + 1) {
|
|
s = lookup(e+5, 0);
|
|
if(s->type != SXREF)
|
|
continue;
|
|
sprint(pname, "%s(%s)", file, s->name);
|
|
if(debug['v'])
|
|
Bprint(&bso, "%5.2f library: %s\n", cputime(), pname);
|
|
Bflush(&bso);
|
|
l = e[1] & 0xff;
|
|
l |= (e[2] & 0xff) << 8;
|
|
l |= (e[3] & 0xff) << 16;
|
|
l |= (e[4] & 0xff) << 24;
|
|
seek(f, l, 0);
|
|
l = read(f, &arhdr, SAR_HDR);
|
|
if(l != SAR_HDR)
|
|
goto bad;
|
|
if(strncmp(arhdr.fmag, ARFMAG, sizeof(arhdr.fmag)))
|
|
goto bad;
|
|
l = atolwhex(arhdr.size);
|
|
ldobj(f, l, pname);
|
|
if(s->type == SXREF) {
|
|
diag("%s: failed to load: %s", file, s->name);
|
|
errorexit();
|
|
}
|
|
work = 1;
|
|
xrefresolv = 1;
|
|
}
|
|
}
|
|
return;
|
|
|
|
bad:
|
|
diag("%s: bad or out of date archive", file);
|
|
out:
|
|
close(f);
|
|
}
|
|
|
|
int
|
|
zaddr(uchar *p, Adr *a, Sym *h[])
|
|
{
|
|
int c, t, i;
|
|
long l;
|
|
Sym *s;
|
|
Auto *u;
|
|
|
|
t = p[0];
|
|
|
|
/*
|
|
* first try the high-time formats
|
|
*/
|
|
if(t == 0) {
|
|
a->index = D_NONE;
|
|
a->type = p[1];
|
|
return 2;
|
|
}
|
|
if(t == T_OFFSET) {
|
|
a->index = D_NONE;
|
|
a->offset = p[1] | (p[2]<<8) | (p[3]<<16) | (p[4]<<24);
|
|
a->type = p[5];
|
|
return 6;
|
|
}
|
|
if(t == (T_OFFSET|T_SYM)) {
|
|
a->index = D_NONE;
|
|
a->offset = p[1] | (p[2]<<8) | (p[3]<<16) | (p[4]<<24);
|
|
s = h[p[5]];
|
|
a->sym = s;
|
|
a->type = p[6];
|
|
c = 7;
|
|
goto dosym;
|
|
}
|
|
if(t == T_SYM) {
|
|
a->index = D_NONE;
|
|
s = h[p[1]];
|
|
a->sym = s;
|
|
a->type = p[2];
|
|
c = 3;
|
|
goto dosym;
|
|
}
|
|
if(t == (T_INDEX|T_OFFSET|T_SYM)) {
|
|
a->index = p[1] | (p[2]<<8);
|
|
a->scale = p[3];
|
|
a->displace = p[4] | (p[5]<<8) | (p[6]<<16) | (p[7]<<24);
|
|
a->offset = p[8] | (p[9]<<8) | (p[10]<<16) | (p[11]<<24);
|
|
s = h[p[12]];
|
|
a->sym = s;
|
|
a->type = p[13];
|
|
c = 14;
|
|
goto dosym;
|
|
}
|
|
|
|
/*
|
|
* now do it the hard way
|
|
*/
|
|
c = 1;
|
|
a->index = D_NONE;
|
|
if(t & T_FIELD) {
|
|
a->field = p[c] | (p[c+1]<<8);
|
|
c += 2;
|
|
}
|
|
if(t & T_INDEX) {
|
|
a->index = p[c] | (p[c+1]<<8);
|
|
a->scale = p[c+2];
|
|
a->displace = p[c+3] | (p[c+4]<<8) | (p[c+5]<<16) | (p[c+6]<<24);
|
|
c += 7;
|
|
}
|
|
if(t & T_OFFSET) {
|
|
a->offset = p[c] | (p[c+1]<<8) | (p[c+2]<<16) | (p[c+3]<<24);
|
|
c += 4;
|
|
}
|
|
if(t & T_SYM) {
|
|
a->sym = h[p[c]];
|
|
c += 1;
|
|
}
|
|
if(t & T_FCONST) {
|
|
a->ieee.l = p[c] | (p[c+1]<<8) | (p[c+2]<<16) | (p[c+3]<<24);
|
|
a->ieee.h = p[c+4] | (p[c+5]<<8) | (p[c+6]<<16) | (p[c+7]<<24);
|
|
c += 8;
|
|
a->type = D_FCONST;
|
|
} else
|
|
if(t & T_SCONST) {
|
|
for(i=0; i<NSNAME; i++)
|
|
a->scon[i] = p[c+i];
|
|
c += NSNAME;
|
|
a->type = D_SCONST;
|
|
} else
|
|
if(t & T_TYPE) {
|
|
a->type = p[c] | (p[c+1]<<8);
|
|
c += 2;
|
|
} else {
|
|
a->type = p[c];
|
|
c++;
|
|
}
|
|
s = a->sym;
|
|
if(s == S)
|
|
return c;
|
|
|
|
dosym:
|
|
t = a->type & D_MASK;
|
|
if(t != D_AUTO && t != D_PARAM)
|
|
return c;
|
|
l = a->offset;
|
|
for(u=curauto; u; u=u->link) {
|
|
if(u->asym == s)
|
|
if(u->type == t) {
|
|
if(u->aoffset > l)
|
|
u->aoffset = l;
|
|
return c;
|
|
}
|
|
}
|
|
|
|
while(nhunk < sizeof(Auto))
|
|
gethunk();
|
|
u = (Auto*)hunk;
|
|
nhunk -= sizeof(Auto);
|
|
hunk += sizeof(Auto);
|
|
|
|
u->link = curauto;
|
|
curauto = u;
|
|
u->asym = s;
|
|
u->aoffset = l;
|
|
u->type = t;
|
|
return c;
|
|
}
|
|
|
|
void
|
|
addlib(char *obj)
|
|
{
|
|
char name[1024], comp[256], *p;
|
|
int i;
|
|
|
|
if(histfrogp <= 0)
|
|
return;
|
|
|
|
if(histfrog[0]->name[1] == '/') {
|
|
sprint(name, "");
|
|
i = 1;
|
|
} else
|
|
if(histfrog[0]->name[1] == '.') {
|
|
sprint(name, ".");
|
|
i = 0;
|
|
} else {
|
|
if(debug['9'])
|
|
sprint(name, "/%s/lib", thestring);
|
|
else
|
|
sprint(name, "/usr/%clib", thechar);
|
|
i = 0;
|
|
}
|
|
|
|
for(; i<histfrogp; i++) {
|
|
snprint(comp, sizeof comp, histfrog[i]->name+1);
|
|
for(;;) {
|
|
p = strstr(comp, "$O");
|
|
if(p == 0)
|
|
break;
|
|
memmove(p+1, p+2, strlen(p+2)+1);
|
|
p[0] = thechar;
|
|
}
|
|
for(;;) {
|
|
p = strstr(comp, "$M");
|
|
if(p == 0)
|
|
break;
|
|
if(strlen(comp)+strlen(thestring)-2+1 >= sizeof comp) {
|
|
diag("library component too long");
|
|
return;
|
|
}
|
|
memmove(p+strlen(thestring), p+2, strlen(p+2)+1);
|
|
memmove(p, thestring, strlen(thestring));
|
|
}
|
|
if(strlen(name) + strlen(comp) + 3 >= sizeof(name)) {
|
|
diag("library component too long");
|
|
return;
|
|
}
|
|
strcat(name, "/");
|
|
strcat(name, comp);
|
|
}
|
|
for(i=0; i<libraryp; i++)
|
|
if(strcmp(name, library[i]) == 0)
|
|
return;
|
|
if(libraryp == nelem(library)){
|
|
diag("too many autolibs; skipping %s", name);
|
|
return;
|
|
}
|
|
|
|
p = malloc(strlen(name) + 1);
|
|
strcpy(p, name);
|
|
library[libraryp] = p;
|
|
p = malloc(strlen(obj) + 1);
|
|
strcpy(p, obj);
|
|
libraryobj[libraryp] = p;
|
|
libraryp++;
|
|
}
|
|
void
|
|
addhist(long line, int type)
|
|
{
|
|
Auto *u;
|
|
Sym *s;
|
|
int i, j, k;
|
|
|
|
u = malloc(sizeof(Auto));
|
|
s = malloc(sizeof(Sym));
|
|
s->name = malloc(2*(histfrogp+1) + 1);
|
|
|
|
u->asym = s;
|
|
u->type = type;
|
|
u->aoffset = line;
|
|
u->link = curhist;
|
|
curhist = u;
|
|
|
|
j = 1;
|
|
for(i=0; i<histfrogp; i++) {
|
|
k = histfrog[i]->value;
|
|
s->name[j+0] = k>>8;
|
|
s->name[j+1] = k;
|
|
j += 2;
|
|
}
|
|
}
|
|
|
|
void
|
|
histtoauto(void)
|
|
{
|
|
Auto *l;
|
|
|
|
while(l = curhist) {
|
|
curhist = l->link;
|
|
l->link = curauto;
|
|
curauto = l;
|
|
}
|
|
}
|
|
|
|
void
|
|
collapsefrog(Sym *s)
|
|
{
|
|
int i;
|
|
|
|
/*
|
|
* bad encoding of path components only allows
|
|
* MAXHIST components. if there is an overflow,
|
|
* first try to collapse xxx/..
|
|
*/
|
|
for(i=1; i<histfrogp; i++)
|
|
if(strcmp(histfrog[i]->name+1, "..") == 0) {
|
|
memmove(histfrog+i-1, histfrog+i+1,
|
|
(histfrogp-i-1)*sizeof(histfrog[0]));
|
|
histfrogp--;
|
|
goto out;
|
|
}
|
|
|
|
/*
|
|
* next try to collapse .
|
|
*/
|
|
for(i=0; i<histfrogp; i++)
|
|
if(strcmp(histfrog[i]->name+1, ".") == 0) {
|
|
memmove(histfrog+i, histfrog+i+1,
|
|
(histfrogp-i-1)*sizeof(histfrog[0]));
|
|
goto out;
|
|
}
|
|
|
|
/*
|
|
* last chance, just truncate from front
|
|
*/
|
|
memmove(histfrog+0, histfrog+1,
|
|
(histfrogp-1)*sizeof(histfrog[0]));
|
|
|
|
out:
|
|
histfrog[histfrogp-1] = s;
|
|
}
|
|
|
|
uchar*
|
|
readsome(int f, uchar *buf, uchar *good, uchar *stop, int max)
|
|
{
|
|
int n;
|
|
|
|
n = stop - good;
|
|
memmove(buf, good, stop - good);
|
|
stop = buf + n;
|
|
n = MAXIO - n;
|
|
if(n > max)
|
|
n = max;
|
|
n = read(f, stop, n);
|
|
if(n <= 0)
|
|
return 0;
|
|
return stop + n;
|
|
}
|
|
|
|
void
|
|
ldobj(int f, long c, char *pn)
|
|
{
|
|
Prog *p;
|
|
Sym *h[NSYM], *s;
|
|
int v, o, r;
|
|
long ipc, lv;
|
|
double dv;
|
|
uchar *bloc, *bsize, *stop;
|
|
|
|
bsize = buf.xbuf;
|
|
bloc = buf.xbuf;
|
|
|
|
newloop:
|
|
memset(h, 0, sizeof(h));
|
|
version++;
|
|
histfrogp = 0;
|
|
ipc = pc;
|
|
|
|
loop:
|
|
if(c <= 0)
|
|
goto eof;
|
|
r = bsize - bloc;
|
|
if(r < 100 && r < c) { /* enough for largest prog */
|
|
bsize = readsome(f, buf.xbuf, bloc, bsize, c);
|
|
if(bsize == 0)
|
|
goto eof;
|
|
bloc = buf.xbuf;
|
|
goto loop;
|
|
}
|
|
o = bloc[0] | (bloc[1] << 8);
|
|
if(o <= AXXX || o >= ALAST) {
|
|
if(o < 0)
|
|
goto eof;
|
|
diag("%s: opcode out of range %d", pn, o);
|
|
print(" probably not a .2 file\n");
|
|
errorexit();
|
|
}
|
|
|
|
if(o == ANAME || o == ASIGNAME) {
|
|
if(o == ASIGNAME) {
|
|
bloc += 4;
|
|
c -= 4;
|
|
}
|
|
stop = memchr(&bloc[4], 0, bsize-&bloc[4]);
|
|
if(stop == 0){
|
|
bsize = readsome(f, buf.xbuf, bloc, bsize, c);
|
|
if(bsize == 0)
|
|
goto eof;
|
|
bloc = buf.xbuf;
|
|
stop = memchr(&bloc[4], 0, bsize-&bloc[4]);
|
|
if(stop == 0){
|
|
fprint(2, "%s: name too long\n", pn);
|
|
errorexit();
|
|
}
|
|
}
|
|
v = bloc[2]; /* type */
|
|
o = bloc[3]; /* sym */
|
|
bloc += 4;
|
|
c -= 4;
|
|
|
|
r = 0;
|
|
if(v == D_STATIC)
|
|
r = version;
|
|
s = lookup((char*)bloc, r);
|
|
c -= &stop[1] - bloc;
|
|
bloc = stop + 1;
|
|
|
|
if(debug['W'])
|
|
print(" ANAME %s\n", s->name);
|
|
h[o] = s;
|
|
if((v == D_EXTERN || v == D_STATIC) && s->type == 0)
|
|
s->type = SXREF;
|
|
if(v == D_FILE) {
|
|
if(s->type != SFILE) {
|
|
histgen++;
|
|
s->type = SFILE;
|
|
s->value = histgen;
|
|
}
|
|
if(histfrogp < MAXHIST) {
|
|
histfrog[histfrogp] = s;
|
|
histfrogp++;
|
|
} else
|
|
collapsefrog(s);
|
|
}
|
|
goto loop;
|
|
}
|
|
|
|
while(nhunk < sizeof(Prog))
|
|
gethunk();
|
|
p = (Prog*)hunk;
|
|
nhunk -= sizeof(Prog);
|
|
hunk += sizeof(Prog);
|
|
|
|
p->as = o;
|
|
p->line = bloc[2] | (bloc[3] << 8) | (bloc[4] << 16) | (bloc[5] << 24);
|
|
p->back = 2;
|
|
r = zaddr(bloc+6, &p->from, h) + 6;
|
|
r += zaddr(bloc+r, &p->to, h);
|
|
bloc += r;
|
|
c -= r;
|
|
|
|
if(debug['W'])
|
|
print("%P\n", p);
|
|
|
|
switch(p->as) {
|
|
case AHISTORY:
|
|
if(p->to.offset == -1) {
|
|
addlib(pn);
|
|
histfrogp = 0;
|
|
goto loop;
|
|
}
|
|
addhist(p->line, D_FILE); /* 'z' */
|
|
if(p->to.offset)
|
|
addhist(p->to.offset, D_FILE1); /* 'Z' */
|
|
histfrogp = 0;
|
|
goto loop;
|
|
|
|
case AEND:
|
|
histtoauto();
|
|
if(curtext != P)
|
|
curtext->to.autom = curauto;
|
|
curauto = 0;
|
|
curtext = P;
|
|
if(c)
|
|
goto newloop;
|
|
return;
|
|
|
|
case AGLOBL:
|
|
s = p->from.sym;
|
|
if(s->type == 0 || s->type == SXREF) {
|
|
s->type = SBSS;
|
|
s->value = 0;
|
|
}
|
|
if(s->type != SBSS) {
|
|
diag("%s: redefinition: %s in %s",
|
|
pn, s->name, TNAME);
|
|
s->type = SBSS;
|
|
s->value = 0;
|
|
}
|
|
if(p->to.offset > s->value)
|
|
s->value = p->to.offset;
|
|
goto loop;
|
|
|
|
case ABCASE:
|
|
ncase++;
|
|
goto casdef;
|
|
|
|
case ADATA:
|
|
p->link = datap;
|
|
datap = p;
|
|
ndata++;
|
|
goto loop;
|
|
|
|
case AGOK:
|
|
diag("%s: unknown opcode in %s", pn, TNAME);
|
|
pc++;
|
|
goto loop;
|
|
|
|
case ATEXT:
|
|
if(curtext != P) {
|
|
histtoauto();
|
|
curtext->to.autom = curauto;
|
|
curauto = 0;
|
|
}
|
|
curtext = p;
|
|
lastp->link = p;
|
|
lastp = p;
|
|
p->pc = pc;
|
|
s = p->from.sym;
|
|
if(s->type != 0 && s->type != SXREF)
|
|
diag("%s: redefinition: %s", pn, s->name);
|
|
s->type = STEXT;
|
|
s->value = p->pc;
|
|
pc++;
|
|
p->pcond = P;
|
|
if(textp == P) {
|
|
textp = p;
|
|
etextp = p;
|
|
goto loop;
|
|
}
|
|
etextp->pcond = p;
|
|
etextp = p;
|
|
goto loop;
|
|
|
|
case AJSR:
|
|
p->as = ABSR;
|
|
|
|
case ABSR:
|
|
if(p->to.index != D_NONE)
|
|
p->as = AJSR;
|
|
if(p->to.type != D_EXTERN && p->to.type != D_STATIC)
|
|
p->as = AJSR;
|
|
goto casdef;
|
|
|
|
case AMOVL:
|
|
case AMOVB:
|
|
case AMOVW:
|
|
if(p->from.type != D_CONST)
|
|
goto casdef;
|
|
lv = p->from.offset;
|
|
if(lv >= -128 && lv < 128)
|
|
if(p->to.type >= D_R0 && p->to.type < D_R0+8)
|
|
if(p->to.index == D_NONE) {
|
|
p->from.type = D_QUICK;
|
|
goto casdef;
|
|
}
|
|
|
|
if(lv >= -0x7fff && lv <= 0x7fff)
|
|
if(p->to.type >= D_A0 && p->to.type < D_A0+8)
|
|
if(p->to.index == D_NONE)
|
|
if(p->as == AMOVL)
|
|
p->as = AMOVW;
|
|
goto casdef;
|
|
|
|
case AADDB:
|
|
case AADDL:
|
|
case AADDW:
|
|
if(p->from.type != D_CONST)
|
|
goto casdef;
|
|
lv = p->from.offset;
|
|
if(lv < 0) {
|
|
lv = -lv;
|
|
p->from.offset = lv;
|
|
if(p->as == AADDB)
|
|
p->as = ASUBB;
|
|
else
|
|
if(p->as == AADDW)
|
|
p->as = ASUBW;
|
|
else
|
|
if(p->as == AADDL)
|
|
p->as = ASUBL;
|
|
}
|
|
if(lv > 0)
|
|
if(lv <= 8)
|
|
p->from.type = D_QUICK;
|
|
goto casdef;
|
|
|
|
case ASUBB:
|
|
case ASUBL:
|
|
case ASUBW:
|
|
if(p->from.type != D_CONST)
|
|
goto casdef;
|
|
lv = p->from.offset;
|
|
if(lv < 0) {
|
|
lv = -lv;
|
|
p->from.offset = lv;
|
|
if(p->as == ASUBB)
|
|
p->as = AADDB;
|
|
else
|
|
if(p->as == ASUBW)
|
|
p->as = AADDW;
|
|
else
|
|
if(p->as == ASUBL)
|
|
p->as = AADDL;
|
|
}
|
|
if(lv > 0)
|
|
if(lv <= 8)
|
|
p->from.type = D_QUICK;
|
|
goto casdef;
|
|
|
|
case AROTRB:
|
|
case AROTRL:
|
|
case AROTRW:
|
|
case AROTLB:
|
|
case AROTLL:
|
|
case AROTLW:
|
|
|
|
case AASLB:
|
|
case AASLL:
|
|
case AASLW:
|
|
case AASRB:
|
|
case AASRL:
|
|
case AASRW:
|
|
case ALSLB:
|
|
case ALSLL:
|
|
case ALSLW:
|
|
case ALSRB:
|
|
case ALSRL:
|
|
case ALSRW:
|
|
if(p->from.type == D_CONST)
|
|
if(p->from.offset > 0)
|
|
if(p->from.offset <= 8)
|
|
p->from.type = D_QUICK;
|
|
goto casdef;
|
|
|
|
case ATSTL:
|
|
if(p->to.type >= D_A0 && p->to.type < D_A0+8) {
|
|
p->as = ACMPW;
|
|
p->from = p->to;
|
|
p->to.type = D_CONST;
|
|
p->to.offset = 0;
|
|
}
|
|
goto casdef;
|
|
|
|
case ACMPL:
|
|
if(p->to.type != D_CONST)
|
|
goto casdef;
|
|
lv = p->to.offset;
|
|
if(lv >= -0x7fff && lv <= 0x7fff)
|
|
if(p->from.type >= D_A0 && p->from.type < D_A0+8)
|
|
if(p->from.index == D_NONE)
|
|
p->as = ACMPW;
|
|
goto casdef;
|
|
|
|
case ACLRL:
|
|
if(p->to.type >= D_A0 && p->to.type < D_A0+8) {
|
|
p->as = AMOVW;
|
|
p->from.type = D_CONST;
|
|
p->from.offset = 0;
|
|
}
|
|
goto casdef;
|
|
|
|
casdef:
|
|
default:
|
|
if(p->from.type == D_FCONST)
|
|
if(optab[p->as].fas != AXXX) {
|
|
dv = ieeedtod(&p->from.ieee);
|
|
if(dv >= -(1L<<30) && dv <= (1L<<30)) {
|
|
lv = dv;
|
|
if(lv == dv) {
|
|
p->as = optab[p->as].fas;
|
|
p->from.type = D_CONST;
|
|
p->from.offset = lv;
|
|
p->from.displace = 0;
|
|
}
|
|
}
|
|
}
|
|
if(p->to.type == D_BRANCH)
|
|
p->to.offset += ipc;
|
|
lastp->link = p;
|
|
lastp = p;
|
|
p->pc = pc;
|
|
pc++;
|
|
goto loop;
|
|
}
|
|
/* not reached */
|
|
|
|
eof:
|
|
diag("%s: truncated object file in %s", pn, TNAME);
|
|
}
|
|
|
|
Sym*
|
|
lookup(char *symb, int v)
|
|
{
|
|
Sym *s;
|
|
char *p;
|
|
long h;
|
|
int l, c;
|
|
|
|
h = v;
|
|
for(p=symb; c = *p; p++)
|
|
h = h+h+h + c;
|
|
l = (p - symb) + 1;
|
|
if(h < 0)
|
|
h = ~h;
|
|
h %= NHASH;
|
|
for(s = hash[h]; s != S; s = s->link)
|
|
if(s->version == v)
|
|
if(memcmp(s->name, symb, l) == 0)
|
|
return s;
|
|
|
|
while(nhunk < sizeof(Sym))
|
|
gethunk();
|
|
s = (Sym*)hunk;
|
|
nhunk -= sizeof(Sym);
|
|
hunk += sizeof(Sym);
|
|
|
|
s->name = malloc(l + 1);
|
|
memmove(s->name, symb, l);
|
|
|
|
s->link = hash[h];
|
|
s->type = 0;
|
|
s->version = v;
|
|
s->value = 0;
|
|
hash[h] = s;
|
|
nsymbol++;
|
|
return s;
|
|
}
|
|
|
|
Prog*
|
|
prg(void)
|
|
{
|
|
Prog *p;
|
|
|
|
while(nhunk < sizeof(Prog))
|
|
gethunk();
|
|
p = (Prog*)hunk;
|
|
nhunk -= sizeof(Prog);
|
|
hunk += sizeof(Prog);
|
|
|
|
*p = zprg;
|
|
return p;
|
|
}
|
|
|
|
Prog*
|
|
copyp(Prog *q)
|
|
{
|
|
Prog *p;
|
|
|
|
p = prg();
|
|
*p = *q;
|
|
return p;
|
|
}
|
|
|
|
Prog*
|
|
appendp(Prog *q)
|
|
{
|
|
Prog *p;
|
|
|
|
p = prg();
|
|
p->link = q->link;
|
|
q->link = p;
|
|
p->line = q->line;
|
|
return p;
|
|
}
|
|
|
|
void
|
|
gethunk(void)
|
|
{
|
|
char *h;
|
|
long nh;
|
|
|
|
nh = NHUNK;
|
|
if(thunk >= 5L*NHUNK) {
|
|
nh = 5L*NHUNK;
|
|
if(thunk >= 25L*NHUNK)
|
|
nh = 25L*NHUNK;
|
|
}
|
|
h = mysbrk(nh);
|
|
if(h == (char*)-1) {
|
|
diag("out of memory");
|
|
errorexit();
|
|
}
|
|
hunk = h;
|
|
nhunk = nh;
|
|
thunk += nh;
|
|
}
|
|
|
|
void
|
|
doprof1(void)
|
|
{
|
|
Sym *s;
|
|
long n;
|
|
Prog *p, *q;
|
|
|
|
if(debug['v'])
|
|
Bprint(&bso, "%5.2f profile 1\n", cputime());
|
|
Bflush(&bso);
|
|
s = lookup("__mcount", 0);
|
|
n = 1;
|
|
for(p = firstp->link; p != P; p = p->link) {
|
|
if(p->as == ATEXT) {
|
|
q = prg();
|
|
q->as = AADDL;
|
|
q->line = p->line;
|
|
q->pc = p->pc;
|
|
q->link = p->link;
|
|
p->link = q;
|
|
q->from.type = D_CONST;
|
|
q->from.offset = 1;
|
|
q->to.type = D_EXTERN;
|
|
q->to.sym = s;
|
|
q->to.offset = n*4 + 4;
|
|
|
|
q = prg();
|
|
q->as = ADATA;
|
|
q->line = p->line;
|
|
q->link = datap;
|
|
datap = q;
|
|
q->from.type = D_EXTERN;
|
|
q->from.sym = s;
|
|
q->from.offset = n*4;
|
|
q->from.displace = 4;
|
|
q->to.type = D_EXTERN;
|
|
q->to.sym = p->from.sym;
|
|
n += 2;
|
|
continue;
|
|
}
|
|
}
|
|
q = prg();
|
|
q->line = 0;
|
|
q->as = ADATA;
|
|
q->link = datap;
|
|
datap = q;
|
|
q->from.type = D_EXTERN;
|
|
q->from.sym = s;
|
|
q->from.displace = 4;
|
|
q->to.type = D_CONST;
|
|
q->to.offset = n;
|
|
s->type = SBSS;
|
|
s->value = n*4;
|
|
}
|
|
|
|
void
|
|
doprof2(void)
|
|
{
|
|
Sym *s2, *s4;
|
|
Prog *p, *q, *q2, *ps2, *ps4;
|
|
|
|
if(debug['v'])
|
|
Bprint(&bso, "%5.2f profile 2\n", cputime());
|
|
Bflush(&bso);
|
|
|
|
if(debug['e']){
|
|
s2 = lookup("_tracein", 0);
|
|
s4 = lookup("_traceout", 0);
|
|
}else{
|
|
s2 = lookup("_profin", 0);
|
|
s4 = lookup("_profout", 0);
|
|
}
|
|
if(s2->type != STEXT || s4->type != STEXT) {
|
|
if(debug['e'])
|
|
diag("_tracein/_traceout not defined %d %d", s2->type, s4->type);
|
|
else
|
|
diag("_profin/_profout not defined");
|
|
return;
|
|
}
|
|
|
|
ps2 = P;
|
|
ps4 = P;
|
|
for(p = firstp; p != P; p = p->link) {
|
|
if(p->as == ATEXT) {
|
|
if(p->from.sym == s2) {
|
|
ps2 = p;
|
|
p->from.displace = 1;
|
|
}
|
|
if(p->from.sym == s4) {
|
|
ps4 = p;
|
|
p->from.displace = 1;
|
|
}
|
|
}
|
|
}
|
|
for(p = firstp; p != P; p = p->link) {
|
|
if(p->as == ATEXT) {
|
|
if(p->from.displace != 0) {
|
|
for(;;) {
|
|
q = p->link;
|
|
if(q == P)
|
|
break;
|
|
if(q->as == ATEXT)
|
|
break;
|
|
p = q;
|
|
}
|
|
continue;
|
|
}
|
|
|
|
q = prg();
|
|
q->line = p->line;
|
|
q->pc = p->pc;
|
|
q->link = p->link;
|
|
if(debug['e']){ /* embedded tracing */
|
|
q2 = prg();
|
|
p->link = q2;
|
|
q2->link = q;
|
|
|
|
q2->line = p->line;
|
|
q2->pc = p->pc;
|
|
|
|
q2->as = AJMP;
|
|
q2->to.type = D_BRANCH;
|
|
q2->to.sym = p->to.sym;
|
|
q2->pcond = q->link;
|
|
}else
|
|
p->link = q;
|
|
p = q;
|
|
p->as = ABSR;
|
|
p->to.type = D_BRANCH;
|
|
p->pcond = ps2;
|
|
p->to.sym = s2;
|
|
|
|
continue;
|
|
}
|
|
if(p->as == ARTS) {
|
|
/*
|
|
* RTS (default)
|
|
*/
|
|
if(debug['e']){ /* embedded tracing */
|
|
q = prg();
|
|
q->line = p->line;
|
|
q->pc = p->pc;
|
|
q->link = p->link;
|
|
p->link = q;
|
|
p = q;
|
|
}
|
|
/*
|
|
* RTS
|
|
*/
|
|
q = prg();
|
|
q->as = ARTS;
|
|
q->from = p->from;
|
|
q->to = p->to;
|
|
q->link = p->link;
|
|
p->link = q;
|
|
|
|
/*
|
|
* BSR profout
|
|
*/
|
|
p->as = ABSR;
|
|
p->from = zprg.from;
|
|
p->to = zprg.to;
|
|
p->to.type = D_BRANCH;
|
|
p->pcond = ps4;
|
|
p->to.sym = s4;
|
|
|
|
p = q;
|
|
|
|
continue;
|
|
}
|
|
}
|
|
}
|
|
|
|
long
|
|
reuse(Prog *r, Sym *s)
|
|
{
|
|
Prog *p;
|
|
|
|
|
|
if(r == P)
|
|
return 0;
|
|
for(p = datap; p != r; p = p->link)
|
|
if(p->to.sym == s)
|
|
return p->from.offset;
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
nuxiinit(void)
|
|
{
|
|
int i, c;
|
|
|
|
for(i=0; i<4; i++) {
|
|
c = find1(0x01020304L, i+1);
|
|
if(i >= 2)
|
|
inuxi2[i-2] = c;
|
|
if(i >= 3)
|
|
inuxi1[i-3] = c;
|
|
inuxi4[i] = c;
|
|
fnuxi8[i] = c+4;
|
|
fnuxi8[i+4] = c;
|
|
c = find2(0x01020304L, i+1);
|
|
gnuxi8[i] = c+4;
|
|
gnuxi8[i+4] = c;
|
|
}
|
|
if(debug['v']) {
|
|
Bprint(&bso, "inuxi = ");
|
|
for(i=0; i<1; i++)
|
|
Bprint(&bso, "%d", inuxi1[i]);
|
|
Bprint(&bso, " ");
|
|
for(i=0; i<2; i++)
|
|
Bprint(&bso, "%d", inuxi2[i]);
|
|
Bprint(&bso, " ");
|
|
for(i=0; i<4; i++)
|
|
Bprint(&bso, "%d", inuxi4[i]);
|
|
Bprint(&bso, "\n[fg]nuxi = ");
|
|
for(i=0; i<8; i++)
|
|
Bprint(&bso, "%d", fnuxi8[i]);
|
|
Bprint(&bso, " ");
|
|
for(i=0; i<8; i++)
|
|
Bprint(&bso, "%d", gnuxi8[i]);
|
|
Bprint(&bso, "\n");
|
|
}
|
|
Bflush(&bso);
|
|
}
|
|
|
|
int
|
|
find1(long l, int c)
|
|
{
|
|
char *p;
|
|
int i;
|
|
|
|
p = (char*)&l;
|
|
for(i=0; i<4; i++)
|
|
if(*p++ == c)
|
|
return i;
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
find2(long l, int c)
|
|
{
|
|
short *p;
|
|
int i;
|
|
|
|
p = (short*)&l;
|
|
for(i=0; i<4; i+=2) {
|
|
if(((*p >> 8) & 0xff) == c)
|
|
return i;
|
|
if((*p++ & 0xff) == c)
|
|
return i+1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
long
|
|
ieeedtof(Ieee *e)
|
|
{
|
|
int exp;
|
|
long v;
|
|
|
|
if(e->h == 0)
|
|
return 0;
|
|
exp = (e->h>>20) & ((1L<<11)-1L);
|
|
exp -= (1L<<10) - 2L;
|
|
v = (e->h & 0xfffffL) << 3;
|
|
v |= (e->l >> 29) & 0x7L;
|
|
if((e->l >> 28) & 1) {
|
|
v++;
|
|
if(v & 0x800000L) {
|
|
v = (v & 0x7fffffL) >> 1;
|
|
exp++;
|
|
}
|
|
}
|
|
if(exp <= -126 || exp >= 130)
|
|
diag("double fp to single fp overflow");
|
|
v |= ((exp + 126) & 0xffL) << 23;
|
|
v |= e->h & 0x80000000L;
|
|
return v;
|
|
}
|
|
|
|
double
|
|
ieeedtod(Ieee *ieeep)
|
|
{
|
|
Ieee e;
|
|
double fr;
|
|
int exp;
|
|
|
|
if(ieeep->h & (1L<<31)) {
|
|
e.h = ieeep->h & ~(1L<<31);
|
|
e.l = ieeep->l;
|
|
return -ieeedtod(&e);
|
|
}
|
|
if(ieeep->l == 0 && ieeep->h == 0)
|
|
return 0;
|
|
fr = ieeep->l & ((1L<<16)-1L);
|
|
fr /= 1L<<16;
|
|
fr += (ieeep->l>>16) & ((1L<<16)-1L);
|
|
fr /= 1L<<16;
|
|
fr += (ieeep->h & (1L<<20)-1L) | (1L<<20);
|
|
fr /= 1L<<21;
|
|
exp = (ieeep->h>>20) & ((1L<<11)-1L);
|
|
exp -= (1L<<10) - 2L;
|
|
return ldexp(fr, exp);
|
|
}
|