Cross Reference: /openjdk7/hotspot/src/share/vm/opto/node.cpp

Lines Matching refs:_max
314   _cnt = _max = req;
476   Node *n = (Node*)compile->node_arena()->Amalloc_D(size_of() + _max*sizeof(Node*));
566   _cnt = _max;  // forget req/prec distinction
568   for( i = 0; i < _max; i++ ) {
574   int edge_size = _max*sizeof(void*);
628   _max = _cnt = _outmax = _outcnt = 0;
636   uint new_max = _max;
638     _max = 4;
651   _in = (Node**)arena->Arealloc(_in, _max*sizeof(Node*), new_max*sizeof(Node*));
652   Copy::zero_to_bytes(&_in[_max], (new_max-_max)*sizeof(Node*)); // NULL all new space
653   _max = new_max;               // Record new max length
654   // This assertion makes sure that Node::_max is wide enough to
656   assert(_max == new_max && _max > len, "int width of _max is too small");
678   // This assertion makes sure that Node::_max is wide enough to
689   for( uint i = 0; i < _max; i++ )
710   if( (_cnt >= _max) || (in(_max-1) != NULL) )
711     grow( _max+1 );
716     for( i=_cnt; i<_max; i++ )
737   if( (_cnt+m) > _max || _in[_max-m] )
738     grow( _max+m );
743     for( i=_cnt; i<_max; i++ )
781   assert( idx < _max, "Must have allocated enough space");
893   if( _cnt >= _max || in(_max-1) )
894     grow( _max+1 );
910   for( i=j; i<_max; i++ )
1857   for( uint i=0; i<_max; i++ )
1886   _a->Afree(_nodes,_max*sizeof(Node*));
1887   _max   = 0;
1895   Copy::zero_to_bytes( _nodes, _max*sizeof(Node*) );
1900   if( !_max ) {
1901     _max = 1;
1902     _nodes = (Node**)_a->Amalloc( _max * sizeof(Node*) );
1905   uint old = _max;
1906   while( i >= _max ) _max <<= 1;        // Double to fit
1907   _nodes = (Node**)_a->Arealloc( _nodes, old*sizeof(Node*),_max*sizeof(Node*));
1908   Copy::zero_to_bytes( &_nodes[old], (_max-old)*sizeof(Node*) );
1913   if( _nodes[_max-1] ) grow(_max);      // Get more space if full
1914   Copy::conjoint_words_to_higher((HeapWord*)&_nodes[i], (HeapWord*)&_nodes[i+1], ((_max-i-1)*sizeof(Node*)));
1920   Copy::conjoint_words_to_lower((HeapWord*)&_nodes[i+1], (HeapWord*)&_nodes[i], ((_max-i-1)*sizeof(Node*)));
1921   _nodes[_max-1] = NULL;
1926   qsort( _nodes, _max, sizeof( Node* ), func );
1932   for( uint i = 0; i < _max; i++ ) {