Lines Matching refs:prev
56 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
63 head->prev = head;
76 return head->prev;
88 return node->prev;
103 if (head->next != head->prev)
111 return head == entry->prev;
121 __list_add_between(struct list_head *prev, struct list_head *node,
124 prev->next = node;
125 node->prev = prev;
127 next->prev = node;
143 node->prev = head;
149 next->prev = node;
155 __list_add_between(head->prev, node, head);
161 entry->prev->next = entry->next;
162 entry->next->prev = entry->prev;
170 entry->prev = (void *)(uintptr_t)2;
174 __list_splice_between(struct list_head *prev, const struct list_head *list,
178 struct list_head *last = list->prev;
180 first->prev = prev;
181 prev->next = first;
184 next->prev = last;
207 __list_splice_between(head->prev, list, head);
214 __list_splice_between(head->prev, list, head);
238 first->prev->next = last->next;
239 last->next->prev = first->prev;
241 head->prev->next = first;
242 first->prev = head->prev;
245 head->prev = last;
251 new->prev = old->prev;
252 old->prev->next = new;
254 old->next->prev = new;
417 hlist_add_behind_rcu(struct hlist_node *node, struct hlist_node *prev)
421 pslist_writer_insert_after(prev, node);
Indexes created Mon Oct 20 11:09:49 GMT 2025