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_dpo.h>
25 #include <vnet/dpo/mpls_disposition.h>
27 #include <vnet/adj/adj.h>
28 #include <vnet/adj/adj_mcast.h>
30 #include <vnet/fib/fib_path.h>
31 #include <vnet/fib/fib_node.h>
32 #include <vnet/fib/fib_table.h>
33 #include <vnet/fib/fib_entry.h>
34 #include <vnet/fib/fib_path_list.h>
35 #include <vnet/fib/fib_internal.h>
36 #include <vnet/fib/fib_urpf_list.h>
37 #include <vnet/fib/mpls_fib.h>
40 * Enurmeration of path types
42 typedef enum fib_path_type_t_ {
44 * Marker. Add new types after this one.
46 FIB_PATH_TYPE_FIRST = 0,
48 * Attached-nexthop. An interface and a nexthop are known.
50 FIB_PATH_TYPE_ATTACHED_NEXT_HOP = FIB_PATH_TYPE_FIRST,
52 * attached. Only the interface is known.
54 FIB_PATH_TYPE_ATTACHED,
56 * recursive. Only the next-hop is known.
58 FIB_PATH_TYPE_RECURSIVE,
60 * special. nothing is known. so we drop.
62 FIB_PATH_TYPE_SPECIAL,
64 * exclusive. user provided adj.
66 FIB_PATH_TYPE_EXCLUSIVE,
68 * deag. Link to a lookup adj in the next table
74 FIB_PATH_TYPE_INTF_RX,
76 * receive. it's for-us.
78 FIB_PATH_TYPE_RECEIVE,
80 * Marker. Add new types before this one, then update it.
82 FIB_PATH_TYPE_LAST = FIB_PATH_TYPE_RECEIVE,
83 } __attribute__ ((packed)) fib_path_type_t;
86 * The maximum number of path_types
88 #define FIB_PATH_TYPE_MAX (FIB_PATH_TYPE_LAST + 1)
90 #define FIB_PATH_TYPES { \
91 [FIB_PATH_TYPE_ATTACHED_NEXT_HOP] = "attached-nexthop", \
92 [FIB_PATH_TYPE_ATTACHED] = "attached", \
93 [FIB_PATH_TYPE_RECURSIVE] = "recursive", \
94 [FIB_PATH_TYPE_SPECIAL] = "special", \
95 [FIB_PATH_TYPE_EXCLUSIVE] = "exclusive", \
96 [FIB_PATH_TYPE_DEAG] = "deag", \
97 [FIB_PATH_TYPE_INTF_RX] = "intf-rx", \
98 [FIB_PATH_TYPE_RECEIVE] = "receive", \
101 #define FOR_EACH_FIB_PATH_TYPE(_item) \
102 for (_item = FIB_PATH_TYPE_FIRST; _item <= FIB_PATH_TYPE_LAST; _item++)
105 * Enurmeration of path operational (i.e. derived) attributes
107 typedef enum fib_path_oper_attribute_t_ {
109 * Marker. Add new types after this one.
111 FIB_PATH_OPER_ATTRIBUTE_FIRST = 0,
113 * The path forms part of a recursive loop.
115 FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP = FIB_PATH_OPER_ATTRIBUTE_FIRST,
117 * The path is resolved
119 FIB_PATH_OPER_ATTRIBUTE_RESOLVED,
121 * The path is attached, despite what the next-hop may say.
123 FIB_PATH_OPER_ATTRIBUTE_ATTACHED,
125 * The path has become a permanent drop.
127 FIB_PATH_OPER_ATTRIBUTE_DROP,
129 * Marker. Add new types before this one, then update it.
131 FIB_PATH_OPER_ATTRIBUTE_LAST = FIB_PATH_OPER_ATTRIBUTE_DROP,
132 } __attribute__ ((packed)) fib_path_oper_attribute_t;
135 * The maximum number of path operational attributes
137 #define FIB_PATH_OPER_ATTRIBUTE_MAX (FIB_PATH_OPER_ATTRIBUTE_LAST + 1)
139 #define FIB_PATH_OPER_ATTRIBUTES { \
140 [FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP] = "recursive-loop", \
141 [FIB_PATH_OPER_ATTRIBUTE_RESOLVED] = "resolved", \
142 [FIB_PATH_OPER_ATTRIBUTE_DROP] = "drop", \
145 #define FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(_item) \
146 for (_item = FIB_PATH_OPER_ATTRIBUTE_FIRST; \
147 _item <= FIB_PATH_OPER_ATTRIBUTE_LAST; \
151 * Path flags from the attributes
153 typedef enum fib_path_oper_flags_t_ {
154 FIB_PATH_OPER_FLAG_NONE = 0,
155 FIB_PATH_OPER_FLAG_RECURSIVE_LOOP = (1 << FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP),
156 FIB_PATH_OPER_FLAG_DROP = (1 << FIB_PATH_OPER_ATTRIBUTE_DROP),
157 FIB_PATH_OPER_FLAG_RESOLVED = (1 << FIB_PATH_OPER_ATTRIBUTE_RESOLVED),
158 FIB_PATH_OPER_FLAG_ATTACHED = (1 << FIB_PATH_OPER_ATTRIBUTE_ATTACHED),
159 } __attribute__ ((packed)) fib_path_oper_flags_t;
164 typedef struct fib_path_t_ {
166 * A path is a node in the FIB graph.
171 * The index of the path-list to which this path belongs
176 * This marks the start of the memory area used to hash
179 STRUCT_MARK(path_hash_start);
182 * Configuration Flags
184 fib_path_cfg_flags_t fp_cfg_flags;
187 * The type of the path. This is the selector for the union
189 fib_path_type_t fp_type;
192 * The protocol of the next-hop, i.e. the address family of the
193 * next-hop's address. We can't derive this from the address itself
194 * since the address can be all zeros
196 fib_protocol_t fp_nh_proto;
199 * UCMP [unnormalised] weigth
203 * A path preference. 0 is the best.
204 * Only paths of the best preference, that are 'up', are considered
210 * per-type union of the data required to resolve the path
217 ip46_address_t fp_nh;
235 ip46_address_t fp_ip;
238 * The local label to resolve through.
240 mpls_label_t fp_local_label;
242 * The EOS bit of the resolving label
244 mpls_eos_bit_t fp_eos;
248 * The FIB table index in which to find the next-hop.
250 fib_node_index_t fp_tbl_id;
254 * The FIB index in which to perfom the next lookup
256 fib_node_index_t fp_tbl_id;
258 * The RPF-ID to tag the packets with
260 fib_rpf_id_t fp_rpf_id;
266 * The user provided 'exclusive' DPO
272 * The interface on which the local address is configured
278 ip46_address_t fp_addr;
282 * The interface on which the packets will be input.
287 STRUCT_MARK(path_hash_end);
290 * Memebers in this last section represent information that is
291 * dervied during resolution. It should not be copied to new paths
298 fib_path_oper_flags_t fp_oper_flags;
301 * the resolving via fib. not part of the union, since it it not part
302 * of the path's hash.
304 fib_node_index_t fp_via_fib;
307 * The Data-path objects through which this path resolves for IP.
312 * the index of this path in the parent's child list.
318 * Array of strings/names for the path types and attributes
320 static const char *fib_path_type_names[] = FIB_PATH_TYPES;
321 static const char *fib_path_oper_attribute_names[] = FIB_PATH_OPER_ATTRIBUTES;
322 static const char *fib_path_cfg_attribute_names[] = FIB_PATH_CFG_ATTRIBUTES;
325 * The memory pool from which we allocate all the paths
327 static fib_path_t *fib_path_pool;
333 #define FIB_PATH_DBG(_p, _fmt, _args...) \
336 _tmp = fib_path_format(fib_path_get_index(_p), _tmp); \
337 clib_warning("path:[%d:%s]:" _fmt, \
338 fib_path_get_index(_p), _tmp, \
343 #define FIB_PATH_DBG(_p, _fmt, _args...)
347 fib_path_get (fib_node_index_t index)
349 return (pool_elt_at_index(fib_path_pool, index));
352 static fib_node_index_t
353 fib_path_get_index (fib_path_t *path)
355 return (path - fib_path_pool);
359 fib_path_get_node (fib_node_index_t index)
361 return ((fib_node_t*)fib_path_get(index));
365 fib_path_from_fib_node (fib_node_t *node)
368 ASSERT(FIB_NODE_TYPE_PATH == node->fn_type);
370 return ((fib_path_t*)node);
374 format_fib_path (u8 * s, va_list * args)
376 fib_path_t *path = va_arg (*args, fib_path_t *);
377 vnet_main_t * vnm = vnet_get_main();
378 fib_path_oper_attribute_t oattr;
379 fib_path_cfg_attribute_t cattr;
381 s = format (s, " index:%d ", fib_path_get_index(path));
382 s = format (s, "pl-index:%d ", path->fp_pl_index);
383 s = format (s, "%U ", format_fib_protocol, path->fp_nh_proto);
384 s = format (s, "weight=%d ", path->fp_weight);
385 s = format (s, "pref=%d ", path->fp_preference);
386 s = format (s, "%s: ", fib_path_type_names[path->fp_type]);
387 if (FIB_PATH_OPER_FLAG_NONE != path->fp_oper_flags) {
388 s = format(s, " oper-flags:");
389 FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(oattr) {
390 if ((1<<oattr) & path->fp_oper_flags) {
391 s = format (s, "%s,", fib_path_oper_attribute_names[oattr]);
395 if (FIB_PATH_CFG_FLAG_NONE != path->fp_cfg_flags) {
396 s = format(s, " cfg-flags:");
397 FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(cattr) {
398 if ((1<<cattr) & path->fp_cfg_flags) {
399 s = format (s, "%s,", fib_path_cfg_attribute_names[cattr]);
403 s = format(s, "\n ");
405 switch (path->fp_type)
407 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
408 s = format (s, "%U", format_ip46_address,
409 &path->attached_next_hop.fp_nh,
411 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
413 s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
417 s = format (s, " %U",
418 format_vnet_sw_interface_name,
420 vnet_get_sw_interface(
422 path->attached_next_hop.fp_interface));
423 if (vnet_sw_interface_is_p2p(vnet_get_main(),
424 path->attached_next_hop.fp_interface))
426 s = format (s, " (p2p)");
429 if (!dpo_id_is_valid(&path->fp_dpo))
431 s = format(s, "\n unresolved");
435 s = format(s, "\n %U",
440 case FIB_PATH_TYPE_ATTACHED:
441 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
443 s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
447 s = format (s, " %U",
448 format_vnet_sw_interface_name,
450 vnet_get_sw_interface(
452 path->attached.fp_interface));
455 case FIB_PATH_TYPE_RECURSIVE:
456 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
458 s = format (s, "via %U %U",
459 format_mpls_unicast_label,
460 path->recursive.fp_nh.fp_local_label,
462 path->recursive.fp_nh.fp_eos);
466 s = format (s, "via %U",
468 &path->recursive.fp_nh.fp_ip,
471 s = format (s, " in fib:%d",
472 path->recursive.fp_tbl_id,
474 s = format (s, " via-fib:%d", path->fp_via_fib);
475 s = format (s, " via-dpo:[%U:%d]",
476 format_dpo_type, path->fp_dpo.dpoi_type,
477 path->fp_dpo.dpoi_index);
480 case FIB_PATH_TYPE_RECEIVE:
481 case FIB_PATH_TYPE_INTF_RX:
482 case FIB_PATH_TYPE_SPECIAL:
483 case FIB_PATH_TYPE_DEAG:
484 case FIB_PATH_TYPE_EXCLUSIVE:
485 if (dpo_id_is_valid(&path->fp_dpo))
487 s = format(s, "%U", format_dpo_id,
496 fib_path_format (fib_node_index_t pi, u8 *s)
500 path = fib_path_get(pi);
501 ASSERT(NULL != path);
503 return (format (s, "%U", format_fib_path, path));
507 fib_path_adj_format (fib_node_index_t pi,
513 path = fib_path_get(pi);
514 ASSERT(NULL != path);
516 if (!dpo_id_is_valid(&path->fp_dpo))
518 s = format(s, " unresolved");
522 s = format(s, "%U", format_dpo_id,
530 * fib_path_last_lock_gone
532 * We don't share paths, we share path lists, so the [un]lock functions
536 fib_path_last_lock_gone (fib_node_t *node)
541 static const adj_index_t
542 fib_path_attached_next_hop_get_adj (fib_path_t *path,
545 if (vnet_sw_interface_is_p2p(vnet_get_main(),
546 path->attached_next_hop.fp_interface))
549 * if the interface is p2p then the adj for the specific
550 * neighbour on that link will never exist. on p2p links
551 * the subnet address (the attached route) links to the
552 * auto-adj (see below), we want that adj here too.
554 return (adj_nbr_add_or_lock(path->fp_nh_proto,
557 path->attached_next_hop.fp_interface));
561 return (adj_nbr_add_or_lock(path->fp_nh_proto,
563 &path->attached_next_hop.fp_nh,
564 path->attached_next_hop.fp_interface));
569 fib_path_attached_next_hop_set (fib_path_t *path)
572 * resolve directly via the adjacnecy discribed by the
573 * interface and next-hop
575 dpo_set(&path->fp_dpo,
577 fib_proto_to_dpo(path->fp_nh_proto),
578 fib_path_attached_next_hop_get_adj(
580 fib_proto_to_link(path->fp_nh_proto)));
583 * become a child of the adjacency so we receive updates
584 * when its rewrite changes
586 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
588 fib_path_get_index(path));
590 if (!vnet_sw_interface_is_admin_up(vnet_get_main(),
591 path->attached_next_hop.fp_interface) ||
592 !adj_is_up(path->fp_dpo.dpoi_index))
594 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
598 static const adj_index_t
599 fib_path_attached_get_adj (fib_path_t *path,
602 if (vnet_sw_interface_is_p2p(vnet_get_main(),
603 path->attached.fp_interface))
606 * point-2-point interfaces do not require a glean, since
607 * there is nothing to ARP. Install a rewrite/nbr adj instead
609 return (adj_nbr_add_or_lock(path->fp_nh_proto,
612 path->attached.fp_interface));
616 return (adj_glean_add_or_lock(path->fp_nh_proto,
617 path->attached.fp_interface,
623 * create of update the paths recursive adj
626 fib_path_recursive_adj_update (fib_path_t *path,
627 fib_forward_chain_type_t fct,
630 dpo_id_t via_dpo = DPO_INVALID;
633 * get the DPO to resolve through from the via-entry
635 fib_entry_contribute_forwarding(path->fp_via_fib,
641 * hope for the best - clear if restrictions apply.
643 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
646 * Validate any recursion constraints and over-ride the via
649 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP)
651 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
652 dpo_copy(&via_dpo, drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
654 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)
657 * the via FIB must be a host route.
658 * note the via FIB just added will always be a host route
659 * since it is an RR source added host route. So what we need to
660 * check is whether the route has other sources. If it does then
661 * some other source has added it as a host route. If it doesn't
662 * then it was added only here and inherits forwarding from a cover.
663 * the cover is not a host route.
664 * The RR source is the lowest priority source, so we check if it
665 * is the best. if it is there are no other sources.
667 if (fib_entry_get_best_source(path->fp_via_fib) >= FIB_SOURCE_RR)
669 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
670 dpo_copy(&via_dpo, drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
673 * PIC edge trigger. let the load-balance maps know
675 load_balance_map_path_state_change(fib_path_get_index(path));
678 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED)
681 * RR source entries inherit the flags from the cover, so
682 * we can check the via directly
684 if (!(FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags(path->fp_via_fib)))
686 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
687 dpo_copy(&via_dpo, drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
690 * PIC edge trigger. let the load-balance maps know
692 load_balance_map_path_state_change(fib_path_get_index(path));
696 * check for over-riding factors on the FIB entry itself
698 if (!fib_entry_is_resolved(path->fp_via_fib))
700 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
701 dpo_copy(&via_dpo, drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
704 * PIC edge trigger. let the load-balance maps know
706 load_balance_map_path_state_change(fib_path_get_index(path));
710 * If this path is contributing a drop, then it's not resolved
712 if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
714 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
718 * update the path's contributed DPO
720 dpo_copy(dpo, &via_dpo);
722 FIB_PATH_DBG(path, "recursive update: %U",
723 fib_get_lookup_main(path->fp_nh_proto),
730 * fib_path_is_permanent_drop
732 * Return !0 if the path is configured to permanently drop,
733 * despite other attributes.
736 fib_path_is_permanent_drop (fib_path_t *path)
738 return ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP) ||
739 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP));
745 * Remove our dependency on the resolution target
748 fib_path_unresolve (fib_path_t *path)
751 * the forced drop path does not need unresolving
753 if (fib_path_is_permanent_drop(path))
758 switch (path->fp_type)
760 case FIB_PATH_TYPE_RECURSIVE:
761 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
765 fib_entry_get_prefix(path->fp_via_fib, &pfx);
766 fib_entry_child_remove(path->fp_via_fib,
768 fib_table_entry_special_remove(path->recursive.fp_tbl_id,
771 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
774 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
775 case FIB_PATH_TYPE_ATTACHED:
776 adj_child_remove(path->fp_dpo.dpoi_index,
778 adj_unlock(path->fp_dpo.dpoi_index);
780 case FIB_PATH_TYPE_EXCLUSIVE:
781 dpo_reset(&path->exclusive.fp_ex_dpo);
783 case FIB_PATH_TYPE_SPECIAL:
784 case FIB_PATH_TYPE_RECEIVE:
785 case FIB_PATH_TYPE_INTF_RX:
786 case FIB_PATH_TYPE_DEAG:
788 * these hold only the path's DPO, which is reset below.
794 * release the adj we were holding and pick up the
797 dpo_reset(&path->fp_dpo);
798 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
803 static fib_forward_chain_type_t
804 fib_path_to_chain_type (const fib_path_t *path)
806 switch (path->fp_nh_proto)
808 case FIB_PROTOCOL_IP4:
809 return (FIB_FORW_CHAIN_TYPE_UNICAST_IP4);
810 case FIB_PROTOCOL_IP6:
811 return (FIB_FORW_CHAIN_TYPE_UNICAST_IP6);
812 case FIB_PROTOCOL_MPLS:
813 if (FIB_PATH_TYPE_RECURSIVE == path->fp_type &&
814 MPLS_EOS == path->recursive.fp_nh.fp_eos)
816 return (FIB_FORW_CHAIN_TYPE_MPLS_EOS);
820 return (FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS);
823 return (FIB_FORW_CHAIN_TYPE_UNICAST_IP4);
827 * fib_path_back_walk_notify
829 * A back walk has reach this path.
831 static fib_node_back_walk_rc_t
832 fib_path_back_walk_notify (fib_node_t *node,
833 fib_node_back_walk_ctx_t *ctx)
837 path = fib_path_from_fib_node(node);
839 switch (path->fp_type)
841 case FIB_PATH_TYPE_RECURSIVE:
842 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
845 * modify the recursive adjacency to use the new forwarding
847 * this update is visible to packets in flight in the DP.
849 fib_path_recursive_adj_update(
851 fib_path_to_chain_type(path),
854 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
855 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
858 * ADJ updates (complete<->incomplete) do not need to propagate to
860 * The only reason its needed as far back as here, is that the adj
861 * and the incomplete adj are a different DPO type, so the LBs need
863 * If this walk was quashed in the fib_entry, then any non-fib_path
864 * children (like tunnels that collapse out the LB when they stack)
865 * would not see the update.
867 return (FIB_NODE_BACK_WALK_CONTINUE);
870 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
873 * ADJ_UPDATE backwalk pass silently through here and up to
874 * the path-list when the multipath adj collapse occurs.
875 * The reason we do this is that the assumtption is that VPP
876 * runs in an environment where the Control-Plane is remote
877 * and hence reacts slowly to link up down. In order to remove
878 * this down link from the ECMP set quickly, we back-walk.
879 * VPP also has dedicated CPUs, so we are not stealing resources
880 * from the CP to do so.
882 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
884 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED)
887 * alreday resolved. no need to walk back again
889 return (FIB_NODE_BACK_WALK_CONTINUE);
891 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
893 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
895 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
898 * alreday unresolved. no need to walk back again
900 return (FIB_NODE_BACK_WALK_CONTINUE);
902 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
904 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
907 * The interface this path resolves through has been deleted.
908 * This will leave the path in a permanent drop state. The route
909 * needs to be removed and readded (and hence the path-list deleted)
910 * before it can forward again.
912 fib_path_unresolve(path);
913 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
915 if (FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason)
918 * restack the DPO to pick up the correct DPO sub-type
923 if_is_up = vnet_sw_interface_is_admin_up(
925 path->attached_next_hop.fp_interface);
927 ai = fib_path_attached_next_hop_get_adj(
929 fib_proto_to_link(path->fp_nh_proto));
931 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
932 if (if_is_up && adj_is_up(ai))
934 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
937 dpo_set(&path->fp_dpo, DPO_ADJACENCY,
938 fib_proto_to_dpo(path->fp_nh_proto),
945 * If the interface is not up there is no reason to walk
946 * back to children. if we did they would only evalute
947 * that this path is unresolved and hence it would
948 * not contribute the adjacency - so it would be wasted
951 return (FIB_NODE_BACK_WALK_CONTINUE);
954 if (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason)
956 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
959 * alreday unresolved. no need to walk back again
961 return (FIB_NODE_BACK_WALK_CONTINUE);
964 * the adj has gone down. the path is no longer resolved.
966 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
969 case FIB_PATH_TYPE_ATTACHED:
971 * FIXME; this could schedule a lower priority walk, since attached
972 * routes are not usually in ECMP configurations so the backwalk to
973 * the FIB entry does not need to be high priority
975 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
977 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
979 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
981 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
983 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
985 fib_path_unresolve(path);
986 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
989 case FIB_PATH_TYPE_INTF_RX:
991 case FIB_PATH_TYPE_DEAG:
993 * FIXME When VRF delete is allowed this will need a poke.
995 case FIB_PATH_TYPE_SPECIAL:
996 case FIB_PATH_TYPE_RECEIVE:
997 case FIB_PATH_TYPE_EXCLUSIVE:
999 * these path types have no parents. so to be
1000 * walked from one is unexpected.
1007 * propagate the backwalk further to the path-list
1009 fib_path_list_back_walk(path->fp_pl_index, ctx);
1011 return (FIB_NODE_BACK_WALK_CONTINUE);
1015 fib_path_memory_show (void)
1017 fib_show_memory_usage("Path",
1018 pool_elts(fib_path_pool),
1019 pool_len(fib_path_pool),
1020 sizeof(fib_path_t));
1024 * The FIB path's graph node virtual function table
1026 static const fib_node_vft_t fib_path_vft = {
1027 .fnv_get = fib_path_get_node,
1028 .fnv_last_lock = fib_path_last_lock_gone,
1029 .fnv_back_walk = fib_path_back_walk_notify,
1030 .fnv_mem_show = fib_path_memory_show,
1033 static fib_path_cfg_flags_t
1034 fib_path_route_flags_to_cfg_flags (const fib_route_path_t *rpath)
1036 fib_path_cfg_flags_t cfg_flags = FIB_PATH_CFG_FLAG_NONE;
1038 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_HOST)
1039 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_HOST;
1040 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_ATTACHED)
1041 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED;
1042 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1043 cfg_flags |= FIB_PATH_CFG_FLAG_LOCAL;
1044 if (rpath->frp_flags & FIB_ROUTE_PATH_ATTACHED)
1045 cfg_flags |= FIB_PATH_CFG_FLAG_ATTACHED;
1046 if (rpath->frp_flags & FIB_ROUTE_PATH_INTF_RX)
1047 cfg_flags |= FIB_PATH_CFG_FLAG_INTF_RX;
1048 if (rpath->frp_flags & FIB_ROUTE_PATH_RPF_ID)
1049 cfg_flags |= FIB_PATH_CFG_FLAG_RPF_ID;
1050 if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1051 cfg_flags |= FIB_PATH_CFG_FLAG_EXCLUSIVE;
1052 if (rpath->frp_flags & FIB_ROUTE_PATH_DROP)
1053 cfg_flags |= FIB_PATH_CFG_FLAG_DROP;
1061 * Create and initialise a new path object.
1062 * return the index of the path.
1065 fib_path_create (fib_node_index_t pl_index,
1066 const fib_route_path_t *rpath)
1070 pool_get(fib_path_pool, path);
1071 memset(path, 0, sizeof(*path));
1073 fib_node_init(&path->fp_node,
1074 FIB_NODE_TYPE_PATH);
1076 dpo_reset(&path->fp_dpo);
1077 path->fp_pl_index = pl_index;
1078 path->fp_nh_proto = rpath->frp_proto;
1079 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1080 path->fp_weight = rpath->frp_weight;
1081 if (0 == path->fp_weight)
1084 * a weight of 0 is a meaningless value. We could either reject it, and thus force
1085 * clients to always use 1, or we can accept it and fixup approrpiately.
1087 path->fp_weight = 1;
1089 path->fp_preference = rpath->frp_preference;
1090 path->fp_cfg_flags = fib_path_route_flags_to_cfg_flags(rpath);
1093 * deduce the path's tpye from the parementers and save what is needed.
1095 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_LOCAL)
1097 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1098 path->receive.fp_interface = rpath->frp_sw_if_index;
1099 path->receive.fp_addr = rpath->frp_addr;
1101 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_INTF_RX)
1103 path->fp_type = FIB_PATH_TYPE_INTF_RX;
1104 path->intf_rx.fp_interface = rpath->frp_sw_if_index;
1106 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
1108 path->fp_type = FIB_PATH_TYPE_DEAG;
1109 path->deag.fp_tbl_id = rpath->frp_fib_index;
1110 path->deag.fp_rpf_id = rpath->frp_rpf_id;
1112 else if (~0 != rpath->frp_sw_if_index)
1114 if (ip46_address_is_zero(&rpath->frp_addr))
1116 path->fp_type = FIB_PATH_TYPE_ATTACHED;
1117 path->attached.fp_interface = rpath->frp_sw_if_index;
1121 path->fp_type = FIB_PATH_TYPE_ATTACHED_NEXT_HOP;
1122 path->attached_next_hop.fp_interface = rpath->frp_sw_if_index;
1123 path->attached_next_hop.fp_nh = rpath->frp_addr;
1128 if (ip46_address_is_zero(&rpath->frp_addr))
1130 if (~0 == rpath->frp_fib_index)
1132 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1136 path->fp_type = FIB_PATH_TYPE_DEAG;
1137 path->deag.fp_tbl_id = rpath->frp_fib_index;
1142 path->fp_type = FIB_PATH_TYPE_RECURSIVE;
1143 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
1145 path->recursive.fp_nh.fp_local_label = rpath->frp_local_label;
1146 path->recursive.fp_nh.fp_eos = rpath->frp_eos;
1150 path->recursive.fp_nh.fp_ip = rpath->frp_addr;
1152 path->recursive.fp_tbl_id = rpath->frp_fib_index;
1156 FIB_PATH_DBG(path, "create");
1158 return (fib_path_get_index(path));
1162 * fib_path_create_special
1164 * Create and initialise a new path object.
1165 * return the index of the path.
1168 fib_path_create_special (fib_node_index_t pl_index,
1169 fib_protocol_t nh_proto,
1170 fib_path_cfg_flags_t flags,
1171 const dpo_id_t *dpo)
1175 pool_get(fib_path_pool, path);
1176 memset(path, 0, sizeof(*path));
1178 fib_node_init(&path->fp_node,
1179 FIB_NODE_TYPE_PATH);
1180 dpo_reset(&path->fp_dpo);
1182 path->fp_pl_index = pl_index;
1183 path->fp_weight = 1;
1184 path->fp_preference = 0;
1185 path->fp_nh_proto = nh_proto;
1186 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1187 path->fp_cfg_flags = flags;
1189 if (FIB_PATH_CFG_FLAG_DROP & flags)
1191 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1193 else if (FIB_PATH_CFG_FLAG_LOCAL & flags)
1195 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1196 path->attached.fp_interface = FIB_NODE_INDEX_INVALID;
1200 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1201 ASSERT(NULL != dpo);
1202 dpo_copy(&path->exclusive.fp_ex_dpo, dpo);
1205 return (fib_path_get_index(path));
1211 * Copy a path. return index of new path.
1214 fib_path_copy (fib_node_index_t path_index,
1215 fib_node_index_t path_list_index)
1217 fib_path_t *path, *orig_path;
1219 pool_get(fib_path_pool, path);
1221 orig_path = fib_path_get(path_index);
1222 ASSERT(NULL != orig_path);
1224 memcpy(path, orig_path, sizeof(*path));
1226 FIB_PATH_DBG(path, "create-copy:%d", path_index);
1229 * reset the dynamic section
1231 fib_node_init(&path->fp_node, FIB_NODE_TYPE_PATH);
1232 path->fp_oper_flags = FIB_PATH_OPER_FLAG_NONE;
1233 path->fp_pl_index = path_list_index;
1234 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1235 memset(&path->fp_dpo, 0, sizeof(path->fp_dpo));
1236 dpo_reset(&path->fp_dpo);
1238 return (fib_path_get_index(path));
1244 * destroy a path that is no longer required
1247 fib_path_destroy (fib_node_index_t path_index)
1251 path = fib_path_get(path_index);
1253 ASSERT(NULL != path);
1254 FIB_PATH_DBG(path, "destroy");
1256 fib_path_unresolve(path);
1258 fib_node_deinit(&path->fp_node);
1259 pool_put(fib_path_pool, path);
1265 * destroy a path that is no longer required
1268 fib_path_hash (fib_node_index_t path_index)
1272 path = fib_path_get(path_index);
1274 return (hash_memory(STRUCT_MARK_PTR(path, path_hash_start),
1275 (STRUCT_OFFSET_OF(fib_path_t, path_hash_end) -
1276 STRUCT_OFFSET_OF(fib_path_t, path_hash_start)),
1283 * Compare two paths for equivalence.
1286 fib_path_cmp_i (const fib_path_t *path1,
1287 const fib_path_t *path2)
1294 * paths of different types and protocol are not equal.
1295 * different weights and/or preference only are the same path.
1297 if (path1->fp_type != path2->fp_type)
1299 res = (path1->fp_type - path2->fp_type);
1301 else if (path1->fp_nh_proto != path2->fp_nh_proto)
1303 res = (path1->fp_nh_proto - path2->fp_nh_proto);
1308 * both paths are of the same type.
1309 * consider each type and its attributes in turn.
1311 switch (path1->fp_type)
1313 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1314 res = ip46_address_cmp(&path1->attached_next_hop.fp_nh,
1315 &path2->attached_next_hop.fp_nh);
1317 res = (path1->attached_next_hop.fp_interface -
1318 path2->attached_next_hop.fp_interface);
1321 case FIB_PATH_TYPE_ATTACHED:
1322 res = (path1->attached.fp_interface -
1323 path2->attached.fp_interface);
1325 case FIB_PATH_TYPE_RECURSIVE:
1326 res = ip46_address_cmp(&path1->recursive.fp_nh,
1327 &path2->recursive.fp_nh);
1331 res = (path1->recursive.fp_tbl_id - path2->recursive.fp_tbl_id);
1334 case FIB_PATH_TYPE_DEAG:
1335 res = (path1->deag.fp_tbl_id - path2->deag.fp_tbl_id);
1338 res = (path1->deag.fp_rpf_id - path2->deag.fp_rpf_id);
1341 case FIB_PATH_TYPE_INTF_RX:
1342 res = (path1->intf_rx.fp_interface - path2->intf_rx.fp_interface);
1344 case FIB_PATH_TYPE_SPECIAL:
1345 case FIB_PATH_TYPE_RECEIVE:
1346 case FIB_PATH_TYPE_EXCLUSIVE:
1355 * fib_path_cmp_for_sort
1357 * Compare two paths for equivalence. Used during path sorting.
1358 * As usual 0 means equal.
1361 fib_path_cmp_for_sort (void * v1,
1364 fib_node_index_t *pi1 = v1, *pi2 = v2;
1365 fib_path_t *path1, *path2;
1367 path1 = fib_path_get(*pi1);
1368 path2 = fib_path_get(*pi2);
1371 * when sorting paths we want the highest preference paths
1372 * first, so that the choices set built is in prefernce order
1374 if (path1->fp_preference != path2->fp_preference)
1376 return (path1->fp_preference - path2->fp_preference);
1379 return (fib_path_cmp_i(path1, path2));
1385 * Compare two paths for equivalence.
1388 fib_path_cmp (fib_node_index_t pi1,
1389 fib_node_index_t pi2)
1391 fib_path_t *path1, *path2;
1393 path1 = fib_path_get(pi1);
1394 path2 = fib_path_get(pi2);
1396 return (fib_path_cmp_i(path1, path2));
1400 fib_path_cmp_w_route_path (fib_node_index_t path_index,
1401 const fib_route_path_t *rpath)
1406 path = fib_path_get(path_index);
1410 if (path->fp_weight != rpath->frp_weight)
1412 res = (path->fp_weight - rpath->frp_weight);
1417 * both paths are of the same type.
1418 * consider each type and its attributes in turn.
1420 switch (path->fp_type)
1422 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1423 res = ip46_address_cmp(&path->attached_next_hop.fp_nh,
1427 res = (path->attached_next_hop.fp_interface -
1428 rpath->frp_sw_if_index);
1431 case FIB_PATH_TYPE_ATTACHED:
1432 res = (path->attached.fp_interface - rpath->frp_sw_if_index);
1434 case FIB_PATH_TYPE_RECURSIVE:
1435 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
1437 res = path->recursive.fp_nh.fp_local_label - rpath->frp_local_label;
1441 res = path->recursive.fp_nh.fp_eos - rpath->frp_eos;
1446 res = ip46_address_cmp(&path->recursive.fp_nh.fp_ip,
1452 res = (path->recursive.fp_tbl_id - rpath->frp_fib_index);
1455 case FIB_PATH_TYPE_INTF_RX:
1456 res = (path->intf_rx.fp_interface - rpath->frp_sw_if_index);
1458 case FIB_PATH_TYPE_DEAG:
1459 res = (path->deag.fp_tbl_id - rpath->frp_fib_index);
1462 res = (path->deag.fp_rpf_id - rpath->frp_rpf_id);
1465 case FIB_PATH_TYPE_SPECIAL:
1466 case FIB_PATH_TYPE_RECEIVE:
1467 case FIB_PATH_TYPE_EXCLUSIVE:
1476 * fib_path_recursive_loop_detect
1478 * A forward walk of the FIB object graph to detect for a cycle/loop. This
1479 * walk is initiated when an entry is linking to a new path list or from an old.
1480 * The entry vector passed contains all the FIB entrys that are children of this
1481 * path (it is all the entries encountered on the walk so far). If this vector
1482 * contains the entry this path resolve via, then a loop is about to form.
1483 * The loop must be allowed to form, since we need the dependencies in place
1484 * so that we can track when the loop breaks.
1485 * However, we MUST not produce a loop in the forwarding graph (else packets
1486 * would loop around the switch path until the loop breaks), so we mark recursive
1487 * paths as looped so that they do not contribute forwarding information.
1488 * By marking the path as looped, an etry such as;
1490 * via a.a.a.a (looped)
1491 * via b.b.b.b (not looped)
1492 * can still forward using the info provided by b.b.b.b only
1495 fib_path_recursive_loop_detect (fib_node_index_t path_index,
1496 fib_node_index_t **entry_indicies)
1500 path = fib_path_get(path_index);
1503 * the forced drop path is never looped, cos it is never resolved.
1505 if (fib_path_is_permanent_drop(path))
1510 switch (path->fp_type)
1512 case FIB_PATH_TYPE_RECURSIVE:
1514 fib_node_index_t *entry_index, *entries;
1516 entries = *entry_indicies;
1518 vec_foreach(entry_index, entries) {
1519 if (*entry_index == path->fp_via_fib)
1522 * the entry that is about to link to this path-list (or
1523 * one of this path-list's children) is the same entry that
1524 * this recursive path resolves through. this is a cycle.
1534 FIB_PATH_DBG(path, "recursive loop formed");
1535 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1537 dpo_copy(&path->fp_dpo,
1538 drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
1543 * no loop here yet. keep forward walking the graph.
1545 if (fib_entry_recursive_loop_detect(path->fp_via_fib, entry_indicies))
1547 FIB_PATH_DBG(path, "recursive loop formed");
1548 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1552 FIB_PATH_DBG(path, "recursive loop cleared");
1553 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1558 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1559 case FIB_PATH_TYPE_ATTACHED:
1560 case FIB_PATH_TYPE_SPECIAL:
1561 case FIB_PATH_TYPE_DEAG:
1562 case FIB_PATH_TYPE_RECEIVE:
1563 case FIB_PATH_TYPE_INTF_RX:
1564 case FIB_PATH_TYPE_EXCLUSIVE:
1566 * these path types cannot be part of a loop, since they are the leaves
1572 return (fib_path_is_looped(path_index));
1576 fib_path_resolve (fib_node_index_t path_index)
1580 path = fib_path_get(path_index);
1583 * hope for the best.
1585 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1588 * the forced drop path resolves via the drop adj
1590 if (fib_path_is_permanent_drop(path))
1592 dpo_copy(&path->fp_dpo,
1593 drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
1594 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1595 return (fib_path_is_resolved(path_index));
1598 switch (path->fp_type)
1600 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1601 fib_path_attached_next_hop_set(path);
1603 case FIB_PATH_TYPE_ATTACHED:
1605 * path->attached.fp_interface
1607 if (!vnet_sw_interface_is_admin_up(vnet_get_main(),
1608 path->attached.fp_interface))
1610 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1612 dpo_set(&path->fp_dpo,
1614 fib_proto_to_dpo(path->fp_nh_proto),
1615 fib_path_attached_get_adj(path,
1616 fib_proto_to_link(path->fp_nh_proto)));
1619 * become a child of the adjacency so we receive updates
1620 * when the interface state changes
1622 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
1624 fib_path_get_index(path));
1627 case FIB_PATH_TYPE_RECURSIVE:
1630 * Create a RR source entry in the table for the address
1631 * that this path recurses through.
1632 * This resolve action is recursive, hence we may create
1633 * more paths in the process. more creates mean maybe realloc
1636 fib_node_index_t fei;
1639 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_fib);
1641 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
1643 fib_prefix_from_mpls_label(path->recursive.fp_nh.fp_local_label,
1644 path->recursive.fp_nh.fp_eos,
1649 fib_prefix_from_ip46_addr(&path->recursive.fp_nh.fp_ip, &pfx);
1652 fei = fib_table_entry_special_add(path->recursive.fp_tbl_id,
1655 FIB_ENTRY_FLAG_NONE);
1657 path = fib_path_get(path_index);
1658 path->fp_via_fib = fei;
1661 * become a dependent child of the entry so the path is
1662 * informed when the forwarding for the entry changes.
1664 path->fp_sibling = fib_entry_child_add(path->fp_via_fib,
1666 fib_path_get_index(path));
1669 * create and configure the IP DPO
1671 fib_path_recursive_adj_update(
1673 fib_path_to_chain_type(path),
1678 case FIB_PATH_TYPE_SPECIAL:
1680 * Resolve via the drop
1682 dpo_copy(&path->fp_dpo,
1683 drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
1685 case FIB_PATH_TYPE_DEAG:
1688 * Resolve via a lookup DPO.
1689 * FIXME. control plane should add routes with a table ID
1693 cast = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ?
1697 lookup_dpo_add_or_lock_w_fib_index(path->deag.fp_tbl_id,
1698 fib_proto_to_dpo(path->fp_nh_proto),
1700 LOOKUP_INPUT_DST_ADDR,
1701 LOOKUP_TABLE_FROM_CONFIG,
1705 case FIB_PATH_TYPE_RECEIVE:
1707 * Resolve via a receive DPO.
1709 receive_dpo_add_or_lock(fib_proto_to_dpo(path->fp_nh_proto),
1710 path->receive.fp_interface,
1711 &path->receive.fp_addr,
1714 case FIB_PATH_TYPE_INTF_RX: {
1716 * Resolve via a receive DPO.
1718 interface_dpo_add_or_lock(fib_proto_to_dpo(path->fp_nh_proto),
1719 path->intf_rx.fp_interface,
1723 case FIB_PATH_TYPE_EXCLUSIVE:
1725 * Resolve via the user provided DPO
1727 dpo_copy(&path->fp_dpo, &path->exclusive.fp_ex_dpo);
1731 return (fib_path_is_resolved(path_index));
1735 fib_path_get_resolving_interface (fib_node_index_t path_index)
1739 path = fib_path_get(path_index);
1741 switch (path->fp_type)
1743 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1744 return (path->attached_next_hop.fp_interface);
1745 case FIB_PATH_TYPE_ATTACHED:
1746 return (path->attached.fp_interface);
1747 case FIB_PATH_TYPE_RECEIVE:
1748 return (path->receive.fp_interface);
1749 case FIB_PATH_TYPE_RECURSIVE:
1750 if (fib_path_is_resolved(path_index))
1752 return (fib_entry_get_resolving_interface(path->fp_via_fib));
1755 case FIB_PATH_TYPE_INTF_RX:
1756 case FIB_PATH_TYPE_SPECIAL:
1757 case FIB_PATH_TYPE_DEAG:
1758 case FIB_PATH_TYPE_EXCLUSIVE:
1765 fib_path_get_adj (fib_node_index_t path_index)
1769 path = fib_path_get(path_index);
1771 ASSERT(dpo_is_adj(&path->fp_dpo));
1772 if (dpo_is_adj(&path->fp_dpo))
1774 return (path->fp_dpo.dpoi_index);
1776 return (ADJ_INDEX_INVALID);
1780 fib_path_get_weight (fib_node_index_t path_index)
1784 path = fib_path_get(path_index);
1788 return (path->fp_weight);
1792 fib_path_get_preference (fib_node_index_t path_index)
1796 path = fib_path_get(path_index);
1800 return (path->fp_preference);
1804 * @brief Contribute the path's adjacency to the list passed.
1805 * By calling this function over all paths, recursively, a child
1806 * can construct its full set of forwarding adjacencies, and hence its
1810 fib_path_contribute_urpf (fib_node_index_t path_index,
1815 path = fib_path_get(path_index);
1818 * resolved and unresolved paths contribute to the RPF list.
1820 switch (path->fp_type)
1822 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1823 fib_urpf_list_append(urpf, path->attached_next_hop.fp_interface);
1826 case FIB_PATH_TYPE_ATTACHED:
1827 fib_urpf_list_append(urpf, path->attached.fp_interface);
1830 case FIB_PATH_TYPE_RECURSIVE:
1831 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib &&
1832 !fib_path_is_looped(path_index))
1835 * there's unresolved due to constraints, and there's unresolved
1836 * due to ain't got no via. can't do nowt w'out via.
1838 fib_entry_contribute_urpf(path->fp_via_fib, urpf);
1842 case FIB_PATH_TYPE_EXCLUSIVE:
1843 case FIB_PATH_TYPE_SPECIAL:
1845 * these path types may link to an adj, if that's what
1848 if (dpo_is_adj(&path->fp_dpo))
1850 ip_adjacency_t *adj;
1852 adj = adj_get(path->fp_dpo.dpoi_index);
1854 fib_urpf_list_append(urpf, adj->rewrite_header.sw_if_index);
1858 case FIB_PATH_TYPE_DEAG:
1859 case FIB_PATH_TYPE_RECEIVE:
1860 case FIB_PATH_TYPE_INTF_RX:
1862 * these path types don't link to an adj
1869 fib_path_stack_mpls_disp (fib_node_index_t path_index,
1870 dpo_proto_t payload_proto,
1875 path = fib_path_get(path_index);
1879 switch (path->fp_type)
1881 case FIB_PATH_TYPE_DEAG:
1883 dpo_id_t tmp = DPO_INVALID;
1885 dpo_copy(&tmp, dpo);
1887 DPO_MPLS_DISPOSITION,
1889 mpls_disp_dpo_create(payload_proto,
1890 path->deag.fp_rpf_id,
1895 case FIB_PATH_TYPE_RECEIVE:
1896 case FIB_PATH_TYPE_ATTACHED:
1897 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1898 case FIB_PATH_TYPE_RECURSIVE:
1899 case FIB_PATH_TYPE_INTF_RX:
1900 case FIB_PATH_TYPE_EXCLUSIVE:
1901 case FIB_PATH_TYPE_SPECIAL:
1907 fib_path_contribute_forwarding (fib_node_index_t path_index,
1908 fib_forward_chain_type_t fct,
1913 path = fib_path_get(path_index);
1916 ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS != fct);
1918 FIB_PATH_DBG(path, "contribute");
1921 * The DPO stored in the path was created when the path was resolved.
1922 * This then represents the path's 'native' protocol; IP.
1923 * For all others will need to go find something else.
1925 if (fib_path_to_chain_type(path) == fct)
1927 dpo_copy(dpo, &path->fp_dpo);
1931 switch (path->fp_type)
1933 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1936 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
1937 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
1938 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
1939 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
1940 case FIB_FORW_CHAIN_TYPE_ETHERNET:
1941 case FIB_FORW_CHAIN_TYPE_NSH:
1946 * get a appropriate link type adj.
1948 ai = fib_path_attached_next_hop_get_adj(
1950 fib_forw_chain_type_to_link_type(fct));
1951 dpo_set(dpo, DPO_ADJACENCY,
1952 fib_forw_chain_type_to_dpo_proto(fct), ai);
1957 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
1958 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
1962 case FIB_PATH_TYPE_RECURSIVE:
1965 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
1966 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
1967 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
1968 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
1969 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
1970 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
1971 fib_path_recursive_adj_update(path, fct, dpo);
1973 case FIB_FORW_CHAIN_TYPE_ETHERNET:
1974 case FIB_FORW_CHAIN_TYPE_NSH:
1979 case FIB_PATH_TYPE_DEAG:
1982 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
1983 lookup_dpo_add_or_lock_w_table_id(MPLS_FIB_DEFAULT_TABLE_ID,
1986 LOOKUP_INPUT_DST_ADDR,
1987 LOOKUP_TABLE_FROM_CONFIG,
1990 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
1991 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
1992 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
1993 dpo_copy(dpo, &path->fp_dpo);
1995 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
1996 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
1997 case FIB_FORW_CHAIN_TYPE_ETHERNET:
1998 case FIB_FORW_CHAIN_TYPE_NSH:
2003 case FIB_PATH_TYPE_EXCLUSIVE:
2004 dpo_copy(dpo, &path->exclusive.fp_ex_dpo);
2006 case FIB_PATH_TYPE_ATTACHED:
2009 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
2010 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
2011 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
2012 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
2013 case FIB_FORW_CHAIN_TYPE_ETHERNET:
2014 case FIB_FORW_CHAIN_TYPE_NSH:
2019 * get a appropriate link type adj.
2021 ai = fib_path_attached_get_adj(
2023 fib_forw_chain_type_to_link_type(fct));
2024 dpo_set(dpo, DPO_ADJACENCY,
2025 fib_forw_chain_type_to_dpo_proto(fct), ai);
2029 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
2030 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
2035 * Create the adj needed for sending IP multicast traffic
2037 ai = adj_mcast_add_or_lock(path->fp_nh_proto,
2038 fib_forw_chain_type_to_link_type(fct),
2039 path->attached.fp_interface);
2040 dpo_set(dpo, DPO_ADJACENCY,
2041 fib_forw_chain_type_to_dpo_proto(fct),
2048 case FIB_PATH_TYPE_INTF_RX:
2050 * Create the adj needed for sending IP multicast traffic
2052 interface_dpo_add_or_lock(fib_forw_chain_type_to_dpo_proto(fct),
2053 path->attached.fp_interface,
2056 case FIB_PATH_TYPE_RECEIVE:
2057 case FIB_PATH_TYPE_SPECIAL:
2058 dpo_copy(dpo, &path->fp_dpo);
2064 load_balance_path_t *
2065 fib_path_append_nh_for_multipath_hash (fib_node_index_t path_index,
2066 fib_forward_chain_type_t fct,
2067 load_balance_path_t *hash_key)
2069 load_balance_path_t *mnh;
2072 path = fib_path_get(path_index);
2076 if (fib_path_is_resolved(path_index))
2078 vec_add2(hash_key, mnh, 1);
2080 mnh->path_weight = path->fp_weight;
2081 mnh->path_index = path_index;
2082 fib_path_contribute_forwarding(path_index, fct, &mnh->path_dpo);
2089 fib_path_is_recursive_constrained (fib_node_index_t path_index)
2093 path = fib_path_get(path_index);
2095 return ((FIB_PATH_TYPE_RECURSIVE == path->fp_type) &&
2096 ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED) ||
2097 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)));
2101 fib_path_is_exclusive (fib_node_index_t path_index)
2105 path = fib_path_get(path_index);
2107 return (FIB_PATH_TYPE_EXCLUSIVE == path->fp_type);
2111 fib_path_is_deag (fib_node_index_t path_index)
2115 path = fib_path_get(path_index);
2117 return (FIB_PATH_TYPE_DEAG == path->fp_type);
2121 fib_path_is_resolved (fib_node_index_t path_index)
2125 path = fib_path_get(path_index);
2127 return (dpo_id_is_valid(&path->fp_dpo) &&
2128 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED) &&
2129 !fib_path_is_looped(path_index) &&
2130 !fib_path_is_permanent_drop(path));
2134 fib_path_is_looped (fib_node_index_t path_index)
2138 path = fib_path_get(path_index);
2140 return (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP);
2143 fib_path_list_walk_rc_t
2144 fib_path_encode (fib_node_index_t path_list_index,
2145 fib_node_index_t path_index,
2148 fib_route_path_encode_t **api_rpaths = ctx;
2149 fib_route_path_encode_t *api_rpath;
2152 path = fib_path_get(path_index);
2154 return (FIB_PATH_LIST_WALK_CONTINUE);
2155 vec_add2(*api_rpaths, api_rpath, 1);
2156 api_rpath->rpath.frp_weight = path->fp_weight;
2157 api_rpath->rpath.frp_preference = path->fp_preference;
2158 api_rpath->rpath.frp_proto = path->fp_nh_proto;
2159 api_rpath->rpath.frp_sw_if_index = ~0;
2160 api_rpath->dpo = path->exclusive.fp_ex_dpo;
2161 switch (path->fp_type)
2163 case FIB_PATH_TYPE_RECEIVE:
2164 api_rpath->rpath.frp_addr = path->receive.fp_addr;
2165 api_rpath->rpath.frp_sw_if_index = path->receive.fp_interface;
2167 case FIB_PATH_TYPE_ATTACHED:
2168 api_rpath->rpath.frp_sw_if_index = path->attached.fp_interface;
2170 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2171 api_rpath->rpath.frp_sw_if_index = path->attached_next_hop.fp_interface;
2172 api_rpath->rpath.frp_addr = path->attached_next_hop.fp_nh;
2174 case FIB_PATH_TYPE_SPECIAL:
2176 case FIB_PATH_TYPE_DEAG:
2178 case FIB_PATH_TYPE_RECURSIVE:
2179 api_rpath->rpath.frp_addr = path->recursive.fp_nh.fp_ip;
2184 return (FIB_PATH_LIST_WALK_CONTINUE);
2188 fib_path_get_proto (fib_node_index_t path_index)
2192 path = fib_path_get(path_index);
2194 return (path->fp_nh_proto);
2198 fib_path_module_init (void)
2200 fib_node_register_type (FIB_NODE_TYPE_PATH, &fib_path_vft);
2203 static clib_error_t *
2204 show_fib_path_command (vlib_main_t * vm,
2205 unformat_input_t * input,
2206 vlib_cli_command_t * cmd)
2208 fib_node_index_t pi;
2211 if (unformat (input, "%d", &pi))
2214 * show one in detail
2216 if (!pool_is_free_index(fib_path_pool, pi))
2218 path = fib_path_get(pi);
2219 u8 *s = fib_path_format(pi, NULL);
2220 s = format(s, "children:");
2221 s = fib_node_children_format(path->fp_node.fn_children, s);
2222 vlib_cli_output (vm, "%s", s);
2227 vlib_cli_output (vm, "path %d invalid", pi);
2232 vlib_cli_output (vm, "FIB Paths");
2233 pool_foreach(path, fib_path_pool,
2235 vlib_cli_output (vm, "%U", format_fib_path, path);
2242 VLIB_CLI_COMMAND (show_fib_path, static) = {
2243 .path = "show fib paths",
2244 .function = show_fib_path_command,
2245 .short_help = "show fib paths",