| /f-stack/freebsd/contrib/ck/include/ |
| H A D | ck_hp_fifo.h | 90 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_enqueue_mpmc()
92 if (tail != ck_pr_load_ptr(&fifo->tail)) in ck_hp_fifo_enqueue_mpmc()
97 ck_pr_cas_ptr(&fifo->tail, tail, next); in ck_hp_fifo_enqueue_mpmc()
104 ck_pr_cas_ptr(&fifo->tail, tail, entry); in ck_hp_fifo_enqueue_mpmc()
120 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_tryenqueue_mpmc()
122 if (tail != ck_pr_load_ptr(&fifo->tail)) in ck_hp_fifo_tryenqueue_mpmc()
127 ck_pr_cas_ptr(&fifo->tail, tail, next); in ck_hp_fifo_tryenqueue_mpmc()
133 ck_pr_cas_ptr(&fifo->tail, tail, entry); in ck_hp_fifo_tryenqueue_mpmc()
147 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_dequeue_mpmc()
180 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_trydequeue_mpmc()
[all …]
|
| H A D | ck_fifo.h | 263 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_enqueue()
280 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_enqueue()
297 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_enqueue()
314 tail.generation = ck_pr_load_ptr(&fifo->tail.generation); in ck_fifo_mpmc_tryenqueue()
316 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_tryenqueue()
333 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_tryenqueue()
350 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_tryenqueue()
367 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_dequeue()
385 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_dequeue()
422 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_trydequeue()
[all …]
|
| /f-stack/app/redis-5.0.5/deps/jemalloc/include/jemalloc/internal/ |
| H A D | hash.h | 107 case 3: k1 ^= tail[2] << 16; in hash_x86_32()
108 case 2: k1 ^= tail[1] << 8; in hash_x86_32()
180 case 15: k4 ^= tail[14] << 16; in hash_x86_128()
181 case 14: k4 ^= tail[13] << 8; in hash_x86_128()
182 case 13: k4 ^= tail[12] << 0; in hash_x86_128()
187 case 10: k3 ^= tail[ 9] << 8; in hash_x86_128()
188 case 9: k3 ^= tail[ 8] << 0; in hash_x86_128()
193 case 6: k2 ^= tail[ 5] << 8; in hash_x86_128()
194 case 5: k2 ^= tail[ 4] << 0; in hash_x86_128()
199 case 2: k1 ^= tail[ 1] << 8; in hash_x86_128()
[all …]
|
| /f-stack/app/redis-5.0.5/src/ |
| H A D | adlist.c | 128 list->tail = node; in listAddNodeTail()
211 li->next = list->tail; in listRewindTail()
320 n = list->tail; in listIndex()
331 listNode *tail = list->tail; in listRotate() local
336 list->tail = tail->prev; in listRotate()
337 list->tail->next = NULL; in listRotate()
339 list->head->prev = tail; in listRotate()
340 tail->prev = NULL; in listRotate()
342 list->head = tail; in listRotate()
351 if (l->tail) in listJoin()
[all …]
|
| /f-stack/dpdk/lib/librte_ring/ |
| H A D | rte_ring_peek_c11_mem.h | 31 __rte_ring_st_get_tail(struct rte_ring_headtail *ht, uint32_t *tail, in __rte_ring_st_get_tail() argument
37 t = ht->tail; in __rte_ring_st_get_tail()
43 *tail = t; in __rte_ring_st_get_tail()
53 __rte_ring_st_set_head_tail(struct rte_ring_headtail *ht, uint32_t tail, in __rte_ring_st_set_head_tail() argument
60 pos = tail + num; in __rte_ring_st_set_head_tail()
62 __atomic_store_n(&ht->tail, pos, __ATOMIC_RELEASE); in __rte_ring_st_set_head_tail()
75 __rte_ring_hts_get_tail(struct rte_ring_hts_headtail *ht, uint32_t *tail, in __rte_ring_hts_get_tail() argument
82 n = p.pos.head - p.pos.tail; in __rte_ring_hts_get_tail()
87 *tail = p.pos.tail; in __rte_ring_hts_get_tail()
104 p.pos.head = tail + num; in __rte_ring_hts_set_head_tail()
[all …]
|
| H A D | rte_ring_hts_c11_mem.h | 28 uint32_t tail; in __rte_ring_hts_update_tail() local
32 tail = old_tail + num; in __rte_ring_hts_update_tail()
33 __atomic_store_n(&ht->ht.pos.tail, tail, __ATOMIC_RELEASE); in __rte_ring_hts_update_tail()
45 while (p->pos.head != p->pos.tail) { in __rte_ring_hts_head_wait()
83 *free_entries = capacity + r->cons.tail - op.pos.head; in __rte_ring_hts_move_prod_head()
93 np.pos.tail = op.pos.tail; in __rte_ring_hts_move_prod_head()
139 *entries = r->prod.tail - op.pos.head; in __rte_ring_hts_move_cons_head()
148 np.pos.tail = op.pos.tail; in __rte_ring_hts_move_cons_head()
|
| H A D | rte_ring_peek.h | 208 uint32_t tail; in rte_ring_enqueue_elem_finish() local
212 n = __rte_ring_st_get_tail(&r->prod, &tail, n); in rte_ring_enqueue_elem_finish()
214 __rte_ring_enqueue_elems(r, tail, obj_table, esize, n); in rte_ring_enqueue_elem_finish()
215 __rte_ring_st_set_head_tail(&r->prod, tail, n, 1); in rte_ring_enqueue_elem_finish()
218 n = __rte_ring_hts_get_tail(&r->hts_prod, &tail, n); in rte_ring_enqueue_elem_finish()
220 __rte_ring_enqueue_elems(r, tail, obj_table, esize, n); in rte_ring_enqueue_elem_finish()
221 __rte_ring_hts_set_head_tail(&r->hts_prod, tail, n, 1); in rte_ring_enqueue_elem_finish()
414 uint32_t tail; in rte_ring_dequeue_elem_finish() local
418 n = __rte_ring_st_get_tail(&r->cons, &tail, n); in rte_ring_dequeue_elem_finish()
419 __rte_ring_st_set_head_tail(&r->cons, tail, n, 0); in rte_ring_dequeue_elem_finish()
[all …]
|
| H A D | rte_ring_peek_zc.h | 297 uint32_t tail; in rte_ring_enqueue_zc_elem_finish() local
301 n = __rte_ring_st_get_tail(&r->prod, &tail, n); in rte_ring_enqueue_zc_elem_finish()
302 __rte_ring_st_set_head_tail(&r->prod, tail, n, 1); in rte_ring_enqueue_zc_elem_finish()
305 n = __rte_ring_hts_get_tail(&r->hts_prod, &tail, n); in rte_ring_enqueue_zc_elem_finish()
306 __rte_ring_hts_set_head_tail(&r->hts_prod, tail, n, 1); in rte_ring_enqueue_zc_elem_finish()
509 uint32_t tail; in rte_ring_dequeue_zc_elem_finish() local
513 n = __rte_ring_st_get_tail(&r->cons, &tail, n); in rte_ring_dequeue_zc_elem_finish()
514 __rte_ring_st_set_head_tail(&r->cons, tail, n, 0); in rte_ring_dequeue_zc_elem_finish()
517 n = __rte_ring_hts_get_tail(&r->hts_cons, &tail, n); in rte_ring_dequeue_zc_elem_finish()
518 __rte_ring_hts_set_head_tail(&r->hts_cons, tail, n, 0); in rte_ring_dequeue_zc_elem_finish()
|
| /f-stack/dpdk/drivers/net/fm10k/base/ |
| H A D | fm10k_mbx.c | 18 fifo->tail = 0; in fm10k_fifo_init()
138 if (len > tail) in fm10k_mbx_index_len()
157 return (tail > mbx->tail) ? --tail : ++tail; in fm10k_mbx_tail_add()
173 return (tail < mbx->tail) ? ++tail : --tail; in fm10k_mbx_tail_sub()
352 tail++; in fm10k_mbx_write_copy()
366 if (!tail) in fm10k_mbx_write_copy()
367 tail++; in fm10k_mbx_write_copy()
447 tail += end; in fm10k_mbx_read_copy()
995 if (!tail || (tail == FM10K_MSG_HDR_MASK(TAIL))) in fm10k_mbx_validate_msg_hdr()
1011 if (tail) in fm10k_mbx_validate_msg_hdr()
[all …]
|
| /f-stack/dpdk/drivers/crypto/qat/ |
| H A D | qat_sym_hw_dp.c | 249 dp_ctx->tail = tail; in qat_sym_dp_enqueue_single_aead()
276 tail = dp_ctx->tail; in qat_sym_dp_enqueue_aead_jobs()
296 dp_ctx->tail = tail; in qat_sym_dp_enqueue_aead_jobs()
348 dp_ctx->tail = tail; in qat_sym_dp_enqueue_single_cipher()
375 tail = dp_ctx->tail; in qat_sym_dp_enqueue_cipher_jobs()
395 dp_ctx->tail = tail; in qat_sym_dp_enqueue_cipher_jobs()
469 dp_ctx->tail = tail; in qat_sym_dp_enqueue_single_auth()
496 tail = dp_ctx->tail; in qat_sym_dp_enqueue_auth_jobs()
516 dp_ctx->tail = tail; in qat_sym_dp_enqueue_auth_jobs()
652 dp_ctx->tail = tail; in qat_sym_dp_enqueue_single_chain()
[all …]
|
| /f-stack/dpdk/examples/performance-thread/common/ |
| H A D | lthread_pool.h | 98 p->tail = p->stub; in _qnode_pool_create()
143 struct qnode *tail = p->tail; in _pool_remove() local
147 if (tail == p->stub) { in _pool_remove()
151 p->tail = next; in _pool_remove()
152 tail = next; in _pool_remove()
156 p->tail = next; in _pool_remove()
157 return tail; in _pool_remove()
161 if (tail == head) in _pool_remove()
167 next = tail->next; in _pool_remove()
169 p->tail = next; in _pool_remove()
[all …]
|
| H A D | lthread_queue.h | 48 struct qnode *tail __rte_cache_aligned;
83 new_queue->tail = stub; in _lthread_queue_create()
98 return q->tail == q->head; in _lthread_queue_empty()
192 struct qnode *tail = q->tail; in _lthread_queue_poll() local
193 struct qnode *next = (struct qnode *)tail->next; in _lthread_queue_poll()
202 q->tail = next; in _lthread_queue_poll()
203 tail->data = next->data; in _lthread_queue_poll()
204 data = tail->data; in _lthread_queue_poll()
207 _qnode_free(tail); in _lthread_queue_poll()
|
| /f-stack/dpdk/drivers/net/tap/ |
| H A D | tap_netlink.c | 31 struct rtattr *tail; member
371 struct nested_tail *tail; in tap_nlattr_nested_start() local
374 if (!tail) { in tap_nlattr_nested_start()
380 tail->tail = (struct rtattr *)NLMSG_TAIL(&msg->nh); in tap_nlattr_nested_start()
384 tail->prev = msg->nested_tails; in tap_nlattr_nested_start()
386 msg->nested_tails = tail; in tap_nlattr_nested_start()
403 struct nested_tail *tail = msg->nested_tails; in tap_nlattr_nested_finish() local
405 tail->tail->rta_len = (char *)NLMSG_TAIL(&msg->nh) - (char *)tail->tail; in tap_nlattr_nested_finish()
407 if (tail->prev) in tap_nlattr_nested_finish()
408 msg->nested_tails = tail->prev; in tap_nlattr_nested_finish()
[all …]
|
| /f-stack/dpdk/drivers/bus/dpaa/include/ |
| H A D | dpaa_rbtree.h | 37 struct rb_node *head, *tail; member
43 tree->head = tree->tail = NULL; in dpa_rbtree_init()
54 tree->head = tree->tail = &obj->node_field; \
74 obj->node_field.prev = tree->tail; \
76 tree->tail->next = &obj->node_field; \
77 tree->tail = &obj->node_field; \
83 if (tree->tail == &obj->node_field) \
85 tree->head = tree->tail = NULL; \
92 if (tree->tail == &obj->node_field) { \
94 tree->tail = tree->tail->prev; \
[all …]
|
| /f-stack/dpdk/drivers/net/bnxt/tf_core/ |
| H A D | ll.c | 15 ll->tail = NULL; in ll_init()
24 ll->tail = entry; in ll_insert()
39 if (ll->head == entry && ll->tail == entry) { in ll_delete()
41 ll->tail = NULL; in ll_delete()
45 } else if (ll->tail == entry) { in ll_delete()
46 ll->tail = entry->prev; in ll_delete()
47 ll->tail->next = NULL; in ll_delete()
|
| /f-stack/dpdk/drivers/net/hns3/ |
| H A D | hns3_mbx.c | 200 return tail == hw->cmq.crq.next_to_use; in hns3_cmd_crq_empty()
210 uint32_t tail; in hns3_mbx_handler() local
212 tail = hw->arq.tail; in hns3_mbx_handler()
215 while (tail != hw->arq.head) { in hns3_mbx_handler()
261 uint32_t tail = resp->tail + 1; in hns3_update_resp_position() local
263 if (tail > resp->head) in hns3_update_resp_position()
264 tail = resp->head; in hns3_update_resp_position()
272 } else if (tail + resp->lost > resp->head) { in hns3_update_resp_position()
276 resp->head, tail, resp->lost); in hns3_update_resp_position()
279 resp->tail = tail; in hns3_update_resp_position()
[all …]
|
| /f-stack/dpdk/drivers/net/octeontx2/ |
| H A D | otx2_ethdev_ops.c | 330 if (head == NULL || tail == NULL) in nix_rx_head_tail_get()
348 uint32_t head, tail; in otx2_nix_rx_queue_count() local
351 return (tail - head) % rxq->qlen; in otx2_nix_rx_queue_count()
358 if (tail > head && offset <= tail && offset >= head) in nix_offset_has_packet()
361 if (head > tail && (offset >= head || offset <= tail)) in nix_offset_has_packet()
371 uint32_t head, tail; in otx2_nix_rx_descriptor_done() local
374 &head, &tail, rxq->rq); in otx2_nix_rx_descriptor_done()
383 uint32_t head, tail; in otx2_nix_rx_descriptor_status() local
389 &head, &tail, rxq->rq); in otx2_nix_rx_descriptor_status()
403 if (head == NULL || tail == NULL) in nix_tx_head_tail_get()
[all …]
|
| /f-stack/dpdk/drivers/net/thunderx/ |
| H A D | nicvf_rxtx.c | 150 uint32_t tail; in nicvf_xmit_pkts() local
157 tail = sq->tail; in nicvf_xmit_pkts()
165 tail = (tail + 1) & qlen_mask; in nicvf_xmit_pkts()
167 txbuffs[tail] = pkt; in nicvf_xmit_pkts()
169 tail = (tail + 1) & qlen_mask; in nicvf_xmit_pkts()
174 sq->tail = tail; in nicvf_xmit_pkts()
197 tail = sq->tail; in nicvf_xmit_pkts_multiseg()
216 tail = (tail + 1) & qlen_mask; in nicvf_xmit_pkts_multiseg()
220 tail = (tail + 1) & qlen_mask; in nicvf_xmit_pkts_multiseg()
226 tail = (tail + 1) & qlen_mask; in nicvf_xmit_pkts_multiseg()
[all …]
|
| /f-stack/freebsd/netpfil/ipfw/ |
| H A D | dn_sched_rr.c | 79 struct rr_queue *head, *tail; /* Pointer to current queue */ member
93 si->tail->qnext = q; in rr_append()
94 si->tail = q; /* advance the tail pointer */ in rr_append()
106 if (si->head == si->tail) { in rr_remove_head()
107 si->head = si->tail = NULL; in rr_remove_head()
112 si->tail->qnext = si->head; in rr_remove_head()
134 if (q == si->tail) in remove_queue_q()
135 si->tail = prev; in remove_queue_q()
148 si->tail = si->tail->qnext; in next_pointer()
229 si->head = si->tail = NULL; in rr_new_sched()
|
| /f-stack/freebsd/netgraph/bluetooth/include/ |
| H A D | ng_bluetooth.h | 69 struct mbuf *tail; /* last item in the queue */ member
80 (q)->tail = NULL; \
103 if ((q)->tail == NULL) \
106 (q)->tail->m_nextpkt = (i); \
108 (q)->tail = (i); \
118 (q)->tail = NULL; \
128 if ((q)->tail == NULL) \
129 (q)->tail = (i); \
|
| /f-stack/dpdk/drivers/common/qat/ |
| H A D | qat_qp.c | 433 queue->tail = 0; in qat_queue_create()
548 q->csr_tail = q->tail; in txq_write_tail()
587 register uint32_t tail; in qat_enqueue_op_burst() local
595 tail = queue->tail; in qat_enqueue_op_burst()
660 tail = adf_modulo(tail + queue->msg_size, queue->modulo_mask); in qat_enqueue_op_burst()
665 queue->tail = tail; in qat_enqueue_op_burst()
684 register uint32_t tail; in qat_enqueue_comp_op_burst() local
696 tail = queue->tail; in qat_enqueue_comp_op_burst()
831 tail = adf_modulo(tail + (queue->msg_size * descriptors_built), in qat_enqueue_comp_op_burst()
838 queue->tail = tail; in qat_enqueue_comp_op_burst()
[all …]
|
| /f-stack/dpdk/drivers/net/atlantic/ |
| H A D | atl_rxtx.c | 967 eop_tail = tail; in atl_recv_pkts()
974 if (eop_tail == tail) in atl_recv_pkts()
1063 tail = (tail + 1) % rxq->nb_rx_desc; in atl_recv_pkts()
1094 rxq->rx_tail = tail; in atl_recv_pkts()
1112 tail = (uint16_t)((tail == 0) ? in atl_recv_pkts()
1228 int tail = 0; in atl_xmit_pkt() local
1237 tail = txq->tx_tail; in atl_xmit_pkt()
1248 tail = (tail + 1) % txq->nb_tx_desc; in atl_xmit_pkt()
1249 txq->tx_tail = tail; in atl_xmit_pkt()
1291 tail = (tail + 1) % txq->nb_tx_desc; in atl_xmit_pkt()
[all …]
|
| /f-stack/dpdk/drivers/event/opdl/ |
| H A D | opdl_ring.c | 73 uint32_t tail; member
171 uint32_t this_tail = s->shared.tail; in update_available_seq()
328 tail)) { in claim_mgr_add()
333 mgr->claims[claim_mgr_index(mgr->mgr_head)].tail = tail; in claim_mgr_add()
337 mgr->num_claimed += (head - tail); in claim_mgr_add()
348 *tail = mgr->claims[claim_mgr_index(mgr->mgr_tail)].tail; in claim_mgr_read()
375 uint32_t tail; in opdl_stage_disclaim_multithread_n() local
386 tail) { in opdl_stage_disclaim_multithread_n()
391 num_entries -= (head - tail); in opdl_stage_disclaim_multithread_n()
395 num_entries + tail, in opdl_stage_disclaim_multithread_n()
[all …]
|
| /f-stack/freebsd/contrib/ena-com/ |
| H A D | ena_eth_com.h | 105 u16 tail, next_to_comp, cnt; in ena_com_free_q_entries() local
108 tail = io_sq->tail; in ena_com_free_q_entries()
109 cnt = tail - next_to_comp; in ena_com_free_q_entries()
184 u16 tail = io_sq->tail; in ena_com_write_sq_doorbell() local
188 io_sq->qid, tail); in ena_com_write_sq_doorbell()
190 ENA_REG_WRITE32(io_sq->bus, tail, io_sq->db_addr); in ena_com_write_sq_doorbell()
|
| /f-stack/dpdk/drivers/net/ena/base/ |
| H A D | ena_eth_com.h | 77 u16 tail, next_to_comp, cnt; in ena_com_free_q_entries() local
80 tail = io_sq->tail; in ena_com_free_q_entries()
81 cnt = tail - next_to_comp; in ena_com_free_q_entries()
155 u16 tail = io_sq->tail; in ena_com_write_sq_doorbell() local
158 io_sq->qid, tail); in ena_com_write_sq_doorbell()
160 ENA_REG_WRITE32(io_sq->bus, tail, io_sq->db_addr); in ena_com_write_sq_doorbell()
|