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 320 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
331 BuildBinaryOp(javascript()->Divide(language_mode()), iterator); | 331 BuildBinaryOp(javascript()->Divide(language_mode()), iterator); |
332 } | 332 } |
333 | 333 |
334 | 334 |
335 void BytecodeGraphBuilder::VisitMod( | 335 void BytecodeGraphBuilder::VisitMod( |
336 const interpreter::BytecodeArrayIterator& iterator) { | 336 const interpreter::BytecodeArrayIterator& iterator) { |
337 BuildBinaryOp(javascript()->Modulus(language_mode()), iterator); | 337 BuildBinaryOp(javascript()->Modulus(language_mode()), iterator); |
338 } | 338 } |
339 | 339 |
340 | 340 |
| 341 void BytecodeGraphBuilder::VisitLogicalNot( |
| 342 const interpreter::BytecodeArrayIterator& iterator) { |
| 343 UNIMPLEMENTED(); |
| 344 } |
| 345 |
| 346 |
| 347 void BytecodeGraphBuilder::VisitTypeOf( |
| 348 const interpreter::BytecodeArrayIterator& iterator) { |
| 349 UNIMPLEMENTED(); |
| 350 } |
| 351 |
| 352 |
341 void BytecodeGraphBuilder::VisitTestEqual( | 353 void BytecodeGraphBuilder::VisitTestEqual( |
342 const interpreter::BytecodeArrayIterator& iterator) { | 354 const interpreter::BytecodeArrayIterator& iterator) { |
343 UNIMPLEMENTED(); | 355 UNIMPLEMENTED(); |
344 } | 356 } |
345 | 357 |
346 | 358 |
347 void BytecodeGraphBuilder::VisitTestNotEqual( | 359 void BytecodeGraphBuilder::VisitTestNotEqual( |
348 const interpreter::BytecodeArrayIterator& iterator) { | 360 const interpreter::BytecodeArrayIterator& iterator) { |
349 UNIMPLEMENTED(); | 361 UNIMPLEMENTED(); |
350 } | 362 } |
(...skipping 193 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
544 | 556 |
545 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 557 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
546 if (environment()->IsMarkedAsUnreachable()) return; | 558 if (environment()->IsMarkedAsUnreachable()) return; |
547 environment()->MarkAsUnreachable(); | 559 environment()->MarkAsUnreachable(); |
548 exit_controls_.push_back(exit); | 560 exit_controls_.push_back(exit); |
549 } | 561 } |
550 | 562 |
551 } // namespace compiler | 563 } // namespace compiler |
552 } // namespace internal | 564 } // namespace internal |
553 } // namespace v8 | 565 } // namespace v8 |
OLD | NEW |