Lines Matching +refs:val +refs:entry
317 // In any case, we can reset the end of the current committed entry.
334 jbyte* entry;
336 entry = byte_for(_whole_heap.start());
338 entry = byte_after(old_region.last());
361 if (entry < end) {
362 memset(entry, clean_card, pointer_delta(end, entry, sizeof(jbyte)));
412 it does not it will only result in duplicate entry in the update
418 jbyte val = _byte_map[card_index];
419 assert(val != dirty_card_val(), "Shouldn't claim a dirty card");
420 while (val == clean_card_val() ||
421 (val & (clean_card_mask_val() | claimed_card_val())) != claimed_card_val()) {
422 jbyte new_val = val;
423 if (val == clean_card_val()) {
426 new_val = val | (jbyte)claimed_card_val();
428 jbyte res = Atomic::cmpxchg(new_val, &_byte_map[card_index], val);
429 if (res == val) {
432 val = res;
438 jbyte val = _byte_map[card_index];
440 if ((val & (clean_card_mask_val() | deferred_card_val())) == deferred_card_val()) {
444 jbyte new_val = val;
445 if (val == clean_card_val()) {
448 if (val & claimed_card_val()) {
449 new_val = val | (jbyte)deferred_card_val();
452 if (new_val != val) {
453 Atomic::cmpxchg(new_val, &_byte_map[card_index], val);
681 jbyte val, bool val_equals) {
687 bool failed = (val_equals) ? (curr_val != val) : (curr_val == val);
693 (val_equals) ? "" : "not ", val);
697 "val: %d", curr, addr_for(curr),