提交 4e8f1e64 编写于 作者: K kvn

6992789: assert(phi->_idx >= nodes_size()) failed: only new Phi per instance memory slice

Summary: Swap checks: check for regular memory slice first and keep input phi.
Reviewed-by: never
上级 be6bdedc
...@@ -594,7 +594,7 @@ bool ConnectionGraph::split_AddP(Node *addp, Node *base, PhaseGVN *igvn) { ...@@ -594,7 +594,7 @@ bool ConnectionGraph::split_AddP(Node *addp, Node *base, PhaseGVN *igvn) {
// //
// Create a new version of orig_phi if necessary. Returns either the newly // Create a new version of orig_phi if necessary. Returns either the newly
// created phi or an existing phi. Sets create_new to indicate wheter a new // created phi or an existing phi. Sets create_new to indicate whether a new
// phi was created. Cache the last newly created phi in the node map. // phi was created. Cache the last newly created phi in the node map.
// //
PhiNode *ConnectionGraph::create_split_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *> &orig_phi_worklist, PhaseGVN *igvn, bool &new_created) { PhiNode *ConnectionGraph::create_split_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *> &orig_phi_worklist, PhaseGVN *igvn, bool &new_created) {
...@@ -649,7 +649,7 @@ PhiNode *ConnectionGraph::create_split_phi(PhiNode *orig_phi, int alias_idx, Gro ...@@ -649,7 +649,7 @@ PhiNode *ConnectionGraph::create_split_phi(PhiNode *orig_phi, int alias_idx, Gro
} }
// //
// Return a new version of Memory Phi "orig_phi" with the inputs having the // Return a new version of Memory Phi "orig_phi" with the inputs having the
// specified alias index. // specified alias index.
// //
PhiNode *ConnectionGraph::split_memory_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *> &orig_phi_worklist, PhaseGVN *igvn) { PhiNode *ConnectionGraph::split_memory_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *> &orig_phi_worklist, PhaseGVN *igvn) {
...@@ -828,11 +828,15 @@ Node* ConnectionGraph::find_inst_mem(Node *orig_mem, int alias_idx, GrowableArra ...@@ -828,11 +828,15 @@ Node* ConnectionGraph::find_inst_mem(Node *orig_mem, int alias_idx, GrowableArra
break; // hit one of our sentinels break; // hit one of our sentinels
if (result->is_Mem()) { if (result->is_Mem()) {
const Type *at = phase->type(result->in(MemNode::Address)); const Type *at = phase->type(result->in(MemNode::Address));
if (at != Type::TOP) { if (at == Type::TOP)
assert (at->isa_ptr() != NULL, "pointer type required."); break; // Dead
int idx = C->get_alias_index(at->is_ptr()); assert (at->isa_ptr() != NULL, "pointer type required.");
if (idx == alias_idx) int idx = C->get_alias_index(at->is_ptr());
break; if (idx == alias_idx)
break; // Found
if (!is_instance && (at->isa_oopptr() == NULL ||
!at->is_oopptr()->is_known_instance())) {
break; // Do not skip store to general memory slice.
} }
result = result->in(MemNode::Memory); result = result->in(MemNode::Memory);
} }
...@@ -902,13 +906,13 @@ Node* ConnectionGraph::find_inst_mem(Node *orig_mem, int alias_idx, GrowableArra ...@@ -902,13 +906,13 @@ Node* ConnectionGraph::find_inst_mem(Node *orig_mem, int alias_idx, GrowableArra
PhiNode *mphi = result->as_Phi(); PhiNode *mphi = result->as_Phi();
assert(mphi->bottom_type() == Type::MEMORY, "memory phi required"); assert(mphi->bottom_type() == Type::MEMORY, "memory phi required");
const TypePtr *t = mphi->adr_type(); const TypePtr *t = mphi->adr_type();
if (C->get_alias_index(t) != alias_idx) { if (!is_instance) {
// Create a new Phi with the specified alias index type.
result = split_memory_phi(mphi, alias_idx, orig_phis, phase);
} else if (!is_instance) {
// Push all non-instance Phis on the orig_phis worklist to update inputs // Push all non-instance Phis on the orig_phis worklist to update inputs
// during Phase 4 if needed. // during Phase 4 if needed.
orig_phis.append_if_missing(mphi); orig_phis.append_if_missing(mphi);
} else if (C->get_alias_index(t) != alias_idx) {
// Create a new Phi with the specified alias index type.
result = split_memory_phi(mphi, alias_idx, orig_phis, phase);
} }
} }
// the result is either MemNode, PhiNode, InitializeNode. // the result is either MemNode, PhiNode, InitializeNode.
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册