• Home
  • Raw
  • Download

Lines Matching refs:prev

49     struct list_head *prev;  member
55 item->prev = item; in list_inithead()
61 item->prev = list; in list_add()
63 list->next->prev = item; in list_add()
70 item->prev = list->prev; in list_addtail()
71 list->prev->next = item; in list_addtail()
72 list->prev = item; in list_addtail()
82 to->prev = from->prev; in list_replace()
84 from->next->prev = to; in list_replace()
85 from->prev->next = to; in list_replace()
91 item->prev->next = item->next; in list_del()
92 item->next->prev = item->prev; in list_del()
93 item->prev = item->next = NULL; in list_del()
98 item->prev->next = item->next; in list_delinit()
99 item->next->prev = item->prev; in list_delinit()
101 item->prev = item; in list_delinit()
131 src->next->prev = dst; in list_splice()
132 src->prev->next = dst->next; in list_splice()
133 dst->next->prev = src->prev; in list_splice()
142 src->prev->next = dst; in list_splicetail()
143 src->next->prev = dst->prev; in list_splicetail()
144 dst->prev->next = src->next; in list_splicetail()
145 dst->prev = src->prev; in list_splicetail()
151 assert(list->next->prev == list && list->prev->next == list); in list_validate()
153 assert(node->next->prev == node && node->prev->next == node); in list_validate()
184 LIST_ENTRY(type, (ptr)->prev, member)
199 for (pos = NULL, pos = container_of((head)->prev, pos, member), \
200 storage = container_of(pos->member.prev, pos, member); \
202 pos = storage, storage = container_of(storage->member.prev, storage, member))
212 pos = container_of(pos->member.prev, pos, member))
227 for (type *pos = LIST_ENTRY(type, (head)->prev, member); \
229 pos = LIST_ENTRY(type, pos->member.prev, member))
232 for (type *pos = LIST_ENTRY(type, (head)->prev, member), \
233 *__prev = LIST_ENTRY(type, pos->member.prev, member); \
236 __prev = LIST_ENTRY(type, __prev->member.prev, member))
246 pos = LIST_ENTRY(type, pos->member.prev, member))