/* Usefile format:
* U<pkgname>
* T<pickled-type>
* R<picled-trait>
* I<pickled-impl>
* D<picled-decl>
* G<pickled-decl><pickled-initializer>
*/
int loaduse(char *path, FILE *f, Stab *st, Vis vis)
{
intptr_t tid;
size_t i;
int v;
char *pkg;
Node *dcl, *impl, *init;
Stab *s;
Type *ty;
Trait *tr;
char *lib;
int c;
pushstab(file->file.globls);
if (!tydedup)
tydedup = mkht(tyhash, tyeq);
if (fgetc(f) != 'U')
return 0;
v = rdint(f);
if (v != Abiversion) {
fprintf(stderr, "%s: abi version %d, expected %d\n", path, v, Abiversion);
return 0;
}
pkg = rdstr(f);
/* if the package names match up, or the usefile has no declared
* package, then we simply add to the current stab. Otherwise,
* we add a new stab under the current one */
if (st->name) {
if (pkg && !strcmp(pkg, st->name)) {
s = st;
} else {
s = findstab(st, pkg);
}
} else {
if (pkg) {
s = findstab(st, pkg);
} else {
s = st;
}
}
if (!streq(st->name, pkg))
vis = Visintern;
if (!s) {
printf("could not find matching package for merge: %s in %s\n", st->name, path);
exit(1);
}
tidmap = mkht(ptrhash, ptreq);
trmap = mkht(ptrhash, ptreq);
if (!initmap)
initmap = mkht(namehash, nameeq);
/* builtin traits */
for (i = 0; i < Ntraits; i++)
htput(trmap, itop(i), traittab[i]);
while ((c = fgetc(f)) != EOF) {
switch(c) {
case 'L':
lib = rdstr(f);
for (i = 0; i < file->file.nlibdeps; i++)
if (!strcmp(file->file.libdeps[i], lib))
/* break out of both loop and switch */
goto foundlib;
lappend(&file->file.libdeps, &file->file.nlibdeps, lib);
foundlib:
break;
case 'X':
lib = rdstr(f);
for (i = 0; i < file->file.nextlibs; i++)
if (!strcmp(file->file.extlibs[i], lib))
/* break out of both loop and switch */
goto foundextlib;
lappend(&file->file.extlibs, &file->file.nextlibs, lib);
foundextlib:
break;
case 'F':
lappend(&file->file.files, &file->file.nfiles, rdstr(f));
break;
case 'G':
case 'D':
dcl = rdsym(f, NULL);
dcl->decl.vis = vis;
dcl->decl.isglobl = 1;
putdcl(s, dcl);
break;
case 'S':
init = unpickle(f);
if (!hthas(initmap, init)) {
htput(initmap, init, init);
lappend(&file->file.init, &file->file.ninit, init);
}
break;
case 'R':
tr = traitunpickle(f);
tr->vis = vis;
puttrait(s, tr->name, tr);
for (i = 0; i < tr->nfuncs; i++)
putdcl(s, tr->funcs[i]);
break;
case 'T':
tid = rdint(f);
ty = tyunpickle(f);
if(!ty->ishidden)
ty->vis = vis;
htput(tidmap, itop(tid), ty);
/* fix up types */
if (ty->type == Tyname || ty->type == Tygeneric) {
if (ty->issynth)
break;
if (!streq(s->name, ty->name->name.ns))
ty->ishidden = 1;
if (!gettype(s, ty->name) && !ty->ishidden)
puttype(s, ty->name, ty);
} else if (ty->type == Tyunion) {
for (i = 0; i < ty->nmemb; i++)
if (!getucon(s, ty->udecls[i]->name) && !ty->udecls[i]->synth)
putucon(s, ty->udecls[i]);
}
break;
case 'I':
impl = unpickle(f);
putimpl(s, impl);
/* specialized declarations always go into the global stab */
for (i = 0; i < impl->impl.ndecls; i++)
putdcl(file->file.globls, impl->impl.decls[i]);
break;
case EOF:
break;
}
}
fixtypemappings(s);
fixtraitmappings(s);
htfree(tidmap);
popstab();
return 1;
}
void
main(int argc, char **argv)
{
int i, j, a, mi, oi, tot, keywords;
double totp, p, xp[MAXTAB];
Hash *hmsg;
Word w;
Stringtab *s, *t;
Biobuf bout;
mbest = 15;
keywords = 0;
ARGBEGIN{
case 'D':
debug = 1;
break;
case 'k':
keywords = 1;
break;
case 'm':
mbest = atoi(EARGF(usage()));
if(mbest > MAXBEST)
sysfatal("cannot keep more than %d words", MAXBEST);
break;
default:
usage();
}ARGEND
for(i=0; i<argc; i++)
if(strcmp(argv[i], "~") == 0)
break;
if(i > MAXTAB)
sysfatal("cannot handle more than %d tables", MAXTAB);
if(i+1 >= argc)
usage();
for(i=0; i<argc; i++){
if(strcmp(argv[i], "~") == 0)
break;
tab[ntab].file = argv[i];
tab[ntab].hash = hread(argv[i]);
s = findstab(tab[ntab].hash, "*nmsg*", 6, 1);
if(s == nil || s->count == 0)
tab[ntab].nmsg = 1;
else
tab[ntab].nmsg = s->count;
ntab++;
}
Binit(&bout, 1, OWRITE);
oi = ++i;
for(a=i; a<argc; a++){
hmsg = hread(argv[a]);
nbest = 0;
for(s=hmsg->all; s; s=s->link){
w.s = s;
tot = 0;
totp = 0.0;
for(i=0; i<ntab; i++){
t = findstab(tab[i].hash, s->str, s->n, 0);
if(t == nil)
w.count[i] = 0;
else
w.count[i] = t->count;
tot += w.count[i];
p = w.count[i]/(double)tab[i].nmsg;
if(p >= 1.0)
p = 1.0;
w.p[i] = p;
totp += p;
}
if(tot < 5){ /* word does not appear enough; give to box 0 */
w.p[0] = 0.5;
for(i=1; i<ntab; i++)
w.p[i] = 0.1;
w.mp = 0.5;
w.mi = 0;
noteword(&w);
continue;
}
w.mp = 0.0;
for(i=0; i<ntab; i++){
p = w.p[i];
p /= totp;
if(p < 0.01)
p = 0.01;
else if(p > 0.99)
p = 0.99;
if(p > w.mp){
w.mp = p;
w.mi = i;
}
w.p[i] = p;
}
noteword(&w);
}
totp = 0.0;
for(i=0; i<ntab; i++){
p = 1.0;
for(j=0; j<nbest; j++)
p *= best[j].p[i];
xp[i] = p;
totp += p;
}
for(i=0; i<ntab; i++)
xp[i] /= totp;
mi = 0;
for(i=1; i<ntab; i++)
if(xp[i] > xp[mi])
mi = i;
if(oi != argc-1)
Bprint(&bout, "%s: ", argv[a]);
Bprint(&bout, "%s %f", tab[mi].file, xp[mi]);
if(keywords){
for(i=0; i<nbest; i++){
Bprint(&bout, " ");
Bwrite(&bout, best[i].s->str, best[i].s->n);
Bprint(&bout, " %f", best[i].p[mi]);
}
}
freehash(hmsg);
Bprint(&bout, "\n");
if(debug){
for(i=0; i<nbest; i++){
Bwrite(&bout, best[i].s->str, best[i].s->n);
Bprint(&bout, " %f", best[i].p[mi]);
if(best[i].p[mi] < best[i].mp)
Bprint(&bout, " (%f %s)", best[i].mp, tab[best[i].mi].file);
Bprint(&bout, "\n");
}
}
}
Bterm(&bout);
}
