| OLD | NEW |
| 1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "src/compiler/bytecode-graph-builder.h" | 5 #include "src/compiler/bytecode-graph-builder.h" |
| 6 | 6 |
| 7 #include "src/compiler/linkage.h" | 7 #include "src/compiler/linkage.h" |
| 8 #include "src/compiler/operator-properties.h" | 8 #include "src/compiler/operator-properties.h" |
| 9 #include "src/interpreter/bytecode-array-iterator.h" | 9 #include "src/interpreter/bytecode-array-iterator.h" |
| 10 | 10 |
| (...skipping 297 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 308 UNIMPLEMENTED(); | 308 UNIMPLEMENTED(); |
| 309 } | 309 } |
| 310 | 310 |
| 311 | 311 |
| 312 void BytecodeGraphBuilder::VisitKeyedStoreICStrict( | 312 void BytecodeGraphBuilder::VisitKeyedStoreICStrict( |
| 313 const interpreter::BytecodeArrayIterator& iterator) { | 313 const interpreter::BytecodeArrayIterator& iterator) { |
| 314 UNIMPLEMENTED(); | 314 UNIMPLEMENTED(); |
| 315 } | 315 } |
| 316 | 316 |
| 317 | 317 |
| 318 void BytecodeGraphBuilder::VisitCreateClosure( | 318 void BytecodeGraphBuilder::VisitKeyedStoreICGeneric( |
| 319 const interpreter::BytecodeArrayIterator& iterator) { | 319 const interpreter::BytecodeArrayIterator& iterator) { |
| 320 UNIMPLEMENTED(); | 320 UNIMPLEMENTED(); |
| 321 } | 321 } |
| 322 | 322 |
| 323 | 323 |
| 324 void BytecodeGraphBuilder::VisitPushContext( | 324 void BytecodeGraphBuilder::VisitPushContext( |
| 325 const interpreter::BytecodeArrayIterator& iterator) { | 325 const interpreter::BytecodeArrayIterator& iterator) { |
| 326 UNIMPLEMENTED(); | 326 UNIMPLEMENTED(); |
| 327 } | 327 } |
| 328 | 328 |
| 329 | 329 |
| 330 void BytecodeGraphBuilder::VisitPopContext( | 330 void BytecodeGraphBuilder::VisitPopContext( |
| 331 const interpreter::BytecodeArrayIterator& iterator) { | 331 const interpreter::BytecodeArrayIterator& iterator) { |
| 332 UNIMPLEMENTED(); | 332 UNIMPLEMENTED(); |
| 333 } | 333 } |
| 334 | 334 |
| 335 | 335 |
| 336 void BytecodeGraphBuilder::VisitCreateClosure( |
| 337 const interpreter::BytecodeArrayIterator& iterator) { |
| 338 UNIMPLEMENTED(); |
| 339 } |
| 340 |
| 341 |
| 336 void BytecodeGraphBuilder::VisitCreateArrayLiteral( | 342 void BytecodeGraphBuilder::VisitCreateArrayLiteral( |
| 337 const interpreter::BytecodeArrayIterator& iterator) { | 343 const interpreter::BytecodeArrayIterator& iterator) { |
| 338 UNIMPLEMENTED(); | 344 UNIMPLEMENTED(); |
| 339 } | 345 } |
| 340 | 346 |
| 341 | 347 |
| 342 void BytecodeGraphBuilder::VisitKeyedStoreICGeneric( | 348 void BytecodeGraphBuilder::VisitCreateObjectLiteral( |
| 343 const interpreter::BytecodeArrayIterator& iterator) { | 349 const interpreter::BytecodeArrayIterator& iterator) { |
| 344 UNIMPLEMENTED(); | 350 UNIMPLEMENTED(); |
| 345 } | 351 } |
| 346 | 352 |
| 347 | 353 |
| 348 void BytecodeGraphBuilder::VisitCall( | 354 void BytecodeGraphBuilder::VisitCall( |
| 349 const interpreter::BytecodeArrayIterator& iterator) { | 355 const interpreter::BytecodeArrayIterator& iterator) { |
| 350 UNIMPLEMENTED(); | 356 UNIMPLEMENTED(); |
| 351 } | 357 } |
| 352 | 358 |
| (...skipping 153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 506 } | 512 } |
| 507 | 513 |
| 508 | 514 |
| 509 void BytecodeGraphBuilder::VisitTestInstanceOf( | 515 void BytecodeGraphBuilder::VisitTestInstanceOf( |
| 510 const interpreter::BytecodeArrayIterator& iterator) { | 516 const interpreter::BytecodeArrayIterator& iterator) { |
| 511 UNIMPLEMENTED(); | 517 UNIMPLEMENTED(); |
| 512 } | 518 } |
| 513 | 519 |
| 514 | 520 |
| 515 void BytecodeGraphBuilder::VisitToBoolean( | 521 void BytecodeGraphBuilder::VisitToBoolean( |
| 516 const interpreter::BytecodeArrayIterator& ToBoolean) { | 522 const interpreter::BytecodeArrayIterator& iterator) { |
| 517 UNIMPLEMENTED(); | 523 UNIMPLEMENTED(); |
| 518 } | 524 } |
| 519 | 525 |
| 526 |
| 527 void BytecodeGraphBuilder::VisitToName( |
| 528 const interpreter::BytecodeArrayIterator& iterator) { |
| 529 UNIMPLEMENTED(); |
| 530 } |
| 531 |
| 520 | 532 |
| 521 void BytecodeGraphBuilder::VisitJump( | 533 void BytecodeGraphBuilder::VisitJump( |
| 522 const interpreter::BytecodeArrayIterator& iterator) { | 534 const interpreter::BytecodeArrayIterator& iterator) { |
| 523 UNIMPLEMENTED(); | 535 UNIMPLEMENTED(); |
| 524 } | 536 } |
| 525 | 537 |
| 526 | 538 |
| 527 void BytecodeGraphBuilder::VisitJumpConstant( | 539 void BytecodeGraphBuilder::VisitJumpConstant( |
| 528 const interpreter::BytecodeArrayIterator& iterator) { | 540 const interpreter::BytecodeArrayIterator& iterator) { |
| 529 UNIMPLEMENTED(); | 541 UNIMPLEMENTED(); |
| (...skipping 128 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 658 | 670 |
| 659 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 671 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 660 if (environment()->IsMarkedAsUnreachable()) return; | 672 if (environment()->IsMarkedAsUnreachable()) return; |
| 661 environment()->MarkAsUnreachable(); | 673 environment()->MarkAsUnreachable(); |
| 662 exit_controls_.push_back(exit); | 674 exit_controls_.push_back(exit); |
| 663 } | 675 } |
| 664 | 676 |
| 665 } // namespace compiler | 677 } // namespace compiler |
| 666 } // namespace internal | 678 } // namespace internal |
| 667 } // namespace v8 | 679 } // namespace v8 |
| OLD | NEW |