9ef2593651
Flow actions pipeline is an extension of flow-classification pipeline. Some of the operations of flow classification pipeline such as traffic metering/marking(for e.g. Single Rate Three Color Marker (srTCM), Two Rate Three Color Marker trTCM)), policer can be performed separately in flow action pipeline to avoid excessive computational burden on the CPU core running the flow-classification pipeline. The Flow action pipeline implements various function such as traffic metering, policer, stats. Traffic mettering can configured as per the required context, for examples- per user, per traffic class or both. These contexts can be applied by specifying parameters in configuration file as shown below; [PIPELINE1] type = FLOW_ACTIONS core = 1 pktq_in = RXQ0.0 RXQ1.0 RXQ2.0 RXQ3.0 pktq_out = TXQ0.0 TXQ1.0 TXQ2.0 TXQ3.0 n_flows = 65536 n_meters_per_flow = 1 flow_id_offset = 158 ip_hdr_offset = 142 color_offset = 64 The entries of flow and dscp tables of flow actions pipeline can be modified through command-line interface. The commands to add or delete entries to the flow table, DSCP(differentiated services code point) table and for statistics collection, etc have been included. The key functions such as Traffic Metering/marking and policer functions have been implemented as flow-table action handler. Signed-off-by: Jasvinder Singh <jasvinder.singh@intel.com> Signed-off-by: Fan Zhang <roy.fan.zhang@intel.com> Acked-by: Cristian Dumitrescu <cristian.dumitrescu@intel.com>
203 lines
6.4 KiB
C
203 lines
6.4 KiB
C
/*-
|
|
* BSD LICENSE
|
|
*
|
|
* Copyright(c) 2010-2015 Intel Corporation. All rights reserved.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in
|
|
* the documentation and/or other materials provided with the
|
|
* distribution.
|
|
* * Neither the name of Intel Corporation nor the names of its
|
|
* contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
#ifndef __INCLUDE_PIPELINE_ACTIONS_COMMON_H__
|
|
#define __INCLUDE_PIPELINE_ACTIONS_COMMON_H__
|
|
|
|
#define PIPELINE_PORT_IN_AH(f_ah, f_pkt_work, f_pkt4_work) \
|
|
static int \
|
|
f_ah( \
|
|
struct rte_mbuf **pkts, \
|
|
uint32_t n_pkts, \
|
|
uint64_t *pkts_mask, \
|
|
void *arg) \
|
|
{ \
|
|
uint32_t i; \
|
|
\
|
|
for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) \
|
|
f_pkt4_work(&pkts[i], arg); \
|
|
\
|
|
for ( ; i < n_pkts; i++) \
|
|
f_pkt_work(pkts[i], arg); \
|
|
\
|
|
*pkts_mask = (~0LLU) >> (64 - n_pkts); \
|
|
\
|
|
return 0; \
|
|
}
|
|
|
|
#define PIPELINE_TABLE_AH_HIT(f_ah, f_pkt_work, f_pkt4_work) \
|
|
static int \
|
|
f_ah( \
|
|
struct rte_mbuf **pkts, \
|
|
uint64_t *pkts_mask, \
|
|
struct rte_pipeline_table_entry **entries, \
|
|
void *arg) \
|
|
{ \
|
|
uint64_t pkts_in_mask = *pkts_mask; \
|
|
\
|
|
if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) { \
|
|
uint64_t n_pkts = __builtin_popcountll(pkts_in_mask); \
|
|
uint32_t i; \
|
|
\
|
|
for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) \
|
|
f_pkt4_work(&pkts[i], &entries[i], arg); \
|
|
\
|
|
for ( ; i < n_pkts; i++) \
|
|
f_pkt_work(pkts[i], entries[i], arg); \
|
|
} else \
|
|
for ( ; pkts_in_mask; ) { \
|
|
uint32_t pos = __builtin_ctzll(pkts_in_mask); \
|
|
uint64_t pkt_mask = 1LLU << pos; \
|
|
\
|
|
pkts_in_mask &= ~pkt_mask; \
|
|
f_pkt_work(pkts[pos], entries[pos], arg); \
|
|
} \
|
|
\
|
|
return 0; \
|
|
}
|
|
|
|
#define PIPELINE_TABLE_AH_MISS(f_ah, f_pkt_work, f_pkt4_work) \
|
|
static int \
|
|
f_ah( \
|
|
struct rte_mbuf **pkts, \
|
|
uint64_t *pkts_mask, \
|
|
struct rte_pipeline_table_entry *entry, \
|
|
void *arg) \
|
|
{ \
|
|
uint64_t pkts_in_mask = *pkts_mask; \
|
|
\
|
|
if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) { \
|
|
uint64_t n_pkts = __builtin_popcountll(pkts_in_mask); \
|
|
uint32_t i; \
|
|
\
|
|
for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) \
|
|
f_pkt4_work(&pkts[i], entry, arg); \
|
|
\
|
|
for ( ; i < n_pkts; i++) \
|
|
f_pkt_work(pkts[i], entry, arg); \
|
|
} else \
|
|
for ( ; pkts_in_mask; ) { \
|
|
uint32_t pos = __builtin_ctzll(pkts_in_mask); \
|
|
uint64_t pkt_mask = 1LLU << pos; \
|
|
\
|
|
pkts_in_mask &= ~pkt_mask; \
|
|
f_pkt_work(pkts[pos], entry, arg); \
|
|
} \
|
|
\
|
|
return 0; \
|
|
}
|
|
|
|
#define PIPELINE_TABLE_AH_HIT_DROP_TIME(f_ah, f_pkt_work, f_pkt4_work) \
|
|
static int \
|
|
f_ah( \
|
|
struct rte_mbuf **pkts, \
|
|
uint64_t *pkts_mask, \
|
|
struct rte_pipeline_table_entry **entries, \
|
|
void *arg) \
|
|
{ \
|
|
uint64_t pkts_in_mask = *pkts_mask; \
|
|
uint64_t pkts_out_mask = *pkts_mask; \
|
|
uint64_t time = rte_rdtsc(); \
|
|
\
|
|
if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) { \
|
|
uint64_t n_pkts = __builtin_popcountll(pkts_in_mask); \
|
|
uint32_t i; \
|
|
\
|
|
for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) { \
|
|
uint64_t mask = f_pkt4_work(&pkts[i], \
|
|
&entries[i], arg, time); \
|
|
pkts_out_mask ^= mask << i; \
|
|
} \
|
|
\
|
|
for ( ; i < n_pkts; i++) { \
|
|
uint64_t mask = f_pkt_work(pkts[i], \
|
|
entries[i], arg, time); \
|
|
pkts_out_mask ^= mask << i; \
|
|
} \
|
|
} else \
|
|
for ( ; pkts_in_mask; ) { \
|
|
uint32_t pos = __builtin_ctzll(pkts_in_mask); \
|
|
uint64_t pkt_mask = 1LLU << pos; \
|
|
uint64_t mask = f_pkt_work(pkts[pos], \
|
|
entries[pos], arg, time); \
|
|
\
|
|
pkts_in_mask &= ~pkt_mask; \
|
|
pkts_out_mask ^= mask << pos; \
|
|
} \
|
|
\
|
|
*pkts_mask = pkts_out_mask; \
|
|
return 0; \
|
|
}
|
|
|
|
#define PIPELINE_TABLE_AH_MISS_DROP_TIME(f_ah, f_pkt_work, f_pkt4_work) \
|
|
static int \
|
|
f_ah( \
|
|
struct rte_mbuf **pkts, \
|
|
uint64_t *pkts_mask, \
|
|
struct rte_pipeline_table_entry *entry, \
|
|
void *arg) \
|
|
{ \
|
|
uint64_t pkts_in_mask = *pkts_mask; \
|
|
uint64_t pkts_out_mask = *pkts_mask; \
|
|
uint64_t time = rte_rdtsc(); \
|
|
\
|
|
if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) { \
|
|
uint64_t n_pkts = __builtin_popcountll(pkts_in_mask); \
|
|
uint32_t i; \
|
|
\
|
|
for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4) { \
|
|
uint64_t mask = f_pkt4_work(&pkts[i], \
|
|
entry, arg, time); \
|
|
pkts_out_mask ^= mask << i; \
|
|
} \
|
|
\
|
|
for ( ; i < n_pkts; i++) { \
|
|
uint64_t mask = f_pkt_work(pkts[i], entry, arg, time);\
|
|
pkts_out_mask ^= mask << i; \
|
|
} \
|
|
} else \
|
|
for ( ; pkts_in_mask; ) { \
|
|
uint32_t pos = __builtin_ctzll(pkts_in_mask); \
|
|
uint64_t pkt_mask = 1LLU << pos; \
|
|
uint64_t mask = f_pkt_work(pkts[pos], \
|
|
entry, arg, time); \
|
|
\
|
|
pkts_in_mask &= ~pkt_mask; \
|
|
pkts_out_mask ^= mask << pos; \
|
|
} \
|
|
\
|
|
*pkts_mask = pkts_out_mask; \
|
|
return 0; \
|
|
}
|
|
|
|
#endif
|