122 #define find_index(p, b, n)	({					\  argument
124 	p->index##b[n] = INDEX_NOT_FOUND;				\
125 	hash_for_each_possible(p->htable##b, _n, node, p->data##b[n]) {	\
126 		if (p->data##b[n] == _n->data) {			\
127 			p->index##b[n] = _n->index;			\
131 	p->index##b[n] >= 0;						\
134 #define check_index(p, b, n)			\  argument
135 	((p)->index##b[n] == INDEX_NOT_CHECKED	\
136 	 ? find_index(p, b, n)			\
137 	 : (p)->index##b[n] >= 0)
152 static int add_bits(struct sw842_param *p, u64 d, u8 n);
154 static int __split_add_bits(struct sw842_param *p, u64 d, u8 n, u8 s)  in __split_add_bits()  argument
158 	if (n <= s)  in __split_add_bits()
161 	ret = add_bits(p, d >> s, n - s);  in __split_add_bits()
167 static int add_bits(struct sw842_param *p, u64 d, u8 n)  in add_bits()  argument
169 	int b = p->bit, bits = b + n, s = round_up(bits, 8) - bits;  in add_bits()
173 	pr_debug("add %u bits %lx\n", (unsigned char)n, (unsigned long)d);  in add_bits()
175 	if (n > 64)  in add_bits()
182 		return __split_add_bits(p, d, n, 32);  in add_bits()
184 		return __split_add_bits(p, d, n, 16);  in add_bits()
186 		return __split_add_bits(p, d, n, 8);  in add_bits()
211 	p->bit += n;  in add_bits()