/* mapping.h - 1992/07/19 */ #ifndef _MAPPING_H #define _MAPPING_H struct node { struct svalue values[2]; struct node *next; unsigned short hashval; }; #define MAX_TABLE_SIZE 32768 #define MAP_HASH_TABLE_SIZE 8 /* must be a power of 2 */ #define FILL_PERCENT 80 /* must not be larger than 99 */ #define MAPSIZE(size) sizeof(struct mapping) struct mapping { struct node **table; /* the hash table */ unsigned short table_size; /* # of buckets in hash table == power of 2 */ unsigned short filled; /* # of buckets that have entries */ unsigned short do_split; /* indicates size at which to split the table */ unsigned short ref; /* how many times this map has been referenced */ int count; /* total # of nodes actually in mapping */ statgroup_t stats; /* creators of the mapping */ #ifdef EACH struct object *eachObj; /* object that last called each() on this map */ struct node *elt; /* keeps track of where each() is in the map */ unsigned short bucket; /* keeps track of where each() currently is */ #endif #ifdef DEBUG int extra_ref; #endif }; typedef struct finfo_s { char *func; struct object *obj; struct svalue *extra; } finfo_t; typedef struct vinfo_s { struct vector *v; int pos, size, w; } vinfo_t; typedef struct minfo_s { struct mapping *map, *newmap; } minfo_t; #define max(x,y) ((x) > (y)) ? (x) : (y) /* used by mapHashStr: do not make larger than the size of the coeff array */ #define MAX_KEY_LEN 25 #endif /* _MAPPING_H */