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)
649 fib_path_attached_next_hop_get_adj (fib_path_t *path,
653 fib_node_index_t fib_path_index;
654 fib_protocol_t nh_proto;
657 fib_path_index = fib_path_get_index(path);
658 nh_proto = dpo_proto_to_fib(path->fp_nh_proto);
660 if (vnet_sw_interface_is_p2p(vnet_get_main(),
661 path->attached_next_hop.fp_interface))
664 * if the interface is p2p then the adj for the specific
665 * neighbour on that link will never exist. on p2p links
666 * the subnet address (the attached route) links to the
667 * auto-adj (see below), we want that adj here too.
669 ai = adj_nbr_add_or_lock(nh_proto, link, &zero_addr,
670 path->attached_next_hop.fp_interface);
674 ai = adj_nbr_add_or_lock(nh_proto, link,
675 &path->attached_next_hop.fp_nh,
676 path->attached_next_hop.fp_interface);
679 dpo_set(dpo, DPO_ADJACENCY, vnet_link_to_dpo_proto(link), ai);
682 return (fib_path_get(fib_path_index));
686 fib_path_attached_next_hop_set (fib_path_t *path)
689 * resolve directly via the adjacency discribed by the
690 * interface and next-hop
692 path = fib_path_attached_next_hop_get_adj(path,
693 dpo_proto_to_link(path->fp_nh_proto),
696 ASSERT(dpo_is_adj(&path->fp_dpo));
699 * become a child of the adjacency so we receive updates
700 * when its rewrite changes
702 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
704 fib_path_get_index(path));
706 if (!vnet_sw_interface_is_up(vnet_get_main(),
707 path->attached_next_hop.fp_interface) ||
708 !adj_is_up(path->fp_dpo.dpoi_index))
710 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
715 fib_path_attached_get_adj (fib_path_t *path,
719 fib_protocol_t nh_proto;
721 nh_proto = dpo_proto_to_fib(path->fp_nh_proto);
723 if (vnet_sw_interface_is_p2p(vnet_get_main(),
724 path->attached.fp_interface))
727 * point-2-point interfaces do not require a glean, since
728 * there is nothing to ARP. Install a rewrite/nbr adj instead
732 ai = adj_nbr_add_or_lock(nh_proto, link, &zero_addr,
733 path->attached.fp_interface);
735 dpo_set(dpo, DPO_ADJACENCY, vnet_link_to_dpo_proto(link), ai);
738 else if (vnet_sw_interface_is_nbma(vnet_get_main(),
739 path->attached.fp_interface))
741 dpo_copy(dpo, drop_dpo_get(path->fp_nh_proto));
747 ai = adj_glean_add_or_lock(nh_proto, link,
748 path->attached.fp_interface,
750 dpo_set(dpo, DPO_ADJACENCY_GLEAN, vnet_link_to_dpo_proto(link), ai);
756 * create of update the paths recursive adj
759 fib_path_recursive_adj_update (fib_path_t *path,
760 fib_forward_chain_type_t fct,
763 dpo_id_t via_dpo = DPO_INVALID;
766 * get the DPO to resolve through from the via-entry
768 fib_entry_contribute_forwarding(path->fp_via_fib,
774 * hope for the best - clear if restrictions apply.
776 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
779 * Validate any recursion constraints and over-ride the via
782 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP)
784 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
785 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
787 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)
790 * the via FIB must be a host route.
791 * note the via FIB just added will always be a host route
792 * since it is an RR source added host route. So what we need to
793 * check is whether the route has other sources. If it does then
794 * some other source has added it as a host route. If it doesn't
795 * then it was added only here and inherits forwarding from a cover.
796 * the cover is not a host route.
797 * The RR source is the lowest priority source, so we check if it
798 * is the best. if it is there are no other sources.
800 if (fib_entry_get_best_source(path->fp_via_fib) >= FIB_SOURCE_RR)
802 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
803 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
806 * PIC edge trigger. let the load-balance maps know
808 load_balance_map_path_state_change(fib_path_get_index(path));
811 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED)
814 * RR source entries inherit the flags from the cover, so
815 * we can check the via directly
817 if (!(FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags(path->fp_via_fib)))
819 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
820 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
823 * PIC edge trigger. let the load-balance maps know
825 load_balance_map_path_state_change(fib_path_get_index(path));
829 * check for over-riding factors on the FIB entry itself
831 if (!fib_entry_is_resolved(path->fp_via_fib))
833 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
834 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
837 * PIC edge trigger. let the load-balance maps know
839 load_balance_map_path_state_change(fib_path_get_index(path));
843 * If this path is contributing a drop, then it's not resolved
845 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
847 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
851 * update the path's contributed DPO
853 dpo_copy(dpo, &via_dpo);
855 FIB_PATH_DBG(path, "recursive update:");
861 * re-evaulate the forwarding state for a via fmask path
864 fib_path_bier_fmask_update (fib_path_t *path,
867 bier_fmask_contribute_forwarding(path->bier_fmask.fp_bier_fmask, dpo);
870 * if we are stakcing on the drop, then the path is not resolved
872 if (dpo_is_drop(dpo))
874 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
878 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
883 * fib_path_is_permanent_drop
885 * Return !0 if the path is configured to permanently drop,
886 * despite other attributes.
889 fib_path_is_permanent_drop (fib_path_t *path)
891 return ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP) ||
892 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP));
898 * Remove our dependency on the resolution target
901 fib_path_unresolve (fib_path_t *path)
904 * the forced drop path does not need unresolving
906 if (fib_path_is_permanent_drop(path))
911 switch (path->fp_type)
913 case FIB_PATH_TYPE_RECURSIVE:
914 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
916 fib_entry_child_remove(path->fp_via_fib,
918 fib_table_entry_special_remove(path->recursive.fp_tbl_id,
919 fib_entry_get_prefix(path->fp_via_fib),
921 fib_table_unlock(path->recursive.fp_tbl_id,
922 dpo_proto_to_fib(path->fp_nh_proto),
924 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
927 case FIB_PATH_TYPE_BIER_FMASK:
928 bier_fmask_child_remove(path->fp_via_bier_fmask,
931 case FIB_PATH_TYPE_BIER_IMP:
932 bier_imp_unlock(path->fp_dpo.dpoi_index);
934 case FIB_PATH_TYPE_BIER_TABLE:
935 bier_table_ecmp_unlock(path->fp_via_bier_tbl);
937 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
938 case FIB_PATH_TYPE_ATTACHED:
939 if (dpo_is_adj(&path->fp_dpo))
940 adj_child_remove(path->fp_dpo.dpoi_index,
943 case FIB_PATH_TYPE_UDP_ENCAP:
944 udp_encap_unlock(path->fp_dpo.dpoi_index);
946 case FIB_PATH_TYPE_EXCLUSIVE:
947 dpo_reset(&path->exclusive.fp_ex_dpo);
949 case FIB_PATH_TYPE_SPECIAL:
950 case FIB_PATH_TYPE_RECEIVE:
951 case FIB_PATH_TYPE_INTF_RX:
952 case FIB_PATH_TYPE_DEAG:
953 case FIB_PATH_TYPE_DVR:
955 * these hold only the path's DPO, which is reset below.
961 * release the adj we were holding and pick up the
964 dpo_reset(&path->fp_dpo);
965 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
970 static fib_forward_chain_type_t
971 fib_path_to_chain_type (const fib_path_t *path)
973 if (DPO_PROTO_MPLS == path->fp_nh_proto)
975 if (FIB_PATH_TYPE_RECURSIVE == path->fp_type &&
976 MPLS_EOS == path->recursive.fp_nh.fp_eos)
978 return (FIB_FORW_CHAIN_TYPE_MPLS_EOS);
982 return (FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS);
987 return (fib_forw_chain_type_from_dpo_proto(path->fp_nh_proto));
992 * fib_path_back_walk_notify
994 * A back walk has reach this path.
996 static fib_node_back_walk_rc_t
997 fib_path_back_walk_notify (fib_node_t *node,
998 fib_node_back_walk_ctx_t *ctx)
1002 path = fib_path_from_fib_node(node);
1004 FIB_PATH_DBG(path, "bw:%U",
1005 format_fib_node_bw_reason, ctx->fnbw_reason);
1007 switch (path->fp_type)
1009 case FIB_PATH_TYPE_RECURSIVE:
1010 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
1013 * modify the recursive adjacency to use the new forwarding
1015 * this update is visible to packets in flight in the DP.
1017 fib_path_recursive_adj_update(
1019 fib_path_to_chain_type(path),
1022 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
1023 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
1026 * ADJ updates (complete<->incomplete) do not need to propagate to
1027 * recursive entries.
1028 * The only reason its needed as far back as here, is that the adj
1029 * and the incomplete adj are a different DPO type, so the LBs need
1031 * If this walk was quashed in the fib_entry, then any non-fib_path
1032 * children (like tunnels that collapse out the LB when they stack)
1033 * would not see the update.
1035 return (FIB_NODE_BACK_WALK_CONTINUE);
1038 case FIB_PATH_TYPE_BIER_FMASK:
1039 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
1042 * update to use the BIER fmask's new forwading
1044 fib_path_bier_fmask_update(path, &path->fp_dpo);
1046 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
1047 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
1050 * ADJ updates (complete<->incomplete) do not need to propagate to
1051 * recursive entries.
1052 * The only reason its needed as far back as here, is that the adj
1053 * and the incomplete adj are a different DPO type, so the LBs need
1055 * If this walk was quashed in the fib_entry, then any non-fib_path
1056 * children (like tunnels that collapse out the LB when they stack)
1057 * would not see the update.
1059 return (FIB_NODE_BACK_WALK_CONTINUE);
1062 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1065 * ADJ_UPDATE backwalk pass silently through here and up to
1066 * the path-list when the multipath adj collapse occurs.
1067 * The reason we do this is that the assumtption is that VPP
1068 * runs in an environment where the Control-Plane is remote
1069 * and hence reacts slowly to link up down. In order to remove
1070 * this down link from the ECMP set quickly, we back-walk.
1071 * VPP also has dedicated CPUs, so we are not stealing resources
1072 * from the CP to do so.
1074 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1076 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED)
1079 * alreday resolved. no need to walk back again
1081 return (FIB_NODE_BACK_WALK_CONTINUE);
1083 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1085 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1087 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1090 * alreday unresolved. no need to walk back again
1092 return (FIB_NODE_BACK_WALK_CONTINUE);
1094 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1096 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1099 * The interface this path resolves through has been deleted.
1100 * This will leave the path in a permanent drop state. The route
1101 * needs to be removed and readded (and hence the path-list deleted)
1102 * before it can forward again.
1104 fib_path_unresolve(path);
1105 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1107 if (FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason)
1110 * restack the DPO to pick up the correct DPO sub-type
1114 if_is_up = vnet_sw_interface_is_up(
1116 path->attached_next_hop.fp_interface);
1118 path = fib_path_attached_next_hop_get_adj(
1120 dpo_proto_to_link(path->fp_nh_proto),
1123 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1124 if (if_is_up && adj_is_up(path->fp_dpo.dpoi_index))
1126 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1132 * If the interface is not up there is no reason to walk
1133 * back to children. if we did they would only evalute
1134 * that this path is unresolved and hence it would
1135 * not contribute the adjacency - so it would be wasted
1138 return (FIB_NODE_BACK_WALK_CONTINUE);
1141 if (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason)
1143 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1146 * alreday unresolved. no need to walk back again
1148 return (FIB_NODE_BACK_WALK_CONTINUE);
1151 * the adj has gone down. the path is no longer resolved.
1153 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1156 case FIB_PATH_TYPE_ATTACHED:
1157 case FIB_PATH_TYPE_DVR:
1159 * FIXME; this could schedule a lower priority walk, since attached
1160 * routes are not usually in ECMP configurations so the backwalk to
1161 * the FIB entry does not need to be high priority
1163 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1165 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1167 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1169 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1171 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1173 fib_path_unresolve(path);
1174 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1177 case FIB_PATH_TYPE_UDP_ENCAP:
1179 dpo_id_t via_dpo = DPO_INVALID;
1182 * hope for the best - clear if restrictions apply.
1184 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1186 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
1190 * If this path is contributing a drop, then it's not resolved
1192 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
1194 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1198 * update the path's contributed DPO
1200 dpo_copy(&path->fp_dpo, &via_dpo);
1201 dpo_reset(&via_dpo);
1204 case FIB_PATH_TYPE_INTF_RX:
1206 case FIB_PATH_TYPE_DEAG:
1208 * FIXME When VRF delete is allowed this will need a poke.
1210 case FIB_PATH_TYPE_SPECIAL:
1211 case FIB_PATH_TYPE_RECEIVE:
1212 case FIB_PATH_TYPE_EXCLUSIVE:
1213 case FIB_PATH_TYPE_BIER_TABLE:
1214 case FIB_PATH_TYPE_BIER_IMP:
1216 * these path types have no parents. so to be
1217 * walked from one is unexpected.
1224 * propagate the backwalk further to the path-list
1226 fib_path_list_back_walk(path->fp_pl_index, ctx);
1228 return (FIB_NODE_BACK_WALK_CONTINUE);
1232 fib_path_memory_show (void)
1234 fib_show_memory_usage("Path",
1235 pool_elts(fib_path_pool),
1236 pool_len(fib_path_pool),
1237 sizeof(fib_path_t));
1241 * The FIB path's graph node virtual function table
1243 static const fib_node_vft_t fib_path_vft = {
1244 .fnv_get = fib_path_get_node,
1245 .fnv_last_lock = fib_path_last_lock_gone,
1246 .fnv_back_walk = fib_path_back_walk_notify,
1247 .fnv_mem_show = fib_path_memory_show,
1250 static fib_path_cfg_flags_t
1251 fib_path_route_flags_to_cfg_flags (const fib_route_path_t *rpath)
1253 fib_path_cfg_flags_t cfg_flags = FIB_PATH_CFG_FLAG_NONE;
1255 if (rpath->frp_flags & FIB_ROUTE_PATH_POP_PW_CW)
1256 cfg_flags |= FIB_PATH_CFG_FLAG_POP_PW_CW;
1257 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_HOST)
1258 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_HOST;
1259 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_ATTACHED)
1260 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED;
1261 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1262 cfg_flags |= FIB_PATH_CFG_FLAG_LOCAL;
1263 if (rpath->frp_flags & FIB_ROUTE_PATH_ATTACHED)
1264 cfg_flags |= FIB_PATH_CFG_FLAG_ATTACHED;
1265 if (rpath->frp_flags & FIB_ROUTE_PATH_INTF_RX)
1266 cfg_flags |= FIB_PATH_CFG_FLAG_INTF_RX;
1267 if (rpath->frp_flags & FIB_ROUTE_PATH_RPF_ID)
1268 cfg_flags |= FIB_PATH_CFG_FLAG_RPF_ID;
1269 if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1270 cfg_flags |= FIB_PATH_CFG_FLAG_EXCLUSIVE;
1271 if (rpath->frp_flags & FIB_ROUTE_PATH_DROP)
1272 cfg_flags |= FIB_PATH_CFG_FLAG_DROP;
1273 if (rpath->frp_flags & FIB_ROUTE_PATH_SOURCE_LOOKUP)
1274 cfg_flags |= FIB_PATH_CFG_FLAG_DEAG_SRC;
1275 if (rpath->frp_flags & FIB_ROUTE_PATH_ICMP_UNREACH)
1276 cfg_flags |= FIB_PATH_CFG_FLAG_ICMP_UNREACH;
1277 if (rpath->frp_flags & FIB_ROUTE_PATH_ICMP_PROHIBIT)
1278 cfg_flags |= FIB_PATH_CFG_FLAG_ICMP_PROHIBIT;
1286 * Create and initialise a new path object.
1287 * return the index of the path.
1290 fib_path_create (fib_node_index_t pl_index,
1291 const fib_route_path_t *rpath)
1295 pool_get(fib_path_pool, path);
1296 clib_memset(path, 0, sizeof(*path));
1298 fib_node_init(&path->fp_node,
1299 FIB_NODE_TYPE_PATH);
1301 dpo_reset(&path->fp_dpo);
1302 path->fp_pl_index = pl_index;
1303 path->fp_nh_proto = rpath->frp_proto;
1304 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1305 path->fp_weight = rpath->frp_weight;
1306 if (0 == path->fp_weight)
1309 * a weight of 0 is a meaningless value. We could either reject it, and thus force
1310 * clients to always use 1, or we can accept it and fixup approrpiately.
1312 path->fp_weight = 1;
1314 path->fp_preference = rpath->frp_preference;
1315 path->fp_cfg_flags = fib_path_route_flags_to_cfg_flags(rpath);
1318 * deduce the path's tpye from the parementers and save what is needed.
1320 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_LOCAL)
1322 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1323 path->receive.fp_interface = rpath->frp_sw_if_index;
1324 path->receive.fp_addr = rpath->frp_addr;
1326 else if (rpath->frp_flags & FIB_ROUTE_PATH_UDP_ENCAP)
1328 path->fp_type = FIB_PATH_TYPE_UDP_ENCAP;
1329 path->udp_encap.fp_udp_encap_id = rpath->frp_udp_encap_id;
1331 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_INTF_RX)
1333 path->fp_type = FIB_PATH_TYPE_INTF_RX;
1334 path->intf_rx.fp_interface = rpath->frp_sw_if_index;
1336 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
1338 path->fp_type = FIB_PATH_TYPE_DEAG;
1339 path->deag.fp_tbl_id = rpath->frp_fib_index;
1340 path->deag.fp_rpf_id = rpath->frp_rpf_id;
1342 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_FMASK)
1344 path->fp_type = FIB_PATH_TYPE_BIER_FMASK;
1345 path->bier_fmask.fp_bier_fmask = rpath->frp_bier_fmask;
1347 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_IMP)
1349 path->fp_type = FIB_PATH_TYPE_BIER_IMP;
1350 path->bier_imp.fp_bier_imp = rpath->frp_bier_imp;
1352 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_TABLE)
1354 path->fp_type = FIB_PATH_TYPE_BIER_TABLE;
1355 path->bier_table.fp_bier_tbl = rpath->frp_bier_tbl;
1357 else if (rpath->frp_flags & FIB_ROUTE_PATH_DEAG)
1359 path->fp_type = FIB_PATH_TYPE_DEAG;
1360 path->deag.fp_tbl_id = rpath->frp_fib_index;
1362 else if (rpath->frp_flags & FIB_ROUTE_PATH_DVR)
1364 path->fp_type = FIB_PATH_TYPE_DVR;
1365 path->dvr.fp_interface = rpath->frp_sw_if_index;
1367 else if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1369 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1370 dpo_copy(&path->exclusive.fp_ex_dpo, &rpath->dpo);
1372 else if ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT) ||
1373 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH))
1375 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1377 else if ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_CLASSIFY))
1379 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1380 path->classify.fp_classify_table_id = rpath->frp_classify_table_id;
1382 else if (~0 != rpath->frp_sw_if_index)
1384 if (ip46_address_is_zero(&rpath->frp_addr))
1386 path->fp_type = FIB_PATH_TYPE_ATTACHED;
1387 path->attached.fp_interface = rpath->frp_sw_if_index;
1391 path->fp_type = FIB_PATH_TYPE_ATTACHED_NEXT_HOP;
1392 path->attached_next_hop.fp_interface = rpath->frp_sw_if_index;
1393 path->attached_next_hop.fp_nh = rpath->frp_addr;
1398 if (ip46_address_is_zero(&rpath->frp_addr))
1400 if (~0 == rpath->frp_fib_index)
1402 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1406 path->fp_type = FIB_PATH_TYPE_DEAG;
1407 path->deag.fp_tbl_id = rpath->frp_fib_index;
1408 path->deag.fp_rpf_id = ~0;
1413 path->fp_type = FIB_PATH_TYPE_RECURSIVE;
1414 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1416 path->recursive.fp_nh.fp_local_label = rpath->frp_local_label;
1417 path->recursive.fp_nh.fp_eos = rpath->frp_eos;
1421 path->recursive.fp_nh.fp_ip = rpath->frp_addr;
1423 path->recursive.fp_tbl_id = rpath->frp_fib_index;
1427 FIB_PATH_DBG(path, "create");
1429 return (fib_path_get_index(path));
1433 * fib_path_create_special
1435 * Create and initialise a new path object.
1436 * return the index of the path.
1439 fib_path_create_special (fib_node_index_t pl_index,
1440 dpo_proto_t nh_proto,
1441 fib_path_cfg_flags_t flags,
1442 const dpo_id_t *dpo)
1446 pool_get(fib_path_pool, path);
1447 clib_memset(path, 0, sizeof(*path));
1449 fib_node_init(&path->fp_node,
1450 FIB_NODE_TYPE_PATH);
1451 dpo_reset(&path->fp_dpo);
1453 path->fp_pl_index = pl_index;
1454 path->fp_weight = 1;
1455 path->fp_preference = 0;
1456 path->fp_nh_proto = nh_proto;
1457 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1458 path->fp_cfg_flags = flags;
1460 if (FIB_PATH_CFG_FLAG_DROP & flags)
1462 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1464 else if (FIB_PATH_CFG_FLAG_LOCAL & flags)
1466 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1467 path->attached.fp_interface = FIB_NODE_INDEX_INVALID;
1471 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1472 ASSERT(NULL != dpo);
1473 dpo_copy(&path->exclusive.fp_ex_dpo, dpo);
1476 return (fib_path_get_index(path));
1482 * Copy a path. return index of new path.
1485 fib_path_copy (fib_node_index_t path_index,
1486 fib_node_index_t path_list_index)
1488 fib_path_t *path, *orig_path;
1490 pool_get(fib_path_pool, path);
1492 orig_path = fib_path_get(path_index);
1493 ASSERT(NULL != orig_path);
1495 clib_memcpy(path, orig_path, sizeof(*path));
1497 FIB_PATH_DBG(path, "create-copy:%d", path_index);
1500 * reset the dynamic section
1502 fib_node_init(&path->fp_node, FIB_NODE_TYPE_PATH);
1503 path->fp_oper_flags = FIB_PATH_OPER_FLAG_NONE;
1504 path->fp_pl_index = path_list_index;
1505 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1506 clib_memset(&path->fp_dpo, 0, sizeof(path->fp_dpo));
1507 dpo_reset(&path->fp_dpo);
1509 return (fib_path_get_index(path));
1515 * destroy a path that is no longer required
1518 fib_path_destroy (fib_node_index_t path_index)
1522 path = fib_path_get(path_index);
1524 ASSERT(NULL != path);
1525 FIB_PATH_DBG(path, "destroy");
1527 fib_path_unresolve(path);
1529 fib_node_deinit(&path->fp_node);
1530 pool_put(fib_path_pool, path);
1536 * destroy a path that is no longer required
1539 fib_path_hash (fib_node_index_t path_index)
1543 path = fib_path_get(path_index);
1545 return (hash_memory(STRUCT_MARK_PTR(path, path_hash_start),
1546 (STRUCT_OFFSET_OF(fib_path_t, path_hash_end) -
1547 STRUCT_OFFSET_OF(fib_path_t, path_hash_start)),
1554 * Compare two paths for equivalence.
1557 fib_path_cmp_i (const fib_path_t *path1,
1558 const fib_path_t *path2)
1565 * paths of different types and protocol are not equal.
1566 * different weights and/or preference only are the same path.
1568 if (path1->fp_type != path2->fp_type)
1570 res = (path1->fp_type - path2->fp_type);
1572 else if (path1->fp_nh_proto != path2->fp_nh_proto)
1574 res = (path1->fp_nh_proto - path2->fp_nh_proto);
1579 * both paths are of the same type.
1580 * consider each type and its attributes in turn.
1582 switch (path1->fp_type)
1584 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1585 res = ip46_address_cmp(&path1->attached_next_hop.fp_nh,
1586 &path2->attached_next_hop.fp_nh);
1588 res = (path1->attached_next_hop.fp_interface -
1589 path2->attached_next_hop.fp_interface);
1592 case FIB_PATH_TYPE_ATTACHED:
1593 res = (path1->attached.fp_interface -
1594 path2->attached.fp_interface);
1596 case FIB_PATH_TYPE_RECURSIVE:
1597 res = ip46_address_cmp(&path1->recursive.fp_nh.fp_ip,
1598 &path2->recursive.fp_nh.fp_ip);
1602 res = (path1->recursive.fp_tbl_id - path2->recursive.fp_tbl_id);
1605 case FIB_PATH_TYPE_BIER_FMASK:
1606 res = (path1->bier_fmask.fp_bier_fmask -
1607 path2->bier_fmask.fp_bier_fmask);
1609 case FIB_PATH_TYPE_BIER_IMP:
1610 res = (path1->bier_imp.fp_bier_imp -
1611 path2->bier_imp.fp_bier_imp);
1613 case FIB_PATH_TYPE_BIER_TABLE:
1614 res = bier_table_id_cmp(&path1->bier_table.fp_bier_tbl,
1615 &path2->bier_table.fp_bier_tbl);
1617 case FIB_PATH_TYPE_DEAG:
1618 res = (path1->deag.fp_tbl_id - path2->deag.fp_tbl_id);
1621 res = (path1->deag.fp_rpf_id - path2->deag.fp_rpf_id);
1624 case FIB_PATH_TYPE_INTF_RX:
1625 res = (path1->intf_rx.fp_interface - path2->intf_rx.fp_interface);
1627 case FIB_PATH_TYPE_UDP_ENCAP:
1628 res = (path1->udp_encap.fp_udp_encap_id - path2->udp_encap.fp_udp_encap_id);
1630 case FIB_PATH_TYPE_DVR:
1631 res = (path1->dvr.fp_interface - path2->dvr.fp_interface);
1633 case FIB_PATH_TYPE_EXCLUSIVE:
1634 res = dpo_cmp(&path1->exclusive.fp_ex_dpo, &path2->exclusive.fp_ex_dpo);
1636 case FIB_PATH_TYPE_SPECIAL:
1637 case FIB_PATH_TYPE_RECEIVE:
1646 * fib_path_cmp_for_sort
1648 * Compare two paths for equivalence. Used during path sorting.
1649 * As usual 0 means equal.
1652 fib_path_cmp_for_sort (void * v1,
1655 fib_node_index_t *pi1 = v1, *pi2 = v2;
1656 fib_path_t *path1, *path2;
1658 path1 = fib_path_get(*pi1);
1659 path2 = fib_path_get(*pi2);
1662 * when sorting paths we want the highest preference paths
1663 * first, so that the choices set built is in prefernce order
1665 if (path1->fp_preference != path2->fp_preference)
1667 return (path1->fp_preference - path2->fp_preference);
1670 return (fib_path_cmp_i(path1, path2));
1676 * Compare two paths for equivalence.
1679 fib_path_cmp (fib_node_index_t pi1,
1680 fib_node_index_t pi2)
1682 fib_path_t *path1, *path2;
1684 path1 = fib_path_get(pi1);
1685 path2 = fib_path_get(pi2);
1687 return (fib_path_cmp_i(path1, path2));
1691 fib_path_cmp_w_route_path (fib_node_index_t path_index,
1692 const fib_route_path_t *rpath)
1697 path = fib_path_get(path_index);
1701 if (path->fp_weight != rpath->frp_weight)
1703 res = (path->fp_weight - rpath->frp_weight);
1708 * both paths are of the same type.
1709 * consider each type and its attributes in turn.
1711 switch (path->fp_type)
1713 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1714 res = ip46_address_cmp(&path->attached_next_hop.fp_nh,
1718 res = (path->attached_next_hop.fp_interface -
1719 rpath->frp_sw_if_index);
1722 case FIB_PATH_TYPE_ATTACHED:
1723 res = (path->attached.fp_interface - rpath->frp_sw_if_index);
1725 case FIB_PATH_TYPE_RECURSIVE:
1726 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1728 res = path->recursive.fp_nh.fp_local_label - rpath->frp_local_label;
1732 res = path->recursive.fp_nh.fp_eos - rpath->frp_eos;
1737 res = ip46_address_cmp(&path->recursive.fp_nh.fp_ip,
1743 res = (path->recursive.fp_tbl_id - rpath->frp_fib_index);
1746 case FIB_PATH_TYPE_BIER_FMASK:
1747 res = (path->bier_fmask.fp_bier_fmask - rpath->frp_bier_fmask);
1749 case FIB_PATH_TYPE_BIER_IMP:
1750 res = (path->bier_imp.fp_bier_imp - rpath->frp_bier_imp);
1752 case FIB_PATH_TYPE_BIER_TABLE:
1753 res = bier_table_id_cmp(&path->bier_table.fp_bier_tbl,
1754 &rpath->frp_bier_tbl);
1756 case FIB_PATH_TYPE_INTF_RX:
1757 res = (path->intf_rx.fp_interface - rpath->frp_sw_if_index);
1759 case FIB_PATH_TYPE_UDP_ENCAP:
1760 res = (path->udp_encap.fp_udp_encap_id - rpath->frp_udp_encap_id);
1762 case FIB_PATH_TYPE_DEAG:
1763 res = (path->deag.fp_tbl_id - rpath->frp_fib_index);
1766 res = (path->deag.fp_rpf_id - rpath->frp_rpf_id);
1769 case FIB_PATH_TYPE_DVR:
1770 res = (path->dvr.fp_interface - rpath->frp_sw_if_index);
1772 case FIB_PATH_TYPE_EXCLUSIVE:
1773 res = dpo_cmp(&path->exclusive.fp_ex_dpo, &rpath->dpo);
1775 case FIB_PATH_TYPE_RECEIVE:
1776 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1785 case FIB_PATH_TYPE_SPECIAL:
1794 * fib_path_recursive_loop_detect
1796 * A forward walk of the FIB object graph to detect for a cycle/loop. This
1797 * walk is initiated when an entry is linking to a new path list or from an old.
1798 * The entry vector passed contains all the FIB entrys that are children of this
1799 * path (it is all the entries encountered on the walk so far). If this vector
1800 * contains the entry this path resolve via, then a loop is about to form.
1801 * The loop must be allowed to form, since we need the dependencies in place
1802 * so that we can track when the loop breaks.
1803 * However, we MUST not produce a loop in the forwarding graph (else packets
1804 * would loop around the switch path until the loop breaks), so we mark recursive
1805 * paths as looped so that they do not contribute forwarding information.
1806 * By marking the path as looped, an etry such as;
1808 * via a.a.a.a (looped)
1809 * via b.b.b.b (not looped)
1810 * can still forward using the info provided by b.b.b.b only
1813 fib_path_recursive_loop_detect (fib_node_index_t path_index,
1814 fib_node_index_t **entry_indicies)
1818 path = fib_path_get(path_index);
1821 * the forced drop path is never looped, cos it is never resolved.
1823 if (fib_path_is_permanent_drop(path))
1828 switch (path->fp_type)
1830 case FIB_PATH_TYPE_RECURSIVE:
1832 fib_node_index_t *entry_index, *entries;
1834 entries = *entry_indicies;
1836 vec_foreach(entry_index, entries) {
1837 if (*entry_index == path->fp_via_fib)
1840 * the entry that is about to link to this path-list (or
1841 * one of this path-list's children) is the same entry that
1842 * this recursive path resolves through. this is a cycle.
1852 FIB_PATH_DBG(path, "recursive loop formed");
1853 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1855 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1860 * no loop here yet. keep forward walking the graph.
1862 if (fib_entry_recursive_loop_detect(path->fp_via_fib, entry_indicies))
1864 FIB_PATH_DBG(path, "recursive loop formed");
1865 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1869 FIB_PATH_DBG(path, "recursive loop cleared");
1870 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1875 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1876 case FIB_PATH_TYPE_ATTACHED:
1877 if (dpo_is_adj(&path->fp_dpo) &&
1878 adj_recursive_loop_detect(path->fp_dpo.dpoi_index,
1881 FIB_PATH_DBG(path, "recursive loop formed");
1882 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1886 FIB_PATH_DBG(path, "recursive loop cleared");
1887 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1890 case FIB_PATH_TYPE_SPECIAL:
1891 case FIB_PATH_TYPE_DEAG:
1892 case FIB_PATH_TYPE_DVR:
1893 case FIB_PATH_TYPE_RECEIVE:
1894 case FIB_PATH_TYPE_INTF_RX:
1895 case FIB_PATH_TYPE_UDP_ENCAP:
1896 case FIB_PATH_TYPE_EXCLUSIVE:
1897 case FIB_PATH_TYPE_BIER_FMASK:
1898 case FIB_PATH_TYPE_BIER_TABLE:
1899 case FIB_PATH_TYPE_BIER_IMP:
1901 * these path types cannot be part of a loop, since they are the leaves
1907 return (fib_path_is_looped(path_index));
1911 fib_path_resolve (fib_node_index_t path_index)
1915 path = fib_path_get(path_index);
1918 * hope for the best.
1920 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1923 * the forced drop path resolves via the drop adj
1925 if (fib_path_is_permanent_drop(path))
1927 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1928 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1929 return (fib_path_is_resolved(path_index));
1932 switch (path->fp_type)
1934 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1935 fib_path_attached_next_hop_set(path);
1937 case FIB_PATH_TYPE_ATTACHED:
1939 dpo_id_t tmp = DPO_INVALID;
1942 * path->attached.fp_interface
1944 if (!vnet_sw_interface_is_up(vnet_get_main(),
1945 path->attached.fp_interface))
1947 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1949 fib_path_attached_get_adj(path,
1950 dpo_proto_to_link(path->fp_nh_proto),
1954 * re-fetch after possible mem realloc
1956 path = fib_path_get(path_index);
1957 dpo_copy(&path->fp_dpo, &tmp);
1960 * become a child of the adjacency so we receive updates
1961 * when the interface state changes
1963 if (dpo_is_adj(&path->fp_dpo))
1965 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
1967 fib_path_get_index(path));
1972 case FIB_PATH_TYPE_RECURSIVE:
1975 * Create a RR source entry in the table for the address
1976 * that this path recurses through.
1977 * This resolve action is recursive, hence we may create
1978 * more paths in the process. more creates mean maybe realloc
1981 fib_node_index_t fei;
1984 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_fib);
1986 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1988 fib_prefix_from_mpls_label(path->recursive.fp_nh.fp_local_label,
1989 path->recursive.fp_nh.fp_eos,
1994 fib_prefix_from_ip46_addr(&path->recursive.fp_nh.fp_ip, &pfx);
1997 fib_table_lock(path->recursive.fp_tbl_id,
1998 dpo_proto_to_fib(path->fp_nh_proto),
2000 fei = fib_table_entry_special_add(path->recursive.fp_tbl_id,
2003 FIB_ENTRY_FLAG_NONE);
2005 path = fib_path_get(path_index);
2006 path->fp_via_fib = fei;
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 = fib_entry_child_add(path->fp_via_fib,
2014 fib_path_get_index(path));
2017 * create and configure the IP DPO
2019 fib_path_recursive_adj_update(
2021 fib_path_to_chain_type(path),
2026 case FIB_PATH_TYPE_BIER_FMASK:
2029 * become a dependent child of the entry so the path is
2030 * informed when the forwarding for the entry changes.
2032 path->fp_sibling = bier_fmask_child_add(path->bier_fmask.fp_bier_fmask,
2034 fib_path_get_index(path));
2036 path->fp_via_bier_fmask = path->bier_fmask.fp_bier_fmask;
2037 fib_path_bier_fmask_update(path, &path->fp_dpo);
2041 case FIB_PATH_TYPE_BIER_IMP:
2042 bier_imp_lock(path->bier_imp.fp_bier_imp);
2043 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
2047 case FIB_PATH_TYPE_BIER_TABLE:
2050 * Find/create the BIER table to link to
2052 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_bier_tbl);
2054 path->fp_via_bier_tbl =
2055 bier_table_ecmp_create_and_lock(&path->bier_table.fp_bier_tbl);
2057 bier_table_contribute_forwarding(path->fp_via_bier_tbl,
2061 case FIB_PATH_TYPE_SPECIAL:
2062 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT)
2064 ip_null_dpo_add_and_lock (path->fp_nh_proto,
2065 IP_NULL_ACTION_SEND_ICMP_PROHIBIT,
2068 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH)
2070 ip_null_dpo_add_and_lock (path->fp_nh_proto,
2071 IP_NULL_ACTION_SEND_ICMP_UNREACH,
2074 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_CLASSIFY)
2076 dpo_set (&path->fp_dpo, DPO_CLASSIFY,
2078 classify_dpo_create (path->fp_nh_proto,
2079 path->classify.fp_classify_table_id));
2084 * Resolve via the drop
2086 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
2089 case FIB_PATH_TYPE_DEAG:
2091 if (DPO_PROTO_BIER == path->fp_nh_proto)
2093 bier_disp_table_contribute_forwarding(path->deag.fp_tbl_id,
2099 * Resolve via a lookup DPO.
2100 * FIXME. control plane should add routes with a table ID
2102 lookup_input_t input;
2105 cast = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ?
2108 input = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DEAG_SRC ?
2109 LOOKUP_INPUT_SRC_ADDR :
2110 LOOKUP_INPUT_DST_ADDR);
2112 lookup_dpo_add_or_lock_w_fib_index(path->deag.fp_tbl_id,
2116 LOOKUP_TABLE_FROM_CONFIG,
2121 case FIB_PATH_TYPE_DVR:
2122 dvr_dpo_add_or_lock(path->attached.fp_interface,
2126 case FIB_PATH_TYPE_RECEIVE:
2128 * Resolve via a receive DPO.
2130 receive_dpo_add_or_lock(path->fp_nh_proto,
2131 path->receive.fp_interface,
2132 &path->receive.fp_addr,
2135 case FIB_PATH_TYPE_UDP_ENCAP:
2136 udp_encap_lock(path->udp_encap.fp_udp_encap_id);
2137 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2141 case FIB_PATH_TYPE_INTF_RX: {
2143 * Resolve via a receive DPO.
2145 interface_rx_dpo_add_or_lock(path->fp_nh_proto,
2146 path->intf_rx.fp_interface,
2150 case FIB_PATH_TYPE_EXCLUSIVE:
2152 * Resolve via the user provided DPO
2154 dpo_copy(&path->fp_dpo, &path->exclusive.fp_ex_dpo);
2158 return (fib_path_is_resolved(path_index));
2162 fib_path_get_resolving_interface (fib_node_index_t path_index)
2166 path = fib_path_get(path_index);
2168 switch (path->fp_type)
2170 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2171 return (path->attached_next_hop.fp_interface);
2172 case FIB_PATH_TYPE_ATTACHED:
2173 return (path->attached.fp_interface);
2174 case FIB_PATH_TYPE_RECEIVE:
2175 return (path->receive.fp_interface);
2176 case FIB_PATH_TYPE_RECURSIVE:
2177 if (fib_path_is_resolved(path_index))
2179 return (fib_entry_get_resolving_interface(path->fp_via_fib));
2182 case FIB_PATH_TYPE_DVR:
2183 return (path->dvr.fp_interface);
2184 case FIB_PATH_TYPE_INTF_RX:
2185 case FIB_PATH_TYPE_UDP_ENCAP:
2186 case FIB_PATH_TYPE_SPECIAL:
2187 case FIB_PATH_TYPE_DEAG:
2188 case FIB_PATH_TYPE_EXCLUSIVE:
2189 case FIB_PATH_TYPE_BIER_FMASK:
2190 case FIB_PATH_TYPE_BIER_TABLE:
2191 case FIB_PATH_TYPE_BIER_IMP:
2194 return (dpo_get_urpf(&path->fp_dpo));
2198 fib_path_get_resolving_index (fib_node_index_t path_index)
2202 path = fib_path_get(path_index);
2204 switch (path->fp_type)
2206 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2207 case FIB_PATH_TYPE_ATTACHED:
2208 case FIB_PATH_TYPE_RECEIVE:
2209 case FIB_PATH_TYPE_INTF_RX:
2210 case FIB_PATH_TYPE_SPECIAL:
2211 case FIB_PATH_TYPE_DEAG:
2212 case FIB_PATH_TYPE_DVR:
2213 case FIB_PATH_TYPE_EXCLUSIVE:
2215 case FIB_PATH_TYPE_UDP_ENCAP:
2216 return (path->udp_encap.fp_udp_encap_id);
2217 case FIB_PATH_TYPE_RECURSIVE:
2218 return (path->fp_via_fib);
2219 case FIB_PATH_TYPE_BIER_FMASK:
2220 return (path->bier_fmask.fp_bier_fmask);
2221 case FIB_PATH_TYPE_BIER_TABLE:
2222 return (path->fp_via_bier_tbl);
2223 case FIB_PATH_TYPE_BIER_IMP:
2224 return (path->bier_imp.fp_bier_imp);
2230 fib_path_get_adj (fib_node_index_t path_index)
2234 path = fib_path_get(path_index);
2236 if (dpo_is_adj(&path->fp_dpo))
2238 return (path->fp_dpo.dpoi_index);
2240 return (ADJ_INDEX_INVALID);
2244 fib_path_get_weight (fib_node_index_t path_index)
2248 path = fib_path_get(path_index);
2252 return (path->fp_weight);
2256 fib_path_get_preference (fib_node_index_t path_index)
2260 path = fib_path_get(path_index);
2264 return (path->fp_preference);
2268 fib_path_get_rpf_id (fib_node_index_t path_index)
2272 path = fib_path_get(path_index);
2276 if (FIB_PATH_CFG_FLAG_RPF_ID & path->fp_cfg_flags)
2278 return (path->deag.fp_rpf_id);
2285 * @brief Contribute the path's adjacency to the list passed.
2286 * By calling this function over all paths, recursively, a child
2287 * can construct its full set of forwarding adjacencies, and hence its
2291 fib_path_contribute_urpf (fib_node_index_t path_index,
2296 path = fib_path_get(path_index);
2299 * resolved and unresolved paths contribute to the RPF list.
2301 switch (path->fp_type)
2303 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2304 fib_urpf_list_append(urpf, path->attached_next_hop.fp_interface);
2307 case FIB_PATH_TYPE_ATTACHED:
2308 fib_urpf_list_append(urpf, path->attached.fp_interface);
2311 case FIB_PATH_TYPE_RECURSIVE:
2312 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib &&
2313 !fib_path_is_looped(path_index))
2316 * there's unresolved due to constraints, and there's unresolved
2317 * due to ain't got no via. can't do nowt w'out via.
2319 fib_entry_contribute_urpf(path->fp_via_fib, urpf);
2323 case FIB_PATH_TYPE_EXCLUSIVE:
2324 case FIB_PATH_TYPE_SPECIAL:
2327 * these path types may link to an adj, if that's what
2330 u32 rpf_sw_if_index;
2332 rpf_sw_if_index = dpo_get_urpf(&path->fp_dpo);
2334 if (~0 != rpf_sw_if_index)
2336 fib_urpf_list_append(urpf, rpf_sw_if_index);
2340 case FIB_PATH_TYPE_DVR:
2341 fib_urpf_list_append(urpf, path->dvr.fp_interface);
2343 case FIB_PATH_TYPE_DEAG:
2344 case FIB_PATH_TYPE_RECEIVE:
2345 case FIB_PATH_TYPE_INTF_RX:
2346 case FIB_PATH_TYPE_UDP_ENCAP:
2347 case FIB_PATH_TYPE_BIER_FMASK:
2348 case FIB_PATH_TYPE_BIER_TABLE:
2349 case FIB_PATH_TYPE_BIER_IMP:
2351 * these path types don't link to an adj
2358 fib_path_stack_mpls_disp (fib_node_index_t path_index,
2359 dpo_proto_t payload_proto,
2360 fib_mpls_lsp_mode_t mode,
2365 path = fib_path_get(path_index);
2369 switch (path->fp_type)
2371 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2373 dpo_id_t tmp = DPO_INVALID;
2375 dpo_copy(&tmp, dpo);
2377 mpls_disp_dpo_create(payload_proto, ~0, mode, &tmp, dpo);
2381 case FIB_PATH_TYPE_DEAG:
2383 dpo_id_t tmp = DPO_INVALID;
2385 dpo_copy(&tmp, dpo);
2387 mpls_disp_dpo_create(payload_proto,
2388 path->deag.fp_rpf_id,
2393 case FIB_PATH_TYPE_RECEIVE:
2394 case FIB_PATH_TYPE_ATTACHED:
2395 case FIB_PATH_TYPE_RECURSIVE:
2396 case FIB_PATH_TYPE_INTF_RX:
2397 case FIB_PATH_TYPE_UDP_ENCAP:
2398 case FIB_PATH_TYPE_EXCLUSIVE:
2399 case FIB_PATH_TYPE_SPECIAL:
2400 case FIB_PATH_TYPE_BIER_FMASK:
2401 case FIB_PATH_TYPE_BIER_TABLE:
2402 case FIB_PATH_TYPE_BIER_IMP:
2403 case FIB_PATH_TYPE_DVR:
2407 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_POP_PW_CW)
2409 dpo_id_t tmp = DPO_INVALID;
2411 dpo_copy(&tmp, dpo);
2413 pw_cw_dpo_create(&tmp, dpo);
2419 fib_path_contribute_forwarding (fib_node_index_t path_index,
2420 fib_forward_chain_type_t fct,
2425 path = fib_path_get(path_index);
2428 ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS != fct);
2431 * The DPO stored in the path was created when the path was resolved.
2432 * This then represents the path's 'native' protocol; IP.
2433 * For all others will need to go find something else.
2435 if (fib_path_to_chain_type(path) == fct)
2437 dpo_copy(dpo, &path->fp_dpo);
2441 switch (path->fp_type)
2443 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2446 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2447 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2448 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2449 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2450 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2451 case FIB_FORW_CHAIN_TYPE_NSH:
2452 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2453 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2454 path = fib_path_attached_next_hop_get_adj(
2456 fib_forw_chain_type_to_link_type(fct),
2459 case FIB_FORW_CHAIN_TYPE_BIER:
2463 case FIB_PATH_TYPE_RECURSIVE:
2466 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2467 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2468 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2469 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2470 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2471 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2472 case FIB_FORW_CHAIN_TYPE_BIER:
2473 fib_path_recursive_adj_update(path, fct, dpo);
2475 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2476 case FIB_FORW_CHAIN_TYPE_NSH:
2481 case FIB_PATH_TYPE_BIER_TABLE:
2484 case FIB_FORW_CHAIN_TYPE_BIER:
2485 bier_table_contribute_forwarding(path->fp_via_bier_tbl, dpo);
2487 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2488 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2489 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2490 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2491 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2492 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2493 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2494 case FIB_FORW_CHAIN_TYPE_NSH:
2499 case FIB_PATH_TYPE_BIER_FMASK:
2502 case FIB_FORW_CHAIN_TYPE_BIER:
2503 fib_path_bier_fmask_update(path, dpo);
2505 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2506 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2507 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2508 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2509 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2510 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2511 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2512 case FIB_FORW_CHAIN_TYPE_NSH:
2517 case FIB_PATH_TYPE_BIER_IMP:
2518 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
2519 fib_forw_chain_type_to_dpo_proto(fct),
2522 case FIB_PATH_TYPE_DEAG:
2525 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2526 lookup_dpo_add_or_lock_w_table_id(MPLS_FIB_DEFAULT_TABLE_ID,
2529 LOOKUP_INPUT_DST_ADDR,
2530 LOOKUP_TABLE_FROM_CONFIG,
2533 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2534 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2535 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2536 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2537 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2538 dpo_copy(dpo, &path->fp_dpo);
2540 case FIB_FORW_CHAIN_TYPE_BIER:
2542 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2543 case FIB_FORW_CHAIN_TYPE_NSH:
2548 case FIB_PATH_TYPE_EXCLUSIVE:
2549 dpo_copy(dpo, &path->exclusive.fp_ex_dpo);
2551 case FIB_PATH_TYPE_ATTACHED:
2554 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2555 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2556 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2557 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2558 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2559 case FIB_FORW_CHAIN_TYPE_NSH:
2560 case FIB_FORW_CHAIN_TYPE_BIER:
2561 fib_path_attached_get_adj(path,
2562 fib_forw_chain_type_to_link_type(fct),
2565 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2566 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2571 * Create the adj needed for sending IP multicast traffic
2573 if (vnet_sw_interface_is_p2p(vnet_get_main(),
2574 path->attached.fp_interface))
2577 * point-2-point interfaces do not require a glean, since
2578 * there is nothing to ARP. Install a rewrite/nbr adj instead
2580 ai = adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
2581 fib_forw_chain_type_to_link_type(fct),
2583 path->attached.fp_interface);
2587 ai = adj_mcast_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
2588 fib_forw_chain_type_to_link_type(fct),
2589 path->attached.fp_interface);
2591 dpo_set(dpo, DPO_ADJACENCY,
2592 fib_forw_chain_type_to_dpo_proto(fct),
2599 case FIB_PATH_TYPE_INTF_RX:
2601 * Create the adj needed for sending IP multicast traffic
2603 interface_rx_dpo_add_or_lock(fib_forw_chain_type_to_dpo_proto(fct),
2604 path->attached.fp_interface,
2607 case FIB_PATH_TYPE_UDP_ENCAP:
2608 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2612 case FIB_PATH_TYPE_RECEIVE:
2613 case FIB_PATH_TYPE_SPECIAL:
2614 case FIB_PATH_TYPE_DVR:
2615 dpo_copy(dpo, &path->fp_dpo);
2621 load_balance_path_t *
2622 fib_path_append_nh_for_multipath_hash (fib_node_index_t path_index,
2623 fib_forward_chain_type_t fct,
2624 load_balance_path_t *hash_key)
2626 load_balance_path_t *mnh;
2629 path = fib_path_get(path_index);
2633 vec_add2(hash_key, mnh, 1);
2635 mnh->path_weight = path->fp_weight;
2636 mnh->path_index = path_index;
2638 if (fib_path_is_resolved(path_index))
2640 fib_path_contribute_forwarding(path_index, fct, &mnh->path_dpo);
2644 dpo_copy(&mnh->path_dpo,
2645 drop_dpo_get(fib_forw_chain_type_to_dpo_proto(fct)));
2651 fib_path_is_recursive_constrained (fib_node_index_t path_index)
2655 path = fib_path_get(path_index);
2657 return ((FIB_PATH_TYPE_RECURSIVE == path->fp_type) &&
2658 ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED) ||
2659 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)));
2663 fib_path_is_exclusive (fib_node_index_t path_index)
2667 path = fib_path_get(path_index);
2669 return (FIB_PATH_TYPE_EXCLUSIVE == path->fp_type);
2673 fib_path_is_deag (fib_node_index_t path_index)
2677 path = fib_path_get(path_index);
2679 return (FIB_PATH_TYPE_DEAG == path->fp_type);
2683 fib_path_is_resolved (fib_node_index_t path_index)
2687 path = fib_path_get(path_index);
2689 return (dpo_id_is_valid(&path->fp_dpo) &&
2690 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED) &&
2691 !fib_path_is_looped(path_index) &&
2692 !fib_path_is_permanent_drop(path));
2696 fib_path_is_looped (fib_node_index_t path_index)
2700 path = fib_path_get(path_index);
2702 return (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP);
2705 fib_path_list_walk_rc_t
2706 fib_path_encode (fib_node_index_t path_list_index,
2707 fib_node_index_t path_index,
2708 const fib_path_ext_t *path_ext,
2711 fib_path_encode_ctx_t *ctx = args;
2712 fib_route_path_t *rpath;
2715 path = fib_path_get(path_index);
2717 return (FIB_PATH_LIST_WALK_CONTINUE);
2719 vec_add2(ctx->rpaths, rpath, 1);
2720 rpath->frp_weight = path->fp_weight;
2721 rpath->frp_preference = path->fp_preference;
2722 rpath->frp_proto = path->fp_nh_proto;
2723 rpath->frp_sw_if_index = ~0;
2724 rpath->frp_fib_index = 0;
2726 switch (path->fp_type)
2728 case FIB_PATH_TYPE_RECEIVE:
2729 rpath->frp_addr = path->receive.fp_addr;
2730 rpath->frp_sw_if_index = path->receive.fp_interface;
2731 rpath->frp_flags |= FIB_ROUTE_PATH_LOCAL;
2733 case FIB_PATH_TYPE_ATTACHED:
2734 rpath->frp_sw_if_index = path->attached.fp_interface;
2736 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2737 rpath->frp_sw_if_index = path->attached_next_hop.fp_interface;
2738 rpath->frp_addr = path->attached_next_hop.fp_nh;
2740 case FIB_PATH_TYPE_BIER_FMASK:
2741 rpath->frp_bier_fmask = path->bier_fmask.fp_bier_fmask;
2743 case FIB_PATH_TYPE_SPECIAL:
2745 case FIB_PATH_TYPE_DEAG:
2746 rpath->frp_fib_index = path->deag.fp_tbl_id;
2747 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
2749 rpath->frp_flags |= FIB_ROUTE_PATH_RPF_ID;
2752 case FIB_PATH_TYPE_RECURSIVE:
2753 rpath->frp_addr = path->recursive.fp_nh.fp_ip;
2754 rpath->frp_fib_index = path->recursive.fp_tbl_id;
2756 case FIB_PATH_TYPE_DVR:
2757 rpath->frp_sw_if_index = path->dvr.fp_interface;
2758 rpath->frp_flags |= FIB_ROUTE_PATH_DVR;
2760 case FIB_PATH_TYPE_UDP_ENCAP:
2761 rpath->frp_udp_encap_id = path->udp_encap.fp_udp_encap_id;
2762 rpath->frp_flags |= FIB_ROUTE_PATH_UDP_ENCAP;
2764 case FIB_PATH_TYPE_INTF_RX:
2765 rpath->frp_sw_if_index = path->receive.fp_interface;
2766 rpath->frp_flags |= FIB_ROUTE_PATH_INTF_RX;
2768 case FIB_PATH_TYPE_EXCLUSIVE:
2769 rpath->frp_flags |= FIB_ROUTE_PATH_EXCLUSIVE;
2774 if (path_ext && path_ext->fpe_type == FIB_PATH_EXT_MPLS)
2776 rpath->frp_label_stack = path_ext->fpe_path.frp_label_stack;
2779 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP)
2780 rpath->frp_flags |= FIB_ROUTE_PATH_DROP;
2781 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH)
2782 rpath->frp_flags |= FIB_ROUTE_PATH_ICMP_UNREACH;
2783 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT)
2784 rpath->frp_flags |= FIB_ROUTE_PATH_ICMP_PROHIBIT;
2786 return (FIB_PATH_LIST_WALK_CONTINUE);
2790 fib_path_get_proto (fib_node_index_t path_index)
2794 path = fib_path_get(path_index);
2796 return (path->fp_nh_proto);
2800 fib_path_module_init (void)
2802 fib_node_register_type (FIB_NODE_TYPE_PATH, &fib_path_vft);
2803 fib_path_logger = vlib_log_register_class ("fib", "path");
2806 static clib_error_t *
2807 show_fib_path_command (vlib_main_t * vm,
2808 unformat_input_t * input,
2809 vlib_cli_command_t * cmd)
2811 fib_node_index_t pi;
2814 if (unformat (input, "%d", &pi))
2817 * show one in detail
2819 if (!pool_is_free_index(fib_path_pool, pi))
2821 path = fib_path_get(pi);
2822 u8 *s = format(NULL, "%U", format_fib_path, pi, 1,
2823 FIB_PATH_FORMAT_FLAGS_NONE);
2824 s = format(s, "\n children:");
2825 s = fib_node_children_format(path->fp_node.fn_children, s);
2826 vlib_cli_output (vm, "%v", s);
2831 vlib_cli_output (vm, "path %d invalid", pi);
2836 vlib_cli_output (vm, "FIB Paths");
2837 pool_foreach_index (pi, fib_path_pool,
2839 vlib_cli_output (vm, "%U", format_fib_path, pi, 0,
2840 FIB_PATH_FORMAT_FLAGS_NONE);
2847 VLIB_CLI_COMMAND (show_fib_path, static) = {
2848 .path = "show fib paths",
2849 .function = show_fib_path_command,
2850 .short_help = "show fib paths",