• Home
  • Raw
  • Download

Lines Matching refs:prev

48     struct list_head *prev;  member
54 item->prev = item; in list_inithead()
60 item->prev = list; in list_add()
62 list->next->prev = item; in list_add()
69 item->prev = list->prev; in list_addtail()
70 list->prev->next = item; in list_addtail()
71 list->prev = item; in list_addtail()
81 to->prev = from->prev; in list_replace()
83 from->next->prev = to; in list_replace()
84 from->prev->next = to; in list_replace()
90 item->prev->next = item->next; in list_del()
91 item->next->prev = item->prev; in list_del()
92 item->prev = item->next = NULL; in list_del()
97 item->prev->next = item->next; in list_delinit()
98 item->next->prev = item->prev; in list_delinit()
100 item->prev = item; in list_delinit()
130 src->next->prev = dst; in list_splice()
131 src->prev->next = dst->next; in list_splice()
132 dst->next->prev = src->prev; in list_splice()
141 src->prev->next = dst; in list_splicetail()
142 src->next->prev = dst->prev; in list_splicetail()
143 dst->prev->next = src->next; in list_splicetail()
144 dst->prev = src->prev; in list_splicetail()
150 assert(list->next->prev == list && list->prev->next == list); in list_validate()
152 assert(node->next->prev == node && node->prev->next == node); in list_validate()
183 LIST_ENTRY(type, (ptr)->prev, member)
198 for (pos = NULL, pos = container_of((head)->prev, pos, member), \
199 storage = container_of(pos->member.prev, pos, member); \
201 pos = storage, storage = container_of(storage->member.prev, storage, member))
211 pos = container_of(pos->member.prev, pos, member))
226 for (type *pos = LIST_ENTRY(type, (head)->prev, member); \
228 pos = LIST_ENTRY(type, pos->member.prev, member))
231 for (type *pos = LIST_ENTRY(type, (head)->prev, member), \
232 *__prev = LIST_ENTRY(type, pos->member.prev, member); \
235 __prev = LIST_ENTRY(type, __prev->member.prev, member))
245 pos = LIST_ENTRY(type, pos->member.prev, member))