4 * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of Intel Corporation nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
42 #include <sys/queue.h>
45 #include <rte_common.h>
46 #include <rte_byteorder.h>
48 #include <rte_debug.h>
49 #include <rte_cycles.h>
50 #include <rte_memory.h>
51 #include <rte_memzone.h>
52 #include <rte_launch.h>
54 #include <rte_per_lcore.h>
55 #include <rte_lcore.h>
56 #include <rte_atomic.h>
57 #include <rte_branch_prediction.h>
58 #include <rte_memcpy.h>
59 #include <rte_mempool.h>
61 #include <rte_interrupts.h>
63 #include <rte_ether.h>
64 #include <rte_ethdev.h>
65 #include <rte_string_fns.h>
71 * Forwarding of packets in I/O mode.
72 * Forward packets "as-is".
73 * This is the fastest possible forwarding operation, as it does not access
77 pkt_burst_io_forward(struct fwd_stream *fs)
79 struct rte_mbuf *pkts_burst[MAX_PKT_BURST];
84 #ifdef RTE_TEST_PMD_RECORD_CORE_CYCLES
90 #ifdef RTE_TEST_PMD_RECORD_CORE_CYCLES
91 start_tsc = rte_rdtsc();
95 * Receive a burst of packets and forward them.
97 nb_rx = rte_eth_rx_burst(fs->rx_port, fs->rx_queue,
98 pkts_burst, nb_pkt_per_burst);
99 if (unlikely(nb_rx == 0))
101 fs->rx_packets += nb_rx;
103 #ifdef RTE_TEST_PMD_RECORD_BURST_STATS
104 fs->rx_burst_stats.pkt_burst_spread[nb_rx]++;
106 nb_tx = rte_eth_tx_burst(fs->tx_port, fs->tx_queue,
111 if (unlikely(nb_tx < nb_rx) && fs->retry_enabled) {
113 while (nb_tx < nb_rx && retry++ < burst_tx_retry_num) {
114 rte_delay_us(burst_tx_delay_time);
115 nb_tx += rte_eth_tx_burst(fs->tx_port, fs->tx_queue,
116 &pkts_burst[nb_tx], nb_rx - nb_tx);
119 fs->tx_packets += nb_tx;
120 #ifdef RTE_TEST_PMD_RECORD_BURST_STATS
121 fs->tx_burst_stats.pkt_burst_spread[nb_tx]++;
123 if (unlikely(nb_tx < nb_rx)) {
124 fs->fwd_dropped += (nb_rx - nb_tx);
126 rte_pktmbuf_free(pkts_burst[nb_tx]);
127 } while (++nb_tx < nb_rx);
129 #ifdef RTE_TEST_PMD_RECORD_CORE_CYCLES
130 end_tsc = rte_rdtsc();
131 core_cycles = (end_tsc - start_tsc);
132 fs->core_cycles = (uint64_t) (fs->core_cycles + core_cycles);
136 struct fwd_engine io_fwd_engine = {
137 .fwd_mode_name = "io",
138 .port_fwd_begin = NULL,
139 .port_fwd_end = NULL,
140 .packet_fwd = pkt_burst_io_forward,