Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 8 of 8) sorted by relevance

/hal_ti-latest/simplelink_lpf3/kernel/zephyr/dpl/
DQueueP_zephyr.c44 obj->elem.next = obj->elem.prev = &(obj->elem); in QueueP_init()
68 elem->next->prev = &(obj->elem); in QueueP_get()
85 elem = obj->elem.prev; in QueueP_getTail()
87 obj->elem.prev = elem->prev; in QueueP_getTail()
88 elem->prev->next = &(obj->elem); in QueueP_getTail()
108 qelem->next = qelem->prev = qelem; in QueueP_elemClear()
132 return ((uintptr_t)qelem->prev); in QueueP_prev()
145 elem->prev = obj->elem.prev; in QueueP_put()
146 obj->elem.prev->next = elem; in QueueP_put()
147 obj->elem.prev = elem; in QueueP_put()
[all …]
DQueueP.h39 struct _QueueP_Elem *volatile prev; member
/hal_ti-latest/simplelink/kernel/zephyr/dpl/
DQueueP_zephyr.c44 obj->elem.next = obj->elem.prev = &(obj->elem); in QueueP_init()
68 elem->next->prev = &(obj->elem); in QueueP_get()
86 elem = obj->elem.prev; in QueueP_getTail()
88 obj->elem.prev = elem->prev; in QueueP_getTail()
89 elem->prev->next = &(obj->elem); in QueueP_getTail()
110 qelem->next = qelem->prev = qelem; in QueueP_elemClear()
134 return ((uintptr_t)qelem->prev); in QueueP_prev()
147 elem->prev = obj->elem.prev; in QueueP_put()
148 obj->elem.prev->next = elem; in QueueP_put()
149 obj->elem.prev = elem; in QueueP_put()
[all …]
DQueueP.h38 struct _QueueP_Elem *volatile prev; member
/hal_ti-latest/simplelink/source/ti/drivers/utils/
DList.c74 elem->next->prev = NULL; in List_get()
97 newElem->prev = curElem->prev; in List_insert()
98 if (curElem->prev != NULL) { in List_insert()
99 curElem->prev->next = newElem; in List_insert()
104 curElem->prev = newElem; in List_insert()
120 elem->prev = list->tail; in List_put()
143 elem->prev = NULL; in List_putHead()
145 list->head->prev = elem; in List_putHead()
167 list->tail = elem->prev; in List_remove()
170 elem->next->prev = elem->prev; in List_remove()
[all …]
DList.h128 struct List_Elem_ *prev; member
220 return (elem->prev); in List_prev()
/hal_ti-latest/simplelink_lpf3/source/ti/drivers/utils/
DList.c74 elem->next->prev = NULL; in List_get()
97 newElem->prev = curElem->prev; in List_insert()
98 if (curElem->prev != NULL) in List_insert()
100 curElem->prev->next = newElem; in List_insert()
106 curElem->prev = newElem; in List_insert()
121 elem->prev = list->tail; in List_put()
146 elem->prev = NULL; in List_putHead()
149 list->head->prev = elem; in List_putHead()
173 list->tail = elem->prev; in List_remove()
177 elem->next->prev = elem->prev; in List_remove()
[all …]
DList.h129 struct List_Elem_ *prev; member
221 return (elem->prev); in List_prev()