FD.io VPP  v19.01.3-6-g70449b9b9
Vector Packet Processing
load_balance.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/ip/lookup.h>
17 #include <vnet/dpo/load_balance.h>
19 #include <vnet/dpo/drop_dpo.h>
20 #include <vppinfra/math.h> /* for fabs */
21 #include <vnet/adj/adj.h>
22 #include <vnet/adj/adj_internal.h>
23 #include <vnet/fib/fib_urpf_list.h>
24 #include <vnet/bier/bier_fwd.h>
25 
26 /*
27  * distribution error tolerance for load-balancing
28  */
30 
32 
33 /**
34  * the logger
35  */
37 
38 #define LB_DBG(_lb, _fmt, _args...) \
39 { \
40  vlib_log_debug(load_balance_logger, \
41  "lb:[%U]:" _fmt, \
42  format_load_balance, load_balance_get_index(_lb), \
43  LOAD_BALANCE_FORMAT_NONE, \
44  ##_args); \
45 }
46 
47 /**
48  * Pool of all DPOs. It's not static so the DP can have fast access
49  */
51 
52 /**
53  * The one instance of load-balance main
54  */
55 load_balance_main_t load_balance_main = {
56  .lbm_to_counters = {
57  .name = "route-to",
58  .stat_segment_name = "/net/route/to",
59  },
60  .lbm_via_counters = {
61  .name = "route-via",
62  .stat_segment_name = "/net/route/via",
63  }
64 };
65 
66 f64
68 {
70 }
71 
72 static inline index_t
74 {
75  return (lb - load_balance_pool);
76 }
77 
78 static inline dpo_id_t*
80 {
81  if (LB_HAS_INLINE_BUCKETS(lb))
82  {
83  return (lb->lb_buckets_inline);
84  }
85  else
86  {
87  return (lb->lb_buckets);
88  }
89 }
90 
91 static load_balance_t *
93 {
94  load_balance_t *lb;
95 
96  pool_get_aligned(load_balance_pool, lb, CLIB_CACHE_LINE_BYTES);
97  clib_memset(lb, 0, sizeof(*lb));
98 
99  lb->lb_map = INDEX_INVALID;
100  lb->lb_urpf = INDEX_INVALID;
101  vlib_validate_combined_counter(&(load_balance_main.lbm_to_counters),
105  vlib_zero_combined_counter(&(load_balance_main.lbm_to_counters),
107  vlib_zero_combined_counter(&(load_balance_main.lbm_via_counters),
109 
110  return (lb);
111 }
112 
113 static u8*
116  u32 indent,
117  u8 *s)
118 {
119  vlib_counter_t to, via;
120  load_balance_t *lb;
121  dpo_id_t *buckets;
122  u32 i;
123 
124  lb = load_balance_get(lbi);
125  vlib_get_combined_counter(&(load_balance_main.lbm_to_counters), lbi, &to);
126  vlib_get_combined_counter(&(load_balance_main.lbm_via_counters), lbi, &via);
127  buckets = load_balance_get_buckets(lb);
128 
129  s = format(s, "%U: ", format_dpo_type, DPO_LOAD_BALANCE);
130  s = format(s, "[proto:%U ", format_dpo_proto, lb->lb_proto);
131  s = format(s, "index:%d buckets:%d ", lbi, lb->lb_n_buckets);
132  s = format(s, "uRPF:%d ", lb->lb_urpf);
133  if (lb->lb_flags)
134  {
135  load_balance_attr_t attr;
136 
137  s = format(s, "flags:[");
138 
140  {
141  if (lb->lb_flags & (1 << attr))
142  {
143  s = format (s, "%s", load_balance_attr_names[attr]);
144  }
145  }
146  s = format(s, "] ");
147  }
148  s = format(s, "to:[%Ld:%Ld]", to.packets, to.bytes);
149  if (0 != via.packets)
150  {
151  s = format(s, " via:[%Ld:%Ld]",
152  via.packets, via.bytes);
153  }
154  s = format(s, "]");
155 
156  if (INDEX_INVALID != lb->lb_map)
157  {
158  s = format(s, "\n%U%U",
159  format_white_space, indent+4,
160  format_load_balance_map, lb->lb_map, indent+4);
161  }
162  for (i = 0; i < lb->lb_n_buckets; i++)
163  {
164  s = format(s, "\n%U[%d] %U",
165  format_white_space, indent+2,
166  i,
168  &buckets[i], indent+6);
169  }
170  return (s);
171 }
172 
173 u8*
174 format_load_balance (u8 * s, va_list * args)
175 {
176  index_t lbi = va_arg(*args, index_t);
178 
179  return (load_balance_format(lbi, flags, 0, s));
180 }
181 
182 static u8*
183 format_load_balance_dpo (u8 * s, va_list * args)
184 {
185  index_t lbi = va_arg(*args, index_t);
186  u32 indent = va_arg(*args, u32);
187 
188  return (load_balance_format(lbi, LOAD_BALANCE_FORMAT_DETAIL, indent, s));
189 }
190 
191 static load_balance_t *
193  dpo_proto_t lb_proto,
194  flow_hash_config_t fhc)
195 {
196  load_balance_t *lb;
197 
198  lb = load_balance_alloc_i();
199  lb->lb_hash_config = fhc;
200  lb->lb_n_buckets = num_buckets;
201  lb->lb_n_buckets_minus_1 = num_buckets-1;
202  lb->lb_proto = lb_proto;
203 
204  if (!LB_HAS_INLINE_BUCKETS(lb))
205  {
207  lb->lb_n_buckets - 1,
209  }
210 
211  LB_DBG(lb, "create");
212 
213  return (lb);
214 }
215 
216 index_t
218  dpo_proto_t lb_proto,
219  flow_hash_config_t fhc)
220 {
221  return (load_balance_get_index(load_balance_create_i(n_buckets, lb_proto, fhc)));
222 }
223 
224 static inline void
226  u32 bucket,
227  dpo_id_t *buckets,
228  const dpo_id_t *next)
229 {
230  dpo_stack(DPO_LOAD_BALANCE, lb->lb_proto, &buckets[bucket], next);
231 }
232 
233 void
235  u32 bucket,
236  const dpo_id_t *next)
237 {
238  load_balance_t *lb;
239  dpo_id_t *buckets;
240 
241  lb = load_balance_get(lbi);
242  buckets = load_balance_get_buckets(lb);
243 
244  ASSERT(bucket < lb->lb_n_buckets);
245 
246  load_balance_set_bucket_i(lb, bucket, buckets, next);
247 }
248 
249 int
251 {
252  load_balance_t *lb;
253 
254  if (DPO_LOAD_BALANCE != dpo->dpoi_type)
255  return (0);
256 
257  lb = load_balance_get(dpo->dpoi_index);
258 
259  if (1 == lb->lb_n_buckets)
260  {
261  return (dpo_is_drop(load_balance_get_bucket_i(lb, 0)));
262  }
263  return (0);
264 }
265 
266 u16
268 {
269  load_balance_t *lb;
270 
271  lb = load_balance_get(lbi);
272 
273  return (lb->lb_n_buckets);
274 }
275 
276 void
279 {
280  load_balance_t *lb;
281 
282  lb = load_balance_get(lbi);
284 }
285 
286 
287 void
289  index_t urpf)
290 {
291  load_balance_t *lb;
292  index_t old;
293 
294  lb = load_balance_get(lbi);
295 
296  /*
297  * packets in flight we see this change. but it's atomic, so :P
298  */
299  old = lb->lb_urpf;
300  lb->lb_urpf = urpf;
301 
303  fib_urpf_list_lock(urpf);
304 }
305 
306 index_t
308 {
309  load_balance_t *lb;
310 
311  lb = load_balance_get(lbi);
312 
313  return (lb->lb_urpf);
314 }
315 
316 const dpo_id_t *
318  u32 bucket)
319 {
320  load_balance_t *lb;
321 
322  lb = load_balance_get(lbi);
323 
324  return (load_balance_get_bucket_i(lb, bucket));
325 }
326 
327 static int
329  const load_balance_path_t * n2)
330 {
331  return ((int) n1->path_weight - (int) n2->path_weight);
332 }
333 
334 /* Given next hop vector is over-written with normalized one with sorted weights and
335  with weights corresponding to the number of adjacencies for each next hop.
336  Returns number of adjacencies in block. */
337 u32
339  load_balance_path_t ** normalized_next_hops,
340  u32 *sum_weight_in,
342 {
344  uword n_nhs, n_adj, n_adj_left, i, sum_weight;
345  f64 norm, error;
346 
347  n_nhs = vec_len (raw_next_hops);
348  ASSERT (n_nhs > 0);
349  if (n_nhs == 0)
350  return 0;
351 
352  /* Allocate enough space for 2 copies; we'll use second copy to save original weights. */
353  nhs = *normalized_next_hops;
354  vec_validate (nhs, 2*n_nhs - 1);
355 
356  /* Fast path: 1 next hop in block. */
357  n_adj = n_nhs;
358  if (n_nhs == 1)
359  {
360  nhs[0] = raw_next_hops[0];
361  nhs[0].path_weight = 1;
362  _vec_len (nhs) = 1;
363  sum_weight = 1;
364  goto done;
365  }
366 
367  else if (n_nhs == 2)
368  {
369  int cmp = next_hop_sort_by_weight (&raw_next_hops[0], &raw_next_hops[1]) < 0;
370 
371  /* Fast sort. */
372  nhs[0] = raw_next_hops[cmp];
373  nhs[1] = raw_next_hops[cmp ^ 1];
374 
375  /* Fast path: equal cost multipath with 2 next hops. */
376  if (nhs[0].path_weight == nhs[1].path_weight)
377  {
378  nhs[0].path_weight = nhs[1].path_weight = 1;
379  _vec_len (nhs) = 2;
380  sum_weight = 2;
381  goto done;
382  }
383  }
384  else
385  {
386  clib_memcpy_fast (nhs, raw_next_hops, n_nhs * sizeof (raw_next_hops[0]));
387  qsort (nhs, n_nhs, sizeof (nhs[0]), (void *) next_hop_sort_by_weight);
388  }
389 
390  /* Find total weight to normalize weights. */
391  sum_weight = 0;
392  for (i = 0; i < n_nhs; i++)
393  sum_weight += nhs[i].path_weight;
394 
395  /* In the unlikely case that all weights are given as 0, set them all to 1. */
396  if (sum_weight == 0)
397  {
398  for (i = 0; i < n_nhs; i++)
399  nhs[i].path_weight = 1;
400  sum_weight = n_nhs;
401  }
402 
403  /* Save copies of all next hop weights to avoid being overwritten in loop below. */
404  for (i = 0; i < n_nhs; i++)
405  nhs[n_nhs + i].path_weight = nhs[i].path_weight;
406 
407  /* Try larger and larger power of 2 sized adjacency blocks until we
408  find one where traffic flows to within 1% of specified weights. */
409  for (n_adj = max_pow2 (n_nhs); ; n_adj *= 2)
410  {
411  error = 0;
412 
413  norm = n_adj / ((f64) sum_weight);
414  n_adj_left = n_adj;
415  for (i = 0; i < n_nhs; i++)
416  {
417  f64 nf = nhs[n_nhs + i].path_weight * norm; /* use saved weights */
418  word n = flt_round_nearest (nf);
419 
420  n = n > n_adj_left ? n_adj_left : n;
421  n_adj_left -= n;
422  error += fabs (nf - n);
423  nhs[i].path_weight = n;
424 
425  if (0 == nhs[i].path_weight)
426  {
427  /*
428  * when the weight skew is high (norm is small) and n == nf.
429  * without this correction the path with a low weight would have
430  * no represenation in the load-balanace - don't want that.
431  * If the weight skew is high so the load-balance has many buckets
432  * to allow it. pays ya money takes ya choice.
433  */
434  error = n_adj;
435  break;
436  }
437  }
438 
439  nhs[0].path_weight += n_adj_left;
440 
441  /* Less than 5% average error per adjacency with this size adjacency block? */
442  if (error <= multipath_next_hop_error_tolerance*n_adj)
443  {
444  /* Truncate any next hops with zero weight. */
445  _vec_len (nhs) = i;
446  break;
447  }
448  }
449 
450 done:
451  /* Save vector for next call. */
452  *normalized_next_hops = nhs;
453  *sum_weight_in = sum_weight;
454  return n_adj;
455 }
456 
457 static load_balance_path_t *
459  dpo_proto_t drop_proto)
460 {
461  if (0 == vec_len(nhs))
462  {
463  load_balance_path_t *new_nhs = NULL, *nh;
464 
465  /*
466  * we need something for the load-balance. so use the drop
467  */
468  vec_add2(new_nhs, nh, 1);
469 
470  nh->path_weight = 1;
471  dpo_copy(&nh->path_dpo, drop_dpo_get(drop_proto));
472 
473  return (new_nhs);
474  }
475 
476  return (NULL);
477 }
478 
479 /*
480  * Fill in adjacencies in block based on corresponding
481  * next hop adjacencies.
482  */
483 static void
486  dpo_id_t *buckets,
487  u32 n_buckets)
488 {
490  u16 ii, bucket;
491 
492  bucket = 0;
493 
494  /*
495  * the next-hops have normalised weights. that means their sum is the number
496  * of buckets we need to fill.
497  */
498  vec_foreach (nh, nhs)
499  {
500  for (ii = 0; ii < nh->path_weight; ii++)
501  {
502  ASSERT(bucket < n_buckets);
503  load_balance_set_bucket_i(lb, bucket++, buckets, &nh->path_dpo);
504  }
505  }
506 }
507 static void
510  dpo_id_t *buckets,
511  u32 n_buckets)
512 {
513  load_balance_path_t *nh, *fwding_paths;
514  u16 ii, bucket, fpath;
515 
516  fpath = bucket = 0;
517  fwding_paths = NULL;
518 
519  vec_foreach (nh, nhs)
520  {
521  if (!dpo_is_drop(&nh->path_dpo))
522  {
523  vec_add1(fwding_paths, *nh);
524  }
525  }
526  if (vec_len(fwding_paths) == 0)
527  fwding_paths = vec_dup(nhs);
528 
529  /*
530  * the next-hops have normalised weights. that means their sum is the number
531  * of buckets we need to fill.
532  */
533  vec_foreach (nh, nhs)
534  {
535  for (ii = 0; ii < nh->path_weight; ii++)
536  {
537  ASSERT(bucket < n_buckets);
538  if (!dpo_is_drop(&nh->path_dpo))
539  {
540  load_balance_set_bucket_i(lb, bucket++, buckets, &nh->path_dpo);
541  }
542  else
543  {
544  /* fill the bucks from the next up path */
545  load_balance_set_bucket_i(lb, bucket++, buckets, &fwding_paths[fpath].path_dpo);
546  fpath = (fpath + 1) % vec_len(fwding_paths);
547  }
548  }
549  }
550 
551  vec_free(fwding_paths);
552 }
553 
554 static void
557  dpo_id_t *buckets,
558  u32 n_buckets,
560 {
561  if (flags & LOAD_BALANCE_FLAG_STICKY)
562  {
563  load_balance_fill_buckets_sticky(lb, nhs, buckets, n_buckets);
564  }
565  else
566  {
567  load_balance_fill_buckets_norm(lb, nhs, buckets, n_buckets);
568  }
569 }
570 
571 static inline void
573  u32 n_buckets)
574 {
575  lb->lb_n_buckets = n_buckets;
576  lb->lb_n_buckets_minus_1 = n_buckets-1;
577 }
578 
579 void
581  const load_balance_path_t * raw_nhs,
583 {
584  load_balance_path_t *nh, *nhs, *fixed_nhs;
585  u32 sum_of_weights, n_buckets, ii;
586  index_t lbmi, old_lbmi;
587  load_balance_t *lb;
588  dpo_id_t *tmp_dpo;
589 
590  nhs = NULL;
591 
593  lb = load_balance_get(dpo->dpoi_index);
594  lb->lb_flags = flags;
595  fixed_nhs = load_balance_multipath_next_hop_fixup(raw_nhs, lb->lb_proto);
596  n_buckets =
597  ip_multipath_normalize_next_hops((NULL == fixed_nhs ?
598  raw_nhs :
599  fixed_nhs),
600  &nhs,
601  &sum_of_weights,
603 
604  ASSERT (n_buckets >= vec_len (raw_nhs));
605 
606  /*
607  * Save the old load-balance map used, and get a new one if required.
608  */
609  old_lbmi = lb->lb_map;
610  if (flags & LOAD_BALANCE_FLAG_USES_MAP)
611  {
612  lbmi = load_balance_map_add_or_lock(n_buckets, sum_of_weights, nhs);
613  }
614  else
615  {
616  lbmi = INDEX_INVALID;
617  }
618 
619  if (0 == lb->lb_n_buckets)
620  {
621  /*
622  * first time initialisation. no packets inflight, so we can write
623  * at leisure.
624  */
625  load_balance_set_n_buckets(lb, n_buckets);
626 
627  if (!LB_HAS_INLINE_BUCKETS(lb))
629  lb->lb_n_buckets - 1,
631 
634  n_buckets, flags);
635  lb->lb_map = lbmi;
636  }
637  else
638  {
639  /*
640  * This is a modification of an existing load-balance.
641  * We need to ensure that packets inflight see a consistent state, that
642  * is the number of reported buckets the LB has (read from
643  * lb_n_buckets_minus_1) is not more than it actually has. So if the
644  * number of buckets is increasing, we must update the bucket array first,
645  * then the reported number. vice-versa if the number of buckets goes down.
646  */
647  if (n_buckets == lb->lb_n_buckets)
648  {
649  /*
650  * no change in the number of buckets. we can simply fill what
651  * is new over what is old.
652  */
655  n_buckets, flags);
656  lb->lb_map = lbmi;
657  }
658  else if (n_buckets > lb->lb_n_buckets)
659  {
660  /*
661  * we have more buckets. the old load-balance map (if there is one)
662  * will remain valid, i.e. mapping to indices within range, so we
663  * update it last.
664  */
665  if (n_buckets > LB_NUM_INLINE_BUCKETS &&
667  {
668  /*
669  * the new increased number of buckets is crossing the threshold
670  * from the inline storage to out-line. Alloc the outline buckets
671  * first, then fixup the number. then reset the inlines.
672  */
673  ASSERT(NULL == lb->lb_buckets);
675  n_buckets - 1,
677 
679  lb->lb_buckets,
680  n_buckets, flags);
682  load_balance_set_n_buckets(lb, n_buckets);
683 
685 
686  for (ii = 0; ii < LB_NUM_INLINE_BUCKETS; ii++)
687  {
688  dpo_reset(&lb->lb_buckets_inline[ii]);
689  }
690  }
691  else
692  {
693  if (n_buckets <= LB_NUM_INLINE_BUCKETS)
694  {
695  /*
696  * we are not crossing the threshold and it's still inline buckets.
697  * we can write the new on the old..
698  */
701  n_buckets, flags);
703  load_balance_set_n_buckets(lb, n_buckets);
704  }
705  else
706  {
707  /*
708  * we are not crossing the threshold. We need a new bucket array to
709  * hold the increased number of choices.
710  */
711  dpo_id_t *new_buckets, *old_buckets, *tmp_dpo;
712 
713  new_buckets = NULL;
714  old_buckets = load_balance_get_buckets(lb);
715 
716  vec_validate_aligned(new_buckets,
717  n_buckets - 1,
719 
720  load_balance_fill_buckets(lb, nhs, new_buckets,
721  n_buckets, flags);
723  lb->lb_buckets = new_buckets;
725  load_balance_set_n_buckets(lb, n_buckets);
726 
727  vec_foreach(tmp_dpo, old_buckets)
728  {
729  dpo_reset(tmp_dpo);
730  }
731  vec_free(old_buckets);
732  }
733  }
734 
735  /*
736  * buckets fixed. ready for the MAP update.
737  */
738  lb->lb_map = lbmi;
739  }
740  else
741  {
742  /*
743  * bucket size shrinkage.
744  * Any map we have will be based on the old
745  * larger number of buckets, so will be translating to indices
746  * out of range. So the new MAP must be installed first.
747  */
748  lb->lb_map = lbmi;
750 
751 
752  if (n_buckets <= LB_NUM_INLINE_BUCKETS &&
754  {
755  /*
756  * the new decreased number of buckets is crossing the threshold
757  * from out-line storage to inline:
758  * 1 - Fill the inline buckets,
759  * 2 - fixup the number (and this point the inline buckets are
760  * used).
761  * 3 - free the outline buckets
762  */
764  lb->lb_buckets_inline,
765  n_buckets, flags);
767  load_balance_set_n_buckets(lb, n_buckets);
769 
770  vec_foreach(tmp_dpo, lb->lb_buckets)
771  {
772  dpo_reset(tmp_dpo);
773  }
774  vec_free(lb->lb_buckets);
775  }
776  else
777  {
778  /*
779  * not crossing the threshold.
780  * 1 - update the number to the smaller size
781  * 2 - write the new buckets
782  * 3 - reset those no longer used.
783  */
784  dpo_id_t *buckets;
785  u32 old_n_buckets;
786 
787  old_n_buckets = lb->lb_n_buckets;
788  buckets = load_balance_get_buckets(lb);
789 
790  load_balance_set_n_buckets(lb, n_buckets);
792 
793  load_balance_fill_buckets(lb, nhs, buckets,
794  n_buckets, flags);
795 
796  for (ii = n_buckets; ii < old_n_buckets; ii++)
797  {
798  dpo_reset(&buckets[ii]);
799  }
800  }
801  }
802  }
803 
804  vec_foreach (nh, nhs)
805  {
806  dpo_reset(&nh->path_dpo);
807  }
808  vec_free(nhs);
809  vec_free(fixed_nhs);
810 
811  load_balance_map_unlock(old_lbmi);
812 }
813 
814 static void
816 {
817  load_balance_t *lb;
818 
819  lb = load_balance_get(dpo->dpoi_index);
820 
821  lb->lb_locks++;
822 }
823 
824 static void
826 {
827  dpo_id_t *buckets;
828  int i;
829 
830  buckets = load_balance_get_buckets(lb);
831 
832  for (i = 0; i < lb->lb_n_buckets; i++)
833  {
834  dpo_reset(&buckets[i]);
835  }
836 
837  LB_DBG(lb, "destroy");
838  if (!LB_HAS_INLINE_BUCKETS(lb))
839  {
840  vec_free(lb->lb_buckets);
841  }
842 
845 
846  pool_put(load_balance_pool, lb);
847 }
848 
849 static void
851 {
852  load_balance_t *lb;
853 
854  lb = load_balance_get(dpo->dpoi_index);
855 
856  lb->lb_locks--;
857 
858  if (0 == lb->lb_locks)
859  {
861  }
862 }
863 
864 static void
866 {
867  fib_show_memory_usage("load-balance",
868  pool_elts(load_balance_pool),
869  pool_len(load_balance_pool),
870  sizeof(load_balance_t));
872 }
873 
874 const static dpo_vft_t lb_vft = {
876  .dv_unlock = load_balance_unlock,
877  .dv_format = format_load_balance_dpo,
878  .dv_mem_show = load_balance_mem_show,
879 };
880 
881 /**
882  * @brief The per-protocol VLIB graph nodes that are assigned to a load-balance
883  * object.
884  *
885  * this means that these graph nodes are ones from which a load-balance is the
886  * parent object in the DPO-graph.
887  *
888  * We do not list all the load-balance nodes, such as the *-lookup. instead
889  * we are relying on the correct use of the .sibling_of field when setting
890  * up these sibling nodes.
891  */
892 const static char* const load_balance_ip4_nodes[] =
893 {
894  "ip4-load-balance",
895  NULL,
896 };
897 const static char* const load_balance_ip6_nodes[] =
898 {
899  "ip6-load-balance",
900  NULL,
901 };
902 const static char* const load_balance_mpls_nodes[] =
903 {
904  "mpls-load-balance",
905  NULL,
906 };
907 const static char* const load_balance_l2_nodes[] =
908 {
909  "l2-load-balance",
910  NULL,
911 };
912 const static char* const load_balance_nsh_nodes[] =
913 {
914  "nsh-load-balance",
915  NULL
916 };
917 const static char* const load_balance_bier_nodes[] =
918 {
919  "bier-load-balance",
920  NULL,
921 };
922 const static char* const * const load_balance_nodes[DPO_PROTO_NUM] =
923 {
930 };
931 
932 void
934 {
935  index_t lbi;
936 
938 
939  /*
940  * Special LB with index zero. we need to define this since the v4 mtrie
941  * assumes an index of 0 implies the ply is empty. therefore all 'real'
942  * adjs need a non-zero index.
943  * This should never be used, but just in case, stack it on a drop.
944  */
945  lbi = load_balance_create(1, DPO_PROTO_IP4, 0);
947 
949  vlib_log_register_class("dpo", "load-balance");
950 
952 }
953 
954 static clib_error_t *
956  unformat_input_t * input,
957  vlib_cli_command_t * cmd)
958 {
959  index_t lbi = INDEX_INVALID;
960 
962  {
963  if (unformat (input, "%d", &lbi))
964  ;
965  else
966  break;
967  }
968 
969  if (INDEX_INVALID != lbi)
970  {
971  if (pool_is_free_index(load_balance_pool, lbi))
972  {
973  vlib_cli_output (vm, "no such load-balance:%d", lbi);
974  }
975  else
976  {
977  vlib_cli_output (vm, "%U", format_load_balance, lbi,
979  }
980  }
981  else
982  {
983  load_balance_t *lb;
984 
985  pool_foreach(lb, load_balance_pool,
986  ({
990  }));
991  }
992 
993  return 0;
994 }
995 
996 VLIB_CLI_COMMAND (load_balance_show_command, static) = {
997  .path = "show load-balance",
998  .short_help = "show load-balance [<index>]",
999  .function = load_balance_show,
1000 };
1001 
1002 
1004 ip_flow_hash (void *data)
1005 {
1006  ip4_header_t *iph = (ip4_header_t *) data;
1007 
1008  if ((iph->ip_version_and_header_length & 0xF0) == 0x40)
1010  else
1012 }
1013 
1016 {
1017  return (*((u64 *) m) & 0xffffffffffff);
1018 }
1019 
1022 {
1023  ethernet_header_t *eh;
1024  u64 a, b, c;
1025  uword is_ip, eh_size;
1026  u16 eh_type;
1027 
1028  eh = vlib_buffer_get_current (b0);
1029  eh_type = clib_net_to_host_u16 (eh->type);
1030  eh_size = ethernet_buffer_header_size (b0);
1031 
1032  is_ip = (eh_type == ETHERNET_TYPE_IP4 || eh_type == ETHERNET_TYPE_IP6);
1033 
1034  /* since we have 2 cache lines, use them */
1035  if (is_ip)
1036  a = ip_flow_hash ((u8 *) vlib_buffer_get_current (b0) + eh_size);
1037  else
1038  a = eh->type;
1039 
1040  b = mac_to_u64 ((u8 *) eh->dst_address);
1041  c = mac_to_u64 ((u8 *) eh->src_address);
1042  hash_mix64 (a, b, c);
1043 
1044  return (u32) c;
1045 }
1046 
1048 {
1051 
1054  vlib_node_runtime_t * node,
1055  vlib_frame_t * frame,
1056  int is_l2)
1057 {
1058  u32 n_left_from, next_index, *from, *to_next;
1059 
1060  from = vlib_frame_vector_args (frame);
1061  n_left_from = frame->n_vectors;
1062 
1063  next_index = node->cached_next_index;
1064 
1065  while (n_left_from > 0)
1066  {
1067  u32 n_left_to_next;
1068 
1069  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
1070 
1071  while (n_left_from > 0 && n_left_to_next > 0)
1072  {
1073  vlib_buffer_t *b0;
1074  u32 bi0, lbi0, next0;
1075  const dpo_id_t *dpo0;
1076  const load_balance_t *lb0;
1077 
1078  bi0 = from[0];
1079  to_next[0] = bi0;
1080  from += 1;
1081  to_next += 1;
1082  n_left_from -= 1;
1083  n_left_to_next -= 1;
1084 
1085  b0 = vlib_get_buffer (vm, bi0);
1086 
1087  /* lookup dst + src mac */
1088  lbi0 = vnet_buffer (b0)->ip.adj_index[VLIB_TX];
1089  lb0 = load_balance_get(lbi0);
1090 
1091  if (is_l2)
1092  {
1093  vnet_buffer(b0)->ip.flow_hash = l2_flow_hash(b0);
1094  }
1095  else
1096  {
1097  /* it's BIER */
1098  const bier_hdr_t *bh0 = vlib_buffer_get_current(b0);
1099  vnet_buffer(b0)->ip.flow_hash = bier_compute_flow_hash(bh0);
1100  }
1101 
1102  dpo0 = load_balance_get_bucket_i(lb0,
1103  vnet_buffer(b0)->ip.flow_hash &
1104  (lb0->lb_n_buckets_minus_1));
1105 
1106  next0 = dpo0->dpoi_next_node;
1107  vnet_buffer (b0)->ip.adj_index[VLIB_TX] = dpo0->dpoi_index;
1108 
1109  if (PREDICT_FALSE (b0->flags & VLIB_BUFFER_IS_TRACED))
1110  {
1111  load_balance_trace_t *tr = vlib_add_trace (vm, node, b0,
1112  sizeof (*tr));
1113  tr->lb_index = lbi0;
1114  }
1115  vlib_validate_buffer_enqueue_x1 (vm, node, next_index, to_next,
1116  n_left_to_next, bi0, next0);
1117  }
1118 
1119  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
1120  }
1121 
1122  return frame->n_vectors;
1123 }
1124 
1125 static uword
1127  vlib_node_runtime_t * node,
1128  vlib_frame_t * frame)
1129 {
1130  return (load_balance_inline(vm, node, frame, 1));
1131 }
1132 
1133 static u8 *
1134 format_l2_load_balance_trace (u8 * s, va_list * args)
1135 {
1136  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
1137  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
1138  load_balance_trace_t *t = va_arg (*args, load_balance_trace_t *);
1139 
1140  s = format (s, "L2-load-balance: index %d", t->lb_index);
1141  return s;
1142 }
1143 
1144 /**
1145  * @brief
1146  */
1148  .function = l2_load_balance,
1149  .name = "l2-load-balance",
1150  .vector_size = sizeof (u32),
1151 
1152  .format_trace = format_l2_load_balance_trace,
1153  .n_next_nodes = 1,
1154  .next_nodes = {
1155  [0] = "error-drop",
1156  },
1157 };
1158 
1159 static uword
1161  vlib_node_runtime_t * node,
1162  vlib_frame_t * frame)
1163 {
1164  u32 n_left_from, next_index, *from, *to_next;
1165 
1166  from = vlib_frame_vector_args (frame);
1167  n_left_from = frame->n_vectors;
1168 
1169  next_index = node->cached_next_index;
1170 
1171  while (n_left_from > 0)
1172  {
1173  u32 n_left_to_next;
1174 
1175  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
1176 
1177  while (n_left_from > 0 && n_left_to_next > 0)
1178  {
1179  vlib_buffer_t *b0;
1180  u32 bi0, lbi0, next0, *nsh0;
1181  const dpo_id_t *dpo0;
1182  const load_balance_t *lb0;
1183 
1184  bi0 = from[0];
1185  to_next[0] = bi0;
1186  from += 1;
1187  to_next += 1;
1188  n_left_from -= 1;
1189  n_left_to_next -= 1;
1190 
1191  b0 = vlib_get_buffer (vm, bi0);
1192 
1193  lbi0 = vnet_buffer (b0)->ip.adj_index[VLIB_TX];
1194  lb0 = load_balance_get(lbi0);
1195 
1196  /* SPI + SI are the second word of the NSH header */
1197  nsh0 = vlib_buffer_get_current (b0);
1198  vnet_buffer(b0)->ip.flow_hash = nsh0[1] % lb0->lb_n_buckets;
1199 
1200  dpo0 = load_balance_get_bucket_i(lb0,
1201  vnet_buffer(b0)->ip.flow_hash &
1202  (lb0->lb_n_buckets_minus_1));
1203 
1204  next0 = dpo0->dpoi_next_node;
1205  vnet_buffer (b0)->ip.adj_index[VLIB_TX] = dpo0->dpoi_index;
1206 
1207  if (PREDICT_FALSE (b0->flags & VLIB_BUFFER_IS_TRACED))
1208  {
1209  load_balance_trace_t *tr = vlib_add_trace (vm, node, b0,
1210  sizeof (*tr));
1211  tr->lb_index = lbi0;
1212  }
1213  vlib_validate_buffer_enqueue_x1 (vm, node, next_index, to_next,
1214  n_left_to_next, bi0, next0);
1215  }
1216 
1217  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
1218  }
1219 
1220  return frame->n_vectors;
1221 }
1222 
1223 static u8 *
1224 format_nsh_load_balance_trace (u8 * s, va_list * args)
1225 {
1226  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
1227  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
1228  load_balance_trace_t *t = va_arg (*args, load_balance_trace_t *);
1229 
1230  s = format (s, "NSH-load-balance: index %d", t->lb_index);
1231  return s;
1232 }
1233 
1234 /**
1235  * @brief
1236  */
1238  .function = nsh_load_balance,
1239  .name = "nsh-load-balance",
1240  .vector_size = sizeof (u32),
1241 
1242  .format_trace = format_nsh_load_balance_trace,
1243  .n_next_nodes = 1,
1244  .next_nodes = {
1245  [0] = "error-drop",
1246  },
1247 };
1248 
1249 static u8 *
1250 format_bier_load_balance_trace (u8 * s, va_list * args)
1251 {
1252  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
1253  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
1254  load_balance_trace_t *t = va_arg (*args, load_balance_trace_t *);
1255 
1256  s = format (s, "BIER-load-balance: index %d", t->lb_index);
1257  return s;
1258 }
1259 
1260 static uword
1262  vlib_node_runtime_t * node,
1263  vlib_frame_t * frame)
1264 {
1265  return (load_balance_inline(vm, node, frame, 0));
1266 }
1267 
1268 /**
1269  * @brief
1270  */
1272  .function = bier_load_balance,
1273  .name = "bier-load-balance",
1274  .vector_size = sizeof (u32),
1275 
1276  .format_trace = format_bier_load_balance_trace,
1277  .sibling_of = "mpls-load-balance",
1278 };
vlib_log_class_t vlib_log_register_class(char *class, char *subclass)
Definition: log.c:227
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:439
u16 lb_n_buckets
number of buckets in the load-balance.
Definition: load_balance.h:116
vlib_log_class_t load_balance_logger
the logger
Definition: load_balance.c:36
static const char *const load_balance_ip6_nodes[]
Definition: load_balance.c:897
dpo_id_t * lb_buckets
Vector of buckets containing the next DPOs, sized as lbo_num.
Definition: load_balance.h:166
dpo_lock_fn_t dv_lock
A reference counting lock function.
Definition: dpo.h:404
static u8 * format_l2_load_balance_trace(u8 *s, va_list *args)
void load_balance_map_unlock(index_t lbmi)
vlib_combined_counter_main_t lbm_to_counters
Definition: load_balance.h:46
index_t load_balance_map_add_or_lock(u32 n_buckets, u32 sum_of_weights, const load_balance_path_t *paths)
fib_entry_flag_t lb_fib_entry_flags
Flags from the load-balance&#39;s associated fib_entry_t.
Definition: load_balance.h:138
u32 vlib_log_class_t
Definition: log.h:21
u32 flags
Definition: vhost_user.h:115
static index_t load_balance_get_index(const load_balance_t *lb)
Definition: load_balance.c:73
static const char *const *const load_balance_nodes[DPO_PROTO_NUM]
Definition: load_balance.c:922
#define CLIB_UNUSED(x)
Definition: clib.h:82
A virtual function table regisitered for a DPO type.
Definition: dpo.h:399
static const char *const load_balance_mpls_nodes[]
Definition: load_balance.c:902
void vlib_validate_combined_counter(vlib_combined_counter_main_t *cm, u32 index)
validate a combined counter
Definition: counter.c:106
u16 load_balance_n_buckets(index_t lbi)
Definition: load_balance.c:267
a
Definition: bitmap.h:538
u8 * format_dpo_type(u8 *s, va_list *args)
format a DPO type
Definition: dpo.c:137
dpo_id_t path_dpo
ID of the Data-path object.
Definition: load_balance.h:66
static void load_balance_set_n_buckets(load_balance_t *lb, u32 n_buckets)
Definition: load_balance.c:572
#define LOAD_BALANCE_ATTR_NAMES
Definition: load_balance.h:87
static u32 ip_flow_hash(void *data)
unsigned long u64
Definition: types.h:89
enum load_balance_format_flags_t_ load_balance_format_flags_t
Flags controlling load-balance formatting/display.
Definitions for all things IP (v4|v6) unicast and multicast lookup related.
#define clib_memcpy_fast(a, b, c)
Definition: string.h:81
#define NULL
Definition: clib.h:58
static u32 ip4_compute_flow_hash(const ip4_header_t *ip, flow_hash_config_t flow_hash_config)
Definition: ip4.h:296
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
void load_balance_set_urpf(index_t lbi, index_t urpf)
Definition: load_balance.c:288
#define ethernet_buffer_header_size(b)
Determine the size of the Ethernet headers of the current frame in the buffer.
Definition: ethernet.h:453
flow_hash_config_t lb_hash_config
the hash config to use when selecting a bucket.
Definition: load_balance.h:161
u8 src_address[6]
Definition: packet.h:56
void dpo_copy(dpo_id_t *dst, const dpo_id_t *src)
atomic copy a data-plane object.
Definition: dpo.c:261
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
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:525
static const char * load_balance_attr_names[]
Definition: load_balance.c:31
Combined counter to hold both packets and byte differences.
Definition: counter_types.h:26
static const char *const load_balance_ip4_nodes[]
The per-protocol VLIB graph nodes that are assigned to a load-balance object.
Definition: load_balance.c:892
#define vec_add2(V, P, N)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:564
static u8 * format_load_balance_dpo(u8 *s, va_list *args)
Definition: load_balance.c:183
int i
load_balance_flags_t lb_flags
Flags concenring the LB&#39;s creation and modification.
Definition: load_balance.h:133
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
#define FOR_EACH_LOAD_BALANCE_ATTR(_attr)
Definition: load_balance.h:92
#define vec_validate_aligned(V, I, A)
Make sure vector is long enough for given index (no header, specified alignment)
Definition: vec.h:450
static u8 * load_balance_format(index_t lbi, load_balance_format_flags_t flags, u32 indent, u8 *s)
Definition: load_balance.c:114
static load_balance_t * load_balance_alloc_i(void)
Definition: load_balance.c:92
index_t load_balance_get_urpf(index_t lbi)
Definition: load_balance.c:307
unsigned char u8
Definition: types.h:56
static const char *const load_balance_l2_nodes[]
Definition: load_balance.c:907
#define pool_len(p)
Number of elements in pool vector.
Definition: pool.h:140
double f64
Definition: types.h:142
index_t load_balance_create(u32 n_buckets, dpo_proto_t lb_proto, flow_hash_config_t fhc)
Definition: load_balance.c:217
const dpo_id_t * drop_dpo_get(dpo_proto_t proto)
Definition: drop_dpo.c:25
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:321
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:490
i64 word
Definition: types.h:111
load_balance_t * load_balance_pool
Pool of all DPOs.
Definition: load_balance.c:50
void load_balance_map_module_init(void)
Make/add a new or lock an existing Load-balance map.
static dpo_id_t * load_balance_get_buckets(load_balance_t *lb)
Definition: load_balance.c:79
#define always_inline
Definition: clib.h:98
void load_balance_module_init(void)
Definition: load_balance.c:933
u16 lb_n_buckets_minus_1
number of buckets in the load-balance - 1.
Definition: load_balance.h:121
u8 dst_address[6]
Definition: packet.h:55
u8 * format_white_space(u8 *s, va_list *va)
Definition: std-formats.c:113
static int next_hop_sort_by_weight(const load_balance_path_t *n1, const load_balance_path_t *n2)
Definition: load_balance.c:328
static void load_balance_mem_show(void)
Definition: load_balance.c:865
void fib_urpf_list_lock(index_t ui)
Definition: fib_urpf_list.c:87
static load_balance_t * load_balance_create_i(u32 num_buckets, dpo_proto_t lb_proto, flow_hash_config_t fhc)
Definition: load_balance.c:192
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 load_balance_multipath_update(const dpo_id_t *dpo, const load_balance_path_t *raw_nhs, load_balance_flags_t flags)
Definition: load_balance.c:580
unsigned int u32
Definition: types.h:88
f64 load_balance_get_multipath_tolerance(void)
Definition: load_balance.c:67
enum dpo_proto_t_ dpo_proto_t
Data path protocol.
static void load_balance_lock(dpo_id_t *dpo)
Definition: load_balance.c:815
static void load_balance_fill_buckets(load_balance_t *lb, load_balance_path_t *nhs, dpo_id_t *buckets, u32 n_buckets, load_balance_flags_t flags)
Definition: load_balance.c:555
int load_balance_is_drop(const dpo_id_t *dpo)
Definition: load_balance.c:250
static void load_balance_unlock(dpo_id_t *dpo)
Definition: load_balance.c:850
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
static load_balance_path_t * load_balance_multipath_next_hop_fixup(const load_balance_path_t *nhs, dpo_proto_t drop_proto)
Definition: load_balance.c:458
static void vlib_zero_combined_counter(vlib_combined_counter_main_t *cm, u32 index)
Clear a combined counter Clears the set of per-thread counters.
Definition: counter.h:285
static uword bier_load_balance(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
counter_t packets
packet counter
Definition: counter_types.h:28
u8 * format_load_balance(u8 *s, va_list *args)
Definition: load_balance.c:174
dpo_type_t dpoi_type
the type
Definition: dpo.h:172
static const dpo_id_t * load_balance_get_bucket_i(const load_balance_t *lb, u32 bucket)
Definition: load_balance.h:228
dpo_proto_t lb_proto
The protocol of packets that traverse this LB.
Definition: load_balance.h:128
static_always_inline u32 bier_compute_flow_hash(const bier_hdr_t *hdr)
Definition: bier_fwd.h:23
struct _unformat_input_t unformat_input_t
unsigned short u16
Definition: types.h:57
void load_balance_set_fib_entry_flags(index_t lbi, fib_entry_flag_t flags)
Definition: load_balance.c:277
load-balancing over a choice of [un]equal cost paths
Definition: dpo.h:102
static u8 * format_bier_load_balance_trace(u8 *s, va_list *args)
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:214
static u32 ip6_compute_flow_hash(const ip6_header_t *ip, flow_hash_config_t flow_hash_config)
Definition: ip6.h:452
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:286
#define vec_dup(V)
Return copy of vector (no header, no alignment)
Definition: vec.h:375
The FIB DPO provieds;.
Definition: load_balance.h:106
u8 n_nhs
Definition: gbp.api:274
#define PREDICT_FALSE(x)
Definition: clib.h:111
u8 * format_load_balance_map(u8 *s, va_list *ap)
#define LB_DBG(_lb, _fmt, _args...)
Definition: load_balance.c:38
vl_api_gbp_next_hop_t nhs[8]
Definition: gbp.api:275
static const char *const load_balance_bier_nodes[]
Definition: load_balance.c:917
#define vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next, n_left_to_next, bi0, next0)
Finish enqueueing one buffer forward in the graph.
Definition: buffer_node.h:218
#define vlib_get_next_frame(vm, node, next_index, vectors, n_vectors_left)
Get pointer to next frame vector data by (vlib_node_runtime_t, next_index).
Definition: node_funcs.h:338
const dpo_id_t * load_balance_get_bucket(index_t lbi, u32 bucket)
Definition: load_balance.c:317
The load-balance object represents an ECMP choice.
Definition: load_balance.h:44
vlib_node_registration_t l2_load_balance_node
(constructor) VLIB_REGISTER_NODE (l2_load_balance_node)
dpo_id_t lb_buckets_inline[LB_NUM_INLINE_BUCKETS]
The rest of the cache line is used for buckets.
Definition: load_balance.h:174
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P with alignment A.
Definition: pool.h:230
static void load_balance_fill_buckets_norm(load_balance_t *lb, load_balance_path_t *nhs, dpo_id_t *buckets, u32 n_buckets)
Definition: load_balance.c:484
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
#define UNFORMAT_END_OF_INPUT
Definition: format.h:144
#define hash_mix64(a0, b0, c0)
Definition: hash.h:531
svmdb_client_t * c
u16 n_vectors
Definition: node.h:420
static void vlib_get_combined_counter(const vlib_combined_counter_main_t *cm, u32 index, vlib_counter_t *result)
Get the value of a combined counter, never called in the speed path Scrapes the entire set of per-thr...
Definition: counter.h:259
vlib_main_t * vm
Definition: buffer.c:301
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:341
static const char *const load_balance_nsh_nodes[]
Definition: load_balance.c:912
void load_balance_map_show_mem(void)
enum load_balance_attr_t_ load_balance_attr_t
Flags controlling load-balance creation and modification.
static f64 fabs(f64 x)
Definition: math.h:50
static uword max_pow2(uword x)
Definition: clib.h:226
static u8 * format_nsh_load_balance_trace(u8 *s, va_list *args)
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:283
void vlib_put_next_frame(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index, u32 n_vectors_left)
Release pointer to next frame vector data.
Definition: main.c:452
#define LB_NUM_INLINE_BUCKETS
The number of buckets that a load-balance object can have and still fit in one cache-line.
Definition: load_balance.h:56
vlib_combined_counter_main_t lbm_via_counters
Definition: load_balance.h:47
enum fib_entry_flag_t_ fib_entry_flag_t
static uword nsh_load_balance(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:155
vlib_node_registration_t bier_load_balance_node
(constructor) VLIB_REGISTER_NODE (bier_load_balance_node)
vlib_node_registration_t nsh_load_balance_node
(constructor) VLIB_REGISTER_NODE (nsh_load_balance_node)
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:537
#define ASSERT(truth)
index_t lb_urpf
This is the index of the uRPF list for this LB.
Definition: load_balance.h:156
static load_balance_t * load_balance_get(index_t lbi)
Definition: load_balance.h:219
static clib_error_t * load_balance_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: load_balance.c:955
u32 lb_locks
The number of locks, which is approximately the number of users, of this load-balance.
Definition: load_balance.h:146
static u64 mac_to_u64(u8 *m)
#define IP_FLOW_HASH_DEFAULT
Default: 5-tuple without the "reverse" bit.
Definition: lookup.h:70
#define LB_HAS_INLINE_BUCKETS(_lb)
Definition: load_balance.h:224
void load_balance_set_bucket(index_t lbi, u32 bucket, const dpo_id_t *next)
Definition: load_balance.c:234
u8 * format_dpo_id(u8 *s, va_list *args)
Format a DPO_id_t oject
Definition: dpo.c:147
u32 flow_hash_config_t
A flow hash configuration is a mask of the flow hash options.
Definition: lookup.h:84
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
Definition: trace_funcs.h:57
enum load_balance_flags_t_ load_balance_flags_t
counter_t bytes
byte counter
Definition: counter_types.h:29
static uword l2_load_balance(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: defs.h:47
#define DPO_PROTO_NUM
Definition: dpo.h:70
A BIER header of variable length The encoding follows: https://tools.ietf.org/html/draft-ietf-bier-mp...
Definition: bier_types.h:321
static word flt_round_nearest(f64 x)
Definition: clib.h:277
void qsort(void *base, uword n, uword size, int(*compar)(const void *, const void *))
Definition: qsort.c:56
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:184
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
u32 path_weight
weight for the path.
Definition: load_balance.h:76
#define INDEX_INVALID
Invalid index - used when no index is known blazoned capitals INVALID speak volumes where ~0 does not...
Definition: dpo.h:47
static void load_balance_destroy(load_balance_t *lb)
Definition: load_balance.c:825
u64 uword
Definition: types.h:112
static uword load_balance_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame, int is_l2)
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:244
char * name
The counter collection&#39;s name.
Definition: counter.h:193
void fib_urpf_list_unlock(index_t ui)
Definition: fib_urpf_list.c:68
One path from an [EU]CMP set that the client wants to add to a load-balance object.
Definition: load_balance.h:62
u8 * format_dpo_proto(u8 *s, va_list *args)
format a DPO protocol
Definition: dpo.c:177
static void load_balance_fill_buckets_sticky(load_balance_t *lb, load_balance_path_t *nhs, dpo_id_t *buckets, u32 n_buckets)
Definition: load_balance.c:508
static u32 l2_flow_hash(vlib_buffer_t *b0)
#define vnet_buffer(b)
Definition: buffer.h:368
index_t lb_map
index of the load-balance map, INVALID if this LB does not use one
Definition: load_balance.h:151
const f64 multipath_next_hop_error_tolerance
Definition: load_balance.c:29
int dpo_is_drop(const dpo_id_t *dpo)
The Drop DPO will drop all packets, no questions asked.
Definition: drop_dpo.c:33
u32 ip_multipath_normalize_next_hops(const load_balance_path_t *raw_next_hops, load_balance_path_t **normalized_next_hops, u32 *sum_weight_in, f64 multipath_next_hop_error_tolerance)
Definition: load_balance.c:338
void dpo_reset(dpo_id_t *dpo)
reset a DPO ID The DPO will be unlocked.
Definition: dpo.c:231
#define vec_foreach(var, vec)
Vector iterator.
#define CLIB_MEMORY_BARRIER()
Definition: clib.h:115
u16 dpoi_next_node
The next VLIB node to follow.
Definition: dpo.h:180
u8 ip_version_and_header_length
Definition: ip4_packet.h:138
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:59
u32 flags
buffer flags: VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index, VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:117
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:762
struct load_balance_trace_t_ load_balance_trace_t
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:62
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
void dpo_stack(dpo_type_t child_type, dpo_proto_t child_proto, dpo_id_t *dpo, const dpo_id_t *parent)
Stack one DPO object on another, and thus establish a child-parent relationship.
Definition: dpo.c:515
static void load_balance_set_bucket_i(load_balance_t *lb, u32 bucket, dpo_id_t *buckets, const dpo_id_t *next)
Definition: load_balance.c:225
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128