/freebsd-current/contrib/one-true-awk/testdir/ |
H A D | unbundle.awk | 3 $1 != prev { close(prev); prev = $1 }
|
/freebsd-current/lib/libc/stdlib/ |
H A D | insque.c | 20 struct que_elem *prev, *next, *elem; local 23 prev = (struct que_elem *)pred; 25 if (prev == NULL) { 26 elem->prev = elem->next = NULL; 30 next = prev->next; 33 if (next->prev != prev) { 35 " next(%p)->prev(%p) != prev(%p)\n", 36 next, next->prev, pre [all...] |
H A D | remque.c | 16 struct que_elem *prev, *next, *elem; local 20 prev = elem->prev; 23 if (prev != NULL) 24 prev->next = next; 26 next->prev = prev;
|
/freebsd-current/share/doc/usd/13.viref/ |
H A D | merge.awk | 2 $1 == prev { 10 prev = $1;
|
/freebsd-current/usr.bin/mkuzip/ |
H A D | mkuz_blk_chain.h | 32 struct mkuz_bchain_link *prev; member in struct:mkuz_bchain_link
|
/freebsd-current/sys/netpfil/ipfw/test/ |
H A D | mylist.h | 10 struct list_head *prev, *next; member in struct:list_head 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, argument 19 next->prev = o; 21 o->prev = prev; 22 prev->next = o; 28 __list_add(o, head->prev, head); 35 __list_del(struct list_head *prev, struct list_head *next) argument 37 next->prev [all...] |
/freebsd-current/sys/dev/hpt27xx/ |
H A D | list.h | 41 struct list_head *next, *prev; member in struct:list_head 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_head * next) argument 48 next->prev = _new; 50 _new->prev = prev; 51 prev->next = _new; 61 __list_add(_new, head->prev, head); 64 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument 66 next->prev [all...] |
/freebsd-current/sys/dev/hptnr/ |
H A D | list.h | 40 struct list_head *next, *prev; member in struct:list_head 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_head * next) argument 47 next->prev = _new; 49 _new->prev = prev; 50 prev->next = _new; 60 __list_add(_new, head->prev, head); 63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument 65 next->prev [all...] |
/freebsd-current/sys/dev/hptrr/ |
H A D | list.h | 43 struct list_head *next, *prev; member in struct:list_head 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_head * next) argument 50 next->prev = _new; 52 _new->prev = prev; 53 prev->next = _new; 63 __list_add(_new, head->prev, head); 66 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument 68 next->prev [all...] |
/freebsd-current/contrib/unbound/services/ |
H A D | outbound_list.c | 71 list->first->prev = e; 73 e->prev = NULL; 84 e->next->prev = e->prev; 85 if(e->prev) 86 e->prev->next = e->next;
|
/freebsd-current/sys/contrib/openzfs/lib/libspl/ |
H A D | list.c | 42 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 [all...] |
/freebsd-current/lib/libc/include/isc/ |
H A D | list.h | 34 #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 ! [all...] |
/freebsd-current/contrib/wpa/src/utils/ |
H A D | list.h | 17 struct dl_list *prev; member in struct:dl_list 25 list->prev = list; 31 item->prev = list; 32 list->next->prev = item; 38 dl_list_add(list->prev, item); 43 item->next->prev = item->prev; 44 item->prev->next = item->next; 46 item->prev = NULL; 76 dl_list_entry((list)->prev, typ [all...] |
/freebsd-current/sys/compat/linuxkpi/common/include/linux/ |
H A D | rculist.h | 38 #define list_prev_rcu(head) (*((struct list_head **)(&(head)->prev))) 54 linux_list_add_rcu(struct list_head *new, struct list_head *prev, argument 58 new->prev = prev; 59 rcu_assign_pointer(list_next_rcu(prev), new); 60 next->prev = new; 72 linux_list_add_rcu(new, head->prev, head); 76 __list_del_rcu(struct list_head *prev, struct list_head *next) argument 78 next->prev = prev; 99 hlist_add_behind_rcu(struct hlist_node *n, struct hlist_node *prev) argument [all...] |
H A D | list.h | 91 list->next = list->prev = list; 106 return ((next == head) && (next == head->prev)); 110 __list_del(struct list_head *prev, struct list_head *next) argument 112 next->prev = prev; 113 WRITE_ONCE(prev->next, next); 120 __list_del(entry->prev, entry->next); 127 __list_del(entry->prev, entry->next); 134 new->next->prev = new; 135 new->prev 147 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 287 linux_list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument 407 hlist_add_behind(struct hlist_node *n, struct hlist_node *prev) argument [all...] |
/freebsd-current/sys/contrib/vchiq/interface/compat/ |
H A D | list.h | 60 struct list_head *prev; member in struct:list_head 64 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) } 69 head->prev = head; 82 return head->prev; 94 return node->prev; 109 if (head->next != head->prev) 115 __list_add_between(struct list_head *prev, struct list_head *node, argument 118 prev->next = node; 119 node->prev = prev; 144 __list_splice_between(struct list_head *prev, const struct list_head *list, struct list_head *next) argument [all...] |
/freebsd-current/sys/contrib/openzfs/lib/libspl/include/sys/ |
H A D | list_impl.h | 38 struct list_node *prev; member in struct:list_node
|
/freebsd-current/contrib/wpa/wpa_supplicant/ |
H A D | blacklist.c | 94 struct wpa_blacklist *e, *prev = NULL; local 102 if (prev == NULL) { 105 prev->next = e->next; 112 prev = e; 125 struct wpa_blacklist *e, *prev; local 133 prev = e; 136 "blacklist (clear)", MAC2STR(prev->bssid)); 137 os_free(prev);
|
/freebsd-current/contrib/ofed/librdmacm/ |
H A D | indexer.h | 106 struct _dlist_entry *prev; member in struct:_dlist_entry 112 head->prev = head; 123 item->prev = head; 124 head->next->prev = item; 130 dlist_insert_after(item, head->prev); 138 item->prev->next = item->next; 139 item->next->prev = item->prev;
|
/freebsd-current/crypto/openssl/test/ |
H A D | pkey_meth_test.c | 25 int prev = -1; local 33 if (pkey_id < prev) 35 prev = pkey_id; 58 int prev = -1; local 66 if (pkey_id < prev) 68 prev = pkey_id;
|
/freebsd-current/sys/dev/isci/scil/ |
H A D | sci_fast_list.h | 62 * circular in nature. This means that the next and prev pointers for 65 * a queue will have its next and prev pointer set to the address of 101 (element)->next = (element)->prev = NULL; \ 143 * This method will get the prev dListField in the SCI_FAST_LIST. This method 146 #define sci_fast_list_get_prev(element) ((element)->prev) 203 struct SCI_FAST_LIST_ELEMENT *prev; member in struct:SCI_FAST_LIST_ELEMENT 225 element->prev = NULL; 229 anchor->list_head->prev = element; 258 element->prev = anchor->list_tail; 289 element->next = element->prev [all...] |
/freebsd-current/sys/dev/ocs_fc/ |
H A D | ocs_list.h | 77 ocs_list_t *prev; /*<< pointer to tail of list (or previous if link) */ member in struct:ocs_list_s 106 list->prev = list; 158 ocs_list_assert(a->prev); 162 ocs_list_assert(b->prev); 166 ocs_list_assert(!c->prev); 172 c->prev = b->prev; 174 b->prev = c; 201 link->prev = NULL; 230 ocs_list_assert(link->prev 366 ocs_list_t *prev; local [all...] |
/freebsd-current/contrib/ntp/libntp/lib/isc/include/isc/ |
H A D | list.h | 35 #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 ! [all...] |
/freebsd-current/sys/net/altq/ |
H A D | altq_classq.h | 131 struct mbuf *m, *m0, *prev; local 136 prev = m0; 139 prev->m_nextpkt = m->m_nextpkt; 140 if (prev == m) 143 qtail(q) = prev; 161 struct mbuf *prev = NULL; local 165 prev = m; 168 prev->m_nextpkt = m->m_nextpkt; 170 qtail(q) = prev; 180 struct mbuf *m0, *prev; local [all...] |
/freebsd-current/contrib/llvm-project/compiler-rt/lib/dfsan/ |
H A D | dfsan_origin.h | 73 static Origin CreateChainedOrigin(Origin prev, StackTrace *stack) { argument 74 int depth = prev.isChainedOrigin() ? prev.depth() : -1; 80 return prev; 85 return prev; 90 return prev; 95 GetChainedOriginDepot()->Put(h.id(), prev.raw_id(), &chained_id);
|