| OLD | NEW |
| 1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 84 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 95 __ sub(sp, sp, Operand(difference * kPointerSize)); | 95 __ sub(sp, sp, Operand(difference * kPointerSize)); |
| 96 } | 96 } |
| 97 | 97 |
| 98 MergeMoveRegistersToMemory(expected); | 98 MergeMoveRegistersToMemory(expected); |
| 99 MergeMoveRegistersToRegisters(expected); | 99 MergeMoveRegistersToRegisters(expected); |
| 100 MergeMoveMemoryToRegisters(expected); | 100 MergeMoveMemoryToRegisters(expected); |
| 101 | 101 |
| 102 // Fix any sync bit problems from the bottom-up, stopping when we | 102 // Fix any sync bit problems from the bottom-up, stopping when we |
| 103 // hit the stack pointer or the top of the frame if the stack | 103 // hit the stack pointer or the top of the frame if the stack |
| 104 // pointer is floating above the frame. | 104 // pointer is floating above the frame. |
| 105 int limit = Min(stack_pointer_, elements_.length() - 1); | 105 int limit = Min(static_cast<int>(stack_pointer_), elements_.length() - 1); |
| 106 for (int i = 0; i <= limit; i++) { | 106 for (int i = 0; i <= limit; i++) { |
| 107 FrameElement source = elements_[i]; | 107 FrameElement source = elements_[i]; |
| 108 FrameElement target = expected->elements_[i]; | 108 FrameElement target = expected->elements_[i]; |
| 109 if (source.is_synced() && !target.is_synced()) { | 109 if (source.is_synced() && !target.is_synced()) { |
| 110 elements_[i].clear_sync(); | 110 elements_[i].clear_sync(); |
| 111 } else if (!source.is_synced() && target.is_synced()) { | 111 } else if (!source.is_synced() && target.is_synced()) { |
| 112 SyncElementAt(i); | 112 SyncElementAt(i); |
| 113 } | 113 } |
| 114 } | 114 } |
| 115 | 115 |
| (...skipping 11 matching lines...) Expand all Loading... |
| 127 | 127 |
| 128 void VirtualFrame::MergeMoveRegistersToMemory(VirtualFrame* expected) { | 128 void VirtualFrame::MergeMoveRegistersToMemory(VirtualFrame* expected) { |
| 129 ASSERT(stack_pointer_ >= expected->stack_pointer_); | 129 ASSERT(stack_pointer_ >= expected->stack_pointer_); |
| 130 | 130 |
| 131 // Move registers, constants, and copies to memory. Perform moves | 131 // Move registers, constants, and copies to memory. Perform moves |
| 132 // from the top downward in the frame in order to leave the backing | 132 // from the top downward in the frame in order to leave the backing |
| 133 // stores of copies in registers. | 133 // stores of copies in registers. |
| 134 // On ARM, all elements are in memory. | 134 // On ARM, all elements are in memory. |
| 135 | 135 |
| 136 #ifdef DEBUG | 136 #ifdef DEBUG |
| 137 int start = Min(stack_pointer_, elements_.length() - 1); | 137 int start = Min(static_cast<int>(stack_pointer_), elements_.length() - 1); |
| 138 for (int i = start; i >= 0; i--) { | 138 for (int i = start; i >= 0; i--) { |
| 139 ASSERT(elements_[i].is_memory()); | 139 ASSERT(elements_[i].is_memory()); |
| 140 ASSERT(expected->elements_[i].is_memory()); | 140 ASSERT(expected->elements_[i].is_memory()); |
| 141 } | 141 } |
| 142 #endif | 142 #endif |
| 143 } | 143 } |
| 144 | 144 |
| 145 | 145 |
| 146 void VirtualFrame::MergeMoveRegistersToRegisters(VirtualFrame* expected) { | 146 void VirtualFrame::MergeMoveRegistersToRegisters(VirtualFrame* expected) { |
| 147 } | 147 } |
| (...skipping 291 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 439 ASSERT(stack_pointer_ == elements_.length() - 1); | 439 ASSERT(stack_pointer_ == elements_.length() - 1); |
| 440 elements_.Add(FrameElement::MemoryElement()); | 440 elements_.Add(FrameElement::MemoryElement()); |
| 441 stack_pointer_++; | 441 stack_pointer_++; |
| 442 __ push(reg); | 442 __ push(reg); |
| 443 } | 443 } |
| 444 | 444 |
| 445 | 445 |
| 446 #undef __ | 446 #undef __ |
| 447 | 447 |
| 448 } } // namespace v8::internal | 448 } } // namespace v8::internal |
| OLD | NEW |