2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2020 Alexander V. Chernikov
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 #include <sys/cdefs.h>
29 __FBSDID("$FreeBSD$");
31 #include "opt_route.h"
33 #include <sys/param.h>
34 #include <sys/systm.h>
36 #include <sys/malloc.h>
38 #include <sys/kernel.h>
40 #include <net/route/nhop_utils.h>
42 #define BLOCK_ITEMS (8 * sizeof(u_long)) /* Number of items for ffsl() */
44 #define _BLOCKS_TO_SZ(_blocks) ((size_t)(_blocks) * sizeof(u_long))
45 #define _BLOCKS_TO_ITEMS(_blocks) ((uint32_t)(_blocks) * BLOCK_ITEMS)
46 #define _ITEMS_TO_BLOCKS(_items) ((_items) / BLOCK_ITEMS)
48 static void _bitmask_init_idx(void *index, uint32_t items);
51 bitmask_init(struct bitmask_head *bh, void *idx, uint32_t num_items)
55 _bitmask_init_idx(idx, num_items);
57 memset(bh, 0, sizeof(struct bitmask_head));
58 bh->blocks = _ITEMS_TO_BLOCKS(num_items);
59 bh->idx = (u_long *)idx;
63 bitmask_get_resize_items(const struct bitmask_head *bh)
65 if ((bh->items_count * 2 > _BLOCKS_TO_ITEMS(bh->blocks)) && bh->items_count < 65536)
66 return (_BLOCKS_TO_ITEMS(bh->blocks) * 2);
72 bitmask_should_resize(const struct bitmask_head *bh)
75 return (bitmask_get_resize_items(bh) != 0);
80 _bitmask_get_blocks(uint32_t items)
83 return (items / BLOCK_ITEMS);
88 bitmask_get_size(uint32_t items)
91 KASSERT((items % BLOCK_ITEMS) == 0,
92 ("bitmask size needs to power of 2 and greater or equal to %zu",
95 assert((items % BLOCK_ITEMS) == 0);
102 _bitmask_init_idx(void *_idx, uint32_t items)
104 size_t size = bitmask_get_size(items);
105 u_long *idx = (u_long *)_idx;
107 /* Mark all as free */
108 memset(idx, 0xFF, size);
109 *idx &= ~(u_long)1; /* Always skip index 0 */
113 * _try_merge api to allow shrinking?
116 bitmask_copy(const struct bitmask_head *bi, void *new_idx, uint32_t new_items)
118 uint32_t new_blocks = _BLOCKS_TO_ITEMS(new_items);
120 _bitmask_init_idx(new_idx, new_items);
122 if (bi->blocks < new_blocks) {
123 /* extend current blocks */
125 memcpy(new_idx, bi->idx, _BLOCKS_TO_SZ(bi->blocks));
128 /* XXX: ensure all other blocks are non-zero */
129 for (int i = new_blocks; i < bi->blocks; i++) {
137 bitmask_swap(struct bitmask_head *bh, void *new_idx, uint32_t new_items, void **pidx)
143 bh->idx = (u_long *)new_idx;
144 bh->blocks = _ITEMS_TO_BLOCKS(new_items);
151 * Allocate new index in given instance and stores in in @pidx.
152 * Returns 0 on success.
155 bitmask_alloc_idx(struct bitmask_head *bi, uint16_t *pidx)
161 mask = &bi->idx[off];
163 for (i = off; i < bi->blocks; i++, mask++) {
164 if ((v = ffsl(*mask)) == 0)
168 *mask &= ~ ((u_long)1 << (v - 1));
172 v = BLOCK_ITEMS * i + v - 1;
183 * Removes index from given set.
184 * Returns 0 on success.
187 bitmask_free_idx(struct bitmask_head *bi, uint16_t idx)
195 i = idx / BLOCK_ITEMS;
196 v = idx % BLOCK_ITEMS;
203 if ((*mask & ((u_long)1 << v)) != 0)
207 *mask |= (u_long)1 << v;
210 /* Update free offset */
211 if (bi->free_off > i)