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;
270 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
272 if (ADJ_INDEX_INVALID == adj_index)
274 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
275 adj->rewrite_header.sw_if_index = sw_if_index;
279 adj = adj_get(adj_index);
282 adj_lock(adj_get_index(adj));
283 adj_nbr_update_rewrite(adj_get_index(adj),
284 ADJ_NBR_REWRITE_FLAG_COMPLETE,
287 return (adj_get_index(adj));
291 * adj_nbr_update_rewrite
293 * Update the adjacency's rewrite string. A NULL string implies the
294 * rewirte is reset (i.e. when ARP/ND etnry is gone).
295 * NB: the adj being updated may be handling traffic in the DP.
298 adj_nbr_update_rewrite (adj_index_t adj_index,
299 adj_nbr_rewrite_flag_t flags,
304 ASSERT(ADJ_INDEX_INVALID != adj_index);
306 adj = adj_get(adj_index);
308 if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
311 * update the adj's rewrite string and build the arc
312 * from the rewrite node to the interface's TX node
314 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_REWRITE,
315 adj_get_rewrite_node(adj->ia_link),
316 vnet_tx_node_index_for_sw_interface(
318 adj->rewrite_header.sw_if_index),
323 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_ARP,
324 adj_get_nd_node(adj->ia_nh_proto),
325 vnet_tx_node_index_for_sw_interface(
327 adj->rewrite_header.sw_if_index),
333 * adj_nbr_update_rewrite_internal
335 * Update the adjacency's rewrite string. A NULL string implies the
336 * rewirte is reset (i.e. when ARP/ND etnry is gone).
337 * NB: the adj being updated may be handling traffic in the DP.
340 adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
341 ip_lookup_next_t adj_next_index,
346 ip_adjacency_t *walk_adj;
352 vm = vlib_get_main();
353 old_next = adj->lookup_next_index;
355 walk_ai = adj_get_index(adj);
356 if (VNET_LINK_MPLS == adj->ia_link)
359 * The link type MPLS has no children in the control plane graph, it only
360 * has children in the data-palne graph. The backwalk is up the former.
361 * So we need to walk from its IP cousin.
363 walk_ai = adj_nbr_find(adj->ia_nh_proto,
364 fib_proto_to_link(adj->ia_nh_proto),
365 &adj->sub_type.nbr.next_hop,
366 adj->rewrite_header.sw_if_index);
370 * Don't call the walk re-entrantly
372 if (ADJ_INDEX_INVALID != walk_ai)
374 walk_adj = adj_get(walk_ai);
375 if (ADJ_FLAG_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
382 * Prevent re-entrant walk of the same adj
384 walk_adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
394 * lock the adjacencies that are affected by updates this walk will provoke.
395 * Since the aim of the walk is to update children to link to a different
396 * DPO, this adj will no longer be in use and its lock count will drop to 0.
397 * We don't want it to be deleted as part of this endevour.
399 adj_lock(adj_get_index(adj));
403 * Updating a rewrite string is not atomic;
404 * - the rewrite string is too long to write in one instruction
405 * - when swapping from incomplete to complete, we also need to update
406 * the VLIB graph next-index of the adj.
407 * ideally we would only want to suspend forwarding via this adj whilst we
408 * do this, but we do not have that level of granularity - it's suspend all
409 * worker threads or nothing.
410 * The other chioces are:
411 * - to mark the adj down and back walk so child load-balances drop this adj
413 * - update the next_node index of this adj to point to error-drop
414 * both of which will mean for MAC change we will drop for this adj
415 * which is not acceptable. However, when the adj changes type (from
416 * complete to incomplete and vice-versa) the child DPOs, which have the
417 * VLIB graph next node index, will be sending packets to the wrong graph
418 * node. So from the options above, updating the next_node of the adj to
419 * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
420 * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
421 * (i.e. a rewrite adj in the arp node). This is not enforcable. Getting it
422 * wrong will lead to hard to find bugs since its a race condition. So we
423 * choose the more reliable method of updating the children to use the drop,
424 * then switching adj's type, then updating the children again. Did I mention
425 * that this doesn't happen often...
426 * So we need to distinguish between the two cases:
428 * 2 - adj type change
431 old_next != adj_next_index &&
432 ADJ_INDEX_INVALID != walk_ai)
435 * the adj is changing type. we need to fix all children so that they
436 * stack momentarily on a drop, while the adj changes. If we don't do
437 * this the children will send packets to a VLIB graph node that does
438 * not correspond to the adj's type - and it goes downhill from there.
440 fib_node_back_walk_ctx_t bw_ctx = {
441 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
443 * force this walk to be synchrous. if we don't and a node in the graph
444 * (a heavily shared path-list) chooses to back-ground the walk (make it
445 * async) then it will pause and we will do the adj update below, before
446 * all the children are updated. not good.
448 .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
451 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
455 * If we are just updating the MAC string of the adj (which we also can't
456 * do atomically), then we need to stop packets switching through the adj.
457 * We can't do that on a per-adj basis, so it's all the packets.
458 * If we are updating the type, and we walked back to the children above,
459 * then this barrier serves to flush the queues/frames.
461 vlib_worker_thread_barrier_sync(vm);
463 adj->lookup_next_index = adj_next_index;
468 * new rewrite provided.
469 * fill in the adj's rewrite string, and build the VLIB graph arc.
471 vnet_rewrite_set_data_internal(&adj->rewrite_header,
472 sizeof(adj->rewrite_data),
479 vnet_rewrite_clear_data_internal(&adj->rewrite_header,
480 sizeof(adj->rewrite_data));
482 adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
487 * done with the rewirte update - let the workers loose.
489 vlib_worker_thread_barrier_release(vm);
492 (old_next != adj->lookup_next_index) &&
493 (ADJ_INDEX_INVALID != walk_ai))
496 * backwalk to the children so they can stack on the now updated
499 fib_node_back_walk_ctx_t bw_ctx = {
500 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE,
503 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
506 * Prevent re-entrant walk of the same adj
510 walk_adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
513 adj_unlock(adj_get_index(adj));
517 typedef struct adj_db_count_ctx_t_ {
519 } adj_db_count_ctx_t;
522 adj_db_count (BVT(clib_bihash_kv) * kvp,
525 adj_db_count_ctx_t * ctx = arg;
530 adj_nbr_db_size (void)
532 adj_db_count_ctx_t ctx = {
535 fib_protocol_t proto;
538 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
540 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
542 if (NULL != adj_nbr_tables[proto][sw_if_index])
544 BV(clib_bihash_foreach_key_value_pair) (
545 adj_nbr_tables[proto][sw_if_index],
555 * @brief Context for a walk of the adjacency neighbour DB
557 typedef struct adj_walk_ctx_t_
559 adj_walk_cb_t awc_cb;
564 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
567 adj_walk_ctx_t *ctx = arg;
569 // FIXME: can't stop early...
570 ctx->awc_cb(kvp->value, ctx->awc_ctx);
574 adj_nbr_walk (u32 sw_if_index,
575 fib_protocol_t adj_nh_proto,
579 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
582 adj_walk_ctx_t awc = {
587 BV(clib_bihash_foreach_key_value_pair) (
588 adj_nbr_tables[adj_nh_proto][sw_if_index],
594 * @brief Walk adjacencies on a link with a given v4 next-hop.
595 * that is visit the adjacencies with different link types.
598 adj_nbr_walk_nh4 (u32 sw_if_index,
599 const ip4_address_t *addr,
603 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
606 ip46_address_t nh = {
612 FOR_EACH_VNET_LINK(linkt)
614 ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, &nh, sw_if_index);
616 if (INDEX_INVALID != ai)
622 * @brief Walk adjacencies on a link with a given v6 next-hop.
623 * that is visit the adjacencies with different link types.
626 adj_nbr_walk_nh6 (u32 sw_if_index,
627 const ip6_address_t *addr,
631 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
634 ip46_address_t nh = {
640 FOR_EACH_VNET_LINK(linkt)
642 ai = adj_nbr_find (FIB_PROTOCOL_IP6, linkt, &nh, sw_if_index);
644 if (INDEX_INVALID != ai)
650 * @brief Walk adjacencies on a link with a given next-hop.
651 * that is visit the adjacencies with different link types.
654 adj_nbr_walk_nh (u32 sw_if_index,
655 fib_protocol_t adj_nh_proto,
656 const ip46_address_t *nh,
660 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
666 FOR_EACH_VNET_LINK(linkt)
668 ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, nh, sw_if_index);
670 if (INDEX_INVALID != ai)
676 * Flags associated with the interface state walks
678 typedef enum adj_nbr_interface_flags_t_
680 ADJ_NBR_INTERFACE_UP = (1 << 0),
681 } adj_nbr_interface_flags_t;
684 * Context for the state change walk of the DB
686 typedef struct adj_nbr_interface_state_change_ctx_t_
689 * Flags on the interface
691 adj_nbr_interface_flags_t flags;
692 } adj_nbr_interface_state_change_ctx_t;
695 adj_nbr_interface_state_change_one (adj_index_t ai,
699 * Back walk the graph to inform the forwarding entries
700 * that this interface state has changed. Do this synchronously
701 * since this is the walk that provides convergence
703 adj_nbr_interface_state_change_ctx_t *ctx = arg;
704 fib_node_back_walk_ctx_t bw_ctx = {
705 .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
706 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP :
707 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN),
709 * the force sync applies only as far as the first fib_entry.
710 * And it's the fib_entry's we need to converge away from
711 * the adjacencies on the now down link
713 .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
714 FIB_NODE_BW_FLAG_FORCE_SYNC :
715 FIB_NODE_BW_FLAG_NONE),
721 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
722 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
723 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
725 return (ADJ_WALK_RC_CONTINUE);
729 * @brief Registered function for SW interface state changes
731 static clib_error_t *
732 adj_nbr_sw_interface_state_change (vnet_main_t * vnm,
736 fib_protocol_t proto;
739 * walk each adj on the interface and trigger a walk from that adj
741 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
743 adj_nbr_interface_state_change_ctx_t ctx = {
744 .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
745 ADJ_NBR_INTERFACE_UP :
749 adj_nbr_walk(sw_if_index, proto,
750 adj_nbr_interface_state_change_one,
757 VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(
758 adj_nbr_sw_interface_state_change,
759 VNET_ITF_FUNC_PRIORITY_HIGH);
762 * @brief Invoked on each SW interface of a HW interface when the
763 * HW interface state changes
766 adj_nbr_hw_sw_interface_state_change (vnet_main_t * vnm,
770 adj_nbr_interface_state_change_ctx_t *ctx = arg;
771 fib_protocol_t proto;
774 * walk each adj on the interface and trigger a walk from that adj
776 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
778 adj_nbr_walk(sw_if_index, proto,
779 adj_nbr_interface_state_change_one,
782 return (WALK_CONTINUE);
786 * @brief Registered callback for HW interface state changes
788 static clib_error_t *
789 adj_nbr_hw_interface_state_change (vnet_main_t * vnm,
794 * walk SW interface on the HW
796 adj_nbr_interface_state_change_ctx_t ctx = {
797 .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
798 ADJ_NBR_INTERFACE_UP :
802 vnet_hw_interface_walk_sw(vnm, hw_if_index,
803 adj_nbr_hw_sw_interface_state_change,
809 VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(
810 adj_nbr_hw_interface_state_change,
811 VNET_ITF_FUNC_PRIORITY_HIGH);
814 adj_nbr_interface_delete_one (adj_index_t ai,
818 * Back walk the graph to inform the forwarding entries
819 * that this interface has been deleted.
821 fib_node_back_walk_ctx_t bw_ctx = {
822 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE,
828 adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
829 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
830 adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
832 return (ADJ_WALK_RC_CONTINUE);
836 * adj_nbr_interface_add_del
838 * Registered to receive interface Add and delete notifications
840 static clib_error_t *
841 adj_nbr_interface_add_del (vnet_main_t * vnm,
845 fib_protocol_t proto;
850 * not interested in interface additions. we will not back walk
851 * to resolve paths through newly added interfaces. Why? The control
852 * plane should have the brains to add interfaces first, then routes.
853 * So the case where there are paths with a interface that matches
854 * one just created is the case where the path resolved through an
855 * interface that was deleted, and still has not been removed. The
856 * new interface added, is NO GUARANTEE that the interface being
857 * added now, even though it may have the same sw_if_index, is the
858 * same interface that the path needs. So tough!
859 * If the control plane wants these routes to resolve it needs to
860 * remove and add them again.
865 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
867 adj_nbr_walk(sw_if_index, proto,
868 adj_nbr_interface_delete_one,
876 VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del);
880 adj_nbr_show_one (adj_index_t ai,
883 vlib_cli_output (arg, "[@%d] %U",
885 format_ip_adjacency, ai,
886 FORMAT_IP_ADJACENCY_NONE);
888 return (ADJ_WALK_RC_CONTINUE);
891 static clib_error_t *
892 adj_nbr_show (vlib_main_t * vm,
893 unformat_input_t * input,
894 vlib_cli_command_t * cmd)
896 adj_index_t ai = ADJ_INDEX_INVALID;
897 u32 sw_if_index = ~0;
899 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
901 if (unformat (input, "%d", &ai))
903 else if (unformat (input, "%U",
904 unformat_vnet_sw_interface, vnet_get_main(),
911 if (ADJ_INDEX_INVALID != ai)
913 vlib_cli_output (vm, "[@%d] %U",
915 format_ip_adjacency, ai,
916 FORMAT_IP_ADJACENCY_DETAIL);
918 else if (~0 != sw_if_index)
920 fib_protocol_t proto;
922 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
924 adj_nbr_walk(sw_if_index, proto,
931 fib_protocol_t proto;
933 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
935 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
937 adj_nbr_walk(sw_if_index, proto,
948 * Show all neighbour adjacencies.
950 * @cliexstart{sh adj nbr}
951 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
952 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
953 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
954 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
957 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
958 .path = "show adj nbr",
959 .short_help = "show adj nbr [<adj_index>] [interface]",
960 .function = adj_nbr_show,
964 format_adj_nbr_incomplete (u8* s, va_list *ap)
966 index_t index = va_arg(*ap, index_t);
967 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
968 vnet_main_t * vnm = vnet_get_main();
969 ip_adjacency_t * adj = adj_get(index);
971 s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
972 s = format (s, ": via %U",
973 format_ip46_address, &adj->sub_type.nbr.next_hop,
974 adj_proto_to_46(adj->ia_nh_proto));
975 s = format (s, " %U",
976 format_vnet_sw_if_index_name,
977 vnm, adj->rewrite_header.sw_if_index);
983 format_adj_nbr (u8* s, va_list *ap)
985 index_t index = va_arg(*ap, index_t);
986 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
987 ip_adjacency_t * adj = adj_get(index);
989 s = format (s, "%U", format_vnet_link, adj->ia_link);
990 s = format (s, " via %U ",
991 format_ip46_address, &adj->sub_type.nbr.next_hop,
992 adj_proto_to_46(adj->ia_nh_proto));
995 &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
1001 adj_dpo_lock (dpo_id_t *dpo)
1003 adj_lock(dpo->dpoi_index);
1006 adj_dpo_unlock (dpo_id_t *dpo)
1008 adj_unlock(dpo->dpoi_index);
1014 fib_show_memory_usage("Adjacency",
1015 pool_elts(adj_pool),
1017 sizeof(ip_adjacency_t));
1020 const static dpo_vft_t adj_nbr_dpo_vft = {
1021 .dv_lock = adj_dpo_lock,
1022 .dv_unlock = adj_dpo_unlock,
1023 .dv_format = format_adj_nbr,
1024 .dv_mem_show = adj_mem_show,
1025 .dv_get_urpf = adj_dpo_get_urpf,
1027 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1028 .dv_lock = adj_dpo_lock,
1029 .dv_unlock = adj_dpo_unlock,
1030 .dv_format = format_adj_nbr_incomplete,
1031 .dv_get_urpf = adj_dpo_get_urpf,
1035 * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1038 * this means that these graph nodes are ones from which a nbr is the
1039 * parent object in the DPO-graph.
1041 const static char* const nbr_ip4_nodes[] =
1046 const static char* const nbr_ip6_nodes[] =
1051 const static char* const nbr_mpls_nodes[] =
1056 const static char* const nbr_ethernet_nodes[] =
1061 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1063 [DPO_PROTO_IP4] = nbr_ip4_nodes,
1064 [DPO_PROTO_IP6] = nbr_ip6_nodes,
1065 [DPO_PROTO_MPLS] = nbr_mpls_nodes,
1066 [DPO_PROTO_ETHERNET] = nbr_ethernet_nodes,
1069 const static char* const nbr_incomplete_ip4_nodes[] =
1074 const static char* const nbr_incomplete_ip6_nodes[] =
1076 "ip6-discover-neighbor",
1079 const static char* const nbr_incomplete_mpls_nodes[] =
1081 "mpls-adj-incomplete",
1085 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1087 [DPO_PROTO_IP4] = nbr_incomplete_ip4_nodes,
1088 [DPO_PROTO_IP6] = nbr_incomplete_ip6_nodes,
1089 [DPO_PROTO_MPLS] = nbr_incomplete_mpls_nodes,
1093 adj_nbr_module_init (void)
1095 dpo_register(DPO_ADJACENCY,
1098 dpo_register(DPO_ADJACENCY_INCOMPLETE,
1099 &adj_nbr_incompl_dpo_vft,
1100 nbr_incomplete_nodes);