Searched defs:new_top (Results 1 - 11 of 11) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsPromotionLAB.hpp101 HeapWord* new_top = obj + size; local
102 // The 'new_top>obj' check is needed to detect overflow of obj+size.
103 if (new_top > obj && new_top <= end()) {
104 set_top(new_top);
105 assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top),
134 HeapWord* new_top = obj + size; local
135 // The 'new_top>obj' check is needed to detect overflow of obj+size.
136 if (new_top > obj && new_top <
[all...]
H A DpsMarkSweep.cpp461 HeapWord* const new_top = eden_space->top(); local
465 old_space->set_top(new_top);
466 old_space->set_end(new_top);
471 for (HeapWord* p = unused_start; p < new_top; p += oop(p)->size()) {
H A DpsParallelCompact.hpp177 HeapWord* new_top() const { return _new_top; } function in class:SpaceInfo
179 // Allows new_top to be set.
1087 HeapWord* const new_top);
1242 static inline HeapWord* new_top(SpaceId space_id);
1495 inline HeapWord* PSParallelCompact::new_top(SpaceId id) {
1497 return _space_info[id].new_top();
H A DpsParallelCompact.cpp212 tty->print_cr("space bottom top end new_top");
224 summary_data().addr_to_region_idx(_space_info[id].new_top()));
278 MAX2(space->top(), space_info[id].new_top()));
613 // max(top, max(new_top, clear_top))
978 // At this point, top is the value before GC, new_top() is the value that will
981 // top & new_top.
985 HeapWord* const max_top = MAX2(top, _space_info[id].new_top());
1142 HeapWord* const new_top = _space_info[id].new_top(); local
1143 const size_t space_live = pointer_delta(new_top, spac
1224 HeapWord* const new_top = _space_info[id].new_top(); local
1364 reclaimed_ratio(const RegionData* const cp, HeapWord* const bottom, HeapWord* const top, HeapWord* const new_top) argument
1418 HeapWord* const new_top = _space_info[id].new_top(); local
1843 HeapWord* const new_top = _space_info[id].new_top(); local
2361 HeapWord* const new_top = eden_space->top(); local
2558 HeapWord* const new_top = space_info->new_top(); local
3242 HeapWord* const new_top = _space_info[src_space_id].new_top(); local
3340 HeapWord* new_top = _space_info[dest_space_id].new_top(); local
3513 HeapWord* const new_top = _space_info[space_id].new_top(); local
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DmutableSpace.cpp181 HeapWord* new_top = obj + size; local
182 set_top(new_top);
183 assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top),
196 HeapWord* new_top = obj + size; local
197 HeapWord* result = (HeapWord*)Atomic::cmpxchg_ptr(new_top, top_addr(), obj);
204 assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top),
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1BlockOffsetTable.cpp664 G1BlockOffsetArrayContigSpace::set_for_starts_humongous(HeapWord* new_top) { argument
665 assert(new_top <= _end, "_end should have already been updated");
670 alloc_block(_bottom, new_top);
H A DheapRegion.cpp400 void HeapRegion::set_startsHumongous(HeapWord* new_top, HeapWord* new_end) { argument
405 assert(bottom() <= new_top && new_top <= new_end, "pre-condition");
411 _offsets.set_for_starts_humongous(new_top);
H A Dg1CollectedHeap.cpp699 HeapWord* new_top = new_obj + word_size; local
720 first_hr->set_startsHumongous(new_top, new_end);
744 assert(first_hr->bottom() < new_top && new_top <= first_hr->end(),
745 "new_top should be in this region");
746 first_hr->set_top(new_top);
752 _hr_printer.alloc(G1HRPrinter::SingleHumongous, first_hr, new_top);
767 // end for all regions but the last one, top == new_top for the
775 assert(hr->bottom() < new_top && new_top <
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A Dspace.cpp845 HeapWord* new_top = obj + size; local
846 set_top(new_top);
847 assert(is_aligned(obj) && is_aligned(new_top), "checking alignment");
860 HeapWord* new_top = obj + size; local
861 HeapWord* result = (HeapWord*)Atomic::cmpxchg_ptr(new_top, top_addr(), obj);
866 assert(is_aligned(obj) && is_aligned(new_top), "checking alignment");
944 HeapWord* new_top = obj + size; local
945 HeapWord* result = (HeapWord*)Atomic::cmpxchg_ptr(new_top, top_addr(), obj);
950 assert(is_aligned(obj) && is_aligned(new_top), "checking alignment");
/openjdk7/hotspot/src/share/vm/interpreter/
H A DbytecodeInterpreter.cpp1964 HeapWord* new_top = compare_to + obj_size; local
1965 if (new_top <= *Universe::heap()->end_addr()) {
1966 if (Atomic::cmpxchg_ptr(new_top, Universe::heap()->top_addr(), compare_to) != compare_to) {
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkTopLevelBlock.cpp1657 Value *new_top = builder()->CreateAdd( local
1661 builder()->CreateICmpULE(new_top, end),
1668 builder()->CreateStore(new_top, top_addr);
1690 Value *new_top = builder()->CreateAdd( local
1694 builder()->CreateICmpULE(new_top, end),
1701 Value *check = builder()->CreateCmpxchgPtr(new_top, top_addr, old_top);

Completed in 101 milliseconds