Searched refs:blk_end (Results 1 - 7 of 7) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1BlockOffsetTable.hpp309 void do_block_internal(HeapWord* blk_start, HeapWord* blk_end, Action action);
352 HeapWord* blk_start, HeapWord* blk_end);
377 virtual void alloc_block(HeapWord* blk_start, HeapWord* blk_end);
397 void single_block(HeapWord* blk_start, HeapWord* blk_end);
407 void mark_block(HeapWord* blk_start, HeapWord* blk_end);
416 inline void allocated(HeapWord* blk_start, HeapWord* blk_end) {
418 verify_single_block(blk_start, blk_end);
420 _unallocated_block = MAX2(_unallocated_block, blk_end);
428 inline void freed(HeapWord* blk_start, HeapWord* blk_end);
444 // that the block [blk_start, blk_end) o
[all...]
H A Dg1BlockOffsetTable.cpp206 // The block [blk_start, blk_end) has been allocated;
208 // right-open interval: [blk_start, blk_end)
210 G1BlockOffsetArray::alloc_block(HeapWord* blk_start, HeapWord* blk_end) { argument
211 mark_block(blk_start, blk_end);
212 allocated(blk_start, blk_end);
227 // Action_mark - update the BOT for the block [blk_start, blk_end).
232 HeapWord* blk_end,
236 assert(Universe::heap()->is_in_reserved(blk_end-1),
240 uintptr_t end_ui = (uintptr_t)(blk_end - 1);
250 size_t end_index = _array->index_for(blk_end
231 do_block_internal(HeapWord* blk_start, HeapWord* blk_end, Action action) argument
336 single_block(HeapWord* blk_start, HeapWord* blk_end) argument
346 mark_block(HeapWord* blk_start, HeapWord* blk_end) argument
489 alloc_block_work2(HeapWord** threshold_, size_t* index_, HeapWord* blk_start, HeapWord* blk_end) argument
[all...]
H A Dg1BlockOffsetTable.inline.hpp141 inline void G1BlockOffsetArray::freed(HeapWord* blk_start, HeapWord* blk_end) {
142 // Verify that the BOT shows [blk_start, blk_end) to be one block.
143 verify_single_block(blk_start, blk_end);
149 if (blk_end >= _unallocated_block && blk_start <= _unallocated_block) {
/openjdk7/hotspot/src/share/vm/memory/
H A DblockOffsetTable.inline.hpp85 HeapWord* blk_end) {
86 // Verify that the BOT shows [blk_start, blk_end) to be one block.
87 verify_single_block(blk_start, blk_end);
93 if (blk_end >= _unallocated_block && blk_start <= _unallocated_block) {
84 freed(HeapWord* blk_start, HeapWord* blk_end) argument
H A DblockOffsetTable.cpp250 BlockOffsetArray::alloc_block(HeapWord* blk_start, HeapWord* blk_end) { argument
251 assert(blk_start != NULL && blk_end > blk_start,
253 single_block(blk_start, blk_end);
256 // Action_mark - update the BOT for the block [blk_start, blk_end).
262 HeapWord* blk_end,
266 assert(Universe::heap()->is_in_reserved(blk_end-1),
270 uintptr_t end_ui = (uintptr_t)(blk_end - 1);
280 size_t end_index = _array->index_for(blk_end - 1);
323 // The range [blk_start, blk_end) represents a single contiguous block
325 // information; Right-open interval: [blk_start, blk_end)
261 do_block_internal(HeapWord* blk_start, HeapWord* blk_end, Action action, bool reducing) argument
328 single_block(HeapWord* blk_start, HeapWord* blk_end) argument
382 alloc_block(HeapWord* blk_start, HeapWord* blk_end) argument
520 mark_block(HeapWord* blk_start, HeapWord* blk_end, bool reducing) argument
629 verify_single_block( HeapWord* blk_start, HeapWord* blk_end) argument
[all...]
H A DblockOffsetTable.hpp334 void do_block_internal(HeapWord* blk_start, HeapWord* blk_end, Action action, bool reducing = false);
375 void single_block(HeapWord* blk_start, HeapWord* blk_end);
383 // [blk_start, blk_end) would return the value blk_start, provided
387 // These methods expect to be called with [blk_start, blk_end)
389 virtual void alloc_block(HeapWord* blk_start, HeapWord* blk_end);
445 // These methods expect to be called with [blk_start, blk_end)
447 void alloc_block(HeapWord* blk_start, HeapWord* blk_end);
469 void mark_block(HeapWord* blk_start, HeapWord* blk_end, bool reducing = false);
478 void allocated(HeapWord* blk_start, HeapWord* blk_end, bool reducing = false) {
480 verify_single_block(blk_start, blk_end);
[all...]
/openjdk7/hotspot/src/share/vm/ci/
H A DbcEscapeAnalyzer.cpp1128 int blk_end = blk->limit_bci(); local
1134 if ((ex_start >= blk_start && ex_start < blk_end) ||
1135 (ex_end > blk_start && ex_end <= blk_end)) {

Completed in 57 milliseconds