equal
deleted
inserted
replaced
285 HeapRegion* cur = get(); |
285 HeapRegion* cur = get(); |
286 if (cur != NULL) { |
286 if (cur != NULL) { |
287 // Determine how far we are from the next card boundary. If it is smaller than |
287 // Determine how far we are from the next card boundary. If it is smaller than |
288 // the minimum object size we can allocate into, expand into the next card. |
288 // the minimum object size we can allocate into, expand into the next card. |
289 HeapWord* top = cur->top(); |
289 HeapWord* top = cur->top(); |
290 HeapWord* aligned_top = align_ptr_up(top, BOTConstants::N_bytes); |
290 HeapWord* aligned_top = align_up(top, BOTConstants::N_bytes); |
291 |
291 |
292 size_t to_allocate_words = pointer_delta(aligned_top, top, HeapWordSize); |
292 size_t to_allocate_words = pointer_delta(aligned_top, top, HeapWordSize); |
293 |
293 |
294 if (to_allocate_words != 0) { |
294 if (to_allocate_words != 0) { |
295 // We are not at a card boundary. Fill up, possibly into the next, taking the |
295 // We are not at a card boundary. Fill up, possibly into the next, taking the |