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 <vnet/adj/adj.h>
17 #include <vnet/dpo/load_balance.h>
18 #include <vnet/dpo/mpls_label_dpo.h>
19 #include <vnet/dpo/drop_dpo.h>
21 #include <vnet/fib/fib_entry_src.h>
22 #include <vnet/fib/fib_table.h>
23 #include <vnet/fib/fib_path_ext.h>
24 #include <vnet/fib/fib_urpf_list.h>
29 static fib_entry_src_vft_t fib_entry_src_vft[FIB_SOURCE_MAX];
32 fib_entry_get_proto (const fib_entry_t * fib_entry)
34 return (fib_entry->fe_prefix.fp_proto);
38 fib_entry_src_register (fib_source_t source,
39 const fib_entry_src_vft_t *vft)
41 fib_entry_src_vft[source] = *vft;
45 fib_entry_src_cmp_for_sort (void * v1,
48 fib_entry_src_t *esrc1 = v1, *esrc2 = v2;
50 return (esrc1->fes_src - esrc2->fes_src);
54 fib_entry_src_action_init (fib_entry_t *fib_entry,
58 fib_entry_src_t esrc = {
59 .fes_pl = FIB_NODE_INDEX_INVALID,
60 .fes_flags = FIB_ENTRY_SRC_FLAG_NONE,
64 if (NULL != fib_entry_src_vft[source].fesv_init)
66 fib_entry_src_vft[source].fesv_init(&esrc);
69 vec_add1(fib_entry->fe_srcs, esrc);
70 vec_sort_with_function(fib_entry->fe_srcs,
71 fib_entry_src_cmp_for_sort);
74 static fib_entry_src_t *
75 fib_entry_src_find (const fib_entry_t *fib_entry,
80 fib_entry_src_t *esrc;
84 vec_foreach(esrc, fib_entry->fe_srcs)
86 if (esrc->fes_src == source)
104 fib_entry_is_sourced (fib_node_index_t fib_entry_index,
107 fib_entry_t *fib_entry;
109 fib_entry = fib_entry_get(fib_entry_index);
111 return (NULL != fib_entry_src_find(fib_entry, source, NULL));
114 static fib_entry_src_t *
115 fib_entry_src_find_or_create (fib_entry_t *fib_entry,
119 fib_entry_src_t *esrc;
121 esrc = fib_entry_src_find(fib_entry, source, NULL);
125 fib_entry_src_action_init(fib_entry, source);
128 return (fib_entry_src_find(fib_entry, source, NULL));
132 fib_entry_src_action_deinit (fib_entry_t *fib_entry,
136 fib_entry_src_t *esrc;
139 esrc = fib_entry_src_find(fib_entry, source, &index);
141 ASSERT(NULL != esrc);
143 if (NULL != fib_entry_src_vft[source].fesv_deinit)
145 fib_entry_src_vft[source].fesv_deinit(esrc);
148 vec_free(esrc->fes_path_exts);
149 vec_del1(fib_entry->fe_srcs, index);
152 fib_entry_src_cover_res_t
153 fib_entry_src_action_cover_change (fib_entry_t *fib_entry,
156 if (NULL != fib_entry_src_vft[source].fesv_cover_change)
158 return (fib_entry_src_vft[source].fesv_cover_change(
159 fib_entry_src_find(fib_entry, source, NULL),
163 fib_entry_src_cover_res_t res = {
165 .bw_reason = FIB_NODE_BW_REASON_FLAG_NONE,
170 fib_entry_src_cover_res_t
171 fib_entry_src_action_cover_update (fib_entry_t *fib_entry,
174 if (NULL != fib_entry_src_vft[source].fesv_cover_update)
176 return (fib_entry_src_vft[source].fesv_cover_update(
177 fib_entry_src_find(fib_entry, source, NULL),
181 fib_entry_src_cover_res_t res = {
183 .bw_reason = FIB_NODE_BW_REASON_FLAG_NONE,
188 typedef struct fib_entry_src_collect_forwarding_ctx_t_
190 load_balance_path_t * next_hops;
191 const fib_entry_t *fib_entry;
192 const fib_entry_src_t *esrc;
193 fib_forward_chain_type_t fct;
195 } fib_entry_src_collect_forwarding_ctx_t;
198 * @brief Determine whether this FIB entry should use a load-balance MAP
199 * to support PIC edge fast convergence
202 fib_entry_calc_lb_flags (fib_entry_src_collect_forwarding_ctx_t *ctx)
205 * We'll use a LB map is the path-list has recursive paths.
206 * recursive paths implies BGP, and hence scale.
208 if (ctx->is_recursive)
210 return (LOAD_BALANCE_FLAG_USES_MAP);
212 return (LOAD_BALANCE_FLAG_NONE);
216 fib_entry_src_valid_out_label (mpls_label_t label)
218 return ((MPLS_LABEL_IS_REAL(label) ||
219 MPLS_IETF_IPV4_EXPLICIT_NULL_LABEL == label ||
220 MPLS_IETF_IPV6_EXPLICIT_NULL_LABEL == label ||
221 MPLS_IETF_IMPLICIT_NULL_LABEL == label));
225 * @brief Turn the chain type requested by the client into the one they
228 fib_forward_chain_type_t
229 fib_entry_chain_type_fixup (const fib_entry_t *entry,
230 fib_forward_chain_type_t fct)
232 ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS == fct);
235 * The EOS chain is a tricky since one cannot know the adjacency
236 * to link to without knowing what the packets payload protocol
237 * will be once the label is popped.
239 fib_forward_chain_type_t dfct;
241 dfct = fib_entry_get_default_chain_type(entry);
243 if (FIB_FORW_CHAIN_TYPE_MPLS_EOS == dfct)
246 * If the entry being asked is a eos-MPLS label entry,
247 * then use the payload-protocol field, that we stashed there
248 * for just this purpose
250 return (fib_forw_chain_type_from_dpo_proto(
251 entry->fe_prefix.fp_payload_proto));
254 * else give them what this entry would be by default. i.e. if it's a v6
255 * entry, then the label its local labelled should be carrying v6 traffic.
256 * If it's a non-EOS label entry, then there are more labels and we want
263 fib_entry_src_collect_forwarding (fib_node_index_t pl_index,
264 fib_node_index_t path_index,
267 fib_entry_src_collect_forwarding_ctx_t *ctx;
268 fib_path_ext_t *path_ext;
273 * if the path is not resolved, don't include it.
275 if (!fib_path_is_resolved(path_index))
280 if (fib_path_is_recursive(path_index))
282 ctx->is_recursive = 1;
286 * get the matching path-extension for the path being visited.
288 vec_foreach(path_ext, ctx->esrc->fes_path_exts)
290 if (path_ext->fpe_path_index == path_index)
294 if (NULL != path_ext &&
295 path_ext->fpe_path_index == path_index &&
296 fib_entry_src_valid_out_label(path_ext->fpe_label_stack[0]))
299 * found a matching extension. stack it to obtain the forwarding
300 * info for this path.
302 ctx->next_hops = fib_path_ext_stack(path_ext, ctx->fib_entry, ctx->fct, ctx->next_hops);
306 load_balance_path_t *nh;
309 * no extension => no out-going label for this path. that's OK
310 * in the case of an IP or EOS chain, but not for non-EOS
314 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
315 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
316 case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
317 case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
319 * EOS traffic with no label to stack, we need the IP Adj
321 vec_add2(ctx->next_hops, nh, 1);
323 nh->path_index = path_index;
324 nh->path_weight = fib_path_get_weight(path_index);
325 fib_path_contribute_forwarding(path_index, ctx->fct, &nh->path_dpo);
328 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
329 if (fib_path_is_exclusive(path_index) ||
330 fib_path_is_deag(path_index))
332 vec_add2(ctx->next_hops, nh, 1);
334 nh->path_index = path_index;
335 nh->path_weight = fib_path_get_weight(path_index);
336 fib_path_contribute_forwarding(path_index,
337 FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS,
341 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
344 * no label. we need a chain based on the payload. fixup.
346 vec_add2(ctx->next_hops, nh, 1);
348 nh->path_index = path_index;
349 nh->path_weight = fib_path_get_weight(path_index);
350 fib_path_contribute_forwarding(path_index,
351 fib_entry_chain_type_fixup(ctx->fib_entry,
357 case FIB_FORW_CHAIN_TYPE_ETHERNET:
358 case FIB_FORW_CHAIN_TYPE_NSH:
368 fib_entry_src_mk_lb (fib_entry_t *fib_entry,
369 const fib_entry_src_t *esrc,
370 fib_forward_chain_type_t fct,
373 dpo_proto_t lb_proto;
376 * If the entry has path extensions then we construct a load-balance
377 * by stacking the extensions on the forwarding chains of the paths.
378 * Otherwise we use the load-balance of the path-list
380 fib_entry_src_collect_forwarding_ctx_t ctx = {
382 .fib_entry = fib_entry,
389 * As an optimisation we allocate the vector of next-hops to be sized
390 * equal to the maximum nuber of paths we will need, which is also the
391 * most likely number we will need, since in most cases the paths are 'up'.
393 vec_validate(ctx.next_hops, fib_path_list_get_n_paths(esrc->fes_pl));
394 vec_reset_length(ctx.next_hops);
396 lb_proto = fib_proto_to_dpo(fib_entry->fe_prefix.fp_proto);
398 fib_path_list_walk(esrc->fes_pl,
399 fib_entry_src_collect_forwarding,
402 if (esrc->fes_entry_flags & FIB_ENTRY_FLAG_EXCLUSIVE)
405 * the client provided the DPO that the entry should link to.
406 * all entries must link to a LB, so if it is an LB already
407 * then we can use it.
409 if ((1 == vec_len(ctx.next_hops)) &&
410 (DPO_LOAD_BALANCE == ctx.next_hops[0].path_dpo.dpoi_type))
412 dpo_copy(dpo_lb, &ctx.next_hops[0].path_dpo);
413 dpo_reset(&ctx.next_hops[0].path_dpo);
418 if (!dpo_id_is_valid(dpo_lb))
423 flow_hash_config_t fhc;
425 fhc = fib_table_get_flow_hash_config(fib_entry->fe_fib_index,
426 dpo_proto_to_fib(lb_proto));
430 load_balance_create(0, lb_proto, fhc));
433 load_balance_multipath_update(dpo_lb,
435 fib_entry_calc_lb_flags(&ctx));
436 vec_free(ctx.next_hops);
439 * if this entry is sourced by the uRPF-exempt source then we
440 * append the always present local0 interface (index 0) to the
441 * uRPF list so it is not empty. that way packets pass the loose check.
443 index_t ui = fib_path_list_get_urpf(esrc->fes_pl);
445 if (fib_entry_is_sourced(fib_entry_get_index(fib_entry),
446 FIB_SOURCE_URPF_EXEMPT) &&
447 (0 == fib_urpf_check_size(ui)))
450 * The uRPF list we get from the path-list is shared by all
451 * other users of the list, but the uRPF exemption applies
452 * only to this prefix. So we need our own list.
454 ui = fib_urpf_list_alloc_and_lock();
455 fib_urpf_list_append(ui, 0);
456 fib_urpf_list_bake(ui);
457 load_balance_set_urpf(dpo_lb->dpoi_index, ui);
458 fib_urpf_list_unlock(ui);
462 load_balance_set_urpf(dpo_lb->dpoi_index, ui);
464 load_balance_set_fib_entry_flags(dpo_lb->dpoi_index,
465 fib_entry_get_flags_i(fib_entry));
469 fib_entry_src_action_install (fib_entry_t *fib_entry,
473 * Install the forwarding chain for the given source into the forwarding
476 fib_forward_chain_type_t fct;
477 fib_entry_src_t *esrc;
480 fct = fib_entry_get_default_chain_type(fib_entry);
481 esrc = fib_entry_src_find(fib_entry, source, NULL);
484 * Every entry has its own load-balance object. All changes to the entry's
485 * forwarding result in an inplace modify of the load-balance. This means
486 * the load-balance object only needs to be added to the forwarding
487 * DB once, when it is created.
489 insert = !dpo_id_is_valid(&fib_entry->fe_lb);
491 fib_entry_src_mk_lb(fib_entry, esrc, fct, &fib_entry->fe_lb);
493 ASSERT(dpo_id_is_valid(&fib_entry->fe_lb));
494 FIB_ENTRY_DBG(fib_entry, "install: %d", fib_entry->fe_lb);
497 * insert the adj into the data-plane forwarding trie
501 fib_table_fwding_dpo_update(fib_entry->fe_fib_index,
502 &fib_entry->fe_prefix,
507 * if any of the other chain types are already created they will need
510 fib_entry_delegate_type_t fdt;
511 fib_entry_delegate_t *fed;
513 FOR_EACH_DELEGATE_CHAIN(fib_entry, fdt, fed,
515 fib_entry_src_mk_lb(fib_entry, esrc,
516 fib_entry_delegate_type_to_chain_type(fdt),
522 fib_entry_src_action_uninstall (fib_entry_t *fib_entry)
525 * uninstall the forwarding chain from the forwarding tables
527 FIB_ENTRY_DBG(fib_entry, "uninstall: %d",
528 fib_entry->fe_adj_index);
530 if (dpo_id_is_valid(&fib_entry->fe_lb))
532 fib_table_fwding_dpo_remove(
533 fib_entry->fe_fib_index,
534 &fib_entry->fe_prefix,
537 dpo_reset(&fib_entry->fe_lb);
542 fib_entry_recursive_loop_detect_i (fib_node_index_t path_list_index)
544 fib_node_index_t *entries = NULL;
546 fib_path_list_recursive_loop_detect(path_list_index, &entries);
552 fib_entry_src_action_activate (fib_entry_t *fib_entry,
556 int houston_we_are_go_for_install;
557 fib_entry_src_t *esrc;
559 esrc = fib_entry_src_find(fib_entry, source, NULL);
561 ASSERT(!(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE));
562 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ADDED);
564 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ACTIVE;
566 if (NULL != fib_entry_src_vft[source].fesv_activate)
568 houston_we_are_go_for_install =
569 fib_entry_src_vft[source].fesv_activate(esrc, fib_entry);
574 * the source is not providing an activate function, we'll assume
575 * therefore it has no objection to installing the entry
577 houston_we_are_go_for_install = !0;
581 * link to the path-list provided by the source, and go check
582 * if that forms any loops in the graph.
584 fib_entry->fe_parent = esrc->fes_pl;
585 fib_entry->fe_sibling =
586 fib_path_list_child_add(fib_entry->fe_parent,
588 fib_entry_get_index(fib_entry));
590 fib_entry_recursive_loop_detect_i(fib_entry->fe_parent);
592 FIB_ENTRY_DBG(fib_entry, "activate: %d",
593 fib_entry->fe_parent);
595 if (0 != houston_we_are_go_for_install)
597 fib_entry_src_action_install(fib_entry, source);
601 fib_entry_src_action_uninstall(fib_entry);
606 fib_entry_src_action_deactivate (fib_entry_t *fib_entry,
610 fib_node_index_t path_list_index;
611 fib_entry_src_t *esrc;
613 esrc = fib_entry_src_find(fib_entry, source, NULL);
615 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE);
617 if (NULL != fib_entry_src_vft[source].fesv_deactivate)
619 fib_entry_src_vft[source].fesv_deactivate(esrc, fib_entry);
622 esrc->fes_flags &= ~FIB_ENTRY_SRC_FLAG_ACTIVE;
624 FIB_ENTRY_DBG(fib_entry, "deactivate: %d", fib_entry->fe_parent);
627 * un-link from an old path-list. Check for any loops this will clear
629 path_list_index = fib_entry->fe_parent;
630 fib_entry->fe_parent = FIB_NODE_INDEX_INVALID;
632 fib_entry_recursive_loop_detect_i(path_list_index);
635 * this will unlock the path-list, so it may be invalid thereafter.
637 fib_path_list_child_remove(path_list_index, fib_entry->fe_sibling);
638 fib_entry->fe_sibling = FIB_NODE_INDEX_INVALID;
642 fib_entry_src_action_fwd_update (const fib_entry_t *fib_entry,
645 fib_entry_src_t *esrc;
647 vec_foreach(esrc, fib_entry->fe_srcs)
649 if (NULL != fib_entry_src_vft[esrc->fes_src].fesv_fwd_update)
651 fib_entry_src_vft[esrc->fes_src].fesv_fwd_update(esrc,
659 fib_entry_src_action_reactivate (fib_entry_t *fib_entry,
662 fib_node_index_t path_list_index;
663 fib_entry_src_t *esrc;
665 esrc = fib_entry_src_find(fib_entry, source, NULL);
667 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE);
669 FIB_ENTRY_DBG(fib_entry, "reactivate: %d to %d",
670 fib_entry->fe_parent,
673 if (fib_entry->fe_parent != esrc->fes_pl)
676 * un-link from an old path-list. Check for any loops this will clear
678 path_list_index = fib_entry->fe_parent;
679 fib_entry->fe_parent = FIB_NODE_INDEX_INVALID;
682 * temporary lock so it doesn't get deleted when this entry is no
685 fib_path_list_lock(path_list_index);
688 * this entry is no longer a child. after unlinking check if any loops
691 fib_path_list_child_remove(path_list_index,
692 fib_entry->fe_sibling);
694 fib_entry_recursive_loop_detect_i(path_list_index);
697 * link to the path-list provided by the source, and go check
698 * if that forms any loops in the graph.
700 fib_entry->fe_parent = esrc->fes_pl;
701 fib_entry->fe_sibling =
702 fib_path_list_child_add(fib_entry->fe_parent,
704 fib_entry_get_index(fib_entry));
706 fib_entry_recursive_loop_detect_i(fib_entry->fe_parent);
707 fib_path_list_unlock(path_list_index);
709 fib_entry_src_action_install(fib_entry, source);
710 fib_entry_src_action_fwd_update(fib_entry, source);
714 fib_entry_src_action_installed (const fib_entry_t *fib_entry,
717 fib_entry_src_t *esrc;
719 esrc = fib_entry_src_find(fib_entry, source, NULL);
721 if (NULL != fib_entry_src_vft[source].fesv_installed)
723 fib_entry_src_vft[source].fesv_installed(esrc,
727 fib_entry_src_action_fwd_update(fib_entry, source);
731 * fib_entry_src_action_add
733 * Adding a source can result in a new fib_entry being created, which
734 * can inturn mean the pool is realloc'd and thus the entry passed as
735 * an argument it also realloc'd
736 * @return the original entry
739 fib_entry_src_action_add (fib_entry_t *fib_entry,
741 fib_entry_flag_t flags,
744 fib_node_index_t fib_entry_index;
745 fib_entry_src_t *esrc;
747 esrc = fib_entry_src_find_or_create(fib_entry, source, NULL);
749 esrc->fes_ref_count++;
751 if (1 != esrc->fes_ref_count)
754 * we only want to add the source on the 0->1 transition
759 esrc->fes_entry_flags = flags;
762 * save variable so we can recover from a fib_entry realloc.
764 fib_entry_index = fib_entry_get_index(fib_entry);
766 if (NULL != fib_entry_src_vft[source].fesv_add)
768 fib_entry_src_vft[source].fesv_add(esrc,
771 fib_entry_get_proto(fib_entry),
775 fib_entry = fib_entry_get(fib_entry_index);
777 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ADDED;
779 fib_path_list_lock(esrc->fes_pl);
782 * the source owns a lock on the entry
784 fib_entry_lock(fib_entry_get_index(fib_entry));
790 * fib_entry_src_action_update
792 * Adding a source can result in a new fib_entry being created, which
793 * can inturn mean the pool is realloc'd and thus the entry passed as
794 * an argument it also realloc'd
795 * @return the original entry
798 fib_entry_src_action_update (fib_entry_t *fib_entry,
800 fib_entry_flag_t flags,
803 fib_node_index_t fib_entry_index, old_path_list_index;
804 fib_entry_src_t *esrc;
806 esrc = fib_entry_src_find_or_create(fib_entry, source, NULL);
809 return (fib_entry_src_action_add(fib_entry, source, flags, dpo));
811 old_path_list_index = esrc->fes_pl;
812 esrc->fes_entry_flags = flags;
815 * save variable so we can recover from a fib_entry realloc.
817 fib_entry_index = fib_entry_get_index(fib_entry);
819 if (NULL != fib_entry_src_vft[source].fesv_add)
821 fib_entry_src_vft[source].fesv_add(esrc,
824 fib_entry_get_proto(fib_entry),
828 fib_entry = fib_entry_get(fib_entry_index);
830 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ADDED;
832 fib_path_list_lock(esrc->fes_pl);
833 fib_path_list_unlock(old_path_list_index);
840 fib_entry_src_action_remove (fib_entry_t *fib_entry,
844 fib_node_index_t old_path_list;
845 fib_entry_src_flag_t sflags;
846 fib_entry_src_t *esrc;
848 esrc = fib_entry_src_find(fib_entry, source, NULL);
851 return (FIB_ENTRY_SRC_FLAG_ACTIVE);
853 esrc->fes_ref_count--;
854 sflags = esrc->fes_flags;
856 if (0 != esrc->fes_ref_count)
859 * only remove the source on the 1->0 transisition
864 if (esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE)
866 fib_entry_src_action_deactivate(fib_entry, source);
869 old_path_list = esrc->fes_pl;
871 if (NULL != fib_entry_src_vft[source].fesv_remove)
873 fib_entry_src_vft[source].fesv_remove(esrc);
876 fib_path_list_unlock(old_path_list);
877 fib_entry_unlock(fib_entry_get_index(fib_entry));
879 sflags &= ~FIB_ENTRY_SRC_FLAG_ADDED;
880 fib_entry_src_action_deinit(fib_entry, source);
886 fib_route_recurses_via_self (const fib_prefix_t *prefix,
887 const fib_route_path_t *rpath)
890 * not all zeros next hop &&
891 * is recursive path &&
892 * nexthop is same as the route's address
894 return ((!ip46_address_is_zero(&rpath->frp_addr)) &&
895 (~0 == rpath->frp_sw_if_index) &&
896 (0 == ip46_address_cmp(&rpath->frp_addr, &prefix->fp_addr)));
901 * fib_route_attached_cross_table
903 * Return true the the route is attached via an interface that
904 * is not in the same table as the route
907 fib_route_attached_cross_table (const fib_entry_t *fib_entry,
908 const fib_route_path_t *rpath)
911 * - All zeros next-hop
912 * - a valid interface
913 * - entry's fib index not equeal to interface's index
915 if (ip46_address_is_zero(&rpath->frp_addr) &&
916 (~0 != rpath->frp_sw_if_index) &&
917 (fib_entry->fe_fib_index !=
918 fib_table_get_index_for_sw_if_index(fib_entry_get_proto(fib_entry),
919 rpath->frp_sw_if_index)))
927 * fib_route_attached_cross_table
929 * Return true the the route is attached via an interface that
930 * is not in the same table as the route
933 fib_path_is_attached (const fib_route_path_t *rpath)
936 * - All zeros next-hop
937 * - a valid interface
939 if (ip46_address_is_zero(&rpath->frp_addr) &&
940 (~0 != rpath->frp_sw_if_index))
947 fib_path_list_flags_t
948 fib_entry_src_flags_2_path_list_flags (fib_entry_flag_t eflags)
950 fib_path_list_flags_t plf = FIB_PATH_LIST_FLAG_NONE;
952 if (eflags & FIB_ENTRY_FLAG_DROP)
954 plf |= FIB_PATH_LIST_FLAG_DROP;
956 if (eflags & FIB_ENTRY_FLAG_LOCAL)
958 plf |= FIB_PATH_LIST_FLAG_LOCAL;
960 if (eflags & FIB_ENTRY_FLAG_EXCLUSIVE)
962 plf |= FIB_PATH_LIST_FLAG_EXCLUSIVE;
969 fib_entry_flags_update (const fib_entry_t *fib_entry,
970 const fib_route_path_t *rpath,
971 fib_path_list_flags_t *pl_flags,
972 fib_entry_src_t *esrc)
975 * don't allow the addition of a recursive looped path for prefix
978 if (fib_route_recurses_via_self(&fib_entry->fe_prefix, rpath))
981 * force the install of a drop path-list.
982 * we want the entry to have some path-list, mainly so
983 * the dodgy path can be rmeoved when the source stops playing
986 *pl_flags |= FIB_PATH_LIST_FLAG_DROP;
990 *pl_flags &= ~FIB_PATH_LIST_FLAG_DROP;
993 if ((esrc->fes_src == FIB_SOURCE_API) ||
994 (esrc->fes_src == FIB_SOURCE_CLI))
996 if (fib_path_is_attached(rpath))
998 esrc->fes_entry_flags |= FIB_ENTRY_FLAG_ATTACHED;
1002 esrc->fes_entry_flags &= ~FIB_ENTRY_FLAG_ATTACHED;
1005 if (fib_route_attached_cross_table(fib_entry, rpath))
1007 esrc->fes_entry_flags |= FIB_ENTRY_FLAG_IMPORT;
1011 esrc->fes_entry_flags &= ~FIB_ENTRY_FLAG_IMPORT;
1016 * fib_entry_src_path_ext_add
1018 * append a path extension to the entry's list
1021 fib_entry_src_path_ext_append (fib_entry_src_t *esrc,
1022 const fib_route_path_t *rpath)
1024 if (NULL != rpath->frp_label_stack)
1026 fib_path_ext_t *path_ext;
1028 vec_add2(esrc->fes_path_exts, path_ext, 1);
1030 fib_path_ext_init(path_ext, esrc->fes_pl, rpath);
1035 * fib_entry_src_path_ext_insert
1037 * insert, sorted, a path extension to the entry's list.
1038 * It's not strictly necessary in sort the path extensions, since each
1039 * extension has the path index to which it resolves. However, by being
1040 * sorted the load-balance produced has a deterministic order, not an order
1041 * based on the sequence of extension additions. this is a considerable benefit.
1044 fib_entry_src_path_ext_insert (fib_entry_src_t *esrc,
1045 const fib_route_path_t *rpath)
1047 if (0 == vec_len(esrc->fes_path_exts))
1048 return (fib_entry_src_path_ext_append(esrc, rpath));
1050 if (NULL != rpath->frp_label_stack)
1052 fib_path_ext_t path_ext;
1055 fib_path_ext_init(&path_ext, esrc->fes_pl, rpath);
1057 while (i < vec_len(esrc->fes_path_exts) &&
1058 (fib_path_ext_cmp(&esrc->fes_path_exts[i], rpath) < 0))
1063 vec_insert_elts(esrc->fes_path_exts, &path_ext, 1, i);
1068 * fib_entry_src_action_add
1070 * Adding a source can result in a new fib_entry being created, which
1071 * can inturn mean the pool is realloc'd and thus the entry passed as
1072 * an argument it also realloc'd
1076 fib_entry_src_action_path_add (fib_entry_t *fib_entry,
1077 fib_source_t source,
1078 fib_entry_flag_t flags,
1079 const fib_route_path_t *rpath)
1081 fib_node_index_t old_path_list, fib_entry_index;
1082 fib_path_list_flags_t pl_flags;
1083 fib_path_ext_t *path_ext;
1084 fib_entry_src_t *esrc;
1087 * save variable so we can recover from a fib_entry realloc.
1089 fib_entry_index = fib_entry_get_index(fib_entry);
1091 esrc = fib_entry_src_find(fib_entry, source, NULL);
1095 fib_entry_src_action_add(fib_entry,
1100 fib_entry_get_proto(fib_entry))));
1101 esrc = fib_entry_src_find(fib_entry, source, NULL);
1105 * we are no doubt modifying a path-list. If the path-list
1106 * is shared, and hence not modifiable, then the index returned
1107 * will be for a different path-list. This FIB entry to needs
1108 * to maintain its lock appropriately.
1110 old_path_list = esrc->fes_pl;
1112 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_add);
1114 pl_flags = fib_entry_src_flags_2_path_list_flags(fib_entry_get_flags_i(fib_entry));
1115 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1117 fib_entry_src_vft[source].fesv_path_add(esrc, fib_entry, pl_flags, rpath);
1118 fib_entry = fib_entry_get(fib_entry_index);
1121 * re-resolve all the path-extensions with the new path-list
1123 vec_foreach(path_ext, esrc->fes_path_exts)
1125 fib_path_ext_resolve(path_ext, esrc->fes_pl);
1128 * if the path has a label we need to add a path extension
1130 fib_entry_src_path_ext_insert(esrc, rpath);
1132 fib_path_list_lock(esrc->fes_pl);
1133 fib_path_list_unlock(old_path_list);
1139 * fib_entry_src_action_swap
1141 * The source is providing new paths to replace the old ones.
1142 * Adding a source can result in a new fib_entry being created, which
1143 * can inturn mean the pool is realloc'd and thus the entry passed as
1144 * an argument it also realloc'd
1148 fib_entry_src_action_path_swap (fib_entry_t *fib_entry,
1149 fib_source_t source,
1150 fib_entry_flag_t flags,
1151 const fib_route_path_t *rpaths)
1153 fib_node_index_t old_path_list, fib_entry_index;
1154 fib_path_list_flags_t pl_flags;
1155 const fib_route_path_t *rpath;
1156 fib_path_ext_t *path_ext;
1157 fib_entry_src_t *esrc;
1159 esrc = fib_entry_src_find(fib_entry, source, NULL);
1162 * save variable so we can recover from a fib_entry realloc.
1164 fib_entry_index = fib_entry_get_index(fib_entry);
1168 fib_entry = fib_entry_src_action_add(fib_entry,
1173 fib_entry_get_proto(fib_entry))));
1174 esrc = fib_entry_src_find(fib_entry, source, NULL);
1178 * swapping paths may create a new path-list (or may use an existing shared)
1179 * but we are certainly getting a different one. This FIB entry to needs
1180 * to maintain its lock appropriately.
1182 old_path_list = esrc->fes_pl;
1184 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_swap);
1186 pl_flags = fib_entry_src_flags_2_path_list_flags(flags);
1188 vec_foreach(rpath, rpaths)
1190 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1193 fib_entry_src_vft[source].fesv_path_swap(esrc,
1198 vec_foreach(path_ext, esrc->fes_path_exts)
1200 vec_free(path_ext->fpe_label_stack);
1202 vec_free(esrc->fes_path_exts);
1204 vec_foreach(rpath, rpaths)
1206 fib_entry_src_path_ext_append(esrc, rpath);
1209 fib_entry = fib_entry_get(fib_entry_index);
1211 fib_path_list_lock(esrc->fes_pl);
1212 fib_path_list_unlock(old_path_list);
1217 fib_entry_src_flag_t
1218 fib_entry_src_action_path_remove (fib_entry_t *fib_entry,
1219 fib_source_t source,
1220 const fib_route_path_t *rpath)
1222 fib_path_list_flags_t pl_flags;
1223 fib_node_index_t old_path_list;
1224 fib_path_ext_t *path_ext;
1225 fib_entry_src_t *esrc;
1227 esrc = fib_entry_src_find(fib_entry, source, NULL);
1229 ASSERT(NULL != esrc);
1230 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ADDED);
1233 * we no doubt modifying a path-list. If the path-list
1234 * is shared, and hence not modifiable, then the index returned
1235 * will be for a different path-list. This FIB entry to needs
1236 * to maintain its lock appropriately.
1238 old_path_list = esrc->fes_pl;
1240 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_remove);
1242 pl_flags = fib_entry_src_flags_2_path_list_flags(fib_entry_get_flags_i(fib_entry));
1243 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1245 fib_entry_src_vft[source].fesv_path_remove(esrc, pl_flags, rpath);
1247 * find the matching path extension and remove it
1249 vec_foreach(path_ext, esrc->fes_path_exts)
1251 if (!fib_path_ext_cmp(path_ext, rpath))
1254 * delete the element moving the remaining elements down 1 position.
1255 * this preserves the sorted order.
1257 vec_free(path_ext->fpe_label_stack);
1258 vec_delete(esrc->fes_path_exts, 1, (path_ext - esrc->fes_path_exts));
1263 * re-resolve all the path-extensions with the new path-list
1265 vec_foreach(path_ext, esrc->fes_path_exts)
1267 fib_path_ext_resolve(path_ext, esrc->fes_pl);
1271 * lock the new path-list, unlock the old if it had one
1273 fib_path_list_unlock(old_path_list);
1275 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl) {
1276 fib_path_list_lock(esrc->fes_pl);
1277 return (FIB_ENTRY_SRC_FLAG_ADDED);
1282 * no more paths left from this source
1284 fib_entry_src_action_remove(fib_entry, source);
1285 return (FIB_ENTRY_SRC_FLAG_NONE);
1290 fib_entry_src_format (fib_entry_t *fib_entry,
1291 fib_source_t source,
1294 fib_entry_src_t *esrc;
1296 esrc = fib_entry_src_find(fib_entry, source, NULL);
1298 if (NULL != fib_entry_src_vft[source].fesv_format)
1300 return (fib_entry_src_vft[source].fesv_format(esrc, s));
1306 fib_entry_get_adj_for_source (fib_node_index_t fib_entry_index,
1307 fib_source_t source)
1309 fib_entry_t *fib_entry;
1310 fib_entry_src_t *esrc;
1312 if (FIB_NODE_INDEX_INVALID == fib_entry_index)
1313 return (ADJ_INDEX_INVALID);
1315 fib_entry = fib_entry_get(fib_entry_index);
1316 esrc = fib_entry_src_find(fib_entry, source, NULL);
1320 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1322 return (fib_path_list_get_adj(
1324 fib_entry_get_default_chain_type(fib_entry)));
1327 return (ADJ_INDEX_INVALID);
1331 fib_entry_get_dpo_for_source (fib_node_index_t fib_entry_index,
1332 fib_source_t source,
1335 fib_entry_t *fib_entry;
1336 fib_entry_src_t *esrc;
1338 if (FIB_NODE_INDEX_INVALID == fib_entry_index)
1341 fib_entry = fib_entry_get(fib_entry_index);
1342 esrc = fib_entry_src_find(fib_entry, source, NULL);
1346 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1348 fib_path_list_contribute_forwarding(
1350 fib_entry_get_default_chain_type(fib_entry),
1353 return (dpo_id_is_valid(dpo));
1360 fib_entry_get_resolving_interface_for_source (fib_node_index_t entry_index,
1361 fib_source_t source)
1363 fib_entry_t *fib_entry;
1364 fib_entry_src_t *esrc;
1366 fib_entry = fib_entry_get(entry_index);
1368 esrc = fib_entry_src_find(fib_entry, source, NULL);
1372 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1374 return (fib_path_list_get_resolving_interface(esrc->fes_pl));
1381 fib_entry_get_flags_for_source (fib_node_index_t entry_index,
1382 fib_source_t source)
1384 fib_entry_t *fib_entry;
1385 fib_entry_src_t *esrc;
1387 fib_entry = fib_entry_get(entry_index);
1389 esrc = fib_entry_src_find(fib_entry, source, NULL);
1393 return (esrc->fes_entry_flags);
1396 return (FIB_ENTRY_FLAG_NONE);
1400 fib_entry_get_flags_i (const fib_entry_t *fib_entry)
1402 fib_entry_flag_t flags;
1405 * the vector of sources is deliberately arranged in priority order
1407 if (0 == vec_len(fib_entry->fe_srcs))
1409 flags = FIB_ENTRY_FLAG_NONE;
1413 fib_entry_src_t *esrc;
1415 esrc = vec_elt_at_index(fib_entry->fe_srcs, 0);
1416 flags = esrc->fes_entry_flags;
1423 fib_entry_set_source_data (fib_node_index_t fib_entry_index,
1424 fib_source_t source,
1427 fib_entry_t *fib_entry;
1428 fib_entry_src_t *esrc;
1430 fib_entry = fib_entry_get(fib_entry_index);
1431 esrc = fib_entry_src_find(fib_entry, source, NULL);
1434 NULL != fib_entry_src_vft[source].fesv_set_data)
1436 fib_entry_src_vft[source].fesv_set_data(esrc, fib_entry, data);
1441 fib_entry_get_source_data (fib_node_index_t fib_entry_index,
1442 fib_source_t source)
1444 fib_entry_t *fib_entry;
1445 fib_entry_src_t *esrc;
1447 fib_entry = fib_entry_get(fib_entry_index);
1448 esrc = fib_entry_src_find(fib_entry, source, NULL);
1451 NULL != fib_entry_src_vft[source].fesv_get_data)
1453 return (fib_entry_src_vft[source].fesv_get_data(esrc, fib_entry));
1459 fib_entry_src_module_init (void)
1461 fib_entry_src_rr_register();
1462 fib_entry_src_interface_register();
1463 fib_entry_src_default_route_register();
1464 fib_entry_src_special_register();
1465 fib_entry_src_api_register();
1466 fib_entry_src_adj_register();
1467 fib_entry_src_mpls_register();
1468 fib_entry_src_lisp_register();