Lines Matching refs:_stack_top
167 Block_Descr *_stack_top;
176 _stack_top = _stack - 1; // stack is empty
192 t->_parent = &_tarjan[_stack_top->block->_pre_order];
195 ++_stack_top;
196 assert(_stack_top < _stack_max, ""); // assert if stack have to grow
197 _stack_top->block = b;
198 _stack_top->index = -1;
200 _stack_top->freq_idx = most_frequent_successor(b); // freq_idx >= 0
202 Block* pop() { Block* b = _stack_top->block; _stack_top--; return b; }
203 bool is_nonempty() { return (_stack_top >= _stack); }
204 bool last_successor() { return (_stack_top->index == _stack_top->freq_idx); }
206 int i = _stack_top->index;
208 if (i == _stack_top->freq_idx) i++;
209 if (i >= (int)(_stack_top->block->_num_succs)) {
210 i = _stack_top->freq_idx; // process most frequent successor last
212 _stack_top->index = i;
213 return _stack_top->block->_succs[ i ];