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 231 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
242 } | 242 } |
243 | 243 |
244 | 244 |
245 void BytecodeGraphBuilder::VisitStar( | 245 void BytecodeGraphBuilder::VisitStar( |
246 const interpreter::BytecodeArrayIterator& iterator) { | 246 const interpreter::BytecodeArrayIterator& iterator) { |
247 Node* value = environment()->LookupAccumulator(); | 247 Node* value = environment()->LookupAccumulator(); |
248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); | 248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); |
249 } | 249 } |
250 | 250 |
251 | 251 |
| 252 void BytecodeGraphBuilder::VisitLdaGlobal( |
| 253 const interpreter::BytecodeArrayIterator& iterator) { |
| 254 UNIMPLEMENTED(); |
| 255 } |
| 256 |
| 257 |
252 void BytecodeGraphBuilder::VisitLoadIC( | 258 void BytecodeGraphBuilder::VisitLoadIC( |
253 const interpreter::BytecodeArrayIterator& iterator) { | 259 const interpreter::BytecodeArrayIterator& iterator) { |
254 UNIMPLEMENTED(); | 260 UNIMPLEMENTED(); |
255 } | 261 } |
256 | 262 |
257 | 263 |
258 void BytecodeGraphBuilder::VisitKeyedLoadIC( | 264 void BytecodeGraphBuilder::VisitKeyedLoadIC( |
259 const interpreter::BytecodeArrayIterator& iterator) { | 265 const interpreter::BytecodeArrayIterator& iterator) { |
260 UNIMPLEMENTED(); | 266 UNIMPLEMENTED(); |
261 } | 267 } |
(...skipping 168 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
430 | 436 |
431 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 437 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
432 if (environment()->IsMarkedAsUnreachable()) return; | 438 if (environment()->IsMarkedAsUnreachable()) return; |
433 environment()->MarkAsUnreachable(); | 439 environment()->MarkAsUnreachable(); |
434 exit_controls_.push_back(exit); | 440 exit_controls_.push_back(exit); |
435 } | 441 } |
436 | 442 |
437 } // namespace compiler | 443 } // namespace compiler |
438 } // namespace internal | 444 } // namespace internal |
439 } // namespace v8 | 445 } // namespace v8 |
OLD | NEW |