FD.io VPP  v17.01.1-3-gc6833f8
Vector Packet Processing
adj_nbr.c
Go to the documentation of this file.
1 /*
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:
6  *
7  * http://www.apache.org/licenses/LICENSE-2.0
8  *
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.
14  */
15 
16 #include <vnet/adj/adj_nbr.h>
17 #include <vnet/adj/adj_internal.h>
19 #include <vnet/fib/fib_walk.h>
20 
21 /*
22  * Vector Hash tables of neighbour (traditional) adjacencies
23  * Key: interface(for the vector index), address (and its proto),
24  * link-type/ether-type.
25  */
26 static BVT(clib_bihash) **adj_nbr_tables[FIB_PROTOCOL_MAX];
27 
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)
31 
32 
33 #define ADJ_NBR_SET_KEY(_key, _lt, _nh) \
34 { \
35  _key.key[0] = (_nh)->as_u64[0]; \
36  _key.key[1] = (_nh)->as_u64[1]; \
37  _key.key[2] = (_lt); \
38 }
39 
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]))
43 
44 static void
45 adj_nbr_insert (fib_protocol_t nh_proto,
46  vnet_link_t link_type,
47  const ip46_address_t *nh_addr,
48  u32 sw_if_index,
49  adj_index_t adj_index)
50 {
51  BVT(clib_bihash_kv) kv;
52 
53  if (sw_if_index >= vec_len(adj_nbr_tables[nh_proto]))
54  {
55  vec_validate(adj_nbr_tables[nh_proto], sw_if_index);
56  }
57  if (NULL == adj_nbr_tables[nh_proto][sw_if_index])
58  {
59  adj_nbr_tables[nh_proto][sw_if_index] =
60  clib_mem_alloc_aligned(sizeof(BVT(clib_bihash)),
62  memset(adj_nbr_tables[nh_proto][sw_if_index],
63  0,
64  sizeof(BVT(clib_bihash)));
65 
66  BV(clib_bihash_init) (adj_nbr_tables[nh_proto][sw_if_index],
67  "Adjacency Neighbour table",
70  }
71 
72  ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
73  kv.value = adj_index;
74 
75  BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 1);
76 }
77 
78 void
80  fib_protocol_t nh_proto,
81  vnet_link_t link_type,
82  const ip46_address_t *nh_addr,
83  u32 sw_if_index)
84 {
85  BVT(clib_bihash_kv) kv;
86 
87  if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
88  return;
89 
90  ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
91  kv.value = ai;
92 
93  BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 0);
94 }
95 
96 static adj_index_t
98  vnet_link_t link_type,
99  const ip46_address_t *nh_addr,
100  u32 sw_if_index)
101 {
102  BVT(clib_bihash_kv) kv;
103 
104  ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
105 
106  if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
107  return (ADJ_INDEX_INVALID);
108 
109  if (BV(clib_bihash_search)(adj_nbr_tables[nh_proto][sw_if_index],
110  &kv, &kv) < 0)
111  {
112  return (ADJ_INDEX_INVALID);
113  }
114  else
115  {
116  return (kv.value);
117  }
118 }
119 
120 static inline u32
122 {
123  switch (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:
129  break;
130  }
131  ASSERT(0);
132  return (ip4_arp_node.index);
133 }
134 
135 static ip_adjacency_t*
137  vnet_link_t link_type,
138  const ip46_address_t *nh_addr,
139  u32 sw_if_index)
140 {
141  ip_adjacency_t *adj;
142 
143  adj = adj_alloc(nh_proto);
144 
145  adj_nbr_insert(nh_proto, link_type, nh_addr,
146  sw_if_index,
147  adj_get_index(adj));
148 
149  /*
150  * since we just added the ADJ we have no rewrite string for it,
151  * so its for ARP
152  */
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));
160 
161  return (adj);
162 }
163 
164 /*
165  * adj_add_for_nbr
166  *
167  * Add an adjacency for the neighbour requested.
168  *
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
173  */
176  vnet_link_t link_type,
177  const ip46_address_t *nh_addr,
178  u32 sw_if_index)
179 {
180  adj_index_t adj_index;
181  ip_adjacency_t *adj;
182 
183  adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
184 
185  if (ADJ_INDEX_INVALID == adj_index)
186  {
187  vnet_main_t *vnm;
188 
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);
192  adj_lock(adj_index);
193 
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);
198 
199  /*
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.
203  */
204  vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
205  }
206  else
207  {
208  adj_lock(adj_index);
209  }
210 
211  return (adj_index);
212 }
213 
216  vnet_link_t link_type,
217  const ip46_address_t *nh_addr,
218  u32 sw_if_index,
219  u8 *rewrite)
220 {
221  adj_index_t adj_index;
222  ip_adjacency_t *adj;
223 
224  adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
225 
226  if (ADJ_INDEX_INVALID == adj_index)
227  {
228  adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
229  adj->rewrite_header.sw_if_index = sw_if_index;
230  }
231  else
232  {
233  adj = adj_get(adj_index);
234  }
235 
236  adj_lock(adj_get_index(adj));
239  rewrite);
240 
241  return (adj_get_index(adj));
242 }
243 
244 /**
245  * adj_nbr_update_rewrite
246  *
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.
250  */
251 void
254  u8 *rewrite)
255 {
256  ip_adjacency_t *adj;
257 
258  ASSERT(ADJ_INDEX_INVALID != adj_index);
259 
260  adj = adj_get(adj_index);
261 
262  if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
263  {
264  /*
265  * update the adj's rewrite string and build the arc
266  * from the rewrite node to the interface's TX node
267  */
271  vnet_get_main(),
272  adj->rewrite_header.sw_if_index),
273  rewrite);
274  }
275  else
276  {
280  vnet_get_main(),
281  adj->rewrite_header.sw_if_index),
282  rewrite);
283  }
284 }
285 
286 /**
287  * adj_nbr_update_rewrite_internal
288  *
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.
292  */
293 void
295  u32 adj_next_index,
296  u32 this_node,
297  u32 next_node,
298  u8 *rewrite)
299 {
300  ip_adjacency_t *walk_adj;
301  adj_index_t walk_ai;
302  vlib_main_t * vm;
303  u32 old_next;
304  int do_walk;
305 
306  vm = vlib_get_main();
307  old_next = adj->lookup_next_index;
308 
309  walk_ai = adj_get_index(adj);
310  if (VNET_LINK_MPLS == adj->ia_link)
311  {
312  /*
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.
316  */
317  walk_ai = adj_nbr_find(adj->ia_nh_proto,
319  &adj->sub_type.nbr.next_hop,
320  adj->rewrite_header.sw_if_index);
321  }
322 
323  /*
324  * Don't call the walk re-entrantly
325  */
326  if (ADJ_INDEX_INVALID != walk_ai)
327  {
328  walk_adj = adj_get(walk_ai);
329  if (IP_ADJ_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
330  {
331  do_walk = 0;
332  }
333  else
334  {
335  /*
336  * Prevent re-entrant walk of the same adj
337  */
338  walk_adj->ia_flags |= IP_ADJ_SYNC_WALK_ACTIVE;
339  do_walk = 1;
340  }
341  }
342  else
343  {
344  do_walk = 0;
345  }
346 
347  /*
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.
352  */
353  adj_lock(adj_get_index(adj));
354  adj_lock(walk_ai);
355 
356  /*
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
366  * from the set.
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:
381  * 1 - mac change
382  * 2 - adj type change
383  */
384  if (do_walk &&
385  old_next != adj_next_index &&
386  ADJ_INDEX_INVALID != walk_ai)
387  {
388  /*
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.
393  */
394  fib_node_back_walk_ctx_t bw_ctx = {
396  /*
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.
401  */
402  .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
403  };
404 
405  fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
406  }
407 
408  /*
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.
414  */
416 
417  adj->lookup_next_index = adj_next_index;
418 
419  if (NULL != rewrite)
420  {
421  /*
422  * new rewrite provided.
423  * fill in the adj's rewrite string, and build the VLIB graph arc.
424  */
425  vnet_rewrite_set_data_internal(&adj->rewrite_header,
426  sizeof(adj->rewrite_data),
427  rewrite,
428  vec_len(rewrite));
429  vec_free(rewrite);
430  }
431  else
432  {
433  vnet_rewrite_clear_data_internal(&adj->rewrite_header,
434  sizeof(adj->rewrite_data));
435  }
436  adj->rewrite_header.node_index = this_node;
437  adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
438  this_node,
439  next_node);
440 
441  /*
442  * done with the rewirte update - let the workers loose.
443  */
445 
446  if (do_walk &&
447  (old_next != adj->lookup_next_index) &&
448  (ADJ_INDEX_INVALID != walk_ai))
449  {
450  /*
451  * backwalk to the children so they can stack on the now updated
452  * adjacency
453  */
454  fib_node_back_walk_ctx_t bw_ctx = {
456  };
457 
458  fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
459  }
460  /*
461  * Prevent re-entrant walk of the same adj
462  */
463  if (do_walk)
464  {
465  walk_adj->ia_flags &= ~IP_ADJ_SYNC_WALK_ACTIVE;
466  }
467 
469  adj_unlock(walk_ai);
470 }
471 
472 typedef struct adj_db_count_ctx_t_ {
475 
476 static void
477 adj_db_count (BVT(clib_bihash_kv) * kvp,
478  void *arg)
479 {
480  adj_db_count_ctx_t * ctx = arg;
481  ctx->count++;
482 }
483 
484 u32
486 {
487  adj_db_count_ctx_t ctx = {
488  .count = 0,
489  };
490  fib_protocol_t proto;
491  u32 sw_if_index = 0;
492 
493  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
494  {
495  vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
496  {
497  if (NULL != adj_nbr_tables[proto][sw_if_index])
498  {
500  adj_nbr_tables[proto][sw_if_index],
501  adj_db_count,
502  &ctx);
503  }
504  }
505  }
506  return (ctx.count);
507 }
508 
509 /**
510  * @brief Context for a walk of the adjacency neighbour DB
511  */
512 typedef struct adj_walk_ctx_t_
513 {
515  void *awc_ctx;
517 
518 static void
519 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
520  void *arg)
521 {
522  adj_walk_ctx_t *ctx = arg;
523 
524  // FIXME: can't stop early...
525  ctx->awc_cb(kvp->value, ctx->awc_ctx);
526 }
527 
528 void
529 adj_nbr_walk (u32 sw_if_index,
530  fib_protocol_t adj_nh_proto,
531  adj_walk_cb_t cb,
532  void *ctx)
533 {
534  if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
535  return;
536 
537  adj_walk_ctx_t awc = {
538  .awc_ctx = ctx,
539  .awc_cb = cb,
540  };
541 
543  adj_nbr_tables[adj_nh_proto][sw_if_index],
545  &awc);
546 }
547 
548 /**
549  * @brief Context for a walk of the adjacency neighbour DB
550  */
551 typedef struct adj_walk_nh_ctx_t_
552 {
554  void *awc_ctx;
555  const ip46_address_t *awc_nh;
557 
558 static void
559 adj_nbr_walk_nh_cb (BVT(clib_bihash_kv) * kvp,
560  void *arg)
561 {
562  ip_adjacency_t *adj;
563  adj_walk_nh_ctx_t *ctx = arg;
564 
565  adj = adj_get(kvp->value);
566 
567  if (!ip46_address_cmp(&adj->sub_type.nbr.next_hop, ctx->awc_nh))
568  ctx->awc_cb(kvp->value, ctx->awc_ctx);
569 }
570 
571 /**
572  * @brief Walk adjacencies on a link with a given v4 next-hop.
573  * that is visit the adjacencies with different link types.
574  */
575 void
576 adj_nbr_walk_nh4 (u32 sw_if_index,
577  const ip4_address_t *addr,
578  adj_walk_cb_t cb,
579  void *ctx)
580 {
581  if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
582  return;
583 
584  ip46_address_t nh = {
585  .ip4 = *addr,
586  };
587 
588  adj_walk_nh_ctx_t awc = {
589  .awc_ctx = ctx,
590  .awc_cb = cb,
591  .awc_nh = &nh,
592  };
593 
595  adj_nbr_tables[FIB_PROTOCOL_IP4][sw_if_index],
597  &awc);
598 }
599 
600 /**
601  * @brief Walk adjacencies on a link with a given v6 next-hop.
602  * that is visit the adjacencies with different link types.
603  */
604 void
605 adj_nbr_walk_nh6 (u32 sw_if_index,
606  const ip6_address_t *addr,
607  adj_walk_cb_t cb,
608  void *ctx)
609 {
610  if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
611  return;
612 
613  ip46_address_t nh = {
614  .ip6 = *addr,
615  };
616 
617  adj_walk_nh_ctx_t awc = {
618  .awc_ctx = ctx,
619  .awc_cb = cb,
620  .awc_nh = &nh,
621  };
622 
624  adj_nbr_tables[FIB_PROTOCOL_IP6][sw_if_index],
626  &awc);
627 }
628 
629 /**
630  * @brief Walk adjacencies on a link with a given next-hop.
631  * that is visit the adjacencies with different link types.
632  */
633 void
634 adj_nbr_walk_nh (u32 sw_if_index,
635  fib_protocol_t adj_nh_proto,
636  const ip46_address_t *nh,
637  adj_walk_cb_t cb,
638  void *ctx)
639 {
640  if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
641  return;
642 
643  adj_walk_nh_ctx_t awc = {
644  .awc_ctx = ctx,
645  .awc_cb = cb,
646  .awc_nh = nh,
647  };
648 
650  adj_nbr_tables[adj_nh_proto][sw_if_index],
652  &awc);
653 }
654 
655 /**
656  * Flags associated with the interface state walks
657  */
659 {
662 
663 /**
664  * Context for the state change walk of the DB
665  */
667 {
668  /**
669  * Flags on the interface
670  */
673 
674 static adj_walk_rc_t
676  void *arg)
677 {
678  /*
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
682  */
684 
685  fib_node_back_walk_ctx_t bw_ctx = {
686  .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
689  /*
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
693  */
694  .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
696  0),
697  };
698 
699  fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
700 
701  return (ADJ_WALK_RC_CONTINUE);
702 }
703 
704 /**
705  * @brief Registered function for SW interface state changes
706  */
707 static clib_error_t *
709  u32 sw_if_index,
710  u32 flags)
711 {
712  fib_protocol_t proto;
713 
714  /*
715  * walk each adj on the interface and trigger a walk from that adj
716  */
717  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
718  {
720  .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
722  0),
723  };
724 
725  adj_nbr_walk(sw_if_index, proto,
727  &ctx);
728  }
729 
730  return (NULL);
731 }
732 
736 
737 /**
738  * @brief Invoked on each SW interface of a HW interface when the
739  * HW interface state changes
740  */
741 static void
743  u32 sw_if_index,
744  void *arg)
745 {
747  fib_protocol_t proto;
748 
749  /*
750  * walk each adj on the interface and trigger a walk from that adj
751  */
752  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
753  {
754  adj_nbr_walk(sw_if_index, proto,
756  ctx);
757  }
758 }
759 
760 /**
761  * @brief Registered callback for HW interface state changes
762  */
763 static clib_error_t *
765  u32 hw_if_index,
766  u32 flags)
767 {
768  /*
769  * walk SW interface on the HW
770  */
772  .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
774  0),
775  };
776 
777  vnet_hw_interface_walk_sw(vnm, hw_if_index,
779  &ctx);
780 
781  return (NULL);
782 }
783 
787 
788 static adj_walk_rc_t
790  void *arg)
791 {
792  /*
793  * Back walk the graph to inform the forwarding entries
794  * that this interface has been deleted.
795  */
796  fib_node_back_walk_ctx_t bw_ctx = {
798  };
799 
800  fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
801 
802  return (ADJ_WALK_RC_CONTINUE);
803 }
804 
805 /**
806  * adj_nbr_interface_add_del
807  *
808  * Registered to receive interface Add and delete notifications
809  */
810 static clib_error_t *
812  u32 sw_if_index,
813  u32 is_add)
814 {
815  fib_protocol_t proto;
816 
817  if (is_add)
818  {
819  /*
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.
831  */
832  return (NULL);
833  }
834 
835  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
836  {
837  adj_nbr_walk(sw_if_index, proto,
839  NULL);
840  }
841 
842  return (NULL);
843 
844 }
845 
847 
848 
849 static adj_walk_rc_t
851  void *arg)
852 {
853  vlib_cli_output (arg, "[@%d] %U",
854  ai,
857 
858  return (ADJ_WALK_RC_CONTINUE);
859 }
860 
861 static clib_error_t *
863  unformat_input_t * input,
864  vlib_cli_command_t * cmd)
865 {
867  u32 sw_if_index = ~0;
868 
870  {
871  if (unformat (input, "%d", &ai))
872  ;
873  else if (unformat (input, "%U",
875  &sw_if_index))
876  ;
877  else
878  break;
879  }
880 
881  if (ADJ_INDEX_INVALID != ai)
882  {
883  vlib_cli_output (vm, "[@%d] %U",
884  ai,
887  }
888  else if (~0 != sw_if_index)
889  {
890  fib_protocol_t proto;
891 
892  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
893  {
894  adj_nbr_walk(sw_if_index, proto,
896  vm);
897  }
898  }
899  else
900  {
901  fib_protocol_t proto;
902 
903  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
904  {
905  vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
906  {
907  adj_nbr_walk(sw_if_index, proto,
909  vm);
910  }
911  }
912  }
913 
914  return 0;
915 }
916 
917 /*?
918  * Show all neighbour adjacencies.
919  * @cliexpar
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
925  * @cliexend
926  ?*/
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,
931 };
932 
933 static ip46_type_t
935 {
936  switch (proto)
937  {
938  case FIB_PROTOCOL_IP4:
939  return (IP46_TYPE_IP4);
940  case FIB_PROTOCOL_IP6:
941  return (IP46_TYPE_IP6);
942  default:
943  return (IP46_TYPE_IP4);
944  }
945  return (IP46_TYPE_IP4);
946 }
947 
948 u8*
949 format_adj_nbr_incomplete (u8* s, va_list *ap)
950 {
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);
955 
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,
960  s = format (s, " %U",
962  vnm,
964  adj->rewrite_header.sw_if_index));
965 
966  return (s);
967 }
968 
969 u8*
970 format_adj_nbr (u8* s, va_list *ap)
971 {
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);
976 
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,
981  s = format (s, "%U",
983  vnm->vlib_main, &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
984 
985  return (s);
986 }
987 
988 static void
990 {
991  adj_lock(dpo->dpoi_index);
992 }
993 static void
995 {
996  adj_unlock(dpo->dpoi_index);
997 }
998 
999 static void
1001 {
1002  fib_show_memory_usage("Adjacency",
1004  pool_len(adj_pool),
1005  sizeof(ip_adjacency_t));
1006 }
1007 
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,
1013 };
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,
1018 };
1019 
1020 /**
1021  * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1022  * object.
1023  *
1024  * this means that these graph nodes are ones from which a nbr is the
1025  * parent object in the DPO-graph.
1026  */
1027 const static char* const nbr_ip4_nodes[] =
1028 {
1029  "ip4-rewrite",
1030  NULL,
1031 };
1032 const static char* const nbr_ip6_nodes[] =
1033 {
1034  "ip6-rewrite",
1035  NULL,
1036 };
1037 const static char* const nbr_mpls_nodes[] =
1038 {
1039  "mpls-output",
1040  NULL,
1041 };
1042 const static char* const nbr_ethernet_nodes[] =
1043 {
1044  "adj-l2-rewrite",
1045  NULL,
1046 };
1047 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1048 {
1053 };
1054 
1055 const static char* const nbr_incomplete_ip4_nodes[] =
1056 {
1057  "ip4-arp",
1058  NULL,
1059 };
1060 const static char* const nbr_incomplete_ip6_nodes[] =
1061 {
1062  "ip6-discover-neighbor",
1063  NULL,
1064 };
1065 const static char* const nbr_incomplete_mpls_nodes[] =
1066 {
1067  "mpls-adj-incomplete",
1068  NULL,
1069 };
1070 
1071 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1072 {
1076 };
1077 
1078 void
1080 {
1082  &adj_nbr_dpo_vft,
1083  nbr_nodes);
1085  &adj_nbr_incompl_dpo_vft,
1086  nbr_incomplete_nodes);
1087 }
format_function_t format_ip46_address
Definition: format.h:61
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:396
dpo_lock_fn_t dv_lock
A reference counting lock function.
Definition: dpo.h:327
void adj_nbr_walk_nh(u32 sw_if_index, fib_protocol_t adj_nh_proto, const ip46_address_t *nh, adj_walk_cb_t cb, void *ctx)
Walk adjacencies on a link with a given next-hop.
Definition: adj_nbr.c:634
static clib_error_t * adj_nbr_hw_interface_state_change(vnet_main_t *vnm, u32 hw_if_index, u32 flags)
Registered callback for HW interface state changes.
Definition: adj_nbr.c:764
#define vec_foreach_index(var, v)
Iterate over vector indices.
Context for a walk of the adjacency neighbour DB.
Definition: adj_nbr.c:512
ip_adjacency_t * adj_pool
The global adjacnecy pool.
Definition: adj.c:35
void vnet_rewrite_init(vnet_main_t *vnm, u32 sw_if_index, u32 this_node, u32 next_node, vnet_rewrite_header_t *rw)
Definition: rewrite.c:195
#define CLIB_UNUSED(x)
Definition: clib.h:79
A virtual function table regisitered for a DPO type.
Definition: dpo.h:322
uword unformat(unformat_input_t *i, char *fmt,...)
Definition: unformat.c:966
enum adj_nbr_interface_flags_t_ adj_nbr_interface_flags_t
Flags associated with the interface state walks.
u8 * format_adj_nbr(u8 *s, va_list *ap)
Format a neigbour (REWRITE) adjacency.
Definition: adj_nbr.c:970
static ip46_type_t adj_proto_to_46(fib_protocol_t proto)
Definition: adj_nbr.c:934
void adj_lock(adj_index_t adj_index)
An adjacency is a representation of an attached L3 peer.
Definition: adj.c:192
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
An indication that the rewrite is complete, i.e.
Definition: adj_nbr.h:98
static const char *const nbr_ethernet_nodes[]
Definition: adj_nbr.c:1042
static const char *const nbr_incomplete_ip6_nodes[]
Definition: adj_nbr.c:1060
static adj_walk_rc_t adj_nbr_interface_state_change_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:675
#define UNFORMAT_END_OF_INPUT
Definition: format.h:143
void vnet_hw_interface_walk_sw(vnet_main_t *vnm, u32 hw_if_index, vnet_hw_sw_interface_walk_t fn, void *ctx)
Walk the SW interfaces on a HW interface - this is the super interface and any sub-interfaces.
Definition: interface.c:934
u8 * format_vnet_link(u8 *s, va_list ap)
Definition: fib_types.c:38
#define NULL
Definition: clib.h:55
IP unicast adjacency.
Definition: lookup.h:188
Context for the state change walk of the DB.
Definition: adj_nbr.c:666
u32 index_t
A Data-Path Object is an object that represents actions that are applied to packets are they are swit...
Definition: dpo.h:41
adj_walk_cb_t awc_cb
Definition: adj_nbr.c:514
void adj_nbr_walk_nh4(u32 sw_if_index, const ip4_address_t *addr, adj_walk_cb_t cb, void *ctx)
Walk adjacencies on a link with a given v4 next-hop.
Definition: adj_nbr.c:576
static vnet_sw_interface_t * vnet_get_sw_interface(vnet_main_t *vnm, u32 sw_if_index)
unformat_function_t unformat_vnet_sw_interface
u8 * format_adj_nbr_incomplete(u8 *s, va_list *ap)
Format aa incomplete neigbour (ARP) adjacency.
Definition: adj_nbr.c:949
#define VNET_HW_INTERFACE_FLAG_LINK_UP
Definition: interface.h:377
static const char *const nbr_incomplete_mpls_nodes[]
Definition: adj_nbr.c:1065
adj_index_t adj_nbr_add_or_lock_w_rewrite(fib_protocol_t nh_proto, vnet_link_t link_type, const ip46_address_t *nh_addr, u32 sw_if_index, u8 *rewrite)
Add (and lock) a new or lock an existing neighbour adjacency.
Definition: adj_nbr.c:215
#define ip46_address_cmp(ip46_1, ip46_2)
Definition: ip6_packet.h:80
static uword vlib_node_add_next(vlib_main_t *vm, uword node, uword next_node)
Definition: node_funcs.h:1063
#define pool_len(p)
Number of elements in pool vector.
Definition: pool.h:121
union ip_adjacency_t_::@175 sub_type
enum fib_protocol_t_ fib_protocol_t
Protocol Type.
vnet_link_t ia_link
Definition: lookup.h:215
void adj_nbr_update_rewrite_internal(ip_adjacency_t *adj, u32 adj_next_index, u32 this_node, u32 next_node, u8 *rewrite)
adj_nbr_update_rewrite_internal
Definition: adj_nbr.c:294
vnet_main_t * vnet_get_main(void)
Definition: misc.c:46
static clib_error_t * adj_nbr_sw_interface_state_change(vnet_main_t *vnm, u32 sw_if_index, u32 flags)
Registered function for SW interface state changes.
Definition: adj_nbr.c:708
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:117
vlib_node_registration_t ip6_discover_neighbor_node
(constructor) VLIB_REGISTER_NODE (ip6_discover_neighbor_node)
Definition: ip6_forward.c:1850
VNET_SW_INTERFACE_ADMIN_UP_DOWN_FUNCTION_PRIO(adj_nbr_sw_interface_state_change, VNET_ITF_FUNC_PRIORITY_HIGH)
void dpo_register(dpo_type_t type, const dpo_vft_t *vft, const char *const *const *nodes)
For a given DPO type Register:
Definition: dpo.c:246
int clib_bihash_add_del(clib_bihash *h, clib_bihash_kv *add_v, int is_add)
Add or delete a (key,value) pair from a bi-hash table.
void fib_walk_sync(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_back_walk_ctx_t *ctx)
Back walk all the children of a FIB node.
Definition: fib_walk.c:674
ip_adjacency_flags_t ia_flags
Flags on the adjacency.
Definition: lookup.h:281
static void vnet_rewrite_clear_data_internal(vnet_rewrite_header_t *rw, int max_size)
Definition: rewrite.h:92
static const char *const nbr_incomplete_ip4_nodes[]
Definition: adj_nbr.c:1055
static BVT(clib_bihash)
Definition: adj_nbr.c:26
enum adj_walk_rc_t_ adj_walk_rc_t
return codes from a adjacency walker callback function
static clib_error_t * adj_nbr_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj_nbr.c:862
struct adj_walk_ctx_t_ adj_walk_ctx_t
Context for a walk of the adjacency neighbour DB.
static const char *const nbr_mpls_nodes[]
Definition: adj_nbr.c:1037
static void adj_nbr_walk_cb(BVT(clib_bihash_kv)*kvp, void *arg)
Definition: adj_nbr.c:519
static void adj_dpo_lock(dpo_id_t *dpo)
Definition: adj_nbr.c:989
void fib_show_memory_usage(const char *name, u32 in_use_elts, u32 allocd_elts, size_t size_elt)
Show the memory usage for a type.
Definition: fib_node.c:221
unsigned long u64
Definition: types.h:89
void adj_unlock(adj_index_t adj_index)
Release a reference counting lock on the adjacency.
Definition: adj.c:209
void vnet_update_adjacency_for_sw_interface(vnet_main_t *vnm, u32 sw_if_index, u32 ai)
Definition: rewrite.c:312
static const char *const nbr_ip6_nodes[]
Definition: adj_nbr.c:1032
format_function_t format_vnet_rewrite
Definition: rewrite.h:292
u32 adj_nbr_db_size(void)
Return the size of the adjacency database.
Definition: adj_nbr.c:485
Context for a walk of the adjacency neighbour DB.
Definition: adj_nbr.c:551
#define ADJ_NBR_DEFAULT_HASH_NUM_BUCKETS
vlib_node_registration_t ip4_arp_node
(constructor) VLIB_REGISTER_NODE (ip4_arp_node)
Definition: ip4_forward.c:2124
The identity of a DPO is a combination of its type and its instance number/index of objects of that t...
Definition: dpo.h:138
fib_node_bw_reason_flag_t fnbw_reason
The reason/trigger for the backwalk.
Definition: fib_node.h:190
format_function_t format_vnet_sw_interface_name
static void adj_nbr_hw_sw_interface_state_change(vnet_main_t *vnm, u32 sw_if_index, void *arg)
Invoked on each SW interface of a HW interface when the HW interface state changes.
Definition: adj_nbr.c:742
#define ADJ_INDEX_INVALID
Invalid ADJ index - used when no adj is known likewise blazoned capitals INVALID speak volumes where ...
Definition: adj_types.h:36
void adj_nbr_remove(adj_index_t ai, fib_protocol_t nh_proto, vnet_link_t link_type, const ip46_address_t *nh_addr, u32 sw_if_index)
Definition: adj_nbr.c:79
vlib_main_t * vlib_main
Definition: vnet.h:79
static adj_index_t adj_get_index(ip_adjacency_t *adj)
Get a pointer to an adjacency object from its index.
Definition: adj_internal.h:83
static clib_error_t * adj_nbr_interface_add_del(vnet_main_t *vnm, u32 sw_if_index, u32 is_add)
adj_nbr_interface_add_del
Definition: adj_nbr.c:811
const ip46_address_t * awc_nh
Definition: adj_nbr.c:555
static void adj_nbr_walk_nh_cb(BVT(clib_bihash_kv)*kvp, void *arg)
Definition: adj_nbr.c:559
#define ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE
Currently a sync walk is active.
Definition: lookup.h:182
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1079
void clib_bihash_init(clib_bihash *h, char *name, u32 nbuckets, uword memory_size)
initialize a bounded index extensible hash table
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:576
ip46_type_t
Definition: format.h:63
#define ADJ_NBR_SET_KEY(_key, _lt, _nh)
void clib_bihash_foreach_key_value_pair(clib_bihash *h, void *callback, void *arg)
Visit active (key,value) pairs in a bi-hash table.
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:300
static adj_walk_rc_t adj_nbr_show_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:850
Force the walk to be synchronous.
Definition: fib_node.h:152
struct ip_adjacency_t_::@175::@176 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
u32 vnet_tx_node_index_for_sw_interface(vnet_main_t *vnm, u32 sw_if_index)
Definition: rewrite.c:188
static void vnet_rewrite_set_data_internal(vnet_rewrite_header_t *rw, int max_size, void *data, int data_bytes)
Definition: rewrite.h:102
adj_walk_rc_t(* adj_walk_cb_t)(adj_index_t ai, void *ctx)
Call back function when walking adjacencies.
Definition: adj_types.h:50
void vlib_worker_thread_barrier_sync(vlib_main_t *vm)
Definition: threads.c:1163
u32 adj_index_t
An index for adjacencies.
Definition: adj_types.h:30
This packet matches an "incomplete adjacency" and packets need to be passed to ARP to find rewrite st...
Definition: lookup.h:73
static void adj_mem_show(void)
Definition: adj_nbr.c:1000
static ip_adjacency_t * adj_nbr_alloc(fib_protocol_t nh_proto, vnet_link_t link_type, const ip46_address_t *nh_addr, u32 sw_if_index)
Definition: adj_nbr.c:136
void adj_nbr_walk(u32 sw_if_index, fib_protocol_t adj_nh_proto, adj_walk_cb_t cb, void *ctx)
Walk the neighbour Adjacencies on a given interface.
Definition: adj_nbr.c:529
Context passed between object during a back walk.
Definition: fib_node.h:186
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:154
VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(adj_nbr_hw_interface_state_change, VNET_ITF_FUNC_PRIORITY_HIGH)
#define VNET_SW_INTERFACE_FLAG_ADMIN_UP
Definition: interface.h:528
adj_nbr_interface_flags_t flags
Flags on the interface.
Definition: adj_nbr.c:671
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
int clib_bihash_search(clib_bihash *h, clib_bihash_kv *search_v, clib_bihash_kv *return_v)
Search a bi-hash table.
enum vnet_link_t_ vnet_link_t
Link Type: A description of the protocol of packets on the link.
void * awc_ctx
Definition: adj_nbr.c:515
static const char *const nbr_ip4_nodes[]
The per-protocol VLIB graph nodes that are assigned to an adjacency object.
Definition: adj_nbr.c:1027
static u32 adj_get_rewrite_node(vnet_link_t linkt)
Definition: adj_internal.h:45
static u32 adj_get_nd_node(fib_protocol_t proto)
Definition: adj_nbr.c:121
struct adj_walk_nh_ctx_t_ adj_walk_nh_ctx_t
Context for a walk of the adjacency neighbour DB.
#define DPO_PROTO_NUM
Definition: dpo.h:72
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:154
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
unsigned char u8
Definition: types.h:56
ip_lookup_next_t lookup_next_index
Definition: lookup.h:199
enum adj_nbr_rewrite_flag_t_ adj_nbr_rewrite_flag_t
When adding a rewrite to an adjacency these are flags that apply to that rewrite. ...
ip_adjacency_t * adj_alloc(fib_protocol_t proto)
Definition: adj.c:47
static void adj_db_count(BVT(clib_bihash_kv)*kvp, void *arg)
Definition: adj_nbr.c:477
static adj_walk_rc_t adj_nbr_interface_delete_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:789
#define FIB_PROTOCOL_MAX
Definition outside of enum so it does not need to be included in non-defaulted switch statements...
Definition: fib_types.h:50
adj_walk_cb_t awc_cb
Definition: adj_nbr.c:553
static void * clib_mem_alloc_aligned(uword size, uword align)
Definition: mem.h:117
adj_nbr_interface_flags_t_
Flags associated with the interface state walks.
Definition: adj_nbr.c:658
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:169
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1195
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:418
This packet is to be rewritten and forwarded to the next processing node.
Definition: lookup.h:83
adj_index_t adj_nbr_add_or_lock(fib_protocol_t nh_proto, vnet_link_t link_type, const ip46_address_t *nh_addr, u32 sw_if_index)
Neighbour Adjacency sub-type.
Definition: adj_nbr.c:175
struct adj_db_count_ctx_t_ adj_db_count_ctx_t
vnet_link_t fib_proto_to_link(fib_protocol_t proto)
Convert from a protocol to a link type.
Definition: fib_types.c:254
VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del)
vhost_vring_addr_t addr
Definition: vhost-user.h:81
struct _unformat_input_t unformat_input_t
static void adj_dpo_unlock(dpo_id_t *dpo)
Definition: adj_nbr.c:994
u32 flags
Definition: vhost-user.h:75
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:67
#define ADJ_NBR_ITF_OK(_proto, _itf)
static adj_index_t adj_nbr_find(fib_protocol_t nh_proto, vnet_link_t link_type, const ip46_address_t *nh_addr, u32 sw_if_index)
Definition: adj_nbr.c:97
void adj_nbr_update_rewrite(adj_index_t adj_index, adj_nbr_rewrite_flag_t flags, u8 *rewrite)
adj_nbr_update_rewrite
Definition: adj_nbr.c:252
struct adj_nbr_interface_state_change_ctx_t_ adj_nbr_interface_state_change_ctx_t
Context for the state change walk of the DB.
format_function_t format_ip_adjacency
Definition: format.h:58
struct ip_adjacency_t_::@175::@177 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
void adj_nbr_walk_nh6(u32 sw_if_index, const ip6_address_t *addr, adj_walk_cb_t cb, void *ctx)
Walk adjacencies on a link with a given v6 next-hop.
Definition: adj_nbr.c:605
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:109