FD.io VPP  v19.04-6-g6f05f72
Vector Packet Processing
ip6_fib.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/fib/ip6_fib.h>
17 #include <vnet/fib/fib_table.h>
18 #include <vnet/dpo/ip6_ll_dpo.h>
19 
20 #include <vppinfra/bihash_24_8.h>
22 
23 static void
25 {
26  fib_prefix_t pfx = {
28  .fp_len = 0,
29  .fp_addr = {
30  .ip6 = {
31  { 0, 0, },
32  },
33  }
34  };
35 
36  /*
37  * Add the default route.
38  */
40  &pfx,
43 
44  /*
45  * all link local via the link local lookup DPO
46  */
47  pfx.fp_addr.ip6.as_u64[0] = clib_host_to_net_u64 (0xFE80000000000000ULL);
48  pfx.fp_addr.ip6.as_u64[1] = 0;
49  pfx.fp_len = 10;
51  &pfx,
54  ip6_ll_dpo_get());
55 }
56 
57 static u32
61  u8 *desc)
62 {
63  fib_table_t *fib_table;
64  ip6_fib_t *v6_fib;
65 
66  pool_get(ip6_main.fibs, fib_table);
68 
69  clib_memset(fib_table, 0, sizeof(*fib_table));
70  clib_memset(v6_fib, 0, sizeof(*v6_fib));
71 
72  ASSERT((fib_table - ip6_main.fibs) ==
73  (v6_fib - ip6_main.v6_fibs));
74 
75  fib_table->ft_proto = FIB_PROTOCOL_IP6;
76  fib_table->ft_index =
77  v6_fib->index =
78  (fib_table - ip6_main.fibs);
79 
80  hash_set(ip6_main.fib_index_by_table_id, table_id, fib_table->ft_index);
81 
82  fib_table->ft_table_id =
83  v6_fib->table_id =
84  table_id;
86  fib_table->ft_flags = flags;
87  fib_table->ft_desc = desc;
88 
89  vnet_ip6_fib_init(fib_table->ft_index);
90  fib_table_lock(fib_table->ft_index, FIB_PROTOCOL_IP6, src);
91 
92  return (fib_table->ft_index);
93 }
94 
95 u32
98 {
99  uword * p;
100 
101  p = hash_get (ip6_main.fib_index_by_table_id, table_id);
102  if (NULL == p)
103  return create_fib_with_table_id(table_id, src,
105  NULL);
106 
107  fib_table_lock(p[0], FIB_PROTOCOL_IP6, src);
108 
109  return (p[0]);
110 }
111 
112 u32
115  u8 *desc)
116 {
117  return (create_fib_with_table_id(~0, src, flags, desc));
118 }
119 
120 void
122 {
123  /*
124  * all link local first ...
125  */
126  fib_prefix_t pfx = {
128  .fp_len = 10,
129  .fp_addr = {
130  .ip6 = {
131  .as_u8 = {
132  [0] = 0xFE,
133  [1] = 0x80,
134  },
135  },
136  }
137  };
138  fib_table_entry_delete(fib_index,
139  &pfx,
141 
142  /*
143  * ... then the default route.
144  */
145  pfx.fp_addr.ip6.as_u64[0] = 0;
146  pfx.fp_len = 00;
148  &pfx,
150 
151  fib_table_t *fib_table = fib_table_get(fib_index, FIB_PROTOCOL_IP6);
152  fib_source_t source;
153 
154  /*
155  * validate no more routes.
156  */
157  ASSERT(0 == fib_table->ft_total_route_counts);
158  FOR_EACH_FIB_SOURCE(source)
159  {
160  ASSERT(0 == fib_table->ft_src_route_counts[source]);
161  }
162 
163  if (~0 != fib_table->ft_table_id)
164  {
166  }
168  pool_put(ip6_main.fibs, fib_table);
169 }
170 
173  const ip6_address_t *addr,
174  u32 len)
175 {
177  clib_bihash_kv_24_8_t kv, value;
178  int i, n_p, rv;
179  u64 fib;
180 
183 
184  kv.key[0] = addr->as_u64[0];
185  kv.key[1] = addr->as_u64[1];
186  fib = ((u64)((fib_index))<<32);
187 
188  /*
189  * start search from a mask length same length or shorter.
190  * we don't want matches longer than the mask passed
191  */
192  i = 0;
193  while (i < n_p && table->prefix_lengths_in_search_order[i] > len)
194  {
195  i++;
196  }
197 
198  for (; i < n_p; i++)
199  {
200  int dst_address_length = table->prefix_lengths_in_search_order[i];
201  ip6_address_t * mask = &ip6_main.fib_masks[dst_address_length];
202 
203  ASSERT(dst_address_length >= 0 && dst_address_length <= 128);
204  //As lengths are decreasing, masks are increasingly specific.
205  kv.key[0] &= mask->as_u64[0];
206  kv.key[1] &= mask->as_u64[1];
207  kv.key[2] = fib | dst_address_length;
208 
209  rv = clib_bihash_search_inline_2_24_8(&table->ip6_hash, &kv, &value);
210  if (rv == 0)
211  return value.value;
212  }
213 
214  return (FIB_NODE_INDEX_INVALID);
215 }
216 
219  const ip6_address_t *addr,
220  u32 len)
221 {
223  clib_bihash_kv_24_8_t kv, value;
224  ip6_address_t *mask;
225  u64 fib;
226  int rv;
227 
229  mask = &ip6_main.fib_masks[len];
230  fib = ((u64)((fib_index))<<32);
231 
232  kv.key[0] = addr->as_u64[0] & mask->as_u64[0];
233  kv.key[1] = addr->as_u64[1] & mask->as_u64[1];
234  kv.key[2] = fib | len;
235 
236  rv = clib_bihash_search_inline_2_24_8(&table->ip6_hash, &kv, &value);
237  if (rv == 0)
238  return value.value;
239 
240  return (FIB_NODE_INDEX_INVALID);
241 }
242 
243 static void
245 {
246  int i;
248  /* Note: bitmap reversed so this is in fact a longest prefix match */
250  ({
251  int dst_address_length = 128 - i;
252  vec_add1(table->prefix_lengths_in_search_order, dst_address_length);
253  }));
254 }
255 
256 void
258  const ip6_address_t *addr,
259  u32 len)
260 {
263  ip6_address_t *mask;
264  u64 fib;
265 
267  mask = &ip6_main.fib_masks[len];
268  fib = ((u64)((fib_index))<<32);
269 
270  kv.key[0] = addr->as_u64[0] & mask->as_u64[0];
271  kv.key[1] = addr->as_u64[1] & mask->as_u64[1];
272  kv.key[2] = fib | len;
273 
274  clib_bihash_add_del_24_8(&table->ip6_hash, &kv, 0);
275 
276  /* refcount accounting */
277  ASSERT (table->dst_address_length_refcounts[len] > 0);
278  if (--table->dst_address_length_refcounts[len] == 0)
279  {
282  128 - len, 0);
284  }
285 }
286 
287 void
289  const ip6_address_t *addr,
290  u32 len,
291  fib_node_index_t fib_entry_index)
292 {
295  ip6_address_t *mask;
296  u64 fib;
297 
299  mask = &ip6_main.fib_masks[len];
300  fib = ((u64)((fib_index))<<32);
301 
302  kv.key[0] = addr->as_u64[0] & mask->as_u64[0];
303  kv.key[1] = addr->as_u64[1] & mask->as_u64[1];
304  kv.key[2] = fib | len;
305  kv.value = fib_entry_index;
306 
307  clib_bihash_add_del_24_8(&table->ip6_hash, &kv, 1);
308 
310 
313  128 - len, 1);
315 }
316 
319  const ip6_address_t * dst)
320 {
321  u32 fib_index = vec_elt (im->fib_index_by_sw_if_index, sw_if_index);
322  return ip6_fib_table_fwding_lookup(im, fib_index, dst);
323 }
324 
325 u32
327 {
328  if (sw_if_index >= vec_len(ip6_main.fib_index_by_sw_if_index))
329  {
330  /*
331  * This is the case for interfaces that are not yet mapped to
332  * a IP table
333  */
334  return (~0);
335  }
336  return (ip6_main.fib_index_by_sw_if_index[sw_if_index]);
337 }
338 
339 void
341  const ip6_address_t *addr,
342  u32 len,
343  const dpo_id_t *dpo)
344 {
347  ip6_address_t *mask;
348  u64 fib;
349 
351  mask = &ip6_main.fib_masks[len];
352  fib = ((u64)((fib_index))<<32);
353 
354  kv.key[0] = addr->as_u64[0] & mask->as_u64[0];
355  kv.key[1] = addr->as_u64[1] & mask->as_u64[1];
356  kv.key[2] = fib | len;
357  kv.value = dpo->dpoi_index;
358 
359  clib_bihash_add_del_24_8(&table->ip6_hash, &kv, 1);
360 
362 
365  128 - len, 1);
367 }
368 
369 void
371  const ip6_address_t *addr,
372  u32 len,
373  const dpo_id_t *dpo)
374 {
377  ip6_address_t *mask;
378  u64 fib;
379 
381  mask = &ip6_main.fib_masks[len];
382  fib = ((u64)((fib_index))<<32);
383 
384  kv.key[0] = addr->as_u64[0] & mask->as_u64[0];
385  kv.key[1] = addr->as_u64[1] & mask->as_u64[1];
386  kv.key[2] = fib | len;
387  kv.value = dpo->dpoi_index;
388 
389  clib_bihash_add_del_24_8(&table->ip6_hash, &kv, 0);
390 
391  /* refcount accounting */
392  ASSERT (table->dst_address_length_refcounts[len] > 0);
393  if (--table->dst_address_length_refcounts[len] == 0)
394  {
397  128 - len, 0);
399  }
400 }
401 
402 /**
403  * @brief Context when walking the IPv6 table. Since all VRFs are in the
404  * same hash table, we need to filter only those we need as we walk
405  */
406 typedef struct ip6_fib_walk_ctx_t_
407 {
410  void *i6w_ctx;
414 
415 static int
417  void *arg)
418 {
419  ip6_fib_walk_ctx_t *ctx = arg;
421 
422  if ((kvp->key[2] >> 32) == ctx->i6w_fib_index)
423  {
424  key.as_u64[0] = kvp->key[0];
425  key.as_u64[1] = kvp->key[1];
426 
428  &key,
429  &ctx->i6w_root.fp_addr.ip6,
430  ctx->i6w_root.fp_len))
431  {
432  const fib_prefix_t *sub_tree;
433  int skip = 0;
434 
435  /*
436  * exclude sub-trees the walk does not want to explore
437  */
438  vec_foreach(sub_tree, ctx->i6w_sub_trees)
439  {
441  &key,
442  &sub_tree->fp_addr.ip6,
443  sub_tree->fp_len))
444  {
445  skip = 1;
446  break;
447  }
448  }
449 
450  if (!skip)
451  {
452  switch (ctx->i6w_fn(kvp->value, ctx->i6w_ctx))
453  {
455  break;
457  fib_prefix_t pfx = {
459  .fp_len = kvp->key[2] & 0xffffffff,
460  .fp_addr.ip6 = key,
461  };
462  vec_add1(ctx->i6w_sub_trees, pfx);
463  break;
464  }
465  case FIB_TABLE_WALK_STOP:
466  goto done;
467  }
468  }
469  }
470  }
471 done:
472 
473  return (1);
474 }
475 
476 void
479  void *arg)
480 {
482  .i6w_fib_index = fib_index,
483  .i6w_fn = fn,
484  .i6w_ctx = arg,
485  .i6w_root = {
486  .fp_proto = FIB_PROTOCOL_IP6,
487  },
488  .i6w_sub_trees = NULL,
489  };
490 
491  clib_bihash_foreach_key_value_pair_24_8(
494  &ctx);
495 
496  vec_free(ctx.i6w_sub_trees);
497 }
498 
499 void
501  const fib_prefix_t *root,
503  void *arg)
504 {
506  .i6w_fib_index = fib_index,
507  .i6w_fn = fn,
508  .i6w_ctx = arg,
509  .i6w_root = *root,
510  };
511 
512  clib_bihash_foreach_key_value_pair_24_8(
515  &ctx);
516 }
517 
518 typedef struct ip6_fib_show_ctx_t_ {
521 
522 static fib_table_walk_rc_t
524  void *arg)
525 {
526  ip6_fib_show_ctx_t *ctx = arg;
527 
528  vec_add1(ctx->entries, fib_entry_index);
529 
530  return (FIB_TABLE_WALK_CONTINUE);
531 }
532 
533 static void
535  vlib_main_t * vm)
536 {
537  fib_node_index_t *fib_entry_index;
539  .entries = NULL,
540  };
541 
544 
545  vec_foreach(fib_entry_index, ctx.entries)
546  {
547  vlib_cli_output(vm, "%U",
549  *fib_entry_index,
551  }
552 
553  vec_free(ctx.entries);
554 }
555 
556 static void
558  vlib_main_t * vm,
560  u32 mask_len,
561  int detail)
562 {
563  vlib_cli_output(vm, "%U",
565  ip6_fib_table_lookup(fib->index, address, mask_len),
566  (detail ?
569 }
570 
571 u8 *
572 format_ip6_fib_table_memory (u8 * s, va_list * args)
573 {
574  uword bytes_inuse;
575 
576  bytes_inuse =
577  alloc_arena_next
580 
581  bytes_inuse +=
582  alloc_arena_next(&(ip6_main.ip6_table[IP6_FIB_TABLE_FWDING].ip6_hash))
583  - alloc_arena(&(ip6_main.ip6_table[IP6_FIB_TABLE_FWDING].ip6_hash));
584 
585  s = format(s, "%=30s %=6d %=8ld\n",
586  "IPv6 unicast",
588  bytes_inuse);
589  return (s);
590 }
591 
592 typedef struct {
594  u64 count_by_prefix_length[129];
596 
597 static void
599  void *arg)
600 {
602  int mask_width;
603 
604  if ((kvp->key[2]>>32) != ap->fib_index)
605  return;
606 
607  mask_width = kvp->key[2] & 0xFF;
608 
610 }
611 
612 static clib_error_t *
614  unformat_input_t * input,
615  vlib_cli_command_t * cmd)
616 {
618  ip6_main_t * im6 = &ip6_main;
619  fib_table_t *fib_table;
620  ip6_fib_t * fib;
621  int verbose, matching;
622  ip6_address_t matching_address;
623  u32 mask_len = 128;
624  int table_id = -1, fib_index = ~0;
625  int detail = 0;
626 
627  verbose = 1;
628  matching = 0;
629 
631  {
632  if (unformat (input, "brief") ||
633  unformat (input, "summary") ||
634  unformat (input, "sum"))
635  verbose = 0;
636 
637  else if (unformat (input, "detail") ||
638  unformat (input, "det"))
639  detail = 1;
640 
641  else if (unformat (input, "%U/%d",
642  unformat_ip6_address, &matching_address, &mask_len))
643  matching = 1;
644 
645  else if (unformat (input, "%U", unformat_ip6_address, &matching_address))
646  matching = 1;
647 
648  else if (unformat (input, "table %d", &table_id))
649  ;
650  else if (unformat (input, "index %d", &fib_index))
651  ;
652  else
653  break;
654  }
655 
656  pool_foreach (fib_table, im6->fibs,
657  ({
658  fib_source_t source;
659  u8 *s = NULL;
660 
661  fib = pool_elt_at_index(im6->v6_fibs, fib_table->ft_index);
662  if (table_id >= 0 && table_id != (int)fib->table_id)
663  continue;
664  if (fib_index != ~0 && fib_index != (int)fib->index)
665  continue;
666  if (fib_table->ft_flags & FIB_TABLE_FLAG_IP6_LL)
667  continue;
668 
669  s = format(s, "%U, fib_index:%d, flow hash:[%U] locks:[",
670  format_fib_table_name, fib->index,
671  FIB_PROTOCOL_IP6,
672  fib->index,
673  format_ip_flow_hash_config,
674  fib_table->ft_flow_hash_config);
675  FOR_EACH_FIB_SOURCE(source)
676  {
677  if (0 != fib_table->ft_locks[source])
678  {
679  s = format(s, "%U:%d, ",
680  format_fib_source, source,
681  fib_table->ft_locks[source]);
682  }
683  }
684  s = format (s, "]");
685  vlib_cli_output (vm, "%v", s);
686  vec_free(s);
687 
688  /* Show summary? */
689  if (! verbose)
690  {
691  clib_bihash_24_8_t * h = &im6->ip6_table[IP6_FIB_TABLE_NON_FWDING].ip6_hash;
692  int len;
693 
694  vlib_cli_output (vm, "%=20s%=16s", "Prefix length", "Count");
695 
696  clib_memset (ca, 0, sizeof(*ca));
697  ca->fib_index = fib->index;
698 
699  clib_bihash_foreach_key_value_pair_24_8
701 
702  for (len = 128; len >= 0; len--)
703  {
704  if (ca->count_by_prefix_length[len])
705  vlib_cli_output (vm, "%=20d%=16lld",
706  len, ca->count_by_prefix_length[len]);
707  }
708  continue;
709  }
710 
711  if (!matching)
712  {
713  ip6_fib_table_show_all(fib, vm);
714  }
715  else
716  {
717  ip6_fib_table_show_one(fib, vm, &matching_address, mask_len, detail);
718  }
719  }));
720 
721  return 0;
722 }
723 
724 /*?
725  * This command displays the IPv6 FIB Tables (VRF Tables) and the route
726  * entries for each table.
727  *
728  * @note This command will run for a long time when the FIB tables are
729  * comprised of millions of entries. For those senarios, consider displaying
730  * in summary mode.
731  *
732  * @cliexpar
733  * @parblock
734  * Example of how to display all the IPv6 FIB tables:
735  * @cliexstart{show ip6 fib}
736  * ipv6-VRF:0, fib_index 0, flow hash: src dst sport dport proto
737  * @::/0
738  * unicast-ip6-chain
739  * [@0]: dpo-load-balance: [index:5 buckets:1 uRPF:5 to:[0:0]]
740  * [0] [@0]: dpo-drop ip6
741  * fe80::/10
742  * unicast-ip6-chain
743  * [@0]: dpo-load-balance: [index:10 buckets:1 uRPF:10 to:[0:0]]
744  * [0] [@2]: dpo-receive
745  * ff02::1/128
746  * unicast-ip6-chain
747  * [@0]: dpo-load-balance: [index:8 buckets:1 uRPF:8 to:[0:0]]
748  * [0] [@2]: dpo-receive
749  * ff02::2/128
750  * unicast-ip6-chain
751  * [@0]: dpo-load-balance: [index:7 buckets:1 uRPF:7 to:[0:0]]
752  * [0] [@2]: dpo-receive
753  * ff02::16/128
754  * unicast-ip6-chain
755  * [@0]: dpo-load-balance: [index:9 buckets:1 uRPF:9 to:[0:0]]
756  * [0] [@2]: dpo-receive
757  * ff02::1:ff00:0/104
758  * unicast-ip6-chain
759  * [@0]: dpo-load-balance: [index:6 buckets:1 uRPF:6 to:[0:0]]
760  * [0] [@2]: dpo-receive
761  * ipv6-VRF:8, fib_index 1, flow hash: src dst sport dport proto
762  * @::/0
763  * unicast-ip6-chain
764  * [@0]: dpo-load-balance: [index:21 buckets:1 uRPF:20 to:[0:0]]
765  * [0] [@0]: dpo-drop ip6
766  * @::a:1:1:0:4/126
767  * unicast-ip6-chain
768  * [@0]: dpo-load-balance: [index:27 buckets:1 uRPF:26 to:[0:0]]
769  * [0] [@4]: ipv6-glean: af_packet0
770  * @::a:1:1:0:7/128
771  * unicast-ip6-chain
772  * [@0]: dpo-load-balance: [index:28 buckets:1 uRPF:27 to:[0:0]]
773  * [0] [@2]: dpo-receive: @::a:1:1:0:7 on af_packet0
774  * fe80::/10
775  * unicast-ip6-chain
776  * [@0]: dpo-load-balance: [index:26 buckets:1 uRPF:25 to:[0:0]]
777  * [0] [@2]: dpo-receive
778  * fe80::fe:3eff:fe3e:9222/128
779  * unicast-ip6-chain
780  * [@0]: dpo-load-balance: [index:29 buckets:1 uRPF:28 to:[0:0]]
781  * [0] [@2]: dpo-receive: fe80::fe:3eff:fe3e:9222 on af_packet0
782  * ff02::1/128
783  * unicast-ip6-chain
784  * [@0]: dpo-load-balance: [index:24 buckets:1 uRPF:23 to:[0:0]]
785  * [0] [@2]: dpo-receive
786  * ff02::2/128
787  * unicast-ip6-chain
788  * [@0]: dpo-load-balance: [index:23 buckets:1 uRPF:22 to:[0:0]]
789  * [0] [@2]: dpo-receive
790  * ff02::16/128
791  * unicast-ip6-chain
792  * [@0]: dpo-load-balance: [index:25 buckets:1 uRPF:24 to:[0:0]]
793  * [0] [@2]: dpo-receive
794  * ff02::1:ff00:0/104
795  * unicast-ip6-chain
796  * [@0]: dpo-load-balance: [index:22 buckets:1 uRPF:21 to:[0:0]]
797  * [0] [@2]: dpo-receive
798  * @cliexend
799  *
800  * Example of how to display a summary of all IPv6 FIB tables:
801  * @cliexstart{show ip6 fib summary}
802  * ipv6-VRF:0, fib_index 0, flow hash: src dst sport dport proto
803  * Prefix length Count
804  * 128 3
805  * 104 1
806  * 10 1
807  * 0 1
808  * ipv6-VRF:8, fib_index 1, flow hash: src dst sport dport proto
809  * Prefix length Count
810  * 128 5
811  * 126 1
812  * 104 1
813  * 10 1
814  * 0 1
815  * @cliexend
816  * @endparblock
817  ?*/
818 /* *INDENT-OFF* */
819 VLIB_CLI_COMMAND (ip6_show_fib_command, static) = {
820  .path = "show ip6 fib",
821  .short_help = "show ip6 fib [summary] [table <table-id>] [index <fib-id>] [<ip6-addr>[/<width>]] [detail]",
822  .function = ip6_show_fib,
823 };
824 /* *INDENT-ON* */
u32 sw_if_index
Definition: ipsec_gre.api:37
fib_protocol_t fp_proto
protocol type
Definition: fib_types.h:212
u8 * format_fib_entry(u8 *s, va_list *args)
Definition: fib_entry.c:139
Continue on to the next entry.
Definition: fib_table.h:868
typedef address
Definition: ip_types.api:30
#define hash_set(h, key, value)
Definition: hash.h:255
u32 flags
Definition: vhost_user.h:115
fib_protocol_t ft_proto
Which protocol this table serves.
Definition: fib_table.h:74
ip6_fib_t * v6_fibs
Definition: ip6.h:185
#define hash_unset(h, key)
Definition: hash.h:261
The table that stores ALL routes learned by the DP.
Definition: ip6.h:134
#define FIB_ENTRY_FORMAT_DETAIL
Definition: fib_entry.h:517
u64 as_u64[2]
Definition: ip6_packet.h:51
unsigned long u64
Definition: types.h:89
static fib_table_walk_rc_t ip6_fib_table_show_walk(fib_node_index_t fib_entry_index, void *arg)
Definition: ip6_fib.c:523
#define NULL
Definition: clib.h:58
u8 * format_ip6_fib_table_memory(u8 *s, va_list *args)
Definition: ip6_fib.c:572
enum fib_table_flags_t_ fib_table_flags_t
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:522
int i
static uword * clib_bitmap_set(uword *ai, uword i, uword value)
Sets the ith bit of a bitmap to new_value Removes trailing zeros from the bitmap. ...
Definition: bitmap.h:167
clib_memset(h->entries, 0, sizeof(h->entries[0])*entries)
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
vl_api_ip4_address_t dst
Definition: ipsec_gre.api:39
static u32 ip6_fib_table_fwding_lookup(ip6_main_t *im, u32 fib_index, const ip6_address_t *dst)
Definition: ip6_fib.h:67
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:236
vhost_vring_addr_t addr
Definition: vhost_user.h:121
static void ip6_fib_table_show_all(ip6_fib_t *fib, vlib_main_t *vm)
Definition: ip6_fib.c:534
u8 * prefix_lengths_in_search_order
Definition: ip6.h:149
unsigned char u8
Definition: types.h:56
#define vec_reset_length(v)
Reset vector length to zero NULL-pointer tolerant.
static void vnet_ip6_fib_init(u32 fib_index)
Definition: ip6_fib.c:24
fib_node_index_t ip6_fib_table_lookup_exact_match(u32 fib_index, const ip6_address_t *addr, u32 len)
Definition: ip6_fib.c:218
clib_bihash_24_8_t ip6_hash
Definition: ip6.h:145
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:493
void fib_table_entry_special_remove(u32 fib_index, const fib_prefix_t *prefix, fib_source_t source)
Remove a &#39;special&#39; entry from the FIB.
Definition: fib_table.c:407
static uword ip6_destination_matches_route(const ip6_main_t *im, const ip6_address_t *key, const ip6_address_t *dest, uword dest_length)
Definition: ip6.h:265
fib_prefix_t * i6w_sub_trees
Definition: ip6_fib.c:412
Aggregrate type for a prefix.
Definition: fib_types.h:203
A represenation of a single IP6 table.
Definition: ip6.h:142
unsigned int u32
Definition: types.h:88
u16 fp_len
The mask length.
Definition: fib_types.h:207
static u32 create_fib_with_table_id(u32 table_id, fib_source_t src, fib_table_flags_t flags, u8 *desc)
Definition: ip6_fib.c:58
int fib_entry_cmp_for_sort(void *i1, void *i2)
Definition: fib_entry.c:1616
u32 ip6_fib_table_get_index_for_sw_if_index(u32 sw_if_index)
Definition: ip6_fib.c:326
Definition: fib_entry.h:275
The identity of a DPO is a combination of its type and its instance number/index of objects of that t...
Definition: dpo.h:168
#define hash_get(h, key)
Definition: hash.h:249
#define clib_bitmap_foreach(i, ai, body)
Macro to iterate across set bits in a bitmap.
Definition: bitmap.h:361
enum fib_source_t_ fib_source_t
The different sources that can create a route.
void ip6_fib_table_fwding_dpo_update(u32 fib_index, const ip6_address_t *addr, u32 len, const dpo_id_t *dpo)
Definition: ip6_fib.c:340
ip46_address_t fp_addr
The address type is not deriveable from the fp_addr member.
Definition: fib_types.h:226
long ctx[MAX_CONNS]
Definition: main.c:144
struct _unformat_input_t unformat_input_t
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:286
void ip6_fib_table_fwding_dpo_remove(u32 fib_index, const ip6_address_t *addr, u32 len, const dpo_id_t *dpo)
Definition: ip6_fib.c:370
u32 ft_total_route_counts
Total route counters.
Definition: fib_table.h:109
u32 index
Definition: ip6.h:78
vl_api_ip4_address_t src
Definition: ipsec_gre.api:38
void ip6_fib_table_walk(u32 fib_index, fib_table_walk_fn_t fn, void *arg)
Walk all entries in a FIB table N.B: This is NOT safe to deletes.
Definition: ip6_fib.c:477
u32 ip6_fib_table_find_or_create_and_lock(u32 table_id, fib_source_t src)
Get or create an IPv6 fib.
Definition: ip6_fib.c:96
Stop the walk completely.
Definition: fib_table.h:876
void ip6_fib_table_entry_remove(u32 fib_index, const ip6_address_t *addr, u32 len)
Definition: ip6_fib.c:257
Context when walking the IPv6 table.
Definition: ip6_fib.c:406
u8 len
Definition: ip_types.api:49
uword * fib_index_by_table_id
Definition: ip6.h:204
unformat_function_t unformat_ip6_address
Definition: format.h:91
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P with alignment A.
Definition: pool.h:230
ip6_address_t fib_masks[129]
Definition: ip6.h:191
fib_node_index_t fib_table_entry_special_add(u32 fib_index, const fib_prefix_t *prefix, fib_source_t source, fib_entry_flag_t flags)
Add a &#39;special&#39; entry to the FIB.
Definition: fib_table.c:388
fib_node_index_t ft_index
Index into FIB vector.
Definition: fib_table.h:94
void ip6_fib_table_destroy(u32 fib_index)
Definition: ip6_fib.c:121
#define UNFORMAT_END_OF_INPUT
Definition: format.h:144
u32 ft_table_id
Table ID (hash key) for this FIB.
Definition: fib_table.h:89
vlib_main_t * vm
Definition: buffer.c:312
uint32_t mask_width(const boost::asio::ip::address &addr)
Get the prefix mask length of a host route from the boost address.
Definition: prefix.cpp:242
fib_prefix_t i6w_root
Definition: ip6_fib.c:411
u32 ft_flow_hash_config
flow hash configuration
Definition: fib_table.h:99
enum fib_table_walk_rc_t_ fib_table_walk_rc_t
return code controlling how a table walk proceeds
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:341
void fib_table_entry_delete(u32 fib_index, const fib_prefix_t *prefix, fib_source_t source)
Delete a FIB entry.
Definition: fib_table.c:853
u32 ip6_fib_table_create_and_lock(fib_source_t src, fib_table_flags_t flags, u8 *desc)
Definition: ip6_fib.c:113
#define FOR_EACH_FIB_SOURCE(_item)
Definition: fib_entry.h:185
Definition: ip6.h:69
u8 * ft_desc
Table description.
Definition: fib_table.h:114
fib_table_flags_t ft_flags
Table flags.
Definition: fib_table.h:79
const dpo_id_t * ip6_ll_dpo_get(void)
The IP6 link-local DPO represents the lookup of a packet in the link-local IPv6 FIB.
Definition: ip6_ll_dpo.c:34
Definition: fib_entry.h:278
This table stores the routes that are used to forward traffic.
Definition: ip6.h:127
static void compute_prefix_lengths_in_search_order(ip6_fib_table_instance_t *table)
Definition: ip6_fib.c:244
u32 fib_node_index_t
A typedef of a node index.
Definition: fib_types.h:30
fib_node_index_t * entries
Definition: ip6_fib.c:519
fib_table_walk_fn_t i6w_fn
Definition: ip6_fib.c:409
fib_table_walk_rc_t(* fib_table_walk_fn_t)(fib_node_index_t fei, void *ctx)
Call back function when walking entries in a FIB table.
Definition: fib_table.h:882
static int ip6_fib_walk_cb(clib_bihash_kv_24_8_t *kvp, void *arg)
Definition: ip6_fib.c:416
void fib_table_lock(u32 fib_index, fib_protocol_t proto, fib_source_t source)
Release a reference counting lock on the table.
Definition: fib_table.c:1257
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:155
fib_node_index_t fib_table_entry_special_dpo_add(u32 fib_index, const fib_prefix_t *prefix, fib_source_t source, fib_entry_flag_t flags, const dpo_id_t *dpo)
Add a &#39;special&#39; entry to the FIB that links to the DPO passed A special entry is an entry that the FI...
Definition: fib_table.c:307
#define pool_put_index(p, i)
Free pool element with given index.
Definition: pool.h:311
#define ASSERT(truth)
ip6_main_t ip6_main
Definition: ip6_forward.c:2680
The default route source.
Definition: fib_entry.h:137
i32 dst_address_length_refcounts[129]
Definition: ip6.h:150
static void ip6_fib_table_show_one(ip6_fib_t *fib, vlib_main_t *vm, ip6_address_t *address, u32 mask_len, int detail)
Definition: ip6_fib.c:557
u32 ft_src_route_counts[FIB_SOURCE_MAX]
Per-source route counters.
Definition: fib_table.h:104
#define IP_FLOW_HASH_DEFAULT
Default: 5-tuple without the "reverse" bit.
Definition: lookup.h:70
ip6_fib_table_instance_t ip6_table[IP6_FIB_NUM_TABLES]
The two FIB tables; fwding and non-fwding.
Definition: ip6.h:172
Do no traverse down this sub-tree.
Definition: fib_table.h:872
#define vec_elt(v, i)
Get vector value at index i.
static void count_routes_in_fib_at_prefix_length(clib_bihash_kv_24_8_t *kvp, void *arg)
Definition: ip6_fib.c:598
#define FIB_ENTRY_FORMAT_BRIEF
Definition: fib_entry.h:516
struct ip6_fib_show_ctx_t_ ip6_fib_show_ctx_t
u32 ip6_fib_table_fwding_lookup_with_if_index(ip6_main_t *im, u32 sw_if_index, const ip6_address_t *dst)
Definition: ip6_fib.c:317
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:184
#define FIB_NODE_INDEX_INVALID
Definition: fib_types.h:31
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
static clib_error_t * ip6_show_fib(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: ip6_fib.c:613
u64 uword
Definition: types.h:112
#define vec_sort_with_function(vec, f)
Sort a vector using the supplied element comparison function.
Definition: vec.h:980
void ip6_fib_table_entry_insert(u32 fib_index, const ip6_address_t *addr, u32 len, fib_node_index_t fib_entry_index)
Definition: ip6_fib.c:288
typedef key
Definition: ipsec.api:244
uword * non_empty_dst_address_length_bitmap
Definition: ip6.h:148
Special sources.
Definition: fib_entry.h:40
fib_table_t * fib_table_get(fib_node_index_t index, fib_protocol_t proto)
Get a pointer to a FIB table.
Definition: fib_table.c:27
struct ip6_fib_walk_ctx_t_ ip6_fib_walk_ctx_t
Context when walking the IPv6 table.
#define FIB_ENTRY_FORMAT_DETAIL2
Definition: fib_entry.h:518
#define vec_foreach(var, vec)
Vector iterator.
fib_node_index_t ip6_fib_table_lookup(u32 fib_index, const ip6_address_t *addr, u32 len)
Definition: ip6_fib.c:172
u32 table_id
Definition: ip6.h:75
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:59
void ip6_fib_table_sub_tree_walk(u32 fib_index, const fib_prefix_t *root, fib_table_walk_fn_t fn, void *arg)
Walk all entries in a sub-tree of the FIB table N.B: This is NOT safe to deletes. ...
Definition: ip6_fib.c:500
struct fib_table_t_ * fibs
Definition: ip6.h:182
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:725
u32 * fib_index_by_sw_if_index
Definition: ip6.h:194
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:972
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:170
A protocol Independent FIB table.
Definition: fib_table.h:69
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128