Lines Matching refs:bits

41 	u8 bits;  member
59 #define __CHASH_BITMAP_SIZE(bits) \ argument
60 (((1 << (bits)) + BITS_PER_LONG - 1) / BITS_PER_LONG)
61 #define __CHASH_ARRAY_SIZE(bits, size) \ argument
62 ((((size) << (bits)) + sizeof(long) - 1) / sizeof(long))
64 #define __CHASH_DATA_SIZE(bits, key_size, value_size) \ argument
65 (__CHASH_BITMAP_SIZE(bits) * 2 + \
66 __CHASH_ARRAY_SIZE(bits, key_size) + \
67 __CHASH_ARRAY_SIZE(bits, value_size))
69 #define STRUCT_CHASH_TABLE(bits, key_size, value_size) \ argument
73 [__CHASH_DATA_SIZE(bits, key_size, value_size)];\
128 prefix.bits = (bts), \
169 int chash_table_alloc(struct chash_table *table, u8 bits, u8 key_size,
293 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_is_valid()
299 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_is_empty()
306 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_set_valid()
312 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_set_invalid()
317 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_set_empty()
324 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_key32()
330 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_key64()
335 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_key()
343 return hash_32(chash_iter_key32(iter), iter.table->bits); in chash_iter_hash32()
349 return hash_64(chash_iter_key64(iter), iter.table->bits); in chash_iter_hash64()
355 hash_32(chash_iter_key32(iter), iter.table->bits) : in chash_iter_hash()
356 hash_64(chash_iter_key64(iter), iter.table->bits); in chash_iter_hash()
361 BUG_ON((unsigned)iter.slot >= (1 << iter.table->bits)); in chash_iter_value()