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::VisitKeyedStoreICGeneric( |
| 319 const interpreter::BytecodeArrayIterator& iterator) { |
| 320 UNIMPLEMENTED(); |
| 321 } |
| 322 |
| 323 |
318 void BytecodeGraphBuilder::VisitPushContext( | 324 void BytecodeGraphBuilder::VisitPushContext( |
319 const interpreter::BytecodeArrayIterator& iterator) { | 325 const interpreter::BytecodeArrayIterator& iterator) { |
320 UNIMPLEMENTED(); | 326 UNIMPLEMENTED(); |
321 } | 327 } |
322 | 328 |
323 | 329 |
324 void BytecodeGraphBuilder::VisitPopContext( | 330 void BytecodeGraphBuilder::VisitPopContext( |
325 const interpreter::BytecodeArrayIterator& iterator) { | 331 const interpreter::BytecodeArrayIterator& iterator) { |
326 UNIMPLEMENTED(); | 332 UNIMPLEMENTED(); |
327 } | 333 } |
328 | 334 |
329 | 335 |
330 void BytecodeGraphBuilder::VisitCreateClosure( | 336 void BytecodeGraphBuilder::VisitCreateClosure( |
331 const interpreter::BytecodeArrayIterator& iterator) { | 337 const interpreter::BytecodeArrayIterator& iterator) { |
332 UNIMPLEMENTED(); | 338 UNIMPLEMENTED(); |
333 } | 339 } |
334 | 340 |
335 | 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 117 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
470 } | 476 } |
471 | 477 |
472 | 478 |
473 void BytecodeGraphBuilder::VisitTestInstanceOf( | 479 void BytecodeGraphBuilder::VisitTestInstanceOf( |
474 const interpreter::BytecodeArrayIterator& iterator) { | 480 const interpreter::BytecodeArrayIterator& iterator) { |
475 UNIMPLEMENTED(); | 481 UNIMPLEMENTED(); |
476 } | 482 } |
477 | 483 |
478 | 484 |
479 void BytecodeGraphBuilder::VisitToBoolean( | 485 void BytecodeGraphBuilder::VisitToBoolean( |
480 const interpreter::BytecodeArrayIterator& ToBoolean) { | 486 const interpreter::BytecodeArrayIterator& iterator) { |
481 UNIMPLEMENTED(); | 487 UNIMPLEMENTED(); |
482 } | 488 } |
483 | 489 |
| 490 |
| 491 void BytecodeGraphBuilder::VisitToName( |
| 492 const interpreter::BytecodeArrayIterator& iterator) { |
| 493 UNIMPLEMENTED(); |
| 494 } |
| 495 |
484 | 496 |
485 void BytecodeGraphBuilder::VisitJump( | 497 void BytecodeGraphBuilder::VisitJump( |
486 const interpreter::BytecodeArrayIterator& iterator) { | 498 const interpreter::BytecodeArrayIterator& iterator) { |
487 UNIMPLEMENTED(); | 499 UNIMPLEMENTED(); |
488 } | 500 } |
489 | 501 |
490 | 502 |
491 void BytecodeGraphBuilder::VisitJumpConstant( | 503 void BytecodeGraphBuilder::VisitJumpConstant( |
492 const interpreter::BytecodeArrayIterator& iterator) { | 504 const interpreter::BytecodeArrayIterator& iterator) { |
493 UNIMPLEMENTED(); | 505 UNIMPLEMENTED(); |
(...skipping 128 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
622 | 634 |
623 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 635 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
624 if (environment()->IsMarkedAsUnreachable()) return; | 636 if (environment()->IsMarkedAsUnreachable()) return; |
625 environment()->MarkAsUnreachable(); | 637 environment()->MarkAsUnreachable(); |
626 exit_controls_.push_back(exit); | 638 exit_controls_.push_back(exit); |
627 } | 639 } |
628 | 640 |
629 } // namespace compiler | 641 } // namespace compiler |
630 } // namespace internal | 642 } // namespace internal |
631 } // namespace v8 | 643 } // namespace v8 |
OLD | NEW |