/*
* Copyright (c) 2015 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef __included_vnet_l2_input_classify_h__
#define __included_vnet_l2_input_classify_h__
#include <vlib/vlib.h>
#include <vnet/vnet.h>
#include <vnet/ethernet/ethernet.h>
#include <vnet/ethernet/packet.h>
#include <vnet/ip/ip_packet.h>
#include <vnet/ip/ip4_packet.h>
#include <vnet/ip/ip6_packet.h>
#include <vlib/cli.h>
#include <vnet/l2/l2_input.h>
#include <vnet/l2/l2_output.h>
#include <vnet/l2/feat_bitmap.h>
#include <vppinfra/error.h>
#include <vppinfra/hash.h>
#include <vppinfra/cache.h>
#include <vnet/classify/vnet_classify.h>
typedef enum
{
L2_INPUT_CLASSIFY_NEXT_DROP,
L2_INPUT_CLASSIFY_NEXT_ETHERNET_INPUT,
L2_INPUT_CLASSIFY_NEXT_IP4_INPUT,
L2_INPUT_CLASSIFY_NEXT_IP6_INPUT,
L2_INPUT_CLASSIFY_NEXT_LI,
L2_INPUT_CLASSIFY_N_NEXT,
} l2_input_classify_next_t;
typedef enum
{
L2_INPUT_CLASSIFY_TABLE_IP4,
L2_INPUT_CLASSIFY_TABLE_IP6,
L2_INPUT_CLASSIFY_TABLE_OTHER,
L2_INPUT_CLASSIFY_N_TABLES,
} l2_input_classify_table_id_t;
typedef enum
{
L2_OUTPUT_CLASSIFY_NEXT_DROP,
L2_OUTPUT_CLASSIFY_N_NEXT,
} l2_output_classify_next_t;
typedef enum
{
L2_OUTPUT_CLASSIFY_TABLE_IP4,
L2_OUTPUT_CLASSIFY_TABLE_IP6,
L2_OUTPUT_CLASSIFY_TABLE_OTHER,
L2_OUTPUT_CLASSIFY_N_TABLES,
} l2_output_classify_table_id_t;
.highlight .hll { background-color: #ffffcc }
.highlight .c { color: #888888 } /* Comment */
.highlight .err { color: #a61717; background-color: #e3d2d2 } /* Error */
.highlight .k { color: #008800; font-weight: bold } /* Keyword */
.highlight .ch { color: #888888 } /* Comment.Hashbang */
.highlight .cm { color: #888888 } /* Comment.Multiline */
.highlight .cp { color: #cc0000; font-weight: bold } /* Comment.Preproc */
.highlight .cpf { color: #888888 } /* Comment.PreprocFile */
.highlight .c1 { color: #888888 } /* Comment.Single */
.highlight .cs { color: #cc0000; font-weight: bold; background-color: #fff0f0 } /* Comment.Special */
.highlight .gd { color: #000000; background-color: #ffdddd } /* Generic.Deleted */
.highlight .ge { font-style: italic } /* Generic.Emph */
.highlight .gr { color: #aa0000 } /* Generic.Error */
.highlight .gh { color: #333333 } /* Generic.Heading */
.highlight .gi { color: #000000; background-color: #ddffdd } /* Generic.Inserted */
.highlight .go { color: #888888 } /* Generic.Output */
.highlight .gp { color: #555555 } /* Generic.Prompt */
.highlight .gs { font-weight: bold } /* Generic.Strong */
.highlight .gu { color: #666666 } /* Generic.Subheading */
.highlight .gt { color: #aa0000 } /* Generic.Traceback */
.highlight .kc { color: #008800; font-weight: bold } /* Keyword.Constant */
.highlight .kd { color: #008800; font-weight: bold } /* Keyword.Declaration */
.highlight .kn { color: #008800; font-weight: bold } /* Keyword.Namespace */
.highlight .kp { color: #008800 } /* Keyword.Pseudo */
.highlight .kr { color: #008800; font-weight: bold } /* Keyword.Reserved */
.highlight .kt { color: #888888; font-weight: bold } /* Keyword.Type */
.highlight .m { color: #0000DD; font-weight: bold } /* Literal.Number */
.highlight .s { color: #dd2200; background-color: #fff0f0 } /* Literal.String */
.highlight .na { color: #336699 } /* Name.Attribute */
.highlight .nb { color: #003388 } /* Name.Builtin */
.highlight .nc { color: #bb0066; font-weight: bold } /* Name.Class */
.highlight .no { color: #003366; font-weight: bold } /* Name.Constant */
.highlight .nd { color: #555555 } /* Name.Decorator */
.highlight .ne { color: #bb0066; font-weight: bold } /* Name.Exception */
.highlight .nf { color: #0066bb; font-weight: bold } /* Name.Function */
.highlight .nl { color: #336699; font-style: italic } /* Name.Label */
.highlight .nn { color: #bb0066; font-weight: bold } /* Name.Namespace */
.highlight .py { color: #336699; font-weight: bold } /* Name.Property */
.highlight .nt { color: #bb0066; font-weight: bold } /* Name.Tag */
.highlight .nv { color: #336699 } /* Name.Variable */
.highlight .ow { color: #008800 } /* Operator.Word */
.highlight .w { color: #bbbbbb } /* Text.Whitespace */
.highlight .mb { color: #0000DD; font-weight: bold } /* Literal.Number.Bin */
.highlight .mf { color: #0000DD; font-weight: bold } /* Literal.Number.Float */
.highlight .mh { color: #0000DD; font-weight: bold } /* Literal.Number.Hex */
.highlight .mi { color: #0000DD; font-weight: bold } /* Literal.Number.Integer */
.highlight .mo { color: #0000DD; font-weight: bold } /* Literal.Number.Oct */
.highlight .sa { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Affix */
.highlight .sb { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Backtick */
.highlight .sc { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Char */
.highlight .dl { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Delimiter */
.highlight .sd { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Doc */
.highlight .s2 { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Double */
.highlight .se { color: #0044dd; background-color: #fff0f0 } /* Literal.String.Escape */
.highlight .sh { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Heredoc */
.highlight .si { color: #3333bb; background-color: #fff0f0 } /* Literal.String.Interpol */
.highlight .sx { color: #22bb22; background-color: #f0fff0 } /* Literal.String.Other */
.highlight .sr { color: #008800; background-color: #fff0ff } /* Literal.String.Regex */
.highlight .s1 { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Single */
.highlight .ss { color: #aa6600; background-color: #fff0f0 } /* Literal.String.Symbol */
.highlight .bp { color: #003388 } /* Name.Builtin.Pseudo */
.highlight .fm { color: #0066bb; font-weight: bold } /* Name.Function.Magic */
.highlight .vc { color: #336699 } /* Name.Variable.Class */
.highlight .vg { color: #dd7700 } /* Name.Variable.Global */
.highlight .vi { color: #3333bb } /* Name.Variable.Instance */
.highlight .vm { color: #336699 } /* Name.Variable.Magic */
.highlight .il { color: #0000DD; font-weight: bold } /* Literal.Number.Integer.Long *//*
* Copyright (c) 2016 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/**
* @brief
* A Data-Path Object is an object that represents actions that are
* applied to packets are they are switched through VPP's data-path.
*
* The DPO can be considered to be like is a base class that is specialised
* by other objects to provide concreate actions
*
* The VLIB graph nodes are graph of DPO types, the DPO graph is a graph of
* instances.
*/
#ifndef __DPO_H__
#define __DPO_H__
#include <vnet/vnet.h>
/**
* @brief An index for adjacencies.
* Alas 'C' is not typesafe enough to b0rk when a u32 is used instead of
* an index_t. However, for us humans, we can glean much more intent
* from the declaration
* foo barindex_t t);
* than we can from
* foo bar(u32 t);
*/
typedef u32 index_t;
/**
* @brief Invalid index - used when no index is known
* blazoned capitals INVALID speak volumes where ~0 does not.
*/
#define INDEX_INVALID ((index_t)(~0))
/**
* @brief Data path protocol.
* Actions performed on packets in the data-plane can be described and represented
* by protocol independent objects, i.e. ADJACENCY, but the spceifics actions
* required during ADJACENCY processing can be protocol dependent. For example,
* the adjacency rewrite node performs a ip4 checksum calculation, ip6 and MPLS
* do not, all 3 perform a TTL decrement. The VLIB graph nodes are thus protocol
* dependent, and thus each graph edge/arc is too.
* When programming a DPO's next node arc from child to parent it is thus required
* to know the parent's data-path protocol so the correct arc index can be used.
*/
typedef enum dpo_proto_t_
{
#if CLIB_DEBUG > 0
DPO_PROTO_IP4 = 1,
#else
DPO_PROTO_IP4 = 0,
#endif
DPO_PROTO_IP6,
DPO_PROTO_ETHERNET,
DPO_PROTO_MPLS,
DPO_PROTO_NSH,
} __attribute__((packed)) dpo_proto_t;
#define DPO_PROTO_NUM ((dpo_proto_t)(DPO_PROTO_NSH+1))
#define DPO_PROTO_NONE ((dpo_proto_t)(DPO_PROTO_NUM+1))
#define DPO_PROTOS { \
[DPO_PROTO_IP4] = "ip4", \
[DPO_PROTO_IP6] = "ip6", \
[DPO_PROTO_ETHERNET] = "ethernet", \
[DPO_PROTO_MPLS] = "mpls", \
[DPO_PROTO_NSH] = "nsh", \
}
#define FOR_EACH_DPO_PROTO(_proto) \
for (_proto = DPO_PROTO_IP4; \
_proto <= DPO_PROTO_NSH; \
_proto++)
/**
* @brief Common types of data-path objects
* New types can be dynamically added using dpo_register_new_type()
*/
typedef enum dpo_type_t_ {
/**
* A non-zero value first so we can spot unitialisation errors
*/
DPO_FIRST,
DPO_DROP,
DPO_IP_NULL,
DPO_PUNT,
/**
* @brief load-balancing over a choice of [un]equal cost paths
*/
DPO_LOAD_BALANCE,
DPO_REPLICATE,
DPO_ADJACENCY,
DPO_ADJACENCY_INCOMPLETE,
DPO_ADJACENCY_MIDCHAIN,
DPO_ADJACENCY_GLEAN,
DPO_ADJACENCY_MCAST,
DPO_ADJACENCY_MCAST_MIDCHAIN,
DPO_RECEIVE,
DPO_LOOKUP,
DPO_LISP_CP,
DPO_CLASSIFY,
DPO_MPLS_LABEL,
DPO_MPLS_DISPOSITION,
DPO_MFIB_ENTRY,
DPO_INTERFACE,
DPO_LAST,
} __attribute__((packed)) dpo_type_t;
#define DPO_TYPE_NUM DPO_LAST
#define DPO_TYPES { \
[DPO_FIRST] = "dpo-invalid", \
[DPO_DROP] = "dpo-drop", \
[DPO_IP_NULL] = "dpo-ip-null", \
[DPO_PUNT] = "dpo-punt", \
[DPO_ADJACENCY] = "dpo-adjacency", \
[DPO_ADJACENCY_INCOMPLETE] = "dpo-adjacency-incomplete", \
[DPO_ADJACENCY_MIDCHAIN] = "dpo-adjacency-midcahin", \
[DPO_ADJACENCY_GLEAN] = "dpo-glean", \
[DPO_ADJACENCY_MCAST] = "dpo-adj-mcast", \
[DPO_ADJACENCY_MCAST_MIDCHAIN] = "dpo-adj-mcast-midchain", \
[DPO_RECEIVE] = "dpo-receive", \
[DPO_LOOKUP] = "dpo-lookup", \
[DPO_LOAD_BALANCE] = "dpo-load-balance", \
[DPO_REPLICATE] = "dpo-replicate", \
[DPO_LISP_CP] = "dpo-lisp-cp", \
[DPO_CLASSIFY] = "dpo-classify", \
[DPO_MPLS_LABEL] = "dpo-mpls-label", \
[DPO_MPLS_DISPOSITION] = "dpo-mpls-diposition", \
[DPO_MFIB_ENTRY] = "dpo-mfib_entry", \
[DPO_INTERFACE] = "dpo-interface" \
}
/**
* @brief The identity of a DPO is a combination of its type and its
* instance number/index of objects of that type
*/
typedef struct dpo_id_t_ {
/**
* the type
*/
dpo_type_t dpoi_type;
/**
* the data-path protocol of the type.
*/
dpo_proto_t dpoi_proto;
/**
* The next VLIB node to follow.
*/
u16 dpoi_next_node;
/**
* the index of objects of that type
*/
index_t dpoi_index;
} __attribute__ ((aligned(sizeof(u64)))) dpo_id_t;
STATIC_ASSERT(sizeof(dpo_id_t) <= sizeof(u64),
"DPO ID is greater than sizeof u64 "
"atomic updates need to be revisited");
/**
* @brief An initialiser for DPOs declared on the stack.
* Thenext node is set to 0 since VLIB graph nodes should set 0 index to drop.
*/
#define DPO_INVALID \
{ \
.dpoi_type = DPO_FIRST, \
.dpoi_proto = DPO_PROTO_NONE, \
.dpoi_index = INDEX_INVALID, \
.dpoi_next_node = 0, \
}
/**
* @brief Return true if the DPO object is valid, i.e. has been initialised.
*/
static inline int
dpo_id_is_valid (const dpo_id_t *dpoi)
{
return (dpoi->dpoi_type != DPO_FIRST &&
dpoi->dpoi_index != INDEX_INVALID);
}
extern dpo_proto_t vnet_link_to_dpo_proto(vnet_link_t linkt);
/**
* @brief
* Take a reference counting lock on the DPO
*/
extern void dpo_lock(dpo_id_t *dpo);
/**
* @brief
* Release a reference counting lock on the DPO
*/
extern void dpo_unlock(dpo_id_t *dpo);
/**
* @brief Set/create a DPO ID
* The DPO will be locked.
*
* @param dpo
* The DPO object to configure
*
* @param type
* The dpo_type_t of the DPO
*
* @param proto
* The dpo_proto_t of the DPO
*
* @param index
* The type specific index of the DPO
*/
extern void dpo_set(dpo_id_t *dpo,
dpo_type_t type,
dpo_proto_t proto,
index_t index);
/**
* @brief reset a DPO ID
* The DPO will be unlocked.
*
* @param dpo
* The DPO object to reset
*/
extern void dpo_reset(dpo_id_t *dpo);
/**
* @brief compare two DPOs for equality
*/
extern int dpo_cmp(const dpo_id_t *dpo1,
const dpo_id_t *dpo2);
/**
* @brief
* atomic copy a data-plane object.
* This is safe to use when the dst DPO is currently switching packets
*/
extern void dpo_copy(dpo_id_t *dst,
const dpo_id_t *src);
/**
* @brief Return TRUE is the DPO is any type of adjacency
*/
extern int dpo_is_adj(const dpo_id_t *dpo);
/**
* @biref Format a DPO_id_t oject
*/
extern u8 *format_dpo_id(u8 * s, va_list * args);
/**
* @biref format a DPO type
*/
extern u8 *format_dpo_type(u8 * s, va_list * args);
/**
* @brief format a DPO protocol
*/
extern u8 *format_dpo_proto(u8 * s, va_list * args);
/**
* @brief
* Set and stack a DPO.
* The DPO passed is set to the parent DPO and the necessary
* VLIB graph arcs are created. The child_type and child_proto
* are used to get the VLID nodes from which the arcs are added.
*
* @param child_type
* Child DPO type.
*
* @param child_proto
* Child DPO proto
*
* @parem dpo
* This is the DPO to stack and set.
*
* @paren parent_dpo
* The parent DPO to stack onto.
*/
extern void dpo_stack(dpo_type_t child_type,
dpo_proto_t child_proto,
dpo_id_t *dpo,
const dpo_id_t *parent_dpo);
/**
* @brief
* Set and stack a DPO.
* The DPO passed is set to the parent DPO and the necessary
* VLIB graph arcs are created, from the child_node passed.
*
* @param child_node
* The VLIB grpah node index to create an arc from to the parent
*
* @parem dpo
* This is the DPO to stack and set.
*
* @paren parent_dpo
* The parent DPO to stack onto.
*/
extern void dpo_stack_from_node(u32 child_node,
dpo_id_t *dpo,
const dpo_id_t *parent);
/**
* @brief A lock function registered for a DPO type
*/
typedef void (*dpo_lock_fn_t)(dpo_id_t *dpo);
/**
* @brief An unlock function registered for a DPO type
*/
typedef void (*dpo_unlock_fn_t)(dpo_id_t *dpo);
/**
* @brief An memory usage show command
*/
typedef void (*dpo_mem_show_t)(void);
/**
* @brief A virtual function table regisitered for a DPO type
*/
typedef struct dpo_vft_t_
{
/**
* A reference counting lock function
*/
dpo_lock_fn_t dv_lock;
/**
* A reference counting unlock function
*/
dpo_lock_fn_t dv_unlock;
/**
* A format function
*/
format_function_t *dv_format;
/**
* A show memory usage function
*/
dpo_mem_show_t dv_mem_show;
} dpo_vft_t;
/**
* @brief For a given DPO type Register:
* - a virtual function table
* - a NULL terminated array of graph nodes from which that object type
* will originate packets, i.e. the nodes in which the object type will be
* the parent DPO in the DP graph. The ndoes are per-data-path protocol
* (see above).
*
* @param type
* The type being registered.
*
* @param vft
* The virtual function table to register for the type.
*
* @param nodes
* The string description of the per-protocol VLIB graph nodes.
*/
extern void dpo_register(dpo_type_t type,
const dpo_vft_t *vft,
const char * const * const * nodes);
/**
* @brief Create and register a new DPO type.
*
* This can be used by plugins to create new DPO types that are not listed
* in dpo_type_t enum
*
* @param vft
* The virtual function table to register for the type.
*
* @param nodes
* The string description of the per-protocol VLIB graph nodes.
*
* @return The new dpo_type_t
*/
extern dpo_type_t dpo_register_new_type(const dpo_vft_t *vft,
const char * const * const * nodes);
#endif