equal
deleted
inserted
replaced
1115 Node* n = unique_out(); |
1115 Node* n = unique_out(); |
1116 int op = Opcode(); |
1116 int op = Opcode(); |
1117 if (this->is_Store()) { |
1117 if (this->is_Store()) { |
1118 // Condition for back-to-back stores folding. |
1118 // Condition for back-to-back stores folding. |
1119 return n->Opcode() == op && n->in(MemNode::Memory) == this; |
1119 return n->Opcode() == op && n->in(MemNode::Memory) == this; |
1120 } else if (this->is_Load()) { |
1120 } else if (this->is_Load() || this->is_DecodeN()) { |
1121 // Condition for removing an unused LoadNode from the MemBarAcquire precedence input |
1121 // Condition for removing an unused LoadNode or DecodeNNode from the MemBarAcquire precedence input |
1122 return n->Opcode() == Op_MemBarAcquire; |
1122 return n->Opcode() == Op_MemBarAcquire; |
1123 } else if (op == Op_AddL) { |
1123 } else if (op == Op_AddL) { |
1124 // Condition for convL2I(addL(x,y)) ==> addI(convL2I(x),convL2I(y)) |
1124 // Condition for convL2I(addL(x,y)) ==> addI(convL2I(x),convL2I(y)) |
1125 return n->Opcode() == Op_ConvL2I && n->in(1) == this; |
1125 return n->Opcode() == Op_ConvL2I && n->in(1) == this; |
1126 } else if (op == Op_SubI || op == Op_SubL) { |
1126 } else if (op == Op_SubI || op == Op_SubL) { |