FD.io VPP  v19.08-27-gf4dcae4
Vector Packet Processing
fib_entry.c
Go to the documentation of this file.
1 /*
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 #include <vlib/vlib.h>
17 #include <vnet/ip/format.h>
18 #include <vnet/ip/lookup.h>
19 #include <vnet/adj/adj.h>
20 #include <vnet/dpo/load_balance.h>
21 #include <vnet/dpo/drop_dpo.h>
22 
23 #include <vnet/fib/fib_entry.h>
24 #include <vnet/fib/fib_walk.h>
25 #include <vnet/fib/fib_entry_src.h>
27 #include <vnet/fib/fib_table.h>
28 #include <vnet/fib/fib_internal.h>
30 #include <vnet/fib/fib_path_ext.h>
33 
34 /*
35  * Array of strings/names for the FIB sources
36  */
37 static const char *fib_source_names[] = FIB_SOURCES;
40 
41 /*
42  * Pool for all fib_entries
43  */
45 
46 /**
47  * the logger
48  */
50 
53 {
54  return (pool_elt_at_index(fib_entry_pool, index));
55 }
56 
57 static fib_node_t *
59 {
60  return ((fib_node_t*)fib_entry_get(index));
61 }
62 
64 fib_entry_get_index (const fib_entry_t * fib_entry)
65 {
66  return (fib_entry - fib_entry_pool);
67 }
68 
70 fib_entry_get_proto (const fib_entry_t * fib_entry)
71 {
72  return (fib_entry->fe_prefix.fp_proto);
73 }
74 
77 {
78  return (fib_proto_to_dpo(fib_entry->fe_prefix.fp_proto));
79 }
80 
83 {
84  switch (fib_entry->fe_prefix.fp_proto)
85  {
86  case FIB_PROTOCOL_IP4:
88  case FIB_PROTOCOL_IP6:
90  case FIB_PROTOCOL_MPLS:
91  if (MPLS_EOS == fib_entry->fe_prefix.fp_eos)
93  else
95  }
96 
98 }
99 
100 u8 *
101 format_fib_source (u8 * s, va_list * args)
102 {
103  fib_source_t source = va_arg (*args, int);
104 
105  s = format (s, "src:%s", fib_source_names[source]);
106 
107  return (s);
108 }
109 
110 u8 *
111 format_fib_entry_flags (u8 *s, va_list *args)
112 {
114  fib_entry_flag_t flag = va_arg(*args, int);
115 
116  FOR_EACH_FIB_ATTRIBUTE(attr) {
117  if ((1<<attr) & flag) {
118  s = format (s, "%s,", fib_attribute_names[attr]);
119  }
120  }
121 
122  return (s);
123 }
124 
125 u8 *
126 format_fib_entry_src_flags (u8 *s, va_list *args)
127 {
129  fib_entry_src_flag_t flag = va_arg(*args, int);
130 
132  if ((1<<sattr) & flag) {
133  s = format (s, "%s,", fib_src_attribute_names[sattr]);
134  }
135  }
136 
137  return (s);
138 }
139 
140 u8 *
141 format_fib_entry (u8 * s, va_list * args)
142 {
144  fib_entry_t *fib_entry;
146  fib_node_index_t fei;
147  fib_source_t source;
148  int level;
149 
150  fei = va_arg (*args, fib_node_index_t);
151  level = va_arg (*args, int);
152  fib_entry = fib_entry_get(fei);
153 
154  s = format (s, "%U", format_fib_prefix, &fib_entry->fe_prefix);
155 
156  if (level >= FIB_ENTRY_FORMAT_DETAIL)
157  {
158  s = format (s, " fib:%d", fib_entry->fe_fib_index);
159  s = format (s, " index:%d", fib_entry_get_index(fib_entry));
160  s = format (s, " locks:%d", fib_entry->fe_node.fn_locks);
161 
162  FOR_EACH_SRC_ADDED(fib_entry, src, source,
163  ({
164  s = format (s, "\n %U", format_fib_source, source);
165  s = format (s, " refs:%d", src->fes_ref_count);
166  if (FIB_ENTRY_FLAG_NONE != src->fes_entry_flags) {
167  s = format(s, " entry-flags:%U",
169  }
170  if (FIB_ENTRY_SRC_FLAG_NONE != src->fes_flags) {
171  s = format(s, " src-flags:%U",
173  }
174  s = fib_entry_src_format(fib_entry, source, s);
175  s = format (s, "\n");
176  if (FIB_NODE_INDEX_INVALID != src->fes_pl)
177  {
178  s = fib_path_list_format(src->fes_pl, s);
179  }
180  s = format(s, "%U", format_fib_path_ext_list, &src->fes_path_exts);
181  }));
182 
183  s = format (s, "\n forwarding: ");
184  }
185  else
186  {
187  s = format (s, "\n");
188  }
189 
190  fct = fib_entry_get_default_chain_type(fib_entry);
191 
192  if (!dpo_id_is_valid(&fib_entry->fe_lb))
193  {
194  s = format (s, " UNRESOLVED\n");
195  return (s);
196  }
197  else
198  {
199  s = format(s, " %U-chain\n %U",
202  &fib_entry->fe_lb,
203  2);
204  s = format(s, "\n");
205 
206  if (level >= FIB_ENTRY_FORMAT_DETAIL2)
207  {
208  index_t *fedi;
209 
210  s = format (s, " Delegates:\n");
211  vec_foreach(fedi, fib_entry->fe_delegates)
212  {
213  s = format(s, " %U\n", format_fib_entry_delegate, *fedi);
214  }
215  }
216  }
217 
218  if (level >= FIB_ENTRY_FORMAT_DETAIL2)
219  {
220  s = format(s, " Children:");
221  s = fib_node_children_format(fib_entry->fe_node.fn_children, s);
222  }
223 
224  return (s);
225 }
226 
227 static fib_entry_t*
229 {
231  return ((fib_entry_t*)node);
232 }
233 
234 static void
236 {
239  fib_entry_t *fib_entry;
240 
241  fib_entry = fib_entry_from_fib_node(node);
242 
243  ASSERT(!dpo_id_is_valid(&fib_entry->fe_lb));
244 
245  FOR_EACH_DELEGATE_CHAIN(fib_entry, fdt, fed,
246  {
247  dpo_reset(&fed->fd_dpo);
248  fib_entry_delegate_remove(fib_entry, fdt);
249  });
250 
251  FIB_ENTRY_DBG(fib_entry, "last-lock");
252 
253  fib_node_deinit(&fib_entry->fe_node);
254 
255  ASSERT(0 == vec_len(fib_entry->fe_delegates));
256  vec_free(fib_entry->fe_delegates);
257  vec_free(fib_entry->fe_srcs);
258  pool_put(fib_entry_pool, fib_entry);
259 }
260 
261 static fib_entry_src_t*
263 {
264  fib_entry_src_t *bsrc;
265 
266  /*
267  * the enum of sources is deliberately arranged in priority order
268  */
269  if (0 == vec_len(fib_entry->fe_srcs))
270  {
271  bsrc = NULL;
272  }
273  else
274  {
275  bsrc = vec_elt_at_index(fib_entry->fe_srcs, 0);
276  }
277 
278  return (bsrc);
279 }
280 
281 static fib_source_t
283 {
284  if (NULL != esrc)
285  {
286  return (esrc->fes_src);
287  }
288  return (FIB_SOURCE_MAX);
289 }
290 
291 static fib_entry_flag_t
293 {
294  if (NULL != esrc)
295  {
296  return (esrc->fes_entry_flags);
297  }
298  return (FIB_ENTRY_FLAG_NONE);
299 }
300 
303 {
304  return (fib_entry_get_flags_i(fib_entry_get(fib_entry_index)));
305 }
306 
307 /*
308  * fib_entry_back_walk_notify
309  *
310  * A back walk has reach this entry.
311  */
315 {
316  fib_entry_t *fib_entry;
317 
318  fib_entry = fib_entry_from_fib_node(node);
319 
326  {
329  fib_entry_get_index(fib_entry)));
330  }
331 
332  /*
333  * all other walk types can be reclassifed to a re-evaluate to
334  * all recursive dependents.
335  * By reclassifying we ensure that should any of these walk types meet
336  * they can be merged.
337  */
339 
340  /*
341  * ... and nothing is forced sync from now on.
342  */
344 
345  FIB_ENTRY_DBG(fib_entry, "bw:%U",
347 
348  /*
349  * propagate the backwalk further if we haven't already reached the
350  * maximum depth.
351  */
353  fib_entry_get_index(fib_entry),
354  ctx);
355 
357 }
358 
359 static void
361 {
362  u32 n_srcs = 0, n_exts = 0;
363  fib_entry_src_t *esrc;
364  fib_entry_t *entry;
365 
366  fib_show_memory_usage("Entry",
367  pool_elts(fib_entry_pool),
368  pool_len(fib_entry_pool),
369  sizeof(fib_entry_t));
370 
371  pool_foreach(entry, fib_entry_pool,
372  ({
373  n_srcs += vec_len(entry->fe_srcs);
374  vec_foreach(esrc, entry->fe_srcs)
375  {
376  n_exts += fib_path_ext_list_length(&esrc->fes_path_exts);
377  }
378  }));
379 
380  fib_show_memory_usage("Entry Source",
381  n_srcs, n_srcs, sizeof(fib_entry_src_t));
382  fib_show_memory_usage("Entry Path-Extensions",
383  n_exts, n_exts,
384  sizeof(fib_path_ext_t));
385 }
386 
387 /*
388  * The FIB path-list's graph node virtual function table
389  */
390 static const fib_node_vft_t fib_entry_vft = {
392  .fnv_last_lock = fib_entry_last_lock_gone,
393  .fnv_back_walk = fib_entry_back_walk_notify,
394  .fnv_mem_show = fib_entry_show_memory,
395 };
396 
397 /**
398  * @brief Contribute the set of Adjacencies that this entry forwards with
399  * to build the uRPF list of its children
400  */
401 void
403  index_t urpf)
404 {
405  fib_entry_t *fib_entry;
406 
407  fib_entry = fib_entry_get(entry_index);
408 
409  return (fib_path_list_contribute_urpf(fib_entry->fe_parent, urpf));
410 }
411 
412 /*
413  * If the client is request a chain for multicast forwarding then swap
414  * the chain type to one that can provide such transport.
415  */
418 {
419  switch (fct)
420  {
423  /*
424  * we can only transport IP multicast packets if there is an
425  * LSP.
426  */
428  break;
436  break;
437  }
438 
439  return (fct);
440 }
441 
442 /*
443  * fib_entry_contribute_forwarding
444  *
445  * Get an lock the forwarding information (DPO) contributed by the FIB entry.
446  */
447 void
450  dpo_id_t *dpo)
451 {
453  fib_entry_t *fib_entry;
454 
455  fib_entry = fib_entry_get(fib_entry_index);
456 
457  /*
458  * mfib children ask for mcast chains. fix these to the appropriate ucast types.
459  */
461 
462  if (fct == fib_entry_get_default_chain_type(fib_entry))
463  {
464  dpo_copy(dpo, &fib_entry->fe_lb);
465  }
466  else
467  {
468  fed = fib_entry_delegate_find(fib_entry,
470 
471  if (NULL == fed)
472  {
474  fib_entry,
476  /*
477  * on-demand create eos/non-eos.
478  * There is no on-demand delete because:
479  * - memory versus complexity & reliability:
480  * leaving unrequired [n]eos LB arounds wastes memory, cleaning
481  * then up on the right trigger is more code. i favour the latter.
482  */
483  fib_entry_src_mk_lb(fib_entry,
484  fib_entry_get_best_src_i(fib_entry),
485  fct,
486  &fed->fd_dpo);
487  }
488 
489  dpo_copy(dpo, &fed->fd_dpo);
490  }
491  /*
492  * use the drop DPO is nothing else is present
493  */
494  if (!dpo_id_is_valid(dpo))
495  {
497  }
498 
499  /*
500  * don't allow the special index indicating replicate.vs.load-balance
501  * to escape to the clients
502  */
503  dpo->dpoi_index &= ~MPLS_IS_REPLICATE;
504 }
505 
506 const dpo_id_t *
508 {
510  fib_entry_t *fib_entry;
511 
512  fib_entry = fib_entry_get(fib_entry_index);
513  fct = fib_entry_get_default_chain_type(fib_entry);
514 
517 
518  if (dpo_id_is_valid(&fib_entry->fe_lb))
519  {
520  return (&fib_entry->fe_lb);
521  }
522 
524 }
525 
528 {
529  const dpo_id_t *dpo;
530 
531  dpo = fib_entry_contribute_ip_forwarding(fib_entry_index);
532 
533  if (dpo_id_is_valid(dpo))
534  {
535  dpo = load_balance_get_bucket(dpo->dpoi_index, 0);
536 
537  if (dpo_is_adj(dpo))
538  {
539  return (dpo->dpoi_index);
540  }
541  }
542  return (ADJ_INDEX_INVALID);
543 }
544 
547 {
548  fib_entry_t *fib_entry;
549 
550  fib_entry = fib_entry_get(fib_entry_index);
551 
552  return (fib_entry->fe_parent);
553 }
554 
555 u32
557  fib_node_type_t child_type,
558  fib_node_index_t child_index)
559 {
561  fib_entry_index,
562  child_type,
563  child_index));
564 };
565 
566 void
568  u32 sibling_index)
569 {
571  fib_entry_index,
572  sibling_index);
573 
575  fib_entry_index))
576  {
577  /*
578  * if there are no children left then there is no reason to keep
579  * the non-default forwarding chains. those chains are built only
580  * because the children want them.
581  */
584  fib_entry_t *fib_entry;
585 
586  fib_entry = fib_entry_get(fib_entry_index);
587 
588  FOR_EACH_DELEGATE_CHAIN(fib_entry, fdt, fed,
589  {
590  dpo_reset(&fed->fd_dpo);
591  fib_entry_delegate_remove(fib_entry, fdt);
592  });
593  }
594 }
595 
596 static fib_entry_t *
597 fib_entry_alloc (u32 fib_index,
598  const fib_prefix_t *prefix,
599  fib_node_index_t *fib_entry_index)
600 {
601  fib_entry_t *fib_entry;
602  fib_prefix_t *fep;
603 
604  pool_get(fib_entry_pool, fib_entry);
605  clib_memset(fib_entry, 0, sizeof(*fib_entry));
606 
607  fib_node_init(&fib_entry->fe_node,
609 
610  fib_entry->fe_fib_index = fib_index;
611 
612  /*
613  * the one time we need to update the const prefix is when
614  * the entry is first created
615  */
616  fep = (fib_prefix_t*)&(fib_entry->fe_prefix);
617  *fep = *prefix;
618 
619  if (FIB_PROTOCOL_MPLS == fib_entry->fe_prefix.fp_proto)
620  {
621  fep->fp_len = 21;
622  if (MPLS_NON_EOS == fep->fp_eos)
623  {
625  }
627  }
628 
629  dpo_reset(&fib_entry->fe_lb);
630 
631  *fib_entry_index = fib_entry_get_index(fib_entry);
632 
633  return (fib_entry);
634 }
635 
636 static fib_entry_t*
638  fib_entry_flag_t old_flags)
639 {
640  fib_node_index_t fei;
641 
642  /*
643  * save the index so we can recover from pool reallocs
644  */
645  fei = fib_entry_get_index(fib_entry);
646 
647  /*
648  * handle changes to attached export for import entries
649  */
650  int is_import = (FIB_ENTRY_FLAG_IMPORT & fib_entry_get_flags_i(fib_entry));
651  int was_import = (FIB_ENTRY_FLAG_IMPORT & old_flags);
652 
653  if (!was_import && is_import)
654  {
655  /*
656  * transition from not exported to exported
657  */
658 
659  /*
660  * there is an assumption here that the entry resolves via only
661  * one interface and that it is the cross VRF interface.
662  */
664 
665  fib_attached_export_import(fib_entry,
667  fib_entry_get_proto(fib_entry),
668  sw_if_index));
669  }
670  else if (was_import && !is_import)
671  {
672  /*
673  * transition from exported to not exported
674  */
675  fib_attached_export_purge(fib_entry);
676  }
677  /*
678  * else
679  * no change. nothing to do.
680  */
681 
682  /*
683  * reload the entry address post possible pool realloc
684  */
685  fib_entry = fib_entry_get(fei);
686 
687  /*
688  * handle changes to attached export for export entries
689  */
690  int is_attached = (FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags_i(fib_entry));
691  int was_attached = (FIB_ENTRY_FLAG_ATTACHED & old_flags);
692 
693  if (!was_attached && is_attached)
694  {
695  /*
696  * transition to attached. time to export
697  */
698  // FIXME
699  }
700  // else FIXME
701 
702  return (fib_entry);
703 }
704 
705 static void
707  fib_source_t source,
708  fib_entry_flag_t old_flags)
709 {
710  fib_entry = fib_entry_post_flag_update_actions(fib_entry,
711  old_flags);
712  fib_entry_src_action_installed(fib_entry, source);
713 }
714 
717  const fib_prefix_t *prefix,
718  fib_source_t source,
720  const fib_route_path_t *paths)
721 {
722  fib_node_index_t fib_entry_index;
723  fib_entry_t *fib_entry;
724 
725  ASSERT(0 < vec_len(paths));
726 
727  fib_entry = fib_entry_alloc(fib_index, prefix, &fib_entry_index);
728 
729  /*
730  * since this is a new entry create, we don't need to check for winning
731  * sources - there is only one.
732  */
733  fib_entry = fib_entry_src_action_add(fib_entry, source, flags,
734  drop_dpo_get(
736  fib_entry_get_proto(fib_entry))));
738  source,
739  flags,
740  paths);
741  /*
742  * handle possible realloc's by refetching the pointer
743  */
744  fib_entry = fib_entry_get(fib_entry_index);
745  fib_entry_src_action_activate(fib_entry, source);
746 
748 
749  FIB_ENTRY_DBG(fib_entry, "create");
750 
751  return (fib_entry_index);
752 }
753 
756  const fib_prefix_t *prefix,
757  fib_source_t source,
759  const dpo_id_t *dpo)
760 {
761  fib_node_index_t fib_entry_index;
762  fib_entry_t *fib_entry;
763 
764  /*
765  * create and initialize the new enty
766  */
767  fib_entry = fib_entry_alloc(fib_index, prefix, &fib_entry_index);
768 
769  /*
770  * create the path-list
771  */
772  fib_entry = fib_entry_src_action_add(fib_entry, source, flags, dpo);
773  fib_entry_src_action_activate(fib_entry, source);
774 
776 
777  FIB_ENTRY_DBG(fib_entry, "create-special");
778 
779  return (fib_entry_index);
780 }
781 
782 static void
784  fib_source_t source,
785  fib_entry_flag_t old_flags)
786 {
787  /*
788  * backwalk to children to inform then of the change to forwarding.
789  */
790  fib_node_back_walk_ctx_t bw_ctx = {
792  };
793 
795 
796  /*
797  * then inform any covered prefixes
798  */
800 
801  fib_entry_post_install_actions(fib_entry, source, old_flags);
802 }
803 
804 void
806 {
807  fib_source_t best_source;
808  fib_entry_t *fib_entry;
809  fib_entry_src_t *bsrc;
810 
811  fib_entry = fib_entry_get(fib_entry_index);
812 
813  bsrc = fib_entry_get_best_src_i(fib_entry);
814  best_source = fib_entry_src_get_source(bsrc);
815 
816  fib_entry_src_action_reactivate(fib_entry, best_source);
817 }
818 
819 static void
821  fib_source_t old_source,
822  fib_entry_flag_t old_flags,
823  fib_source_t new_source)
824 {
825  if (new_source < old_source)
826  {
827  /*
828  * we have a new winning source.
829  */
830  fib_entry_src_action_deactivate(fib_entry, old_source);
831  fib_entry_src_action_activate(fib_entry, new_source);
832  }
833  else if (new_source > old_source)
834  {
835  /*
836  * the new source loses. Re-activate the winning sources
837  * in case it is an interposer and hence relied on the losing
838  * source's path-list.
839  */
840  fib_entry_src_action_reactivate(fib_entry, old_source);
841  return;
842  }
843  else
844  {
845  /*
846  * the new source is one this entry already has.
847  * But the path-list was updated, which will contribute new forwarding,
848  * so install it.
849  */
850  fib_entry_src_action_reactivate(fib_entry, new_source);
851  }
852 
853  fib_entry_post_update_actions(fib_entry, new_source, old_flags);
854 }
855 
856 void
858  fib_source_t old_source,
859  fib_source_t new_source)
860 {
861  fib_entry_flag_t old_flags;
862 
863  old_flags = fib_entry_get_flags_for_source(
864  fib_entry_get_index(fib_entry), old_source);
865 
866  return (fib_entry_source_change_w_flags(fib_entry, old_source,
867  old_flags, new_source));
868 }
869 
870 void
872  fib_source_t source,
874  const dpo_id_t *dpo)
875 {
876  fib_source_t best_source;
877  fib_entry_t *fib_entry;
878 
879  fib_entry = fib_entry_get(fib_entry_index);
880  best_source = fib_entry_get_best_source(fib_entry_index);
881 
882  fib_entry = fib_entry_src_action_add(fib_entry, source, flags, dpo);
883  fib_entry_source_change(fib_entry, best_source, source);
884  FIB_ENTRY_DBG(fib_entry, "special-add:%U", format_fib_source, source);
885 }
886 
887 void
889  fib_source_t source,
891  const dpo_id_t *dpo)
892 {
893  fib_source_t best_source;
894  fib_entry_t *fib_entry;
895 
896  fib_entry = fib_entry_get(fib_entry_index);
897  best_source = fib_entry_get_best_source(fib_entry_index);
898 
899  fib_entry = fib_entry_src_action_update(fib_entry, source, flags, dpo);
900  fib_entry_source_change(fib_entry, best_source, source);
901 
902  FIB_ENTRY_DBG(fib_entry, "special-updated:%U", format_fib_source, source);
903 }
904 
905 
906 void
908  fib_source_t source,
910  const fib_route_path_t *rpaths)
911 {
912  fib_source_t best_source;
913  fib_entry_t *fib_entry;
914  fib_entry_src_t *bsrc;
915 
916  fib_entry = fib_entry_get(fib_entry_index);
917  ASSERT(NULL != fib_entry);
918 
919  bsrc = fib_entry_get_best_src_i(fib_entry);
920  best_source = fib_entry_src_get_source(bsrc);
921 
922  fib_entry = fib_entry_src_action_path_add(fib_entry, source, flags, rpaths);
923 
924  fib_entry_source_change(fib_entry, best_source, source);
925 
926  FIB_ENTRY_DBG(fib_entry, "path add:%U", format_fib_source, source);
927 }
928 
931 {
933  fib_source_t source;
934  int has_only_inherited_sources = 1;
935 
936  FOR_EACH_SRC_ADDED(fib_entry, src, source,
937  ({
939  {
940  has_only_inherited_sources = 0;
941  break;
942  }
943  }));
944  if (has_only_inherited_sources)
945  {
946  FOR_EACH_SRC_ADDED(fib_entry, src, source,
947  ({
948  fib_entry_src_action_remove(fib_entry, source);
949  }));
950  return (FIB_ENTRY_SRC_FLAG_NONE);
951  }
952  else
953  {
954  return (FIB_ENTRY_SRC_FLAG_ADDED);
955  }
956 }
957 
960  fib_entry_flag_t old_flags)
961 {
962  const fib_entry_src_t *bsrc;
963  fib_source_t best_source;
964 
965  /*
966  * if all that is left are inherited sources, then burn them
967  */
969 
970  bsrc = fib_entry_get_best_src_i(fib_entry);
971  best_source = fib_entry_src_get_source(bsrc);
972 
973  if (FIB_SOURCE_MAX == best_source)
974  {
975  /*
976  * no more sources left. this entry is toast.
977  */
978  fib_entry = fib_entry_post_flag_update_actions(fib_entry, old_flags);
980 
981  return (FIB_ENTRY_SRC_FLAG_NONE);
982  }
983  else
984  {
985  fib_entry_src_action_activate(fib_entry, best_source);
986  }
987 
988  fib_entry_post_update_actions(fib_entry, best_source, old_flags);
989 
990  /*
991  * still have sources
992  */
993  return (FIB_ENTRY_SRC_FLAG_ADDED);
994 }
995 
996 /*
997  * fib_entry_path_remove
998  *
999  * remove a path from the entry.
1000  * return the fib_entry's index if it is still present, INVALID otherwise.
1001  */
1004  fib_source_t source,
1005  const fib_route_path_t *rpaths)
1006 {
1007  fib_entry_src_flag_t sflag;
1008  fib_source_t best_source;
1009  fib_entry_flag_t bflags;
1010  fib_entry_t *fib_entry;
1011  fib_entry_src_t *bsrc;
1012 
1013  fib_entry = fib_entry_get(fib_entry_index);
1014  ASSERT(NULL != fib_entry);
1015 
1016  bsrc = fib_entry_get_best_src_i(fib_entry);
1017  best_source = fib_entry_src_get_source(bsrc);
1018  bflags = fib_entry_src_get_flags(bsrc);
1019 
1020  sflag = fib_entry_src_action_path_remove(fib_entry, source, rpaths);
1021 
1022  FIB_ENTRY_DBG(fib_entry, "path remove:%U", format_fib_source, source);
1023 
1024  /*
1025  * if the path list for the source passed is invalid,
1026  * then we need to create a new one. else we are updating
1027  * an existing.
1028  */
1029  if (source < best_source)
1030  {
1031  /*
1032  * Que! removing a path from a source that is better than the
1033  * one this entry is using.
1034  */
1035  ASSERT(0);
1036  }
1037  else if (source > best_source )
1038  {
1039  /*
1040  * the source is not the best. no need to update forwarding
1041  */
1042  if (FIB_ENTRY_SRC_FLAG_ADDED & sflag)
1043  {
1044  /*
1045  * the source being removed still has paths
1046  */
1047  return (FIB_ENTRY_SRC_FLAG_ADDED);
1048  }
1049  else
1050  {
1051  /*
1052  * that was the last path from this source, check if those
1053  * that remain are non-inherited
1054  */
1055  return (fib_entry_src_burn_only_inherited(fib_entry));
1056  }
1057  }
1058  else
1059  {
1060  /*
1061  * removing a path from the path-list we were using.
1062  */
1063  if (!(FIB_ENTRY_SRC_FLAG_ADDED & sflag))
1064  {
1065  /*
1066  * the last path from the source was removed.
1067  * fallback to lower source
1068  */
1069  return (fib_entry_source_removed(fib_entry, bflags));
1070  }
1071  else
1072  {
1073  /*
1074  * re-install the new forwarding information
1075  */
1076  fib_entry_src_action_reactivate(fib_entry, source);
1077  }
1078  }
1079 
1080  fib_entry_post_update_actions(fib_entry, source, bflags);
1081 
1082  /*
1083  * still have sources
1084  */
1085  return (FIB_ENTRY_SRC_FLAG_ADDED);
1086 }
1087 
1088 /*
1089  * fib_entry_special_remove
1090  *
1091  * remove a special source from the entry.
1092  * return the fib_entry's index if it is still present, INVALID otherwise.
1093  */
1096  fib_source_t source)
1097 {
1098  fib_entry_src_flag_t sflag;
1099  fib_source_t best_source;
1100  fib_entry_flag_t bflags;
1101  fib_entry_t *fib_entry;
1102  fib_entry_src_t *bsrc;
1103 
1104  fib_entry = fib_entry_get(fib_entry_index);
1105  ASSERT(NULL != fib_entry);
1106 
1107  bsrc = fib_entry_get_best_src_i(fib_entry);
1108  best_source = fib_entry_src_get_source(bsrc);
1109  bflags = fib_entry_src_get_flags(bsrc);
1110 
1111  FIB_ENTRY_DBG(fib_entry, "special remove:%U", format_fib_source, source);
1112 
1113  sflag = fib_entry_src_action_remove_or_update_inherit(fib_entry, source);
1114 
1115  /*
1116  * if the path list for the source passed is invalid,
1117  * then we need to create a new one. else we are updating
1118  * an existing.
1119  */
1120  if (source < best_source )
1121  {
1122  /*
1123  * Que! removing a path from a source that is better than the
1124  * one this entry is using. This can only mean it is a source
1125  * this prefix does not have.
1126  */
1127  return (FIB_ENTRY_SRC_FLAG_ADDED);
1128  }
1129  else if (source > best_source ) {
1130  /*
1131  * the source is not the best. no need to update forwarding
1132  */
1133  if (FIB_ENTRY_SRC_FLAG_ADDED & sflag)
1134  {
1135  /*
1136  * the source being removed still has paths
1137  */
1138  return (FIB_ENTRY_SRC_FLAG_ADDED);
1139  }
1140  else
1141  {
1142  /*
1143  * that was the last path from this source, check if those
1144  * that remain are non-inherited
1145  */
1147  {
1148  /*
1149  * no more sources left. this entry is toast.
1150  */
1151  fib_entry = fib_entry_post_flag_update_actions(fib_entry, bflags);
1152  fib_entry_src_action_uninstall(fib_entry);
1153  return (FIB_ENTRY_SRC_FLAG_NONE);
1154  }
1155 
1156  /*
1157  * reactivate the best source so the interposer gets restacked
1158  */
1159  fib_entry_src_action_reactivate(fib_entry, best_source);
1160 
1161  return (FIB_ENTRY_SRC_FLAG_ADDED);
1162  }
1163  }
1164  else
1165  {
1166  if (!(FIB_ENTRY_SRC_FLAG_ADDED & sflag))
1167  {
1168  /*
1169  * the source was removed. use the next best.
1170  */
1171  return (fib_entry_source_removed(fib_entry, bflags));
1172  }
1173  else
1174  {
1175  /*
1176  * re-install the new forwarding information
1177  */
1178  fib_entry_src_action_reactivate(fib_entry, source);
1179  }
1180  }
1181 
1182  fib_entry_post_update_actions(fib_entry, source, bflags);
1183 
1184  /*
1185  * still have sources
1186  */
1187  return (FIB_ENTRY_SRC_FLAG_ADDED);
1188 }
1189 
1190 /**
1191  * fib_entry_inherit
1192  *
1193  * If the source on the cover is inheriting then push this source
1194  * down to the covered.
1195  */
1196 void
1198  fib_node_index_t covered)
1199 {
1201  fib_entry_get(covered));
1202 }
1203 
1204 /**
1205  * fib_entry_delete
1206  *
1207  * The source is withdrawing all the paths it provided
1208  */
1211  fib_source_t source)
1212 {
1213  return (fib_entry_special_remove(fib_entry_index, source));
1214 }
1215 
1216 /**
1217  * fib_entry_update
1218  *
1219  * The source has provided a new set of paths that will replace the old.
1220  */
1221 void
1223  fib_source_t source,
1225  const fib_route_path_t *paths)
1226 {
1227  fib_source_t best_source;
1228  fib_entry_flag_t bflags;
1229  fib_entry_t *fib_entry;
1230  fib_entry_src_t *bsrc;
1231 
1232  fib_entry = fib_entry_get(fib_entry_index);
1233  ASSERT(NULL != fib_entry);
1234 
1235  bsrc = fib_entry_get_best_src_i(fib_entry);
1236  best_source = fib_entry_src_get_source(bsrc);
1237  bflags = fib_entry_get_flags_i(fib_entry);
1238 
1239  fib_entry = fib_entry_src_action_path_swap(fib_entry,
1240  source,
1241  flags,
1242  paths);
1243 
1244  fib_entry_source_change_w_flags(fib_entry, best_source, bflags, source);
1245  FIB_ENTRY_DBG(fib_entry, "update");
1246 }
1247 
1248 
1249 /*
1250  * fib_entry_cover_changed
1251  *
1252  * this entry is tracking its cover and that cover has changed.
1253  */
1254 void
1256 {
1258  .install = !0,
1259  .bw_reason = FIB_NODE_BW_REASON_FLAG_NONE,
1260  };
1261  CLIB_UNUSED(fib_source_t source);
1262  fib_source_t best_source;
1263  fib_entry_flag_t bflags;
1264  fib_entry_t *fib_entry;
1265  fib_entry_src_t *esrc;
1266  u32 index;
1267 
1268  bflags = FIB_ENTRY_FLAG_NONE;
1269  best_source = FIB_SOURCE_FIRST;
1270  fib_entry = fib_entry_get(fib_entry_index);
1271 
1273 
1274  /*
1275  * propagate the notification to each of the added sources
1276  */
1277  index = 0;
1278  FOR_EACH_SRC_ADDED(fib_entry, esrc, source,
1279  ({
1280  if (0 == index)
1281  {
1282  /*
1283  * only the best source gets to set the back walk flags
1284  */
1285  res = fib_entry_src_action_cover_change(fib_entry, esrc);
1286  bflags = fib_entry_src_get_flags(esrc);
1287  best_source = fib_entry_src_get_source(esrc);
1288  }
1289  else
1290  {
1291  fib_entry_src_action_cover_change(fib_entry, esrc);
1292  }
1293  index++;
1294  }));
1295 
1296  if (res.install)
1297  {
1300  fib_entry_get_best_src_i(fib_entry)));
1301  fib_entry_post_install_actions(fib_entry, best_source, bflags);
1302  }
1303  else
1304  {
1305  fib_entry_src_action_uninstall(fib_entry);
1306  }
1307 
1309  {
1310  /*
1311  * time for walkies fido.
1312  */
1313  fib_node_back_walk_ctx_t bw_ctx = {
1314  .fnbw_reason = res.bw_reason,
1315  };
1316 
1317  fib_walk_sync(FIB_NODE_TYPE_ENTRY, fib_entry_index, &bw_ctx);
1318  }
1319  FIB_ENTRY_DBG(fib_entry, "cover-changed");
1320 }
1321 
1322 /*
1323  * fib_entry_cover_updated
1324  *
1325  * this entry is tracking its cover and that cover has been updated
1326  * (i.e. its forwarding information has changed).
1327  */
1328 void
1330 {
1332  .install = !0,
1333  .bw_reason = FIB_NODE_BW_REASON_FLAG_NONE,
1334  };
1335  CLIB_UNUSED(fib_source_t source);
1336  fib_source_t best_source;
1337  fib_entry_flag_t bflags;
1338  fib_entry_t *fib_entry;
1339  fib_entry_src_t *esrc;
1340  u32 index;
1341 
1342  bflags = FIB_ENTRY_FLAG_NONE;
1343  best_source = FIB_SOURCE_FIRST;
1344  fib_entry = fib_entry_get(fib_entry_index);
1345 
1347 
1348  /*
1349  * propagate the notification to each of the added sources
1350  */
1351  index = 0;
1352  FOR_EACH_SRC_ADDED(fib_entry, esrc, source,
1353  ({
1354  if (0 == index)
1355  {
1356  /*
1357  * only the best source gets to set the back walk flags
1358  */
1359  res = fib_entry_src_action_cover_update(fib_entry, esrc);
1360  bflags = fib_entry_src_get_flags(esrc);
1361  best_source = fib_entry_src_get_source(esrc);
1362  }
1363  else
1364  {
1365  fib_entry_src_action_cover_update(fib_entry, esrc);
1366  }
1367  index++;
1368  }));
1369 
1370  if (res.install)
1371  {
1374  fib_entry_get_best_src_i(fib_entry)));
1375  fib_entry_post_install_actions(fib_entry, best_source, bflags);
1376  }
1377  else
1378  {
1379  fib_entry_src_action_uninstall(fib_entry);
1380  }
1381 
1383  {
1384  /*
1385  * time for walkies fido.
1386  */
1387  fib_node_back_walk_ctx_t bw_ctx = {
1388  .fnbw_reason = res.bw_reason,
1389  };
1390 
1391  fib_walk_sync(FIB_NODE_TYPE_ENTRY, fib_entry_index, &bw_ctx);
1392  }
1393  FIB_ENTRY_DBG(fib_entry, "cover-updated");
1394 }
1395 
1396 int
1398  fib_node_index_t **entry_indicies)
1399 {
1400  fib_entry_t *fib_entry;
1401  int was_looped, is_looped;
1402 
1403  fib_entry = fib_entry_get(entry_index);
1404 
1405  if (FIB_NODE_INDEX_INVALID != fib_entry->fe_parent)
1406  {
1407  fib_node_index_t *entries = *entry_indicies;
1408 
1409  vec_add1(entries, entry_index);
1410  was_looped = fib_path_list_is_looped(fib_entry->fe_parent);
1411  is_looped = fib_path_list_recursive_loop_detect(fib_entry->fe_parent,
1412  &entries);
1413 
1414  *entry_indicies = entries;
1415 
1416  if (!!was_looped != !!is_looped)
1417  {
1418  /*
1419  * re-evaluate all the entry's forwarding
1420  * NOTE: this is an inplace modify
1421  */
1423  fib_entry_delegate_t *fed;
1424 
1425  FOR_EACH_DELEGATE_CHAIN(fib_entry, fdt, fed,
1426  {
1427  fib_entry_src_mk_lb(fib_entry,
1428  fib_entry_get_best_src_i(fib_entry),
1430  &fed->fd_dpo);
1431  });
1432  }
1433  }
1434  else
1435  {
1436  /*
1437  * the entry is currently not linked to a path-list. this happens
1438  * when it is this entry that is re-linking path-lists and has thus
1439  * broken the loop
1440  */
1441  is_looped = 0;
1442  }
1443 
1444  return (is_looped);
1445 }
1446 
1447 u32
1449 {
1450  fib_entry_t *fib_entry;
1451 
1452  fib_entry = fib_entry_get(entry_index);
1453 
1454  return (fib_path_list_get_resolving_interface(fib_entry->fe_parent));
1455 }
1456 
1459 {
1460  fib_entry_t *fib_entry;
1461  fib_entry_src_t *bsrc;
1462 
1463  fib_entry = fib_entry_get(entry_index);
1464 
1465  bsrc = fib_entry_get_best_src_i(fib_entry);
1466  return (fib_entry_src_get_source(bsrc));
1467 }
1468 
1469 /**
1470  * Return !0 is the entry represents a host prefix
1471  */
1472 int
1474 {
1475  return (fib_prefix_is_host(fib_entry_get_prefix(fib_entry_index)));
1476 }
1477 
1478 /**
1479  * Return !0 is the entry is resolved, i.e. will return a valid forwarding
1480  * chain
1481  */
1482 int
1484 {
1485  fib_entry_delegate_t *fed;
1486  fib_entry_t *fib_entry;
1487 
1488  fib_entry = fib_entry_get(fib_entry_index);
1489 
1491 
1492  if (NULL == fed)
1493  {
1494  /*
1495  * no BFD tracking - consider it resolved.
1496  */
1497  return (!0);
1498  }
1499  else
1500  {
1501  /*
1502  * defer to the state of the BFD tracking
1503  */
1504  return (FIB_BFD_STATE_UP == fed->fd_bfd_state);
1505  }
1506 }
1507 
1508 void
1510  flow_hash_config_t hash_config)
1511 {
1512  fib_entry_t *fib_entry;
1513 
1514  fib_entry = fib_entry_get(fib_entry_index);
1515 
1516  /*
1517  * pass the hash-config on to the load-balance object where it is cached.
1518  * we can ignore LBs in the delegate chains, since they will not be of the
1519  * correct protocol type (i.e. they are not IP)
1520  * There's no way, nor need, to change the hash config for MPLS.
1521  */
1522  if (dpo_id_is_valid(&fib_entry->fe_lb))
1523  {
1524  load_balance_t *lb;
1525 
1526  ASSERT(DPO_LOAD_BALANCE == fib_entry->fe_lb.dpoi_type);
1527 
1528  lb = load_balance_get(fib_entry->fe_lb.dpoi_index);
1529 
1530  /*
1531  * atomic update for packets in flight
1532  */
1533  lb->lb_hash_config = hash_config;
1534  }
1535 }
1536 
1537 u32
1539 {
1540  fib_entry_t *fib_entry;
1541 
1542  fib_entry = fib_entry_get(fib_entry_index);
1543 
1544  return (fib_entry->fe_lb.dpoi_index);
1545 }
1546 
1547 static int
1549  const ip4_address_t * a2)
1550 {
1551  /*
1552  * IP addresses are unsigned ints. the return value here needs to be signed
1553  * a simple subtraction won't cut it.
1554  * If the addresses are the same, the sort order is undefined, so phoey.
1555  */
1556  return ((clib_net_to_host_u32(a1->data_u32) >
1557  clib_net_to_host_u32(a2->data_u32) ) ?
1558  1 : -1);
1559 }
1560 
1561 static int
1563  const ip6_address_t * a2)
1564 {
1565  int i;
1566  for (i = 0; i < ARRAY_LEN (a1->as_u16); i++)
1567  {
1568  int cmp = (clib_net_to_host_u16 (a1->as_u16[i]) -
1569  clib_net_to_host_u16 (a2->as_u16[i]));
1570  if (cmp != 0)
1571  return cmp;
1572  }
1573  return 0;
1574 }
1575 
1576 static int
1578  fib_node_index_t fib_entry_index2)
1579 {
1580  fib_entry_t *fib_entry1, *fib_entry2;
1581  int cmp = 0;
1582 
1583  fib_entry1 = fib_entry_get(fib_entry_index1);
1584  fib_entry2 = fib_entry_get(fib_entry_index2);
1585 
1586  switch (fib_entry1->fe_prefix.fp_proto)
1587  {
1588  case FIB_PROTOCOL_IP4:
1589  cmp = fib_ip4_address_compare(&fib_entry1->fe_prefix.fp_addr.ip4,
1590  &fib_entry2->fe_prefix.fp_addr.ip4);
1591  break;
1592  case FIB_PROTOCOL_IP6:
1593  cmp = fib_ip6_address_compare(&fib_entry1->fe_prefix.fp_addr.ip6,
1594  &fib_entry2->fe_prefix.fp_addr.ip6);
1595  break;
1596  case FIB_PROTOCOL_MPLS:
1597  cmp = (fib_entry1->fe_prefix.fp_label - fib_entry2->fe_prefix.fp_label);
1598 
1599  if (0 == cmp)
1600  {
1601  cmp = (fib_entry1->fe_prefix.fp_eos - fib_entry2->fe_prefix.fp_eos);
1602  }
1603  break;
1604  }
1605 
1606  if (0 == cmp) {
1607  cmp = (fib_entry1->fe_prefix.fp_len - fib_entry2->fe_prefix.fp_len);
1608  }
1609  return (cmp);
1610 }
1611 
1612 int
1613 fib_entry_cmp_for_sort (void *i1, void *i2)
1614 {
1615  fib_node_index_t *fib_entry_index1 = i1, *fib_entry_index2 = i2;
1616 
1617  return (fib_entry_cmp(*fib_entry_index1,
1618  *fib_entry_index2));
1619 }
1620 
1621 void
1623 {
1624  fib_entry_t *fib_entry;
1625 
1626  fib_entry = fib_entry_get(fib_entry_index);
1627 
1628  fib_node_lock(&fib_entry->fe_node);
1629 }
1630 
1631 void
1633 {
1634  fib_entry_t *fib_entry;
1635 
1636  fib_entry = fib_entry_get(fib_entry_index);
1637 
1638  fib_node_unlock(&fib_entry->fe_node);
1639 }
1640 
1641 void
1643 {
1645  fib_entry_logger = vlib_log_register_class("fib", "entry");
1646 
1648 }
1649 
1652 {
1653  fib_path_ext_list_t *ext_list;
1655  .rpaths = NULL,
1656  };
1657  fib_entry_t *fib_entry;
1658  fib_entry_src_t *bsrc;
1659 
1660  ext_list = NULL;
1661  fib_entry = fib_entry_get(fib_entry_index);
1662  bsrc = fib_entry_get_best_src_i(fib_entry);
1663 
1664  if (bsrc)
1665  {
1666  ext_list = &bsrc->fes_path_exts;
1667  }
1668 
1669  if (FIB_NODE_INDEX_INVALID != fib_entry->fe_parent)
1670  {
1672  ext_list,
1674  &ctx);
1675  }
1676 
1677  return (ctx.rpaths);
1678 }
1679 
1680 const fib_prefix_t *
1682 {
1683  fib_entry_t *fib_entry;
1684 
1685  fib_entry = fib_entry_get(fib_entry_index);
1686 
1687  return (&fib_entry->fe_prefix);
1688 }
1689 
1690 u32
1692 {
1693  fib_entry_t *fib_entry;
1694 
1695  fib_entry = fib_entry_get(fib_entry_index);
1696 
1697  return (fib_entry->fe_fib_index);
1698 }
1699 
1700 u32
1702 {
1703  return (pool_elts(fib_entry_pool));
1704 }
1705 
1706 static clib_error_t *
1708  unformat_input_t * input,
1709  vlib_cli_command_t * cmd)
1710 {
1711  fib_node_index_t fei;
1712 
1713  if (unformat (input, "%d", &fei))
1714  {
1715  /*
1716  * show one in detail
1717  */
1718  if (!pool_is_free_index(fib_entry_pool, fei))
1719  {
1720  vlib_cli_output (vm, "%d@%U",
1721  fei,
1722  format_fib_entry, fei,
1724  }
1725  else
1726  {
1727  vlib_cli_output (vm, "entry %d invalid", fei);
1728  }
1729  }
1730  else
1731  {
1732  /*
1733  * show all
1734  */
1735  vlib_cli_output (vm, "FIB Entries:");
1736  pool_foreach_index(fei, fib_entry_pool,
1737  ({
1738  vlib_cli_output (vm, "%d@%U",
1739  fei,
1740  format_fib_entry, fei,
1742  }));
1743  }
1744 
1745  return (NULL);
1746 }
1747 
1748 VLIB_CLI_COMMAND (show_fib_entry, static) = {
1749  .path = "show fib entry",
1750  .function = show_fib_entry_command,
1751  .short_help = "show fib entry",
1752 };
vlib_log_class_t vlib_log_register_class(char *class, char *subclass)
Definition: log.c:176
fib_protocol_t fp_proto
protocol type
Definition: fib_types.h:212
Contribute an object that is to be used to forward BIER packets.
Definition: fib_types.h:122
u8 * format_fib_entry(u8 *s, va_list *args)
Definition: fib_entry.c:141
u32 fib_entry_get_fib_index(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1691
static fib_entry_src_flag_t fib_entry_source_removed(fib_entry_t *fib_entry, fib_entry_flag_t old_flags)
Definition: fib_entry.c:959
Contribute an object that is to be used to forward IP6 packets.
Definition: fib_types.h:137
#define FIB_ENTRY_DBG(_e, _fmt, _args...)
Definition: fib_entry_src.h:28
u8 * format_fib_entry_src_flags(u8 *s, va_list *args)
Definition: fib_entry.c:126
void fib_entry_unlock(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1632
Contribute an object that is to be used to forward IP6 packets.
Definition: fib_types.h:113
u32 flags
Definition: vhost_user.h:141
An entry in a FIB table.
Definition: fib_entry.h:468
#define CLIB_UNUSED(x)
Definition: clib.h:82
static const char * fib_attribute_names[]
Definition: fib_entry.c:38
fib_node_bw_reason_flag_t bw_reason
Definition: fib_entry_src.h:93
int fib_entry_is_resolved(fib_node_index_t fib_entry_index)
Return !0 is the entry is resolved, i.e.
Definition: fib_entry.c:1483
fib_protocol_t fib_entry_get_proto(const fib_entry_t *fib_entry)
Definition: fib_entry.c:70
fib_entry_flag_t fib_entry_get_flags_i(const fib_entry_t *fib_entry)
A representation of a path as described by a route producer.
Definition: fib_types.h:479
void fib_attached_export_cover_change(fib_entry_t *fib_entry)
If this entry is tracking a cover (in another table) then that cover has changed. ...
int dpo_is_adj(const dpo_id_t *dpo)
Return TRUE is the DPO is any type of adjacency.
Definition: dpo.c:278
fib_entry_t * fib_entry_src_action_path_add(fib_entry_t *fib_entry, fib_source_t source, fib_entry_flag_t flags, const fib_route_path_t *rpaths)
static clib_error_t * show_fib_entry_command(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: fib_entry.c:1707
BFD session state.
void fib_path_list_contribute_urpf(fib_node_index_t path_list_index, index_t urpf)
Contribute (add) this path list&#39;s uRPF list.
void fib_entry_set_flow_hash_config(fib_node_index_t fib_entry_index, flow_hash_config_t hash_config)
Definition: fib_entry.c:1509
void fib_node_init(fib_node_t *node, fib_node_type_t type)
Definition: fib_node.c:185
u32 fib_path_list_get_resolving_interface(fib_node_index_t path_list_index)
u32 fib_entry_child_add(fib_node_index_t fib_entry_index, fib_node_type_t child_type, fib_node_index_t child_index)
Definition: fib_entry.c:556
static fib_forward_chain_type_t fib_entry_chain_type_mcast_to_ucast(fib_forward_chain_type_t fct)
Definition: fib_entry.c:417
#define FIB_ENTRY_FORMAT_DETAIL
Definition: fib_entry.h:523
static int dpo_id_is_valid(const dpo_id_t *dpoi)
Return true if the DPO object is valid, i.e.
Definition: dpo.h:209
static fib_entry_src_t * fib_entry_get_best_src_i(const fib_entry_t *fib_entry)
Definition: fib_entry.c:262
fib_node_index_t fib_entry_get_path_list(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:546
Definitions for all things IP (v4|v6) unicast and multicast lookup related.
#define NULL
Definition: clib.h:58
Information related to the source of a FIB entry.
Definition: fib_entry.h:360
u32 fib_table_get_index_for_sw_if_index(fib_protocol_t proto, u32 sw_if_index)
Get the index of the FIB bound to the interface.
Definition: fib_table.c:967
Definition: fib_entry.h:287
static int fib_ip6_address_compare(const ip6_address_t *a1, const ip6_address_t *a2)
Definition: fib_entry.c:1562
enum fib_node_back_walk_rc_t_ fib_node_back_walk_rc_t
Return code from a back walk function.
void fib_entry_contribute_forwarding(fib_node_index_t fib_entry_index, fib_forward_chain_type_t fct, dpo_id_t *dpo)
Definition: fib_entry.c:448
void fib_entry_src_action_deactivate(fib_entry_t *fib_entry, fib_source_t source)
flow_hash_config_t lb_hash_config
the hash config to use when selecting a bucket.
Definition: load_balance.h:161
const dpo_id_t * fib_entry_contribute_ip_forwarding(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:507
enum fib_entry_delegate_type_t_ fib_entry_delegate_type_t
Delegate types.
fib_bfd_state_t fd_bfd_state
BFD state.
dpo_proto_t fib_forw_chain_type_to_dpo_proto(fib_forward_chain_type_t fct)
Convert from a chain type to the DPO proto it will install.
Definition: fib_types.c:410
void fib_entry_child_remove(fib_node_index_t fib_entry_index, u32 sibling_index)
Definition: fib_entry.c:567
fib_entry_delegate_t * fib_entry_delegate_find(const fib_entry_t *fib_entry, fib_entry_delegate_type_t type)
void dpo_copy(dpo_id_t *dst, const dpo_id_t *src)
atomic copy a data-plane object.
Definition: dpo.c:262
u32 index_t
A Data-Path Object is an object that represents actions that are applied to packets are they are swit...
Definition: dpo.h:41
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:522
vl_api_address_t src
Definition: gre.api:51
fib_entry_src_flag_t fib_entry_src_action_path_remove(fib_entry_t *fib_entry, fib_source_t source, const fib_route_path_t *rpaths)
int i
Result from a cover update/change.
Definition: fib_entry_src.h:91
Contribute an object that is to be used to forward IP4 packets.
Definition: fib_types.h:109
static const char * fib_src_attribute_names[]
Definition: fib_entry.c:39
clib_memset(h->entries, 0, sizeof(h->entries[0])*entries)
void fib_node_deinit(fib_node_t *node)
Definition: fib_node.c:197
const fib_prefix_t * fib_entry_get_prefix(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1681
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
u32 fib_entry_pool_size(void)
Definition: fib_entry.c:1701
vl_api_mprefix_t prefix
Definition: ip.api:456
void fib_entry_module_init(void)
Definition: fib_entry.c:1642
u32 fe_fib_index
The index of the FIB table this entry is in.
Definition: fib_entry.h:481
Definition: fib_entry.h:283
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:236
fib_entry_src_t * fe_srcs
Vector of source infos.
Definition: fib_entry.h:500
dpo_id_t fd_dpo
Valid for the forwarding chain delegates.
unsigned char u8
Definition: types.h:56
fib_node_index_t fe_parent
the path-list for which this entry is a child.
Definition: fib_entry.h:505
int fib_prefix_is_host(const fib_prefix_t *prefix)
Return true is the prefix is a host prefix.
Definition: fib_types.c:162
#define pool_len(p)
Number of elements in pool vector.
Definition: pool.h:140
enum fib_protocol_t_ fib_protocol_t
Protocol Type.
u32 fib_node_child_add(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_type_t type, fib_node_index_t index)
Definition: fib_node.c:98
static void fib_entry_post_install_actions(fib_entry_t *fib_entry, fib_source_t source, fib_entry_flag_t old_flags)
Definition: fib_entry.c:706
void fib_node_register_type(fib_node_type_t type, const fib_node_vft_t *vft)
fib_node_register_type
Definition: fib_node.c:60
static fib_entry_src_flag_t fib_entry_src_burn_only_inherited(fib_entry_t *fib_entry)
Definition: fib_entry.c:930
const dpo_id_t * drop_dpo_get(dpo_proto_t proto)
Definition: drop_dpo.c:25
dpo_proto_t fp_payload_proto
This protocol determines the payload protocol of packets that will be forwarded by this entry once th...
Definition: fib_types.h:236
void fib_attached_export_purge(fib_entry_t *fib_entry)
All the imported entries need to be purged.
enum fib_entry_src_attribute_t_ fib_entry_src_attribute_t
Flags for the source data.
u32 vlib_log_class_t
Definition: vlib.h:51
#define FIB_ENTRY_ATTRIBUTES
Definition: fib_entry.h:261
void fib_entry_special_update(fib_node_index_t fib_entry_index, fib_source_t source, fib_entry_flag_t flags, const dpo_id_t *dpo)
Definition: fib_entry.c:888
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:493
vl_api_interface_index_t sw_if_index
Definition: gre.api:50
void fib_entry_delegate_remove(fib_entry_t *fib_entry, fib_entry_delegate_type_t type)
void fib_walk_sync(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_back_walk_ctx_t *ctx)
Back walk all the children of a FIB node.
Definition: fib_walk.c:745
#define DPO_PROTO_NONE
Definition: dpo.h:71
int fib_entry_is_host(fib_node_index_t fib_entry_index)
Return !0 is the entry represents a host prefix.
Definition: fib_entry.c:1473
u8 * format_fib_prefix(u8 *s, va_list *args)
Definition: fib_types.c:177
#define MPLS_IS_REPLICATE
The top bit of the index, which is the result of the MPLS lookup is used to determine if the DPO is a...
Definition: mpls_types.h:66
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
Aggregrate type for a prefix.
Definition: fib_types.h:203
fib_node_index_t fib_entry_get_index(const fib_entry_t *fib_entry)
Definition: fib_entry.c:64
void fib_entry_contribute_urpf(fib_node_index_t entry_index, index_t urpf)
Contribute the set of Adjacencies that this entry forwards with to build the uRPF list of its childre...
Definition: fib_entry.c:402
void fib_show_memory_usage(const char *name, u32 in_use_elts, u32 allocd_elts, size_t size_elt)
Show the memory usage for a type.
Definition: fib_node.c:220
unsigned int u32
Definition: types.h:88
Contribute an object that is to be used to forward Ethernet packets.
Definition: fib_types.h:141
static fib_node_back_walk_rc_t fib_entry_back_walk_notify(fib_node_t *node, fib_node_back_walk_ctx_t *ctx)
Definition: fib_entry.c:313
enum dpo_proto_t_ dpo_proto_t
Data path protocol.
u16 fp_len
The mask length.
Definition: fib_types.h:207
int fib_entry_cmp_for_sort(void *i1, void *i2)
Definition: fib_entry.c:1613
u16 install
Definition: fib_entry_src.h:92
adj_index_t fib_entry_get_adj(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:527
Definition: fib_entry.h:281
#define FOR_EACH_SRC_ADDED(_entry, _src, _source, action)
The identity of a DPO is a combination of its type and its instance number/index of objects of that t...
Definition: dpo.h:170
Contribute an object that is to be used to forward end-of-stack MPLS packets.
Definition: fib_types.h:129
fib_node_bw_reason_flag_t fnbw_reason
The reason/trigger for the backwalk.
Definition: fib_node.h:212
void fib_entry_src_mk_lb(fib_entry_t *fib_entry, const fib_entry_src_t *esrc, fib_forward_chain_type_t fct, dpo_id_t *dpo_lb)
static fib_source_t fib_entry_src_get_source(const fib_entry_src_t *esrc)
Definition: fib_entry.c:282
#define ADJ_INDEX_INVALID
Invalid ADJ index - used when no adj is known likewise blazoned capitals INVALID speak volumes where ...
Definition: adj_types.h:36
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:514
u8 * format_fib_node_bw_reason(u8 *s, va_list *args)
Definition: fib_walk.c:973
static int fib_ip4_address_compare(const ip4_address_t *a1, const ip4_address_t *a2)
Definition: fib_entry.c:1548
index_t * fe_delegates
A vector of delegate indices.
Definition: fib_entry.h:516
fib_entry_t * fib_entry_src_action_add(fib_entry_t *fib_entry, fib_source_t source, fib_entry_flag_t flags, const dpo_id_t *dpo)
enum fib_source_t_ fib_source_t
The different sources that can create a route.
ip46_address_t fp_addr
The address type is not deriveable from the fp_addr member.
Definition: fib_types.h:226
#define FOR_EACH_DELEGATE_CHAIN(_entry, _fdt, _fed, _body)
dpo_type_t dpoi_type
the type
Definition: dpo.h:174
void fib_node_lock(fib_node_t *node)
Definition: fib_node.c:203
long ctx[MAX_CONNS]
Definition: main.c:144
struct _unformat_input_t unformat_input_t
Definition: fib_entry.h:345
load-balancing over a choice of [un]equal cost paths
Definition: dpo.h:102
#define FOR_EACH_FIB_SRC_ATTRIBUTE(_item)
Definition: fib_entry.h:335
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:286
The FIB DPO provieds;.
Definition: load_balance.h:106
fib_node_bw_flags_t fnbw_flags
additional flags for the walk
Definition: fib_node.h:217
fib_entry_src_flag_t fib_entry_delete(fib_node_index_t fib_entry_index, fib_source_t source)
fib_entry_delete
Definition: fib_entry.c:1210
fib_node_index_t fib_entry_create_special(u32 fib_index, const fib_prefix_t *prefix, fib_source_t source, fib_entry_flag_t flags, const dpo_id_t *dpo)
Definition: fib_entry.c:755
A list of path-extensions.
Definition: fib_types.h:614
enum fib_entry_attribute_t_ fib_entry_attribute_t
The different sources that can create a route.
fib_node_type_t fn_type
The node&#39;s type.
Definition: fib_node.h:299
An node in the FIB graph.
Definition: fib_node.h:295
void fib_node_unlock(fib_node_t *node)
Definition: fib_node.c:209
const dpo_id_t * load_balance_get_bucket(index_t lbi, u32 bucket)
Definition: load_balance.c:339
#define FIB_SOURCE_MAX
The maximum number of sources.
Definition: fib_entry.h:162
fib_entry_src_flag_t fib_entry_src_action_remove_or_update_inherit(fib_entry_t *fib_entry, fib_source_t source)
void fib_entry_inherit(fib_node_index_t cover, fib_node_index_t covered)
fib_entry_inherit
Definition: fib_entry.c:1197
static void fib_entry_source_change_w_flags(fib_entry_t *fib_entry, fib_source_t old_source, fib_entry_flag_t old_flags, fib_source_t new_source)
Definition: fib_entry.c:820
#define FOR_EACH_FIB_ATTRIBUTE(_item)
Definition: fib_entry.h:275
u32 fib_entry_get_resolving_interface(fib_node_index_t entry_index)
Definition: fib_entry.c:1448
fib_entry_src_flag_t fib_entry_src_action_remove(fib_entry_t *fib_entry, fib_source_t source)
static fib_node_t * fib_entry_get_node(fib_node_index_t index)
Definition: fib_entry.c:58
static void fib_entry_last_lock_gone(fib_node_t *node)
Definition: fib_entry.c:235
fib_node_list_t fn_children
Vector of nodes that depend upon/use/share this node.
Definition: fib_node.h:309
fib_entry_delegate_type_t fib_entry_chain_type_to_delegate_type(fib_forward_chain_type_t fct)
vlib_main_t * vm
Definition: buffer.c:312
u8 * format_fib_source(u8 *s, va_list *args)
Definition: fib_entry.c:101
void fib_entry_src_action_installed(const fib_entry_t *fib_entry, fib_source_t source)
Definition: fib_entry.h:341
static fib_entry_t * fib_entry_from_fib_node(fib_node_t *node)
Definition: fib_entry.c:228
Contribute an object that is to be used to forward NSH packets.
Definition: fib_types.h:147
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:341
void fib_entry_src_action_activate(fib_entry_t *fib_entry, fib_source_t source)
void fib_entry_source_change(fib_entry_t *fib_entry, fib_source_t old_source, fib_source_t new_source)
Definition: fib_entry.c:857
Force the walk to be synchronous.
Definition: fib_node.h:174
int fib_entry_recursive_loop_detect(fib_node_index_t entry_index, fib_node_index_t **entry_indicies)
Definition: fib_entry.c:1397
fib_node_get_t fnv_get
Definition: fib_node.h:283
fib_entry_src_cover_res_t fib_entry_src_action_cover_change(fib_entry_t *fib_entry, fib_entry_src_t *esrc)
u32 fib_node_index_t
A typedef of a node index.
Definition: fib_types.h:30
static fib_entry_t * fib_entry_post_flag_update_actions(fib_entry_t *fib_entry, fib_entry_flag_t old_flags)
Definition: fib_entry.c:637
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:283
u32 fib_node_get_n_children(fib_node_type_t parent_type, fib_node_index_t parent_index)
Definition: fib_node.c:142
u32 adj_index_t
An index for adjacencies.
Definition: adj_types.h:30
#define ARRAY_LEN(x)
Definition: clib.h:62
fib_forward_chain_type_t fib_entry_delegate_type_to_chain_type(fib_entry_delegate_type_t fdt)
u8 * format_fib_entry_flags(u8 *s, va_list *args)
Definition: fib_entry.c:111
fib_entry_t * fib_entry_get(fib_node_index_t index)
Definition: fib_entry.c:52
enum fib_entry_flag_t_ fib_entry_flag_t
void fib_entry_path_add(fib_node_index_t fib_entry_index, fib_source_t source, fib_entry_flag_t flags, const fib_route_path_t *rpaths)
Definition: fib_entry.c:907
mpls_label_t fp_label
Definition: fib_types.h:229
Context passed between object during a back walk.
Definition: fib_node.h:208
void fib_entry_lock(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1622
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:155
int fib_path_list_recursive_loop_detect(fib_node_index_t path_list_index, fib_node_index_t **entry_indicies)
fib_entry_flag_t fes_entry_flags
Flags the source contributes to the entry.
Definition: fib_entry.h:374
int fib_path_list_is_looped(fib_node_index_t path_list_index)
fib_source_t fes_src
Which source this info block is for.
Definition: fib_entry.h:379
#define ASSERT(truth)
fib_entry_src_flag_t fes_flags
Flags on the source.
Definition: fib_entry.h:384
fib_entry_t * fib_entry_src_action_path_swap(fib_entry_t *fib_entry, fib_source_t source, fib_entry_flag_t flags, const fib_route_path_t *rpaths)
static void fib_entry_show_memory(void)
Definition: fib_entry.c:360
static load_balance_t * load_balance_get(index_t lbi)
Definition: load_balance.h:220
void fib_entry_track_module_init(void)
fib_node_t fe_node
Base class.
Definition: fib_entry.h:472
Path encode context to use when walking a path-list to encode paths.
Definition: fib_path.h:213
enum fib_forward_chain_type_t_ fib_forward_chain_type_t
FIB output chain type.
fib_entry_t * fib_entry_src_action_update(fib_entry_t *fib_entry, fib_source_t source, fib_entry_flag_t flags, const dpo_id_t *dpo)
u8 * format_fib_forw_chain_type(u8 *s, va_list *args)
Definition: fib_types.c:48
Definition: fib_entry.h:342
int fib_path_ext_list_length(const fib_path_ext_list_t *list)
Definition: fib_path_ext.c:481
void fib_node_child_remove(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_index_t sibling_index)
Definition: fib_node.c:123
static void fib_entry_post_update_actions(fib_entry_t *fib_entry, fib_source_t source, fib_entry_flag_t old_flags)
Definition: fib_entry.c:783
dpo_proto_t fib_proto_to_dpo(fib_protocol_t fib_proto)
Definition: fib_types.c:237
enum fib_entry_src_flag_t_ fib_entry_src_flag_t
u8 * format_dpo_id(u8 *s, va_list *args)
Format a DPO_id_t oject
Definition: dpo.c:148
u32 flow_hash_config_t
A flow hash configuration is a mask of the flow hash options.
Definition: lookup.h:84
static fib_entry_t * fib_entry_pool
Definition: fib_entry.c:44
u32 entries
void fib_entry_cover_changed(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1255
vl_api_mfib_path_t paths[n_paths]
Definition: ip.api:458
dpo_id_t fe_lb
The load-balance used for forwarding.
Definition: fib_entry.h:494
void fib_attached_export_cover_update(fib_entry_t *fib_entry)
If this entry is tracking a cover (in another table) then that cover has been updated.
fib_route_path_t * rpaths
Definition: fib_path.h:215
fib_node_index_t fes_pl
The path-list created by the source.
Definition: fib_entry.h:369
void fib_entry_src_inherit(const fib_entry_t *cover, fib_entry_t *covered)
void fib_attached_export_import(fib_entry_t *fib_entry, fib_node_index_t export_fib)
FIB attached export.
#define FIB_ENTRY_FORMAT_BRIEF
Definition: fib_entry.h:522
fib_entry_flag_t fib_entry_get_flags_for_source(fib_node_index_t fib_entry_index, fib_source_t source)
static fib_entry_flag_t fib_entry_src_get_flags(const fib_entry_src_t *esrc)
Definition: fib_entry.c:292
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:186
fib_node_index_t fib_entry_create(u32 fib_index, const fib_prefix_t *prefix, fib_source_t source, fib_entry_flag_t flags, const fib_route_path_t *paths)
Definition: fib_entry.c:716
#define FIB_NODE_INDEX_INVALID
Definition: fib_types.h:31
Marker.
Definition: fib_entry.h:39
void fib_entry_recalculate_forwarding(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:805
fib_route_path_t * fib_entry_encode(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1651
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
u32 fn_locks
Number of dependents on this node.
Definition: fib_node.h:315
u8 * fib_path_list_format(fib_node_index_t path_list_index, u8 *s)
u32 fib_entry_get_stats_index(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1538
u8 * fib_entry_src_format(fib_entry_t *fib_entry, fib_source_t source, u8 *s)
void fib_entry_cover_updated(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:1329
A FIB graph nodes virtual function table.
Definition: fib_node.h:282
enum fib_node_type_t_ fib_node_type_t
The types of nodes in a FIB graph.
void fib_entry_src_action_reactivate(fib_entry_t *fib_entry, fib_source_t source)
void fib_entry_update(fib_node_index_t fib_entry_index, fib_source_t source, fib_entry_flag_t flags, const fib_route_path_t *paths)
fib_entry_update
Definition: fib_entry.c:1222
#define FIB_ENTRY_FORMAT_DETAIL2
Definition: fib_entry.h:524
void dpo_reset(dpo_id_t *dpo)
reset a DPO ID The DPO will be unlocked.
Definition: dpo.c:232
#define vec_foreach(var, vec)
Vector iterator.
A path extension is a per-entry addition to the forwarding information when packets are sent for that...
Definition: fib_path_ext.h:98
u8 fes_ref_count
1 bytes ref count.
Definition: fib_entry.h:391
fib_path_ext_list_t fes_path_exts
A vector of path extensions.
Definition: fib_entry.h:364
fib_entry_src_flag_t fib_entry_path_remove(fib_node_index_t fib_entry_index, fib_source_t source, const fib_route_path_t *rpaths)
Definition: fib_entry.c:1003
dpo_proto_t fib_entry_get_dpo_proto(const fib_entry_t *fib_entry)
Definition: fib_entry.c:76
u8 * format_fib_path_ext_list(u8 *s, va_list *args)
Definition: fib_path_ext.c:461
void fib_path_list_walk_w_ext(fib_node_index_t path_list_index, const fib_path_ext_list_t *ext_list, fib_path_list_walk_w_ext_fn_t func, void *ctx)
u16 as_u16[8]
Definition: ip6_packet.h:49
Contribute an object that is to be used to forward non-end-of-stack MPLS packets. ...
Definition: fib_types.h:118
void fib_entry_cover_update_notify(fib_entry_t *fib_entry)
static int fib_entry_cmp(fib_node_index_t fib_entry_index1, fib_node_index_t fib_entry_index2)
Definition: fib_entry.c:1577
A Delagate is a means to implmenet the Delagation design pattern; the extension of an objects functio...
#define pool_foreach_index(i, v, body)
Iterate pool by index.
Definition: pool.h:538
u8 * fib_node_children_format(fib_node_list_t list, u8 *s)
Definition: fib_node.c:176
static fib_entry_t * fib_entry_alloc(u32 fib_index, const fib_prefix_t *prefix, fib_node_index_t *fib_entry_index)
Definition: fib_entry.c:597
u8 * format_fib_entry_delegate(u8 *s, va_list *args)
fib_source_t fib_entry_get_best_source(fib_node_index_t entry_index)
Definition: fib_entry.c:1458
Contribute an object that is to be used to forward IP4 packets.
Definition: fib_types.h:133
fib_entry_delegate_t * fib_entry_delegate_find_or_add(fib_entry_t *fib_entry, fib_entry_delegate_type_t fdt)
#define FIB_ENTRY_SRC_ATTRIBUTES
Definition: fib_entry.h:328
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:768
void fib_entry_special_add(fib_node_index_t fib_entry_index, fib_source_t source, fib_entry_flag_t flags, const dpo_id_t *dpo)
Definition: fib_entry.c:871
vlib_log_class_t fib_entry_logger
the logger
Definition: fib_entry.c:49
fib_forward_chain_type_t fib_entry_get_default_chain_type(const fib_entry_t *fib_entry)
Definition: fib_entry.c:82
fib_entry_src_cover_res_t fib_entry_src_action_cover_update(fib_entry_t *fib_entry, fib_entry_src_t *esrc)
const fib_prefix_t fe_prefix
The prefix of the route.
Definition: fib_entry.h:477
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:978
fib_entry_src_flag_t fib_entry_special_remove(fib_node_index_t fib_entry_index, fib_source_t source)
Definition: fib_entry.c:1095
static const char * fib_source_names[]
Definition: fib_entry.c:37
void fib_entry_src_action_uninstall(fib_entry_t *fib_entry)
fib_path_list_walk_rc_t fib_path_encode(fib_node_index_t path_list_index, fib_node_index_t path_index, const fib_path_ext_t *path_ext, void *args)
Definition: fib_path.c:2692
#define FIB_SOURCES
Definition: fib_entry.h:164
mpls_eos_bit_t fp_eos
Definition: fib_types.h:230
fib_entry_flag_t fib_entry_get_flags(fib_node_index_t fib_entry_index)
Definition: fib_entry.c:302
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128