Lines Matching refs:HeapWord
111 HeapWord* _bottom;
112 HeapWord* _end;
115 HeapWord* _saved_mark_word;
129 HeapWord* bottom() const { return _bottom; }
130 HeapWord* end() const { return _end; }
131 virtual void set_bottom(HeapWord* value) { _bottom = value; }
132 virtual void set_end(HeapWord* value) { _end = value; }
134 virtual HeapWord* saved_mark_word() const { return _saved_mark_word; }
136 void set_saved_mark_word(HeapWord* p) { _saved_mark_word = p; }
197 virtual bool is_free_block(const HeapWord* p) const = 0;
241 virtual HeapWord* object_iterate_careful(ObjectClosureCareful* cl);
242 virtual HeapWord* object_iterate_careful_m(MemRegion mr,
251 HeapWord* boundary = NULL);
257 virtual HeapWord* block_start_const(const void* p) const = 0;
263 inline virtual HeapWord* block_start(const void* p);
268 virtual size_t block_size(const HeapWord* addr) const = 0;
272 virtual bool block_is_obj(const HeapWord* addr) const = 0;
276 virtual bool obj_is_alive(const HeapWord* addr) const;
280 virtual HeapWord* allocate(size_t word_size) = 0;
283 virtual HeapWord* par_allocate(size_t word_size) = 0;
327 HeapWord* _boundary; // If non-NULL, process only non-NULL oops
329 HeapWord* _min_done; // ObjHeadPreciseArray precision requires
334 NOT_PRODUCT(HeapWord* _last_bottom;)
335 NOT_PRODUCT(HeapWord* _last_explicit_min_done;)
343 virtual HeapWord* get_actual_top(HeapWord* top, HeapWord* top_obj);
351 virtual void walk_mem_region(MemRegion mr, HeapWord* bottom, HeapWord* top);
356 HeapWord* boundary) :
365 void set_min_done(HeapWord* min_done) {
370 void set_last_bottom(HeapWord* last_bottom) {
382 HeapWord* threshold;
384 HeapWord* _threshold) :
400 HeapWord* _compaction_top;
412 HeapWord* compaction_top() const { return _compaction_top; }
414 void set_compaction_top(HeapWord* value) {
461 virtual HeapWord* initialize_threshold() { return end(); }
475 virtual HeapWord* forward(oop q, size_t size, CompactPoint* cp,
476 HeapWord* compact_top);
483 HeapWord* _first_dead;
484 HeapWord* _end_of_live;
492 virtual HeapWord* cross_threshold(HeapWord* start, HeapWord* the_end) {
503 bool insert_deadspace(size_t& allowed_deadspace_words, HeapWord* q,
511 HeapWord* compact_top; /* This is where we are currently compacting to. */ \
545 HeapWord* q = bottom(); \
546 HeapWord* t = scan_limit(); \
548 HeapWord* end_of_live= q; /* One byte beyond the last byte of the last \
550 HeapWord* first_dead = end();/* The first dead object. */ \
572 HeapWord* end = q; \
634 HeapWord* q = bottom(); \
635 HeapWord* t = _end_of_live; /* Established by "prepare_for_compaction". */ \
644 HeapWord* end = _first_dead; \
673 q = (HeapWord*)oop(_first_dead)->mark()->decode_pointer(); \
679 debug_only(HeapWord* prev_q = NULL); \
697 q = (HeapWord*) oop(q)->mark()->decode_pointer(); \
709 HeapWord* q = bottom(); \
710 HeapWord* const t = _end_of_live; \
711 debug_only(HeapWord* prev_q = NULL); \
719 HeapWord* const end = _first_dead; \
735 q = (HeapWord*) oop(_first_dead)->mark()->decode_pointer(); \
745 q = (HeapWord*) oop(q)->mark()->decode_pointer(); \
753 HeapWord* compaction_top = (HeapWord*)oop(q)->forwardee(); \
795 HeapWord* _top;
796 HeapWord* _concurrent_iteration_safe_limit;
803 inline HeapWord* allocate_impl(size_t word_size, HeapWord* end_value);
804 inline HeapWord* par_allocate_impl(size_t word_size, HeapWord* end_value);
814 HeapWord* top() const { return _top; }
815 void set_top(HeapWord* value) { _top = value; }
829 void set_top_for_allocations(HeapWord* v) PRODUCT_RETURN;
842 void check_mangled_unused_area(HeapWord* limit) PRODUCT_RETURN;
855 virtual bool is_free_block(const HeapWord* p) const;
866 virtual HeapWord* allocate(size_t word_size);
867 virtual HeapWord* par_allocate(size_t word_size);
870 return (HeapWord*)obj >= saved_mark_word();
882 HeapWord* object_iterate_careful(ObjectClosureCareful* cl);
883 HeapWord* concurrent_iteration_safe_limit() {
890 void set_concurrent_iteration_safe_limit(HeapWord* new_limit) {
916 HeapWord* boundary = NULL);
937 virtual HeapWord* block_start_const(const void* p) const;
938 size_t block_size(const HeapWord* p) const;
940 bool block_is_obj(const HeapWord* p) const { return p < top(); }
943 HeapWord** top_addr() { return &_top; }
944 HeapWord** end_addr() { return &_end; }
973 HeapWord* bottom, HeapWord* top);
983 HeapWord* bottom, HeapWord* top,
986 HeapWord* bottom, HeapWord* top,
992 HeapWord* boundary) :
1009 HeapWord* get_actual_top(HeapWord* top, HeapWord* top_obj);
1012 HeapWord* bottom, HeapWord* top,
1015 HeapWord* bottom, HeapWord* top,
1021 HeapWord* boundary) :
1039 HeapWord* _soft_end;
1046 HeapWord* soft_end() { return _soft_end; }
1047 HeapWord** soft_end_addr() { return &_soft_end; }
1048 void set_soft_end(HeapWord* value) { _soft_end = value; }
1054 void set_end(HeapWord* value) {
1060 HeapWord* allocate(size_t word_size);
1061 HeapWord* par_allocate(size_t word_size);
1072 HeapWord* par_allocate(size_t word_size);
1092 void set_bottom(HeapWord* value);
1093 void set_end(HeapWord* value);
1097 inline HeapWord* block_start_const(const void* p) const;
1100 virtual inline HeapWord* allocate(size_t word_size);
1101 inline HeapWord* par_allocate(size_t word_size);
1104 virtual HeapWord* initialize_threshold();
1105 virtual HeapWord* cross_threshold(HeapWord* start, HeapWord* end);