blob: 44a5f2e6d7f74c65e6664685f99afb189e5c1e9f [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#ifndef __FIB_ENTRY_H__
17#define __FIB_ENTRY_H__
18
19#include <vnet/fib/fib_node.h>
Neale Rannsad422ed2016-11-02 14:20:04 +000020#include <vnet/fib/fib_entry_delegate.h>
Neale Ranns0bfe5d82016-08-25 15:29:12 +010021#include <vnet/adj/adj.h>
22#include <vnet/ip/ip.h>
23#include <vnet/dpo/dpo.h>
24
25/**
26 * The different sources that can create a route.
27 * The sources are defined here the thier relative priority order.
28 * The lower the value the higher the priority
29 */
30typedef enum fib_source_t_ {
31 /**
32 * Marker. Add new values after this one.
33 */
34 FIB_SOURCE_FIRST,
35 /**
36 * Special sources. These are for entries that are added to all
37 * FIBs by default, and should never be over-ridden (hence they
38 * are the highest priority)
39 */
40 FIB_SOURCE_SPECIAL = FIB_SOURCE_FIRST,
41 /**
42 * Classify. A route that links directly to a classify adj
43 */
44 FIB_SOURCE_CLASSIFY,
45 /**
46 * Route added as a result of interface configuration.
47 * this will also come from the API/CLI, but the distinction is
48 * that is from confiiguration on an interface, not a 'ip route' command
49 */
50 FIB_SOURCE_INTERFACE,
51 /**
52 * A high priority source a plugin can use
53 */
54 FIB_SOURCE_PLUGIN_HI,
55 /**
56 * From the control plane API
57 */
58 FIB_SOURCE_API,
59 /**
60 * From the CLI.
61 */
62 FIB_SOURCE_CLI,
63 /**
64 * LISP
65 */
66 FIB_SOURCE_LISP,
67 /**
68 * SRv6
69 */
70 FIB_SOURCE_SR,
71 /**
72 * IPv[46] Mapping
73 */
74 FIB_SOURCE_MAP,
75 /**
76 * SIXRD
77 */
78 FIB_SOURCE_SIXRD,
79 /**
80 * DHCP
81 */
82 FIB_SOURCE_DHCP,
83 /**
84 * Adjacency source.
85 * routes created as a result of ARP/ND entries. This is lower priority
86 * then the API/CLI. This is on purpose. trust me.
87 */
88 FIB_SOURCE_ADJ,
89 /**
90 * MPLS label. The prefix has been assigned a local label. This source
91 * never provides forwarding information, instead it acts as a place-holder
92 * so the association of label to prefix can be maintained
93 */
94 FIB_SOURCE_MPLS,
95 /**
96 * Attached Export source.
97 * routes created as a result of attahced export. routes thus sourced
98 * will be present in the export tables
99 */
100 FIB_SOURCE_AE,
101 /**
102 * Recursive resolution source.
Neale Ranns3ee44042016-10-03 13:05:48 +0100103 * Used to install an entry that is the resolution traget of another.
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100104 */
105 FIB_SOURCE_RR,
106 /**
Neale Ranns3ee44042016-10-03 13:05:48 +0100107 * uRPF bypass/exemption.
108 * Used to install an entry that is exempt from the loose uRPF check
109 */
110 FIB_SOURCE_URPF_EXEMPT,
111 /**
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100112 * The default route source.
113 * The default route is always added to the FIB table (like the
114 * special sources) but we need to be able to over-ride it with
115 * 'ip route' sources when provided
116 */
117 FIB_SOURCE_DEFAULT_ROUTE,
118 /**
119 * Marker. add new entries before this one.
120 */
121 FIB_SOURCE_LAST = FIB_SOURCE_DEFAULT_ROUTE,
122} __attribute__ ((packed)) fib_source_t;
123
Damjan Marioncf478942016-11-07 14:57:50 +0100124STATIC_ASSERT (sizeof(fib_source_t) == 1,
125 "FIB too many sources");
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100126
127/**
128 * The maximum number of sources
129 */
130#define FIB_SOURCE_MAX (FIB_SOURCE_LAST+1)
131
132#define FIB_SOURCES { \
133 [FIB_SOURCE_SPECIAL] = "special", \
134 [FIB_SOURCE_INTERFACE] = "interface", \
135 [FIB_SOURCE_API] = "API", \
136 [FIB_SOURCE_CLI] = "CLI", \
137 [FIB_SOURCE_ADJ] = "adjacency", \
138 [FIB_SOURCE_MAP] = "MAP", \
139 [FIB_SOURCE_SR] = "SR", \
140 [FIB_SOURCE_SIXRD] = "SixRD", \
141 [FIB_SOURCE_LISP] = "LISP", \
142 [FIB_SOURCE_CLASSIFY] = "classify", \
143 [FIB_SOURCE_DHCP] = "DHCP", \
144 [FIB_SOURCE_RR] = "recursive-resolution", \
145 [FIB_SOURCE_AE] = "attached_export", \
146 [FIB_SOURCE_MPLS] = "mpls", \
Neale Ranns3ee44042016-10-03 13:05:48 +0100147 [FIB_SOURCE_URPF_EXEMPT] = "urpf-exempt", \
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100148 [FIB_SOURCE_DEFAULT_ROUTE] = "default-route", \
149}
150
151#define FOR_EACH_FIB_SOURCE(_item) \
152 for (_item = FIB_SOURCE_FIRST; _item < FIB_SOURCE_MAX; _item++)
153
154/**
155 * The different sources that can create a route.
156 * The sources are defined here the thier relative priority order.
157 * The lower the value the higher the priority
158 */
159typedef enum fib_entry_attribute_t_ {
160 /**
161 * Marker. Add new values after this one.
162 */
163 FIB_ENTRY_ATTRIBUTE_FIRST,
164 /**
165 * Connected. The prefix is configured on an interface.
166 */
167 FIB_ENTRY_ATTRIBUTE_CONNECTED = FIB_ENTRY_ATTRIBUTE_FIRST,
168 /**
169 * Attached. The prefix is attached to an interface.
170 */
171 FIB_ENTRY_ATTRIBUTE_ATTACHED,
172 /**
173 * The route is an explicit drop.
174 */
175 FIB_ENTRY_ATTRIBUTE_DROP,
176 /**
177 * The route is exclusive. The client creating the route is
178 * providing an exclusive adjacency.
179 */
180 FIB_ENTRY_ATTRIBUTE_EXCLUSIVE,
181 /**
182 * The route is attached cross tables and thus imports covered
183 * prefixes from the other table.
184 */
185 FIB_ENTRY_ATTRIBUTE_IMPORT,
186 /**
187 * The prefix/address is local to this device
188 */
189 FIB_ENTRY_ATTRIBUTE_LOCAL,
190 /**
191 * Marker. add new entries before this one.
192 */
193 FIB_ENTRY_ATTRIBUTE_LAST = FIB_ENTRY_ATTRIBUTE_LOCAL,
194} fib_entry_attribute_t;
195
196/**
197 * The maximum number of sources
198 */
199#define FIB_ENTRY_ATTRIBUTE_MAX (FIB_ENTRY_ATTRIBUTE_LAST+1)
200
201#define FIB_ENTRY_ATTRIBUTES { \
202 [FIB_ENTRY_ATTRIBUTE_CONNECTED] = "connected", \
203 [FIB_ENTRY_ATTRIBUTE_ATTACHED] = "attached", \
204 [FIB_ENTRY_ATTRIBUTE_IMPORT] = "import", \
205 [FIB_ENTRY_ATTRIBUTE_DROP] = "drop", \
206 [FIB_ENTRY_ATTRIBUTE_EXCLUSIVE] = "exclusive", \
207 [FIB_ENTRY_ATTRIBUTE_LOCAL] = "local", \
208}
209
210#define FOR_EACH_FIB_ATTRIBUTE(_item) \
211 for (_item = FIB_ENTRY_ATTRIBUTE_FIRST; \
212 _item < FIB_ENTRY_ATTRIBUTE_MAX; \
213 _item++)
214
215typedef enum fib_entry_flag_t_ {
216 FIB_ENTRY_FLAG_NONE = 0,
217 FIB_ENTRY_FLAG_CONNECTED = (1 << FIB_ENTRY_ATTRIBUTE_CONNECTED),
218 FIB_ENTRY_FLAG_ATTACHED = (1 << FIB_ENTRY_ATTRIBUTE_ATTACHED),
219 FIB_ENTRY_FLAG_DROP = (1 << FIB_ENTRY_ATTRIBUTE_DROP),
220 FIB_ENTRY_FLAG_EXCLUSIVE = (1 << FIB_ENTRY_ATTRIBUTE_EXCLUSIVE),
221 FIB_ENTRY_FLAG_LOCAL = (1 << FIB_ENTRY_ATTRIBUTE_LOCAL),
222 FIB_ENTRY_FLAG_IMPORT = (1 << FIB_ENTRY_ATTRIBUTE_IMPORT),
223} fib_entry_flag_t;
224
225/**
226 * Flags for the source data
227 */
228typedef enum fib_entry_src_attribute_t_ {
229 /**
230 * Marker. Add new values after this one.
231 */
232 FIB_ENTRY_SRC_ATTRIBUTE_FIRST,
233 /**
234 * the source has been added to the entry
235 */
236 FIB_ENTRY_SRC_ATTRIBUTE_ADDED = FIB_ENTRY_SRC_ATTRIBUTE_FIRST,
237 /**
238 * the source is active/best
239 */
240 FIB_ENTRY_SRC_ATTRIBUTE_ACTIVE,
241 /**
242 * Marker. add new entries before this one.
243 */
244 FIB_ENTRY_SRC_ATTRIBUTE_LAST = FIB_ENTRY_SRC_ATTRIBUTE_ACTIVE,
245} fib_entry_src_attribute_t;
246
247#define FIB_ENTRY_SRC_ATTRIBUTE_MAX (FIB_ENTRY_SRC_ATTRIBUTE_LAST+1)
248
249#define FIB_ENTRY_SRC_ATTRIBUTES { \
250 [FIB_ENTRY_SRC_ATTRIBUTE_ADDED] = "added", \
251 [FIB_ENTRY_SRC_ATTRIBUTE_ACTIVE] = "active", \
252}
253
254typedef enum fib_entry_src_flag_t_ {
255 FIB_ENTRY_SRC_FLAG_NONE = 0,
256 FIB_ENTRY_SRC_FLAG_ADDED = (1 << FIB_ENTRY_SRC_ATTRIBUTE_ADDED),
257 FIB_ENTRY_SRC_FLAG_ACTIVE = (1 << FIB_ENTRY_SRC_ATTRIBUTE_ACTIVE),
258} __attribute__ ((packed)) fib_entry_src_flag_t;
259
260/*
261 * Keep the size of the flags field to 2 bytes, so it
262 * can be placed next to the 2 bytes reference count
263 */
Damjan Marioncf478942016-11-07 14:57:50 +0100264STATIC_ASSERT (sizeof(fib_entry_src_flag_t) <= 2,
265 "FIB entry flags field size too big");
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100266
267/**
268 * Information related to the source of a FIB entry
269 */
270typedef struct fib_entry_src_t_ {
271 /**
Neale Ranns6c3ebcc2016-10-02 21:20:15 +0100272 * A vector of path extensions
273 */
274 struct fib_path_ext_t_ *fes_path_exts;
275
276 /**
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100277 * The path-list created by the source
278 */
279 fib_node_index_t fes_pl;
280 /**
281 * Which source this info block is for
282 */
283 fib_source_t fes_src;
284 /**
285 * Flags on the source
286 */
287 fib_entry_src_flag_t fes_flags;
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100288
289 /**
290 * 1 bytes ref count. This is not the number of users of the Entry
291 * (which is itself not large, due to path-list sharing), but the number
292 * of times a given source has been added. Which is even fewer
293 */
294 u8 fes_ref_count;
295
296 /**
Neale Ranns6c3ebcc2016-10-02 21:20:15 +0100297 * Flags the source contributes to the entry
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100298 */
Neale Ranns6c3ebcc2016-10-02 21:20:15 +0100299 fib_entry_flag_t fes_entry_flags;
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100300
301 /**
302 * Source specific info
303 */
304 union {
305 struct {
306 /**
307 * the index of the FIB entry that is the covering entry
308 */
309 fib_node_index_t fesr_cover;
310 /**
311 * This source's index in the cover's list
312 */
313 u32 fesr_sibling;
314 } rr;
315 struct {
316 /**
317 * the index of the FIB entry that is the covering entry
318 */
319 fib_node_index_t fesa_cover;
320 /**
321 * This source's index in the cover's list
322 */
323 u32 fesa_sibling;
324 } adj;
325 struct {
326 /**
327 * the index of the FIB entry that is the covering entry
328 */
329 fib_node_index_t fesi_cover;
330 /**
331 * This source's index in the cover's list
332 */
333 u32 fesi_sibling;
334 } interface;
335 struct {
336 /**
337 * This MPLS local label associated with the prefix.
338 */
339 mpls_label_t fesm_label;
340
341 /**
342 * the indicies of the LFIB entries created
343 */
344 fib_node_index_t fesm_lfes[2];
345 } mpls;
346 struct {
347 /**
348 * The source FIB index.
349 */
350 fib_node_index_t fesl_fib_index;
351 } lisp;
352 };
353} fib_entry_src_t;
354
355/**
356 * An entry in a FIB table.
357 *
358 * This entry represents a route added to the FIB that is stored
359 * in one of the FIB tables.
360 */
361typedef struct fib_entry_t_ {
362 /**
363 * Base class. The entry's node representation in the graph.
364 */
365 fib_node_t fe_node;
366 /**
Neale Rannsad422ed2016-11-02 14:20:04 +0000367 * The prefix of the route. this is const just to be sure.
368 * It is the entry's key/identity and so should never change.
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100369 */
Neale Rannsad422ed2016-11-02 14:20:04 +0000370 const fib_prefix_t fe_prefix;
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100371 /**
372 * The index of the FIB table this entry is in
373 */
374 u32 fe_fib_index;
375 /**
376 * The load-balance used for forwarding.
377 *
378 * We don't share the EOS and non-EOS even in case when they could be
379 * because:
380 * - complexity & reliability v. memory
381 * determining the conditions where sharing is possible is non-trivial.
382 * - separate LBs means we can get the EOS bit right in the MPLS label DPO
383 * and so save a few clock cycles in the DP imposition node since we can
384 * paint the header straight on without the need to check the packet
385 * type to derive the EOS bit value.
386 */
Neale Rannsad422ed2016-11-02 14:20:04 +0000387 dpo_id_t fe_lb; // [FIB_FORW_CHAIN_MPLS_NUM];
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100388 /**
389 * Vector of source infos.
390 * Most entries will only have 1 source. So we optimise for memory usage,
391 * which is preferable since we have many entries.
392 */
393 fib_entry_src_t *fe_srcs;
394 /**
395 * the path-list for which this entry is a child. This is also the path-list
396 * that is contributing forwarding for this entry.
397 */
398 fib_node_index_t fe_parent;
399 /**
400 * index of this entry in the parent's child list.
401 * This is set when this entry is added as a child, but can also
402 * be changed by the parent as it manages its list.
403 */
404 u32 fe_sibling;
Neale Rannsad422ed2016-11-02 14:20:04 +0000405
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100406 /**
Neale Rannsad422ed2016-11-02 14:20:04 +0000407 * A vector of delegates.
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100408 */
Neale Rannsad422ed2016-11-02 14:20:04 +0000409 fib_entry_delegate_t *fe_delegates;
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100410} fib_entry_t;
411
412#define FOR_EACH_FIB_ENTRY_FLAG(_item) \
413 for (_item = FIB_ENTRY_FLAG_FIRST; _item < FIB_ENTRY_FLAG_MAX; _item++)
414
415#define FIB_ENTRY_FORMAT_BRIEF (0x0)
416#define FIB_ENTRY_FORMAT_DETAIL (0x1)
417#define FIB_ENTRY_FORMAT_DETAIL2 (0x2)
418
419extern u8 *format_fib_entry (u8 * s, va_list * args);
420
421extern fib_node_index_t fib_entry_create_special(u32 fib_index,
422 const fib_prefix_t *prefix,
423 fib_source_t source,
424 fib_entry_flag_t flags,
425 const dpo_id_t *dpo);
426
427extern fib_node_index_t fib_entry_create (u32 fib_index,
428 const fib_prefix_t *prefix,
429 fib_source_t source,
430 fib_entry_flag_t flags,
431 const fib_route_path_t *paths);
432extern void fib_entry_update (fib_node_index_t fib_entry_index,
433 fib_source_t source,
434 fib_entry_flag_t flags,
435 const fib_route_path_t *paths);
436
437extern void fib_entry_path_add(fib_node_index_t fib_entry_index,
438 fib_source_t source,
439 fib_entry_flag_t flags,
440 const fib_route_path_t *rpath);
441extern void fib_entry_special_add(fib_node_index_t fib_entry_index,
442 fib_source_t source,
443 fib_entry_flag_t flags,
444 const dpo_id_t *dpo);
Neale Ranns948e00f2016-10-20 13:39:34 +0100445extern void fib_entry_special_update(fib_node_index_t fib_entry_index,
446 fib_source_t source,
447 fib_entry_flag_t flags,
448 const dpo_id_t *dpo);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100449extern fib_entry_src_flag_t fib_entry_special_remove(fib_node_index_t fib_entry_index,
450 fib_source_t source);
451
452extern fib_entry_src_flag_t fib_entry_path_remove(fib_node_index_t fib_entry_index,
453 fib_source_t source,
454 const fib_route_path_t *rpath);
455extern fib_entry_src_flag_t fib_entry_delete(fib_node_index_t fib_entry_index,
456 fib_source_t source);
457
Neale Ranns3ee44042016-10-03 13:05:48 +0100458extern void fib_entry_contribute_urpf(fib_node_index_t path_index,
459 index_t urpf);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100460extern void fib_entry_contribute_forwarding(
461 fib_node_index_t fib_entry_index,
462 fib_forward_chain_type_t type,
463 dpo_id_t *dpo);
464extern const dpo_id_t * fib_entry_contribute_ip_forwarding(
465 fib_node_index_t fib_entry_index);
466extern adj_index_t fib_entry_get_adj_for_source(
467 fib_node_index_t fib_entry_index,
468 fib_source_t source);
469extern const int fib_entry_get_dpo_for_source (
470 fib_node_index_t fib_entry_index,
471 fib_source_t source,
472 dpo_id_t *dpo);
473
474extern adj_index_t fib_entry_get_adj(fib_node_index_t fib_entry_index);
475
476extern int fib_entry_cmp_for_sort(void *i1, void *i2);
477
478extern void fib_entry_cover_changed(fib_node_index_t fib_entry);
479extern void fib_entry_cover_updated(fib_node_index_t fib_entry);
480extern int fib_entry_recursive_loop_detect(fib_node_index_t entry_index,
481 fib_node_index_t **entry_indicies);
482
483extern void fib_entry_lock(fib_node_index_t fib_entry_index);
484extern void fib_entry_unlock(fib_node_index_t fib_entry_index);
485
486extern u32 fib_entry_child_add(fib_node_index_t fib_entry_index,
487 fib_node_type_t type,
488 fib_node_index_t child_index);
489extern void fib_entry_child_remove(fib_node_index_t fib_entry_index,
490 u32 sibling_index);
491extern u32 fib_entry_get_resolving_interface(fib_node_index_t fib_entry_index);
Neale Rannsdf089a82016-10-02 16:39:06 +0100492extern u32 fib_entry_get_resolving_interface_for_source(
493 fib_node_index_t fib_entry_index,
494 fib_source_t source);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100495
Steven01b07122016-11-02 10:40:09 -0700496extern void fib_entry_encode(fib_node_index_t fib_entry_index,
497 fib_route_path_encode_t **api_rpaths);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100498extern void fib_entry_get_prefix(fib_node_index_t fib_entry_index,
499 fib_prefix_t *pfx);
500extern u32 fib_entry_get_fib_index(fib_node_index_t fib_entry_index);
501extern void fib_entry_set_source_data(fib_node_index_t fib_entry_index,
502 fib_source_t source,
503 const void *data);
504extern const void* fib_entry_get_source_data(fib_node_index_t fib_entry_index,
505 fib_source_t source);
506
507extern fib_entry_flag_t fib_entry_get_flags(fib_node_index_t fib_entry_index);
Neale Rannsdf089a82016-10-02 16:39:06 +0100508extern fib_entry_flag_t fib_entry_get_flags_for_source(
509 fib_node_index_t fib_entry_index,
510 fib_source_t source);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100511extern fib_source_t fib_entry_get_best_source(fib_node_index_t fib_entry_index);
512extern int fib_entry_is_sourced(fib_node_index_t fib_entry_index,
513 fib_source_t source);
514
515extern fib_node_index_t fib_entry_get_path_list(fib_node_index_t fib_entry_index);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100516
517extern void fib_entry_module_init(void);
518
519/*
520 * unsafe... beware the raw pointer.
521 */
522extern fib_node_index_t fib_entry_get_index(const fib_entry_t * fib_entry);
523extern fib_entry_t * fib_entry_get(fib_node_index_t fib_entry_index);
524
525/*
526 * for testing purposes.
527 */
528extern u32 fib_entry_pool_size(void);
529
530#endif