Lines Matching refs:workers
324 // job not having all the expected active workers. For example if on
325 // job requests 4 active workers out of a total of 10 workers so the
326 // remaining 6 are "idled", if the next job requests 6 active workers
327 // but all 6 of the "idled" workers are still idle, then the next job
328 // will only get 4 active workers.
338 // 1-n be the active workers. This was undesirable because it required
340 // list of stacks equal in number to the active workers are filled
369 const uint _workers; // Number of workers.
373 uint _active_workers; // Number of active workers.
374 uint _busy_workers; // Number of busy workers.
383 WaitForBarrierGCTask* _idle_inactive_task;// Task for inactive workers
384 volatile uint _idle_workers; // Number of idled workers
387 static GCTaskManager* create(uint workers) {
388 return new GCTaskManager(workers);
390 static GCTaskManager* create(uint workers, NotifyDoneClosure* ndc) {
391 return new GCTaskManager(workers, ndc);
428 // Request that all workers release their resources.
434 // Create IdleGCTasks for inactive workers and start workers
436 // Release the workers in IdleGCTasks
453 // Create a GCTaskManager with the appropriate number of workers.
454 GCTaskManager(uint workers);
456 GCTaskManager(uint workers, NotifyDoneClosure* ndc);
460 uint workers() const {
464 assert(v <= _workers, "Trying to set more workers active than there are");
466 assert(v != 0, "Trying to set active workers to 0");
497 // Count of busy workers.
503 // Count of tasks delivered to workers.
513 // Count of tasks completed by workers.
564 // Return true if all workers are currently active.
565 bool all_workers_active() { return workers() == active_workers(); }
738 // the maximum workers are wanted.