1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
|
/*
* 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.
*/
#ifndef __FIB_TABLE_H__
#define __FIB_TABLE_H__
#include <vnet/ip/ip.h>
#include <vnet/adj/adj.h>
#include <vnet/fib/fib_entry.h>
#include <vnet/mpls/mpls.h>
#include <vnet/mpls/packet.h>
/**
* @brief
* A protocol Independent FIB table
*/
typedef struct fib_table_t_
{
/**
* Which protocol this table serves. Used to switch on the union above.
*/
fib_protocol_t ft_proto;
/**
* number of locks on the table
*/
u16 ft_locks;
/**
* Table ID (hash key) for this FIB.
*/
u32 ft_table_id;
/**
* Index into FIB vector.
*/
fib_node_index_t ft_index;
/**
* flow hash configuration
*/
u32 ft_flow_hash_config;
/**
* Per-source route counters
*/
u32 ft_src_route_counts[FIB_SOURCE_MAX];
/**
* Total route counters
*/
u32 ft_total_route_counts;
/**
* Table description
*/
u8* ft_desc;
} fib_table_t;
/**
* @brief
* Format the description/name of the table
*/
extern u8* format_fib_table_name(u8* s, va_list ap);
/**
* @brief
* Perfom a longest prefix match in the non-forwarding table
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix to lookup
*
* @return
* The index of the fib_entry_t for the best match, which may be the default route
*/
extern fib_node_index_t fib_table_lookup(u32 fib_index,
const fib_prefix_t *prefix);
/**
* @brief
* Perfom an exact match in the non-forwarding table
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix to lookup
*
* @return
* The index of the fib_entry_t for the exact match, or INVALID
* is there is no match.
*/
extern fib_node_index_t fib_table_lookup_exact_match(u32 fib_index,
const fib_prefix_t *prefix);
/**
* @brief
* Get the less specific (covering) prefix
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix to lookup
*
* @return
* The index of the less specific fib_entry_t.
*/
extern fib_node_index_t fib_table_get_less_specific(u32 fib_index,
const fib_prefix_t *prefix);
/**
* @brief
* Add a 'special' entry to the FIB.
* A special entry is an entry that the FIB is not expect to resolve
* via the usual mechanisms (i.e. recurisve or neighbour adj DB lookup).
* Instead the will link to a DPO valid for the source and/or the flags.
* This add is reference counting per-source. So n 'removes' are required
* for n 'adds', if the entry is no longer required.
* If the source needs to provide non-default forwarding use:
* fib_table_entry_special_dpo_add()
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @param flags
* Flags for the entry.
*
* @return
* the index of the fib_entry_t that is created (or exists already).
*/
extern fib_node_index_t fib_table_entry_special_add(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_entry_flag_t flags);
/**
* @brief
* Add a 'special' entry to the FIB that links to the DPO passed
* A special entry is an entry that the FIB is not expect to resolve
* via the usual mechanisms (i.e. recurisve or neighbour adj DB lookup).
* Instead the client/source provides the DPO to link to.
* This add is reference counting per-source. So n 'removes' are required
* for n 'adds', if the entry is no longer required.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @param flags
* Flags for the entry.
*
* @param dpo
* The DPO to link to.
*
* @return
* the index of the fib_entry_t that is created (or existed already).
*/
extern fib_node_index_t fib_table_entry_special_dpo_add(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_entry_flag_t stype,
const dpo_id_t *dpo);
/**
* @brief
* Update a 'special' entry to the FIB that links to the DPO passed
* A special entry is an entry that the FIB is not expect to resolve
* via the usual mechanisms (i.e. recurisve or neighbour adj DB lookup).
* Instead the client/source provides the DPO to link to.
* Special entries are add/remove reference counted per-source. So n
* 'removes' are required for n 'adds', if the entry is no longer required.
* An 'update' is an 'add' if no 'add' has already been called, otherwise an 'add'
* is therefore assumed to act on the reference instance of that add.
*
* @param fib_entry_index
* The index of the FIB entry to update
*
* @param source
* The ID of the client/source adding the entry.
*
* @param flags
* Flags for the entry.
*
* @param dpo
* The DPO to link to.
*
* @return
* the index of the fib_entry_t that is created (or existed already).
*/
extern fib_node_index_t fib_table_entry_special_dpo_update (u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_entry_flag_t stype,
const dpo_id_t *dpo);
/**
* @brief
* Remove a 'special' entry from the FIB.
* This add is reference counting per-source. So n 'removes' are required
* for n 'adds', if the entry is no longer required.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix to remove
*
* @param source
* The ID of the client/source adding the entry.
*
*/
extern void fib_table_entry_special_remove(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source);
/**
* @brief
* Add one path to an entry (aka route) in the FIB. If the entry does not
* exist, it will be created.
* See the documentation for fib_route_path_t for more descirptions of
* the path parameters.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @param flags
* Flags for the entry.
*
* @paran next_hop_proto
* The protocol of the next hop. This cannot be derived in the event that
* the next hop is all zeros.
*
* @param next_hop
* The address of the next-hop.
*
* @param sw_if_index
* The index of the interface.
*
* @param next_hop_fib_index,
* The fib index of the next-hop for recursive resolution
*
* @param next_hop_weight
* [un]equal cost path weight
*
* @param next_hop_label_stack
* The path's out-going label stack. NULL is there is none.
*
* @param pf
* Flags for the path
*
* @return
* the index of the fib_entry_t that is created (or existed already).
*/
extern fib_node_index_t fib_table_entry_path_add(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_entry_flag_t flags,
dpo_proto_t next_hop_proto,
const ip46_address_t *next_hop,
u32 next_hop_sw_if_index,
u32 next_hop_fib_index,
u32 next_hop_weight,
mpls_label_t *next_hop_label_stack,
fib_route_path_flags_t pf);
/**
* @brief
* Add n paths to an entry (aka route) in the FIB. If the entry does not
* exist, it will be created.
* See the documentation for fib_route_path_t for more descirptions of
* the path parameters.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @param flags
* Flags for the entry.
*
* @param rpaths
* A vector of paths. Not const since they may be modified.
*
* @return
* the index of the fib_entry_t that is created (or existed already).
*/
extern fib_node_index_t fib_table_entry_path_add2(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_entry_flag_t flags,
fib_route_path_t *rpath);
/**
* @brief
* remove one path to an entry (aka route) in the FIB. If this is the entry's
* last path, then the entry will be removed, unless it has other sources.
* See the documentation for fib_route_path_t for more descirptions of
* the path parameters.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @paran next_hop_proto
* The protocol of the next hop. This cannot be derived in the event that
* the next hop is all zeros.
*
* @param next_hop
* The address of the next-hop.
*
* @param sw_if_index
* The index of the interface.
*
* @param next_hop_fib_index,
* The fib index of the next-hop for recursive resolution
*
* @param next_hop_weight
* [un]equal cost path weight
*
* @param pf
* Flags for the path
*/
extern void fib_table_entry_path_remove(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
dpo_proto_t next_hop_proto,
const ip46_address_t *next_hop,
u32 next_hop_sw_if_index,
u32 next_hop_fib_index,
u32 next_hop_weight,
fib_route_path_flags_t pf);
/**
* @brief
* Remove n paths to an entry (aka route) in the FIB. If this is the entry's
* last path, then the entry will be removed, unless it has other sources.
* See the documentation for fib_route_path_t for more descirptions of
* the path parameters.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @param rpaths
* A vector of paths.
*/
extern void fib_table_entry_path_remove2(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_route_path_t *paths);
/**
* @brief
* Update an entry to have a new set of paths. If the entry does not
* exist, it will be created.
* The difference between an 'path-add' and an update, is that path-add is
* an incremental addition of paths, whereas an update is a wholesale swap.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @param rpaths
* A vector of paths. Not const since they may be modified.
*
* @return
* the index of the fib_entry_t that is created (or existed already).
*/
extern fib_node_index_t fib_table_entry_update(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_entry_flag_t flags,
fib_route_path_t *paths);
/**
* @brief
* Update the entry to have just one path. If the entry does not
* exist, it will be created.
* See the documentation for fib_route_path_t for more descirptions of
* the path parameters.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to add
*
* @param source
* The ID of the client/source adding the entry.
*
* @param flags
* Flags for the entry.
*
* @paran next_hop_proto
* The protocol of the next hop. This cannot be derived in the event that
* the next hop is all zeros.
*
* @param next_hop
* The address of the next-hop.
*
* @param sw_if_index
* The index of the interface.
*
* @param next_hop_fib_index,
* The fib index of the next-hop for recursive resolution
*
* @param next_hop_weight
* [un]equal cost path weight
*
* @param next_hop_label_stack
* The path's out-going label stack. NULL is there is none.
*
* @param pf
* Flags for the path
*
* @return
* the index of the fib_entry_t that is created (or existed already).
*/
extern fib_node_index_t fib_table_entry_update_one_path(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source,
fib_entry_flag_t flags,
dpo_proto_t next_hop_proto,
const ip46_address_t *next_hop,
u32 next_hop_sw_if_index,
u32 next_hop_fib_index,
u32 next_hop_weight,
mpls_label_t *next_hop_label_stack,
fib_route_path_flags_t pf);
/**
* @brief
* Add a MPLS local label for the prefix/route. If the entry does not
* exist, it will be created. In theory more than one local label can be
* added, but this is not yet supported.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to which to add the label
*
* @param label
* The MPLS label to add
*
* @return
* the index of the fib_entry_t that is created (or existed already).
*/
extern fib_node_index_t fib_table_entry_local_label_add(u32 fib_index,
const fib_prefix_t *prefix,
mpls_label_t label);
/**
* @brief
* remove a MPLS local label for the prefix/route.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to which to add the label
*
* @param label
* The MPLS label to add
*/
extern void fib_table_entry_local_label_remove(u32 fib_index,
const fib_prefix_t *prefix,
mpls_label_t label);
/**
* @brief
* Delete a FIB entry. If the entry has no more sources, then it is
* removed from the table.
*
* @param fib_index
* The index of the FIB
*
* @param prefix
* The prefix for the entry to remove
*
* @param source
* The ID of the client/source adding the entry.
*/
extern void fib_table_entry_delete(u32 fib_index,
const fib_prefix_t *prefix,
fib_source_t source);
/**
* @brief
* Delete a FIB entry. If the entry has no more sources, then it is
* removed from the table.
*
* @param entry_index
* The index of the FIB entry
*
* @param source
* The ID of the client/source adding the entry.
*/
extern void fib_table_entry_delete_index(fib_node_index_t entry_index,
fib_source_t source);
/**
* @brief
* Flush all entries from a table for the source
*
* @param fib_index
* The index of the FIB
*
* @paran proto
* The protocol of the entries in the table
*
* @param source
* the source to flush
*/
extern void fib_table_flush(u32 fib_index,
fib_protocol_t proto,
fib_source_t source);
/**
* @brief
* Get the index of the FIB bound to the interface
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @param sw_if_index
* The interface index
*
* @return fib_index
* The index of the FIB
*/
extern u32 fib_table_get_index_for_sw_if_index(fib_protocol_t proto,
u32 sw_if_index);
/**
* @brief
* Get the Table-ID of the FIB bound to the interface
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @param sw_if_index
* The interface index
*
* @return fib_index
* The tableID of the FIB
*/
extern u32 fib_table_get_table_id_for_sw_if_index(fib_protocol_t proto,
u32 sw_if_index);
/**
* @brief
* Get the index of the FIB for a Table-ID. This DOES NOT create the
* FIB if it does not exist.
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @param table-id
* The Table-ID
*
* @return fib_index
* The index of the FIB, which may be INVALID.
*/
extern u32 fib_table_find(fib_protocol_t proto, u32 table_id);
/**
* @brief
* Get the index of the FIB for a Table-ID. This DOES create the
* FIB if it does not exist.
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @param table-id
* The Table-ID
*
* @return fib_index
* The index of the FIB
*/
extern u32 fib_table_find_or_create_and_lock(fib_protocol_t proto,
u32 table_id);
/**
* @brief
* Create a new table with no table ID. This means it does not get
* added to the hash-table and so can only be found by using the index returned.
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @param fmt
* A string to describe the table
*
* @return fib_index
* The index of the FIB
*/
extern u32 fib_table_create_and_lock(fib_protocol_t proto,
const char *const fmt,
...);
/**
* @brief
* Get the flow hash configured used by the table
*
* @param fib_index
* The index of the FIB
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @return The flow hash config
*/
extern flow_hash_config_t fib_table_get_flow_hash_config(u32 fib_index,
fib_protocol_t proto);
/**
* @brief
* Get the flow hash configured used by the protocol
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @return The flow hash config
*/
extern flow_hash_config_t fib_table_get_default_flow_hash_config(fib_protocol_t proto);
/**
* @brief
* Set the flow hash configured used by the table
*
* @param fib_index
* The index of the FIB
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @param hash_config
* The flow-hash config to set
*
* @return none
*/
extern void fib_table_set_flow_hash_config(u32 fib_index,
fib_protocol_t proto,
flow_hash_config_t hash_config);
/**
* @brief
* Take a reference counting lock on the table
*
* @param fib_index
* The index of the FIB
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*/
extern void fib_table_unlock(u32 fib_index,
fib_protocol_t proto);
/**
* @brief
* Release a reference counting lock on the table. When the last lock
* has gone. the FIB is deleted.
*
* @param fib_index
* The index of the FIB
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*/
extern void fib_table_lock(u32 fib_index,
fib_protocol_t proto);
/**
* @brief
* Return the number of entries in the FIB added by a given source.
*
* @param fib_index
* The index of the FIB
*
* @paran proto
* The protocol of the FIB (and thus the entries therein)
*
* @return number of sourced entries.
*/
extern u32 fib_table_get_num_entries(u32 fib_index,
fib_protocol_t proto,
fib_source_t source);
/**
* @brief
* Get a pointer to a FIB table
*/
extern fib_table_t *fib_table_get(fib_node_index_t index,
fib_protocol_t proto);
/**
* @brief Call back function when walking entries in a FIB table
*/
typedef int (*fib_table_walk_fn_t)(fib_node_index_t fei,
void *ctx);
/**
* @brief Walk all entries in a FIB table
* N.B: This is NOT safe to deletes. If you need to delete walk the whole
* table and store elements in a vector, then delete the elements
*/
extern void fib_table_walk(u32 fib_index,
fib_protocol_t proto,
fib_table_walk_fn_t fn,
void *ctx);
#endif
|