Lines Matching refs:workers
1015 // Calculates the number of active workers for a concurrent
1028 1, /* Minimum workers */
1039 // concurrent workers should be 0.
1532 assert( _g1h->workers()->active_workers() > 0,
1534 _n_workers = _g1h->workers()->active_workers();
1657 assert( _g1h->workers()->active_workers() > 0,
1659 _n_workers = _g1h->workers()->active_workers();
1775 _g1h->workers()->active_workers(),
1885 g1h->workers()->run_task(&g1_par_count_task);
1912 g1h->workers()->run_task(&g1_par_verify_task);
1946 g1h->workers()->run_task(&g1_par_note_end_task);
1970 g1h->workers()->run_task(&g1_par_scrub_rs_task);
2096 // of the workers interfering with each other that could occur if
2223 WorkGang* workers,
2226 _workers(workers), _active_workers(n_workers) { }
2268 // how many workers to wait for.
2300 // how many workers to wait for.
2364 bool processing_is_mt = rp->processing_is_mt() && g1h->workers() != NULL;
2365 uint active_workers = (processing_is_mt ? g1h->workers()->active_workers() : 1U);
2370 g1h->workers(), active_workers);
2381 // the number of active workers. This is OK as long as the discovered
2465 uint active_workers = g1h->workers()->active_workers();
2469 g1h->workers()->set_active_workers(active_workers);
2474 // constructor and pass values of the active workers
2482 g1h->workers()->run_task(&remarkTask);
3059 _g1h->workers()->active_workers() :
3069 _g1h->workers()->run_task(&g1_par_agg_task);