Mercurial Mercurial > jdk-sandbox / comparison
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
hotspot/src/share/vm/gc_implementation/parallelScavenge/psParallelCompact.cpp
changeset 6759 67b1a69ef5aa
parent 5918 73b96456819a
child 6762 f8d1b560700e
equal deleted inserted replaced
6451:516540f1f076 6759:67b1a69ef5aa 
  2447 {
 
  2447 {
 
  2448   TraceTime tm("drain task setup", print_phases(), true, gclog_or_tty);
 
  2448   TraceTime tm("drain task setup", print_phases(), true, gclog_or_tty);
 
  2449 
  2449 
  2450   const unsigned int task_count = MAX2(parallel_gc_threads, 1U);
 
  2450   const unsigned int task_count = MAX2(parallel_gc_threads, 1U);
 
  2451   for (unsigned int j = 0; j < task_count; j++) {
 
  2451   for (unsigned int j = 0; j < task_count; j++) {
 
  2452     q->enqueue(new DrainStacksCompactionTask());
 
  2452     q->enqueue(new DrainStacksCompactionTask(j));
 
  2453   }
 
  2453   }
 
  2454 
  2454 
  2455   // Find all regions that are available (can be filled immediately) and
 
  2455   // Find all regions that are available (can be filled immediately) and
 
  2456   // distribute them to the thread stacks.  The iteration is done in reverse
 
  2456   // distribute them to the thread stacks.  The iteration is done in reverse
 
  2457   // order (high to low) so the regions will be removed in ascending order.
 
  2457   // order (high to low) so the regions will be removed in ascending order.
jdk-sandbox