FD.io VPP  v16.06
Vector Packet Processing
lookup.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2015 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  * ip/ip_lookup.h: ip (4 or 6) lookup structures, adjacencies, ...
17  *
18  * Copyright (c) 2008 Eliot Dresselhaus
19  *
20  * Permission is hereby granted, free of charge, to any person obtaining
21  * a copy of this software and associated documentation files (the
22  * "Software"), to deal in the Software without restriction, including
23  * without limitation the rights to use, copy, modify, merge, publish,
24  * distribute, sublicense, and/or sell copies of the Software, and to
25  * permit persons to whom the Software is furnished to do so, subject to
26  * the following conditions:
27  *
28  * The above copyright notice and this permission notice shall be
29  * included in all copies or substantial portions of the Software.
30  *
31  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
38  */
39 
40 #ifndef included_ip_lookup_h
41 #define included_ip_lookup_h
42 
43 #include <vnet/vnet.h>
44 #include <vlib/buffer.h>
45 #include <vnet/ip/ip4_packet.h>
46 #include <vnet/ip/ip6_packet.h>
47 
48 /* Next index stored in adjacency. */
49 typedef enum {
50  /* Packet does not match any route in table. */
52 
53  /* Adjacency says to drop or punt this packet. */
56 
57  /* This packet is for one of our own IP addresses. */
59 
60  /* This packet matches an "interface route" and packets
61  need to be passed to ARP to find rewrite string for
62  this destination. */
64 
65  /* This packet is to be rewritten and forwarded to the next
66  processing node. This is typically the output interface but
67  might be another node for further output processing. */
69 
70  /* This packet needs to be classified */
72 
73  /* This packet needs to go to MAP - RFC7596, RFC7597 */
75 
76  /* This packet needs to go to MAP with Translation - RFC7599 */
78 
79  /* This packets needs to go to 6RD (RFC5969) */
81 
82  /* This packets needs to go to indirect next hop */
84 
85  /* Hop-by-hop header handling */
89 
92 
93 #define IP4_LOOKUP_NEXT_NODES { \
94  [IP_LOOKUP_NEXT_MISS] = "ip4-miss", \
95  [IP_LOOKUP_NEXT_DROP] = "ip4-drop", \
96  [IP_LOOKUP_NEXT_PUNT] = "ip4-punt", \
97  [IP_LOOKUP_NEXT_LOCAL] = "ip4-local", \
98  [IP_LOOKUP_NEXT_ARP] = "ip4-arp", \
99  [IP_LOOKUP_NEXT_REWRITE] = "ip4-rewrite-transit", \
100  [IP_LOOKUP_NEXT_CLASSIFY] = "ip4-classify", \
101  [IP_LOOKUP_NEXT_MAP] = "ip4-map", \
102  [IP_LOOKUP_NEXT_MAP_T] = "ip4-map-t", \
103  [IP_LOOKUP_NEXT_SIXRD] = "ip4-sixrd", \
104  [IP_LOOKUP_NEXT_HOP_BY_HOP] = "ip4-hop-by-hop", \
105  [IP_LOOKUP_NEXT_ADD_HOP_BY_HOP] = "ip4-add-hop-by-hop", \
106  [IP_LOOKUP_NEXT_POP_HOP_BY_HOP] = "ip4-pop-hop-by-hop", \
107  [IP_LOOKUP_NEXT_INDIRECT] = "ip4-indirect", \
108 }
109 
110 #define IP6_LOOKUP_NEXT_NODES { \
111  [IP_LOOKUP_NEXT_MISS] = "ip6-miss", \
112  [IP_LOOKUP_NEXT_DROP] = "ip6-drop", \
113  [IP_LOOKUP_NEXT_PUNT] = "ip6-punt", \
114  [IP_LOOKUP_NEXT_LOCAL] = "ip6-local", \
115  [IP_LOOKUP_NEXT_ARP] = "ip6-discover-neighbor", \
116  [IP_LOOKUP_NEXT_REWRITE] = "ip6-rewrite", \
117  [IP_LOOKUP_NEXT_CLASSIFY] = "ip6-classify", \
118  [IP_LOOKUP_NEXT_MAP] = "ip6-map", \
119  [IP_LOOKUP_NEXT_MAP_T] = "ip6-map-t", \
120  [IP_LOOKUP_NEXT_SIXRD] = "ip6-sixrd", \
121  [IP_LOOKUP_NEXT_HOP_BY_HOP] = "ip6-hop-by-hop", \
122  [IP_LOOKUP_NEXT_ADD_HOP_BY_HOP] = "ip6-add-hop-by-hop", \
123  [IP_LOOKUP_NEXT_POP_HOP_BY_HOP] = "ip6-pop-hop-by-hop", \
124  [IP_LOOKUP_NEXT_INDIRECT] = "ip6-indirect", \
125 }
126 
127 /* Flow hash configuration */
128 #define IP_FLOW_HASH_SRC_ADDR (1<<0)
129 #define IP_FLOW_HASH_DST_ADDR (1<<1)
130 #define IP_FLOW_HASH_PROTO (1<<2)
131 #define IP_FLOW_HASH_SRC_PORT (1<<3)
132 #define IP_FLOW_HASH_DST_PORT (1<<4)
133 #define IP_FLOW_HASH_REVERSE_SRC_DST (1<<5)
134 
135 /* Default: 5-tuple without the "reverse" bit */
136 #define IP_FLOW_HASH_DEFAULT (0x1F)
137 
138 #define foreach_flow_hash_bit \
139 _(src, IP_FLOW_HASH_SRC_ADDR) \
140 _(dst, IP_FLOW_HASH_DST_ADDR) \
141 _(sport, IP_FLOW_HASH_SRC_PORT) \
142 _(dport, IP_FLOW_HASH_DST_PORT) \
143 _(proto, IP_FLOW_HASH_PROTO) \
144 _(reverse, IP_FLOW_HASH_REVERSE_SRC_DST)
145 
146 /* IP unicast adjacency. */
147 typedef struct {
148  CLIB_CACHE_LINE_ALIGN_MARK(cacheline0);
149  /* Handle for this adjacency in adjacency heap. */
151 
152  STRUCT_MARK(signature_start);
153 
154  /* Interface address index for this local/arp adjacency. */
156 
157  /* Number of adjecencies in block. Greater than 1 means multipath;
158  otherwise equal to 1. */
160 
161  /* Next hop after ip4-lookup. */
162  union {
163  ip_lookup_next_t lookup_next_index : 16;
165  };
166 
167  /* Force re-lookup in a different FIB. ~0 => normal behavior */
170 
171  /* Highest possible perf subgraph arc interposition, e.g. for ip6 ioam */
173 
174  union {
175  /* IP_LOOKUP_NEXT_ARP only */
176  struct {
177  ip46_address_t next_hop;
178  } arp;
179  /* IP_LOOKUP_NEXT_CLASSIFY only */
180  struct {
182  } classify;
183  /* IP_LOOKUP_NEXT_INDIRECT only */
184  struct {
185  ip46_address_t next_hop;
186  } indirect;
187  };
188 
189  STRUCT_MARK(signature_end);
190 
191  /* Number of FIB entries sharing this adjacency */
193  /* Use this adjacency instead */
195 
196  CLIB_CACHE_LINE_ALIGN_MARK(cacheline1);
197 
198  /* Rewrite in second/third cache lines */
201 
202 static inline uword
204 {
205  uword signature = 0xfeedfaceULL;
206 
207  /* Skip heap handle, sum everything up to but not including share_count */
208  signature = hash_memory
209  (STRUCT_MARK_PTR(adj, signature_start),
210  STRUCT_OFFSET_OF(ip_adjacency_t, signature_end)
211  - STRUCT_OFFSET_OF(ip_adjacency_t, signature_start),
212  signature);
213 
214  /* and the rewrite */
215  signature = hash_memory (&adj->rewrite_header, VLIB_BUFFER_PRE_DATA_SIZE,
216  signature);
217  return signature;
218 }
219 
220 static inline int
222 {
223  if (memcmp (STRUCT_MARK_PTR(a1, signature_start),
224  STRUCT_MARK_PTR(a2, signature_start),
225  STRUCT_OFFSET_OF(ip_adjacency_t, signature_end)
226  - STRUCT_OFFSET_OF(ip_adjacency_t, signature_start)))
227  return 0;
228  if (memcmp (&a1->rewrite_header, &a2->rewrite_header,
230  return 0;
231  return 1;
232 }
233 
234 /* Index into adjacency table. */
236 
237 typedef struct {
238  /* Directly connected next-hop adjacency index. */
240 
241  /* Path weight for this adjacency. */
244 
245 typedef struct {
246  /* Adjacency index of first index in block. */
248 
249  /* Power of 2 size of adjacency block. */
251 
252  /* Number of prefixes that point to this adjacency. */
254 
255  /* Normalized next hops are used as hash keys: they are sorted by weight
256  and weights are chosen so they add up to 1 << log2_n_adj_in_block (with
257  zero-weighted next hops being deleted).
258  Unnormalized next hops are saved so that control plane has a record of exactly
259  what the RIB told it. */
260  struct {
261  /* Number of hops in the multipath. */
263 
264  /* Offset into next hop heap for this block. */
266 
267  /* Heap handle used to for example free block when we're done with it. */
269  } normalized_next_hops, unnormalized_next_hops;
271 
272 /* IP multicast adjacency. */
273 typedef struct {
274  /* Handle for this adjacency in adjacency heap. */
276 
277  /* Number of adjecencies in block. */
279 
280  /* Rewrite string. */
281  vnet_declare_rewrite (64 - 2*sizeof(u32));
283 
284 typedef struct {
285  /* ip4-multicast-rewrite next index. */
287 
289 
290  u8 rewrite_string[64 - 1*sizeof(u32) - 1*sizeof(u8)];
292 
293 typedef struct {
295 
297 
298  /* Negative rewrite string index; >= 0 sw_if_index.
299  Sorted. Used to hash. */
301 
304 
305 typedef struct {
306  /* Key for mhash; in fact, just a byte offset into mhash key vector. */
308 
309  /* Interface which has this address. */
311 
312  /* Adjacency for neighbor probe (ARP) for this interface address. */
314 
315  /* Address (prefix) length for this interface. */
317 
318  /* Will be used for something eventually. Primary vs. secondary? */
320 
321  /* Next and previous pointers for doubly linked list of
322  addresses per software interface. */
326 
327 typedef enum {
334 
335 struct ip_lookup_main_t;
336 
338  u32 adj_index,
339  ip_adjacency_t * adj,
340  u32 is_del);
341 
342 typedef struct {
344 
347 
348 typedef struct ip_lookup_main_t {
349  /* Adjacency heap. */
351 
352  /* Adjacency packet/byte counters indexed by adjacency index. */
354 
355  /* Heap of (next hop, weight) blocks. Sorted by next hop. */
357 
358  /* Indexed by heap_handle from ip_adjacency_t. */
360 
361  /* Adjacency by signature hash */
363 
364  /* Temporary vectors for looking up next hops in hash. */
367 
368  /* Hash table mapping normalized next hops and weights
369  to multipath adjacency index. */
371 
374 
375  /* If average error per adjacency is less than this threshold adjacency block
376  size is accepted. */
378 
379  /* Adjacency index for routing table misses, local punts, and drops. */
381 
382  /* Miss adjacency is always first in adjacency table. */
383 #define IP_LOOKUP_MISS_ADJ_INDEX 0
384 
386 
387  /* Pool of addresses that are assigned to interfaces. */
389 
390  /* Hash table mapping address to index in interface address pool. */
392 
393  /* Head of doubly linked list of interface addresses for each software interface.
394  ~0 means this interface has no address. */
396 
397  /* First table index to use for this interface, ~0 => none */
399 
400  /* rx/tx interface/feature configuration. */
402 
403  /* Number of bytes in a fib result. Must be at least
404  sizeof (uword). First word is always adjacency index. */
406 
408 
409  /* 1 for ip6; 0 for ip4. */
411 
412  /* Either format_ip4_address_and_length or format_ip6_address_and_length. */
414 
415  /* Table mapping ip protocol to ip[46]-local node next index. */
417 
418  /* IP_BUILTIN_PROTOCOL_{TCP,UDP,ICMP,OTHER} by protocol in IP header. */
421 
424  u32 adj_index)
425 {
426  ip_adjacency_t * adj;
427 
428  adj = vec_elt_at_index (lm->adjacency_heap, adj_index);
429 
430  ASSERT (adj->heap_handle != ~0);
431 
432  return adj;
433 }
434 
435 #define ip_prefetch_adjacency(lm,adj_index,type) \
436 do { \
437  ip_adjacency_t * _adj = (lm)->adjacency_heap + (adj_index); \
438  CLIB_PREFETCH (_adj, sizeof (_adj[0]), type); \
439 } while (0)
440 
441 static inline void
444 {
446 }
447 
448 always_inline void
450 {
451  ip_adjacency_t * adj;
452  uword i;
453  adj = ip_get_adjacency (lm, adj_index);
454  for (i = 0; i < vec_len (lm->add_del_adjacency_callbacks); i++)
455  lm->add_del_adjacency_callbacks[i] (lm, adj_index, adj, is_del);
456 }
457 
458 /* Create new block of given number of contiguous adjacencies. */
461  ip_adjacency_t * adj,
462  u32 n_adj,
463  u32 * adj_index_result);
464 
465 void ip_del_adjacency (ip_lookup_main_t * lm, u32 adj_index);
466 void
468  u32 adj_index,
469  ip_adjacency_t * copy_adj);
470 
471 static inline int
473 {
474  if (!vec_len(lm->multipath_adjacencies))
475  return 0;
476 
477  if (vec_len(lm->multipath_adjacencies) < adj_index - 1)
478  return 0;
479 
480 
481  return (lm->multipath_adjacencies[adj_index].adj_index == adj_index &&
482  lm->multipath_adjacencies[adj_index].n_adj_in_block > 0);
483 }
484 
485 void
488 
489 u32
491  u32 is_del,
492  u32 old_mp_adj_index,
493  u32 next_hop_adj_index,
494  u32 next_hop_weight,
495  u32 * new_mp_adj_index);
496 
497 clib_error_t *
499  u32 sw_if_index,
500  void * address,
501  u32 address_length,
502  u32 is_del,
503  u32 * result_index);
504 
507 {
508  uword * p = mhash_get (&lm->address_to_if_address_index, addr_fib);
509  return p ? pool_elt_at_index (lm->if_address_pool, p[0]) : 0;
510 }
511 
512 always_inline void *
515 
518 {
519  ip_adjacency_t * adj;
520  u32 if_address_index;
521 
522  adj = ip_get_adjacency (lm, vnet_buffer (b)->ip.adj_index[VLIB_TX]);
523 
526  if_address_index = adj->if_address_index;
527  if_address_index = (if_address_index == ~0 ?
529  : if_address_index);
530 
531  return pool_elt_at_index (lm->if_address_pool, if_address_index);
532 }
533 
534 #define foreach_ip_interface_address(lm,a,sw_if_index,loop,body) \
535 do { \
536  vnet_main_t *_vnm = vnet_get_main(); \
537  u32 _sw_if_index = sw_if_index; \
538  vnet_sw_interface_t *_swif; \
539  _swif = vnet_get_sw_interface (_vnm, _sw_if_index); \
540  \
541  /* \
542  * Loop => honor unnumbered interface addressing. \
543  */ \
544  if (loop && _swif->flags & VNET_SW_INTERFACE_FLAG_UNNUMBERED) \
545  _sw_if_index = _swif->unnumbered_sw_if_index; \
546  u32 _ia = \
547  (vec_len((lm)->if_address_pool_index_by_sw_if_index) \
548  > (_sw_if_index)) \
549  ? vec_elt ((lm)->if_address_pool_index_by_sw_if_index, \
550  (_sw_if_index)) : (u32)~0; \
551  ip_interface_address_t * _a; \
552  while (_ia != ~0) \
553  { \
554  _a = pool_elt_at_index ((lm)->if_address_pool, _ia); \
555  _ia = _a->next_this_sw_interface; \
556  (a) = _a; \
557  body; \
558  } \
559 } while (0)
560 
561 void ip_lookup_init (ip_lookup_main_t * lm, u32 ip_lookup_node_index);
562 
563 #endif /* included_ip_lookup_h */
uword * multipath_adjacency_by_next_hops
Definition: lookup.h:370
uword * adjacency_by_id_vector
Definition: lookup.h:302
format_function_t * format_fib_result
Definition: lookup.h:407
ip_lookup_next_t
Definition: lookup.h:49
Definition: mhash.h:46
#define CLIB_CACHE_LINE_ALIGN_MARK(mark)
Definition: cache.h:68
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:267
u32 * config_index_by_sw_if_index
Definition: lookup.h:345
u32 local_adj_index
Definition: lookup.h:380
ip_add_del_adjacency_callback_t * add_del_adjacency_callbacks
Definition: lookup.h:385
ip_adjacency_t * adjacency_heap
Definition: lookup.h:350
a
Definition: bitmap.h:393
u16 saved_lookup_next_index
Definition: lookup.h:172
ip_multicast_rewrite_t * rewrite_heap
Definition: lookup.h:294
clib_error_t * ip_interface_address_add_del(ip_lookup_main_t *lm, u32 sw_if_index, void *address, u32 address_length, u32 is_del, u32 *result_index)
Definition: lookup.c:735
static void(BVT(clib_bihash)*h, BVT(clib_bihash_value)*v)
ip_interface_address_t * if_address_pool
Definition: lookup.h:388
#define STRUCT_MARK_PTR(v, f)
Definition: clib.h:68
ip_lookup_next_t lookup_next_index
Definition: lookup.h:163
static int ip_adjacency_is_multipath(ip_lookup_main_t *lm, u32 adj_index)
Definition: lookup.h:472
u32 miss_adj_index
Definition: lookup.h:380
ip_config_main_t rx_config_mains[VNET_N_CAST]
Definition: lookup.h:401
void ip_update_adjacency(ip_lookup_main_t *lm, u32 adj_index, ip_adjacency_t *copy_adj)
Definition: lookup.c:234
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:480
u32 share_count
Definition: lookup.h:192
#define STRUCT_MARK(mark)
Definition: clib.h:67
#define STRUCT_OFFSET_OF(t, f)
Definition: clib.h:62
static int vnet_ip_adjacency_share_compare(ip_adjacency_t *a1, ip_adjacency_t *a2)
Definition: lookup.h:221
u16 table_index
Definition: lookup.h:181
always_inline void * mhash_key_to_mem(mhash_t *h, uword key)
Definition: mhash.h:85
void(* ip_add_del_adjacency_callback_t)(struct ip_lookup_main_t *lm, u32 adj_index, ip_adjacency_t *adj, u32 is_del)
Definition: lookup.h:337
u32 neighbor_probe_adj_index
Definition: lookup.h:313
mhash_t address_to_if_address_index
Definition: lookup.h:391
always_inline void * ip_interface_address_get_address(ip_lookup_main_t *lm, ip_interface_address_t *a)
Definition: lookup.h:513
u32 next_adj_with_signature
Definition: lookup.h:194
#define always_inline
Definition: clib.h:84
u32 * adjacency_remap_table
Definition: lookup.h:372
uword * adj_index_by_signature
Definition: lookup.h:362
int i32
Definition: types.h:81
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
u16 mcast_group_index
Definition: lookup.h:169
#define VLIB_BUFFER_PRE_DATA_SIZE
Definition: buffer.h:56
static uword vnet_ip_adjacency_signature(ip_adjacency_t *adj)
Definition: lookup.h:203
struct ip_lookup_main_t ip_lookup_main_t
#define pool_elt_at_index(p, i)
Definition: pool.h:346
u32 * classify_table_index_by_sw_if_index
Definition: lookup.h:398
u8 local_next_by_ip_protocol[256]
Definition: lookup.h:416
always_inline ip_interface_address_t * ip_interface_address_for_packet(ip_lookup_main_t *lm, vlib_buffer_t *b, u32 sw_if_index)
Definition: lookup.h:517
u32 ip_multipath_adjacency_add_del_next_hop(ip_lookup_main_t *lm, u32 is_del, u32 old_mp_adj_index, u32 next_hop_adj_index, u32 next_hop_weight, u32 *new_mp_adj_index)
Definition: lookup.c:495
u32 drop_adj_index
Definition: lookup.h:380
ip_adjacency_t * ip_add_adjacency(ip_lookup_main_t *lm, ip_adjacency_t *adj, u32 n_adj, u32 *adj_index_result)
Definition: lookup.c:139
vlib_combined_counter_main_t adjacency_counters
Definition: lookup.h:353
u8 builtin_protocol_by_ip_protocol[256]
Definition: lookup.h:419
u32 ip_adjacency_index_t
Definition: lookup.h:235
u32 * if_address_pool_index_by_sw_if_index
Definition: lookup.h:395
static void ip_register_add_del_adjacency_callback(ip_lookup_main_t *lm, ip_add_del_adjacency_callback_t cb)
Definition: lookup.h:442
#define ASSERT(truth)
ip_multipath_next_hop_t * next_hop_hash_lookup_key
Definition: lookup.h:365
unsigned int u32
Definition: types.h:88
#define vnet_buffer(b)
Definition: buffer.h:300
uword hash_memory(void *p, word n_bytes, uword state)
Definition: hash.c:208
u32 fib_result_n_words
Definition: lookup.h:405
u32 n_adjacency_remaps
Definition: lookup.h:373
u8 *( format_function_t)(u8 *s, va_list *args)
Definition: format.h:48
always_inline ip_adjacency_t * ip_get_adjacency(ip_lookup_main_t *lm, u32 adj_index)
Definition: lookup.h:423
u64 uword
Definition: types.h:112
#define vec_elt(v, i)
Get vector value at index i.
Definition: defs.h:46
unsigned short u16
Definition: types.h:57
ip_config_main_t tx_config_main
Definition: lookup.h:401
#define vnet_declare_rewrite(total_bytes)
Definition: rewrite.h:82
always_inline ip_interface_address_t * ip_get_interface_address(ip_lookup_main_t *lm, void *addr_fib)
Definition: lookup.h:506
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
double f64
Definition: types.h:140
ip46_address_t next_hop
Definition: lookup.h:177
unsigned char u8
Definition: types.h:56
void ip_multipath_adjacency_free(ip_lookup_main_t *lm, ip_multipath_adjacency_t *a)
Definition: lookup.c:677
u32 heap_handle
Definition: lookup.h:150
short i16
Definition: types.h:46
ip_multipath_next_hop_t * next_hop_heap
Definition: lookup.h:356
ip_multipath_adjacency_t * multipath_adjacencies
Definition: lookup.h:359
always_inline void ip_call_add_del_adjacency_callbacks(ip_lookup_main_t *lm, u32 adj_index, u32 is_del)
Definition: lookup.h:449
u32 if_address_index
Definition: lookup.h:155
ip_local_next_t
Definition: lookup.h:327
i16 explicit_fib_index
Definition: lookup.h:168
ip_multipath_next_hop_t * next_hop_hash_lookup_key_normalized
Definition: lookup.h:366
void ip_lookup_init(ip_lookup_main_t *lm, u32 ip_lookup_node_index)
Definition: lookup.c:841
vlib buffer structure definition and a few select access methods.
vnet_config_main_t config_main
Definition: lookup.h:343
always_inline uword * mhash_get(mhash_t *h, void *key)
Definition: mhash.h:104
void ip_del_adjacency(ip_lookup_main_t *lm, u32 adj_index)
Definition: lookup.c:285
f64 multipath_next_hop_error_tolerance
Definition: lookup.h:377
u32 fib_result_n_bytes
Definition: lookup.h:405
ip_multicast_rewrite_string_t * rewrite_strings
Definition: lookup.h:296
format_function_t * format_address_and_length
Definition: lookup.h:413
u16 lookup_next_index_as_int
Definition: lookup.h:164