Mercurial > hg > truffle
comparison src/share/vm/oops/methodDataOop.cpp @ 2227:e5383553fd4e
7014851: Remove unused parallel compaction code
Summary: Removed.
Reviewed-by: jcoomes, brutisso
author | stefank |
---|---|
date | Tue, 08 Feb 2011 12:33:19 +0100 |
parents | 8012aa3ccede |
children | a97fd181b813 |
comparison
equal
deleted
inserted
replaced
2226:c5a923563727 | 2227:e5383553fd4e |
---|---|
266 #ifndef SERIALGC | 266 #ifndef SERIALGC |
267 void ReceiverTypeData::update_pointers() { | 267 void ReceiverTypeData::update_pointers() { |
268 for (uint row = 0; row < row_limit(); row++) { | 268 for (uint row = 0; row < row_limit(); row++) { |
269 if (receiver_unchecked(row) != NULL) { | 269 if (receiver_unchecked(row) != NULL) { |
270 PSParallelCompact::adjust_pointer(adr_receiver(row)); | 270 PSParallelCompact::adjust_pointer(adr_receiver(row)); |
271 } | |
272 } | |
273 } | |
274 | |
275 void ReceiverTypeData::update_pointers(HeapWord* beg_addr, HeapWord* end_addr) { | |
276 // The loop bounds could be computed based on beg_addr/end_addr and the | |
277 // boundary test hoisted outside the loop (see klassVTable for an example); | |
278 // however, row_limit() is small enough (2) to make that less efficient. | |
279 for (uint row = 0; row < row_limit(); row++) { | |
280 if (receiver_unchecked(row) != NULL) { | |
281 PSParallelCompact::adjust_pointer(adr_receiver(row), beg_addr, end_addr); | |
282 } | 271 } |
283 } | 272 } |
284 } | 273 } |
285 #endif // SERIALGC | 274 #endif // SERIALGC |
286 | 275 |