radix-tree: update the description for radix_tree_find_next_bit
PATCH 1/1 radix-tree: update the description for radix_tree_find_next_bit
The function changed at some point, but the description was not updated.
Signed-off-by Qiujun Huang <[email protected]>
--- lib/radix-tree.c | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-)
lib/radix-tree.c +2 -3
@@ -178,12 +178,11 @@ static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag)* radix_tree_find_next_bit - find the next set bit in a memory region * * @addr: The address to base the search on -* @size: The bitmap size in bits +* @tag: The tag index (< RADIX_TREE_MAX_TAGS) * @offset: The bitnumber to start searching at * * Unrollable variant of find_next_bit() for constant size arrays. -* Tail bits starting from size to roundup(size, BITS_PER_LONG) must be zero. -* Returns next bit offset, or size if nothing found. +* Returns next bit offset, or RADIX_TREE_MAP_SIZE if nothing found. */ static __always_inline unsigned long radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag,
Signature · 1 line
1.8.3.1