Lines Matching defs:n_ctrl
263 Node *n_ctrl = get_ctrl(n);
269 if( phi->is_Phi() && phi->in(0) == n_ctrl )
282 if( get_ctrl(m) == n_ctrl && !m->is_Phi() ) {
286 get_ctrl(m->in(2)) != n_ctrl &&
287 get_ctrl(m->in(3)) != n_ctrl) {
289 set_ctrl_and_loop(m, find_non_split_ctrl(idom(n_ctrl)));
296 return n_ctrl;
305 Node *n_ctrl = get_ctrl(n);
306 IdealLoopTree *n_loop = get_loop(n_ctrl);
393 register_new_node( var_scale, n_ctrl );
395 register_new_node( var_add, n_ctrl );
430 register_new_node( add2, n_ctrl );
451 register_new_node( add2, n_ctrl );
671 Node *n_ctrl = get_ctrl(n);
672 if( !n_ctrl ) return n; // Dead node
799 Node *n_ctrl = get_ctrl(n);
803 if( n_blk != n_ctrl ) return;
805 if( merge_point_too_heavy(C, n_ctrl) )
816 if( iff->in(0) != n_ctrl ) return; // Compare must be in same blk as if
819 if (iff->in(0) != NULL && iff->in(0) != n_ctrl ) return;
820 if( get_ctrl(iff->in(2)) == n_ctrl ||
821 get_ctrl(iff->in(3)) == n_ctrl )
823 if ( get_loop(n_ctrl) != get_loop(get_ctrl(iff)) ) {
832 for( uint i = 1; i < n_ctrl->req(); i++ )
833 if( n_ctrl->in(i) == C->top() )
845 // for any input path not being in the same loop as n_ctrl. For
846 // irreducible loops we cannot check for 'n_ctrl->is_Loop()'
849 IdealLoopTree *n_loop = get_loop(n_ctrl);
850 for( uint j = 1; j < n_ctrl->req(); j++ )
851 if( get_loop(n_ctrl->in(j)) != n_loop )
855 if( !merge_point_safe(n_ctrl) ) {
860 Node *phi = split_thru_phi( n, n_ctrl, policy );
868 Node *bolphi = split_thru_phi( bol, n_ctrl, -1 );
876 Node *cmovphi = split_thru_phi( iff, n_ctrl, -1 );
924 Node *n_ctrl = get_ctrl(n);
925 IdealLoopTree *n_loop = get_loop(n_ctrl);
943 late_load_ctrl = get_late_ctrl(n, n_ctrl);
948 if (!n->is_Load() || late_load_ctrl != n_ctrl) {
993 assert(dom_depth(n_ctrl) <= dom_depth(x_ctrl), "n is later than its clone");