Neale Ranns | 0bfe5d8 | 2016-08-25 15:29:12 +0100 | [diff] [blame] | 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 | * \brief |
| 17 | * The load-balance object represents an ECMP choice. The buckets of a load |
| 18 | * balance object point to the sub-graph after the choice is made. |
| 19 | * THe load-balance object is also object type returned from a FIB table lookup. |
| 20 | * As such it needs to represent the case where there is only one coice. It may |
| 21 | * seem like overkill to use a load-balance object in this case, but the reason |
| 22 | * is for performance. If the load-balance object were not the result of the FIB |
| 23 | * lookup, then some other object would be. The case where there was ECMP |
| 24 | * this other object would need a load-balance as a parent and hence just add |
| 25 | * an unnecessary indirection. |
| 26 | * |
| 27 | * It is also the object in the DP that represents a via-fib-entry in a recursive |
| 28 | * route. |
| 29 | * |
| 30 | */ |
| 31 | |
| 32 | #ifndef __LOAD_BALANCE_H__ |
| 33 | #define __LOAD_BALANCE_H__ |
| 34 | |
| 35 | #include <vlib/vlib.h> |
| 36 | #include <vnet/ip/lookup.h> |
| 37 | #include <vnet/dpo/dpo.h> |
| 38 | #include <vnet/fib/fib_types.h> |
| 39 | |
| 40 | /** |
| 41 | * Load-balance main |
| 42 | */ |
| 43 | typedef struct load_balance_main_t_ |
| 44 | { |
| 45 | vlib_combined_counter_main_t lbm_to_counters; |
| 46 | vlib_combined_counter_main_t lbm_via_counters; |
| 47 | } load_balance_main_t; |
| 48 | |
| 49 | extern load_balance_main_t load_balance_main; |
| 50 | |
| 51 | /** |
| 52 | * The number of buckets that a load-balance object can have and still |
| 53 | * fit in one cache-line |
| 54 | */ |
| 55 | #define LB_NUM_INLINE_BUCKETS 4 |
| 56 | |
| 57 | /** |
| 58 | * @brief One path from an [EU]CMP set that the client wants to add to a |
| 59 | * load-balance object |
| 60 | */ |
| 61 | typedef struct load_balance_path_t_ { |
| 62 | /** |
| 63 | * ID of the Data-path object. |
| 64 | */ |
| 65 | dpo_id_t path_dpo; |
| 66 | |
| 67 | /** |
| 68 | * The index of the FIB path |
| 69 | */ |
| 70 | fib_node_index_t path_index; |
| 71 | |
| 72 | /** |
| 73 | * weight for the path. |
| 74 | */ |
| 75 | u32 path_weight; |
| 76 | } load_balance_path_t; |
| 77 | |
| 78 | /** |
| 79 | * The FIB DPO provieds; |
| 80 | * - load-balancing over the next DPOs in the chain/graph |
| 81 | * - per-route counters |
| 82 | */ |
| 83 | typedef struct load_balance_t_ { |
| 84 | /** |
| 85 | * number of buckets in the load-balance. always a power of 2. |
| 86 | */ |
| 87 | u16 lb_n_buckets; |
| 88 | /** |
| 89 | * number of buckets in the load-balance - 1. used in the switch path |
| 90 | * as part of the hash calculation. |
| 91 | */ |
| 92 | u16 lb_n_buckets_minus_1; |
| 93 | |
| 94 | /** |
| 95 | * The protocol of packets that traverse this LB. |
| 96 | * need in combination with the flow hash config to determine how to hash. |
| 97 | * u8. |
| 98 | */ |
| 99 | dpo_proto_t lb_proto; |
| 100 | |
| 101 | /** |
| 102 | * The number of locks, which is approximately the number of users, |
| 103 | * of this load-balance. |
| 104 | * Load-balance objects of via-entries are heavily shared by recursives, |
| 105 | * so the lock count is a u32. |
| 106 | */ |
| 107 | u32 lb_locks; |
| 108 | |
| 109 | /** |
| 110 | * index of the load-balance map, INVALID if this LB does not use one |
| 111 | */ |
| 112 | index_t lb_map; |
| 113 | |
| 114 | /** |
Neale Ranns | 3ee4404 | 2016-10-03 13:05:48 +0100 | [diff] [blame] | 115 | * This is the index of the uRPF list for this LB |
| 116 | */ |
| 117 | index_t lb_urpf; |
| 118 | |
| 119 | /** |
Neale Ranns | 0bfe5d8 | 2016-08-25 15:29:12 +0100 | [diff] [blame] | 120 | * the hash config to use when selecting a bucket. this is a u16 |
| 121 | */ |
| 122 | flow_hash_config_t lb_hash_config; |
| 123 | |
| 124 | /** |
| 125 | * Vector of buckets containing the next DPOs, sized as lbo_num |
| 126 | */ |
| 127 | dpo_id_t *lb_buckets; |
| 128 | |
| 129 | /** |
| 130 | * The rest of the cache line is used for buckets. In the common case |
| 131 | * where there there are less than 4 buckets, then the buckets are |
| 132 | * on the same cachlie and we save ourselves a pointer dereferance in |
| 133 | * the data-path. |
| 134 | */ |
| 135 | dpo_id_t lb_buckets_inline[LB_NUM_INLINE_BUCKETS]; |
| 136 | } load_balance_t; |
| 137 | |
Damjan Marion | cf47894 | 2016-11-07 14:57:50 +0100 | [diff] [blame] | 138 | STATIC_ASSERT(sizeof(load_balance_t) <= CLIB_CACHE_LINE_BYTES, |
| 139 | "A load_balance object size exceeds one cachline"); |
Neale Ranns | 0bfe5d8 | 2016-08-25 15:29:12 +0100 | [diff] [blame] | 140 | |
| 141 | /** |
| 142 | * Flags controlling load-balance formatting/display |
| 143 | */ |
| 144 | typedef enum load_balance_format_flags_t_ { |
| 145 | LOAD_BALANCE_FORMAT_NONE, |
| 146 | LOAD_BALANCE_FORMAT_DETAIL = (1 << 0), |
| 147 | } load_balance_format_flags_t; |
| 148 | |
| 149 | /** |
| 150 | * Flags controlling load-balance creation and modification |
| 151 | */ |
| 152 | typedef enum load_balance_flags_t_ { |
| 153 | LOAD_BALANCE_FLAG_NONE = 0, |
| 154 | LOAD_BALANCE_FLAG_USES_MAP = (1 << 0), |
| 155 | } load_balance_flags_t; |
| 156 | |
| 157 | extern index_t load_balance_create(u32 num_buckets, |
| 158 | dpo_proto_t lb_proto, |
| 159 | flow_hash_config_t fhc); |
| 160 | extern void load_balance_multipath_update( |
| 161 | const dpo_id_t *dpo, |
Neale Ranns | c0790cf | 2017-01-05 01:01:47 -0800 | [diff] [blame] | 162 | const load_balance_path_t * raw_next_hops, |
Neale Ranns | 0bfe5d8 | 2016-08-25 15:29:12 +0100 | [diff] [blame] | 163 | load_balance_flags_t flags); |
| 164 | |
| 165 | extern void load_balance_set_bucket(index_t lbi, |
| 166 | u32 bucket, |
| 167 | const dpo_id_t *next); |
Neale Ranns | 3ee4404 | 2016-10-03 13:05:48 +0100 | [diff] [blame] | 168 | extern void load_balance_set_urpf(index_t lbi, |
| 169 | index_t urpf); |
| 170 | extern index_t load_balance_get_urpf(index_t lbi); |
Neale Ranns | 0bfe5d8 | 2016-08-25 15:29:12 +0100 | [diff] [blame] | 171 | |
| 172 | extern u8* format_load_balance(u8 * s, va_list * args); |
| 173 | |
| 174 | extern const dpo_id_t *load_balance_get_bucket(index_t lbi, |
| 175 | u32 bucket); |
| 176 | extern int load_balance_is_drop(const dpo_id_t *dpo); |
| 177 | |
| 178 | extern f64 load_balance_get_multipath_tolerance(void); |
| 179 | |
| 180 | /** |
| 181 | * The encapsulation breakages are for fast DP access |
| 182 | */ |
| 183 | extern load_balance_t *load_balance_pool; |
| 184 | static inline load_balance_t* |
| 185 | load_balance_get (index_t lbi) |
| 186 | { |
| 187 | return (pool_elt_at_index(load_balance_pool, lbi)); |
| 188 | } |
| 189 | |
| 190 | #define LB_HAS_INLINE_BUCKETS(_lb) \ |
| 191 | ((_lb)->lb_n_buckets <= LB_NUM_INLINE_BUCKETS) |
| 192 | |
| 193 | static inline const dpo_id_t * |
| 194 | load_balance_get_bucket_i (const load_balance_t *lb, |
| 195 | u32 bucket) |
| 196 | { |
| 197 | ASSERT(bucket < lb->lb_n_buckets); |
| 198 | |
| 199 | if (PREDICT_TRUE(LB_HAS_INLINE_BUCKETS(lb))) |
| 200 | { |
| 201 | return (&lb->lb_buckets_inline[bucket]); |
| 202 | } |
| 203 | else |
| 204 | { |
| 205 | return (&lb->lb_buckets[bucket]); |
| 206 | } |
| 207 | } |
| 208 | |
| 209 | extern void load_balance_module_init(void); |
| 210 | |
| 211 | #endif |