mirror of
https://github.com/golang/go
synced 2024-10-05 08:21:22 -06:00
e419535f2a
My previous CL: changeset: 9645:ce2e5f44b310 user: Russ Cox <rsc@golang.org> date: Tue Sep 06 10:24:21 2011 -0400 summary: gc: unify stack frame layout introduced a bug wherein no variables were being registerized, making Go programs 2-3x slower than they had been before. This CL fixes that bug (along with some others it was hiding) and adds a test that optimization makes at least one test case faster. R=ken2 CC=golang-dev https://golang.org/cl/5174045
591 lines
11 KiB
C
591 lines
11 KiB
C
// Derived from Inferno utils/5c/swt.c
|
|
// http://code.google.com/p/inferno-os/source/browse/utils/5c/swt.c
|
|
//
|
|
// Copyright © 1994-1999 Lucent Technologies Inc. All rights reserved.
|
|
// Portions Copyright © 1995-1997 C H Forsyth (forsyth@terzarima.net)
|
|
// Portions Copyright © 1997-1999 Vita Nuova Limited
|
|
// Portions Copyright © 2000-2007 Vita Nuova Holdings Limited (www.vitanuova.com)
|
|
// Portions Copyright © 2004,2006 Bruce Ellis
|
|
// Portions Copyright © 2005-2007 C H Forsyth (forsyth@terzarima.net)
|
|
// Revisions Copyright © 2000-2007 Lucent Technologies Inc. and others
|
|
// Portions Copyright © 2009 The Go Authors. All rights reserved.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
// in the Software without restriction, including without limitation the rights
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
// furnished to do so, subject to the following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included in
|
|
// all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
// THE SOFTWARE.
|
|
|
|
#include <u.h>
|
|
#include <libc.h>
|
|
#include "gg.h"
|
|
|
|
void
|
|
zname(Biobuf *b, Sym *s, int t)
|
|
{
|
|
Bputc(b, ANAME); /* as */
|
|
Bputc(b, t); /* type */
|
|
Bputc(b, s->sym); /* sym */
|
|
|
|
Bputname(b, s);
|
|
}
|
|
|
|
void
|
|
zfile(Biobuf *b, char *p, int n)
|
|
{
|
|
Bputc(b, ANAME);
|
|
Bputc(b, D_FILE);
|
|
Bputc(b, 1);
|
|
Bputc(b, '<');
|
|
Bwrite(b, p, n);
|
|
Bputc(b, 0);
|
|
}
|
|
|
|
void
|
|
zhist(Biobuf *b, int line, vlong offset)
|
|
{
|
|
Addr a;
|
|
|
|
Bputc(b, AHISTORY);
|
|
Bputc(b, C_SCOND_NONE);
|
|
Bputc(b, NREG);
|
|
Bputc(b, line);
|
|
Bputc(b, line>>8);
|
|
Bputc(b, line>>16);
|
|
Bputc(b, line>>24);
|
|
zaddr(b, &zprog.from, 0);
|
|
a = zprog.to;
|
|
if(offset != 0) {
|
|
a.offset = offset;
|
|
a.type = D_CONST;
|
|
}
|
|
zaddr(b, &a, 0);
|
|
}
|
|
|
|
void
|
|
zaddr(Biobuf *b, Addr *a, int s)
|
|
{
|
|
int32 l;
|
|
uint64 e;
|
|
int i;
|
|
char *n;
|
|
|
|
switch(a->type) {
|
|
case D_STATIC:
|
|
case D_AUTO:
|
|
case D_EXTERN:
|
|
case D_PARAM:
|
|
// TODO(kaib): remove once everything seems to work
|
|
fatal("We should no longer generate these as types");
|
|
|
|
default:
|
|
Bputc(b, a->type);
|
|
Bputc(b, a->reg);
|
|
Bputc(b, s);
|
|
Bputc(b, a->name);
|
|
}
|
|
|
|
switch(a->type) {
|
|
default:
|
|
print("unknown type %d in zaddr\n", a->type);
|
|
|
|
case D_NONE:
|
|
case D_REG:
|
|
case D_FREG:
|
|
case D_PSR:
|
|
break;
|
|
|
|
case D_CONST2:
|
|
l = a->offset2;
|
|
Bputc(b, l);
|
|
Bputc(b, l>>8);
|
|
Bputc(b, l>>16);
|
|
Bputc(b, l>>24); // fall through
|
|
case D_OREG:
|
|
case D_CONST:
|
|
case D_SHIFT:
|
|
case D_STATIC:
|
|
case D_AUTO:
|
|
case D_EXTERN:
|
|
case D_PARAM:
|
|
l = a->offset;
|
|
Bputc(b, l);
|
|
Bputc(b, l>>8);
|
|
Bputc(b, l>>16);
|
|
Bputc(b, l>>24);
|
|
break;
|
|
|
|
case D_BRANCH:
|
|
if(a->branch == nil)
|
|
fatal("unpatched branch");
|
|
a->offset = a->branch->loc;
|
|
l = a->offset;
|
|
Bputc(b, l);
|
|
Bputc(b, l>>8);
|
|
Bputc(b, l>>16);
|
|
Bputc(b, l>>24);
|
|
break;
|
|
|
|
case D_SCONST:
|
|
n = a->sval;
|
|
for(i=0; i<NSNAME; i++) {
|
|
Bputc(b, *n);
|
|
n++;
|
|
}
|
|
break;
|
|
|
|
case D_REGREG:
|
|
Bputc(b, a->offset);
|
|
break;
|
|
|
|
case D_FCONST:
|
|
ieeedtod(&e, a->dval);
|
|
l = e;
|
|
Bputc(b, l);
|
|
Bputc(b, l>>8);
|
|
Bputc(b, l>>16);
|
|
Bputc(b, l>>24);
|
|
l = e >> 32;
|
|
Bputc(b, l);
|
|
Bputc(b, l>>8);
|
|
Bputc(b, l>>16);
|
|
Bputc(b, l>>24);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void
|
|
dumpfuncs(void)
|
|
{
|
|
Plist *pl;
|
|
int sf, st, t, sym;
|
|
struct { Sym *sym; short type; } h[NSYM];
|
|
Sym *s;
|
|
Prog *p;
|
|
|
|
for(sym=0; sym<NSYM; sym++) {
|
|
h[sym].sym = S;
|
|
h[sym].type = 0;
|
|
}
|
|
sym = 1;
|
|
|
|
// fix up pc
|
|
pcloc = 0;
|
|
for(pl=plist; pl!=nil; pl=pl->link) {
|
|
if(isblank(pl->name))
|
|
continue;
|
|
for(p=pl->firstpc; p!=P; p=p->link) {
|
|
p->loc = pcloc;
|
|
if(p->as != ADATA && p->as != AGLOBL)
|
|
pcloc++;
|
|
}
|
|
}
|
|
|
|
// put out functions
|
|
for(pl=plist; pl!=nil; pl=pl->link) {
|
|
if(isblank(pl->name))
|
|
continue;
|
|
|
|
if(debug['S']) {
|
|
s = S;
|
|
if(pl->name != N)
|
|
s = pl->name->sym;
|
|
print("\n--- prog list \"%S\" ---\n", s);
|
|
for(p=pl->firstpc; p!=P; p=p->link)
|
|
print("%P\n", p);
|
|
}
|
|
|
|
for(p=pl->firstpc; p!=P; p=p->link) {
|
|
jackpot:
|
|
sf = 0;
|
|
s = p->from.sym;
|
|
while(s != S) {
|
|
sf = s->sym;
|
|
if(sf < 0 || sf >= NSYM)
|
|
sf = 0;
|
|
t = p->from.name;
|
|
if(t == D_ADDR)
|
|
t = p->from.name;
|
|
if(h[sf].type == t)
|
|
if(h[sf].sym == s)
|
|
break;
|
|
s->sym = sym;
|
|
zname(bout, s, t);
|
|
h[sym].sym = s;
|
|
h[sym].type = t;
|
|
sf = sym;
|
|
sym++;
|
|
if(sym >= NSYM)
|
|
sym = 1;
|
|
break;
|
|
}
|
|
st = 0;
|
|
s = p->to.sym;
|
|
while(s != S) {
|
|
st = s->sym;
|
|
if(st < 0 || st >= NSYM)
|
|
st = 0;
|
|
t = p->to.name;
|
|
if(t == D_ADDR)
|
|
t = p->to.name;
|
|
if(h[st].type == t)
|
|
if(h[st].sym == s)
|
|
break;
|
|
s->sym = sym;
|
|
zname(bout, s, t);
|
|
h[sym].sym = s;
|
|
h[sym].type = t;
|
|
st = sym;
|
|
sym++;
|
|
if(sym >= NSYM)
|
|
sym = 1;
|
|
if(st == sf)
|
|
goto jackpot;
|
|
break;
|
|
}
|
|
Bputc(bout, p->as);
|
|
Bputc(bout, p->scond);
|
|
Bputc(bout, p->reg);
|
|
Bputc(bout, p->lineno);
|
|
Bputc(bout, p->lineno>>8);
|
|
Bputc(bout, p->lineno>>16);
|
|
Bputc(bout, p->lineno>>24);
|
|
zaddr(bout, &p->from, sf);
|
|
zaddr(bout, &p->to, st);
|
|
}
|
|
}
|
|
}
|
|
|
|
int
|
|
dsname(Sym *sym, int off, char *t, int n)
|
|
{
|
|
Prog *p;
|
|
|
|
p = gins(ADATA, N, N);
|
|
p->from.type = D_OREG;
|
|
p->from.name = D_EXTERN;
|
|
p->from.etype = TINT32;
|
|
p->from.offset = off;
|
|
p->from.reg = NREG;
|
|
p->from.sym = sym;
|
|
|
|
p->reg = n;
|
|
|
|
p->to.type = D_SCONST;
|
|
p->to.name = D_NONE;
|
|
p->to.reg = NREG;
|
|
p->to.offset = 0;
|
|
memmove(p->to.sval, t, n);
|
|
return off + n;
|
|
}
|
|
|
|
/*
|
|
* make a refer to the data s, s+len
|
|
* emitting DATA if needed.
|
|
*/
|
|
void
|
|
datastring(char *s, int len, Addr *a)
|
|
{
|
|
Sym *sym;
|
|
|
|
sym = stringsym(s, len);
|
|
a->type = D_OREG;
|
|
a->name = D_EXTERN;
|
|
a->etype = TINT32;
|
|
a->offset = widthptr+4; // skip header
|
|
a->reg = NREG;
|
|
a->sym = sym;
|
|
a->node = sym->def;
|
|
}
|
|
|
|
/*
|
|
* make a refer to the string sval,
|
|
* emitting DATA if needed.
|
|
*/
|
|
void
|
|
datagostring(Strlit *sval, Addr *a)
|
|
{
|
|
Sym *sym;
|
|
|
|
sym = stringsym(sval->s, sval->len);
|
|
a->type = D_OREG;
|
|
a->name = D_EXTERN;
|
|
a->etype = TINT32;
|
|
a->offset = 0; // header
|
|
a->reg = NREG;
|
|
a->sym = sym;
|
|
a->node = sym->def;
|
|
}
|
|
|
|
void
|
|
gdata(Node *nam, Node *nr, int wid)
|
|
{
|
|
Prog *p;
|
|
vlong v;
|
|
|
|
if(nr->op == OLITERAL) {
|
|
switch(nr->val.ctype) {
|
|
case CTCPLX:
|
|
gdatacomplex(nam, nr->val.u.cval);
|
|
return;
|
|
case CTSTR:
|
|
gdatastring(nam, nr->val.u.sval);
|
|
return;
|
|
}
|
|
}
|
|
|
|
if(wid == 8 && is64(nr->type)) {
|
|
v = mpgetfix(nr->val.u.xval);
|
|
p = gins(ADATA, nam, nodintconst(v));
|
|
p->reg = 4;
|
|
p = gins(ADATA, nam, nodintconst(v>>32));
|
|
p->reg = 4;
|
|
p->from.offset += 4;
|
|
return;
|
|
}
|
|
p = gins(ADATA, nam, nr);
|
|
p->reg = wid;
|
|
}
|
|
|
|
void
|
|
gdatacomplex(Node *nam, Mpcplx *cval)
|
|
{
|
|
Prog *p;
|
|
int w;
|
|
|
|
w = cplxsubtype(nam->type->etype);
|
|
w = types[w]->width;
|
|
|
|
p = gins(ADATA, nam, N);
|
|
p->reg = w;
|
|
p->to.type = D_FCONST;
|
|
p->to.dval = mpgetflt(&cval->real);
|
|
|
|
p = gins(ADATA, nam, N);
|
|
p->reg = w;
|
|
p->from.offset += w;
|
|
p->to.type = D_FCONST;
|
|
p->to.dval = mpgetflt(&cval->imag);
|
|
}
|
|
|
|
void
|
|
gdatastring(Node *nam, Strlit *sval)
|
|
{
|
|
Prog *p;
|
|
Node nod1;
|
|
|
|
p = gins(ADATA, nam, N);
|
|
datastring(sval->s, sval->len, &p->to);
|
|
p->reg = types[tptr]->width;
|
|
p->to.type = D_CONST;
|
|
p->to.etype = TINT32;
|
|
//print("%P\n", p);
|
|
|
|
nodconst(&nod1, types[TINT32], sval->len);
|
|
p = gins(ADATA, nam, &nod1);
|
|
p->reg = types[TINT32]->width;
|
|
p->from.offset += types[tptr]->width;
|
|
}
|
|
|
|
int
|
|
dstringptr(Sym *s, int off, char *str)
|
|
{
|
|
Prog *p;
|
|
|
|
off = rnd(off, widthptr);
|
|
p = gins(ADATA, N, N);
|
|
p->from.type = D_OREG;
|
|
p->from.name = D_EXTERN;
|
|
p->from.sym = s;
|
|
p->from.offset = off;
|
|
p->reg = widthptr;
|
|
|
|
datastring(str, strlen(str)+1, &p->to);
|
|
p->to.type = D_CONST;
|
|
p->to.etype = TINT32;
|
|
off += widthptr;
|
|
|
|
return off;
|
|
}
|
|
|
|
int
|
|
dgostrlitptr(Sym *s, int off, Strlit *lit)
|
|
{
|
|
Prog *p;
|
|
|
|
if(lit == nil)
|
|
return duintptr(s, off, 0);
|
|
|
|
off = rnd(off, widthptr);
|
|
p = gins(ADATA, N, N);
|
|
p->from.type = D_OREG;
|
|
p->from.name = D_EXTERN;
|
|
p->from.sym = s;
|
|
p->from.offset = off;
|
|
p->reg = widthptr;
|
|
datagostring(lit, &p->to);
|
|
p->to.type = D_CONST;
|
|
p->to.etype = TINT32;
|
|
off += widthptr;
|
|
|
|
return off;
|
|
}
|
|
|
|
int
|
|
dgostringptr(Sym *s, int off, char *str)
|
|
{
|
|
int n;
|
|
Strlit *lit;
|
|
|
|
if(str == nil)
|
|
return duintptr(s, off, 0);
|
|
|
|
n = strlen(str);
|
|
lit = mal(sizeof *lit + n);
|
|
strcpy(lit->s, str);
|
|
lit->len = n;
|
|
return dgostrlitptr(s, off, lit);
|
|
}
|
|
|
|
int
|
|
duintxx(Sym *s, int off, uint64 v, int wid)
|
|
{
|
|
Prog *p;
|
|
|
|
off = rnd(off, wid);
|
|
|
|
p = gins(ADATA, N, N);
|
|
p->from.type = D_OREG;
|
|
p->from.name = D_EXTERN;
|
|
p->from.sym = s;
|
|
p->from.offset = off;
|
|
p->reg = wid;
|
|
p->to.type = D_CONST;
|
|
p->to.name = D_NONE;
|
|
p->to.offset = v;
|
|
off += wid;
|
|
|
|
return off;
|
|
}
|
|
|
|
int
|
|
dsymptr(Sym *s, int off, Sym *x, int xoff)
|
|
{
|
|
Prog *p;
|
|
|
|
off = rnd(off, widthptr);
|
|
|
|
p = gins(ADATA, N, N);
|
|
p->from.type = D_OREG;
|
|
p->from.name = D_EXTERN;
|
|
p->from.sym = s;
|
|
p->from.offset = off;
|
|
p->reg = widthptr;
|
|
p->to.type = D_CONST;
|
|
p->to.name = D_EXTERN;
|
|
p->to.sym = x;
|
|
p->to.offset = xoff;
|
|
off += widthptr;
|
|
|
|
return off;
|
|
}
|
|
|
|
|
|
void
|
|
genembedtramp(Type *rcvr, Type *method, Sym *newnam, int iface)
|
|
{
|
|
// TODO(kaib): re-implement genembedtramp
|
|
genwrapper(rcvr, method, newnam, iface);
|
|
/*
|
|
Sym *e;
|
|
int c, d, o;
|
|
Prog *p;
|
|
Type *f;
|
|
|
|
e = method->sym;
|
|
for(d=0; d<nelem(dotlist); d++) {
|
|
c = adddot1(e, rcvr, d, nil, 0);
|
|
if(c == 1)
|
|
goto out;
|
|
}
|
|
fatal("genembedtramp %T.%S", rcvr, method->sym);
|
|
|
|
out:
|
|
newplist()->name = newname(newnam);
|
|
|
|
//TEXT main·S_test2(SB),7,$0
|
|
p = pc;
|
|
gins(ATEXT, N, N);
|
|
p->from.type = D_OREG;
|
|
p->from.name = D_EXTERN;
|
|
p->from.sym = newnam;
|
|
p->to.type = D_CONST2;
|
|
p->reg = 7;
|
|
p->to.offset2 = 0;
|
|
p->to.reg = NREG;
|
|
//print("1. %P\n", p);
|
|
|
|
o = 0;
|
|
for(c=d-1; c>=0; c--) {
|
|
f = dotlist[c].field;
|
|
o += f->width;
|
|
if(!isptr[f->type->etype])
|
|
continue;
|
|
|
|
//MOVW o(R0), R0
|
|
p = pc;
|
|
gins(AMOVW, N, N);
|
|
p->from.type = D_OREG;
|
|
p->from.reg = REGARG;
|
|
p->from.offset = o;
|
|
p->to.type = D_REG;
|
|
p->to.reg = REGARG;
|
|
//print("2. %P\n", p);
|
|
o = 0;
|
|
}
|
|
if(o != 0) {
|
|
//MOVW $XX(R0), R0
|
|
p = pc;
|
|
gins(AMOVW, N, N);
|
|
p->from.type = D_CONST;
|
|
p->from.reg = REGARG;
|
|
p->from.offset = o;
|
|
p->to.type = D_REG;
|
|
p->to.reg = REGARG;
|
|
//print("3. %P\n", p);
|
|
}
|
|
|
|
f = dotlist[0].field;
|
|
//B main·*Sub_test2(SB)
|
|
if(isptr[f->type->etype])
|
|
f = f->type;
|
|
p = pc;
|
|
gins(AB, N, N);
|
|
p->to.type = D_OREG;
|
|
p->to.reg = NREG;
|
|
p->to.name = D_EXTERN;
|
|
p->to.sym = methodsym(method->sym, ptrto(f->type), 0);
|
|
//print("4. %P\n", p);
|
|
|
|
pc->as = ARET; // overwrite AEND
|
|
*/
|
|
}
|
|
|
|
void
|
|
nopout(Prog *p)
|
|
{
|
|
p->as = ANOP;
|
|
}
|