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 fib_entry_src_collect_forwarding (fib_node_index_t pl_index,
226 fib_node_index_t path_index,
229 fib_entry_src_collect_forwarding_ctx_t *ctx;
230 fib_path_ext_t *path_ext;
235 * if the path is not resolved, don't include it.
237 if (!fib_path_is_resolved(path_index))
242 if (fib_path_is_recursive(path_index))
244 ctx->is_recursive = 1;
248 * get the matching path-extension for the path being visited.
250 vec_foreach(path_ext, ctx->esrc->fes_path_exts)
252 if (path_ext->fpe_path_index == path_index)
256 if (NULL != path_ext &&
257 path_ext->fpe_path_index == path_index &&
258 fib_entry_src_valid_out_label(path_ext->fpe_label))
261 * found a matching extension. stack it to obtain the forwarding
262 * info for this path.
264 ctx->next_hops = fib_path_ext_stack(path_ext, ctx->fct, ctx->next_hops);
268 load_balance_path_t *nh;
271 * no extension => no out-going label for this path. that's OK
272 * in the case of an IP or EOS chain, but not for non-EOS
276 case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
277 case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
279 * EOS traffic with no label to stack, we need the IP Adj
281 vec_add2(ctx->next_hops, nh, 1);
283 nh->path_index = path_index;
284 nh->path_weight = fib_path_get_weight(path_index);
285 fib_path_contribute_forwarding(path_index, ctx->fct, &nh->path_dpo);
288 case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
289 if (fib_path_is_exclusive(path_index) ||
290 fib_path_is_deag(path_index))
292 vec_add2(ctx->next_hops, nh, 1);
294 nh->path_index = path_index;
295 nh->path_weight = fib_path_get_weight(path_index);
296 fib_path_contribute_forwarding(path_index,
297 FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS,
301 case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
302 case FIB_FORW_CHAIN_TYPE_ETHERNET:
312 fib_entry_src_mk_lb (fib_entry_t *fib_entry,
313 const fib_entry_src_t *esrc,
314 fib_forward_chain_type_t fct,
317 dpo_proto_t lb_proto;
320 * If the entry has path extensions then we construct a load-balance
321 * by stacking the extensions on the forwarding chains of the paths.
322 * Otherwise we use the load-balance of the path-list
324 fib_entry_src_collect_forwarding_ctx_t ctx = {
326 .fib_entry = fib_entry,
332 lb_proto = fib_proto_to_dpo(fib_entry_get_proto(fib_entry));
334 fib_path_list_walk(esrc->fes_pl,
335 fib_entry_src_collect_forwarding,
338 if (esrc->fes_entry_flags & FIB_ENTRY_FLAG_EXCLUSIVE)
341 * the client provided the DPO that the entry should link to.
342 * all entries must link to a LB, so if it is an LB already
343 * then we can use it.
345 if ((1 == vec_len(ctx.next_hops)) &&
346 (DPO_LOAD_BALANCE == ctx.next_hops[0].path_dpo.dpoi_type))
348 dpo_copy(dpo_lb, &ctx.next_hops[0].path_dpo);
349 dpo_reset(&ctx.next_hops[0].path_dpo);
354 if (!dpo_id_is_valid(dpo_lb))
359 flow_hash_config_t fhc;
361 fhc = fib_table_get_flow_hash_config(fib_entry->fe_fib_index,
362 dpo_proto_to_fib(lb_proto));
366 load_balance_create(0, lb_proto, fhc));
369 load_balance_multipath_update(dpo_lb,
371 fib_entry_calc_lb_flags(&ctx));
374 * if this entry is sourced by the uRPF-exempt source then we
375 * append the always present local0 interface (index 0) to the
376 * uRPF list so it is not empty. that way packets pass the loose check.
378 index_t ui = fib_path_list_get_urpf(esrc->fes_pl);
380 if (fib_entry_is_sourced(fib_entry_get_index(fib_entry),
381 FIB_SOURCE_URPF_EXEMPT) &&
382 (0 == fib_urpf_check_size(ui)))
385 * The uRPF list we get from the path-list is shared by all
386 * other users of the list, but the uRPF exemption applies
387 * only to this prefix. So we need our own list.
389 ui = fib_urpf_list_alloc_and_lock();
390 fib_urpf_list_append(ui, 0);
391 fib_urpf_list_bake(ui);
392 load_balance_set_urpf(dpo_lb->dpoi_index, ui);
393 fib_urpf_list_unlock(ui);
397 load_balance_set_urpf(dpo_lb->dpoi_index, ui);
402 fib_entry_src_action_install (fib_entry_t *fib_entry,
406 * Install the forwarding chain for the given source into the forwarding
409 fib_forward_chain_type_t fct;
410 fib_entry_src_t *esrc;
412 fct = fib_entry_get_default_chain_type(fib_entry);
413 esrc = fib_entry_src_find(fib_entry, source, NULL);
415 fib_entry_src_mk_lb(fib_entry, esrc, fct, &fib_entry->fe_lb[fct]);
417 FIB_ENTRY_DBG(fib_entry, "install: %d",
418 fib_entry->fe_lb[fct]);
421 * insert the adj into the data-plane forwarding trie
423 fib_table_fwding_dpo_update(fib_entry->fe_fib_index,
424 &fib_entry->fe_prefix,
425 &fib_entry->fe_lb[fct]);
427 if (FIB_FORW_CHAIN_TYPE_UNICAST_IP4 == fct ||
428 FIB_FORW_CHAIN_TYPE_UNICAST_IP6 == fct)
430 for (fct = FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS;
431 fct <= FIB_FORW_CHAIN_TYPE_MPLS_EOS;
435 * if any of the other chain types are already created they will need
438 if (dpo_id_is_valid(&fib_entry->fe_lb[fct]))
440 fib_entry_src_mk_lb(fib_entry,
443 &fib_entry->fe_lb[fct]);
450 fib_entry_src_action_uninstall (fib_entry_t *fib_entry)
452 fib_forward_chain_type_t fct;
454 fct = fib_entry_get_default_chain_type(fib_entry);
456 * uninstall the forwarding chain from the forwarding tables
458 FIB_ENTRY_DBG(fib_entry, "uninstall: %d",
459 fib_entry->fe_adj_index);
461 if (dpo_id_is_valid(&fib_entry->fe_lb[fct]))
463 fib_table_fwding_dpo_remove(
464 fib_entry->fe_fib_index,
465 &fib_entry->fe_prefix,
466 &fib_entry->fe_lb[fct]);
468 dpo_reset(&fib_entry->fe_lb[fct]);
473 fib_entry_recursive_loop_detect_i (fib_node_index_t path_list_index)
475 fib_node_index_t *entries = NULL;
477 fib_path_list_recursive_loop_detect(path_list_index, &entries);
483 fib_entry_src_action_activate (fib_entry_t *fib_entry,
487 int houston_we_are_go_for_install;
488 fib_entry_src_t *esrc;
490 esrc = fib_entry_src_find(fib_entry, source, NULL);
492 ASSERT(!(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE));
493 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ADDED);
495 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ACTIVE;
497 if (NULL != fib_entry_src_vft[source].fesv_activate)
499 houston_we_are_go_for_install =
500 fib_entry_src_vft[source].fesv_activate(esrc, fib_entry);
505 * the source is not providing an activate function, we'll assume
506 * therefore it has no objection to installing the entry
508 houston_we_are_go_for_install = !0;
512 * link to the path-list provided by the source, and go check
513 * if that forms any loops in the graph.
515 fib_entry->fe_parent = esrc->fes_pl;
516 fib_entry->fe_sibling =
517 fib_path_list_child_add(fib_entry->fe_parent,
519 fib_entry_get_index(fib_entry));
521 fib_entry_recursive_loop_detect_i(fib_entry->fe_parent);
523 FIB_ENTRY_DBG(fib_entry, "activate: %d",
524 fib_entry->fe_parent);
526 if (0 != houston_we_are_go_for_install)
528 fib_entry_src_action_install(fib_entry, source);
532 fib_entry_src_action_uninstall(fib_entry);
537 fib_entry_src_action_deactivate (fib_entry_t *fib_entry,
541 fib_node_index_t path_list_index;
542 fib_entry_src_t *esrc;
544 esrc = fib_entry_src_find(fib_entry, source, NULL);
546 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE);
548 if (NULL != fib_entry_src_vft[source].fesv_deactivate)
550 fib_entry_src_vft[source].fesv_deactivate(esrc, fib_entry);
553 esrc->fes_flags &= ~FIB_ENTRY_SRC_FLAG_ACTIVE;
555 FIB_ENTRY_DBG(fib_entry, "deactivate: %d", fib_entry->fe_parent);
558 * un-link from an old path-list. Check for any loops this will clear
560 path_list_index = fib_entry->fe_parent;
561 fib_entry->fe_parent = FIB_NODE_INDEX_INVALID;
563 fib_entry_recursive_loop_detect_i(path_list_index);
566 * this will unlock the path-list, so it may be invalid thereafter.
568 fib_path_list_child_remove(path_list_index, fib_entry->fe_sibling);
569 fib_entry->fe_sibling = FIB_NODE_INDEX_INVALID;
573 fib_entry_src_action_fwd_update (const fib_entry_t *fib_entry,
576 fib_entry_src_t *esrc;
578 vec_foreach(esrc, fib_entry->fe_srcs)
580 if (NULL != fib_entry_src_vft[esrc->fes_src].fesv_fwd_update)
582 fib_entry_src_vft[esrc->fes_src].fesv_fwd_update(esrc,
590 fib_entry_src_action_reactivate (fib_entry_t *fib_entry,
593 fib_node_index_t path_list_index;
594 fib_entry_src_t *esrc;
596 esrc = fib_entry_src_find(fib_entry, source, NULL);
598 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE);
600 FIB_ENTRY_DBG(fib_entry, "reactivate: %d to %d",
601 fib_entry->fe_parent,
604 if (fib_entry->fe_parent != esrc->fes_pl)
607 * un-link from an old path-list. Check for any loops this will clear
609 path_list_index = fib_entry->fe_parent;
610 fib_entry->fe_parent = FIB_NODE_INDEX_INVALID;
613 * temporary lock so it doesn't get deleted when this entry is no
616 fib_path_list_lock(path_list_index);
619 * this entry is no longer a child. after unlinking check if any loops
622 fib_path_list_child_remove(path_list_index,
623 fib_entry->fe_sibling);
625 fib_entry_recursive_loop_detect_i(path_list_index);
628 * link to the path-list provided by the source, and go check
629 * if that forms any loops in the graph.
631 fib_entry->fe_parent = esrc->fes_pl;
632 fib_entry->fe_sibling =
633 fib_path_list_child_add(fib_entry->fe_parent,
635 fib_entry_get_index(fib_entry));
637 fib_entry_recursive_loop_detect_i(fib_entry->fe_parent);
638 fib_path_list_unlock(path_list_index);
640 fib_entry_src_action_install(fib_entry, source);
641 fib_entry_src_action_fwd_update(fib_entry, source);
645 fib_entry_src_action_installed (const fib_entry_t *fib_entry,
648 fib_entry_src_t *esrc;
650 esrc = fib_entry_src_find(fib_entry, source, NULL);
652 if (NULL != fib_entry_src_vft[source].fesv_installed)
654 fib_entry_src_vft[source].fesv_installed(esrc,
658 fib_entry_src_action_fwd_update(fib_entry, source);
662 * fib_entry_src_action_add
664 * Adding a source can result in a new fib_entry being created, which
665 * can inturn mean the pool is realloc'd and thus the entry passed as
666 * an argument it also realloc'd
667 * @return the original entry
670 fib_entry_src_action_add (fib_entry_t *fib_entry,
672 fib_entry_flag_t flags,
675 fib_node_index_t fib_entry_index;
676 fib_entry_src_t *esrc;
678 esrc = fib_entry_src_find_or_create(fib_entry, source, NULL);
680 esrc->fes_ref_count++;
682 if (1 != esrc->fes_ref_count)
685 * we only want to add the source on the 0->1 transition
690 esrc->fes_entry_flags = flags;
693 * save variable so we can recover from a fib_entry realloc.
695 fib_entry_index = fib_entry_get_index(fib_entry);
697 if (NULL != fib_entry_src_vft[source].fesv_add)
699 fib_entry_src_vft[source].fesv_add(esrc,
702 fib_entry_get_proto(fib_entry),
706 fib_entry = fib_entry_get(fib_entry_index);
708 esrc->fes_flags |= FIB_ENTRY_SRC_FLAG_ADDED;
710 fib_path_list_lock(esrc->fes_pl);
713 * the source owns a lock on the entry
715 fib_entry_lock(fib_entry_get_index(fib_entry));
721 fib_entry_src_action_remove (fib_entry_t *fib_entry,
725 fib_node_index_t old_path_list;
726 fib_entry_src_flag_t sflags;
727 fib_entry_src_t *esrc;
729 esrc = fib_entry_src_find(fib_entry, source, NULL);
732 return (FIB_ENTRY_SRC_FLAG_ACTIVE);
734 esrc->fes_ref_count--;
735 sflags = esrc->fes_flags;
737 if (0 != esrc->fes_ref_count)
740 * only remove the source on the 1->0 transisition
745 if (esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ACTIVE)
747 fib_entry_src_action_deactivate(fib_entry, source);
750 old_path_list = esrc->fes_pl;
752 if (NULL != fib_entry_src_vft[source].fesv_remove)
754 fib_entry_src_vft[source].fesv_remove(esrc);
757 fib_path_list_unlock(old_path_list);
758 fib_entry_unlock(fib_entry_get_index(fib_entry));
760 sflags &= ~FIB_ENTRY_SRC_FLAG_ADDED;
761 fib_entry_src_action_deinit(fib_entry, source);
767 fib_route_recurses_via_self (const fib_prefix_t *prefix,
768 const fib_route_path_t *rpath)
771 * not all zeros next hop &&
772 * is recursive path &&
773 * nexthop is same as the route's address
775 return ((!ip46_address_is_zero(&rpath->frp_addr)) &&
776 (~0 == rpath->frp_sw_if_index) &&
777 (0 == ip46_address_cmp(&rpath->frp_addr, &prefix->fp_addr)));
782 * fib_route_attached_cross_table
784 * Return true the the route is attached via an interface that
785 * is not in the same table as the route
788 fib_route_attached_cross_table (const fib_entry_t *fib_entry,
789 const fib_route_path_t *rpath)
792 * - All zeros next-hop
793 * - a valid interface
794 * - entry's fib index not equeal to interface's index
796 if (ip46_address_is_zero(&rpath->frp_addr) &&
797 (~0 != rpath->frp_sw_if_index) &&
798 (fib_entry->fe_fib_index !=
799 fib_table_get_index_for_sw_if_index(fib_entry_get_proto(fib_entry),
800 rpath->frp_sw_if_index)))
808 * fib_route_attached_cross_table
810 * Return true the the route is attached via an interface that
811 * is not in the same table as the route
814 fib_path_is_attached (const fib_route_path_t *rpath)
817 * - All zeros next-hop
818 * - a valid interface
820 if (ip46_address_is_zero(&rpath->frp_addr) &&
821 (~0 != rpath->frp_sw_if_index))
828 fib_path_list_flags_t
829 fib_entry_src_flags_2_path_list_flags (fib_entry_flag_t eflags)
831 fib_path_list_flags_t plf = FIB_PATH_LIST_FLAG_NONE;
833 if (eflags & FIB_ENTRY_FLAG_DROP)
835 plf |= FIB_PATH_LIST_FLAG_DROP;
837 if (eflags & FIB_ENTRY_FLAG_LOCAL)
839 plf |= FIB_PATH_LIST_FLAG_LOCAL;
841 if (eflags & FIB_ENTRY_FLAG_EXCLUSIVE)
843 plf |= FIB_PATH_LIST_FLAG_EXCLUSIVE;
850 fib_entry_flags_update (const fib_entry_t *fib_entry,
851 const fib_route_path_t *rpath,
852 fib_path_list_flags_t *pl_flags,
853 fib_entry_src_t *esrc)
856 * don't allow the addition of a recursive looped path for prefix
859 if (fib_route_recurses_via_self(&fib_entry->fe_prefix, rpath))
862 * force the install of a drop path-list.
863 * we want the entry to have some path-list, mainly so
864 * the dodgy path can be rmeoved when the source stops playing
867 *pl_flags |= FIB_PATH_LIST_FLAG_DROP;
871 *pl_flags &= ~FIB_PATH_LIST_FLAG_DROP;
874 if ((esrc->fes_src == FIB_SOURCE_API) ||
875 (esrc->fes_src == FIB_SOURCE_CLI))
877 if (fib_path_is_attached(rpath))
879 esrc->fes_entry_flags |= FIB_ENTRY_FLAG_ATTACHED;
883 esrc->fes_entry_flags &= ~FIB_ENTRY_FLAG_ATTACHED;
886 if (fib_route_attached_cross_table(fib_entry, rpath))
888 esrc->fes_entry_flags |= FIB_ENTRY_FLAG_IMPORT;
892 esrc->fes_entry_flags &= ~FIB_ENTRY_FLAG_IMPORT;
897 * fib_entry_src_path_ext_add
899 * append a path extension to the entry's list
902 fib_entry_src_path_ext_append (fib_entry_src_t *esrc,
903 const fib_route_path_t *rpath)
905 if (MPLS_LABEL_INVALID != rpath->frp_label)
907 fib_path_ext_t *path_ext;
909 vec_add2(esrc->fes_path_exts, path_ext, 1);
911 fib_path_ext_init(path_ext, esrc->fes_pl, rpath);
916 * fib_entry_src_path_ext_insert
918 * insert, sorted, a path extension to the entry's list.
919 * It's not strictly necessary in sort the path extensions, since each
920 * extension has the path index to which it resolves. However, by being
921 * sorted the load-balance produced has a deterministic order, not an order
922 * based on the sequence of extension additions. this is a considerable benefit.
925 fib_entry_src_path_ext_insert (fib_entry_src_t *esrc,
926 const fib_route_path_t *rpath)
928 if (0 == vec_len(esrc->fes_path_exts))
929 return (fib_entry_src_path_ext_append(esrc, rpath));
931 if (MPLS_LABEL_INVALID != rpath->frp_label)
933 fib_path_ext_t path_ext;
936 fib_path_ext_init(&path_ext, esrc->fes_pl, rpath);
938 while (i < vec_len(esrc->fes_path_exts) &&
939 (fib_path_ext_cmp(&esrc->fes_path_exts[i], rpath) < 0))
944 vec_insert_elts(esrc->fes_path_exts, &path_ext, 1, i);
949 * fib_entry_src_action_add
951 * Adding a source can result in a new fib_entry being created, which
952 * can inturn mean the pool is realloc'd and thus the entry passed as
953 * an argument it also realloc'd
957 fib_entry_src_action_path_add (fib_entry_t *fib_entry,
959 fib_entry_flag_t flags,
960 const fib_route_path_t *rpath)
962 fib_node_index_t old_path_list, fib_entry_index;
963 fib_path_list_flags_t pl_flags;
964 fib_path_ext_t *path_ext;
965 fib_entry_src_t *esrc;
968 * save variable so we can recover from a fib_entry realloc.
970 fib_entry_index = fib_entry_get_index(fib_entry);
972 esrc = fib_entry_src_find(fib_entry, source, NULL);
976 fib_entry_src_action_add(fib_entry,
981 fib_entry_get_proto(fib_entry))));
982 esrc = fib_entry_src_find(fib_entry, source, NULL);
986 * we are no doubt modifying a path-list. If the path-list
987 * is shared, and hence not modifiable, then the index returned
988 * will be for a different path-list. This FIB entry to needs
989 * to maintain its lock appropriately.
991 old_path_list = esrc->fes_pl;
993 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_add);
995 pl_flags = fib_entry_src_flags_2_path_list_flags(fib_entry_get_flags_i(fib_entry));
996 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
998 fib_entry_src_vft[source].fesv_path_add(esrc, fib_entry, pl_flags, rpath);
999 fib_entry = fib_entry_get(fib_entry_index);
1002 * re-resolve all the path-extensions with the new path-list
1004 vec_foreach(path_ext, esrc->fes_path_exts)
1006 fib_path_ext_resolve(path_ext, esrc->fes_pl);
1009 * if the path has a label we need to add a path extension
1011 fib_entry_src_path_ext_insert(esrc, rpath);
1013 fib_path_list_lock(esrc->fes_pl);
1014 fib_path_list_unlock(old_path_list);
1020 * fib_entry_src_action_swap
1022 * The source is providing new paths to replace the old ones.
1023 * Adding a source can result in a new fib_entry being created, which
1024 * can inturn mean the pool is realloc'd and thus the entry passed as
1025 * an argument it also realloc'd
1029 fib_entry_src_action_path_swap (fib_entry_t *fib_entry,
1030 fib_source_t source,
1031 fib_entry_flag_t flags,
1032 const fib_route_path_t *rpaths)
1034 fib_node_index_t old_path_list, fib_entry_index;
1035 fib_path_list_flags_t pl_flags;
1036 const fib_route_path_t *rpath;
1037 fib_entry_src_t *esrc;
1039 esrc = fib_entry_src_find(fib_entry, source, NULL);
1042 * save variable so we can recover from a fib_entry realloc.
1044 fib_entry_index = fib_entry_get_index(fib_entry);
1048 fib_entry = fib_entry_src_action_add(fib_entry,
1053 fib_entry_get_proto(fib_entry))));
1054 esrc = fib_entry_src_find(fib_entry, source, NULL);
1058 * swapping paths may create a new path-list (or may use an existing shared)
1059 * but we are certainly getting a different one. This FIB entry to needs
1060 * to maintain its lock appropriately.
1062 old_path_list = esrc->fes_pl;
1064 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_swap);
1066 pl_flags = fib_entry_src_flags_2_path_list_flags(flags);
1068 vec_foreach(rpath, rpaths)
1070 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1073 fib_entry_src_vft[source].fesv_path_swap(esrc,
1078 vec_free(esrc->fes_path_exts);
1079 vec_foreach(rpath, rpaths)
1081 fib_entry_src_path_ext_append(esrc, rpath);
1084 fib_entry = fib_entry_get(fib_entry_index);
1086 fib_path_list_lock(esrc->fes_pl);
1087 fib_path_list_unlock(old_path_list);
1092 fib_entry_src_flag_t
1093 fib_entry_src_action_path_remove (fib_entry_t *fib_entry,
1094 fib_source_t source,
1095 const fib_route_path_t *rpath)
1097 fib_path_list_flags_t pl_flags;
1098 fib_node_index_t old_path_list;
1099 fib_path_ext_t *path_ext;
1100 fib_entry_src_t *esrc;
1102 esrc = fib_entry_src_find(fib_entry, source, NULL);
1104 ASSERT(NULL != esrc);
1105 ASSERT(esrc->fes_flags & FIB_ENTRY_SRC_FLAG_ADDED);
1108 * we no doubt modifying a path-list. If the path-list
1109 * is shared, and hence not modifiable, then the index returned
1110 * will be for a different path-list. This FIB entry to needs
1111 * to maintain its lock appropriately.
1113 old_path_list = esrc->fes_pl;
1115 ASSERT(NULL != fib_entry_src_vft[source].fesv_path_remove);
1117 pl_flags = fib_entry_src_flags_2_path_list_flags(fib_entry_get_flags_i(fib_entry));
1118 fib_entry_flags_update(fib_entry, rpath, &pl_flags, esrc);
1120 fib_entry_src_vft[source].fesv_path_remove(esrc, pl_flags, rpath);
1122 * find the matching path extension and remove it
1124 vec_foreach(path_ext, esrc->fes_path_exts)
1126 if (!fib_path_ext_cmp(path_ext, rpath))
1129 * delete the element moving the remaining elements down 1 position.
1130 * this preserves the sorted order.
1132 vec_delete(esrc->fes_path_exts, 1, (path_ext - esrc->fes_path_exts));
1137 * re-resolve all the path-extensions with the new path-list
1139 vec_foreach(path_ext, esrc->fes_path_exts)
1141 fib_path_ext_resolve(path_ext, esrc->fes_pl);
1145 * lock the new path-list, unlock the old if it had one
1147 fib_path_list_unlock(old_path_list);
1149 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl) {
1150 fib_path_list_lock(esrc->fes_pl);
1151 return (FIB_ENTRY_SRC_FLAG_ADDED);
1156 * no more paths left from this source
1158 fib_entry_src_action_remove(fib_entry, source);
1159 return (FIB_ENTRY_SRC_FLAG_NONE);
1164 fib_entry_src_format (fib_entry_t *fib_entry,
1165 fib_source_t source,
1168 fib_entry_src_t *esrc;
1170 esrc = fib_entry_src_find(fib_entry, source, NULL);
1172 if (NULL != fib_entry_src_vft[source].fesv_format)
1174 return (fib_entry_src_vft[source].fesv_format(esrc, s));
1180 fib_entry_get_adj_for_source (fib_node_index_t fib_entry_index,
1181 fib_source_t source)
1183 fib_entry_t *fib_entry;
1184 fib_entry_src_t *esrc;
1186 if (FIB_NODE_INDEX_INVALID == fib_entry_index)
1187 return (ADJ_INDEX_INVALID);
1189 fib_entry = fib_entry_get(fib_entry_index);
1190 esrc = fib_entry_src_find(fib_entry, source, NULL);
1194 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1196 return (fib_path_list_get_adj(
1198 fib_entry_get_default_chain_type(fib_entry)));
1201 return (ADJ_INDEX_INVALID);
1205 fib_entry_get_dpo_for_source (fib_node_index_t fib_entry_index,
1206 fib_source_t source,
1209 fib_entry_t *fib_entry;
1210 fib_entry_src_t *esrc;
1212 if (FIB_NODE_INDEX_INVALID == fib_entry_index)
1215 fib_entry = fib_entry_get(fib_entry_index);
1216 esrc = fib_entry_src_find(fib_entry, source, NULL);
1220 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1222 fib_path_list_contribute_forwarding(
1224 fib_entry_get_default_chain_type(fib_entry),
1227 return (dpo_id_is_valid(dpo));
1234 fib_entry_get_resolving_interface_for_source (fib_node_index_t entry_index,
1235 fib_source_t source)
1237 fib_entry_t *fib_entry;
1238 fib_entry_src_t *esrc;
1240 fib_entry = fib_entry_get(entry_index);
1242 esrc = fib_entry_src_find(fib_entry, source, NULL);
1246 if (FIB_NODE_INDEX_INVALID != esrc->fes_pl)
1248 return (fib_path_list_get_resolving_interface(esrc->fes_pl));
1255 fib_entry_get_flags_for_source (fib_node_index_t entry_index,
1256 fib_source_t source)
1258 fib_entry_t *fib_entry;
1259 fib_entry_src_t *esrc;
1261 fib_entry = fib_entry_get(entry_index);
1263 esrc = fib_entry_src_find(fib_entry, source, NULL);
1267 return (esrc->fes_entry_flags);
1270 return (FIB_ENTRY_FLAG_NONE);
1274 fib_entry_get_flags_i (const fib_entry_t *fib_entry)
1276 fib_entry_flag_t flags;
1279 * the vector of sources is deliberately arranged in priority order
1281 if (0 == vec_len(fib_entry->fe_srcs))
1283 flags = FIB_ENTRY_FLAG_NONE;
1287 fib_entry_src_t *esrc;
1289 esrc = vec_elt_at_index(fib_entry->fe_srcs, 0);
1290 flags = esrc->fes_entry_flags;
1297 fib_entry_set_source_data (fib_node_index_t fib_entry_index,
1298 fib_source_t source,
1301 fib_entry_t *fib_entry;
1302 fib_entry_src_t *esrc;
1304 fib_entry = fib_entry_get(fib_entry_index);
1305 esrc = fib_entry_src_find(fib_entry, source, NULL);
1308 NULL != fib_entry_src_vft[source].fesv_set_data)
1310 fib_entry_src_vft[source].fesv_set_data(esrc, fib_entry, data);
1315 fib_entry_get_source_data (fib_node_index_t fib_entry_index,
1316 fib_source_t source)
1318 fib_entry_t *fib_entry;
1319 fib_entry_src_t *esrc;
1321 fib_entry = fib_entry_get(fib_entry_index);
1322 esrc = fib_entry_src_find(fib_entry, source, NULL);
1325 NULL != fib_entry_src_vft[source].fesv_get_data)
1327 return (fib_entry_src_vft[source].fesv_get_data(esrc, fib_entry));
1333 fib_entry_src_module_init (void)
1335 fib_entry_src_rr_register();
1336 fib_entry_src_interface_register();
1337 fib_entry_src_default_route_register();
1338 fib_entry_src_special_register();
1339 fib_entry_src_api_register();
1340 fib_entry_src_adj_register();
1341 fib_entry_src_mpls_register();
1342 fib_entry_src_lisp_register();