| Index: src/compiler/bytecode-graph-builder.cc
|
| diff --git a/src/compiler/bytecode-graph-builder.cc b/src/compiler/bytecode-graph-builder.cc
|
| index 2d0ffa19a3594f2e40723e79bcb775c87f55c69b..20214a5bd4bfd5c15d3c0962913c7aeb959e98fb 100644
|
| --- a/src/compiler/bytecode-graph-builder.cc
|
| +++ b/src/compiler/bytecode-graph-builder.cc
|
| @@ -332,6 +332,108 @@ void BytecodeGraphBuilder::VisitMod(
|
| }
|
|
|
|
|
| +void BytecodeGraphBuilder::VisitTestEqual(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestNotEqual(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestEqualStrict(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestNotEqualStrict(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestLessThan(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestGreaterThan(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestLessThanEqual(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestGreaterThanEqual(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestIn(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitTestInstanceOf(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitToBoolean(
|
| + const interpreter::BytecodeArrayIterator& ToBoolean) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitJump(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitJumpConstant(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitJumpIfTrue(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitJumpIfTrueConstant(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitJumpIfFalse(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| +void BytecodeGraphBuilder::VisitJumpIfFalseConstant(
|
| + const interpreter::BytecodeArrayIterator& iterator) {
|
| + UNIMPLEMENTED();
|
| +}
|
| +
|
| +
|
| void BytecodeGraphBuilder::VisitReturn(
|
| const interpreter::BytecodeArrayIterator& iterator) {
|
| Node* control =
|
|
|