Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 873) 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; \
52 (node)->prev->next = lnew; \
53 (node)->prev = lnew; \
57 (node)->prev->next = (node)->next; \
58 (node)->next->prev = (node)->prev; \
59 (node)->next = (node)->prev = NULL
71 list->list_head.next = list->list_head.prev = &list->list_head; in list_create()
81 ASSERT(list->list_head.prev == node); in list_destroy()
[all …]
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h91 list->next = list->prev = list; in INIT_LIST_HEAD()
106 return ((next == head) && (next == head->prev)); in list_empty_careful()
110 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
112 next->prev = prev; in __list_del()
113 WRITE_ONCE(prev->next, next); in __list_del()
120 __list_del(entry->prev, entry->next); in __list_del_entry()
127 __list_del(entry->prev, entry->next); in list_del()
134 new->next->prev = new; in list_replace()
135 new->prev = old->prev; in list_replace()
136 new->prev->next = new; in list_replace()
[all …]
H A Drculist.h38 #define list_prev_rcu(head) (*((struct list_head **)(&(head)->prev)))
54 linux_list_add_rcu(struct list_head *new, struct list_head *prev, in linux_list_add_rcu() argument
58 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()
76 __list_del_rcu(struct list_head *prev, struct list_head *next) in __list_del_rcu() argument
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()
[all …]
/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)
171 #define DL_SORT2(list, cmp, prev, next) \ argument
215 _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \
220 _CASTASGN(list->prev, _ls_tail); \
231 CDL_SORT2(list, cmp, prev, next)
233 #define CDL_SORT2(list, cmp, prev, next) \ argument
290 _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \
295 _CASTASGN(list->prev,_ls_tail); \
[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/sys/netpfil/ipfw/test/
H A Dmylist.h10 struct list_head *prev, *next; member
13 #define INIT_LIST_HEAD(l) do { (l)->prev = (l)->next = (l); } while (0)
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()
[all …]
/freebsd/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c42 struct list_head *next, *prev; member
53 list->prev = list; in INIT_LIST_HEAD()
64 struct list_head *prev, struct list_head *next) in __list_add() argument
66 next->prev = new; in __list_add()
68 new->prev = prev; in __list_add()
69 prev->next = new; in __list_add()
73 struct list_head *prev, struct list_head *next);
99 __list_add(new, head->prev, head); in list_add_tail()
109 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
111 next->prev = prev; in __list_del()
[all …]
/freebsd/sys/dev/hpt27xx/
H A Dlist.h41 struct list_head *next, *prev; member
44 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
46 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_hea… in __list_add() argument
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()
64 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
66 next->prev = prev; in __list_del()
67 prev->next = next; in __list_del()
[all …]
/freebsd/sys/dev/hptnr/
H A Dlist.h40 struct list_head *next, *prev; member
43 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
45 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_hea… in __list_add() argument
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()
63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
65 next->prev = prev; in __list_del()
66 prev->next = next; in __list_del()
[all …]
/freebsd/sys/dev/hptrr/
H A Dlist.h43 struct list_head *next, *prev; member
46 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
48 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_hea… in __list_add() argument
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()
66 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
68 next->prev = prev; in __list_del()
69 prev->next = next; in __list_del()
[all …]
/freebsd/sys/contrib/vchiq/interface/compat/
H A Dlist.h60 struct list_head *prev; member
64 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
69 head->prev = head; in INIT_LIST_HEAD()
82 return head->prev; in list_last()
94 return node->prev; in list_prev()
109 if (head->next != head->prev) in list_is_singular()
115 __list_add_between(struct list_head *prev, struct list_head *node, in __list_add_between() argument
118 prev->next = node; in __list_add_between()
119 node->prev = prev; in __list_add_between()
121 next->prev = node; in __list_add_between()
[all …]
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dzfs_rlock.c312 zfs_locked_range_t *prev, avl_index_t where) in zfs_rangelock_add_reader() argument
325 if (prev != NULL) { in zfs_rangelock_add_reader()
326 if (prev->lr_offset + prev->lr_length <= off) { in zfs_rangelock_add_reader()
327 prev = NULL; in zfs_rangelock_add_reader()
328 } else if (prev->lr_offset != 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()
339 if (prev != NULL) in zfs_rangelock_add_reader()
340 next = prev; in zfs_rangelock_add_reader()
[all …]
/freebsd/lib/libpmc/pmu-events/
H A Dlist.h47 struct list_head *prev; member
75 list->next = list->prev = list; in INIT_LIST_HEAD()
90 return ((next == head) && (next == head->prev)); in list_empty_careful()
94 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
96 next->prev = prev; in __list_del()
97 WRITE_ONCE(prev->next, next); in __list_del()
104 __list_del(entry->prev, entry->next); in __list_del_entry()
111 __list_del(entry->prev, entry->next); in list_del()
118 new->next->prev = new; in list_replace()
119 new->prev = old->prev; in list_replace()
[all …]
/freebsd/lib/libc/include/isc/
H A Dlist.h34 #define LINK(type) struct { type *prev, *next; }
37 (elt)->link.prev = (type *)(-1); \
42 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-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) \
83 (elt)->link.prev->link.next = (elt)->link.next; \
[all …]
/freebsd/sys/dev/drm2/
H A Ddrm_linux_list.h37 struct list_head *next, *prev; member
45 (head)->prev = head; in INIT_LIST_HEAD()
60 (head)->next->prev = new; in list_add()
62 (new)->prev = head; in list_add()
68 (entry)->prev = (head)->prev; in list_add_tail()
70 (head)->prev->next = entry; in list_add_tail()
71 (head)->prev = entry; in list_add_tail()
76 (entry)->next->prev = (entry)->prev; in list_del()
77 (entry)->prev->next = (entry)->next; in list_del()
84 new->next->prev = new; in list_replace()
[all …]
/freebsd/sys/dev/ocs_fc/
H A Docs_list.h77 ocs_list_t *prev; /*<< pointer to tail of list (or previous if link) */ member
106 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()
230 ocs_list_assert(link->prev == NULL); in ocs_list_add_head()
257 ocs_list_assert(link->prev == NULL); in ocs_list_add_tail()
[all …]
/freebsd/contrib/ntp/libntp/lib/isc/include/isc/
H A Dlist.h35 #define ISC_LINK(type) struct { type *prev, *next; }
38 (elt)->link.prev = (type *)(-1); \
43 #define ISC_LINK_LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-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) \
98 (elt)->link.prev->link.next = (elt)->link.next; \
[all …]
/freebsd/sys/contrib/openzfs/scripts/
H A Dcstyle.pl82 my ($filename, $line, $prev); # shared globals
195 printf $fmt, $filename, $. - 1, $error, $prev;
227 $prev = '';
361 if (/^\{$/ && $prev =~ /\)\s*(const\s*)?(\/\*.*\*\/\s*)?\\?$/) {
366 $prev = $line;
370 if ($prev =~ /^\s*return\s*;/) {
375 $prev = $line;
387 } elsif ($prev =~ /^__attribute__/) { #__attribute__((*))
390 $prev = $line;
430 $prev = $line;
[all …]
/freebsd/sys/dev/isci/scil/
H A Dsci_fast_list.h101 (element)->next = (element)->prev = NULL; \
146 #define sci_fast_list_get_prev(element) ((element)->prev)
203 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()
325 element->owning_list->list_tail = element->prev; in sci_fast_list_remove_element()
[all …]
/freebsd/contrib/unbound/iterator/
H A Diter_scrub.c64 struct rrset_parse* prev, struct rrset_parse** rrset) in remove_rrset() argument
73 if(prev) in remove_rrset()
74 prev->rrset_all_next = (*rrset)->rrset_all_next; in remove_rrset()
77 msg->rrset_last = prev; in remove_rrset()
254 struct rrset_parse* rrset, struct rrset_parse* prev, in synth_cname_rrset() argument
294 if(prev) in synth_cname_rrset()
295 prev->rrset_all_next = cn; in synth_cname_rrset()
383 struct rr_parse* rr = rrset->rr_first, *prev = NULL; in shorten_rrset() local
387 prev = rr; in shorten_rrset()
400 rrset->rr_last = prev; in shorten_rrset()
[all …]
/freebsd/contrib/llvm-project/lld/MachO/
H A DMarkLive.cpp29 const WhyLiveEntry *prev; member
31 WhyLiveEntry(InputSection *isec, const WhyLiveEntry *prev) in WhyLiveEntry()
32 : isec(isec), prev(prev) {} in WhyLiveEntry()
61 void enqueue(InputSection *isec, uint64_t off, const WorklistEntry *prev);
62 void addSym(Symbol *s, const WorklistEntry *prev);
64 WorklistEntry *makeEntry(InputSection *, const WorklistEntry *prev) const;
77 const typename MarkLiveImpl<RecordWhyLive>::WorklistEntry *prev) { in enqueue() argument
83 worklist.push_back(makeEntry(s, prev)); in enqueue()
87 static void printWhyLive(const Symbol *s, const WhyLiveEntry *prev) { in printWhyLive() argument
90 for (const WhyLiveEntry *entry = prev; entry; in printWhyLive()
[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()
139 prev->m_nextpkt = m->m_nextpkt; 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()
168 prev->m_nextpkt = m->m_nextpkt; in _getq_random()
170 qtail(q) = prev; in _getq_random()
180 struct mbuf *m0, *prev; in _removeq() local
[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()
179 " from ignore list (clear)", MAC2STR(prev->bssid)); in wpa_bssid_ignore_clear()
180 os_free(prev); in wpa_bssid_ignore_clear()
192 struct wpa_bssid_ignore *e, *prev = NULL; in wpa_bssid_ignore_update() local
205 if (prev) { in wpa_bssid_ignore_update()
[all …]

12345678910>>...35