| OLD | NEW |
| 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 #include "vm/globals.h" // Needed here to get TARGET_ARCH_ARM. | 5 #include "vm/globals.h" // Needed here to get TARGET_ARCH_ARM. |
| 6 #if defined(TARGET_ARCH_ARM) | 6 #if defined(TARGET_ARCH_ARM) |
| 7 | 7 |
| 8 #include "vm/flow_graph_compiler.h" | 8 #include "vm/flow_graph_compiler.h" |
| 9 | 9 |
| 10 #include "vm/ast_printer.h" | 10 #include "vm/ast_printer.h" |
| (...skipping 1110 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1121 __ LoadObject(R1, empty_context); | 1121 __ LoadObject(R1, empty_context); |
| 1122 __ StoreToOffset(kWord, R1, FP, (slot_base - i) * kWordSize); | 1122 __ StoreToOffset(kWord, R1, FP, (slot_base - i) * kWordSize); |
| 1123 } | 1123 } |
| 1124 } else { | 1124 } else { |
| 1125 ASSERT(num_locals > 1); | 1125 ASSERT(num_locals > 1); |
| 1126 __ StoreToOffset(kWord, R0, FP, (slot_base - i) * kWordSize); | 1126 __ StoreToOffset(kWord, R0, FP, (slot_base - i) * kWordSize); |
| 1127 } | 1127 } |
| 1128 } | 1128 } |
| 1129 } | 1129 } |
| 1130 | 1130 |
| 1131 MaybeEmitCodeSourceMapEntry(TokenPosition::kDartCodePrologue); |
| 1131 VisitBlocks(); | 1132 VisitBlocks(); |
| 1132 | 1133 |
| 1133 __ bkpt(0); | 1134 __ bkpt(0); |
| 1134 ASSERT(assembler()->constant_pool_allowed()); | 1135 ASSERT(assembler()->constant_pool_allowed()); |
| 1135 GenerateDeferredCode(); | 1136 GenerateDeferredCode(); |
| 1136 | 1137 |
| 1138 SaveCodeSize(); |
| 1137 if (is_optimizing() && !FLAG_precompilation) { | 1139 if (is_optimizing() && !FLAG_precompilation) { |
| 1138 // Leave enough space for patching in case of lazy deoptimization from | 1140 // Leave enough space for patching in case of lazy deoptimization from |
| 1139 // deferred code. | 1141 // deferred code. |
| 1140 for (intptr_t i = 0; | 1142 for (intptr_t i = 0; |
| 1141 i < CallPattern::DeoptCallPatternLengthInInstructions(); | 1143 i < CallPattern::DeoptCallPatternLengthInInstructions(); |
| 1142 ++i) { | 1144 ++i) { |
| 1143 __ nop(); | 1145 __ nop(); |
| 1144 } | 1146 } |
| 1145 lazy_deopt_pc_offset_ = assembler()->CodeSize(); | 1147 lazy_deopt_pc_offset_ = assembler()->CodeSize(); |
| 1146 __ Branch(*StubCode::DeoptimizeLazy_entry()); | 1148 __ Branch(*StubCode::DeoptimizeLazy_entry()); |
| 1147 } | 1149 } |
| 1150 MaybeEmitCodeSourceMapEntry(TokenPosition::kDartCodeEpilogue); |
| 1148 } | 1151 } |
| 1149 | 1152 |
| 1150 | 1153 |
| 1151 void FlowGraphCompiler::GenerateCall(TokenPosition token_pos, | 1154 void FlowGraphCompiler::GenerateCall(TokenPosition token_pos, |
| 1152 const StubEntry& stub_entry, | 1155 const StubEntry& stub_entry, |
| 1153 RawPcDescriptors::Kind kind, | 1156 RawPcDescriptors::Kind kind, |
| 1154 LocationSummary* locs) { | 1157 LocationSummary* locs) { |
| 1155 __ BranchLinkPatchable(stub_entry); | 1158 __ BranchLinkPatchable(stub_entry); |
| 1156 AddCurrentDescriptor(kind, Thread::kNoDeoptId, token_pos); | 1159 AddCurrentDescriptor(kind, Thread::kNoDeoptId, token_pos); |
| 1157 RecordSafepoint(locs); | 1160 RecordSafepoint(locs); |
| (...skipping 787 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1945 DRegister dreg = EvenDRegisterOf(reg); | 1948 DRegister dreg = EvenDRegisterOf(reg); |
| 1946 __ vldrd(dreg, Address(SP, kDoubleSize, Address::PostIndex)); | 1949 __ vldrd(dreg, Address(SP, kDoubleSize, Address::PostIndex)); |
| 1947 } | 1950 } |
| 1948 | 1951 |
| 1949 | 1952 |
| 1950 #undef __ | 1953 #undef __ |
| 1951 | 1954 |
| 1952 } // namespace dart | 1955 } // namespace dart |
| 1953 | 1956 |
| 1954 #endif // defined TARGET_ARCH_ARM | 1957 #endif // defined TARGET_ARCH_ARM |
| OLD | NEW |