Searched refs:next (Results 76 - 100 of 160) sorted by relevance

1234567

/seL4-refos-master/projects/seL4_libs/libsel4utils/src/
H A Dslab.c21 /* next free object in the slab */
22 seL4_CPtr next; member in struct:__anon806
79 if (slab->next == slab->n) {
85 vka_cspace_make_path(sdata->delegate, slab->objects[slab->next].cptr, &src);
91 slab->next++;
111 //TODO this should be possible - swap the object in at next, but do we need it?
162 slab->next = 0;
/seL4-refos-master/kernel/src/object/
H A Dcnode.c571 cte_t *prev, *next; local
575 next = CTE_PTR(mdb_node_get_mdbNext(mdbNode));
578 mdb_node_ptr_set_mdbNext(&prev->cteMDBNode, CTE_REF(next));
580 if (next) {
581 mdb_node_ptr_set_mdbPrev(&next->cteMDBNode, CTE_REF(prev));
583 if (next)
584 mdb_node_ptr_set_mdbFirstBadged(&next->cteMDBNode,
585 mdb_node_get_mdbFirstBadged(next->cteMDBNode) ||
747 cte_t *next; local
749 next
818 cte_t *next; local
862 cte_t *next; local
[all...]
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/src/
H A Dtimeout.c373 /* early wakeup from combat won't be possible until next monster turn */
1353 for (curr = base; curr; curr = curr->next) {
1399 for (curr = timer_base; curr; curr = curr->next)
1428 timer_base = curr->next;
1453 gnu->next = 0;
1507 for (count = 0, curr = timer_base; curr; curr = curr->next)
1529 next_timer = curr->next; /* things may be inserted */
1549 next_timer = curr->next;
1552 prev->next = curr->next;
[all...]
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/
H A Dtimeout.c373 /* early wakeup from combat won't be possible until next monster turn */
1353 for (curr = base; curr; curr = curr->next) {
1399 for (curr = timer_base; curr; curr = curr->next)
1428 timer_base = curr->next;
1453 gnu->next = 0;
1507 for (count = 0, curr = timer_base; curr; curr = curr->next)
1529 next_timer = curr->next; /* things may be inserted */
1549 next_timer = curr->next;
1552 prev->next = curr->next;
[all...]
/seL4-refos-master/projects/seL4_libs/libsel4utils/src/vspace/
H A Dvspace.c71 reservation->next = NULL;
75 reservation->next = data->reservation_head;
82 sel4utils_res_t *current = prev->next;
87 reservation->next = current;
88 prev->next = reservation;
92 current = current->next;
96 prev->next = reservation;
103 data->reservation_head = data->reservation_head->next;
104 reservation->next = NULL;
109 sel4utils_res_t *current = prev->next;
[all...]
/seL4-refos-master/libs/libsel4utils/src/vspace/
H A Dvspace.c71 reservation->next = NULL;
75 reservation->next = data->reservation_head;
82 sel4utils_res_t *current = prev->next;
87 reservation->next = current;
88 prev->next = reservation;
92 current = current->next;
96 prev->next = reservation;
103 data->reservation_head = data->reservation_head->next;
104 reservation->next = NULL;
109 sel4utils_res_t *current = prev->next;
[all...]
/seL4-refos-master/libs/libsel4allocman/include/allocman/utspace/
H A Dsplit.h37 /* if this node is not allocated then these are the next/previous pointers in the free list */
38 struct utspace_split_node *next, *prev; member in struct:utspace_split_node
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/
H A Dwinami.h16 struct amii_mi *next; member in struct:amii_mi
H A Ddungeon.h23 struct s_level *next; member in struct:s_level
72 struct branch *next; /* next in the branch chain */ member in struct:branch
/seL4-refos-master/projects/refos/impl/apps/tetris/src/
H A Dtetris.c86 /*! @brief Peek preview of next shape. */
173 /* Render the next piece preview. */
256 /*! @brief Randomly select a next shape. */
260 int *next = peekShape; local
262 if (!next) next = &shapes[rand() % 7 * 4];
263 return next;
/seL4-refos-master/projects/seL4_libs/libsel4allocman/include/allocman/utspace/
H A Dsplit.h37 /* if this node is not allocated then these are the next/previous pointers in the free list */
38 struct utspace_split_node *next, *prev; member in struct:utspace_split_node
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/
H A Dwinami.h16 struct amii_mi *next; member in struct:amii_mi
H A Ddungeon.h23 struct s_level *next; member in struct:s_level
72 struct branch *next; /* next in the branch chain */ member in struct:branch
/seL4-refos-master/apps/tetris/src/
H A Dtetris.c86 /*! @brief Peek preview of next shape. */
173 /* Render the next piece preview. */
256 /*! @brief Randomly select a next shape. */
260 int *next = peekShape; local
262 if (!next) next = &shapes[rand() % 7 * 4];
263 return next;
/seL4-refos-master/libs/libmuslc/src/internal/
H A Dlibc.h15 struct tls_module *next; member in struct:tls_module
/seL4-refos-master/projects/util_libs/libethdrivers/include/ethdrivers/virtio/
H A Dvirtio_ring.h37 /* This marks a buffer as continuing via the next field. */
62 /* Virtio ring descriptors: 16 bytes. These can chain together via "next". */
71 uint16_t next; member in struct:vring_desc
118 * // Padding to the next align boundary.
/seL4-refos-master/libs/libmuslc/ldso/
H A Ddynlink.c39 struct td_index *next; member in struct:td_index
50 struct dso *next, *prev; member in struct:dso
264 for (; dso; dso=dso->next) {
334 ctx = type==REL_COPY ? head->next : head;
430 new->next = dso->td_index;
910 const char *rp, *next; local
911 for (rp=reserved; *rp; rp=next) {
912 next = strchr(rp, '.') + 1;
913 if (strncmp(name+3, rp, next-rp) == 0)
935 tail->next
1646 struct dso *volatile p, *orig_tail, *next; local
[all...]
/seL4-refos-master/libs/libplatsupport/src/
H A Dtqueue.c31 SGLIB_DEFINE_SORTED_LIST_PROTOTYPES(tqueue_node_t, TIMEOUT_CMP, next)
32 SGLIB_DEFINE_SORTED_LIST_FUNCTIONS(tqueue_node_t, TIMEOUT_CMP, next)
/seL4-refos-master/libs/libmuslc/src/env/
H A D__init_tls.c73 for (i=1, p=libc.tls_head; p; i++, p=p->next) {
84 for (i=1, p=libc.tls_head; p; i++, p=p->next) {
/seL4-refos-master/projects/util_libs/libplatsupport/src/
H A Dtqueue.c31 SGLIB_DEFINE_SORTED_LIST_PROTOTYPES(tqueue_node_t, TIMEOUT_CMP, next)
32 SGLIB_DEFINE_SORTED_LIST_FUNCTIONS(tqueue_node_t, TIMEOUT_CMP, next)
/seL4-refos-master/kernel/src/kernel/
H A Dsporadic.c34 /* return the index of the next item in the refill queue */
68 word_t next = refill_next(sc, sc->scRefillHead); local
71 if (!(refill_index(sc, current)->rTime <= refill_index(sc, next)->rTime)) {
75 current = next;
76 next = refill_next(sc, current);
201 /* otherwise schedule the rest for the next period */
263 /* due to overrun delay next replenishment */
309 /* merge remnant with next replenishment - either it's too small
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/am335x/
H A Dbeaglebone.c65 /* Set the next field in the hardware descriptor. The device will traverse the ring
66 * using the next field to dump other RX data
69 dev->rx_ring[dev->rdt].next = ((struct descriptor *) dev->rx_ring_phys) + next_rdt;
142 .next = NULL,
150 .next = NULL,
251 dev->tx_ring[ring].next = ((volatile struct descriptor *) dev->tx_ring_phys) + (ring + 1);
256 dev->tx_ring[ring].next = NULL;
/seL4-refos-master/libs/libsel4utils/src/irq_server/
H A Dirq_server.c44 irq_server_thread_t *next; member in struct:irq_server_thread
247 new_thread->next = irq_server->server_threads;
311 for (st = irq_server->server_threads; st != NULL; st = st->next) {
/seL4-refos-master/projects/seL4_libs/libsel4utils/src/irq_server/
H A Dirq_server.c44 irq_server_thread_t *next; member in struct:irq_server_thread
247 new_thread->next = irq_server->server_threads;
311 for (st = irq_server->server_threads; st != NULL; st = st->next) {
/seL4-refos-master/libs/libsel4utils/include/sel4utils/
H A Dprocess.h32 object_node_t *next; member in struct:object_node

Completed in 143 milliseconds

1234567