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>
21 #include <vppinfra/bihash_24_8.h>
24 * Vector Hash tables of neighbour (traditional) adjacencies
25 * Key: interface(for the vector index), address (and its proto),
26 * link-type/ether-type.
28 static BVT(clib_bihash) **adj_nbr_tables[FIB_PROTOCOL_MAX];
30 // FIXME SIZE APPROPRIATELY. ASK DAVEB.
31 #define ADJ_NBR_DEFAULT_HASH_NUM_BUCKETS (64 * 64)
32 #define ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE (32<<20)
35 #define ADJ_NBR_SET_KEY(_key, _lt, _nh) \
37 _key.key[0] = (_nh)->as_u64[0]; \
38 _key.key[1] = (_nh)->as_u64[1]; \
39 _key.key[2] = (_lt); \
42 #define ADJ_NBR_ITF_OK(_proto, _itf) \
43 (((_itf) < vec_len(adj_nbr_tables[_proto])) && \
44 (NULL != adj_nbr_tables[_proto][sw_if_index]))
47 adj_nbr_insert (fib_protocol_t nh_proto,
48 vnet_link_t link_type,
49 const ip46_address_t *nh_addr,
51 adj_index_t adj_index)
53 BVT(clib_bihash_kv) kv;
55 if (sw_if_index >= vec_len(adj_nbr_tables[nh_proto]))
57 vec_validate(adj_nbr_tables[nh_proto], sw_if_index);
59 if (NULL == adj_nbr_tables[nh_proto][sw_if_index])
61 adj_nbr_tables[nh_proto][sw_if_index] =
62 clib_mem_alloc_aligned(sizeof(BVT(clib_bihash)),
63 CLIB_CACHE_LINE_BYTES);
64 clib_memset(adj_nbr_tables[nh_proto][sw_if_index],
66 sizeof(BVT(clib_bihash)));
68 BV(clib_bihash_init) (adj_nbr_tables[nh_proto][sw_if_index],
69 "Adjacency Neighbour table",
70 ADJ_NBR_DEFAULT_HASH_NUM_BUCKETS,
71 ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE);
74 ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
77 BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 1);
81 adj_nbr_remove (adj_index_t ai,
82 fib_protocol_t nh_proto,
83 vnet_link_t link_type,
84 const ip46_address_t *nh_addr,
87 BVT(clib_bihash_kv) kv;
89 if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
92 ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
95 BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 0);
99 adj_nbr_find (fib_protocol_t nh_proto,
100 vnet_link_t link_type,
101 const ip46_address_t *nh_addr,
104 BVT(clib_bihash_kv) kv;
106 ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
108 if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
109 return (ADJ_INDEX_INVALID);
111 if (BV(clib_bihash_search)(adj_nbr_tables[nh_proto][sw_if_index],
114 return (ADJ_INDEX_INVALID);
123 adj_get_nd_node (fib_protocol_t proto)
126 case FIB_PROTOCOL_IP4:
127 return (ip4_arp_node.index);
128 case FIB_PROTOCOL_IP6:
129 return (ip6_discover_neighbor_node.index);
130 case FIB_PROTOCOL_MPLS:
134 return (ip4_arp_node.index);
138 * @brief Check and set feature flags if o/p interface has any o/p features.
141 adj_nbr_evaluate_feature (adj_index_t ai)
144 vnet_feature_main_t *fm = &feature_main;
151 switch (adj->ia_link)
154 arc_index = ip4_main.lookup_main.output_feature_arc_index;
157 arc_index = ip6_main.lookup_main.output_feature_arc_index;
160 arc_index = mpls_main.output_feature_arc_index;
166 sw_if_index = adj->rewrite_header.sw_if_index;
167 if (vec_len(fm->feature_count_by_sw_if_index[arc_index]) > sw_if_index)
169 feature_count = fm->feature_count_by_sw_if_index[arc_index][sw_if_index];
170 if (feature_count > 0)
172 vnet_feature_config_main_t *cm;
174 adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
175 cm = &fm->feature_config_mains[arc_index];
177 adj->ia_cfg_index = vec_elt (cm->config_index_by_sw_if_index,
184 static ip_adjacency_t*
185 adj_nbr_alloc (fib_protocol_t nh_proto,
186 vnet_link_t link_type,
187 const ip46_address_t *nh_addr,
192 adj = adj_alloc(nh_proto);
194 adj_nbr_insert(nh_proto, link_type, nh_addr,
199 * since we just added the ADJ we have no rewrite string for it,
202 adj->lookup_next_index = IP_LOOKUP_NEXT_ARP;
203 adj->sub_type.nbr.next_hop = *nh_addr;
204 adj->ia_link = link_type;
205 adj->ia_nh_proto = nh_proto;
206 adj->rewrite_header.sw_if_index = sw_if_index;
207 vnet_rewrite_update_mtu(vnet_get_main(), adj->ia_link,
208 &adj->rewrite_header);
210 adj_nbr_evaluate_feature (adj_get_index(adj));
215 * adj_nbr_add_or_lock
217 * Add an adjacency for the neighbour requested.
219 * The key for an adj is:
220 * - the Next-hops protocol (i.e. v4 or v6)
221 * - the address of the next-hop
222 * - the interface the next-hop is reachable through
225 adj_nbr_add_or_lock (fib_protocol_t nh_proto,
226 vnet_link_t link_type,
227 const ip46_address_t *nh_addr,
230 adj_index_t adj_index;
232 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
234 if (ADJ_INDEX_INVALID == adj_index)
239 vnm = vnet_get_main();
240 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
241 adj_index = adj_get_index(adj);
244 if (ip46_address_is_equal(&ADJ_BCAST_ADDR, nh_addr))
246 adj->lookup_next_index = IP_LOOKUP_NEXT_BCAST;
249 vnet_rewrite_init(vnm, sw_if_index, link_type,
250 adj_get_nd_node(nh_proto),
251 vnet_tx_node_index_for_sw_interface(vnm, sw_if_index),
252 &adj->rewrite_header);
255 * we need a rewrite where the destination IP address is converted
256 * to the appropriate link-layer address. This is interface specific.
257 * So ask the interface to do it.
259 vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
266 adj_delegate_adj_created(adj_get(adj_index));
271 adj_nbr_add_or_lock_w_rewrite (fib_protocol_t nh_proto,
272 vnet_link_t link_type,
273 const ip46_address_t *nh_addr,
277 adj_index_t adj_index;
279 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
281 if (ADJ_INDEX_INVALID == adj_index)
285 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
286 adj->rewrite_header.sw_if_index = sw_if_index;
287 adj_index = adj_get_index(adj);
291 adj_nbr_update_rewrite(adj_index,
292 ADJ_NBR_REWRITE_FLAG_COMPLETE,
295 adj_delegate_adj_created(adj_get(adj_index));
301 * adj_nbr_update_rewrite
303 * Update the adjacency's rewrite string. A NULL string implies the
304 * rewrite is reset (i.e. when ARP/ND entry is gone).
305 * NB: the adj being updated may be handling traffic in the DP.
308 adj_nbr_update_rewrite (adj_index_t adj_index,
309 adj_nbr_rewrite_flag_t flags,
314 ASSERT(ADJ_INDEX_INVALID != adj_index);
316 adj = adj_get(adj_index);
318 if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
321 * update the adj's rewrite string and build the arc
322 * from the rewrite node to the interface's TX node
324 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_REWRITE,
325 adj_get_rewrite_node(adj->ia_link),
326 vnet_tx_node_index_for_sw_interface(
328 adj->rewrite_header.sw_if_index),
333 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_ARP,
334 adj_get_nd_node(adj->ia_nh_proto),
335 vnet_tx_node_index_for_sw_interface(
337 adj->rewrite_header.sw_if_index),
343 * adj_nbr_update_rewrite_internal
345 * Update the adjacency's rewrite string. A NULL string implies the
346 * rewrite is reset (i.e. when ARP/ND entry is gone).
347 * NB: the adj being updated may be handling traffic in the DP.
350 adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
351 ip_lookup_next_t adj_next_index,
356 ip_adjacency_t *walk_adj;
357 adj_index_t walk_ai, ai;
362 vm = vlib_get_main();
363 old_next = adj->lookup_next_index;
365 ai = walk_ai = adj_get_index(adj);
366 if (VNET_LINK_MPLS == adj->ia_link)
369 * The link type MPLS has no children in the control plane graph, it only
370 * has children in the data-plane graph. The backwalk is up the former.
371 * So we need to walk from its IP cousin.
373 walk_ai = adj_nbr_find(adj->ia_nh_proto,
374 fib_proto_to_link(adj->ia_nh_proto),
375 &adj->sub_type.nbr.next_hop,
376 adj->rewrite_header.sw_if_index);
380 * Don't call the walk re-entrantly
382 if (ADJ_INDEX_INVALID != walk_ai)
384 walk_adj = adj_get(walk_ai);
385 if (ADJ_FLAG_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
392 * Prevent re-entrant walk of the same adj
394 walk_adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
404 * lock the adjacencies that are affected by updates this walk will provoke.
405 * Since the aim of the walk is to update children to link to a different
406 * DPO, this adj will no longer be in use and its lock count will drop to 0.
407 * We don't want it to be deleted as part of this endeavour.
413 * Updating a rewrite string is not atomic;
414 * - the rewrite string is too long to write in one instruction
415 * - when swapping from incomplete to complete, we also need to update
416 * the VLIB graph next-index of the adj.
417 * ideally we would only want to suspend forwarding via this adj whilst we
418 * do this, but we do not have that level of granularity - it's suspend all
419 * worker threads or nothing.
420 * The other choices are:
421 * - to mark the adj down and back walk so child load-balances drop this adj
423 * - update the next_node index of this adj to point to error-drop
424 * both of which will mean for MAC change we will drop for this adj
425 * which is not acceptable. However, when the adj changes type (from
426 * complete to incomplete and vice-versa) the child DPOs, which have the
427 * VLIB graph next node index, will be sending packets to the wrong graph
428 * node. So from the options above, updating the next_node of the adj to
429 * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
430 * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
431 * (i.e. a rewrite adj in the arp node). This is not enforceable. Getting it
432 * wrong will lead to hard to find bugs since its a race condition. So we
433 * choose the more reliable method of updating the children to use the drop,
434 * then switching adj's type, then updating the children again. Did I mention
435 * that this doesn't happen often...
436 * So we need to distinguish between the two cases:
438 * 2 - adj type change
441 old_next != adj_next_index &&
442 ADJ_INDEX_INVALID != walk_ai)
445 * the adj is changing type. we need to fix all children so that they
446 * stack momentarily on a drop, while the adj changes. If we don't do
447 * this the children will send packets to a VLIB graph node that does
448 * not correspond to the adj's type - and it goes downhill from there.
450 fib_node_back_walk_ctx_t bw_ctx = {
451 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
453 * force this walk to be synchronous. if we don't and a node in the graph
454 * (a heavily shared path-list) chooses to back-ground the walk (make it
455 * async) then it will pause and we will do the adj update below, before
456 * all the children are updated. not good.
458 .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
461 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
463 * fib_walk_sync may allocate a new adjacency and potentially cuase a
464 * realloc for adj_pool. When that happens, adj pointer is no longer
465 * valid here. We refresh the adj pointer accordingly.
471 * If we are just updating the MAC string of the adj (which we also can't
472 * do atomically), then we need to stop packets switching through the adj.
473 * We can't do that on a per-adj basis, so it's all the packets.
474 * If we are updating the type, and we walked back to the children above,
475 * then this barrier serves to flush the queues/frames.
477 vlib_worker_thread_barrier_sync(vm);
479 adj->lookup_next_index = adj_next_index;
480 adj->ia_node_index = this_node;
485 * new rewrite provided.
486 * fill in the adj's rewrite string, and build the VLIB graph arc.
488 vnet_rewrite_set_data_internal(&adj->rewrite_header,
489 sizeof(adj->rewrite_data),
496 vnet_rewrite_clear_data_internal(&adj->rewrite_header,
497 sizeof(adj->rewrite_data));
499 adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
504 * done with the rewrite update - let the workers loose.
506 vlib_worker_thread_barrier_release(vm);
509 (old_next != adj->lookup_next_index) &&
510 (ADJ_INDEX_INVALID != walk_ai))
513 * backwalk to the children so they can stack on the now updated
516 fib_node_back_walk_ctx_t bw_ctx = {
517 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE,
520 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
523 * Prevent re-entrant walk of the same adj
527 walk_adj = adj_get(walk_ai);
528 walk_adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
531 adj_delegate_adj_modified(adj);
536 typedef struct adj_db_count_ctx_t_ {
538 } adj_db_count_ctx_t;
541 adj_db_count (BVT(clib_bihash_kv) * kvp,
544 adj_db_count_ctx_t * ctx = arg;
546 return (BIHASH_WALK_CONTINUE);
550 adj_nbr_db_size (void)
552 adj_db_count_ctx_t ctx = {
555 fib_protocol_t proto;
558 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
560 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
562 if (NULL != adj_nbr_tables[proto][sw_if_index])
564 BV(clib_bihash_foreach_key_value_pair) (
565 adj_nbr_tables[proto][sw_if_index],
575 * @brief Context for a walk of the adjacency neighbour DB
577 typedef struct adj_walk_ctx_t_
579 adj_walk_cb_t awc_cb;
584 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
587 adj_walk_ctx_t *ctx = arg;
589 if (ADJ_WALK_RC_STOP == ctx->awc_cb(kvp->value, ctx->awc_ctx))
590 return (BIHASH_WALK_STOP);
591 return (BIHASH_WALK_CONTINUE);
595 adj_nbr_walk (u32 sw_if_index,
596 fib_protocol_t adj_nh_proto,
600 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
603 adj_walk_ctx_t awc = {
608 BV(clib_bihash_foreach_key_value_pair) (
609 adj_nbr_tables[adj_nh_proto][sw_if_index],
615 * @brief Walk adjacencies on a link with a given v4 next-hop.
616 * that is visit the adjacencies with different link types.
619 adj_nbr_walk_nh4 (u32 sw_if_index,
620 const ip4_address_t *addr,
624 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
627 ip46_address_t nh = {
633 FOR_EACH_VNET_LINK(linkt)
635 ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, &nh, sw_if_index);
637 if (INDEX_INVALID != ai)
643 * @brief Walk adjacencies on a link with a given v6 next-hop.
644 * that is visit the adjacencies with different link types.
647 adj_nbr_walk_nh6 (u32 sw_if_index,
648 const ip6_address_t *addr,
652 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
655 ip46_address_t nh = {
661 FOR_EACH_VNET_LINK(linkt)
663 ai = adj_nbr_find (FIB_PROTOCOL_IP6, linkt, &nh, sw_if_index);
665 if (INDEX_INVALID != ai)
671 * @brief Walk adjacencies on a link with a given next-hop.
672 * that is visit the adjacencies with different link types.
675 adj_nbr_walk_nh (u32 sw_if_index,
676 fib_protocol_t adj_nh_proto,
677 const ip46_address_t *nh,
681 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
684 switch (adj_nh_proto)
686 case FIB_PROTOCOL_IP4:
687 adj_nbr_walk_nh4(sw_if_index, &nh->ip4, cb, ctx);
689 case FIB_PROTOCOL_IP6:
690 adj_nbr_walk_nh6(sw_if_index, &nh->ip6, cb, ctx);
692 case FIB_PROTOCOL_MPLS:
699 * Flags associated with the interface state walks
701 typedef enum adj_nbr_interface_flags_t_
703 ADJ_NBR_INTERFACE_UP = (1 << 0),
704 } adj_nbr_interface_flags_t;
707 * Context for the state change walk of the DB
709 typedef struct adj_nbr_interface_state_change_ctx_t_
712 * Flags on the interface
714 adj_nbr_interface_flags_t flags;
715 } adj_nbr_interface_state_change_ctx_t;
718 adj_nbr_interface_state_change_one (adj_index_t ai,
722 * Back walk the graph to inform the forwarding entries
723 * that this interface state has changed. Do this synchronously
724 * since this is the walk that provides convergence
726 adj_nbr_interface_state_change_ctx_t *ctx = arg;
727 fib_node_back_walk_ctx_t bw_ctx = {
728 .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
729 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP :
730 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN),
732 * the force sync applies only as far as the first fib_entry.
733 * And it's the fib_entry's we need to converge away from
734 * the adjacencies on the now down link
736 .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
737 FIB_NODE_BW_FLAG_FORCE_SYNC :
738 FIB_NODE_BW_FLAG_NONE),
744 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
745 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
746 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
748 return (ADJ_WALK_RC_CONTINUE);
752 * @brief Registered function for SW interface state changes
754 static clib_error_t *
755 adj_nbr_sw_interface_state_change (vnet_main_t * vnm,
759 fib_protocol_t proto;
762 * walk each adj on the interface and trigger a walk from that adj
764 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
766 adj_nbr_interface_state_change_ctx_t ctx = {
767 .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
768 ADJ_NBR_INTERFACE_UP :
772 adj_nbr_walk(sw_if_index, proto,
773 adj_nbr_interface_state_change_one,
780 VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(
781 adj_nbr_sw_interface_state_change,
782 VNET_ITF_FUNC_PRIORITY_HIGH);
785 * @brief Invoked on each SW interface of a HW interface when the
786 * HW interface state changes
789 adj_nbr_hw_sw_interface_state_change (vnet_main_t * vnm,
793 adj_nbr_interface_state_change_ctx_t *ctx = arg;
794 fib_protocol_t proto;
797 * walk each adj on the interface and trigger a walk from that adj
799 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
801 adj_nbr_walk(sw_if_index, proto,
802 adj_nbr_interface_state_change_one,
805 return (WALK_CONTINUE);
809 * @brief Registered callback for HW interface state changes
811 static clib_error_t *
812 adj_nbr_hw_interface_state_change (vnet_main_t * vnm,
817 * walk SW interface on the HW
819 adj_nbr_interface_state_change_ctx_t ctx = {
820 .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
821 ADJ_NBR_INTERFACE_UP :
825 vnet_hw_interface_walk_sw(vnm, hw_if_index,
826 adj_nbr_hw_sw_interface_state_change,
832 VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(
833 adj_nbr_hw_interface_state_change,
834 VNET_ITF_FUNC_PRIORITY_HIGH);
837 adj_nbr_interface_delete_one (adj_index_t ai,
841 * Back walk the graph to inform the forwarding entries
842 * that this interface has been deleted.
844 fib_node_back_walk_ctx_t bw_ctx = {
845 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE,
853 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
854 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
855 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
858 return (ADJ_WALK_RC_CONTINUE);
862 * adj_nbr_interface_add_del
864 * Registered to receive interface Add and delete notifications
866 static clib_error_t *
867 adj_nbr_interface_add_del (vnet_main_t * vnm,
871 fib_protocol_t proto;
876 * not interested in interface additions. we will not back walk
877 * to resolve paths through newly added interfaces. Why? The control
878 * plane should have the brains to add interfaces first, then routes.
879 * So the case where there are paths with a interface that matches
880 * one just created is the case where the path resolved through an
881 * interface that was deleted, and still has not been removed. The
882 * new interface added, is NO GUARANTEE that the interface being
883 * added now, even though it may have the same sw_if_index, is the
884 * same interface that the path needs. So tough!
885 * If the control plane wants these routes to resolve it needs to
886 * remove and add them again.
891 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
893 adj_nbr_walk(sw_if_index, proto,
894 adj_nbr_interface_delete_one,
902 VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del);
906 adj_nbr_show_one (adj_index_t ai,
909 vlib_cli_output (arg, "[@%d] %U",
911 format_ip_adjacency, ai,
912 FORMAT_IP_ADJACENCY_NONE);
914 return (ADJ_WALK_RC_CONTINUE);
917 static clib_error_t *
918 adj_nbr_show (vlib_main_t * vm,
919 unformat_input_t * input,
920 vlib_cli_command_t * cmd)
922 adj_index_t ai = ADJ_INDEX_INVALID;
923 ip46_address_t nh = ip46_address_initializer;
924 u32 sw_if_index = ~0;
926 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
928 if (unformat (input, "%U",
929 unformat_vnet_sw_interface, vnet_get_main(),
932 else if (unformat (input, "%U",
933 unformat_ip46_address, &nh, IP46_TYPE_ANY))
935 else if (unformat (input, "%d", &ai))
941 if (ADJ_INDEX_INVALID != ai)
943 vlib_cli_output (vm, "[@%d] %U",
945 format_ip_adjacency, ai,
946 FORMAT_IP_ADJACENCY_DETAIL);
948 else if (~0 != sw_if_index)
950 fib_protocol_t proto;
952 if (ip46_address_is_zero(&nh))
954 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
956 adj_nbr_walk(sw_if_index, proto,
963 proto = (ip46_address_is_ip4(&nh) ?
966 adj_nbr_walk_nh(sw_if_index, proto, &nh,
973 fib_protocol_t proto;
975 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
977 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
979 adj_nbr_walk(sw_if_index, proto,
990 * Show all neighbour adjacencies.
992 * @cliexstart{sh adj nbr}
993 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
994 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
995 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
996 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
999 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
1000 .path = "show adj nbr",
1001 .short_help = "show adj nbr [<adj_index>] [interface]",
1002 .function = adj_nbr_show,
1006 format_adj_nbr_incomplete (u8* s, va_list *ap)
1008 index_t index = va_arg(*ap, index_t);
1009 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
1010 vnet_main_t * vnm = vnet_get_main();
1011 ip_adjacency_t * adj = adj_get(index);
1013 s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
1014 s = format (s, ": via %U",
1015 format_ip46_address, &adj->sub_type.nbr.next_hop,
1016 adj_proto_to_46(adj->ia_nh_proto));
1017 s = format (s, " %U",
1018 format_vnet_sw_if_index_name,
1019 vnm, adj->rewrite_header.sw_if_index);
1025 format_adj_nbr (u8* s, va_list *ap)
1027 index_t index = va_arg(*ap, index_t);
1028 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
1029 ip_adjacency_t * adj = adj_get(index);
1031 s = format (s, "%U", format_vnet_link, adj->ia_link);
1032 s = format (s, " via %U ",
1033 format_ip46_address, &adj->sub_type.nbr.next_hop,
1034 adj_proto_to_46(adj->ia_nh_proto));
1035 s = format (s, "%U",
1036 format_vnet_rewrite,
1037 &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
1043 adj_dpo_lock (dpo_id_t *dpo)
1045 adj_lock(dpo->dpoi_index);
1048 adj_dpo_unlock (dpo_id_t *dpo)
1050 adj_unlock(dpo->dpoi_index);
1056 fib_show_memory_usage("Adjacency",
1057 pool_elts(adj_pool),
1059 sizeof(ip_adjacency_t));
1062 const static dpo_vft_t adj_nbr_dpo_vft = {
1063 .dv_lock = adj_dpo_lock,
1064 .dv_unlock = adj_dpo_unlock,
1065 .dv_format = format_adj_nbr,
1066 .dv_mem_show = adj_mem_show,
1067 .dv_get_urpf = adj_dpo_get_urpf,
1069 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1070 .dv_lock = adj_dpo_lock,
1071 .dv_unlock = adj_dpo_unlock,
1072 .dv_format = format_adj_nbr_incomplete,
1073 .dv_get_urpf = adj_dpo_get_urpf,
1077 * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1080 * this means that these graph nodes are ones from which a nbr is the
1081 * parent object in the DPO-graph.
1083 const static char* const nbr_ip4_nodes[] =
1088 const static char* const nbr_ip6_nodes[] =
1093 const static char* const nbr_mpls_nodes[] =
1098 const static char* const nbr_ethernet_nodes[] =
1103 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1105 [DPO_PROTO_IP4] = nbr_ip4_nodes,
1106 [DPO_PROTO_IP6] = nbr_ip6_nodes,
1107 [DPO_PROTO_MPLS] = nbr_mpls_nodes,
1108 [DPO_PROTO_ETHERNET] = nbr_ethernet_nodes,
1111 const static char* const nbr_incomplete_ip4_nodes[] =
1116 const static char* const nbr_incomplete_ip6_nodes[] =
1118 "ip6-discover-neighbor",
1121 const static char* const nbr_incomplete_mpls_nodes[] =
1123 "mpls-adj-incomplete",
1127 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1129 [DPO_PROTO_IP4] = nbr_incomplete_ip4_nodes,
1130 [DPO_PROTO_IP6] = nbr_incomplete_ip6_nodes,
1131 [DPO_PROTO_MPLS] = nbr_incomplete_mpls_nodes,
1135 adj_nbr_module_init (void)
1137 dpo_register(DPO_ADJACENCY,
1140 dpo_register(DPO_ADJACENCY_INCOMPLETE,
1141 &adj_nbr_incompl_dpo_vft,
1142 nbr_incomplete_nodes);