xref: /netbsd-src/sys/net/npf/npf_portmap.c (revision 3579f73695076c7aaf27a6751692891020a9e20b)
1dadc88e3Srmind /*-
2dadc88e3Srmind  * Copyright (c) 2019 Mindaugas Rasiukevicius <rmind at noxt eu>
3dadc88e3Srmind  * All rights reserved.
4dadc88e3Srmind  *
5dadc88e3Srmind  * Redistribution and use in source and binary forms, with or without
6dadc88e3Srmind  * modification, are permitted provided that the following conditions
7dadc88e3Srmind  * are met:
8dadc88e3Srmind  * 1. Redistributions of source code must retain the above copyright
9dadc88e3Srmind  *    notice, this list of conditions and the following disclaimer.
10dadc88e3Srmind  * 2. Redistributions in binary form must reproduce the above copyright
11dadc88e3Srmind  *    notice, this list of conditions and the following disclaimer in the
12dadc88e3Srmind  *    documentation and/or other materials provided with the distribution.
13dadc88e3Srmind  *
14dadc88e3Srmind  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15dadc88e3Srmind  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16dadc88e3Srmind  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17dadc88e3Srmind  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18dadc88e3Srmind  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19dadc88e3Srmind  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20dadc88e3Srmind  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21dadc88e3Srmind  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22dadc88e3Srmind  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23dadc88e3Srmind  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24dadc88e3Srmind  * SUCH DAMAGE.
25dadc88e3Srmind  */
26dadc88e3Srmind 
27dadc88e3Srmind /*
28dadc88e3Srmind  * NPF port map mechanism.
29dadc88e3Srmind  *
30dadc88e3Srmind  *	The port map is a bitmap used to track TCP/UDP ports used for
31dadc88e3Srmind  *	translation.  Port maps are per IP addresses, therefore multiple
32dadc88e3Srmind  *	NAT policies operating on the same IP address will share the
33dadc88e3Srmind  *	same port map.
34dadc88e3Srmind  */
35dadc88e3Srmind 
36dadc88e3Srmind #ifdef _KERNEL
37dadc88e3Srmind #include <sys/cdefs.h>
38*3579f736Sriastradh __KERNEL_RCSID(0, "$NetBSD: npf_portmap.c,v 1.7 2020/08/28 06:35:50 riastradh Exp $");
39dadc88e3Srmind 
40dadc88e3Srmind #include <sys/param.h>
41dadc88e3Srmind #include <sys/types.h>
42dadc88e3Srmind 
43dadc88e3Srmind #include <sys/atomic.h>
44dadc88e3Srmind #include <sys/bitops.h>
45dadc88e3Srmind #include <sys/kmem.h>
46dadc88e3Srmind #include <sys/mutex.h>
47dadc88e3Srmind #include <sys/cprng.h>
48dadc88e3Srmind #include <sys/thmap.h>
49dadc88e3Srmind #endif
50dadc88e3Srmind 
51dadc88e3Srmind #include "npf_impl.h"
52dadc88e3Srmind 
53dadc88e3Srmind /*
54dadc88e3Srmind  * Port map uses two-level bitmaps with compression to efficiently
55dadc88e3Srmind  * represent the maximum of 65536 (2^16) values.
56dadc88e3Srmind  *
57dadc88e3Srmind  * Level 0: 64 chunks each representing 1048 bits in two modes:
58dadc88e3Srmind  *
59dadc88e3Srmind  *	a) If PORTMAP_L1_TAG, then up to 5 values are packed in the
60dadc88e3Srmind  *	64-bit integer using 12 bits for each value, starting from the
61dadc88e3Srmind  *	most significant bits.  The four 4 least significant bits are
62dadc88e3Srmind  *	unused or reserved for pointer tagging.
63dadc88e3Srmind  *
64dadc88e3Srmind  *	b) If there are more than 5 values, then PORTMAP_L1_TAG is set
65dadc88e3Srmind  *	and the value serves as a pointer to the second level bitmap.
66dadc88e3Srmind  *
67dadc88e3Srmind  * Level 1: 16 chunks each representing 64 bits in plain uint64_t.
68dadc88e3Srmind  */
69dadc88e3Srmind 
70dadc88e3Srmind #define	PORTMAP_MAX_BITS	(65536U)
71dadc88e3Srmind #define	PORTMAP_MASK		(PORTMAP_MAX_BITS - 1)
72dadc88e3Srmind 
73dadc88e3Srmind #define	PORTMAP_L0_SHIFT	(10) // or 11
74dadc88e3Srmind #define	PORTMAP_L0_MASK		((1U << PORTMAP_L0_SHIFT) - 1)
75dadc88e3Srmind #define	PORTMAP_L0_WORDS	(PORTMAP_MAX_BITS >> PORTMAP_L0_SHIFT)
76dadc88e3Srmind 
77dadc88e3Srmind #define	PORTMAP_L1_SHIFT	(6)
78dadc88e3Srmind #define	PORTMAP_L1_MASK		((1U << PORTMAP_L1_SHIFT) - 1)
79dadc88e3Srmind #define	PORTMAP_L1_WORDS	\
80dadc88e3Srmind     ((PORTMAP_MAX_BITS / PORTMAP_L0_WORDS) >> PORTMAP_L1_SHIFT)
81dadc88e3Srmind 
82dadc88e3Srmind #define	PORTMAP_L1_TAG		(UINT64_C(1)) // use level 1
83dadc88e3Srmind #define	PORTMAP_L1_GET(p)	((void *)((uintptr_t)(p) & ~(uintptr_t)3))
84dadc88e3Srmind 
85dadc88e3Srmind CTASSERT(sizeof(uint64_t) >= sizeof(uintptr_t));
86dadc88e3Srmind 
87dadc88e3Srmind typedef struct {
88dadc88e3Srmind 	volatile uint64_t	bits1[PORTMAP_L1_WORDS];
89dadc88e3Srmind } bitmap_l1_t;
90dadc88e3Srmind 
91dadc88e3Srmind typedef struct bitmap {
92dadc88e3Srmind 	npf_addr_t		addr;
93dadc88e3Srmind 	volatile uint64_t	bits0[PORTMAP_L0_WORDS];
94dadc88e3Srmind 	LIST_ENTRY(bitmap)	entry;
95dadc88e3Srmind 	unsigned		addr_len;
96dadc88e3Srmind } bitmap_t;
97dadc88e3Srmind 
9804ad65d9Srmind #define	NPF_PORTMAP_MINPORT	1024
9904ad65d9Srmind #define	NPF_PORTMAP_MAXPORT	65535
10004ad65d9Srmind 
101dadc88e3Srmind struct npf_portmap {
102dadc88e3Srmind 	thmap_t	*		addr_map;
103dadc88e3Srmind 	LIST_HEAD(, bitmap)	bitmap_list;
104dadc88e3Srmind 	kmutex_t		list_lock;
105dadc88e3Srmind 	int			min_port;
106dadc88e3Srmind 	int			max_port;
10704ad65d9Srmind };
108dadc88e3Srmind 
109c52ca7f9Srmind static kmutex_t			portmap_lock;
110c52ca7f9Srmind 
111dadc88e3Srmind void
npf_portmap_sysinit(void)112fdedb349Sriastradh npf_portmap_sysinit(void)
113fdedb349Sriastradh {
114fdedb349Sriastradh 
115fdedb349Sriastradh 	mutex_init(&portmap_lock, MUTEX_DEFAULT, IPL_SOFTNET);
116fdedb349Sriastradh }
117fdedb349Sriastradh 
118fdedb349Sriastradh void
npf_portmap_sysfini(void)119fdedb349Sriastradh npf_portmap_sysfini(void)
120fdedb349Sriastradh {
121fdedb349Sriastradh 
122fdedb349Sriastradh 	mutex_destroy(&portmap_lock);
123fdedb349Sriastradh }
124fdedb349Sriastradh 
125fdedb349Sriastradh void
npf_portmap_init(npf_t * npf)126dadc88e3Srmind npf_portmap_init(npf_t *npf)
127dadc88e3Srmind {
12804ad65d9Srmind 	npf_portmap_t *pm = npf_portmap_create(
12904ad65d9Srmind 	    NPF_PORTMAP_MINPORT, NPF_PORTMAP_MAXPORT);
130dadc88e3Srmind 	npf_param_t param_map[] = {
131dadc88e3Srmind 		{
132dadc88e3Srmind 			"portmap.min_port",
13304ad65d9Srmind 			&pm->min_port,
13404ad65d9Srmind 			.default_val = NPF_PORTMAP_MINPORT,
135dadc88e3Srmind 			.min = 1024, .max = 65535
136dadc88e3Srmind 		},
137dadc88e3Srmind 		{
138dadc88e3Srmind 			"portmap.max_port",
13904ad65d9Srmind 			&pm->max_port,
140b899bfd9Srmind 			.default_val = 49151, // RFC 6335
141dadc88e3Srmind 			.min = 1024, .max = 65535
142dadc88e3Srmind 		}
143dadc88e3Srmind 	};
144fdedb349Sriastradh 
145dadc88e3Srmind 	npf_param_register(npf, param_map, __arraycount(param_map));
14604ad65d9Srmind 	npf->portmap = pm;
147dadc88e3Srmind }
148dadc88e3Srmind 
149dadc88e3Srmind void
npf_portmap_fini(npf_t * npf)150dadc88e3Srmind npf_portmap_fini(npf_t *npf)
151dadc88e3Srmind {
152fdedb349Sriastradh 
15304ad65d9Srmind 	npf_portmap_destroy(npf->portmap);
15404ad65d9Srmind 	npf->portmap = NULL; // diagnostic
15504ad65d9Srmind }
156dadc88e3Srmind 
15704ad65d9Srmind npf_portmap_t *
npf_portmap_create(int min_port,int max_port)15804ad65d9Srmind npf_portmap_create(int min_port, int max_port)
15904ad65d9Srmind {
16004ad65d9Srmind 	npf_portmap_t *pm;
161dadc88e3Srmind 
16204ad65d9Srmind 	pm = kmem_zalloc(sizeof(npf_portmap_t), KM_SLEEP);
16304ad65d9Srmind 	mutex_init(&pm->list_lock, MUTEX_DEFAULT, IPL_SOFTNET);
16404ad65d9Srmind 	pm->addr_map = thmap_create(0, NULL, THMAP_NOCOPY);
16504ad65d9Srmind 	pm->min_port = min_port;
16604ad65d9Srmind 	pm->max_port = max_port;
16704ad65d9Srmind 	return pm;
16804ad65d9Srmind }
16904ad65d9Srmind 
17004ad65d9Srmind void
npf_portmap_destroy(npf_portmap_t * pm)17104ad65d9Srmind npf_portmap_destroy(npf_portmap_t *pm)
17204ad65d9Srmind {
17304ad65d9Srmind 	npf_portmap_flush(pm);
174dadc88e3Srmind 	KASSERT(LIST_EMPTY(&pm->bitmap_list));
175dadc88e3Srmind 
176dadc88e3Srmind 	thmap_destroy(pm->addr_map);
177dadc88e3Srmind 	mutex_destroy(&pm->list_lock);
178dadc88e3Srmind 	kmem_free(pm, sizeof(npf_portmap_t));
179dadc88e3Srmind }
180dadc88e3Srmind 
181dadc88e3Srmind /////////////////////////////////////////////////////////////////////////
182dadc88e3Srmind 
183c52ca7f9Srmind #if defined(_LP64)
184c52ca7f9Srmind #define	__npf_atomic_cas_64	atomic_cas_64
185c52ca7f9Srmind #else
186c52ca7f9Srmind static uint64_t
__npf_atomic_cas_64(volatile uint64_t * ptr,uint64_t old,uint64_t new)187c52ca7f9Srmind __npf_atomic_cas_64(volatile uint64_t *ptr, uint64_t old, uint64_t new)
188c52ca7f9Srmind {
189c52ca7f9Srmind 	uint64_t prev;
190c52ca7f9Srmind 
191c52ca7f9Srmind 	mutex_enter(&portmap_lock);
192c52ca7f9Srmind 	prev = *ptr;
193c52ca7f9Srmind 	if (prev == old) {
194c52ca7f9Srmind 		*ptr = new;
195c52ca7f9Srmind 	}
196c52ca7f9Srmind 	mutex_exit(&portmap_lock);
197c52ca7f9Srmind 
198c52ca7f9Srmind 	return prev;
199c52ca7f9Srmind }
200c52ca7f9Srmind #endif
201c52ca7f9Srmind 
202dadc88e3Srmind /*
203dadc88e3Srmind  * bitmap_word_isset: test whether the bit value is in the packed array.
204dadc88e3Srmind  *
205dadc88e3Srmind  * => Return true if any value equals the bit number value.
206dadc88e3Srmind  *
207dadc88e3Srmind  * Packed array: 60 MSB bits, 5 values, 12 bits each.
208dadc88e3Srmind  *
209dadc88e3Srmind  * Reference: "Bit Twiddling Hacks" by S.E. Anderson, Stanford.
210dadc88e3Srmind  * Based on the hasvalue() and haszero() ideas.  Since values are
211dadc88e3Srmind  * represented by upper 60 bits, we shift right by 4.
212dadc88e3Srmind  */
213dadc88e3Srmind static bool
bitmap_word_isset(uint64_t x,unsigned bit)214dadc88e3Srmind bitmap_word_isset(uint64_t x, unsigned bit)
215dadc88e3Srmind {
216dadc88e3Srmind 	uint64_t m, r;
217dadc88e3Srmind 
218dadc88e3Srmind 	bit++;
219dadc88e3Srmind 	KASSERT((x & PORTMAP_L1_TAG) == 0);
220dadc88e3Srmind 	KASSERT(bit <= (PORTMAP_L0_MASK + 1));
221dadc88e3Srmind 
222dadc88e3Srmind 	m = (x >> 4) ^ (UINT64_C(0x1001001001001) * bit);
223dadc88e3Srmind 	r = (m - UINT64_C(0x1001001001001)) & (~m & UINT64_C(0x800800800800800));
224dadc88e3Srmind 	return r != 0;
225dadc88e3Srmind }
226dadc88e3Srmind 
227dadc88e3Srmind /*
228dadc88e3Srmind  * bitmap_word_cax: compare-and-xor on packed array elements.
229dadc88e3Srmind  */
230dadc88e3Srmind static uint64_t
bitmap_word_cax(uint64_t x,int exp,int bit)231dadc88e3Srmind bitmap_word_cax(uint64_t x, int exp, int bit)
232dadc88e3Srmind {
233dadc88e3Srmind 	unsigned e = exp + 1;
234dadc88e3Srmind 
235dadc88e3Srmind 	/*
236dadc88e3Srmind 	 * We need to distinguish "no value" from zero.  Just add one,
237dadc88e3Srmind 	 * since we use 12 bits to represent 11 bit values.
238dadc88e3Srmind 	 */
239dadc88e3Srmind 	bit++;
240dadc88e3Srmind 	KASSERT((unsigned)bit <= (PORTMAP_L0_MASK + 1));
241dadc88e3Srmind 	KASSERT((x & PORTMAP_L1_TAG) == 0);
242dadc88e3Srmind 
243dadc88e3Srmind 	if (((x >> 52) & 0xfff) == e)
244dadc88e3Srmind 		return x ^ ((uint64_t)bit << 52);
245dadc88e3Srmind 	if (((x >> 40) & 0xfff) == e)
246dadc88e3Srmind 		return x ^ ((uint64_t)bit << 40);
247dadc88e3Srmind 	if (((x >> 28) & 0xfff) == e)
248dadc88e3Srmind 		return x ^ ((uint64_t)bit << 28);
249dadc88e3Srmind 	if (((x >> 16) & 0xfff) == e)
250dadc88e3Srmind 		return x ^ ((uint64_t)bit << 16);
251dadc88e3Srmind 	if (((x >>  4) & 0xfff) == e)
252dadc88e3Srmind 		return x ^ ((uint64_t)bit << 4);
253dadc88e3Srmind 	return 0;
254dadc88e3Srmind }
255dadc88e3Srmind 
256dadc88e3Srmind static unsigned
bitmap_word_unpack(uint64_t x,unsigned bitvals[static5])257dadc88e3Srmind bitmap_word_unpack(uint64_t x, unsigned bitvals[static 5])
258dadc88e3Srmind {
259dadc88e3Srmind 	unsigned n = 0;
260dadc88e3Srmind 	uint64_t v;
261dadc88e3Srmind 
262dadc88e3Srmind 	KASSERT((x & PORTMAP_L1_TAG) == 0);
263dadc88e3Srmind 
264dadc88e3Srmind 	if ((v = ((x >> 52)) & 0xfff) != 0)
265dadc88e3Srmind 		bitvals[n++] = v - 1;
266dadc88e3Srmind 	if ((v = ((x >> 40)) & 0xfff) != 0)
267dadc88e3Srmind 		bitvals[n++] = v - 1;
268dadc88e3Srmind 	if ((v = ((x >> 28)) & 0xfff) != 0)
269dadc88e3Srmind 		bitvals[n++] = v - 1;
270dadc88e3Srmind 	if ((v = ((x >> 16)) & 0xfff) != 0)
271dadc88e3Srmind 		bitvals[n++] = v - 1;
272dadc88e3Srmind 	if ((v = ((x >>  4)) & 0xfff) != 0)
273dadc88e3Srmind 		bitvals[n++] = v - 1;
274dadc88e3Srmind 	return n;
275dadc88e3Srmind }
276dadc88e3Srmind 
277dadc88e3Srmind #if 0
278dadc88e3Srmind static bool
279dadc88e3Srmind bitmap_isset(const bitmap_t *bm, unsigned bit)
280dadc88e3Srmind {
281dadc88e3Srmind 	unsigned i, chunk_bit;
282dadc88e3Srmind 	uint64_t bval, b;
283dadc88e3Srmind 	bitmap_l1_t *bm1;
284dadc88e3Srmind 
285dadc88e3Srmind 	KASSERT(bit < PORTMAP_MAX_BITS);
286dadc88e3Srmind 	i = bit >> PORTMAP_L0_SHIFT;
287b899bfd9Srmind 	bval = atomic_load_relaxed(&bm->bits0[i]);
288dadc88e3Srmind 
289dadc88e3Srmind 	/*
290dadc88e3Srmind 	 * Empty check.  Note: we can test the whole word against zero,
291dadc88e3Srmind 	 * since zero bit values in the packed array result in bits set.
292dadc88e3Srmind 	 */
293dadc88e3Srmind 	if (bval == 0)
294dadc88e3Srmind 		return false;
295dadc88e3Srmind 
296dadc88e3Srmind 	/* Level 0 check. */
297dadc88e3Srmind 	chunk_bit = bit & PORTMAP_L0_MASK;
298dadc88e3Srmind 	if ((bval & PORTMAP_L1_TAG) == 0)
299dadc88e3Srmind 		return bitmap_word_isset(bval, chunk_bit);
300dadc88e3Srmind 
301dadc88e3Srmind 	/* Level 1 check. */
302dadc88e3Srmind 	bm1 = PORTMAP_L1_GET(bval);
303dadc88e3Srmind 	KASSERT(bm1 != NULL);
304dadc88e3Srmind 	i = chunk_bit >> PORTMAP_L1_SHIFT;
305dadc88e3Srmind 	b = UINT64_C(1) << (chunk_bit & PORTMAP_L1_MASK);
306dadc88e3Srmind 	return (bm1->bits1[i] & b) != 0;
307dadc88e3Srmind }
308dadc88e3Srmind #endif
309dadc88e3Srmind 
310dadc88e3Srmind static bool
bitmap_set(bitmap_t * bm,unsigned bit)311dadc88e3Srmind bitmap_set(bitmap_t *bm, unsigned bit)
312dadc88e3Srmind {
313dadc88e3Srmind 	unsigned i, chunk_bit;
314dadc88e3Srmind 	uint64_t bval, b, oval, nval;
315dadc88e3Srmind 	bitmap_l1_t *bm1;
316dadc88e3Srmind again:
317dadc88e3Srmind 	KASSERT(bit < PORTMAP_MAX_BITS);
318dadc88e3Srmind 	i = bit >> PORTMAP_L0_SHIFT;
319dadc88e3Srmind 	chunk_bit = bit & PORTMAP_L0_MASK;
320b899bfd9Srmind 	bval = bm->bits0[i];
321dadc88e3Srmind 
322dadc88e3Srmind 	if ((bval & PORTMAP_L1_TAG) == 0) {
323dadc88e3Srmind 		unsigned n = 0, bitvals[5];
324dadc88e3Srmind 		uint64_t bm1p;
325dadc88e3Srmind 
326dadc88e3Srmind 		if (bitmap_word_isset(bval, chunk_bit)) {
327dadc88e3Srmind 			return false;
328dadc88e3Srmind 		}
329dadc88e3Srmind 
330dadc88e3Srmind 		/*
331dadc88e3Srmind 		 * Look for a zero-slot and put a value there.
332dadc88e3Srmind 		 */
333dadc88e3Srmind 		if ((nval = bitmap_word_cax(bval, -1, chunk_bit)) != 0) {
334dadc88e3Srmind 			KASSERT((nval & PORTMAP_L1_TAG) == 0);
335c52ca7f9Srmind 			if (__npf_atomic_cas_64(&bm->bits0[i], bval, nval) != bval) {
336dadc88e3Srmind 				goto again;
337dadc88e3Srmind 			}
338dadc88e3Srmind 			return true;
339dadc88e3Srmind 		}
340dadc88e3Srmind 
341dadc88e3Srmind 		/*
342dadc88e3Srmind 		 * Full: allocate L1 block and copy over the current
343dadc88e3Srmind 		 * values into the level.
344dadc88e3Srmind 		 */
345dadc88e3Srmind 		bm1 = kmem_intr_zalloc(sizeof(bitmap_l1_t), KM_NOSLEEP);
346dadc88e3Srmind 		if (bm1 == NULL) {
347dadc88e3Srmind 			return false; // error
348dadc88e3Srmind 		}
349dadc88e3Srmind 		n = bitmap_word_unpack(bval, bitvals);
350dadc88e3Srmind 		while (n--) {
351dadc88e3Srmind 			const unsigned v = bitvals[n];
352dadc88e3Srmind 			const unsigned off = v >> PORTMAP_L1_SHIFT;
353dadc88e3Srmind 
354dadc88e3Srmind 			KASSERT(v <= PORTMAP_L0_MASK);
355dadc88e3Srmind 			KASSERT(off < (sizeof(uint64_t) * CHAR_BIT));
356dadc88e3Srmind 			bm1->bits1[off] |= UINT64_C(1) << (v & PORTMAP_L1_MASK);
357dadc88e3Srmind 		}
358dadc88e3Srmind 
359dadc88e3Srmind 		/*
360dadc88e3Srmind 		 * Attempt to set the L1 structure.  Note: there is no
361dadc88e3Srmind 		 * ABA problem since the we compare the actual values.
362dadc88e3Srmind 		 * Note: CAS serves as a memory barrier.
363dadc88e3Srmind 		 */
364dadc88e3Srmind 		bm1p = (uintptr_t)bm1;
365dadc88e3Srmind 		KASSERT((bm1p & PORTMAP_L1_TAG) == 0);
366dadc88e3Srmind 		bm1p |= PORTMAP_L1_TAG;
367c52ca7f9Srmind 		if (__npf_atomic_cas_64(&bm->bits0[i], bval, bm1p) != bval) {
368dadc88e3Srmind 			kmem_intr_free(bm1, sizeof(bitmap_l1_t));
369dadc88e3Srmind 			goto again;
370dadc88e3Srmind 		}
371dadc88e3Srmind 		bval = bm1p;
372dadc88e3Srmind 	}
373dadc88e3Srmind 
374dadc88e3Srmind 	bm1 = PORTMAP_L1_GET(bval);
375dadc88e3Srmind 	KASSERT(bm1 != NULL);
376dadc88e3Srmind 	i = chunk_bit >> PORTMAP_L1_SHIFT;
377dadc88e3Srmind 	b = UINT64_C(1) << (chunk_bit & PORTMAP_L1_MASK);
378dadc88e3Srmind 
379b899bfd9Srmind 	oval = bm1->bits1[i];
380dadc88e3Srmind 	if (oval & b) {
381dadc88e3Srmind 		return false;
382dadc88e3Srmind 	}
383dadc88e3Srmind 	nval = oval | b;
384c52ca7f9Srmind 	if (__npf_atomic_cas_64(&bm1->bits1[i], oval, nval) != oval) {
385dadc88e3Srmind 		goto again;
386dadc88e3Srmind 	}
387dadc88e3Srmind 	return true;
388dadc88e3Srmind }
389dadc88e3Srmind 
390dadc88e3Srmind static bool
bitmap_clr(bitmap_t * bm,unsigned bit)391dadc88e3Srmind bitmap_clr(bitmap_t *bm, unsigned bit)
392dadc88e3Srmind {
393dadc88e3Srmind 	unsigned i, chunk_bit;
394dadc88e3Srmind 	uint64_t bval, b, oval, nval;
395dadc88e3Srmind 	bitmap_l1_t *bm1;
396dadc88e3Srmind again:
397dadc88e3Srmind 	KASSERT(bit < PORTMAP_MAX_BITS);
398dadc88e3Srmind 	i = bit >> PORTMAP_L0_SHIFT;
399dadc88e3Srmind 	chunk_bit = bit & PORTMAP_L0_MASK;
400dadc88e3Srmind 	bval = bm->bits0[i];
401dadc88e3Srmind 
402dadc88e3Srmind 	if ((bval & PORTMAP_L1_TAG) == 0) {
403dadc88e3Srmind 		if (!bitmap_word_isset(bval, chunk_bit)) {
404dadc88e3Srmind 			return false;
405dadc88e3Srmind 		}
406dadc88e3Srmind 		nval = bitmap_word_cax(bval, chunk_bit, chunk_bit);
407dadc88e3Srmind 		KASSERT((nval & PORTMAP_L1_TAG) == 0);
408c52ca7f9Srmind 		if (__npf_atomic_cas_64(&bm->bits0[i], bval, nval) != bval) {
409dadc88e3Srmind 			goto again;
410dadc88e3Srmind 		}
411dadc88e3Srmind 		return true;
412dadc88e3Srmind 	}
413dadc88e3Srmind 
414dadc88e3Srmind 	bm1 = PORTMAP_L1_GET(bval);
415dadc88e3Srmind 	KASSERT(bm1 != NULL);
416dadc88e3Srmind 	i = chunk_bit >> PORTMAP_L1_SHIFT;
417dadc88e3Srmind 	b = UINT64_C(1) << (chunk_bit & PORTMAP_L1_MASK);
418dadc88e3Srmind 
419b899bfd9Srmind 	oval = bm1->bits1[i];
420dadc88e3Srmind 	if ((oval & b) == 0) {
421dadc88e3Srmind 		return false;
422dadc88e3Srmind 	}
423dadc88e3Srmind 	nval = oval & ~b;
424c52ca7f9Srmind 	if (__npf_atomic_cas_64(&bm1->bits1[i], oval, nval) != oval) {
425dadc88e3Srmind 		goto again;
426dadc88e3Srmind 	}
427dadc88e3Srmind 	return true;
428dadc88e3Srmind }
429dadc88e3Srmind 
430dadc88e3Srmind /////////////////////////////////////////////////////////////////////////
431dadc88e3Srmind 
432dadc88e3Srmind static bitmap_t *
npf_portmap_autoget(npf_portmap_t * pm,unsigned alen,const npf_addr_t * addr)43304ad65d9Srmind npf_portmap_autoget(npf_portmap_t *pm, unsigned alen, const npf_addr_t *addr)
434dadc88e3Srmind {
435dadc88e3Srmind 	bitmap_t *bm;
436dadc88e3Srmind 
437dadc88e3Srmind 	KASSERT(pm && pm->addr_map);
438dadc88e3Srmind 	KASSERT(alen && alen <= sizeof(npf_addr_t));
439dadc88e3Srmind 
440dadc88e3Srmind 	/* Lookup the port map for this address. */
441dadc88e3Srmind 	bm = thmap_get(pm->addr_map, addr, alen);
442dadc88e3Srmind 	if (bm == NULL) {
443dadc88e3Srmind 		void *ret;
444dadc88e3Srmind 
445dadc88e3Srmind 		/*
446dadc88e3Srmind 		 * Allocate a new port map for this address and
447dadc88e3Srmind 		 * attempt to insert it.
448dadc88e3Srmind 		 */
449dadc88e3Srmind 		bm = kmem_intr_zalloc(sizeof(bitmap_t), KM_NOSLEEP);
450dadc88e3Srmind 		if (bm == NULL) {
451dadc88e3Srmind 			return NULL;
452dadc88e3Srmind 		}
453dadc88e3Srmind 		memcpy(&bm->addr, addr, alen);
454dadc88e3Srmind 		bm->addr_len = alen;
455dadc88e3Srmind 
456dadc88e3Srmind 		int s = splsoftnet();
457dadc88e3Srmind 		ret = thmap_put(pm->addr_map, &bm->addr, alen, bm);
458dadc88e3Srmind 		splx(s);
459dadc88e3Srmind 
460dadc88e3Srmind 		if (ret == bm) {
461dadc88e3Srmind 			/* Success: insert the bitmap into the list. */
462dadc88e3Srmind 			mutex_enter(&pm->list_lock);
463dadc88e3Srmind 			LIST_INSERT_HEAD(&pm->bitmap_list, bm, entry);
464dadc88e3Srmind 			mutex_exit(&pm->list_lock);
465dadc88e3Srmind 		} else {
466dadc88e3Srmind 			/* Race: use an existing bitmap. */
467dadc88e3Srmind 			kmem_free(bm, sizeof(bitmap_t));
468dadc88e3Srmind 			bm = ret;
469dadc88e3Srmind 		}
470dadc88e3Srmind 	}
471dadc88e3Srmind 	return bm;
472dadc88e3Srmind }
473dadc88e3Srmind 
474dadc88e3Srmind /*
475dadc88e3Srmind  * npf_portmap_flush: free all bitmaps and remove all addresses.
476dadc88e3Srmind  *
477dadc88e3Srmind  * => Concurrent calls to this routine are not allowed; therefore no
478dadc88e3Srmind  * need to acquire locks.
479dadc88e3Srmind  */
480dadc88e3Srmind void
npf_portmap_flush(npf_portmap_t * pm)48104ad65d9Srmind npf_portmap_flush(npf_portmap_t *pm)
482dadc88e3Srmind {
483dadc88e3Srmind 	bitmap_t *bm;
484dadc88e3Srmind 
485dadc88e3Srmind 	while ((bm = LIST_FIRST(&pm->bitmap_list)) != NULL) {
486dadc88e3Srmind 		for (unsigned i = 0; i < PORTMAP_L0_WORDS; i++) {
487dadc88e3Srmind 			uintptr_t bm1 = bm->bits0[i];
488dadc88e3Srmind 
489dadc88e3Srmind 			if (bm1 & PORTMAP_L1_TAG) {
490dadc88e3Srmind 				bitmap_l1_t *bm1p = PORTMAP_L1_GET(bm1);
491dadc88e3Srmind 				kmem_intr_free(bm1p, sizeof(bitmap_l1_t));
492dadc88e3Srmind 			}
493dadc88e3Srmind 			bm->bits0[i] = UINT64_C(0);
494dadc88e3Srmind 		}
495dadc88e3Srmind 		LIST_REMOVE(bm, entry);
496dadc88e3Srmind 		thmap_del(pm->addr_map, &bm->addr, bm->addr_len);
497dadc88e3Srmind 		kmem_intr_free(bm, sizeof(bitmap_t));
498dadc88e3Srmind 	}
499dadc88e3Srmind 	/* Note: the caller ensures there are no active references. */
500dadc88e3Srmind 	thmap_gc(pm->addr_map, thmap_stage_gc(pm->addr_map));
501dadc88e3Srmind }
502dadc88e3Srmind 
503dadc88e3Srmind /*
504dadc88e3Srmind  * npf_portmap_get: allocate and return a port from the given portmap.
505dadc88e3Srmind  *
506dadc88e3Srmind  * => Returns the port value in network byte-order.
507dadc88e3Srmind  * => Zero indicates a failure.
508dadc88e3Srmind  */
509dadc88e3Srmind in_port_t
npf_portmap_get(npf_portmap_t * pm,int alen,const npf_addr_t * addr)51004ad65d9Srmind npf_portmap_get(npf_portmap_t *pm, int alen, const npf_addr_t *addr)
511dadc88e3Srmind {
512b899bfd9Srmind 	const unsigned min_port = atomic_load_relaxed(&pm->min_port);
513b899bfd9Srmind 	const unsigned max_port = atomic_load_relaxed(&pm->max_port);
514b899bfd9Srmind 	const unsigned port_delta = max_port - min_port + 1;
515dadc88e3Srmind 	unsigned bit, target;
516dadc88e3Srmind 	bitmap_t *bm;
517dadc88e3Srmind 
518b899bfd9Srmind 	/* Sanity check: the user might set incorrect parameters. */
519b899bfd9Srmind 	if (__predict_false(min_port > max_port)) {
520b899bfd9Srmind 		return 0;
521b899bfd9Srmind 	}
522b899bfd9Srmind 
52304ad65d9Srmind 	bm = npf_portmap_autoget(pm, alen, addr);
524b899bfd9Srmind 	if (__predict_false(bm == NULL)) {
525dadc88e3Srmind 		/* No memory. */
526dadc88e3Srmind 		return 0;
527dadc88e3Srmind 	}
528dadc88e3Srmind 
529dadc88e3Srmind 	/* Randomly select a port. */
530b899bfd9Srmind 	target = min_port + (cprng_fast32() % port_delta);
531dadc88e3Srmind 	bit = target;
532dadc88e3Srmind next:
533dadc88e3Srmind 	if (bitmap_set(bm, bit)) {
534dadc88e3Srmind 		/* Success. */
535dadc88e3Srmind 		return htons(bit);
536dadc88e3Srmind 	}
537b899bfd9Srmind 	bit = min_port + ((bit + 1) % port_delta);
538dadc88e3Srmind 	if (target != bit) {
539dadc88e3Srmind 		/* Next.. */
540dadc88e3Srmind 		goto next;
541dadc88e3Srmind 	}
542dadc88e3Srmind 	/* No space. */
543dadc88e3Srmind 	return 0;
544dadc88e3Srmind }
545dadc88e3Srmind 
546dadc88e3Srmind /*
547dadc88e3Srmind  * npf_portmap_take: allocate a specific port in the portmap.
548dadc88e3Srmind  */
549dadc88e3Srmind bool
npf_portmap_take(npf_portmap_t * pm,int alen,const npf_addr_t * addr,in_port_t port)55004ad65d9Srmind npf_portmap_take(npf_portmap_t *pm, int alen,
55104ad65d9Srmind     const npf_addr_t *addr, in_port_t port)
552dadc88e3Srmind {
55304ad65d9Srmind 	bitmap_t *bm = npf_portmap_autoget(pm, alen, addr);
554dadc88e3Srmind 
555dadc88e3Srmind 	port = ntohs(port);
55604ad65d9Srmind 	if (!bm || port < pm->min_port || port > pm->max_port) {
557dadc88e3Srmind 		/* Out of memory / invalid port. */
558dadc88e3Srmind 		return false;
559dadc88e3Srmind 	}
560dadc88e3Srmind 	return bitmap_set(bm, port);
561dadc88e3Srmind }
562dadc88e3Srmind 
563dadc88e3Srmind /*
564dadc88e3Srmind  * npf_portmap_put: release the port, making it available in the portmap.
565dadc88e3Srmind  *
566dadc88e3Srmind  * => The port value should be in network byte-order.
567dadc88e3Srmind  */
568dadc88e3Srmind void
npf_portmap_put(npf_portmap_t * pm,int alen,const npf_addr_t * addr,in_port_t port)56904ad65d9Srmind npf_portmap_put(npf_portmap_t *pm, int alen,
57004ad65d9Srmind     const npf_addr_t *addr, in_port_t port)
571dadc88e3Srmind {
572dadc88e3Srmind 	bitmap_t *bm;
573dadc88e3Srmind 
57404ad65d9Srmind 	bm = npf_portmap_autoget(pm, alen, addr);
575dadc88e3Srmind 	if (bm) {
576dadc88e3Srmind 		port = ntohs(port);
577dadc88e3Srmind 		bitmap_clr(bm, port);
578dadc88e3Srmind 	}
579dadc88e3Srmind }
580