| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "safepoint-table.h" | 28 #include "safepoint-table.h" |
| 29 | 29 |
| 30 #include "deoptimizer.h" |
| 30 #include "disasm.h" | 31 #include "disasm.h" |
| 31 #include "macro-assembler.h" | 32 #include "macro-assembler.h" |
| 32 | 33 |
| 33 namespace v8 { | 34 namespace v8 { |
| 34 namespace internal { | 35 namespace internal { |
| 35 | 36 |
| 36 | 37 |
| 37 bool SafepointEntry::HasRegisters() const { | 38 bool SafepointEntry::HasRegisters() const { |
| 38 ASSERT(is_valid()); | 39 ASSERT(is_valid()); |
| 39 ASSERT(IsAligned(kNumSafepointRegisters, kBitsPerByte)); | 40 ASSERT(IsAligned(kNumSafepointRegisters, kBitsPerByte)); |
| (...skipping 97 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 137 } | 138 } |
| 138 | 139 |
| 139 | 140 |
| 140 unsigned SafepointTableBuilder::GetCodeOffset() const { | 141 unsigned SafepointTableBuilder::GetCodeOffset() const { |
| 141 ASSERT(emitted_); | 142 ASSERT(emitted_); |
| 142 return offset_; | 143 return offset_; |
| 143 } | 144 } |
| 144 | 145 |
| 145 | 146 |
| 146 void SafepointTableBuilder::Emit(Assembler* assembler, int bits_per_entry) { | 147 void SafepointTableBuilder::Emit(Assembler* assembler, int bits_per_entry) { |
| 148 // For lazy deoptimization we need space to patch a call after every call. |
| 149 // Ensure there is always space for such patching, even if the code ends |
| 150 // in a call. |
| 151 int target_offset = assembler->pc_offset() + Deoptimizer::patch_size(); |
| 152 while (assembler->pc_offset() < target_offset) { |
| 153 assembler->nop(); |
| 154 } |
| 155 |
| 147 // Make sure the safepoint table is properly aligned. Pad with nops. | 156 // Make sure the safepoint table is properly aligned. Pad with nops. |
| 148 assembler->Align(kIntSize); | 157 assembler->Align(kIntSize); |
| 149 assembler->RecordComment(";;; Safepoint table."); | 158 assembler->RecordComment(";;; Safepoint table."); |
| 150 offset_ = assembler->pc_offset(); | 159 offset_ = assembler->pc_offset(); |
| 151 | 160 |
| 152 // Take the register bits into account. | 161 // Take the register bits into account. |
| 153 bits_per_entry += kNumSafepointRegisters; | 162 bits_per_entry += kNumSafepointRegisters; |
| 154 | 163 |
| 155 // Compute the number of bytes per safepoint entry. | 164 // Compute the number of bytes per safepoint entry. |
| 156 int bytes_per_entry = | 165 int bytes_per_entry = |
| (...skipping 58 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 215 unsigned gap_size = info.pc_after_gap - info.pc; | 224 unsigned gap_size = info.pc_after_gap - info.pc; |
| 216 uint32_t encoding = SafepointEntry::DeoptimizationIndexField::encode(index); | 225 uint32_t encoding = SafepointEntry::DeoptimizationIndexField::encode(index); |
| 217 encoding |= SafepointEntry::GapCodeSizeField::encode(gap_size); | 226 encoding |= SafepointEntry::GapCodeSizeField::encode(gap_size); |
| 218 encoding |= SafepointEntry::ArgumentsField::encode(info.arguments); | 227 encoding |= SafepointEntry::ArgumentsField::encode(info.arguments); |
| 219 encoding |= SafepointEntry::SaveDoublesField::encode(info.has_doubles); | 228 encoding |= SafepointEntry::SaveDoublesField::encode(info.has_doubles); |
| 220 return encoding; | 229 return encoding; |
| 221 } | 230 } |
| 222 | 231 |
| 223 | 232 |
| 224 } } // namespace v8::internal | 233 } } // namespace v8::internal |
| OLD | NEW |