Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 2396) sorted by relevance

12345678910>>...96

/freebsd/contrib/libucl/uthash/
H A Dutlist.h85 #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
129 _SV(_ls_q,list); _ls_q = _NEXT(_ls_q,list,next); _RS(list); \
136 _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \
139 _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \
142 _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \
[all …]
/freebsd/usr.bin/find/
H A Doperator.c58 (*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()
146 tail->next = expr; in paren_squish()
[all …]
/freebsd/sys/dev/drm2/
H A Ddrm_linux_list.h37 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()
77 (entry)->prev->next = (entry)->next; in list_del()
[all …]
/freebsd/lib/libpmc/pmu-events/
H A Dlist.h46 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/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h91 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 Drculist.h37 #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/sys/contrib/ck/include/
H A Dck_hp_fifo.h49 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 …]
H A Dck_fifo.h41 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()
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)
189 #define CK_FIFO_SPSC_NEXT(m) ((m)->next)
[all …]
/freebsd/crypto/openssl/ssl/
H A Dpqueue.c29 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()
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()
99 pq->items = pq->items->next; in pqueue_pop()
[all …]
/freebsd/contrib/tcpdump/
H A Dcpack.c59 const uint8_t *next; in nd_cpack_align_and_reserve() local
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() local
100 if ((next = nd_cpack_align_and_reserve(cs, sizeof(*u))) == NULL) in nd_cpack_uint64()
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() local
116 if ((next = nd_cpack_align_and_reserve(cs, sizeof(*u))) == NULL) in nd_cpack_int64()
[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 …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/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 …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/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 …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/contrib/libxo/tests/core/saved/
H A Dtest_08.X.out1 …next>1</next></sub><sub><name>1</name><next>2</next></sub><sub><name>2</name><next>3</next></sub><…
H A Dtest_08.XP.out82 <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 …]
/freebsd/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c42 struct list_head *next, *prev; member
52 list->next = 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()
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()
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/contrib/netbsd-tests/lib/libbluetooth/
H A Dt_sdp_put.c58 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/contrib/ntp/libntp/
H A Dauthreadkeys.c71 * log the first 5 errors, silently ignore the next 10 errors, and give
89 KeyDataT *next; /* queue/stack link */ member
121 node->keyacclist = kap->next; in free_keydata()
149 KeyDataT *next = NULL; in authreadkeys() local
259 next = NULL; in authreadkeys()
283 next = emalloc(sizeof(KeyDataT) + len); in authreadkeys()
284 next->keyacclist = NULL; in authreadkeys()
285 next->keyid = keyno; in authreadkeys()
286 next->keytype = keytype; in authreadkeys()
287 next in authreadkeys()
[all...]
/freebsd/sys/libkern/x86/
H A Dcrc32_sse42.c223 const unsigned char *next, *end; in sse42_crc32c() local
230 next = buf; in sse42_crc32c()
234 while (len && ((uintptr_t)next & (align - 1)) != 0) { in sse42_crc32c()
235 crc0 = _mm_crc32_u8(crc0, *next); in sse42_crc32c()
236 next++; in sse42_crc32c()
252 end = next + LONG; in sse42_crc32c()
255 crc0 = _mm_crc32_u64(crc0, *(const uint64_t *)next); in sse42_crc32c()
257 *(const uint64_t *)(next + LONG)); in sse42_crc32c()
259 *(const uint64_t *)(next + (LONG * 2))); in sse42_crc32c()
261 crc0 = _mm_crc32_u32(crc0, *(const uint32_t *)next); in sse42_crc32c()
[all …]
/freebsd/sys/contrib/openzfs/lib/libspl/
H A Dlist.c38 #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/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_settings.cpp676 const char *next; in __kmp_stg_parse_blocktime() local
684 next = buf; in __kmp_stg_parse_blocktime()
685 SKIP_DIGITS(next); in __kmp_stg_parse_blocktime()
688 buf = next; in __kmp_stg_parse_blocktime()
695 next = buf; in __kmp_stg_parse_blocktime()
696 if (*buf == '\0' || __kmp_match_str("ms", buf, &next)) { in __kmp_stg_parse_blocktime()
701 } else if (__kmp_match_str("us", buf, &next)) { in __kmp_stg_parse_blocktime()
705 } else if (__kmp_match_str("infinite", buf, &next) || in __kmp_stg_parse_blocktime()
706 __kmp_match_str("infinity", buf, &next)) { in __kmp_stg_parse_blocktime()
1118 const char *next = env; in __kmp_parse_nested_num_threads() local
[all …]
/freebsd/contrib/tcsh/
H A Dsh.parse.c67 } while (asyntax(lexp->next, lexp) != 0); in alias()
76 p1 = p1->next; in asyntax()
87 for (p = p1; p != p2; p = p->next) in asyn0()
101 if (p->next != p2 && eq(p->next->word, STRand)) in asyn0()
102 p = p->next; in asyn0()
113 return asyntax(p->next, p2); in asyn0()
145 if (p2 == p1->next) in asyn3()
147 return asyn0(p1->next, p2); in asyn3()
162 if (p1->word[0] && eq(p1->word, alout.next->word)) { in asyn3()
163 Char *cp = alout.next->word; in asyn3()
[all …]
/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)
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/sys/contrib/openzfs/module/zfs/
H A Dzfs_rlock.c314 zfs_locked_range_t *next; in zfs_rangelock_add_reader() local
340 next = prev; in zfs_rangelock_add_reader()
342 next = avl_nearest(tree, where, AVL_AFTER); in zfs_rangelock_add_reader()
344 if (next == NULL || off + len <= next->lr_offset) { in zfs_rangelock_add_reader()
350 if (off < next->lr_offset) { in zfs_rangelock_add_reader()
352 zfs_rangelock_new_proxy(tree, off, next->lr_offset - off); in zfs_rangelock_add_reader()
362 for (prev = NULL; next; prev = next, next = AVL_NEXT(tree, next)) { in zfs_rangelock_add_reader()
363 if (off + len <= next->lr_offset) in zfs_rangelock_add_reader()
366 next->lr_offset) { in zfs_rangelock_add_reader()
368 ASSERT3U(next->lr_offset, >, in zfs_rangelock_add_reader()
[all …]
/freebsd/contrib/expat/xmlwf/
H A Dct.c116 const char *next, *p; in getXMLCharset() local
119 next = buf; in getXMLCharset()
120 p = getTok(&next); in getXMLCharset()
121 if (matchkey(p, next, "text")) in getXMLCharset()
123 else if (! matchkey(p, next, "application")) in getXMLCharset()
125 p = getTok(&next); in getXMLCharset()
128 p = getTok(&next); in getXMLCharset()
129 if (matchkey(p, next, "xml")) in getXMLCharset()
131 p = getTok(&next); in getXMLCharset()
134 p = getTok(&next); in getXMLCharset()
[all …]

12345678910>>...96