Home
last modified time | relevance | path

Searched refs:head (Results 1 – 25 of 450) sorted by relevance

12345678910>>...18

/f-stack/freebsd/sys/
H A Darb.h71 (head)->arb_root_idx = (head)->arb_free_idx = \
96 #define ARB_NODES(head) (head)->arb_nodes argument
97 #define ARB_MAXNODES(head) (head)->arb_maxnodes argument
98 #define ARB_CURNODES(head) (head)->arb_curnodes argument
100 #define ARB_FULL(head) ((head)->arb_curnodes >= (head)->arb_maxnodes) argument
106 #define ARB_ROOT(head) ARB_NODE(head, ARB_ROOTIDX(head)) argument
110 #define ARB_FREEIDX(head) (head)->arb_free_idx argument
111 #define ARB_ROOTIDX(head) (head)->arb_root_idx argument
112 #define ARB_MINIDX(head) (head)->arb_min_idx argument
113 #define ARB_MAXIDX(head) (head)->arb_max_idx argument
[all …]
H A Dqueue.h137 (head)->trace.prevline = (head)->trace.lastline; \
138 (head)->trace.prevfile = (head)->trace.lastfile; \
228 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
230 #define SLIST_FIRST(head) ((head)->slh_first) argument
349 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
373 (head)->stqh_last = &STAILQ_FIRST((head)); \
424 (head)->stqh_last = &STAILQ_FIRST((head)); \
531 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
533 #define LIST_FIRST(head) ((head)->lh_first) argument
717 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
[all …]
H A Dtree.h93 #define SPLAY_ROOT(head) (head)->sph_root argument
94 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
112 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
118 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
140 if (SPLAY_EMPTY(head)) \
206 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
209 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
347 #define RB_ROOT(head) (head)->rbh_root argument
348 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
645 tmp = RB_ROOT(head); \
[all …]
/f-stack/freebsd/kern/
H A Dsubr_disk.c158 head->last_offset = 0; in bioq_init()
160 head->total = 0; in bioq_init()
161 head->batched = 0; in bioq_init()
176 head->batched = 0; in bioq_remove()
177 head->total--; in bioq_remove()
196 head->total++; in bioq_insert_head()
197 head->batched = 0; in bioq_insert_head()
205 head->total++; in bioq_insert_tail()
206 head->batched = 0; in bioq_insert_tail()
299 head->total++; in bioq_disksort()
[all …]
/f-stack/tools/compat/include/sys/
H A Dqueue.h127 (head)->trace.prevline = (head)->trace.lastline; \
128 (head)->trace.prevfile = (head)->trace.lastfile; \
187 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
189 #define SLIST_FIRST(head) ((head)->slh_first) argument
302 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
326 (head)->stqh_last = &STAILQ_FIRST((head)); \
377 (head)->stqh_last = &STAILQ_FIRST((head)); \
451 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
453 #define LIST_FIRST(head) ((head)->lh_first) argument
615 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
[all …]
H A Dtree.h82 #define SPLAY_ROOT(head) (head)->sph_root argument
83 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
101 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
107 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
129 if (SPLAY_EMPTY(head)) \
195 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
198 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
322 #define RB_ROOT(head) (head)->rbh_root argument
323 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
514 elm = RB_ROOT(head); \
[all …]
/f-stack/dpdk/lib/librte_eal/windows/include/sys/
H A Dqueue.h107 (head)->trace.prevline = (head)->trace.lastline; \
108 (head)->trace.prevfile = (head)->trace.lastfile; \
198 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
200 #define SLIST_FIRST(head) ((head)->slh_first) argument
319 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
343 (head)->stqh_last = &STAILQ_FIRST((head)); \
394 (head)->stqh_last = &STAILQ_FIRST((head)); \
502 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
504 #define LIST_FIRST(head) ((head)->lh_first) argument
688 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
[all …]
/f-stack/freebsd/contrib/ck/include/
H A Dck_queue.h142 #define CK_SLIST_EMPTY(head) \ argument
145 #define CK_SLIST_FIRST(head) \ argument
146 (ck_pr_load_ptr(&(head)->cslh_first))
166 #define CK_SLIST_INIT(head) do { \ argument
237 { NULL, &(head).cstqh_first }
256 #define CK_STAILQ_EMPTY(head) (ck_pr_load_ptr(&(head)->cstqh_first) == NULL) argument
258 #define CK_STAILQ_FIRST(head) (ck_pr_load_ptr(&(head)->cstqh_first)) argument
274 (head)->cstqh_last = &(head)->cstqh_first; \
325 (head)->cstqh_last = &(head)->cstqh_first; \
368 #define CK_LIST_FIRST(head) ck_pr_load_ptr(&(head)->clh_first) argument
[all …]
H A Dck_hp_fifo.h72 *stub = fifo->head; in ck_hp_fifo_deinit()
145 head = ck_pr_load_ptr(&fifo->head); in ck_hp_fifo_dequeue_mpmc()
149 if (head != ck_pr_load_ptr(&fifo->head)) in ck_hp_fifo_dequeue_mpmc()
154 if (head != ck_pr_load_ptr(&fifo->head)) in ck_hp_fifo_dequeue_mpmc()
163 } else if (ck_pr_cas_ptr(&fifo->head, head, next) == true) in ck_hp_fifo_dequeue_mpmc()
168 return head; in ck_hp_fifo_dequeue_mpmc()
178 head = ck_pr_load_ptr(&fifo->head); in ck_hp_fifo_trydequeue_mpmc()
182 if (head != ck_pr_load_ptr(&fifo->head)) in ck_hp_fifo_trydequeue_mpmc()
187 if (head != ck_pr_load_ptr(&fifo->head)) in ck_hp_fifo_trydequeue_mpmc()
196 } else if (ck_pr_cas_ptr(&fifo->head, head, next) == false) in ck_hp_fifo_trydequeue_mpmc()
[all …]
H A Dck_stack.h201 original.head = ck_pr_load_ptr(&target->head); in ck_stack_pop_mpmc()
209 update.head = original.head->next; in ck_stack_pop_mpmc()
219 update.head = original.head->next; in ck_stack_pop_mpmc()
222 return original.head; in ck_stack_pop_mpmc()
235 original.head = ck_pr_load_ptr(&target->head); in ck_stack_trypop_mpmc()
241 update.head = original.head->next; in ck_stack_trypop_mpmc()
244 *r = original.head; in ck_stack_trypop_mpmc()
310 n = target->head; in ck_stack_pop_npsc()
324 n = target->head; in ck_stack_batch_pop_npsc()
325 target->head = NULL; in ck_stack_batch_pop_npsc()
[all …]
H A Dck_fifo.h47 struct ck_fifo_spsc_entry *head; member
118 *garbage = fifo->head; in ck_fifo_spsc_deinit()
183 struct ck_fifo_spsc_entry *head = ck_pr_load_ptr(&fifo->head); in ck_fifo_spsc_isempty() local
362 head.generation = ck_pr_load_ptr(&fifo->head.generation); in ck_fifo_mpmc_dequeue()
364 head.pointer = ck_pr_load_ptr(&fifo->head.pointer); in ck_fifo_mpmc_dequeue()
400 if (ck_pr_cas_ptr_2(&fifo->head, &head, &update) == true) in ck_fifo_mpmc_dequeue()
405 *garbage = head.pointer; in ck_fifo_mpmc_dequeue()
416 head.generation = ck_pr_load_ptr(&fifo->head.generation); in ck_fifo_mpmc_trydequeue()
418 head.pointer = ck_pr_load_ptr(&fifo->head.pointer); in ck_fifo_mpmc_trydequeue()
455 if (ck_pr_cas_ptr_2(&fifo->head, &head, &update) == false) in ck_fifo_mpmc_trydequeue()
[all …]
/f-stack/app/redis-5.0.5/deps/jemalloc/test/unit/
H A Dql.c39 list_head_t head; in TEST_BEGIN() local
41 ql_new(&head); in TEST_BEGIN()
93 list_head_t head; in TEST_BEGIN() local
97 ql_new(&head); in TEST_BEGIN()
108 list_head_t head; in TEST_BEGIN() local
112 ql_new(&head); in TEST_BEGIN()
127 list_head_t head; in TEST_BEGIN() local
131 ql_new(&head); in TEST_BEGIN()
142 list_head_t head; in TEST_BEGIN() local
146 ql_new(&head); in TEST_BEGIN()
[all …]
/f-stack/dpdk/drivers/event/dlb/pf/base/
H A Ddlb_osdep_list.h24 for ((iter) = TAILQ_FIRST(&head); \
32 for ((iter) = TAILQ_FIRST(&head); \
50 TAILQ_INIT(head); in dlb_list_init_head()
61 TAILQ_INSERT_TAIL(head, entry, node); in dlb_list_add()
71 TAILQ_REMOVE(head, entry, node); in dlb_list_del()
83 return TAILQ_EMPTY(head); in dlb_list_empty()
92 struct dlb_list_head *head) in dlb_list_splice() argument
94 TAILQ_CONCAT(head, src_head, node); in dlb_list_splice()
103 #define DLB_LIST_HEAD(head, type, name) \ argument
104 (TAILQ_FIRST(&head) ? \
[all …]
/f-stack/dpdk/drivers/event/dlb2/pf/base/
H A Ddlb2_osdep_list.h23 #define TAILQ_FOREACH_ENTRY(ptr, head, name, iter) \ argument
24 for ((iter) = TAILQ_FIRST(&head); \
32 for ((iter) = TAILQ_FIRST(&head); \
49 TAILQ_INIT(head); in dlb2_list_init_head()
60 TAILQ_INSERT_TAIL(head, entry, node); in dlb2_list_add()
71 TAILQ_REMOVE(head, entry, node); in dlb2_list_del()
83 return TAILQ_EMPTY(head); in dlb2_list_empty()
92 struct dlb2_list_head *head) in dlb2_list_splice() argument
94 TAILQ_CONCAT(head, src_head, node); in dlb2_list_splice()
104 (TAILQ_FIRST(&head) ? \
[all …]
/f-stack/freebsd/contrib/vchiq/interface/compat/
H A Dlist.h69 head->prev = head; in INIT_LIST_HEAD()
70 head->next = head; in INIT_LIST_HEAD()
76 return head->next; in list_first()
82 return head->prev; in list_last()
100 return (head->next == head); in list_empty()
107 if (list_empty(head)) in list_is_singular()
109 if (head->next != head->prev) in list_is_singular()
127 __list_add_between(head, node, head->next); in list_add()
133 __list_add_between(head->prev, node, head); in list_add_tail()
161 __list_splice_between(head, list, head->next); in list_splice()
[all …]
/f-stack/freebsd/contrib/openzfs/module/os/freebsd/spl/
H A Dspl_zone.c64 struct zone_dataset_head *head; in zone_dataset_attach() local
84 if (head != NULL) { in zone_dataset_attach()
97 head = malloc(sizeof (*head), M_ZONES, M_WAITOK); in zone_dataset_attach()
98 LIST_INIT(head); in zone_dataset_attach()
117 struct zone_dataset_head *head; in zone_dataset_detach() local
131 if (head == NULL) { in zone_dataset_detach()
144 if (LIST_EMPTY(head)) in zone_dataset_detach()
160 struct zone_dataset_head *head; in zone_dataset_visible() local
176 if (head == NULL) in zone_dataset_visible()
228 head = arg; in zone_destroy()
[all …]
/f-stack/dpdk/drivers/net/fm10k/base/
H A Dfm10k_mbx.c17 fifo->head = 0; in fm10k_fifo_init()
189 return (head > mbx->head) ? --head : ++head; in fm10k_mbx_head_add()
205 return (head < mbx->head) ? ++head : --head; in fm10k_mbx_head_sub()
356 head += end; in fm10k_mbx_write_copy()
443 head++; in fm10k_mbx_read_copy()
455 head++; in fm10k_mbx_read_copy()
989 if (!head || (head == FM10K_MSG_HDR_MASK(HEAD))) in fm10k_mbx_validate_msg_hdr()
1008 if (!head || (head == FM10K_MSG_HDR_MASK(HEAD))) in fm10k_mbx_validate_msg_hdr()
1260 u16 head; in fm10k_mbx_process_disconnect() local
1312 u16 head; in fm10k_mbx_process_error() local
[all …]
/f-stack/lib/
H A Dff_memory.c126 int head = 0; in stklist_pop() local
181 Head_INC(q->head); in ff_txring_enqueue()
183 if ( q->m_table[q->head] ) in ff_txring_enqueue()
185 q->m_table[q->head] = p; in ff_txring_enqueue()
186 Head_INC(q->head); in ff_txring_enqueue()
197 Head_DEC(q->head); in ff_txring_pop()
198 if ( (i==0 && q->m_table[q->head]==NULL) || (i>0 && q->m_table[q->head]!=NULL) ){ in ff_txring_pop()
328 head->l3_len = iph_len; in ff_offload_set()
442 struct rte_mbuf *head = NULL; in ff_if_send_onepkt() local
461 if (head == NULL){ in ff_if_send_onepkt()
[all …]
/f-stack/freebsd/net/
H A Dpfil.c175 pch = &head->head_in; in pfil_run_hooks()
177 pch = &head->head_out; in pfil_run_hooks()
214 head->head_nhooksin = head->head_nhooksout = 0; in pfil_head_register()
230 return (head); in pfil_head_register()
325 struct pfil_head *head; in pfil_link() local
342 head = pa->pa_head; in pfil_link()
391 head->head_nhooksin++; in pfil_link()
431 struct pfil_head *head; in pfil_remove_hook() local
537 struct pfil_head *head; in pfilioc_listheads() local
549 nhooks += head->head_nhooksin + head->head_nhooksout; in pfilioc_listheads()
[all …]
/f-stack/freebsd/netpfil/ipfw/
H A Ddn_sched_rr.c90 if (si->head == NULL) in rr_append()
91 si->head = q; in rr_append()
102 if (si->head == NULL) in rr_remove_head()
104 si->head->status = 0; in rr_remove_head()
106 if (si->head == si->tail) { in rr_remove_head()
111 si->head = si->head->qnext; in rr_remove_head()
125 if (q == si->head) { in remove_queue_q()
144 if (si->head == NULL) in next_pointer()
147 si->head = si->head->qnext; in next_pointer()
157 if (m != q->mq.head) { in rr_enqueue()
[all …]
/f-stack/dpdk/drivers/event/sw/
H A Diq_chunk.h50 while (head) { in iq_free_chunk_list()
52 next = head->next; in iq_free_chunk_list()
53 iq_free_chunk(sw, head); in iq_free_chunk_list()
54 head = next; in iq_free_chunk_list()
62 iq->tail = iq->head; in iq_init()
95 iq->head = next; in iq_pop()
118 current = iq->head; in iq_dequeue_burst()
143 iq->head = next; in iq_dequeue_burst()
146 iq->head = current; in iq_dequeue_burst()
185 new_head->next = iq->head; in iq_put_back()
[all …]
/f-stack/dpdk/lib/librte_eal/common/
H A Deal_common_tailqs.c68 i, tailq->name, head->tqh_first, head->tqh_last); in rte_dump_tailq()
76 struct rte_tailq_head *head = NULL; in rte_eal_tailq_create() local
83 head = &mcfg->tailq_head[rte_tailqs_count]; in rte_eal_tailq_create()
84 strlcpy(head->name, name, sizeof(head->name) - 1); in rte_eal_tailq_create()
85 TAILQ_INIT(&head->tailq_head); in rte_eal_tailq_create()
89 return head; in rte_eal_tailq_create()
113 t->head = rte_eal_tailq_create(t->name); in rte_eal_tailq_update()
115 t->head = rte_eal_tailq_lookup(t->name); in rte_eal_tailq_update()
132 if (t->head == NULL) { in rte_eal_tailq_register()
143 t->head = NULL; in rte_eal_tailq_register()
[all …]
/f-stack/dpdk/drivers/net/bnxt/tf_core/
H A Dll.c14 ll->head = NULL; in ll_init()
22 if (ll->head == NULL) { in ll_insert()
23 ll->head = entry; in ll_insert()
28 entry->next = ll->head; in ll_insert()
31 ll->head = entry->next->prev; in ll_insert()
39 if (ll->head == entry && ll->tail == entry) { in ll_delete()
40 ll->head = NULL; in ll_delete()
42 } else if (ll->head == entry) { in ll_delete()
43 ll->head = entry->next; in ll_delete()
44 ll->head->prev = NULL; in ll_delete()
/f-stack/dpdk/lib/librte_reorder/
H A Drte_reorder.c40 unsigned int head; /**< insertion point in buffer */ member
290 if (order_buf->entries[order_buf->head] == NULL) { in rte_reorder_fill_overflow()
291 order_buf->head = (order_buf->head + 1) & order_buf->mask; in rte_reorder_fill_overflow()
297 ready_buf->entries[ready_buf->head] = in rte_reorder_fill_overflow()
298 order_buf->entries[order_buf->head]; in rte_reorder_fill_overflow()
300 order_buf->entries[order_buf->head] = NULL; in rte_reorder_fill_overflow()
303 order_buf->head = (order_buf->head + 1) & order_buf->mask; in rte_reorder_fill_overflow()
308 ready_buf->head = (ready_buf->head + 1) & ready_buf->mask; in rte_reorder_fill_overflow()
403 (order_buf->entries[order_buf->head] != NULL)) { in rte_reorder_drain()
405 order_buf->entries[order_buf->head] = NULL; in rte_reorder_drain()
[all …]
/f-stack/freebsd/contrib/ipfilter/netinet/
H A Dipf_rb.h49 head->top._f.right = tmp1; \
71 head->top._f.right = tmp1; \
86 parent = &head->top; \
89 p = &head->top._f.right; \
113 rotate_left(head, node); \
141 head->count++; \
174 rotate_right(head, tmp); \
207 rotate_left(head, tmp); \
285 head->count--; \
292 memset(head, 0, sizeof(*head)); \
[all …]

12345678910>>...18