equal
deleted
inserted
replaced
1930 } |
1930 } |
1931 |
1931 |
1932 #ifdef _LP64 |
1932 #ifdef _LP64 |
1933 // Push DecodeN/DecodeNKlass down through phi. |
1933 // Push DecodeN/DecodeNKlass down through phi. |
1934 // The rest of phi graph will transform by split EncodeP node though phis up. |
1934 // The rest of phi graph will transform by split EncodeP node though phis up. |
1935 if ((UseCompressedOops || UseCompressedKlassPointers) && can_reshape && progress == NULL) { |
1935 if ((UseCompressedOops || UseCompressedClassPointers) && can_reshape && progress == NULL) { |
1936 bool may_push = true; |
1936 bool may_push = true; |
1937 bool has_decodeN = false; |
1937 bool has_decodeN = false; |
1938 bool is_decodeN = false; |
1938 bool is_decodeN = false; |
1939 for (uint i=1; i<req(); ++i) {// For all paths in |
1939 for (uint i=1; i<req(); ++i) {// For all paths in |
1940 Node *ii = in(i); |
1940 Node *ii = in(i); |