OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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/arm/lithium-codegen-arm.h" | 5 #include "src/crankshaft/arm/lithium-codegen-arm.h" |
6 #include "src/arm/lithium-gap-resolver-arm.h" | 6 #include "src/crankshaft/arm/lithium-gap-resolver-arm.h" |
7 | 7 |
8 namespace v8 { | 8 namespace v8 { |
9 namespace internal { | 9 namespace internal { |
10 | 10 |
11 // We use the root register to spill a value while breaking a cycle in parallel | 11 // We use the root register to spill a value while breaking a cycle in parallel |
12 // moves. We don't need access to roots while resolving the move list and using | 12 // moves. We don't need access to roots while resolving the move list and using |
13 // the root register has two advantages: | 13 // the root register has two advantages: |
14 // - It is not in crankshaft allocatable registers list, so it can't interfere | 14 // - It is not in crankshaft allocatable registers list, so it can't interfere |
15 // with any of the moves we are resolving. | 15 // with any of the moves we are resolving. |
16 // - We don't need to push it on the stack, as we can reload it with its value | 16 // - We don't need to push it on the stack, as we can reload it with its value |
(...skipping 275 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
292 } | 292 } |
293 | 293 |
294 moves_[index].Eliminate(); | 294 moves_[index].Eliminate(); |
295 } | 295 } |
296 | 296 |
297 | 297 |
298 #undef __ | 298 #undef __ |
299 | 299 |
300 } // namespace internal | 300 } // namespace internal |
301 } // namespace v8 | 301 } // namespace v8 |
OLD | NEW |