Searched refs:to_space (Results 1 - 18 of 18) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsScavenge.inline.hpp36 _to_space_top_before_gc = heap->young_gen()->to_space()->top();
47 inline bool PSScavenge::should_scavenge(T* p, MutableSpace* to_space) { argument
50 // Skip objects copied to to_space since the scavenge started.
52 return addr < to_space_top_before_gc() || addr >= to_space->end();
61 return should_scavenge(p, heap->young_gen()->to_space());
H A DasPSYoungGen.cpp85 // Future implementations could check the survivors and if to_space is in the
86 // right place (below from_space), take a chunk from to_space.
131 // If to_space is below from_space, to_space is not considered.
132 // to_space can be.
247 if ((!eden_space()->is_empty()) || (!to_space()->is_empty())) {
272 to_space()->bottom(),
273 to_space()->end(),
274 pointer_delta( to_space()->end(),
275 to_space()
[all...]
H A DpsYoungGen.cpp203 to_space()->initialize(to_mr , true, ZapUnusedHeapArea);
215 guarantee(to_space()->capacity_in_bytes() >= alignment, "to too small");
222 char* to_start = (char*)to_space()->bottom();
223 char* to_end = (char*)to_space()->end();
246 to_space()->capacity_in_bytes() +
252 char* to_top = (char*)to_space()->top();
444 if ((!eden_space()->is_empty()) || (!to_space()->is_empty())) {
469 to_space()->bottom(),
470 to_space()->end(),
471 pointer_delta( to_space()
[all...]
H A DpsPromotionLAB.cpp143 MutableSpace* to_space = heap->young_gen()->to_space(); local
144 MemRegion used = to_space->used_region();
H A DpsScavenge.hpp58 // Saved value of to_space->top(), used to prevent objects in to_space from
134 // the object was not newly copied into to_space. The version with the bool
135 // argument is a convenience wrapper that fetches the to_space pointer from
137 template <class T> static inline bool should_scavenge(T* p, MutableSpace* to_space);
H A DpsMarkSweep.cpp225 young_gen->to_space()->mangle_unused_area_complete();
238 young_gen->to_space()->is_empty();
293 young_gen->to_space()->capacity_in_bytes(),
297 young_gen->to_space()->capacity_in_bytes();
442 young_gen->to_space()->used_in_bytes() / K,
490 MutableSpace* to_space = young_gen->to_space(); local
491 _preserved_marks = (PreservedMark*)to_space->top();
495 _preserved_count_max = pointer_delta(to_space->end(), to_space
[all...]
H A DpsScavenge.cpp97 _to_space = heap->young_gen()->to_space();
359 assert(young_gen->to_space()->is_empty(),
360 "Attempt to scavenge with live objects in to_space");
361 young_gen->to_space()->clear(SpaceDecorator::Mangle);
363 young_gen->to_space()->mangle_unused_area();
571 young_gen->to_space()->capacity_in_bytes(),
575 young_gen->to_space()->capacity_in_bytes();
616 assert(young_gen->to_space()->is_empty(), "to space should be empty now");
675 young_gen->to_space()->check_mangled_unused_area_complete();
763 // Do not attempt to promote unless to_space i
[all...]
H A DpsPromotionManager.cpp46 _young_space = heap->young_gen()->to_space();
83 _young_space = heap->young_gen()->to_space();
210 MutableSpace* to_space = heap->young_gen()->to_space(); local
H A DpsYoungGen.hpp115 MutableSpace* to_space() const { return _to_space; } function in class:PSYoungGen
H A DparallelScavengeHeap.cpp236 young_gen()->to_space()->capacity_in_bytes(),
315 estimated -= young_gen()->to_space()->capacity_in_bytes();
914 MutableSpace* to = young_gen()->to_space();
915 SpaceSummary to_space(to->bottom(), to->end(), to->used_in_bytes());
918 return PSHeapSummary(heap_summary, used(), old_summary, old_space, young_summary, eden_space, from_space, to_space);
1054 young_gen()->to_space()->mangle_unused_area();
H A DpsParallelCompact.cpp927 _space_info[to_space_id].set_space(young_gen->to_space());
1013 _space_info[to_space_id].set_space(heap->young_gen()->to_space());
1068 MutableSpace* const to_space = _space_info[to_space_id].space(); local
1082 to_space->is_empty();
2173 young_gen->to_space()->capacity_in_bytes(),
2177 young_gen->to_space()->capacity_in_bytes();
2342 young_gen->to_space()->used_in_bytes() / K,
/openjdk7/hotspot/src/share/vm/services/
H A DpsMemoryPool.hpp69 return _gen->max_size() - _gen->from_space()->capacity_in_bytes() - _gen->to_space()->capacity_in_bytes();
H A DpsMemoryPool.cpp73 (gen->max_size() - gen->from_space()->capacity_in_bytes() - gen->to_space()->capacity_in_bytes()),
/openjdk7/hotspot/src/share/vm/memory/
H A DdefNewGeneration.cpp840 if (to_space->top() > to_space->bottom()) {
841 trace("to_space not empty when contribute_scratch called");
845 ContiguousSpace* to_space = to(); local
846 assert(to_space->end() >= to_space->top(), "pointers out of order");
847 size_t free_words = pointer_delta(to_space->end(), to_space->top());
849 ScratchBlock* sb = (ScratchBlock*)to_space->top();
857 // If contributing scratch in to_space, mangl
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parNew/
H A DasParNewGeneration.cpp90 if (from_space()->end() > to_space()->end()) {
93 space_shrinking = to_space();
H A DparNewGeneration.cpp147 // object is in to_space
168 // object is in to_space
229 Space* const sp = to_space();
297 Space& to_space,
334 int num_threads, Space& to_space, ParNewGeneration& gen,
347 ParScanThreadState(&to_space, &gen, &old_gen, i, &queue_set,
1265 // Must be in to_space.
1380 // Must be in to_space.
333 ParScanThreadStateSet( int num_threads, Space& to_space, ParNewGeneration& gen, Generation& old_gen, ObjToScanQueueSet& queue_set, Stack<oop, mtGC>* overflow_stacks, size_t desired_plab_sz, ParallelTaskTerminator& term) argument
H A DparNewGeneration.hpp87 Space* to_space() { return _to_space; } function in class:ParScanThreadState
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.cpp5186 ContiguousSpace* to_space = dng->to();
5196 do_young_space_rescan(worker_id, &par_mrias_cl, to_space, NULL, 0);

Completed in 91 milliseconds