mirror of https://github.com/torvalds/linux.git
lib/sbitmap: make sbitmap_get_shallow() internal
Because it's only used in sbitmap.c Signed-off-by: Yu Kuai <yukuai3@huawei.com> Reviewed-by: Damien Le Moal <dlemoal@kernel.org> Reviewed-by: Jan Kara <jack@suse.cz> Reviewed-by: Bart Van Assche <bvanassche@acm.org> Link: https://lore.kernel.org/r/20250807032413.1469456-3-yukuai1@huaweicloud.com Signed-off-by: Jens Axboe <axboe@kernel.dk>
This commit is contained in:
parent
42e6c6ce03
commit
45fa9f97e6
|
|
@ -209,23 +209,6 @@ void sbitmap_resize(struct sbitmap *sb, unsigned int depth);
|
||||||
*/
|
*/
|
||||||
int sbitmap_get(struct sbitmap *sb);
|
int sbitmap_get(struct sbitmap *sb);
|
||||||
|
|
||||||
/**
|
|
||||||
* sbitmap_get_shallow() - Try to allocate a free bit from a &struct sbitmap,
|
|
||||||
* limiting the depth used from each word.
|
|
||||||
* @sb: Bitmap to allocate from.
|
|
||||||
* @shallow_depth: The maximum number of bits to allocate from the bitmap.
|
|
||||||
*
|
|
||||||
* This rather specific operation allows for having multiple users with
|
|
||||||
* different allocation limits. E.g., there can be a high-priority class that
|
|
||||||
* uses sbitmap_get() and a low-priority class that uses sbitmap_get_shallow()
|
|
||||||
* with a @shallow_depth of (sb->depth >> 1). Then, the low-priority
|
|
||||||
* class can only allocate half of the total bits in the bitmap, preventing it
|
|
||||||
* from starving out the high-priority class.
|
|
||||||
*
|
|
||||||
* Return: Non-negative allocated bit number if successful, -1 otherwise.
|
|
||||||
*/
|
|
||||||
int sbitmap_get_shallow(struct sbitmap *sb, unsigned long shallow_depth);
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* sbitmap_any_bit_set() - Check for a set bit in a &struct sbitmap.
|
* sbitmap_any_bit_set() - Check for a set bit in a &struct sbitmap.
|
||||||
* @sb: Bitmap to check.
|
* @sb: Bitmap to check.
|
||||||
|
|
|
||||||
|
|
@ -307,7 +307,22 @@ static int __sbitmap_get_shallow(struct sbitmap *sb,
|
||||||
return sbitmap_find_bit(sb, shallow_depth, index, alloc_hint, true);
|
return sbitmap_find_bit(sb, shallow_depth, index, alloc_hint, true);
|
||||||
}
|
}
|
||||||
|
|
||||||
int sbitmap_get_shallow(struct sbitmap *sb, unsigned long shallow_depth)
|
/**
|
||||||
|
* sbitmap_get_shallow() - Try to allocate a free bit from a &struct sbitmap,
|
||||||
|
* limiting the depth used from each word.
|
||||||
|
* @sb: Bitmap to allocate from.
|
||||||
|
* @shallow_depth: The maximum number of bits to allocate from the bitmap.
|
||||||
|
*
|
||||||
|
* This rather specific operation allows for having multiple users with
|
||||||
|
* different allocation limits. E.g., there can be a high-priority class that
|
||||||
|
* uses sbitmap_get() and a low-priority class that uses sbitmap_get_shallow()
|
||||||
|
* with a @shallow_depth of (sb->depth >> 1). Then, the low-priority
|
||||||
|
* class can only allocate half of the total bits in the bitmap, preventing it
|
||||||
|
* from starving out the high-priority class.
|
||||||
|
*
|
||||||
|
* Return: Non-negative allocated bit number if successful, -1 otherwise.
|
||||||
|
*/
|
||||||
|
static int sbitmap_get_shallow(struct sbitmap *sb, unsigned long shallow_depth)
|
||||||
{
|
{
|
||||||
int nr;
|
int nr;
|
||||||
unsigned int hint, depth;
|
unsigned int hint, depth;
|
||||||
|
|
@ -322,7 +337,6 @@ int sbitmap_get_shallow(struct sbitmap *sb, unsigned long shallow_depth)
|
||||||
|
|
||||||
return nr;
|
return nr;
|
||||||
}
|
}
|
||||||
EXPORT_SYMBOL_GPL(sbitmap_get_shallow);
|
|
||||||
|
|
||||||
bool sbitmap_any_bit_set(const struct sbitmap *sb)
|
bool sbitmap_any_bit_set(const struct sbitmap *sb)
|
||||||
{
|
{
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue