1 /* SPDX-License-Identifier: GPL-2.0 */
6  * "Frags" are a way to describe a subset of a 32-bit number space,
7  * using a mask and a value to match against that mask.  Any given frag
8  * (subset of the number space) can be partitioned into 2^n sub-frags.
10  * Frags are encoded into a 32-bit word:
25 		(v & (0xffffffu << (24-b)) & 0xffffffu);  in ceph_frag_make()
27 static inline __u32 ceph_frag_bits(__u32 f)  in ceph_frag_bits()  argument
29 	return f >> 24;  in ceph_frag_bits()
31 static inline __u32 ceph_frag_value(__u32 f)  in ceph_frag_value()  argument
33 	return f & 0xffffffu;  in ceph_frag_value()
35 static inline __u32 ceph_frag_mask(__u32 f)  in ceph_frag_mask()  argument
37 	return (0xffffffu << (24-ceph_frag_bits(f))) & 0xffffffu;  in ceph_frag_mask()
39 static inline __u32 ceph_frag_mask_shift(__u32 f)  in ceph_frag_mask_shift()  argument
41 	return 24 - ceph_frag_bits(f);  in ceph_frag_mask_shift()
44 static inline bool ceph_frag_contains_value(__u32 f, __u32 v)  in ceph_frag_contains_value()  argument
46 	return (v & ceph_frag_mask(f)) == ceph_frag_value(f);  in ceph_frag_contains_value()
49 static inline __u32 ceph_frag_make_child(__u32 f, int by, int i)  in ceph_frag_make_child()  argument
51 	int newbits = ceph_frag_bits(f) + by;  in ceph_frag_make_child()
53 			 ceph_frag_value(f) | (i << (24 - newbits)));  in ceph_frag_make_child()
55 static inline bool ceph_frag_is_leftmost(__u32 f)  in ceph_frag_is_leftmost()  argument
57 	return ceph_frag_value(f) == 0;  in ceph_frag_is_leftmost()
59 static inline bool ceph_frag_is_rightmost(__u32 f)  in ceph_frag_is_rightmost()  argument
61 	return ceph_frag_value(f) == ceph_frag_mask(f);  in ceph_frag_is_rightmost()
63 static inline __u32 ceph_frag_next(__u32 f)  in ceph_frag_next()  argument
65 	return ceph_frag_make(ceph_frag_bits(f),  in ceph_frag_next()
66 			 ceph_frag_value(f) + (0x1000000 >> ceph_frag_bits(f)));  in ceph_frag_next()
73 int ceph_frag_compare(__u32 a, __u32 b);