equal
deleted
inserted
replaced
889 // Return Idealized original |
889 // Return Idealized original |
890 return k; |
890 return k; |
891 } |
891 } |
892 |
892 |
893 bool PhaseGVN::is_dominator_helper(Node *d, Node *n, bool linear_only) { |
893 bool PhaseGVN::is_dominator_helper(Node *d, Node *n, bool linear_only) { |
894 if (d->is_top() || n->is_top()) { |
894 if (d->is_top() || (d->is_Proj() && d->in(0)->is_top())) { |
|
895 return false; |
|
896 } |
|
897 if (n->is_top() || (n->is_Proj() && n->in(0)->is_top())) { |
895 return false; |
898 return false; |
896 } |
899 } |
897 assert(d->is_CFG() && n->is_CFG(), "must have CFG nodes"); |
900 assert(d->is_CFG() && n->is_CFG(), "must have CFG nodes"); |
898 int i = 0; |
901 int i = 0; |
899 while (d != n) { |
902 while (d != n) { |