48         int nel;  member
65         int nel;      /* total ITEMs held by all lists[] */  member
70             int nel;      /* total ITEMs held by this list */  member
86 #define hash_bucket(hp, keyval) ((hp)->tab.base + ((keyval) % (hp)->tab.nel))
104     hp->tab.nel = 0;  in hashinit()
110     hp->items.nel = 0;  in hashinit()
212     if ( !hp->items.nel )  in hash_find()
239     hp->items.more = i ? 2 * hp->items.nel : hp->inel;  in hashrehash()
243     hp->items.lists[ i ].nel = hp->items.more;  in hashrehash()
245     hp->items.nel += hp->items.more;  in hashrehash()
250     hp->tab.nel = hp->items.nel * hp->bloat;  in hashrehash()
251     hp->tab.base = (ITEM * *)BJAM_MALLOC( hp->tab.nel * sizeof( ITEM * ) );  in hashrehash()
253     memset( (char *)hp->tab.base, '\0', hp->tab.nel * sizeof( ITEM * ) );  in hashrehash()
257         int nel = hp->items.lists[ i ].nel;  in hashrehash()  local
260         for ( ; nel--; next += hp->items.size )  in hashrehash()
264                 hp->tab.nel;  in hashrehash()
284         int nel = hp->items.lists[ i ].nel;  in hashenumerate()  local
286             nel -= hp->items.more;  in hashenumerate()
288         for ( ; nel--; next += hp->items.size )  in hashenumerate()
340         int nel = hp->tab.nel;  in hashstats_add()  local
345         for ( i = 0; i < nel; ++i )  in hashstats_add()
359         stats->num_items += hp->items.nel;  in hashstats_add()
360         stats->tab_size += hp->tab.nel;  in hashstats_add()