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] weigt
204 * per-type union of the data required to resolve the path
211 ip46_address_t fp_nh;
229 ip46_address_t fp_ip;
232 * The local label to resolve through.
234 mpls_label_t fp_local_label;
236 * The EOS bit of the resolving label
238 mpls_eos_bit_t fp_eos;
242 * The FIB table index in which to find the next-hop.
244 fib_node_index_t fp_tbl_id;
248 * The FIB index in which to perfom the next lookup
250 fib_node_index_t fp_tbl_id;
252 * The RPF-ID to tag the packets with
254 fib_rpf_id_t fp_rpf_id;
260 * The user provided 'exclusive' DPO
266 * The interface on which the local address is configured
272 ip46_address_t fp_addr;
276 * The interface on which the packets will be input.
281 STRUCT_MARK(path_hash_end);
284 * Memebers in this last section represent information that is
285 * dervied during resolution. It should not be copied to new paths
292 fib_path_oper_flags_t fp_oper_flags;
295 * the resolving via fib. not part of the union, since it it not part
296 * of the path's hash.
298 fib_node_index_t fp_via_fib;
301 * The Data-path objects through which this path resolves for IP.
306 * the index of this path in the parent's child list.
312 * Array of strings/names for the path types and attributes
314 static const char *fib_path_type_names[] = FIB_PATH_TYPES;
315 static const char *fib_path_oper_attribute_names[] = FIB_PATH_OPER_ATTRIBUTES;
316 static const char *fib_path_cfg_attribute_names[] = FIB_PATH_CFG_ATTRIBUTES;
319 * The memory pool from which we allocate all the paths
321 static fib_path_t *fib_path_pool;
327 #define FIB_PATH_DBG(_p, _fmt, _args...) \
330 _tmp = fib_path_format(fib_path_get_index(_p), _tmp); \
331 clib_warning("path:[%d:%s]:" _fmt, \
332 fib_path_get_index(_p), _tmp, \
337 #define FIB_PATH_DBG(_p, _fmt, _args...)
341 fib_path_get (fib_node_index_t index)
343 return (pool_elt_at_index(fib_path_pool, index));
346 static fib_node_index_t
347 fib_path_get_index (fib_path_t *path)
349 return (path - fib_path_pool);
353 fib_path_get_node (fib_node_index_t index)
355 return ((fib_node_t*)fib_path_get(index));
359 fib_path_from_fib_node (fib_node_t *node)
362 ASSERT(FIB_NODE_TYPE_PATH == node->fn_type);
364 return ((fib_path_t*)node);
368 format_fib_path (u8 * s, va_list * args)
370 fib_path_t *path = va_arg (*args, fib_path_t *);
371 vnet_main_t * vnm = vnet_get_main();
372 fib_path_oper_attribute_t oattr;
373 fib_path_cfg_attribute_t cattr;
375 s = format (s, " index:%d ", fib_path_get_index(path));
376 s = format (s, "pl-index:%d ", path->fp_pl_index);
377 s = format (s, "%U ", format_fib_protocol, path->fp_nh_proto);
378 s = format (s, "weight=%d ", path->fp_weight);
379 s = format (s, "%s: ", fib_path_type_names[path->fp_type]);
380 if (FIB_PATH_OPER_FLAG_NONE != path->fp_oper_flags) {
381 s = format(s, " oper-flags:");
382 FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(oattr) {
383 if ((1<<oattr) & path->fp_oper_flags) {
384 s = format (s, "%s,", fib_path_oper_attribute_names[oattr]);
388 if (FIB_PATH_CFG_FLAG_NONE != path->fp_cfg_flags) {
389 s = format(s, " cfg-flags:");
390 FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(cattr) {
391 if ((1<<cattr) & path->fp_cfg_flags) {
392 s = format (s, "%s,", fib_path_cfg_attribute_names[cattr]);
396 s = format(s, "\n ");
398 switch (path->fp_type)
400 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
401 s = format (s, "%U", format_ip46_address,
402 &path->attached_next_hop.fp_nh,
404 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
406 s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
410 s = format (s, " %U",
411 format_vnet_sw_interface_name,
413 vnet_get_sw_interface(
415 path->attached_next_hop.fp_interface));
416 if (vnet_sw_interface_is_p2p(vnet_get_main(),
417 path->attached_next_hop.fp_interface))
419 s = format (s, " (p2p)");
422 if (!dpo_id_is_valid(&path->fp_dpo))
424 s = format(s, "\n unresolved");
428 s = format(s, "\n %U",
433 case FIB_PATH_TYPE_ATTACHED:
434 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
436 s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
440 s = format (s, " %U",
441 format_vnet_sw_interface_name,
443 vnet_get_sw_interface(
445 path->attached.fp_interface));
448 case FIB_PATH_TYPE_RECURSIVE:
449 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
451 s = format (s, "via %U %U",
452 format_mpls_unicast_label,
453 path->recursive.fp_nh.fp_local_label,
455 path->recursive.fp_nh.fp_eos);
459 s = format (s, "via %U",
461 &path->recursive.fp_nh.fp_ip,
464 s = format (s, " in fib:%d",
465 path->recursive.fp_tbl_id,
467 s = format (s, " via-fib:%d", path->fp_via_fib);
468 s = format (s, " via-dpo:[%U:%d]",
469 format_dpo_type, path->fp_dpo.dpoi_type,
470 path->fp_dpo.dpoi_index);
473 case FIB_PATH_TYPE_RECEIVE:
474 case FIB_PATH_TYPE_INTF_RX:
475 case FIB_PATH_TYPE_SPECIAL:
476 case FIB_PATH_TYPE_DEAG:
477 case FIB_PATH_TYPE_EXCLUSIVE:
478 if (dpo_id_is_valid(&path->fp_dpo))
480 s = format(s, "%U", format_dpo_id,
489 fib_path_format (fib_node_index_t pi, u8 *s)
493 path = fib_path_get(pi);
494 ASSERT(NULL != path);
496 return (format (s, "%U", format_fib_path, path));
500 fib_path_adj_format (fib_node_index_t pi,
506 path = fib_path_get(pi);
507 ASSERT(NULL != path);
509 if (!dpo_id_is_valid(&path->fp_dpo))
511 s = format(s, " unresolved");
515 s = format(s, "%U", format_dpo_id,
523 * fib_path_last_lock_gone
525 * We don't share paths, we share path lists, so the [un]lock functions
529 fib_path_last_lock_gone (fib_node_t *node)
534 static const adj_index_t
535 fib_path_attached_next_hop_get_adj (fib_path_t *path,
538 if (vnet_sw_interface_is_p2p(vnet_get_main(),
539 path->attached_next_hop.fp_interface))
542 * if the interface is p2p then the adj for the specific
543 * neighbour on that link will never exist. on p2p links
544 * the subnet address (the attached route) links to the
545 * auto-adj (see below), we want that adj here too.
547 return (adj_nbr_add_or_lock(path->fp_nh_proto,
550 path->attached_next_hop.fp_interface));
554 return (adj_nbr_add_or_lock(path->fp_nh_proto,
556 &path->attached_next_hop.fp_nh,
557 path->attached_next_hop.fp_interface));
562 fib_path_attached_next_hop_set (fib_path_t *path)
565 * resolve directly via the adjacnecy discribed by the
566 * interface and next-hop
568 dpo_set(&path->fp_dpo,
570 fib_proto_to_dpo(path->fp_nh_proto),
571 fib_path_attached_next_hop_get_adj(
573 fib_proto_to_link(path->fp_nh_proto)));
576 * become a child of the adjacency so we receive updates
577 * when its rewrite changes
579 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
581 fib_path_get_index(path));
583 if (!vnet_sw_interface_is_admin_up(vnet_get_main(),
584 path->attached_next_hop.fp_interface) ||
585 !adj_is_up(path->fp_dpo.dpoi_index))
587 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
592 * create of update the paths recursive adj
595 fib_path_recursive_adj_update (fib_path_t *path,
596 fib_forward_chain_type_t fct,
599 dpo_id_t via_dpo = DPO_INVALID;
602 * get the DPO to resolve through from the via-entry
604 fib_entry_contribute_forwarding(path->fp_via_fib,
610 * hope for the best - clear if restrictions apply.
612 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
615 * Validate any recursion constraints and over-ride the via
618 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP)
620 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
621 dpo_copy(&via_dpo, drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
623 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)
626 * the via FIB must be a host route.
627 * note the via FIB just added will always be a host route
628 * since it is an RR source added host route. So what we need to
629 * check is whether the route has other sources. If it does then
630 * some other source has added it as a host route. If it doesn't
631 * then it was added only here and inherits forwarding from a cover.
632 * the cover is not a host route.
633 * The RR source is the lowest priority source, so we check if it
634 * is the best. if it is there are no other sources.
636 if (fib_entry_get_best_source(path->fp_via_fib) >= FIB_SOURCE_RR)
638 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
639 dpo_copy(&via_dpo, drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
642 * PIC edge trigger. let the load-balance maps know
644 load_balance_map_path_state_change(fib_path_get_index(path));
647 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED)
650 * RR source entries inherit the flags from the cover, so
651 * we can check the via directly
653 if (!(FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags(path->fp_via_fib)))
655 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
656 dpo_copy(&via_dpo, drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
659 * PIC edge trigger. let the load-balance maps know
661 load_balance_map_path_state_change(fib_path_get_index(path));
665 * check for over-riding factors on the FIB entry itself
667 if (!fib_entry_is_resolved(path->fp_via_fib))
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));
679 * update the path's contributed DPO
681 dpo_copy(dpo, &via_dpo);
683 FIB_PATH_DBG(path, "recursive update: %U",
684 fib_get_lookup_main(path->fp_nh_proto),
691 * fib_path_is_permanent_drop
693 * Return !0 if the path is configured to permanently drop,
694 * despite other attributes.
697 fib_path_is_permanent_drop (fib_path_t *path)
699 return ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP) ||
700 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP));
706 * Remove our dependency on the resolution target
709 fib_path_unresolve (fib_path_t *path)
712 * the forced drop path does not need unresolving
714 if (fib_path_is_permanent_drop(path))
719 switch (path->fp_type)
721 case FIB_PATH_TYPE_RECURSIVE:
722 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
726 fib_entry_get_prefix(path->fp_via_fib, &pfx);
727 fib_entry_child_remove(path->fp_via_fib,
729 fib_table_entry_special_remove(path->recursive.fp_tbl_id,
732 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
735 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
736 case FIB_PATH_TYPE_ATTACHED:
737 adj_child_remove(path->fp_dpo.dpoi_index,
739 adj_unlock(path->fp_dpo.dpoi_index);
741 case FIB_PATH_TYPE_EXCLUSIVE:
742 dpo_reset(&path->exclusive.fp_ex_dpo);
744 case FIB_PATH_TYPE_SPECIAL:
745 case FIB_PATH_TYPE_RECEIVE:
746 case FIB_PATH_TYPE_INTF_RX:
747 case FIB_PATH_TYPE_DEAG:
749 * these hold only the path's DPO, which is reset below.
755 * release the adj we were holding and pick up the
758 dpo_reset(&path->fp_dpo);
759 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
764 static fib_forward_chain_type_t
765 fib_path_to_chain_type (const fib_path_t *path)
767 switch (path->fp_nh_proto)
769 case FIB_PROTOCOL_IP4:
770 return (FIB_FORW_CHAIN_TYPE_UNICAST_IP4);
771 case FIB_PROTOCOL_IP6:
772 return (FIB_FORW_CHAIN_TYPE_UNICAST_IP6);
773 case FIB_PROTOCOL_MPLS:
774 if (FIB_PATH_TYPE_RECURSIVE == path->fp_type &&
775 MPLS_EOS == path->recursive.fp_nh.fp_eos)
777 return (FIB_FORW_CHAIN_TYPE_MPLS_EOS);
781 return (FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS);
784 return (FIB_FORW_CHAIN_TYPE_UNICAST_IP4);
788 * fib_path_back_walk_notify
790 * A back walk has reach this path.
792 static fib_node_back_walk_rc_t
793 fib_path_back_walk_notify (fib_node_t *node,
794 fib_node_back_walk_ctx_t *ctx)
798 path = fib_path_from_fib_node(node);
800 switch (path->fp_type)
802 case FIB_PATH_TYPE_RECURSIVE:
803 if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
806 * modify the recursive adjacency to use the new forwarding
808 * this update is visible to packets in flight in the DP.
810 fib_path_recursive_adj_update(
812 fib_path_to_chain_type(path),
815 if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
816 (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
819 * ADJ updates (complete<->incomplete) do not need to propagate to
821 * The only reason its needed as far back as here, is that the adj
822 * and the incomplete adj are a different DPO type, so the LBs need
824 * If this walk was quashed in the fib_entry, then any non-fib_path
825 * children (like tunnels that collapse out the LB when they stack)
826 * would not see the update.
828 return (FIB_NODE_BACK_WALK_CONTINUE);
831 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
834 * ADJ_UPDATE backwalk pass silently through here and up to
835 * the path-list when the multipath adj collapse occurs.
836 * The reason we do this is that the assumtption is that VPP
837 * runs in an environment where the Control-Plane is remote
838 * and hence reacts slowly to link up down. In order to remove
839 * this down link from the ECMP set quickly, we back-walk.
840 * VPP also has dedicated CPUs, so we are not stealing resources
841 * from the CP to do so.
843 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
845 if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED)
848 * alreday resolved. no need to walk back again
850 return (FIB_NODE_BACK_WALK_CONTINUE);
852 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
854 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
856 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
859 * alreday unresolved. no need to walk back again
861 return (FIB_NODE_BACK_WALK_CONTINUE);
863 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
865 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
868 * The interface this path resolves through has been deleted.
869 * This will leave the path in a permanent drop state. The route
870 * needs to be removed and readded (and hence the path-list deleted)
871 * before it can forward again.
873 fib_path_unresolve(path);
874 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
876 if (FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason)
879 * restack the DPO to pick up the correct DPO sub-type
884 if_is_up = vnet_sw_interface_is_admin_up(
886 path->attached_next_hop.fp_interface);
888 ai = fib_path_attached_next_hop_get_adj(
890 fib_proto_to_link(path->fp_nh_proto));
892 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
893 if (if_is_up && adj_is_up(ai))
895 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
898 dpo_set(&path->fp_dpo, DPO_ADJACENCY,
899 fib_proto_to_dpo(path->fp_nh_proto),
906 * If the interface is not up there is no reason to walk
907 * back to children. if we did they would only evalute
908 * that this path is unresolved and hence it would
909 * not contribute the adjacency - so it would be wasted
912 return (FIB_NODE_BACK_WALK_CONTINUE);
915 if (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason)
917 if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
920 * alreday unresolved. no need to walk back again
922 return (FIB_NODE_BACK_WALK_CONTINUE);
925 * the adj has gone down. the path is no longer resolved.
927 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
930 case FIB_PATH_TYPE_ATTACHED:
932 * FIXME; this could schedule a lower priority walk, since attached
933 * routes are not usually in ECMP configurations so the backwalk to
934 * the FIB entry does not need to be high priority
936 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
938 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
940 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
942 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
944 if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
946 fib_path_unresolve(path);
947 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
950 case FIB_PATH_TYPE_INTF_RX:
952 case FIB_PATH_TYPE_DEAG:
954 * FIXME When VRF delete is allowed this will need a poke.
956 case FIB_PATH_TYPE_SPECIAL:
957 case FIB_PATH_TYPE_RECEIVE:
958 case FIB_PATH_TYPE_EXCLUSIVE:
960 * these path types have no parents. so to be
961 * walked from one is unexpected.
968 * propagate the backwalk further to the path-list
970 fib_path_list_back_walk(path->fp_pl_index, ctx);
972 return (FIB_NODE_BACK_WALK_CONTINUE);
976 fib_path_memory_show (void)
978 fib_show_memory_usage("Path",
979 pool_elts(fib_path_pool),
980 pool_len(fib_path_pool),
985 * The FIB path's graph node virtual function table
987 static const fib_node_vft_t fib_path_vft = {
988 .fnv_get = fib_path_get_node,
989 .fnv_last_lock = fib_path_last_lock_gone,
990 .fnv_back_walk = fib_path_back_walk_notify,
991 .fnv_mem_show = fib_path_memory_show,
994 static fib_path_cfg_flags_t
995 fib_path_route_flags_to_cfg_flags (const fib_route_path_t *rpath)
997 fib_path_cfg_flags_t cfg_flags = FIB_PATH_CFG_FLAG_NONE;
999 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_HOST)
1000 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_HOST;
1001 if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_ATTACHED)
1002 cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED;
1003 if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
1004 cfg_flags |= FIB_PATH_CFG_FLAG_LOCAL;
1005 if (rpath->frp_flags & FIB_ROUTE_PATH_ATTACHED)
1006 cfg_flags |= FIB_PATH_CFG_FLAG_ATTACHED;
1007 if (rpath->frp_flags & FIB_ROUTE_PATH_INTF_RX)
1008 cfg_flags |= FIB_PATH_CFG_FLAG_INTF_RX;
1009 if (rpath->frp_flags & FIB_ROUTE_PATH_RPF_ID)
1010 cfg_flags |= FIB_PATH_CFG_FLAG_RPF_ID;
1011 if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
1012 cfg_flags |= FIB_PATH_CFG_FLAG_EXCLUSIVE;
1013 if (rpath->frp_flags & FIB_ROUTE_PATH_DROP)
1014 cfg_flags |= FIB_PATH_CFG_FLAG_DROP;
1022 * Create and initialise a new path object.
1023 * return the index of the path.
1026 fib_path_create (fib_node_index_t pl_index,
1027 const fib_route_path_t *rpath)
1031 pool_get(fib_path_pool, path);
1032 memset(path, 0, sizeof(*path));
1034 fib_node_init(&path->fp_node,
1035 FIB_NODE_TYPE_PATH);
1037 dpo_reset(&path->fp_dpo);
1038 path->fp_pl_index = pl_index;
1039 path->fp_nh_proto = rpath->frp_proto;
1040 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1041 path->fp_weight = rpath->frp_weight;
1042 if (0 == path->fp_weight)
1045 * a weight of 0 is a meaningless value. We could either reject it, and thus force
1046 * clients to always use 1, or we can accept it and fixup approrpiately.
1048 path->fp_weight = 1;
1050 path->fp_cfg_flags = fib_path_route_flags_to_cfg_flags(rpath);
1053 * deduce the path's tpye from the parementers and save what is needed.
1055 if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_LOCAL)
1057 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1058 path->receive.fp_interface = rpath->frp_sw_if_index;
1059 path->receive.fp_addr = rpath->frp_addr;
1061 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_INTF_RX)
1063 path->fp_type = FIB_PATH_TYPE_INTF_RX;
1064 path->intf_rx.fp_interface = rpath->frp_sw_if_index;
1066 else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
1068 path->fp_type = FIB_PATH_TYPE_DEAG;
1069 path->deag.fp_tbl_id = rpath->frp_fib_index;
1070 path->deag.fp_rpf_id = rpath->frp_rpf_id;
1072 else if (~0 != rpath->frp_sw_if_index)
1074 if (ip46_address_is_zero(&rpath->frp_addr))
1076 path->fp_type = FIB_PATH_TYPE_ATTACHED;
1077 path->attached.fp_interface = rpath->frp_sw_if_index;
1081 path->fp_type = FIB_PATH_TYPE_ATTACHED_NEXT_HOP;
1082 path->attached_next_hop.fp_interface = rpath->frp_sw_if_index;
1083 path->attached_next_hop.fp_nh = rpath->frp_addr;
1088 if (ip46_address_is_zero(&rpath->frp_addr))
1090 if (~0 == rpath->frp_fib_index)
1092 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1096 path->fp_type = FIB_PATH_TYPE_DEAG;
1097 path->deag.fp_tbl_id = rpath->frp_fib_index;
1102 path->fp_type = FIB_PATH_TYPE_RECURSIVE;
1103 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
1105 path->recursive.fp_nh.fp_local_label = rpath->frp_local_label;
1106 path->recursive.fp_nh.fp_eos = rpath->frp_eos;
1110 path->recursive.fp_nh.fp_ip = rpath->frp_addr;
1112 path->recursive.fp_tbl_id = rpath->frp_fib_index;
1116 FIB_PATH_DBG(path, "create");
1118 return (fib_path_get_index(path));
1122 * fib_path_create_special
1124 * Create and initialise a new path object.
1125 * return the index of the path.
1128 fib_path_create_special (fib_node_index_t pl_index,
1129 fib_protocol_t nh_proto,
1130 fib_path_cfg_flags_t flags,
1131 const dpo_id_t *dpo)
1135 pool_get(fib_path_pool, path);
1136 memset(path, 0, sizeof(*path));
1138 fib_node_init(&path->fp_node,
1139 FIB_NODE_TYPE_PATH);
1140 dpo_reset(&path->fp_dpo);
1142 path->fp_pl_index = pl_index;
1143 path->fp_weight = 1;
1144 path->fp_nh_proto = nh_proto;
1145 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1146 path->fp_cfg_flags = flags;
1148 if (FIB_PATH_CFG_FLAG_DROP & flags)
1150 path->fp_type = FIB_PATH_TYPE_SPECIAL;
1152 else if (FIB_PATH_CFG_FLAG_LOCAL & flags)
1154 path->fp_type = FIB_PATH_TYPE_RECEIVE;
1155 path->attached.fp_interface = FIB_NODE_INDEX_INVALID;
1159 path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
1160 ASSERT(NULL != dpo);
1161 dpo_copy(&path->exclusive.fp_ex_dpo, dpo);
1164 return (fib_path_get_index(path));
1170 * Copy a path. return index of new path.
1173 fib_path_copy (fib_node_index_t path_index,
1174 fib_node_index_t path_list_index)
1176 fib_path_t *path, *orig_path;
1178 pool_get(fib_path_pool, path);
1180 orig_path = fib_path_get(path_index);
1181 ASSERT(NULL != orig_path);
1183 memcpy(path, orig_path, sizeof(*path));
1185 FIB_PATH_DBG(path, "create-copy:%d", path_index);
1188 * reset the dynamic section
1190 fib_node_init(&path->fp_node, FIB_NODE_TYPE_PATH);
1191 path->fp_oper_flags = FIB_PATH_OPER_FLAG_NONE;
1192 path->fp_pl_index = path_list_index;
1193 path->fp_via_fib = FIB_NODE_INDEX_INVALID;
1194 memset(&path->fp_dpo, 0, sizeof(path->fp_dpo));
1195 dpo_reset(&path->fp_dpo);
1197 return (fib_path_get_index(path));
1203 * destroy a path that is no longer required
1206 fib_path_destroy (fib_node_index_t path_index)
1210 path = fib_path_get(path_index);
1212 ASSERT(NULL != path);
1213 FIB_PATH_DBG(path, "destroy");
1215 fib_path_unresolve(path);
1217 fib_node_deinit(&path->fp_node);
1218 pool_put(fib_path_pool, path);
1224 * destroy a path that is no longer required
1227 fib_path_hash (fib_node_index_t path_index)
1231 path = fib_path_get(path_index);
1233 return (hash_memory(STRUCT_MARK_PTR(path, path_hash_start),
1234 (STRUCT_OFFSET_OF(fib_path_t, path_hash_end) -
1235 STRUCT_OFFSET_OF(fib_path_t, path_hash_start)),
1242 * Compare two paths for equivalence.
1245 fib_path_cmp_i (const fib_path_t *path1,
1246 const fib_path_t *path2)
1253 * paths of different types and protocol are not equal.
1254 * different weights only are the same path.
1256 if (path1->fp_type != path2->fp_type)
1258 res = (path1->fp_type - path2->fp_type);
1260 else if (path1->fp_nh_proto != path2->fp_nh_proto)
1262 res = (path1->fp_nh_proto - path2->fp_nh_proto);
1267 * both paths are of the same type.
1268 * consider each type and its attributes in turn.
1270 switch (path1->fp_type)
1272 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1273 res = ip46_address_cmp(&path1->attached_next_hop.fp_nh,
1274 &path2->attached_next_hop.fp_nh);
1276 res = (path1->attached_next_hop.fp_interface -
1277 path2->attached_next_hop.fp_interface);
1280 case FIB_PATH_TYPE_ATTACHED:
1281 res = (path1->attached.fp_interface -
1282 path2->attached.fp_interface);
1284 case FIB_PATH_TYPE_RECURSIVE:
1285 res = ip46_address_cmp(&path1->recursive.fp_nh,
1286 &path2->recursive.fp_nh);
1290 res = (path1->recursive.fp_tbl_id - path2->recursive.fp_tbl_id);
1293 case FIB_PATH_TYPE_DEAG:
1294 res = (path1->deag.fp_tbl_id - path2->deag.fp_tbl_id);
1297 res = (path1->deag.fp_rpf_id - path2->deag.fp_rpf_id);
1300 case FIB_PATH_TYPE_INTF_RX:
1301 res = (path1->intf_rx.fp_interface - path2->intf_rx.fp_interface);
1303 case FIB_PATH_TYPE_SPECIAL:
1304 case FIB_PATH_TYPE_RECEIVE:
1305 case FIB_PATH_TYPE_EXCLUSIVE:
1314 * fib_path_cmp_for_sort
1316 * Compare two paths for equivalence. Used during path sorting.
1317 * As usual 0 means equal.
1320 fib_path_cmp_for_sort (void * v1,
1323 fib_node_index_t *pi1 = v1, *pi2 = v2;
1324 fib_path_t *path1, *path2;
1326 path1 = fib_path_get(*pi1);
1327 path2 = fib_path_get(*pi2);
1329 return (fib_path_cmp_i(path1, path2));
1335 * Compare two paths for equivalence.
1338 fib_path_cmp (fib_node_index_t pi1,
1339 fib_node_index_t pi2)
1341 fib_path_t *path1, *path2;
1343 path1 = fib_path_get(pi1);
1344 path2 = fib_path_get(pi2);
1346 return (fib_path_cmp_i(path1, path2));
1350 fib_path_cmp_w_route_path (fib_node_index_t path_index,
1351 const fib_route_path_t *rpath)
1356 path = fib_path_get(path_index);
1360 if (path->fp_weight != rpath->frp_weight)
1362 res = (path->fp_weight - rpath->frp_weight);
1367 * both paths are of the same type.
1368 * consider each type and its attributes in turn.
1370 switch (path->fp_type)
1372 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1373 res = ip46_address_cmp(&path->attached_next_hop.fp_nh,
1377 res = (path->attached_next_hop.fp_interface -
1378 rpath->frp_sw_if_index);
1381 case FIB_PATH_TYPE_ATTACHED:
1382 res = (path->attached.fp_interface - rpath->frp_sw_if_index);
1384 case FIB_PATH_TYPE_RECURSIVE:
1385 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
1387 res = path->recursive.fp_nh.fp_local_label - rpath->frp_local_label;
1391 res = path->recursive.fp_nh.fp_eos - rpath->frp_eos;
1396 res = ip46_address_cmp(&path->recursive.fp_nh.fp_ip,
1402 res = (path->recursive.fp_tbl_id - rpath->frp_fib_index);
1405 case FIB_PATH_TYPE_INTF_RX:
1406 res = (path->intf_rx.fp_interface - rpath->frp_sw_if_index);
1408 case FIB_PATH_TYPE_DEAG:
1409 res = (path->deag.fp_tbl_id - rpath->frp_fib_index);
1412 res = (path->deag.fp_rpf_id - rpath->frp_rpf_id);
1415 case FIB_PATH_TYPE_SPECIAL:
1416 case FIB_PATH_TYPE_RECEIVE:
1417 case FIB_PATH_TYPE_EXCLUSIVE:
1426 * fib_path_recursive_loop_detect
1428 * A forward walk of the FIB object graph to detect for a cycle/loop. This
1429 * walk is initiated when an entry is linking to a new path list or from an old.
1430 * The entry vector passed contains all the FIB entrys that are children of this
1431 * path (it is all the entries encountered on the walk so far). If this vector
1432 * contains the entry this path resolve via, then a loop is about to form.
1433 * The loop must be allowed to form, since we need the dependencies in place
1434 * so that we can track when the loop breaks.
1435 * However, we MUST not produce a loop in the forwarding graph (else packets
1436 * would loop around the switch path until the loop breaks), so we mark recursive
1437 * paths as looped so that they do not contribute forwarding information.
1438 * By marking the path as looped, an etry such as;
1440 * via a.a.a.a (looped)
1441 * via b.b.b.b (not looped)
1442 * can still forward using the info provided by b.b.b.b only
1445 fib_path_recursive_loop_detect (fib_node_index_t path_index,
1446 fib_node_index_t **entry_indicies)
1450 path = fib_path_get(path_index);
1453 * the forced drop path is never looped, cos it is never resolved.
1455 if (fib_path_is_permanent_drop(path))
1460 switch (path->fp_type)
1462 case FIB_PATH_TYPE_RECURSIVE:
1464 fib_node_index_t *entry_index, *entries;
1466 entries = *entry_indicies;
1468 vec_foreach(entry_index, entries) {
1469 if (*entry_index == path->fp_via_fib)
1472 * the entry that is about to link to this path-list (or
1473 * one of this path-list's children) is the same entry that
1474 * this recursive path resolves through. this is a cycle.
1484 FIB_PATH_DBG(path, "recursive loop formed");
1485 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1487 dpo_copy(&path->fp_dpo,
1488 drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
1493 * no loop here yet. keep forward walking the graph.
1495 if (fib_entry_recursive_loop_detect(path->fp_via_fib, entry_indicies))
1497 FIB_PATH_DBG(path, "recursive loop formed");
1498 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1502 FIB_PATH_DBG(path, "recursive loop cleared");
1503 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
1508 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1509 case FIB_PATH_TYPE_ATTACHED:
1510 case FIB_PATH_TYPE_SPECIAL:
1511 case FIB_PATH_TYPE_DEAG:
1512 case FIB_PATH_TYPE_RECEIVE:
1513 case FIB_PATH_TYPE_INTF_RX:
1514 case FIB_PATH_TYPE_EXCLUSIVE:
1516 * these path types cannot be part of a loop, since they are the leaves
1522 return (fib_path_is_looped(path_index));
1526 fib_path_resolve (fib_node_index_t path_index)
1530 path = fib_path_get(path_index);
1533 * hope for the best.
1535 path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
1538 * the forced drop path resolves via the drop adj
1540 if (fib_path_is_permanent_drop(path))
1542 dpo_copy(&path->fp_dpo,
1543 drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
1544 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1545 return (fib_path_is_resolved(path_index));
1548 switch (path->fp_type)
1550 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1551 fib_path_attached_next_hop_set(path);
1553 case FIB_PATH_TYPE_ATTACHED:
1555 * path->attached.fp_interface
1557 if (!vnet_sw_interface_is_admin_up(vnet_get_main(),
1558 path->attached.fp_interface))
1560 path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
1562 if (vnet_sw_interface_is_p2p(vnet_get_main(),
1563 path->attached.fp_interface))
1566 * point-2-point interfaces do not require a glean, since
1567 * there is nothing to ARP. Install a rewrite/nbr adj instead
1569 dpo_set(&path->fp_dpo,
1571 fib_proto_to_dpo(path->fp_nh_proto),
1572 adj_nbr_add_or_lock(
1574 fib_proto_to_link(path->fp_nh_proto),
1576 path->attached.fp_interface));
1580 dpo_set(&path->fp_dpo,
1581 DPO_ADJACENCY_GLEAN,
1582 fib_proto_to_dpo(path->fp_nh_proto),
1583 adj_glean_add_or_lock(path->fp_nh_proto,
1584 path->attached.fp_interface,
1588 * become a child of the adjacency so we receive updates
1589 * when the interface state changes
1591 path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
1593 fib_path_get_index(path));
1596 case FIB_PATH_TYPE_RECURSIVE:
1599 * Create a RR source entry in the table for the address
1600 * that this path recurses through.
1601 * This resolve action is recursive, hence we may create
1602 * more paths in the process. more creates mean maybe realloc
1605 fib_node_index_t fei;
1608 ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_fib);
1610 if (FIB_PROTOCOL_MPLS == path->fp_nh_proto)
1612 fib_prefix_from_mpls_label(path->recursive.fp_nh.fp_local_label,
1613 path->recursive.fp_nh.fp_eos,
1618 fib_prefix_from_ip46_addr(&path->recursive.fp_nh.fp_ip, &pfx);
1621 fei = fib_table_entry_special_add(path->recursive.fp_tbl_id,
1624 FIB_ENTRY_FLAG_NONE);
1626 path = fib_path_get(path_index);
1627 path->fp_via_fib = fei;
1630 * become a dependent child of the entry so the path is
1631 * informed when the forwarding for the entry changes.
1633 path->fp_sibling = fib_entry_child_add(path->fp_via_fib,
1635 fib_path_get_index(path));
1638 * create and configure the IP DPO
1640 fib_path_recursive_adj_update(
1642 fib_path_to_chain_type(path),
1647 case FIB_PATH_TYPE_SPECIAL:
1649 * Resolve via the drop
1651 dpo_copy(&path->fp_dpo,
1652 drop_dpo_get(fib_proto_to_dpo(path->fp_nh_proto)));
1654 case FIB_PATH_TYPE_DEAG:
1657 * Resolve via a lookup DPO.
1658 * FIXME. control plane should add routes with a table ID
1662 cast = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ?
1666 lookup_dpo_add_or_lock_w_fib_index(path->deag.fp_tbl_id,
1667 fib_proto_to_dpo(path->fp_nh_proto),
1669 LOOKUP_INPUT_DST_ADDR,
1670 LOOKUP_TABLE_FROM_CONFIG,
1674 case FIB_PATH_TYPE_RECEIVE:
1676 * Resolve via a receive DPO.
1678 receive_dpo_add_or_lock(fib_proto_to_dpo(path->fp_nh_proto),
1679 path->receive.fp_interface,
1680 &path->receive.fp_addr,
1683 case FIB_PATH_TYPE_INTF_RX: {
1685 * Resolve via a receive DPO.
1687 interface_dpo_add_or_lock(fib_proto_to_dpo(path->fp_nh_proto),
1688 path->intf_rx.fp_interface,
1692 case FIB_PATH_TYPE_EXCLUSIVE:
1694 * Resolve via the user provided DPO
1696 dpo_copy(&path->fp_dpo, &path->exclusive.fp_ex_dpo);
1700 return (fib_path_is_resolved(path_index));
1704 fib_path_get_resolving_interface (fib_node_index_t path_index)
1708 path = fib_path_get(path_index);
1710 switch (path->fp_type)
1712 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1713 return (path->attached_next_hop.fp_interface);
1714 case FIB_PATH_TYPE_ATTACHED:
1715 return (path->attached.fp_interface);
1716 case FIB_PATH_TYPE_RECEIVE:
1717 return (path->receive.fp_interface);
1718 case FIB_PATH_TYPE_RECURSIVE:
1719 return (fib_entry_get_resolving_interface(path->fp_via_fib));
1720 case FIB_PATH_TYPE_INTF_RX:
1721 case FIB_PATH_TYPE_SPECIAL:
1722 case FIB_PATH_TYPE_DEAG:
1723 case FIB_PATH_TYPE_EXCLUSIVE:
1730 fib_path_get_adj (fib_node_index_t path_index)
1734 path = fib_path_get(path_index);
1736 ASSERT(dpo_is_adj(&path->fp_dpo));
1737 if (dpo_is_adj(&path->fp_dpo))
1739 return (path->fp_dpo.dpoi_index);
1741 return (ADJ_INDEX_INVALID);
1745 fib_path_get_weight (fib_node_index_t path_index)
1749 path = fib_path_get(path_index);
1753 return (path->fp_weight);
1757 * @brief Contribute the path's adjacency to the list passed.
1758 * By calling this function over all paths, recursively, a child
1759 * can construct its full set of forwarding adjacencies, and hence its
1763 fib_path_contribute_urpf (fib_node_index_t path_index,
1768 path = fib_path_get(path_index);
1771 * resolved and unresolved paths contribute to the RPF list.
1773 switch (path->fp_type)
1775 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1776 fib_urpf_list_append(urpf, path->attached_next_hop.fp_interface);
1779 case FIB_PATH_TYPE_ATTACHED:
1780 fib_urpf_list_append(urpf, path->attached.fp_interface);
1783 case FIB_PATH_TYPE_RECURSIVE:
1784 if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
1787 * there's unresolved due to constraints, and there's unresolved
1788 * due to ain't go no via. can't do nowt w'out via.
1790 fib_entry_contribute_urpf(path->fp_via_fib, urpf);
1794 case FIB_PATH_TYPE_EXCLUSIVE:
1795 case FIB_PATH_TYPE_SPECIAL:
1797 * these path types may link to an adj, if that's what
1800 if (dpo_is_adj(&path->fp_dpo))
1802 ip_adjacency_t *adj;
1804 adj = adj_get(path->fp_dpo.dpoi_index);
1806 fib_urpf_list_append(urpf, adj->rewrite_header.sw_if_index);
1810 case FIB_PATH_TYPE_DEAG:
1811 case FIB_PATH_TYPE_RECEIVE:
1812 case FIB_PATH_TYPE_INTF_RX:
1814 * these path types don't link to an adj
1821 fib_path_stack_mpls_disp (fib_node_index_t path_index,
1822 dpo_proto_t payload_proto,
1827 path = fib_path_get(path_index);
1831 switch (path->fp_type)
1833 case FIB_PATH_TYPE_DEAG:
1835 dpo_id_t tmp = DPO_INVALID;
1837 dpo_copy(&tmp, dpo);
1839 DPO_MPLS_DISPOSITION,
1841 mpls_disp_dpo_create(payload_proto,
1842 path->deag.fp_rpf_id,
1847 case FIB_PATH_TYPE_RECEIVE:
1848 case FIB_PATH_TYPE_ATTACHED:
1849 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1850 case FIB_PATH_TYPE_RECURSIVE:
1851 case FIB_PATH_TYPE_INTF_RX:
1852 case FIB_PATH_TYPE_EXCLUSIVE:
1853 case FIB_PATH_TYPE_SPECIAL:
1859 fib_path_contribute_forwarding (fib_node_index_t path_index,
1860 fib_forward_chain_type_t fct,
1865 path = fib_path_get(path_index);
1868 ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS != fct);
1870 FIB_PATH_DBG(path, "contribute");
1873 * The DPO stored in the path was created when the path was resolved.
1874 * This then represents the path's 'native' protocol; IP.
1875 * For all others will need to go find something else.
1877 if (fib_path_to_chain_type(path) == fct)
1879 dpo_copy(dpo, &path->fp_dpo);
1883 switch (path->fp_type)
1885 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
1888 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
1889 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
1890 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
1891 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
1892 case FIB_FORW_CHAIN_TYPE_ETHERNET:
1893 case FIB_FORW_CHAIN_TYPE_NSH:
1898 * get a appropriate link type adj.
1900 ai = fib_path_attached_next_hop_get_adj(
1902 fib_forw_chain_type_to_link_type(fct));
1903 dpo_set(dpo, DPO_ADJACENCY,
1904 fib_forw_chain_type_to_dpo_proto(fct), ai);
1909 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
1910 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
1914 case FIB_PATH_TYPE_RECURSIVE:
1917 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
1918 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
1919 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
1920 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
1921 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
1922 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
1923 fib_path_recursive_adj_update(path, fct, dpo);
1925 case FIB_FORW_CHAIN_TYPE_ETHERNET:
1926 case FIB_FORW_CHAIN_TYPE_NSH:
1931 case FIB_PATH_TYPE_DEAG:
1934 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
1935 lookup_dpo_add_or_lock_w_table_id(MPLS_FIB_DEFAULT_TABLE_ID,
1938 LOOKUP_INPUT_DST_ADDR,
1939 LOOKUP_TABLE_FROM_CONFIG,
1942 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
1943 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
1944 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
1945 dpo_copy(dpo, &path->fp_dpo);
1947 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
1948 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
1949 case FIB_FORW_CHAIN_TYPE_ETHERNET:
1950 case FIB_FORW_CHAIN_TYPE_NSH:
1955 case FIB_PATH_TYPE_EXCLUSIVE:
1956 dpo_copy(dpo, &path->exclusive.fp_ex_dpo);
1958 case FIB_PATH_TYPE_ATTACHED:
1961 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
1962 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
1963 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
1964 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
1965 case FIB_FORW_CHAIN_TYPE_ETHERNET:
1966 case FIB_FORW_CHAIN_TYPE_NSH:
1968 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
1969 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
1974 * Create the adj needed for sending IP multicast traffic
1976 ai = adj_mcast_add_or_lock(path->fp_nh_proto,
1977 fib_forw_chain_type_to_link_type(fct),
1978 path->attached.fp_interface);
1979 dpo_set(dpo, DPO_ADJACENCY,
1980 fib_forw_chain_type_to_dpo_proto(fct),
1987 case FIB_PATH_TYPE_INTF_RX:
1989 * Create the adj needed for sending IP multicast traffic
1991 interface_dpo_add_or_lock(fib_forw_chain_type_to_dpo_proto(fct),
1992 path->attached.fp_interface,
1995 case FIB_PATH_TYPE_RECEIVE:
1996 case FIB_PATH_TYPE_SPECIAL:
1997 dpo_copy(dpo, &path->fp_dpo);
2003 load_balance_path_t *
2004 fib_path_append_nh_for_multipath_hash (fib_node_index_t path_index,
2005 fib_forward_chain_type_t fct,
2006 load_balance_path_t *hash_key)
2008 load_balance_path_t *mnh;
2011 path = fib_path_get(path_index);
2015 if (fib_path_is_resolved(path_index))
2017 vec_add2(hash_key, mnh, 1);
2019 mnh->path_weight = path->fp_weight;
2020 mnh->path_index = path_index;
2021 fib_path_contribute_forwarding(path_index, fct, &mnh->path_dpo);
2028 fib_path_is_recursive_constrained (fib_node_index_t path_index)
2032 path = fib_path_get(path_index);
2034 return ((FIB_PATH_TYPE_RECURSIVE == path->fp_type) &&
2035 ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED) ||
2036 (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)));
2040 fib_path_is_exclusive (fib_node_index_t path_index)
2044 path = fib_path_get(path_index);
2046 return (FIB_PATH_TYPE_EXCLUSIVE == path->fp_type);
2050 fib_path_is_deag (fib_node_index_t path_index)
2054 path = fib_path_get(path_index);
2056 return (FIB_PATH_TYPE_DEAG == path->fp_type);
2060 fib_path_is_resolved (fib_node_index_t path_index)
2064 path = fib_path_get(path_index);
2066 return (dpo_id_is_valid(&path->fp_dpo) &&
2067 (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED) &&
2068 !fib_path_is_looped(path_index) &&
2069 !fib_path_is_permanent_drop(path));
2073 fib_path_is_looped (fib_node_index_t path_index)
2077 path = fib_path_get(path_index);
2079 return (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP);
2083 fib_path_encode (fib_node_index_t path_list_index,
2084 fib_node_index_t path_index,
2087 fib_route_path_encode_t **api_rpaths = ctx;
2088 fib_route_path_encode_t *api_rpath;
2091 path = fib_path_get(path_index);
2094 vec_add2(*api_rpaths, api_rpath, 1);
2095 api_rpath->rpath.frp_weight = path->fp_weight;
2096 api_rpath->rpath.frp_proto = path->fp_nh_proto;
2097 api_rpath->rpath.frp_sw_if_index = ~0;
2098 api_rpath->dpo = path->exclusive.fp_ex_dpo;
2099 switch (path->fp_type)
2101 case FIB_PATH_TYPE_RECEIVE:
2102 api_rpath->rpath.frp_addr = path->receive.fp_addr;
2103 api_rpath->rpath.frp_sw_if_index = path->receive.fp_interface;
2105 case FIB_PATH_TYPE_ATTACHED:
2106 api_rpath->rpath.frp_sw_if_index = path->attached.fp_interface;
2108 case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
2109 api_rpath->rpath.frp_sw_if_index = path->attached_next_hop.fp_interface;
2110 api_rpath->rpath.frp_addr = path->attached_next_hop.fp_nh;
2112 case FIB_PATH_TYPE_SPECIAL:
2114 case FIB_PATH_TYPE_DEAG:
2116 case FIB_PATH_TYPE_RECURSIVE:
2117 api_rpath->rpath.frp_addr = path->recursive.fp_nh.fp_ip;
2126 fib_path_get_proto (fib_node_index_t path_index)
2130 path = fib_path_get(path_index);
2132 return (path->fp_nh_proto);
2136 fib_path_module_init (void)
2138 fib_node_register_type (FIB_NODE_TYPE_PATH, &fib_path_vft);
2141 static clib_error_t *
2142 show_fib_path_command (vlib_main_t * vm,
2143 unformat_input_t * input,
2144 vlib_cli_command_t * cmd)
2146 fib_node_index_t pi;
2149 if (unformat (input, "%d", &pi))
2152 * show one in detail
2154 if (!pool_is_free_index(fib_path_pool, pi))
2156 path = fib_path_get(pi);
2157 u8 *s = fib_path_format(pi, NULL);
2158 s = format(s, "children:");
2159 s = fib_node_children_format(path->fp_node.fn_children, s);
2160 vlib_cli_output (vm, "%s", s);
2165 vlib_cli_output (vm, "path %d invalid", pi);
2170 vlib_cli_output (vm, "FIB Paths");
2171 pool_foreach(path, fib_path_pool,
2173 vlib_cli_output (vm, "%U", format_fib_path, path);
2180 VLIB_CLI_COMMAND (show_fib_path, static) = {
2181 .path = "show fib paths",
2182 .function = show_fib_path_command,
2183 .short_help = "show fib paths",