Searched refs:end_addr (Results 1 - 25 of 34) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DobjectStartArray.cpp128 HeapWord* end_addr) const {
129 assert(start_addr <= end_addr, "range is wrong");
130 if (start_addr > end_addr) {
135 jbyte* end_block = block_for_addr(end_addr);
144 assert(object_start(end_addr - 1) <= start_addr,
H A DpsYoungGen.hpp166 HeapWord** end_addr() const { return eden_space()->end_addr(); } function in class:PSYoungGen
H A DparMarkBitMap.hpp73 // the equivalent beg_addr and end_addr.
75 inline size_t obj_size(HeapWord* beg_addr, HeapWord* end_addr) const;
127 // Return the number of live words in the range [beg_addr, end_addr) due to
132 size_t live_words_in_range(HeapWord* beg_addr, HeapWord* end_addr) const;
331 ParMarkBitMap::obj_size(HeapWord* beg_addr, HeapWord* end_addr) const
334 DEBUG_ONLY(verify_addr(end_addr);)
335 return pointer_delta(end_addr, beg_addr) + obj_granularity();
H A DparallelScavengeHeap.hpp213 HeapWord** end_addr() const { return !UseNUMA ? young_gen()->end_addr() : (HeapWord**)-1; } function in class:ParallelScavengeHeap
H A DparMarkBitMap.cpp112 ParMarkBitMap::live_words_in_range(HeapWord* beg_addr, HeapWord* end_addr) const
114 assert(beg_addr <= end_addr, "bad range");
119 const idx_t end_bit = addr_to_bit(end_addr);
H A DpsParallelCompact.cpp251 HeapWord* const end_addr)
255 const size_t last = summary_data.addr_to_region_idx(end_addr);
308 HeapWord* end_addr = c->destination() + c->data_size(); local
309 const size_t live_in_space = pointer_delta(end_addr, space->bottom());
1786 PSParallelCompact::clear_source_region(HeapWord* beg_addr, HeapWord* end_addr) argument
1789 HeapWord* const end_aligned_up = _summary_data.region_align_up(end_addr);
3028 HeapWord* const end_addr = sd.region_to_addr(end_region); local
3030 assert(end_addr <= dense_prefix(space_id), "not in the dense prefix");
3053 beg_addr = mbm->find_obj_beg(beg_addr, end_addr);
3057 if (beg_addr < end_addr) {
249 print_generic_summary_data(ParallelCompactData& summary_data, HeapWord* const beg_addr, HeapWord* const end_addr) argument
3107 HeapWord* const end_addr = sd.region_align_up(space_info->new_top()); local
3255 next_src_region(MoveAndUpdateClosure& closure, SpaceId& src_space_id, HeapWord*& src_space_top, HeapWord* end_addr) argument
3372 HeapWord* const end_addr = sd.region_align_down(closure.source()); local
3386 HeapWord* const end_addr = MIN2(sd.region_align_up(cur_addr + 1), local
3500 HeapWord* end_addr = sp->top(); local
3564 HeapWord* const end_addr = bitmap()->find_obj_end(source(), range_end); local
[all...]
H A DobjectStartArray.hpp169 bool object_starts_in_range(HeapWord* start_addr, HeapWord* end_addr) const;
H A DpsParallelCompact.hpp1104 static void clear_source_region(HeapWord* beg_addr, HeapWord* end_addr);
1236 // Return true if p is in the range [beg_addr, end_addr).
1237 static inline bool is_in(HeapWord* p, HeapWord* beg_addr, HeapWord* end_addr);
1238 static inline bool is_in(oop* p, HeapWord* beg_addr, HeapWord* end_addr);
1284 // new region return the region index. Parameter end_addr is the address one
1291 HeapWord* end_addr);
1294 // range [beg_region, region(region_align_up(end_addr))). If the destination
1299 HeapWord* end_addr);
1481 PSParallelCompact::is_in(HeapWord* p, HeapWord* beg_addr, HeapWord* end_addr) {
1482 return p >= beg_addr && p < end_addr;
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.inline.hpp140 // strictly less than end_addr.
142 HeapWord* end_addr) {
145 start = getNextMarkedWordAddress (start_addr, end_addr);
146 end = getNextUnmarkedWordAddress(start, end_addr);
184 // starting at start_addr (inclusive) but strictly less than end_addr.
186 HeapWord* start_addr, HeapWord* end_addr) const {
190 heapWordToOffset(end_addr));
193 nextAddr <= end_addr, "get_next_one postcondition");
194 assert((nextAddr == end_addr) ||
209 HeapWord* start_addr, HeapWord* end_addr) cons
141 getAndClearMarkedRegion(HeapWord* start_addr, HeapWord* end_addr) argument
[all...]
H A DconcurrentMarkSweepGeneration.hpp145 HeapWord* end_addr) const;
148 HeapWord* end_addr) const;
151 HeapWord* end_addr);
H A DconcurrentMarkSweepGeneration.cpp744 _end_addr = gch->end_addr();
5360 HeapWord* end_addr = (HeapWord*)round_to((intptr_t)span.end(),
5378 if (this_span.end() > end_addr) {
5379 this_span.set_end(end_addr);
6545 HeapWord *next_addr, *end_addr, *last_addr;
6549 for (next_addr = mr.start(), end_addr = mr.end();
6550 next_addr < end_addr; next_addr = last_addr) {
6551 MemRegion dirty_region = getAndClearMarkedRegion(next_addr, end_addr);
6556 assert(last_addr == end_addr, "program logic");
/openjdk7/hotspot/agent/src/os/linux/
H A Dps_proc.c60 uintptr_t end_addr = addr + size; local
72 for (; ((intptr_t)aligned_addr % sizeof(long)) && aligned_addr < end_addr;
77 words = (end_addr - aligned_addr) / sizeof(long);
92 if (aligned_addr != end_addr) {
100 for (; aligned_addr != end_addr; aligned_addr++)
/openjdk7/hotspot/agent/src/os/bsd/
H A Dps_proc.c61 uintptr_t end_addr = addr + size; local
73 for (; ((intptr_t)aligned_addr % sizeof(int)) && aligned_addr < end_addr;
78 words = (end_addr - aligned_addr) / sizeof(int);
93 if (aligned_addr != end_addr) {
101 for (; aligned_addr != end_addr; aligned_addr++)
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DconcurrentMark.inline.hpp246 HeapWord* end_addr = MIN2(endWord(), mr.end()); local
248 if (end_addr > start_addr) {
251 BitMap::idx_t end_offset = heapWordToOffset(end_addr);
260 HeapWord* next_addr = MIN2(obj_addr + obj->size(), end_addr);
H A DconcurrentMark.hpp150 // the end of this run (stopping at "end_addr"). Return the MemRegion
155 MemRegion getAndClearMarkedRegion(HeapWord* addr, HeapWord* end_addr);
H A DconcurrentMark.cpp148 HeapWord* end_addr) {
150 start = MIN2(start, end_addr);
152 end = MIN2(end, end_addr);
147 getAndClearMarkedRegion(HeapWord* addr, HeapWord* end_addr) argument
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DmutableSpace.hpp73 HeapWord** end_addr() { return &_end; } function in class:MutableSpace
/openjdk7/hotspot/src/share/vm/memory/
H A DdefNewGeneration.hpp236 HeapWord** end_addr() const;
H A DgenCollectedHeap.hpp170 HeapWord** end_addr() const;
H A DblockOffsetTable.cpp410 HeapWord* end_addr = blk + blk_size;
440 size_t end_index = _array->index_for(end_addr - 1) + 1;
H A Dgeneration.hpp295 virtual HeapWord** end_addr() const { return NULL; } function in class:Generation
H A DgenCollectedHeap.cpp765 HeapWord** GenCollectedHeap::end_addr() const { function in class:GenCollectedHeap
766 return _gens[0]->end_addr();
1343 size_t actual_gap = pointer_delta((HeapWord*) (max_uintx-3), *(end_addr()));
H A DdefNewGeneration.cpp476 HeapWord** DefNewGeneration::end_addr() const { return eden()->end_addr(); } function in class:DefNewGeneration
H A Dspace.hpp944 HeapWord** end_addr() { return &_end; } function in class:ContiguousSpace
/openjdk7/hotspot/src/share/vm/gc_interface/
H A DcollectedHeap.hpp434 virtual HeapWord** end_addr() const { function in class:CollectedHeap

Completed in 129 milliseconds

12