Lines Matching refs:_outcnt
89 _outcnt = node->_outcnt;
109 _outcnt = node->_outcnt;
126 _outcnt = node->_outcnt;
137 assert(_idx < node->_outcnt + (uint)at_end_ok, "idx in range");
144 if (_idx > _outcnt) _idx = _outcnt;
150 // Note: We do not assert on _outcnt, because insertions are OK here.
180 if (_node->_outcnt == 0) _refresh_tick &= ~1;
193 uint cnt = node->_outcnt;
194 assert(cnt == _outcnt, "no insertions allowed");
202 assert(_outp == node->_out + node->_outcnt, "limit still correct");
207 if (_outp == node->_out + _outcnt) {
210 assert(node->_outcnt+node->_del_tick == _outcnt+_del_tick, "no insertions allowed with deletion(s)");
216 assert(node->_outcnt < _outcnt, "no insertions allowed with deletion(s)");
228 assert(_outp == node->_out + node->_outcnt, "apply -= only to a limit (imax)");
246 assert(_outp == (node->_out + node->_outcnt) - 1, "pointer must point to end of nodes");
257 _outcnt -= num_edges;
315 _outcnt = _outmax = 0;
483 n->_outcnt = 0;
538 _outcnt = _outmax = 0;
628 _max = _cnt = _outmax = _outcnt = 0;
687 if( is_top() || is_Mach() || (Opcode() == Op_Node && _outcnt > 0) )
1673 for (uint i = 0; i < _outcnt; i++) { // For all outputs
1762 for (idx = 0; idx < n->_outcnt; idx++ ) {
1821 uint max = x->_outcnt;