Searched defs:start_addr (Results 1 - 4 of 4) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DobjectStartArray.cpp127 bool ObjectStartArray::object_starts_in_range(HeapWord* start_addr, argument
129 assert(start_addr <= end_addr, "range is wrong");
130 if (start_addr > end_addr) {
134 jbyte* start_block = block_for_addr(start_addr);
144 assert(object_start(end_addr - 1) <= start_addr,
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1CardCounts.cpp189 HeapWord* start_addr = _ct_bs->addr_for(from_card_ptr); local
190 assert(start_addr == hr->bottom(), "alignment");
H A DconcurrentMark.inline.hpp245 HeapWord* start_addr = MAX2(startWord(), mr.start()); local
248 if (end_addr > start_addr) {
250 BitMap::idx_t start_offset = heapWordToOffset(start_addr);
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.inline.hpp138 // Starting at "start_addr" (inclusive) return a memory region
141 inline MemRegion CMSBitMap::getAndClearMarkedRegion(HeapWord* start_addr, argument
145 start = getNextMarkedWordAddress (start_addr, end_addr);
184 // starting at start_addr (inclusive) but strictly less than end_addr.
186 HeapWord* start_addr, HeapWord* end_addr) const {
189 heapWordToOffset(start_addr),
192 assert(nextAddr >= start_addr &&
209 HeapWord* start_addr, HeapWord* end_addr) const {
212 heapWordToOffset(start_addr),
215 assert(nextAddr >= start_addr
185 getNextMarkedWordAddress( HeapWord* start_addr, HeapWord* end_addr) const argument
208 getNextUnmarkedWordAddress( HeapWord* start_addr, HeapWord* end_addr) const argument
[all...]

Completed in 34 milliseconds