| Index: src/compiler/common-operator-reducer.cc
|
| diff --git a/src/compiler/common-operator-reducer.cc b/src/compiler/common-operator-reducer.cc
|
| index 9a368162ef6e33158836a81eb5409d9117059cf6..c5ced20373afe9574ec1c4f81136019d00eee651 100644
|
| --- a/src/compiler/common-operator-reducer.cc
|
| +++ b/src/compiler/common-operator-reducer.cc
|
| @@ -284,7 +284,7 @@
|
|
|
| Reduction CommonOperatorReducer::ReduceReturn(Node* node) {
|
| DCHECK_EQ(IrOpcode::kReturn, node->opcode());
|
| - Node* const value = node->InputAt(1);
|
| + Node* const value = node->InputAt(0);
|
| Node* effect = NodeProperties::GetEffectInput(node);
|
| Node* const control = NodeProperties::GetControlInput(node);
|
| bool changed = false;
|
| @@ -311,9 +311,8 @@
|
| // {end} as revisit, because we mark {node} as {Dead} below, which was
|
| // previously connected to {end}, so we know for sure that at some point
|
| // the reducer logic will visit {end} again.
|
| - Node* ret = graph()->NewNode(common()->Return(), node->InputAt(0),
|
| - value->InputAt(i), effect->InputAt(i),
|
| - control->InputAt(i));
|
| + Node* ret = graph()->NewNode(common()->Return(), value->InputAt(i),
|
| + effect->InputAt(i), control->InputAt(i));
|
| NodeProperties::MergeControlToEnd(graph(), common(), ret);
|
| }
|
| // Mark the merge {control} and return {node} as {dead}.
|
|
|