| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 22 matching lines...) Expand all Loading... |
| 33 namespace v8 { | 33 namespace v8 { |
| 34 namespace internal { | 34 namespace internal { |
| 35 | 35 |
| 36 // We use the root register to spill a value while breaking a cycle in parallel | 36 // We use the root register to spill a value while breaking a cycle in parallel |
| 37 // moves. We don't need access to roots while resolving the move list and using | 37 // moves. We don't need access to roots while resolving the move list and using |
| 38 // the root register has two advantages: | 38 // the root register has two advantages: |
| 39 // - It is not in crankshaft allocatable registers list, so it can't interfere | 39 // - It is not in crankshaft allocatable registers list, so it can't interfere |
| 40 // with any of the moves we are resolving. | 40 // with any of the moves we are resolving. |
| 41 // - We don't need to push it on the stack, as we can reload it with its value | 41 // - We don't need to push it on the stack, as we can reload it with its value |
| 42 // once we have resolved a cycle. | 42 // once we have resolved a cycle. |
| 43 const Register LGapResolver::kSavedValue = root; | 43 #define kSavedValue root |
| 44 | |
| 45 | 44 |
| 46 LGapResolver::LGapResolver(LCodeGen* owner) | 45 LGapResolver::LGapResolver(LCodeGen* owner) |
| 47 : cgen_(owner), moves_(32, owner->zone()), root_index_(0), in_cycle_(false), | 46 : cgen_(owner), moves_(32, owner->zone()), root_index_(0), in_cycle_(false), |
| 48 saved_destination_(NULL), need_to_restore_root_(false) { } | 47 saved_destination_(NULL), need_to_restore_root_(false) { } |
| 49 | 48 |
| 50 | 49 |
| 51 #define __ ACCESS_MASM(cgen_->masm()) | 50 #define __ ACCESS_MASM(cgen_->masm()) |
| 52 | 51 |
| 53 void LGapResolver::Resolve(LParallelMove* parallel_move) { | 52 void LGapResolver::Resolve(LParallelMove* parallel_move) { |
| 54 ASSERT(moves_.is_empty()); | 53 ASSERT(moves_.is_empty()); |
| (...skipping 262 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 317 LOperand* src = moves_[index].source(); | 316 LOperand* src = moves_[index].source(); |
| 318 LOperand* dst = moves_[index].destination(); | 317 LOperand* dst = moves_[index].destination(); |
| 319 | 318 |
| 320 ASSERT(src->IsStackSlot()); | 319 ASSERT(src->IsStackSlot()); |
| 321 ASSERT(dst->IsStackSlot()); | 320 ASSERT(dst->IsStackSlot()); |
| 322 __ Ldr(temp, cgen_->ToMemOperand(src)); | 321 __ Ldr(temp, cgen_->ToMemOperand(src)); |
| 323 __ Str(temp, cgen_->ToMemOperand(dst)); | 322 __ Str(temp, cgen_->ToMemOperand(dst)); |
| 324 } | 323 } |
| 325 | 324 |
| 326 } } // namespace v8::internal | 325 } } // namespace v8::internal |
| OLD | NEW |