| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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/code-generator.h" | 5 #include "src/compiler/code-generator.h" |
| 6 | 6 |
| 7 #include "src/compiler/code-generator-impl.h" | 7 #include "src/compiler/code-generator-impl.h" |
| 8 #include "src/compiler/gap-resolver.h" | 8 #include "src/compiler/gap-resolver.h" |
| 9 #include "src/compiler/node-matchers.h" | 9 #include "src/compiler/node-matchers.h" |
| 10 #include "src/compiler/node-properties-inl.h" | 10 #include "src/compiler/node-properties-inl.h" |
| (...skipping 1171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1182 // instruction for patching the code here. | 1182 // instruction for patching the code here. |
| 1183 int current_pc = masm()->pc_offset(); | 1183 int current_pc = masm()->pc_offset(); |
| 1184 if (current_pc < last_lazy_deopt_pc_ + space_needed) { | 1184 if (current_pc < last_lazy_deopt_pc_ + space_needed) { |
| 1185 int padding_size = last_lazy_deopt_pc_ + space_needed - current_pc; | 1185 int padding_size = last_lazy_deopt_pc_ + space_needed - current_pc; |
| 1186 __ Nop(padding_size); | 1186 __ Nop(padding_size); |
| 1187 } | 1187 } |
| 1188 } | 1188 } |
| 1189 MarkLazyDeoptSite(); | 1189 MarkLazyDeoptSite(); |
| 1190 } | 1190 } |
| 1191 | 1191 |
| 1192 |
| 1193 void CodeGenerator::EnsureRelocSpaceForLazyDeopt(Handle<Code> code) { |
| 1194 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code); |
| 1195 } |
| 1196 |
| 1192 #undef __ | 1197 #undef __ |
| 1193 | 1198 |
| 1194 } // namespace compiler | 1199 } // namespace compiler |
| 1195 } // namespace internal | 1200 } // namespace internal |
| 1196 } // namespace v8 | 1201 } // namespace v8 |
| OLD | NEW |