Chromium Code Reviews| 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/bytecode-branch-analysis.h" | 7 #include "src/compiler/bytecode-branch-analysis.h" |
| 8 #include "src/compiler/linkage.h" | 8 #include "src/compiler/linkage.h" |
| 9 #include "src/compiler/operator-properties.h" | 9 #include "src/compiler/operator-properties.h" |
| 10 #include "src/interpreter/bytecodes.h" | 10 #include "src/interpreter/bytecodes.h" |
| (...skipping 960 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 971 void BytecodeGraphBuilder::VisitKeyedStoreICSloppyWide() { | 971 void BytecodeGraphBuilder::VisitKeyedStoreICSloppyWide() { |
| 972 DCHECK(is_sloppy(language_mode())); | 972 DCHECK(is_sloppy(language_mode())); |
| 973 BuildKeyedStore(); | 973 BuildKeyedStore(); |
| 974 } | 974 } |
| 975 | 975 |
| 976 void BytecodeGraphBuilder::VisitKeyedStoreICStrictWide() { | 976 void BytecodeGraphBuilder::VisitKeyedStoreICStrictWide() { |
| 977 DCHECK(is_strict(language_mode())); | 977 DCHECK(is_strict(language_mode())); |
| 978 BuildKeyedStore(); | 978 BuildKeyedStore(); |
| 979 } | 979 } |
| 980 | 980 |
| 981 void BytecodeGraphBuilder::VisitLdaInitialMap() { | |
| 982 FrameStateBeforeAndAfter states(this); | |
|
Michael Starzinger
2016/02/04 13:40:20
nit: Shouldn't need a frame state. Can we drop thi
oth
2016/02/04 14:00:59
Done.
| |
| 983 Node* js_function = environment()->LookupAccumulator(); | |
| 984 environment()->BindAccumulator(BuildLoadObjectField( | |
|
Michael Starzinger
2016/02/04 13:40:20
nit: This is a dangerous pattern, because C++ does
oth
2016/02/04 14:00:59
Thanks, aware of the issue. Hadn't thought this in
| |
| 985 js_function, JSFunction::kPrototypeOrInitialMapOffset)); | |
| 986 } | |
| 987 | |
| 981 void BytecodeGraphBuilder::VisitPushContext() { | 988 void BytecodeGraphBuilder::VisitPushContext() { |
| 982 Node* new_context = environment()->LookupAccumulator(); | 989 Node* new_context = environment()->LookupAccumulator(); |
| 983 environment()->BindRegister(bytecode_iterator().GetRegisterOperand(0), | 990 environment()->BindRegister(bytecode_iterator().GetRegisterOperand(0), |
| 984 environment()->Context()); | 991 environment()->Context()); |
| 985 environment()->SetContext(new_context); | 992 environment()->SetContext(new_context); |
| 986 } | 993 } |
| 987 | 994 |
| 988 void BytecodeGraphBuilder::VisitPopContext() { | 995 void BytecodeGraphBuilder::VisitPopContext() { |
| 989 Node* context = | 996 Node* context = |
| 990 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); | 997 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); |
| (...skipping 843 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 1834 // Phi does not exist yet, introduce one. | 1841 // Phi does not exist yet, introduce one. |
| 1835 value = NewPhi(inputs, value, control); | 1842 value = NewPhi(inputs, value, control); |
| 1836 value->ReplaceInput(inputs - 1, other); | 1843 value->ReplaceInput(inputs - 1, other); |
| 1837 } | 1844 } |
| 1838 return value; | 1845 return value; |
| 1839 } | 1846 } |
| 1840 | 1847 |
| 1841 } // namespace compiler | 1848 } // namespace compiler |
| 1842 } // namespace internal | 1849 } // namespace internal |
| 1843 } // namespace v8 | 1850 } // namespace v8 |
| OLD | NEW |