Lines Matching refs:_available
1764 _available(arena),
1995 uint siz = _available.size();
2011 _available[0]->dump();
2014 return (_available[0]);
2020 Node *n = _available[i];
2045 _available[0]->dump();
2049 return _available[0];
2066 for ( i=0; i < _available.size(); i++ )
2067 if (_current_latency[_available[i]->_idx] > latency)
2083 for ( i=0 ; i < _available.size(); i++ )
2084 if (_current_latency[_available[i]->_idx] >= latency)
2090 _available.insert(i, n);
2131 for (i = 0; i < _available.size(); i++)
2132 if (_available[i] == n)
2134 assert(i < _available.size(), "entry in _available list not found");
2135 _available.remove(i);
2148 uint siz = _available.size();
2169 Node *d = _available[i];
2350 _available.clear();
2515 while ( _available.size() > 0 ) {
2963 for (uint i = 0; i < _available.size(); i++)
2964 tty->print(" N%d/l%d", _available[i]->_idx,_current_latency[_available[i]->_idx]);