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 237 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); | 248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); |
249 } | 249 } |
250 | 250 |
251 | 251 |
252 void BytecodeGraphBuilder::VisitLdaGlobal( | 252 void BytecodeGraphBuilder::VisitLdaGlobal( |
253 const interpreter::BytecodeArrayIterator& iterator) { | 253 const interpreter::BytecodeArrayIterator& iterator) { |
254 UNIMPLEMENTED(); | 254 UNIMPLEMENTED(); |
255 } | 255 } |
256 | 256 |
257 | 257 |
258 void BytecodeGraphBuilder::VisitStaGlobal( | 258 void BytecodeGraphBuilder::VisitStaGlobalSloppy( |
259 const interpreter::BytecodeArrayIterator& iterator) { | 259 const interpreter::BytecodeArrayIterator& iterator) { |
260 UNIMPLEMENTED(); | 260 UNIMPLEMENTED(); |
261 } | 261 } |
| 262 |
| 263 |
| 264 void BytecodeGraphBuilder::VisitStaGlobalStrict( |
| 265 const interpreter::BytecodeArrayIterator& iterator) { |
| 266 UNIMPLEMENTED(); |
| 267 } |
262 | 268 |
263 | 269 |
264 void BytecodeGraphBuilder::VisitLdaContextSlot( | 270 void BytecodeGraphBuilder::VisitLdaContextSlot( |
265 const interpreter::BytecodeArrayIterator& iterator) { | 271 const interpreter::BytecodeArrayIterator& iterator) { |
266 UNIMPLEMENTED(); | 272 UNIMPLEMENTED(); |
267 } | 273 } |
268 | 274 |
269 | 275 |
270 void BytecodeGraphBuilder::VisitLoadICSloppy( | 276 void BytecodeGraphBuilder::VisitLoadICSloppy( |
271 const interpreter::BytecodeArrayIterator& iterator) { | 277 const interpreter::BytecodeArrayIterator& iterator) { |
(...skipping 416 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 |