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/ip_null_dpo.h>
28 #include <vnet/dpo/classify_dpo.h>
29 #include <vnet/dpo/pw_cw.h>
31 #include <vnet/adj/adj.h>
32 #include <vnet/adj/adj_mcast.h>
34 #include <vnet/fib/fib_path.h>
35 #include <vnet/fib/fib_node.h>
36 #include <vnet/fib/fib_table.h>
37 #include <vnet/fib/fib_entry.h>
38 #include <vnet/fib/fib_path_list.h>
39 #include <vnet/fib/fib_internal.h>
40 #include <vnet/fib/fib_urpf_list.h>
41 #include <vnet/fib/mpls_fib.h>
42 #include <vnet/fib/fib_path_ext.h>
43 #include <vnet/udp/udp_encap.h>
44 #include <vnet/bier/bier_fmask.h>
45 #include <vnet/bier/bier_table.h>
46 #include <vnet/bier/bier_imp.h>
47 #include <vnet/bier/bier_disp_table.h>
50 * Enurmeration of path types
52 typedef enum fib_path_type_t_ {
54 * Marker. Add new types after this one.
56 FIB_PATH_TYPE_FIRST = 0,
58 * Attached-nexthop. An interface and a nexthop are known.
60 FIB_PATH_TYPE_ATTACHED_NEXT_HOP = FIB_PATH_TYPE_FIRST,
62 * attached. Only the interface is known.
64 FIB_PATH_TYPE_ATTACHED,
66 * recursive. Only the next-hop is known.
68 FIB_PATH_TYPE_RECURSIVE,
70 * special. nothing is known. so we drop.
72 FIB_PATH_TYPE_SPECIAL,
74 * exclusive. user provided adj.
76 FIB_PATH_TYPE_EXCLUSIVE,
78 * deag. Link to a lookup adj in the next table
84 FIB_PATH_TYPE_INTF_RX,
86 * Path resolves via a UDP encap object.
88 FIB_PATH_TYPE_UDP_ENCAP,
90 * receive. it's for-us.
92 FIB_PATH_TYPE_RECEIVE,
94 * bier-imp. it's via a BIER imposition.
96 FIB_PATH_TYPE_BIER_IMP,
98 * bier-fmask. it's via a BIER ECMP-table.
100 FIB_PATH_TYPE_BIER_TABLE,
102 * bier-fmask. it's via a BIER f-mask.
104 FIB_PATH_TYPE_BIER_FMASK,
110 * Marker. Add new types before this one, then update it.
112 FIB_PATH_TYPE_LAST = FIB_PATH_TYPE_BIER_FMASK,
113 } __attribute__ ((packed)) fib_path_type_t;
116 * The maximum number of path_types
118 #define FIB_PATH_TYPE_MAX (FIB_PATH_TYPE_LAST + 1)
120 #define FIB_PATH_TYPES { \
121 [FIB_PATH_TYPE_ATTACHED_NEXT_HOP] = "attached-nexthop", \
122 [FIB_PATH_TYPE_ATTACHED] = "attached", \
123 [FIB_PATH_TYPE_RECURSIVE] = "recursive", \
124 [FIB_PATH_TYPE_SPECIAL] = "special", \
125 [FIB_PATH_TYPE_EXCLUSIVE] = "exclusive", \
126 [FIB_PATH_TYPE_DEAG] = "deag", \
127 [FIB_PATH_TYPE_INTF_RX] = "intf-rx", \
128 [FIB_PATH_TYPE_UDP_ENCAP] = "udp-encap", \
129 [FIB_PATH_TYPE_RECEIVE] = "receive", \
130 [FIB_PATH_TYPE_BIER_IMP] = "bier-imp", \
131 [FIB_PATH_TYPE_BIER_TABLE] = "bier-table", \
132 [FIB_PATH_TYPE_BIER_FMASK] = "bier-fmask", \
133 [FIB_PATH_TYPE_DVR] = "dvr", \
136 #define FOR_EACH_FIB_PATH_TYPE(_item) \
137 for (_item = FIB_PATH_TYPE_FIRST; \
138 _item <= FIB_PATH_TYPE_LAST; \
142 * Enurmeration of path operational (i.e. derived) attributes
144 typedef enum fib_path_oper_attribute_t_ {
146 * Marker. Add new types after this one.
148 FIB_PATH_OPER_ATTRIBUTE_FIRST = 0,
150 * The path forms part of a recursive loop.
152 FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP = FIB_PATH_OPER_ATTRIBUTE_FIRST,
154 * The path is resolved
156 FIB_PATH_OPER_ATTRIBUTE_RESOLVED,
158 * The path is attached, despite what the next-hop may say.
160 FIB_PATH_OPER_ATTRIBUTE_ATTACHED,
162 * The path has become a permanent drop.
164 FIB_PATH_OPER_ATTRIBUTE_DROP,
166 * Marker. Add new types before this one, then update it.
168 FIB_PATH_OPER_ATTRIBUTE_LAST = FIB_PATH_OPER_ATTRIBUTE_DROP,
169 } __attribute__ ((packed)) fib_path_oper_attribute_t;
172 * The maximum number of path operational attributes
174 #define FIB_PATH_OPER_ATTRIBUTE_MAX (FIB_PATH_OPER_ATTRIBUTE_LAST + 1)
176 #define FIB_PATH_OPER_ATTRIBUTES { \
177 [FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP] = "recursive-loop", \
178 [FIB_PATH_OPER_ATTRIBUTE_RESOLVED] = "resolved", \
179 [FIB_PATH_OPER_ATTRIBUTE_DROP] = "drop", \
182 #define FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(_item) \
183 for (_item = FIB_PATH_OPER_ATTRIBUTE_FIRST; \
184 _item <= FIB_PATH_OPER_ATTRIBUTE_LAST; \
188 * Path flags from the attributes
190 typedef enum fib_path_oper_flags_t_ {
191 FIB_PATH_OPER_FLAG_NONE = 0,
192 FIB_PATH_OPER_FLAG_RECURSIVE_LOOP = (1 << FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP),
193 FIB_PATH_OPER_FLAG_DROP = (1 << FIB_PATH_OPER_ATTRIBUTE_DROP),
194 FIB_PATH_OPER_FLAG_RESOLVED = (1 << FIB_PATH_OPER_ATTRIBUTE_RESOLVED),
195 FIB_PATH_OPER_FLAG_ATTACHED = (1 << FIB_PATH_OPER_ATTRIBUTE_ATTACHED),
196 } __attribute__ ((packed)) fib_path_oper_flags_t;
201 typedef struct fib_path_t_ {
203 * A path is a node in the FIB graph.
208 * The index of the path-list to which this path belongs
213 * This marks the start of the memory area used to hash
216 STRUCT_MARK(path_hash_start);
219 * Configuration Flags
221 fib_path_cfg_flags_t fp_cfg_flags;
224 * The type of the path. This is the selector for the union
226 fib_path_type_t fp_type;
229 * The protocol of the next-hop, i.e. the address family of the
230 * next-hop's address. We can't derive this from the address itself
231 * since the address can be all zeros
233 dpo_proto_t fp_nh_proto;
236 * UCMP [unnormalised] weigth
241 * A path preference. 0 is the best.
242 * Only paths of the best preference, that are 'up', are considered
248 * per-type union of the data required to resolve the path
255 ip46_address_t fp_nh;
273 ip46_address_t fp_ip;
276 * The local label to resolve through.
278 mpls_label_t fp_local_label;
280 * The EOS bit of the resolving label
282 mpls_eos_bit_t fp_eos;
287 * The FIB table index in which to find the next-hop.
289 fib_node_index_t fp_tbl_id;
291 * The BIER FIB the fmask is in
300 index_t fp_bier_fmask;
304 * The BIER table's ID
306 bier_table_id_t fp_bier_tbl;
310 * The BIER imposition object
311 * this is part of the path's key, since the index_t
312 * of an imposition object is the object's key.
318 * The FIB index in which to perfom the next lookup
320 fib_node_index_t fp_tbl_id;
322 * The RPF-ID to tag the packets with
324 fib_rpf_id_t fp_rpf_id;
330 * The user provided 'exclusive' DPO
336 * The interface on which the local address is configured
342 ip46_address_t fp_addr;
346 * The interface on which the packets will be input.
352 * The UDP Encap object this path resolves through
358 * The UDP Encap object this path resolves through
360 u32 fp_classify_table_id;
369 STRUCT_MARK(path_hash_end);
372 * Memebers in this last section represent information that is
373 * dervied during resolution. It should not be copied to new paths
380 fib_path_oper_flags_t fp_oper_flags;
384 * the resolving via fib. not part of the union, since it it not part
385 * of the path's hash.
387 fib_node_index_t fp_via_fib;
389 * the resolving bier-table
391 index_t fp_via_bier_tbl;
393 * the resolving bier-fmask
395 index_t fp_via_bier_fmask;
399 * The Data-path objects through which this path resolves for IP.
404 * the index of this path in the parent's child list.
410 * Array of strings/names for the path types and attributes
412 static const char *fib_path_type_names[] = FIB_PATH_TYPES;
413 static const char *fib_path_oper_attribute_names[] = FIB_PATH_OPER_ATTRIBUTES;
414 static const char *fib_path_cfg_attribute_names[] = FIB_PATH_CFG_ATTRIBUTES;
417 * The memory pool from which we allocate all the paths
419 static fib_path_t *fib_path_pool;
424 vlib_log_class_t fib_path_logger;
429 #define FIB_PATH_DBG(_p, _fmt, _args...) \
431 vlib_log_debug (fib_path_logger, \
433 format_fib_path, fib_path_get_index(_p), 0, \
434 FIB_PATH_FORMAT_FLAGS_ONE_LINE, \
439 fib_path_get (fib_node_index_t index)
441 return (pool_elt_at_index(fib_path_pool, index));
444 static fib_node_index_t
445 fib_path_get_index (fib_path_t *path)
447 return (path - fib_path_pool);
451 fib_path_get_node (fib_node_index_t index)
453 return ((fib_node_t*)fib_path_get(index));
457 fib_path_from_fib_node (fib_node_t *node)
459 ASSERT(FIB_NODE_TYPE_PATH == node->fn_type);
460 return ((fib_path_t*)node);
464 format_fib_path (u8 * s, va_list * args)
466 fib_node_index_t path_index = va_arg (*args, fib_node_index_t);
467 u32 indent = va_arg (*args, u32);
468 fib_format_path_flags_t flags = va_arg (*args, fib_format_path_flags_t);
469 vnet_main_t * vnm = vnet_get_main();
470 fib_path_oper_attribute_t oattr;
471 fib_path_cfg_attribute_t cattr;
475 if (flags & FIB_PATH_FORMAT_FLAGS_ONE_LINE)
484 path = fib_path_get(path_index);
486 s = format (s, "%Upath:[%d] ", format_white_space, indent,
487 fib_path_get_index(path));
488 s = format (s, "pl-index:%d ", path->fp_pl_index);
489 s = format (s, "%U ", format_dpo_proto, path->fp_nh_proto);
490 s = format (s, "weight=%d ", path->fp_weight);
491 s = format (s, "pref=%d ", path->fp_preference);
492 s = format (s, "%s: ", fib_path_type_names[path->fp_type]);
493 if (FIB_PATH_OPER_FLAG_NONE != path->fp_oper_flags) {
494 s = format(s, " oper-flags:");
495 FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(oattr) {
496 if ((1<<oattr) & path->fp_oper_flags) {
497 s = format (s, "%s,", fib_path_oper_attribute_names[oattr]);
501 if (FIB_PATH_CFG_FLAG_NONE != path->fp_cfg_flags) {
502 s = format(s, " cfg-flags:");
503 FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(cattr) {
504 if ((1<<cattr) & path->fp_cfg_flags) {
505 s = format (s, "%s,", fib_path_cfg_attribute_names[cattr]);
509 if (!(flags & FIB_PATH_FORMAT_FLAGS_ONE_LINE))
510 s = format(s, "\n%U", format_white_space, indent+2);
512 switch (path->fp_type)
514 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
515 s = format (s, "%U", format_ip46_address,
516 &path->attached_next_hop.fp_nh,
518 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
520 s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
524 s = format (s, " %U",
525 format_vnet_sw_interface_name,
527 vnet_get_sw_interface(
529 path->attached_next_hop.fp_interface));
530 if (vnet_sw_interface_is_p2p(vnet_get_main(),
531 path->attached_next_hop.fp_interface))
533 s = format (s, " (p2p)");
536 if (!dpo_id_is_valid(&path->fp_dpo))
538 s = format(s, "%s%Uunresolved", eol, format_white_space, indent+2);
542 s = format(s, "%s%U%U", eol,
543 format_white_space, indent,
548 case FIB_PATH_TYPE_ATTACHED:
549 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
551 s = format (s, "if_index:%d", path->attached_next_hop.fp_interface);
555 s = format (s, " %U",
556 format_vnet_sw_interface_name,
558 vnet_get_sw_interface(
560 path->attached.fp_interface));
563 case FIB_PATH_TYPE_RECURSIVE:
564 if (DPO_PROTO_MPLS == path->fp_nh_proto)
566 s = format (s, "via %U %U",
567 format_mpls_unicast_label,
568 path->recursive.fp_nh.fp_local_label,
570 path->recursive.fp_nh.fp_eos);
574 s = format (s, "via %U",
576 &path->recursive.fp_nh.fp_ip,
579 s = format (s, " in fib:%d",
580 path->recursive.fp_tbl_id,
582 s = format (s, " via-fib:%d", path->fp_via_fib);
583 s = format (s, " via-dpo:[%U:%d]",
584 format_dpo_type, path->fp_dpo.dpoi_type,
585 path->fp_dpo.dpoi_index);
588 case FIB_PATH_TYPE_UDP_ENCAP:
589 s = format (s, "UDP-encap ID:%d", path->udp_encap.fp_udp_encap_id);
591 case FIB_PATH_TYPE_BIER_TABLE:
592 s = format (s, "via bier-table:[%U}",
593 format_bier_table_id,
594 &path->bier_table.fp_bier_tbl);
595 s = format (s, " via-dpo:[%U:%d]",
596 format_dpo_type, path->fp_dpo.dpoi_type,
597 path->fp_dpo.dpoi_index);
599 case FIB_PATH_TYPE_BIER_FMASK:
600 s = format (s, "via-fmask:%d", path->bier_fmask.fp_bier_fmask);
601 s = format (s, " via-dpo:[%U:%d]",
602 format_dpo_type, path->fp_dpo.dpoi_type,
603 path->fp_dpo.dpoi_index);
605 case FIB_PATH_TYPE_BIER_IMP:
606 s = format (s, "via %U", format_bier_imp,
607 path->bier_imp.fp_bier_imp, 0, BIER_SHOW_BRIEF);
609 case FIB_PATH_TYPE_DVR:
610 s = format (s, " %U",
611 format_vnet_sw_interface_name,
613 vnet_get_sw_interface(
615 path->dvr.fp_interface));
617 case FIB_PATH_TYPE_DEAG:
618 s = format (s, " %sfib-index:%d",
619 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ? "m" : ""),
620 path->deag.fp_tbl_id);
622 case FIB_PATH_TYPE_RECEIVE:
623 case FIB_PATH_TYPE_INTF_RX:
624 case FIB_PATH_TYPE_SPECIAL:
625 case FIB_PATH_TYPE_EXCLUSIVE:
626 if (dpo_id_is_valid(&path->fp_dpo))
628 s = format(s, "%U", format_dpo_id,
629 &path->fp_dpo, indent+2);
637 * fib_path_last_lock_gone
639 * We don't share paths, we share path lists, so the [un]lock functions
643 fib_path_last_lock_gone (fib_node_t *node)
648 static const adj_index_t
649 fib_path_attached_next_hop_get_adj (fib_path_t *path,
652 if (vnet_sw_interface_is_p2p(vnet_get_main(),
653 path->attached_next_hop.fp_interface))
656 * if the interface is p2p then the adj for the specific
657 * neighbour on that link will never exist. on p2p links
658 * the subnet address (the attached route) links to the
659 * auto-adj (see below), we want that adj here too.
661 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
664 path->attached_next_hop.fp_interface));
668 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
670 &path->attached_next_hop.fp_nh,
671 path->attached_next_hop.fp_interface));
676 fib_path_attached_next_hop_set (fib_path_t *path)
679 * resolve directly via the adjacency discribed by the
680 * interface and next-hop
682 dpo_set(&path->fp_dpo,
685 fib_path_attached_next_hop_get_adj(
687 dpo_proto_to_link(path->fp_nh_proto)));
690 * become a child of the adjacency so we receive updates
691 * when its rewrite changes
693 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
695 fib_path_get_index(path));
697 if (!vnet_sw_interface_is_up(vnet_get_main(),
698 path->attached_next_hop.fp_interface) ||
699 !adj_is_up(path->fp_dpo.dpoi_index))
701 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
705 static const adj_index_t
706 fib_path_attached_get_adj (fib_path_t *path,
709 if (vnet_sw_interface_is_p2p(vnet_get_main(),
710 path->attached.fp_interface))
713 * point-2-point interfaces do not require a glean, since
714 * there is nothing to ARP. Install a rewrite/nbr adj instead
716 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
719 path->attached.fp_interface));
723 return (adj_glean_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
725 path->attached.fp_interface,
731 * create of update the paths recursive adj
734 fib_path_recursive_adj_update (fib_path_t *path,
735 fib_forward_chain_type_t fct,
738 dpo_id_t via_dpo = DPO_INVALID;
741 * get the DPO to resolve through from the via-entry
743 fib_entry_contribute_forwarding(path->fp_via_fib,
749 * hope for the best - clear if restrictions apply.
751 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
754 * Validate any recursion constraints and over-ride the via
757 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP)
759 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
760 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
762 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)
765 * the via FIB must be a host route.
766 * note the via FIB just added will always be a host route
767 * since it is an RR source added host route. So what we need to
768 * check is whether the route has other sources. If it does then
769 * some other source has added it as a host route. If it doesn't
770 * then it was added only here and inherits forwarding from a cover.
771 * the cover is not a host route.
772 * The RR source is the lowest priority source, so we check if it
773 * is the best. if it is there are no other sources.
775 if (fib_entry_get_best_source(path->fp_via_fib) >= FIB_SOURCE_RR)
777 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
778 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
781 * PIC edge trigger. let the load-balance maps know
783 load_balance_map_path_state_change(fib_path_get_index(path));
786 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED)
789 * RR source entries inherit the flags from the cover, so
790 * we can check the via directly
792 if (!(FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags(path->fp_via_fib)))
794 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
795 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
798 * PIC edge trigger. let the load-balance maps know
800 load_balance_map_path_state_change(fib_path_get_index(path));
804 * check for over-riding factors on the FIB entry itself
806 if (!fib_entry_is_resolved(path->fp_via_fib))
808 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
809 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
812 * PIC edge trigger. let the load-balance maps know
814 load_balance_map_path_state_change(fib_path_get_index(path));
818 * If this path is contributing a drop, then it's not resolved
820 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
822 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
826 * update the path's contributed DPO
828 dpo_copy(dpo, &via_dpo);
830 FIB_PATH_DBG(path, "recursive update:");
836 * re-evaulate the forwarding state for a via fmask path
839 fib_path_bier_fmask_update (fib_path_t *path,
842 bier_fmask_contribute_forwarding(path->bier_fmask.fp_bier_fmask, dpo);
845 * if we are stakcing on the drop, then the path is not resolved
847 if (dpo_is_drop(dpo))
849 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
853 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
858 * fib_path_is_permanent_drop
860 * Return !0 if the path is configured to permanently drop,
861 * despite other attributes.
864 fib_path_is_permanent_drop (fib_path_t *path)
866 return ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP) ||
867 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP));
873 * Remove our dependency on the resolution target
876 fib_path_unresolve (fib_path_t *path)
879 * the forced drop path does not need unresolving
881 if (fib_path_is_permanent_drop(path))
886 switch (path->fp_type)
888 case FIB_PATH_TYPE_RECURSIVE:
889 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
891 fib_entry_child_remove(path->fp_via_fib,
893 fib_table_entry_special_remove(path->recursive.fp_tbl_id,
894 fib_entry_get_prefix(path->fp_via_fib),
896 fib_table_unlock(path->recursive.fp_tbl_id,
897 dpo_proto_to_fib(path->fp_nh_proto),
899 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
902 case FIB_PATH_TYPE_BIER_FMASK:
903 bier_fmask_child_remove(path->fp_via_bier_fmask,
906 case FIB_PATH_TYPE_BIER_IMP:
907 bier_imp_unlock(path->fp_dpo.dpoi_index);
909 case FIB_PATH_TYPE_BIER_TABLE:
910 bier_table_ecmp_unlock(path->fp_via_bier_tbl);
912 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
913 adj_child_remove(path->fp_dpo.dpoi_index,
915 adj_unlock(path->fp_dpo.dpoi_index);
917 case FIB_PATH_TYPE_ATTACHED:
918 adj_child_remove(path->fp_dpo.dpoi_index,
920 adj_unlock(path->fp_dpo.dpoi_index);
922 case FIB_PATH_TYPE_UDP_ENCAP:
923 udp_encap_unlock(path->fp_dpo.dpoi_index);
925 case FIB_PATH_TYPE_EXCLUSIVE:
926 dpo_reset(&path->exclusive.fp_ex_dpo);
928 case FIB_PATH_TYPE_SPECIAL:
929 case FIB_PATH_TYPE_RECEIVE:
930 case FIB_PATH_TYPE_INTF_RX:
931 case FIB_PATH_TYPE_DEAG:
932 case FIB_PATH_TYPE_DVR:
934 * these hold only the path's DPO, which is reset below.
940 * release the adj we were holding and pick up the
943 dpo_reset(&path->fp_dpo);
944 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
949 static fib_forward_chain_type_t
950 fib_path_to_chain_type (const fib_path_t *path)
952 if (DPO_PROTO_MPLS == path->fp_nh_proto)
954 if (FIB_PATH_TYPE_RECURSIVE == path->fp_type &&
955 MPLS_EOS == path->recursive.fp_nh.fp_eos)
957 return (FIB_FORW_CHAIN_TYPE_MPLS_EOS);
961 return (FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS);
966 return (fib_forw_chain_type_from_dpo_proto(path->fp_nh_proto));
971 * fib_path_back_walk_notify
973 * A back walk has reach this path.
975 static fib_node_back_walk_rc_t
976 fib_path_back_walk_notify (fib_node_t *node,
977 fib_node_back_walk_ctx_t *ctx)
981 path = fib_path_from_fib_node(node);
983 FIB_PATH_DBG(path, "bw:%U",
984 format_fib_node_bw_reason, ctx->fnbw_reason);
986 switch (path->fp_type)
988 case FIB_PATH_TYPE_RECURSIVE:
989 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
992 * modify the recursive adjacency to use the new forwarding
994 * this update is visible to packets in flight in the DP.
996 fib_path_recursive_adj_update(
998 fib_path_to_chain_type(path),
1001 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
1002 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
1005 * ADJ updates (complete<->incomplete) do not need to propagate to
1006 * recursive entries.
1007 * The only reason its needed as far back as here, is that the adj
1008 * and the incomplete adj are a different DPO type, so the LBs need
1010 * If this walk was quashed in the fib_entry, then any non-fib_path
1011 * children (like tunnels that collapse out the LB when they stack)
1012 * would not see the update.
1014 return (FIB_NODE_BACK_WALK_CONTINUE);
1017 case FIB_PATH_TYPE_BIER_FMASK:
1018 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
1021 * update to use the BIER fmask's new forwading
1023 fib_path_bier_fmask_update(path, &path->fp_dpo);
1025 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
1026 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
1029 * ADJ updates (complete<->incomplete) do not need to propagate to
1030 * recursive entries.
1031 * The only reason its needed as far back as here, is that the adj
1032 * and the incomplete adj are a different DPO type, so the LBs need
1034 * If this walk was quashed in the fib_entry, then any non-fib_path
1035 * children (like tunnels that collapse out the LB when they stack)
1036 * would not see the update.
1038 return (FIB_NODE_BACK_WALK_CONTINUE);
1041 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1044 * ADJ_UPDATE backwalk pass silently through here and up to
1045 * the path-list when the multipath adj collapse occurs.
1046 * The reason we do this is that the assumtption is that VPP
1047 * runs in an environment where the Control-Plane is remote
1048 * and hence reacts slowly to link up down. In order to remove
1049 * this down link from the ECMP set quickly, we back-walk.
1050 * VPP also has dedicated CPUs, so we are not stealing resources
1051 * from the CP to do so.
1053 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1055 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED)
1058 * alreday resolved. no need to walk back again
1060 return (FIB_NODE_BACK_WALK_CONTINUE);
1062 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1064 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1066 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1069 * alreday unresolved. no need to walk back again
1071 return (FIB_NODE_BACK_WALK_CONTINUE);
1073 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1075 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1078 * The interface this path resolves through has been deleted.
1079 * This will leave the path in a permanent drop state. The route
1080 * needs to be removed and readded (and hence the path-list deleted)
1081 * before it can forward again.
1083 fib_path_unresolve(path);
1084 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1086 if (FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason)
1089 * restack the DPO to pick up the correct DPO sub-type
1094 if_is_up = vnet_sw_interface_is_up(
1096 path->attached_next_hop.fp_interface);
1098 ai = fib_path_attached_next_hop_get_adj(
1100 dpo_proto_to_link(path->fp_nh_proto));
1102 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1103 if (if_is_up && adj_is_up(ai))
1105 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1108 dpo_set(&path->fp_dpo, DPO_ADJACENCY, path->fp_nh_proto, ai);
1114 * If the interface is not up there is no reason to walk
1115 * back to children. if we did they would only evalute
1116 * that this path is unresolved and hence it would
1117 * not contribute the adjacency - so it would be wasted
1120 return (FIB_NODE_BACK_WALK_CONTINUE);
1123 if (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason)
1125 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1128 * alreday unresolved. no need to walk back again
1130 return (FIB_NODE_BACK_WALK_CONTINUE);
1133 * the adj has gone down. the path is no longer resolved.
1135 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1138 case FIB_PATH_TYPE_ATTACHED:
1139 case FIB_PATH_TYPE_DVR:
1141 * FIXME; this could schedule a lower priority walk, since attached
1142 * routes are not usually in ECMP configurations so the backwalk to
1143 * the FIB entry does not need to be high priority
1145 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1147 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1149 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1151 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1153 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1155 fib_path_unresolve(path);
1156 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1159 case FIB_PATH_TYPE_UDP_ENCAP:
1161 dpo_id_t via_dpo = DPO_INVALID;
1164 * hope for the best - clear if restrictions apply.
1166 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1168 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
1172 * If this path is contributing a drop, then it's not resolved
1174 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
1176 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1180 * update the path's contributed DPO
1182 dpo_copy(&path->fp_dpo, &via_dpo);
1183 dpo_reset(&via_dpo);
1186 case FIB_PATH_TYPE_INTF_RX:
1188 case FIB_PATH_TYPE_DEAG:
1190 * FIXME When VRF delete is allowed this will need a poke.
1192 case FIB_PATH_TYPE_SPECIAL:
1193 case FIB_PATH_TYPE_RECEIVE:
1194 case FIB_PATH_TYPE_EXCLUSIVE:
1195 case FIB_PATH_TYPE_BIER_TABLE:
1196 case FIB_PATH_TYPE_BIER_IMP:
1198 * these path types have no parents. so to be
1199 * walked from one is unexpected.
1206 * propagate the backwalk further to the path-list
1208 fib_path_list_back_walk(path->fp_pl_index, ctx);
1210 return (FIB_NODE_BACK_WALK_CONTINUE);
1214 fib_path_memory_show (void)
1216 fib_show_memory_usage("Path",
1217 pool_elts(fib_path_pool),
1218 pool_len(fib_path_pool),
1219 sizeof(fib_path_t));
1223 * The FIB path's graph node virtual function table
1225 static const fib_node_vft_t fib_path_vft = {
1226 .fnv_get = fib_path_get_node,
1227 .fnv_last_lock = fib_path_last_lock_gone,
1228 .fnv_back_walk = fib_path_back_walk_notify,
1229 .fnv_mem_show = fib_path_memory_show,
1232 static fib_path_cfg_flags_t
1233 fib_path_route_flags_to_cfg_flags (const fib_route_path_t *rpath)
1235 fib_path_cfg_flags_t cfg_flags = FIB_PATH_CFG_FLAG_NONE;
1237 if (rpath->frp_flags & FIB_ROUTE_PATH_POP_PW_CW)
1238 cfg_flags |= FIB_PATH_CFG_FLAG_POP_PW_CW;
1239 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_HOST)
1240 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_HOST;
1241 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_ATTACHED)
1242 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED;
1243 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1244 cfg_flags |= FIB_PATH_CFG_FLAG_LOCAL;
1245 if (rpath->frp_flags & FIB_ROUTE_PATH_ATTACHED)
1246 cfg_flags |= FIB_PATH_CFG_FLAG_ATTACHED;
1247 if (rpath->frp_flags & FIB_ROUTE_PATH_INTF_RX)
1248 cfg_flags |= FIB_PATH_CFG_FLAG_INTF_RX;
1249 if (rpath->frp_flags & FIB_ROUTE_PATH_RPF_ID)
1250 cfg_flags |= FIB_PATH_CFG_FLAG_RPF_ID;
1251 if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1252 cfg_flags |= FIB_PATH_CFG_FLAG_EXCLUSIVE;
1253 if (rpath->frp_flags & FIB_ROUTE_PATH_DROP)
1254 cfg_flags |= FIB_PATH_CFG_FLAG_DROP;
1255 if (rpath->frp_flags & FIB_ROUTE_PATH_SOURCE_LOOKUP)
1256 cfg_flags |= FIB_PATH_CFG_FLAG_DEAG_SRC;
1257 if (rpath->frp_flags & FIB_ROUTE_PATH_ICMP_UNREACH)
1258 cfg_flags |= FIB_PATH_CFG_FLAG_ICMP_UNREACH;
1259 if (rpath->frp_flags & FIB_ROUTE_PATH_ICMP_PROHIBIT)
1260 cfg_flags |= FIB_PATH_CFG_FLAG_ICMP_PROHIBIT;
1268 * Create and initialise a new path object.
1269 * return the index of the path.
1272 fib_path_create (fib_node_index_t pl_index,
1273 const fib_route_path_t *rpath)
1277 pool_get(fib_path_pool, path);
1278 clib_memset(path, 0, sizeof(*path));
1280 fib_node_init(&path->fp_node,
1281 FIB_NODE_TYPE_PATH);
1283 dpo_reset(&path->fp_dpo);
1284 path->fp_pl_index = pl_index;
1285 path->fp_nh_proto = rpath->frp_proto;
1286 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1287 path->fp_weight = rpath->frp_weight;
1288 if (0 == path->fp_weight)
1291 * a weight of 0 is a meaningless value. We could either reject it, and thus force
1292 * clients to always use 1, or we can accept it and fixup approrpiately.
1294 path->fp_weight = 1;
1296 path->fp_preference = rpath->frp_preference;
1297 path->fp_cfg_flags = fib_path_route_flags_to_cfg_flags(rpath);
1300 * deduce the path's tpye from the parementers and save what is needed.
1302 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_LOCAL)
1304 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1305 path->receive.fp_interface = rpath->frp_sw_if_index;
1306 path->receive.fp_addr = rpath->frp_addr;
1308 else if (rpath->frp_flags & FIB_ROUTE_PATH_UDP_ENCAP)
1310 path->fp_type = FIB_PATH_TYPE_UDP_ENCAP;
1311 path->udp_encap.fp_udp_encap_id = rpath->frp_udp_encap_id;
1313 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_INTF_RX)
1315 path->fp_type = FIB_PATH_TYPE_INTF_RX;
1316 path->intf_rx.fp_interface = rpath->frp_sw_if_index;
1318 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
1320 path->fp_type = FIB_PATH_TYPE_DEAG;
1321 path->deag.fp_tbl_id = rpath->frp_fib_index;
1322 path->deag.fp_rpf_id = rpath->frp_rpf_id;
1324 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_FMASK)
1326 path->fp_type = FIB_PATH_TYPE_BIER_FMASK;
1327 path->bier_fmask.fp_bier_fmask = rpath->frp_bier_fmask;
1329 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_IMP)
1331 path->fp_type = FIB_PATH_TYPE_BIER_IMP;
1332 path->bier_imp.fp_bier_imp = rpath->frp_bier_imp;
1334 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_TABLE)
1336 path->fp_type = FIB_PATH_TYPE_BIER_TABLE;
1337 path->bier_table.fp_bier_tbl = rpath->frp_bier_tbl;
1339 else if (rpath->frp_flags & FIB_ROUTE_PATH_DEAG)
1341 path->fp_type = FIB_PATH_TYPE_DEAG;
1342 path->deag.fp_tbl_id = rpath->frp_fib_index;
1344 else if (rpath->frp_flags & FIB_ROUTE_PATH_DVR)
1346 path->fp_type = FIB_PATH_TYPE_DVR;
1347 path->dvr.fp_interface = rpath->frp_sw_if_index;
1349 else if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1351 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1352 dpo_copy(&path->exclusive.fp_ex_dpo, &rpath->dpo);
1354 else if ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT) ||
1355 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH))
1357 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1359 else if ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_CLASSIFY))
1361 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1362 path->classify.fp_classify_table_id = rpath->frp_classify_table_id;
1364 else if (~0 != rpath->frp_sw_if_index)
1366 if (ip46_address_is_zero(&rpath->frp_addr))
1368 path->fp_type = FIB_PATH_TYPE_ATTACHED;
1369 path->attached.fp_interface = rpath->frp_sw_if_index;
1373 path->fp_type = FIB_PATH_TYPE_ATTACHED_NEXT_HOP;
1374 path->attached_next_hop.fp_interface = rpath->frp_sw_if_index;
1375 path->attached_next_hop.fp_nh = rpath->frp_addr;
1380 if (ip46_address_is_zero(&rpath->frp_addr))
1382 if (~0 == rpath->frp_fib_index)
1384 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1388 path->fp_type = FIB_PATH_TYPE_DEAG;
1389 path->deag.fp_tbl_id = rpath->frp_fib_index;
1390 path->deag.fp_rpf_id = ~0;
1395 path->fp_type = FIB_PATH_TYPE_RECURSIVE;
1396 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1398 path->recursive.fp_nh.fp_local_label = rpath->frp_local_label;
1399 path->recursive.fp_nh.fp_eos = rpath->frp_eos;
1403 path->recursive.fp_nh.fp_ip = rpath->frp_addr;
1405 path->recursive.fp_tbl_id = rpath->frp_fib_index;
1409 FIB_PATH_DBG(path, "create");
1411 return (fib_path_get_index(path));
1415 * fib_path_create_special
1417 * Create and initialise a new path object.
1418 * return the index of the path.
1421 fib_path_create_special (fib_node_index_t pl_index,
1422 dpo_proto_t nh_proto,
1423 fib_path_cfg_flags_t flags,
1424 const dpo_id_t *dpo)
1428 pool_get(fib_path_pool, path);
1429 clib_memset(path, 0, sizeof(*path));
1431 fib_node_init(&path->fp_node,
1432 FIB_NODE_TYPE_PATH);
1433 dpo_reset(&path->fp_dpo);
1435 path->fp_pl_index = pl_index;
1436 path->fp_weight = 1;
1437 path->fp_preference = 0;
1438 path->fp_nh_proto = nh_proto;
1439 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1440 path->fp_cfg_flags = flags;
1442 if (FIB_PATH_CFG_FLAG_DROP & flags)
1444 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1446 else if (FIB_PATH_CFG_FLAG_LOCAL & flags)
1448 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1449 path->attached.fp_interface = FIB_NODE_INDEX_INVALID;
1453 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1454 ASSERT(NULL != dpo);
1455 dpo_copy(&path->exclusive.fp_ex_dpo, dpo);
1458 return (fib_path_get_index(path));
1464 * Copy a path. return index of new path.
1467 fib_path_copy (fib_node_index_t path_index,
1468 fib_node_index_t path_list_index)
1470 fib_path_t *path, *orig_path;
1472 pool_get(fib_path_pool, path);
1474 orig_path = fib_path_get(path_index);
1475 ASSERT(NULL != orig_path);
1477 memcpy(path, orig_path, sizeof(*path));
1479 FIB_PATH_DBG(path, "create-copy:%d", path_index);
1482 * reset the dynamic section
1484 fib_node_init(&path->fp_node, FIB_NODE_TYPE_PATH);
1485 path->fp_oper_flags = FIB_PATH_OPER_FLAG_NONE;
1486 path->fp_pl_index = path_list_index;
1487 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1488 clib_memset(&path->fp_dpo, 0, sizeof(path->fp_dpo));
1489 dpo_reset(&path->fp_dpo);
1491 return (fib_path_get_index(path));
1497 * destroy a path that is no longer required
1500 fib_path_destroy (fib_node_index_t path_index)
1504 path = fib_path_get(path_index);
1506 ASSERT(NULL != path);
1507 FIB_PATH_DBG(path, "destroy");
1509 fib_path_unresolve(path);
1511 fib_node_deinit(&path->fp_node);
1512 pool_put(fib_path_pool, path);
1518 * destroy a path that is no longer required
1521 fib_path_hash (fib_node_index_t path_index)
1525 path = fib_path_get(path_index);
1527 return (hash_memory(STRUCT_MARK_PTR(path, path_hash_start),
1528 (STRUCT_OFFSET_OF(fib_path_t, path_hash_end) -
1529 STRUCT_OFFSET_OF(fib_path_t, path_hash_start)),
1536 * Compare two paths for equivalence.
1539 fib_path_cmp_i (const fib_path_t *path1,
1540 const fib_path_t *path2)
1547 * paths of different types and protocol are not equal.
1548 * different weights and/or preference only are the same path.
1550 if (path1->fp_type != path2->fp_type)
1552 res = (path1->fp_type - path2->fp_type);
1554 else if (path1->fp_nh_proto != path2->fp_nh_proto)
1556 res = (path1->fp_nh_proto - path2->fp_nh_proto);
1561 * both paths are of the same type.
1562 * consider each type and its attributes in turn.
1564 switch (path1->fp_type)
1566 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1567 res = ip46_address_cmp(&path1->attached_next_hop.fp_nh,
1568 &path2->attached_next_hop.fp_nh);
1570 res = (path1->attached_next_hop.fp_interface -
1571 path2->attached_next_hop.fp_interface);
1574 case FIB_PATH_TYPE_ATTACHED:
1575 res = (path1->attached.fp_interface -
1576 path2->attached.fp_interface);
1578 case FIB_PATH_TYPE_RECURSIVE:
1579 res = ip46_address_cmp(&path1->recursive.fp_nh,
1580 &path2->recursive.fp_nh);
1584 res = (path1->recursive.fp_tbl_id - path2->recursive.fp_tbl_id);
1587 case FIB_PATH_TYPE_BIER_FMASK:
1588 res = (path1->bier_fmask.fp_bier_fmask -
1589 path2->bier_fmask.fp_bier_fmask);
1591 case FIB_PATH_TYPE_BIER_IMP:
1592 res = (path1->bier_imp.fp_bier_imp -
1593 path2->bier_imp.fp_bier_imp);
1595 case FIB_PATH_TYPE_BIER_TABLE:
1596 res = bier_table_id_cmp(&path1->bier_table.fp_bier_tbl,
1597 &path2->bier_table.fp_bier_tbl);
1599 case FIB_PATH_TYPE_DEAG:
1600 res = (path1->deag.fp_tbl_id - path2->deag.fp_tbl_id);
1603 res = (path1->deag.fp_rpf_id - path2->deag.fp_rpf_id);
1606 case FIB_PATH_TYPE_INTF_RX:
1607 res = (path1->intf_rx.fp_interface - path2->intf_rx.fp_interface);
1609 case FIB_PATH_TYPE_UDP_ENCAP:
1610 res = (path1->udp_encap.fp_udp_encap_id - path2->udp_encap.fp_udp_encap_id);
1612 case FIB_PATH_TYPE_DVR:
1613 res = (path1->dvr.fp_interface - path2->dvr.fp_interface);
1615 case FIB_PATH_TYPE_EXCLUSIVE:
1616 res = dpo_cmp(&path1->exclusive.fp_ex_dpo, &path2->exclusive.fp_ex_dpo);
1618 case FIB_PATH_TYPE_SPECIAL:
1619 case FIB_PATH_TYPE_RECEIVE:
1628 * fib_path_cmp_for_sort
1630 * Compare two paths for equivalence. Used during path sorting.
1631 * As usual 0 means equal.
1634 fib_path_cmp_for_sort (void * v1,
1637 fib_node_index_t *pi1 = v1, *pi2 = v2;
1638 fib_path_t *path1, *path2;
1640 path1 = fib_path_get(*pi1);
1641 path2 = fib_path_get(*pi2);
1644 * when sorting paths we want the highest preference paths
1645 * first, so that the choices set built is in prefernce order
1647 if (path1->fp_preference != path2->fp_preference)
1649 return (path1->fp_preference - path2->fp_preference);
1652 return (fib_path_cmp_i(path1, path2));
1658 * Compare two paths for equivalence.
1661 fib_path_cmp (fib_node_index_t pi1,
1662 fib_node_index_t pi2)
1664 fib_path_t *path1, *path2;
1666 path1 = fib_path_get(pi1);
1667 path2 = fib_path_get(pi2);
1669 return (fib_path_cmp_i(path1, path2));
1673 fib_path_cmp_w_route_path (fib_node_index_t path_index,
1674 const fib_route_path_t *rpath)
1679 path = fib_path_get(path_index);
1683 if (path->fp_weight != rpath->frp_weight)
1685 res = (path->fp_weight - rpath->frp_weight);
1690 * both paths are of the same type.
1691 * consider each type and its attributes in turn.
1693 switch (path->fp_type)
1695 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1696 res = ip46_address_cmp(&path->attached_next_hop.fp_nh,
1700 res = (path->attached_next_hop.fp_interface -
1701 rpath->frp_sw_if_index);
1704 case FIB_PATH_TYPE_ATTACHED:
1705 res = (path->attached.fp_interface - rpath->frp_sw_if_index);
1707 case FIB_PATH_TYPE_RECURSIVE:
1708 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1710 res = path->recursive.fp_nh.fp_local_label - rpath->frp_local_label;
1714 res = path->recursive.fp_nh.fp_eos - rpath->frp_eos;
1719 res = ip46_address_cmp(&path->recursive.fp_nh.fp_ip,
1725 res = (path->recursive.fp_tbl_id - rpath->frp_fib_index);
1728 case FIB_PATH_TYPE_BIER_FMASK:
1729 res = (path->bier_fmask.fp_bier_fmask - rpath->frp_bier_fmask);
1731 case FIB_PATH_TYPE_BIER_IMP:
1732 res = (path->bier_imp.fp_bier_imp - rpath->frp_bier_imp);
1734 case FIB_PATH_TYPE_BIER_TABLE:
1735 res = bier_table_id_cmp(&path->bier_table.fp_bier_tbl,
1736 &rpath->frp_bier_tbl);
1738 case FIB_PATH_TYPE_INTF_RX:
1739 res = (path->intf_rx.fp_interface - rpath->frp_sw_if_index);
1741 case FIB_PATH_TYPE_UDP_ENCAP:
1742 res = (path->udp_encap.fp_udp_encap_id - rpath->frp_udp_encap_id);
1744 case FIB_PATH_TYPE_DEAG:
1745 res = (path->deag.fp_tbl_id - rpath->frp_fib_index);
1748 res = (path->deag.fp_rpf_id - rpath->frp_rpf_id);
1751 case FIB_PATH_TYPE_DVR:
1752 res = (path->dvr.fp_interface - rpath->frp_sw_if_index);
1754 case FIB_PATH_TYPE_EXCLUSIVE:
1755 res = dpo_cmp(&path->exclusive.fp_ex_dpo, &rpath->dpo);
1757 case FIB_PATH_TYPE_RECEIVE:
1758 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1767 case FIB_PATH_TYPE_SPECIAL:
1776 * fib_path_recursive_loop_detect
1778 * A forward walk of the FIB object graph to detect for a cycle/loop. This
1779 * walk is initiated when an entry is linking to a new path list or from an old.
1780 * The entry vector passed contains all the FIB entrys that are children of this
1781 * path (it is all the entries encountered on the walk so far). If this vector
1782 * contains the entry this path resolve via, then a loop is about to form.
1783 * The loop must be allowed to form, since we need the dependencies in place
1784 * so that we can track when the loop breaks.
1785 * However, we MUST not produce a loop in the forwarding graph (else packets
1786 * would loop around the switch path until the loop breaks), so we mark recursive
1787 * paths as looped so that they do not contribute forwarding information.
1788 * By marking the path as looped, an etry such as;
1790 * via a.a.a.a (looped)
1791 * via b.b.b.b (not looped)
1792 * can still forward using the info provided by b.b.b.b only
1795 fib_path_recursive_loop_detect (fib_node_index_t path_index,
1796 fib_node_index_t **entry_indicies)
1800 path = fib_path_get(path_index);
1803 * the forced drop path is never looped, cos it is never resolved.
1805 if (fib_path_is_permanent_drop(path))
1810 switch (path->fp_type)
1812 case FIB_PATH_TYPE_RECURSIVE:
1814 fib_node_index_t *entry_index, *entries;
1816 entries = *entry_indicies;
1818 vec_foreach(entry_index, entries) {
1819 if (*entry_index == path->fp_via_fib)
1822 * the entry that is about to link to this path-list (or
1823 * one of this path-list's children) is the same entry that
1824 * this recursive path resolves through. this is a cycle.
1834 FIB_PATH_DBG(path, "recursive loop formed");
1835 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1837 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1842 * no loop here yet. keep forward walking the graph.
1844 if (fib_entry_recursive_loop_detect(path->fp_via_fib, entry_indicies))
1846 FIB_PATH_DBG(path, "recursive loop formed");
1847 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1851 FIB_PATH_DBG(path, "recursive loop cleared");
1852 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1857 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1858 case FIB_PATH_TYPE_ATTACHED:
1859 if (adj_recursive_loop_detect(path->fp_dpo.dpoi_index,
1862 FIB_PATH_DBG(path, "recursive loop formed");
1863 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1867 FIB_PATH_DBG(path, "recursive loop cleared");
1868 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1871 case FIB_PATH_TYPE_SPECIAL:
1872 case FIB_PATH_TYPE_DEAG:
1873 case FIB_PATH_TYPE_DVR:
1874 case FIB_PATH_TYPE_RECEIVE:
1875 case FIB_PATH_TYPE_INTF_RX:
1876 case FIB_PATH_TYPE_UDP_ENCAP:
1877 case FIB_PATH_TYPE_EXCLUSIVE:
1878 case FIB_PATH_TYPE_BIER_FMASK:
1879 case FIB_PATH_TYPE_BIER_TABLE:
1880 case FIB_PATH_TYPE_BIER_IMP:
1882 * these path types cannot be part of a loop, since they are the leaves
1888 return (fib_path_is_looped(path_index));
1892 fib_path_resolve (fib_node_index_t path_index)
1896 path = fib_path_get(path_index);
1899 * hope for the best.
1901 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1904 * the forced drop path resolves via the drop adj
1906 if (fib_path_is_permanent_drop(path))
1908 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1909 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1910 return (fib_path_is_resolved(path_index));
1913 switch (path->fp_type)
1915 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1916 fib_path_attached_next_hop_set(path);
1918 case FIB_PATH_TYPE_ATTACHED:
1920 dpo_id_t tmp = DPO_INVALID;
1923 * path->attached.fp_interface
1925 if (!vnet_sw_interface_is_up(vnet_get_main(),
1926 path->attached.fp_interface))
1928 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1933 fib_path_attached_get_adj(path,
1934 dpo_proto_to_link(path->fp_nh_proto)));
1937 * re-fetch after possible mem realloc
1939 path = fib_path_get(path_index);
1940 dpo_copy(&path->fp_dpo, &tmp);
1943 * become a child of the adjacency so we receive updates
1944 * when the interface state changes
1946 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
1948 fib_path_get_index(path));
1952 case FIB_PATH_TYPE_RECURSIVE:
1955 * Create a RR source entry in the table for the address
1956 * that this path recurses through.
1957 * This resolve action is recursive, hence we may create
1958 * more paths in the process. more creates mean maybe realloc
1961 fib_node_index_t fei;
1964 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_fib);
1966 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1968 fib_prefix_from_mpls_label(path->recursive.fp_nh.fp_local_label,
1969 path->recursive.fp_nh.fp_eos,
1974 fib_prefix_from_ip46_addr(&path->recursive.fp_nh.fp_ip, &pfx);
1977 fib_table_lock(path->recursive.fp_tbl_id,
1978 dpo_proto_to_fib(path->fp_nh_proto),
1980 fei = fib_table_entry_special_add(path->recursive.fp_tbl_id,
1983 FIB_ENTRY_FLAG_NONE);
1985 path = fib_path_get(path_index);
1986 path->fp_via_fib = fei;
1989 * become a dependent child of the entry so the path is
1990 * informed when the forwarding for the entry changes.
1992 path->fp_sibling = fib_entry_child_add(path->fp_via_fib,
1994 fib_path_get_index(path));
1997 * create and configure the IP DPO
1999 fib_path_recursive_adj_update(
2001 fib_path_to_chain_type(path),
2006 case FIB_PATH_TYPE_BIER_FMASK:
2009 * become a dependent child of the entry so the path is
2010 * informed when the forwarding for the entry changes.
2012 path->fp_sibling = bier_fmask_child_add(path->bier_fmask.fp_bier_fmask,
2014 fib_path_get_index(path));
2016 path->fp_via_bier_fmask = path->bier_fmask.fp_bier_fmask;
2017 fib_path_bier_fmask_update(path, &path->fp_dpo);
2021 case FIB_PATH_TYPE_BIER_IMP:
2022 bier_imp_lock(path->bier_imp.fp_bier_imp);
2023 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
2027 case FIB_PATH_TYPE_BIER_TABLE:
2030 * Find/create the BIER table to link to
2032 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_bier_tbl);
2034 path->fp_via_bier_tbl =
2035 bier_table_ecmp_create_and_lock(&path->bier_table.fp_bier_tbl);
2037 bier_table_contribute_forwarding(path->fp_via_bier_tbl,
2041 case FIB_PATH_TYPE_SPECIAL:
2042 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT)
2044 ip_null_dpo_add_and_lock (path->fp_nh_proto,
2045 IP_NULL_ACTION_SEND_ICMP_PROHIBIT,
2048 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH)
2050 ip_null_dpo_add_and_lock (path->fp_nh_proto,
2051 IP_NULL_ACTION_SEND_ICMP_UNREACH,
2054 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_CLASSIFY)
2056 dpo_set (&path->fp_dpo, DPO_CLASSIFY,
2058 classify_dpo_create (path->fp_nh_proto,
2059 path->classify.fp_classify_table_id));
2064 * Resolve via the drop
2066 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
2069 case FIB_PATH_TYPE_DEAG:
2071 if (DPO_PROTO_BIER == path->fp_nh_proto)
2073 bier_disp_table_contribute_forwarding(path->deag.fp_tbl_id,
2079 * Resolve via a lookup DPO.
2080 * FIXME. control plane should add routes with a table ID
2082 lookup_input_t input;
2085 cast = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ?
2088 input = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DEAG_SRC ?
2089 LOOKUP_INPUT_SRC_ADDR :
2090 LOOKUP_INPUT_DST_ADDR);
2092 lookup_dpo_add_or_lock_w_fib_index(path->deag.fp_tbl_id,
2096 LOOKUP_TABLE_FROM_CONFIG,
2101 case FIB_PATH_TYPE_DVR:
2102 dvr_dpo_add_or_lock(path->attached.fp_interface,
2106 case FIB_PATH_TYPE_RECEIVE:
2108 * Resolve via a receive DPO.
2110 receive_dpo_add_or_lock(path->fp_nh_proto,
2111 path->receive.fp_interface,
2112 &path->receive.fp_addr,
2115 case FIB_PATH_TYPE_UDP_ENCAP:
2116 udp_encap_lock(path->udp_encap.fp_udp_encap_id);
2117 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2121 case FIB_PATH_TYPE_INTF_RX: {
2123 * Resolve via a receive DPO.
2125 interface_rx_dpo_add_or_lock(path->fp_nh_proto,
2126 path->intf_rx.fp_interface,
2130 case FIB_PATH_TYPE_EXCLUSIVE:
2132 * Resolve via the user provided DPO
2134 dpo_copy(&path->fp_dpo, &path->exclusive.fp_ex_dpo);
2138 return (fib_path_is_resolved(path_index));
2142 fib_path_get_resolving_interface (fib_node_index_t path_index)
2146 path = fib_path_get(path_index);
2148 switch (path->fp_type)
2150 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2151 return (path->attached_next_hop.fp_interface);
2152 case FIB_PATH_TYPE_ATTACHED:
2153 return (path->attached.fp_interface);
2154 case FIB_PATH_TYPE_RECEIVE:
2155 return (path->receive.fp_interface);
2156 case FIB_PATH_TYPE_RECURSIVE:
2157 if (fib_path_is_resolved(path_index))
2159 return (fib_entry_get_resolving_interface(path->fp_via_fib));
2162 case FIB_PATH_TYPE_DVR:
2163 return (path->dvr.fp_interface);
2164 case FIB_PATH_TYPE_INTF_RX:
2165 case FIB_PATH_TYPE_UDP_ENCAP:
2166 case FIB_PATH_TYPE_SPECIAL:
2167 case FIB_PATH_TYPE_DEAG:
2168 case FIB_PATH_TYPE_EXCLUSIVE:
2169 case FIB_PATH_TYPE_BIER_FMASK:
2170 case FIB_PATH_TYPE_BIER_TABLE:
2171 case FIB_PATH_TYPE_BIER_IMP:
2174 return (dpo_get_urpf(&path->fp_dpo));
2178 fib_path_get_resolving_index (fib_node_index_t path_index)
2182 path = fib_path_get(path_index);
2184 switch (path->fp_type)
2186 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2187 case FIB_PATH_TYPE_ATTACHED:
2188 case FIB_PATH_TYPE_RECEIVE:
2189 case FIB_PATH_TYPE_INTF_RX:
2190 case FIB_PATH_TYPE_SPECIAL:
2191 case FIB_PATH_TYPE_DEAG:
2192 case FIB_PATH_TYPE_DVR:
2193 case FIB_PATH_TYPE_EXCLUSIVE:
2195 case FIB_PATH_TYPE_UDP_ENCAP:
2196 return (path->udp_encap.fp_udp_encap_id);
2197 case FIB_PATH_TYPE_RECURSIVE:
2198 return (path->fp_via_fib);
2199 case FIB_PATH_TYPE_BIER_FMASK:
2200 return (path->bier_fmask.fp_bier_fmask);
2201 case FIB_PATH_TYPE_BIER_TABLE:
2202 return (path->fp_via_bier_tbl);
2203 case FIB_PATH_TYPE_BIER_IMP:
2204 return (path->bier_imp.fp_bier_imp);
2210 fib_path_get_adj (fib_node_index_t path_index)
2214 path = fib_path_get(path_index);
2216 ASSERT(dpo_is_adj(&path->fp_dpo));
2217 if (dpo_is_adj(&path->fp_dpo))
2219 return (path->fp_dpo.dpoi_index);
2221 return (ADJ_INDEX_INVALID);
2225 fib_path_get_weight (fib_node_index_t path_index)
2229 path = fib_path_get(path_index);
2233 return (path->fp_weight);
2237 fib_path_get_preference (fib_node_index_t path_index)
2241 path = fib_path_get(path_index);
2245 return (path->fp_preference);
2249 fib_path_get_rpf_id (fib_node_index_t path_index)
2253 path = fib_path_get(path_index);
2257 if (FIB_PATH_CFG_FLAG_RPF_ID & path->fp_cfg_flags)
2259 return (path->deag.fp_rpf_id);
2266 * @brief Contribute the path's adjacency to the list passed.
2267 * By calling this function over all paths, recursively, a child
2268 * can construct its full set of forwarding adjacencies, and hence its
2272 fib_path_contribute_urpf (fib_node_index_t path_index,
2277 path = fib_path_get(path_index);
2280 * resolved and unresolved paths contribute to the RPF list.
2282 switch (path->fp_type)
2284 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2285 fib_urpf_list_append(urpf, path->attached_next_hop.fp_interface);
2288 case FIB_PATH_TYPE_ATTACHED:
2289 fib_urpf_list_append(urpf, path->attached.fp_interface);
2292 case FIB_PATH_TYPE_RECURSIVE:
2293 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib &&
2294 !fib_path_is_looped(path_index))
2297 * there's unresolved due to constraints, and there's unresolved
2298 * due to ain't got no via. can't do nowt w'out via.
2300 fib_entry_contribute_urpf(path->fp_via_fib, urpf);
2304 case FIB_PATH_TYPE_EXCLUSIVE:
2305 case FIB_PATH_TYPE_SPECIAL:
2308 * these path types may link to an adj, if that's what
2311 u32 rpf_sw_if_index;
2313 rpf_sw_if_index = dpo_get_urpf(&path->fp_dpo);
2315 if (~0 != rpf_sw_if_index)
2317 fib_urpf_list_append(urpf, rpf_sw_if_index);
2321 case FIB_PATH_TYPE_DVR:
2322 fib_urpf_list_append(urpf, path->dvr.fp_interface);
2324 case FIB_PATH_TYPE_DEAG:
2325 case FIB_PATH_TYPE_RECEIVE:
2326 case FIB_PATH_TYPE_INTF_RX:
2327 case FIB_PATH_TYPE_UDP_ENCAP:
2328 case FIB_PATH_TYPE_BIER_FMASK:
2329 case FIB_PATH_TYPE_BIER_TABLE:
2330 case FIB_PATH_TYPE_BIER_IMP:
2332 * these path types don't link to an adj
2339 fib_path_stack_mpls_disp (fib_node_index_t path_index,
2340 dpo_proto_t payload_proto,
2341 fib_mpls_lsp_mode_t mode,
2346 path = fib_path_get(path_index);
2350 switch (path->fp_type)
2352 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2354 dpo_id_t tmp = DPO_INVALID;
2356 dpo_copy(&tmp, dpo);
2358 mpls_disp_dpo_create(payload_proto, ~0, mode, &tmp, dpo);
2362 case FIB_PATH_TYPE_DEAG:
2364 dpo_id_t tmp = DPO_INVALID;
2366 dpo_copy(&tmp, dpo);
2368 mpls_disp_dpo_create(payload_proto,
2369 path->deag.fp_rpf_id,
2374 case FIB_PATH_TYPE_RECEIVE:
2375 case FIB_PATH_TYPE_ATTACHED:
2376 case FIB_PATH_TYPE_RECURSIVE:
2377 case FIB_PATH_TYPE_INTF_RX:
2378 case FIB_PATH_TYPE_UDP_ENCAP:
2379 case FIB_PATH_TYPE_EXCLUSIVE:
2380 case FIB_PATH_TYPE_SPECIAL:
2381 case FIB_PATH_TYPE_BIER_FMASK:
2382 case FIB_PATH_TYPE_BIER_TABLE:
2383 case FIB_PATH_TYPE_BIER_IMP:
2384 case FIB_PATH_TYPE_DVR:
2388 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_POP_PW_CW)
2390 dpo_id_t tmp = DPO_INVALID;
2392 dpo_copy(&tmp, dpo);
2394 pw_cw_dpo_create(&tmp, dpo);
2400 fib_path_contribute_forwarding (fib_node_index_t path_index,
2401 fib_forward_chain_type_t fct,
2406 path = fib_path_get(path_index);
2409 ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS != fct);
2412 * The DPO stored in the path was created when the path was resolved.
2413 * This then represents the path's 'native' protocol; IP.
2414 * For all others will need to go find something else.
2416 if (fib_path_to_chain_type(path) == fct)
2418 dpo_copy(dpo, &path->fp_dpo);
2422 switch (path->fp_type)
2424 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2427 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2428 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2429 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2430 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2431 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2432 case FIB_FORW_CHAIN_TYPE_NSH:
2433 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2434 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2439 * get a appropriate link type adj.
2441 ai = fib_path_attached_next_hop_get_adj(
2443 fib_forw_chain_type_to_link_type(fct));
2444 dpo_set(dpo, DPO_ADJACENCY,
2445 fib_forw_chain_type_to_dpo_proto(fct), ai);
2450 case FIB_FORW_CHAIN_TYPE_BIER:
2454 case FIB_PATH_TYPE_RECURSIVE:
2457 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2458 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2459 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2460 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2461 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2462 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2463 case FIB_FORW_CHAIN_TYPE_BIER:
2464 fib_path_recursive_adj_update(path, fct, dpo);
2466 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2467 case FIB_FORW_CHAIN_TYPE_NSH:
2472 case FIB_PATH_TYPE_BIER_TABLE:
2475 case FIB_FORW_CHAIN_TYPE_BIER:
2476 bier_table_contribute_forwarding(path->fp_via_bier_tbl, dpo);
2478 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2479 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2480 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2481 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2482 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2483 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2484 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2485 case FIB_FORW_CHAIN_TYPE_NSH:
2490 case FIB_PATH_TYPE_BIER_FMASK:
2493 case FIB_FORW_CHAIN_TYPE_BIER:
2494 fib_path_bier_fmask_update(path, dpo);
2496 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2497 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2498 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2499 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2500 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2501 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2502 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2503 case FIB_FORW_CHAIN_TYPE_NSH:
2508 case FIB_PATH_TYPE_BIER_IMP:
2509 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
2510 fib_forw_chain_type_to_dpo_proto(fct),
2513 case FIB_PATH_TYPE_DEAG:
2516 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2517 lookup_dpo_add_or_lock_w_table_id(MPLS_FIB_DEFAULT_TABLE_ID,
2520 LOOKUP_INPUT_DST_ADDR,
2521 LOOKUP_TABLE_FROM_CONFIG,
2524 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2525 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2526 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2527 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2528 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2529 dpo_copy(dpo, &path->fp_dpo);
2531 case FIB_FORW_CHAIN_TYPE_BIER:
2533 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2534 case FIB_FORW_CHAIN_TYPE_NSH:
2539 case FIB_PATH_TYPE_EXCLUSIVE:
2540 dpo_copy(dpo, &path->exclusive.fp_ex_dpo);
2542 case FIB_PATH_TYPE_ATTACHED:
2545 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2546 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2547 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2548 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2549 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2550 case FIB_FORW_CHAIN_TYPE_NSH:
2551 case FIB_FORW_CHAIN_TYPE_BIER:
2556 * get a appropriate link type adj.
2558 ai = fib_path_attached_get_adj(
2560 fib_forw_chain_type_to_link_type(fct));
2561 dpo_set(dpo, DPO_ADJACENCY,
2562 fib_forw_chain_type_to_dpo_proto(fct), ai);
2566 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2567 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2572 * Create the adj needed for sending IP multicast traffic
2574 ai = adj_mcast_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
2575 fib_forw_chain_type_to_link_type(fct),
2576 path->attached.fp_interface);
2577 dpo_set(dpo, DPO_ADJACENCY,
2578 fib_forw_chain_type_to_dpo_proto(fct),
2585 case FIB_PATH_TYPE_INTF_RX:
2587 * Create the adj needed for sending IP multicast traffic
2589 interface_rx_dpo_add_or_lock(fib_forw_chain_type_to_dpo_proto(fct),
2590 path->attached.fp_interface,
2593 case FIB_PATH_TYPE_UDP_ENCAP:
2594 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2598 case FIB_PATH_TYPE_RECEIVE:
2599 case FIB_PATH_TYPE_SPECIAL:
2600 case FIB_PATH_TYPE_DVR:
2601 dpo_copy(dpo, &path->fp_dpo);
2607 load_balance_path_t *
2608 fib_path_append_nh_for_multipath_hash (fib_node_index_t path_index,
2609 fib_forward_chain_type_t fct,
2610 load_balance_path_t *hash_key)
2612 load_balance_path_t *mnh;
2615 path = fib_path_get(path_index);
2619 vec_add2(hash_key, mnh, 1);
2621 mnh->path_weight = path->fp_weight;
2622 mnh->path_index = path_index;
2624 if (fib_path_is_resolved(path_index))
2626 fib_path_contribute_forwarding(path_index, fct, &mnh->path_dpo);
2630 dpo_copy(&mnh->path_dpo,
2631 drop_dpo_get(fib_forw_chain_type_to_dpo_proto(fct)));
2637 fib_path_is_recursive_constrained (fib_node_index_t path_index)
2641 path = fib_path_get(path_index);
2643 return ((FIB_PATH_TYPE_RECURSIVE == path->fp_type) &&
2644 ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED) ||
2645 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)));
2649 fib_path_is_exclusive (fib_node_index_t path_index)
2653 path = fib_path_get(path_index);
2655 return (FIB_PATH_TYPE_EXCLUSIVE == path->fp_type);
2659 fib_path_is_deag (fib_node_index_t path_index)
2663 path = fib_path_get(path_index);
2665 return (FIB_PATH_TYPE_DEAG == path->fp_type);
2669 fib_path_is_resolved (fib_node_index_t path_index)
2673 path = fib_path_get(path_index);
2675 return (dpo_id_is_valid(&path->fp_dpo) &&
2676 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED) &&
2677 !fib_path_is_looped(path_index) &&
2678 !fib_path_is_permanent_drop(path));
2682 fib_path_is_looped (fib_node_index_t path_index)
2686 path = fib_path_get(path_index);
2688 return (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP);
2691 fib_path_list_walk_rc_t
2692 fib_path_encode (fib_node_index_t path_list_index,
2693 fib_node_index_t path_index,
2694 const fib_path_ext_t *path_ext,
2697 fib_path_encode_ctx_t *ctx = args;
2698 fib_route_path_t *rpath;
2701 path = fib_path_get(path_index);
2703 return (FIB_PATH_LIST_WALK_CONTINUE);
2705 vec_add2(ctx->rpaths, rpath, 1);
2706 rpath->frp_weight = path->fp_weight;
2707 rpath->frp_preference = path->fp_preference;
2708 rpath->frp_proto = path->fp_nh_proto;
2709 rpath->frp_sw_if_index = ~0;
2710 rpath->frp_fib_index = 0;
2712 switch (path->fp_type)
2714 case FIB_PATH_TYPE_RECEIVE:
2715 rpath->frp_addr = path->receive.fp_addr;
2716 rpath->frp_sw_if_index = path->receive.fp_interface;
2717 rpath->frp_flags |= FIB_ROUTE_PATH_LOCAL;
2719 case FIB_PATH_TYPE_ATTACHED:
2720 rpath->frp_sw_if_index = path->attached.fp_interface;
2722 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2723 rpath->frp_sw_if_index = path->attached_next_hop.fp_interface;
2724 rpath->frp_addr = path->attached_next_hop.fp_nh;
2726 case FIB_PATH_TYPE_BIER_FMASK:
2727 rpath->frp_bier_fmask = path->bier_fmask.fp_bier_fmask;
2729 case FIB_PATH_TYPE_SPECIAL:
2731 case FIB_PATH_TYPE_DEAG:
2732 rpath->frp_fib_index = path->deag.fp_tbl_id;
2733 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
2735 rpath->frp_flags |= FIB_ROUTE_PATH_RPF_ID;
2738 case FIB_PATH_TYPE_RECURSIVE:
2739 rpath->frp_addr = path->recursive.fp_nh.fp_ip;
2740 rpath->frp_fib_index = path->recursive.fp_tbl_id;
2742 case FIB_PATH_TYPE_DVR:
2743 rpath->frp_sw_if_index = path->dvr.fp_interface;
2744 rpath->frp_flags |= FIB_ROUTE_PATH_DVR;
2746 case FIB_PATH_TYPE_UDP_ENCAP:
2747 rpath->frp_udp_encap_id = path->udp_encap.fp_udp_encap_id;
2748 rpath->frp_flags |= FIB_ROUTE_PATH_UDP_ENCAP;
2750 case FIB_PATH_TYPE_INTF_RX:
2751 rpath->frp_sw_if_index = path->receive.fp_interface;
2752 rpath->frp_flags |= FIB_ROUTE_PATH_INTF_RX;
2754 case FIB_PATH_TYPE_EXCLUSIVE:
2755 rpath->frp_flags |= FIB_ROUTE_PATH_EXCLUSIVE;
2760 if (path_ext && path_ext->fpe_type == FIB_PATH_EXT_MPLS)
2762 rpath->frp_label_stack = path_ext->fpe_path.frp_label_stack;
2765 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP)
2766 rpath->frp_flags |= FIB_ROUTE_PATH_DROP;
2767 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH)
2768 rpath->frp_flags |= FIB_ROUTE_PATH_ICMP_UNREACH;
2769 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT)
2770 rpath->frp_flags |= FIB_ROUTE_PATH_ICMP_PROHIBIT;
2772 return (FIB_PATH_LIST_WALK_CONTINUE);
2776 fib_path_get_proto (fib_node_index_t path_index)
2780 path = fib_path_get(path_index);
2782 return (path->fp_nh_proto);
2786 fib_path_module_init (void)
2788 fib_node_register_type (FIB_NODE_TYPE_PATH, &fib_path_vft);
2789 fib_path_logger = vlib_log_register_class ("fib", "path");
2792 static clib_error_t *
2793 show_fib_path_command (vlib_main_t * vm,
2794 unformat_input_t * input,
2795 vlib_cli_command_t * cmd)
2797 fib_node_index_t pi;
2800 if (unformat (input, "%d", &pi))
2803 * show one in detail
2805 if (!pool_is_free_index(fib_path_pool, pi))
2807 path = fib_path_get(pi);
2808 u8 *s = format(NULL, "%U", format_fib_path, pi, 1,
2809 FIB_PATH_FORMAT_FLAGS_NONE);
2810 s = format(s, "\n children:");
2811 s = fib_node_children_format(path->fp_node.fn_children, s);
2812 vlib_cli_output (vm, "%s", s);
2817 vlib_cli_output (vm, "path %d invalid", pi);
2822 vlib_cli_output (vm, "FIB Paths");
2823 pool_foreach_index (pi, fib_path_pool,
2825 vlib_cli_output (vm, "%U", format_fib_path, pi, 0,
2826 FIB_PATH_FORMAT_FLAGS_NONE);
2833 VLIB_CLI_COMMAND (show_fib_path, static) = {
2834 .path = "show fib paths",
2835 .function = show_fib_path_command,
2836 .short_help = "show fib paths",