retval->hash_full = (1 << START_POWER) / 2;
retval->hash_full = FULL_VALUE (1 << START_POWER);
hash_new (){  struct hash_control *retval;  struct hash_entry *room;	/* points to hash table */  struct hash_entry *wall;  struct hash_entry *entry;  int *ip;		/* scan stats block of struct hash_control */  int *nd;		/* limit of stats block */  room = (struct hash_entry *) xmalloc (sizeof (struct hash_entry)					/* +1 for the wall entry */					* ((1 << START_POWER) + 1));  retval = (struct hash_control *) xmalloc (sizeof (struct hash_control));  nd = retval->hash_stat + STATLENGTH;  for (ip = retval->hash_stat; ip < nd; ip++)    *ip = 0;  retval->hash_stat[STAT_SIZE] = 1 << START_POWER;  retval->hash_mask = (1 << START_POWER) - 1;  retval->hash_sizelog = START_POWER;  /* works for 1's compl ok */  retval->hash_where = room;  retval->hash_wall =    wall = room + (1 << START_POWER);  retval->hash_full = (1 << START_POWER) / 2;  for (entry = room; entry <= wall; entry++)    entry->hash_string = NULL;  return retval;}