|
PatchworkOS
|
Scheduling queues structure. More...
#include <sched.h>
Data Fields | |
| uint64_t | length |
| The total number of threads in all lists. | |
| uint64_t | bitmap |
| A bitmap indicating which of the lists have threads in them. | |
| list_t | lists [PRIORITY_MAX] |
| An array of lists that store threads, one for each priority, used in a round robin fashion. | |
Scheduling queues structure.
The sched_queues_t structure represents a set of scheduling queues, with one queue for each priority level and a bitmap for faster lookups.
| uint64_t sched_queues_t::bitmap |
A bitmap indicating which of the lists have threads in them.
Definition at line 41 of file sched.h.
Referenced by sched_queues_init(), sched_queues_pop(), and sched_queues_push().
| uint64_t sched_queues_t::length |
The total number of threads in all lists.
Definition at line 37 of file sched.h.
Referenced by sched_get_load(), sched_invoke(), sched_queues_init(), sched_queues_pop(), and sched_queues_push().
| list_t sched_queues_t::lists[PRIORITY_MAX] |
An array of lists that store threads, one for each priority, used in a round robin fashion.
Definition at line 45 of file sched.h.
Referenced by sched_queues_init(), sched_queues_pop(), and sched_queues_push().