Lines Matching refs:will
64 The scheduler ready queue will be implemented as a simple unordered list, with
67 that will never see more than a small number (3, maybe) of runnable threads in
73 The scheduler ready queue will be implemented as a red/black tree. This has
76 an extra ~2kb of code. The resulting behavior will scale cleanly and
84 When selected, the scheduler ready queue will be implemented as the
107 When selected, the wait_q will be implemented with a balanced tree. Choose
112 queues will be somewhat slower (though this is not generally a performance
117 When selected, the wait_q will be implemented with a doubly-linked list.
148 than that of the sleeping thread will actually be scheduled before
207 action that makes it unready, the scheduler will switch the locking thread out
284 Making the CPU idle is simple: call the k_cpu_idle() API. The CPU will stop
285 executing instructions until an event occurs. Most likely, the function will