Searched refs:pre_order (Results 1 - 10 of 10) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Ddomgraph.cpp178 void push(uint pre_order, Block *b) { argument
179 Tarjan *t = &_tarjan[pre_order]; // Fast local access
180 b->_pre_order = pre_order; // Flag as visited
182 t->_semi = pre_order; // Block to DFS map
188 if (pre_order == 1)
266 uint pre_order = 1;
271 bstack.push(pre_order, b);
272 ++pre_order;
280 bstack.push(pre_order, s);
281 ++pre_order;
[all...]
H A Dloopnode.hpp546 void set_preorder_visited( Node *n, int pre_order ) {
548 _preorders[n->_idx] = (pre_order<<1);
705 int build_loop_tree_impl( Node *n, int pre_order );
H A Dloopnode.cpp2770 int pre_order = 1; local
2777 // Pre-walked but not post-walked nodes need a pre_order number.
2779 set_preorder_visited( n, pre_order ); // set as visited
2794 get_preorder(l) < pre_order ) { // And smaller pre-order
2802 pre_order++;
2818 pre_order = build_loop_tree_impl( n, pre_order );
2835 int PhaseIdealLoop::build_loop_tree_impl( Node *n, int pre_order ) {
2837 // Pre-walked but not post-walked nodes need a pre_order number.
2852 assert( get_preorder(m) < pre_order, "shoul
[all...]
H A Dchaitin.hpp538 void dump_bb( uint pre_order ) const;
H A Dchaitin.cpp2089 void PhaseChaitin::dump_bb( uint pre_order ) const {
2090 tty->print_cr("---dump of B%d---",pre_order);
2093 if( b->_pre_order == pre_order )
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkFunction.cpp74 _blocks[b->pre_order()] = new SharkTopLevelBlock(this, b);
H A DsharkTopLevelBlock.hpp74 return ciblock()->pre_order();
101 return function()->block(ciblock()->successors()->at(index)->pre_order());
H A DsharkTopLevelBlock.cpp315 return function()->block(successor->pre_order());
491 block = function()->block(ciblock()->exceptions()->at(i)->pre_order());
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp1866 if (has_pre_order()) st->print("#%-2d ", pre_order());
1890 st->print(" %d<-%d", lp->head()->pre_order(),lp->tail()->pre_order());
2444 // descending on primary key: loop head's pre_order, and
2445 // ascending on secondary key: loop tail's pre_order.
2451 int lp_pre_order = lp->head()->pre_order();
2456 if (current->head()->pre_order() < lp_pre_order)
2458 if (current->head()->pre_order() == lp_pre_order &&
2459 current->tail()->pre_order() > lp->tail()->pre_order()) {
[all...]
H A DciTypeFlow.hpp538 // pre_order, assigned at first visit. Used as block ID and "visited" tag
674 int pre_order() const { assert(has_pre_order(), ""); return _pre_order; } function in class:ciTypeFlow::Block
762 bool is_root() const { return _tail->pre_order() == max_jint; }
807 // A mapping from pre_order to Blocks. This array is created
937 // Create the block map, which indexes blocks in pre_order.

Completed in 101 milliseconds