Searched refs:_bottom (Results 1 - 19 of 19) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DimmutableSpace.hpp39 HeapWord* _bottom; member in class:ImmutableSpace
43 ImmutableSpace() { _bottom = NULL; _end = NULL; }
44 HeapWord* bottom() const { return _bottom; }
52 bool contains(const void* p) const { return _bottom <= p && p < _end; }
H A DparGCAllocBuffer.hpp42 HeapWord* _bottom; member in class:ParGCAllocBuffer
89 assert(pointer_delta(_top, _bottom) >= word_sz, "Bad undo");
112 return (void*)_bottom <= addr && addr < (void*)_hard_end;
117 _bottom = buf;
118 _top = _bottom;
119 _hard_end = _bottom + word_sz();
155 _bottom = _end; // force future contains() queries to return false
H A DmutableSpace.hpp75 virtual void set_bottom(HeapWord* value) { _bottom = value; }
117 bool contains(const void* p) const { return _bottom <= p && p < _end; }
H A DimmutableSpace.cpp39 _bottom = bottom;
H A DparGCAllocBuffer.cpp32 _word_sz(desired_plab_sz_), _bottom(NULL), _top(NULL),
131 gclog_or_tty->print("parGCAllocBuffer: _bottom: %p _top: %p _end: %p _hard_end: %p"
133 _bottom, _top, _end, _hard_end,
149 _bt(bsa, MemRegion(_bottom, _hard_end)),
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsPromotionLAB.hpp50 HeapWord* _bottom; member in class:PSPromotionLAB
55 void set_bottom(HeapWord* value) { _bottom = value; }
61 PSPromotionLAB() : _top(NULL), _bottom(NULL), _end(NULL) { }
70 HeapWord* bottom() const { return _bottom; }
84 bool contains(const void* p) const { return _bottom <= p && p < _end; }
H A DvmStructs_parallelgc.hpp40 nonstatic_field(ImmutableSpace, _bottom, HeapWord*) \
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1BlockOffsetTable.cpp107 _unallocated_block(_bottom),
110 assert(_bottom <= _end, "arguments out of order");
183 assert(start_card > _array->index_for(_bottom), "Cannot be first card");
351 assert(_bottom <= addr && addr < _end,
368 assert(_bottom <= addr && addr < _end,
431 assert(_bottom <= addr && addr < _end,
461 HeapWord* new_end = _bottom + new_word_size;
475 _bottom = mr.start();
600 size_t from_index = _array->index_for(_bottom);
604 _bottom, _en
[all...]
H A Dg1BlockOffsetTable.hpp64 HeapWord* _bottom; // == reserved.start member in class:VALUE_OBJ_CLASS_SPEC
71 _bottom(bottom), _end(end)
73 assert(_bottom <= _end, "arguments out of order");
84 _bottom = new_bottom;
85 resize(pointer_delta(_end, _bottom));
371 // Resets the covered region to one with the same _bottom as before but
505 // Zero out the entry for _bottom (offset will be zero).
H A Dg1BlockOffsetTable.inline.hpp32 if (addr >= _bottom && addr < _end) {
41 if (addr >= _bottom && addr < _end) {
H A DheapRegion.hpp470 return _bottom <= p && p < _orig_end;
/openjdk7/hotspot/src/share/vm/utilities/
H A Dtaskqueue.hpp142 volatile uint _bottom; member in class:TaskQueueSuper
205 // _bottom == _top+1. The pop_local could succeed in decrementing _bottom,
215 // _bottom == top so subsequent pushes will be performed normally.
220 TaskQueueSuper() : _bottom(0), _age() {}
223 bool peek() const { return _bottom != _age.top(); }
230 return size(_bottom, _age.top());
234 return dirty_size(_bottom, _age.top());
238 _bottom = 0;
261 using TaskQueueSuper<N, F>::_bottom;
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A DblockOffsetTable.hpp56 HeapWord* _bottom; // == reserved.start member in class:VALUE_OBJ_CLASS_SPEC
63 _bottom(bottom), _end(end) {
64 assert(_bottom <= _end, "arguments out of order");
73 _bottom = new_bottom;
74 resize(pointer_delta(_end, _bottom));
352 _bottom = mr.start();
359 HeapWord* new_end = _bottom + new_word_size;
429 _unallocated_block(_bottom) { }
441 assert(block >= _bottom && block <= _end, "out of range");
543 // Zero out the entry for _bottom (offse
[all...]
H A DblockOffsetTable.inline.hpp39 if (addr >= _bottom && addr < _end) {
H A DblockOffsetTable.cpp120 assert(_bottom <= _end, "arguments out of order");
195 assert(start_card > _array->index_for(_bottom), "Cannot be first card");
528 assert(_bottom <= addr && addr < _end,
591 assert(_bottom <= addr && addr < _end,
657 if (_unallocated_block == _bottom) {
672 assert(_bottom <= addr && addr < _end,
790 _next_offset_index = _array->index_for(_bottom);
800 size_t bottom_index = _array->index_for(_bottom);
H A Dspace.hpp111 HeapWord* _bottom; member in class:Space
125 _bottom(NULL), _end(NULL), _preconsumptionDirtyCardClosure(NULL) { }
129 HeapWord* bottom() const { return _bottom; }
131 virtual void set_bottom(HeapWord* value) { _bottom = value; }
194 bool is_in_reserved(const void* p) const { return _bottom <= p && p < _end; }
H A Dspace.cpp308 return _bottom <= p && p < _top;
/openjdk7/jdk/src/macosx/classes/apple/laf/
H A DJRSUIConstants.java242 private static final byte _bottom = 3; field in class:JRSUIConstants.AlignmentVertical
243 public static final AlignmentVertical BOTTOM = new AlignmentVertical(_bottom);
/openjdk7/hotspot/src/share/vm/runtime/
H A DvmStructs.cpp499 nonstatic_field(BlockOffsetTable, _bottom, HeapWord*) \
608 nonstatic_field(Space, _bottom, HeapWord*) \

Completed in 2570 milliseconds