Home
last modified time | relevance | path

Searched refs:l2fwd_simple_forward (Results 1 – 8 of 8) sorted by relevance

/f-stack/dpdk/examples/l2fwd-jobstats/
H A Dmain.c339 l2fwd_simple_forward(struct rte_mbuf *m, unsigned portid) in l2fwd_simple_forward() function
404 l2fwd_simple_forward(m, portid); in l2fwd_fwd_job()
415 l2fwd_simple_forward(m, portid); in l2fwd_fwd_job()
/f-stack/dpdk/examples/l2fwd-keepalive/
H A Dmain.c168 l2fwd_simple_forward(struct rte_mbuf *m, unsigned portid) in l2fwd_simple_forward() function
276 l2fwd_simple_forward(m, portid); in l2fwd_main_loop()
/f-stack/dpdk/examples/l2fwd/
H A Dmain.c180 l2fwd_simple_forward(struct rte_mbuf *m, unsigned portid) in l2fwd_simple_forward() function
289 l2fwd_simple_forward(m, portid); in l2fwd_main_loop()
/f-stack/dpdk/doc/guides/sample_app_ug/
H A Dl2_forward_job_stats.rst403 l2fwd_simple_forward(m, portid);
407 Then, each mbuf in the table is processed by the l2fwd_simple_forward() function.
424 l2fwd_simple_forward(m, portid);
452 l2fwd_simple_forward(struct rte_mbuf *m, unsigned portid)
H A Dl2_forward_real_virtual.rst338 rte_prefetch0[rte_pktmbuf_mtod(m, void *)); l2fwd_simple_forward(m, portid);
345 Then, each mbuf in the table is processed by the l2fwd_simple_forward() function.
360 l2fwd_simple_forward(struct rte_mbuf *m, unsigned portid)
H A Dl2_forward_event.rst549 l2fwd_simple_forward(m, portid);
557 Then, each mbuf in the table is processed by the l2fwd_simple_forward()
569 Also to optimize enqueue operation, l2fwd_simple_forward() stores incoming mbufs
576 l2fwd_simple_forward(struct rte_mbuf *m, uint32_t portid)
H A Dl2_forward_crypto.rst482 l2fwd_simple_forward(m, portid);
/f-stack/dpdk/examples/l2fwd-crypto/
H A Dmain.c615 l2fwd_simple_forward(struct rte_mbuf *m, uint16_t portid, in l2fwd_simple_forward() function
942 l2fwd_simple_forward(m, portid, in l2fwd_main_loop()