2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
16 #include <vlib/vlib.h>
17 #include <vnet/vnet.h>
18 #include <vnet/ip/format.h>
19 #include <vnet/ip/ip.h>
20 #include <vnet/dpo/drop_dpo.h>
21 #include <vnet/dpo/receive_dpo.h>
22 #include <vnet/dpo/load_balance_map.h>
23 #include <vnet/dpo/lookup_dpo.h>
24 #include <vnet/dpo/interface_rx_dpo.h>
25 #include <vnet/dpo/mpls_disposition.h>
26 #include <vnet/dpo/dvr_dpo.h>
27 #include <vnet/dpo/drop_dpo.h>
29 #include <vnet/adj/adj.h>
30 #include <vnet/adj/adj_mcast.h>
32 #include <vnet/fib/fib_path.h>
33 #include <vnet/fib/fib_node.h>
34 #include <vnet/fib/fib_table.h>
35 #include <vnet/fib/fib_entry.h>
36 #include <vnet/fib/fib_path_list.h>
37 #include <vnet/fib/fib_internal.h>
38 #include <vnet/fib/fib_urpf_list.h>
39 #include <vnet/fib/mpls_fib.h>
40 #include <vnet/udp/udp_encap.h>
41 #include <vnet/bier/bier_fmask.h>
42 #include <vnet/bier/bier_table.h>
43 #include <vnet/bier/bier_imp.h>
44 #include <vnet/bier/bier_disp_table.h>
47 * Enurmeration of path types
49 typedef enum fib_path_type_t_ {
51 * Marker. Add new types after this one.
53 FIB_PATH_TYPE_FIRST = 0,
55 * Attached-nexthop. An interface and a nexthop are known.
57 FIB_PATH_TYPE_ATTACHED_NEXT_HOP = FIB_PATH_TYPE_FIRST,
59 * attached. Only the interface is known.
61 FIB_PATH_TYPE_ATTACHED,
63 * recursive. Only the next-hop is known.
65 FIB_PATH_TYPE_RECURSIVE,
67 * special. nothing is known. so we drop.
69 FIB_PATH_TYPE_SPECIAL,
71 * exclusive. user provided adj.
73 FIB_PATH_TYPE_EXCLUSIVE,
75 * deag. Link to a lookup adj in the next table
81 FIB_PATH_TYPE_INTF_RX,
85 FIB_PATH_TYPE_UDP_ENCAP,
87 * receive. it's for-us.
89 FIB_PATH_TYPE_RECEIVE,
91 * bier-imp. it's via a BIER imposition.
93 FIB_PATH_TYPE_BIER_IMP,
95 * bier-fmask. it's via a BIER ECMP-table.
97 FIB_PATH_TYPE_BIER_TABLE,
99 * bier-fmask. it's via a BIER f-mask.
101 FIB_PATH_TYPE_BIER_FMASK,
107 * Marker. Add new types before this one, then update it.
109 FIB_PATH_TYPE_LAST = FIB_PATH_TYPE_BIER_FMASK,
110 } __attribute__ ((packed)) fib_path_type_t;
113 * The maximum number of path_types
115 #define FIB_PATH_TYPE_MAX (FIB_PATH_TYPE_LAST + 1)
117 #define FIB_PATH_TYPES { \
118 [FIB_PATH_TYPE_ATTACHED_NEXT_HOP] = "attached-nexthop", \
119 [FIB_PATH_TYPE_ATTACHED] = "attached", \
120 [FIB_PATH_TYPE_RECURSIVE] = "recursive", \
121 [FIB_PATH_TYPE_SPECIAL] = "special", \
122 [FIB_PATH_TYPE_EXCLUSIVE] = "exclusive", \
123 [FIB_PATH_TYPE_DEAG] = "deag", \
124 [FIB_PATH_TYPE_INTF_RX] = "intf-rx", \
125 [FIB_PATH_TYPE_UDP_ENCAP] = "udp-encap", \
126 [FIB_PATH_TYPE_RECEIVE] = "receive", \
127 [FIB_PATH_TYPE_BIER_IMP] = "bier-imp", \
128 [FIB_PATH_TYPE_BIER_TABLE] = "bier-table", \
129 [FIB_PATH_TYPE_BIER_FMASK] = "bier-fmask", \
130 [FIB_PATH_TYPE_DVR] = "dvr", \
133 #define FOR_EACH_FIB_PATH_TYPE(_item) \
134 for (_item = FIB_PATH_TYPE_FIRST; \
135 _item <= FIB_PATH_TYPE_LAST; \
139 * Enurmeration of path operational (i.e. derived) attributes
141 typedef enum fib_path_oper_attribute_t_ {
143 * Marker. Add new types after this one.
145 FIB_PATH_OPER_ATTRIBUTE_FIRST = 0,
147 * The path forms part of a recursive loop.
149 FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP = FIB_PATH_OPER_ATTRIBUTE_FIRST,
151 * The path is resolved
153 FIB_PATH_OPER_ATTRIBUTE_RESOLVED,
155 * The path is attached, despite what the next-hop may say.
157 FIB_PATH_OPER_ATTRIBUTE_ATTACHED,
159 * The path has become a permanent drop.
161 FIB_PATH_OPER_ATTRIBUTE_DROP,
163 * Marker. Add new types before this one, then update it.
165 FIB_PATH_OPER_ATTRIBUTE_LAST = FIB_PATH_OPER_ATTRIBUTE_DROP,
166 } __attribute__ ((packed)) fib_path_oper_attribute_t;
169 * The maximum number of path operational attributes
171 #define FIB_PATH_OPER_ATTRIBUTE_MAX (FIB_PATH_OPER_ATTRIBUTE_LAST + 1)
173 #define FIB_PATH_OPER_ATTRIBUTES { \
174 [FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP] = "recursive-loop", \
175 [FIB_PATH_OPER_ATTRIBUTE_RESOLVED] = "resolved", \
176 [FIB_PATH_OPER_ATTRIBUTE_DROP] = "drop", \
179 #define FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(_item) \
180 for (_item = FIB_PATH_OPER_ATTRIBUTE_FIRST; \
181 _item <= FIB_PATH_OPER_ATTRIBUTE_LAST; \
185 * Path flags from the attributes
187 typedef enum fib_path_oper_flags_t_ {
188 FIB_PATH_OPER_FLAG_NONE = 0,
189 FIB_PATH_OPER_FLAG_RECURSIVE_LOOP = (1 << FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP),
190 FIB_PATH_OPER_FLAG_DROP = (1 << FIB_PATH_OPER_ATTRIBUTE_DROP),
191 FIB_PATH_OPER_FLAG_RESOLVED = (1 << FIB_PATH_OPER_ATTRIBUTE_RESOLVED),
192 FIB_PATH_OPER_FLAG_ATTACHED = (1 << FIB_PATH_OPER_ATTRIBUTE_ATTACHED),
193 } __attribute__ ((packed)) fib_path_oper_flags_t;
198 typedef struct fib_path_t_ {
200 * A path is a node in the FIB graph.
205 * The index of the path-list to which this path belongs
210 * This marks the start of the memory area used to hash
213 STRUCT_MARK(path_hash_start);
216 * Configuration Flags
218 fib_path_cfg_flags_t fp_cfg_flags;
221 * The type of the path. This is the selector for the union
223 fib_path_type_t fp_type;
226 * The protocol of the next-hop, i.e. the address family of the
227 * next-hop's address. We can't derive this from the address itself
228 * since the address can be all zeros
230 dpo_proto_t fp_nh_proto;
233 * UCMP [unnormalised] weigth
238 * A path preference. 0 is the best.
239 * Only paths of the best preference, that are 'up', are considered
245 * per-type union of the data required to resolve the path
252 ip46_address_t fp_nh;
270 ip46_address_t fp_ip;
273 * The local label to resolve through.
275 mpls_label_t fp_local_label;
277 * The EOS bit of the resolving label
279 mpls_eos_bit_t fp_eos;
284 * The FIB table index in which to find the next-hop.
286 fib_node_index_t fp_tbl_id;
288 * The BIER FIB the fmask is in
297 index_t fp_bier_fmask;
301 * The BIER table's ID
303 bier_table_id_t fp_bier_tbl;
307 * The BIER imposition object
308 * this is part of the path's key, since the index_t
309 * of an imposition object is the object's key.
315 * The FIB index in which to perfom the next lookup
317 fib_node_index_t fp_tbl_id;
319 * The RPF-ID to tag the packets with
321 fib_rpf_id_t fp_rpf_id;
327 * The user provided 'exclusive' DPO
333 * The interface on which the local address is configured
339 ip46_address_t fp_addr;
343 * The interface on which the packets will be input.
349 * The UDP Encap object this path resolves through
360 STRUCT_MARK(path_hash_end);
363 * Memebers in this last section represent information that is
364 * dervied during resolution. It should not be copied to new paths
371 fib_path_oper_flags_t fp_oper_flags;
375 * the resolving via fib. not part of the union, since it it not part
376 * of the path's hash.
378 fib_node_index_t fp_via_fib;
380 * the resolving bier-table
382 index_t fp_via_bier_tbl;
384 * the resolving bier-fmask
386 index_t fp_via_bier_fmask;
390 * The Data-path objects through which this path resolves for IP.
395 * the index of this path in the parent's child list.
401 * Array of strings/names for the path types and attributes
403 static const char *fib_path_type_names[] = FIB_PATH_TYPES;
404 static const char *fib_path_oper_attribute_names[] = FIB_PATH_OPER_ATTRIBUTES;
405 static const char *fib_path_cfg_attribute_names[] = FIB_PATH_CFG_ATTRIBUTES;
408 * The memory pool from which we allocate all the paths
410 static fib_path_t *fib_path_pool;
416 #define FIB_PATH_DBG(_p, _fmt, _args...) \
419 _tmp = fib_path_format(fib_path_get_index(_p), _tmp); \
420 clib_warning("path:[%d:%U]:" _fmt, \
421 fib_path_get_index(_p), format_fib_path, _p, 0,\
426 #define FIB_PATH_DBG(_p, _fmt, _args...)
430 fib_path_get (fib_node_index_t index)
432 return (pool_elt_at_index(fib_path_pool, index));
435 static fib_node_index_t
436 fib_path_get_index (fib_path_t *path)
438 return (path - fib_path_pool);
442 fib_path_get_node (fib_node_index_t index)
444 return ((fib_node_t*)fib_path_get(index));
448 fib_path_from_fib_node (fib_node_t *node)
450 ASSERT(FIB_NODE_TYPE_PATH == node->fn_type);
451 return ((fib_path_t*)node);
455 format_fib_path (u8 * s, va_list * args)
457 fib_node_index_t path_index = va_arg (*args, fib_node_index_t);
458 u32 indent = va_arg (*args, u32);
459 vnet_main_t * vnm = vnet_get_main();
460 fib_path_oper_attribute_t oattr;
461 fib_path_cfg_attribute_t cattr;
464 path = fib_path_get(path_index);
466 s = format (s, "%Upath:[%d] ", format_white_space, indent,
467 fib_path_get_index(path));
468 s = format (s, "pl-index:%d ", path->fp_pl_index);
469 s = format (s, "%U ", format_dpo_proto, path->fp_nh_proto);
470 s = format (s, "weight=%d ", path->fp_weight);
471 s = format (s, "pref=%d ", path->fp_preference);
472 s = format (s, "%s: ", fib_path_type_names[path->fp_type]);
473 if (FIB_PATH_OPER_FLAG_NONE != path->fp_oper_flags) {
474 s = format(s, " oper-flags:");
475 FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(oattr) {
476 if ((1<<oattr) & path->fp_oper_flags) {
477 s = format (s, "%s,", fib_path_oper_attribute_names[oattr]);
481 if (FIB_PATH_CFG_FLAG_NONE != path->fp_cfg_flags) {
482 s = format(s, " cfg-flags:");
483 FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(cattr) {
484 if ((1<<cattr) & path->fp_cfg_flags) {
485 s = format (s, "%s,", fib_path_cfg_attribute_names[cattr]);
489 s = format(s, "\n%U", format_white_space, indent+2);
491 switch (path->fp_type)
493 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
494 s = format (s, "%U", format_ip46_address,
495 &path->attached_next_hop.fp_nh,
497 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
499 s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
503 s = format (s, " %U",
504 format_vnet_sw_interface_name,
506 vnet_get_sw_interface(
508 path->attached_next_hop.fp_interface));
509 if (vnet_sw_interface_is_p2p(vnet_get_main(),
510 path->attached_next_hop.fp_interface))
512 s = format (s, " (p2p)");
515 if (!dpo_id_is_valid(&path->fp_dpo))
517 s = format(s, "\n%Uunresolved", format_white_space, indent+2);
521 s = format(s, "\n%U%U",
522 format_white_space, indent,
527 case FIB_PATH_TYPE_ATTACHED:
528 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
530 s = format (s, "if_index:%d", path->attached_next_hop.fp_interface);
534 s = format (s, " %U",
535 format_vnet_sw_interface_name,
537 vnet_get_sw_interface(
539 path->attached.fp_interface));
542 case FIB_PATH_TYPE_RECURSIVE:
543 if (DPO_PROTO_MPLS == path->fp_nh_proto)
545 s = format (s, "via %U %U",
546 format_mpls_unicast_label,
547 path->recursive.fp_nh.fp_local_label,
549 path->recursive.fp_nh.fp_eos);
553 s = format (s, "via %U",
555 &path->recursive.fp_nh.fp_ip,
558 s = format (s, " in fib:%d",
559 path->recursive.fp_tbl_id,
561 s = format (s, " via-fib:%d", path->fp_via_fib);
562 s = format (s, " via-dpo:[%U:%d]",
563 format_dpo_type, path->fp_dpo.dpoi_type,
564 path->fp_dpo.dpoi_index);
567 case FIB_PATH_TYPE_UDP_ENCAP:
568 s = format (s, "UDP-encap ID:%d", path->udp_encap.fp_udp_encap_id);
570 case FIB_PATH_TYPE_BIER_TABLE:
571 s = format (s, "via bier-table:[%U}",
572 format_bier_table_id,
573 &path->bier_table.fp_bier_tbl);
574 s = format (s, " via-dpo:[%U:%d]",
575 format_dpo_type, path->fp_dpo.dpoi_type,
576 path->fp_dpo.dpoi_index);
578 case FIB_PATH_TYPE_BIER_FMASK:
579 s = format (s, "via-fmask:%d", path->bier_fmask.fp_bier_fmask);
580 s = format (s, " via-dpo:[%U:%d]",
581 format_dpo_type, path->fp_dpo.dpoi_type,
582 path->fp_dpo.dpoi_index);
584 case FIB_PATH_TYPE_BIER_IMP:
585 s = format (s, "via %U", format_bier_imp,
586 path->bier_imp.fp_bier_imp, 0, BIER_SHOW_BRIEF);
588 case FIB_PATH_TYPE_DVR:
589 s = format (s, " %U",
590 format_vnet_sw_interface_name,
592 vnet_get_sw_interface(
594 path->dvr.fp_interface));
596 case FIB_PATH_TYPE_RECEIVE:
597 case FIB_PATH_TYPE_INTF_RX:
598 case FIB_PATH_TYPE_SPECIAL:
599 case FIB_PATH_TYPE_DEAG:
600 case FIB_PATH_TYPE_EXCLUSIVE:
601 if (dpo_id_is_valid(&path->fp_dpo))
603 s = format(s, "%U", format_dpo_id,
604 &path->fp_dpo, indent+2);
612 fib_path_format (fib_node_index_t pi, u8 *s)
616 path = fib_path_get(pi);
617 ASSERT(NULL != path);
619 return (format (s, "%U", format_fib_path, path));
623 * fib_path_last_lock_gone
625 * We don't share paths, we share path lists, so the [un]lock functions
629 fib_path_last_lock_gone (fib_node_t *node)
634 static const adj_index_t
635 fib_path_attached_next_hop_get_adj (fib_path_t *path,
638 if (vnet_sw_interface_is_p2p(vnet_get_main(),
639 path->attached_next_hop.fp_interface))
642 * if the interface is p2p then the adj for the specific
643 * neighbour on that link will never exist. on p2p links
644 * the subnet address (the attached route) links to the
645 * auto-adj (see below), we want that adj here too.
647 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
650 path->attached_next_hop.fp_interface));
654 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
656 &path->attached_next_hop.fp_nh,
657 path->attached_next_hop.fp_interface));
662 fib_path_attached_next_hop_set (fib_path_t *path)
665 * resolve directly via the adjacnecy discribed by the
666 * interface and next-hop
668 dpo_set(&path->fp_dpo,
671 fib_path_attached_next_hop_get_adj(
673 dpo_proto_to_link(path->fp_nh_proto)));
676 * become a child of the adjacency so we receive updates
677 * when its rewrite changes
679 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
681 fib_path_get_index(path));
683 if (!vnet_sw_interface_is_admin_up(vnet_get_main(),
684 path->attached_next_hop.fp_interface) ||
685 !adj_is_up(path->fp_dpo.dpoi_index))
687 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
691 static const adj_index_t
692 fib_path_attached_get_adj (fib_path_t *path,
695 if (vnet_sw_interface_is_p2p(vnet_get_main(),
696 path->attached.fp_interface))
699 * point-2-point interfaces do not require a glean, since
700 * there is nothing to ARP. Install a rewrite/nbr adj instead
702 return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
705 path->attached.fp_interface));
709 return (adj_glean_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
711 path->attached.fp_interface,
717 * create of update the paths recursive adj
720 fib_path_recursive_adj_update (fib_path_t *path,
721 fib_forward_chain_type_t fct,
724 dpo_id_t via_dpo = DPO_INVALID;
727 * get the DPO to resolve through from the via-entry
729 fib_entry_contribute_forwarding(path->fp_via_fib,
735 * hope for the best - clear if restrictions apply.
737 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
740 * Validate any recursion constraints and over-ride the via
743 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP)
745 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
746 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
748 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)
751 * the via FIB must be a host route.
752 * note the via FIB just added will always be a host route
753 * since it is an RR source added host route. So what we need to
754 * check is whether the route has other sources. If it does then
755 * some other source has added it as a host route. If it doesn't
756 * then it was added only here and inherits forwarding from a cover.
757 * the cover is not a host route.
758 * The RR source is the lowest priority source, so we check if it
759 * is the best. if it is there are no other sources.
761 if (fib_entry_get_best_source(path->fp_via_fib) >= FIB_SOURCE_RR)
763 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
764 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
767 * PIC edge trigger. let the load-balance maps know
769 load_balance_map_path_state_change(fib_path_get_index(path));
772 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED)
775 * RR source entries inherit the flags from the cover, so
776 * we can check the via directly
778 if (!(FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags(path->fp_via_fib)))
780 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
781 dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
784 * PIC edge trigger. let the load-balance maps know
786 load_balance_map_path_state_change(fib_path_get_index(path));
790 * check for over-riding factors on the FIB entry itself
792 if (!fib_entry_is_resolved(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 * If this path is contributing a drop, then it's not resolved
806 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
808 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
812 * update the path's contributed DPO
814 dpo_copy(dpo, &via_dpo);
816 FIB_PATH_DBG(path, "recursive update:");
822 * re-evaulate the forwarding state for a via fmask path
825 fib_path_bier_fmask_update (fib_path_t *path,
828 bier_fmask_contribute_forwarding(path->bier_fmask.fp_bier_fmask, dpo);
831 * if we are stakcing on the drop, then the path is not resolved
833 if (dpo_is_drop(dpo))
835 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
839 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
844 * fib_path_is_permanent_drop
846 * Return !0 if the path is configured to permanently drop,
847 * despite other attributes.
850 fib_path_is_permanent_drop (fib_path_t *path)
852 return ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP) ||
853 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP));
859 * Remove our dependency on the resolution target
862 fib_path_unresolve (fib_path_t *path)
865 * the forced drop path does not need unresolving
867 if (fib_path_is_permanent_drop(path))
872 switch (path->fp_type)
874 case FIB_PATH_TYPE_RECURSIVE:
875 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
879 fib_entry_get_prefix(path->fp_via_fib, &pfx);
880 fib_entry_child_remove(path->fp_via_fib,
882 fib_table_entry_special_remove(path->recursive.fp_tbl_id,
885 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
888 case FIB_PATH_TYPE_BIER_FMASK:
889 bier_fmask_child_remove(path->fp_via_bier_fmask,
892 case FIB_PATH_TYPE_BIER_IMP:
893 bier_imp_unlock(path->fp_dpo.dpoi_index);
895 case FIB_PATH_TYPE_BIER_TABLE:
896 bier_table_ecmp_unlock(path->fp_via_bier_tbl);
898 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
899 adj_child_remove(path->fp_dpo.dpoi_index,
901 adj_unlock(path->fp_dpo.dpoi_index);
903 case FIB_PATH_TYPE_ATTACHED:
904 adj_child_remove(path->fp_dpo.dpoi_index,
906 adj_unlock(path->fp_dpo.dpoi_index);
908 case FIB_PATH_TYPE_UDP_ENCAP:
909 udp_encap_unlock_w_index(path->fp_dpo.dpoi_index);
911 case FIB_PATH_TYPE_EXCLUSIVE:
912 dpo_reset(&path->exclusive.fp_ex_dpo);
914 case FIB_PATH_TYPE_SPECIAL:
915 case FIB_PATH_TYPE_RECEIVE:
916 case FIB_PATH_TYPE_INTF_RX:
917 case FIB_PATH_TYPE_DEAG:
918 case FIB_PATH_TYPE_DVR:
920 * these hold only the path's DPO, which is reset below.
926 * release the adj we were holding and pick up the
929 dpo_reset(&path->fp_dpo);
930 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
935 static fib_forward_chain_type_t
936 fib_path_to_chain_type (const fib_path_t *path)
938 if (DPO_PROTO_MPLS == path->fp_nh_proto)
940 if (FIB_PATH_TYPE_RECURSIVE == path->fp_type &&
941 MPLS_EOS == path->recursive.fp_nh.fp_eos)
943 return (FIB_FORW_CHAIN_TYPE_MPLS_EOS);
947 return (FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS);
952 return (fib_forw_chain_type_from_dpo_proto(path->fp_nh_proto));
957 * fib_path_back_walk_notify
959 * A back walk has reach this path.
961 static fib_node_back_walk_rc_t
962 fib_path_back_walk_notify (fib_node_t *node,
963 fib_node_back_walk_ctx_t *ctx)
967 path = fib_path_from_fib_node(node);
969 switch (path->fp_type)
971 case FIB_PATH_TYPE_RECURSIVE:
972 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
975 * modify the recursive adjacency to use the new forwarding
977 * this update is visible to packets in flight in the DP.
979 fib_path_recursive_adj_update(
981 fib_path_to_chain_type(path),
984 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
985 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
988 * ADJ updates (complete<->incomplete) do not need to propagate to
990 * The only reason its needed as far back as here, is that the adj
991 * and the incomplete adj are a different DPO type, so the LBs need
993 * If this walk was quashed in the fib_entry, then any non-fib_path
994 * children (like tunnels that collapse out the LB when they stack)
995 * would not see the update.
997 return (FIB_NODE_BACK_WALK_CONTINUE);
1000 case FIB_PATH_TYPE_BIER_FMASK:
1001 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
1004 * update to use the BIER fmask's new forwading
1006 fib_path_bier_fmask_update(path, &path->fp_dpo);
1008 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
1009 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
1012 * ADJ updates (complete<->incomplete) do not need to propagate to
1013 * recursive entries.
1014 * The only reason its needed as far back as here, is that the adj
1015 * and the incomplete adj are a different DPO type, so the LBs need
1017 * If this walk was quashed in the fib_entry, then any non-fib_path
1018 * children (like tunnels that collapse out the LB when they stack)
1019 * would not see the update.
1021 return (FIB_NODE_BACK_WALK_CONTINUE);
1024 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1027 * ADJ_UPDATE backwalk pass silently through here and up to
1028 * the path-list when the multipath adj collapse occurs.
1029 * The reason we do this is that the assumtption is that VPP
1030 * runs in an environment where the Control-Plane is remote
1031 * and hence reacts slowly to link up down. In order to remove
1032 * this down link from the ECMP set quickly, we back-walk.
1033 * VPP also has dedicated CPUs, so we are not stealing resources
1034 * from the CP to do so.
1036 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1038 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED)
1041 * alreday resolved. no need to walk back again
1043 return (FIB_NODE_BACK_WALK_CONTINUE);
1045 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1047 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1049 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1052 * alreday unresolved. no need to walk back again
1054 return (FIB_NODE_BACK_WALK_CONTINUE);
1056 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1058 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1061 * The interface this path resolves through has been deleted.
1062 * This will leave the path in a permanent drop state. The route
1063 * needs to be removed and readded (and hence the path-list deleted)
1064 * before it can forward again.
1066 fib_path_unresolve(path);
1067 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1069 if (FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason)
1072 * restack the DPO to pick up the correct DPO sub-type
1077 if_is_up = vnet_sw_interface_is_admin_up(
1079 path->attached_next_hop.fp_interface);
1081 ai = fib_path_attached_next_hop_get_adj(
1083 dpo_proto_to_link(path->fp_nh_proto));
1085 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1086 if (if_is_up && adj_is_up(ai))
1088 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1091 dpo_set(&path->fp_dpo, DPO_ADJACENCY, path->fp_nh_proto, ai);
1097 * If the interface is not up there is no reason to walk
1098 * back to children. if we did they would only evalute
1099 * that this path is unresolved and hence it would
1100 * not contribute the adjacency - so it would be wasted
1103 return (FIB_NODE_BACK_WALK_CONTINUE);
1106 if (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason)
1108 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
1111 * alreday unresolved. no need to walk back again
1113 return (FIB_NODE_BACK_WALK_CONTINUE);
1116 * the adj has gone down. the path is no longer resolved.
1118 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1121 case FIB_PATH_TYPE_ATTACHED:
1122 case FIB_PATH_TYPE_DVR:
1124 * FIXME; this could schedule a lower priority walk, since attached
1125 * routes are not usually in ECMP configurations so the backwalk to
1126 * the FIB entry does not need to be high priority
1128 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
1130 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1132 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
1134 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1136 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
1138 fib_path_unresolve(path);
1139 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
1142 case FIB_PATH_TYPE_UDP_ENCAP:
1144 dpo_id_t via_dpo = DPO_INVALID;
1147 * hope for the best - clear if restrictions apply.
1149 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1151 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
1155 * If this path is contributing a drop, then it's not resolved
1157 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
1159 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1163 * update the path's contributed DPO
1165 dpo_copy(&path->fp_dpo, &via_dpo);
1166 dpo_reset(&via_dpo);
1169 case FIB_PATH_TYPE_INTF_RX:
1171 case FIB_PATH_TYPE_DEAG:
1173 * FIXME When VRF delete is allowed this will need a poke.
1175 case FIB_PATH_TYPE_SPECIAL:
1176 case FIB_PATH_TYPE_RECEIVE:
1177 case FIB_PATH_TYPE_EXCLUSIVE:
1178 case FIB_PATH_TYPE_BIER_TABLE:
1179 case FIB_PATH_TYPE_BIER_IMP:
1181 * these path types have no parents. so to be
1182 * walked from one is unexpected.
1189 * propagate the backwalk further to the path-list
1191 fib_path_list_back_walk(path->fp_pl_index, ctx);
1193 return (FIB_NODE_BACK_WALK_CONTINUE);
1197 fib_path_memory_show (void)
1199 fib_show_memory_usage("Path",
1200 pool_elts(fib_path_pool),
1201 pool_len(fib_path_pool),
1202 sizeof(fib_path_t));
1206 * The FIB path's graph node virtual function table
1208 static const fib_node_vft_t fib_path_vft = {
1209 .fnv_get = fib_path_get_node,
1210 .fnv_last_lock = fib_path_last_lock_gone,
1211 .fnv_back_walk = fib_path_back_walk_notify,
1212 .fnv_mem_show = fib_path_memory_show,
1215 static fib_path_cfg_flags_t
1216 fib_path_route_flags_to_cfg_flags (const fib_route_path_t *rpath)
1218 fib_path_cfg_flags_t cfg_flags = FIB_PATH_CFG_FLAG_NONE;
1220 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_HOST)
1221 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_HOST;
1222 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_ATTACHED)
1223 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED;
1224 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1225 cfg_flags |= FIB_PATH_CFG_FLAG_LOCAL;
1226 if (rpath->frp_flags & FIB_ROUTE_PATH_ATTACHED)
1227 cfg_flags |= FIB_PATH_CFG_FLAG_ATTACHED;
1228 if (rpath->frp_flags & FIB_ROUTE_PATH_INTF_RX)
1229 cfg_flags |= FIB_PATH_CFG_FLAG_INTF_RX;
1230 if (rpath->frp_flags & FIB_ROUTE_PATH_RPF_ID)
1231 cfg_flags |= FIB_PATH_CFG_FLAG_RPF_ID;
1232 if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1233 cfg_flags |= FIB_PATH_CFG_FLAG_EXCLUSIVE;
1234 if (rpath->frp_flags & FIB_ROUTE_PATH_DROP)
1235 cfg_flags |= FIB_PATH_CFG_FLAG_DROP;
1236 if (rpath->frp_flags & FIB_ROUTE_PATH_SOURCE_LOOKUP)
1237 cfg_flags |= FIB_PATH_CFG_FLAG_DEAG_SRC;
1245 * Create and initialise a new path object.
1246 * return the index of the path.
1249 fib_path_create (fib_node_index_t pl_index,
1250 const fib_route_path_t *rpath)
1254 pool_get(fib_path_pool, path);
1255 memset(path, 0, sizeof(*path));
1257 fib_node_init(&path->fp_node,
1258 FIB_NODE_TYPE_PATH);
1260 dpo_reset(&path->fp_dpo);
1261 path->fp_pl_index = pl_index;
1262 path->fp_nh_proto = rpath->frp_proto;
1263 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1264 path->fp_weight = rpath->frp_weight;
1265 if (0 == path->fp_weight)
1268 * a weight of 0 is a meaningless value. We could either reject it, and thus force
1269 * clients to always use 1, or we can accept it and fixup approrpiately.
1271 path->fp_weight = 1;
1273 path->fp_preference = rpath->frp_preference;
1274 path->fp_cfg_flags = fib_path_route_flags_to_cfg_flags(rpath);
1277 * deduce the path's tpye from the parementers and save what is needed.
1279 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_LOCAL)
1281 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1282 path->receive.fp_interface = rpath->frp_sw_if_index;
1283 path->receive.fp_addr = rpath->frp_addr;
1285 else if (rpath->frp_flags & FIB_ROUTE_PATH_UDP_ENCAP)
1287 path->fp_type = FIB_PATH_TYPE_UDP_ENCAP;
1288 path->udp_encap.fp_udp_encap_id = rpath->frp_udp_encap_id;
1290 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_INTF_RX)
1292 path->fp_type = FIB_PATH_TYPE_INTF_RX;
1293 path->intf_rx.fp_interface = rpath->frp_sw_if_index;
1295 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
1297 path->fp_type = FIB_PATH_TYPE_DEAG;
1298 path->deag.fp_tbl_id = rpath->frp_fib_index;
1299 path->deag.fp_rpf_id = rpath->frp_rpf_id;
1301 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_FMASK)
1303 path->fp_type = FIB_PATH_TYPE_BIER_FMASK;
1304 path->bier_fmask.fp_bier_fmask = rpath->frp_bier_fmask;
1306 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_IMP)
1308 path->fp_type = FIB_PATH_TYPE_BIER_IMP;
1309 path->bier_imp.fp_bier_imp = rpath->frp_bier_imp;
1311 else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_TABLE)
1313 path->fp_type = FIB_PATH_TYPE_BIER_TABLE;
1314 path->bier_table.fp_bier_tbl = rpath->frp_bier_tbl;
1316 else if (rpath->frp_flags & FIB_ROUTE_PATH_DEAG)
1318 path->fp_type = FIB_PATH_TYPE_DEAG;
1319 path->deag.fp_tbl_id = rpath->frp_fib_index;
1321 else if (rpath->frp_flags & FIB_ROUTE_PATH_DVR)
1323 path->fp_type = FIB_PATH_TYPE_DVR;
1324 path->dvr.fp_interface = rpath->frp_sw_if_index;
1326 else if (~0 != rpath->frp_sw_if_index)
1328 if (ip46_address_is_zero(&rpath->frp_addr))
1330 path->fp_type = FIB_PATH_TYPE_ATTACHED;
1331 path->attached.fp_interface = rpath->frp_sw_if_index;
1335 path->fp_type = FIB_PATH_TYPE_ATTACHED_NEXT_HOP;
1336 path->attached_next_hop.fp_interface = rpath->frp_sw_if_index;
1337 path->attached_next_hop.fp_nh = rpath->frp_addr;
1342 if (ip46_address_is_zero(&rpath->frp_addr))
1344 if (~0 == rpath->frp_fib_index)
1346 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1350 path->fp_type = FIB_PATH_TYPE_DEAG;
1351 path->deag.fp_tbl_id = rpath->frp_fib_index;
1356 path->fp_type = FIB_PATH_TYPE_RECURSIVE;
1357 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1359 path->recursive.fp_nh.fp_local_label = rpath->frp_local_label;
1360 path->recursive.fp_nh.fp_eos = rpath->frp_eos;
1364 path->recursive.fp_nh.fp_ip = rpath->frp_addr;
1366 path->recursive.fp_tbl_id = rpath->frp_fib_index;
1370 FIB_PATH_DBG(path, "create");
1372 return (fib_path_get_index(path));
1376 * fib_path_create_special
1378 * Create and initialise a new path object.
1379 * return the index of the path.
1382 fib_path_create_special (fib_node_index_t pl_index,
1383 dpo_proto_t nh_proto,
1384 fib_path_cfg_flags_t flags,
1385 const dpo_id_t *dpo)
1389 pool_get(fib_path_pool, path);
1390 memset(path, 0, sizeof(*path));
1392 fib_node_init(&path->fp_node,
1393 FIB_NODE_TYPE_PATH);
1394 dpo_reset(&path->fp_dpo);
1396 path->fp_pl_index = pl_index;
1397 path->fp_weight = 1;
1398 path->fp_preference = 0;
1399 path->fp_nh_proto = nh_proto;
1400 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1401 path->fp_cfg_flags = flags;
1403 if (FIB_PATH_CFG_FLAG_DROP & flags)
1405 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1407 else if (FIB_PATH_CFG_FLAG_LOCAL & flags)
1409 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1410 path->attached.fp_interface = FIB_NODE_INDEX_INVALID;
1414 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1415 ASSERT(NULL != dpo);
1416 dpo_copy(&path->exclusive.fp_ex_dpo, dpo);
1419 return (fib_path_get_index(path));
1425 * Copy a path. return index of new path.
1428 fib_path_copy (fib_node_index_t path_index,
1429 fib_node_index_t path_list_index)
1431 fib_path_t *path, *orig_path;
1433 pool_get(fib_path_pool, path);
1435 orig_path = fib_path_get(path_index);
1436 ASSERT(NULL != orig_path);
1438 memcpy(path, orig_path, sizeof(*path));
1440 FIB_PATH_DBG(path, "create-copy:%d", path_index);
1443 * reset the dynamic section
1445 fib_node_init(&path->fp_node, FIB_NODE_TYPE_PATH);
1446 path->fp_oper_flags = FIB_PATH_OPER_FLAG_NONE;
1447 path->fp_pl_index = path_list_index;
1448 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1449 memset(&path->fp_dpo, 0, sizeof(path->fp_dpo));
1450 dpo_reset(&path->fp_dpo);
1452 return (fib_path_get_index(path));
1458 * destroy a path that is no longer required
1461 fib_path_destroy (fib_node_index_t path_index)
1465 path = fib_path_get(path_index);
1467 ASSERT(NULL != path);
1468 FIB_PATH_DBG(path, "destroy");
1470 fib_path_unresolve(path);
1472 fib_node_deinit(&path->fp_node);
1473 pool_put(fib_path_pool, path);
1479 * destroy a path that is no longer required
1482 fib_path_hash (fib_node_index_t path_index)
1486 path = fib_path_get(path_index);
1488 return (hash_memory(STRUCT_MARK_PTR(path, path_hash_start),
1489 (STRUCT_OFFSET_OF(fib_path_t, path_hash_end) -
1490 STRUCT_OFFSET_OF(fib_path_t, path_hash_start)),
1497 * Compare two paths for equivalence.
1500 fib_path_cmp_i (const fib_path_t *path1,
1501 const fib_path_t *path2)
1508 * paths of different types and protocol are not equal.
1509 * different weights and/or preference only are the same path.
1511 if (path1->fp_type != path2->fp_type)
1513 res = (path1->fp_type - path2->fp_type);
1515 else if (path1->fp_nh_proto != path2->fp_nh_proto)
1517 res = (path1->fp_nh_proto - path2->fp_nh_proto);
1522 * both paths are of the same type.
1523 * consider each type and its attributes in turn.
1525 switch (path1->fp_type)
1527 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1528 res = ip46_address_cmp(&path1->attached_next_hop.fp_nh,
1529 &path2->attached_next_hop.fp_nh);
1531 res = (path1->attached_next_hop.fp_interface -
1532 path2->attached_next_hop.fp_interface);
1535 case FIB_PATH_TYPE_ATTACHED:
1536 res = (path1->attached.fp_interface -
1537 path2->attached.fp_interface);
1539 case FIB_PATH_TYPE_RECURSIVE:
1540 res = ip46_address_cmp(&path1->recursive.fp_nh,
1541 &path2->recursive.fp_nh);
1545 res = (path1->recursive.fp_tbl_id - path2->recursive.fp_tbl_id);
1548 case FIB_PATH_TYPE_BIER_FMASK:
1549 res = (path1->bier_fmask.fp_bier_fmask -
1550 path2->bier_fmask.fp_bier_fmask);
1552 case FIB_PATH_TYPE_BIER_IMP:
1553 res = (path1->bier_imp.fp_bier_imp -
1554 path2->bier_imp.fp_bier_imp);
1556 case FIB_PATH_TYPE_BIER_TABLE:
1557 res = bier_table_id_cmp(&path1->bier_table.fp_bier_tbl,
1558 &path2->bier_table.fp_bier_tbl);
1560 case FIB_PATH_TYPE_DEAG:
1561 res = (path1->deag.fp_tbl_id - path2->deag.fp_tbl_id);
1564 res = (path1->deag.fp_rpf_id - path2->deag.fp_rpf_id);
1567 case FIB_PATH_TYPE_INTF_RX:
1568 res = (path1->intf_rx.fp_interface - path2->intf_rx.fp_interface);
1570 case FIB_PATH_TYPE_UDP_ENCAP:
1571 res = (path1->udp_encap.fp_udp_encap_id - path2->udp_encap.fp_udp_encap_id);
1573 case FIB_PATH_TYPE_DVR:
1574 res = (path1->dvr.fp_interface - path2->dvr.fp_interface);
1576 case FIB_PATH_TYPE_SPECIAL:
1577 case FIB_PATH_TYPE_RECEIVE:
1578 case FIB_PATH_TYPE_EXCLUSIVE:
1587 * fib_path_cmp_for_sort
1589 * Compare two paths for equivalence. Used during path sorting.
1590 * As usual 0 means equal.
1593 fib_path_cmp_for_sort (void * v1,
1596 fib_node_index_t *pi1 = v1, *pi2 = v2;
1597 fib_path_t *path1, *path2;
1599 path1 = fib_path_get(*pi1);
1600 path2 = fib_path_get(*pi2);
1603 * when sorting paths we want the highest preference paths
1604 * first, so that the choices set built is in prefernce order
1606 if (path1->fp_preference != path2->fp_preference)
1608 return (path1->fp_preference - path2->fp_preference);
1611 return (fib_path_cmp_i(path1, path2));
1617 * Compare two paths for equivalence.
1620 fib_path_cmp (fib_node_index_t pi1,
1621 fib_node_index_t pi2)
1623 fib_path_t *path1, *path2;
1625 path1 = fib_path_get(pi1);
1626 path2 = fib_path_get(pi2);
1628 return (fib_path_cmp_i(path1, path2));
1632 fib_path_cmp_w_route_path (fib_node_index_t path_index,
1633 const fib_route_path_t *rpath)
1638 path = fib_path_get(path_index);
1642 if (path->fp_weight != rpath->frp_weight)
1644 res = (path->fp_weight - rpath->frp_weight);
1649 * both paths are of the same type.
1650 * consider each type and its attributes in turn.
1652 switch (path->fp_type)
1654 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1655 res = ip46_address_cmp(&path->attached_next_hop.fp_nh,
1659 res = (path->attached_next_hop.fp_interface -
1660 rpath->frp_sw_if_index);
1663 case FIB_PATH_TYPE_ATTACHED:
1664 res = (path->attached.fp_interface - rpath->frp_sw_if_index);
1666 case FIB_PATH_TYPE_RECURSIVE:
1667 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1669 res = path->recursive.fp_nh.fp_local_label - rpath->frp_local_label;
1673 res = path->recursive.fp_nh.fp_eos - rpath->frp_eos;
1678 res = ip46_address_cmp(&path->recursive.fp_nh.fp_ip,
1684 res = (path->recursive.fp_tbl_id - rpath->frp_fib_index);
1687 case FIB_PATH_TYPE_BIER_FMASK:
1688 res = (path->bier_fmask.fp_bier_fmask - rpath->frp_bier_fmask);
1690 case FIB_PATH_TYPE_BIER_IMP:
1691 res = (path->bier_imp.fp_bier_imp - rpath->frp_bier_imp);
1693 case FIB_PATH_TYPE_BIER_TABLE:
1694 res = bier_table_id_cmp(&path->bier_table.fp_bier_tbl,
1695 &rpath->frp_bier_tbl);
1697 case FIB_PATH_TYPE_INTF_RX:
1698 res = (path->intf_rx.fp_interface - rpath->frp_sw_if_index);
1700 case FIB_PATH_TYPE_UDP_ENCAP:
1701 res = (path->udp_encap.fp_udp_encap_id - rpath->frp_udp_encap_id);
1703 case FIB_PATH_TYPE_DEAG:
1704 res = (path->deag.fp_tbl_id - rpath->frp_fib_index);
1707 res = (path->deag.fp_rpf_id - rpath->frp_rpf_id);
1710 case FIB_PATH_TYPE_DVR:
1711 res = (path->dvr.fp_interface - rpath->frp_sw_if_index);
1713 case FIB_PATH_TYPE_SPECIAL:
1714 case FIB_PATH_TYPE_RECEIVE:
1715 case FIB_PATH_TYPE_EXCLUSIVE:
1724 * fib_path_recursive_loop_detect
1726 * A forward walk of the FIB object graph to detect for a cycle/loop. This
1727 * walk is initiated when an entry is linking to a new path list or from an old.
1728 * The entry vector passed contains all the FIB entrys that are children of this
1729 * path (it is all the entries encountered on the walk so far). If this vector
1730 * contains the entry this path resolve via, then a loop is about to form.
1731 * The loop must be allowed to form, since we need the dependencies in place
1732 * so that we can track when the loop breaks.
1733 * However, we MUST not produce a loop in the forwarding graph (else packets
1734 * would loop around the switch path until the loop breaks), so we mark recursive
1735 * paths as looped so that they do not contribute forwarding information.
1736 * By marking the path as looped, an etry such as;
1738 * via a.a.a.a (looped)
1739 * via b.b.b.b (not looped)
1740 * can still forward using the info provided by b.b.b.b only
1743 fib_path_recursive_loop_detect (fib_node_index_t path_index,
1744 fib_node_index_t **entry_indicies)
1748 path = fib_path_get(path_index);
1751 * the forced drop path is never looped, cos it is never resolved.
1753 if (fib_path_is_permanent_drop(path))
1758 switch (path->fp_type)
1760 case FIB_PATH_TYPE_RECURSIVE:
1762 fib_node_index_t *entry_index, *entries;
1764 entries = *entry_indicies;
1766 vec_foreach(entry_index, entries) {
1767 if (*entry_index == path->fp_via_fib)
1770 * the entry that is about to link to this path-list (or
1771 * one of this path-list's children) is the same entry that
1772 * this recursive path resolves through. this is a cycle.
1782 FIB_PATH_DBG(path, "recursive loop formed");
1783 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1785 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1790 * no loop here yet. keep forward walking the graph.
1792 if (fib_entry_recursive_loop_detect(path->fp_via_fib, entry_indicies))
1794 FIB_PATH_DBG(path, "recursive loop formed");
1795 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1799 FIB_PATH_DBG(path, "recursive loop cleared");
1800 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1805 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1806 case FIB_PATH_TYPE_ATTACHED:
1807 case FIB_PATH_TYPE_SPECIAL:
1808 case FIB_PATH_TYPE_DEAG:
1809 case FIB_PATH_TYPE_DVR:
1810 case FIB_PATH_TYPE_RECEIVE:
1811 case FIB_PATH_TYPE_INTF_RX:
1812 case FIB_PATH_TYPE_UDP_ENCAP:
1813 case FIB_PATH_TYPE_EXCLUSIVE:
1814 case FIB_PATH_TYPE_BIER_FMASK:
1815 case FIB_PATH_TYPE_BIER_TABLE:
1816 case FIB_PATH_TYPE_BIER_IMP:
1818 * these path types cannot be part of a loop, since they are the leaves
1824 return (fib_path_is_looped(path_index));
1828 fib_path_resolve (fib_node_index_t path_index)
1832 path = fib_path_get(path_index);
1835 * hope for the best.
1837 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1840 * the forced drop path resolves via the drop adj
1842 if (fib_path_is_permanent_drop(path))
1844 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1845 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1846 return (fib_path_is_resolved(path_index));
1849 switch (path->fp_type)
1851 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1852 fib_path_attached_next_hop_set(path);
1854 case FIB_PATH_TYPE_ATTACHED:
1856 * path->attached.fp_interface
1858 if (!vnet_sw_interface_is_admin_up(vnet_get_main(),
1859 path->attached.fp_interface))
1861 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1863 dpo_set(&path->fp_dpo,
1866 fib_path_attached_get_adj(path,
1867 dpo_proto_to_link(path->fp_nh_proto)));
1870 * become a child of the adjacency so we receive updates
1871 * when the interface state changes
1873 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
1875 fib_path_get_index(path));
1877 case FIB_PATH_TYPE_RECURSIVE:
1880 * Create a RR source entry in the table for the address
1881 * that this path recurses through.
1882 * This resolve action is recursive, hence we may create
1883 * more paths in the process. more creates mean maybe realloc
1886 fib_node_index_t fei;
1889 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_fib);
1891 if (DPO_PROTO_MPLS == path->fp_nh_proto)
1893 fib_prefix_from_mpls_label(path->recursive.fp_nh.fp_local_label,
1894 path->recursive.fp_nh.fp_eos,
1899 fib_prefix_from_ip46_addr(&path->recursive.fp_nh.fp_ip, &pfx);
1902 fei = fib_table_entry_special_add(path->recursive.fp_tbl_id,
1905 FIB_ENTRY_FLAG_NONE);
1907 path = fib_path_get(path_index);
1908 path->fp_via_fib = fei;
1911 * become a dependent child of the entry so the path is
1912 * informed when the forwarding for the entry changes.
1914 path->fp_sibling = fib_entry_child_add(path->fp_via_fib,
1916 fib_path_get_index(path));
1919 * create and configure the IP DPO
1921 fib_path_recursive_adj_update(
1923 fib_path_to_chain_type(path),
1928 case FIB_PATH_TYPE_BIER_FMASK:
1931 * become a dependent child of the entry so the path is
1932 * informed when the forwarding for the entry changes.
1934 path->fp_sibling = bier_fmask_child_add(path->bier_fmask.fp_bier_fmask,
1936 fib_path_get_index(path));
1938 path->fp_via_bier_fmask = path->bier_fmask.fp_bier_fmask;
1939 fib_path_bier_fmask_update(path, &path->fp_dpo);
1943 case FIB_PATH_TYPE_BIER_IMP:
1944 bier_imp_lock(path->bier_imp.fp_bier_imp);
1945 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
1949 case FIB_PATH_TYPE_BIER_TABLE:
1952 * Find/create the BIER table to link to
1954 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_bier_tbl);
1956 path->fp_via_bier_tbl =
1957 bier_table_ecmp_create_and_lock(&path->bier_table.fp_bier_tbl);
1959 bier_table_contribute_forwarding(path->fp_via_bier_tbl,
1963 case FIB_PATH_TYPE_SPECIAL:
1965 * Resolve via the drop
1967 dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
1969 case FIB_PATH_TYPE_DEAG:
1971 if (DPO_PROTO_BIER == path->fp_nh_proto)
1973 bier_disp_table_contribute_forwarding(path->deag.fp_tbl_id,
1979 * Resolve via a lookup DPO.
1980 * FIXME. control plane should add routes with a table ID
1982 lookup_input_t input;
1985 cast = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ?
1988 input = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DEAG_SRC ?
1989 LOOKUP_INPUT_SRC_ADDR :
1990 LOOKUP_INPUT_DST_ADDR);
1992 lookup_dpo_add_or_lock_w_fib_index(path->deag.fp_tbl_id,
1996 LOOKUP_TABLE_FROM_CONFIG,
2001 case FIB_PATH_TYPE_DVR:
2002 dvr_dpo_add_or_lock(path->attached.fp_interface,
2006 case FIB_PATH_TYPE_RECEIVE:
2008 * Resolve via a receive DPO.
2010 receive_dpo_add_or_lock(path->fp_nh_proto,
2011 path->receive.fp_interface,
2012 &path->receive.fp_addr,
2015 case FIB_PATH_TYPE_UDP_ENCAP:
2016 udp_encap_lock(path->udp_encap.fp_udp_encap_id);
2017 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2021 case FIB_PATH_TYPE_INTF_RX: {
2023 * Resolve via a receive DPO.
2025 interface_rx_dpo_add_or_lock(path->fp_nh_proto,
2026 path->intf_rx.fp_interface,
2030 case FIB_PATH_TYPE_EXCLUSIVE:
2032 * Resolve via the user provided DPO
2034 dpo_copy(&path->fp_dpo, &path->exclusive.fp_ex_dpo);
2038 return (fib_path_is_resolved(path_index));
2042 fib_path_get_resolving_interface (fib_node_index_t path_index)
2046 path = fib_path_get(path_index);
2048 switch (path->fp_type)
2050 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2051 return (path->attached_next_hop.fp_interface);
2052 case FIB_PATH_TYPE_ATTACHED:
2053 return (path->attached.fp_interface);
2054 case FIB_PATH_TYPE_RECEIVE:
2055 return (path->receive.fp_interface);
2056 case FIB_PATH_TYPE_RECURSIVE:
2057 if (fib_path_is_resolved(path_index))
2059 return (fib_entry_get_resolving_interface(path->fp_via_fib));
2062 case FIB_PATH_TYPE_DVR:
2063 return (path->dvr.fp_interface);
2064 case FIB_PATH_TYPE_INTF_RX:
2065 case FIB_PATH_TYPE_UDP_ENCAP:
2066 case FIB_PATH_TYPE_SPECIAL:
2067 case FIB_PATH_TYPE_DEAG:
2068 case FIB_PATH_TYPE_EXCLUSIVE:
2069 case FIB_PATH_TYPE_BIER_FMASK:
2070 case FIB_PATH_TYPE_BIER_TABLE:
2071 case FIB_PATH_TYPE_BIER_IMP:
2078 fib_path_get_resolving_index (fib_node_index_t path_index)
2082 path = fib_path_get(path_index);
2084 switch (path->fp_type)
2086 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2087 case FIB_PATH_TYPE_ATTACHED:
2088 case FIB_PATH_TYPE_RECEIVE:
2089 case FIB_PATH_TYPE_INTF_RX:
2090 case FIB_PATH_TYPE_SPECIAL:
2091 case FIB_PATH_TYPE_DEAG:
2092 case FIB_PATH_TYPE_DVR:
2093 case FIB_PATH_TYPE_EXCLUSIVE:
2095 case FIB_PATH_TYPE_UDP_ENCAP:
2096 return (path->udp_encap.fp_udp_encap_id);
2097 case FIB_PATH_TYPE_RECURSIVE:
2098 return (path->fp_via_fib);
2099 case FIB_PATH_TYPE_BIER_FMASK:
2100 return (path->bier_fmask.fp_bier_fmask);
2101 case FIB_PATH_TYPE_BIER_TABLE:
2102 return (path->fp_via_bier_tbl);
2103 case FIB_PATH_TYPE_BIER_IMP:
2104 return (path->bier_imp.fp_bier_imp);
2110 fib_path_get_adj (fib_node_index_t path_index)
2114 path = fib_path_get(path_index);
2116 ASSERT(dpo_is_adj(&path->fp_dpo));
2117 if (dpo_is_adj(&path->fp_dpo))
2119 return (path->fp_dpo.dpoi_index);
2121 return (ADJ_INDEX_INVALID);
2125 fib_path_get_weight (fib_node_index_t path_index)
2129 path = fib_path_get(path_index);
2133 return (path->fp_weight);
2137 fib_path_get_preference (fib_node_index_t path_index)
2141 path = fib_path_get(path_index);
2145 return (path->fp_preference);
2149 fib_path_get_rpf_id (fib_node_index_t path_index)
2153 path = fib_path_get(path_index);
2157 if (FIB_PATH_CFG_FLAG_RPF_ID & path->fp_cfg_flags)
2159 return (path->deag.fp_rpf_id);
2166 * @brief Contribute the path's adjacency to the list passed.
2167 * By calling this function over all paths, recursively, a child
2168 * can construct its full set of forwarding adjacencies, and hence its
2172 fib_path_contribute_urpf (fib_node_index_t path_index,
2177 path = fib_path_get(path_index);
2180 * resolved and unresolved paths contribute to the RPF list.
2182 switch (path->fp_type)
2184 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2185 fib_urpf_list_append(urpf, path->attached_next_hop.fp_interface);
2188 case FIB_PATH_TYPE_ATTACHED:
2189 fib_urpf_list_append(urpf, path->attached.fp_interface);
2192 case FIB_PATH_TYPE_RECURSIVE:
2193 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib &&
2194 !fib_path_is_looped(path_index))
2197 * there's unresolved due to constraints, and there's unresolved
2198 * due to ain't got no via. can't do nowt w'out via.
2200 fib_entry_contribute_urpf(path->fp_via_fib, urpf);
2204 case FIB_PATH_TYPE_EXCLUSIVE:
2205 case FIB_PATH_TYPE_SPECIAL:
2208 * these path types may link to an adj, if that's what
2211 u32 rpf_sw_if_index;
2213 rpf_sw_if_index = dpo_get_urpf(&path->fp_dpo);
2215 if (~0 != rpf_sw_if_index)
2217 fib_urpf_list_append(urpf, rpf_sw_if_index);
2221 case FIB_PATH_TYPE_DVR:
2222 fib_urpf_list_append(urpf, path->dvr.fp_interface);
2224 case FIB_PATH_TYPE_DEAG:
2225 case FIB_PATH_TYPE_RECEIVE:
2226 case FIB_PATH_TYPE_INTF_RX:
2227 case FIB_PATH_TYPE_UDP_ENCAP:
2228 case FIB_PATH_TYPE_BIER_FMASK:
2229 case FIB_PATH_TYPE_BIER_TABLE:
2230 case FIB_PATH_TYPE_BIER_IMP:
2232 * these path types don't link to an adj
2239 fib_path_stack_mpls_disp (fib_node_index_t path_index,
2240 dpo_proto_t payload_proto,
2245 path = fib_path_get(path_index);
2249 switch (path->fp_type)
2251 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2253 dpo_id_t tmp = DPO_INVALID;
2255 dpo_copy(&tmp, dpo);
2257 DPO_MPLS_DISPOSITION,
2259 mpls_disp_dpo_create(payload_proto, ~0, &tmp));
2263 case FIB_PATH_TYPE_DEAG:
2265 dpo_id_t tmp = DPO_INVALID;
2267 dpo_copy(&tmp, dpo);
2269 DPO_MPLS_DISPOSITION,
2271 mpls_disp_dpo_create(payload_proto,
2272 path->deag.fp_rpf_id,
2277 case FIB_PATH_TYPE_RECEIVE:
2278 case FIB_PATH_TYPE_ATTACHED:
2279 case FIB_PATH_TYPE_RECURSIVE:
2280 case FIB_PATH_TYPE_INTF_RX:
2281 case FIB_PATH_TYPE_UDP_ENCAP:
2282 case FIB_PATH_TYPE_EXCLUSIVE:
2283 case FIB_PATH_TYPE_SPECIAL:
2284 case FIB_PATH_TYPE_BIER_FMASK:
2285 case FIB_PATH_TYPE_BIER_TABLE:
2286 case FIB_PATH_TYPE_BIER_IMP:
2287 case FIB_PATH_TYPE_DVR:
2293 fib_path_contribute_forwarding (fib_node_index_t path_index,
2294 fib_forward_chain_type_t fct,
2299 path = fib_path_get(path_index);
2302 ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS != fct);
2304 FIB_PATH_DBG(path, "contribute");
2307 * The DPO stored in the path was created when the path was resolved.
2308 * This then represents the path's 'native' protocol; IP.
2309 * For all others will need to go find something else.
2311 if (fib_path_to_chain_type(path) == fct)
2313 dpo_copy(dpo, &path->fp_dpo);
2317 switch (path->fp_type)
2319 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2322 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2323 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2324 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2325 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2326 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2327 case FIB_FORW_CHAIN_TYPE_NSH:
2332 * get a appropriate link type adj.
2334 ai = fib_path_attached_next_hop_get_adj(
2336 fib_forw_chain_type_to_link_type(fct));
2337 dpo_set(dpo, DPO_ADJACENCY,
2338 fib_forw_chain_type_to_dpo_proto(fct), ai);
2343 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2344 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2345 case FIB_FORW_CHAIN_TYPE_BIER:
2349 case FIB_PATH_TYPE_RECURSIVE:
2352 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2353 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2354 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2355 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2356 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2357 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2358 case FIB_FORW_CHAIN_TYPE_BIER:
2359 fib_path_recursive_adj_update(path, fct, dpo);
2361 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2362 case FIB_FORW_CHAIN_TYPE_NSH:
2367 case FIB_PATH_TYPE_BIER_TABLE:
2370 case FIB_FORW_CHAIN_TYPE_BIER:
2371 bier_table_contribute_forwarding(path->fp_via_bier_tbl, dpo);
2373 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2374 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2375 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2376 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2377 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2378 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2379 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2380 case FIB_FORW_CHAIN_TYPE_NSH:
2385 case FIB_PATH_TYPE_BIER_FMASK:
2388 case FIB_FORW_CHAIN_TYPE_BIER:
2389 fib_path_bier_fmask_update(path, dpo);
2391 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2392 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2393 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2394 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2395 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2396 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2397 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2398 case FIB_FORW_CHAIN_TYPE_NSH:
2403 case FIB_PATH_TYPE_BIER_IMP:
2404 bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
2405 fib_forw_chain_type_to_dpo_proto(fct),
2408 case FIB_PATH_TYPE_DEAG:
2411 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2412 lookup_dpo_add_or_lock_w_table_id(MPLS_FIB_DEFAULT_TABLE_ID,
2415 LOOKUP_INPUT_DST_ADDR,
2416 LOOKUP_TABLE_FROM_CONFIG,
2419 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2420 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2421 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2422 dpo_copy(dpo, &path->fp_dpo);
2424 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2425 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2426 case FIB_FORW_CHAIN_TYPE_BIER:
2428 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2429 case FIB_FORW_CHAIN_TYPE_NSH:
2434 case FIB_PATH_TYPE_EXCLUSIVE:
2435 dpo_copy(dpo, &path->exclusive.fp_ex_dpo);
2437 case FIB_PATH_TYPE_ATTACHED:
2440 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2441 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2442 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2443 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2444 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2445 case FIB_FORW_CHAIN_TYPE_NSH:
2446 case FIB_FORW_CHAIN_TYPE_BIER:
2451 * get a appropriate link type adj.
2453 ai = fib_path_attached_get_adj(
2455 fib_forw_chain_type_to_link_type(fct));
2456 dpo_set(dpo, DPO_ADJACENCY,
2457 fib_forw_chain_type_to_dpo_proto(fct), ai);
2461 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2462 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2467 * Create the adj needed for sending IP multicast traffic
2469 ai = adj_mcast_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
2470 fib_forw_chain_type_to_link_type(fct),
2471 path->attached.fp_interface);
2472 dpo_set(dpo, DPO_ADJACENCY,
2473 fib_forw_chain_type_to_dpo_proto(fct),
2480 case FIB_PATH_TYPE_INTF_RX:
2482 * Create the adj needed for sending IP multicast traffic
2484 interface_rx_dpo_add_or_lock(fib_forw_chain_type_to_dpo_proto(fct),
2485 path->attached.fp_interface,
2488 case FIB_PATH_TYPE_UDP_ENCAP:
2489 udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
2493 case FIB_PATH_TYPE_RECEIVE:
2494 case FIB_PATH_TYPE_SPECIAL:
2495 case FIB_PATH_TYPE_DVR:
2496 dpo_copy(dpo, &path->fp_dpo);
2502 load_balance_path_t *
2503 fib_path_append_nh_for_multipath_hash (fib_node_index_t path_index,
2504 fib_forward_chain_type_t fct,
2505 load_balance_path_t *hash_key)
2507 load_balance_path_t *mnh;
2510 path = fib_path_get(path_index);
2514 if (fib_path_is_resolved(path_index))
2516 vec_add2(hash_key, mnh, 1);
2518 mnh->path_weight = path->fp_weight;
2519 mnh->path_index = path_index;
2520 fib_path_contribute_forwarding(path_index, fct, &mnh->path_dpo);
2527 fib_path_is_recursive_constrained (fib_node_index_t path_index)
2531 path = fib_path_get(path_index);
2533 return ((FIB_PATH_TYPE_RECURSIVE == path->fp_type) &&
2534 ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED) ||
2535 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)));
2539 fib_path_is_exclusive (fib_node_index_t path_index)
2543 path = fib_path_get(path_index);
2545 return (FIB_PATH_TYPE_EXCLUSIVE == path->fp_type);
2549 fib_path_is_deag (fib_node_index_t path_index)
2553 path = fib_path_get(path_index);
2555 return (FIB_PATH_TYPE_DEAG == path->fp_type);
2559 fib_path_is_resolved (fib_node_index_t path_index)
2563 path = fib_path_get(path_index);
2565 return (dpo_id_is_valid(&path->fp_dpo) &&
2566 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED) &&
2567 !fib_path_is_looped(path_index) &&
2568 !fib_path_is_permanent_drop(path));
2572 fib_path_is_looped (fib_node_index_t path_index)
2576 path = fib_path_get(path_index);
2578 return (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP);
2581 fib_path_list_walk_rc_t
2582 fib_path_encode (fib_node_index_t path_list_index,
2583 fib_node_index_t path_index,
2586 fib_route_path_encode_t **api_rpaths = ctx;
2587 fib_route_path_encode_t *api_rpath;
2590 path = fib_path_get(path_index);
2592 return (FIB_PATH_LIST_WALK_CONTINUE);
2593 vec_add2(*api_rpaths, api_rpath, 1);
2594 api_rpath->rpath.frp_weight = path->fp_weight;
2595 api_rpath->rpath.frp_preference = path->fp_preference;
2596 api_rpath->rpath.frp_proto = path->fp_nh_proto;
2597 api_rpath->rpath.frp_sw_if_index = ~0;
2598 api_rpath->dpo = path->fp_dpo;
2600 switch (path->fp_type)
2602 case FIB_PATH_TYPE_RECEIVE:
2603 api_rpath->rpath.frp_addr = path->receive.fp_addr;
2604 api_rpath->rpath.frp_sw_if_index = path->receive.fp_interface;
2606 case FIB_PATH_TYPE_ATTACHED:
2607 api_rpath->rpath.frp_sw_if_index = path->attached.fp_interface;
2609 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2610 api_rpath->rpath.frp_sw_if_index = path->attached_next_hop.fp_interface;
2611 api_rpath->rpath.frp_addr = path->attached_next_hop.fp_nh;
2613 case FIB_PATH_TYPE_BIER_FMASK:
2614 api_rpath->rpath.frp_bier_fmask = path->bier_fmask.fp_bier_fmask;
2616 case FIB_PATH_TYPE_SPECIAL:
2618 case FIB_PATH_TYPE_DEAG:
2619 api_rpath->rpath.frp_fib_index = path->deag.fp_tbl_id;
2621 case FIB_PATH_TYPE_RECURSIVE:
2622 api_rpath->rpath.frp_addr = path->recursive.fp_nh.fp_ip;
2628 return (FIB_PATH_LIST_WALK_CONTINUE);
2632 fib_path_get_proto (fib_node_index_t path_index)
2636 path = fib_path_get(path_index);
2638 return (path->fp_nh_proto);
2642 fib_path_module_init (void)
2644 fib_node_register_type (FIB_NODE_TYPE_PATH, &fib_path_vft);
2647 static clib_error_t *
2648 show_fib_path_command (vlib_main_t * vm,
2649 unformat_input_t * input,
2650 vlib_cli_command_t * cmd)
2652 fib_node_index_t pi;
2655 if (unformat (input, "%d", &pi))
2658 * show one in detail
2660 if (!pool_is_free_index(fib_path_pool, pi))
2662 path = fib_path_get(pi);
2663 u8 *s = format(NULL, "%U", format_fib_path, pi, 1);
2664 s = format(s, "children:");
2665 s = fib_node_children_format(path->fp_node.fn_children, s);
2666 vlib_cli_output (vm, "%s", s);
2671 vlib_cli_output (vm, "path %d invalid", pi);
2676 vlib_cli_output (vm, "FIB Paths");
2677 pool_foreach_index (pi, fib_path_pool,
2679 vlib_cli_output (vm, "%U", format_fib_path, pi, 0);
2686 VLIB_CLI_COMMAND (show_fib_path, static) = {
2687 .path = "show fib paths",
2688 .function = show_fib_path_command,
2689 .short_help = "show fib paths",