equal
deleted
inserted
replaced
1787 } |
1787 } |
1788 |
1788 |
1789 #ifdef _LP64 |
1789 #ifdef _LP64 |
1790 // Push DecodeN down through phi. |
1790 // Push DecodeN down through phi. |
1791 // The rest of phi graph will transform by split EncodeP node though phis up. |
1791 // The rest of phi graph will transform by split EncodeP node though phis up. |
1792 if (UseCompressedOops && can_reshape && progress == NULL) { |
1792 if (UseNewCode && UseCompressedOops && can_reshape && progress == NULL) { |
1793 bool may_push = true; |
1793 bool may_push = true; |
1794 bool has_decodeN = false; |
1794 bool has_decodeN = false; |
1795 Node* in_decodeN = NULL; |
1795 Node* in_decodeN = NULL; |
1796 for (uint i=1; i<req(); ++i) {// For all paths in |
1796 for (uint i=1; i<req(); ++i) {// For all paths in |
1797 Node *ii = in(i); |
1797 Node *ii = in(i); |