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_nbr.h>
17 #include <vnet/adj/adj_internal.h>
18 #include <vnet/ethernet/arp_packet.h>
19 #include <vnet/fib/fib_walk.h>
22 * Vector Hash tables of neighbour (traditional) adjacencies
23 * Key: interface(for the vector index), address (and its proto),
24 * link-type/ether-type.
26 static BVT(clib_bihash) **adj_nbr_tables[FIB_PROTOCOL_MAX];
28 // FIXME SIZE APPROPRIATELY. ASK DAVEB.
29 #define ADJ_NBR_DEFAULT_HASH_NUM_BUCKETS (64 * 64)
30 #define ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE (32<<20)
33 #define ADJ_NBR_SET_KEY(_key, _lt, _nh) \
35 _key.key[0] = (_nh)->as_u64[0]; \
36 _key.key[1] = (_nh)->as_u64[1]; \
37 _key.key[2] = (_lt); \
40 #define ADJ_NBR_ITF_OK(_proto, _itf) \
41 (((_itf) < vec_len(adj_nbr_tables[_proto])) && \
42 (NULL != adj_nbr_tables[_proto][sw_if_index]))
45 adj_nbr_insert (fib_protocol_t nh_proto,
46 vnet_link_t link_type,
47 const ip46_address_t *nh_addr,
49 adj_index_t adj_index)
51 BVT(clib_bihash_kv) kv;
53 if (sw_if_index >= vec_len(adj_nbr_tables[nh_proto]))
55 vec_validate(adj_nbr_tables[nh_proto], sw_if_index);
57 if (NULL == adj_nbr_tables[nh_proto][sw_if_index])
59 adj_nbr_tables[nh_proto][sw_if_index] =
60 clib_mem_alloc_aligned(sizeof(BVT(clib_bihash)),
61 CLIB_CACHE_LINE_BYTES);
62 clib_memset(adj_nbr_tables[nh_proto][sw_if_index],
64 sizeof(BVT(clib_bihash)));
66 BV(clib_bihash_init) (adj_nbr_tables[nh_proto][sw_if_index],
67 "Adjacency Neighbour table",
68 ADJ_NBR_DEFAULT_HASH_NUM_BUCKETS,
69 ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE);
72 ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
75 BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 1);
79 adj_nbr_remove (adj_index_t ai,
80 fib_protocol_t nh_proto,
81 vnet_link_t link_type,
82 const ip46_address_t *nh_addr,
85 BVT(clib_bihash_kv) kv;
87 if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
90 ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
93 BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 0);
97 adj_nbr_find (fib_protocol_t nh_proto,
98 vnet_link_t link_type,
99 const ip46_address_t *nh_addr,
102 BVT(clib_bihash_kv) kv;
104 ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
106 if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
107 return (ADJ_INDEX_INVALID);
109 if (BV(clib_bihash_search)(adj_nbr_tables[nh_proto][sw_if_index],
112 return (ADJ_INDEX_INVALID);
121 adj_get_nd_node (fib_protocol_t proto)
124 case FIB_PROTOCOL_IP4:
125 return (ip4_arp_node.index);
126 case FIB_PROTOCOL_IP6:
127 return (ip6_discover_neighbor_node.index);
128 case FIB_PROTOCOL_MPLS:
132 return (ip4_arp_node.index);
136 * @brief Check and set feature flags if o/p interface has any o/p features.
139 adj_nbr_evaluate_feature (adj_index_t ai)
142 vnet_feature_main_t *fm = &feature_main;
149 switch (adj->ia_link)
152 arc_index = ip4_main.lookup_main.output_feature_arc_index;
155 arc_index = ip6_main.lookup_main.output_feature_arc_index;
158 arc_index = mpls_main.output_feature_arc_index;
164 sw_if_index = adj->rewrite_header.sw_if_index;
165 if (vec_len(fm->feature_count_by_sw_if_index[arc_index]) > sw_if_index)
167 feature_count = fm->feature_count_by_sw_if_index[arc_index][sw_if_index];
168 if (feature_count > 0)
169 adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
175 static ip_adjacency_t*
176 adj_nbr_alloc (fib_protocol_t nh_proto,
177 vnet_link_t link_type,
178 const ip46_address_t *nh_addr,
183 adj = adj_alloc(nh_proto);
185 adj_nbr_insert(nh_proto, link_type, nh_addr,
190 * since we just added the ADJ we have no rewrite string for it,
193 adj->lookup_next_index = IP_LOOKUP_NEXT_ARP;
194 adj->sub_type.nbr.next_hop = *nh_addr;
195 adj->ia_link = link_type;
196 adj->ia_nh_proto = nh_proto;
197 adj->rewrite_header.sw_if_index = sw_if_index;
198 vnet_rewrite_update_mtu(vnet_get_main(), adj->ia_link,
199 &adj->rewrite_header);
201 adj_nbr_evaluate_feature (adj_get_index(adj));
206 * adj_nbr_add_or_lock
208 * Add an adjacency for the neighbour requested.
210 * The key for an adj is:
211 * - the Next-hops protocol (i.e. v4 or v6)
212 * - the address of the next-hop
213 * - the interface the next-hop is reachable through
216 adj_nbr_add_or_lock (fib_protocol_t nh_proto,
217 vnet_link_t link_type,
218 const ip46_address_t *nh_addr,
221 adj_index_t adj_index;
224 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
226 if (ADJ_INDEX_INVALID == adj_index)
230 vnm = vnet_get_main();
231 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
232 adj_index = adj_get_index(adj);
235 if (ip46_address_is_equal(&ADJ_BCAST_ADDR, nh_addr))
237 adj->lookup_next_index = IP_LOOKUP_NEXT_BCAST;
240 vnet_rewrite_init(vnm, sw_if_index, link_type,
241 adj_get_nd_node(nh_proto),
242 vnet_tx_node_index_for_sw_interface(vnm, sw_if_index),
243 &adj->rewrite_header);
246 * we need a rewrite where the destination IP address is converted
247 * to the appropriate link-layer address. This is interface specific.
248 * So ask the interface to do it.
250 vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
261 adj_nbr_add_or_lock_w_rewrite (fib_protocol_t nh_proto,
262 vnet_link_t link_type,
263 const ip46_address_t *nh_addr,
267 adj_index_t adj_index;
269 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
271 if (ADJ_INDEX_INVALID == adj_index)
275 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
276 adj->rewrite_header.sw_if_index = sw_if_index;
277 adj_index = adj_get_index(adj);
281 adj_nbr_update_rewrite(adj_index,
282 ADJ_NBR_REWRITE_FLAG_COMPLETE,
289 * adj_nbr_update_rewrite
291 * Update the adjacency's rewrite string. A NULL string implies the
292 * rewirte is reset (i.e. when ARP/ND etnry is gone).
293 * NB: the adj being updated may be handling traffic in the DP.
296 adj_nbr_update_rewrite (adj_index_t adj_index,
297 adj_nbr_rewrite_flag_t flags,
302 ASSERT(ADJ_INDEX_INVALID != adj_index);
304 adj = adj_get(adj_index);
306 if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
309 * update the adj's rewrite string and build the arc
310 * from the rewrite node to the interface's TX node
312 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_REWRITE,
313 adj_get_rewrite_node(adj->ia_link),
314 vnet_tx_node_index_for_sw_interface(
316 adj->rewrite_header.sw_if_index),
321 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_ARP,
322 adj_get_nd_node(adj->ia_nh_proto),
323 vnet_tx_node_index_for_sw_interface(
325 adj->rewrite_header.sw_if_index),
331 * adj_nbr_update_rewrite_internal
333 * Update the adjacency's rewrite string. A NULL string implies the
334 * rewirte is reset (i.e. when ARP/ND etnry is gone).
335 * NB: the adj being updated may be handling traffic in the DP.
338 adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
339 ip_lookup_next_t adj_next_index,
344 ip_adjacency_t *walk_adj;
350 vm = vlib_get_main();
351 old_next = adj->lookup_next_index;
353 walk_ai = adj_get_index(adj);
354 if (VNET_LINK_MPLS == adj->ia_link)
357 * The link type MPLS has no children in the control plane graph, it only
358 * has children in the data-palne graph. The backwalk is up the former.
359 * So we need to walk from its IP cousin.
361 walk_ai = adj_nbr_find(adj->ia_nh_proto,
362 fib_proto_to_link(adj->ia_nh_proto),
363 &adj->sub_type.nbr.next_hop,
364 adj->rewrite_header.sw_if_index);
368 * Don't call the walk re-entrantly
370 if (ADJ_INDEX_INVALID != walk_ai)
372 walk_adj = adj_get(walk_ai);
373 if (ADJ_FLAG_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
380 * Prevent re-entrant walk of the same adj
382 walk_adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
392 * lock the adjacencies that are affected by updates this walk will provoke.
393 * Since the aim of the walk is to update children to link to a different
394 * DPO, this adj will no longer be in use and its lock count will drop to 0.
395 * We don't want it to be deleted as part of this endevour.
397 adj_lock(adj_get_index(adj));
401 * Updating a rewrite string is not atomic;
402 * - the rewrite string is too long to write in one instruction
403 * - when swapping from incomplete to complete, we also need to update
404 * the VLIB graph next-index of the adj.
405 * ideally we would only want to suspend forwarding via this adj whilst we
406 * do this, but we do not have that level of granularity - it's suspend all
407 * worker threads or nothing.
408 * The other chioces are:
409 * - to mark the adj down and back walk so child load-balances drop this adj
411 * - update the next_node index of this adj to point to error-drop
412 * both of which will mean for MAC change we will drop for this adj
413 * which is not acceptable. However, when the adj changes type (from
414 * complete to incomplete and vice-versa) the child DPOs, which have the
415 * VLIB graph next node index, will be sending packets to the wrong graph
416 * node. So from the options above, updating the next_node of the adj to
417 * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
418 * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
419 * (i.e. a rewrite adj in the arp node). This is not enforcable. Getting it
420 * wrong will lead to hard to find bugs since its a race condition. So we
421 * choose the more reliable method of updating the children to use the drop,
422 * then switching adj's type, then updating the children again. Did I mention
423 * that this doesn't happen often...
424 * So we need to distinguish between the two cases:
426 * 2 - adj type change
429 old_next != adj_next_index &&
430 ADJ_INDEX_INVALID != walk_ai)
433 * the adj is changing type. we need to fix all children so that they
434 * stack momentarily on a drop, while the adj changes. If we don't do
435 * this the children will send packets to a VLIB graph node that does
436 * not correspond to the adj's type - and it goes downhill from there.
438 fib_node_back_walk_ctx_t bw_ctx = {
439 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
441 * force this walk to be synchrous. if we don't and a node in the graph
442 * (a heavily shared path-list) chooses to back-ground the walk (make it
443 * async) then it will pause and we will do the adj update below, before
444 * all the children are updated. not good.
446 .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
449 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
453 * If we are just updating the MAC string of the adj (which we also can't
454 * do atomically), then we need to stop packets switching through the adj.
455 * We can't do that on a per-adj basis, so it's all the packets.
456 * If we are updating the type, and we walked back to the children above,
457 * then this barrier serves to flush the queues/frames.
459 vlib_worker_thread_barrier_sync(vm);
461 adj->lookup_next_index = adj_next_index;
466 * new rewrite provided.
467 * fill in the adj's rewrite string, and build the VLIB graph arc.
469 vnet_rewrite_set_data_internal(&adj->rewrite_header,
470 sizeof(adj->rewrite_data),
477 vnet_rewrite_clear_data_internal(&adj->rewrite_header,
478 sizeof(adj->rewrite_data));
480 adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
485 * done with the rewirte update - let the workers loose.
487 vlib_worker_thread_barrier_release(vm);
490 (old_next != adj->lookup_next_index) &&
491 (ADJ_INDEX_INVALID != walk_ai))
494 * backwalk to the children so they can stack on the now updated
497 fib_node_back_walk_ctx_t bw_ctx = {
498 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE,
501 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
504 * Prevent re-entrant walk of the same adj
508 walk_adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
511 adj_unlock(adj_get_index(adj));
515 typedef struct adj_db_count_ctx_t_ {
517 } adj_db_count_ctx_t;
520 adj_db_count (BVT(clib_bihash_kv) * kvp,
523 adj_db_count_ctx_t * ctx = arg;
528 adj_nbr_db_size (void)
530 adj_db_count_ctx_t ctx = {
533 fib_protocol_t proto;
536 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
538 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
540 if (NULL != adj_nbr_tables[proto][sw_if_index])
542 BV(clib_bihash_foreach_key_value_pair) (
543 adj_nbr_tables[proto][sw_if_index],
553 * @brief Context for a walk of the adjacency neighbour DB
555 typedef struct adj_walk_ctx_t_
557 adj_walk_cb_t awc_cb;
562 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
565 adj_walk_ctx_t *ctx = arg;
567 // FIXME: can't stop early...
568 ctx->awc_cb(kvp->value, ctx->awc_ctx);
572 adj_nbr_walk (u32 sw_if_index,
573 fib_protocol_t adj_nh_proto,
577 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
580 adj_walk_ctx_t awc = {
585 BV(clib_bihash_foreach_key_value_pair) (
586 adj_nbr_tables[adj_nh_proto][sw_if_index],
592 * @brief Walk adjacencies on a link with a given v4 next-hop.
593 * that is visit the adjacencies with different link types.
596 adj_nbr_walk_nh4 (u32 sw_if_index,
597 const ip4_address_t *addr,
601 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
604 ip46_address_t nh = {
610 FOR_EACH_VNET_LINK(linkt)
612 ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, &nh, sw_if_index);
614 if (INDEX_INVALID != ai)
620 * @brief Walk adjacencies on a link with a given v6 next-hop.
621 * that is visit the adjacencies with different link types.
624 adj_nbr_walk_nh6 (u32 sw_if_index,
625 const ip6_address_t *addr,
629 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
632 ip46_address_t nh = {
638 FOR_EACH_VNET_LINK(linkt)
640 ai = adj_nbr_find (FIB_PROTOCOL_IP6, linkt, &nh, sw_if_index);
642 if (INDEX_INVALID != ai)
648 * @brief Walk adjacencies on a link with a given next-hop.
649 * that is visit the adjacencies with different link types.
652 adj_nbr_walk_nh (u32 sw_if_index,
653 fib_protocol_t adj_nh_proto,
654 const ip46_address_t *nh,
658 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
664 FOR_EACH_VNET_LINK(linkt)
666 ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, nh, sw_if_index);
668 if (INDEX_INVALID != ai)
674 * Flags associated with the interface state walks
676 typedef enum adj_nbr_interface_flags_t_
678 ADJ_NBR_INTERFACE_UP = (1 << 0),
679 } adj_nbr_interface_flags_t;
682 * Context for the state change walk of the DB
684 typedef struct adj_nbr_interface_state_change_ctx_t_
687 * Flags on the interface
689 adj_nbr_interface_flags_t flags;
690 } adj_nbr_interface_state_change_ctx_t;
693 adj_nbr_interface_state_change_one (adj_index_t ai,
697 * Back walk the graph to inform the forwarding entries
698 * that this interface state has changed. Do this synchronously
699 * since this is the walk that provides convergence
701 adj_nbr_interface_state_change_ctx_t *ctx = arg;
702 fib_node_back_walk_ctx_t bw_ctx = {
703 .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
704 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP :
705 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN),
707 * the force sync applies only as far as the first fib_entry.
708 * And it's the fib_entry's we need to converge away from
709 * the adjacencies on the now down link
711 .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
712 FIB_NODE_BW_FLAG_FORCE_SYNC :
713 FIB_NODE_BW_FLAG_NONE),
719 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
720 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
721 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
723 return (ADJ_WALK_RC_CONTINUE);
727 * @brief Registered function for SW interface state changes
729 static clib_error_t *
730 adj_nbr_sw_interface_state_change (vnet_main_t * vnm,
734 fib_protocol_t proto;
737 * walk each adj on the interface and trigger a walk from that adj
739 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
741 adj_nbr_interface_state_change_ctx_t ctx = {
742 .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
743 ADJ_NBR_INTERFACE_UP :
747 adj_nbr_walk(sw_if_index, proto,
748 adj_nbr_interface_state_change_one,
755 VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(
756 adj_nbr_sw_interface_state_change,
757 VNET_ITF_FUNC_PRIORITY_HIGH);
760 * @brief Invoked on each SW interface of a HW interface when the
761 * HW interface state changes
764 adj_nbr_hw_sw_interface_state_change (vnet_main_t * vnm,
768 adj_nbr_interface_state_change_ctx_t *ctx = arg;
769 fib_protocol_t proto;
772 * walk each adj on the interface and trigger a walk from that adj
774 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
776 adj_nbr_walk(sw_if_index, proto,
777 adj_nbr_interface_state_change_one,
780 return (WALK_CONTINUE);
784 * @brief Registered callback for HW interface state changes
786 static clib_error_t *
787 adj_nbr_hw_interface_state_change (vnet_main_t * vnm,
792 * walk SW interface on the HW
794 adj_nbr_interface_state_change_ctx_t ctx = {
795 .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
796 ADJ_NBR_INTERFACE_UP :
800 vnet_hw_interface_walk_sw(vnm, hw_if_index,
801 adj_nbr_hw_sw_interface_state_change,
807 VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(
808 adj_nbr_hw_interface_state_change,
809 VNET_ITF_FUNC_PRIORITY_HIGH);
812 adj_nbr_interface_delete_one (adj_index_t ai,
816 * Back walk the graph to inform the forwarding entries
817 * that this interface has been deleted.
819 fib_node_back_walk_ctx_t bw_ctx = {
820 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE,
826 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
827 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
828 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
830 return (ADJ_WALK_RC_CONTINUE);
834 * adj_nbr_interface_add_del
836 * Registered to receive interface Add and delete notifications
838 static clib_error_t *
839 adj_nbr_interface_add_del (vnet_main_t * vnm,
843 fib_protocol_t proto;
848 * not interested in interface additions. we will not back walk
849 * to resolve paths through newly added interfaces. Why? The control
850 * plane should have the brains to add interfaces first, then routes.
851 * So the case where there are paths with a interface that matches
852 * one just created is the case where the path resolved through an
853 * interface that was deleted, and still has not been removed. The
854 * new interface added, is NO GUARANTEE that the interface being
855 * added now, even though it may have the same sw_if_index, is the
856 * same interface that the path needs. So tough!
857 * If the control plane wants these routes to resolve it needs to
858 * remove and add them again.
863 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
865 adj_nbr_walk(sw_if_index, proto,
866 adj_nbr_interface_delete_one,
874 VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del);
878 adj_nbr_show_one (adj_index_t ai,
881 vlib_cli_output (arg, "[@%d] %U",
883 format_ip_adjacency, ai,
884 FORMAT_IP_ADJACENCY_NONE);
886 return (ADJ_WALK_RC_CONTINUE);
889 static clib_error_t *
890 adj_nbr_show (vlib_main_t * vm,
891 unformat_input_t * input,
892 vlib_cli_command_t * cmd)
894 adj_index_t ai = ADJ_INDEX_INVALID;
895 u32 sw_if_index = ~0;
897 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
899 if (unformat (input, "%d", &ai))
901 else if (unformat (input, "%U",
902 unformat_vnet_sw_interface, vnet_get_main(),
909 if (ADJ_INDEX_INVALID != ai)
911 vlib_cli_output (vm, "[@%d] %U",
913 format_ip_adjacency, ai,
914 FORMAT_IP_ADJACENCY_DETAIL);
916 else if (~0 != sw_if_index)
918 fib_protocol_t proto;
920 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
922 adj_nbr_walk(sw_if_index, proto,
929 fib_protocol_t proto;
931 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
933 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
935 adj_nbr_walk(sw_if_index, proto,
946 * Show all neighbour adjacencies.
948 * @cliexstart{sh adj nbr}
949 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
950 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
951 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
952 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
955 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
956 .path = "show adj nbr",
957 .short_help = "show adj nbr [<adj_index>] [interface]",
958 .function = adj_nbr_show,
962 format_adj_nbr_incomplete (u8* s, va_list *ap)
964 index_t index = va_arg(*ap, index_t);
965 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
966 vnet_main_t * vnm = vnet_get_main();
967 ip_adjacency_t * adj = adj_get(index);
969 s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
970 s = format (s, ": via %U",
971 format_ip46_address, &adj->sub_type.nbr.next_hop,
972 adj_proto_to_46(adj->ia_nh_proto));
973 s = format (s, " %U",
974 format_vnet_sw_if_index_name,
975 vnm, adj->rewrite_header.sw_if_index);
981 format_adj_nbr (u8* s, va_list *ap)
983 index_t index = va_arg(*ap, index_t);
984 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
985 ip_adjacency_t * adj = adj_get(index);
987 s = format (s, "%U", format_vnet_link, adj->ia_link);
988 s = format (s, " via %U ",
989 format_ip46_address, &adj->sub_type.nbr.next_hop,
990 adj_proto_to_46(adj->ia_nh_proto));
993 &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
999 adj_dpo_lock (dpo_id_t *dpo)
1001 adj_lock(dpo->dpoi_index);
1004 adj_dpo_unlock (dpo_id_t *dpo)
1006 adj_unlock(dpo->dpoi_index);
1012 fib_show_memory_usage("Adjacency",
1013 pool_elts(adj_pool),
1015 sizeof(ip_adjacency_t));
1018 const static dpo_vft_t adj_nbr_dpo_vft = {
1019 .dv_lock = adj_dpo_lock,
1020 .dv_unlock = adj_dpo_unlock,
1021 .dv_format = format_adj_nbr,
1022 .dv_mem_show = adj_mem_show,
1023 .dv_get_urpf = adj_dpo_get_urpf,
1025 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1026 .dv_lock = adj_dpo_lock,
1027 .dv_unlock = adj_dpo_unlock,
1028 .dv_format = format_adj_nbr_incomplete,
1029 .dv_get_urpf = adj_dpo_get_urpf,
1033 * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1036 * this means that these graph nodes are ones from which a nbr is the
1037 * parent object in the DPO-graph.
1039 const static char* const nbr_ip4_nodes[] =
1044 const static char* const nbr_ip6_nodes[] =
1049 const static char* const nbr_mpls_nodes[] =
1054 const static char* const nbr_ethernet_nodes[] =
1059 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1061 [DPO_PROTO_IP4] = nbr_ip4_nodes,
1062 [DPO_PROTO_IP6] = nbr_ip6_nodes,
1063 [DPO_PROTO_MPLS] = nbr_mpls_nodes,
1064 [DPO_PROTO_ETHERNET] = nbr_ethernet_nodes,
1067 const static char* const nbr_incomplete_ip4_nodes[] =
1072 const static char* const nbr_incomplete_ip6_nodes[] =
1074 "ip6-discover-neighbor",
1077 const static char* const nbr_incomplete_mpls_nodes[] =
1079 "mpls-adj-incomplete",
1083 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1085 [DPO_PROTO_IP4] = nbr_incomplete_ip4_nodes,
1086 [DPO_PROTO_IP6] = nbr_incomplete_ip6_nodes,
1087 [DPO_PROTO_MPLS] = nbr_incomplete_mpls_nodes,
1091 adj_nbr_module_init (void)
1093 dpo_register(DPO_ADJACENCY,
1096 dpo_register(DPO_ADJACENCY_INCOMPLETE,
1097 &adj_nbr_incompl_dpo_vft,
1098 nbr_incomplete_nodes);