Searched refs:next (Results 1 - 14 of 14) sorted by relevance
| /seL4-mcs-10.1.1/include/benchmark/ |
| H A D | benchmark_utilisation.h | 36 static inline void benchmark_utilisation_switch(tcb_t *heir, tcb_t *next) argument
53 /* Reset next thread utilisation */
54 next->benchmark.schedule_start_time = ksEnter;
|
| /seL4-mcs-10.1.1/include/smp/ |
| H A D | lock.h | 42 clh_qnode_t *next; member in struct:clh_qnode_p
98 big_kernel_lock.node_owners[cpu].next = prev;
102 while (big_kernel_lock.node_owners[cpu].next->value != CLHState_Granted) {
129 big_kernel_lock.node_owners[cpu].next;
|
| /seL4-mcs-10.1.1/src/object/ |
| H A D | cnode.c | 542 cte_t *prev, *next; local
546 next = CTE_PTR(mdb_node_get_mdbNext(mdbNode));
549 mdb_node_ptr_set_mdbNext(&prev->cteMDBNode, CTE_REF(next));
551 if (next) {
552 mdb_node_ptr_set_mdbPrev(&next->cteMDBNode, CTE_REF(prev));
554 if (next)
555 mdb_node_ptr_set_mdbFirstBadged(&next->cteMDBNode,
556 mdb_node_get_mdbFirstBadged(next->cteMDBNode) ||
724 cte_t *next; local
726 next
780 cte_t *next; local
826 cte_t *next; local
[all...] |
| H A D | endpoint.c | 320 tcb_t *thread, *next; local
330 for (thread = queue.head; thread; thread = next) {
333 next = thread->tcbEPNext;
|
| /seL4-mcs-10.1.1/src/kernel/ |
| H A D | sporadic.c | 39 /* return the index of the next item in the refill queue */
77 word_t next = refill_next(sc, sc->scRefillHead); local
80 if (!(REFILL_INDEX(sc, current).rTime <= REFILL_INDEX(sc, next).rTime)) {
84 current = next;
85 next = refill_next(sc, current);
212 /* otherwise schedule the rest for the next period */
262 /* due to overrun delay next replenishment */
315 /* merge remnant with next replenishment - either it's too small
|
| /seL4-mcs-10.1.1/src/smp/ |
| H A D | ipi.c | 48 while (big_kernel_lock.node_owners[getCurrentCPUIndex()].next->value != CLHState_Granted) {
|
| /seL4-mcs-10.1.1/manual/parts/ |
| H A D | notifications.tex | 56 next time the notification is signalled.
|
| H A D | vspace.tex | 37 In general, each paging structure at each level contains slots where the next level paging structure,
183 Each architecture also defines a range of page sizes. In the next section we show the available page
|
| H A D | io.tex | 158 The next 5 bits are the device identifier: the number of the device on
|
| H A D | cspace.tex | 333 different, lookup fails. Otherwise, the kernel then uses the next
336 refers. The slot~$s$ identified by these next \emph{radix} bits might
518 match the next bits of the CPTR being resolved. \\ \\
|
| H A D | threads.tex | 126 their next period.
130 replenishment which can result in preemption if the next replenishment is not yet available.
138 block until the next replenishment is ready to be used.
307 reply with an error to the client, then reset the server to handle the next
|
| H A D | objects.tex | 197 replying to a request and waiting for the next can be performed in
219 which will be scheduled when the next replenishment is due, see \autoref{sec:scheduling_contexts}.
|
| /seL4-mcs-10.1.1/manual/tools/ |
| H A D | parse_doxygen_xml.py | 152 ret_type = six.next(types_iter)
156 param_type = six.next(types_iter).text
|
| /seL4-mcs-10.1.1/tools/ |
| H A D | lex.py | 116 # token() - Get the next token
307 # opttoken() - Return the next token from the Lexer
359 # Every function must return a token, if nothing, we just move to next token
413 def next(self): member in class:Lexer
419 __next__ = next
|
Completed in 120 milliseconds