FD.io VPP  v19.08.3-2-gbabecb413
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 #include <vppinfra/bihash_24_8.h>
22 
23 /*
24  * Vector Hash tables of neighbour (traditional) adjacencies
25  * Key: interface(for the vector index), address (and its proto),
26  * link-type/ether-type.
27  */
28 static BVT(clib_bihash) **adj_nbr_tables[FIB_PROTOCOL_MAX];
29 
30 // FIXME SIZE APPROPRIATELY. ASK DAVEB.
31 #define ADJ_NBR_DEFAULT_HASH_NUM_BUCKETS (64 * 64)
32 #define ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE (32<<20)
33 
34 
35 #define ADJ_NBR_SET_KEY(_key, _lt, _nh) \
36 { \
37  _key.key[0] = (_nh)->as_u64[0]; \
38  _key.key[1] = (_nh)->as_u64[1]; \
39  _key.key[2] = (_lt); \
40 }
41 
42 #define ADJ_NBR_ITF_OK(_proto, _itf) \
43  (((_itf) < vec_len(adj_nbr_tables[_proto])) && \
44  (NULL != adj_nbr_tables[_proto][sw_if_index]))
45 
46 static void
47 adj_nbr_insert (fib_protocol_t nh_proto,
48  vnet_link_t link_type,
49  const ip46_address_t *nh_addr,
51  adj_index_t adj_index)
52 {
53  BVT(clib_bihash_kv) kv;
54 
55  if (sw_if_index >= vec_len(adj_nbr_tables[nh_proto]))
56  {
57  vec_validate(adj_nbr_tables[nh_proto], sw_if_index);
58  }
59  if (NULL == adj_nbr_tables[nh_proto][sw_if_index])
60  {
61  adj_nbr_tables[nh_proto][sw_if_index] =
62  clib_mem_alloc_aligned(sizeof(BVT(clib_bihash)),
64  clib_memset(adj_nbr_tables[nh_proto][sw_if_index],
65  0,
66  sizeof(BVT(clib_bihash)));
67 
68  BV(clib_bihash_init) (adj_nbr_tables[nh_proto][sw_if_index],
69  "Adjacency Neighbour table",
72  }
73 
74  ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
75  kv.value = adj_index;
76 
77  BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 1);
78 }
79 
80 void
82  fib_protocol_t nh_proto,
83  vnet_link_t link_type,
84  const ip46_address_t *nh_addr,
86 {
87  BVT(clib_bihash_kv) kv;
88 
89  if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
90  return;
91 
92  ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
93  kv.value = ai;
94 
95  BV(clib_bihash_add_del) (adj_nbr_tables[nh_proto][sw_if_index], &kv, 0);
96 }
97 
100  vnet_link_t link_type,
101  const ip46_address_t *nh_addr,
103 {
104  BVT(clib_bihash_kv) kv;
105 
106  ADJ_NBR_SET_KEY(kv, link_type, nh_addr);
107 
108  if (!ADJ_NBR_ITF_OK(nh_proto, sw_if_index))
109  return (ADJ_INDEX_INVALID);
110 
111  if (BV(clib_bihash_search)(adj_nbr_tables[nh_proto][sw_if_index],
112  &kv, &kv) < 0)
113  {
114  return (ADJ_INDEX_INVALID);
115  }
116  else
117  {
118  return (kv.value);
119  }
120 }
121 
122 static inline u32
124 {
125  switch (proto) {
126  case FIB_PROTOCOL_IP4:
127  return (ip4_arp_node.index);
128  case FIB_PROTOCOL_IP6:
129  return (ip6_discover_neighbor_node.index);
130  case FIB_PROTOCOL_MPLS:
131  break;
132  }
133  ASSERT(0);
134  return (ip4_arp_node.index);
135 }
136 
137 /**
138  * @brief Check and set feature flags if o/p interface has any o/p features.
139  */
140 static void
142 {
143  ip_adjacency_t *adj;
145  i16 feature_count;
146  u8 arc_index;
148 
149  adj = adj_get(ai);
150 
151  switch (adj->ia_link)
152  {
153  case VNET_LINK_IP4:
155  break;
156  case VNET_LINK_IP6:
158  break;
159  case VNET_LINK_MPLS:
161  break;
162  default:
163  return;
164  }
165 
166  sw_if_index = adj->rewrite_header.sw_if_index;
167  if (vec_len(fm->feature_count_by_sw_if_index[arc_index]) > sw_if_index)
168  {
169  feature_count = fm->feature_count_by_sw_if_index[arc_index][sw_if_index];
170  if (feature_count > 0)
171  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
172  }
173 
174  return;
175 }
176 
177 static ip_adjacency_t*
179  vnet_link_t link_type,
180  const ip46_address_t *nh_addr,
182 {
183  ip_adjacency_t *adj;
184 
185  adj = adj_alloc(nh_proto);
186 
187  adj_nbr_insert(nh_proto, link_type, nh_addr,
188  sw_if_index,
189  adj_get_index(adj));
190 
191  /*
192  * since we just added the ADJ we have no rewrite string for it,
193  * so its for ARP
194  */
196  adj->sub_type.nbr.next_hop = *nh_addr;
197  adj->ia_link = link_type;
198  adj->ia_nh_proto = nh_proto;
199  adj->rewrite_header.sw_if_index = sw_if_index;
201  &adj->rewrite_header);
202 
204  return (adj);
205 }
206 
207 /*
208  * adj_nbr_add_or_lock
209  *
210  * Add an adjacency for the neighbour requested.
211  *
212  * The key for an adj is:
213  * - the Next-hops protocol (i.e. v4 or v6)
214  * - the address of the next-hop
215  * - the interface the next-hop is reachable through
216  */
219  vnet_link_t link_type,
220  const ip46_address_t *nh_addr,
222 {
223  adj_index_t adj_index;
224  ip_adjacency_t *adj;
225 
226  adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
227 
228  if (ADJ_INDEX_INVALID == adj_index)
229  {
230  vnet_main_t *vnm;
231 
232  vnm = vnet_get_main();
233  adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
234  adj_index = adj_get_index(adj);
235  adj_lock(adj_index);
236 
237  if (ip46_address_is_equal(&ADJ_BCAST_ADDR, nh_addr))
238  {
240  }
241 
242  vnet_rewrite_init(vnm, sw_if_index, link_type,
243  adj_get_nd_node(nh_proto),
244  vnet_tx_node_index_for_sw_interface(vnm, sw_if_index),
245  &adj->rewrite_header);
246 
247  /*
248  * we need a rewrite where the destination IP address is converted
249  * to the appropriate link-layer address. This is interface specific.
250  * So ask the interface to do it.
251  */
252  vnet_update_adjacency_for_sw_interface(vnm, sw_if_index, adj_index);
253  }
254  else
255  {
256  adj_lock(adj_index);
257  }
258 
259  return (adj_index);
260 }
261 
264  vnet_link_t link_type,
265  const ip46_address_t *nh_addr,
267  u8 *rewrite)
268 {
269  adj_index_t adj_index;
270 
271  adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
272 
273  if (ADJ_INDEX_INVALID == adj_index)
274  {
275  ip_adjacency_t *adj;
276 
277  adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
278  adj->rewrite_header.sw_if_index = sw_if_index;
279  adj_index = adj_get_index(adj);
280  }
281 
282  adj_lock(adj_index);
283  adj_nbr_update_rewrite(adj_index,
285  rewrite);
286 
287  return (adj_index);
288 }
289 
290 /**
291  * adj_nbr_update_rewrite
292  *
293  * Update the adjacency's rewrite string. A NULL string implies the
294  * rewrite is reset (i.e. when ARP/ND entry is gone).
295  * NB: the adj being updated may be handling traffic in the DP.
296  */
297 void
300  u8 *rewrite)
301 {
302  ip_adjacency_t *adj;
303 
304  ASSERT(ADJ_INDEX_INVALID != adj_index);
305 
306  adj = adj_get(adj_index);
307 
308  if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
309  {
310  /*
311  * update the adj's rewrite string and build the arc
312  * from the rewrite node to the interface's TX node
313  */
317  vnet_get_main(),
318  adj->rewrite_header.sw_if_index),
319  rewrite);
320  }
321  else
322  {
326  vnet_get_main(),
327  adj->rewrite_header.sw_if_index),
328  rewrite);
329  }
330 }
331 
332 /**
333  * adj_nbr_update_rewrite_internal
334  *
335  * Update the adjacency's rewrite string. A NULL string implies the
336  * rewrite is reset (i.e. when ARP/ND entry is gone).
337  * NB: the adj being updated may be handling traffic in the DP.
338  */
339 void
341  ip_lookup_next_t adj_next_index,
342  u32 this_node,
343  u32 next_node,
344  u8 *rewrite)
345 {
346  ip_adjacency_t *walk_adj;
347  adj_index_t walk_ai, ai;
348  vlib_main_t * vm;
349  u32 old_next;
350  int do_walk;
351 
352  vm = vlib_get_main();
353  old_next = adj->lookup_next_index;
354 
355  ai = walk_ai = adj_get_index(adj);
356  if (VNET_LINK_MPLS == adj->ia_link)
357  {
358  /*
359  * The link type MPLS has no children in the control plane graph, it only
360  * has children in the data-plane graph. The backwalk is up the former.
361  * So we need to walk from its IP cousin.
362  */
363  walk_ai = adj_nbr_find(adj->ia_nh_proto,
365  &adj->sub_type.nbr.next_hop,
366  adj->rewrite_header.sw_if_index);
367  }
368 
369  /*
370  * Don't call the walk re-entrantly
371  */
372  if (ADJ_INDEX_INVALID != walk_ai)
373  {
374  walk_adj = adj_get(walk_ai);
375  if (ADJ_FLAG_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
376  {
377  do_walk = 0;
378  }
379  else
380  {
381  /*
382  * Prevent re-entrant walk of the same adj
383  */
384  walk_adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
385  do_walk = 1;
386  }
387  }
388  else
389  {
390  do_walk = 0;
391  }
392 
393  /*
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 endeavour.
398  */
399  adj_lock(ai);
400  adj_lock(walk_ai);
401 
402  /*
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 choices are:
411  * - to mark the adj down and back walk so child load-balances drop this adj
412  * from the set.
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 enforceable. 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:
427  * 1 - mac change
428  * 2 - adj type change
429  */
430  if (do_walk &&
431  old_next != adj_next_index &&
432  ADJ_INDEX_INVALID != walk_ai)
433  {
434  /*
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.
439  */
440  fib_node_back_walk_ctx_t bw_ctx = {
442  /*
443  * force this walk to be synchronous. 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.
447  */
448  .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
449  };
450 
451  fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
452  /*
453  * fib_walk_sync may allocate a new adjacency and potentially cuase a realloc
454  * for adj_pool. When that happens, adj pointer is no longer valid here.
455  * We refresh the adj pointer accordingly.
456  */
457  adj = adj_get (ai);
458  }
459 
460  /*
461  * If we are just updating the MAC string of the adj (which we also can't
462  * do atomically), then we need to stop packets switching through the adj.
463  * We can't do that on a per-adj basis, so it's all the packets.
464  * If we are updating the type, and we walked back to the children above,
465  * then this barrier serves to flush the queues/frames.
466  */
468 
469  adj->lookup_next_index = adj_next_index;
470 
471  if (NULL != rewrite)
472  {
473  /*
474  * new rewrite provided.
475  * fill in the adj's rewrite string, and build the VLIB graph arc.
476  */
477  vnet_rewrite_set_data_internal(&adj->rewrite_header,
478  sizeof(adj->rewrite_data),
479  rewrite,
480  vec_len(rewrite));
481  vec_free(rewrite);
482  }
483  else
484  {
485  vnet_rewrite_clear_data_internal(&adj->rewrite_header,
486  sizeof(adj->rewrite_data));
487  }
488  adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
489  this_node,
490  next_node);
491 
492  /*
493  * done with the rewrite update - let the workers loose.
494  */
496 
497  if (do_walk &&
498  (old_next != adj->lookup_next_index) &&
499  (ADJ_INDEX_INVALID != walk_ai))
500  {
501  /*
502  * backwalk to the children so they can stack on the now updated
503  * adjacency
504  */
505  fib_node_back_walk_ctx_t bw_ctx = {
507  };
508 
509  fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
510  }
511  /*
512  * Prevent re-entrant walk of the same adj
513  */
514  if (do_walk)
515  {
516  walk_adj = adj_get(walk_ai);
517  walk_adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
518  }
519 
520  adj_unlock(ai);
521  adj_unlock(walk_ai);
522 }
523 
524 typedef struct adj_db_count_ctx_t_ {
527 
528 static void
529 adj_db_count (BVT(clib_bihash_kv) * kvp,
530  void *arg)
531 {
532  adj_db_count_ctx_t * ctx = arg;
533  ctx->count++;
534 }
535 
536 u32
538 {
540  .count = 0,
541  };
543  u32 sw_if_index = 0;
544 
545  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
546  {
547  vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
548  {
549  if (NULL != adj_nbr_tables[proto][sw_if_index])
550  {
552  adj_nbr_tables[proto][sw_if_index],
553  adj_db_count,
554  &ctx);
555  }
556  }
557  }
558  return (ctx.count);
559 }
560 
561 /**
562  * @brief Context for a walk of the adjacency neighbour DB
563  */
564 typedef struct adj_walk_ctx_t_
565 {
567  void *awc_ctx;
569 
570 static void
571 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
572  void *arg)
573 {
574  adj_walk_ctx_t *ctx = arg;
575 
576  // FIXME: can't stop early...
577  ctx->awc_cb(kvp->value, ctx->awc_ctx);
578 }
579 
580 void
582  fib_protocol_t adj_nh_proto,
583  adj_walk_cb_t cb,
584  void *ctx)
585 {
586  if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
587  return;
588 
589  adj_walk_ctx_t awc = {
590  .awc_ctx = ctx,
591  .awc_cb = cb,
592  };
593 
595  adj_nbr_tables[adj_nh_proto][sw_if_index],
597  &awc);
598 }
599 
600 /**
601  * @brief Walk adjacencies on a link with a given v4 next-hop.
602  * that is visit the adjacencies with different link types.
603  */
604 void
606  const ip4_address_t *addr,
607  adj_walk_cb_t cb,
608  void *ctx)
609 {
610  if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
611  return;
612 
613  ip46_address_t nh = {
614  .ip4 = *addr,
615  };
616  vnet_link_t linkt;
617  adj_index_t ai;
618 
619  FOR_EACH_VNET_LINK(linkt)
620  {
621  ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, &nh, sw_if_index);
622 
623  if (INDEX_INVALID != ai)
624  cb(ai, ctx);
625  }
626 }
627 
628 /**
629  * @brief Walk adjacencies on a link with a given v6 next-hop.
630  * that is visit the adjacencies with different link types.
631  */
632 void
634  const ip6_address_t *addr,
635  adj_walk_cb_t cb,
636  void *ctx)
637 {
638  if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
639  return;
640 
641  ip46_address_t nh = {
642  .ip6 = *addr,
643  };
644  vnet_link_t linkt;
645  adj_index_t ai;
646 
647  FOR_EACH_VNET_LINK(linkt)
648  {
649  ai = adj_nbr_find (FIB_PROTOCOL_IP6, linkt, &nh, sw_if_index);
650 
651  if (INDEX_INVALID != ai)
652  cb(ai, ctx);
653  }
654 }
655 
656 /**
657  * @brief Walk adjacencies on a link with a given next-hop.
658  * that is visit the adjacencies with different link types.
659  */
660 void
662  fib_protocol_t adj_nh_proto,
663  const ip46_address_t *nh,
664  adj_walk_cb_t cb,
665  void *ctx)
666 {
667  if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
668  return;
669 
670  vnet_link_t linkt;
671  adj_index_t ai;
672 
673  FOR_EACH_VNET_LINK(linkt)
674  {
675  ai = adj_nbr_find (adj_nh_proto, linkt, nh, sw_if_index);
676 
677  if (INDEX_INVALID != ai)
678  cb(ai, ctx);
679  }
680 }
681 
682 /**
683  * Flags associated with the interface state walks
684  */
686 {
689 
690 /**
691  * Context for the state change walk of the DB
692  */
694 {
695  /**
696  * Flags on the interface
697  */
700 
701 static adj_walk_rc_t
703  void *arg)
704 {
705  /*
706  * Back walk the graph to inform the forwarding entries
707  * that this interface state has changed. Do this synchronously
708  * since this is the walk that provides convergence
709  */
711  fib_node_back_walk_ctx_t bw_ctx = {
712  .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
715  /*
716  * the force sync applies only as far as the first fib_entry.
717  * And it's the fib_entry's we need to converge away from
718  * the adjacencies on the now down link
719  */
720  .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
723  };
724  ip_adjacency_t *adj;
725 
726  adj = adj_get(ai);
727 
729  fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
731 
732  return (ADJ_WALK_RC_CONTINUE);
733 }
734 
735 /**
736  * @brief Registered function for SW interface state changes
737  */
738 static clib_error_t *
741  u32 flags)
742 {
744 
745  /*
746  * walk each adj on the interface and trigger a walk from that adj
747  */
748  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
749  {
751  .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
753  0),
754  };
755 
756  adj_nbr_walk(sw_if_index, proto,
758  &ctx);
759  }
760 
761  return (NULL);
762 }
763 
767 
768 /**
769  * @brief Invoked on each SW interface of a HW interface when the
770  * HW interface state changes
771  */
772 static walk_rc_t
775  void *arg)
776 {
779 
780  /*
781  * walk each adj on the interface and trigger a walk from that adj
782  */
783  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
784  {
785  adj_nbr_walk(sw_if_index, proto,
787  ctx);
788  }
789  return (WALK_CONTINUE);
790 }
791 
792 /**
793  * @brief Registered callback for HW interface state changes
794  */
795 static clib_error_t *
797  u32 hw_if_index,
798  u32 flags)
799 {
800  /*
801  * walk SW interface on the HW
802  */
804  .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
806  0),
807  };
808 
809  vnet_hw_interface_walk_sw(vnm, hw_if_index,
811  &ctx);
812 
813  return (NULL);
814 }
815 
819 
820 static adj_walk_rc_t
822  void *arg)
823 {
824  /*
825  * Back walk the graph to inform the forwarding entries
826  * that this interface has been deleted.
827  */
828  fib_node_back_walk_ctx_t bw_ctx = {
830  };
831  ip_adjacency_t *adj;
832 
833  adj_lock(ai);
834 
835  adj = adj_get(ai);
836 
838  fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
840 
841  adj_unlock(ai);
842  return (ADJ_WALK_RC_CONTINUE);
843 }
844 
845 /**
846  * adj_nbr_interface_add_del
847  *
848  * Registered to receive interface Add and delete notifications
849  */
850 static clib_error_t *
853  u32 is_add)
854 {
856 
857  if (is_add)
858  {
859  /*
860  * not interested in interface additions. we will not back walk
861  * to resolve paths through newly added interfaces. Why? The control
862  * plane should have the brains to add interfaces first, then routes.
863  * So the case where there are paths with a interface that matches
864  * one just created is the case where the path resolved through an
865  * interface that was deleted, and still has not been removed. The
866  * new interface added, is NO GUARANTEE that the interface being
867  * added now, even though it may have the same sw_if_index, is the
868  * same interface that the path needs. So tough!
869  * If the control plane wants these routes to resolve it needs to
870  * remove and add them again.
871  */
872  return (NULL);
873  }
874 
875  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
876  {
877  adj_nbr_walk(sw_if_index, proto,
879  NULL);
880  }
881 
882  return (NULL);
883 
884 }
885 
887 
888 
889 static adj_walk_rc_t
891  void *arg)
892 {
893  vlib_cli_output (arg, "[@%d] %U",
894  ai,
897 
898  return (ADJ_WALK_RC_CONTINUE);
899 }
900 
901 static clib_error_t *
903  unformat_input_t * input,
904  vlib_cli_command_t * cmd)
905 {
907  u32 sw_if_index = ~0;
908 
910  {
911  if (unformat (input, "%d", &ai))
912  ;
913  else if (unformat (input, "%U",
915  &sw_if_index))
916  ;
917  else
918  break;
919  }
920 
921  if (ADJ_INDEX_INVALID != ai)
922  {
923  vlib_cli_output (vm, "[@%d] %U",
924  ai,
927  }
928  else if (~0 != sw_if_index)
929  {
931 
932  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
933  {
934  adj_nbr_walk(sw_if_index, proto,
936  vm);
937  }
938  }
939  else
940  {
942 
943  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
944  {
945  vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
946  {
947  adj_nbr_walk(sw_if_index, proto,
949  vm);
950  }
951  }
952  }
953 
954  return 0;
955 }
956 
957 /*?
958  * Show all neighbour adjacencies.
959  * @cliexpar
960  * @cliexstart{sh adj nbr}
961  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
962  * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
963  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
964  * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
965  * @cliexend
966  ?*/
967 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
968  .path = "show adj nbr",
969  .short_help = "show adj nbr [<adj_index>] [interface]",
970  .function = adj_nbr_show,
971 };
972 
973 u8*
974 format_adj_nbr_incomplete (u8* s, va_list *ap)
975 {
976  index_t index = va_arg(*ap, index_t);
977  CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
978  vnet_main_t * vnm = vnet_get_main();
979  ip_adjacency_t * adj = adj_get(index);
980 
981  s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
982  s = format (s, ": via %U",
983  format_ip46_address, &adj->sub_type.nbr.next_hop,
985  s = format (s, " %U",
987  vnm, adj->rewrite_header.sw_if_index);
988 
989  return (s);
990 }
991 
992 u8*
993 format_adj_nbr (u8* s, va_list *ap)
994 {
995  index_t index = va_arg(*ap, index_t);
996  CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
997  ip_adjacency_t * adj = adj_get(index);
998 
999  s = format (s, "%U", format_vnet_link, adj->ia_link);
1000  s = format (s, " via %U ",
1001  format_ip46_address, &adj->sub_type.nbr.next_hop,
1003  s = format (s, "%U",
1005  &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
1006 
1007  return (s);
1008 }
1009 
1010 static void
1012 {
1013  adj_lock(dpo->dpoi_index);
1014 }
1015 static void
1017 {
1018  adj_unlock(dpo->dpoi_index);
1019 }
1020 
1021 static void
1023 {
1024  fib_show_memory_usage("Adjacency",
1026  pool_len(adj_pool),
1027  sizeof(ip_adjacency_t));
1028 }
1029 
1030 const static dpo_vft_t adj_nbr_dpo_vft = {
1031  .dv_lock = adj_dpo_lock,
1032  .dv_unlock = adj_dpo_unlock,
1033  .dv_format = format_adj_nbr,
1034  .dv_mem_show = adj_mem_show,
1035  .dv_get_urpf = adj_dpo_get_urpf,
1036 };
1037 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1038  .dv_lock = adj_dpo_lock,
1039  .dv_unlock = adj_dpo_unlock,
1040  .dv_format = format_adj_nbr_incomplete,
1041  .dv_get_urpf = adj_dpo_get_urpf,
1042 };
1043 
1044 /**
1045  * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1046  * object.
1047  *
1048  * this means that these graph nodes are ones from which a nbr is the
1049  * parent object in the DPO-graph.
1050  */
1051 const static char* const nbr_ip4_nodes[] =
1052 {
1053  "ip4-rewrite",
1054  NULL,
1055 };
1056 const static char* const nbr_ip6_nodes[] =
1057 {
1058  "ip6-rewrite",
1059  NULL,
1060 };
1061 const static char* const nbr_mpls_nodes[] =
1062 {
1063  "mpls-output",
1064  NULL,
1065 };
1066 const static char* const nbr_ethernet_nodes[] =
1067 {
1068  "adj-l2-rewrite",
1069  NULL,
1070 };
1071 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1072 {
1077 };
1078 
1079 const static char* const nbr_incomplete_ip4_nodes[] =
1080 {
1081  "ip4-arp",
1082  NULL,
1083 };
1084 const static char* const nbr_incomplete_ip6_nodes[] =
1085 {
1086  "ip6-discover-neighbor",
1087  NULL,
1088 };
1089 const static char* const nbr_incomplete_mpls_nodes[] =
1090 {
1091  "mpls-adj-incomplete",
1092  NULL,
1093 };
1094 
1095 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1096 {
1100 };
1101 
1102 void
1104 {
1106  &adj_nbr_dpo_vft,
1107  nbr_nodes);
1109  &adj_nbr_incompl_dpo_vft,
1110  nbr_incomplete_nodes);
1111 }
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:439
dpo_lock_fn_t dv_lock
A reference counting lock function.
Definition: dpo.h:406
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:661
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:796
#define vec_foreach_index(var, v)
Iterate over vector indices.
adj_flags_t ia_flags
Flags on the adjacency 1-bytes.
Definition: adj.h:255
u32 flags
Definition: vhost_user.h:141
Context for a walk of the adjacency neighbour DB.
Definition: adj_nbr.c:564
ip_adjacency_t * adj_pool
The global adjacency pool.
Definition: adj.c:33
#define CLIB_UNUSED(x)
Definition: clib.h:83
A virtual function table regisitered for a DPO type.
Definition: dpo.h:401
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:993
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:330
An indication that the rewrite is complete, i.e.
Definition: adj_nbr.h:98
vnet_main_t * vnet_get_main(void)
Definition: misc.c:46
static const char *const nbr_ethernet_nodes[]
Definition: adj_nbr.c:1066
vl_api_fib_path_nh_t nh
Definition: fib_types.api:126
static const char *const nbr_incomplete_ip6_nodes[]
Definition: adj_nbr.c:1084
unsigned long u64
Definition: types.h:89
static adj_walk_rc_t adj_nbr_interface_state_change_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:702
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:1043
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
Broadcasr Adjacency.
Definition: adj.h:85
IP unicast adjacency.
Definition: adj.h:221
Context for the state change walk of the DB.
Definition: adj_nbr.c:693
This packet is to be rewritten and forwarded to the next processing node.
Definition: adj.h:73
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
format_function_t format_ip46_address
Definition: format.h:61
ip_lookup_main_t lookup_main
Definition: ip4.h:107
adj_walk_cb_t awc_cb
Definition: adj_nbr.c:566
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:605
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
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:974
static const char *const nbr_incomplete_mpls_nodes[]
Definition: adj_nbr.c:1089
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:320
vhost_vring_addr_t addr
Definition: vhost_user.h:147
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:263
format_function_t format_vnet_sw_if_index_name
static uword vlib_node_add_next(vlib_main_t *vm, uword node, uword next_node)
Definition: node_funcs.h:1092
unsigned char u8
Definition: types.h:56
ip_lookup_next_t
An adjacency is a representation of an attached L3 peer.
Definition: adj.h:50
#define pool_len(p)
Number of elements in pool vector.
Definition: pool.h:140
enum fib_protocol_t_ fib_protocol_t
Protocol Type.
#define vlib_worker_thread_barrier_sync(X)
Definition: threads.h:204
vnet_link_t ia_link
link/ether-type 1 bytes
Definition: adj.h:242
#define fm
union ip_adjacency_t_::@48 sub_type
static void adj_nbr_walk_cb(BVT(clib_bihash_kv) *kvp, void *arg)
Definition: adj_nbr.c:571
enum walk_rc_t_ walk_rc_t
Walk return code.
u8 output_feature_arc_index
Definition: lookup.h:164
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:739
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:433
vlib_node_registration_t ip6_discover_neighbor_node
(constructor) VLIB_REGISTER_NODE (ip6_discover_neighbor_node)
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:322
vl_api_interface_index_t sw_if_index
Definition: gre.api:50
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.
format_function_t format_ip_adjacency
Definition: format.h:58
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:745
static void vnet_rewrite_clear_data_internal(vnet_rewrite_header_t *rw, int max_size)
Definition: rewrite.h:116
static const char *const nbr_incomplete_ip4_nodes[]
Definition: adj_nbr.c:1079
static BVT(clib_bihash)
Definition: adj_nbr.c:28
enum adj_walk_rc_t_ adj_walk_rc_t
return codes from a adjacency walker callback function
static walk_rc_t 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:773
static clib_error_t * adj_nbr_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj_nbr.c:902
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:1061
static void adj_dpo_lock(dpo_id_t *dpo)
Definition: adj_nbr.c:1011
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:220
void adj_unlock(adj_index_t adj_index)
Release a reference counting lock on the adjacency.
Definition: adj.c:347
void vnet_update_adjacency_for_sw_interface(vnet_main_t *vnm, u32 sw_if_index, u32 ai)
Definition: rewrite.c:179
unsigned int u32
Definition: types.h:88
static const char *const nbr_ip6_nodes[]
Definition: adj_nbr.c:1056
static void adj_nbr_evaluate_feature(adj_index_t ai)
Check and set feature flags if o/p interface has any o/p features.
Definition: adj_nbr.c:141
format_function_t format_vnet_rewrite
Definition: rewrite.h:250
u8 output_feature_arc_index
Definition: mpls.h:57
u32 adj_nbr_db_size(void)
Return the size of the adjacency database.
Definition: adj_nbr.c:537
#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:2112
The identity of a DPO is a combination of its type and its instance number/index of objects of that t...
Definition: dpo.h:170
fib_node_bw_reason_flag_t fnbw_reason
The reason/trigger for the backwalk.
Definition: fib_node.h:212
#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:81
long ctx[MAX_CONNS]
Definition: main.c:144
struct _unformat_input_t unformat_input_t
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:101
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:851
#define ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1103
void clib_bihash_init(clib_bihash *h, char *name, u32 nbuckets, uword memory_size)
initialize a bounded index extensible hash table
#define ADJ_NBR_SET_KEY(_key, _lt, _nh)
struct ip_adjacency_t_::@48::@49 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
void clib_bihash_foreach_key_value_pair(clib_bihash *h, void *callback, void *arg)
Visit active (key,value) pairs in a bi-hash table.
This packet matches an "incomplete adjacency" and packets need to be passed to ARP to find rewrite st...
Definition: adj.h:63
#define UNFORMAT_END_OF_INPUT
Definition: format.h:145
void vnet_rewrite_init(vnet_main_t *vnm, u32 sw_if_index, vnet_link_t linkt, u32 this_node, u32 next_node, vnet_rewrite_header_t *rw)
Definition: rewrite.c:80
mpls_main_t mpls_main
Definition: mpls.c:25
vlib_main_t * vm
Definition: buffer.c:323
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:341
static adj_walk_rc_t adj_nbr_show_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:890
Force the walk to be synchronous.
Definition: fib_node.h:174
u32 vnet_tx_node_index_for_sw_interface(vnet_main_t *vnm, u32 sw_if_index)
Definition: rewrite.c:73
static void vnet_rewrite_set_data_internal(vnet_rewrite_header_t *rw, int max_size, void *data, int data_bytes)
Definition: rewrite.h:126
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
u32 adj_index_t
An index for adjacencies.
Definition: adj_types.h:30
static void adj_mem_show(void)
Definition: adj_nbr.c:1022
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:178
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:581
i16 ** feature_count_by_sw_if_index
feature reference counts by interface
Definition: feature.h:109
#define FOR_EACH_VNET_LINK(_link)
Definition: interface.h:344
Context passed between object during a back walk.
Definition: fib_node.h:208
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:161
VNET_HW_INTERFACE_LINK_UP_DOWN_FUNCTION_PRIO(adj_nbr_hw_interface_state_change, VNET_ITF_FUNC_PRIORITY_HIGH)
adj_nbr_interface_flags_t flags
Flags on the interface.
Definition: adj_nbr.c:698
#define ASSERT(truth)
ip6_main_t ip6_main
Definition: ip6_forward.c:2805
ip_lookup_main_t lookup_main
Definition: ip6.h:179
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:567
static const char *const nbr_ip4_nodes[]
The per-protocol VLIB graph nodes that are assigned to an adjacency object.
Definition: adj_nbr.c:1051
static u32 adj_get_rewrite_node(vnet_link_t linkt)
Definition: adj_internal.h:46
static u32 adj_get_nd_node(fib_protocol_t proto)
Definition: adj_nbr.c:123
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
fib_protocol_t ia_nh_proto
The protocol of the neighbor/peer.
Definition: adj.h:249
#define DPO_PROTO_NUM
Definition: dpo.h:70
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:186
#define ip46_address_is_equal(a1, a2)
Definition: ip6_packet.h:94
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
ip_lookup_next_t lookup_next_index
Next hop after ip4-lookup.
Definition: adj.h:236
void adj_nbr_update_rewrite_internal(ip_adjacency_t *adj, ip_lookup_next_t adj_next_index, u32 this_node, u32 next_node, u8 *rewrite)
adj_nbr_update_rewrite_internal
Definition: adj_nbr.c:340
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. ...
#define INDEX_INVALID
Invalid index - used when no index is known blazoned capitals INVALID speak volumes where ~0 does not...
Definition: dpo.h:47
ip_adjacency_t * adj_alloc(fib_protocol_t proto)
Definition: adj.c:63
static adj_walk_rc_t adj_nbr_interface_delete_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:821
#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:52
static void * clib_mem_alloc_aligned(uword size, uword align)
Definition: mem.h:161
adj_nbr_interface_flags_t_
Flags associated with the interface state walks.
Definition: adj_nbr.c:685
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1520
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:1076
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:218
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:281
u8 * format_vnet_link(u8 *s, va_list *ap)
Definition: fib_types.c:41
VNET_SW_INTERFACE_ADD_DEL_FUNCTION(adj_nbr_interface_add_del)
static void adj_dpo_unlock(dpo_id_t *dpo)
Definition: adj_nbr.c:1016
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:59
#define ADJ_NBR_ITF_OK(_proto, _itf)
This adjacency/interface has output features configured.
Definition: rewrite.h:57
void vnet_rewrite_update_mtu(vnet_main_t *vnm, vnet_link_t linkt, vnet_rewrite_header_t *rw)
Definition: rewrite.c:92
vnet_feature_main_t feature_main
Definition: feature.c:19
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:298
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:772
const ip46_address_t ADJ_BCAST_ADDR
The special broadcast address (to construct a broadcast adjacency.
Definition: adj.c:41
struct adj_nbr_interface_state_change_ctx_t_ adj_nbr_interface_state_change_ctx_t
Context for the state change walk of the DB.
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:978
vl_api_fib_path_nh_proto_t proto
Definition: fib_types.api:125
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:171
static ip46_type_t adj_proto_to_46(fib_protocol_t proto)
Definition: adj_internal.h:82
signed short i16
Definition: types.h:46
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)
Lookup neighbor adjancency.
Definition: adj_nbr.c:99
static void adj_db_count(BVT(clib_bihash_kv) *kvp, void *arg)
Definition: adj_nbr.c:529
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:633
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128