60 	if (b->bs_words > 0)  in bitset_fini()
61 		kmem_free(b->bs_set, b->bs_words * sizeof (ulong_t));  in bitset_fini()
77 	if (b->bs_words == nwords)  in bitset_resize()
86 		if (b->bs_words > 0)  in bitset_resize()
88 			    MIN(b->bs_words, nwords) * sizeof (ulong_t));  in bitset_resize()
98 	if (b->bs_words > 0)  in bitset_resize()
99 		kmem_free(bset_tmp, b->bs_words * sizeof (ulong_t));  in bitset_resize()
101 	b->bs_words = nwords;  in bitset_resize()
110 	return (b->bs_words * BT_NBIPUL);  in bitset_capacity()
127 	ASSERT(b->bs_words * BT_NBIPUL > pos);  in bitset_add()
139 	ASSERT(b->bs_words * BT_NBIPUL > pos);  in bitset_atomic_add()
153 	ASSERT(b->bs_words * BT_NBIPUL > pos);  in bitset_atomic_test_and_add()
167 	ASSERT(b->bs_words * BT_NBIPUL > pos);  in bitset_del()
179 	ASSERT(b->bs_words * BT_NBIPUL > pos);  in bitset_atomic_del()
193 	ASSERT(b->bs_words * BT_NBIPUL > pos);  in bitset_atomic_test_and_del()
207 	if (pos >= b->bs_words * BT_NBIPUL)  in bitset_in_set()
221 	for (i = 0; i < b->bs_words; i++)  in bitset_is_null()
264 	ASSERT(b->bs_words > 0);  in bitset_find()
265 	start = seed % b->bs_words;  in bitset_find()
274 		if (++i == b->bs_words)  in bitset_find()
293 	for (anyset = 0, i = 0; i < bs1->bs_words; i++) {  in bitset_and()
308 	for (anyset = 0, i = 0; i < bs1->bs_words; i++) {  in bitset_or()
323 	for (i = 0; i < bs1->bs_words; i++) {  in bitset_xor()
338 	if (bs1->bs_words != bs2->bs_words)  in bitset_match()
341 	for (i = 0; i < bs1->bs_words; i++)  in bitset_match()
353 	bzero(b->bs_set, sizeof (ulong_t) * b->bs_words);  in bitset_zero()
363 	bcopy(src->bs_set, dest->bs_set, sizeof (ulong_t) * src->bs_words);  in bitset_copy()