| OLD | NEW |
| (Empty) | |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are |
| 4 // met: |
| 5 // |
| 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. |
| 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 |
| 28 #ifndef V8_VIRTUAL_FRAME_INL_H_ |
| 29 #define V8_VIRTUAL_FRAME_INL_H_ |
| 30 |
| 31 #include "virtual-frame.h" |
| 32 |
| 33 namespace v8 { |
| 34 namespace internal { |
| 35 |
| 36 |
| 37 // On entry to a function, the virtual frame already contains the receiver, |
| 38 // the parameters, and a return address. All frame elements are in memory. |
| 39 VirtualFrame::VirtualFrame() |
| 40 : elements_(parameter_count() + local_count() + kPreallocatedElements), |
| 41 stack_pointer_(parameter_count() + 1) { // 0-based index of TOS. |
| 42 for (int i = 0; i <= stack_pointer_; i++) { |
| 43 elements_.Add(FrameElement::MemoryElement(NumberInfo::Unknown())); |
| 44 } |
| 45 for (int i = 0; i < RegisterAllocator::kNumRegisters; i++) { |
| 46 register_locations_[i] = kIllegalIndex; |
| 47 } |
| 48 } |
| 49 |
| 50 |
| 51 // When cloned, a frame is a deep copy of the original. |
| 52 VirtualFrame::VirtualFrame(VirtualFrame* original) |
| 53 : elements_(original->element_count()), |
| 54 stack_pointer_(original->stack_pointer_) { |
| 55 elements_.AddAll(original->elements_); |
| 56 // Copy register locations from original. |
| 57 memcpy(®ister_locations_, |
| 58 original->register_locations_, |
| 59 sizeof(register_locations_)); |
| 60 } |
| 61 |
| 62 |
| 63 void VirtualFrame::PushFrameSlotAt(int index) { |
| 64 elements_.Add(CopyElementAt(index)); |
| 65 } |
| 66 |
| 67 |
| 68 void VirtualFrame::Push(Register reg, NumberInfo info) { |
| 69 if (is_used(reg)) { |
| 70 int index = register_location(reg); |
| 71 FrameElement element = CopyElementAt(index, info); |
| 72 elements_.Add(element); |
| 73 } else { |
| 74 Use(reg, element_count()); |
| 75 FrameElement element = |
| 76 FrameElement::RegisterElement(reg, FrameElement::NOT_SYNCED, info); |
| 77 elements_.Add(element); |
| 78 } |
| 79 } |
| 80 |
| 81 |
| 82 void VirtualFrame::Push(Handle<Object> value) { |
| 83 FrameElement element = |
| 84 FrameElement::ConstantElement(value, FrameElement::NOT_SYNCED); |
| 85 elements_.Add(element); |
| 86 } |
| 87 |
| 88 |
| 89 void VirtualFrame::Push(Smi* value) { |
| 90 Push(Handle<Object> (value)); |
| 91 } |
| 92 |
| 93 |
| 94 void VirtualFrame::Nip(int num_dropped) { |
| 95 ASSERT(num_dropped >= 0); |
| 96 if (num_dropped == 0) return; |
| 97 Result tos = Pop(); |
| 98 if (num_dropped > 1) { |
| 99 Drop(num_dropped - 1); |
| 100 } |
| 101 SetElementAt(0, &tos); |
| 102 } |
| 103 |
| 104 |
| 105 bool VirtualFrame::Equals(VirtualFrame* other) { |
| 106 #ifdef DEBUG |
| 107 for (int i = 0; i < RegisterAllocator::kNumRegisters; i++) { |
| 108 if (register_location(i) != other->register_location(i)) { |
| 109 return false; |
| 110 } |
| 111 } |
| 112 if (element_count() != other->element_count()) return false; |
| 113 #endif |
| 114 if (stack_pointer_ != other->stack_pointer_) return false; |
| 115 for (int i = 0; i < element_count(); i++) { |
| 116 if (!elements_[i].Equals(other->elements_[i])) return false; |
| 117 } |
| 118 |
| 119 return true; |
| 120 } |
| 121 |
| 122 } } // namespace v8::internal |
| 123 |
| 124 #endif // V8_VIRTUAL_FRAME_INL_H_ |
| OLD | NEW |