Lines Matching defs:to
16 * 2 along with this work; if not, write to the Free Software Foundation,
82 // No point in asserting barrier set type here. Need to make CardTableExtension
122 // We get passed the space_top value to prevent us from traversing into
154 // figure out when to stop scanning
204 // we know which cards to scan, now clear them
248 // We do not want to scan objects more than once. In order to accomplish
250 // belongs to us. We may need to extend the range of scanned cards if the
306 // Some objects may be large enough to span several cards. If such
308 // we will attempt to scan it twice. The test against "last_scanned"
318 // We need to bump the current_card to ending_card_of_last_object
344 oop* to = (oop*)addr_for(following_clean_card);
347 if ((HeapWord*)to > slice_end) {
348 to = (oop*)slice_end;
349 } else if (to > sp_top) {
350 to = sp_top;
353 // we know which cards to scan, now clear them
366 while (p < to) {
375 while (p < to) {
393 // It may now be dirty because a old-to-young pointer was
490 // The method resize_covered_region_by_end() is analogous to
514 assert(changed_region != -1, "Don't expect to add a covered region");
592 "The ends of the regions are expected to match");
593 // Extend the start of this _committed region to
594 // to cover the start of any previous _committed region.
598 // Only really need to set start of "cur_committed" to