| // Copyright 2009 The Go Authors. All rights reserved. | |
| // Use of this source code is governed by a BSD-style | |
| // license that can be found in the LICENSE file. | |
| // go-specific code shared across loaders (5l, 6l, 8l). | |
| #include "l.h" | |
| #include "../ld/lib.h" | |
| // accumulate all type information from .6 files. | |
| // check for inconsistencies. | |
| // TODO: | |
| // generate debugging section in binary. | |
| // once the dust settles, try to move some code to | |
| // libmach, so that other linkers and ar can share. | |
| /* | |
| * package import data | |
| */ | |
| typedef struct Import Import; | |
| struct Import | |
| { | |
| Import *hash; // next in hash table | |
| char *prefix; // "type", "var", "func", "const" | |
| char *name; | |
| char *def; | |
| char *file; | |
| }; | |
| enum { | |
| NIHASH = 1024 | |
| }; | |
| static Import *ihash[NIHASH]; | |
| static int nimport; | |
| static int | |
| hashstr(char *name) | |
| { | |
| int h; | |
| char *cp; | |
| h = 0; | |
| for(cp = name; *cp; h += *cp++) | |
| h *= 1119; | |
| // not if(h < 0) h = ~h, because gcc 4.3 -O2 miscompiles it. | |
| h &= 0xffffff; | |
| return h; | |
| } | |
| static Import * | |
| ilookup(char *name) | |
| { | |
| int h; | |
| Import *x; | |
| h = hashstr(name) % NIHASH; | |
| for(x=ihash[h]; x; x=x->hash) | |
| if(x->name[0] == name[0] && strcmp(x->name, name) == 0) | |
| return x; | |
| x = mal(sizeof *x); | |
| x->name = strdup(name); | |
| x->hash = ihash[h]; | |
| ihash[h] = x; | |
| nimport++; | |
| return x; | |
| } | |
| static void loadpkgdata(char*, char*, char*, int); | |
| static void loaddynimport(char*, char*, int); | |
| static void loaddynexport(char*, char*, char*, int); | |
| static int parsemethod(char**, char*, char**); | |
| static int parsepkgdata(char*, char*, char**, char*, char**, char**, char**); | |
| static int ndynexp; | |
| static Sym **dynexp; | |
| void | |
| ldpkg(Biobuf *f, char *pkg, int64 len, char *filename) | |
| { | |
| char *data, *p0, *p1, *name; | |
| if(debug['g']) | |
| return; | |
| if((int)len != len) { | |
| fprint(2, "%s: too much pkg data in %s\n", argv0, filename); | |
| return; | |
| } | |
| data = mal(len+1); | |
| if(Bread(f, data, len) != len) { | |
| fprint(2, "%s: short pkg read %s\n", argv0, filename); | |
| return; | |
| } | |
| data[len] = '\0'; | |
| // first \n$$ marks beginning of exports - skip rest of line | |
| p0 = strstr(data, "\n$$"); | |
| if(p0 == nil) | |
| return; | |
| p0 += 3; | |
| while(*p0 != '\n' && *p0 != '\0') | |
| p0++; | |
| // second marks end of exports / beginning of local data | |
| p1 = strstr(p0, "\n$$"); | |
| if(p1 == nil) { | |
| fprint(2, "%s: cannot find end of exports in %s\n", argv0, filename); | |
| return; | |
| } | |
| while(p0 < p1 && (*p0 == ' ' || *p0 == '\t' || *p0 == '\n')) | |
| p0++; | |
| if(p0 < p1) { | |
| if(strncmp(p0, "package ", 8) != 0) { | |
| fprint(2, "%s: bad package section in %s - %s\n", argv0, filename, p0); | |
| return; | |
| } | |
| p0 += 8; | |
| while(p0 < p1 && (*p0 == ' ' || *p0 == '\t' || *p0 == '\n')) | |
| p0++; | |
| name = p0; | |
| while(p0 < p1 && *p0 != ' ' && *p0 != '\t' && *p0 != '\n') | |
| p0++; | |
| if(p0 < p1) { | |
| *p0++ = '\0'; | |
| if(strcmp(pkg, "main") == 0 && strcmp(name, "main") != 0) | |
| fprint(2, "%s: %s: not package main (package %s)\n", argv0, filename, name); | |
| else if(strcmp(pkg, "main") != 0 && strcmp(name, "main") == 0) | |
| fprint(2, "%s: %s: importing %s, found package main", argv0, filename, pkg); | |
| } | |
| loadpkgdata(filename, pkg, p0, p1 - p0); | |
| } | |
| // local types begin where exports end. | |
| // skip rest of line after $$ we found above | |
| p0 = p1 + 3; | |
| while(*p0 != '\n' && *p0 != '\0') | |
| p0++; | |
| // local types end at next \n$$. | |
| p1 = strstr(p0, "\n$$"); | |
| if(p1 == nil) { | |
| fprint(2, "%s: cannot find end of local types in %s\n", argv0, filename); | |
| return; | |
| } | |
| loadpkgdata(filename, pkg, p0, p1 - p0); | |
| // look for dynimport section | |
| p0 = strstr(p1, "\n$$ // dynimport"); | |
| if(p0 != nil) { | |
| p0 = strchr(p0+1, '\n'); | |
| if(p0 == nil) { | |
| fprint(2, "%s: found $$ // dynimport but no newline in %s\n", argv0, filename); | |
| return; | |
| } | |
| p1 = strstr(p0, "\n$$"); | |
| if(p1 == nil) | |
| p1 = strstr(p0, "\n!\n"); | |
| if(p1 == nil) { | |
| fprint(2, "%s: cannot find end of // dynimport section in %s\n", argv0, filename); | |
| return; | |
| } | |
| loaddynimport(filename, p0 + 1, p1 - (p0+1)); | |
| } | |
| // look for dynexp section | |
| p0 = strstr(p1, "\n$$ // dynexport"); | |
| if(p0 != nil) { | |
| p0 = strchr(p0+1, '\n'); | |
| if(p0 == nil) { | |
| fprint(2, "%s: found $$ // dynexporg but no newline in %s\n", argv0, filename); | |
| return; | |
| } | |
| p1 = strstr(p0, "\n$$"); | |
| if(p1 == nil) | |
| p1 = strstr(p0, "\n!\n"); | |
| if(p1 == nil) { | |
| fprint(2, "%s: cannot find end of // dynexporg section in %s\n", argv0, filename); | |
| return; | |
| } | |
| loaddynexport(filename, pkg, p0 + 1, p1 - (p0+1)); | |
| } | |
| } | |
| static void | |
| loadpkgdata(char *file, char *pkg, char *data, int len) | |
| { | |
| char *p, *ep, *prefix, *name, *def; | |
| Import *x; | |
| file = strdup(file); | |
| p = data; | |
| ep = data + len; | |
| while(parsepkgdata(file, pkg, &p, ep, &prefix, &name, &def) > 0) { | |
| x = ilookup(name); | |
| if(x->prefix == nil) { | |
| x->prefix = prefix; | |
| x->def = def; | |
| x->file = file; | |
| } else if(strcmp(x->prefix, prefix) != 0) { | |
| fprint(2, "%s: conflicting definitions for %s\n", argv0, name); | |
| fprint(2, "%s:\t%s %s ...\n", x->file, x->prefix, name); | |
| fprint(2, "%s:\t%s %s ...\n", file, prefix, name); | |
| nerrors++; | |
| } else if(strcmp(x->def, def) != 0) { | |
| fprint(2, "%s: conflicting definitions for %s\n", argv0, name); | |
| fprint(2, "%s:\t%s %s %s\n", x->file, x->prefix, name, x->def); | |
| fprint(2, "%s:\t%s %s %s\n", file, prefix, name, def); | |
| nerrors++; | |
| } | |
| } | |
| } | |
| // replace all "". with pkg. | |
| char* | |
| expandpkg(char *t0, char *pkg) | |
| { | |
| int n; | |
| char *p; | |
| char *w, *w0, *t; | |
| n = 0; | |
| for(p=t0; (p=strstr(p, "\"\".")) != nil; p+=3) | |
| n++; | |
| if(n == 0) | |
| return t0; | |
| // use malloc, not mal, so that caller can free | |
| w0 = malloc(strlen(t0) + strlen(pkg)*n); | |
| w = w0; | |
| for(p=t=t0; (p=strstr(p, "\"\".")) != nil; p=t) { | |
| memmove(w, t, p - t); | |
| w += p-t; | |
| strcpy(w, pkg); | |
| w += strlen(pkg); | |
| t = p+2; | |
| } | |
| strcpy(w, t); | |
| return w0; | |
| } | |
| static int | |
| parsepkgdata(char *file, char *pkg, char **pp, char *ep, char **prefixp, char **namep, char **defp) | |
| { | |
| char *p, *prefix, *name, *def, *edef, *meth; | |
| int n; | |
| // skip white space | |
| p = *pp; | |
| loop: | |
| while(p < ep && (*p == ' ' || *p == '\t' || *p == '\n')) | |
| p++; | |
| if(p == ep || strncmp(p, "$$\n", 3) == 0) | |
| return 0; | |
| // prefix: (var|type|func|const) | |
| prefix = p; | |
| if(p + 7 > ep) | |
| return -1; | |
| if(strncmp(p, "var ", 4) == 0) | |
| p += 4; | |
| else if(strncmp(p, "type ", 5) == 0) | |
| p += 5; | |
| else if(strncmp(p, "func ", 5) == 0) | |
| p += 5; | |
| else if(strncmp(p, "const ", 6) == 0) | |
| p += 6; | |
| else if(strncmp(p, "import ", 7) == 0) { | |
| p += 7; | |
| while(p < ep && *p != '\n') | |
| p++; | |
| goto loop; | |
| } | |
| else { | |
| fprint(2, "%s: confused in pkg data near <<%.40s>>\n", argv0, prefix); | |
| nerrors++; | |
| return -1; | |
| } | |
| p[-1] = '\0'; | |
| // name: a.b followed by space | |
| name = p; | |
| while(p < ep && *p != ' ') | |
| p++; | |
| if(p >= ep) | |
| return -1; | |
| *p++ = '\0'; | |
| // def: free form to new line | |
| def = p; | |
| while(p < ep && *p != '\n') | |
| p++; | |
| if(p >= ep) | |
| return -1; | |
| edef = p; | |
| *p++ = '\0'; | |
| // include methods on successive lines in def of named type | |
| while(parsemethod(&p, ep, &meth) > 0) { | |
| *edef++ = '\n'; // overwrites '\0' | |
| if(edef+1 > meth) { | |
| // We want to indent methods with a single \t. | |
| // 6g puts at least one char of indent before all method defs, | |
| // so there will be room for the \t. If the method def wasn't | |
| // indented we could do something more complicated, | |
| // but for now just diagnose the problem and assume | |
| // 6g will keep indenting for us. | |
| fprint(2, "%s: %s: expected methods to be indented %p %p %.10s\n", argv0, | |
| file, edef, meth, meth); | |
| nerrors++; | |
| return -1; | |
| } | |
| *edef++ = '\t'; | |
| n = strlen(meth); | |
| memmove(edef, meth, n); | |
| edef += n; | |
| } | |
| name = expandpkg(name, pkg); | |
| def = expandpkg(def, pkg); | |
| // done | |
| *pp = p; | |
| *prefixp = prefix; | |
| *namep = name; | |
| *defp = def; | |
| return 1; | |
| } | |
| static int | |
| parsemethod(char **pp, char *ep, char **methp) | |
| { | |
| char *p; | |
| // skip white space | |
| p = *pp; | |
| while(p < ep && (*p == ' ' || *p == '\t')) | |
| p++; | |
| if(p == ep) | |
| return 0; | |
| // if it says "func (", it's a method | |
| if(p + 6 >= ep || strncmp(p, "func (", 6) != 0) | |
| return 0; | |
| // definition to end of line | |
| *methp = p; | |
| while(p < ep && *p != '\n') | |
| p++; | |
| if(p >= ep) { | |
| fprint(2, "%s: lost end of line in method definition\n", argv0); | |
| *pp = ep; | |
| return -1; | |
| } | |
| *p++ = '\0'; | |
| *pp = p; | |
| return 1; | |
| } | |
| static void | |
| loaddynimport(char *file, char *p, int n) | |
| { | |
| char *pend, *next, *name, *def, *p0, *lib; | |
| Sym *s; | |
| pend = p + n; | |
| p0 = p; | |
| for(; p<pend; p=next) { | |
| next = strchr(p, '\n'); | |
| if(next == nil) | |
| next = ""; | |
| else | |
| *next++ = '\0'; | |
| p0 = p; | |
| if(strncmp(p, "dynimport ", 10) != 0) | |
| goto err; | |
| p += 10; | |
| name = p; | |
| p = strchr(name, ' '); | |
| if(p == nil) | |
| goto err; | |
| while(*p == ' ') | |
| p++; | |
| def = p; | |
| p = strchr(def, ' '); | |
| if(p == nil) | |
| goto err; | |
| while(*p == ' ') | |
| p++; | |
| lib = p; | |
| // successful parse: now can edit the line | |
| *strchr(name, ' ') = 0; | |
| *strchr(def, ' ') = 0; | |
| s = lookup(name, 0); | |
| s->dynimplib = lib; | |
| s->dynimpname = def; | |
| } | |
| return; | |
| err: | |
| fprint(2, "%s: invalid dynimport line: %s\n", argv0, p0); | |
| nerrors++; | |
| } | |
| static void | |
| loaddynexport(char *file, char *pkg, char *p, int n) | |
| { | |
| char *pend, *next, *local, *elocal, *remote, *p0; | |
| Sym *s; | |
| pend = p + n; | |
| p0 = p; | |
| for(; p<pend; p=next) { | |
| next = strchr(p, '\n'); | |
| if(next == nil) | |
| next = ""; | |
| else | |
| *next++ = '\0'; | |
| p0 = p; | |
| if(strncmp(p, "dynexport ", 10) != 0) | |
| goto err; | |
| p += 10; | |
| local = p; | |
| p = strchr(local, ' '); | |
| if(p == nil) | |
| goto err; | |
| while(*p == ' ') | |
| p++; | |
| remote = p; | |
| // successful parse: now can edit the line | |
| *strchr(local, ' ') = 0; | |
| elocal = expandpkg(local, pkg); | |
| s = lookup(elocal, 0); | |
| if(s->dynimplib != nil) { | |
| fprint(2, "%s: symbol is both dynimport and dynexport %s\n", argv0, local); | |
| nerrors++; | |
| } | |
| s->dynimpname = remote; | |
| s->dynexport = 1; | |
| if(ndynexp%32 == 0) | |
| dynexp = realloc(dynexp, (ndynexp+32)*sizeof dynexp[0]); | |
| dynexp[ndynexp++] = s; | |
| if (elocal != local) | |
| free(elocal); | |
| } | |
| return; | |
| err: | |
| fprint(2, "%s: invalid dynexport line: %s\n", argv0, p0); | |
| nerrors++; | |
| } | |
| static int markdepth; | |
| static void | |
| markdata(Prog *p, Sym *s) | |
| { | |
| markdepth++; | |
| if(p != P && debug['v'] > 1) | |
| Bprint(&bso, "%d markdata %s\n", markdepth, s->name); | |
| for(; p != P; p=p->dlink) | |
| if(p->to.sym) | |
| mark(p->to.sym); | |
| markdepth--; | |
| } | |
| static void | |
| marktext(Prog *p) | |
| { | |
| Auto *a; | |
| if(p == P) | |
| return; | |
| if(p->as != ATEXT) { | |
| diag("marktext: %P", p); | |
| return; | |
| } | |
| for(a=p->to.autom; a; a=a->link) | |
| mark(a->gotype); | |
| markdepth++; | |
| if(debug['v'] > 1) | |
| Bprint(&bso, "%d marktext %s\n", markdepth, p->from.sym->name); | |
| for(a=p->to.autom; a; a=a->link) | |
| mark(a->gotype); | |
| for(p=p->link; p != P; p=p->link) { | |
| if(p->as == ATEXT || p->as == ADATA || p->as == AGLOBL) | |
| break; | |
| if(p->from.sym) | |
| mark(p->from.sym); | |
| if(p->to.sym) | |
| mark(p->to.sym); | |
| } | |
| markdepth--; | |
| } | |
| void | |
| mark(Sym *s) | |
| { | |
| if(s == S || s->reachable) | |
| return; | |
| s->reachable = 1; | |
| if(s->text) | |
| marktext(s->text); | |
| if(s->data) | |
| markdata(s->data, s); | |
| if(s->gotype) | |
| mark(s->gotype); | |
| } | |
| static void | |
| sweeplist(Prog **first, Prog **last) | |
| { | |
| int reachable; | |
| Prog *p, *q; | |
| reachable = 1; | |
| q = P; | |
| for(p=*first; p != P; p=p->link) { | |
| switch(p->as) { | |
| case ATEXT: | |
| case ADATA: | |
| case AGLOBL: | |
| reachable = p->from.sym->reachable; | |
| } | |
| if(reachable) { | |
| if(q == P) | |
| *first = p; | |
| else | |
| q->link = p; | |
| q = p; | |
| } | |
| } | |
| if(q == P) | |
| *first = P; | |
| else | |
| q->link = P; | |
| *last = q; | |
| } | |
| static char* | |
| morename[] = | |
| { | |
| "runtime.morestack", | |
| "runtime.morestackx", | |
| "runtime.morestack00", | |
| "runtime.morestack10", | |
| "runtime.morestack01", | |
| "runtime.morestack11", | |
| "runtime.morestack8", | |
| "runtime.morestack16", | |
| "runtime.morestack24", | |
| "runtime.morestack32", | |
| "runtime.morestack40", | |
| "runtime.morestack48", | |
| }; | |
| void | |
| deadcode(void) | |
| { | |
| int i; | |
| if(debug['v']) | |
| Bprint(&bso, "%5.2f deadcode\n", cputime()); | |
| mark(lookup(INITENTRY, 0)); | |
| for(i=0; i<nelem(morename); i++) | |
| mark(lookup(morename[i], 0)); | |
| for(i=0; i<ndynexp; i++) | |
| mark(dynexp[i]); | |
| // remove dead data | |
| sweeplist(&datap, &edatap); | |
| } |