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:
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 * ip/ip_lookup.h: ip (4 or 6) lookup structures, adjacencies, ...
18 * Copyright (c) 2008 Eliot Dresselhaus
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:
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
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.
40 #ifndef included_ip_lookup_h
41 #define included_ip_lookup_h
43 #include <vnet/vnet.h>
44 #include <vlib/buffer.h>
45 #include <vnet/ip/ip4_packet.h>
46 #include <vnet/ip/ip6_packet.h>
48 /* Common (IP4/IP6) next index stored in adjacency. */
50 /* Packet does not match any route in table. */
53 /* Adjacency says to drop or punt this packet. */
57 /* This packet is for one of our own IP addresses. */
60 /* This packet matches an "interface route" and packets
61 need to be passed to ARP to find rewrite string for
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. */
68 IP_LOOKUP_NEXT_REWRITE,
70 /* This packet needs to be classified */
71 IP_LOOKUP_NEXT_CLASSIFY,
73 /* This packet needs to go to MAP - RFC7596, RFC7597 */
76 /* This packet needs to go to MAP with Translation - RFC7599 */
79 /* This packets needs to go to indirect next hop */
80 IP_LOOKUP_NEXT_INDIRECT,
82 IP_LOOKUP_NEXT_ICMP_ERROR,
88 IP4_LOOKUP_N_NEXT = IP_LOOKUP_N_NEXT,
92 /* Hop-by-hop header handling */
93 IP6_LOOKUP_NEXT_HOP_BY_HOP = IP_LOOKUP_N_NEXT,
94 IP6_LOOKUP_NEXT_ADD_HOP_BY_HOP,
95 IP6_LOOKUP_NEXT_POP_HOP_BY_HOP,
99 #define IP4_LOOKUP_NEXT_NODES { \
100 [IP_LOOKUP_NEXT_MISS] = "ip4-miss", \
101 [IP_LOOKUP_NEXT_DROP] = "ip4-drop", \
102 [IP_LOOKUP_NEXT_PUNT] = "ip4-punt", \
103 [IP_LOOKUP_NEXT_LOCAL] = "ip4-local", \
104 [IP_LOOKUP_NEXT_ARP] = "ip4-arp", \
105 [IP_LOOKUP_NEXT_REWRITE] = "ip4-rewrite-transit", \
106 [IP_LOOKUP_NEXT_CLASSIFY] = "ip4-classify", \
107 [IP_LOOKUP_NEXT_MAP] = "ip4-map", \
108 [IP_LOOKUP_NEXT_MAP_T] = "ip4-map-t", \
109 [IP_LOOKUP_NEXT_INDIRECT] = "ip4-indirect", \
110 [IP_LOOKUP_NEXT_ICMP_ERROR] = "ip4-icmp-error", \
113 #define IP6_LOOKUP_NEXT_NODES { \
114 [IP_LOOKUP_NEXT_MISS] = "ip6-miss", \
115 [IP_LOOKUP_NEXT_DROP] = "ip6-drop", \
116 [IP_LOOKUP_NEXT_PUNT] = "ip6-punt", \
117 [IP_LOOKUP_NEXT_LOCAL] = "ip6-local", \
118 [IP_LOOKUP_NEXT_ARP] = "ip6-discover-neighbor", \
119 [IP_LOOKUP_NEXT_REWRITE] = "ip6-rewrite", \
120 [IP_LOOKUP_NEXT_CLASSIFY] = "ip6-classify", \
121 [IP_LOOKUP_NEXT_MAP] = "ip6-map", \
122 [IP_LOOKUP_NEXT_MAP_T] = "ip6-map-t", \
123 [IP_LOOKUP_NEXT_INDIRECT] = "ip6-indirect", \
124 [IP_LOOKUP_NEXT_ICMP_ERROR] = "ip6-icmp-error", \
125 [IP6_LOOKUP_NEXT_HOP_BY_HOP] = "ip6-hop-by-hop", \
126 [IP6_LOOKUP_NEXT_ADD_HOP_BY_HOP] = "ip6-add-hop-by-hop", \
127 [IP6_LOOKUP_NEXT_POP_HOP_BY_HOP] = "ip6-pop-hop-by-hop", \
130 /* Flow hash configuration */
131 #define IP_FLOW_HASH_SRC_ADDR (1<<0)
132 #define IP_FLOW_HASH_DST_ADDR (1<<1)
133 #define IP_FLOW_HASH_PROTO (1<<2)
134 #define IP_FLOW_HASH_SRC_PORT (1<<3)
135 #define IP_FLOW_HASH_DST_PORT (1<<4)
136 #define IP_FLOW_HASH_REVERSE_SRC_DST (1<<5)
138 /* Default: 5-tuple without the "reverse" bit */
139 #define IP_FLOW_HASH_DEFAULT (0x1F)
141 #define foreach_flow_hash_bit \
142 _(src, IP_FLOW_HASH_SRC_ADDR) \
143 _(dst, IP_FLOW_HASH_DST_ADDR) \
144 _(sport, IP_FLOW_HASH_SRC_PORT) \
145 _(dport, IP_FLOW_HASH_DST_PORT) \
146 _(proto, IP_FLOW_HASH_PROTO) \
147 _(reverse, IP_FLOW_HASH_REVERSE_SRC_DST)
149 #define IP_ADJACENCY_OPAQUE_SZ 16
150 /* IP unicast adjacency. */
152 CLIB_CACHE_LINE_ALIGN_MARK(cacheline0);
153 /* Handle for this adjacency in adjacency heap. */
156 STRUCT_MARK(signature_start);
158 /* Interface address index for this local/arp adjacency. */
159 u32 if_address_index;
161 /* Number of adjecencies in block. Greater than 1 means multipath;
162 otherwise equal to 1. */
165 /* Next hop after ip4-lookup. */
167 ip_lookup_next_t lookup_next_index : 16;
168 u16 lookup_next_index_as_int;
171 /* Force re-lookup in a different FIB. ~0 => normal behavior */
172 i16 explicit_fib_index;
173 u16 mcast_group_index;
175 /* Highest possible perf subgraph arc interposition, e.g. for ip6 ioam */
176 u16 saved_lookup_next_index;
179 /* IP_LOOKUP_NEXT_ARP only */
181 ip46_address_t next_hop;
183 /* IP_LOOKUP_NEXT_CLASSIFY only */
187 /* IP_LOOKUP_NEXT_INDIRECT only */
189 ip46_address_t next_hop;
191 u8 opaque[IP_ADJACENCY_OPAQUE_SZ];
194 STRUCT_MARK(signature_end);
196 /* Number of FIB entries sharing this adjacency */
198 /* Use this adjacency instead */
199 u32 next_adj_with_signature;
201 CLIB_CACHE_LINE_ALIGN_MARK(cacheline1);
203 /* Rewrite in second/third cache lines */
204 vnet_declare_rewrite (VLIB_BUFFER_PRE_DATA_SIZE);
208 vnet_ip_adjacency_signature (ip_adjacency_t * adj)
210 uword signature = 0xfeedfaceULL;
212 /* Skip heap handle, sum everything up to but not including share_count */
213 signature = hash_memory
214 (STRUCT_MARK_PTR(adj, signature_start),
215 STRUCT_OFFSET_OF(ip_adjacency_t, signature_end)
216 - STRUCT_OFFSET_OF(ip_adjacency_t, signature_start),
219 /* and the rewrite */
220 signature = hash_memory (&adj->rewrite_header, VLIB_BUFFER_PRE_DATA_SIZE,
226 vnet_ip_adjacency_share_compare (ip_adjacency_t * a1, ip_adjacency_t *a2)
228 if (memcmp (STRUCT_MARK_PTR(a1, signature_start),
229 STRUCT_MARK_PTR(a2, signature_start),
230 STRUCT_OFFSET_OF(ip_adjacency_t, signature_end)
231 - STRUCT_OFFSET_OF(ip_adjacency_t, signature_start)))
233 if (memcmp (&a1->rewrite_header, &a2->rewrite_header,
234 VLIB_BUFFER_PRE_DATA_SIZE))
239 /* Index into adjacency table. */
240 typedef u32 ip_adjacency_index_t;
243 /* Directly connected next-hop adjacency index. */
244 u32 next_hop_adj_index;
246 /* Path weight for this adjacency. */
248 } ip_multipath_next_hop_t;
251 /* Adjacency index of first index in block. */
254 /* Power of 2 size of adjacency block. */
257 /* Number of prefixes that point to this adjacency. */
260 /* Normalized next hops are used as hash keys: they are sorted by weight
261 and weights are chosen so they add up to 1 << log2_n_adj_in_block (with
262 zero-weighted next hops being deleted).
263 Unnormalized next hops are saved so that control plane has a record of exactly
264 what the RIB told it. */
266 /* Number of hops in the multipath. */
269 /* Offset into next hop heap for this block. */
272 /* Heap handle used to for example free block when we're done with it. */
274 } normalized_next_hops, unnormalized_next_hops;
275 } ip_multipath_adjacency_t;
277 /* IP multicast adjacency. */
279 /* Handle for this adjacency in adjacency heap. */
282 /* Number of adjecencies in block. */
285 /* Rewrite string. */
286 vnet_declare_rewrite (64 - 2*sizeof(u32));
287 } ip_multicast_rewrite_t;
290 /* ip4-multicast-rewrite next index. */
295 u8 rewrite_string[64 - 1*sizeof(u32) - 1*sizeof(u8)];
296 } ip_multicast_rewrite_string_t;
299 ip_multicast_rewrite_t * rewrite_heap;
301 ip_multicast_rewrite_string_t * rewrite_strings;
303 /* Negative rewrite string index; >= 0 sw_if_index.
304 Sorted. Used to hash. */
305 i32 ** adjacency_id_vector;
307 uword * adjacency_by_id_vector;
308 } ip_multicast_lookup_main_t;
311 /* Key for mhash; in fact, just a byte offset into mhash key vector. */
314 /* Interface which has this address. */
317 /* Adjacency for neighbor probe (ARP) for this interface address. */
318 u32 neighbor_probe_adj_index;
320 /* Address (prefix) length for this interface. */
323 /* Will be used for something eventually. Primary vs. secondary? */
326 /* Next and previous pointers for doubly linked list of
327 addresses per software interface. */
328 u32 next_this_sw_interface;
329 u32 prev_this_sw_interface;
330 } ip_interface_address_t;
335 IP_LOCAL_NEXT_UDP_LOOKUP,
340 struct ip_lookup_main_t;
342 typedef void (* ip_add_del_adjacency_callback_t) (struct ip_lookup_main_t * lm,
344 ip_adjacency_t * adj,
348 vnet_config_main_t config_main;
350 u32 * config_index_by_sw_if_index;
353 typedef struct ip_lookup_main_t {
354 /* Adjacency heap. */
355 ip_adjacency_t * adjacency_heap;
357 /* Adjacency packet/byte counters indexed by adjacency index. */
358 vlib_combined_counter_main_t adjacency_counters;
360 /* Heap of (next hop, weight) blocks. Sorted by next hop. */
361 ip_multipath_next_hop_t * next_hop_heap;
363 /* Indexed by heap_handle from ip_adjacency_t. */
364 ip_multipath_adjacency_t * multipath_adjacencies;
366 /* Adjacency by signature hash */
367 uword * adj_index_by_signature;
369 /* Temporary vectors for looking up next hops in hash. */
370 ip_multipath_next_hop_t * next_hop_hash_lookup_key;
371 ip_multipath_next_hop_t * next_hop_hash_lookup_key_normalized;
373 /* Hash table mapping normalized next hops and weights
374 to multipath adjacency index. */
375 uword * multipath_adjacency_by_next_hops;
377 u32 * adjacency_remap_table;
378 u32 n_adjacency_remaps;
380 /* If average error per adjacency is less than this threshold adjacency block
382 f64 multipath_next_hop_error_tolerance;
384 /* Adjacency index for routing table misses, local punts, and drops. */
385 u32 miss_adj_index, drop_adj_index, local_adj_index;
387 /* Miss adjacency is always first in adjacency table. */
388 #define IP_LOOKUP_MISS_ADJ_INDEX 0
390 ip_add_del_adjacency_callback_t * add_del_adjacency_callbacks;
392 /* Pool of addresses that are assigned to interfaces. */
393 ip_interface_address_t * if_address_pool;
395 /* Hash table mapping address to index in interface address pool. */
396 mhash_t address_to_if_address_index;
398 /* Head of doubly linked list of interface addresses for each software interface.
399 ~0 means this interface has no address. */
400 u32 * if_address_pool_index_by_sw_if_index;
402 /* First table index to use for this interface, ~0 => none */
403 u32 * classify_table_index_by_sw_if_index;
405 /* rx/tx interface/feature configuration. */
406 ip_config_main_t rx_config_mains[VNET_N_CAST], tx_config_main;
408 /* Number of bytes in a fib result. Must be at least
409 sizeof (uword). First word is always adjacency index. */
410 u32 fib_result_n_bytes, fib_result_n_words;
412 format_function_t * format_fib_result;
414 /* 1 for ip6; 0 for ip4. */
417 /* Either format_ip4_address_and_length or format_ip6_address_and_length. */
418 format_function_t * format_address_and_length;
420 /* Table mapping ip protocol to ip[46]-local node next index. */
421 u8 local_next_by_ip_protocol[256];
423 /* IP_BUILTIN_PROTOCOL_{TCP,UDP,ICMP,OTHER} by protocol in IP header. */
424 u8 builtin_protocol_by_ip_protocol[256];
427 always_inline ip_adjacency_t *
428 ip_get_adjacency (ip_lookup_main_t * lm,
431 ip_adjacency_t * adj;
433 adj = vec_elt_at_index (lm->adjacency_heap, adj_index);
435 ASSERT (adj->heap_handle != ~0);
440 #define ip_prefetch_adjacency(lm,adj_index,type) \
442 ip_adjacency_t * _adj = (lm)->adjacency_heap + (adj_index); \
443 CLIB_PREFETCH (_adj, sizeof (_adj[0]), type); \
447 ip_register_add_del_adjacency_callback(ip_lookup_main_t * lm,
448 ip_add_del_adjacency_callback_t cb)
450 vec_add1(lm->add_del_adjacency_callbacks, cb);
454 ip_call_add_del_adjacency_callbacks (ip_lookup_main_t * lm, u32 adj_index, u32 is_del)
456 ip_adjacency_t * adj;
458 adj = ip_get_adjacency (lm, adj_index);
459 for (i = 0; i < vec_len (lm->add_del_adjacency_callbacks); i++)
460 lm->add_del_adjacency_callbacks[i] (lm, adj_index, adj, is_del);
463 /* Create new block of given number of contiguous adjacencies. */
465 ip_add_adjacency (ip_lookup_main_t * lm,
466 ip_adjacency_t * adj,
468 u32 * adj_index_result);
470 void ip_del_adjacency (ip_lookup_main_t * lm, u32 adj_index);
472 ip_update_adjacency (ip_lookup_main_t * lm,
474 ip_adjacency_t * copy_adj);
477 ip_adjacency_is_multipath(ip_lookup_main_t * lm, u32 adj_index)
479 if (!vec_len(lm->multipath_adjacencies))
482 if (vec_len(lm->multipath_adjacencies) < adj_index - 1)
486 return (lm->multipath_adjacencies[adj_index].adj_index == adj_index &&
487 lm->multipath_adjacencies[adj_index].n_adj_in_block > 0);
491 ip_multipath_adjacency_free (ip_lookup_main_t * lm,
492 ip_multipath_adjacency_t * a);
495 ip_multipath_adjacency_add_del_next_hop (ip_lookup_main_t * lm,
497 u32 old_mp_adj_index,
498 u32 next_hop_adj_index,
500 u32 * new_mp_adj_index);
503 ip_interface_address_add_del (ip_lookup_main_t * lm,
510 always_inline ip_interface_address_t *
511 ip_get_interface_address (ip_lookup_main_t * lm, void * addr_fib)
513 uword * p = mhash_get (&lm->address_to_if_address_index, addr_fib);
514 return p ? pool_elt_at_index (lm->if_address_pool, p[0]) : 0;
518 ip_interface_address_get_address (ip_lookup_main_t * lm, ip_interface_address_t * a)
519 { return mhash_key_to_mem (&lm->address_to_if_address_index, a->address_key); }
521 always_inline ip_interface_address_t *
522 ip_interface_address_for_packet (ip_lookup_main_t * lm, vlib_buffer_t * b, u32 sw_if_index)
524 ip_adjacency_t * adj;
525 u32 if_address_index;
527 adj = ip_get_adjacency (lm, vnet_buffer (b)->ip.adj_index[VLIB_TX]);
529 ASSERT (adj->lookup_next_index == IP_LOOKUP_NEXT_ARP
530 || adj->lookup_next_index == IP_LOOKUP_NEXT_LOCAL);
531 if_address_index = adj->if_address_index;
532 if_address_index = (if_address_index == ~0 ?
533 vec_elt (lm->if_address_pool_index_by_sw_if_index, sw_if_index)
536 return (if_address_index != ~0)?pool_elt_at_index (lm->if_address_pool, if_address_index):NULL;
539 #define foreach_ip_interface_address(lm,a,sw_if_index,loop,body) \
541 vnet_main_t *_vnm = vnet_get_main(); \
542 u32 _sw_if_index = sw_if_index; \
543 vnet_sw_interface_t *_swif; \
544 _swif = vnet_get_sw_interface (_vnm, _sw_if_index); \
547 * Loop => honor unnumbered interface addressing. \
549 if (loop && _swif->flags & VNET_SW_INTERFACE_FLAG_UNNUMBERED) \
550 _sw_if_index = _swif->unnumbered_sw_if_index; \
552 (vec_len((lm)->if_address_pool_index_by_sw_if_index) \
554 ? vec_elt ((lm)->if_address_pool_index_by_sw_if_index, \
555 (_sw_if_index)) : (u32)~0; \
556 ip_interface_address_t * _a; \
559 _a = pool_elt_at_index ((lm)->if_address_pool, _ia); \
560 _ia = _a->next_this_sw_interface; \
566 void ip_lookup_init (ip_lookup_main_t * lm, u32 ip_lookup_node_index);
568 #endif /* included_ip_lookup_h */