qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-11-22 01:34:41 -07:00
Code Releases Activity

more on dynamic hash in compound literals.

Browse Source 
thanks to vskrap, andrey mirtchovski,
and Eoghan Sherry.

R=rsc
CC=golang-dev
https://golang.org/cl/3245041
This commit is contained in:
Ken Thompson 2010-11-20 15:58:28 -08:00
parent b1fd0860df
commit 8cb8ba14a5
1 changed files with 24 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
src/cmd/gc/typecheck.c
View File

@ -1809,14 +1809,11 @@ indexdup(Node *n, Node *hash[], ulong nhash)
}
static int
prime(ulong h)
prime(ulong h, ulong sr)
{
ulong n, sr;
ulong n;
sr = h;
for(n=0; n<3; n++)
sr = (sr + h/sr)/2;
for(n=3; n<sr; n+=2)
for(n=3; n<=sr; n+=2)
if(h%n == 0)
return 0;
return 1;
@ -1825,20 +1822,37 @@ prime(ulong h)
static ulong
inithash(Node *n, Node ***hash, Node **autohash, ulong nautohash)
{
ulong h;
ulong h, sr;
NodeList *ll;
int i;
// count the number of entries
h = 0;
for(ll=n->list; ll; ll=ll->next)
h++;
h = 9*h/8;
// if the auto hash table is
// large enough use it.
if(h <= nautohash) {
*hash = autohash;
memset(*hash, 0, nautohash * sizeof(**hash));
return nautohash;
}
while(!prime(h))
h++;
// make hash size odd and 12% larger than entries
h += h/8;
h |= 1;
// calculate sqrt of h
sr = h/2;
for(i=0; i<5; i++)
sr = (sr + h/sr)/2;
// check for primeality
while(!prime(h, sr))
h += 2;
// build and return a throw-away hash table
*hash = mal(h * sizeof(**hash));
memset(*hash, 0, h * sizeof(**hash));
return h;