1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * Fast and scalable bitmaps.
5 * Copyright (C) 2016 Facebook
6 * Copyright (C) 2013-2014 Jens Axboe
9 #ifndef __LINUX_SCALE_BITMAP_H
10 #define __LINUX_SCALE_BITMAP_H
12 #include <linux/kernel.h>
13 #include <linux/slab.h>
18 * struct sbitmap_word - Word in a &struct sbitmap.
22 * @depth: Number of bits being used in @word/@cleared
27 * @word: word holding free bits
29 unsigned long word ____cacheline_aligned_in_smp
;
32 * @cleared: word holding cleared bits
34 unsigned long cleared ____cacheline_aligned_in_smp
;
37 * @swap_lock: Held while swapping word <-> cleared
40 } ____cacheline_aligned_in_smp
;
43 * struct sbitmap - Scalable bitmap.
45 * A &struct sbitmap is spread over multiple cachelines to avoid ping-pong. This
46 * trades off higher memory usage for better scalability.
50 * @depth: Number of bits used in the whole bitmap.
55 * @shift: log2(number of bits used per word)
60 * @map_nr: Number of words (cachelines) being used for the bitmap.
65 * @map: Allocated bitmap.
67 struct sbitmap_word
*map
;
70 #define SBQ_WAIT_QUEUES 8
71 #define SBQ_WAKE_BATCH 8
74 * struct sbq_wait_state - Wait queue in a &struct sbitmap_queue.
76 struct sbq_wait_state
{
78 * @wait_cnt: Number of frees remaining before we wake up.
85 wait_queue_head_t wait
;
86 } ____cacheline_aligned_in_smp
;
89 * struct sbitmap_queue - Scalable bitmap with the added ability to wait on free
92 * A &struct sbitmap_queue uses multiple wait queues and rolling wakeups to
93 * avoid contention on the wait queue spinlock. This ensures that we don't hit a
94 * scalability wall when we run out of free bits and have to start putting tasks
97 struct sbitmap_queue
{
99 * @sb: Scalable bitmap.
104 * @alloc_hint: Cache of last successfully allocated or freed bit.
106 * This is per-cpu, which allows multiple users to stick to different
107 * cachelines until the map is exhausted.
109 unsigned int __percpu
*alloc_hint
;
112 * @wake_batch: Number of bits which must be freed before we wake up any
115 unsigned int wake_batch
;
118 * @wake_index: Next wait queue in @ws to wake up.
125 struct sbq_wait_state
*ws
;
128 * @ws_active: count of currently active ws waitqueues
133 * @round_robin: Allocate bits in strict round-robin order.
138 * @min_shallow_depth: The minimum shallow depth which may be passed to
139 * sbitmap_queue_get_shallow() or __sbitmap_queue_get_shallow().
141 unsigned int min_shallow_depth
;
145 * sbitmap_init_node() - Initialize a &struct sbitmap on a specific memory node.
146 * @sb: Bitmap to initialize.
147 * @depth: Number of bits to allocate.
148 * @shift: Use 2^@shift bits per word in the bitmap; if a negative number if
149 * given, a good default is chosen.
150 * @flags: Allocation flags.
151 * @node: Memory node to allocate on.
153 * Return: Zero on success or negative errno on failure.
155 int sbitmap_init_node(struct sbitmap
*sb
, unsigned int depth
, int shift
,
156 gfp_t flags
, int node
);
159 * sbitmap_free() - Free memory used by a &struct sbitmap.
160 * @sb: Bitmap to free.
162 static inline void sbitmap_free(struct sbitmap
*sb
)
169 * sbitmap_resize() - Resize a &struct sbitmap.
170 * @sb: Bitmap to resize.
171 * @depth: New number of bits to resize to.
173 * Doesn't reallocate anything. It's up to the caller to ensure that the new
174 * depth doesn't exceed the depth that the sb was initialized with.
176 void sbitmap_resize(struct sbitmap
*sb
, unsigned int depth
);
179 * sbitmap_get() - Try to allocate a free bit from a &struct sbitmap.
180 * @sb: Bitmap to allocate from.
181 * @alloc_hint: Hint for where to start searching for a free bit.
182 * @round_robin: If true, be stricter about allocation order; always allocate
183 * starting from the last allocated bit. This is less efficient
184 * than the default behavior (false).
186 * This operation provides acquire barrier semantics if it succeeds.
188 * Return: Non-negative allocated bit number if successful, -1 otherwise.
190 int sbitmap_get(struct sbitmap
*sb
, unsigned int alloc_hint
, bool round_robin
);
193 * sbitmap_get_shallow() - Try to allocate a free bit from a &struct sbitmap,
194 * limiting the depth used from each word.
195 * @sb: Bitmap to allocate from.
196 * @alloc_hint: Hint for where to start searching for a free bit.
197 * @shallow_depth: The maximum number of bits to allocate from a single word.
199 * This rather specific operation allows for having multiple users with
200 * different allocation limits. E.g., there can be a high-priority class that
201 * uses sbitmap_get() and a low-priority class that uses sbitmap_get_shallow()
202 * with a @shallow_depth of (1 << (@sb->shift - 1)). Then, the low-priority
203 * class can only allocate half of the total bits in the bitmap, preventing it
204 * from starving out the high-priority class.
206 * Return: Non-negative allocated bit number if successful, -1 otherwise.
208 int sbitmap_get_shallow(struct sbitmap
*sb
, unsigned int alloc_hint
,
209 unsigned long shallow_depth
);
212 * sbitmap_any_bit_set() - Check for a set bit in a &struct sbitmap.
213 * @sb: Bitmap to check.
215 * Return: true if any bit in the bitmap is set, false otherwise.
217 bool sbitmap_any_bit_set(const struct sbitmap
*sb
);
220 * sbitmap_any_bit_clear() - Check for an unset bit in a &struct
222 * @sb: Bitmap to check.
224 * Return: true if any bit in the bitmap is clear, false otherwise.
226 bool sbitmap_any_bit_clear(const struct sbitmap
*sb
);
228 #define SB_NR_TO_INDEX(sb, bitnr) ((bitnr) >> (sb)->shift)
229 #define SB_NR_TO_BIT(sb, bitnr) ((bitnr) & ((1U << (sb)->shift) - 1U))
231 typedef bool (*sb_for_each_fn
)(struct sbitmap
*, unsigned int, void *);
234 * __sbitmap_for_each_set() - Iterate over each set bit in a &struct sbitmap.
235 * @start: Where to start the iteration.
236 * @sb: Bitmap to iterate over.
237 * @fn: Callback. Should return true to continue or false to break early.
238 * @data: Pointer to pass to callback.
240 * This is inline even though it's non-trivial so that the function calls to the
241 * callback will hopefully get optimized away.
243 static inline void __sbitmap_for_each_set(struct sbitmap
*sb
,
245 sb_for_each_fn fn
, void *data
)
249 unsigned int scanned
= 0;
251 if (start
>= sb
->depth
)
253 index
= SB_NR_TO_INDEX(sb
, start
);
254 nr
= SB_NR_TO_BIT(sb
, start
);
256 while (scanned
< sb
->depth
) {
258 unsigned int depth
= min_t(unsigned int,
259 sb
->map
[index
].depth
- nr
,
260 sb
->depth
- scanned
);
263 word
= sb
->map
[index
].word
& ~sb
->map
[index
].cleared
;
268 * On the first iteration of the outer loop, we need to add the
269 * bit offset back to the size of the word for find_next_bit().
270 * On all other iterations, nr is zero, so this is a noop.
274 nr
= find_next_bit(&word
, depth
, nr
);
277 if (!fn(sb
, (index
<< sb
->shift
) + nr
, data
))
284 if (++index
>= sb
->map_nr
)
290 * sbitmap_for_each_set() - Iterate over each set bit in a &struct sbitmap.
291 * @sb: Bitmap to iterate over.
292 * @fn: Callback. Should return true to continue or false to break early.
293 * @data: Pointer to pass to callback.
295 static inline void sbitmap_for_each_set(struct sbitmap
*sb
, sb_for_each_fn fn
,
298 __sbitmap_for_each_set(sb
, 0, fn
, data
);
301 static inline unsigned long *__sbitmap_word(struct sbitmap
*sb
,
304 return &sb
->map
[SB_NR_TO_INDEX(sb
, bitnr
)].word
;
307 /* Helpers equivalent to the operations in asm/bitops.h and linux/bitmap.h */
309 static inline void sbitmap_set_bit(struct sbitmap
*sb
, unsigned int bitnr
)
311 set_bit(SB_NR_TO_BIT(sb
, bitnr
), __sbitmap_word(sb
, bitnr
));
314 static inline void sbitmap_clear_bit(struct sbitmap
*sb
, unsigned int bitnr
)
316 clear_bit(SB_NR_TO_BIT(sb
, bitnr
), __sbitmap_word(sb
, bitnr
));
320 * This one is special, since it doesn't actually clear the bit, rather it
321 * sets the corresponding bit in the ->cleared mask instead. Paired with
322 * the caller doing sbitmap_deferred_clear() if a given index is full, which
323 * will clear the previously freed entries in the corresponding ->word.
325 static inline void sbitmap_deferred_clear_bit(struct sbitmap
*sb
, unsigned int bitnr
)
327 unsigned long *addr
= &sb
->map
[SB_NR_TO_INDEX(sb
, bitnr
)].cleared
;
329 set_bit(SB_NR_TO_BIT(sb
, bitnr
), addr
);
332 static inline void sbitmap_clear_bit_unlock(struct sbitmap
*sb
,
335 clear_bit_unlock(SB_NR_TO_BIT(sb
, bitnr
), __sbitmap_word(sb
, bitnr
));
338 static inline int sbitmap_test_bit(struct sbitmap
*sb
, unsigned int bitnr
)
340 return test_bit(SB_NR_TO_BIT(sb
, bitnr
), __sbitmap_word(sb
, bitnr
));
344 * sbitmap_show() - Dump &struct sbitmap information to a &struct seq_file.
345 * @sb: Bitmap to show.
346 * @m: struct seq_file to write to.
348 * This is intended for debugging. The format may change at any time.
350 void sbitmap_show(struct sbitmap
*sb
, struct seq_file
*m
);
353 * sbitmap_bitmap_show() - Write a hex dump of a &struct sbitmap to a &struct
355 * @sb: Bitmap to show.
356 * @m: struct seq_file to write to.
358 * This is intended for debugging. The output isn't guaranteed to be internally
361 void sbitmap_bitmap_show(struct sbitmap
*sb
, struct seq_file
*m
);
364 * sbitmap_queue_init_node() - Initialize a &struct sbitmap_queue on a specific
366 * @sbq: Bitmap queue to initialize.
367 * @depth: See sbitmap_init_node().
368 * @shift: See sbitmap_init_node().
369 * @round_robin: See sbitmap_get().
370 * @flags: Allocation flags.
371 * @node: Memory node to allocate on.
373 * Return: Zero on success or negative errno on failure.
375 int sbitmap_queue_init_node(struct sbitmap_queue
*sbq
, unsigned int depth
,
376 int shift
, bool round_robin
, gfp_t flags
, int node
);
379 * sbitmap_queue_free() - Free memory used by a &struct sbitmap_queue.
381 * @sbq: Bitmap queue to free.
383 static inline void sbitmap_queue_free(struct sbitmap_queue
*sbq
)
386 free_percpu(sbq
->alloc_hint
);
387 sbitmap_free(&sbq
->sb
);
391 * sbitmap_queue_resize() - Resize a &struct sbitmap_queue.
392 * @sbq: Bitmap queue to resize.
393 * @depth: New number of bits to resize to.
395 * Like sbitmap_resize(), this doesn't reallocate anything. It has to do
396 * some extra work on the &struct sbitmap_queue, so it's not safe to just
397 * resize the underlying &struct sbitmap.
399 void sbitmap_queue_resize(struct sbitmap_queue
*sbq
, unsigned int depth
);
402 * __sbitmap_queue_get() - Try to allocate a free bit from a &struct
403 * sbitmap_queue with preemption already disabled.
404 * @sbq: Bitmap queue to allocate from.
406 * Return: Non-negative allocated bit number if successful, -1 otherwise.
408 int __sbitmap_queue_get(struct sbitmap_queue
*sbq
);
411 * __sbitmap_queue_get_shallow() - Try to allocate a free bit from a &struct
412 * sbitmap_queue, limiting the depth used from each word, with preemption
414 * @sbq: Bitmap queue to allocate from.
415 * @shallow_depth: The maximum number of bits to allocate from a single word.
416 * See sbitmap_get_shallow().
418 * If you call this, make sure to call sbitmap_queue_min_shallow_depth() after
421 * Return: Non-negative allocated bit number if successful, -1 otherwise.
423 int __sbitmap_queue_get_shallow(struct sbitmap_queue
*sbq
,
424 unsigned int shallow_depth
);
427 * sbitmap_queue_get() - Try to allocate a free bit from a &struct
429 * @sbq: Bitmap queue to allocate from.
430 * @cpu: Output parameter; will contain the CPU we ran on (e.g., to be passed to
431 * sbitmap_queue_clear()).
433 * Return: Non-negative allocated bit number if successful, -1 otherwise.
435 static inline int sbitmap_queue_get(struct sbitmap_queue
*sbq
,
441 nr
= __sbitmap_queue_get(sbq
);
447 * sbitmap_queue_get_shallow() - Try to allocate a free bit from a &struct
448 * sbitmap_queue, limiting the depth used from each word.
449 * @sbq: Bitmap queue to allocate from.
450 * @cpu: Output parameter; will contain the CPU we ran on (e.g., to be passed to
451 * sbitmap_queue_clear()).
452 * @shallow_depth: The maximum number of bits to allocate from a single word.
453 * See sbitmap_get_shallow().
455 * If you call this, make sure to call sbitmap_queue_min_shallow_depth() after
458 * Return: Non-negative allocated bit number if successful, -1 otherwise.
460 static inline int sbitmap_queue_get_shallow(struct sbitmap_queue
*sbq
,
462 unsigned int shallow_depth
)
467 nr
= __sbitmap_queue_get_shallow(sbq
, shallow_depth
);
473 * sbitmap_queue_min_shallow_depth() - Inform a &struct sbitmap_queue of the
474 * minimum shallow depth that will be used.
475 * @sbq: Bitmap queue in question.
476 * @min_shallow_depth: The minimum shallow depth that will be passed to
477 * sbitmap_queue_get_shallow() or __sbitmap_queue_get_shallow().
479 * sbitmap_queue_clear() batches wakeups as an optimization. The batch size
480 * depends on the depth of the bitmap. Since the shallow allocation functions
481 * effectively operate with a different depth, the shallow depth must be taken
482 * into account when calculating the batch size. This function must be called
483 * with the minimum shallow depth that will be used. Failure to do so can result
486 void sbitmap_queue_min_shallow_depth(struct sbitmap_queue
*sbq
,
487 unsigned int min_shallow_depth
);
490 * sbitmap_queue_clear() - Free an allocated bit and wake up waiters on a
491 * &struct sbitmap_queue.
492 * @sbq: Bitmap to free from.
493 * @nr: Bit number to free.
494 * @cpu: CPU the bit was allocated on.
496 void sbitmap_queue_clear(struct sbitmap_queue
*sbq
, unsigned int nr
,
499 static inline int sbq_index_inc(int index
)
501 return (index
+ 1) & (SBQ_WAIT_QUEUES
- 1);
504 static inline void sbq_index_atomic_inc(atomic_t
*index
)
506 int old
= atomic_read(index
);
507 int new = sbq_index_inc(old
);
508 atomic_cmpxchg(index
, old
, new);
512 * sbq_wait_ptr() - Get the next wait queue to use for a &struct
514 * @sbq: Bitmap queue to wait on.
515 * @wait_index: A counter per "user" of @sbq.
517 static inline struct sbq_wait_state
*sbq_wait_ptr(struct sbitmap_queue
*sbq
,
518 atomic_t
*wait_index
)
520 struct sbq_wait_state
*ws
;
522 ws
= &sbq
->ws
[atomic_read(wait_index
)];
523 sbq_index_atomic_inc(wait_index
);
528 * sbitmap_queue_wake_all() - Wake up everything waiting on a &struct
530 * @sbq: Bitmap queue to wake up.
532 void sbitmap_queue_wake_all(struct sbitmap_queue
*sbq
);
535 * sbitmap_queue_wake_up() - Wake up some of waiters in one waitqueue
536 * on a &struct sbitmap_queue.
537 * @sbq: Bitmap queue to wake up.
539 void sbitmap_queue_wake_up(struct sbitmap_queue
*sbq
);
542 * sbitmap_queue_show() - Dump &struct sbitmap_queue information to a &struct
544 * @sbq: Bitmap queue to show.
545 * @m: struct seq_file to write to.
547 * This is intended for debugging. The format may change at any time.
549 void sbitmap_queue_show(struct sbitmap_queue
*sbq
, struct seq_file
*m
);
552 struct sbitmap_queue
*sbq
; /* if set, sbq_wait is accounted */
553 struct wait_queue_entry wait
;
556 #define DEFINE_SBQ_WAIT(name) \
557 struct sbq_wait name = { \
560 .private = current, \
561 .func = autoremove_wake_function, \
562 .entry = LIST_HEAD_INIT((name).wait.entry), \
567 * Wrapper around prepare_to_wait_exclusive(), which maintains some extra
570 void sbitmap_prepare_to_wait(struct sbitmap_queue
*sbq
,
571 struct sbq_wait_state
*ws
,
572 struct sbq_wait
*sbq_wait
, int state
);
575 * Must be paired with sbitmap_prepare_to_wait().
577 void sbitmap_finish_wait(struct sbitmap_queue
*sbq
, struct sbq_wait_state
*ws
,
578 struct sbq_wait
*sbq_wait
);
581 * Wrapper around add_wait_queue(), which maintains some extra internal state
583 void sbitmap_add_wait_queue(struct sbitmap_queue
*sbq
,
584 struct sbq_wait_state
*ws
,
585 struct sbq_wait
*sbq_wait
);
588 * Must be paired with sbitmap_add_wait_queue()
590 void sbitmap_del_wait_queue(struct sbq_wait
*sbq_wait
);
592 #endif /* __LINUX_SCALE_BITMAP_H */