Lines Matching defs:to
16 * 2 along with this work; if not, write to the Free Software Foundation,
81 // No point in asserting barrier set type here. Need to make CardTableExtension
121 // We get passed the space_top value to prevent us from traversing into
125 // It is a waste to start tasks and get here only to
126 // do no work. If this method needs to be called
128 // end_card to allow sp_top == sp->bottom().
139 // It is a waste to get here if empty.
158 // We do not want to scan objects more than once. In order to accomplish
160 // belongs to us. We may need to extend the range of scanned cards if the
226 // Some objects may be large enough to span several cards. If such
228 // we will attempt to scan it twice. The test against "last_scanned"
238 // We need to bump the current_card to ending_card_of_last_object
264 oop* to = (oop*)addr_for(following_clean_card);
267 if ((HeapWord*)to > slice_end) {
268 to = (oop*)slice_end;
269 } else if (to > sp_top) {
270 to = sp_top;
273 // we know which cards to scan, now clear them
286 while (p < to) {
295 while (p < to) {
313 // It may now be dirty because a old-to-young pointer was
403 // The method resize_covered_region_by_end() is analogous to
427 assert(changed_region != -1, "Don't expect to add a covered region");
492 "The ends of the regions are expected to match");
493 // Extend the start of this _committed region to
494 // to cover the start of any previous _committed region.
498 // Only really need to set start of "cur_committed" to