/* * $Id: hash.h,v 1.4 2000/08/10 21:02:50 danny Exp $ * * Copyright © 1987, 1992, 1993 Free Software Foundation, Inc. * * This file is part of GAS, the GNU Assembler. * * GAS is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2, or (at your option) * any later version. * * GAS 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with GAS; see the file COPYING. If not, write to * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef hashH #define hashH /* define the type of bindings: */ #undef VOIDSTAR #define VOIDSTAR char * struct hash_entry { char *hash_string; /* points to where the symbol string is */ /* NULL means slot is not used */ /* DELETED means slot was deleted */ char *hash_value; /* user's datum, associated with symbol */ }; #define HASH_STATLENGTH (6) struct hash_control { struct hash_entry *hash_where;/* address of hash table */ int hash_sizelog; /* Log of ( hash_mask + 1 ) */ int hash_mask; /* masks a hash into index into table */ int hash_full; /* when hash_stat[STAT_USED] exceeds this, */ /* grow table */ struct hash_entry *hash_wall; /* point just after last (usable) entry */ /* here we have some statistics */ int hash_stat[HASH_STATLENGTH]; /* lies & statistics */ /* we need STAT_USED & STAT_SIZE */ }; /* returns */ struct hash_control *hash_new (); /* [control block] */ void hash_die (); void hash_say (); char *hash_delete (); /* previous value */ char *hash_relpace (); /* previous value */ char *hash_insert (); /* error string */ char *hash_apply (); /* 0 means OK */ VOIDSTAR hash_find (); /* value */ char *hash_jam (); /* error text (internal) */ #endif /* #ifdef hashH */ /* end: hash.c */