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);
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 vec_validate (fm->feature_count_by_sw_if_index[arc_index], sw_if_index);
166 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;
171 adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
176 static ip_adjacency_t*
177 adj_nbr_alloc (fib_protocol_t nh_proto,
178 vnet_link_t link_type,
179 const ip46_address_t *nh_addr,
184 adj = adj_alloc(nh_proto);
186 adj_nbr_insert(nh_proto, link_type, nh_addr,
191 * since we just added the ADJ we have no rewrite string for it,
194 adj->lookup_next_index = IP_LOOKUP_NEXT_ARP;
195 adj->sub_type.nbr.next_hop = *nh_addr;
196 adj->ia_link = link_type;
197 adj->ia_nh_proto = nh_proto;
198 adj->rewrite_header.sw_if_index = sw_if_index;
199 memset(&adj->sub_type.midchain.next_dpo, 0,
200 sizeof(adj->sub_type.midchain.next_dpo));
202 adj_nbr_evaluate_feature (adj_get_index(adj));
207 * adj_nbr_add_or_lock
209 * Add an adjacency for the neighbour requested.
211 * The key for an adj is:
212 * - the Next-hops protocol (i.e. v4 or v6)
213 * - the address of the next-hop
214 * - the interface the next-hop is reachable through
217 adj_nbr_add_or_lock (fib_protocol_t nh_proto,
218 vnet_link_t link_type,
219 const ip46_address_t *nh_addr,
222 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)
231 vnm = vnet_get_main();
232 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
233 adj_index = adj_get_index(adj);
236 vnet_rewrite_init(vnm, sw_if_index,
237 adj_get_nd_node(nh_proto),
238 vnet_tx_node_index_for_sw_interface(vnm, sw_if_index),
239 &adj->rewrite_header);
242 * we need a rewrite where the destination IP address is converted
243 * to the appropriate link-layer address. This is interface specific.
244 * So ask the interface to do it.
246 vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
257 adj_nbr_add_or_lock_w_rewrite (fib_protocol_t nh_proto,
258 vnet_link_t link_type,
259 const ip46_address_t *nh_addr,
263 adj_index_t adj_index;
266 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
268 if (ADJ_INDEX_INVALID == adj_index)
270 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
271 adj->rewrite_header.sw_if_index = sw_if_index;
275 adj = adj_get(adj_index);
278 adj_lock(adj_get_index(adj));
279 adj_nbr_update_rewrite(adj_get_index(adj),
280 ADJ_NBR_REWRITE_FLAG_COMPLETE,
283 return (adj_get_index(adj));
287 * adj_nbr_update_rewrite
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 (adj_index_t adj_index,
295 adj_nbr_rewrite_flag_t flags,
300 ASSERT(ADJ_INDEX_INVALID != adj_index);
302 adj = adj_get(adj_index);
304 if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
307 * update the adj's rewrite string and build the arc
308 * from the rewrite node to the interface's TX node
310 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_REWRITE,
311 adj_get_rewrite_node(adj->ia_link),
312 vnet_tx_node_index_for_sw_interface(
314 adj->rewrite_header.sw_if_index),
319 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_ARP,
320 adj_get_nd_node(adj->ia_nh_proto),
321 vnet_tx_node_index_for_sw_interface(
323 adj->rewrite_header.sw_if_index),
329 * adj_nbr_update_rewrite_internal
331 * Update the adjacency's rewrite string. A NULL string implies the
332 * rewirte is reset (i.e. when ARP/ND etnry is gone).
333 * NB: the adj being updated may be handling traffic in the DP.
336 adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
342 ip_adjacency_t *walk_adj;
348 vm = vlib_get_main();
349 old_next = adj->lookup_next_index;
351 walk_ai = adj_get_index(adj);
352 if (VNET_LINK_MPLS == adj->ia_link)
355 * The link type MPLS has no children in the control plane graph, it only
356 * has children in the data-palne graph. The backwalk is up the former.
357 * So we need to walk from its IP cousin.
359 walk_ai = adj_nbr_find(adj->ia_nh_proto,
360 fib_proto_to_link(adj->ia_nh_proto),
361 &adj->sub_type.nbr.next_hop,
362 adj->rewrite_header.sw_if_index);
366 * Don't call the walk re-entrantly
368 if (ADJ_INDEX_INVALID != walk_ai)
370 walk_adj = adj_get(walk_ai);
371 if (IP_ADJ_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
378 * Prevent re-entrant walk of the same adj
380 walk_adj->ia_flags |= IP_ADJ_SYNC_WALK_ACTIVE;
390 * lock the adjacencies that are affected by updates this walk will provoke.
391 * Since the aim of the walk is to update children to link to a different
392 * DPO, this adj will no longer be in use and its lock count will drop to 0.
393 * We don't want it to be deleted as part of this endevour.
395 adj_lock(adj_get_index(adj));
399 * Updating a rewrite string is not atomic;
400 * - the rewrite string is too long to write in one instruction
401 * - when swapping from incomplete to complete, we also need to update
402 * the VLIB graph next-index of the adj.
403 * ideally we would only want to suspend forwarding via this adj whilst we
404 * do this, but we do not have that level of granularity - it's suspend all
405 * worker threads or nothing.
406 * The other chioces are:
407 * - to mark the adj down and back walk so child load-balances drop this adj
409 * - update the next_node index of this adj to point to error-drop
410 * both of which will mean for MAC change we will drop for this adj
411 * which is not acceptable. However, when the adj changes type (from
412 * complete to incomplete and vice-versa) the child DPOs, which have the
413 * VLIB graph next node index, will be sending packets to the wrong graph
414 * node. So from the options above, updating the next_node of the adj to
415 * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
416 * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
417 * (i.e. a rewrite adj in the arp node). This is not enforcable. Getting it
418 * wrong will lead to hard to find bugs since its a race condition. So we
419 * choose the more reliable method of updating the children to use the drop,
420 * then switching adj's type, then updating the children again. Did I mention
421 * that this doesn't happen often...
422 * So we need to distinguish between the two cases:
424 * 2 - adj type change
427 old_next != adj_next_index &&
428 ADJ_INDEX_INVALID != walk_ai)
431 * the adj is changing type. we need to fix all children so that they
432 * stack momentarily on a drop, while the adj changes. If we don't do
433 * this the children will send packets to a VLIB graph node that does
434 * not correspond to the adj's type - and it goes downhill from there.
436 fib_node_back_walk_ctx_t bw_ctx = {
437 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
439 * force this walk to be synchrous. if we don't and a node in the graph
440 * (a heavily shared path-list) chooses to back-ground the walk (make it
441 * async) then it will pause and we will do the adj update below, before
442 * all the children are updated. not good.
444 .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
447 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
451 * If we are just updating the MAC string of the adj (which we also can't
452 * do atomically), then we need to stop packets switching through the adj.
453 * We can't do that on a per-adj basis, so it's all the packets.
454 * If we are updating the type, and we walked back to the children above,
455 * then this barrier serves to flush the queues/frames.
457 vlib_worker_thread_barrier_sync(vm);
459 adj->lookup_next_index = adj_next_index;
464 * new rewrite provided.
465 * fill in the adj's rewrite string, and build the VLIB graph arc.
467 vnet_rewrite_set_data_internal(&adj->rewrite_header,
468 sizeof(adj->rewrite_data),
475 vnet_rewrite_clear_data_internal(&adj->rewrite_header,
476 sizeof(adj->rewrite_data));
478 adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
483 * done with the rewirte update - let the workers loose.
485 vlib_worker_thread_barrier_release(vm);
488 (old_next != adj->lookup_next_index) &&
489 (ADJ_INDEX_INVALID != walk_ai))
492 * backwalk to the children so they can stack on the now updated
495 fib_node_back_walk_ctx_t bw_ctx = {
496 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE,
499 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
502 * Prevent re-entrant walk of the same adj
506 walk_adj->ia_flags &= ~IP_ADJ_SYNC_WALK_ACTIVE;
509 adj_unlock(adj_get_index(adj));
513 typedef struct adj_db_count_ctx_t_ {
515 } adj_db_count_ctx_t;
518 adj_db_count (BVT(clib_bihash_kv) * kvp,
521 adj_db_count_ctx_t * ctx = arg;
526 adj_nbr_db_size (void)
528 adj_db_count_ctx_t ctx = {
531 fib_protocol_t proto;
534 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
536 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
538 if (NULL != adj_nbr_tables[proto][sw_if_index])
540 BV(clib_bihash_foreach_key_value_pair) (
541 adj_nbr_tables[proto][sw_if_index],
551 * @brief Context for a walk of the adjacency neighbour DB
553 typedef struct adj_walk_ctx_t_
555 adj_walk_cb_t awc_cb;
560 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
563 adj_walk_ctx_t *ctx = arg;
565 // FIXME: can't stop early...
566 ctx->awc_cb(kvp->value, ctx->awc_ctx);
570 adj_nbr_walk (u32 sw_if_index,
571 fib_protocol_t adj_nh_proto,
575 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
578 adj_walk_ctx_t awc = {
583 BV(clib_bihash_foreach_key_value_pair) (
584 adj_nbr_tables[adj_nh_proto][sw_if_index],
590 * @brief Context for a walk of the adjacency neighbour DB
592 typedef struct adj_walk_nh_ctx_t_
594 adj_walk_cb_t awc_cb;
596 const ip46_address_t *awc_nh;
600 adj_nbr_walk_nh_cb (BVT(clib_bihash_kv) * kvp,
604 adj_walk_nh_ctx_t *ctx = arg;
606 adj = adj_get(kvp->value);
608 if (!ip46_address_cmp(&adj->sub_type.nbr.next_hop, ctx->awc_nh))
609 ctx->awc_cb(kvp->value, ctx->awc_ctx);
613 * @brief Walk adjacencies on a link with a given v4 next-hop.
614 * that is visit the adjacencies with different link types.
617 adj_nbr_walk_nh4 (u32 sw_if_index,
618 const ip4_address_t *addr,
622 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
625 ip46_address_t nh = {
629 adj_walk_nh_ctx_t awc = {
635 BV(clib_bihash_foreach_key_value_pair) (
636 adj_nbr_tables[FIB_PROTOCOL_IP4][sw_if_index],
642 * @brief Walk adjacencies on a link with a given v6 next-hop.
643 * that is visit the adjacencies with different link types.
646 adj_nbr_walk_nh6 (u32 sw_if_index,
647 const ip6_address_t *addr,
651 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
654 ip46_address_t nh = {
658 adj_walk_nh_ctx_t awc = {
664 BV(clib_bihash_foreach_key_value_pair) (
665 adj_nbr_tables[FIB_PROTOCOL_IP6][sw_if_index],
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 adj_walk_nh_ctx_t awc = {
690 BV(clib_bihash_foreach_key_value_pair) (
691 adj_nbr_tables[adj_nh_proto][sw_if_index],
697 * Flags associated with the interface state walks
699 typedef enum adj_nbr_interface_flags_t_
701 ADJ_NBR_INTERFACE_UP = (1 << 0),
702 } adj_nbr_interface_flags_t;
705 * Context for the state change walk of the DB
707 typedef struct adj_nbr_interface_state_change_ctx_t_
710 * Flags on the interface
712 adj_nbr_interface_flags_t flags;
713 } adj_nbr_interface_state_change_ctx_t;
716 adj_nbr_interface_state_change_one (adj_index_t ai,
720 * Back walk the graph to inform the forwarding entries
721 * that this interface state has changed. Do this synchronously
722 * since this is the walk that provides convergence
724 adj_nbr_interface_state_change_ctx_t *ctx = arg;
726 fib_node_back_walk_ctx_t bw_ctx = {
727 .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
728 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP :
729 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN),
731 * the force sync applies only as far as the first fib_entry.
732 * And it's the fib_entry's we need to converge away from
733 * the adjacencies on the now down link
735 .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
736 FIB_NODE_BW_FLAG_FORCE_SYNC :
740 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
742 return (ADJ_WALK_RC_CONTINUE);
746 * @brief Registered function for SW interface state changes
748 static clib_error_t *
749 adj_nbr_sw_interface_state_change (vnet_main_t * vnm,
753 fib_protocol_t proto;
756 * walk each adj on the interface and trigger a walk from that adj
758 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
760 adj_nbr_interface_state_change_ctx_t ctx = {
761 .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
762 ADJ_NBR_INTERFACE_UP :
766 adj_nbr_walk(sw_if_index, proto,
767 adj_nbr_interface_state_change_one,
774 VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(
775 adj_nbr_sw_interface_state_change,
776 VNET_ITF_FUNC_PRIORITY_HIGH);
779 * @brief Invoked on each SW interface of a HW interface when the
780 * HW interface state changes
783 adj_nbr_hw_sw_interface_state_change (vnet_main_t * vnm,
787 adj_nbr_interface_state_change_ctx_t *ctx = arg;
788 fib_protocol_t proto;
791 * walk each adj on the interface and trigger a walk from that adj
793 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
795 adj_nbr_walk(sw_if_index, proto,
796 adj_nbr_interface_state_change_one,
802 * @brief Registered callback for HW interface state changes
804 static clib_error_t *
805 adj_nbr_hw_interface_state_change (vnet_main_t * vnm,
810 * walk SW interface on the HW
812 adj_nbr_interface_state_change_ctx_t ctx = {
813 .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
814 ADJ_NBR_INTERFACE_UP :
818 vnet_hw_interface_walk_sw(vnm, hw_if_index,
819 adj_nbr_hw_sw_interface_state_change,
825 VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(
826 adj_nbr_hw_interface_state_change,
827 VNET_ITF_FUNC_PRIORITY_HIGH);
830 adj_nbr_interface_delete_one (adj_index_t ai,
834 * Back walk the graph to inform the forwarding entries
835 * that this interface has been deleted.
837 fib_node_back_walk_ctx_t bw_ctx = {
838 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE,
841 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
843 return (ADJ_WALK_RC_CONTINUE);
847 * adj_nbr_interface_add_del
849 * Registered to receive interface Add and delete notifications
851 static clib_error_t *
852 adj_nbr_interface_add_del (vnet_main_t * vnm,
856 fib_protocol_t proto;
861 * not interested in interface additions. we will not back walk
862 * to resolve paths through newly added interfaces. Why? The control
863 * plane should have the brains to add interfaces first, then routes.
864 * So the case where there are paths with a interface that matches
865 * one just created is the case where the path resolved through an
866 * interface that was deleted, and still has not been removed. The
867 * new interface added, is NO GUARANTEE that the interface being
868 * added now, even though it may have the same sw_if_index, is the
869 * same interface that the path needs. So tough!
870 * If the control plane wants these routes to resolve it needs to
871 * remove and add them again.
876 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
878 adj_nbr_walk(sw_if_index, proto,
879 adj_nbr_interface_delete_one,
887 VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del);
891 adj_nbr_show_one (adj_index_t ai,
894 vlib_cli_output (arg, "[@%d] %U",
896 format_ip_adjacency, ai,
897 FORMAT_IP_ADJACENCY_NONE);
899 return (ADJ_WALK_RC_CONTINUE);
902 static clib_error_t *
903 adj_nbr_show (vlib_main_t * vm,
904 unformat_input_t * input,
905 vlib_cli_command_t * cmd)
907 adj_index_t ai = ADJ_INDEX_INVALID;
908 u32 sw_if_index = ~0;
910 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
912 if (unformat (input, "%d", &ai))
914 else if (unformat (input, "%U",
915 unformat_vnet_sw_interface, vnet_get_main(),
922 if (ADJ_INDEX_INVALID != ai)
924 vlib_cli_output (vm, "[@%d] %U",
926 format_ip_adjacency, ai,
927 FORMAT_IP_ADJACENCY_DETAIL);
929 else if (~0 != sw_if_index)
931 fib_protocol_t proto;
933 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
935 adj_nbr_walk(sw_if_index, proto,
942 fib_protocol_t proto;
944 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
946 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
948 adj_nbr_walk(sw_if_index, proto,
959 * Show all neighbour adjacencies.
961 * @cliexstart{sh adj nbr}
962 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
963 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
964 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
965 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
968 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
969 .path = "show adj nbr",
970 .short_help = "show adj nbr [<adj_index>] [interface]",
971 .function = adj_nbr_show,
975 adj_proto_to_46 (fib_protocol_t proto)
979 case FIB_PROTOCOL_IP4:
980 return (IP46_TYPE_IP4);
981 case FIB_PROTOCOL_IP6:
982 return (IP46_TYPE_IP6);
984 return (IP46_TYPE_IP4);
986 return (IP46_TYPE_IP4);
990 format_adj_nbr_incomplete (u8* s, va_list *ap)
992 index_t index = va_arg(*ap, index_t);
993 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
994 vnet_main_t * vnm = vnet_get_main();
995 ip_adjacency_t * adj = adj_get(index);
997 s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
998 s = format (s, ": via %U",
999 format_ip46_address, &adj->sub_type.nbr.next_hop,
1000 adj_proto_to_46(adj->ia_nh_proto));
1001 s = format (s, " %U",
1002 format_vnet_sw_interface_name,
1004 vnet_get_sw_interface(vnm,
1005 adj->rewrite_header.sw_if_index));
1011 format_adj_nbr (u8* s, va_list *ap)
1013 index_t index = va_arg(*ap, index_t);
1014 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
1015 ip_adjacency_t * adj = adj_get(index);
1017 s = format (s, "%U", format_vnet_link, adj->ia_link);
1018 s = format (s, " via %U ",
1019 format_ip46_address, &adj->sub_type.nbr.next_hop,
1020 adj_proto_to_46(adj->ia_nh_proto));
1021 s = format (s, "%U",
1022 format_vnet_rewrite,
1023 &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
1029 adj_dpo_lock (dpo_id_t *dpo)
1031 adj_lock(dpo->dpoi_index);
1034 adj_dpo_unlock (dpo_id_t *dpo)
1036 adj_unlock(dpo->dpoi_index);
1042 fib_show_memory_usage("Adjacency",
1043 pool_elts(adj_pool),
1045 sizeof(ip_adjacency_t));
1048 const static dpo_vft_t adj_nbr_dpo_vft = {
1049 .dv_lock = adj_dpo_lock,
1050 .dv_unlock = adj_dpo_unlock,
1051 .dv_format = format_adj_nbr,
1052 .dv_mem_show = adj_mem_show,
1054 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1055 .dv_lock = adj_dpo_lock,
1056 .dv_unlock = adj_dpo_unlock,
1057 .dv_format = format_adj_nbr_incomplete,
1061 * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1064 * this means that these graph nodes are ones from which a nbr is the
1065 * parent object in the DPO-graph.
1067 const static char* const nbr_ip4_nodes[] =
1072 const static char* const nbr_ip6_nodes[] =
1077 const static char* const nbr_mpls_nodes[] =
1082 const static char* const nbr_ethernet_nodes[] =
1087 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1089 [DPO_PROTO_IP4] = nbr_ip4_nodes,
1090 [DPO_PROTO_IP6] = nbr_ip6_nodes,
1091 [DPO_PROTO_MPLS] = nbr_mpls_nodes,
1092 [DPO_PROTO_ETHERNET] = nbr_ethernet_nodes,
1095 const static char* const nbr_incomplete_ip4_nodes[] =
1100 const static char* const nbr_incomplete_ip6_nodes[] =
1102 "ip6-discover-neighbor",
1105 const static char* const nbr_incomplete_mpls_nodes[] =
1107 "mpls-adj-incomplete",
1111 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1113 [DPO_PROTO_IP4] = nbr_incomplete_ip4_nodes,
1114 [DPO_PROTO_IP6] = nbr_incomplete_ip6_nodes,
1115 [DPO_PROTO_MPLS] = nbr_incomplete_mpls_nodes,
1119 adj_nbr_module_init (void)
1121 dpo_register(DPO_ADJACENCY,
1124 dpo_register(DPO_ADJACENCY_INCOMPLETE,
1125 &adj_nbr_incompl_dpo_vft,
1126 nbr_incomplete_nodes);