Lines Matching refs:_max
43 _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
45 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ), // (Node**)_a->Amalloc(_max * sizeof(Node*)) ),
52 memset(_table,0,sizeof(Node*)*_max);
57 _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
59 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ),
67 memset(_table,0,sizeof(Node*)*_max);
94 uint key = hash & (_max-1);
118 key = (key + stride/*7*/) & (_max-1); // Stride through table with relative prime
139 uint key = hash & (_max-1);
170 key = (key + stride) & (_max-1); // Stride through table w/ relative prime
200 uint key = hash & (_max-1);
209 key = (key + stride) & (_max-1); // Stride through table w/ relative prime
225 uint key = hash & (_max-1);
236 for( uint i=0; i < _max; i++ )
250 key = (key + stride/*7*/) & (_max-1);
272 uint old_max = _max;
280 _max = _max << 1;
281 _table = NEW_ARENA_ARRAY( _a , Node* , _max ); // (Node**)_a->Amalloc( _max * sizeof(Node*) );
282 memset(_table,0,sizeof(Node*)*_max);
298 for (uint i = 0; i < _max; i++) {
305 memset( _table, 0, _max * sizeof(Node*) );
334 for (uint i=0; i<_max; i++) {
336 tty->print("%d/%d/%d ",i,_table[i]->hash()&(_max-1),_table[i]->_idx);
339 tty->print("\nGVN Hash stats: %d grows to %d max_size\n", _grows, _max);
340 tty->print(" %d/%d (%8.1f%% full)\n", _inserts, _max, (double)_inserts/_max*100.0);
345 assert( _inserts+(_inserts>>3) < _max, "table too full" );
352 for( uint i = 0; i < _max; i++ ) {
1773 if( !_max ) {
1774 _max = 1;
1775 _types = (const Type**)_a->Amalloc( _max * sizeof(Type*) );
1778 uint old = _max;
1779 while( i >= _max ) _max <<= 1; // Double to fit
1780 _types = (const Type**)_a->Arealloc( _types, old*sizeof(Type*),_max*sizeof(Type*));
1781 memset( &_types[old], 0, (_max-old)*sizeof(Type*) );