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 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;
199 adj_nbr_evaluate_feature (adj_get_index(adj));
204 * adj_nbr_add_or_lock
206 * Add an adjacency for the neighbour requested.
208 * The key for an adj is:
209 * - the Next-hops protocol (i.e. v4 or v6)
210 * - the address of the next-hop
211 * - the interface the next-hop is reachable through
214 adj_nbr_add_or_lock (fib_protocol_t nh_proto,
215 vnet_link_t link_type,
216 const ip46_address_t *nh_addr,
219 adj_index_t adj_index;
222 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
224 if (ADJ_INDEX_INVALID == adj_index)
228 vnm = vnet_get_main();
229 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
230 adj_index = adj_get_index(adj);
233 vnet_rewrite_init(vnm, sw_if_index,
234 adj_get_nd_node(nh_proto),
235 vnet_tx_node_index_for_sw_interface(vnm, sw_if_index),
236 &adj->rewrite_header);
239 * we need a rewrite where the destination IP address is converted
240 * to the appropriate link-layer address. This is interface specific.
241 * So ask the interface to do it.
243 vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
254 adj_nbr_add_or_lock_w_rewrite (fib_protocol_t nh_proto,
255 vnet_link_t link_type,
256 const ip46_address_t *nh_addr,
260 adj_index_t adj_index;
263 adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
265 if (ADJ_INDEX_INVALID == adj_index)
267 adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
268 adj->rewrite_header.sw_if_index = sw_if_index;
272 adj = adj_get(adj_index);
275 adj_lock(adj_get_index(adj));
276 adj_nbr_update_rewrite(adj_get_index(adj),
277 ADJ_NBR_REWRITE_FLAG_COMPLETE,
280 return (adj_get_index(adj));
284 * adj_nbr_update_rewrite
286 * Update the adjacency's rewrite string. A NULL string implies the
287 * rewirte is reset (i.e. when ARP/ND etnry is gone).
288 * NB: the adj being updated may be handling traffic in the DP.
291 adj_nbr_update_rewrite (adj_index_t adj_index,
292 adj_nbr_rewrite_flag_t flags,
297 ASSERT(ADJ_INDEX_INVALID != adj_index);
299 adj = adj_get(adj_index);
301 if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
304 * update the adj's rewrite string and build the arc
305 * from the rewrite node to the interface's TX node
307 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_REWRITE,
308 adj_get_rewrite_node(adj->ia_link),
309 vnet_tx_node_index_for_sw_interface(
311 adj->rewrite_header.sw_if_index),
316 adj_nbr_update_rewrite_internal(adj, IP_LOOKUP_NEXT_ARP,
317 adj_get_nd_node(adj->ia_nh_proto),
318 vnet_tx_node_index_for_sw_interface(
320 adj->rewrite_header.sw_if_index),
326 * adj_nbr_update_rewrite_internal
328 * Update the adjacency's rewrite string. A NULL string implies the
329 * rewirte is reset (i.e. when ARP/ND etnry is gone).
330 * NB: the adj being updated may be handling traffic in the DP.
333 adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
334 ip_lookup_next_t adj_next_index,
339 ip_adjacency_t *walk_adj;
345 vm = vlib_get_main();
346 old_next = adj->lookup_next_index;
348 walk_ai = adj_get_index(adj);
349 if (VNET_LINK_MPLS == adj->ia_link)
352 * The link type MPLS has no children in the control plane graph, it only
353 * has children in the data-palne graph. The backwalk is up the former.
354 * So we need to walk from its IP cousin.
356 walk_ai = adj_nbr_find(adj->ia_nh_proto,
357 fib_proto_to_link(adj->ia_nh_proto),
358 &adj->sub_type.nbr.next_hop,
359 adj->rewrite_header.sw_if_index);
363 * Don't call the walk re-entrantly
365 if (ADJ_INDEX_INVALID != walk_ai)
367 walk_adj = adj_get(walk_ai);
368 if (ADJ_FLAG_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
375 * Prevent re-entrant walk of the same adj
377 walk_adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
387 * lock the adjacencies that are affected by updates this walk will provoke.
388 * Since the aim of the walk is to update children to link to a different
389 * DPO, this adj will no longer be in use and its lock count will drop to 0.
390 * We don't want it to be deleted as part of this endevour.
392 adj_lock(adj_get_index(adj));
396 * Updating a rewrite string is not atomic;
397 * - the rewrite string is too long to write in one instruction
398 * - when swapping from incomplete to complete, we also need to update
399 * the VLIB graph next-index of the adj.
400 * ideally we would only want to suspend forwarding via this adj whilst we
401 * do this, but we do not have that level of granularity - it's suspend all
402 * worker threads or nothing.
403 * The other chioces are:
404 * - to mark the adj down and back walk so child load-balances drop this adj
406 * - update the next_node index of this adj to point to error-drop
407 * both of which will mean for MAC change we will drop for this adj
408 * which is not acceptable. However, when the adj changes type (from
409 * complete to incomplete and vice-versa) the child DPOs, which have the
410 * VLIB graph next node index, will be sending packets to the wrong graph
411 * node. So from the options above, updating the next_node of the adj to
412 * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
413 * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
414 * (i.e. a rewrite adj in the arp node). This is not enforcable. Getting it
415 * wrong will lead to hard to find bugs since its a race condition. So we
416 * choose the more reliable method of updating the children to use the drop,
417 * then switching adj's type, then updating the children again. Did I mention
418 * that this doesn't happen often...
419 * So we need to distinguish between the two cases:
421 * 2 - adj type change
424 old_next != adj_next_index &&
425 ADJ_INDEX_INVALID != walk_ai)
428 * the adj is changing type. we need to fix all children so that they
429 * stack momentarily on a drop, while the adj changes. If we don't do
430 * this the children will send packets to a VLIB graph node that does
431 * not correspond to the adj's type - and it goes downhill from there.
433 fib_node_back_walk_ctx_t bw_ctx = {
434 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
436 * force this walk to be synchrous. if we don't and a node in the graph
437 * (a heavily shared path-list) chooses to back-ground the walk (make it
438 * async) then it will pause and we will do the adj update below, before
439 * all the children are updated. not good.
441 .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
444 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
448 * If we are just updating the MAC string of the adj (which we also can't
449 * do atomically), then we need to stop packets switching through the adj.
450 * We can't do that on a per-adj basis, so it's all the packets.
451 * If we are updating the type, and we walked back to the children above,
452 * then this barrier serves to flush the queues/frames.
454 vlib_worker_thread_barrier_sync(vm);
456 adj->lookup_next_index = adj_next_index;
461 * new rewrite provided.
462 * fill in the adj's rewrite string, and build the VLIB graph arc.
464 vnet_rewrite_set_data_internal(&adj->rewrite_header,
465 sizeof(adj->rewrite_data),
472 vnet_rewrite_clear_data_internal(&adj->rewrite_header,
473 sizeof(adj->rewrite_data));
475 adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
480 * done with the rewirte update - let the workers loose.
482 vlib_worker_thread_barrier_release(vm);
485 (old_next != adj->lookup_next_index) &&
486 (ADJ_INDEX_INVALID != walk_ai))
489 * backwalk to the children so they can stack on the now updated
492 fib_node_back_walk_ctx_t bw_ctx = {
493 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE,
496 fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
499 * Prevent re-entrant walk of the same adj
503 walk_adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
506 adj_unlock(adj_get_index(adj));
510 typedef struct adj_db_count_ctx_t_ {
512 } adj_db_count_ctx_t;
515 adj_db_count (BVT(clib_bihash_kv) * kvp,
518 adj_db_count_ctx_t * ctx = arg;
523 adj_nbr_db_size (void)
525 adj_db_count_ctx_t ctx = {
528 fib_protocol_t proto;
531 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
533 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
535 if (NULL != adj_nbr_tables[proto][sw_if_index])
537 BV(clib_bihash_foreach_key_value_pair) (
538 adj_nbr_tables[proto][sw_if_index],
548 * @brief Context for a walk of the adjacency neighbour DB
550 typedef struct adj_walk_ctx_t_
552 adj_walk_cb_t awc_cb;
557 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
560 adj_walk_ctx_t *ctx = arg;
562 // FIXME: can't stop early...
563 ctx->awc_cb(kvp->value, ctx->awc_ctx);
567 adj_nbr_walk (u32 sw_if_index,
568 fib_protocol_t adj_nh_proto,
572 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
575 adj_walk_ctx_t awc = {
580 BV(clib_bihash_foreach_key_value_pair) (
581 adj_nbr_tables[adj_nh_proto][sw_if_index],
587 * @brief Context for a walk of the adjacency neighbour DB
589 typedef struct adj_walk_nh_ctx_t_
591 adj_walk_cb_t awc_cb;
593 const ip46_address_t *awc_nh;
597 adj_nbr_walk_nh_cb (BVT(clib_bihash_kv) * kvp,
601 adj_walk_nh_ctx_t *ctx = arg;
603 adj = adj_get(kvp->value);
605 if (!ip46_address_cmp(&adj->sub_type.nbr.next_hop, ctx->awc_nh))
606 ctx->awc_cb(kvp->value, ctx->awc_ctx);
610 * @brief Walk adjacencies on a link with a given v4 next-hop.
611 * that is visit the adjacencies with different link types.
614 adj_nbr_walk_nh4 (u32 sw_if_index,
615 const ip4_address_t *addr,
619 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
622 ip46_address_t nh = {
626 adj_walk_nh_ctx_t awc = {
632 BV(clib_bihash_foreach_key_value_pair) (
633 adj_nbr_tables[FIB_PROTOCOL_IP4][sw_if_index],
639 * @brief Walk adjacencies on a link with a given v6 next-hop.
640 * that is visit the adjacencies with different link types.
643 adj_nbr_walk_nh6 (u32 sw_if_index,
644 const ip6_address_t *addr,
648 if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
651 ip46_address_t nh = {
655 adj_walk_nh_ctx_t awc = {
661 BV(clib_bihash_foreach_key_value_pair) (
662 adj_nbr_tables[FIB_PROTOCOL_IP6][sw_if_index],
668 * @brief Walk adjacencies on a link with a given next-hop.
669 * that is visit the adjacencies with different link types.
672 adj_nbr_walk_nh (u32 sw_if_index,
673 fib_protocol_t adj_nh_proto,
674 const ip46_address_t *nh,
678 if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
681 adj_walk_nh_ctx_t awc = {
687 BV(clib_bihash_foreach_key_value_pair) (
688 adj_nbr_tables[adj_nh_proto][sw_if_index],
694 * Flags associated with the interface state walks
696 typedef enum adj_nbr_interface_flags_t_
698 ADJ_NBR_INTERFACE_UP = (1 << 0),
699 } adj_nbr_interface_flags_t;
702 * Context for the state change walk of the DB
704 typedef struct adj_nbr_interface_state_change_ctx_t_
707 * Flags on the interface
709 adj_nbr_interface_flags_t flags;
710 } adj_nbr_interface_state_change_ctx_t;
713 adj_nbr_interface_state_change_one (adj_index_t ai,
717 * Back walk the graph to inform the forwarding entries
718 * that this interface state has changed. Do this synchronously
719 * since this is the walk that provides convergence
721 adj_nbr_interface_state_change_ctx_t *ctx = arg;
723 fib_node_back_walk_ctx_t bw_ctx = {
724 .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
725 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP :
726 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN),
728 * the force sync applies only as far as the first fib_entry.
729 * And it's the fib_entry's we need to converge away from
730 * the adjacencies on the now down link
732 .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
733 FIB_NODE_BW_FLAG_FORCE_SYNC :
737 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
739 return (ADJ_WALK_RC_CONTINUE);
743 * @brief Registered function for SW interface state changes
745 static clib_error_t *
746 adj_nbr_sw_interface_state_change (vnet_main_t * vnm,
750 fib_protocol_t proto;
753 * walk each adj on the interface and trigger a walk from that adj
755 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
757 adj_nbr_interface_state_change_ctx_t ctx = {
758 .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
759 ADJ_NBR_INTERFACE_UP :
763 adj_nbr_walk(sw_if_index, proto,
764 adj_nbr_interface_state_change_one,
771 VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(
772 adj_nbr_sw_interface_state_change,
773 VNET_ITF_FUNC_PRIORITY_HIGH);
776 * @brief Invoked on each SW interface of a HW interface when the
777 * HW interface state changes
780 adj_nbr_hw_sw_interface_state_change (vnet_main_t * vnm,
784 adj_nbr_interface_state_change_ctx_t *ctx = arg;
785 fib_protocol_t proto;
788 * walk each adj on the interface and trigger a walk from that adj
790 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
792 adj_nbr_walk(sw_if_index, proto,
793 adj_nbr_interface_state_change_one,
799 * @brief Registered callback for HW interface state changes
801 static clib_error_t *
802 adj_nbr_hw_interface_state_change (vnet_main_t * vnm,
807 * walk SW interface on the HW
809 adj_nbr_interface_state_change_ctx_t ctx = {
810 .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
811 ADJ_NBR_INTERFACE_UP :
815 vnet_hw_interface_walk_sw(vnm, hw_if_index,
816 adj_nbr_hw_sw_interface_state_change,
822 VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(
823 adj_nbr_hw_interface_state_change,
824 VNET_ITF_FUNC_PRIORITY_HIGH);
827 adj_nbr_interface_delete_one (adj_index_t ai,
831 * Back walk the graph to inform the forwarding entries
832 * that this interface has been deleted.
834 fib_node_back_walk_ctx_t bw_ctx = {
835 .fnbw_reason = FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE,
838 fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
840 return (ADJ_WALK_RC_CONTINUE);
844 * adj_nbr_interface_add_del
846 * Registered to receive interface Add and delete notifications
848 static clib_error_t *
849 adj_nbr_interface_add_del (vnet_main_t * vnm,
853 fib_protocol_t proto;
858 * not interested in interface additions. we will not back walk
859 * to resolve paths through newly added interfaces. Why? The control
860 * plane should have the brains to add interfaces first, then routes.
861 * So the case where there are paths with a interface that matches
862 * one just created is the case where the path resolved through an
863 * interface that was deleted, and still has not been removed. The
864 * new interface added, is NO GUARANTEE that the interface being
865 * added now, even though it may have the same sw_if_index, is the
866 * same interface that the path needs. So tough!
867 * If the control plane wants these routes to resolve it needs to
868 * remove and add them again.
873 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
875 adj_nbr_walk(sw_if_index, proto,
876 adj_nbr_interface_delete_one,
884 VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del);
888 adj_nbr_show_one (adj_index_t ai,
891 vlib_cli_output (arg, "[@%d] %U",
893 format_ip_adjacency, ai,
894 FORMAT_IP_ADJACENCY_NONE);
896 return (ADJ_WALK_RC_CONTINUE);
899 static clib_error_t *
900 adj_nbr_show (vlib_main_t * vm,
901 unformat_input_t * input,
902 vlib_cli_command_t * cmd)
904 adj_index_t ai = ADJ_INDEX_INVALID;
905 u32 sw_if_index = ~0;
907 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
909 if (unformat (input, "%d", &ai))
911 else if (unformat (input, "%U",
912 unformat_vnet_sw_interface, vnet_get_main(),
919 if (ADJ_INDEX_INVALID != ai)
921 vlib_cli_output (vm, "[@%d] %U",
923 format_ip_adjacency, ai,
924 FORMAT_IP_ADJACENCY_DETAIL);
926 else if (~0 != sw_if_index)
928 fib_protocol_t proto;
930 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
932 adj_nbr_walk(sw_if_index, proto,
939 fib_protocol_t proto;
941 for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
943 vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
945 adj_nbr_walk(sw_if_index, proto,
956 * Show all neighbour adjacencies.
958 * @cliexstart{sh adj nbr}
959 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
960 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
961 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
962 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
965 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
966 .path = "show adj nbr",
967 .short_help = "show adj nbr [<adj_index>] [interface]",
968 .function = adj_nbr_show,
972 adj_proto_to_46 (fib_protocol_t proto)
976 case FIB_PROTOCOL_IP4:
977 return (IP46_TYPE_IP4);
978 case FIB_PROTOCOL_IP6:
979 return (IP46_TYPE_IP6);
981 return (IP46_TYPE_IP4);
983 return (IP46_TYPE_IP4);
987 format_adj_nbr_incomplete (u8* s, va_list *ap)
989 index_t index = va_arg(*ap, index_t);
990 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
991 vnet_main_t * vnm = vnet_get_main();
992 ip_adjacency_t * adj = adj_get(index);
994 s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
995 s = format (s, ": via %U",
996 format_ip46_address, &adj->sub_type.nbr.next_hop,
997 adj_proto_to_46(adj->ia_nh_proto));
998 s = format (s, " %U",
999 format_vnet_sw_interface_name,
1001 vnet_get_sw_interface(vnm,
1002 adj->rewrite_header.sw_if_index));
1008 format_adj_nbr (u8* s, va_list *ap)
1010 index_t index = va_arg(*ap, index_t);
1011 CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
1012 ip_adjacency_t * adj = adj_get(index);
1014 s = format (s, "%U", format_vnet_link, adj->ia_link);
1015 s = format (s, " via %U ",
1016 format_ip46_address, &adj->sub_type.nbr.next_hop,
1017 adj_proto_to_46(adj->ia_nh_proto));
1018 s = format (s, "%U",
1019 format_vnet_rewrite,
1020 &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
1026 adj_dpo_lock (dpo_id_t *dpo)
1028 adj_lock(dpo->dpoi_index);
1031 adj_dpo_unlock (dpo_id_t *dpo)
1033 adj_unlock(dpo->dpoi_index);
1039 fib_show_memory_usage("Adjacency",
1040 pool_elts(adj_pool),
1042 sizeof(ip_adjacency_t));
1045 const static dpo_vft_t adj_nbr_dpo_vft = {
1046 .dv_lock = adj_dpo_lock,
1047 .dv_unlock = adj_dpo_unlock,
1048 .dv_format = format_adj_nbr,
1049 .dv_mem_show = adj_mem_show,
1051 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1052 .dv_lock = adj_dpo_lock,
1053 .dv_unlock = adj_dpo_unlock,
1054 .dv_format = format_adj_nbr_incomplete,
1058 * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1061 * this means that these graph nodes are ones from which a nbr is the
1062 * parent object in the DPO-graph.
1064 const static char* const nbr_ip4_nodes[] =
1069 const static char* const nbr_ip6_nodes[] =
1074 const static char* const nbr_mpls_nodes[] =
1079 const static char* const nbr_ethernet_nodes[] =
1084 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1086 [DPO_PROTO_IP4] = nbr_ip4_nodes,
1087 [DPO_PROTO_IP6] = nbr_ip6_nodes,
1088 [DPO_PROTO_MPLS] = nbr_mpls_nodes,
1089 [DPO_PROTO_ETHERNET] = nbr_ethernet_nodes,
1092 const static char* const nbr_incomplete_ip4_nodes[] =
1097 const static char* const nbr_incomplete_ip6_nodes[] =
1099 "ip6-discover-neighbor",
1102 const static char* const nbr_incomplete_mpls_nodes[] =
1104 "mpls-adj-incomplete",
1108 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1110 [DPO_PROTO_IP4] = nbr_incomplete_ip4_nodes,
1111 [DPO_PROTO_IP6] = nbr_incomplete_ip6_nodes,
1112 [DPO_PROTO_MPLS] = nbr_incomplete_mpls_nodes,
1116 adj_nbr_module_init (void)
1118 dpo_register(DPO_ADJACENCY,
1121 dpo_register(DPO_ADJACENCY_INCOMPLETE,
1122 &adj_nbr_incompl_dpo_vft,
1123 nbr_incomplete_nodes);