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 238 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
249 } | 249 } |
250 | 250 |
251 | 251 |
252 void BytecodeGraphBuilder::VisitStar( | 252 void BytecodeGraphBuilder::VisitStar( |
253 const interpreter::BytecodeArrayIterator& iterator) { | 253 const interpreter::BytecodeArrayIterator& iterator) { |
254 Node* value = environment()->LookupAccumulator(); | 254 Node* value = environment()->LookupAccumulator(); |
255 environment()->BindRegister(iterator.GetRegisterOperand(0), value); | 255 environment()->BindRegister(iterator.GetRegisterOperand(0), value); |
256 } | 256 } |
257 | 257 |
258 | 258 |
| 259 void BytecodeGraphBuilder::VisitMov( |
| 260 const interpreter::BytecodeArrayIterator& iterator) { |
| 261 Node* value = environment()->LookupRegister(iterator.GetRegisterOperand(0)); |
| 262 environment()->BindRegister(iterator.GetRegisterOperand(1), value); |
| 263 } |
| 264 |
| 265 |
259 void BytecodeGraphBuilder::VisitLdaGlobalSloppy( | 266 void BytecodeGraphBuilder::VisitLdaGlobalSloppy( |
260 const interpreter::BytecodeArrayIterator& iterator) { | 267 const interpreter::BytecodeArrayIterator& iterator) { |
261 UNIMPLEMENTED(); | 268 UNIMPLEMENTED(); |
262 } | 269 } |
263 | 270 |
264 | 271 |
265 void BytecodeGraphBuilder::VisitLdaGlobalStrict( | 272 void BytecodeGraphBuilder::VisitLdaGlobalStrict( |
266 const interpreter::BytecodeArrayIterator& iterator) { | 273 const interpreter::BytecodeArrayIterator& iterator) { |
267 UNIMPLEMENTED(); | 274 UNIMPLEMENTED(); |
268 } | 275 } |
(...skipping 653 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
922 | 929 |
923 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 930 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
924 if (environment()->IsMarkedAsUnreachable()) return; | 931 if (environment()->IsMarkedAsUnreachable()) return; |
925 environment()->MarkAsUnreachable(); | 932 environment()->MarkAsUnreachable(); |
926 exit_controls_.push_back(exit); | 933 exit_controls_.push_back(exit); |
927 } | 934 } |
928 | 935 |
929 } // namespace compiler | 936 } // namespace compiler |
930 } // namespace internal | 937 } // namespace internal |
931 } // namespace v8 | 938 } // namespace v8 |
OLD | NEW |