Lines Matching refs:dirty
407 the "dirty -> dirty and claimed" transition is checked for in
419 assert(val != dirty_card_val(), "Shouldn't claim a dirty card");
507 // do for us): clear_cl here does the work of finding contiguous dirty ranges
521 // accomplish dirty card iteration in parallel. The
522 // iterator itself does not clear the dirty cards, or
539 // Should the next card be included in this range of dirty cards.
600 void CardTableModRefBS::dirty(MemRegion mr) {
607 // iterates over dirty cards ranges in increasing address order.
620 // Accumulate maximal dirty card range, starting at cur_entry
646 // Accumulate maximal dirty card range, starting at cur_entry