2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
16 #include <vlib/vlib.h>
17 #include <vnet/vnet.h>
18 #include <vnet/ip/format.h>
19 #include <vnet/ip/ip.h>
20 #include <vnet/dpo/drop_dpo.h>
21 #include <vnet/dpo/receive_dpo.h>
22 #include <vnet/dpo/load_balance_map.h>
23 #include <vnet/dpo/lookup_dpo.h>
24 #include <vnet/dpo/interface_rx_dpo.h>
25 #include <vnet/dpo/mpls_disposition.h>
26 #include <vnet/dpo/dvr_dpo.h>
27 #include <vnet/dpo/drop_dpo.h>
29 #include <vnet/adj/adj.h>
30 #include <vnet/adj/adj_mcast.h>
32 #include <vnet/fib/fib_path.h>
33 #include <vnet/fib/fib_node.h>
34 #include <vnet/fib/fib_table.h>
35 #include <vnet/fib/fib_entry.h>
36 #include <vnet/fib/fib_path_list.h>
37 #include <vnet/fib/fib_internal.h>
38 #include <vnet/fib/fib_urpf_list.h>
39 #include <vnet/fib/mpls_fib.h>
40 #include <vnet/fib/fib_path_ext.h>
41 #include <vnet/udp/udp_encap.h>
42 #include <vnet/bier/bier_fmask.h>
43 #include <vnet/bier/bier_table.h>
44 #include <vnet/bier/bier_imp.h>
45 #include <vnet/bier/bier_disp_table.h>
48 * Enurmeration of path types
50 typedef enum fib_path_type_t_ {
52 * Marker. Add new types after this one.
54 FIB_PATH_TYPE_FIRST = 0,
56 * Attached-nexthop. An interface and a nexthop are known.
58 FIB_PATH_TYPE_ATTACHED_NEXT_HOP = FIB_PATH_TYPE_FIRST,
60 * attached. Only the interface is known.
62 FIB_PATH_TYPE_ATTACHED,
64 * recursive. Only the next-hop is known.
66 FIB_PATH_TYPE_RECURSIVE,
68 * special. nothing is known. so we drop.
70 FIB_PATH_TYPE_SPECIAL,
72 * exclusive. user provided adj.
74 FIB_PATH_TYPE_EXCLUSIVE,
76 * deag. Link to a lookup adj in the next table
82 FIB_PATH_TYPE_INTF_RX,
84 * Path resolves via a UDP encap object.
86 FIB_PATH_TYPE_UDP_ENCAP,
88 * receive. it's for-us.
90 FIB_PATH_TYPE_RECEIVE,
92 * bier-imp. it's via a BIER imposition.
94 FIB_PATH_TYPE_BIER_IMP,
96 * bier-fmask. it's via a BIER ECMP-table.
98 FIB_PATH_TYPE_BIER_TABLE,
100 * bier-fmask. it's via a BIER f-mask.
102 FIB_PATH_TYPE_BIER_FMASK,
108 * Marker. Add new types before this one, then update it.
110 FIB_PATH_TYPE_LAST = FIB_PATH_TYPE_BIER_FMASK,
111 } __attribute__ ((packed)) fib_path_type_t;
114 * The maximum number of path_types
116 #define FIB_PATH_TYPE_MAX (FIB_PATH_TYPE_LAST + 1)
118 #define FIB_PATH_TYPES { \
119 [FIB_PATH_TYPE_ATTACHED_NEXT_HOP] = "attached-nexthop", \
120 [FIB_PATH_TYPE_ATTACHED] = "attached", \
121 [FIB_PATH_TYPE_RECURSIVE] = "recursive", \
122 [FIB_PATH_TYPE_SPECIAL] = "special", \
123 [FIB_PATH_TYPE_EXCLUSIVE] = "exclusive", \
124 [FIB_PATH_TYPE_DEAG] = "deag", \
125 [FIB_PATH_TYPE_INTF_RX] = "intf-rx", \
126 [FIB_PATH_TYPE_UDP_ENCAP] = "udp-encap", \
127 [FIB_PATH_TYPE_RECEIVE] = "receive", \
128 [FIB_PATH_TYPE_BIER_IMP] = "bier-imp", \
129 [FIB_PATH_TYPE_BIER_TABLE] = "bier-table", \
130 [FIB_PATH_TYPE_BIER_FMASK] = "bier-fmask", \
131 [FIB_PATH_TYPE_DVR] = "dvr", \
134 #define FOR_EACH_FIB_PATH_TYPE(_item) \
135 for (_item = FIB_PATH_TYPE_FIRST; \
136 _item <= FIB_PATH_TYPE_LAST; \
140 * Enurmeration of path operational (i.e. derived) attributes
142 typedef enum fib_path_oper_attribute_t_ {
144 * Marker. Add new types after this one.
146 FIB_PATH_OPER_ATTRIBUTE_FIRST = 0,
148 * The path forms part of a recursive loop.
150 FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP = FIB_PATH_OPER_ATTRIBUTE_FIRST,
152 * The path is resolved
154 FIB_PATH_OPER_ATTRIBUTE_RESOLVED,
156 * The path is attached, despite what the next-hop may say.
158 FIB_PATH_OPER_ATTRIBUTE_ATTACHED,
160 * The path has become a permanent drop.
162 FIB_PATH_OPER_ATTRIBUTE_DROP,
164 * Marker. Add new types before this one, then update it.
166 FIB_PATH_OPER_ATTRIBUTE_LAST = FIB_PATH_OPER_ATTRIBUTE_DROP,
167 } __attribute__ ((packed)) fib_path_oper_attribute_t;
170 * The maximum number of path operational attributes
172 #define FIB_PATH_OPER_ATTRIBUTE_MAX (FIB_PATH_OPER_ATTRIBUTE_LAST + 1)
174 #define FIB_PATH_OPER_ATTRIBUTES { \
175 [FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP] = "recursive-loop", \
176 [FIB_PATH_OPER_ATTRIBUTE_RESOLVED] = "resolved", \
177 [FIB_PATH_OPER_ATTRIBUTE_DROP] = "drop", \
180 #define FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(_item) \
181 for (_item = FIB_PATH_OPER_ATTRIBUTE_FIRST; \
182 _item <= FIB_PATH_OPER_ATTRIBUTE_LAST; \
186 * Path flags from the attributes
188 typedef enum fib_path_oper_flags_t_ {
189 FIB_PATH_OPER_FLAG_NONE = 0,
190 FIB_PATH_OPER_FLAG_RECURSIVE_LOOP = (1 << FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP),
191 FIB_PATH_OPER_FLAG_DROP = (1 << FIB_PATH_OPER_ATTRIBUTE_DROP),
192 FIB_PATH_OPER_FLAG_RESOLVED = (1 << FIB_PATH_OPER_ATTRIBUTE_RESOLVED),
193 FIB_PATH_OPER_FLAG_ATTACHED = (1 << FIB_PATH_OPER_ATTRIBUTE_ATTACHED),
194 } __attribute__ ((packed)) fib_path_oper_flags_t;
199 typedef struct fib_path_t_ {
201 * A path is a node in the FIB graph.
206 * The index of the path-list to which this path belongs
211 * This marks the start of the memory area used to hash
214 STRUCT_MARK(path_hash_start);
217 * Configuration Flags
219 fib_path_cfg_flags_t fp_cfg_flags;
222 * The type of the path. This is the selector for the union
224 fib_path_type_t fp_type;
227 * The protocol of the next-hop, i.e. the address family of the
228 * next-hop's address. We can't derive this from the address itself
229 * since the address can be all zeros
231 dpo_proto_t fp_nh_proto;
234 * UCMP [unnormalised] weigth
239 * A path preference. 0 is the best.
240 * Only paths of the best preference, that are 'up', are considered
246 * per-type union of the data required to resolve the path
253 ip46_address_t fp_nh;
271 ip46_address_t fp_ip;
274 * The local label to resolve through.
276 mpls_label_t fp_local_label;
278 * The EOS bit of the resolving label
280 mpls_eos_bit_t fp_eos;
285 * The FIB table index in which to find the next-hop.
287 fib_node_index_t fp_tbl_id;
289 * The BIER FIB the fmask is in
298 index_t fp_bier_fmask;
302 * The BIER table's ID
304 bier_table_id_t fp_bier_tbl;
308 * The BIER imposition object
309 * this is part of the path's key, since the index_t
310 * of an imposition object is the object's key.
316 * The FIB index in which to perfom the next lookup
318 fib_node_index_t fp_tbl_id;
320 * The RPF-ID to tag the packets with
322 fib_rpf_id_t fp_rpf_id;
328 * The user provided 'exclusive' DPO
334 * The interface on which the local address is configured
340 ip46_address_t fp_addr;
344 * The interface on which the packets will be input.
350 * The UDP Encap object this path resolves through
361 STRUCT_MARK(path_hash_end);
364 * Memebers in this last section represent information that is
365 * dervied during resolution. It should not be copied to new paths
372 fib_path_oper_flags_t fp_oper_flags;
376 * the resolving via fib. not part of the union, since it it not part
377 * of the path's hash.
379 fib_node_index_t fp_via_fib;
381 * the resolving bier-table
383 index_t fp_via_bier_tbl;
385 * the resolving bier-fmask
387 index_t fp_via_bier_fmask;
391 * The Data-path objects through which this path resolves for IP.
396 * the index of this path in the parent's child list.
402 * Array of strings/names for the path types and attributes
404 static const char *fib_path_type_names[] = FIB_PATH_TYPES;
405 static const char *fib_path_oper_attribute_names[] = FIB_PATH_OPER_ATTRIBUTES;
406 static const char *fib_path_cfg_attribute_names[] = FIB_PATH_CFG_ATTRIBUTES;
409 * The memory pool from which we allocate all the paths
411 static fib_path_t *fib_path_pool;
416 vlib_log_class_t fib_path_logger;
421 #define FIB_PATH_DBG(_p, _fmt, _args...) \
423 vlib_log_debug (fib_path_logger, \
425 format_fib_path, fib_path_get_index(_p), 0, \
426 FIB_PATH_FORMAT_FLAGS_ONE_LINE, \
431 fib_path_get (fib_node_index_t index)
433 return (pool_elt_at_index(fib_path_pool, index));
436 static fib_node_index_t
437 fib_path_get_index (fib_path_t *path)
439 return (path - fib_path_pool);
443 fib_path_get_node (fib_node_index_t index)
445 return ((fib_node_t*)fib_path_get(index));
449 fib_path_from_fib_node (fib_node_t *node)
451 ASSERT(FIB_NODE_TYPE_PATH == node->fn_type);
452 return ((fib_path_t*)node);
456 format_fib_path (u8 * s, va_list * args)
458 fib_node_index_t path_index = va_arg (*args, fib_node_index_t);
459 u32 indent = va_arg (*args, u32);
460 fib_format_path_flags_t flags = va_arg (*args, fib_format_path_flags_t);
461 vnet_main_t * vnm = vnet_get_main();
462 fib_path_oper_attribute_t oattr;
463 fib_path_cfg_attribute_t cattr;
467 if (flags & FIB_PATH_FORMAT_FLAGS_ONE_LINE)
476 path = fib_path_get(path_index);
478 s = format (s, "%Upath:[%d] ", format_white_space, indent,
479 fib_path_get_index(path));
480 s = format (s, "pl-index:%d ", path->fp_pl_index);
481 s = format (s, "%U ", format_dpo_proto, path->fp_nh_proto);
482 s = format (s, "weight=%d ", path->fp_weight);
483 s = format (s, "pref=%d ", path->fp_preference);
484 s = format (s, "%s: ", fib_path_type_names[path->fp_type]);
485 if (FIB_PATH_OPER_FLAG_NONE != path->fp_oper_flags) {
486 s = format(s, " oper-flags:");
487 FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(oattr) {
488 if ((1<<oattr) & path->fp_oper_flags) {
489 s = format (s, "%s,", fib_path_oper_attribute_names[oattr]);
493 if (FIB_PATH_CFG_FLAG_NONE != path->fp_cfg_flags) {
494 s = format(s, " cfg-flags:");
495 FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(cattr) {
496 if ((1<<cattr) & path->fp_cfg_flags) {
497 s = format (s, "%s,", fib_path_cfg_attribute_names[cattr]);
501 if (!(flags & FIB_PATH_FORMAT_FLAGS_ONE_LINE))
502 s = format(s, "\n%U", format_white_space, indent+2);
504 switch (path->fp_type)
506 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
507 s = format (s, "%U", format_ip46_address,
508 &path->attached_next_hop.fp_nh,
510 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
512 s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
516 s = format (s, " %U",
517 format_vnet_sw_interface_name,
519 vnet_get_sw_interface(
521 path->attached_next_hop.fp_interface));
522 if (vnet_sw_interface_is_p2p(vnet_get_main(),
523 path->attached_next_hop.fp_interface))
525 s = format (s, " (p2p)");
528 if (!dpo_id_is_valid(&path->fp_dpo))
530 s = format(s, "%s%Uunresolved", eol, format_white_space, indent+2);
534 s = format(s, "%s%U%U", eol,
535 format_white_space, indent,
540 case FIB_PATH_TYPE_ATTACHED:
541 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
543 s = format (s, "if_index:%d", path->attached_next_hop.fp_interface);
547 s = format (s, " %U",
548 format_vnet_sw_interface_name,
550 vnet_get_sw_interface(
552 path->attached.fp_interface));
555 case FIB_PATH_TYPE_RECURSIVE:
556 if (DPO_PROTO_MPLS == path->fp_nh_proto)
558 s = format (s, "via %U %U",
559 format_mpls_unicast_label,
560 path->recursive.fp_nh.fp_local_label,
562 path->recursive.fp_nh.fp_eos);
566 s = format (s, "via %U",
568 &path->recursive.fp_nh.fp_ip,
571 s = format (s, " in fib:%d",
572 path->recursive.fp_tbl_id,
574 s = format (s, " via-fib:%d", path->fp_via_fib);
575 s = format (s, " via-dpo:[%U:%d]",
576 format_dpo_type, path->fp_dpo.dpoi_type,
577 path->fp_dpo.dpoi_index);
580 case FIB_PATH_TYPE_UDP_ENCAP:
581 s = format (s, "UDP-encap ID:%d", path->udp_encap.fp_udp_encap_id);
583 case FIB_PATH_TYPE_BIER_TABLE:
584 s = format (s, "via bier-table:[%U}",
585 format_bier_table_id,
586 &path->bier_table.fp_bier_tbl);
587 s = format (s, " via-dpo:[%U:%d]",
588 format_dpo_type, path->fp_dpo.dpoi_type,
589 path->fp_dpo.dpoi_index);
591 case FIB_PATH_TYPE_BIER_FMASK:
592 s = format (s, "via-fmask:%d", path->bier_fmask.fp_bier_fmask);
593 s = format (s, " via-dpo:[%U:%d]",
594 format_dpo_type, path->fp_dpo.dpoi_type,
595 path->fp_dpo.dpoi_index);
597 case FIB_PATH_TYPE_BIER_IMP:
598 s = format (s, "via %U", format_bier_imp,
599 path->bier_imp.fp_bier_imp, 0, BIER_SHOW_BRIEF);
601 case FIB_PATH_TYPE_DVR:
602 s = format (s, " %U",
603 format_vnet_sw_interface_name,
605 vnet_get_sw_interface(
607 path->dvr.fp_interface));
609 case FIB_PATH_TYPE_DEAG:
610 s = format (s, " %sfib-index:%d",
611 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ? "m" : ""),
612 path->deag.fp_tbl_id);
614 case FIB_PATH_TYPE_RECEIVE:
615 case FIB_PATH_TYPE_INTF_RX:
616 case FIB_PATH_TYPE_SPECIAL:
617 case FIB_PATH_TYPE_EXCLUSIVE:
618 if (dpo_id_is_valid(&path->fp_dpo))
620 s = format(s, "%U", format_dpo_id,
621 &path->fp_dpo, indent+2);
629 * fib_path_last_lock_gone
631 * We don't share paths, we share path lists, so the [un]lock functions
635 fib_path_last_lock_gone (fib_node_t *node)
640 static const adj_index_t
641 fib_path_attached_next_hop_get_adj (fib_path_t *path,
644 if (vnet_sw_interface_is_p2p(vnet_get_main(),
645 path->attached_next_hop.fp_interface))
648 * if the interface is p2p then the adj for the specific
649 * neighbour on that link will never exist. on p2p links
650 * the subnet address (the attached route) links to the
651 * auto-adj (see below), we want that adj here too.
653 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
656 path->attached_next_hop.fp_interface));
660 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
662 &path->attached_next_hop.fp_nh,
663 path->attached_next_hop.fp_interface));
668 fib_path_attached_next_hop_set (fib_path_t *path)
671 * resolve directly via the adjacnecy discribed by the
672 * interface and next-hop
674 dpo_set(&path->fp_dpo,
677 fib_path_attached_next_hop_get_adj(
679 dpo_proto_to_link(path->fp_nh_proto)));
682 * become a child of the adjacency so we receive updates
683 * when its rewrite changes
685 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
687 fib_path_get_index(path));
689 if (!vnet_sw_interface_is_up(vnet_get_main(),
690 path->attached_next_hop.fp_interface) ||
691 !adj_is_up(path->fp_dpo.dpoi_index))
693 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
697 static const adj_index_t
698 fib_path_attached_get_adj (fib_path_t *path,
701 if (vnet_sw_interface_is_p2p(vnet_get_main(),
702 path->attached.fp_interface))
705 * point-2-point interfaces do not require a glean, since
706 * there is nothing to ARP. Install a rewrite/nbr adj instead
708 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
711 path->attached.fp_interface));
715 return (adj_glean_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
717 path->attached.fp_interface,
723 * create of update the paths recursive adj
726 fib_path_recursive_adj_update (fib_path_t *path,
727 fib_forward_chain_type_t fct,
730 dpo_id_t via_dpo = DPO_INVALID;
733 * get the DPO to resolve through from the via-entry
735 fib_entry_contribute_forwarding(path->fp_via_fib,
741 * hope for the best - clear if restrictions apply.
743 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
746 * Validate any recursion constraints and over-ride the via
749 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP)
751 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
752 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
754 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)
757 * the via FIB must be a host route.
758 * note the via FIB just added will always be a host route
759 * since it is an RR source added host route. So what we need to
760 * check is whether the route has other sources. If it does then
761 * some other source has added it as a host route. If it doesn't
762 * then it was added only here and inherits forwarding from a cover.
763 * the cover is not a host route.
764 * The RR source is the lowest priority source, so we check if it
765 * is the best. if it is there are no other sources.
767 if (fib_entry_get_best_source(path->fp_via_fib) >= FIB_SOURCE_RR)
769 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
770 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
773 * PIC edge trigger. let the load-balance maps know
775 load_balance_map_path_state_change(fib_path_get_index(path));
778 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED)
781 * RR source entries inherit the flags from the cover, so
782 * we can check the via directly
784 if (!(FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags(path->fp_via_fib)))
786 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
787 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
790 * PIC edge trigger. let the load-balance maps know
792 load_balance_map_path_state_change(fib_path_get_index(path));
796 * check for over-riding factors on the FIB entry itself
798 if (!fib_entry_is_resolved(path->fp_via_fib))
800 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
801 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
804 * PIC edge trigger. let the load-balance maps know
806 load_balance_map_path_state_change(fib_path_get_index(path));
810 * If this path is contributing a drop, then it's not resolved
812 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
814 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
818 * update the path's contributed DPO
820 dpo_copy(dpo, &via_dpo);
822 FIB_PATH_DBG(path, "recursive update:");
828 * re-evaulate the forwarding state for a via fmask path
831 fib_path_bier_fmask_update (fib_path_t *path,
834 bier_fmask_contribute_forwarding(path->bier_fmask.fp_bier_fmask, dpo);
837 * if we are stakcing on the drop, then the path is not resolved
839 if (dpo_is_drop(dpo))
841 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
845 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
850 * fib_path_is_permanent_drop
852 * Return !0 if the path is configured to permanently drop,
853 * despite other attributes.
856 fib_path_is_permanent_drop (fib_path_t *path)
858 return ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP) ||
859 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP));
865 * Remove our dependency on the resolution target
868 fib_path_unresolve (fib_path_t *path)
871 * the forced drop path does not need unresolving
873 if (fib_path_is_permanent_drop(path))
878 switch (path->fp_type)
880 case FIB_PATH_TYPE_RECURSIVE:
881 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
883 fib_entry_child_remove(path->fp_via_fib,
885 fib_table_entry_special_remove(path->recursive.fp_tbl_id,
886 fib_entry_get_prefix(path->fp_via_fib),
888 fib_table_unlock(path->recursive.fp_tbl_id,
889 dpo_proto_to_fib(path->fp_nh_proto),
891 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
894 case FIB_PATH_TYPE_BIER_FMASK:
895 bier_fmask_child_remove(path->fp_via_bier_fmask,
898 case FIB_PATH_TYPE_BIER_IMP:
899 bier_imp_unlock(path->fp_dpo.dpoi_index);
901 case FIB_PATH_TYPE_BIER_TABLE:
902 bier_table_ecmp_unlock(path->fp_via_bier_tbl);
904 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
905 adj_child_remove(path->fp_dpo.dpoi_index,
907 adj_unlock(path->fp_dpo.dpoi_index);
909 case FIB_PATH_TYPE_ATTACHED:
910 adj_child_remove(path->fp_dpo.dpoi_index,
912 adj_unlock(path->fp_dpo.dpoi_index);
914 case FIB_PATH_TYPE_UDP_ENCAP:
915 udp_encap_unlock(path->fp_dpo.dpoi_index);
917 case FIB_PATH_TYPE_EXCLUSIVE:
918 dpo_reset(&path->exclusive.fp_ex_dpo);
920 case FIB_PATH_TYPE_SPECIAL:
921 case FIB_PATH_TYPE_RECEIVE:
922 case FIB_PATH_TYPE_INTF_RX:
923 case FIB_PATH_TYPE_DEAG:
924 case FIB_PATH_TYPE_DVR:
926 * these hold only the path's DPO, which is reset below.
932 * release the adj we were holding and pick up the
935 dpo_reset(&path->fp_dpo);
936 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
941 static fib_forward_chain_type_t
942 fib_path_to_chain_type (const fib_path_t *path)
944 if (DPO_PROTO_MPLS == path->fp_nh_proto)
946 if (FIB_PATH_TYPE_RECURSIVE == path->fp_type &&
947 MPLS_EOS == path->recursive.fp_nh.fp_eos)
949 return (FIB_FORW_CHAIN_TYPE_MPLS_EOS);
953 return (FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS);
958 return (fib_forw_chain_type_from_dpo_proto(path->fp_nh_proto));
963 * fib_path_back_walk_notify
965 * A back walk has reach this path.
967 static fib_node_back_walk_rc_t
968 fib_path_back_walk_notify (fib_node_t *node,
969 fib_node_back_walk_ctx_t *ctx)
973 path = fib_path_from_fib_node(node);
975 FIB_PATH_DBG(path, "bw:%U",
976 format_fib_node_bw_reason, ctx->fnbw_reason);
978 switch (path->fp_type)
980 case FIB_PATH_TYPE_RECURSIVE:
981 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
984 * modify the recursive adjacency to use the new forwarding
986 * this update is visible to packets in flight in the DP.
988 fib_path_recursive_adj_update(
990 fib_path_to_chain_type(path),
993 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
994 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
997 * ADJ updates (complete<->incomplete) do not need to propagate to
999 * The only reason its needed as far back as here, is that the adj
1000 * and the incomplete adj are a different DPO type, so the LBs need
1002 * If this walk was quashed in the fib_entry, then any non-fib_path
1003 * children (like tunnels that collapse out the LB when they stack)
1004 * would not see the update.
1006 return (FIB_NODE_BACK_WALK_CONTINUE);
1009 case FIB_PATH_TYPE_BIER_FMASK:
1010 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
1013 * update to use the BIER fmask's new forwading
1015 fib_path_bier_fmask_update(path, &path->fp_dpo);
1017 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
1018 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
1021 * ADJ updates (complete<->incomplete) do not need to propagate to
1022 * recursive entries.
1023 * The only reason its needed as far back as here, is that the adj
1024 * and the incomplete adj are a different DPO type, so the LBs need
1026 * If this walk was quashed in the fib_entry, then any non-fib_path
1027 * children (like tunnels that collapse out the LB when they stack)
1028 * would not see the update.
1030 return (FIB_NODE_BACK_WALK_CONTINUE);
1033 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1036 * ADJ_UPDATE backwalk pass silently through here and up to
1037 * the path-list when the multipath adj collapse occurs.
1038 * The reason we do this is that the assumtption is that VPP
1039 * runs in an environment where the Control-Plane is remote
1040 * and hence reacts slowly to link up down. In order to remove
1041 * this down link from the ECMP set quickly, we back-walk.
1042 * VPP also has dedicated CPUs, so we are not stealing resources
1043 * from the CP to do so.
1045 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1047 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED)
1050 * alreday resolved. no need to walk back again
1052 return (FIB_NODE_BACK_WALK_CONTINUE);
1054 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1056 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1058 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1061 * alreday unresolved. no need to walk back again
1063 return (FIB_NODE_BACK_WALK_CONTINUE);
1065 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1067 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1070 * The interface this path resolves through has been deleted.
1071 * This will leave the path in a permanent drop state. The route
1072 * needs to be removed and readded (and hence the path-list deleted)
1073 * before it can forward again.
1075 fib_path_unresolve(path);
1076 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1078 if (FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason)
1081 * restack the DPO to pick up the correct DPO sub-type
1086 if_is_up = vnet_sw_interface_is_up(
1088 path->attached_next_hop.fp_interface);
1090 ai = fib_path_attached_next_hop_get_adj(
1092 dpo_proto_to_link(path->fp_nh_proto));
1094 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1095 if (if_is_up && adj_is_up(ai))
1097 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1100 dpo_set(&path->fp_dpo, DPO_ADJACENCY, path->fp_nh_proto, ai);
1106 * If the interface is not up there is no reason to walk
1107 * back to children. if we did they would only evalute
1108 * that this path is unresolved and hence it would
1109 * not contribute the adjacency - so it would be wasted
1112 return (FIB_NODE_BACK_WALK_CONTINUE);
1115 if (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason)
1117 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1120 * alreday unresolved. no need to walk back again
1122 return (FIB_NODE_BACK_WALK_CONTINUE);
1125 * the adj has gone down. the path is no longer resolved.
1127 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1130 case FIB_PATH_TYPE_ATTACHED:
1131 case FIB_PATH_TYPE_DVR:
1133 * FIXME; this could schedule a lower priority walk, since attached
1134 * routes are not usually in ECMP configurations so the backwalk to
1135 * the FIB entry does not need to be high priority
1137 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1139 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1141 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1143 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1145 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1147 fib_path_unresolve(path);
1148 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1151 case FIB_PATH_TYPE_UDP_ENCAP:
1153 dpo_id_t via_dpo = DPO_INVALID;
1156 * hope for the best - clear if restrictions apply.
1158 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1160 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
1164 * If this path is contributing a drop, then it's not resolved
1166 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
1168 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1172 * update the path's contributed DPO
1174 dpo_copy(&path->fp_dpo, &via_dpo);
1175 dpo_reset(&via_dpo);
1178 case FIB_PATH_TYPE_INTF_RX:
1180 case FIB_PATH_TYPE_DEAG:
1182 * FIXME When VRF delete is allowed this will need a poke.
1184 case FIB_PATH_TYPE_SPECIAL:
1185 case FIB_PATH_TYPE_RECEIVE:
1186 case FIB_PATH_TYPE_EXCLUSIVE:
1187 case FIB_PATH_TYPE_BIER_TABLE:
1188 case FIB_PATH_TYPE_BIER_IMP:
1190 * these path types have no parents. so to be
1191 * walked from one is unexpected.
1198 * propagate the backwalk further to the path-list
1200 fib_path_list_back_walk(path->fp_pl_index, ctx);
1202 return (FIB_NODE_BACK_WALK_CONTINUE);
1206 fib_path_memory_show (void)
1208 fib_show_memory_usage("Path",
1209 pool_elts(fib_path_pool),
1210 pool_len(fib_path_pool),
1211 sizeof(fib_path_t));
1215 * The FIB path's graph node virtual function table
1217 static const fib_node_vft_t fib_path_vft = {
1218 .fnv_get = fib_path_get_node,
1219 .fnv_last_lock = fib_path_last_lock_gone,
1220 .fnv_back_walk = fib_path_back_walk_notify,
1221 .fnv_mem_show = fib_path_memory_show,
1224 static fib_path_cfg_flags_t
1225 fib_path_route_flags_to_cfg_flags (const fib_route_path_t *rpath)
1227 fib_path_cfg_flags_t cfg_flags = FIB_PATH_CFG_FLAG_NONE;
1229 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_HOST)
1230 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_HOST;
1231 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_ATTACHED)
1232 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED;
1233 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1234 cfg_flags |= FIB_PATH_CFG_FLAG_LOCAL;
1235 if (rpath->frp_flags & FIB_ROUTE_PATH_ATTACHED)
1236 cfg_flags |= FIB_PATH_CFG_FLAG_ATTACHED;
1237 if (rpath->frp_flags & FIB_ROUTE_PATH_INTF_RX)
1238 cfg_flags |= FIB_PATH_CFG_FLAG_INTF_RX;
1239 if (rpath->frp_flags & FIB_ROUTE_PATH_RPF_ID)
1240 cfg_flags |= FIB_PATH_CFG_FLAG_RPF_ID;
1241 if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1242 cfg_flags |= FIB_PATH_CFG_FLAG_EXCLUSIVE;
1243 if (rpath->frp_flags & FIB_ROUTE_PATH_DROP)
1244 cfg_flags |= FIB_PATH_CFG_FLAG_DROP;
1245 if (rpath->frp_flags & FIB_ROUTE_PATH_SOURCE_LOOKUP)
1246 cfg_flags |= FIB_PATH_CFG_FLAG_DEAG_SRC;
1254 * Create and initialise a new path object.
1255 * return the index of the path.
1258 fib_path_create (fib_node_index_t pl_index,
1259 const fib_route_path_t *rpath)
1263 pool_get(fib_path_pool, path);
1264 clib_memset(path, 0, sizeof(*path));
1266 fib_node_init(&path->fp_node,
1267 FIB_NODE_TYPE_PATH);
1269 dpo_reset(&path->fp_dpo);
1270 path->fp_pl_index = pl_index;
1271 path->fp_nh_proto = rpath->frp_proto;
1272 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1273 path->fp_weight = rpath->frp_weight;
1274 if (0 == path->fp_weight)
1277 * a weight of 0 is a meaningless value. We could either reject it, and thus force
1278 * clients to always use 1, or we can accept it and fixup approrpiately.
1280 path->fp_weight = 1;
1282 path->fp_preference = rpath->frp_preference;
1283 path->fp_cfg_flags = fib_path_route_flags_to_cfg_flags(rpath);
1286 * deduce the path's tpye from the parementers and save what is needed.
1288 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_LOCAL)
1290 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1291 path->receive.fp_interface = rpath->frp_sw_if_index;
1292 path->receive.fp_addr = rpath->frp_addr;
1294 else if (rpath->frp_flags & FIB_ROUTE_PATH_UDP_ENCAP)
1296 path->fp_type = FIB_PATH_TYPE_UDP_ENCAP;
1297 path->udp_encap.fp_udp_encap_id = rpath->frp_udp_encap_id;
1299 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_INTF_RX)
1301 path->fp_type = FIB_PATH_TYPE_INTF_RX;
1302 path->intf_rx.fp_interface = rpath->frp_sw_if_index;
1304 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
1306 path->fp_type = FIB_PATH_TYPE_DEAG;
1307 path->deag.fp_tbl_id = rpath->frp_fib_index;
1308 path->deag.fp_rpf_id = rpath->frp_rpf_id;
1310 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_FMASK)
1312 path->fp_type = FIB_PATH_TYPE_BIER_FMASK;
1313 path->bier_fmask.fp_bier_fmask = rpath->frp_bier_fmask;
1315 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_IMP)
1317 path->fp_type = FIB_PATH_TYPE_BIER_IMP;
1318 path->bier_imp.fp_bier_imp = rpath->frp_bier_imp;
1320 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_TABLE)
1322 path->fp_type = FIB_PATH_TYPE_BIER_TABLE;
1323 path->bier_table.fp_bier_tbl = rpath->frp_bier_tbl;
1325 else if (rpath->frp_flags & FIB_ROUTE_PATH_DEAG)
1327 path->fp_type = FIB_PATH_TYPE_DEAG;
1328 path->deag.fp_tbl_id = rpath->frp_fib_index;
1330 else if (rpath->frp_flags & FIB_ROUTE_PATH_DVR)
1332 path->fp_type = FIB_PATH_TYPE_DVR;
1333 path->dvr.fp_interface = rpath->frp_sw_if_index;
1335 else if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1337 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1338 dpo_copy(&path->exclusive.fp_ex_dpo, &rpath->dpo);
1340 else if (~0 != rpath->frp_sw_if_index)
1342 if (ip46_address_is_zero(&rpath->frp_addr))
1344 path->fp_type = FIB_PATH_TYPE_ATTACHED;
1345 path->attached.fp_interface = rpath->frp_sw_if_index;
1349 path->fp_type = FIB_PATH_TYPE_ATTACHED_NEXT_HOP;
1350 path->attached_next_hop.fp_interface = rpath->frp_sw_if_index;
1351 path->attached_next_hop.fp_nh = rpath->frp_addr;
1356 if (ip46_address_is_zero(&rpath->frp_addr))
1358 if (~0 == rpath->frp_fib_index)
1360 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1364 path->fp_type = FIB_PATH_TYPE_DEAG;
1365 path->deag.fp_tbl_id = rpath->frp_fib_index;
1366 path->deag.fp_rpf_id = ~0;
1371 path->fp_type = FIB_PATH_TYPE_RECURSIVE;
1372 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1374 path->recursive.fp_nh.fp_local_label = rpath->frp_local_label;
1375 path->recursive.fp_nh.fp_eos = rpath->frp_eos;
1379 path->recursive.fp_nh.fp_ip = rpath->frp_addr;
1381 path->recursive.fp_tbl_id = rpath->frp_fib_index;
1385 FIB_PATH_DBG(path, "create");
1387 return (fib_path_get_index(path));
1391 * fib_path_create_special
1393 * Create and initialise a new path object.
1394 * return the index of the path.
1397 fib_path_create_special (fib_node_index_t pl_index,
1398 dpo_proto_t nh_proto,
1399 fib_path_cfg_flags_t flags,
1400 const dpo_id_t *dpo)
1404 pool_get(fib_path_pool, path);
1405 clib_memset(path, 0, sizeof(*path));
1407 fib_node_init(&path->fp_node,
1408 FIB_NODE_TYPE_PATH);
1409 dpo_reset(&path->fp_dpo);
1411 path->fp_pl_index = pl_index;
1412 path->fp_weight = 1;
1413 path->fp_preference = 0;
1414 path->fp_nh_proto = nh_proto;
1415 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1416 path->fp_cfg_flags = flags;
1418 if (FIB_PATH_CFG_FLAG_DROP & flags)
1420 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1422 else if (FIB_PATH_CFG_FLAG_LOCAL & flags)
1424 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1425 path->attached.fp_interface = FIB_NODE_INDEX_INVALID;
1429 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1430 ASSERT(NULL != dpo);
1431 dpo_copy(&path->exclusive.fp_ex_dpo, dpo);
1434 return (fib_path_get_index(path));
1440 * Copy a path. return index of new path.
1443 fib_path_copy (fib_node_index_t path_index,
1444 fib_node_index_t path_list_index)
1446 fib_path_t *path, *orig_path;
1448 pool_get(fib_path_pool, path);
1450 orig_path = fib_path_get(path_index);
1451 ASSERT(NULL != orig_path);
1453 memcpy(path, orig_path, sizeof(*path));
1455 FIB_PATH_DBG(path, "create-copy:%d", path_index);
1458 * reset the dynamic section
1460 fib_node_init(&path->fp_node, FIB_NODE_TYPE_PATH);
1461 path->fp_oper_flags = FIB_PATH_OPER_FLAG_NONE;
1462 path->fp_pl_index = path_list_index;
1463 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1464 clib_memset(&path->fp_dpo, 0, sizeof(path->fp_dpo));
1465 dpo_reset(&path->fp_dpo);
1467 return (fib_path_get_index(path));
1473 * destroy a path that is no longer required
1476 fib_path_destroy (fib_node_index_t path_index)
1480 path = fib_path_get(path_index);
1482 ASSERT(NULL != path);
1483 FIB_PATH_DBG(path, "destroy");
1485 fib_path_unresolve(path);
1487 fib_node_deinit(&path->fp_node);
1488 pool_put(fib_path_pool, path);
1494 * destroy a path that is no longer required
1497 fib_path_hash (fib_node_index_t path_index)
1501 path = fib_path_get(path_index);
1503 return (hash_memory(STRUCT_MARK_PTR(path, path_hash_start),
1504 (STRUCT_OFFSET_OF(fib_path_t, path_hash_end) -
1505 STRUCT_OFFSET_OF(fib_path_t, path_hash_start)),
1512 * Compare two paths for equivalence.
1515 fib_path_cmp_i (const fib_path_t *path1,
1516 const fib_path_t *path2)
1523 * paths of different types and protocol are not equal.
1524 * different weights and/or preference only are the same path.
1526 if (path1->fp_type != path2->fp_type)
1528 res = (path1->fp_type - path2->fp_type);
1530 else if (path1->fp_nh_proto != path2->fp_nh_proto)
1532 res = (path1->fp_nh_proto - path2->fp_nh_proto);
1537 * both paths are of the same type.
1538 * consider each type and its attributes in turn.
1540 switch (path1->fp_type)
1542 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1543 res = ip46_address_cmp(&path1->attached_next_hop.fp_nh,
1544 &path2->attached_next_hop.fp_nh);
1546 res = (path1->attached_next_hop.fp_interface -
1547 path2->attached_next_hop.fp_interface);
1550 case FIB_PATH_TYPE_ATTACHED:
1551 res = (path1->attached.fp_interface -
1552 path2->attached.fp_interface);
1554 case FIB_PATH_TYPE_RECURSIVE:
1555 res = ip46_address_cmp(&path1->recursive.fp_nh,
1556 &path2->recursive.fp_nh);
1560 res = (path1->recursive.fp_tbl_id - path2->recursive.fp_tbl_id);
1563 case FIB_PATH_TYPE_BIER_FMASK:
1564 res = (path1->bier_fmask.fp_bier_fmask -
1565 path2->bier_fmask.fp_bier_fmask);
1567 case FIB_PATH_TYPE_BIER_IMP:
1568 res = (path1->bier_imp.fp_bier_imp -
1569 path2->bier_imp.fp_bier_imp);
1571 case FIB_PATH_TYPE_BIER_TABLE:
1572 res = bier_table_id_cmp(&path1->bier_table.fp_bier_tbl,
1573 &path2->bier_table.fp_bier_tbl);
1575 case FIB_PATH_TYPE_DEAG:
1576 res = (path1->deag.fp_tbl_id - path2->deag.fp_tbl_id);
1579 res = (path1->deag.fp_rpf_id - path2->deag.fp_rpf_id);
1582 case FIB_PATH_TYPE_INTF_RX:
1583 res = (path1->intf_rx.fp_interface - path2->intf_rx.fp_interface);
1585 case FIB_PATH_TYPE_UDP_ENCAP:
1586 res = (path1->udp_encap.fp_udp_encap_id - path2->udp_encap.fp_udp_encap_id);
1588 case FIB_PATH_TYPE_DVR:
1589 res = (path1->dvr.fp_interface - path2->dvr.fp_interface);
1591 case FIB_PATH_TYPE_EXCLUSIVE:
1592 res = dpo_cmp(&path1->exclusive.fp_ex_dpo, &path2->exclusive.fp_ex_dpo);
1594 case FIB_PATH_TYPE_SPECIAL:
1595 case FIB_PATH_TYPE_RECEIVE:
1604 * fib_path_cmp_for_sort
1606 * Compare two paths for equivalence. Used during path sorting.
1607 * As usual 0 means equal.
1610 fib_path_cmp_for_sort (void * v1,
1613 fib_node_index_t *pi1 = v1, *pi2 = v2;
1614 fib_path_t *path1, *path2;
1616 path1 = fib_path_get(*pi1);
1617 path2 = fib_path_get(*pi2);
1620 * when sorting paths we want the highest preference paths
1621 * first, so that the choices set built is in prefernce order
1623 if (path1->fp_preference != path2->fp_preference)
1625 return (path1->fp_preference - path2->fp_preference);
1628 return (fib_path_cmp_i(path1, path2));
1634 * Compare two paths for equivalence.
1637 fib_path_cmp (fib_node_index_t pi1,
1638 fib_node_index_t pi2)
1640 fib_path_t *path1, *path2;
1642 path1 = fib_path_get(pi1);
1643 path2 = fib_path_get(pi2);
1645 return (fib_path_cmp_i(path1, path2));
1649 fib_path_cmp_w_route_path (fib_node_index_t path_index,
1650 const fib_route_path_t *rpath)
1655 path = fib_path_get(path_index);
1659 if (path->fp_weight != rpath->frp_weight)
1661 res = (path->fp_weight - rpath->frp_weight);
1666 * both paths are of the same type.
1667 * consider each type and its attributes in turn.
1669 switch (path->fp_type)
1671 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1672 res = ip46_address_cmp(&path->attached_next_hop.fp_nh,
1676 res = (path->attached_next_hop.fp_interface -
1677 rpath->frp_sw_if_index);
1680 case FIB_PATH_TYPE_ATTACHED:
1681 res = (path->attached.fp_interface - rpath->frp_sw_if_index);
1683 case FIB_PATH_TYPE_RECURSIVE:
1684 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1686 res = path->recursive.fp_nh.fp_local_label - rpath->frp_local_label;
1690 res = path->recursive.fp_nh.fp_eos - rpath->frp_eos;
1695 res = ip46_address_cmp(&path->recursive.fp_nh.fp_ip,
1701 res = (path->recursive.fp_tbl_id - rpath->frp_fib_index);
1704 case FIB_PATH_TYPE_BIER_FMASK:
1705 res = (path->bier_fmask.fp_bier_fmask - rpath->frp_bier_fmask);
1707 case FIB_PATH_TYPE_BIER_IMP:
1708 res = (path->bier_imp.fp_bier_imp - rpath->frp_bier_imp);
1710 case FIB_PATH_TYPE_BIER_TABLE:
1711 res = bier_table_id_cmp(&path->bier_table.fp_bier_tbl,
1712 &rpath->frp_bier_tbl);
1714 case FIB_PATH_TYPE_INTF_RX:
1715 res = (path->intf_rx.fp_interface - rpath->frp_sw_if_index);
1717 case FIB_PATH_TYPE_UDP_ENCAP:
1718 res = (path->udp_encap.fp_udp_encap_id - rpath->frp_udp_encap_id);
1720 case FIB_PATH_TYPE_DEAG:
1721 res = (path->deag.fp_tbl_id - rpath->frp_fib_index);
1724 res = (path->deag.fp_rpf_id - rpath->frp_rpf_id);
1727 case FIB_PATH_TYPE_DVR:
1728 res = (path->dvr.fp_interface - rpath->frp_sw_if_index);
1730 case FIB_PATH_TYPE_EXCLUSIVE:
1731 res = dpo_cmp(&path->exclusive.fp_ex_dpo, &rpath->dpo);
1733 case FIB_PATH_TYPE_SPECIAL:
1734 case FIB_PATH_TYPE_RECEIVE:
1743 * fib_path_recursive_loop_detect
1745 * A forward walk of the FIB object graph to detect for a cycle/loop. This
1746 * walk is initiated when an entry is linking to a new path list or from an old.
1747 * The entry vector passed contains all the FIB entrys that are children of this
1748 * path (it is all the entries encountered on the walk so far). If this vector
1749 * contains the entry this path resolve via, then a loop is about to form.
1750 * The loop must be allowed to form, since we need the dependencies in place
1751 * so that we can track when the loop breaks.
1752 * However, we MUST not produce a loop in the forwarding graph (else packets
1753 * would loop around the switch path until the loop breaks), so we mark recursive
1754 * paths as looped so that they do not contribute forwarding information.
1755 * By marking the path as looped, an etry such as;
1757 * via a.a.a.a (looped)
1758 * via b.b.b.b (not looped)
1759 * can still forward using the info provided by b.b.b.b only
1762 fib_path_recursive_loop_detect (fib_node_index_t path_index,
1763 fib_node_index_t **entry_indicies)
1767 path = fib_path_get(path_index);
1770 * the forced drop path is never looped, cos it is never resolved.
1772 if (fib_path_is_permanent_drop(path))
1777 switch (path->fp_type)
1779 case FIB_PATH_TYPE_RECURSIVE:
1781 fib_node_index_t *entry_index, *entries;
1783 entries = *entry_indicies;
1785 vec_foreach(entry_index, entries) {
1786 if (*entry_index == path->fp_via_fib)
1789 * the entry that is about to link to this path-list (or
1790 * one of this path-list's children) is the same entry that
1791 * this recursive path resolves through. this is a cycle.
1801 FIB_PATH_DBG(path, "recursive loop formed");
1802 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1804 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1809 * no loop here yet. keep forward walking the graph.
1811 if (fib_entry_recursive_loop_detect(path->fp_via_fib, entry_indicies))
1813 FIB_PATH_DBG(path, "recursive loop formed");
1814 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1818 FIB_PATH_DBG(path, "recursive loop cleared");
1819 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1824 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1825 case FIB_PATH_TYPE_ATTACHED:
1826 if (adj_recursive_loop_detect(path->fp_dpo.dpoi_index,
1829 FIB_PATH_DBG(path, "recursive loop formed");
1830 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1834 FIB_PATH_DBG(path, "recursive loop cleared");
1835 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1838 case FIB_PATH_TYPE_SPECIAL:
1839 case FIB_PATH_TYPE_DEAG:
1840 case FIB_PATH_TYPE_DVR:
1841 case FIB_PATH_TYPE_RECEIVE:
1842 case FIB_PATH_TYPE_INTF_RX:
1843 case FIB_PATH_TYPE_UDP_ENCAP:
1844 case FIB_PATH_TYPE_EXCLUSIVE:
1845 case FIB_PATH_TYPE_BIER_FMASK:
1846 case FIB_PATH_TYPE_BIER_TABLE:
1847 case FIB_PATH_TYPE_BIER_IMP:
1849 * these path types cannot be part of a loop, since they are the leaves
1855 return (fib_path_is_looped(path_index));
1859 fib_path_resolve (fib_node_index_t path_index)
1863 path = fib_path_get(path_index);
1866 * hope for the best.
1868 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1871 * the forced drop path resolves via the drop adj
1873 if (fib_path_is_permanent_drop(path))
1875 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1876 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1877 return (fib_path_is_resolved(path_index));
1880 switch (path->fp_type)
1882 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1883 fib_path_attached_next_hop_set(path);
1885 case FIB_PATH_TYPE_ATTACHED:
1887 * path->attached.fp_interface
1889 if (!vnet_sw_interface_is_up(vnet_get_main(),
1890 path->attached.fp_interface))
1892 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1894 dpo_set(&path->fp_dpo,
1897 fib_path_attached_get_adj(path,
1898 dpo_proto_to_link(path->fp_nh_proto)));
1901 * become a child of the adjacency so we receive updates
1902 * when the interface state changes
1904 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
1906 fib_path_get_index(path));
1908 case FIB_PATH_TYPE_RECURSIVE:
1911 * Create a RR source entry in the table for the address
1912 * that this path recurses through.
1913 * This resolve action is recursive, hence we may create
1914 * more paths in the process. more creates mean maybe realloc
1917 fib_node_index_t fei;
1920 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_fib);
1922 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1924 fib_prefix_from_mpls_label(path->recursive.fp_nh.fp_local_label,
1925 path->recursive.fp_nh.fp_eos,
1930 fib_prefix_from_ip46_addr(&path->recursive.fp_nh.fp_ip, &pfx);
1933 fib_table_lock(path->recursive.fp_tbl_id,
1934 dpo_proto_to_fib(path->fp_nh_proto),
1936 fei = fib_table_entry_special_add(path->recursive.fp_tbl_id,
1939 FIB_ENTRY_FLAG_NONE);
1941 path = fib_path_get(path_index);
1942 path->fp_via_fib = fei;
1945 * become a dependent child of the entry so the path is
1946 * informed when the forwarding for the entry changes.
1948 path->fp_sibling = fib_entry_child_add(path->fp_via_fib,
1950 fib_path_get_index(path));
1953 * create and configure the IP DPO
1955 fib_path_recursive_adj_update(
1957 fib_path_to_chain_type(path),
1962 case FIB_PATH_TYPE_BIER_FMASK:
1965 * become a dependent child of the entry so the path is
1966 * informed when the forwarding for the entry changes.
1968 path->fp_sibling = bier_fmask_child_add(path->bier_fmask.fp_bier_fmask,
1970 fib_path_get_index(path));
1972 path->fp_via_bier_fmask = path->bier_fmask.fp_bier_fmask;
1973 fib_path_bier_fmask_update(path, &path->fp_dpo);
1977 case FIB_PATH_TYPE_BIER_IMP:
1978 bier_imp_lock(path->bier_imp.fp_bier_imp);
1979 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
1983 case FIB_PATH_TYPE_BIER_TABLE:
1986 * Find/create the BIER table to link to
1988 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_bier_tbl);
1990 path->fp_via_bier_tbl =
1991 bier_table_ecmp_create_and_lock(&path->bier_table.fp_bier_tbl);
1993 bier_table_contribute_forwarding(path->fp_via_bier_tbl,
1997 case FIB_PATH_TYPE_SPECIAL:
1999 * Resolve via the drop
2001 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
2003 case FIB_PATH_TYPE_DEAG:
2005 if (DPO_PROTO_BIER == path->fp_nh_proto)
2007 bier_disp_table_contribute_forwarding(path->deag.fp_tbl_id,
2013 * Resolve via a lookup DPO.
2014 * FIXME. control plane should add routes with a table ID
2016 lookup_input_t input;
2019 cast = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ?
2022 input = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DEAG_SRC ?
2023 LOOKUP_INPUT_SRC_ADDR :
2024 LOOKUP_INPUT_DST_ADDR);
2026 lookup_dpo_add_or_lock_w_fib_index(path->deag.fp_tbl_id,
2030 LOOKUP_TABLE_FROM_CONFIG,
2035 case FIB_PATH_TYPE_DVR:
2036 dvr_dpo_add_or_lock(path->attached.fp_interface,
2040 case FIB_PATH_TYPE_RECEIVE:
2042 * Resolve via a receive DPO.
2044 receive_dpo_add_or_lock(path->fp_nh_proto,
2045 path->receive.fp_interface,
2046 &path->receive.fp_addr,
2049 case FIB_PATH_TYPE_UDP_ENCAP:
2050 udp_encap_lock(path->udp_encap.fp_udp_encap_id);
2051 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2055 case FIB_PATH_TYPE_INTF_RX: {
2057 * Resolve via a receive DPO.
2059 interface_rx_dpo_add_or_lock(path->fp_nh_proto,
2060 path->intf_rx.fp_interface,
2064 case FIB_PATH_TYPE_EXCLUSIVE:
2066 * Resolve via the user provided DPO
2068 dpo_copy(&path->fp_dpo, &path->exclusive.fp_ex_dpo);
2072 return (fib_path_is_resolved(path_index));
2076 fib_path_get_resolving_interface (fib_node_index_t path_index)
2080 path = fib_path_get(path_index);
2082 switch (path->fp_type)
2084 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2085 return (path->attached_next_hop.fp_interface);
2086 case FIB_PATH_TYPE_ATTACHED:
2087 return (path->attached.fp_interface);
2088 case FIB_PATH_TYPE_RECEIVE:
2089 return (path->receive.fp_interface);
2090 case FIB_PATH_TYPE_RECURSIVE:
2091 if (fib_path_is_resolved(path_index))
2093 return (fib_entry_get_resolving_interface(path->fp_via_fib));
2096 case FIB_PATH_TYPE_DVR:
2097 return (path->dvr.fp_interface);
2098 case FIB_PATH_TYPE_INTF_RX:
2099 case FIB_PATH_TYPE_UDP_ENCAP:
2100 case FIB_PATH_TYPE_SPECIAL:
2101 case FIB_PATH_TYPE_DEAG:
2102 case FIB_PATH_TYPE_EXCLUSIVE:
2103 case FIB_PATH_TYPE_BIER_FMASK:
2104 case FIB_PATH_TYPE_BIER_TABLE:
2105 case FIB_PATH_TYPE_BIER_IMP:
2108 return (dpo_get_urpf(&path->fp_dpo));
2112 fib_path_get_resolving_index (fib_node_index_t path_index)
2116 path = fib_path_get(path_index);
2118 switch (path->fp_type)
2120 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2121 case FIB_PATH_TYPE_ATTACHED:
2122 case FIB_PATH_TYPE_RECEIVE:
2123 case FIB_PATH_TYPE_INTF_RX:
2124 case FIB_PATH_TYPE_SPECIAL:
2125 case FIB_PATH_TYPE_DEAG:
2126 case FIB_PATH_TYPE_DVR:
2127 case FIB_PATH_TYPE_EXCLUSIVE:
2129 case FIB_PATH_TYPE_UDP_ENCAP:
2130 return (path->udp_encap.fp_udp_encap_id);
2131 case FIB_PATH_TYPE_RECURSIVE:
2132 return (path->fp_via_fib);
2133 case FIB_PATH_TYPE_BIER_FMASK:
2134 return (path->bier_fmask.fp_bier_fmask);
2135 case FIB_PATH_TYPE_BIER_TABLE:
2136 return (path->fp_via_bier_tbl);
2137 case FIB_PATH_TYPE_BIER_IMP:
2138 return (path->bier_imp.fp_bier_imp);
2144 fib_path_get_adj (fib_node_index_t path_index)
2148 path = fib_path_get(path_index);
2150 ASSERT(dpo_is_adj(&path->fp_dpo));
2151 if (dpo_is_adj(&path->fp_dpo))
2153 return (path->fp_dpo.dpoi_index);
2155 return (ADJ_INDEX_INVALID);
2159 fib_path_get_weight (fib_node_index_t path_index)
2163 path = fib_path_get(path_index);
2167 return (path->fp_weight);
2171 fib_path_get_preference (fib_node_index_t path_index)
2175 path = fib_path_get(path_index);
2179 return (path->fp_preference);
2183 fib_path_get_rpf_id (fib_node_index_t path_index)
2187 path = fib_path_get(path_index);
2191 if (FIB_PATH_CFG_FLAG_RPF_ID & path->fp_cfg_flags)
2193 return (path->deag.fp_rpf_id);
2200 * @brief Contribute the path's adjacency to the list passed.
2201 * By calling this function over all paths, recursively, a child
2202 * can construct its full set of forwarding adjacencies, and hence its
2206 fib_path_contribute_urpf (fib_node_index_t path_index,
2211 path = fib_path_get(path_index);
2214 * resolved and unresolved paths contribute to the RPF list.
2216 switch (path->fp_type)
2218 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2219 fib_urpf_list_append(urpf, path->attached_next_hop.fp_interface);
2222 case FIB_PATH_TYPE_ATTACHED:
2223 fib_urpf_list_append(urpf, path->attached.fp_interface);
2226 case FIB_PATH_TYPE_RECURSIVE:
2227 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib &&
2228 !fib_path_is_looped(path_index))
2231 * there's unresolved due to constraints, and there's unresolved
2232 * due to ain't got no via. can't do nowt w'out via.
2234 fib_entry_contribute_urpf(path->fp_via_fib, urpf);
2238 case FIB_PATH_TYPE_EXCLUSIVE:
2239 case FIB_PATH_TYPE_SPECIAL:
2242 * these path types may link to an adj, if that's what
2245 u32 rpf_sw_if_index;
2247 rpf_sw_if_index = dpo_get_urpf(&path->fp_dpo);
2249 if (~0 != rpf_sw_if_index)
2251 fib_urpf_list_append(urpf, rpf_sw_if_index);
2255 case FIB_PATH_TYPE_DVR:
2256 fib_urpf_list_append(urpf, path->dvr.fp_interface);
2258 case FIB_PATH_TYPE_DEAG:
2259 case FIB_PATH_TYPE_RECEIVE:
2260 case FIB_PATH_TYPE_INTF_RX:
2261 case FIB_PATH_TYPE_UDP_ENCAP:
2262 case FIB_PATH_TYPE_BIER_FMASK:
2263 case FIB_PATH_TYPE_BIER_TABLE:
2264 case FIB_PATH_TYPE_BIER_IMP:
2266 * these path types don't link to an adj
2273 fib_path_stack_mpls_disp (fib_node_index_t path_index,
2274 dpo_proto_t payload_proto,
2275 fib_mpls_lsp_mode_t mode,
2280 path = fib_path_get(path_index);
2284 switch (path->fp_type)
2286 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2288 dpo_id_t tmp = DPO_INVALID;
2290 dpo_copy(&tmp, dpo);
2292 mpls_disp_dpo_create(payload_proto, ~0, mode, &tmp, dpo);
2296 case FIB_PATH_TYPE_DEAG:
2298 dpo_id_t tmp = DPO_INVALID;
2300 dpo_copy(&tmp, dpo);
2302 mpls_disp_dpo_create(payload_proto,
2303 path->deag.fp_rpf_id,
2308 case FIB_PATH_TYPE_RECEIVE:
2309 case FIB_PATH_TYPE_ATTACHED:
2310 case FIB_PATH_TYPE_RECURSIVE:
2311 case FIB_PATH_TYPE_INTF_RX:
2312 case FIB_PATH_TYPE_UDP_ENCAP:
2313 case FIB_PATH_TYPE_EXCLUSIVE:
2314 case FIB_PATH_TYPE_SPECIAL:
2315 case FIB_PATH_TYPE_BIER_FMASK:
2316 case FIB_PATH_TYPE_BIER_TABLE:
2317 case FIB_PATH_TYPE_BIER_IMP:
2318 case FIB_PATH_TYPE_DVR:
2324 fib_path_contribute_forwarding (fib_node_index_t path_index,
2325 fib_forward_chain_type_t fct,
2330 path = fib_path_get(path_index);
2333 ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS != fct);
2336 * The DPO stored in the path was created when the path was resolved.
2337 * This then represents the path's 'native' protocol; IP.
2338 * For all others will need to go find something else.
2340 if (fib_path_to_chain_type(path) == fct)
2342 dpo_copy(dpo, &path->fp_dpo);
2346 switch (path->fp_type)
2348 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2351 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2352 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2353 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2354 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2355 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2356 case FIB_FORW_CHAIN_TYPE_NSH:
2357 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2358 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2363 * get a appropriate link type adj.
2365 ai = fib_path_attached_next_hop_get_adj(
2367 fib_forw_chain_type_to_link_type(fct));
2368 dpo_set(dpo, DPO_ADJACENCY,
2369 fib_forw_chain_type_to_dpo_proto(fct), ai);
2374 case FIB_FORW_CHAIN_TYPE_BIER:
2378 case FIB_PATH_TYPE_RECURSIVE:
2381 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2382 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2383 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2384 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2385 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2386 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2387 case FIB_FORW_CHAIN_TYPE_BIER:
2388 fib_path_recursive_adj_update(path, fct, dpo);
2390 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2391 case FIB_FORW_CHAIN_TYPE_NSH:
2396 case FIB_PATH_TYPE_BIER_TABLE:
2399 case FIB_FORW_CHAIN_TYPE_BIER:
2400 bier_table_contribute_forwarding(path->fp_via_bier_tbl, dpo);
2402 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2403 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2404 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2405 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2406 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2407 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2408 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2409 case FIB_FORW_CHAIN_TYPE_NSH:
2414 case FIB_PATH_TYPE_BIER_FMASK:
2417 case FIB_FORW_CHAIN_TYPE_BIER:
2418 fib_path_bier_fmask_update(path, dpo);
2420 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2421 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2422 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2423 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2424 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2425 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2426 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2427 case FIB_FORW_CHAIN_TYPE_NSH:
2432 case FIB_PATH_TYPE_BIER_IMP:
2433 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
2434 fib_forw_chain_type_to_dpo_proto(fct),
2437 case FIB_PATH_TYPE_DEAG:
2440 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2441 lookup_dpo_add_or_lock_w_table_id(MPLS_FIB_DEFAULT_TABLE_ID,
2444 LOOKUP_INPUT_DST_ADDR,
2445 LOOKUP_TABLE_FROM_CONFIG,
2448 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2449 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2450 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2451 dpo_copy(dpo, &path->fp_dpo);
2453 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2454 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2455 case FIB_FORW_CHAIN_TYPE_BIER:
2457 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2458 case FIB_FORW_CHAIN_TYPE_NSH:
2463 case FIB_PATH_TYPE_EXCLUSIVE:
2464 dpo_copy(dpo, &path->exclusive.fp_ex_dpo);
2466 case FIB_PATH_TYPE_ATTACHED:
2469 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2470 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2471 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2472 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2473 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2474 case FIB_FORW_CHAIN_TYPE_NSH:
2475 case FIB_FORW_CHAIN_TYPE_BIER:
2480 * get a appropriate link type adj.
2482 ai = fib_path_attached_get_adj(
2484 fib_forw_chain_type_to_link_type(fct));
2485 dpo_set(dpo, DPO_ADJACENCY,
2486 fib_forw_chain_type_to_dpo_proto(fct), ai);
2490 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2491 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2496 * Create the adj needed for sending IP multicast traffic
2498 ai = adj_mcast_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
2499 fib_forw_chain_type_to_link_type(fct),
2500 path->attached.fp_interface);
2501 dpo_set(dpo, DPO_ADJACENCY,
2502 fib_forw_chain_type_to_dpo_proto(fct),
2509 case FIB_PATH_TYPE_INTF_RX:
2511 * Create the adj needed for sending IP multicast traffic
2513 interface_rx_dpo_add_or_lock(fib_forw_chain_type_to_dpo_proto(fct),
2514 path->attached.fp_interface,
2517 case FIB_PATH_TYPE_UDP_ENCAP:
2518 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2522 case FIB_PATH_TYPE_RECEIVE:
2523 case FIB_PATH_TYPE_SPECIAL:
2524 case FIB_PATH_TYPE_DVR:
2525 dpo_copy(dpo, &path->fp_dpo);
2531 load_balance_path_t *
2532 fib_path_append_nh_for_multipath_hash (fib_node_index_t path_index,
2533 fib_forward_chain_type_t fct,
2534 load_balance_path_t *hash_key)
2536 load_balance_path_t *mnh;
2539 path = fib_path_get(path_index);
2543 vec_add2(hash_key, mnh, 1);
2545 mnh->path_weight = path->fp_weight;
2546 mnh->path_index = path_index;
2548 if (fib_path_is_resolved(path_index))
2550 fib_path_contribute_forwarding(path_index, fct, &mnh->path_dpo);
2554 dpo_copy(&mnh->path_dpo,
2555 drop_dpo_get(fib_forw_chain_type_to_dpo_proto(fct)));
2561 fib_path_is_recursive_constrained (fib_node_index_t path_index)
2565 path = fib_path_get(path_index);
2567 return ((FIB_PATH_TYPE_RECURSIVE == path->fp_type) &&
2568 ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED) ||
2569 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)));
2573 fib_path_is_exclusive (fib_node_index_t path_index)
2577 path = fib_path_get(path_index);
2579 return (FIB_PATH_TYPE_EXCLUSIVE == path->fp_type);
2583 fib_path_is_deag (fib_node_index_t path_index)
2587 path = fib_path_get(path_index);
2589 return (FIB_PATH_TYPE_DEAG == path->fp_type);
2593 fib_path_is_resolved (fib_node_index_t path_index)
2597 path = fib_path_get(path_index);
2599 return (dpo_id_is_valid(&path->fp_dpo) &&
2600 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED) &&
2601 !fib_path_is_looped(path_index) &&
2602 !fib_path_is_permanent_drop(path));
2606 fib_path_is_looped (fib_node_index_t path_index)
2610 path = fib_path_get(path_index);
2612 return (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP);
2615 fib_path_list_walk_rc_t
2616 fib_path_encode (fib_node_index_t path_list_index,
2617 fib_node_index_t path_index,
2618 const fib_path_ext_t *path_ext,
2621 fib_route_path_encode_t **api_rpaths = ctx;
2622 fib_route_path_encode_t *api_rpath;
2625 path = fib_path_get(path_index);
2627 return (FIB_PATH_LIST_WALK_CONTINUE);
2628 vec_add2(*api_rpaths, api_rpath, 1);
2629 api_rpath->rpath.frp_weight = path->fp_weight;
2630 api_rpath->rpath.frp_preference = path->fp_preference;
2631 api_rpath->rpath.frp_proto = path->fp_nh_proto;
2632 api_rpath->rpath.frp_sw_if_index = ~0;
2633 api_rpath->rpath.frp_fib_index = 0;
2634 api_rpath->dpo = path->fp_dpo;
2636 switch (path->fp_type)
2638 case FIB_PATH_TYPE_RECEIVE:
2639 api_rpath->rpath.frp_addr = path->receive.fp_addr;
2640 api_rpath->rpath.frp_sw_if_index = path->receive.fp_interface;
2642 case FIB_PATH_TYPE_ATTACHED:
2643 api_rpath->rpath.frp_sw_if_index = path->attached.fp_interface;
2645 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2646 api_rpath->rpath.frp_sw_if_index = path->attached_next_hop.fp_interface;
2647 api_rpath->rpath.frp_addr = path->attached_next_hop.fp_nh;
2649 case FIB_PATH_TYPE_BIER_FMASK:
2650 api_rpath->rpath.frp_bier_fmask = path->bier_fmask.fp_bier_fmask;
2652 case FIB_PATH_TYPE_SPECIAL:
2654 case FIB_PATH_TYPE_DEAG:
2655 api_rpath->rpath.frp_fib_index = path->deag.fp_tbl_id;
2656 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
2658 api_rpath->rpath.frp_flags |= FIB_ROUTE_PATH_RPF_ID;
2661 case FIB_PATH_TYPE_RECURSIVE:
2662 api_rpath->rpath.frp_addr = path->recursive.fp_nh.fp_ip;
2663 api_rpath->rpath.frp_fib_index = path->recursive.fp_tbl_id;
2665 case FIB_PATH_TYPE_DVR:
2666 api_rpath->rpath.frp_sw_if_index = path->dvr.fp_interface;
2667 api_rpath->rpath.frp_flags |= FIB_ROUTE_PATH_DVR;
2669 case FIB_PATH_TYPE_UDP_ENCAP:
2670 api_rpath->rpath.frp_udp_encap_id = path->udp_encap.fp_udp_encap_id;
2671 api_rpath->rpath.frp_flags |= FIB_ROUTE_PATH_UDP_ENCAP;
2673 case FIB_PATH_TYPE_INTF_RX:
2674 api_rpath->rpath.frp_sw_if_index = path->receive.fp_interface;
2675 api_rpath->rpath.frp_flags |= FIB_ROUTE_PATH_INTF_RX;
2681 if (path_ext && path_ext->fpe_type == FIB_PATH_EXT_MPLS)
2683 api_rpath->rpath.frp_label_stack = path_ext->fpe_path.frp_label_stack;
2686 return (FIB_PATH_LIST_WALK_CONTINUE);
2690 fib_path_get_proto (fib_node_index_t path_index)
2694 path = fib_path_get(path_index);
2696 return (path->fp_nh_proto);
2700 fib_path_module_init (void)
2702 fib_node_register_type (FIB_NODE_TYPE_PATH, &fib_path_vft);
2703 fib_path_logger = vlib_log_register_class ("fib", "path");
2706 static clib_error_t *
2707 show_fib_path_command (vlib_main_t * vm,
2708 unformat_input_t * input,
2709 vlib_cli_command_t * cmd)
2711 fib_node_index_t pi;
2714 if (unformat (input, "%d", &pi))
2717 * show one in detail
2719 if (!pool_is_free_index(fib_path_pool, pi))
2721 path = fib_path_get(pi);
2722 u8 *s = format(NULL, "%U", format_fib_path, pi, 1,
2723 FIB_PATH_FORMAT_FLAGS_NONE);
2724 s = format(s, "\n children:");
2725 s = fib_node_children_format(path->fp_node.fn_children, s);
2726 vlib_cli_output (vm, "%s", s);
2731 vlib_cli_output (vm, "path %d invalid", pi);
2736 vlib_cli_output (vm, "FIB Paths");
2737 pool_foreach_index (pi, fib_path_pool,
2739 vlib_cli_output (vm, "%U", format_fib_path, pi, 0,
2740 FIB_PATH_FORMAT_FLAGS_NONE);
2747 VLIB_CLI_COMMAND (show_fib_path, static) = {
2748 .path = "show fib paths",
2749 .function = show_fib_path_command,
2750 .short_help = "show fib paths",