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 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);
135 static ip_adjacency_t*
136 adj_nbr_alloc (fib_protocol_t nh_proto,
137 vnet_link_t link_type,
138 const ip46_address_t *nh_addr,
143 adj = adj_alloc(nh_proto);
145 adj_nbr_insert(nh_proto, link_type, nh_addr,
150 * since we just added the ADJ we have no rewrite string for it,
153 adj->lookup_next_index = IP_LOOKUP_NEXT_ARP;
154 adj->sub_type.nbr.next_hop = *nh_addr;
155 adj->ia_link = link_type;
156 adj->ia_nh_proto = nh_proto;
157 adj->rewrite_header.sw_if_index = sw_if_index;
158 memset(&adj->sub_type.midchain.next_dpo, 0,
159 sizeof(adj->sub_type.midchain.next_dpo));
165 * adj_nbr_add_or_lock
167 * Add an adjacency for the neighbour requested.
169 * The key for an adj is:
170 * - the Next-hops protocol (i.e. v4 or v6)
171 * - the address of the next-hop
172 * - the interface the next-hop is reachable through
175 adj_nbr_add_or_lock (fib_protocol_t nh_proto,
176 vnet_link_t link_type,
177 const ip46_address_t *nh_addr,
180 adj_index_t adj_index;
183 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
185 if (ADJ_INDEX_INVALID == adj_index)
189 vnm = vnet_get_main();
190 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
191 adj_index = adj_get_index(adj);
194 vnet_rewrite_init(vnm, sw_if_index,
195 adj_get_nd_node(nh_proto),
196 vnet_tx_node_index_for_sw_interface(vnm, sw_if_index),
197 &adj->rewrite_header);
200 * we need a rewrite where the destination IP address is converted
201 * to the appropriate link-layer address. This is interface specific.
202 * So ask the interface to do it.
204 vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
215 adj_nbr_add_or_lock_w_rewrite (fib_protocol_t nh_proto,
216 vnet_link_t link_type,
217 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)
228 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
229 adj->rewrite_header.sw_if_index = sw_if_index;
233 adj = adj_get(adj_index);
236 adj_lock(adj_get_index(adj));
237 adj_nbr_update_rewrite(adj_get_index(adj),
238 ADJ_NBR_REWRITE_FLAG_COMPLETE,
241 return (adj_get_index(adj));
245 * adj_nbr_update_rewrite
247 * Update the adjacency's rewrite string. A NULL string implies the
248 * rewirte is reset (i.e. when ARP/ND etnry is gone).
249 * NB: the adj being updated may be handling traffic in the DP.
252 adj_nbr_update_rewrite (adj_index_t adj_index,
253 adj_nbr_rewrite_flag_t flags,
258 ASSERT(ADJ_INDEX_INVALID != adj_index);
260 adj = adj_get(adj_index);
262 if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
265 * update the adj's rewrite string and build the arc
266 * from the rewrite node to the interface's TX node
268 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_REWRITE,
269 adj_get_rewrite_node(adj->ia_link),
270 vnet_tx_node_index_for_sw_interface(
272 adj->rewrite_header.sw_if_index),
277 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_ARP,
278 adj_get_nd_node(adj->ia_nh_proto),
279 vnet_tx_node_index_for_sw_interface(
281 adj->rewrite_header.sw_if_index),
287 * adj_nbr_update_rewrite_internal
289 * Update the adjacency's rewrite string. A NULL string implies the
290 * rewirte is reset (i.e. when ARP/ND etnry is gone).
291 * NB: the adj being updated may be handling traffic in the DP.
294 adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
300 ip_adjacency_t *walk_adj;
306 vm = vlib_get_main();
307 old_next = adj->lookup_next_index;
309 walk_ai = adj_get_index(adj);
310 if (VNET_LINK_MPLS == adj->ia_link)
313 * The link type MPLS has no children in the control plane graph, it only
314 * has children in the data-palne graph. The backwalk is up the former.
315 * So we need to walk from its IP cousin.
317 walk_ai = adj_nbr_find(adj->ia_nh_proto,
318 fib_proto_to_link(adj->ia_nh_proto),
319 &adj->sub_type.nbr.next_hop,
320 adj->rewrite_header.sw_if_index);
324 * Don't call the walk re-entrantly
326 if (ADJ_INDEX_INVALID != walk_ai)
328 walk_adj = adj_get(walk_ai);
329 if (IP_ADJ_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
336 * Prevent re-entrant walk of the same adj
338 walk_adj->ia_flags |= IP_ADJ_SYNC_WALK_ACTIVE;
348 * lock the adjacencies that are affected by updates this walk will provoke.
349 * Since the aim of the walk is to update children to link to a different
350 * DPO, this adj will no longer be in use and its lock count will drop to 0.
351 * We don't want it to be deleted as part of this endevour.
353 adj_lock(adj_get_index(adj));
357 * Updating a rewrite string is not atomic;
358 * - the rewrite string is too long to write in one instruction
359 * - when swapping from incomplete to complete, we also need to update
360 * the VLIB graph next-index of the adj.
361 * ideally we would only want to suspend forwarding via this adj whilst we
362 * do this, but we do not have that level of granularity - it's suspend all
363 * worker threads or nothing.
364 * The other chioces are:
365 * - to mark the adj down and back walk so child load-balances drop this adj
367 * - update the next_node index of this adj to point to error-drop
368 * both of which will mean for MAC change we will drop for this adj
369 * which is not acceptable. However, when the adj changes type (from
370 * complete to incomplete and vice-versa) the child DPOs, which have the
371 * VLIB graph next node index, will be sending packets to the wrong graph
372 * node. So from the options above, updating the next_node of the adj to
373 * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
374 * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
375 * (i.e. a rewrite adj in the arp node). This is not enforcable. Getting it
376 * wrong will lead to hard to find bugs since its a race condition. So we
377 * choose the more reliable method of updating the children to use the drop,
378 * then switching adj's type, then updating the children again. Did I mention
379 * that this doesn't happen often...
380 * So we need to distinguish between the two cases:
382 * 2 - adj type change
385 old_next != adj_next_index &&
386 ADJ_INDEX_INVALID != walk_ai)
389 * the adj is changing type. we need to fix all children so that they
390 * stack momentarily on a drop, while the adj changes. If we don't do
391 * this the children will send packets to a VLIB graph node that does
392 * not correspond to the adj's type - and it goes downhill from there.
394 fib_node_back_walk_ctx_t bw_ctx = {
395 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
397 * force this walk to be synchrous. if we don't and a node in the graph
398 * (a heavily shared path-list) chooses to back-ground the walk (make it
399 * async) then it will pause and we will do the adj update below, before
400 * all the children are updated. not good.
402 .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
405 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
409 * If we are just updating the MAC string of the adj (which we also can't
410 * do atomically), then we need to stop packets switching through the adj.
411 * We can't do that on a per-adj basis, so it's all the packets.
412 * If we are updating the type, and we walked back to the children above,
413 * then this barrier serves to flush the queues/frames.
415 vlib_worker_thread_barrier_sync(vm);
417 adj->lookup_next_index = adj_next_index;
422 * new rewrite provided.
423 * fill in the adj's rewrite string, and build the VLIB graph arc.
425 vnet_rewrite_set_data_internal(&adj->rewrite_header,
426 sizeof(adj->rewrite_data),
433 vnet_rewrite_clear_data_internal(&adj->rewrite_header,
434 sizeof(adj->rewrite_data));
436 adj->rewrite_header.node_index = this_node;
437 adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
442 * done with the rewirte update - let the workers loose.
444 vlib_worker_thread_barrier_release(vm);
447 (old_next != adj->lookup_next_index) &&
448 (ADJ_INDEX_INVALID != walk_ai))
451 * backwalk to the children so they can stack on the now updated
454 fib_node_back_walk_ctx_t bw_ctx = {
455 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE,
458 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
461 * Prevent re-entrant walk of the same adj
465 walk_adj->ia_flags &= ~IP_ADJ_SYNC_WALK_ACTIVE;
468 adj_unlock(adj_get_index(adj));
472 typedef struct adj_db_count_ctx_t_ {
474 } adj_db_count_ctx_t;
477 adj_db_count (BVT(clib_bihash_kv) * kvp,
480 adj_db_count_ctx_t * ctx = arg;
485 adj_nbr_db_size (void)
487 adj_db_count_ctx_t ctx = {
490 fib_protocol_t proto;
493 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
495 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
497 if (NULL != adj_nbr_tables[proto][sw_if_index])
499 BV(clib_bihash_foreach_key_value_pair) (
500 adj_nbr_tables[proto][sw_if_index],
510 * @brief Context for a walk of the adjacency neighbour DB
512 typedef struct adj_walk_ctx_t_
514 adj_walk_cb_t awc_cb;
519 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
522 adj_walk_ctx_t *ctx = arg;
524 // FIXME: can't stop early...
525 ctx->awc_cb(kvp->value, ctx->awc_ctx);
529 adj_nbr_walk (u32 sw_if_index,
530 fib_protocol_t adj_nh_proto,
534 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
537 adj_walk_ctx_t awc = {
542 BV(clib_bihash_foreach_key_value_pair) (
543 adj_nbr_tables[adj_nh_proto][sw_if_index],
549 * @brief Context for a walk of the adjacency neighbour DB
551 typedef struct adj_walk_nh_ctx_t_
553 adj_walk_cb_t awc_cb;
555 const ip46_address_t *awc_nh;
559 adj_nbr_walk_nh_cb (BVT(clib_bihash_kv) * kvp,
563 adj_walk_nh_ctx_t *ctx = arg;
565 adj = adj_get(kvp->value);
567 if (!ip46_address_cmp(&adj->sub_type.nbr.next_hop, ctx->awc_nh))
568 ctx->awc_cb(kvp->value, ctx->awc_ctx);
572 * @brief Walk adjacencies on a link with a given v4 next-hop.
573 * that is visit the adjacencies with different link types.
576 adj_nbr_walk_nh4 (u32 sw_if_index,
577 const ip4_address_t *addr,
581 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
584 ip46_address_t nh = {
588 adj_walk_nh_ctx_t awc = {
594 BV(clib_bihash_foreach_key_value_pair) (
595 adj_nbr_tables[FIB_PROTOCOL_IP4][sw_if_index],
601 * @brief Walk adjacencies on a link with a given v6 next-hop.
602 * that is visit the adjacencies with different link types.
605 adj_nbr_walk_nh6 (u32 sw_if_index,
606 const ip6_address_t *addr,
610 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
613 ip46_address_t nh = {
617 adj_walk_nh_ctx_t awc = {
623 BV(clib_bihash_foreach_key_value_pair) (
624 adj_nbr_tables[FIB_PROTOCOL_IP6][sw_if_index],
630 * @brief Walk adjacencies on a link with a given next-hop.
631 * that is visit the adjacencies with different link types.
634 adj_nbr_walk_nh (u32 sw_if_index,
635 fib_protocol_t adj_nh_proto,
636 const ip46_address_t *nh,
640 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
643 adj_walk_nh_ctx_t awc = {
649 BV(clib_bihash_foreach_key_value_pair) (
650 adj_nbr_tables[adj_nh_proto][sw_if_index],
656 * Flags associated with the interface state walks
658 typedef enum adj_nbr_interface_flags_t_
660 ADJ_NBR_INTERFACE_UP = (1 << 0),
661 } adj_nbr_interface_flags_t;
664 * Context for the state change walk of the DB
666 typedef struct adj_nbr_interface_state_change_ctx_t_
669 * Flags on the interface
671 adj_nbr_interface_flags_t flags;
672 } adj_nbr_interface_state_change_ctx_t;
675 adj_nbr_interface_state_change_one (adj_index_t ai,
679 * Back walk the graph to inform the forwarding entries
680 * that this interface state has changed. Do this synchronously
681 * since this is the walk that provides convergence
683 adj_nbr_interface_state_change_ctx_t *ctx = arg;
685 fib_node_back_walk_ctx_t bw_ctx = {
686 .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
687 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP :
688 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN),
690 * the force sync applies only as far as the first fib_entry.
691 * And it's the fib_entry's we need to converge away from
692 * the adjacencies on the now down link
694 .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
695 FIB_NODE_BW_FLAG_FORCE_SYNC :
699 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
701 return (ADJ_WALK_RC_CONTINUE);
705 * @brief Registered function for SW interface state changes
707 static clib_error_t *
708 adj_nbr_sw_interface_state_change (vnet_main_t * vnm,
712 fib_protocol_t proto;
715 * walk each adj on the interface and trigger a walk from that adj
717 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
719 adj_nbr_interface_state_change_ctx_t ctx = {
720 .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
721 ADJ_NBR_INTERFACE_UP :
725 adj_nbr_walk(sw_if_index, proto,
726 adj_nbr_interface_state_change_one,
733 VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(
734 adj_nbr_sw_interface_state_change,
735 VNET_ITF_FUNC_PRIORITY_HIGH);
738 * @brief Invoked on each SW interface of a HW interface when the
739 * HW interface state changes
742 adj_nbr_hw_sw_interface_state_change (vnet_main_t * vnm,
746 adj_nbr_interface_state_change_ctx_t *ctx = arg;
747 fib_protocol_t proto;
750 * walk each adj on the interface and trigger a walk from that adj
752 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
754 adj_nbr_walk(sw_if_index, proto,
755 adj_nbr_interface_state_change_one,
761 * @brief Registered callback for HW interface state changes
763 static clib_error_t *
764 adj_nbr_hw_interface_state_change (vnet_main_t * vnm,
769 * walk SW interface on the HW
771 adj_nbr_interface_state_change_ctx_t ctx = {
772 .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
773 ADJ_NBR_INTERFACE_UP :
777 vnet_hw_interface_walk_sw(vnm, hw_if_index,
778 adj_nbr_hw_sw_interface_state_change,
784 VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(
785 adj_nbr_hw_interface_state_change,
786 VNET_ITF_FUNC_PRIORITY_HIGH);
789 adj_nbr_interface_delete_one (adj_index_t ai,
793 * Back walk the graph to inform the forwarding entries
794 * that this interface has been deleted.
796 fib_node_back_walk_ctx_t bw_ctx = {
797 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE,
800 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
802 return (ADJ_WALK_RC_CONTINUE);
806 * adj_nbr_interface_add_del
808 * Registered to receive interface Add and delete notifications
810 static clib_error_t *
811 adj_nbr_interface_add_del (vnet_main_t * vnm,
815 fib_protocol_t proto;
820 * not interested in interface additions. we will not back walk
821 * to resolve paths through newly added interfaces. Why? The control
822 * plane should have the brains to add interfaces first, then routes.
823 * So the case where there are paths with a interface that matches
824 * one just created is the case where the path resolved through an
825 * interface that was deleted, and still has not been removed. The
826 * new interface added, is NO GUARANTEE that the interface being
827 * added now, even though it may have the same sw_if_index, is the
828 * same interface that the path needs. So tough!
829 * If the control plane wants these routes to resolve it needs to
830 * remove and add them again.
835 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
837 adj_nbr_walk(sw_if_index, proto,
838 adj_nbr_interface_delete_one,
846 VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del);
850 adj_nbr_show_one (adj_index_t ai,
853 vlib_cli_output (arg, "[@%d] %U",
855 format_ip_adjacency, ai,
856 FORMAT_IP_ADJACENCY_NONE);
858 return (ADJ_WALK_RC_CONTINUE);
861 static clib_error_t *
862 adj_nbr_show (vlib_main_t * vm,
863 unformat_input_t * input,
864 vlib_cli_command_t * cmd)
866 adj_index_t ai = ADJ_INDEX_INVALID;
867 u32 sw_if_index = ~0;
869 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
871 if (unformat (input, "%d", &ai))
873 else if (unformat (input, "%U",
874 unformat_vnet_sw_interface, vnet_get_main(),
881 if (ADJ_INDEX_INVALID != ai)
883 vlib_cli_output (vm, "[@%d] %U",
885 format_ip_adjacency, ai,
886 FORMAT_IP_ADJACENCY_DETAIL);
888 else if (~0 != sw_if_index)
890 fib_protocol_t proto;
892 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
894 adj_nbr_walk(sw_if_index, proto,
901 fib_protocol_t proto;
903 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
905 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
907 adj_nbr_walk(sw_if_index, proto,
918 * Show all neighbour adjacencies.
920 * @cliexstart{sh adj nbr}
921 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
922 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
923 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
924 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
927 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
928 .path = "show adj nbr",
929 .short_help = "show adj nbr [<adj_index>] [interface]",
930 .function = adj_nbr_show,
934 adj_proto_to_46 (fib_protocol_t proto)
938 case FIB_PROTOCOL_IP4:
939 return (IP46_TYPE_IP4);
940 case FIB_PROTOCOL_IP6:
941 return (IP46_TYPE_IP6);
943 return (IP46_TYPE_IP4);
945 return (IP46_TYPE_IP4);
949 format_adj_nbr_incomplete (u8* s, va_list *ap)
951 index_t index = va_arg(*ap, index_t);
952 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
953 vnet_main_t * vnm = vnet_get_main();
954 ip_adjacency_t * adj = adj_get(index);
956 s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
957 s = format (s, ": via %U",
958 format_ip46_address, &adj->sub_type.nbr.next_hop,
959 adj_proto_to_46(adj->ia_nh_proto));
960 s = format (s, " %U",
961 format_vnet_sw_interface_name,
963 vnet_get_sw_interface(vnm,
964 adj->rewrite_header.sw_if_index));
970 format_adj_nbr (u8* s, va_list *ap)
972 index_t index = va_arg(*ap, index_t);
973 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
974 vnet_main_t * vnm = vnet_get_main();
975 ip_adjacency_t * adj = adj_get(index);
977 s = format (s, "%U", format_vnet_link, adj->ia_link);
978 s = format (s, " via %U ",
979 format_ip46_address, &adj->sub_type.nbr.next_hop,
980 adj_proto_to_46(adj->ia_nh_proto));
983 vnm->vlib_main, &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
989 adj_dpo_lock (dpo_id_t *dpo)
991 adj_lock(dpo->dpoi_index);
994 adj_dpo_unlock (dpo_id_t *dpo)
996 adj_unlock(dpo->dpoi_index);
1002 fib_show_memory_usage("Adjacency",
1003 pool_elts(adj_pool),
1005 sizeof(ip_adjacency_t));
1008 const static dpo_vft_t adj_nbr_dpo_vft = {
1009 .dv_lock = adj_dpo_lock,
1010 .dv_unlock = adj_dpo_unlock,
1011 .dv_format = format_adj_nbr,
1012 .dv_mem_show = adj_mem_show,
1014 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1015 .dv_lock = adj_dpo_lock,
1016 .dv_unlock = adj_dpo_unlock,
1017 .dv_format = format_adj_nbr_incomplete,
1021 * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1024 * this means that these graph nodes are ones from which a nbr is the
1025 * parent object in the DPO-graph.
1027 const static char* const nbr_ip4_nodes[] =
1032 const static char* const nbr_ip6_nodes[] =
1037 const static char* const nbr_mpls_nodes[] =
1042 const static char* const nbr_ethernet_nodes[] =
1047 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1049 [DPO_PROTO_IP4] = nbr_ip4_nodes,
1050 [DPO_PROTO_IP6] = nbr_ip6_nodes,
1051 [DPO_PROTO_MPLS] = nbr_mpls_nodes,
1052 [DPO_PROTO_ETHERNET] = nbr_ethernet_nodes,
1055 const static char* const nbr_incomplete_ip4_nodes[] =
1060 const static char* const nbr_incomplete_ip6_nodes[] =
1062 "ip6-discover-neighbor",
1065 const static char* const nbr_incomplete_mpls_nodes[] =
1067 "mpls-adj-incomplete",
1071 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1073 [DPO_PROTO_IP4] = nbr_incomplete_ip4_nodes,
1074 [DPO_PROTO_IP6] = nbr_incomplete_ip6_nodes,
1075 [DPO_PROTO_MPLS] = nbr_incomplete_mpls_nodes,
1079 adj_nbr_module_init (void)
1081 dpo_register(DPO_ADJACENCY,
1084 dpo_register(DPO_ADJACENCY_INCOMPLETE,
1085 &adj_nbr_incompl_dpo_vft,
1086 nbr_incomplete_nodes);