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:
7 * http://www.apache.org/licenses/LICENSE-2.0
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.
16 #include <vnet/ip/lookup.h>
17 #include <vnet/dpo/load_balance.h>
18 #include <vnet/dpo/load_balance_map.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 #include <vnet/fib/mpls_fib.h>
28 * distribution error tolerance for load-balancing
30 const f64 multipath_next_hop_error_tolerance = 0.1;
32 static const char *load_balance_attr_names[] = LOAD_BALANCE_ATTR_NAMES;
37 vlib_log_class_t load_balance_logger;
39 #define LB_DBG(_lb, _fmt, _args...) \
41 vlib_log_debug(load_balance_logger, \
43 format_load_balance, load_balance_get_index(_lb), \
44 LOAD_BALANCE_FORMAT_NONE, \
49 * Pool of all DPOs. It's not static so the DP can have fast access
51 load_balance_t *load_balance_pool;
54 * The one instance of load-balance main
56 load_balance_main_t load_balance_main = {
59 .stat_segment_name = "/net/route/to",
63 .stat_segment_name = "/net/route/via",
68 load_balance_get_multipath_tolerance (void)
70 return (multipath_next_hop_error_tolerance);
74 load_balance_get_index (const load_balance_t *lb)
76 return (lb - load_balance_pool);
79 static inline dpo_id_t*
80 load_balance_get_buckets (load_balance_t *lb)
82 if (LB_HAS_INLINE_BUCKETS(lb))
84 return (lb->lb_buckets_inline);
88 return (lb->lb_buckets);
92 static load_balance_t *
93 load_balance_alloc_i (void)
97 pool_get_aligned(load_balance_pool, lb, CLIB_CACHE_LINE_BYTES);
98 clib_memset(lb, 0, sizeof(*lb));
100 lb->lb_map = INDEX_INVALID;
101 lb->lb_urpf = INDEX_INVALID;
102 vlib_validate_combined_counter(&(load_balance_main.lbm_to_counters),
103 load_balance_get_index(lb));
104 vlib_validate_combined_counter(&(load_balance_main.lbm_via_counters),
105 load_balance_get_index(lb));
106 vlib_zero_combined_counter(&(load_balance_main.lbm_to_counters),
107 load_balance_get_index(lb));
108 vlib_zero_combined_counter(&(load_balance_main.lbm_via_counters),
109 load_balance_get_index(lb));
115 load_balance_format (index_t lbi,
116 load_balance_format_flags_t flags,
120 vlib_counter_t to, via;
125 lb = load_balance_get(lbi);
126 vlib_get_combined_counter(&(load_balance_main.lbm_to_counters), lbi, &to);
127 vlib_get_combined_counter(&(load_balance_main.lbm_via_counters), lbi, &via);
128 buckets = load_balance_get_buckets(lb);
130 s = format(s, "%U: ", format_dpo_type, DPO_LOAD_BALANCE);
131 s = format(s, "[proto:%U ", format_dpo_proto, lb->lb_proto);
132 s = format(s, "index:%d buckets:%d ", lbi, lb->lb_n_buckets);
133 s = format(s, "uRPF:%d ", lb->lb_urpf);
136 load_balance_attr_t attr;
138 s = format(s, "flags:[");
140 FOR_EACH_LOAD_BALANCE_ATTR(attr)
142 if (lb->lb_flags & (1 << attr))
144 s = format (s, "%s", load_balance_attr_names[attr]);
149 s = format(s, "to:[%Ld:%Ld]", to.packets, to.bytes);
150 if (0 != via.packets)
152 s = format(s, " via:[%Ld:%Ld]",
153 via.packets, via.bytes);
157 if (INDEX_INVALID != lb->lb_map)
159 s = format(s, "\n%U%U",
160 format_white_space, indent+4,
161 format_load_balance_map, lb->lb_map, indent+4);
163 for (i = 0; i < lb->lb_n_buckets; i++)
165 s = format(s, "\n%U[%d] %U",
166 format_white_space, indent+2,
169 &buckets[i], indent+6);
175 format_load_balance (u8 * s, va_list * args)
177 index_t lbi = va_arg(*args, index_t);
178 load_balance_format_flags_t flags = va_arg(*args, load_balance_format_flags_t);
180 return (load_balance_format(lbi, flags, 0, s));
184 format_load_balance_dpo (u8 * s, va_list * args)
186 index_t lbi = va_arg(*args, index_t);
187 u32 indent = va_arg(*args, u32);
189 return (load_balance_format(lbi, LOAD_BALANCE_FORMAT_DETAIL, indent, s));
193 load_balance_get_default_flow_hash (dpo_proto_t lb_proto)
199 return (IP_FLOW_HASH_DEFAULT);
202 return (MPLS_FLOW_HASH_DEFAULT);
204 case DPO_PROTO_ETHERNET:
213 static load_balance_t *
214 load_balance_create_i (u32 num_buckets,
215 dpo_proto_t lb_proto,
216 flow_hash_config_t fhc)
220 lb = load_balance_alloc_i();
221 lb->lb_hash_config = fhc;
222 lb->lb_n_buckets = num_buckets;
223 lb->lb_n_buckets_minus_1 = num_buckets-1;
224 lb->lb_proto = lb_proto;
226 if (!LB_HAS_INLINE_BUCKETS(lb))
228 vec_validate_aligned(lb->lb_buckets,
229 lb->lb_n_buckets - 1,
230 CLIB_CACHE_LINE_BYTES);
233 LB_DBG(lb, "create");
239 load_balance_create (u32 n_buckets,
240 dpo_proto_t lb_proto,
241 flow_hash_config_t fhc)
243 return (load_balance_get_index(load_balance_create_i(n_buckets, lb_proto, fhc)));
247 load_balance_set_bucket_i (load_balance_t *lb,
250 const dpo_id_t *next)
252 dpo_stack(DPO_LOAD_BALANCE, lb->lb_proto, &buckets[bucket], next);
256 load_balance_set_bucket (index_t lbi,
258 const dpo_id_t *next)
263 lb = load_balance_get(lbi);
264 buckets = load_balance_get_buckets(lb);
266 ASSERT(bucket < lb->lb_n_buckets);
268 load_balance_set_bucket_i(lb, bucket, buckets, next);
272 load_balance_is_drop (const dpo_id_t *dpo)
276 if (DPO_LOAD_BALANCE != dpo->dpoi_type)
279 lb = load_balance_get(dpo->dpoi_index);
281 if (1 == lb->lb_n_buckets)
283 return (dpo_is_drop(load_balance_get_bucket_i(lb, 0)));
289 load_balance_n_buckets (index_t lbi)
293 lb = load_balance_get(lbi);
295 return (lb->lb_n_buckets);
299 load_balance_set_fib_entry_flags (index_t lbi,
300 fib_entry_flag_t flags)
304 lb = load_balance_get(lbi);
305 lb->lb_fib_entry_flags = flags;
310 load_balance_set_urpf (index_t lbi,
316 lb = load_balance_get(lbi);
319 * packets in flight we see this change. but it's atomic, so :P
324 fib_urpf_list_unlock(old);
325 fib_urpf_list_lock(urpf);
329 load_balance_get_urpf (index_t lbi)
333 lb = load_balance_get(lbi);
335 return (lb->lb_urpf);
339 load_balance_get_bucket (index_t lbi,
344 lb = load_balance_get(lbi);
346 return (load_balance_get_bucket_i(lb, bucket));
350 next_hop_sort_by_weight (const load_balance_path_t * n1,
351 const load_balance_path_t * n2)
353 return ((int) n1->path_weight - (int) n2->path_weight);
356 /* Given next hop vector is over-written with normalized one with sorted weights and
357 with weights corresponding to the number of adjacencies for each next hop.
358 Returns number of adjacencies in block. */
360 ip_multipath_normalize_next_hops (const load_balance_path_t * raw_next_hops,
361 load_balance_path_t ** normalized_next_hops,
363 f64 multipath_next_hop_error_tolerance)
365 load_balance_path_t * nhs;
366 uword n_nhs, n_adj, n_adj_left, i, sum_weight;
369 n_nhs = vec_len (raw_next_hops);
374 /* Allocate enough space for 2 copies; we'll use second copy to save original weights. */
375 nhs = *normalized_next_hops;
376 vec_validate (nhs, 2*n_nhs - 1);
378 /* Fast path: 1 next hop in block. */
382 nhs[0] = raw_next_hops[0];
383 nhs[0].path_weight = 1;
391 int cmp = next_hop_sort_by_weight (&raw_next_hops[0], &raw_next_hops[1]) < 0;
394 nhs[0] = raw_next_hops[cmp];
395 nhs[1] = raw_next_hops[cmp ^ 1];
397 /* Fast path: equal cost multipath with 2 next hops. */
398 if (nhs[0].path_weight == nhs[1].path_weight)
400 nhs[0].path_weight = nhs[1].path_weight = 1;
408 clib_memcpy_fast (nhs, raw_next_hops, n_nhs * sizeof (raw_next_hops[0]));
409 qsort (nhs, n_nhs, sizeof (nhs[0]), (void *) next_hop_sort_by_weight);
412 /* Find total weight to normalize weights. */
414 for (i = 0; i < n_nhs; i++)
415 sum_weight += nhs[i].path_weight;
417 /* In the unlikely case that all weights are given as 0, set them all to 1. */
420 for (i = 0; i < n_nhs; i++)
421 nhs[i].path_weight = 1;
425 /* Save copies of all next hop weights to avoid being overwritten in loop below. */
426 for (i = 0; i < n_nhs; i++)
427 nhs[n_nhs + i].path_weight = nhs[i].path_weight;
429 /* Try larger and larger power of 2 sized adjacency blocks until we
430 find one where traffic flows to within 1% of specified weights. */
431 for (n_adj = max_pow2 (n_nhs); ; n_adj *= 2)
435 norm = n_adj / ((f64) sum_weight);
437 for (i = 0; i < n_nhs; i++)
439 f64 nf = nhs[n_nhs + i].path_weight * norm; /* use saved weights */
440 word n = flt_round_nearest (nf);
442 n = n > n_adj_left ? n_adj_left : n;
444 error += fabs (nf - n);
445 nhs[i].path_weight = n;
447 if (0 == nhs[i].path_weight)
450 * when the weight skew is high (norm is small) and n == nf.
451 * without this correction the path with a low weight would have
452 * no representation in the load-balanace - don't want that.
453 * If the weight skew is high so the load-balance has many buckets
454 * to allow it. pays ya money takes ya choice.
461 nhs[0].path_weight += n_adj_left;
463 /* Less than 5% average error per adjacency with this size adjacency block? */
464 if (error <= multipath_next_hop_error_tolerance*n_adj)
466 /* Truncate any next hops with zero weight. */
473 /* Save vector for next call. */
474 *normalized_next_hops = nhs;
475 *sum_weight_in = sum_weight;
479 static load_balance_path_t *
480 load_balance_multipath_next_hop_fixup (const load_balance_path_t *nhs,
481 dpo_proto_t drop_proto)
483 if (0 == vec_len(nhs))
485 load_balance_path_t *new_nhs = NULL, *nh;
488 * we need something for the load-balance. so use the drop
490 vec_add2(new_nhs, nh, 1);
493 dpo_copy(&nh->path_dpo, drop_dpo_get(drop_proto));
502 * Fill in adjacencies in block based on corresponding
503 * next hop adjacencies.
506 load_balance_fill_buckets_norm (load_balance_t *lb,
507 load_balance_path_t *nhs,
511 load_balance_path_t *nh;
517 * the next-hops have normalised weights. that means their sum is the number
518 * of buckets we need to fill.
520 vec_foreach (nh, nhs)
522 for (ii = 0; ii < nh->path_weight; ii++)
524 ASSERT(bucket < n_buckets);
525 load_balance_set_bucket_i(lb, bucket++, buckets, &nh->path_dpo);
530 load_balance_fill_buckets_sticky (load_balance_t *lb,
531 load_balance_path_t *nhs,
535 load_balance_path_t *nh, *fwding_paths;
536 u16 ii, bucket, fpath;
541 vec_foreach (nh, nhs)
543 if (!dpo_is_drop(&nh->path_dpo))
545 vec_add1(fwding_paths, *nh);
548 if (vec_len(fwding_paths) == 0)
549 fwding_paths = vec_dup(nhs);
552 * the next-hops have normalised weights. that means their sum is the number
553 * of buckets we need to fill.
555 vec_foreach (nh, nhs)
557 for (ii = 0; ii < nh->path_weight; ii++)
559 ASSERT(bucket < n_buckets);
560 if (!dpo_is_drop(&nh->path_dpo))
562 load_balance_set_bucket_i(lb, bucket++, buckets, &nh->path_dpo);
566 /* fill the bucks from the next up path */
567 load_balance_set_bucket_i(lb, bucket++, buckets, &fwding_paths[fpath].path_dpo);
568 fpath = (fpath + 1) % vec_len(fwding_paths);
573 vec_free(fwding_paths);
577 load_balance_fill_buckets (load_balance_t *lb,
578 load_balance_path_t *nhs,
581 load_balance_flags_t flags)
583 if (flags & LOAD_BALANCE_FLAG_STICKY)
585 load_balance_fill_buckets_sticky(lb, nhs, buckets, n_buckets);
589 load_balance_fill_buckets_norm(lb, nhs, buckets, n_buckets);
594 load_balance_set_n_buckets (load_balance_t *lb,
597 lb->lb_n_buckets = n_buckets;
598 lb->lb_n_buckets_minus_1 = n_buckets-1;
602 load_balance_multipath_update (const dpo_id_t *dpo,
603 const load_balance_path_t * raw_nhs,
604 load_balance_flags_t flags)
606 load_balance_path_t *nh, *nhs, *fixed_nhs;
607 u32 sum_of_weights, n_buckets, ii;
608 index_t lbmi, old_lbmi;
614 ASSERT(DPO_LOAD_BALANCE == dpo->dpoi_type);
615 lb = load_balance_get(dpo->dpoi_index);
616 lb->lb_flags = flags;
617 fixed_nhs = load_balance_multipath_next_hop_fixup(raw_nhs, lb->lb_proto);
619 ip_multipath_normalize_next_hops((NULL == fixed_nhs ?
624 multipath_next_hop_error_tolerance);
626 ASSERT (n_buckets >= vec_len (raw_nhs));
629 * Save the old load-balance map used, and get a new one if required.
631 old_lbmi = lb->lb_map;
632 if (flags & LOAD_BALANCE_FLAG_USES_MAP)
634 lbmi = load_balance_map_add_or_lock(n_buckets, sum_of_weights, nhs);
638 lbmi = INDEX_INVALID;
641 if (0 == lb->lb_n_buckets)
644 * first time initialisation. no packets inflight, so we can write
647 load_balance_set_n_buckets(lb, n_buckets);
649 if (!LB_HAS_INLINE_BUCKETS(lb))
650 vec_validate_aligned(lb->lb_buckets,
651 lb->lb_n_buckets - 1,
652 CLIB_CACHE_LINE_BYTES);
654 load_balance_fill_buckets(lb, nhs,
655 load_balance_get_buckets(lb),
662 * This is a modification of an existing load-balance.
663 * We need to ensure that packets inflight see a consistent state, that
664 * is the number of reported buckets the LB has (read from
665 * lb_n_buckets_minus_1) is not more than it actually has. So if the
666 * number of buckets is increasing, we must update the bucket array first,
667 * then the reported number. vice-versa if the number of buckets goes down.
669 if (n_buckets == lb->lb_n_buckets)
672 * no change in the number of buckets. we can simply fill what
673 * is new over what is old.
675 load_balance_fill_buckets(lb, nhs,
676 load_balance_get_buckets(lb),
680 else if (n_buckets > lb->lb_n_buckets)
683 * we have more buckets. the old load-balance map (if there is one)
684 * will remain valid, i.e. mapping to indices within range, so we
687 if (n_buckets > LB_NUM_INLINE_BUCKETS &&
688 lb->lb_n_buckets <= LB_NUM_INLINE_BUCKETS)
691 * the new increased number of buckets is crossing the threshold
692 * from the inline storage to out-line. Alloc the outline buckets
693 * first, then fixup the number. then reset the inlines.
695 ASSERT(NULL == lb->lb_buckets);
696 vec_validate_aligned(lb->lb_buckets,
698 CLIB_CACHE_LINE_BYTES);
700 load_balance_fill_buckets(lb, nhs,
703 CLIB_MEMORY_BARRIER();
704 load_balance_set_n_buckets(lb, n_buckets);
706 CLIB_MEMORY_BARRIER();
708 for (ii = 0; ii < LB_NUM_INLINE_BUCKETS; ii++)
710 dpo_reset(&lb->lb_buckets_inline[ii]);
715 if (n_buckets <= LB_NUM_INLINE_BUCKETS)
718 * we are not crossing the threshold and it's still inline buckets.
719 * we can write the new on the old..
721 load_balance_fill_buckets(lb, nhs,
722 load_balance_get_buckets(lb),
724 CLIB_MEMORY_BARRIER();
725 load_balance_set_n_buckets(lb, n_buckets);
730 * we are not crossing the threshold. We need a new bucket array to
731 * hold the increased number of choices.
733 dpo_id_t *new_buckets, *old_buckets, *tmp_dpo;
736 old_buckets = load_balance_get_buckets(lb);
738 vec_validate_aligned(new_buckets,
740 CLIB_CACHE_LINE_BYTES);
742 load_balance_fill_buckets(lb, nhs, new_buckets,
744 CLIB_MEMORY_BARRIER();
745 lb->lb_buckets = new_buckets;
746 CLIB_MEMORY_BARRIER();
747 load_balance_set_n_buckets(lb, n_buckets);
749 vec_foreach(tmp_dpo, old_buckets)
753 vec_free(old_buckets);
758 * buckets fixed. ready for the MAP update.
765 * bucket size shrinkage.
766 * Any map we have will be based on the old
767 * larger number of buckets, so will be translating to indices
768 * out of range. So the new MAP must be installed first.
771 CLIB_MEMORY_BARRIER();
774 if (n_buckets <= LB_NUM_INLINE_BUCKETS &&
775 lb->lb_n_buckets > LB_NUM_INLINE_BUCKETS)
778 * the new decreased number of buckets is crossing the threshold
779 * from out-line storage to inline:
780 * 1 - Fill the inline buckets,
781 * 2 - fixup the number (and this point the inline buckets are
783 * 3 - free the outline buckets
785 load_balance_fill_buckets(lb, nhs,
786 lb->lb_buckets_inline,
788 CLIB_MEMORY_BARRIER();
789 load_balance_set_n_buckets(lb, n_buckets);
790 CLIB_MEMORY_BARRIER();
792 vec_foreach(tmp_dpo, lb->lb_buckets)
796 vec_free(lb->lb_buckets);
801 * not crossing the threshold.
802 * 1 - update the number to the smaller size
803 * 2 - write the new buckets
804 * 3 - reset those no longer used.
809 old_n_buckets = lb->lb_n_buckets;
810 buckets = load_balance_get_buckets(lb);
812 load_balance_set_n_buckets(lb, n_buckets);
813 CLIB_MEMORY_BARRIER();
815 load_balance_fill_buckets(lb, nhs, buckets,
818 for (ii = n_buckets; ii < old_n_buckets; ii++)
820 dpo_reset(&buckets[ii]);
826 vec_foreach (nh, nhs)
828 dpo_reset(&nh->path_dpo);
833 load_balance_map_unlock(old_lbmi);
837 load_balance_lock (dpo_id_t *dpo)
841 lb = load_balance_get(dpo->dpoi_index);
847 load_balance_destroy (load_balance_t *lb)
852 buckets = load_balance_get_buckets(lb);
854 for (i = 0; i < lb->lb_n_buckets; i++)
856 dpo_reset(&buckets[i]);
859 LB_DBG(lb, "destroy");
860 if (!LB_HAS_INLINE_BUCKETS(lb))
862 vec_free(lb->lb_buckets);
865 fib_urpf_list_unlock(lb->lb_urpf);
866 load_balance_map_unlock(lb->lb_map);
868 pool_put(load_balance_pool, lb);
872 load_balance_unlock (dpo_id_t *dpo)
876 lb = load_balance_get(dpo->dpoi_index);
880 if (0 == lb->lb_locks)
882 load_balance_destroy(lb);
887 load_balance_mem_show (void)
889 fib_show_memory_usage("load-balance",
890 pool_elts(load_balance_pool),
891 pool_len(load_balance_pool),
892 sizeof(load_balance_t));
893 load_balance_map_show_mem();
896 const static dpo_vft_t lb_vft = {
897 .dv_lock = load_balance_lock,
898 .dv_unlock = load_balance_unlock,
899 .dv_format = format_load_balance_dpo,
900 .dv_mem_show = load_balance_mem_show,
904 * @brief The per-protocol VLIB graph nodes that are assigned to a load-balance
907 * this means that these graph nodes are ones from which a load-balance is the
908 * parent object in the DPO-graph.
910 * We do not list all the load-balance nodes, such as the *-lookup. instead
911 * we are relying on the correct use of the .sibling_of field when setting
912 * up these sibling nodes.
914 const static char* const load_balance_ip4_nodes[] =
919 const static char* const load_balance_ip6_nodes[] =
924 const static char* const load_balance_mpls_nodes[] =
929 const static char* const load_balance_l2_nodes[] =
934 const static char* const load_balance_nsh_nodes[] =
939 const static char* const load_balance_bier_nodes[] =
944 const static char* const * const load_balance_nodes[DPO_PROTO_NUM] =
946 [DPO_PROTO_IP4] = load_balance_ip4_nodes,
947 [DPO_PROTO_IP6] = load_balance_ip6_nodes,
948 [DPO_PROTO_MPLS] = load_balance_mpls_nodes,
949 [DPO_PROTO_ETHERNET] = load_balance_l2_nodes,
950 [DPO_PROTO_NSH] = load_balance_nsh_nodes,
951 [DPO_PROTO_BIER] = load_balance_bier_nodes,
955 load_balance_module_init (void)
959 dpo_register(DPO_LOAD_BALANCE, &lb_vft, load_balance_nodes);
962 * Special LB with index zero. we need to define this since the v4 mtrie
963 * assumes an index of 0 implies the ply is empty. therefore all 'real'
964 * adjs need a non-zero index.
965 * This should never be used, but just in case, stack it on a drop.
967 lbi = load_balance_create(1, DPO_PROTO_IP4, 0);
968 load_balance_set_bucket(lbi, 0, drop_dpo_get(DPO_PROTO_IP4));
970 load_balance_logger =
971 vlib_log_register_class("dpo", "load-balance");
973 load_balance_map_module_init();
976 static clib_error_t *
977 load_balance_show (vlib_main_t * vm,
978 unformat_input_t * input,
979 vlib_cli_command_t * cmd)
981 index_t lbi = INDEX_INVALID;
983 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
985 if (unformat (input, "%d", &lbi))
991 if (INDEX_INVALID != lbi)
993 if (pool_is_free_index(load_balance_pool, lbi))
995 vlib_cli_output (vm, "no such load-balance:%d", lbi);
999 vlib_cli_output (vm, "%U", format_load_balance, lbi,
1000 LOAD_BALANCE_FORMAT_DETAIL);
1007 pool_foreach(lb, load_balance_pool,
1009 vlib_cli_output (vm, "%U", format_load_balance,
1010 load_balance_get_index(lb),
1011 LOAD_BALANCE_FORMAT_NONE);
1018 VLIB_CLI_COMMAND (load_balance_show_command, static) = {
1019 .path = "show load-balance",
1020 .short_help = "show load-balance [<index>]",
1021 .function = load_balance_show,
1026 ip_flow_hash (void *data)
1028 ip4_header_t *iph = (ip4_header_t *) data;
1030 if ((iph->ip_version_and_header_length & 0xF0) == 0x40)
1031 return ip4_compute_flow_hash (iph, IP_FLOW_HASH_DEFAULT);
1033 return ip6_compute_flow_hash ((ip6_header_t *) iph, IP_FLOW_HASH_DEFAULT);
1039 return (*((u64 *) m) & 0xffffffffffff);
1043 l2_flow_hash (vlib_buffer_t * b0)
1045 ethernet_header_t *eh;
1047 uword is_ip, eh_size;
1050 eh = vlib_buffer_get_current (b0);
1051 eh_type = clib_net_to_host_u16 (eh->type);
1052 eh_size = ethernet_buffer_header_size (b0);
1054 is_ip = (eh_type == ETHERNET_TYPE_IP4 || eh_type == ETHERNET_TYPE_IP6);
1056 /* since we have 2 cache lines, use them */
1058 a = ip_flow_hash ((u8 *) vlib_buffer_get_current (b0) + eh_size);
1062 b = mac_to_u64 ((u8 *) eh->dst_address);
1063 c = mac_to_u64 ((u8 *) eh->src_address);
1064 hash_mix64 (a, b, c);
1069 typedef struct load_balance_trace_t_
1072 } load_balance_trace_t;
1075 load_balance_inline (vlib_main_t * vm,
1076 vlib_node_runtime_t * node,
1077 vlib_frame_t * frame,
1080 u32 n_left_from, next_index, *from, *to_next;
1082 from = vlib_frame_vector_args (frame);
1083 n_left_from = frame->n_vectors;
1085 next_index = node->cached_next_index;
1087 while (n_left_from > 0)
1091 vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
1093 while (n_left_from > 0 && n_left_to_next > 0)
1096 u32 bi0, lbi0, next0;
1097 const dpo_id_t *dpo0;
1098 const load_balance_t *lb0;
1105 n_left_to_next -= 1;
1107 b0 = vlib_get_buffer (vm, bi0);
1109 /* lookup dst + src mac */
1110 lbi0 = vnet_buffer (b0)->ip.adj_index[VLIB_TX];
1111 lb0 = load_balance_get(lbi0);
1115 vnet_buffer(b0)->ip.flow_hash = l2_flow_hash(b0);
1120 const bier_hdr_t *bh0 = vlib_buffer_get_current(b0);
1121 vnet_buffer(b0)->ip.flow_hash = bier_compute_flow_hash(bh0);
1124 dpo0 = load_balance_get_bucket_i(lb0,
1125 vnet_buffer(b0)->ip.flow_hash &
1126 (lb0->lb_n_buckets_minus_1));
1128 next0 = dpo0->dpoi_next_node;
1129 vnet_buffer (b0)->ip.adj_index[VLIB_TX] = dpo0->dpoi_index;
1131 if (PREDICT_FALSE (b0->flags & VLIB_BUFFER_IS_TRACED))
1133 load_balance_trace_t *tr = vlib_add_trace (vm, node, b0,
1135 tr->lb_index = lbi0;
1137 vlib_validate_buffer_enqueue_x1 (vm, node, next_index, to_next,
1138 n_left_to_next, bi0, next0);
1141 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
1144 return frame->n_vectors;
1148 l2_load_balance (vlib_main_t * vm,
1149 vlib_node_runtime_t * node,
1150 vlib_frame_t * frame)
1152 return (load_balance_inline(vm, node, frame, 1));
1156 format_l2_load_balance_trace (u8 * s, va_list * args)
1158 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
1159 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
1160 load_balance_trace_t *t = va_arg (*args, load_balance_trace_t *);
1162 s = format (s, "L2-load-balance: index %d", t->lb_index);
1169 VLIB_REGISTER_NODE (l2_load_balance_node) = {
1170 .function = l2_load_balance,
1171 .name = "l2-load-balance",
1172 .vector_size = sizeof (u32),
1174 .format_trace = format_l2_load_balance_trace,
1182 nsh_load_balance (vlib_main_t * vm,
1183 vlib_node_runtime_t * node,
1184 vlib_frame_t * frame)
1186 u32 n_left_from, next_index, *from, *to_next;
1188 from = vlib_frame_vector_args (frame);
1189 n_left_from = frame->n_vectors;
1191 next_index = node->cached_next_index;
1193 while (n_left_from > 0)
1197 vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
1199 while (n_left_from > 0 && n_left_to_next > 0)
1202 u32 bi0, lbi0, next0, *nsh0;
1203 const dpo_id_t *dpo0;
1204 const load_balance_t *lb0;
1211 n_left_to_next -= 1;
1213 b0 = vlib_get_buffer (vm, bi0);
1215 lbi0 = vnet_buffer (b0)->ip.adj_index[VLIB_TX];
1216 lb0 = load_balance_get(lbi0);
1218 /* SPI + SI are the second word of the NSH header */
1219 nsh0 = vlib_buffer_get_current (b0);
1220 vnet_buffer(b0)->ip.flow_hash = nsh0[1] % lb0->lb_n_buckets;
1222 dpo0 = load_balance_get_bucket_i(lb0,
1223 vnet_buffer(b0)->ip.flow_hash &
1224 (lb0->lb_n_buckets_minus_1));
1226 next0 = dpo0->dpoi_next_node;
1227 vnet_buffer (b0)->ip.adj_index[VLIB_TX] = dpo0->dpoi_index;
1229 if (PREDICT_FALSE (b0->flags & VLIB_BUFFER_IS_TRACED))
1231 load_balance_trace_t *tr = vlib_add_trace (vm, node, b0,
1233 tr->lb_index = lbi0;
1235 vlib_validate_buffer_enqueue_x1 (vm, node, next_index, to_next,
1236 n_left_to_next, bi0, next0);
1239 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
1242 return frame->n_vectors;
1246 format_nsh_load_balance_trace (u8 * s, va_list * args)
1248 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
1249 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
1250 load_balance_trace_t *t = va_arg (*args, load_balance_trace_t *);
1252 s = format (s, "NSH-load-balance: index %d", t->lb_index);
1259 VLIB_REGISTER_NODE (nsh_load_balance_node) = {
1260 .function = nsh_load_balance,
1261 .name = "nsh-load-balance",
1262 .vector_size = sizeof (u32),
1264 .format_trace = format_nsh_load_balance_trace,
1272 format_bier_load_balance_trace (u8 * s, va_list * args)
1274 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
1275 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
1276 load_balance_trace_t *t = va_arg (*args, load_balance_trace_t *);
1278 s = format (s, "BIER-load-balance: index %d", t->lb_index);
1283 bier_load_balance (vlib_main_t * vm,
1284 vlib_node_runtime_t * node,
1285 vlib_frame_t * frame)
1287 return (load_balance_inline(vm, node, frame, 0));
1293 VLIB_REGISTER_NODE (bier_load_balance_node) = {
1294 .function = bier_load_balance,
1295 .name = "bier-load-balance",
1296 .vector_size = sizeof (u32),
1298 .format_trace = format_bier_load_balance_trace,
1299 .sibling_of = "mpls-load-balance",