2008-09-22 13:16:19 -06:00
|
|
|
// 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.
|
|
|
|
|
|
|
|
#include "runtime.h"
|
|
|
|
|
2008-09-22 17:58:30 -06:00
|
|
|
static int32 debug = 0;
|
|
|
|
|
2008-09-22 13:16:19 -06:00
|
|
|
typedef struct Sigt Sigt;
|
|
|
|
typedef struct Sigi Sigi;
|
|
|
|
typedef struct Map Map;
|
|
|
|
|
|
|
|
struct Sigt
|
|
|
|
{
|
|
|
|
byte* name;
|
|
|
|
uint32 hash;
|
2008-09-28 21:22:31 -06:00
|
|
|
uint32 offset; // offset of substruct
|
|
|
|
uint32 width; // width of type
|
|
|
|
uint32 elemalg; // algorithm of type
|
2008-09-22 13:16:19 -06:00
|
|
|
void (*fun)(void);
|
|
|
|
};
|
|
|
|
|
|
|
|
struct Sigi
|
|
|
|
{
|
|
|
|
byte* name;
|
|
|
|
uint32 hash;
|
2008-09-28 21:22:31 -06:00
|
|
|
uint32 perm; // location of fun in Sigt
|
2008-09-22 13:16:19 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
struct Map
|
|
|
|
{
|
|
|
|
Sigi* sigi;
|
|
|
|
Sigt* sigt;
|
|
|
|
Map* link;
|
|
|
|
int32 bad;
|
|
|
|
int32 unused;
|
|
|
|
void (*fun[])(void);
|
|
|
|
};
|
|
|
|
|
|
|
|
static Map* hash[1009];
|
2008-09-22 17:58:30 -06:00
|
|
|
|
|
|
|
static void
|
|
|
|
printsigi(Sigi *si)
|
|
|
|
{
|
|
|
|
int32 i, n;
|
|
|
|
byte *name;
|
|
|
|
|
|
|
|
sys·printpointer(si);
|
|
|
|
prints("{");
|
2008-09-28 21:22:31 -06:00
|
|
|
n = si[0].perm; // first entry has size
|
2008-09-22 17:58:30 -06:00
|
|
|
for(i=1; i<n; i++) {
|
|
|
|
name = si[i].name;
|
|
|
|
if(name == nil) {
|
|
|
|
prints("<nil>");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
prints("[");
|
|
|
|
sys·printint(i);
|
|
|
|
prints("]\"");
|
|
|
|
prints((int8*)name);
|
|
|
|
prints("\"");
|
2008-09-28 21:22:31 -06:00
|
|
|
sys·printint(si[i].hash%999);
|
2008-09-22 17:58:30 -06:00
|
|
|
prints("/");
|
2008-09-28 21:22:31 -06:00
|
|
|
sys·printint(si[i].perm);
|
2008-09-22 17:58:30 -06:00
|
|
|
}
|
|
|
|
prints("}");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
printsigt(Sigt *st)
|
|
|
|
{
|
|
|
|
int32 i;
|
|
|
|
byte *name;
|
|
|
|
|
|
|
|
sys·printpointer(st);
|
|
|
|
prints("{");
|
|
|
|
for(i=0;; i++) {
|
|
|
|
name = st[i].name;
|
|
|
|
if(name == nil)
|
|
|
|
break;
|
|
|
|
prints("[");
|
|
|
|
sys·printint(i);
|
|
|
|
prints("]\"");
|
|
|
|
prints((int8*)name);
|
|
|
|
prints("\"");
|
2008-09-28 21:22:31 -06:00
|
|
|
sys·printint(st[i].hash%999);
|
|
|
|
prints("/");
|
|
|
|
sys·printint(st[i].offset);
|
|
|
|
prints(",");
|
|
|
|
sys·printint(st[i].width);
|
|
|
|
prints(",");
|
|
|
|
sys·printint(st[i].elemalg);
|
2008-09-22 17:58:30 -06:00
|
|
|
prints("/");
|
|
|
|
sys·printpointer(st[i].fun);
|
|
|
|
}
|
|
|
|
prints("}");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
printiface(Map *im, void *it)
|
|
|
|
{
|
|
|
|
prints("(");
|
|
|
|
sys·printpointer(im);
|
|
|
|
prints(",");
|
|
|
|
sys·printpointer(it);
|
|
|
|
prints(")");
|
|
|
|
}
|
2008-09-22 13:16:19 -06:00
|
|
|
|
|
|
|
static Map*
|
2008-09-22 17:58:30 -06:00
|
|
|
hashmap(Sigi *si, Sigt *st)
|
2008-09-22 13:16:19 -06:00
|
|
|
{
|
2008-09-22 17:58:30 -06:00
|
|
|
int32 nt, ni;
|
2008-09-22 13:16:19 -06:00
|
|
|
uint32 ihash, h;
|
|
|
|
byte *sname, *iname;
|
|
|
|
Map *m;
|
|
|
|
|
2008-09-22 17:58:30 -06:00
|
|
|
h = ((uint32)(uint64)si + (uint32)(uint64)st) % nelem(hash);
|
2008-09-22 13:16:19 -06:00
|
|
|
for(m=hash[h]; m!=nil; m=m->link) {
|
2008-09-22 17:58:30 -06:00
|
|
|
if(m->sigi == si && m->sigt == st) {
|
2008-09-22 13:16:19 -06:00
|
|
|
if(m->bad) {
|
|
|
|
throw("bad hashmap");
|
|
|
|
m = nil;
|
|
|
|
}
|
|
|
|
// prints("old hashmap\n");
|
|
|
|
return m;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-09-28 21:22:31 -06:00
|
|
|
ni = si[0].perm; // first entry has size
|
2008-09-22 13:16:19 -06:00
|
|
|
m = mal(sizeof(*m) + ni*sizeof(m->fun[0]));
|
|
|
|
m->sigi = si;
|
2008-09-22 17:58:30 -06:00
|
|
|
m->sigt = st;
|
2008-09-22 13:16:19 -06:00
|
|
|
|
2008-09-22 17:58:30 -06:00
|
|
|
nt = 0;
|
2008-09-30 15:02:53 -06:00
|
|
|
for(ni=1; (iname=si[ni].name) != nil; ni++) { // ni=1: skip first word
|
|
|
|
// pick up next name from
|
|
|
|
// interface signature
|
|
|
|
ihash = si[ni].hash;
|
|
|
|
|
|
|
|
for(;; nt++) {
|
|
|
|
// pick up and compare next name
|
|
|
|
// from structure signature
|
|
|
|
sname = st[nt].name;
|
|
|
|
if(sname == nil) {
|
|
|
|
prints((int8*)iname);
|
|
|
|
prints(": ");
|
|
|
|
throw("hashmap: failed to find method");
|
|
|
|
m->bad = 1;
|
|
|
|
m->link = hash[h];
|
|
|
|
hash[h] = m;
|
|
|
|
return nil;
|
|
|
|
}
|
|
|
|
if(ihash == st[nt].hash && strcmp(sname, iname) == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
m->fun[si[ni].perm] = st[nt].fun;
|
2008-09-22 13:16:19 -06:00
|
|
|
}
|
2008-09-30 15:02:53 -06:00
|
|
|
m->link = hash[h];
|
|
|
|
hash[h] = m;
|
|
|
|
// prints("new hashmap\n");
|
|
|
|
return m;
|
2008-09-22 13:16:19 -06:00
|
|
|
}
|
|
|
|
|
2008-09-22 17:58:30 -06:00
|
|
|
// ifaceT2I(sigi *byte, sigt *byte, elem any) (ret any);
|
2008-09-22 13:16:19 -06:00
|
|
|
void
|
|
|
|
sys·ifaceT2I(Sigi *si, Sigt *st, void *elem, Map *retim, void *retit)
|
|
|
|
{
|
|
|
|
|
|
|
|
if(debug) {
|
|
|
|
prints("T2I sigi=");
|
|
|
|
printsigi(si);
|
|
|
|
prints(" sigt=");
|
|
|
|
printsigt(st);
|
|
|
|
prints(" elem=");
|
|
|
|
sys·printpointer(elem);
|
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
retim = hashmap(si, st);
|
|
|
|
retit = elem;
|
|
|
|
|
|
|
|
if(debug) {
|
|
|
|
prints("T2I ret=");
|
|
|
|
printiface(retim, retit);
|
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
FLUSH(&retim);
|
2008-09-30 15:02:53 -06:00
|
|
|
FLUSH(&retit);
|
2008-09-22 13:16:19 -06:00
|
|
|
}
|
|
|
|
|
2008-09-22 17:58:30 -06:00
|
|
|
// ifaceI2T(sigt *byte, iface any) (ret any);
|
2008-09-22 13:16:19 -06:00
|
|
|
void
|
|
|
|
sys·ifaceI2T(Sigt *st, Map *im, void *it, void *ret)
|
|
|
|
{
|
|
|
|
|
|
|
|
if(debug) {
|
|
|
|
prints("I2T sigt=");
|
|
|
|
printsigt(st);
|
|
|
|
prints(" iface=");
|
|
|
|
printiface(im, it);
|
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
if(im == nil)
|
|
|
|
throw("ifaceI2T: nil map");
|
|
|
|
|
|
|
|
if(im->sigt != st)
|
|
|
|
throw("ifaceI2T: wrong type");
|
|
|
|
|
|
|
|
ret = it;
|
|
|
|
if(debug) {
|
|
|
|
prints("I2T ret=");
|
|
|
|
sys·printpointer(ret);
|
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
FLUSH(&ret);
|
|
|
|
}
|
|
|
|
|
2008-09-22 17:58:30 -06:00
|
|
|
// ifaceI2I(sigi *byte, iface any) (ret any);
|
2008-09-22 13:16:19 -06:00
|
|
|
void
|
|
|
|
sys·ifaceI2I(Sigi *si, Map *im, void *it, Map *retim, void *retit)
|
|
|
|
{
|
|
|
|
|
|
|
|
if(debug) {
|
|
|
|
prints("I2I sigi=");
|
2008-09-22 17:58:30 -06:00
|
|
|
printsigi(si);
|
2008-09-22 13:16:19 -06:00
|
|
|
prints(" iface=");
|
|
|
|
printiface(im, it);
|
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
if(im == nil) {
|
|
|
|
throw("ifaceI2I: nil map");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
retit = it;
|
|
|
|
retim = im;
|
|
|
|
if(im->sigi != si)
|
|
|
|
retim = hashmap(si, im->sigt);
|
|
|
|
|
|
|
|
if(debug) {
|
|
|
|
prints("I2I ret=");
|
|
|
|
printiface(retim, retit);
|
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
FLUSH(&retim);
|
2008-09-30 15:02:53 -06:00
|
|
|
FLUSH(&retit);
|
2008-09-22 13:16:19 -06:00
|
|
|
}
|
2008-09-22 17:58:30 -06:00
|
|
|
|
|
|
|
void
|
|
|
|
sys·printinter(Map *im, void *it)
|
|
|
|
{
|
|
|
|
printiface(im, it);
|
|
|
|
}
|