2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
17 * A Data-Path Object is an object that represents actions that are
18 * applied to packets are they are switched through VPP's data-path.
20 * The DPO can be considered to be like is a base class that is specialised
21 * by other objects to provide concreate actions
23 * The VLIB graph nodes are graph of DPO types, the DPO graph is a graph of
30 #include <vnet/vnet.h>
33 * @brief An index for adjacencies.
34 * Alas 'C' is not typesafe enough to b0rk when a u32 is used instead of
35 * an index_t. However, for us humans, we can glean much more intent
36 * from the declaration
44 * @brief Invalid index - used when no index is known
45 * blazoned capitals INVALID speak volumes where ~0 does not.
47 #define INDEX_INVALID ((index_t)(~0))
50 * @brief Data path protocol.
51 * Actions performed on packets in the data-plane can be described and represented
52 * by protocol independent objects, i.e. ADJACENCY, but the spceifics actions
53 * required during ADJACENCY processing can be protocol dependent. For example,
54 * the adjacency rewrite node performs a ip4 checksum calculation, ip6 and MPLS
55 * do not, all 3 perform a TTL decrement. The VLIB graph nodes are thus protocol
56 * dependent, and thus each graph edge/arc is too.
57 * When programming a DPO's next node arc from child to parent it is thus required
58 * to know the parent's data-path protocol so the correct arc index can be used.
60 typedef enum dpo_proto_t_
71 } __attribute__((packed)) dpo_proto_t;
73 #define DPO_PROTO_NUM ((dpo_proto_t)(DPO_PROTO_NSH+1))
74 #define DPO_PROTO_NONE ((dpo_proto_t)(DPO_PROTO_NUM+1))
76 #define DPO_PROTOS { \
77 [DPO_PROTO_IP4] = "ip4", \
78 [DPO_PROTO_IP6] = "ip6", \
79 [DPO_PROTO_ETHERNET] = "ethernet", \
80 [DPO_PROTO_MPLS] = "mpls", \
81 [DPO_PROTO_NSH] = "nsh", \
84 #define FOR_EACH_DPO_PROTO(_proto) \
85 for (_proto = DPO_PROTO_IP4; \
86 _proto <= DPO_PROTO_NSH; \
90 * @brief Common types of data-path objects
91 * New types can be dynamically added using dpo_register_new_type()
93 typedef enum dpo_type_t_ {
95 * A non-zero value first so we can spot unitialisation errors
102 * @brief load-balancing over a choice of [un]equal cost paths
107 DPO_ADJACENCY_INCOMPLETE,
108 DPO_ADJACENCY_MIDCHAIN,
118 } __attribute__((packed)) dpo_type_t;
120 #define DPO_TYPE_NUM DPO_LAST
122 #define DPO_TYPES { \
123 [DPO_FIRST] = "dpo-invalid", \
124 [DPO_DROP] = "dpo-drop", \
125 [DPO_IP_NULL] = "dpo-ip-null", \
126 [DPO_PUNT] = "dpo-punt", \
127 [DPO_ADJACENCY] = "dpo-adjacency", \
128 [DPO_ADJACENCY_INCOMPLETE] = "dpo-adjacency-incomplete", \
129 [DPO_ADJACENCY_MIDCHAIN] = "dpo-adjacency-midcahin", \
130 [DPO_ADJACENCY_GLEAN] = "dpo-glean", \
131 [DPO_ADJACENCY_MCAST] = "dpo-adj-mcast", \
132 [DPO_RECEIVE] = "dpo-receive", \
133 [DPO_LOOKUP] = "dpo-lookup", \
134 [DPO_LOAD_BALANCE] = "dpo-load-balance", \
135 [DPO_REPLICATE] = "dpo-replicate", \
136 [DPO_LISP_CP] = "dpo-lisp-cp", \
137 [DPO_CLASSIFY] = "dpo-classify", \
138 [DPO_MPLS_LABEL] = "dpo-mpls-label", \
139 [DPO_MFIB_ENTRY] = "dpo-mfib_entry" \
143 * @brief The identity of a DPO is a combination of its type and its
144 * instance number/index of objects of that type
146 typedef struct dpo_id_t_ {
150 dpo_type_t dpoi_type;
152 * the data-path protocol of the type.
154 dpo_proto_t dpoi_proto;
156 * The next VLIB node to follow.
160 * the index of objects of that type
163 } __attribute__ ((aligned(sizeof(u64)))) dpo_id_t;
165 STATIC_ASSERT(sizeof(dpo_id_t) <= sizeof(u64),
166 "DPO ID is greater than sizeof u64 "
167 "atomic updates need to be revisited");
170 * @brief An initialiser for DPOs declared on the stack.
171 * Thenext node is set to 0 since VLIB graph nodes should set 0 index to drop.
173 #define DPO_INVALID \
175 .dpoi_type = DPO_FIRST, \
176 .dpoi_proto = DPO_PROTO_NONE, \
177 .dpoi_index = INDEX_INVALID, \
178 .dpoi_next_node = 0, \
182 * @brief Return true if the DPO object is valid, i.e. has been initialised.
185 dpo_id_is_valid (const dpo_id_t *dpoi)
187 return (dpoi->dpoi_type != DPO_FIRST &&
188 dpoi->dpoi_index != INDEX_INVALID);
191 extern dpo_proto_t vnet_link_to_dpo_proto(vnet_link_t linkt);
195 * Take a reference counting lock on the DPO
197 extern void dpo_lock(dpo_id_t *dpo);
201 * Release a reference counting lock on the DPO
203 extern void dpo_unlock(dpo_id_t *dpo);
206 * @brief Set/create a DPO ID
207 * The DPO will be locked.
210 * The DPO object to configure
213 * The dpo_type_t of the DPO
216 * The dpo_proto_t of the DPO
219 * The type specific index of the DPO
221 extern void dpo_set(dpo_id_t *dpo,
227 * @brief reset a DPO ID
228 * The DPO will be unlocked.
231 * The DPO object to reset
233 extern void dpo_reset(dpo_id_t *dpo);
236 * @brief compare two DPOs for equality
238 extern int dpo_cmp(const dpo_id_t *dpo1,
239 const dpo_id_t *dpo2);
243 * atomic copy a data-plane object.
244 * This is safe to use when the dst DPO is currently switching packets
246 extern void dpo_copy(dpo_id_t *dst,
247 const dpo_id_t *src);
250 * @brief Return TRUE is the DPO is any type of adjacency
252 extern int dpo_is_adj(const dpo_id_t *dpo);
255 * @biref Format a DPO_id_t oject
257 extern u8 *format_dpo_id(u8 * s, va_list * args);
260 * @biref format a DPO type
262 extern u8 *format_dpo_type(u8 * s, va_list * args);
265 * @brief format a DPO protocol
267 extern u8 *format_dpo_proto(u8 * s, va_list * args);
271 * Set and stack a DPO.
272 * The DPO passed is set to the parent DPO and the necessary
273 * VLIB graph arcs are created. The child_type and child_proto
274 * are used to get the VLID nodes from which the arcs are added.
283 * This is the DPO to stack and set.
286 * The parent DPO to stack onto.
288 extern void dpo_stack(dpo_type_t child_type,
289 dpo_proto_t child_proto,
291 const dpo_id_t *parent_dpo);
295 * Set and stack a DPO.
296 * The DPO passed is set to the parent DPO and the necessary
297 * VLIB graph arcs are created, from the child_node passed.
300 * The VLIB grpah node index to create an arc from to the parent
303 * This is the DPO to stack and set.
306 * The parent DPO to stack onto.
308 extern void dpo_stack_from_node(u32 child_node,
310 const dpo_id_t *parent);
313 * @brief A lock function registered for a DPO type
315 typedef void (*dpo_lock_fn_t)(dpo_id_t *dpo);
318 * @brief An unlock function registered for a DPO type
320 typedef void (*dpo_unlock_fn_t)(dpo_id_t *dpo);
323 * @brief An memory usage show command
325 typedef void (*dpo_mem_show_t)(void);
328 * @brief A virtual function table regisitered for a DPO type
330 typedef struct dpo_vft_t_
333 * A reference counting lock function
335 dpo_lock_fn_t dv_lock;
337 * A reference counting unlock function
339 dpo_lock_fn_t dv_unlock;
343 format_function_t *dv_format;
345 * A show memory usage function
347 dpo_mem_show_t dv_mem_show;
352 * @brief For a given DPO type Register:
353 * - a virtual function table
354 * - a NULL terminated array of graph nodes from which that object type
355 * will originate packets, i.e. the nodes in which the object type will be
356 * the parent DPO in the DP graph. The ndoes are per-data-path protocol
360 * The type being registered.
363 * The virtual function table to register for the type.
366 * The string description of the per-protocol VLIB graph nodes.
368 extern void dpo_register(dpo_type_t type,
369 const dpo_vft_t *vft,
370 const char * const * const * nodes);
373 * @brief Create and register a new DPO type.
375 * This can be used by plugins to create new DPO types that are not listed
379 * The virtual function table to register for the type.
382 * The string description of the per-protocol VLIB graph nodes.
384 * @return The new dpo_type_t
386 extern dpo_type_t dpo_register_new_type(const dpo_vft_t *vft,
387 const char * const * const * nodes);