2 * Copyright (c) 2008-2014 Patrick McHardy <kaber@trash.net>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
8 * Development of this code funded by Astaro AG (http://www.astaro.com/)
11 #include <linux/kernel.h>
12 #include <linux/init.h>
13 #include <linux/module.h>
14 #include <linux/list.h>
15 #include <linux/log2.h>
16 #include <linux/jhash.h>
17 #include <linux/netlink.h>
18 #include <linux/rhashtable.h>
19 #include <linux/netfilter.h>
20 #include <linux/netfilter/nf_tables.h>
21 #include <net/netfilter/nf_tables.h>
23 /* We target a hash table size of 4, element hint is 75% of final size */
24 #define NFT_HASH_ELEMENT_HINT 3
26 struct nft_hash_elem
{
27 struct rhash_head node
;
29 struct nft_data data
[];
32 static bool nft_hash_lookup(const struct nft_set
*set
,
33 const struct nft_data
*key
,
34 struct nft_data
*data
)
36 struct rhashtable
*priv
= nft_set_priv(set
);
37 const struct nft_hash_elem
*he
;
39 he
= rhashtable_lookup(priv
, key
);
40 if (he
&& set
->flags
& NFT_SET_MAP
)
41 nft_data_copy(data
, he
->data
);
46 static int nft_hash_insert(const struct nft_set
*set
,
47 const struct nft_set_elem
*elem
)
49 struct rhashtable
*priv
= nft_set_priv(set
);
50 struct nft_hash_elem
*he
;
57 if (set
->flags
& NFT_SET_MAP
)
58 size
+= sizeof(he
->data
[0]);
60 he
= kzalloc(size
, GFP_KERNEL
);
64 nft_data_copy(&he
->key
, &elem
->key
);
65 if (set
->flags
& NFT_SET_MAP
)
66 nft_data_copy(he
->data
, &elem
->data
);
68 rhashtable_insert(priv
, &he
->node
);
73 static void nft_hash_elem_destroy(const struct nft_set
*set
,
74 struct nft_hash_elem
*he
)
76 nft_data_uninit(&he
->key
, NFT_DATA_VALUE
);
77 if (set
->flags
& NFT_SET_MAP
)
78 nft_data_uninit(he
->data
, set
->dtype
);
82 static void nft_hash_remove(const struct nft_set
*set
,
83 const struct nft_set_elem
*elem
)
85 struct rhashtable
*priv
= nft_set_priv(set
);
87 rhashtable_remove(priv
, elem
->cookie
);
92 struct nft_compare_arg
{
93 const struct nft_set
*set
;
94 struct nft_set_elem
*elem
;
97 static bool nft_hash_compare(void *ptr
, void *arg
)
99 struct nft_hash_elem
*he
= ptr
;
100 struct nft_compare_arg
*x
= arg
;
102 if (!nft_data_cmp(&he
->key
, &x
->elem
->key
, x
->set
->klen
)) {
103 x
->elem
->cookie
= he
;
105 if (x
->set
->flags
& NFT_SET_MAP
)
106 nft_data_copy(&x
->elem
->data
, he
->data
);
114 static int nft_hash_get(const struct nft_set
*set
, struct nft_set_elem
*elem
)
116 struct rhashtable
*priv
= nft_set_priv(set
);
117 struct nft_compare_arg arg
= {
122 if (rhashtable_lookup_compare(priv
, &elem
->key
,
123 &nft_hash_compare
, &arg
))
129 static void nft_hash_walk(const struct nft_ctx
*ctx
, const struct nft_set
*set
,
130 struct nft_set_iter
*iter
)
132 struct rhashtable
*priv
= nft_set_priv(set
);
133 const struct nft_hash_elem
*he
;
134 struct rhashtable_iter hti
;
135 struct nft_set_elem elem
;
138 err
= rhashtable_walk_init(priv
, &hti
);
143 err
= rhashtable_walk_start(&hti
);
144 if (err
&& err
!= -EAGAIN
) {
149 while ((he
= rhashtable_walk_next(&hti
))) {
152 if (err
!= -EAGAIN
) {
158 if (iter
->count
< iter
->skip
)
161 memcpy(&elem
.key
, &he
->key
, sizeof(elem
.key
));
162 if (set
->flags
& NFT_SET_MAP
)
163 memcpy(&elem
.data
, he
->data
, sizeof(elem
.data
));
166 iter
->err
= iter
->fn(ctx
, set
, iter
, &elem
);
175 rhashtable_walk_stop(&hti
);
176 rhashtable_walk_exit(&hti
);
179 static unsigned int nft_hash_privsize(const struct nlattr
* const nla
[])
181 return sizeof(struct rhashtable
);
184 static int nft_hash_init(const struct nft_set
*set
,
185 const struct nft_set_desc
*desc
,
186 const struct nlattr
* const tb
[])
188 struct rhashtable
*priv
= nft_set_priv(set
);
189 struct rhashtable_params params
= {
190 .nelem_hint
= desc
->size
? : NFT_HASH_ELEMENT_HINT
,
191 .head_offset
= offsetof(struct nft_hash_elem
, node
),
192 .key_offset
= offsetof(struct nft_hash_elem
, key
),
193 .key_len
= set
->klen
,
197 return rhashtable_init(priv
, ¶ms
);
200 static void nft_hash_destroy(const struct nft_set
*set
)
202 struct rhashtable
*priv
= nft_set_priv(set
);
203 const struct bucket_table
*tbl
;
204 struct nft_hash_elem
*he
;
205 struct rhash_head
*pos
, *next
;
208 /* Stop an eventual async resizing */
209 priv
->being_destroyed
= true;
210 mutex_lock(&priv
->mutex
);
212 tbl
= rht_dereference(priv
->tbl
, priv
);
213 for (i
= 0; i
< tbl
->size
; i
++) {
214 rht_for_each_entry_safe(he
, pos
, next
, tbl
, i
, node
)
215 nft_hash_elem_destroy(set
, he
);
217 mutex_unlock(&priv
->mutex
);
219 rhashtable_destroy(priv
);
222 static bool nft_hash_estimate(const struct nft_set_desc
*desc
, u32 features
,
223 struct nft_set_estimate
*est
)
227 esize
= sizeof(struct nft_hash_elem
);
228 if (features
& NFT_SET_MAP
)
229 esize
+= FIELD_SIZEOF(struct nft_hash_elem
, data
[0]);
232 est
->size
= sizeof(struct rhashtable
) +
233 roundup_pow_of_two(desc
->size
* 4 / 3) *
234 sizeof(struct nft_hash_elem
*) +
237 /* Resizing happens when the load drops below 30% or goes
238 * above 75%. The average of 52.5% load (approximated by 50%)
239 * is used for the size estimation of the hash buckets,
240 * meaning we calculate two buckets per element.
242 est
->size
= esize
+ 2 * sizeof(struct nft_hash_elem
*);
245 est
->class = NFT_SET_CLASS_O_1
;
250 static struct nft_set_ops nft_hash_ops __read_mostly
= {
251 .privsize
= nft_hash_privsize
,
252 .estimate
= nft_hash_estimate
,
253 .init
= nft_hash_init
,
254 .destroy
= nft_hash_destroy
,
256 .insert
= nft_hash_insert
,
257 .remove
= nft_hash_remove
,
258 .lookup
= nft_hash_lookup
,
259 .walk
= nft_hash_walk
,
260 .features
= NFT_SET_MAP
,
261 .owner
= THIS_MODULE
,
264 static int __init
nft_hash_module_init(void)
266 return nft_register_set(&nft_hash_ops
);
269 static void __exit
nft_hash_module_exit(void)
271 nft_unregister_set(&nft_hash_ops
);
274 module_init(nft_hash_module_init
);
275 module_exit(nft_hash_module_exit
);
277 MODULE_LICENSE("GPL");
278 MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
279 MODULE_ALIAS_NFT_SET();