Searched refs:dom_depth (Results 1 - 8 of 8) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A DloopUnswitch.cpp227 register_node(opq, outer_loop, entry, dom_depth(entry));
229 register_node(bol, outer_loop, entry, dom_depth(entry));
231 register_node(iff, outer_loop, entry, dom_depth(entry));
233 register_node(iffast, outer_loop, iff, dom_depth(iff));
235 register_node(ifslow, outer_loop, iff, dom_depth(iff));
240 clone_loop(loop, old_new, dom_depth(head), iff);
246 set_idom(head, iffast_pred, dom_depth(head));
252 set_idom(slow_head, ifslow_pred, dom_depth(slow_head));
H A Dloopnode.cpp100 uint e_d = dom_depth(early);
106 uint c_d = dom_depth(cin);
120 dom_depth(n2) < c_d)
123 dom_depth(n1) < c_d) {
128 e_d = dom_depth(early); // Reset depth register cache
151 uint min_dom_depth = dom_depth(earliest);
158 if (dom_depth(ctl) < min_dom_depth) {
221 if (next->is_Root() || next->is_Start() || dom_depth(next) < min_dom_depth) {
721 uint dd = dom_depth(iff);
769 set_idom(l, init_control, dom_depth(
2644 set_idom(Node* d, Node* n, uint dom_depth) argument
[all...]
H A Dloopopts.cpp389 dom_depth(add_invar_ctrl) > dom_depth(scale_ctrl) ?
993 assert(dom_depth(n_ctrl) <= dom_depth(x_ctrl), "n is later than its clone");
1326 set_idom(newuse, nnn, dom_depth(nnn) + 1 );
1333 uint dd_r = MIN2(dom_depth(newuse),dom_depth(use));
1334 assert( dd_r >= dom_depth(dom_lca(newuse,use)), "" );
1345 assert( dom_depth(useuse) > dd_r, "" );
1346 set_idom(useuse, r, dom_depth(useus
[all...]
H A Ddomgraph.cpp388 void setdepth( uint size, uint *dom_depth );
606 void NTarjan::setdepth( uint stack_size, uint *dom_depth ) {
622 dom_depth[t->_control->_idx] = depth; // Set depth in dominator tree
H A DloopPredicate.cpp109 set_idom(n, pred, dom_depth(pred));
169 set_idom(call, rgn, dom_depth(rgn));
204 set_idom(rgn, nrdom, dom_depth(rgn));
227 set_idom(iff, if_cont, dom_depth(iff));
H A Dsplit_if.cpp51 set_idom(x, x->in(0), dom_depth(x->in(0))+1);
467 set_idom(ifpx, region_dom, dom_depth(region_dom) + 1);
H A Dloopnode.hpp739 uint dom_depth(Node* d) const { function in class:PhaseIdealLoop
743 void set_idom(Node* d, Node* n, uint dom_depth);
746 // Recompute dom_depth
841 void clone_loop( IdealLoopTree *loop, Node_List &old_new, int dom_depth,
H A DloopTransform.cpp504 clone_loop( loop, old_new, dom_depth(head) );
543 int dd = dom_depth(head);
890 uint dd_main_head = dom_depth(main_head);
921 int dd_main_exit = dom_depth(main_exit);
1408 uint dd = dom_depth(loop_head);

Completed in 82 milliseconds