blob: d3c2371c6dd61bdb00407a1e2986bec95ba51d37 [file] [log] [blame]
Neale Ranns0bfe5d82016-08-25 15:29:12 +01001/*
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:
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
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.
14 */
15/**
16 * @brief
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.
19 *
20 * The DPO can be considered to be like is a base class that is specialised
21 * by other objects to provide concreate actions
22 *
23 * The VLIB graph nodes are graph of DPO types, the DPO graph is a graph of
24 * instances.
25 */
26
27#ifndef __DPO_H__
28#define __DPO_H__
29
30#include <vnet/vnet.h>
31
32/**
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
37 * foo barindex_t t);
38 * than we can from
39 * foo bar(u32 t);
40 */
41typedef u32 index_t;
42
43/**
44 * @brief Invalid index - used when no index is known
45 * blazoned capitals INVALID speak volumes where ~0 does not.
46 */
47#define INDEX_INVALID ((index_t)(~0))
48
49/**
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.
59 */
60typedef enum dpo_proto_t_
61{
Neale Ranns0bfe5d82016-08-25 15:29:12 +010062 DPO_PROTO_IP4 = 0,
Neale Ranns0bfe5d82016-08-25 15:29:12 +010063 DPO_PROTO_IP6,
64 DPO_PROTO_MPLS,
Neale Rannsda78f952017-05-24 09:15:43 -070065 DPO_PROTO_ETHERNET,
Neale Rannsd792d9c2017-10-21 10:53:20 -070066 DPO_PROTO_BIER,
Florin Corasce1b4c72017-01-26 14:25:34 -080067 DPO_PROTO_NSH,
Neale Ranns0bfe5d82016-08-25 15:29:12 +010068} __attribute__((packed)) dpo_proto_t;
69
Florin Corasce1b4c72017-01-26 14:25:34 -080070#define DPO_PROTO_NUM ((dpo_proto_t)(DPO_PROTO_NSH+1))
Neale Ranns450cd302016-11-09 17:49:42 +000071#define DPO_PROTO_NONE ((dpo_proto_t)(DPO_PROTO_NUM+1))
Neale Ranns0bfe5d82016-08-25 15:29:12 +010072
73#define DPO_PROTOS { \
74 [DPO_PROTO_IP4] = "ip4", \
75 [DPO_PROTO_IP6] = "ip6", \
Neale Ranns5e575b12016-10-03 09:40:25 +010076 [DPO_PROTO_ETHERNET] = "ethernet", \
Neale Ranns0bfe5d82016-08-25 15:29:12 +010077 [DPO_PROTO_MPLS] = "mpls", \
Florin Corasce1b4c72017-01-26 14:25:34 -080078 [DPO_PROTO_NSH] = "nsh", \
Neale Rannsd792d9c2017-10-21 10:53:20 -070079 [DPO_PROTO_BIER] = "bier", \
Neale Ranns0bfe5d82016-08-25 15:29:12 +010080}
81
Neale Ranns5e575b12016-10-03 09:40:25 +010082#define FOR_EACH_DPO_PROTO(_proto) \
83 for (_proto = DPO_PROTO_IP4; \
Florin Corasce1b4c72017-01-26 14:25:34 -080084 _proto <= DPO_PROTO_NSH; \
Neale Ranns5e575b12016-10-03 09:40:25 +010085 _proto++)
86
Neale Ranns0bfe5d82016-08-25 15:29:12 +010087/**
88 * @brief Common types of data-path objects
89 * New types can be dynamically added using dpo_register_new_type()
90 */
91typedef enum dpo_type_t_ {
92 /**
93 * A non-zero value first so we can spot unitialisation errors
94 */
95 DPO_FIRST,
96 DPO_DROP,
Neale Ranns948e00f2016-10-20 13:39:34 +010097 DPO_IP_NULL,
Neale Ranns0bfe5d82016-08-25 15:29:12 +010098 DPO_PUNT,
99 /**
100 * @brief load-balancing over a choice of [un]equal cost paths
101 */
102 DPO_LOAD_BALANCE,
Neale Ranns32e1c012016-11-22 17:07:28 +0000103 DPO_REPLICATE,
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100104 DPO_ADJACENCY,
105 DPO_ADJACENCY_INCOMPLETE,
106 DPO_ADJACENCY_MIDCHAIN,
107 DPO_ADJACENCY_GLEAN,
Neale Ranns32e1c012016-11-22 17:07:28 +0000108 DPO_ADJACENCY_MCAST,
Neale Ranns0f26c5a2017-03-01 15:12:11 -0800109 DPO_ADJACENCY_MCAST_MIDCHAIN,
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100110 DPO_RECEIVE,
111 DPO_LOOKUP,
112 DPO_LISP_CP,
113 DPO_CLASSIFY,
Neale Ranns31ed7442018-02-23 05:29:09 -0800114 DPO_MPLS_DISPOSITION_PIPE,
115 DPO_MPLS_DISPOSITION_UNIFORM,
Neale Ranns32e1c012016-11-22 17:07:28 +0000116 DPO_MFIB_ENTRY,
Neale Ranns43161a82017-08-12 02:12:00 -0700117 DPO_INTERFACE_RX,
118 DPO_INTERFACE_TX,
Neale Rannsf068c3e2018-01-03 04:18:48 -0800119 DPO_DVR,
Andrew Yourtchenko5f3fcb92017-10-25 05:50:37 -0700120 DPO_L3_PROXY,
Neale Rannsd792d9c2017-10-21 10:53:20 -0700121 DPO_BIER_TABLE,
122 DPO_BIER_FMASK,
123 DPO_BIER_IMP,
124 DPO_BIER_DISP_TABLE,
125 DPO_BIER_DISP_ENTRY,
Neale Ranns53da2212018-02-24 02:11:19 -0800126 DPO_IP6_LL,
Neale Ranns1dbcf302019-07-19 11:44:53 +0000127 DPO_PW_CW,
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100128 DPO_LAST,
129} __attribute__((packed)) dpo_type_t;
130
131#define DPO_TYPE_NUM DPO_LAST
132
133#define DPO_TYPES { \
134 [DPO_FIRST] = "dpo-invalid", \
135 [DPO_DROP] = "dpo-drop", \
Neale Ranns948e00f2016-10-20 13:39:34 +0100136 [DPO_IP_NULL] = "dpo-ip-null", \
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100137 [DPO_PUNT] = "dpo-punt", \
138 [DPO_ADJACENCY] = "dpo-adjacency", \
139 [DPO_ADJACENCY_INCOMPLETE] = "dpo-adjacency-incomplete", \
140 [DPO_ADJACENCY_MIDCHAIN] = "dpo-adjacency-midcahin", \
141 [DPO_ADJACENCY_GLEAN] = "dpo-glean", \
Neale Ranns32e1c012016-11-22 17:07:28 +0000142 [DPO_ADJACENCY_MCAST] = "dpo-adj-mcast", \
Neale Ranns0f26c5a2017-03-01 15:12:11 -0800143 [DPO_ADJACENCY_MCAST_MIDCHAIN] = "dpo-adj-mcast-midchain", \
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100144 [DPO_RECEIVE] = "dpo-receive", \
145 [DPO_LOOKUP] = "dpo-lookup", \
146 [DPO_LOAD_BALANCE] = "dpo-load-balance", \
Neale Ranns32e1c012016-11-22 17:07:28 +0000147 [DPO_REPLICATE] = "dpo-replicate", \
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100148 [DPO_LISP_CP] = "dpo-lisp-cp", \
149 [DPO_CLASSIFY] = "dpo-classify", \
Neale Ranns31ed7442018-02-23 05:29:09 -0800150 [DPO_MPLS_DISPOSITION_PIPE] = "dpo-mpls-diposition-pipe", \
151 [DPO_MPLS_DISPOSITION_UNIFORM] = "dpo-mpls-diposition-uniform", \
Neale Rannsf068c3e2018-01-03 04:18:48 -0800152 [DPO_MFIB_ENTRY] = "dpo-mfib-entry", \
Neale Ranns43161a82017-08-12 02:12:00 -0700153 [DPO_INTERFACE_RX] = "dpo-interface-rx", \
Neale Ranns6f631152017-10-03 08:20:21 -0700154 [DPO_INTERFACE_TX] = "dpo-interface-tx", \
Neale Rannsf068c3e2018-01-03 04:18:48 -0800155 [DPO_DVR] = "dpo-dvr", \
Andrew Yourtchenko5f3fcb92017-10-25 05:50:37 -0700156 [DPO_L3_PROXY] = "dpo-l3-proxy", \
Neale Rannsd792d9c2017-10-21 10:53:20 -0700157 [DPO_BIER_TABLE] = "bier-table", \
158 [DPO_BIER_FMASK] = "bier-fmask", \
159 [DPO_BIER_IMP] = "bier-imposition", \
160 [DPO_BIER_DISP_ENTRY] = "bier-disp-entry", \
161 [DPO_BIER_DISP_TABLE] = "bier-disp-table", \
Neale Ranns53da2212018-02-24 02:11:19 -0800162 [DPO_IP6_LL] = "ip6-link-local", \
Neale Ranns1dbcf302019-07-19 11:44:53 +0000163 [DPO_PW_CW] = "PW-CW", \
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100164}
165
166/**
167 * @brief The identity of a DPO is a combination of its type and its
168 * instance number/index of objects of that type
169 */
170typedef struct dpo_id_t_ {
171 /**
172 * the type
173 */
174 dpo_type_t dpoi_type;
175 /**
176 * the data-path protocol of the type.
177 */
178 dpo_proto_t dpoi_proto;
179 /**
180 * The next VLIB node to follow.
181 */
182 u16 dpoi_next_node;
183 /**
184 * the index of objects of that type
185 */
186 index_t dpoi_index;
187} __attribute__ ((aligned(sizeof(u64)))) dpo_id_t;
188
Damjan Marioncf478942016-11-07 14:57:50 +0100189STATIC_ASSERT(sizeof(dpo_id_t) <= sizeof(u64),
190 "DPO ID is greater than sizeof u64 "
191 "atomic updates need to be revisited");
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100192
193/**
Neale Rannsad95b5d2016-11-10 20:35:14 +0000194 * @brief An initialiser for DPOs declared on the stack.
195 * Thenext node is set to 0 since VLIB graph nodes should set 0 index to drop.
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100196 */
Neale Rannsad95b5d2016-11-10 20:35:14 +0000197#define DPO_INVALID \
198{ \
199 .dpoi_type = DPO_FIRST, \
200 .dpoi_proto = DPO_PROTO_NONE, \
201 .dpoi_index = INDEX_INVALID, \
202 .dpoi_next_node = 0, \
203}
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100204
205/**
206 * @brief Return true if the DPO object is valid, i.e. has been initialised.
207 */
208static inline int
209dpo_id_is_valid (const dpo_id_t *dpoi)
210{
211 return (dpoi->dpoi_type != DPO_FIRST &&
212 dpoi->dpoi_index != INDEX_INVALID);
213}
214
Neale Rannsad95b5d2016-11-10 20:35:14 +0000215extern dpo_proto_t vnet_link_to_dpo_proto(vnet_link_t linkt);
216
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100217/**
218 * @brief
219 * Take a reference counting lock on the DPO
220 */
221extern void dpo_lock(dpo_id_t *dpo);
222
223/**
224 * @brief
225 * Release a reference counting lock on the DPO
226 */
227extern void dpo_unlock(dpo_id_t *dpo);
228
229/**
Neale Ranns2303cb12018-02-21 04:57:17 -0800230 * @brief
231 * Make an interpose DPO from an original
232 */
233extern void dpo_mk_interpose(const dpo_id_t *original,
234 const dpo_id_t *parent,
235 dpo_id_t *clone);
236
237/**
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100238 * @brief Set/create a DPO ID
239 * The DPO will be locked.
240 *
241 * @param dpo
242 * The DPO object to configure
243 *
244 * @param type
245 * The dpo_type_t of the DPO
246 *
247 * @param proto
248 * The dpo_proto_t of the DPO
249 *
250 * @param index
251 * The type specific index of the DPO
252 */
253extern void dpo_set(dpo_id_t *dpo,
254 dpo_type_t type,
255 dpo_proto_t proto,
256 index_t index);
257
258/**
259 * @brief reset a DPO ID
260 * The DPO will be unlocked.
261 *
262 * @param dpo
263 * The DPO object to reset
264 */
265extern void dpo_reset(dpo_id_t *dpo);
266
267/**
268 * @brief compare two DPOs for equality
269 */
270extern int dpo_cmp(const dpo_id_t *dpo1,
271 const dpo_id_t *dpo2);
272
273/**
274 * @brief
275 * atomic copy a data-plane object.
276 * This is safe to use when the dst DPO is currently switching packets
277 */
278extern void dpo_copy(dpo_id_t *dst,
279 const dpo_id_t *src);
280
281/**
282 * @brief Return TRUE is the DPO is any type of adjacency
283 */
284extern int dpo_is_adj(const dpo_id_t *dpo);
285
286/**
Paul Vinciguerrab5a575b2019-11-01 13:00:58 -0400287 * @brief Format a DPO_id_t oject
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100288 */
289extern u8 *format_dpo_id(u8 * s, va_list * args);
290
291/**
Paul Vinciguerrab5a575b2019-11-01 13:00:58 -0400292 * @brief format a DPO type
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100293 */
294extern u8 *format_dpo_type(u8 * s, va_list * args);
295
296/**
297 * @brief format a DPO protocol
298 */
299extern u8 *format_dpo_proto(u8 * s, va_list * args);
300
301/**
Neale Rannsda78f952017-05-24 09:15:43 -0700302 * @brief format a DPO protocol
303 */
304extern vnet_link_t dpo_proto_to_link(dpo_proto_t dp);
305
306/**
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100307 * @brief
308 * Set and stack a DPO.
309 * The DPO passed is set to the parent DPO and the necessary
310 * VLIB graph arcs are created. The child_type and child_proto
311 * are used to get the VLID nodes from which the arcs are added.
312 *
313 * @param child_type
314 * Child DPO type.
315 *
316 * @param child_proto
317 * Child DPO proto
318 *
319 * @parem dpo
320 * This is the DPO to stack and set.
321 *
322 * @paren parent_dpo
323 * The parent DPO to stack onto.
324 */
325extern void dpo_stack(dpo_type_t child_type,
326 dpo_proto_t child_proto,
327 dpo_id_t *dpo,
328 const dpo_id_t *parent_dpo);
329
330/**
331 * @brief
332 * Set and stack a DPO.
333 * The DPO passed is set to the parent DPO and the necessary
334 * VLIB graph arcs are created, from the child_node passed.
335 *
336 * @param child_node
Lijian.Zhang33af8c12019-09-16 16:22:36 +0800337 * The VLIB graph node index to create an arc from to the parent
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100338 *
Andrew Yourtchenko5f3fcb92017-10-25 05:50:37 -0700339 * @param dpo
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100340 * This is the DPO to stack and set.
341 *
Andrew Yourtchenko5f3fcb92017-10-25 05:50:37 -0700342 * @param parent_dpo
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100343 * The parent DPO to stack onto.
344 */
345extern void dpo_stack_from_node(u32 child_node,
346 dpo_id_t *dpo,
347 const dpo_id_t *parent);
348
349/**
Andrew Yourtchenko5f3fcb92017-10-25 05:50:37 -0700350 * Get a uRPF interface for the DPO
351 *
352 * @param dpo
353 * The DPO from which to get the uRPF interface
354 *
355 * @return valid SW interface index or ~0
356 */
357extern u32 dpo_get_urpf(const dpo_id_t *dpo);
358
359/**
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100360 * @brief A lock function registered for a DPO type
361 */
362typedef void (*dpo_lock_fn_t)(dpo_id_t *dpo);
363
364/**
365 * @brief An unlock function registered for a DPO type
366 */
367typedef void (*dpo_unlock_fn_t)(dpo_id_t *dpo);
368
369/**
Neale Ranns6c3ebcc2016-10-02 21:20:15 +0100370 * @brief An memory usage show command
371 */
372typedef void (*dpo_mem_show_t)(void);
373
374/**
Neale Ranns43161a82017-08-12 02:12:00 -0700375 * @brief Given a DPO instance return a vector of node indices that
376 * the type/instance will use.
377 */
378typedef u32* (*dpo_get_next_node_t)(const dpo_id_t *dpo);
379
380/**
Andrew Yourtchenko5f3fcb92017-10-25 05:50:37 -0700381 * @brief Given a DPO instance return an interface that can
382 * be used in an uRPF check
383 */
384typedef u32 (*dpo_get_urpf_t)(const dpo_id_t *dpo);
385
386/**
Neale Ranns2303cb12018-02-21 04:57:17 -0800387 * @brief Called during FIB interposition when the originally
388 * registered DPO is used to 'clone' an instance for interposition
389 * at a particular location in the FIB graph.
390 * The parent is the next DPO in the chain that the clone will
391 * be used instead of. The clone may then choose to stack itself
392 * on the parent.
393 */
394typedef void (*dpo_mk_interpose_t)(const dpo_id_t *original,
395 const dpo_id_t *parent,
396 dpo_id_t *clone);
397
398/**
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100399 * @brief A virtual function table regisitered for a DPO type
400 */
401typedef struct dpo_vft_t_
402{
403 /**
404 * A reference counting lock function
405 */
406 dpo_lock_fn_t dv_lock;
407 /**
408 * A reference counting unlock function
409 */
410 dpo_lock_fn_t dv_unlock;
411 /**
412 * A format function
413 */
414 format_function_t *dv_format;
Neale Ranns6c3ebcc2016-10-02 21:20:15 +0100415 /**
416 * A show memory usage function
417 */
418 dpo_mem_show_t dv_mem_show;
Neale Ranns43161a82017-08-12 02:12:00 -0700419 /**
420 * A function to get the next VLIB node given an instance
421 * of the DPO. If this is null, then the node's name MUST be
422 * retreiveable from the nodes names array passed in the register
423 * function
424 */
425 dpo_get_next_node_t dv_get_next_node;
Andrew Yourtchenko5f3fcb92017-10-25 05:50:37 -0700426 /**
427 * Get uRPF interface
428 */
429 dpo_get_urpf_t dv_get_urpf;
Neale Ranns2303cb12018-02-21 04:57:17 -0800430 /**
431 * Signal on an interposed child that the parent has changed
432 */
433 dpo_mk_interpose_t dv_mk_interpose;
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100434} dpo_vft_t;
435
436
437/**
438 * @brief For a given DPO type Register:
439 * - a virtual function table
440 * - a NULL terminated array of graph nodes from which that object type
441 * will originate packets, i.e. the nodes in which the object type will be
442 * the parent DPO in the DP graph. The ndoes are per-data-path protocol
443 * (see above).
444 *
445 * @param type
446 * The type being registered.
447 *
448 * @param vft
449 * The virtual function table to register for the type.
450 *
451 * @param nodes
452 * The string description of the per-protocol VLIB graph nodes.
453 */
Neale Ranns6c3ebcc2016-10-02 21:20:15 +0100454extern void dpo_register(dpo_type_t type,
455 const dpo_vft_t *vft,
456 const char * const * const * nodes);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100457
458/**
459 * @brief Create and register a new DPO type.
460 *
461 * This can be used by plugins to create new DPO types that are not listed
462 * in dpo_type_t enum
463 *
464 * @param vft
465 * The virtual function table to register for the type.
466 *
467 * @param nodes
468 * The string description of the per-protocol VLIB graph nodes.
469 *
470 * @return The new dpo_type_t
471 */
Neale Ranns6c3ebcc2016-10-02 21:20:15 +0100472extern dpo_type_t dpo_register_new_type(const dpo_vft_t *vft,
473 const char * const * const * nodes);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100474
Vijayabhaskar Katamreddyb9ca61b2018-03-14 14:04:27 -0700475/**
476 * @brief Return already stacked up next node index for a given
477 * child_type/child_proto and parent_type/patent_proto.
478 * The VLIB graph arc used is taken from the parent and child types
479 * passed.
480 *
481 * @param child_type
482 * Child DPO type.
483 *
484 * @param child_proto
485 * Child DPO proto
486 *
487 * @param parent_type
488 * Parent DPO type.
489 *
490 * @param parent_proto
491 * Parent DPO proto
492 *
493 * @return The VLIB Graph node index
494 */
495extern u32
496dpo_get_next_node_by_type_and_proto (dpo_type_t child_type,
497 dpo_proto_t child_proto,
498 dpo_type_t parent_type,
499 dpo_proto_t parent_proto);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100500#endif