| Index: src/compiler/bytecode-graph-builder.cc
|
| diff --git a/src/compiler/bytecode-graph-builder.cc b/src/compiler/bytecode-graph-builder.cc
|
| index dfa3e66c34d7e59c4c5bb2df83b3d6df5cd411ba..38a0baf8587e9b9f1698461f5989e79fa99f02d6 100644
|
| --- a/src/compiler/bytecode-graph-builder.cc
|
| +++ b/src/compiler/bytecode-graph-builder.cc
|
| @@ -630,17 +630,9 @@ void BytecodeGraphBuilder::VisitMov(
|
| }
|
|
|
|
|
| -void BytecodeGraphBuilder::VisitExchange(
|
| +void BytecodeGraphBuilder::VisitMovWide(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| - environment()->ExchangeRegisters(iterator.GetRegisterOperand(0),
|
| - iterator.GetRegisterOperand(1));
|
| -}
|
| -
|
| -
|
| -void BytecodeGraphBuilder::VisitExchangeWide(
|
| - const interpreter::BytecodeArrayIterator& iterator) {
|
| - environment()->ExchangeRegisters(iterator.GetRegisterOperand(0),
|
| - iterator.GetRegisterOperand(1));
|
| + VisitMov(iterator);
|
| }
|
|
|
|
|
| @@ -1223,7 +1215,7 @@ void BytecodeGraphBuilder::VisitCallWide(
|
| }
|
|
|
|
|
| -void BytecodeGraphBuilder::VisitCallJSRuntime(
|
| +void BytecodeGraphBuilder::BuildCallJSRuntime(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| Node* callee = BuildLoadNativeContextField(iterator.GetIndexOperand(0));
|
| @@ -1238,6 +1230,18 @@ void BytecodeGraphBuilder::VisitCallJSRuntime(
|
| }
|
|
|
|
|
| +void BytecodeGraphBuilder::VisitCallJSRuntime(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallJSRuntime(iterator);
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitCallJSRuntimeWide(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallJSRuntime(iterator);
|
| +}
|
| +
|
| +
|
| Node* BytecodeGraphBuilder::ProcessCallRuntimeArguments(
|
| const Operator* call_runtime_op, interpreter::Register first_arg,
|
| size_t arity) {
|
| @@ -1252,7 +1256,7 @@ Node* BytecodeGraphBuilder::ProcessCallRuntimeArguments(
|
| }
|
|
|
|
|
| -void BytecodeGraphBuilder::VisitCallRuntime(
|
| +void BytecodeGraphBuilder::BuildCallRuntime(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| Runtime::FunctionId functionId =
|
| @@ -1267,7 +1271,19 @@ void BytecodeGraphBuilder::VisitCallRuntime(
|
| }
|
|
|
|
|
| -void BytecodeGraphBuilder::VisitCallRuntimeForPair(
|
| +void BytecodeGraphBuilder::VisitCallRuntime(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallRuntime(iterator);
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitCallRuntimeWide(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallRuntime(iterator);
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::BuildCallRuntimeForPair(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| Runtime::FunctionId functionId =
|
| @@ -1283,6 +1299,18 @@ void BytecodeGraphBuilder::VisitCallRuntimeForPair(
|
| }
|
|
|
|
|
| +void BytecodeGraphBuilder::VisitCallRuntimeForPair(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallRuntimeForPair(iterator);
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitCallRuntimeForPairWide(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallRuntimeForPair(iterator);
|
| +}
|
| +
|
| +
|
| Node* BytecodeGraphBuilder::ProcessCallNewArguments(
|
| const Operator* call_new_op, interpreter::Register callee,
|
| interpreter::Register first_arg, size_t arity) {
|
| @@ -1300,7 +1328,7 @@ Node* BytecodeGraphBuilder::ProcessCallNewArguments(
|
| }
|
|
|
|
|
| -void BytecodeGraphBuilder::VisitNew(
|
| +void BytecodeGraphBuilder::BuildCallConstruct(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| interpreter::Register callee = iterator.GetRegisterOperand(0);
|
| @@ -1315,6 +1343,18 @@ void BytecodeGraphBuilder::VisitNew(
|
| }
|
|
|
|
|
| +void BytecodeGraphBuilder::VisitNew(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallConstruct(iterator);
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitNewWide(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildCallConstruct(iterator);
|
| +}
|
| +
|
| +
|
| void BytecodeGraphBuilder::VisitThrow(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| @@ -1722,7 +1762,7 @@ void BytecodeGraphBuilder::VisitReturn(
|
| }
|
|
|
|
|
| -void BytecodeGraphBuilder::VisitForInPrepare(
|
| +void BytecodeGraphBuilder::BuildForInPrepare(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| Node* receiver = environment()->LookupAccumulator();
|
| @@ -1732,6 +1772,18 @@ void BytecodeGraphBuilder::VisitForInPrepare(
|
| }
|
|
|
|
|
| +void BytecodeGraphBuilder::VisitForInPrepare(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildForInPrepare(iterator);
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitForInPrepareWide(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildForInPrepare(iterator);
|
| +}
|
| +
|
| +
|
| void BytecodeGraphBuilder::VisitForInDone(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| @@ -1743,7 +1795,7 @@ void BytecodeGraphBuilder::VisitForInDone(
|
| }
|
|
|
|
|
| -void BytecodeGraphBuilder::VisitForInNext(
|
| +void BytecodeGraphBuilder::BuildForInNext(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
| Node* receiver =
|
| @@ -1761,6 +1813,18 @@ void BytecodeGraphBuilder::VisitForInNext(
|
| }
|
|
|
|
|
| +void BytecodeGraphBuilder::VisitForInNext(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildForInNext(iterator);
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitForInNextWide(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + BuildForInNext(iterator);
|
| +}
|
| +
|
| +
|
| void BytecodeGraphBuilder::VisitForInStep(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| FrameStateBeforeAndAfter states(this, iterator);
|
|
|