| /freebsd-src/contrib/libucl/uthash/ |
| H A D | utlist.h | 38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
45 * struct item *prev, *next;
82 * to dereference its prev/next pointers, and save/restore the real head.*/
85 #define _NEXT(elt,list,next) ((char*)((list)->next)) argument
86 #define _NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to);… argument
93 #define _NEXT(elt,list,next) ((elt)->next) argument
94 #define _NEXTASGN(elt,list,to,next) ((elt)->next)=(to) argument
106 LL_SORT2(list, cmp, next)
108 #define LL_SORT2(list, cmp, next) \ argument
[all …]
|
| /freebsd-src/sys/dev/drm2/ |
| H A D | drm_linux_list.h | 15 * The above copyright notice and this permission notice (including the next
37 struct list_head *next, *prev; member
44 (head)->next = head; in INIT_LIST_HEAD()
55 return (head)->next == head; in list_empty()
60 (head)->next->prev = new; in list_add()
61 (new)->next = (head)->next; in list_add()
63 (head)->next = new; in list_add()
69 (entry)->next = head; in list_add_tail()
70 (head)->prev->next = entry; in list_add_tail()
76 (entry)->next->prev = (entry)->prev; in list_del()
[all …]
|
| /freebsd-src/lib/libpmc/pmu-events/ |
| H A D | list.h | 46 struct list_head *next; member
75 list->next = list->prev = list; in INIT_LIST_HEAD()
82 return (head->next == head); in list_empty()
88 struct list_head *next = head->next; in list_empty_careful() local
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()
[all …]
|
| /freebsd-src/sys/compat/linuxkpi/common/include/linux/ |
| H A D | list.h | 91 list->next = list->prev = list; in INIT_LIST_HEAD()
98 return (head->next == head); in list_empty()
104 struct list_head *next = head->next; in list_empty_careful() local
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()
133 new->next = old->next; in list_replace()
[all …]
|
| H A D | rculist.h | 37 #define list_next_rcu(head) (*((struct list_head **)(&(head)->next)))
41 for (pos = list_entry_rcu((head)->next, typeof(*(pos)), member); \
43 pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member))
48 pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member))
55 struct list_head *next) in linux_list_add_rcu() argument
57 new->next = next; in linux_list_add_rcu()
60 next->prev = new; in linux_list_add_rcu()
66 linux_list_add_rcu(new, head, head->next); in list_add_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()
[all …]
|
| /freebsd-src/sys/contrib/dev/acpica/compiler/ |
| H A D | aslexternal.c | 193 ACPI_PARSE_OBJECT *Next; in ExDoExternal() local
196 ACPI_PARSE_OBJECT *ExternTypeOp = Op->Asl.Child->Asl.Next; in ExDoExternal()
219 TypeOp = ExternTypeOp->Asl.Next; in ExDoExternal()
235 TypeOp = TypeOp->Asl.Next; in ExDoExternal()
247 ArgCountOp = Op->Asl.Child->Asl.Next->Asl.Next; in ExDoExternal()
260 ListOp->Asl.Next = NULL; in ExDoExternal()
267 Next = Prev; in ExDoExternal()
268 while (Next) in ExDoExternal()
270 Prev = Next; in ExDoExternal()
300 ACPI_PARSE_OBJECT *Next; ExInsertArgCount() local
485 ACPI_PARSE_OBJECT *Next; ExMoveExternals() local
[all...] |
| H A D | asloperands.c | 223 ACPI_PARSE_OBJECT *Next; in OpnDoMutex() local
226 Next = Op->Asl.Child; in OpnDoMutex()
227 Next = Next->Asl.Next; in OpnDoMutex()
229 if (Next->Asl.Value.Integer > 15) in OpnDoMutex()
231 AslError (ASL_ERROR, ASL_MSG_SYNC_LEVEL, Next, NULL); in OpnDoMutex()
253 ACPI_PARSE_OBJECT *Next; in OpnDoMethod() local
266 Next = Op->Asl.Child; in OpnDoMethod()
270 Next in OpnDoMethod()
342 ACPI_PARSE_OBJECT *Next; OpnDoFieldCommon() local
562 ACPI_PARSE_OBJECT *Next; OpnDoField() local
592 ACPI_PARSE_OBJECT *Next; OpnDoIndexField() local
626 ACPI_PARSE_OBJECT *Next; OpnDoBankField() local
665 ACPI_PARSE_OBJECT *Next; OpnDoRegion() local
983 ACPI_PARSE_OBJECT *Next; OpnDoLoadTable() local
[all...] |
| H A D | asltransform.c | 337 ACPI_PARSE_OBJECT *Next; in TrAmlSetSubtreeParent() local
340 Next = Op; in TrAmlSetSubtreeParent()
341 while (Next) in TrAmlSetSubtreeParent()
343 Next->Asl.Parent = Parent; in TrAmlSetSubtreeParent()
344 Next = Next->Asl.Next; in TrAmlSetSubtreeParent()
368 NewPeer->Asl.Next = Op->Asl.Next; in TrAmlInsertPeer()
369 Op->Asl.Next in TrAmlInsertPeer()
576 ACPI_PARSE_OBJECT *Next; TrDoDefinitionBlock() local
623 ACPI_PARSE_OBJECT *Next; TrDoSwitch() local
1036 ACPI_PARSE_OBJECT *Next; TrCheckForDuplicateCase() local
[all...] |
| /freebsd-src/usr.bin/find/ |
| H A D | operator.c | 58 (*planp) = (*planp)->next; in yanknode()
59 node->next = NULL; in yanknode()
72 PLAN *next; /* temp node holding subexpression results */ in yankexpr() local
89 if ((next = yankexpr(planp)) == NULL) in yankexpr()
98 if (next->execute == f_closeparen) { in yankexpr()
106 tail = subplan = next; in yankexpr()
108 tail->next = next; in yankexpr()
109 tail = next; in yankexpr()
111 tail->next = NULL; in yankexpr()
124 PLAN *expr; /* pointer to next expression */ in paren_squish()
[all …]
|
| /freebsd-src/crypto/openssl/ssl/ |
| H A D | pqueue.c | 29 item->next = NULL; in pitem_new()
55 pitem *curr, *next; in pqueue_insert() local
62 for (curr = NULL, next = pq->items; in pqueue_insert()
63 next != NULL; curr = next, next = next->next) { in pqueue_insert()
67 int cmp = memcmp(next->priority, item->priority, 8); in pqueue_insert()
68 if (cmp > 0) { /* next > item */ in pqueue_insert()
69 item->next = next; in pqueue_insert()
74 curr->next = item; in pqueue_insert()
83 item->next = NULL; in pqueue_insert()
84 curr->next = item; in pqueue_insert()
[all …]
|
| /freebsd-src/sys/contrib/ck/include/ |
| H A D | ck_fifo.h | 41 struct ck_fifo_spsc_entry *next; member
109 stub->next = NULL; in ck_fifo_spsc_init()
130 entry->next = NULL; in ck_fifo_spsc_enqueue()
132 /* If stub->next is visible, guarantee that entry is consistent. */ in ck_fifo_spsc_enqueue()
134 ck_pr_store_ptr(&fifo->tail->next, entry); in ck_fifo_spsc_enqueue()
149 entry = ck_pr_load_ptr(&fifo->head->next); in ck_fifo_spsc_dequeue()
176 fifo->garbage = garbage->next; in ck_fifo_spsc_recycle()
184 return ck_pr_load_ptr(&head->next) == NULL; in ck_fifo_spsc_isempty()
187 #define CK_FIFO_SPSC_ISEMPTY(f) ((f)->head->next == NULL)
188 #define CK_FIFO_SPSC_FIRST(f) ((f)->head->next)
[all …]
|
| H A D | ck_hp_fifo.h | 49 struct ck_hp_fifo_entry *next; member
64 stub->next = NULL; in ck_hp_fifo_init()
83 struct ck_hp_fifo_entry *tail, *next; in ck_hp_fifo_enqueue_mpmc() local
86 entry->next = NULL; in ck_hp_fifo_enqueue_mpmc()
95 next = ck_pr_load_ptr(&tail->next); in ck_hp_fifo_enqueue_mpmc()
96 if (next != NULL) { in ck_hp_fifo_enqueue_mpmc()
97 ck_pr_cas_ptr(&fifo->tail, tail, next); in ck_hp_fifo_enqueue_mpmc()
99 } else if (ck_pr_cas_ptr(&fifo->tail->next, next, entry) == true) in ck_hp_fifo_enqueue_mpmc()
114 struct ck_hp_fifo_entry *tail, *next; in ck_hp_fifo_tryenqueue_mpmc() local
117 entry->next = NULL; in ck_hp_fifo_tryenqueue_mpmc()
[all …]
|
| /freebsd-src/contrib/libxo/tests/core/saved/ |
| H A D | test_08.XP.out | 82 <next>1</next>
86 <next>2</next>
90 <next>3</next>
99 <next>1</next>
103 <next>2</next>
107 <next>3</next>
116 <next>1</next>
120 <next>2</next>
124 <next>3</next>
133 <next>1</next>
[all …]
|
| H A D | test_08.X.out | 1 …next>1</next></sub><sub><name>1</name><next>2</next></sub><sub><name>2</name><next>3</next></sub><…
|
| /freebsd-src/sys/dev/hpt27xx/ |
| H A D | list.h | 41 struct list_head *next, *prev; member
44 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
46 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) in __list_add() argument
48 next->prev = _new; in __list_add()
49 _new->next = next; in __list_add()
51 prev->next = _new; in __list_add()
56 __list_add(_new, head, head->next); in list_add()
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-src/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | list.h | 24 Current = Current->Next;
71 for (T *I = First;; I = I->Next) { in checkConsistency()
77 CHECK_EQ(Last->Next, nullptr); in checkConsistency()
88 X->Next = nullptr; in push_back()
92 Last->Next = X; in push_back()
100 X->Next = First; in push_front()
107 First = First->Next; in pop_front()
113 // Insert X next to Prev
118 X->Next = Prev->Next; in insert()
119 Prev->Next = X; in insert()
[all …]
|
| /freebsd-src/sys/dev/hptrr/ |
| H A D | list.h | 43 struct list_head *next, *prev; member
46 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
48 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) in __list_add() argument
50 next->prev = _new; in __list_add()
51 _new->next = next; in __list_add()
53 prev->next = _new; in __list_add()
58 __list_add(_new, head, head->next); in list_add()
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-src/sys/dev/hptnr/ |
| H A D | list.h | 40 struct list_head *next, *prev; member
43 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
45 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) in __list_add() argument
47 next->prev = _new; in __list_add()
48 _new->next = next; in __list_add()
50 prev->next = _new; in __list_add()
55 __list_add(_new, head, head->next); in list_add()
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-src/sys/contrib/vchiq/interface/compat/ |
| H A D | list.h | 61 struct list_head *next; member
64 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
70 head->next = head; in INIT_LIST_HEAD()
76 return head->next; in list_first()
88 return node->next; in list_next()
100 return (head->next == head); in list_empty()
109 if (head->next != head->prev) in list_is_singular()
116 struct list_head *next) in __list_add_between() argument
118 prev->next = node; in __list_add_between()
120 node->next = next; in __list_add_between()
[all …]
|
| /freebsd-src/sys/contrib/openzfs/lib/libspl/ |
| H A D | list.c | 38 #define list_empty(a) ((a)->list_head.next == &(a)->list_head)
43 lnew->next = (node)->next; \
44 (node)->next->prev = lnew; \
45 (node)->next = lnew; \
50 lnew->next = (node); \
52 (node)->prev->next = 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()
[all …]
|
| /freebsd-src/contrib/tcpdump/ |
| H A D | cpack.c | 52 /* Advance to the next wordsize boundary. Return NULL if fewer than in nd_cpack_next_boundary()
59 const uint8_t *next; in nd_cpack_align_and_reserve()
62 next = nd_cpack_next_boundary(cs->c_buf, cs->c_next, wordsize); in nd_cpack_align_and_reserve()
65 if (next - cs->c_buf + wordsize > cs->c_len) in nd_cpack_align_and_reserve()
68 return next; in nd_cpack_align_and_reserve()
98 const uint8_t *next; in nd_cpack_uint64()
100 if ((next = nd_cpack_align_and_reserve(cs, sizeof(*u))) == NULL) in nd_cpack_uint64() local
103 *u = GET_LE_U_8(next); in nd_cpack_uint64()
106 cs->c_next = next + sizeof(*u); in nd_cpack_uint64()
114 const uint8_t *next; in nd_cpack_int64()
61 const uint8_t *next; nd_cpack_align_and_reserve() local
116 const uint8_t *next; nd_cpack_int64() local
132 const uint8_t *next; nd_cpack_uint32() local
148 const uint8_t *next; nd_cpack_int32() local
164 const uint8_t *next; nd_cpack_uint16() local
180 const uint8_t *next; nd_cpack_int16() local
[all...] |
| /freebsd-src/sys/netpfil/ipfw/test/ |
| H A D | mylist.h | 10 struct list_head *prev, *next; member
13 #define INIT_LIST_HEAD(l) do { (l)->prev = (l)->next = (l); } while (0)
14 #define list_empty(l) ( (l)->next == l )
17 struct list_head *next) in __list_add() argument
19 next->prev = o; in __list_add()
20 o->next = next; in __list_add()
22 prev->next = o; in __list_add()
32 (ty *)((char *)((pL)->next) - offsetof(ty, member))
35 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
37 next->prev = prev; in __list_del()
[all …]
|
| /freebsd-src/tools/tools/drm/radeon/mkregtable/ |
| H A D | mkregtable.c | 36 * sometimes we already know the next/prev entries and we can
42 struct list_head *next, *prev; member
52 list->next = list; in INIT_LIST_HEAD()
60 * the prev/next entries already!
64 struct list_head *prev, struct list_head *next) in __list_add() argument
66 next->prev = new; in __list_add()
67 new->next = next; in __list_add()
69 prev->next = new; in __list_add()
73 struct list_head *prev, struct list_head *next);
86 __list_add(new, head, head->next); in list_add()
[all …]
|
| /freebsd-src/contrib/netbsd-tests/lib/libbluetooth/ |
| H A D | t_sdp_put.c | 58 test.end = test.next; in ATF_TC_BODY()
59 test.next = buf; in ATF_TC_BODY()
67 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect)); in ATF_TC_BODY()
68 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0); in ATF_TC_BODY()
90 value.next += 1; // skip "nil" in ATF_TC_BODY()
92 test.end = test.next; in ATF_TC_BODY()
93 test.next = buf; in ATF_TC_BODY()
100 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect)); in ATF_TC_BODY()
101 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0); in ATF_TC_BODY()
144 test.end = test.next; in ATF_TC_BODY()
[all …]
|
| /freebsd-src/contrib/wpa/src/utils/ |
| H A D | list.h | 16 struct dl_list *next; member
24 list->next = list; in dl_list_init()
30 item->next = list->next; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
33 list->next = item; in dl_list_add()
43 item->next->prev = item->prev; in dl_list_del()
44 item->prev->next = item->next; in dl_list_del()
45 item->next = NULL; in dl_list_del()
51 return list->next == list; in dl_list_empty()
58 for (item = list->next; item != list; item = item->next) in dl_list_len()
[all …]
|