Home
last modified time | relevance | path

Searched refs:next0 (Results 1 – 3 of 3) sorted by relevance

/dpdk/lib/node/
H A Dip4_lookup_sse.h16 rte_edge_t next0, next1, next2, next3, next_index; in ip4_lookup_node_process_vec() local
120 next0 = (dst.u32[0] >> 16); in ip4_lookup_node_process_vec()
133 (next_index ^ next0) | (next_index ^ next1) | in ip4_lookup_node_process_vec()
145 if (next_index == next0) { in ip4_lookup_node_process_vec()
150 rte_node_enqueue_x1(graph, node, next0, in ip4_lookup_node_process_vec()
211 next0 = (next_hop >> 16); in ip4_lookup_node_process_vec()
213 if (unlikely(next_index ^ next0)) { in ip4_lookup_node_process_vec()
221 rte_node_enqueue_x1(graph, node, next0, from[0]); in ip4_lookup_node_process_vec()
H A Dip4_rewrite.c40 uint16_t next0, next1, next2, next3, next_index; in ip4_rewrite_node_process() local
97 next0 = nh[priv01.u16[0]].tx_node; in ip4_rewrite_node_process()
137 ((next_index == next0) && (next0 == next1) && in ip4_rewrite_node_process()
149 if (next_index == next0) { in ip4_rewrite_node_process()
154 rte_node_enqueue_x1(graph, node, next0, in ip4_rewrite_node_process()
219 next0 = nh[node_mbuf_priv1(mbuf0, dyn)->nh].tx_node; in ip4_rewrite_node_process()
228 if (unlikely(next_index ^ next0)) { in ip4_rewrite_node_process()
236 rte_node_enqueue_x1(graph, node, next0, from[0]); in ip4_rewrite_node_process()
H A Dip4_lookup_neon.h187 uint16_t next0; in ip4_lookup_node_process_vec() local
207 next0 = (uint16_t)next_hop; in ip4_lookup_node_process_vec()
209 if (unlikely(next_index ^ next0)) { in ip4_lookup_node_process_vec()
217 rte_node_enqueue_x1(graph, node, next0, from[0]); in ip4_lookup_node_process_vec()