4 * Copyright(c) 2010-2015 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.
33 #ifndef __INCLUDE_PIPELINE_ACTIONS_COMMON_H__
34 #define __INCLUDE_PIPELINE_ACTIONS_COMMON_H__
36 #define PIPELINE_PORT_IN_AH(f_ah, f_pkt_work, f_pkt4_work) \
39 struct rte_mbuf **pkts, \
41 uint64_t *pkts_mask, \
46 for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) \
47 f_pkt4_work(&pkts[i], arg); \
49 for ( ; i < n_pkts; i++) \
50 f_pkt_work(pkts[i], arg); \
52 *pkts_mask = (~0LLU) >> (64 - n_pkts); \
57 #define PIPELINE_TABLE_AH_HIT(f_ah, f_pkt_work, f_pkt4_work) \
60 struct rte_mbuf **pkts, \
61 uint64_t *pkts_mask, \
62 struct rte_pipeline_table_entry **entries, \
65 uint64_t pkts_in_mask = *pkts_mask; \
67 if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) { \
68 uint64_t n_pkts = __builtin_popcountll(pkts_in_mask); \
71 for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) \
72 f_pkt4_work(&pkts[i], &entries[i], arg); \
74 for ( ; i < n_pkts; i++) \
75 f_pkt_work(pkts[i], entries[i], arg); \
77 for ( ; pkts_in_mask; ) { \
78 uint32_t pos = __builtin_ctzll(pkts_in_mask); \
79 uint64_t pkt_mask = 1LLU << pos; \
81 pkts_in_mask &= ~pkt_mask; \
82 f_pkt_work(pkts[pos], entries[pos], arg); \
88 #define PIPELINE_TABLE_AH_MISS(f_ah, f_pkt_work, f_pkt4_work) \
91 struct rte_mbuf **pkts, \
92 uint64_t *pkts_mask, \
93 struct rte_pipeline_table_entry *entry, \
96 uint64_t pkts_in_mask = *pkts_mask; \
98 if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) { \
99 uint64_t n_pkts = __builtin_popcountll(pkts_in_mask); \
102 for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) \
103 f_pkt4_work(&pkts[i], entry, arg); \
105 for ( ; i < n_pkts; i++) \
106 f_pkt_work(pkts[i], entry, arg); \
108 for ( ; pkts_in_mask; ) { \
109 uint32_t pos = __builtin_ctzll(pkts_in_mask); \
110 uint64_t pkt_mask = 1LLU << pos; \
112 pkts_in_mask &= ~pkt_mask; \
113 f_pkt_work(pkts[pos], entry, arg); \