4 * Copyright (C) 2013 Datera, Inc. Kent Overstreet
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation; either version 2, or (at
9 * your option) any later version.
11 * This program is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
17 #include <linux/bitmap.h>
18 #include <linux/bitops.h>
19 #include <linux/bug.h>
20 #include <linux/err.h>
21 #include <linux/export.h>
22 #include <linux/hardirq.h>
23 #include <linux/idr.h>
24 #include <linux/init.h>
25 #include <linux/kernel.h>
26 #include <linux/percpu.h>
27 #include <linux/sched.h>
28 #include <linux/slab.h>
29 #include <linux/string.h>
30 #include <linux/spinlock.h>
31 #include <linux/percpu_ida.h>
34 * Number of tags we move between the percpu freelist and the global freelist at
37 #define IDA_PCPU_BATCH_MOVE 32U
39 /* Max size of percpu freelist, */
40 #define IDA_PCPU_SIZE ((IDA_PCPU_BATCH_MOVE * 3) / 2)
42 struct percpu_ida_cpu
{
44 * Even though this is percpu, we need a lock for tag stealing by remote
49 /* nr_free/freelist form a stack of free IDs */
54 static inline void move_tags(unsigned *dst
, unsigned *dst_nr
,
55 unsigned *src
, unsigned *src_nr
,
59 memcpy(dst
+ *dst_nr
, src
+ *src_nr
, sizeof(unsigned) * nr
);
64 * Try to steal tags from a remote cpu's percpu freelist.
66 * We first check how many percpu freelists have tags - we don't steal tags
67 * unless enough percpu freelists have tags on them that it's possible more than
68 * half the total tags could be stuck on remote percpu freelists.
70 * Then we iterate through the cpus until we find some tags - we don't attempt
71 * to find the "best" cpu to steal from, to keep cacheline bouncing to a
74 static inline void steal_tags(struct percpu_ida
*pool
,
75 struct percpu_ida_cpu
*tags
)
77 unsigned cpus_have_tags
, cpu
= pool
->cpu_last_stolen
;
78 struct percpu_ida_cpu
*remote
;
80 for (cpus_have_tags
= cpumask_weight(&pool
->cpus_have_tags
);
81 cpus_have_tags
* IDA_PCPU_SIZE
> pool
->nr_tags
/ 2;
83 cpu
= cpumask_next(cpu
, &pool
->cpus_have_tags
);
85 if (cpu
>= nr_cpu_ids
) {
86 cpu
= cpumask_first(&pool
->cpus_have_tags
);
87 if (cpu
>= nr_cpu_ids
)
91 pool
->cpu_last_stolen
= cpu
;
92 remote
= per_cpu_ptr(pool
->tag_cpu
, cpu
);
94 cpumask_clear_cpu(cpu
, &pool
->cpus_have_tags
);
99 spin_lock(&remote
->lock
);
101 if (remote
->nr_free
) {
102 memcpy(tags
->freelist
,
104 sizeof(unsigned) * remote
->nr_free
);
106 tags
->nr_free
= remote
->nr_free
;
110 spin_unlock(&remote
->lock
);
118 * Pop up to IDA_PCPU_BATCH_MOVE IDs off the global freelist, and push them onto
119 * our percpu freelist:
121 static inline void alloc_global_tags(struct percpu_ida
*pool
,
122 struct percpu_ida_cpu
*tags
)
124 move_tags(tags
->freelist
, &tags
->nr_free
,
125 pool
->freelist
, &pool
->nr_free
,
126 min(pool
->nr_free
, IDA_PCPU_BATCH_MOVE
));
129 static inline unsigned alloc_local_tag(struct percpu_ida
*pool
,
130 struct percpu_ida_cpu
*tags
)
134 spin_lock(&tags
->lock
);
136 tag
= tags
->freelist
[--tags
->nr_free
];
137 spin_unlock(&tags
->lock
);
143 * percpu_ida_alloc - allocate a tag
144 * @pool: pool to allocate from
145 * @state: task state for prepare_to_wait
147 * Returns a tag - an integer in the range [0..nr_tags) (passed to
148 * tag_pool_init()), or otherwise -ENOSPC on allocation failure.
150 * Safe to be called from interrupt context (assuming it isn't passed
151 * TASK_UNINTERRUPTIBLE | TASK_INTERRUPTIBLE, of course).
153 * @gfp indicates whether or not to wait until a free id is available (it's not
154 * used for internal memory allocations); thus if passed __GFP_WAIT we may sleep
155 * however long it takes until another thread frees an id (same semantics as a
158 * Will not fail if passed TASK_UNINTERRUPTIBLE | TASK_INTERRUPTIBLE.
160 int percpu_ida_alloc(struct percpu_ida
*pool
, int state
)
163 struct percpu_ida_cpu
*tags
;
167 local_irq_save(flags
);
168 tags
= this_cpu_ptr(pool
->tag_cpu
);
171 tag
= alloc_local_tag(pool
, tags
);
172 if (likely(tag
>= 0)) {
173 local_irq_restore(flags
);
178 spin_lock(&pool
->lock
);
181 * prepare_to_wait() must come before steal_tags(), in case
182 * percpu_ida_free() on another cpu flips a bit in
185 * global lock held and irqs disabled, don't need percpu lock
187 if (state
!= TASK_RUNNING
)
188 prepare_to_wait(&pool
->wait
, &wait
, state
);
191 alloc_global_tags(pool
, tags
);
193 steal_tags(pool
, tags
);
196 tag
= tags
->freelist
[--tags
->nr_free
];
198 cpumask_set_cpu(smp_processor_id(),
199 &pool
->cpus_have_tags
);
202 spin_unlock(&pool
->lock
);
203 local_irq_restore(flags
);
205 if (tag
>= 0 || state
== TASK_RUNNING
)
208 if (signal_pending_state(state
, current
)) {
215 local_irq_save(flags
);
216 tags
= this_cpu_ptr(pool
->tag_cpu
);
218 if (state
!= TASK_RUNNING
)
219 finish_wait(&pool
->wait
, &wait
);
223 EXPORT_SYMBOL_GPL(percpu_ida_alloc
);
226 * percpu_ida_free - free a tag
227 * @pool: pool @tag was allocated from
228 * @tag: a tag previously allocated with percpu_ida_alloc()
230 * Safe to be called from interrupt context.
232 void percpu_ida_free(struct percpu_ida
*pool
, unsigned tag
)
234 struct percpu_ida_cpu
*tags
;
238 BUG_ON(tag
>= pool
->nr_tags
);
240 local_irq_save(flags
);
241 tags
= this_cpu_ptr(pool
->tag_cpu
);
243 spin_lock(&tags
->lock
);
244 tags
->freelist
[tags
->nr_free
++] = tag
;
246 nr_free
= tags
->nr_free
;
247 spin_unlock(&tags
->lock
);
250 cpumask_set_cpu(smp_processor_id(),
251 &pool
->cpus_have_tags
);
252 wake_up(&pool
->wait
);
255 if (nr_free
== IDA_PCPU_SIZE
) {
256 spin_lock(&pool
->lock
);
259 * Global lock held and irqs disabled, don't need percpu
262 if (tags
->nr_free
== IDA_PCPU_SIZE
) {
263 move_tags(pool
->freelist
, &pool
->nr_free
,
264 tags
->freelist
, &tags
->nr_free
,
265 IDA_PCPU_BATCH_MOVE
);
267 wake_up(&pool
->wait
);
269 spin_unlock(&pool
->lock
);
272 local_irq_restore(flags
);
274 EXPORT_SYMBOL_GPL(percpu_ida_free
);
277 * percpu_ida_destroy - release a tag pool's resources
278 * @pool: pool to free
280 * Frees the resources allocated by percpu_ida_init().
282 void percpu_ida_destroy(struct percpu_ida
*pool
)
284 free_percpu(pool
->tag_cpu
);
285 free_pages((unsigned long) pool
->freelist
,
286 get_order(pool
->nr_tags
* sizeof(unsigned)));
288 EXPORT_SYMBOL_GPL(percpu_ida_destroy
);
291 * percpu_ida_init - initialize a percpu tag pool
292 * @pool: pool to initialize
293 * @nr_tags: number of tags that will be available for allocation
295 * Initializes @pool so that it can be used to allocate tags - integers in the
296 * range [0, nr_tags). Typically, they'll be used by driver code to refer to a
297 * preallocated array of tag structures.
299 * Allocation is percpu, but sharding is limited by nr_tags - for best
300 * performance, the workload should not span more cpus than nr_tags / 128.
302 int percpu_ida_init(struct percpu_ida
*pool
, unsigned long nr_tags
)
304 unsigned i
, cpu
, order
;
306 memset(pool
, 0, sizeof(*pool
));
308 init_waitqueue_head(&pool
->wait
);
309 spin_lock_init(&pool
->lock
);
310 pool
->nr_tags
= nr_tags
;
312 /* Guard against overflow */
313 if (nr_tags
> (unsigned) INT_MAX
+ 1) {
314 pr_err("percpu_ida_init(): nr_tags too large\n");
318 order
= get_order(nr_tags
* sizeof(unsigned));
319 pool
->freelist
= (void *) __get_free_pages(GFP_KERNEL
, order
);
323 for (i
= 0; i
< nr_tags
; i
++)
324 pool
->freelist
[i
] = i
;
326 pool
->nr_free
= nr_tags
;
328 pool
->tag_cpu
= __alloc_percpu(sizeof(struct percpu_ida_cpu
) +
329 IDA_PCPU_SIZE
* sizeof(unsigned),
334 for_each_possible_cpu(cpu
)
335 spin_lock_init(&per_cpu_ptr(pool
->tag_cpu
, cpu
)->lock
);
339 percpu_ida_destroy(pool
);
342 EXPORT_SYMBOL_GPL(percpu_ida_init
);