Greetings!
I was just going to write to you about hash. I'd done some work on it
too, so its a good idea for us to merge. I'll take a look when I get
a moment, should be soon. In the meantime, I'll supply here the
version I've been working with for your perusal.
In sum, I'm working on CVS head, aka 2.7.0 for these major changes.
They seem too much for the 2.6 branch, and I'd like to get 2.7 out
somewhere around the end of the summer anyway. The problem here of
course is that I have some compiler changes which need a little more
work and which have temporarily broken the acl2 build, undoubtedly
making 2.7 less attractive as a testbed from your end :-). I've
avoided seeing how the applications do on 2.7 until the very end, as
there is so much basic lisp stuff to accomplish, most notably ansi
compliance -- i.e. I'd wager you'd find 2.7 too much of a fast moving
target at the moment. So this make synchronization a bit difficult
and dependent upon frequent backports, etc. Do you have suggestions
here?
(And yes, I do intend to cache the hash code of symbols in the struct
body, as recommended by Paul Dietz. This should be working in CVS
head now.)
=============================================================================
hash.d
=============================================================================
/*
Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
This file is part of GNU Common Lisp, herein referred to as GCL
GCL is free software; you can redistribute it and/or modify it under
the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GCL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
License for more details.
You should have received a copy of the GNU Library General Public License
along with GCL; see the file COPYING. If not, write to the Free Software
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#define NEED_MP_H
#include <string.h>
#include "include.h"
object sLeq;
object sLeql;
object sLequal;
object sKsize;
object sKrehash_size;
object sKrehash_threshold;
#define MHSH(a_) ((a_) & ~(((unsigned long)1)<<(sizeof(a_)*CHAR_SIZE-1)))
static unsigned long
hash_eql(object x) {
unsigned long h = 0;
switch (type_of(x)) {
case t_fixnum:
h=fix(x);
h ^= (h >> 11);
h ^= (h << 7) & 0x9D2C5680U;
h ^= (h << 15) & 0xEFC60000U;
h ^= (h >> 18);
break;
case t_bignum:
{
MP_INT *mp = MP(x);
int l = mpz_size (mp);
mp_limb_t *u = mp->_mp_d;
if (l > 5) l = 5;
while (-- l >= 0)
h += *u++;
}
break;
case t_ratio:
h=hash_eql(x->rat.rat_num) + hash_eql(x->rat.rat_den);
break;
case t_shortfloat: /*FIXME, sizeof int = sizeof float*/
h=*((int *) &(sf(x)));
break;
case t_longfloat:
{
int *y = (int *) &lf(x);
h= *y + *(y+1);
}
break;
case t_complex:
h=hash_eql(x->cmp.cmp_real) + hash_eql(x->cmp.cmp_imag);
break;
case t_character:
h=char_code(x);
break;
default:
h=((unsigned long)x / sizeof(x));
break;
}
return MHSH(h);
}
#define ihash_equal(a_,b_) ((type_of(a_)==t_symbol && (a_)->s.s_hash) ?
(a_)->s.s_hash : ihash_equal1(a_,b_))
unsigned long
ihash_equal1(object x,int depth) {
enum type tx;
unsigned long h = 0;
long i;
char *s;
cs_check(x);
BEGIN:
if (depth++ <=3)
switch ((tx=type_of(x))) {
case t_cons:
h += ihash_equal(x->c.c_car,depth);
x = x->c.c_cdr;
goto BEGIN;
break;
case t_symbol:
case t_string:
{
long len=x->st.st_fillp;
s=x->st.st_self;
len=len>sizeof(len) ? sizeof(len) : len;
for (s+=len-1;len--;s--)
h+= *s << CHAR_SIZE*len;
}
break;
case t_package:
break;
case t_bitvector:
{
static char ar[10];
i = x->bv.bv_fillp;
h += i;
i = i/8;
if (i > 10) i= 10;
s = x->bv.bv_self;
if (x->bv.bv_offset) {
long k,j,e=i;
s = ar;
/* 8 should be CHAR_SIZE but this needs to be changed
everywhere .. */
e = e * 8;
bzero(ar,sizeof(ar));
for (k = x->bv.bv_offset, j = 0; k < e; k++, j++)
if (x->bv.bv_self[k/8]&(0200>>k%8))
ar[j/8] |= 0200>>j%8;
}
for (; i > 0; --i, s++)
h += (*s & 0377)*12345 + 1;
}
break;
case t_pathname:
h += ihash_equal(x->pn.pn_host,depth);
h += ihash_equal(x->pn.pn_device,depth);
h += ihash_equal(x->pn.pn_directory,depth);
h += ihash_equal(x->pn.pn_name,depth);
h += ihash_equal(x->pn.pn_type,depth);
/* version is ignored unless logical host */
if ((type_of(x->pn.pn_host) == t_string) &&
(pathname_lookup(x->pn.pn_host,sSApathname_logicalA) != Cnil))
h += ihash_equal(x->pn.pn_version,depth);
h += ihash_equal(x->pn.pn_version,depth);
break;
/* CLTLII says don't descend into structures
case t_structure:
{unsigned char *s_type;
struct s_data *def;
def=S_DATA(x->str.str_def);
s_type= & SLOT_TYPE(x->str.str_def,0);
h += ihash_equal(def->name,depth);
for (i = 0; i < def->length; i++)
if (s_type[i]==0)
h += ihash_equal(x->str.str_self[i],depth);
else
h += ((int)x->str.str_self[i]) + depth++;
return(h);}
*/
default:
h += hash_eql(x);
break;
}
return MHSH(h);
}
static object
FFN(hash_equal)(object x,int depth) {
return make_fixnum(ihash_equal(x,depth));
}
struct htent *
gethash(object key, object hashtable) {
enum httest htest;
long hsize,j,s,q;
struct htent *e,*e1;
object hkey;
unsigned long i=0;
bool (*f)(object,object)=NULL;
htest = (enum httest)hashtable->ht.ht_test;
hsize = hashtable->ht.ht_size;
switch (htest) {
case htt_eq:
i = (long)key / sizeof(key);
break;
case htt_eql:
i = hash_eql(key);
f=eql;
break;
case htt_equal:
i = ihash_equal(key,0);
f=equal;
break;
}
i%=hsize;
s=i;
q=hsize;
e=e1=NULL;
SEARCH:
for (j=s;j<q;j++) {
e = &hashtable->ht.ht_self[j];
hkey = e->hte_key;
if (hkey==OBJNULL) {
if (e->hte_value==OBJNULL) return e1 ? e1 : e;
if (!e1) e1=e;
} else
if (f ? f(key,hkey) : key==hkey) return e;
}
if (s) {
q=s;
s=0;
goto SEARCH;
}
FEerror("gethash error",0);
return NULL;
}
static void
extend_hashtable(object);
void
sethash(key, hashtable, value)
object key, hashtable, value;
{
int i;
bool over=FALSE;
struct htent *e;
i = hashtable->ht.ht_nent + 1;
if (type_of(hashtable->ht.ht_rhthresh) == t_fixnum)
over = i >= fix(hashtable->ht.ht_rhthresh);
else if (type_of(hashtable->ht.ht_rhthresh) == t_shortfloat)
over =
i >= hashtable->ht.ht_size * sf(hashtable->ht.ht_rhthresh);
else if (type_of(hashtable->ht.ht_rhthresh) == t_longfloat)
over =
i >= hashtable->ht.ht_size * lf(hashtable->ht.ht_rhthresh);
if (over)
extend_hashtable(hashtable);
e = gethash(key, hashtable);
if (e->hte_key == OBJNULL)
hashtable->ht.ht_nent++;
e->hte_key = key;
e->hte_value = value;
}
static void
extend_hashtable(hashtable)
object hashtable;
{
object old;
int new_size=0, i;
if (type_of(hashtable->ht.ht_rhsize) == t_fixnum)
new_size =
hashtable->ht.ht_size + fix(hashtable->ht.ht_rhsize);
else if (type_of(hashtable->ht.ht_rhsize) == t_shortfloat)
new_size =
hashtable->ht.ht_size * sf(hashtable->ht.ht_rhsize);
else if (type_of(hashtable->ht.ht_rhsize) == t_longfloat)
new_size =
hashtable->ht.ht_size * lf(hashtable->ht.ht_rhsize);
{BEGIN_NO_INTERRUPT;
old = alloc_object(t_hashtable);
old->ht = hashtable->ht;
vs_push(old);
hashtable->ht.ht_self = NULL;
hashtable->ht.ht_size = new_size;
if (type_of(hashtable->ht.ht_rhthresh) == t_fixnum)
hashtable->ht.ht_rhthresh =
make_fixnum(fix(hashtable->ht.ht_rhthresh) +
(new_size - old->ht.ht_size));
hashtable->ht.ht_self =
(struct htent *)alloc_relblock(new_size * sizeof(struct htent));
for (i = 0; i < new_size; i++) {
hashtable->ht.ht_self[i].hte_key = OBJNULL;
hashtable->ht.ht_self[i].hte_value = OBJNULL;
}
for (i = 0; i < old->ht.ht_size; i++) {
if (old->ht.ht_self[i].hte_key != OBJNULL)
sethash(old->ht.ht_self[i].hte_key,
hashtable,
old->ht.ht_self[i].hte_value);
}
hashtable->ht.ht_nent = old->ht.ht_nent;
vs_popp;
END_NO_INTERRUPT;}
}
@(defun make_hash_table (&key (test sLeql)
(size `make_fixnum(1024)`)
(rehash_size
`make_shortfloat((shortfloat)1.5)`)
(rehash_threshold
`make_shortfloat((shortfloat)0.7)`)
&aux h)
enum httest htt=0;
int i;
@
if (test == sLeq || test == sLeq->s.s_gfdef)
htt = htt_eq;
else if (test == sLeql || test == sLeql->s.s_gfdef)
htt = htt_eql;
else if (test == sLequal || test == sLequal->s.s_gfdef)
htt = htt_equal;
else
FEerror("~S is an illegal hash-table test function.",
1, test);
if (type_of(size) != t_fixnum || 0 < fix(size))
;
else
FEerror("~S is an illegal hash-table size.", 1, size);
if ((type_of(rehash_size) == t_fixnum && 0 < fix(rehash_size)) ||
(type_of(rehash_size) == t_shortfloat && 1.0 < sf(rehash_size)) ||
(type_of(rehash_size) == t_longfloat && 1.0 < lf(rehash_size)))
;
else
FEerror("~S is an illegal hash-table rehash-size.",
1, rehash_size);
if ((type_of(rehash_threshold) == t_fixnum &&
0 < fix(rehash_threshold) && fix(rehash_threshold) < fix(size)) ||
(type_of(rehash_threshold) == t_shortfloat &&
0.0 < sf(rehash_threshold) && sf(rehash_threshold) < 1.0) ||
(type_of(rehash_threshold) == t_longfloat &&
0.0 < lf(rehash_threshold) && lf(rehash_threshold) < 1.0))
;
else
FEerror("~S is an illegal hash-table rehash-threshold.",
1, rehash_threshold);
{BEGIN_NO_INTERRUPT;
h = alloc_object(t_hashtable);
h->ht.ht_test = (short)htt;
h->ht.ht_size = fix(size);
h->ht.ht_rhsize = rehash_size;
h->ht.ht_rhthresh = rehash_threshold;
h->ht.ht_nent = 0;
h->ht.ht_self = NULL;
h->ht.ht_self = (struct htent *)
alloc_relblock(fix(size) * sizeof(struct htent));
for(i = 0; i < fix(size); i++) {
h->ht.ht_self[i].hte_key = OBJNULL;
h->ht.ht_self[i].hte_value = OBJNULL;
}
END_NO_INTERRUPT;}
@(return h)
@)
LFD(Lhash_table_p)(void)
{
check_arg(1);
if(type_of(vs_base[0]) == t_hashtable)
vs_base[0] = Ct;
else
vs_base[0] = Cnil;
}
LFD(Lgethash)()
{
int narg;
struct htent *e;
narg = vs_top - vs_base;
if (narg < 2)
too_few_arguments();
else if (narg == 2)
vs_push(Cnil);
else if (narg > 3)
too_many_arguments();
check_type_hash_table(&vs_base[1]);
e = gethash(vs_base[0], vs_base[1]);
if (e->hte_key != OBJNULL) {
vs_base[0] = e->hte_value;
vs_base[1] = Ct;
} else {
vs_base[0] = vs_base[2];
vs_base[1] = Cnil;
}
vs_popp;
}
LFD(siLhash_set)()
{
check_arg(3);
check_type_hash_table(&vs_base[1]);
sethash(vs_base[0], vs_base[1], vs_base[2]);
vs_base += 2;
}
LFD(Lremhash)()
{
struct htent *e;
check_arg(2);
check_type_hash_table(&vs_base[1]);
e = gethash(vs_base[0], vs_base[1]);
if (e->hte_key != OBJNULL) {
e->hte_key = OBJNULL;
e->hte_value = Cnil;
vs_base[1]->ht.ht_nent--;
vs_base[0] = Ct;
} else
vs_base[0] = Cnil;
vs_top = vs_base + 1;
}
LFD(Lclrhash)()
{
int i;
check_arg(1);
check_type_hash_table(&vs_base[0]);
for(i = 0; i < vs_base[0]->ht.ht_size; i++) {
vs_base[0]->ht.ht_self[i].hte_key = OBJNULL;
vs_base[0]->ht.ht_self[i].hte_value = OBJNULL;
}
vs_base[0]->ht.ht_nent = 0;
}
LFD(Lhash_table_count)()
{
check_arg(1);
check_type_hash_table(&vs_base[0]);
vs_base[0] = make_fixnum(vs_base[0]->ht.ht_nent);
}
LFD(Lsxhash)()
{
check_arg(1);
/*FIXME 64*/
vs_base[0] = make_fixnum(ihash_equal(vs_base[0],0)/* & 0x7fffffff */);
}
LFD(Lmaphash)()
{
object *base = vs_base;
object hashtable;
int i;
check_arg(2);
check_type_hash_table(&vs_base[1]);
hashtable = vs_base[1];
for (i = 0; i < hashtable->ht.ht_size; i++) {
if(hashtable->ht.ht_self[i].hte_key != OBJNULL)
ifuncall2(base[0],
hashtable->ht.ht_self[i].hte_key,
hashtable->ht.ht_self[i].hte_value);
}
vs_base[0] = Cnil;
vs_popp;
}
DEFUN_NEW("NEXT-HASH-TABLE-ENTRY",object,fSnext_hash_table_entry,SI,2,2,NONE,OO,OO,OO,OO,(object
table,object ind),"For HASH-TABLE and for index I return three values:
NEXT-START, the next KEY and its VALUE. NEXT-START will be -1 if there are
no more entries, otherwise it will be a value suitable for passing as an index")
{ int i = fix(ind);
check_type_hash_table(&table);
if ( i < 0) { FEerror("needs non negative index",0);}
while ( i < table->ht.ht_size) {
if (table->ht.ht_self[i].hte_key != OBJNULL) {
RETURN(3,object,make_fixnum(i+1),
(RV(table->ht.ht_self[i].hte_key),
RV(table->ht.ht_self[i].hte_value)));}
i++;}
RETURN(3,object,small_fixnum(-1),(RV(sLnil),RV(sLnil)));
}
DEFUN_NEW("HASH-TABLE-TEST",object,fLhash_table_test,LISP,1,1,NONE,OO,OO,OO,OO,(object
table),
"Given a HASH-TABLE return a symbol which specifies the function used in its
test")
{
check_type_hash_table(&table);
switch(table->ht.ht_test) {
case htt_equal: RETURN1(sLequal);
case htt_eq: RETURN1(sLeq);
case htt_eql: RETURN1(sLeql);
}
FEerror("not able to get hash table test for ~a",1,table);
RETURN1(sLnil);
}
DEFUN_NEW("HASH-TABLE-SIZE",object,fLhash_table_size,LISP,1,1,NONE,OO,OO,OO,OO,(object
table),"")
{
check_type_hash_table(&table);
RETURN1(make_fixnum(table->ht.ht_size));
}
void
gcl_init_hash()
{
sLeq = make_ordinary("EQ");
sLeql = make_ordinary("EQL");
sLequal = make_ordinary("EQUAL");
sKsize = make_keyword("SIZE");
sKtest = make_keyword("TEST");
sKrehash_size = make_keyword("REHASH-SIZE");
sKrehash_threshold = make_keyword("REHASH-THRESHOLD");
make_function("MAKE-HASH-TABLE", Lmake_hash_table);
make_function("HASH-TABLE-P", Lhash_table_p);
make_function("GETHASH", Lgethash);
make_function("REMHASH", Lremhash);
make_function("MAPHASH", Lmaphash);
make_function("CLRHASH", Lclrhash);
make_function("HASH-TABLE-COUNT", Lhash_table_count);
make_function("SXHASH", Lsxhash);
make_si_sfun("HASH-EQUAL",hash_equal,ARGTYPE2(f_object,f_fixnum)
| RESTYPE(f_object));
make_si_function("HASH-SET", siLhash_set);
}
=============================================================================
Robert Boyer <[EMAIL PROTECTED]> writes:
> Hi Camm,
>
> We have produced a new version of GCL file "o/hash.d" that improves the
> performance of the C-procedures "gethash" and "sethash" and these changes
> force changes in the procedures "extend_hashtable" and "make_hash_table".
>
> We were comparing a copy of our updated "hash.d" with the file
> "/u/camm/gcl-2.6.6twc+/o/hash.d" and we noticed that you have put in some
> changed concerning the storing a hash value with each symbol. Thus, our
> file is now inconsistent with your current (maybe not committed) source.
>
> We also changed the hash table structure in GCL file "h/object.h" to:
>
> struct hashtable { /* hash table header */
> FIRSTWORD;
> struct htent
> *ht_self; /* pointer to the hash table */
> object ht_rhsize; /* rehash size */
> object ht_rhthresh; /* rehash threshold */
> int ht_nent; /* number of entries */
> int ht_size; /* hash table size */
> short ht_test; /* key test function */
> /* of enum httest */
> short pad1;
> int ht_max_ent; /* maximum number of permitted entries */
> /* object pad; */
> };
>
> This change eliminated your pad and replaced it with a maximum number of
> entries field.
>
> I am worried about our "stepping on each others toes". We noticed other
> changes in "hash.d". Do you believe that you will commit your storing of
> a hash value in the symbol table?
>
> Cheers,
>
> Warren & Bob
>
>
>
--
Camm Maguire [EMAIL PROTECTED]
==========================================================================
"The earth is but one country, and mankind its citizens." -- Baha'u'llah
_______________________________________________
Gcl-devel mailing list
Gcl-devel@gnu.org
http://lists.gnu.org/mailman/listinfo/gcl-devel
