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 350 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
361 UNIMPLEMENTED(); | 361 UNIMPLEMENTED(); |
362 } | 362 } |
363 | 363 |
364 | 364 |
365 void BytecodeGraphBuilder::VisitTestGreaterThan( | 365 void BytecodeGraphBuilder::VisitTestGreaterThan( |
366 const interpreter::BytecodeArrayIterator& iterator) { | 366 const interpreter::BytecodeArrayIterator& iterator) { |
367 UNIMPLEMENTED(); | 367 UNIMPLEMENTED(); |
368 } | 368 } |
369 | 369 |
370 | 370 |
371 void BytecodeGraphBuilder::VisitTestLessThanEqual( | 371 void BytecodeGraphBuilder::VisitTestLessThanOrEqual( |
372 const interpreter::BytecodeArrayIterator& iterator) { | 372 const interpreter::BytecodeArrayIterator& iterator) { |
373 UNIMPLEMENTED(); | 373 UNIMPLEMENTED(); |
374 } | 374 } |
375 | 375 |
376 | 376 |
377 void BytecodeGraphBuilder::VisitTestGreaterThanEqual( | 377 void BytecodeGraphBuilder::VisitTestGreaterThanOrEqual( |
378 const interpreter::BytecodeArrayIterator& iterator) { | 378 const interpreter::BytecodeArrayIterator& iterator) { |
379 UNIMPLEMENTED(); | 379 UNIMPLEMENTED(); |
380 } | 380 } |
381 | 381 |
382 | 382 |
383 void BytecodeGraphBuilder::VisitTestIn( | 383 void BytecodeGraphBuilder::VisitTestIn( |
384 const interpreter::BytecodeArrayIterator& iterator) { | 384 const interpreter::BytecodeArrayIterator& iterator) { |
385 UNIMPLEMENTED(); | 385 UNIMPLEMENTED(); |
386 } | 386 } |
387 | 387 |
(...skipping 150 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
538 | 538 |
539 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 539 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
540 if (environment()->IsMarkedAsUnreachable()) return; | 540 if (environment()->IsMarkedAsUnreachable()) return; |
541 environment()->MarkAsUnreachable(); | 541 environment()->MarkAsUnreachable(); |
542 exit_controls_.push_back(exit); | 542 exit_controls_.push_back(exit); |
543 } | 543 } |
544 | 544 |
545 } // namespace compiler | 545 } // namespace compiler |
546 } // namespace internal | 546 } // namespace internal |
547 } // namespace v8 | 547 } // namespace v8 |
OLD | NEW |