| /f-stack/freebsd/contrib/ck/include/ |
| H A D | ck_hp_fifo.h | 64 stub->next = NULL; in ck_hp_fifo_init()
86 entry->next = NULL; in ck_hp_fifo_enqueue_mpmc()
95 next = ck_pr_load_ptr(&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()
117 entry->next = NULL; in ck_hp_fifo_tryenqueue_mpmc()
125 next = ck_pr_load_ptr(&tail->next); in ck_hp_fifo_tryenqueue_mpmc()
126 if (next != NULL) { in ck_hp_fifo_tryenqueue_mpmc()
129 } else if (ck_pr_cas_ptr(&fifo->tail->next, next, entry) == false) in ck_hp_fifo_tryenqueue_mpmc()
152 next = ck_pr_load_ptr(&head->next); in ck_hp_fifo_dequeue_mpmc()
185 next = ck_pr_load_ptr(&head->next); in ck_hp_fifo_trydequeue_mpmc()
[all …]
|
| H A D | ck_fifo.h | 109 stub->next = NULL; in ck_fifo_spsc_init()
130 entry->next = NULL; in ck_fifo_spsc_enqueue()
264 next.generation = ck_pr_load_ptr(&tail.pointer->next.generation); in ck_fifo_mpmc_enqueue()
266 next.pointer = ck_pr_load_ptr(&tail.pointer->next.pointer); in ck_fifo_mpmc_enqueue()
288 if (ck_pr_cas_ptr_2(&tail.pointer->next, &next, &update) == true) in ck_fifo_mpmc_enqueue()
317 next.generation = ck_pr_load_ptr(&tail.pointer->next.generation); in ck_fifo_mpmc_tryenqueue()
319 next.pointer = ck_pr_load_ptr(&tail.pointer->next.pointer); in ck_fifo_mpmc_tryenqueue()
369 next.generation = ck_pr_load_ptr(&head.pointer->next.generation); in ck_fifo_mpmc_dequeue()
371 next.pointer = ck_pr_load_ptr(&head.pointer->next.pointer); in ck_fifo_mpmc_dequeue()
424 next.generation = ck_pr_load_ptr(&head.pointer->next.generation); in ck_fifo_mpmc_trydequeue()
[all …]
|
| H A D | ck_stack.h | 36 struct ck_stack_entry *next; member
59 entry->next = stack; in ck_stack_push_upmc()
63 entry->next = stack; in ck_stack_push_upmc()
83 entry->next = stack; in ck_stack_trypush_upmc()
105 next = entry->next; in ck_stack_pop_upmc()
111 next = entry->next; in ck_stack_pop_upmc()
209 update.head = original.head->next; in ck_stack_pop_mpmc()
241 update.head = original.head->next; in ck_stack_trypop_mpmc()
277 entry->next = NULL; in ck_stack_push_mpnc()
294 entry->next = target->head; in ck_stack_push_spnc()
[all …]
|
| /f-stack/app/nginx-1.16.1/src/core/ |
| H A D | ngx_queue.h | 20 ngx_queue_t *next; member
26 (q)->next = q
34 (x)->next = (h)->next; \
37 (h)->next = x
51 (h)->next
63 (q)->next
74 (x)->prev->next = (x)->next; \
76 (x)->next = NULL
82 (x)->prev->next = (x)->next
97 (h)->prev->next = (n)->next; \
[all …]
|
| H A D | ngx_slab.c | 282 prev->next = page->next; in ngx_slab_alloc_locked()
313 prev->next = page->next; in ngx_slab_alloc_locked()
503 page->next = slots[slot].next; in ngx_slab_free_locked()
558 page->next = slots[slot].next; in ngx_slab_free_locked()
598 page->next = slots[slot].next; in ngx_slab_free_locked()
690 page[pages].next = page->next; in ngx_slab_alloc_pages()
699 p->next = page->next; in ngx_slab_alloc_pages()
749 prev->next = page->next; in ngx_slab_free_pages()
764 prev->next = join->next; in ngx_slab_free_pages()
788 prev->next = join->next; in ngx_slab_free_pages()
[all …]
|
| H A D | ngx_radix_tree.c | 118 next = tree->root; in ngx_radix32tree_insert()
128 if (next == NULL) { in ngx_radix32tree_insert()
133 node = next; in ngx_radix32tree_insert()
136 if (next) { in ngx_radix32tree_insert()
147 if (next == NULL) { in ngx_radix32tree_insert()
152 next->left = NULL; in ngx_radix32tree_insert()
164 node = next; in ngx_radix32tree_insert()
280 next = tree->root; in ngx_radix128tree_insert()
295 node = next; in ngx_radix128tree_insert()
306 if (next) { in ngx_radix128tree_insert()
[all …]
|
| H A D | ngx_queue.c | 20 ngx_queue_t *middle, *next; in ngx_queue_middle() local
28 next = ngx_queue_head(queue); in ngx_queue_middle()
33 next = ngx_queue_next(next); in ngx_queue_middle()
35 if (next == ngx_queue_last(queue)) { in ngx_queue_middle()
39 next = ngx_queue_next(next); in ngx_queue_middle()
41 if (next == ngx_queue_last(queue)) { in ngx_queue_middle()
54 ngx_queue_t *q, *prev, *next; in ngx_queue_sort() local
62 for (q = ngx_queue_next(q); q != ngx_queue_sentinel(queue); q = next) { in ngx_queue_sort()
65 next = ngx_queue_next(q); in ngx_queue_sort()
|
| /f-stack/dpdk/drivers/common/dpaax/ |
| H A D | dpaa_list.h | 16 struct list_head *next; member
22 .next = &n \
28 __p298->next = __p298; \
29 __p298->prev = __p298->next; \
42 __p298->next = __l298->next; \
45 __l298->next = __p298; \
52 __p298->next = __l298; \
57 for (i = (l)->next; i != (l); i = i->next)
59 for (i = (l)->next, j = i->next; i != (l); \
60 i = j, j = i->next)
[all …]
|
| /f-stack/freebsd/mips/cavium/cryptocteon/ |
| H A D | cavium_crypto.c | 470 int next = 0; in octo_null_sha1_encrypt() local
515 CVM_LOAD_MD5_UNIT(tmp, next); in octo_null_sha1_encrypt()
524 while (next != 7) { in octo_null_sha1_encrypt()
571 int next = 0; in octo_aes_cbc_sha1_encrypt() local
687 CVM_LOAD_SHA_UNIT(tmp, next); in octo_aes_cbc_sha1_encrypt()
696 while (next != 7) { in octo_aes_cbc_sha1_encrypt()
733 CVM_LOAD_MD5_UNIT(tmp, next); in octo_aes_cbc_sha1_encrypt()
762 int next = 0; in octo_aes_cbc_sha1_decrypt() local
878 CVM_LOAD_SHA_UNIT(tmp, next); in octo_aes_cbc_sha1_decrypt()
887 while (next != 7) { in octo_aes_cbc_sha1_decrypt()
[all …]
|
| /f-stack/tools/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><…
|
| H A D | test_08.J.out | 1 …next":1}, {"name":1,"next":2}, {"name":2,"next":3}],"last":3}, {"name":"rope","count":85, "sub": […
|
| H A D | test_08.JP.out | 91 "next": 1
95 "next": 2
99 "next": 3
110 "next": 1
114 "next": 2
118 "next": 3
129 "next": 1
133 "next": 2
137 "next": 3
148 "next": 1
[all …]
|
| /f-stack/freebsd/libkern/x86/ |
| H A D | crc32_sse42.c | 232 next = buf; in sse42_crc32c()
238 next++; in sse42_crc32c()
254 end = next + LONG; in sse42_crc32c()
269 next += align; in sse42_crc32c()
318 next += LONG * 2; in sse42_crc32c()
332 end = next + SHORT; in sse42_crc32c()
347 next += align; in sse42_crc32c()
353 next += SHORT * 2; in sse42_crc32c()
360 while (next < end) { in sse42_crc32c()
366 next += align; in sse42_crc32c()
[all …]
|
| /f-stack/freebsd/netpfil/ipfw/test/ |
| H A D | mylist.h | 11 struct list_head *prev, *next; member
15 #define list_empty(l) ( (l)->next == l )
18 struct list_head *next) in __list_add() argument
20 next->prev = o; in __list_add()
21 o->next = next; in __list_add()
23 prev->next = o; in __list_add()
36 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
38 next->prev = prev; in __list_del()
39 prev->next = next; in __list_del()
46 __list_del(entry->prev, entry->next); in list_del()
[all …]
|
| /f-stack/freebsd/contrib/openzfs/lib/libspl/ |
| H A D | list.c | 43 lnew->next = (node)->next; \
45 (node)->next = lnew; \
50 lnew->next = (node); \
57 (node)->prev->next = (node)->next; \
126 ASSERT(lold->next != NULL); in list_remove()
203 dstnode->prev->next = srcnode->next; in list_move_tail()
218 lnew->next = lold->next; in list_link_replace()
220 lold->prev->next = lnew; in list_link_replace()
221 lold->next->prev = lnew; in list_link_replace()
228 ln->next = NULL; in list_link_init()
[all …]
|
| /f-stack/freebsd/kern/ |
| H A D | subr_module.c | 60 int next; in preload_search_by_name() local
76 next = roundup(next, sizeof(u_long)); in preload_search_by_name()
91 int next; in preload_search_by_type() local
112 next = roundup(next, sizeof(u_long)); in preload_search_by_type()
127 int next; in preload_search_next_name() local
136 next = roundup(next, sizeof(u_long)); in preload_search_next_name()
152 next = roundup(next, sizeof(u_long)); in preload_search_next_name()
169 int next; in preload_search_info() local
201 next = roundup(next, sizeof(u_long)); in preload_search_info()
251 next = roundup(next, sizeof(u_long)); in preload_delete_name()
[all …]
|
| /f-stack/app/redis-5.0.5/src/ |
| H A D | adlist.c | 59 listNode *current, *next; in listEmpty() local
64 next = current->next; in listEmpty()
67 current = next; in listEmpty()
126 node->next = NULL; in listAddNodeTail()
142 node->next = old_node->next; in listInsertNode()
156 if (node->next != NULL) { in listInsertNode()
170 node->prev->next = node->next; in listDelNode()
173 if (node->next) in listDelNode()
206 li->next = list->head; in listRewind()
211 li->next = list->tail; in listRewindTail()
[all …]
|
| /f-stack/freebsd/contrib/vchiq/interface/compat/ |
| H A D | list.h | 70 head->next = head; in INIT_LIST_HEAD()
76 return head->next; in list_first()
88 return node->next; in list_next()
118 prev->next = node; in __list_add_between()
120 node->next = next; in __list_add_between()
121 next->prev = node; in __list_add_between()
139 entry->prev->next = entry->next; in list_del()
151 prev->next = first; in __list_splice_between()
153 last->next = next; in __list_splice_between()
154 next->prev = last; in __list_splice_between()
[all …]
|
| /f-stack/freebsd/contrib/openzfs/module/zfs/ |
| H A D | zfs_rlock.c | 340 next = prev; in zfs_rangelock_add_reader()
344 if (next == NULL || off + len <= next->lr_offset) { in zfs_rangelock_add_reader()
362 for (prev = NULL; next; prev = next, next = AVL_NEXT(tree, next)) { in zfs_rangelock_add_reader()
375 if (off + len == next->lr_offset + next->lr_length) { in zfs_rangelock_add_reader()
377 next = zfs_rangelock_proxify(tree, next); in zfs_rangelock_add_reader()
381 if (off + len < next->lr_offset + next->lr_length) { in zfs_rangelock_add_reader()
383 next = zfs_rangelock_split(tree, next, off + len); in zfs_rangelock_add_reader()
387 ASSERT3U(off + len, >, next->lr_offset + next->lr_length); in zfs_rangelock_add_reader()
388 next = zfs_rangelock_proxify(tree, next); in zfs_rangelock_add_reader()
446 for (; next != NULL; next = AVL_NEXT(tree, next)) { in zfs_rangelock_enter_reader()
[all …]
|
| /f-stack/freebsd/contrib/ck/include/spinlock/ |
| H A D | mcs.h | 40 struct ck_spinlock_mcs *next; member
63 node->next = NULL; in ck_spinlock_mcs_trylock()
92 node->next = NULL; in ck_spinlock_mcs_lock()
106 ck_pr_store_ptr(&previous->next, node); in ck_spinlock_mcs_lock()
119 struct ck_spinlock_mcs *next; in ck_spinlock_mcs_unlock() local
123 next = ck_pr_load_ptr(&node->next); in ck_spinlock_mcs_unlock()
124 if (next == NULL) { in ck_spinlock_mcs_unlock()
142 next = ck_pr_load_ptr(&node->next); in ck_spinlock_mcs_unlock()
143 if (next != NULL) in ck_spinlock_mcs_unlock()
151 ck_pr_store_uint(&next->locked, false); in ck_spinlock_mcs_unlock()
|
| /f-stack/dpdk/drivers/event/sw/ |
| H A D | iq_chunk.h | 16 struct sw_queue_chunk *next; member
36 chunk->next = NULL; in iq_alloc_chunk()
52 next = head->next; in iq_free_chunk_list()
54 head = next; in iq_free_chunk_list()
80 iq->tail->next = chunk; in iq_enqueue()
93 struct sw_queue_chunk *next = iq->head->next; in iq_pop() local
95 iq->head = next; in iq_pop()
133 next = current->next; in iq_dequeue_burst()
135 current = next; in iq_dequeue_burst()
141 struct sw_queue_chunk *next = current->next; in iq_dequeue_burst() local
[all …]
|
| /f-stack/dpdk/lib/librte_eal/common/ |
| H A D | malloc_elem.c | 137 elem->next = NULL; in malloc_elem_init()
327 next = elem->next; in remove_elem()
330 if (next) in remove_elem()
335 prev->next = next; in remove_elem()
340 elem->next = NULL; in remove_elem()
492 struct malloc_elem *next = elem2->next; in join_elem() local
494 if (next) in join_elem()
498 elem1->next = next; in join_elem()
512 if (elem->next != NULL && elem->next->state == ELEM_FREE && in malloc_elem_join_adjacent_free()
598 next = elem->next; in malloc_elem_hide_region()
[all …]
|
| /f-stack/dpdk/examples/performance-thread/common/ |
| H A D | lthread_pool.h | 48 struct qnode *next; member
118 n->next = NULL; in _qnode_pool_insert()
125 prev->next = (n); in _qnode_pool_insert()
144 struct qnode *next = tail->next; in _pool_remove() local
151 p->tail = next; in _pool_remove()
152 tail = next; in _pool_remove()
153 next = next->next; in _pool_remove()
156 p->tail = next; in _pool_remove()
167 next = tail->next; in _pool_remove()
168 if (next) { in _pool_remove()
[all …]
|
| /f-stack/dpdk/drivers/net/softnic/ |
| H A D | parser.c | 82 char *next; in softnic_parser_read_int32() local
90 if (p == next) in softnic_parser_read_int32()
100 char *next; in softnic_parser_read_uint64() local
108 if (p == next) in softnic_parser_read_uint64()
111 p = next; in softnic_parser_read_uint64()
140 char *next; in softnic_parser_read_uint64_hex() local
326 char *next; in softnic_parse_mpls_labels() local
459 next++; in softnic_parse_cpu_core()
466 next++; in softnic_parse_cpu_core()
473 next++; in softnic_parse_cpu_core()
[all …]
|