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:
317 * EOS traffic with no label to stack, we need the IP Adj
319 vec_add2(ctx->next_hops, nh, 1);
321 nh->path_index = path_index;
322 nh->path_weight = fib_path_get_weight(path_index);
323 fib_path_contribute_forwarding(path_index, ctx->fct, &nh->path_dpo);
326 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
327 if (fib_path_is_exclusive(path_index) ||
328 fib_path_is_deag(path_index))
330 vec_add2(ctx->next_hops, nh, 1);
332 nh->path_index = path_index;
333 nh->path_weight = fib_path_get_weight(path_index);
334 fib_path_contribute_forwarding(path_index,
335 FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS,
339 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
342 * no label. we need a chain based on the payload. fixup.
344 vec_add2(ctx->next_hops, nh, 1);
346 nh->path_index = path_index;
347 nh->path_weight = fib_path_get_weight(path_index);
348 fib_path_contribute_forwarding(path_index,
349 fib_entry_chain_type_fixup(ctx->fib_entry,
355 case FIB_FORW_CHAIN_TYPE_ETHERNET:
365 fib_entry_src_mk_lb (fib_entry_t *fib_entry,
366 const fib_entry_src_t *esrc,
367 fib_forward_chain_type_t fct,
370 dpo_proto_t lb_proto;
373 * If the entry has path extensions then we construct a load-balance
374 * by stacking the extensions on the forwarding chains of the paths.
375 * Otherwise we use the load-balance of the path-list
377 fib_entry_src_collect_forwarding_ctx_t ctx = {
379 .fib_entry = fib_entry,
386 * As an optimisation we allocate the vector of next-hops to be sized
387 * equal to the maximum nuber of paths we will need, which is also the
388 * most likely number we will need, since in most cases the paths are 'up'.
390 vec_validate(ctx.next_hops, fib_path_list_get_n_paths(esrc->fes_pl));
391 vec_reset_length(ctx.next_hops);
393 lb_proto = fib_proto_to_dpo(fib_entry->fe_prefix.fp_proto);
395 fib_path_list_walk(esrc->fes_pl,
396 fib_entry_src_collect_forwarding,
399 if (esrc->fes_entry_flags & FIB_ENTRY_FLAG_EXCLUSIVE)
402 * the client provided the DPO that the entry should link to.
403 * all entries must link to a LB, so if it is an LB already
404 * then we can use it.
406 if ((1 == vec_len(ctx.next_hops)) &&
407 (DPO_LOAD_BALANCE == ctx.next_hops[0].path_dpo.dpoi_type))
409 dpo_copy(dpo_lb, &ctx.next_hops[0].path_dpo);
410 dpo_reset(&ctx.next_hops[0].path_dpo);
415 if (!dpo_id_is_valid(dpo_lb))
420 flow_hash_config_t fhc;
422 fhc = fib_table_get_flow_hash_config(fib_entry->fe_fib_index,
423 dpo_proto_to_fib(lb_proto));
427 load_balance_create(0, lb_proto, fhc));
430 load_balance_multipath_update(dpo_lb,
432 fib_entry_calc_lb_flags(&ctx));
433 vec_free(ctx.next_hops);
436 * if this entry is sourced by the uRPF-exempt source then we
437 * append the always present local0 interface (index 0) to the
438 * uRPF list so it is not empty. that way packets pass the loose check.
440 index_t ui = fib_path_list_get_urpf(esrc->fes_pl);
442 if (fib_entry_is_sourced(fib_entry_get_index(fib_entry),
443 FIB_SOURCE_URPF_EXEMPT) &&
444 (0 == fib_urpf_check_size(ui)))
447 * The uRPF list we get from the path-list is shared by all
448 * other users of the list, but the uRPF exemption applies
449 * only to this prefix. So we need our own list.
451 ui = fib_urpf_list_alloc_and_lock();
452 fib_urpf_list_append(ui, 0);
453 fib_urpf_list_bake(ui);
454 load_balance_set_urpf(dpo_lb->dpoi_index, ui);
455 fib_urpf_list_unlock(ui);
459 load_balance_set_urpf(dpo_lb->dpoi_index, ui);
464 fib_entry_src_action_install (fib_entry_t *fib_entry,
468 * Install the forwarding chain for the given source into the forwarding
471 fib_forward_chain_type_t fct;
472 fib_entry_src_t *esrc;
475 fct = fib_entry_get_default_chain_type(fib_entry);
476 esrc = fib_entry_src_find(fib_entry, source, NULL);
479 * Every entry has its own load-balance object. All changes to the entry's
480 * forwarding result in an inplace modify of the load-balance. This means
481 * the load-balance object only needs to be added to the forwarding
482 * DB once, when it is created.
484 insert = !dpo_id_is_valid(&fib_entry->fe_lb);
486 fib_entry_src_mk_lb(fib_entry, esrc, fct, &fib_entry->fe_lb);
488 ASSERT(dpo_id_is_valid(&fib_entry->fe_lb));
489 FIB_ENTRY_DBG(fib_entry, "install: %d", fib_entry->fe_lb);
492 * insert the adj into the data-plane forwarding trie
496 fib_table_fwding_dpo_update(fib_entry->fe_fib_index,
497 &fib_entry->fe_prefix,
502 * if any of the other chain types are already created they will need
505 fib_entry_delegate_type_t fdt;
506 fib_entry_delegate_t *fed;
508 FOR_EACH_DELEGATE_CHAIN(fib_entry, fdt, fed,
510 fib_entry_src_mk_lb(fib_entry, esrc,
511 fib_entry_delegate_type_to_chain_type(fdt),
517 fib_entry_src_action_uninstall (fib_entry_t *fib_entry)
520 * uninstall the forwarding chain from the forwarding tables
522 FIB_ENTRY_DBG(fib_entry, "uninstall: %d",
523 fib_entry->fe_adj_index);
525 if (dpo_id_is_valid(&fib_entry->fe_lb))
527 fib_table_fwding_dpo_remove(
528 fib_entry->fe_fib_index,
529 &fib_entry->fe_prefix,
532 dpo_reset(&fib_entry->fe_lb);
537 fib_entry_recursive_loop_detect_i (fib_node_index_t path_list_index)
539 fib_node_index_t *entries = NULL;
541 fib_path_list_recursive_loop_detect(path_list_index, &entries);
547 fib_entry_src_action_activate (fib_entry_t *fib_entry,
551 int houston_we_are_go_for_install;
552 fib_entry_src_t *esrc;
554 esrc = fib_entry_src_find(fib_entry, source, NULL);
556 ASSERT(!(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE));
557 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ADDED);
559 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ACTIVE;
561 if (NULL != fib_entry_src_vft[source].fesv_activate)
563 houston_we_are_go_for_install =
564 fib_entry_src_vft[source].fesv_activate(esrc, fib_entry);
569 * the source is not providing an activate function, we'll assume
570 * therefore it has no objection to installing the entry
572 houston_we_are_go_for_install = !0;
576 * link to the path-list provided by the source, and go check
577 * if that forms any loops in the graph.
579 fib_entry->fe_parent = esrc->fes_pl;
580 fib_entry->fe_sibling =
581 fib_path_list_child_add(fib_entry->fe_parent,
583 fib_entry_get_index(fib_entry));
585 fib_entry_recursive_loop_detect_i(fib_entry->fe_parent);
587 FIB_ENTRY_DBG(fib_entry, "activate: %d",
588 fib_entry->fe_parent);
590 if (0 != houston_we_are_go_for_install)
592 fib_entry_src_action_install(fib_entry, source);
596 fib_entry_src_action_uninstall(fib_entry);
601 fib_entry_src_action_deactivate (fib_entry_t *fib_entry,
605 fib_node_index_t path_list_index;
606 fib_entry_src_t *esrc;
608 esrc = fib_entry_src_find(fib_entry, source, NULL);
610 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE);
612 if (NULL != fib_entry_src_vft[source].fesv_deactivate)
614 fib_entry_src_vft[source].fesv_deactivate(esrc, fib_entry);
617 esrc->fes_flags &= ~FIB_ENTRY_SRC_FLAG_ACTIVE;
619 FIB_ENTRY_DBG(fib_entry, "deactivate: %d", fib_entry->fe_parent);
622 * un-link from an old path-list. Check for any loops this will clear
624 path_list_index = fib_entry->fe_parent;
625 fib_entry->fe_parent = FIB_NODE_INDEX_INVALID;
627 fib_entry_recursive_loop_detect_i(path_list_index);
630 * this will unlock the path-list, so it may be invalid thereafter.
632 fib_path_list_child_remove(path_list_index, fib_entry->fe_sibling);
633 fib_entry->fe_sibling = FIB_NODE_INDEX_INVALID;
637 fib_entry_src_action_fwd_update (const fib_entry_t *fib_entry,
640 fib_entry_src_t *esrc;
642 vec_foreach(esrc, fib_entry->fe_srcs)
644 if (NULL != fib_entry_src_vft[esrc->fes_src].fesv_fwd_update)
646 fib_entry_src_vft[esrc->fes_src].fesv_fwd_update(esrc,
654 fib_entry_src_action_reactivate (fib_entry_t *fib_entry,
657 fib_node_index_t path_list_index;
658 fib_entry_src_t *esrc;
660 esrc = fib_entry_src_find(fib_entry, source, NULL);
662 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE);
664 FIB_ENTRY_DBG(fib_entry, "reactivate: %d to %d",
665 fib_entry->fe_parent,
668 if (fib_entry->fe_parent != esrc->fes_pl)
671 * un-link from an old path-list. Check for any loops this will clear
673 path_list_index = fib_entry->fe_parent;
674 fib_entry->fe_parent = FIB_NODE_INDEX_INVALID;
677 * temporary lock so it doesn't get deleted when this entry is no
680 fib_path_list_lock(path_list_index);
683 * this entry is no longer a child. after unlinking check if any loops
686 fib_path_list_child_remove(path_list_index,
687 fib_entry->fe_sibling);
689 fib_entry_recursive_loop_detect_i(path_list_index);
692 * link to the path-list provided by the source, and go check
693 * if that forms any loops in the graph.
695 fib_entry->fe_parent = esrc->fes_pl;
696 fib_entry->fe_sibling =
697 fib_path_list_child_add(fib_entry->fe_parent,
699 fib_entry_get_index(fib_entry));
701 fib_entry_recursive_loop_detect_i(fib_entry->fe_parent);
702 fib_path_list_unlock(path_list_index);
704 fib_entry_src_action_install(fib_entry, source);
705 fib_entry_src_action_fwd_update(fib_entry, source);
709 fib_entry_src_action_installed (const fib_entry_t *fib_entry,
712 fib_entry_src_t *esrc;
714 esrc = fib_entry_src_find(fib_entry, source, NULL);
716 if (NULL != fib_entry_src_vft[source].fesv_installed)
718 fib_entry_src_vft[source].fesv_installed(esrc,
722 fib_entry_src_action_fwd_update(fib_entry, source);
726 * fib_entry_src_action_add
728 * Adding a source can result in a new fib_entry being created, which
729 * can inturn mean the pool is realloc'd and thus the entry passed as
730 * an argument it also realloc'd
731 * @return the original entry
734 fib_entry_src_action_add (fib_entry_t *fib_entry,
736 fib_entry_flag_t flags,
739 fib_node_index_t fib_entry_index;
740 fib_entry_src_t *esrc;
742 esrc = fib_entry_src_find_or_create(fib_entry, source, NULL);
744 esrc->fes_ref_count++;
746 if (1 != esrc->fes_ref_count)
749 * we only want to add the source on the 0->1 transition
754 esrc->fes_entry_flags = flags;
757 * save variable so we can recover from a fib_entry realloc.
759 fib_entry_index = fib_entry_get_index(fib_entry);
761 if (NULL != fib_entry_src_vft[source].fesv_add)
763 fib_entry_src_vft[source].fesv_add(esrc,
766 fib_entry_get_proto(fib_entry),
770 fib_entry = fib_entry_get(fib_entry_index);
772 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ADDED;
774 fib_path_list_lock(esrc->fes_pl);
777 * the source owns a lock on the entry
779 fib_entry_lock(fib_entry_get_index(fib_entry));
785 * fib_entry_src_action_update
787 * Adding a source can result in a new fib_entry being created, which
788 * can inturn mean the pool is realloc'd and thus the entry passed as
789 * an argument it also realloc'd
790 * @return the original entry
793 fib_entry_src_action_update (fib_entry_t *fib_entry,
795 fib_entry_flag_t flags,
798 fib_node_index_t fib_entry_index, old_path_list_index;
799 fib_entry_src_t *esrc;
801 esrc = fib_entry_src_find_or_create(fib_entry, source, NULL);
804 return (fib_entry_src_action_add(fib_entry, source, flags, dpo));
806 old_path_list_index = esrc->fes_pl;
807 esrc->fes_entry_flags = flags;
810 * save variable so we can recover from a fib_entry realloc.
812 fib_entry_index = fib_entry_get_index(fib_entry);
814 if (NULL != fib_entry_src_vft[source].fesv_add)
816 fib_entry_src_vft[source].fesv_add(esrc,
819 fib_entry_get_proto(fib_entry),
823 fib_entry = fib_entry_get(fib_entry_index);
825 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ADDED;
827 fib_path_list_lock(esrc->fes_pl);
828 fib_path_list_unlock(old_path_list_index);
835 fib_entry_src_action_remove (fib_entry_t *fib_entry,
839 fib_node_index_t old_path_list;
840 fib_entry_src_flag_t sflags;
841 fib_entry_src_t *esrc;
843 esrc = fib_entry_src_find(fib_entry, source, NULL);
846 return (FIB_ENTRY_SRC_FLAG_ACTIVE);
848 esrc->fes_ref_count--;
849 sflags = esrc->fes_flags;
851 if (0 != esrc->fes_ref_count)
854 * only remove the source on the 1->0 transisition
859 if (esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE)
861 fib_entry_src_action_deactivate(fib_entry, source);
864 old_path_list = esrc->fes_pl;
866 if (NULL != fib_entry_src_vft[source].fesv_remove)
868 fib_entry_src_vft[source].fesv_remove(esrc);
871 fib_path_list_unlock(old_path_list);
872 fib_entry_unlock(fib_entry_get_index(fib_entry));
874 sflags &= ~FIB_ENTRY_SRC_FLAG_ADDED;
875 fib_entry_src_action_deinit(fib_entry, source);
881 fib_route_recurses_via_self (const fib_prefix_t *prefix,
882 const fib_route_path_t *rpath)
885 * not all zeros next hop &&
886 * is recursive path &&
887 * nexthop is same as the route's address
889 return ((!ip46_address_is_zero(&rpath->frp_addr)) &&
890 (~0 == rpath->frp_sw_if_index) &&
891 (0 == ip46_address_cmp(&rpath->frp_addr, &prefix->fp_addr)));
896 * fib_route_attached_cross_table
898 * Return true the the route is attached via an interface that
899 * is not in the same table as the route
902 fib_route_attached_cross_table (const fib_entry_t *fib_entry,
903 const fib_route_path_t *rpath)
906 * - All zeros next-hop
907 * - a valid interface
908 * - entry's fib index not equeal to interface's index
910 if (ip46_address_is_zero(&rpath->frp_addr) &&
911 (~0 != rpath->frp_sw_if_index) &&
912 (fib_entry->fe_fib_index !=
913 fib_table_get_index_for_sw_if_index(fib_entry_get_proto(fib_entry),
914 rpath->frp_sw_if_index)))
922 * fib_route_attached_cross_table
924 * Return true the the route is attached via an interface that
925 * is not in the same table as the route
928 fib_path_is_attached (const fib_route_path_t *rpath)
931 * - All zeros next-hop
932 * - a valid interface
934 if (ip46_address_is_zero(&rpath->frp_addr) &&
935 (~0 != rpath->frp_sw_if_index))
942 fib_path_list_flags_t
943 fib_entry_src_flags_2_path_list_flags (fib_entry_flag_t eflags)
945 fib_path_list_flags_t plf = FIB_PATH_LIST_FLAG_NONE;
947 if (eflags & FIB_ENTRY_FLAG_DROP)
949 plf |= FIB_PATH_LIST_FLAG_DROP;
951 if (eflags & FIB_ENTRY_FLAG_LOCAL)
953 plf |= FIB_PATH_LIST_FLAG_LOCAL;
955 if (eflags & FIB_ENTRY_FLAG_EXCLUSIVE)
957 plf |= FIB_PATH_LIST_FLAG_EXCLUSIVE;
964 fib_entry_flags_update (const fib_entry_t *fib_entry,
965 const fib_route_path_t *rpath,
966 fib_path_list_flags_t *pl_flags,
967 fib_entry_src_t *esrc)
970 * don't allow the addition of a recursive looped path for prefix
973 if (fib_route_recurses_via_self(&fib_entry->fe_prefix, rpath))
976 * force the install of a drop path-list.
977 * we want the entry to have some path-list, mainly so
978 * the dodgy path can be rmeoved when the source stops playing
981 *pl_flags |= FIB_PATH_LIST_FLAG_DROP;
985 *pl_flags &= ~FIB_PATH_LIST_FLAG_DROP;
988 if ((esrc->fes_src == FIB_SOURCE_API) ||
989 (esrc->fes_src == FIB_SOURCE_CLI))
991 if (fib_path_is_attached(rpath))
993 esrc->fes_entry_flags |= FIB_ENTRY_FLAG_ATTACHED;
997 esrc->fes_entry_flags &= ~FIB_ENTRY_FLAG_ATTACHED;
1000 if (fib_route_attached_cross_table(fib_entry, rpath))
1002 esrc->fes_entry_flags |= FIB_ENTRY_FLAG_IMPORT;
1006 esrc->fes_entry_flags &= ~FIB_ENTRY_FLAG_IMPORT;
1011 * fib_entry_src_path_ext_add
1013 * append a path extension to the entry's list
1016 fib_entry_src_path_ext_append (fib_entry_src_t *esrc,
1017 const fib_route_path_t *rpath)
1019 if (NULL != rpath->frp_label_stack)
1021 fib_path_ext_t *path_ext;
1023 vec_add2(esrc->fes_path_exts, path_ext, 1);
1025 fib_path_ext_init(path_ext, esrc->fes_pl, rpath);
1030 * fib_entry_src_path_ext_insert
1032 * insert, sorted, a path extension to the entry's list.
1033 * It's not strictly necessary in sort the path extensions, since each
1034 * extension has the path index to which it resolves. However, by being
1035 * sorted the load-balance produced has a deterministic order, not an order
1036 * based on the sequence of extension additions. this is a considerable benefit.
1039 fib_entry_src_path_ext_insert (fib_entry_src_t *esrc,
1040 const fib_route_path_t *rpath)
1042 if (0 == vec_len(esrc->fes_path_exts))
1043 return (fib_entry_src_path_ext_append(esrc, rpath));
1045 if (NULL != rpath->frp_label_stack)
1047 fib_path_ext_t path_ext;
1050 fib_path_ext_init(&path_ext, esrc->fes_pl, rpath);
1052 while (i < vec_len(esrc->fes_path_exts) &&
1053 (fib_path_ext_cmp(&esrc->fes_path_exts[i], rpath) < 0))
1058 vec_insert_elts(esrc->fes_path_exts, &path_ext, 1, i);
1063 * fib_entry_src_action_add
1065 * Adding a source can result in a new fib_entry being created, which
1066 * can inturn mean the pool is realloc'd and thus the entry passed as
1067 * an argument it also realloc'd
1071 fib_entry_src_action_path_add (fib_entry_t *fib_entry,
1072 fib_source_t source,
1073 fib_entry_flag_t flags,
1074 const fib_route_path_t *rpath)
1076 fib_node_index_t old_path_list, fib_entry_index;
1077 fib_path_list_flags_t pl_flags;
1078 fib_path_ext_t *path_ext;
1079 fib_entry_src_t *esrc;
1082 * save variable so we can recover from a fib_entry realloc.
1084 fib_entry_index = fib_entry_get_index(fib_entry);
1086 esrc = fib_entry_src_find(fib_entry, source, NULL);
1090 fib_entry_src_action_add(fib_entry,
1095 fib_entry_get_proto(fib_entry))));
1096 esrc = fib_entry_src_find(fib_entry, source, NULL);
1100 * we are no doubt modifying a path-list. If the path-list
1101 * is shared, and hence not modifiable, then the index returned
1102 * will be for a different path-list. This FIB entry to needs
1103 * to maintain its lock appropriately.
1105 old_path_list = esrc->fes_pl;
1107 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_add);
1109 pl_flags = fib_entry_src_flags_2_path_list_flags(fib_entry_get_flags_i(fib_entry));
1110 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1112 fib_entry_src_vft[source].fesv_path_add(esrc, fib_entry, pl_flags, rpath);
1113 fib_entry = fib_entry_get(fib_entry_index);
1116 * re-resolve all the path-extensions with the new path-list
1118 vec_foreach(path_ext, esrc->fes_path_exts)
1120 fib_path_ext_resolve(path_ext, esrc->fes_pl);
1123 * if the path has a label we need to add a path extension
1125 fib_entry_src_path_ext_insert(esrc, rpath);
1127 fib_path_list_lock(esrc->fes_pl);
1128 fib_path_list_unlock(old_path_list);
1134 * fib_entry_src_action_swap
1136 * The source is providing new paths to replace the old ones.
1137 * Adding a source can result in a new fib_entry being created, which
1138 * can inturn mean the pool is realloc'd and thus the entry passed as
1139 * an argument it also realloc'd
1143 fib_entry_src_action_path_swap (fib_entry_t *fib_entry,
1144 fib_source_t source,
1145 fib_entry_flag_t flags,
1146 const fib_route_path_t *rpaths)
1148 fib_node_index_t old_path_list, fib_entry_index;
1149 fib_path_list_flags_t pl_flags;
1150 const fib_route_path_t *rpath;
1151 fib_path_ext_t *path_ext;
1152 fib_entry_src_t *esrc;
1154 esrc = fib_entry_src_find(fib_entry, source, NULL);
1157 * save variable so we can recover from a fib_entry realloc.
1159 fib_entry_index = fib_entry_get_index(fib_entry);
1163 fib_entry = fib_entry_src_action_add(fib_entry,
1168 fib_entry_get_proto(fib_entry))));
1169 esrc = fib_entry_src_find(fib_entry, source, NULL);
1173 * swapping paths may create a new path-list (or may use an existing shared)
1174 * but we are certainly getting a different one. This FIB entry to needs
1175 * to maintain its lock appropriately.
1177 old_path_list = esrc->fes_pl;
1179 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_swap);
1181 pl_flags = fib_entry_src_flags_2_path_list_flags(flags);
1183 vec_foreach(rpath, rpaths)
1185 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1188 fib_entry_src_vft[source].fesv_path_swap(esrc,
1193 vec_foreach(path_ext, esrc->fes_path_exts)
1195 vec_free(path_ext->fpe_label_stack);
1197 vec_free(esrc->fes_path_exts);
1199 vec_foreach(rpath, rpaths)
1201 fib_entry_src_path_ext_append(esrc, rpath);
1204 fib_entry = fib_entry_get(fib_entry_index);
1206 fib_path_list_lock(esrc->fes_pl);
1207 fib_path_list_unlock(old_path_list);
1212 fib_entry_src_flag_t
1213 fib_entry_src_action_path_remove (fib_entry_t *fib_entry,
1214 fib_source_t source,
1215 const fib_route_path_t *rpath)
1217 fib_path_list_flags_t pl_flags;
1218 fib_node_index_t old_path_list;
1219 fib_path_ext_t *path_ext;
1220 fib_entry_src_t *esrc;
1222 esrc = fib_entry_src_find(fib_entry, source, NULL);
1224 ASSERT(NULL != esrc);
1225 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ADDED);
1228 * we no doubt modifying a path-list. If the path-list
1229 * is shared, and hence not modifiable, then the index returned
1230 * will be for a different path-list. This FIB entry to needs
1231 * to maintain its lock appropriately.
1233 old_path_list = esrc->fes_pl;
1235 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_remove);
1237 pl_flags = fib_entry_src_flags_2_path_list_flags(fib_entry_get_flags_i(fib_entry));
1238 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1240 fib_entry_src_vft[source].fesv_path_remove(esrc, pl_flags, rpath);
1242 * find the matching path extension and remove it
1244 vec_foreach(path_ext, esrc->fes_path_exts)
1246 if (!fib_path_ext_cmp(path_ext, rpath))
1249 * delete the element moving the remaining elements down 1 position.
1250 * this preserves the sorted order.
1252 vec_free(path_ext->fpe_label_stack);
1253 vec_delete(esrc->fes_path_exts, 1, (path_ext - esrc->fes_path_exts));
1258 * re-resolve all the path-extensions with the new path-list
1260 vec_foreach(path_ext, esrc->fes_path_exts)
1262 fib_path_ext_resolve(path_ext, esrc->fes_pl);
1266 * lock the new path-list, unlock the old if it had one
1268 fib_path_list_unlock(old_path_list);
1270 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl) {
1271 fib_path_list_lock(esrc->fes_pl);
1272 return (FIB_ENTRY_SRC_FLAG_ADDED);
1277 * no more paths left from this source
1279 fib_entry_src_action_remove(fib_entry, source);
1280 return (FIB_ENTRY_SRC_FLAG_NONE);
1285 fib_entry_src_format (fib_entry_t *fib_entry,
1286 fib_source_t source,
1289 fib_entry_src_t *esrc;
1291 esrc = fib_entry_src_find(fib_entry, source, NULL);
1293 if (NULL != fib_entry_src_vft[source].fesv_format)
1295 return (fib_entry_src_vft[source].fesv_format(esrc, s));
1301 fib_entry_get_adj_for_source (fib_node_index_t fib_entry_index,
1302 fib_source_t source)
1304 fib_entry_t *fib_entry;
1305 fib_entry_src_t *esrc;
1307 if (FIB_NODE_INDEX_INVALID == fib_entry_index)
1308 return (ADJ_INDEX_INVALID);
1310 fib_entry = fib_entry_get(fib_entry_index);
1311 esrc = fib_entry_src_find(fib_entry, source, NULL);
1315 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1317 return (fib_path_list_get_adj(
1319 fib_entry_get_default_chain_type(fib_entry)));
1322 return (ADJ_INDEX_INVALID);
1326 fib_entry_get_dpo_for_source (fib_node_index_t fib_entry_index,
1327 fib_source_t source,
1330 fib_entry_t *fib_entry;
1331 fib_entry_src_t *esrc;
1333 if (FIB_NODE_INDEX_INVALID == fib_entry_index)
1336 fib_entry = fib_entry_get(fib_entry_index);
1337 esrc = fib_entry_src_find(fib_entry, source, NULL);
1341 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1343 fib_path_list_contribute_forwarding(
1345 fib_entry_get_default_chain_type(fib_entry),
1348 return (dpo_id_is_valid(dpo));
1355 fib_entry_get_resolving_interface_for_source (fib_node_index_t entry_index,
1356 fib_source_t source)
1358 fib_entry_t *fib_entry;
1359 fib_entry_src_t *esrc;
1361 fib_entry = fib_entry_get(entry_index);
1363 esrc = fib_entry_src_find(fib_entry, source, NULL);
1367 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1369 return (fib_path_list_get_resolving_interface(esrc->fes_pl));
1376 fib_entry_get_flags_for_source (fib_node_index_t entry_index,
1377 fib_source_t source)
1379 fib_entry_t *fib_entry;
1380 fib_entry_src_t *esrc;
1382 fib_entry = fib_entry_get(entry_index);
1384 esrc = fib_entry_src_find(fib_entry, source, NULL);
1388 return (esrc->fes_entry_flags);
1391 return (FIB_ENTRY_FLAG_NONE);
1395 fib_entry_get_flags_i (const fib_entry_t *fib_entry)
1397 fib_entry_flag_t flags;
1400 * the vector of sources is deliberately arranged in priority order
1402 if (0 == vec_len(fib_entry->fe_srcs))
1404 flags = FIB_ENTRY_FLAG_NONE;
1408 fib_entry_src_t *esrc;
1410 esrc = vec_elt_at_index(fib_entry->fe_srcs, 0);
1411 flags = esrc->fes_entry_flags;
1418 fib_entry_set_source_data (fib_node_index_t fib_entry_index,
1419 fib_source_t source,
1422 fib_entry_t *fib_entry;
1423 fib_entry_src_t *esrc;
1425 fib_entry = fib_entry_get(fib_entry_index);
1426 esrc = fib_entry_src_find(fib_entry, source, NULL);
1429 NULL != fib_entry_src_vft[source].fesv_set_data)
1431 fib_entry_src_vft[source].fesv_set_data(esrc, fib_entry, data);
1436 fib_entry_get_source_data (fib_node_index_t fib_entry_index,
1437 fib_source_t source)
1439 fib_entry_t *fib_entry;
1440 fib_entry_src_t *esrc;
1442 fib_entry = fib_entry_get(fib_entry_index);
1443 esrc = fib_entry_src_find(fib_entry, source, NULL);
1446 NULL != fib_entry_src_vft[source].fesv_get_data)
1448 return (fib_entry_src_vft[source].fesv_get_data(esrc, fib_entry));
1454 fib_entry_src_module_init (void)
1456 fib_entry_src_rr_register();
1457 fib_entry_src_interface_register();
1458 fib_entry_src_default_route_register();
1459 fib_entry_src_special_register();
1460 fib_entry_src_api_register();
1461 fib_entry_src_adj_register();
1462 fib_entry_src_mpls_register();
1463 fib_entry_src_lisp_register();