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 356 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
367 BuildBinaryOp(javascript()->Divide(language_mode()), iterator); | 367 BuildBinaryOp(javascript()->Divide(language_mode()), iterator); |
368 } | 368 } |
369 | 369 |
370 | 370 |
371 void BytecodeGraphBuilder::VisitMod( | 371 void BytecodeGraphBuilder::VisitMod( |
372 const interpreter::BytecodeArrayIterator& iterator) { | 372 const interpreter::BytecodeArrayIterator& iterator) { |
373 BuildBinaryOp(javascript()->Modulus(language_mode()), iterator); | 373 BuildBinaryOp(javascript()->Modulus(language_mode()), iterator); |
374 } | 374 } |
375 | 375 |
376 | 376 |
| 377 void BytecodeGraphBuilder::VisitBitwiseOr( |
| 378 const interpreter::BytecodeArrayIterator& iterator) { |
| 379 BuildBinaryOp(javascript()->BitwiseOr(language_mode()), iterator); |
| 380 } |
| 381 |
| 382 |
| 383 void BytecodeGraphBuilder::VisitBitwiseXor( |
| 384 const interpreter::BytecodeArrayIterator& iterator) { |
| 385 BuildBinaryOp(javascript()->BitwiseXor(language_mode()), iterator); |
| 386 } |
| 387 |
| 388 |
| 389 void BytecodeGraphBuilder::VisitBitwiseAnd( |
| 390 const interpreter::BytecodeArrayIterator& iterator) { |
| 391 BuildBinaryOp(javascript()->BitwiseAnd(language_mode()), iterator); |
| 392 } |
| 393 |
| 394 |
377 void BytecodeGraphBuilder::VisitShiftLeft( | 395 void BytecodeGraphBuilder::VisitShiftLeft( |
378 const interpreter::BytecodeArrayIterator& iterator) { | 396 const interpreter::BytecodeArrayIterator& iterator) { |
379 BuildBinaryOp(javascript()->ShiftLeft(language_mode()), iterator); | 397 BuildBinaryOp(javascript()->ShiftLeft(language_mode()), iterator); |
380 } | 398 } |
381 | 399 |
382 | 400 |
383 void BytecodeGraphBuilder::VisitShiftRight( | 401 void BytecodeGraphBuilder::VisitShiftRight( |
384 const interpreter::BytecodeArrayIterator& iterator) { | 402 const interpreter::BytecodeArrayIterator& iterator) { |
385 BuildBinaryOp(javascript()->ShiftRight(language_mode()), iterator); | 403 BuildBinaryOp(javascript()->ShiftRight(language_mode()), iterator); |
386 } | 404 } |
(...skipping 223 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
610 | 628 |
611 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 629 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
612 if (environment()->IsMarkedAsUnreachable()) return; | 630 if (environment()->IsMarkedAsUnreachable()) return; |
613 environment()->MarkAsUnreachable(); | 631 environment()->MarkAsUnreachable(); |
614 exit_controls_.push_back(exit); | 632 exit_controls_.push_back(exit); |
615 } | 633 } |
616 | 634 |
617 } // namespace compiler | 635 } // namespace compiler |
618 } // namespace internal | 636 } // namespace internal |
619 } // namespace v8 | 637 } // namespace v8 |
OLD | NEW |