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

Lines Matching refs:_idx
60     // will repeat those of _idx. In case this is somehow pathological,
63     int bump = (int)(_idx - new_debug_idx) % mod;
71   if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (int)_idx == BreakAtNode)) {
72     tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d", _idx, _debug_idx);
137   assert(_idx      <  node->_outcnt + (uint)at_end_ok, "idx in range");
143     // Fix up _idx to meet asserts.
144     if (_idx > _outcnt)  _idx = _outcnt;
159   assert(that._idx          == 0, "assign only the result of Node::outs()");
160   assert(_idx               == that._idx, "already assigned _idx");
279 // _idx field, which is const, and so must be initialized
325   : _idx(IDX_INIT(req))
344   : _idx(IDX_INIT(1))
356   : _idx(IDX_INIT(2))
370   : _idx(IDX_INIT(3))
386   : _idx(IDX_INIT(4))
404   : _idx(IDX_INIT(5))
425   : _idx(IDX_INIT(6))
448   : _idx(IDX_INIT(7))
556   if ((uint)_idx+1 == compile->unique()) {
563   Node_Notes* nn = compile->node_notes_at(_idx);
840     C->record_dead_node(_idx);
1264       igvn->C->record_dead_node(dead->_idx);
1428 // Find a neighbor of this Node with the given _idx
1436   if( v->test(n->_idx) ) return;
1437   if( (int)n->_idx == node_idx
1444   v->set(n->_idx);
1483 // Find an ancestor to this node in the control history with given _idx
1523     st->print("%d", orig->_idx);
1551     if (orig->debug_idx() == BreakAtNode || (int)orig->_idx == BreakAtNode) {
1552       tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d orig._idx=%d orig._debug_idx=%d",
1553                     this->_idx, this->debug_idx(), orig->_idx, orig->debug_idx());
1569   st->print("%c%d\t%s\t=== ", is_new ? ' ' : 'o', _idx, Name());
1626     Node_Notes* nn = C->node_notes_at(_idx);
1648       st->print("%c%d ", Compile::current()->node_arena()->contains(d) ? ' ' : 'o', d->_idx);
1663       st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
1680       st->print("%c%d ", Compile::current()->node_arena()->contains(u) ? ' ' : 'o', u->_idx);
1801   if( v->test_set(n->_idx) ) return;
1855   if( visited.test_set(_idx) ) return;
2030   if( _in_worklist[n->_idx] ) {
2034         _in_worklist >>= n->_idx;
2048     if( ! useful.test(n->_idx) ) {
2049       _in_worklist >>= n->_idx;