534   // the possibility to push n onto the stack for further processing.

   534   // the possibility to push n onto the stack for further processing.

   535   void visit(Node* use, Node* n) {

   535   void visit(Node* use, Node* n) {

   536     if (_lpt->is_invariant(n)) { // known invariant

   536     if (_lpt->is_invariant(n)) { // known invariant

   537       _invariant.set(n->_idx);

   537       _invariant.set(n->_idx);

   538     } else if (!n->is_CFG()) {

   538     } else if (!n->is_CFG()) {

   539       Node *n_ctrl = _phase->ctrl_or_self(n);

   542       Node *n_ctrl = _phase->ctrl_or_self(n);

   540       Node *u_ctrl = _phase->ctrl_or_self(use); // self if use is a CFG

   543       Node *u_ctrl = _phase->ctrl_or_self(use); // self if use is a CFG

   541       if (_phase->is_dominator(n_ctrl, u_ctrl)) {

   544       if (_phase->is_dominator(n_ctrl, u_ctrl)) {

   542         _stack.push(n, n->in(0) == NULL ? 1 : 0);

   545         _stack.push(n, n->in(0) == NULL ? 1 : 0);

   543       }

   546       }