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 290 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
301 int frame_state_count = | 301 int frame_state_count = |
302 OperatorProperties::GetFrameStateInputCount(node->op()); | 302 OperatorProperties::GetFrameStateInputCount(node->op()); |
303 for (int i = 0; i < frame_state_count; i++) { | 303 for (int i = 0; i < frame_state_count; i++) { |
304 NodeProperties::ReplaceFrameStateInput(node, i, | 304 NodeProperties::ReplaceFrameStateInput(node, i, |
305 jsgraph()->EmptyFrameState()); | 305 jsgraph()->EmptyFrameState()); |
306 } | 306 } |
307 environment()->BindAccumulator(node); | 307 environment()->BindAccumulator(node); |
308 } | 308 } |
309 | 309 |
310 | 310 |
| 311 void BytecodeGraphBuilder::VisitBitwiseOr( |
| 312 const interpreter::BytecodeArrayIterator& iterator) { |
| 313 BuildBinaryOp(javascript()->BitwiseOr(language_mode()), iterator); |
| 314 } |
| 315 |
| 316 |
| 317 void BytecodeGraphBuilder::VisitBitwiseXor( |
| 318 const interpreter::BytecodeArrayIterator& iterator) { |
| 319 BuildBinaryOp(javascript()->BitwiseXor(language_mode()), iterator); |
| 320 } |
| 321 |
| 322 |
| 323 void BytecodeGraphBuilder::VisitBitwiseAnd( |
| 324 const interpreter::BytecodeArrayIterator& iterator) { |
| 325 BuildBinaryOp(javascript()->BitwiseAnd(language_mode()), iterator); |
| 326 } |
| 327 |
| 328 |
311 void BytecodeGraphBuilder::VisitAdd( | 329 void BytecodeGraphBuilder::VisitAdd( |
312 const interpreter::BytecodeArrayIterator& iterator) { | 330 const interpreter::BytecodeArrayIterator& iterator) { |
313 BuildBinaryOp(javascript()->Add(language_mode()), iterator); | 331 BuildBinaryOp(javascript()->Add(language_mode()), iterator); |
314 } | 332 } |
315 | 333 |
316 | 334 |
317 void BytecodeGraphBuilder::VisitSub( | 335 void BytecodeGraphBuilder::VisitSub( |
318 const interpreter::BytecodeArrayIterator& iterator) { | 336 const interpreter::BytecodeArrayIterator& iterator) { |
319 BuildBinaryOp(javascript()->Subtract(language_mode()), iterator); | 337 BuildBinaryOp(javascript()->Subtract(language_mode()), iterator); |
320 } | 338 } |
(...skipping 223 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
544 | 562 |
545 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 563 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
546 if (environment()->IsMarkedAsUnreachable()) return; | 564 if (environment()->IsMarkedAsUnreachable()) return; |
547 environment()->MarkAsUnreachable(); | 565 environment()->MarkAsUnreachable(); |
548 exit_controls_.push_back(exit); | 566 exit_controls_.push_back(exit); |
549 } | 567 } |
550 | 568 |
551 } // namespace compiler | 569 } // namespace compiler |
552 } // namespace internal | 570 } // namespace internal |
553 } // namespace v8 | 571 } // namespace v8 |
OLD | NEW |