FD.io VPP  v20.01-48-g3e0dafb74
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 
225  adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
226 
227  if (ADJ_INDEX_INVALID == adj_index)
228  {
229  ip_adjacency_t *adj;
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  adj_delegate_adj_created(adj_get(adj_index));
260  return (adj_index);
261 }
262 
265  vnet_link_t link_type,
266  const ip46_address_t *nh_addr,
268  u8 *rewrite)
269 {
270  adj_index_t adj_index;
271 
272  adj_index = adj_nbr_find(nh_proto, link_type, nh_addr, sw_if_index);
273 
274  if (ADJ_INDEX_INVALID == adj_index)
275  {
276  ip_adjacency_t *adj;
277 
278  adj = adj_nbr_alloc(nh_proto, link_type, nh_addr, sw_if_index);
279  adj->rewrite_header.sw_if_index = sw_if_index;
280  adj_index = adj_get_index(adj);
281  }
282 
283  adj_lock(adj_index);
284  adj_nbr_update_rewrite(adj_index,
286  rewrite);
287 
288  adj_delegate_adj_created(adj_get(adj_index));
289 
290  return (adj_index);
291 }
292 
293 /**
294  * adj_nbr_update_rewrite
295  *
296  * Update the adjacency's rewrite string. A NULL string implies the
297  * rewrite is reset (i.e. when ARP/ND entry is gone).
298  * NB: the adj being updated may be handling traffic in the DP.
299  */
300 void
303  u8 *rewrite)
304 {
305  ip_adjacency_t *adj;
306 
307  ASSERT(ADJ_INDEX_INVALID != adj_index);
308 
309  adj = adj_get(adj_index);
310 
311  if (flags & ADJ_NBR_REWRITE_FLAG_COMPLETE)
312  {
313  /*
314  * update the adj's rewrite string and build the arc
315  * from the rewrite node to the interface's TX node
316  */
320  vnet_get_main(),
321  adj->rewrite_header.sw_if_index),
322  rewrite);
323  }
324  else
325  {
329  vnet_get_main(),
330  adj->rewrite_header.sw_if_index),
331  rewrite);
332  }
333 }
334 
335 /**
336  * adj_nbr_update_rewrite_internal
337  *
338  * Update the adjacency's rewrite string. A NULL string implies the
339  * rewrite is reset (i.e. when ARP/ND entry is gone).
340  * NB: the adj being updated may be handling traffic in the DP.
341  */
342 void
344  ip_lookup_next_t adj_next_index,
345  u32 this_node,
346  u32 next_node,
347  u8 *rewrite)
348 {
349  ip_adjacency_t *walk_adj;
350  adj_index_t walk_ai, ai;
351  vlib_main_t * vm;
352  u32 old_next;
353  int do_walk;
354 
355  vm = vlib_get_main();
356  old_next = adj->lookup_next_index;
357 
358  ai = walk_ai = adj_get_index(adj);
359  if (VNET_LINK_MPLS == adj->ia_link)
360  {
361  /*
362  * The link type MPLS has no children in the control plane graph, it only
363  * has children in the data-plane graph. The backwalk is up the former.
364  * So we need to walk from its IP cousin.
365  */
366  walk_ai = adj_nbr_find(adj->ia_nh_proto,
368  &adj->sub_type.nbr.next_hop,
369  adj->rewrite_header.sw_if_index);
370  }
371 
372  /*
373  * Don't call the walk re-entrantly
374  */
375  if (ADJ_INDEX_INVALID != walk_ai)
376  {
377  walk_adj = adj_get(walk_ai);
378  if (ADJ_FLAG_SYNC_WALK_ACTIVE & walk_adj->ia_flags)
379  {
380  do_walk = 0;
381  }
382  else
383  {
384  /*
385  * Prevent re-entrant walk of the same adj
386  */
387  walk_adj->ia_flags |= ADJ_FLAG_SYNC_WALK_ACTIVE;
388  do_walk = 1;
389  }
390  }
391  else
392  {
393  do_walk = 0;
394  }
395 
396  /*
397  * lock the adjacencies that are affected by updates this walk will provoke.
398  * Since the aim of the walk is to update children to link to a different
399  * DPO, this adj will no longer be in use and its lock count will drop to 0.
400  * We don't want it to be deleted as part of this endeavour.
401  */
402  adj_lock(ai);
403  adj_lock(walk_ai);
404 
405  /*
406  * Updating a rewrite string is not atomic;
407  * - the rewrite string is too long to write in one instruction
408  * - when swapping from incomplete to complete, we also need to update
409  * the VLIB graph next-index of the adj.
410  * ideally we would only want to suspend forwarding via this adj whilst we
411  * do this, but we do not have that level of granularity - it's suspend all
412  * worker threads or nothing.
413  * The other choices are:
414  * - to mark the adj down and back walk so child load-balances drop this adj
415  * from the set.
416  * - update the next_node index of this adj to point to error-drop
417  * both of which will mean for MAC change we will drop for this adj
418  * which is not acceptable. However, when the adj changes type (from
419  * complete to incomplete and vice-versa) the child DPOs, which have the
420  * VLIB graph next node index, will be sending packets to the wrong graph
421  * node. So from the options above, updating the next_node of the adj to
422  * be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
423  * arp/midchain always be valid w.r.t. a mis-match of adj type and node type
424  * (i.e. a rewrite adj in the arp node). This is not enforceable. Getting it
425  * wrong will lead to hard to find bugs since its a race condition. So we
426  * choose the more reliable method of updating the children to use the drop,
427  * then switching adj's type, then updating the children again. Did I mention
428  * that this doesn't happen often...
429  * So we need to distinguish between the two cases:
430  * 1 - mac change
431  * 2 - adj type change
432  */
433  if (do_walk &&
434  old_next != adj_next_index &&
435  ADJ_INDEX_INVALID != walk_ai)
436  {
437  /*
438  * the adj is changing type. we need to fix all children so that they
439  * stack momentarily on a drop, while the adj changes. If we don't do
440  * this the children will send packets to a VLIB graph node that does
441  * not correspond to the adj's type - and it goes downhill from there.
442  */
443  fib_node_back_walk_ctx_t bw_ctx = {
445  /*
446  * force this walk to be synchronous. if we don't and a node in the graph
447  * (a heavily shared path-list) chooses to back-ground the walk (make it
448  * async) then it will pause and we will do the adj update below, before
449  * all the children are updated. not good.
450  */
451  .fnbw_flags = FIB_NODE_BW_FLAG_FORCE_SYNC,
452  };
453 
454  fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
455  /*
456  * fib_walk_sync may allocate a new adjacency and potentially cuase a
457  * realloc for adj_pool. When that happens, adj pointer is no longer
458  * valid here. We refresh the adj pointer accordingly.
459  */
460  adj = adj_get (ai);
461  }
462 
463  /*
464  * If we are just updating the MAC string of the adj (which we also can't
465  * do atomically), then we need to stop packets switching through the adj.
466  * We can't do that on a per-adj basis, so it's all the packets.
467  * If we are updating the type, and we walked back to the children above,
468  * then this barrier serves to flush the queues/frames.
469  */
471 
472  adj->lookup_next_index = adj_next_index;
473  adj->ia_node_index = this_node;
474 
475  if (NULL != rewrite)
476  {
477  /*
478  * new rewrite provided.
479  * fill in the adj's rewrite string, and build the VLIB graph arc.
480  */
481  vnet_rewrite_set_data_internal(&adj->rewrite_header,
482  sizeof(adj->rewrite_data),
483  rewrite,
484  vec_len(rewrite));
485  vec_free(rewrite);
486  }
487  else
488  {
489  vnet_rewrite_clear_data_internal(&adj->rewrite_header,
490  sizeof(adj->rewrite_data));
491  }
492  adj->rewrite_header.next_index = vlib_node_add_next(vlib_get_main(),
493  this_node,
494  next_node);
495 
496  /*
497  * done with the rewrite update - let the workers loose.
498  */
500 
501  if (do_walk &&
502  (old_next != adj->lookup_next_index) &&
503  (ADJ_INDEX_INVALID != walk_ai))
504  {
505  /*
506  * backwalk to the children so they can stack on the now updated
507  * adjacency
508  */
509  fib_node_back_walk_ctx_t bw_ctx = {
511  };
512 
513  fib_walk_sync(FIB_NODE_TYPE_ADJ, walk_ai, &bw_ctx);
514  }
515  /*
516  * Prevent re-entrant walk of the same adj
517  */
518  if (do_walk)
519  {
520  walk_adj = adj_get(walk_ai);
521  walk_adj->ia_flags &= ~ADJ_FLAG_SYNC_WALK_ACTIVE;
522  }
523 
524  adj_unlock(ai);
525  adj_unlock(walk_ai);
526 }
527 
528 typedef struct adj_db_count_ctx_t_ {
531 
532 static int
533 adj_db_count (BVT(clib_bihash_kv) * kvp,
534  void *arg)
535 {
536  adj_db_count_ctx_t * ctx = arg;
537  ctx->count++;
538  return (BIHASH_WALK_CONTINUE);
539 }
540 
541 u32
543 {
545  .count = 0,
546  };
548  u32 sw_if_index = 0;
549 
550  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
551  {
552  vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
553  {
554  if (NULL != adj_nbr_tables[proto][sw_if_index])
555  {
557  adj_nbr_tables[proto][sw_if_index],
558  adj_db_count,
559  &ctx);
560  }
561  }
562  }
563  return (ctx.count);
564 }
565 
566 /**
567  * @brief Context for a walk of the adjacency neighbour DB
568  */
569 typedef struct adj_walk_ctx_t_
570 {
572  void *awc_ctx;
574 
575 static int
576 adj_nbr_walk_cb (BVT(clib_bihash_kv) * kvp,
577  void *arg)
578 {
579  adj_walk_ctx_t *ctx = arg;
580 
581  // FIXME: can't stop early...
582  if (ADJ_WALK_RC_STOP == ctx->awc_cb(kvp->value, ctx->awc_ctx))
583  return (BIHASH_WALK_STOP);
584  return (BIHASH_WALK_CONTINUE);
585 }
586 
587 void
589  fib_protocol_t adj_nh_proto,
590  adj_walk_cb_t cb,
591  void *ctx)
592 {
593  if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
594  return;
595 
596  adj_walk_ctx_t awc = {
597  .awc_ctx = ctx,
598  .awc_cb = cb,
599  };
600 
602  adj_nbr_tables[adj_nh_proto][sw_if_index],
604  &awc);
605 }
606 
607 /**
608  * @brief Walk adjacencies on a link with a given v4 next-hop.
609  * that is visit the adjacencies with different link types.
610  */
611 void
613  const ip4_address_t *addr,
614  adj_walk_cb_t cb,
615  void *ctx)
616 {
617  if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP4, sw_if_index))
618  return;
619 
620  ip46_address_t nh = {
621  .ip4 = *addr,
622  };
623  vnet_link_t linkt;
624  adj_index_t ai;
625 
626  FOR_EACH_VNET_LINK(linkt)
627  {
628  ai = adj_nbr_find (FIB_PROTOCOL_IP4, linkt, &nh, sw_if_index);
629 
630  if (INDEX_INVALID != ai)
631  cb(ai, ctx);
632  }
633 }
634 
635 /**
636  * @brief Walk adjacencies on a link with a given v6 next-hop.
637  * that is visit the adjacencies with different link types.
638  */
639 void
641  const ip6_address_t *addr,
642  adj_walk_cb_t cb,
643  void *ctx)
644 {
645  if (!ADJ_NBR_ITF_OK(FIB_PROTOCOL_IP6, sw_if_index))
646  return;
647 
648  ip46_address_t nh = {
649  .ip6 = *addr,
650  };
651  vnet_link_t linkt;
652  adj_index_t ai;
653 
654  FOR_EACH_VNET_LINK(linkt)
655  {
656  ai = adj_nbr_find (FIB_PROTOCOL_IP6, linkt, &nh, sw_if_index);
657 
658  if (INDEX_INVALID != ai)
659  cb(ai, ctx);
660  }
661 }
662 
663 /**
664  * @brief Walk adjacencies on a link with a given next-hop.
665  * that is visit the adjacencies with different link types.
666  */
667 void
669  fib_protocol_t adj_nh_proto,
670  const ip46_address_t *nh,
671  adj_walk_cb_t cb,
672  void *ctx)
673 {
674  if (!ADJ_NBR_ITF_OK(adj_nh_proto, sw_if_index))
675  return;
676 
677  switch (adj_nh_proto)
678  {
679  case FIB_PROTOCOL_IP4:
680  adj_nbr_walk_nh4(sw_if_index, &nh->ip4, cb, ctx);
681  break;
682  case FIB_PROTOCOL_IP6:
683  adj_nbr_walk_nh6(sw_if_index, &nh->ip6, cb, ctx);
684  break;
685  case FIB_PROTOCOL_MPLS:
686  ASSERT(0);
687  break;
688  }
689 }
690 
691 /**
692  * Flags associated with the interface state walks
693  */
695 {
698 
699 /**
700  * Context for the state change walk of the DB
701  */
703 {
704  /**
705  * Flags on the interface
706  */
709 
710 static adj_walk_rc_t
712  void *arg)
713 {
714  /*
715  * Back walk the graph to inform the forwarding entries
716  * that this interface state has changed. Do this synchronously
717  * since this is the walk that provides convergence
718  */
720  fib_node_back_walk_ctx_t bw_ctx = {
721  .fnbw_reason = ((ctx->flags & ADJ_NBR_INTERFACE_UP) ?
724  /*
725  * the force sync applies only as far as the first fib_entry.
726  * And it's the fib_entry's we need to converge away from
727  * the adjacencies on the now down link
728  */
729  .fnbw_flags = (!(ctx->flags & ADJ_NBR_INTERFACE_UP) ?
732  };
733  ip_adjacency_t *adj;
734 
735  adj = adj_get(ai);
736 
738  fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
740 
741  return (ADJ_WALK_RC_CONTINUE);
742 }
743 
744 /**
745  * @brief Registered function for SW interface state changes
746  */
747 static clib_error_t *
750  u32 flags)
751 {
753 
754  /*
755  * walk each adj on the interface and trigger a walk from that adj
756  */
757  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
758  {
760  .flags = ((flags & VNET_SW_INTERFACE_FLAG_ADMIN_UP) ?
762  0),
763  };
764 
765  adj_nbr_walk(sw_if_index, proto,
767  &ctx);
768  }
769 
770  return (NULL);
771 }
772 
776 
777 /**
778  * @brief Invoked on each SW interface of a HW interface when the
779  * HW interface state changes
780  */
781 static walk_rc_t
784  void *arg)
785 {
788 
789  /*
790  * walk each adj on the interface and trigger a walk from that adj
791  */
792  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
793  {
794  adj_nbr_walk(sw_if_index, proto,
796  ctx);
797  }
798  return (WALK_CONTINUE);
799 }
800 
801 /**
802  * @brief Registered callback for HW interface state changes
803  */
804 static clib_error_t *
806  u32 hw_if_index,
807  u32 flags)
808 {
809  /*
810  * walk SW interface on the HW
811  */
813  .flags = ((flags & VNET_HW_INTERFACE_FLAG_LINK_UP) ?
815  0),
816  };
817 
818  vnet_hw_interface_walk_sw(vnm, hw_if_index,
820  &ctx);
821 
822  return (NULL);
823 }
824 
828 
829 static adj_walk_rc_t
831  void *arg)
832 {
833  /*
834  * Back walk the graph to inform the forwarding entries
835  * that this interface has been deleted.
836  */
837  fib_node_back_walk_ctx_t bw_ctx = {
839  };
840  ip_adjacency_t *adj;
841 
842  adj_lock(ai);
843 
844  adj = adj_get(ai);
845 
847  fib_walk_sync(FIB_NODE_TYPE_ADJ, ai, &bw_ctx);
849 
850  adj_unlock(ai);
851  return (ADJ_WALK_RC_CONTINUE);
852 }
853 
854 /**
855  * adj_nbr_interface_add_del
856  *
857  * Registered to receive interface Add and delete notifications
858  */
859 static clib_error_t *
862  u32 is_add)
863 {
865 
866  if (is_add)
867  {
868  /*
869  * not interested in interface additions. we will not back walk
870  * to resolve paths through newly added interfaces. Why? The control
871  * plane should have the brains to add interfaces first, then routes.
872  * So the case where there are paths with a interface that matches
873  * one just created is the case where the path resolved through an
874  * interface that was deleted, and still has not been removed. The
875  * new interface added, is NO GUARANTEE that the interface being
876  * added now, even though it may have the same sw_if_index, is the
877  * same interface that the path needs. So tough!
878  * If the control plane wants these routes to resolve it needs to
879  * remove and add them again.
880  */
881  return (NULL);
882  }
883 
884  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
885  {
886  adj_nbr_walk(sw_if_index, proto,
888  NULL);
889  }
890 
891  return (NULL);
892 
893 }
894 
896 
897 
898 static adj_walk_rc_t
900  void *arg)
901 {
902  vlib_cli_output (arg, "[@%d] %U",
903  ai,
906 
907  return (ADJ_WALK_RC_CONTINUE);
908 }
909 
910 static clib_error_t *
912  unformat_input_t * input,
913  vlib_cli_command_t * cmd)
914 {
916  u32 sw_if_index = ~0;
917 
919  {
920  if (unformat (input, "%d", &ai))
921  ;
922  else if (unformat (input, "%U",
924  &sw_if_index))
925  ;
926  else
927  break;
928  }
929 
930  if (ADJ_INDEX_INVALID != ai)
931  {
932  vlib_cli_output (vm, "[@%d] %U",
933  ai,
936  }
937  else if (~0 != sw_if_index)
938  {
940 
941  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
942  {
943  adj_nbr_walk(sw_if_index, proto,
945  vm);
946  }
947  }
948  else
949  {
951 
952  for (proto = FIB_PROTOCOL_IP4; proto <= FIB_PROTOCOL_IP6; proto++)
953  {
954  vec_foreach_index(sw_if_index, adj_nbr_tables[proto])
955  {
956  adj_nbr_walk(sw_if_index, proto,
958  vm);
959  }
960  }
961  }
962 
963  return 0;
964 }
965 
966 /*?
967  * Show all neighbour adjacencies.
968  * @cliexpar
969  * @cliexstart{sh adj nbr}
970  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
971  * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
972  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
973  * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
974  * @cliexend
975  ?*/
976 VLIB_CLI_COMMAND (ip4_show_fib_command, static) = {
977  .path = "show adj nbr",
978  .short_help = "show adj nbr [<adj_index>] [interface]",
979  .function = adj_nbr_show,
980 };
981 
982 u8*
983 format_adj_nbr_incomplete (u8* s, va_list *ap)
984 {
985  index_t index = va_arg(*ap, index_t);
986  CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
987  vnet_main_t * vnm = vnet_get_main();
988  ip_adjacency_t * adj = adj_get(index);
989 
990  s = format (s, "arp-%U", format_vnet_link, adj->ia_link);
991  s = format (s, ": via %U",
992  format_ip46_address, &adj->sub_type.nbr.next_hop,
994  s = format (s, " %U",
996  vnm, adj->rewrite_header.sw_if_index);
997 
998  return (s);
999 }
1000 
1001 u8*
1002 format_adj_nbr (u8* s, va_list *ap)
1003 {
1004  index_t index = va_arg(*ap, index_t);
1005  CLIB_UNUSED(u32 indent) = va_arg(*ap, u32);
1006  ip_adjacency_t * adj = adj_get(index);
1007 
1008  s = format (s, "%U", format_vnet_link, adj->ia_link);
1009  s = format (s, " via %U ",
1010  format_ip46_address, &adj->sub_type.nbr.next_hop,
1012  s = format (s, "%U",
1014  &adj->rewrite_header, sizeof (adj->rewrite_data), 0);
1015 
1016  return (s);
1017 }
1018 
1019 static void
1021 {
1022  adj_lock(dpo->dpoi_index);
1023 }
1024 static void
1026 {
1027  adj_unlock(dpo->dpoi_index);
1028 }
1029 
1030 static void
1032 {
1033  fib_show_memory_usage("Adjacency",
1035  pool_len(adj_pool),
1036  sizeof(ip_adjacency_t));
1037 }
1038 
1039 const static dpo_vft_t adj_nbr_dpo_vft = {
1040  .dv_lock = adj_dpo_lock,
1041  .dv_unlock = adj_dpo_unlock,
1042  .dv_format = format_adj_nbr,
1043  .dv_mem_show = adj_mem_show,
1044  .dv_get_urpf = adj_dpo_get_urpf,
1045 };
1046 const static dpo_vft_t adj_nbr_incompl_dpo_vft = {
1047  .dv_lock = adj_dpo_lock,
1048  .dv_unlock = adj_dpo_unlock,
1049  .dv_format = format_adj_nbr_incomplete,
1050  .dv_get_urpf = adj_dpo_get_urpf,
1051 };
1052 
1053 /**
1054  * @brief The per-protocol VLIB graph nodes that are assigned to an adjacency
1055  * object.
1056  *
1057  * this means that these graph nodes are ones from which a nbr is the
1058  * parent object in the DPO-graph.
1059  */
1060 const static char* const nbr_ip4_nodes[] =
1061 {
1062  "ip4-rewrite",
1063  NULL,
1064 };
1065 const static char* const nbr_ip6_nodes[] =
1066 {
1067  "ip6-rewrite",
1068  NULL,
1069 };
1070 const static char* const nbr_mpls_nodes[] =
1071 {
1072  "mpls-output",
1073  NULL,
1074 };
1075 const static char* const nbr_ethernet_nodes[] =
1076 {
1077  "adj-l2-rewrite",
1078  NULL,
1079 };
1080 const static char* const * const nbr_nodes[DPO_PROTO_NUM] =
1081 {
1086 };
1087 
1088 const static char* const nbr_incomplete_ip4_nodes[] =
1089 {
1090  "ip4-arp",
1091  NULL,
1092 };
1093 const static char* const nbr_incomplete_ip6_nodes[] =
1094 {
1095  "ip6-discover-neighbor",
1096  NULL,
1097 };
1098 const static char* const nbr_incomplete_mpls_nodes[] =
1099 {
1100  "mpls-adj-incomplete",
1101  NULL,
1102 };
1103 
1104 const static char* const * const nbr_incomplete_nodes[DPO_PROTO_NUM] =
1105 {
1109 };
1110 
1111 void
1113 {
1115  &adj_nbr_dpo_vft,
1116  nbr_nodes);
1118  &adj_nbr_incompl_dpo_vft,
1119  nbr_incomplete_nodes);
1120 }
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:440
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:668
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:805
#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
u8 proto
Definition: acl_types.api:47
Context for a walk of the adjacency neighbour DB.
Definition: adj_nbr.c:569
ip_adjacency_t * adj_pool
The global adjacency pool.
Definition: adj.c:33
#define CLIB_UNUSED(x)
Definition: clib.h:82
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:1002
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:307
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:1075
vl_api_fib_path_nh_t nh
Definition: fib_types.api:126
static const char *const nbr_incomplete_ip6_nodes[]
Definition: adj_nbr.c:1093
unsigned long u64
Definition: types.h:89
void adj_delegate_adj_created(ip_adjacency_t *adj)
Definition: adj_delegate.c:144
static adj_walk_rc_t adj_nbr_interface_state_change_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:711
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
#define NULL
Definition: clib.h:58
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:702
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
ip_lookup_main_t lookup_main
Definition: ip4.h:107
adj_walk_cb_t awc_cb
Definition: adj_nbr.c:571
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:612
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:983
static const char *const nbr_incomplete_mpls_nodes[]
Definition: adj_nbr.c:1098
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:297
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:264
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
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:748
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:431
vlib_node_registration_t ip6_discover_neighbor_node
(constructor) VLIB_REGISTER_NODE (ip6_discover_neighbor_node)
Definition: ip6_neighbor.c:278
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:59
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:118
static const char *const nbr_incomplete_ip4_nodes[]
Definition: adj_nbr.c:1088
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:782
static clib_error_t * adj_nbr_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj_nbr.c:911
struct adj_walk_ctx_t_ adj_walk_ctx_t
Context for a walk of the adjacency neighbour DB.
struct ip_adjacency_t_::@119::@120 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
static const char *const nbr_mpls_nodes[]
Definition: adj_nbr.c:1070
static void adj_dpo_lock(dpo_id_t *dpo)
Definition: adj_nbr.c:1020
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:324
union ip_adjacency_t_::@119 sub_type
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:1065
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:252
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:542
#define ADJ_NBR_DEFAULT_HASH_NUM_BUCKETS
vlib_node_registration_t ip4_arp_node
(constructor) VLIB_REGISTER_NODE (ip4_arp_node)
Definition: ip4_neighbor.c:261
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
void clib_bihash_foreach_key_value_pair(clib_bihash *h, clib_bihash_foreach_key_value_pair_cb *callback, void *arg)
Visit active (key,value) pairs in a bi-hash table.
long ctx[MAX_CONNS]
Definition: main.c:144
static adj_index_t adj_get_index(const ip_adjacency_t *adj)
Get a pointer to an adjacency object from its index.
Definition: adj_internal.h:101
struct _unformat_input_t unformat_input_t
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:860
static int adj_nbr_walk_cb(BVT(clib_bihash_kv) *kvp, void *arg)
Definition: adj_nbr.c:576
u32 ia_node_index
The VLIB node in which this adj is used to forward packets.
Definition: adj.h:332
#define ADJ_NBR_DEFAULT_HASH_MEMORY_SIZE
ip6_main_t ip6_main
Definition: ip6_forward.c:2703
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1112
void clib_bihash_init(clib_bihash *h, char *name, u32 nbuckets, uword memory_size)
initialize a bounded index extensible hash table
vlib_main_t * vm
Definition: in2out_ed.c:1810
static u8 ip46_address_is_equal(const ip46_address_t *ip46_1, const ip46_address_t *ip46_2)
Definition: ip46_address.h:93
format_function_t format_ip46_address
Definition: ip46_address.h:50
#define ADJ_NBR_SET_KEY(_key, _lt, _nh)
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
u32 flags
Definition: vhost_user.h:141
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
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:342
static adj_walk_rc_t adj_nbr_show_one(adj_index_t ai, void *arg)
Definition: adj_nbr.c:899
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:128
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:1031
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:588
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:351
Context passed between object during a back walk.
Definition: fib_node.h:208
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:152
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:707
#define ASSERT(truth)
ip_lookup_main_t lookup_main
Definition: ip6.h:180
enum vnet_link_t_ vnet_link_t
Link Type: A description of the protocol of packets on the link.
u8 nh_addr[16]
Definition: lisp_gpe.api:233
void * awc_ctx
Definition: adj_nbr.c:572
static const char *const nbr_ip4_nodes[]
The per-protocol VLIB graph nodes that are assigned to an adjacency object.
Definition: adj_nbr.c:1060
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 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:343
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:830
#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:694
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1496
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:1079
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:294
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:1025
#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:301
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:689
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
static int adj_db_count(BVT(clib_bihash_kv) *kvp, void *arg)
Definition: adj_nbr.c:533
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
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:640
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128