Index: src/compiler/simplified-lowering.cc |
diff --git a/src/compiler/simplified-lowering.cc b/src/compiler/simplified-lowering.cc |
index 11c10469b739809107f67e39878ecf7429dfff03..f0fdb931a849cd6812dbeeb0958bbd4613224b9d 100644 |
--- a/src/compiler/simplified-lowering.cc |
+++ b/src/compiler/simplified-lowering.cc |
@@ -1531,14 +1531,11 @@ |
// BooleanNot(x: kRepBit) => Word32Equal(x, #0) |
node->AppendInput(jsgraph_->zone(), jsgraph_->Int32Constant(0)); |
NodeProperties::ChangeOp(node, lowering->machine()->Word32Equal()); |
- } else if (CanBeTaggedPointer(input_info->representation())) { |
+ } else { |
+ DCHECK(CanBeTaggedPointer(input_info->representation())); |
// BooleanNot(x: kRepTagged) => WordEqual(x, #false) |
node->AppendInput(jsgraph_->zone(), jsgraph_->FalseConstant()); |
NodeProperties::ChangeOp(node, lowering->machine()->WordEqual()); |
- } else { |
- DCHECK_EQ(MachineRepresentation::kNone, |
- input_info->representation()); |
- DeferReplacement(node, lowering->jsgraph()->Int32Constant(0)); |
} |
} else { |
// No input representation requirement; adapt during lowering. |
@@ -2782,13 +2779,8 @@ |
// We just get rid of the sigma here. In principle, it should be |
// possible to refine the truncation and representation based on |
// the sigma's type. |
- |
- // For now, we just handle specially the impossible case. |
MachineRepresentation output = |
- TypeOf(node)->IsInhabited() |
- ? GetOutputInfoForPhi(node, TypeOf(node->InputAt(0)), |
- truncation) |
- : MachineRepresentation::kNone; |
+ GetOutputInfoForPhi(node, TypeOf(node->InputAt(0)), truncation); |
VisitUnop(node, UseInfo(output, truncation), output); |
if (lower()) DeferReplacement(node, node->InputAt(0)); |
return; |