xref: /linux/net/netfilter/nft_set_bitmap.c (revision 8be4d31cb8aaeea27bde4b7ddb26e28a89062ebf)
1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3  * Copyright (c) 2017 Pablo Neira Ayuso <pablo@netfilter.org>
4  */
5 
6 #include <linux/kernel.h>
7 #include <linux/init.h>
8 #include <linux/module.h>
9 #include <linux/list.h>
10 #include <linux/netlink.h>
11 #include <linux/netfilter.h>
12 #include <linux/netfilter/nf_tables.h>
13 #include <net/netfilter/nf_tables_core.h>
14 
15 struct nft_bitmap_elem {
16 	struct nft_elem_priv	priv;
17 	struct list_head	head;
18 	struct nft_set_ext	ext;
19 };
20 
21 /* This bitmap uses two bits to represent one element. These two bits determine
22  * the element state in the current and the future generation.
23  *
24  * An element can be in three states. The generation cursor is represented using
25  * the ^ character, note that this cursor shifts on every successful transaction.
26  * If no transaction is going on, we observe all elements are in the following
27  * state:
28  *
29  * 11 = this element is active in the current generation. In case of no updates,
30  * ^    it stays active in the next generation.
31  * 00 = this element is inactive in the current generation. In case of no
32  * ^    updates, it stays inactive in the next generation.
33  *
34  * On transaction handling, we observe these two temporary states:
35  *
36  * 01 = this element is inactive in the current generation and it becomes active
37  * ^    in the next one. This happens when the element is inserted but commit
38  *      path has not yet been executed yet, so activation is still pending. On
39  *      transaction abortion, the element is removed.
40  * 10 = this element is active in the current generation and it becomes inactive
41  * ^    in the next one. This happens when the element is deactivated but commit
42  *      path has not yet been executed yet, so removal is still pending. On
43  *      transaction abortion, the next generation bit is reset to go back to
44  *      restore its previous state.
45  */
46 struct nft_bitmap {
47 	struct	list_head	list;
48 	u16			bitmap_size;
49 	u8			bitmap[];
50 };
51 
nft_bitmap_location(const struct nft_set * set,const void * key,u32 * idx,u32 * off)52 static inline void nft_bitmap_location(const struct nft_set *set,
53 				       const void *key,
54 				       u32 *idx, u32 *off)
55 {
56 	u32 k;
57 
58 	if (set->klen == 2)
59 		k = *(u16 *)key;
60 	else
61 		k = *(u8 *)key;
62 	k <<= 1;
63 
64 	*idx = k / BITS_PER_BYTE;
65 	*off = k % BITS_PER_BYTE;
66 }
67 
68 /* Fetch the two bits that represent the element and check if it is active based
69  * on the generation mask.
70  */
71 static inline bool
nft_bitmap_active(const u8 * bitmap,u32 idx,u32 off,u8 genmask)72 nft_bitmap_active(const u8 *bitmap, u32 idx, u32 off, u8 genmask)
73 {
74 	return (bitmap[idx] & (0x3 << off)) & (genmask << off);
75 }
76 
77 INDIRECT_CALLABLE_SCOPE
78 const struct nft_set_ext *
nft_bitmap_lookup(const struct net * net,const struct nft_set * set,const u32 * key)79 nft_bitmap_lookup(const struct net *net, const struct nft_set *set,
80 		  const u32 *key)
81 {
82 	const struct nft_bitmap *priv = nft_set_priv(set);
83 	static const struct nft_set_ext found;
84 	u8 genmask = nft_genmask_cur(net);
85 	u32 idx, off;
86 
87 	nft_bitmap_location(set, key, &idx, &off);
88 
89 	if (nft_bitmap_active(priv->bitmap, idx, off, genmask))
90 		return &found;
91 
92 	return NULL;
93 }
94 
95 static struct nft_bitmap_elem *
nft_bitmap_elem_find(const struct net * net,const struct nft_set * set,struct nft_bitmap_elem * this,u8 genmask)96 nft_bitmap_elem_find(const struct net *net,
97 		     const struct nft_set *set, struct nft_bitmap_elem *this,
98 		     u8 genmask)
99 {
100 	const struct nft_bitmap *priv = nft_set_priv(set);
101 	struct nft_bitmap_elem *be;
102 
103 	list_for_each_entry_rcu(be, &priv->list, head,
104 				lockdep_is_held(&nft_pernet(net)->commit_mutex)) {
105 		if (memcmp(nft_set_ext_key(&be->ext),
106 			   nft_set_ext_key(&this->ext), set->klen) ||
107 		    !nft_set_elem_active(&be->ext, genmask))
108 			continue;
109 
110 		return be;
111 	}
112 	return NULL;
113 }
114 
115 static struct nft_elem_priv *
nft_bitmap_get(const struct net * net,const struct nft_set * set,const struct nft_set_elem * elem,unsigned int flags)116 nft_bitmap_get(const struct net *net, const struct nft_set *set,
117 	       const struct nft_set_elem *elem, unsigned int flags)
118 {
119 	const struct nft_bitmap *priv = nft_set_priv(set);
120 	u8 genmask = nft_genmask_cur(net);
121 	struct nft_bitmap_elem *be;
122 
123 	list_for_each_entry_rcu(be, &priv->list, head) {
124 		if (memcmp(nft_set_ext_key(&be->ext), elem->key.val.data, set->klen) ||
125 		    !nft_set_elem_active(&be->ext, genmask))
126 			continue;
127 
128 		return &be->priv;
129 	}
130 	return ERR_PTR(-ENOENT);
131 }
132 
nft_bitmap_insert(const struct net * net,const struct nft_set * set,const struct nft_set_elem * elem,struct nft_elem_priv ** elem_priv)133 static int nft_bitmap_insert(const struct net *net, const struct nft_set *set,
134 			     const struct nft_set_elem *elem,
135 			     struct nft_elem_priv **elem_priv)
136 {
137 	struct nft_bitmap_elem *new = nft_elem_priv_cast(elem->priv), *be;
138 	struct nft_bitmap *priv = nft_set_priv(set);
139 	u8 genmask = nft_genmask_next(net);
140 	u32 idx, off;
141 
142 	be = nft_bitmap_elem_find(net, set, new, genmask);
143 	if (be) {
144 		*elem_priv = &be->priv;
145 		return -EEXIST;
146 	}
147 
148 	nft_bitmap_location(set, nft_set_ext_key(&new->ext), &idx, &off);
149 	/* Enter 01 state. */
150 	priv->bitmap[idx] |= (genmask << off);
151 	list_add_tail_rcu(&new->head, &priv->list);
152 
153 	return 0;
154 }
155 
nft_bitmap_remove(const struct net * net,const struct nft_set * set,struct nft_elem_priv * elem_priv)156 static void nft_bitmap_remove(const struct net *net, const struct nft_set *set,
157 			      struct nft_elem_priv *elem_priv)
158 {
159 	struct nft_bitmap_elem *be = nft_elem_priv_cast(elem_priv);
160 	struct nft_bitmap *priv = nft_set_priv(set);
161 	u8 genmask = nft_genmask_next(net);
162 	u32 idx, off;
163 
164 	nft_bitmap_location(set, nft_set_ext_key(&be->ext), &idx, &off);
165 	/* Enter 00 state. */
166 	priv->bitmap[idx] &= ~(genmask << off);
167 	list_del_rcu(&be->head);
168 }
169 
nft_bitmap_activate(const struct net * net,const struct nft_set * set,struct nft_elem_priv * elem_priv)170 static void nft_bitmap_activate(const struct net *net,
171 				const struct nft_set *set,
172 				struct nft_elem_priv *elem_priv)
173 {
174 	struct nft_bitmap_elem *be = nft_elem_priv_cast(elem_priv);
175 	struct nft_bitmap *priv = nft_set_priv(set);
176 	u8 genmask = nft_genmask_next(net);
177 	u32 idx, off;
178 
179 	nft_bitmap_location(set, nft_set_ext_key(&be->ext), &idx, &off);
180 	/* Enter 11 state. */
181 	priv->bitmap[idx] |= (genmask << off);
182 	nft_clear(net, &be->ext);
183 }
184 
nft_bitmap_flush(const struct net * net,const struct nft_set * set,struct nft_elem_priv * elem_priv)185 static void nft_bitmap_flush(const struct net *net,
186 			     const struct nft_set *set,
187 			     struct nft_elem_priv *elem_priv)
188 {
189 	struct nft_bitmap_elem *be = nft_elem_priv_cast(elem_priv);
190 	struct nft_bitmap *priv = nft_set_priv(set);
191 	u8 genmask = nft_genmask_next(net);
192 	u32 idx, off;
193 
194 	nft_bitmap_location(set, nft_set_ext_key(&be->ext), &idx, &off);
195 	/* Enter 10 state, similar to deactivation. */
196 	priv->bitmap[idx] &= ~(genmask << off);
197 	nft_set_elem_change_active(net, set, &be->ext);
198 }
199 
200 static struct nft_elem_priv *
nft_bitmap_deactivate(const struct net * net,const struct nft_set * set,const struct nft_set_elem * elem)201 nft_bitmap_deactivate(const struct net *net, const struct nft_set *set,
202 		      const struct nft_set_elem *elem)
203 {
204 	struct nft_bitmap_elem *this = nft_elem_priv_cast(elem->priv), *be;
205 	struct nft_bitmap *priv = nft_set_priv(set);
206 	u8 genmask = nft_genmask_next(net);
207 	u32 idx, off;
208 
209 	nft_bitmap_location(set, elem->key.val.data, &idx, &off);
210 
211 	be = nft_bitmap_elem_find(net, set, this, genmask);
212 	if (!be)
213 		return NULL;
214 
215 	/* Enter 10 state. */
216 	priv->bitmap[idx] &= ~(genmask << off);
217 	nft_set_elem_change_active(net, set, &be->ext);
218 
219 	return &be->priv;
220 }
221 
nft_bitmap_walk(const struct nft_ctx * ctx,struct nft_set * set,struct nft_set_iter * iter)222 static void nft_bitmap_walk(const struct nft_ctx *ctx,
223 			    struct nft_set *set,
224 			    struct nft_set_iter *iter)
225 {
226 	const struct nft_bitmap *priv = nft_set_priv(set);
227 	struct nft_bitmap_elem *be;
228 
229 	list_for_each_entry_rcu(be, &priv->list, head) {
230 		if (iter->count < iter->skip)
231 			goto cont;
232 
233 		iter->err = iter->fn(ctx, set, iter, &be->priv);
234 
235 		if (iter->err < 0)
236 			return;
237 cont:
238 		iter->count++;
239 	}
240 }
241 
242 /* The bitmap size is pow(2, key length in bits) / bits per byte. This is
243  * multiplied by two since each element takes two bits. For 8 bit keys, the
244  * bitmap consumes 66 bytes. For 16 bit keys, 16388 bytes.
245  */
nft_bitmap_size(u32 klen)246 static inline u32 nft_bitmap_size(u32 klen)
247 {
248 	return ((2 << ((klen * BITS_PER_BYTE) - 1)) / BITS_PER_BYTE) << 1;
249 }
250 
nft_bitmap_total_size(u32 klen)251 static inline u64 nft_bitmap_total_size(u32 klen)
252 {
253 	return sizeof(struct nft_bitmap) + nft_bitmap_size(klen);
254 }
255 
nft_bitmap_privsize(const struct nlattr * const nla[],const struct nft_set_desc * desc)256 static u64 nft_bitmap_privsize(const struct nlattr * const nla[],
257 			       const struct nft_set_desc *desc)
258 {
259 	u32 klen = ntohl(nla_get_be32(nla[NFTA_SET_KEY_LEN]));
260 
261 	return nft_bitmap_total_size(klen);
262 }
263 
nft_bitmap_init(const struct nft_set * set,const struct nft_set_desc * desc,const struct nlattr * const nla[])264 static int nft_bitmap_init(const struct nft_set *set,
265 			   const struct nft_set_desc *desc,
266 			   const struct nlattr * const nla[])
267 {
268 	struct nft_bitmap *priv = nft_set_priv(set);
269 
270 	BUILD_BUG_ON(offsetof(struct nft_bitmap_elem, priv) != 0);
271 
272 	INIT_LIST_HEAD(&priv->list);
273 	priv->bitmap_size = nft_bitmap_size(set->klen);
274 
275 	return 0;
276 }
277 
nft_bitmap_destroy(const struct nft_ctx * ctx,const struct nft_set * set)278 static void nft_bitmap_destroy(const struct nft_ctx *ctx,
279 			       const struct nft_set *set)
280 {
281 	struct nft_bitmap *priv = nft_set_priv(set);
282 	struct nft_bitmap_elem *be, *n;
283 
284 	list_for_each_entry_safe(be, n, &priv->list, head)
285 		nf_tables_set_elem_destroy(ctx, set, &be->priv);
286 }
287 
nft_bitmap_estimate(const struct nft_set_desc * desc,u32 features,struct nft_set_estimate * est)288 static bool nft_bitmap_estimate(const struct nft_set_desc *desc, u32 features,
289 				struct nft_set_estimate *est)
290 {
291 	/* Make sure bitmaps we don't get bitmaps larger than 16 Kbytes. */
292 	if (desc->klen > 2)
293 		return false;
294 	else if (desc->expr)
295 		return false;
296 
297 	est->size   = nft_bitmap_total_size(desc->klen);
298 	est->lookup = NFT_SET_CLASS_O_1;
299 	est->space  = NFT_SET_CLASS_O_1;
300 
301 	return true;
302 }
303 
304 const struct nft_set_type nft_set_bitmap_type = {
305 	.ops		= {
306 		.privsize	= nft_bitmap_privsize,
307 		.elemsize	= offsetof(struct nft_bitmap_elem, ext),
308 		.estimate	= nft_bitmap_estimate,
309 		.init		= nft_bitmap_init,
310 		.destroy	= nft_bitmap_destroy,
311 		.insert		= nft_bitmap_insert,
312 		.remove		= nft_bitmap_remove,
313 		.deactivate	= nft_bitmap_deactivate,
314 		.flush		= nft_bitmap_flush,
315 		.activate	= nft_bitmap_activate,
316 		.lookup		= nft_bitmap_lookup,
317 		.walk		= nft_bitmap_walk,
318 		.get		= nft_bitmap_get,
319 	},
320 };
321