a50a1c44eabd7b099b55b846259fe6abaf66c8d6
1 #include <linux/module.h>
4 #define BIT_ARRAY_BYTES 256
5 #define BIT_RADIX_BITS_PER_ARRAY ((BIT_ARRAY_BYTES - sizeof(unsigned long)) * 8)
7 extern struct kmem_cache
*btrfs_bit_radix_cachep
;
8 int set_radix_bit(struct radix_tree_root
*radix
, unsigned long bit
)
15 slot
= bit
/ BIT_RADIX_BITS_PER_ARRAY
;
16 bit_slot
= bit
% BIT_RADIX_BITS_PER_ARRAY
;
18 bits
= radix_tree_lookup(radix
, slot
);
20 bits
= kmem_cache_alloc(btrfs_bit_radix_cachep
, GFP_NOFS
);
23 memset(bits
+ 1, 0, BIT_ARRAY_BYTES
- sizeof(unsigned long));
25 radix_tree_preload(GFP_NOFS
);
26 ret
= radix_tree_insert(radix
, slot
, bits
);
27 radix_tree_preload_end();
31 set_bit(bit_slot
, bits
+ 1);
35 int test_radix_bit(struct radix_tree_root
*radix
, unsigned long bit
)
41 slot
= bit
/ BIT_RADIX_BITS_PER_ARRAY
;
42 bit_slot
= bit
% BIT_RADIX_BITS_PER_ARRAY
;
44 bits
= radix_tree_lookup(radix
, slot
);
47 return test_bit(bit_slot
, bits
+ 1);
50 int clear_radix_bit(struct radix_tree_root
*radix
, unsigned long bit
)
58 slot
= bit
/ BIT_RADIX_BITS_PER_ARRAY
;
59 bit_slot
= bit
% BIT_RADIX_BITS_PER_ARRAY
;
61 bits
= radix_tree_lookup(radix
, slot
);
64 clear_bit(bit_slot
, bits
+ 1);
66 for (i
= 1; i
< BIT_ARRAY_BYTES
/ sizeof(unsigned long); i
++) {
73 bits
= radix_tree_delete(radix
, slot
);
75 kmem_cache_free(btrfs_bit_radix_cachep
, bits
);
81 int find_first_radix_bit(struct radix_tree_root
*radix
, unsigned long *retbits
,
85 unsigned long *gang
[4];
91 ret
= radix_tree_gang_lookup(radix
, (void *)&gang
, 0, ARRAY_SIZE(gang
));
92 for (i
= 0; i
< ret
&& nr
> 0; i
++) {
96 found
= find_next_bit(bits
+ 1,
97 BIT_RADIX_BITS_PER_ARRAY
,
99 if (found
< BIT_RADIX_BITS_PER_ARRAY
) {
101 BIT_RADIX_BITS_PER_ARRAY
+ found
;
This page took 0.09892 seconds and 4 git commands to generate.