Searched refs:n_tasks (Results 1 - 3 of 3) sorted by relevance

/openjdk7/hotspot/src/share/vm/utilities/
H A Dworkgroup.hpp478 uint n_tasks() const { return _n_tasks; } function in class:SequentialSubTasksDone
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp2980 size_t n_tasks = (used_region().word_size() + task_size - 1)/task_size;
2981 assert((n_tasks == 0) == used_region().is_empty(), "n_tasks incorrect");
2982 assert(n_tasks == 0 ||
2983 ((used_region().start() + (n_tasks - 1)*task_size < used_region().end()) &&
2984 (used_region().start() + n_tasks*task_size >= used_region().end())),
2985 "n_tasks calculation incorrect");
2991 pst->set_n_tasks((int)n_tasks);
3022 size_t n_tasks = (span.word_size() + task_size - 1)/task_size;
3023 assert((n_tasks
[all...]
H A DconcurrentMarkSweepGeneration.cpp4007 int n_tasks = pst->n_tasks();
4010 assert(pst->valid() || n_tasks == 0, "Uninitialized use?");
5276 uint n_tasks = pst->n_tasks();
5282 assert(nth_task == 0 && n_tasks == 1, "Can have only 1 EdenSpace task");
5380 assert(!this_span.is_empty(), "Program logic (calculation of n_tasks)");
5561 size_t n_tasks = _eden_chunk_index + 1;
5562 assert(n_tasks == 1 || _eden_chunk_array != NULL, "Error");
5566 pst->set_n_tasks((int)n_tasks);
[all...]

Completed in 692 milliseconds