Home
last modified time | relevance | path

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

12345678910>>...35

/freebsd/sys/contrib/openzfs/lib/libspl/
H A Dlist.c42 lnew->prev = (node); \
44 (node)->next->prev = lnew; \
51 lnew->prev = (node)->prev; \
53 (node)->prev = lnew; \
58 (node)->next->prev = (node)->prev; \
204 srcnode->next->prev = dstnode->prev; in list_move_tail()
205 dstnode->prev = srcnode->prev; in list_move_tail()
219 lnew->prev = lold->prev; in list_link_replace()
220 lold->prev->next = lnew; in list_link_replace()
221 lold->next->prev = lnew; in list_link_replace()
[all …]
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h112 next->prev = prev; in __list_del()
135 new->prev = old->prev; in list_replace()
151 next->prev = new; in __list_add()
153 new->prev = prev; in __list_add()
154 prev->next = new; in __list_add()
229 for (p = (h)->prev, n = (p)->prev; \
279 last->next->prev = first->prev; in list_bulk_move_tail()
281 first->prev = head->prev; in list_bulk_move_tail()
283 head->prev = last; in list_bulk_move_tail()
296 last = list->prev; in linux_list_splice()
[all …]
H A Drculist.h58 new->prev = prev; in linux_list_add_rcu()
59 rcu_assign_pointer(list_next_rcu(prev), new); in linux_list_add_rcu()
60 next->prev = new; in linux_list_add_rcu()
72 linux_list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
78 next->prev = prev; in __list_del_rcu()
79 rcu_assign_pointer(list_next_rcu(prev), next); in __list_del_rcu()
85 __list_del_rcu(entry->prev, entry->next); in __list_del_entry_rcu()
91 __list_del_rcu(entry->prev, entry->next); in list_del_rcu()
101 n->next = prev->next; in hlist_add_behind_rcu()
102 n->pprev = &prev->next; in hlist_add_behind_rcu()
[all …]
/freebsd/lib/libc/stdlib/
H A Dinsque.c20 struct que_elem *prev, *next, *elem; in insque() local
23 prev = (struct que_elem *)pred; in insque()
25 if (prev == NULL) { in insque()
26 elem->prev = elem->next = NULL; in insque()
30 next = prev->next; in insque()
33 if (next->prev != prev) { in insque()
36 next, next->prev, prev); in insque()
39 next->prev = elem; in insque()
41 prev->next = elem; in insque()
42 elem->prev = prev; in insque()
H A Dremque.c16 struct que_elem *prev, *next, *elem; in remque() local
20 prev = elem->prev; in remque()
23 if (prev != NULL) in remque()
24 prev->next = next; in remque()
26 next->prev = prev; in remque()
/freebsd/contrib/libucl/uthash/
H A Dutlist.h88 #define _PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*)(to);… argument
96 #define _PREVASGN(elt,list,to,prev) ((elt)->prev)=(to) argument
169 DL_SORT2(list, cmp, prev, next)
511 (add)->prev = (head)->prev; \
525 (add)->prev = (head)->prev; \
545 (head2)->prev = (head1)->prev; \
563 (del)->next->prev = (del)->prev; \
568 (del)->next->prev = (del)->prev; \
570 (head)->prev = (del)->prev; \
614 (add)->prev = (el)->prev; \
[all …]
/freebsd/sys/netpfil/ipfw/test/
H A Dmylist.h10 struct list_head *prev, *next; member
16 __list_add(struct list_head *o, struct list_head *prev, in __list_add() argument
19 next->prev = o; in __list_add()
21 o->prev = prev; in __list_add()
22 prev->next = o; in __list_add()
28 __list_add(o, head->prev, head); in list_add_tail()
35 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
37 next->prev = prev; in __list_del()
38 prev->next = next; in __list_del()
45 __list_del(entry->prev, entry->next); in list_del()
[all …]
/freebsd/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c53 list->prev = list; in INIT_LIST_HEAD()
66 next->prev = new; in __list_add()
68 new->prev = prev; in __list_add()
69 prev->next = new; in __list_add()
111 next->prev = prev; in __list_del()
112 prev->next = next; in __list_del()
143 new->prev = old->prev; in list_replace()
282 first->prev = prev; in __list_splice()
394 for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
395 pos = pos->prev)
[all …]
/freebsd/sys/dev/hpt27xx/
H A Dlist.h41 struct list_head *next, *prev; member
48 next->prev = _new; in __list_add()
50 _new->prev = prev; in __list_add()
51 prev->next = _new; in __list_add()
61 __list_add(_new, head->prev, head); in list_add_tail()
66 next->prev = prev; in __list_del()
67 prev->next = next; in __list_del()
72 __list_del(entry->prev, entry->next); in list_del()
91 struct list_head *last = list->prev; in __list_splice()
94 first->prev = head; in __list_splice()
[all …]
/freebsd/sys/dev/hptnr/
H A Dlist.h40 struct list_head *next, *prev; member
47 next->prev = _new; in __list_add()
49 _new->prev = prev; in __list_add()
50 prev->next = _new; in __list_add()
60 __list_add(_new, head->prev, head); in list_add_tail()
65 next->prev = prev; in __list_del()
66 prev->next = next; in __list_del()
71 __list_del(entry->prev, entry->next); in list_del()
90 struct list_head *last = list->prev; in __list_splice()
93 first->prev = head; in __list_splice()
[all …]
/freebsd/sys/dev/hptrr/
H A Dlist.h43 struct list_head *next, *prev; member
50 next->prev = _new; in __list_add()
52 _new->prev = prev; in __list_add()
53 prev->next = _new; in __list_add()
63 __list_add(_new, head->prev, head); in list_add_tail()
68 next->prev = prev; in __list_del()
69 prev->next = next; in __list_del()
74 __list_del(entry->prev, entry->next); in list_del()
93 struct list_head *last = list->prev; in __list_splice()
96 first->prev = head; in __list_splice()
[all …]
/freebsd/sys/contrib/vchiq/interface/compat/
H A Dlist.h69 head->prev = head; in INIT_LIST_HEAD()
82 return head->prev; in list_last()
94 return node->prev; in list_prev()
118 prev->next = node; in __list_add_between()
119 node->prev = prev; in __list_add_between()
121 next->prev = node; in __list_add_between()
140 entry->next->prev = entry->prev; in list_del()
150 first->prev = prev; in __list_splice_between()
151 prev->next = first; in __list_splice_between()
154 next->prev = last; in __list_splice_between()
[all …]
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dzfs_rlock.c326 if (prev->lr_offset + prev->lr_length <= off) { in zfs_rangelock_add_reader()
333 prev = zfs_rangelock_split(tree, prev, off); in zfs_rangelock_add_reader()
334 prev = AVL_NEXT(tree, prev); /* move to rear range */ in zfs_rangelock_add_reader()
337 ASSERT((prev == NULL) || (prev->lr_offset == off)); in zfs_rangelock_add_reader()
365 if (prev != NULL && prev->lr_offset + prev->lr_length < in zfs_rangelock_add_reader()
369 prev->lr_offset + prev->lr_length); in zfs_rangelock_add_reader()
371 prev->lr_offset + prev->lr_length, in zfs_rangelock_add_reader()
373 (prev->lr_offset + prev->lr_length)); in zfs_rangelock_add_reader()
394 (off + len) - (prev->lr_offset + prev->lr_length)); in zfs_rangelock_add_reader()
422 if (prev && (off < prev->lr_offset + prev->lr_length)) { in zfs_rangelock_enter_reader()
[all …]
/freebsd/lib/libc/include/isc/
H A Dlist.h37 (elt)->link.prev = (type *)(-1); \
53 (list).head->link.prev = (elt); \
56 (elt)->link.prev = NULL; \
68 (elt)->link.prev = (list).tail; \
77 (elt)->link.next->link.prev = (elt)->link.prev; \
80 (list).tail = (elt)->link.prev; \
82 if ((elt)->link.prev != NULL) \
99 if ((before)->link.prev == NULL) \
102 (elt)->link.prev = (before)->link.prev; \
103 (before)->link.prev = (elt); \
[all …]
/freebsd/lib/libpmc/pmu-events/
H A Dlist.h96 next->prev = prev; in __list_del()
118 new->next->prev = new; in list_replace()
119 new->prev = old->prev; in list_replace()
135 next->prev = new; in linux_list_add()
137 new->prev = prev; in linux_list_add()
138 prev->next = new; in linux_list_add()
252 last = list->prev; in linux_list_splice()
253 first->prev = prev; in linux_list_splice()
254 prev->next = first; in linux_list_splice()
256 next->prev = last; in linux_list_splice()
[all …]
/freebsd/sys/dev/drm2/
H A Ddrm_linux_list.h45 (head)->prev = head; in INIT_LIST_HEAD()
68 (entry)->prev = (head)->prev; in list_add_tail()
71 (head)->prev = entry; in list_add_tail()
76 (entry)->next->prev = (entry)->prev; in list_del()
84 new->next->prev = new; in list_replace()
85 new->prev = old->prev; in list_replace()
86 new->prev->next = new; in list_replace()
104 (entry)->next->prev = (entry)->prev; in list_del_init()
160 first->prev = prev; in __list_splice()
161 prev->next = first; in __list_splice()
[all …]
/freebsd/sys/dev/ocs_fc/
H A Docs_list.h106 list->prev = list; in _ocs_list_init()
158 ocs_list_assert(a->prev); in _ocs_list_insert_link()
162 ocs_list_assert(b->prev); in _ocs_list_insert_link()
166 ocs_list_assert(!c->prev); in _ocs_list_insert_link()
172 c->prev = b->prev; in _ocs_list_insert_link()
174 b->prev = c; in _ocs_list_insert_link()
201 link->prev = NULL; in ocs_list_init_link()
366 ocs_list_t *prev; in ocs_list_remove() local
382 prev = link->prev; in ocs_list_remove()
385 prev->next = next; in ocs_list_remove()
[all …]
/freebsd/contrib/ntp/libntp/lib/isc/include/isc/
H A Dlist.h38 (elt)->link.prev = (type *)(-1); \
52 (list).head->link.prev = (elt); \
55 (elt)->link.prev = NULL; \
75 (elt)->link.prev = (list).tail; \
92 (elt)->link.next->link.prev = (elt)->link.prev; \
95 (list).tail = (elt)->link.prev; \
97 if ((elt)->link.prev != NULL) \
103 (elt)->link.prev = (type *)(-1); \
126 (elt)->link.prev = (before)->link.prev; \
127 (before)->link.prev = (elt); \
[all …]
/freebsd/sys/contrib/openzfs/scripts/
H A Dcstyle.pl227 $prev = '';
366 $prev = $line;
375 $prev = $line;
390 $prev = $line;
430 $prev = $line;
452 $prev = $line;
483 $prev = $line;
491 $prev = $line;
509 $prev = $line;
641 ($prev =~ /\)\s*$/ || $prev =~ /\bstruct\s+\w+$/)) {
[all …]
/freebsd/sys/dev/isci/scil/
H A Dsci_fast_list.h203 struct SCI_FAST_LIST_ELEMENT *prev; member
225 element->prev = NULL; in sci_fast_list_insert_head()
229 anchor->list_head->prev = element; in sci_fast_list_insert_head()
258 element->prev = anchor->list_tail; in sci_fast_list_insert_tail()
289 element->next = element->prev = NULL; in sci_fast_list_remove_head()
306 anchor->list_tail = element->prev; in sci_fast_list_remove_tail()
310 element->next = element->prev = NULL; in sci_fast_list_remove_tail()
327 element->next->prev = element->prev; in sci_fast_list_remove_element()
329 if ( element->prev == NULL ) in sci_fast_list_remove_element()
332 element->prev->next = element->next; in sci_fast_list_remove_element()
[all …]
/freebsd/contrib/llvm-project/lld/MachO/
H A DMarkLive.cpp29 const WhyLiveEntry *prev; member
32 : isec(isec), prev(prev) {} in WhyLiveEntry()
62 void addSym(Symbol *s, const WorklistEntry *prev);
83 worklist.push_back(makeEntry(s, prev)); in enqueue()
90 for (const WhyLiveEntry *entry = prev; entry; in printWhyLive()
91 entry = entry->prev, indent += 2) { in printWhyLive()
111 printWhyLive(s, prev); in addSym()
114 enqueue(d->isec, d->value, prev); in addSym()
116 enqueue(d->unwindEntry, 0, prev); in addSym()
136 assert(!prev); in makeEntry()
[all …]
/freebsd/contrib/wpa/src/utils/
H A Dlist.h17 struct dl_list *prev; member
25 list->prev = list; in dl_list_init()
31 item->prev = list; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
38 dl_list_add(list->prev, item); in dl_list_add_tail()
43 item->next->prev = item->prev; in dl_list_del()
44 item->prev->next = item->next; in dl_list_del()
46 item->prev = NULL; in dl_list_del()
76 dl_list_entry((list)->prev, type, member))
90 for (item = dl_list_entry((list)->prev, type, member); \
[all …]
/freebsd/sys/net/altq/
H A Daltq_classq.h131 struct mbuf *m, *m0, *prev; in _getq_tail() local
136 prev = m0; in _getq_tail()
140 if (prev == m) in _getq_tail()
143 qtail(q) = prev; in _getq_tail()
161 struct mbuf *prev = NULL; in _getq_random() local
165 prev = m; in _getq_random()
170 qtail(q) = prev; in _getq_random()
180 struct mbuf *m0, *prev; in _removeq() local
184 prev = m0; in _removeq()
188 if (prev == m) in _removeq()
[all …]
/freebsd/contrib/unbound/iterator/
H A Diter_scrub.c73 if(prev) in remove_rrset()
294 if(prev) in synth_cname_rrset()
401 prev = NULL; in scrub_normalize()
441 if(!prev) { in scrub_normalize()
486 if(prev) prev->rrset_all_next = nx; in scrub_normalize()
531 prev = rrset; in scrub_normalize()
601 prev = rrset; in scrub_normalize()
637 prev = rrset; in scrub_normalize()
794 prev = NULL; in scrub_sanitize()
822 prev = rrset; in scrub_sanitize()
[all …]
/freebsd/contrib/wpa/wpa_supplicant/
H A Dbssid_ignore.c119 struct wpa_bssid_ignore *e, *prev = NULL; in wpa_bssid_ignore_del() local
127 if (prev == NULL) { in wpa_bssid_ignore_del()
130 prev->next = e->next; in wpa_bssid_ignore_del()
137 prev = e; in wpa_bssid_ignore_del()
171 struct wpa_bssid_ignore *e, *prev; in wpa_bssid_ignore_clear() local
176 prev = e; in wpa_bssid_ignore_clear()
180 os_free(prev); in wpa_bssid_ignore_clear()
205 if (prev) { in wpa_bssid_ignore_update()
206 prev->next = e->next; in wpa_bssid_ignore_update()
207 e = prev->next; in wpa_bssid_ignore_update()
[all …]

12345678910>>...35