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)
171 adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
177 static ip_adjacency_t*
178 adj_nbr_alloc (fib_protocol_t nh_proto,
179 vnet_link_t link_type,
180 const ip46_address_t *nh_addr,
185 adj = adj_alloc(nh_proto);
187 adj_nbr_insert(nh_proto, link_type, nh_addr,
192 * since we just added the ADJ we have no rewrite string for it,
195 adj->lookup_next_index = IP_LOOKUP_NEXT_ARP;
196 adj->sub_type.nbr.next_hop = *nh_addr;
197 adj->ia_link = link_type;
198 adj->ia_nh_proto = nh_proto;
199 adj->rewrite_header.sw_if_index = sw_if_index;
200 vnet_rewrite_update_mtu(vnet_get_main(), adj->ia_link,
201 &adj->rewrite_header);
203 adj_nbr_evaluate_feature (adj_get_index(adj));
208 * adj_nbr_add_or_lock
210 * Add an adjacency for the neighbour requested.
212 * The key for an adj is:
213 * - the Next-hops protocol (i.e. v4 or v6)
214 * - the address of the next-hop
215 * - the interface the next-hop is reachable through
218 adj_nbr_add_or_lock (fib_protocol_t nh_proto,
219 vnet_link_t link_type,
220 const ip46_address_t *nh_addr,
223 adj_index_t adj_index;
225 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
227 if (ADJ_INDEX_INVALID == adj_index)
232 vnm = vnet_get_main();
233 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
234 adj_index = adj_get_index(adj);
237 if (ip46_address_is_equal(&ADJ_BCAST_ADDR, nh_addr))
239 adj->lookup_next_index = IP_LOOKUP_NEXT_BCAST;
242 vnet_rewrite_init(vnm, sw_if_index, link_type,
243 adj_get_nd_node(nh_proto),
244 vnet_tx_node_index_for_sw_interface(vnm, sw_if_index),
245 &adj->rewrite_header);
248 * we need a rewrite where the destination IP address is converted
249 * to the appropriate link-layer address. This is interface specific.
250 * So ask the interface to do it.
252 vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
259 adj_delegate_adj_created(adj_get(adj_index));
264 adj_nbr_add_or_lock_w_rewrite (fib_protocol_t nh_proto,
265 vnet_link_t link_type,
266 const ip46_address_t *nh_addr,
270 adj_index_t adj_index;
272 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
274 if (ADJ_INDEX_INVALID == adj_index)
278 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
279 adj->rewrite_header.sw_if_index = sw_if_index;
280 adj_index = adj_get_index(adj);
284 adj_nbr_update_rewrite(adj_index,
285 ADJ_NBR_REWRITE_FLAG_COMPLETE,
288 adj_delegate_adj_created(adj_get(adj_index));
294 * adj_nbr_update_rewrite
296 * Update the adjacency's rewrite string. A NULL string implies the
297 * rewrite is reset (i.e. when ARP/ND entry is gone).
298 * NB: the adj being updated may be handling traffic in the DP.
301 adj_nbr_update_rewrite (adj_index_t adj_index,
302 adj_nbr_rewrite_flag_t flags,
307 ASSERT(ADJ_INDEX_INVALID != adj_index);
309 adj = adj_get(adj_index);
311 if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
314 * update the adj's rewrite string and build the arc
315 * from the rewrite node to the interface's TX node
317 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_REWRITE,
318 adj_get_rewrite_node(adj->ia_link),
319 vnet_tx_node_index_for_sw_interface(
321 adj->rewrite_header.sw_if_index),
326 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_ARP,
327 adj_get_nd_node(adj->ia_nh_proto),
328 vnet_tx_node_index_for_sw_interface(
330 adj->rewrite_header.sw_if_index),
336 * adj_nbr_update_rewrite_internal
338 * Update the adjacency's rewrite string. A NULL string implies the
339 * rewrite is reset (i.e. when ARP/ND entry is gone).
340 * NB: the adj being updated may be handling traffic in the DP.
343 adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
344 ip_lookup_next_t adj_next_index,
349 ip_adjacency_t *walk_adj;
355 vm = vlib_get_main();
356 old_next = adj->lookup_next_index;
358 walk_ai = adj_get_index(adj);
359 if (VNET_LINK_MPLS == adj->ia_link)
362 * The link type MPLS has no children in the control plane graph, it only
363 * has children in the data-plane graph. The backwalk is up the former.
364 * So we need to walk from its IP cousin.
366 walk_ai = adj_nbr_find(adj->ia_nh_proto,
367 fib_proto_to_link(adj->ia_nh_proto),
368 &adj->sub_type.nbr.next_hop,
369 adj->rewrite_header.sw_if_index);
373 * Don't call the walk re-entrantly
375 if (ADJ_INDEX_INVALID != walk_ai)
377 walk_adj = adj_get(walk_ai);
378 if (ADJ_FLAG_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
385 * Prevent re-entrant walk of the same adj
387 walk_adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
397 * lock the adjacencies that are affected by updates this walk will provoke.
398 * Since the aim of the walk is to update children to link to a different
399 * DPO, this adj will no longer be in use and its lock count will drop to 0.
400 * We don't want it to be deleted as part of this endeavour.
402 adj_lock(adj_get_index(adj));
406 * Updating a rewrite string is not atomic;
407 * - the rewrite string is too long to write in one instruction
408 * - when swapping from incomplete to complete, we also need to update
409 * the VLIB graph next-index of the adj.
410 * ideally we would only want to suspend forwarding via this adj whilst we
411 * do this, but we do not have that level of granularity - it's suspend all
412 * worker threads or nothing.
413 * The other choices are:
414 * - to mark the adj down and back walk so child load-balances drop this adj
416 * - update the next_node index of this adj to point to error-drop
417 * both of which will mean for MAC change we will drop for this adj
418 * which is not acceptable. However, when the adj changes type (from
419 * complete to incomplete and vice-versa) the child DPOs, which have the
420 * VLIB graph next node index, will be sending packets to the wrong graph
421 * node. So from the options above, updating the next_node of the adj to
422 * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
423 * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
424 * (i.e. a rewrite adj in the arp node). This is not enforceable. Getting it
425 * wrong will lead to hard to find bugs since its a race condition. So we
426 * choose the more reliable method of updating the children to use the drop,
427 * then switching adj's type, then updating the children again. Did I mention
428 * that this doesn't happen often...
429 * So we need to distinguish between the two cases:
431 * 2 - adj type change
434 old_next != adj_next_index &&
435 ADJ_INDEX_INVALID != walk_ai)
438 * the adj is changing type. we need to fix all children so that they
439 * stack momentarily on a drop, while the adj changes. If we don't do
440 * this the children will send packets to a VLIB graph node that does
441 * not correspond to the adj's type - and it goes downhill from there.
443 fib_node_back_walk_ctx_t bw_ctx = {
444 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
446 * force this walk to be synchronous. if we don't and a node in the graph
447 * (a heavily shared path-list) chooses to back-ground the walk (make it
448 * async) then it will pause and we will do the adj update below, before
449 * all the children are updated. not good.
451 .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
454 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
458 * If we are just updating the MAC string of the adj (which we also can't
459 * do atomically), then we need to stop packets switching through the adj.
460 * We can't do that on a per-adj basis, so it's all the packets.
461 * If we are updating the type, and we walked back to the children above,
462 * then this barrier serves to flush the queues/frames.
464 vlib_worker_thread_barrier_sync(vm);
466 adj->lookup_next_index = adj_next_index;
467 adj->ia_node_index = this_node;
472 * new rewrite provided.
473 * fill in the adj's rewrite string, and build the VLIB graph arc.
475 vnet_rewrite_set_data_internal(&adj->rewrite_header,
476 sizeof(adj->rewrite_data),
483 vnet_rewrite_clear_data_internal(&adj->rewrite_header,
484 sizeof(adj->rewrite_data));
486 adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
491 * done with the rewrite update - let the workers loose.
493 vlib_worker_thread_barrier_release(vm);
496 (old_next != adj->lookup_next_index) &&
497 (ADJ_INDEX_INVALID != walk_ai))
500 * backwalk to the children so they can stack on the now updated
503 fib_node_back_walk_ctx_t bw_ctx = {
504 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE,
507 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
510 * Prevent re-entrant walk of the same adj
514 walk_adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
517 adj_unlock(adj_get_index(adj));
521 typedef struct adj_db_count_ctx_t_ {
523 } adj_db_count_ctx_t;
526 adj_db_count (BVT(clib_bihash_kv) * kvp,
529 adj_db_count_ctx_t * ctx = arg;
531 return (BIHASH_WALK_CONTINUE);
535 adj_nbr_db_size (void)
537 adj_db_count_ctx_t ctx = {
540 fib_protocol_t proto;
543 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
545 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
547 if (NULL != adj_nbr_tables[proto][sw_if_index])
549 BV(clib_bihash_foreach_key_value_pair) (
550 adj_nbr_tables[proto][sw_if_index],
560 * @brief Context for a walk of the adjacency neighbour DB
562 typedef struct adj_walk_ctx_t_
564 adj_walk_cb_t awc_cb;
569 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
572 adj_walk_ctx_t *ctx = arg;
574 // FIXME: can't stop early...
575 if (ADJ_WALK_RC_STOP == ctx->awc_cb(kvp->value, ctx->awc_ctx))
576 return (BIHASH_WALK_STOP);
577 return (BIHASH_WALK_CONTINUE);
581 adj_nbr_walk (u32 sw_if_index,
582 fib_protocol_t adj_nh_proto,
586 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
589 adj_walk_ctx_t awc = {
594 BV(clib_bihash_foreach_key_value_pair) (
595 adj_nbr_tables[adj_nh_proto][sw_if_index],
601 * @brief Walk adjacencies on a link with a given v4 next-hop.
602 * that is visit the adjacencies with different link types.
605 adj_nbr_walk_nh4 (u32 sw_if_index,
606 const ip4_address_t *addr,
610 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
613 ip46_address_t nh = {
619 FOR_EACH_VNET_LINK(linkt)
621 ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, &nh, sw_if_index);
623 if (INDEX_INVALID != ai)
629 * @brief Walk adjacencies on a link with a given v6 next-hop.
630 * that is visit the adjacencies with different link types.
633 adj_nbr_walk_nh6 (u32 sw_if_index,
634 const ip6_address_t *addr,
638 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
641 ip46_address_t nh = {
647 FOR_EACH_VNET_LINK(linkt)
649 ai = adj_nbr_find (FIB_PROTOCOL_IP6, linkt, &nh, sw_if_index);
651 if (INDEX_INVALID != ai)
657 * @brief Walk adjacencies on a link with a given next-hop.
658 * that is visit the adjacencies with different link types.
661 adj_nbr_walk_nh (u32 sw_if_index,
662 fib_protocol_t adj_nh_proto,
663 const ip46_address_t *nh,
667 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
670 switch (adj_nh_proto)
672 case FIB_PROTOCOL_IP4:
673 adj_nbr_walk_nh4(sw_if_index, &nh->ip4, cb, ctx);
675 case FIB_PROTOCOL_IP6:
676 adj_nbr_walk_nh6(sw_if_index, &nh->ip6, cb, ctx);
678 case FIB_PROTOCOL_MPLS:
685 * Flags associated with the interface state walks
687 typedef enum adj_nbr_interface_flags_t_
689 ADJ_NBR_INTERFACE_UP = (1 << 0),
690 } adj_nbr_interface_flags_t;
693 * Context for the state change walk of the DB
695 typedef struct adj_nbr_interface_state_change_ctx_t_
698 * Flags on the interface
700 adj_nbr_interface_flags_t flags;
701 } adj_nbr_interface_state_change_ctx_t;
704 adj_nbr_interface_state_change_one (adj_index_t ai,
708 * Back walk the graph to inform the forwarding entries
709 * that this interface state has changed. Do this synchronously
710 * since this is the walk that provides convergence
712 adj_nbr_interface_state_change_ctx_t *ctx = arg;
713 fib_node_back_walk_ctx_t bw_ctx = {
714 .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
715 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP :
716 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN),
718 * the force sync applies only as far as the first fib_entry.
719 * And it's the fib_entry's we need to converge away from
720 * the adjacencies on the now down link
722 .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
723 FIB_NODE_BW_FLAG_FORCE_SYNC :
724 FIB_NODE_BW_FLAG_NONE),
730 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
731 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
732 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
734 return (ADJ_WALK_RC_CONTINUE);
738 * @brief Registered function for SW interface state changes
740 static clib_error_t *
741 adj_nbr_sw_interface_state_change (vnet_main_t * vnm,
745 fib_protocol_t proto;
748 * walk each adj on the interface and trigger a walk from that adj
750 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
752 adj_nbr_interface_state_change_ctx_t ctx = {
753 .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
754 ADJ_NBR_INTERFACE_UP :
758 adj_nbr_walk(sw_if_index, proto,
759 adj_nbr_interface_state_change_one,
766 VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(
767 adj_nbr_sw_interface_state_change,
768 VNET_ITF_FUNC_PRIORITY_HIGH);
771 * @brief Invoked on each SW interface of a HW interface when the
772 * HW interface state changes
775 adj_nbr_hw_sw_interface_state_change (vnet_main_t * vnm,
779 adj_nbr_interface_state_change_ctx_t *ctx = arg;
780 fib_protocol_t proto;
783 * walk each adj on the interface and trigger a walk from that adj
785 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
787 adj_nbr_walk(sw_if_index, proto,
788 adj_nbr_interface_state_change_one,
791 return (WALK_CONTINUE);
795 * @brief Registered callback for HW interface state changes
797 static clib_error_t *
798 adj_nbr_hw_interface_state_change (vnet_main_t * vnm,
803 * walk SW interface on the HW
805 adj_nbr_interface_state_change_ctx_t ctx = {
806 .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
807 ADJ_NBR_INTERFACE_UP :
811 vnet_hw_interface_walk_sw(vnm, hw_if_index,
812 adj_nbr_hw_sw_interface_state_change,
818 VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(
819 adj_nbr_hw_interface_state_change,
820 VNET_ITF_FUNC_PRIORITY_HIGH);
823 adj_nbr_interface_delete_one (adj_index_t ai,
827 * Back walk the graph to inform the forwarding entries
828 * that this interface has been deleted.
830 fib_node_back_walk_ctx_t bw_ctx = {
831 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE,
839 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
840 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
841 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
844 return (ADJ_WALK_RC_CONTINUE);
848 * adj_nbr_interface_add_del
850 * Registered to receive interface Add and delete notifications
852 static clib_error_t *
853 adj_nbr_interface_add_del (vnet_main_t * vnm,
857 fib_protocol_t proto;
862 * not interested in interface additions. we will not back walk
863 * to resolve paths through newly added interfaces. Why? The control
864 * plane should have the brains to add interfaces first, then routes.
865 * So the case where there are paths with a interface that matches
866 * one just created is the case where the path resolved through an
867 * interface that was deleted, and still has not been removed. The
868 * new interface added, is NO GUARANTEE that the interface being
869 * added now, even though it may have the same sw_if_index, is the
870 * same interface that the path needs. So tough!
871 * If the control plane wants these routes to resolve it needs to
872 * remove and add them again.
877 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
879 adj_nbr_walk(sw_if_index, proto,
880 adj_nbr_interface_delete_one,
888 VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del);
892 adj_nbr_show_one (adj_index_t ai,
895 vlib_cli_output (arg, "[@%d] %U",
897 format_ip_adjacency, ai,
898 FORMAT_IP_ADJACENCY_NONE);
900 return (ADJ_WALK_RC_CONTINUE);
903 static clib_error_t *
904 adj_nbr_show (vlib_main_t * vm,
905 unformat_input_t * input,
906 vlib_cli_command_t * cmd)
908 adj_index_t ai = ADJ_INDEX_INVALID;
909 u32 sw_if_index = ~0;
911 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
913 if (unformat (input, "%d", &ai))
915 else if (unformat (input, "%U",
916 unformat_vnet_sw_interface, vnet_get_main(),
923 if (ADJ_INDEX_INVALID != ai)
925 vlib_cli_output (vm, "[@%d] %U",
927 format_ip_adjacency, ai,
928 FORMAT_IP_ADJACENCY_DETAIL);
930 else if (~0 != sw_if_index)
932 fib_protocol_t proto;
934 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
936 adj_nbr_walk(sw_if_index, proto,
943 fib_protocol_t proto;
945 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
947 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
949 adj_nbr_walk(sw_if_index, proto,
960 * Show all neighbour adjacencies.
962 * @cliexstart{sh adj nbr}
963 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
964 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
965 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
966 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
969 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
970 .path = "show adj nbr",
971 .short_help = "show adj nbr [<adj_index>] [interface]",
972 .function = adj_nbr_show,
976 format_adj_nbr_incomplete (u8* s, va_list *ap)
978 index_t index = va_arg(*ap, index_t);
979 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
980 vnet_main_t * vnm = vnet_get_main();
981 ip_adjacency_t * adj = adj_get(index);
983 s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
984 s = format (s, ": via %U",
985 format_ip46_address, &adj->sub_type.nbr.next_hop,
986 adj_proto_to_46(adj->ia_nh_proto));
987 s = format (s, " %U",
988 format_vnet_sw_if_index_name,
989 vnm, adj->rewrite_header.sw_if_index);
995 format_adj_nbr (u8* s, va_list *ap)
997 index_t index = va_arg(*ap, index_t);
998 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
999 ip_adjacency_t * adj = adj_get(index);
1001 s = format (s, "%U", format_vnet_link, adj->ia_link);
1002 s = format (s, " via %U ",
1003 format_ip46_address, &adj->sub_type.nbr.next_hop,
1004 adj_proto_to_46(adj->ia_nh_proto));
1005 s = format (s, "%U",
1006 format_vnet_rewrite,
1007 &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
1013 adj_dpo_lock (dpo_id_t *dpo)
1015 adj_lock(dpo->dpoi_index);
1018 adj_dpo_unlock (dpo_id_t *dpo)
1020 adj_unlock(dpo->dpoi_index);
1026 fib_show_memory_usage("Adjacency",
1027 pool_elts(adj_pool),
1029 sizeof(ip_adjacency_t));
1032 const static dpo_vft_t adj_nbr_dpo_vft = {
1033 .dv_lock = adj_dpo_lock,
1034 .dv_unlock = adj_dpo_unlock,
1035 .dv_format = format_adj_nbr,
1036 .dv_mem_show = adj_mem_show,
1037 .dv_get_urpf = adj_dpo_get_urpf,
1039 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1040 .dv_lock = adj_dpo_lock,
1041 .dv_unlock = adj_dpo_unlock,
1042 .dv_format = format_adj_nbr_incomplete,
1043 .dv_get_urpf = adj_dpo_get_urpf,
1047 * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1050 * this means that these graph nodes are ones from which a nbr is the
1051 * parent object in the DPO-graph.
1053 const static char* const nbr_ip4_nodes[] =
1058 const static char* const nbr_ip6_nodes[] =
1063 const static char* const nbr_mpls_nodes[] =
1068 const static char* const nbr_ethernet_nodes[] =
1073 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1075 [DPO_PROTO_IP4] = nbr_ip4_nodes,
1076 [DPO_PROTO_IP6] = nbr_ip6_nodes,
1077 [DPO_PROTO_MPLS] = nbr_mpls_nodes,
1078 [DPO_PROTO_ETHERNET] = nbr_ethernet_nodes,
1081 const static char* const nbr_incomplete_ip4_nodes[] =
1086 const static char* const nbr_incomplete_ip6_nodes[] =
1088 "ip6-discover-neighbor",
1091 const static char* const nbr_incomplete_mpls_nodes[] =
1093 "mpls-adj-incomplete",
1097 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1099 [DPO_PROTO_IP4] = nbr_incomplete_ip4_nodes,
1100 [DPO_PROTO_IP6] = nbr_incomplete_ip6_nodes,
1101 [DPO_PROTO_MPLS] = nbr_incomplete_mpls_nodes,
1105 adj_nbr_module_init (void)
1107 dpo_register(DPO_ADJACENCY,
1110 dpo_register(DPO_ADJACENCY_INCOMPLETE,
1111 &adj_nbr_incompl_dpo_vft,
1112 nbr_incomplete_nodes);