blob: 438eb2405bf2dc2472dace6e54d675568d71500e [file] [log] [blame]
Neale Ranns0bfe5d82016-08-25 15:29:12 +01001/*
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 The IPv4 FIB
17 *
18 * FIBs are composed of two prefix data-bases (akak tables). The non-forwarding
19 * table contains all the routes that the control plane has programmed, the
20 * forwarding table contains the sub-set of those routes that can be used to
21 * forward packets.
22 * In the IPv4 FIB the non-forwarding table is an array of hash tables indexed
23 * by mask length, the forwarding table is an mtrie
24 *
25 * This IPv4 FIB is used by the protocol independent FIB. So directly using
26 * this APIs in client code is not encouraged. However, this IPv4 FIB can be
27 * used if all the client wants is an IPv4 prefix data-base
28 */
29
30#ifndef __IP4_FIB_H__
31#define __IP4_FIB_H__
32
33#include <vlib/vlib.h>
34#include <vnet/ip/ip.h>
35#include <vnet/fib/fib_entry.h>
36#include <vnet/fib/fib_table.h>
Neale Rannsa3af3372017-03-28 03:49:52 -070037#include <vnet/ip/ip4_mtrie.h>
38
39typedef struct ip4_fib_t_
40{
41 /**
42 * Mtrie for fast lookups. Hash is used to maintain overlapping prefixes.
43 * First member so it's in the first cacheline.
44 */
45 ip4_fib_mtrie_t mtrie;
46
47 /* Hash table for each prefix length mapping. */
48 uword *fib_entry_by_dst_address[33];
49
50 /* Table ID (hash key) for this FIB. */
51 u32 table_id;
52
53 /* Index into FIB vector. */
54 u32 index;
55
Neale Rannsa3af3372017-03-28 03:49:52 -070056 /* N-tuple classifier indices */
57 u32 fwd_classify_table_index;
58 u32 rev_classify_table_index;
59
60} ip4_fib_t;
Neale Ranns0bfe5d82016-08-25 15:29:12 +010061
62extern fib_node_index_t ip4_fib_table_lookup(const ip4_fib_t *fib,
63 const ip4_address_t *addr,
64 u32 len);
65extern fib_node_index_t ip4_fib_table_lookup_exact_match(const ip4_fib_t *fib,
66 const ip4_address_t *addr,
67 u32 len);
68
69extern void ip4_fib_table_entry_remove(ip4_fib_t *fib,
70 const ip4_address_t *addr,
71 u32 len);
72
73extern void ip4_fib_table_entry_insert(ip4_fib_t *fib,
74 const ip4_address_t *addr,
75 u32 len,
76 fib_node_index_t fib_entry_index);
Neale Rannsa3af3372017-03-28 03:49:52 -070077extern void ip4_fib_table_destroy(u32 fib_index);
Neale Ranns0bfe5d82016-08-25 15:29:12 +010078
79extern void ip4_fib_table_fwding_dpo_update(ip4_fib_t *fib,
80 const ip4_address_t *addr,
81 u32 len,
82 const dpo_id_t *dpo);
83
84extern void ip4_fib_table_fwding_dpo_remove(ip4_fib_t *fib,
85 const ip4_address_t *addr,
86 u32 len,
Neale Rannsa3af3372017-03-28 03:49:52 -070087 const dpo_id_t *dpo,
88 fib_node_index_t cover_index);
Neale Ranns0bfe5d82016-08-25 15:29:12 +010089extern u32 ip4_fib_table_lookup_lb (ip4_fib_t *fib,
90 const ip4_address_t * dst);
91
92/**
Neale Ranns32e1c012016-11-22 17:07:28 +000093 * @brief Walk all entries in a FIB table
94 * N.B: This is NOT safe to deletes. If you need to delete walk the whole
95 * table and store elements in a vector, then delete the elements
96 */
97extern void ip4_fib_table_walk(ip4_fib_t *fib,
98 fib_table_walk_fn_t fn,
99 void *ctx);
100
101/**
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100102 * @brief Get the FIB at the given index
103 */
104static inline ip4_fib_t *
105ip4_fib_get (u32 index)
106{
Neale Rannsa3af3372017-03-28 03:49:52 -0700107 return (pool_elt_at_index(ip4_main.v4_fibs, index));
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100108}
109
110always_inline u32
111ip4_fib_lookup (ip4_main_t * im, u32 sw_if_index, ip4_address_t * dst)
112{
113 return (ip4_fib_table_lookup_lb(
114 ip4_fib_get(vec_elt (im->fib_index_by_sw_if_index, sw_if_index)),
115 dst));
116}
117
118/**
119 * @brief Get or create an IPv4 fib.
120 *
121 * Get or create an IPv4 fib with the provided table ID.
122 *
123 * @param table_id
124 * When set to \c ~0, an arbitrary and unused fib ID is picked
125 * and can be retrieved with \c ret->table_id.
126 * Otherwise, the fib ID to be used to retrieve or create the desired fib.
127 * @returns A pointer to the retrieved or created fib.
128 *
129 */
Neale Ranns15002542017-09-10 04:39:11 -0700130extern u32 ip4_fib_table_find_or_create_and_lock(u32 table_id,
131 fib_source_t src);
132extern u32 ip4_fib_table_create_and_lock(fib_source_t src);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100133
Neale Rannsc87aafa2017-11-29 00:59:31 -0800134extern u8 *format_ip4_fib_table_memory(u8 * s, va_list * args);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100135
136static inline
137u32 ip4_fib_index_from_table_id (u32 table_id)
138{
139 ip4_main_t * im = &ip4_main;
140 uword * p;
141
142 p = hash_get (im->fib_index_by_table_id, table_id);
143 if (!p)
144 return ~0;
145
146 return p[0];
147}
148
149extern u32 ip4_fib_table_get_index_for_sw_if_index(u32 sw_if_index);
150
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100151always_inline index_t
152ip4_fib_forwarding_lookup (u32 fib_index,
153 const ip4_address_t * addr)
154{
155 ip4_fib_mtrie_leaf_t leaf;
156 ip4_fib_mtrie_t * mtrie;
157
158 mtrie = &ip4_fib_get(fib_index)->mtrie;
159
Neale Ranns04a75e32017-03-23 06:46:01 -0700160 leaf = ip4_fib_mtrie_lookup_step_one (mtrie, addr);
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100161 leaf = ip4_fib_mtrie_lookup_step (mtrie, leaf, addr, 2);
162 leaf = ip4_fib_mtrie_lookup_step (mtrie, leaf, addr, 3);
163
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100164 return (ip4_fib_mtrie_leaf_get_adj_index(leaf));
165}
166
167
168#endif
169