Home
last modified time | relevance | path

Searched refs:num (Results 1 – 25 of 212) sorted by relevance

123456789

/dpdk/drivers/net/virtio/
H A Dvirtio_ring.h85 unsigned int num; member
93 unsigned int num; member
130 #define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])
131 #define vring_avail_event(vr) (*(uint16_t *)&(vr)->used->ring[(vr)->num])
134 vring_size(struct virtio_hw *hw, unsigned int num, unsigned long align) in vring_size() argument
139 size = num * sizeof(struct vring_packed_desc); in vring_size()
146 size = num * sizeof(struct vring_desc); in vring_size()
147 size += sizeof(struct vring_avail) + (num * sizeof(uint16_t)); in vring_size()
150 (num * sizeof(struct vring_used_elem)); in vring_size()
155 unsigned long align, unsigned int num) in vring_init_split() argument
[all …]
H A Dvirtio_rxtx_packed.c86 uint16_t num, nb_rx = 0; in virtio_recv_pkts_packed_vec() local
93 num = RTE_MIN(VIRTIO_MBUF_BURST_SZ, nb_pkts); in virtio_recv_pkts_packed_vec()
94 if (likely(num > PACKED_BATCH_SIZE)) in virtio_recv_pkts_packed_vec()
95 num = num - ((vq->vq_used_cons_idx + num) % PACKED_BATCH_SIZE); in virtio_recv_pkts_packed_vec()
97 while (num) { in virtio_recv_pkts_packed_vec()
98 if (num >= PACKED_BATCH_SIZE) { in virtio_recv_pkts_packed_vec()
102 num -= PACKED_BATCH_SIZE; in virtio_recv_pkts_packed_vec()
109 num--; in virtio_recv_pkts_packed_vec()
115 PMD_RX_LOG(DEBUG, "dequeue:%d", num); in virtio_recv_pkts_packed_vec()
/dpdk/lib/acl/
H A Dacl_run_avx512.c114 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_avx512x16() argument
119 while (num > max_iter) { in rte_acl_classify_avx512x16()
123 num -= max_iter; in rte_acl_classify_avx512x16()
127 if (num >= MAX_SEARCHES_AVX16) in rte_acl_classify_avx512x16()
128 return search_avx512x8x2(ctx, data, results, num, categories); in rte_acl_classify_avx512x16()
129 if (num >= MAX_SEARCHES_SSE8) in rte_acl_classify_avx512x16()
130 return search_sse_8(ctx, data, results, num, categories); in rte_acl_classify_avx512x16()
131 if (num >= MAX_SEARCHES_SSE4) in rte_acl_classify_avx512x16()
132 return search_sse_4(ctx, data, results, num, categories); in rte_acl_classify_avx512x16()
134 return rte_acl_classify_scalar(ctx, data, results, num, categories); in rte_acl_classify_avx512x16()
[all …]
H A Dacl_run_avx2.c14 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_avx2() argument
16 if (likely(num >= MAX_SEARCHES_AVX16)) in rte_acl_classify_avx2()
17 return search_avx2x16(ctx, data, results, num, categories); in rte_acl_classify_avx2()
18 else if (num >= MAX_SEARCHES_SSE8) in rte_acl_classify_avx2()
19 return search_sse_8(ctx, data, results, num, categories); in rte_acl_classify_avx2()
20 else if (num >= MAX_SEARCHES_SSE4) in rte_acl_classify_avx2()
21 return search_sse_4(ctx, data, results, num, categories); in rte_acl_classify_avx2()
23 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_avx2()
H A Dacl_run_neon.c9 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_neon() argument
11 if (likely(num >= 8)) in rte_acl_classify_neon()
12 return search_neon_8(ctx, data, results, num, categories); in rte_acl_classify_neon()
13 else if (num >= 4) in rte_acl_classify_neon()
14 return search_neon_4(ctx, data, results, num, categories); in rte_acl_classify_neon()
16 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_neon()
H A Dacl_run_sse.c9 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_sse() argument
11 if (likely(num >= MAX_SEARCHES_SSE8)) in rte_acl_classify_sse()
12 return search_sse_8(ctx, data, results, num, categories); in rte_acl_classify_sse()
13 else if (num >= MAX_SEARCHES_SSE4) in rte_acl_classify_sse()
14 return search_sse_4(ctx, data, results, num, categories); in rte_acl_classify_sse()
16 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_sse()
H A Dacl_run_altivec.c10 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_altivec() argument
12 if (likely(num >= MAX_SEARCHES_ALTIVEC8)) in rte_acl_classify_altivec()
13 return search_altivec_8(ctx, data, results, num, categories); in rte_acl_classify_altivec()
14 else if (num >= MAX_SEARCHES_ALTIVEC4) in rte_acl_classify_altivec()
15 return search_altivec_4(ctx, data, results, num, categories); in rte_acl_classify_altivec()
17 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_altivec()
/dpdk/drivers/crypto/virtio/
H A Dvirtio_ring.h61 unsigned int num; member
97 #define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])
98 #define vring_avail_event(vr) (*(uint16_t *)&(vr)->used->ring[(vr)->num])
101 vring_size(unsigned int num, unsigned long align) in vring_size() argument
105 size = num * sizeof(struct vring_desc); in vring_size()
106 size += sizeof(struct vring_avail) + (num * sizeof(uint16_t)); in vring_size()
109 (num * sizeof(struct vring_used_elem)); in vring_size()
114 vring_init(struct vring *vr, unsigned int num, uint8_t *p, in vring_init() argument
117 vr->num = num; in vring_init()
120 num * sizeof(struct vring_desc)); in vring_init()
[all …]
/dpdk/lib/ring/
H A Drte_ring_peek_elem_pvt.h32 uint32_t num) in __rte_ring_st_get_tail() argument
40 RTE_ASSERT(n >= num); in __rte_ring_st_get_tail()
41 num = (n >= num) ? num : 0; in __rte_ring_st_get_tail()
44 return num; in __rte_ring_st_get_tail()
54 uint32_t num, uint32_t enqueue) in __rte_ring_st_set_head_tail() argument
60 pos = tail + num; in __rte_ring_st_set_head_tail()
76 uint32_t num) in __rte_ring_hts_get_tail() argument
84 RTE_ASSERT(n >= num); in __rte_ring_hts_get_tail()
85 num = (n >= num) ? num : 0; in __rte_ring_hts_get_tail()
88 return num; in __rte_ring_hts_get_tail()
[all …]
/dpdk/lib/eventdev/
H A Drte_event_ring.h95 unsigned int num; in rte_event_ring_enqueue_bulk() local
98 num = rte_ring_enqueue_bulk_elem(&r->r, events, in rte_event_ring_enqueue_bulk()
105 return num; in rte_event_ring_enqueue_bulk()
131 unsigned int num; in rte_event_ring_dequeue_bulk() local
134 num = rte_ring_dequeue_bulk_elem(&r->r, events, in rte_event_ring_dequeue_bulk()
141 return num; in rte_event_ring_dequeue_bulk()
169 unsigned int num; in rte_event_ring_enqueue_burst() local
172 num = rte_ring_enqueue_burst_elem(&r->r, events, in rte_event_ring_enqueue_burst()
179 return num; in rte_event_ring_enqueue_burst()
205 unsigned int num; in rte_event_ring_dequeue_burst() local
[all...]
/dpdk/lib/ipsec/
H A Desp_outb.c338 struct rte_crypto_op *cop[], uint16_t num) in esp_outb_tun_prepare()
343 n = num;
345 if (n != num)
353 struct rte_crypto_op *cop[], uint16_t num, struct rte_ipsec_state *state) in outb_trs_pkt_prepare()
357 return esp_outb_tun_prepare_helper(ss, mb, cop, num, sqn); in outb_trs_pkt_prepare()
461 struct rte_crypto_op *cop[], uint16_t num) in esp_outb_trs_prepare()
471 uint32_t dr[num]; in esp_outb_trs_prepare()
476 n = num; in esp_outb_trs_prepare()
478 if (n != num) in esp_outb_trs_prepare()
617 struct rte_mbuf *mb[], uint16_t num)
293 esp_outb_tun_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],struct rte_crypto_op * cop[],uint16_t num) esp_outb_tun_prepare() argument
443 esp_outb_trs_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],struct rte_crypto_op * cop[],uint16_t num) esp_outb_trs_prepare() argument
534 cpu_outb_pkt_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num,esp_outb_prepare_t prepare,uint32_t cofs_mask) cpu_outb_pkt_prepare() argument
605 cpu_outb_tun_pkt_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) cpu_outb_tun_pkt_prepare() argument
612 cpu_outb_trs_pkt_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) cpu_outb_trs_pkt_prepare() argument
626 esp_outb_sqh_process(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) esp_outb_sqh_process() argument
672 inline_outb_mbuf_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) inline_outb_mbuf_prepare() argument
706 esn_outb_nb_valid_packets(uint16_t num,uint32_t n_sqn,uint16_t nb_segs[]) esn_outb_nb_valid_packets() argument
721 inline_outb_tun_pkt_process(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) inline_outb_tun_pkt_process() argument
789 inline_outb_trs_pkt_process(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) inline_outb_trs_pkt_process() argument
857 inline_proto_outb_pkt_process(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) inline_proto_outb_pkt_process() argument
[all...]
H A Dsa.h154 struct rte_crypto_op *cop[], uint16_t num);
158 struct rte_mbuf *mb[], uint16_t num);
162 struct rte_mbuf *mb[], uint16_t num);
166 struct rte_mbuf *mb[], uint16_t num);
170 struct rte_mbuf *mb[], uint16_t num);
174 struct rte_mbuf *mb[], uint16_t num);
180 struct rte_crypto_op *cop[], uint16_t num);
184 struct rte_crypto_op *cop[], uint16_t num, struct rte_ipsec_state *state);
188 struct rte_crypto_op *cop[], uint16_t num);
192 uint16_t num);
[all...]
H A Drte_ipsec.h49 uint16_t num);
52 uint16_t num);
58 uint16_t num,
62 uint16_t num,
67 uint16_t num);
127 * The address of an array of *num* pointers to *rte_mbuf* structures in rte_ipsec_pkt_cpu_prepare()
130 * The address of an array of *num* pointers to the output *rte_crypto_op*
132 * @param num
139 struct rte_mbuf *mb[], struct rte_crypto_op *cop[], uint16_t num)
141 return ss->pkt_func.prepare.async(ss, mb, cop, num);
119 rte_ipsec_pkt_crypto_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],struct rte_crypto_op * cop[],uint16_t num) rte_ipsec_pkt_crypto_prepare() argument
126 rte_ipsec_pkt_cpu_prepare(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) rte_ipsec_pkt_cpu_prepare() argument
156 rte_ipsec_pkt_process(const struct rte_ipsec_session * ss,struct rte_mbuf * mb[],uint16_t num) rte_ipsec_pkt_process() argument
[all...]
H A Desp_inb.c18 struct rte_mbuf *mb[], uint32_t sqn[], uint32_t dr[], uint16_t num,
365 struct rte_crypto_op *cop[], uint16_t num) in esp_inb_pkt_prepare() argument
373 uint32_t dr[num]; in esp_inb_pkt_prepare()
380 for (i = 0; i != num; i++) { in esp_inb_pkt_prepare()
397 if (k != num && k != 0) in esp_inb_pkt_prepare()
398 move_bad_mbufs(mb, dr, num, num - k); in esp_inb_pkt_prepare()
576 uint32_t sqn[], uint32_t dr[], uint16_t num, uint8_t sqh_len) in tun_process() argument
579 uint32_t hl[num], to[num]; in tun_process()
580 struct rte_esp_tail espt[num]; in tun_process()
581 struct rte_mbuf *ml[num]; in tun_process()
[all …]
/dpdk/drivers/net/bnxt/
H A Dbnxt_rxtx_vec_common.h111 uint32_t ring_mask, ring_size, num; in bnxt_tx_cmp_vec_fast() local
118 num = RTE_MIN(nr_pkts, ring_size - cons); in bnxt_tx_cmp_vec_fast()
121 rte_mempool_put_bulk(pool, (void **)&txr->tx_buf_ring[cons], num); in bnxt_tx_cmp_vec_fast()
122 memset(&txr->tx_buf_ring[cons], 0, num * sizeof(struct rte_mbuf *)); in bnxt_tx_cmp_vec_fast()
123 raw_cons += num; in bnxt_tx_cmp_vec_fast()
124 num = nr_pkts - num; in bnxt_tx_cmp_vec_fast()
125 if (num) { in bnxt_tx_cmp_vec_fast()
128 num); in bnxt_tx_cmp_vec_fast()
130 num * sizeof(struct rte_mbuf *)); in bnxt_tx_cmp_vec_fast()
131 raw_cons += num; in bnxt_tx_cmp_vec_fast()
[all …]
/dpdk/examples/vm_power_manager/guest_cli/
H A Dparse.c24 parse_set(const char *input, uint16_t set[], unsigned int num) in parse_set() argument
31 memset(set, 0, num * sizeof(uint16_t)); in parse_set()
45 min = num; in parse_set()
57 if (errno || end == NULL || idx >= num) in parse_set()
64 if (min == num) in parse_set()
71 if (min == num) in parse_set()
78 min = num; in parse_set()
/dpdk/examples/ipsec-secgw/
H A Dipsec_process.c30 enqueue_cop_bulk(struct cdev_qp *cqp, struct rte_crypto_op *cop[], uint32_t num) in enqueue_cop_bulk() argument
40 if (num >= RTE_DIM(cqp->buf) * 3 / 4 && len == 0) { in enqueue_cop_bulk()
41 n = rte_cryptodev_enqueue_burst(cqp->id, cqp->qp, cop, num); in enqueue_cop_bulk()
43 free_cops(cop + n, num - n); in enqueue_cop_bulk()
51 n = RTE_MIN(num - k, n); in enqueue_cop_bulk()
70 } while (k != num); in enqueue_cop_bulk()
95 struct rte_ipsec_group grp[], uint32_t num) in sa_group() argument
103 for (i = 0, n = 0; i != num; i++) { in sa_group()
128 uint32_t num) in copy_to_trf() argument
153 for (j = 0, s = out->num; in copy_to_trf()
297 cqp_dequeue(struct cdev_qp * cqp,struct rte_crypto_op * cop[],uint32_t num) cqp_dequeue() argument
312 ctx_dequeue(struct ipsec_ctx * ctx,struct rte_crypto_op * cop[],uint32_t num) ctx_dequeue() argument
[all...]
/dpdk/examples/vm_power_manager/
H A Dparse.c24 parse_set(const char *input, uint16_t set[], unsigned int num) in parse_set() argument
31 memset(set, 0, num * sizeof(uint16_t)); in parse_set()
45 min = num; in parse_set()
57 if (errno || end == NULL || idx >= num) in parse_set()
64 if (min == num) in parse_set()
71 if (min == num) in parse_set()
78 min = num; in parse_set()
/dpdk/drivers/bus/dpaa/base/qbman/
H A Dqman_priv.h35 static inline int qman_cgrs_get(struct qman_cgrs *c, int num) in qman_cgrs_get() argument
37 return QM_MCR_QUERYCONGESTION(&c->q, num); in qman_cgrs_get()
40 static inline void qman_cgrs_set(struct qman_cgrs *c, int num) in qman_cgrs_set() argument
42 c->q.state[__CGR_WORD(num)] |= (0x80000000 >> __CGR_SHIFT(num)); in qman_cgrs_set()
45 static inline void qman_cgrs_unset(struct qman_cgrs *c, int num) in qman_cgrs_unset() argument
47 c->q.state[__CGR_WORD(num)] &= ~(0x80000000 >> __CGR_SHIFT(num)); in qman_cgrs_unset()
50 static inline int qman_cgrs_next(struct qman_cgrs *c, int num) in qman_cgrs_next() argument
52 while ((++num < (int)__CGR_NUM) && !qman_cgrs_get(c, num)) in qman_cgrs_next()
54 return num; in qman_cgrs_next()
/dpdk/drivers/net/mvneta/
H A Dmvneta_rxtx.c75 mvneta_buffs_refill(struct mvneta_priv *priv, struct mvneta_rxq *rxq, u16 *num) in mvneta_buffs_refill() argument
80 uint16_t nb_desc = *num; in mvneta_buffs_refill()
89 *num = 0; in mvneta_buffs_refill()
101 *num = 0; in mvneta_buffs_refill()
107 neta_ppio_inq_put_buffs(priv->ppio, rxq->queue_id, entries, num); in mvneta_buffs_refill()
110 for (i = *num; i < nb_desc; i++) in mvneta_buffs_refill()
124 mvneta_buffs_alloc(struct mvneta_priv *priv, struct mvneta_rxq *rxq, int *num) in mvneta_buffs_alloc() argument
129 nb_desc = *num; in mvneta_buffs_alloc()
145 *num = sent; in mvneta_buffs_alloc()
382 uint16_t num, sq_free_size; in mvneta_tx_pkt_burst() local
[all …]
/dpdk/drivers/net/sfc/
H A Dsfc_filter.c36 size_t num = filter->supported_match_num; in sfc_filter_cache_match_supported() local
42 if (num == 0) in sfc_filter_cache_match_supported()
43 num = 16; in sfc_filter_cache_match_supported()
46 if (num != filter->supported_match_num) { in sfc_filter_cache_match_supported()
48 buf = rte_realloc(buf, num * sizeof(*buf), 0); in sfc_filter_cache_match_supported()
53 rc = efx_filter_supported_filters(sa->nic, buf, num, &num); in sfc_filter_cache_match_supported()
55 filter->supported_match_num = num; in sfc_filter_cache_match_supported()
/dpdk/drivers/event/opdl/
H A Dopdl_evdev_init.c21 uint16_t num, in enqueue_check() argument
28 for (i = 0; i < num; i++) { in enqueue_check()
48 p->port_stat[claim_pkts_requested] += num; in enqueue_check()
64 if (num > 0 && in enqueue_check()
71 return num; in enqueue_check()
77 uint16_t num, in update_on_dequeue() argument
82 for (i = 0; i < num; i++) in update_on_dequeue()
88 p->port_stat[claim_pkts_requested] += num; in update_on_dequeue()
97 if (num > 0) in update_on_dequeue()
113 uint16_t num) in opdl_rx_error_enqueue() argument
[all …]
/dpdk/examples/l3fwd/
H A Dl3fwd_common.h64 uint32_t num) in send_packetsx4()
74 if (num >= MAX_TX_BURST && len == 0) { in send_packetsx4()
75 n = rte_eth_tx_burst(port, qconf->tx_queue_id[port], m, num); in send_packetsx4()
76 if (unlikely(n < num)) { in send_packetsx4()
79 } while (++n < num); in send_packetsx4()
88 n = len + num; in send_packetsx4()
89 n = (n > MAX_PKT_BURST) ? MAX_PKT_BURST - len : num; in send_packetsx4()
120 len = num - n; in send_packetsx4()
57 send_packetsx4(struct lcore_conf * qconf,uint16_t port,struct rte_mbuf * m[],uint32_t num) send_packetsx4() argument
/dpdk/lib/bpf/
H A Dbpf_pkt.c161 apply_filter(struct rte_mbuf *mb[], const uint64_t rc[], uint32_t num, in apply_filter() argument
165 struct rte_mbuf *dr[num]; in apply_filter()
167 for (i = 0, j = 0, k = 0; i != num; i++) { in apply_filter()
191 pkt_filter_vm(const struct rte_bpf *bpf, struct rte_mbuf *mb[], uint32_t num, in pkt_filter_vm() argument
195 void *dp[num]; in pkt_filter_vm()
196 uint64_t rc[num]; in pkt_filter_vm()
198 for (i = 0; i != num; i++) in pkt_filter_vm()
201 rte_bpf_exec_burst(bpf, dp, rc, num); in pkt_filter_vm()
202 return apply_filter(mb, rc, num, drop); in pkt_filter_vm()
207 uint32_t num, uint32_t drop) in pkt_filter_jit() argument
[all …]
/dpdk/lib/stack/
H A Drte_stack_lf_generic.h37 unsigned int num) in __rte_stack_lf_push_elems() argument
71 rte_atomic_fetch_add_explicit(&list->len, num, rte_memory_order_seq_cst); in __rte_stack_lf_push_elems()
76 unsigned int num, in __rte_stack_lf_pop_elems() argument
89 if (unlikely(len < num)) in __rte_stack_lf_pop_elems()
93 if (rte_atomic_compare_exchange_strong_explicit(&list->len, &len, len - num, in __rte_stack_lf_pop_elems()
121 for (i = 0; i < num && tmp != NULL; i++) { in __rte_stack_lf_pop_elems()
133 if (i != num) { in __rte_stack_lf_pop_elems()

123456789