stan/jdk-24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

8252496: C2: Useless code in MergeMemNode::Ideal

Browse Source 
Reviewed-by: thartmann, chagedorn, vlivanov
This commit is contained in:
Emanuel Peter 2022-02-10 09:29:53 +00:00 committed by Tobias Hartmann
parent 7218d8449b
commit fa0a72c030
1 changed files with 0 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
src/hotspot/share/opto/memnode.cpp
View File

@ -4752,29 +4752,6 @@ Node *MergeMemNode::Ideal(PhaseGVN *phase, bool can_reshape) {
// the base memory might contribute new slices beyond my req()
if (old_mbase) grow_to_match(old_mbase);
// Look carefully at the base node if it is a phi.
PhiNode* phi_base;
if (new_base != NULL && new_base->is_Phi())
phi_base = new_base->as_Phi();
else
phi_base = NULL;
Node* phi_reg = NULL;
uint phi_len = (uint)-1;
if (phi_base != NULL) {
phi_reg = phi_base->region();
phi_len = phi_base->req();
// see if the phi is unfinished
for (uint i = 1; i < phi_len; i++) {
if (phi_base->in(i) == NULL) {
// incomplete phi; do not look at it yet!
phi_reg = NULL;
phi_len = (uint)-1;
break;
}
}
}
// Note: We do not call verify_sparse on entry, because inputs
// can normalize to the base_memory via subsume_node or similar
// mechanisms. This method repairs that damage.
@ -4975,7 +4952,6 @@ Node* MergeMemNode::memory_at(uint alias_idx) const {
// Otherwise, it is a narrow slice.
Node* n = alias_idx < req() ? in(alias_idx) : empty_memory();
Compile *C = Compile::current();
if (is_empty_memory(n)) {
// the array is sparse; empty slots are the "top" node
n = base_memory();