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 315 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
326 UNIMPLEMENTED(); | 326 UNIMPLEMENTED(); |
327 } | 327 } |
328 | 328 |
329 | 329 |
330 void BytecodeGraphBuilder::VisitCreateClosure( | 330 void BytecodeGraphBuilder::VisitCreateClosure( |
331 const interpreter::BytecodeArrayIterator& iterator) { | 331 const interpreter::BytecodeArrayIterator& iterator) { |
332 UNIMPLEMENTED(); | 332 UNIMPLEMENTED(); |
333 } | 333 } |
334 | 334 |
335 | 335 |
| 336 void BytecodeGraphBuilder::VisitCreateRegExpLiteral( |
| 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::VisitCreateObjectLiteral( | 348 void BytecodeGraphBuilder::VisitCreateObjectLiteral( |
343 const interpreter::BytecodeArrayIterator& iterator) { | 349 const interpreter::BytecodeArrayIterator& iterator) { |
344 UNIMPLEMENTED(); | 350 UNIMPLEMENTED(); |
345 } | 351 } |
(...skipping 342 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
688 | 694 |
689 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 695 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
690 if (environment()->IsMarkedAsUnreachable()) return; | 696 if (environment()->IsMarkedAsUnreachable()) return; |
691 environment()->MarkAsUnreachable(); | 697 environment()->MarkAsUnreachable(); |
692 exit_controls_.push_back(exit); | 698 exit_controls_.push_back(exit); |
693 } | 699 } |
694 | 700 |
695 } // namespace compiler | 701 } // namespace compiler |
696 } // namespace internal | 702 } // namespace internal |
697 } // namespace v8 | 703 } // namespace v8 |
OLD | NEW |