OLD | NEW |
1 // Copyright 2011 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 |
(...skipping 210 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
221 int deoptimization_index); | 221 int deoptimization_index); |
222 | 222 |
223 // Update the last safepoint with the size of the code generated until the | 223 // Update the last safepoint with the size of the code generated until the |
224 // end of the gap following it. | 224 // end of the gap following it. |
225 void SetPcAfterGap(int pc) { | 225 void SetPcAfterGap(int pc) { |
226 ASSERT(!deoptimization_info_.is_empty()); | 226 ASSERT(!deoptimization_info_.is_empty()); |
227 int index = deoptimization_info_.length() - 1; | 227 int index = deoptimization_info_.length() - 1; |
228 deoptimization_info_[index].pc_after_gap = pc; | 228 deoptimization_info_[index].pc_after_gap = pc; |
229 } | 229 } |
230 | 230 |
| 231 // Get the end pc offset of the last safepoint, including the code generated |
| 232 // until the end of the gap following it. |
| 233 unsigned GetPcAfterGap() { |
| 234 int index = deoptimization_info_.length(); |
| 235 if (index == 0) return 0; |
| 236 return deoptimization_info_[index - 1].pc_after_gap; |
| 237 } |
| 238 |
231 // Emit the safepoint table after the body. The number of bits per | 239 // Emit the safepoint table after the body. The number of bits per |
232 // entry must be enough to hold all the pointer indexes. | 240 // entry must be enough to hold all the pointer indexes. |
233 void Emit(Assembler* assembler, int bits_per_entry); | 241 void Emit(Assembler* assembler, int bits_per_entry); |
234 | 242 |
235 // Count the number of deoptimization points where the next | 243 // Count the number of deoptimization points where the next |
236 // following deoptimization point comes less than limit bytes | 244 // following deoptimization point comes less than limit bytes |
237 // after the end of this point's gap. | 245 // after the end of this point's gap. |
238 int CountShortDeoptimizationIntervals(unsigned limit); | 246 int CountShortDeoptimizationIntervals(unsigned limit); |
239 | 247 |
240 private: | 248 private: |
(...skipping 13 matching lines...) Expand all Loading... |
254 | 262 |
255 unsigned offset_; | 263 unsigned offset_; |
256 bool emitted_; | 264 bool emitted_; |
257 | 265 |
258 DISALLOW_COPY_AND_ASSIGN(SafepointTableBuilder); | 266 DISALLOW_COPY_AND_ASSIGN(SafepointTableBuilder); |
259 }; | 267 }; |
260 | 268 |
261 } } // namespace v8::internal | 269 } } // namespace v8::internal |
262 | 270 |
263 #endif // V8_SAFEPOINT_TABLE_H_ | 271 #endif // V8_SAFEPOINT_TABLE_H_ |
OLD | NEW |