blob: 6470e7710231a84d75dc793831bc9f92e178f8bb [file] [log] [blame]
Tejun Heofbf59bc2009-02-20 16:29:08 +09001/*
Tejun Heo88999a82010-04-09 18:57:01 +09002 * mm/percpu.c - percpu memory allocator
Tejun Heofbf59bc2009-02-20 16:29:08 +09003 *
4 * Copyright (C) 2009 SUSE Linux Products GmbH
5 * Copyright (C) 2009 Tejun Heo <tj@kernel.org>
6 *
7 * This file is released under the GPLv2.
8 *
9 * This is percpu allocator which can handle both static and dynamic
Tejun Heo88999a82010-04-09 18:57:01 +090010 * areas. Percpu areas are allocated in chunks. Each chunk is
11 * consisted of boot-time determined number of units and the first
12 * chunk is used for static percpu variables in the kernel image
Tejun Heo2f39e632009-07-04 08:11:00 +090013 * (special boot time alloc/init handling necessary as these areas
14 * need to be brought up before allocation services are running).
15 * Unit grows as necessary and all units grow or shrink in unison.
Tejun Heo88999a82010-04-09 18:57:01 +090016 * When a chunk is filled up, another chunk is allocated.
Tejun Heofbf59bc2009-02-20 16:29:08 +090017 *
18 * c0 c1 c2
19 * ------------------- ------------------- ------------
20 * | u0 | u1 | u2 | u3 | | u0 | u1 | u2 | u3 | | u0 | u1 | u
21 * ------------------- ...... ------------------- .... ------------
22 *
23 * Allocation is done in offset-size areas of single unit space. Ie,
24 * an area of 512 bytes at 6k in c1 occupies 512 bytes at 6k of c1:u0,
Tejun Heo2f39e632009-07-04 08:11:00 +090025 * c1:u1, c1:u2 and c1:u3. On UMA, units corresponds directly to
26 * cpus. On NUMA, the mapping can be non-linear and even sparse.
27 * Percpu access can be done by configuring percpu base registers
28 * according to cpu to unit mapping and pcpu_unit_size.
Tejun Heofbf59bc2009-02-20 16:29:08 +090029 *
Tejun Heo2f39e632009-07-04 08:11:00 +090030 * There are usually many small percpu allocations many of them being
31 * as small as 4 bytes. The allocator organizes chunks into lists
Tejun Heofbf59bc2009-02-20 16:29:08 +090032 * according to free size and tries to allocate from the fullest one.
33 * Each chunk keeps the maximum contiguous area size hint which is
34 * guaranteed to be eqaul to or larger than the maximum contiguous
35 * area in the chunk. This helps the allocator not to iterate the
36 * chunk maps unnecessarily.
37 *
38 * Allocation state in each chunk is kept using an array of integers
39 * on chunk->map. A positive value in the map represents a free
40 * region and negative allocated. Allocation inside a chunk is done
41 * by scanning this map sequentially and serving the first matching
42 * entry. This is mostly copied from the percpu_modalloc() allocator.
Christoph Lametere1b9aa32009-04-02 13:21:44 +090043 * Chunks can be determined from the address using the index field
44 * in the page struct. The index field contains a pointer to the chunk.
Tejun Heofbf59bc2009-02-20 16:29:08 +090045 *
46 * To use this allocator, arch code should do the followings.
47 *
Tejun Heofbf59bc2009-02-20 16:29:08 +090048 * - define __addr_to_pcpu_ptr() and __pcpu_ptr_to_addr() to translate
Tejun Heoe0100982009-03-10 16:27:48 +090049 * regular address to percpu pointer and back if they need to be
50 * different from the default
Tejun Heofbf59bc2009-02-20 16:29:08 +090051 *
Tejun Heo8d408b42009-02-24 11:57:21 +090052 * - use pcpu_setup_first_chunk() during percpu area initialization to
53 * setup the first chunk containing the kernel static percpu area
Tejun Heofbf59bc2009-02-20 16:29:08 +090054 */
55
56#include <linux/bitmap.h>
57#include <linux/bootmem.h>
Tejun Heofd1e8a12009-08-14 15:00:51 +090058#include <linux/err.h>
Tejun Heofbf59bc2009-02-20 16:29:08 +090059#include <linux/list.h>
Tejun Heoa530b792009-07-04 08:11:00 +090060#include <linux/log2.h>
Tejun Heofbf59bc2009-02-20 16:29:08 +090061#include <linux/mm.h>
62#include <linux/module.h>
63#include <linux/mutex.h>
64#include <linux/percpu.h>
65#include <linux/pfn.h>
Tejun Heofbf59bc2009-02-20 16:29:08 +090066#include <linux/slab.h>
Tejun Heoccea34b2009-03-07 00:44:13 +090067#include <linux/spinlock.h>
Tejun Heofbf59bc2009-02-20 16:29:08 +090068#include <linux/vmalloc.h>
Tejun Heoa56dbdd2009-03-07 00:44:11 +090069#include <linux/workqueue.h>
Tejun Heofbf59bc2009-02-20 16:29:08 +090070
71#include <asm/cacheflush.h>
Tejun Heoe0100982009-03-10 16:27:48 +090072#include <asm/sections.h>
Tejun Heofbf59bc2009-02-20 16:29:08 +090073#include <asm/tlbflush.h>
Vivek Goyal3b034b02009-11-24 15:50:03 +090074#include <asm/io.h>
Tejun Heofbf59bc2009-02-20 16:29:08 +090075
Tejun Heofbf59bc2009-02-20 16:29:08 +090076#define PCPU_SLOT_BASE_SHIFT 5 /* 1-31 shares the same slot */
77#define PCPU_DFL_MAP_ALLOC 16 /* start a map with 16 ents */
78
Tejun Heoe0100982009-03-10 16:27:48 +090079/* default addr <-> pcpu_ptr mapping, override in asm/percpu.h if necessary */
80#ifndef __addr_to_pcpu_ptr
81#define __addr_to_pcpu_ptr(addr) \
Tejun Heo43cf38e2010-02-02 14:38:57 +090082 (void __percpu *)((unsigned long)(addr) - \
83 (unsigned long)pcpu_base_addr + \
84 (unsigned long)__per_cpu_start)
Tejun Heoe0100982009-03-10 16:27:48 +090085#endif
86#ifndef __pcpu_ptr_to_addr
87#define __pcpu_ptr_to_addr(ptr) \
Tejun Heo43cf38e2010-02-02 14:38:57 +090088 (void __force *)((unsigned long)(ptr) + \
89 (unsigned long)pcpu_base_addr - \
90 (unsigned long)__per_cpu_start)
Tejun Heoe0100982009-03-10 16:27:48 +090091#endif
92
Tejun Heofbf59bc2009-02-20 16:29:08 +090093struct pcpu_chunk {
94 struct list_head list; /* linked to pcpu_slot lists */
Tejun Heofbf59bc2009-02-20 16:29:08 +090095 int free_size; /* free bytes in the chunk */
96 int contig_hint; /* max contiguous size hint */
Tejun Heobba174f2009-08-14 15:00:51 +090097 void *base_addr; /* base address of this chunk */
Tejun Heofbf59bc2009-02-20 16:29:08 +090098 int map_used; /* # of map entries used */
99 int map_alloc; /* # of map entries allocated */
100 int *map; /* allocation map */
Tejun Heo88999a82010-04-09 18:57:01 +0900101 void *data; /* chunk data */
Tejun Heo8d408b42009-02-24 11:57:21 +0900102 bool immutable; /* no [de]population allowed */
Tejun Heoce3141a2009-07-04 08:11:00 +0900103 unsigned long populated[]; /* populated bitmap */
Tejun Heofbf59bc2009-02-20 16:29:08 +0900104};
105
Tejun Heo40150d32009-02-24 12:32:28 +0900106static int pcpu_unit_pages __read_mostly;
107static int pcpu_unit_size __read_mostly;
Tejun Heo2f39e632009-07-04 08:11:00 +0900108static int pcpu_nr_units __read_mostly;
Tejun Heo65632972009-08-14 15:00:52 +0900109static int pcpu_atom_size __read_mostly;
Tejun Heo40150d32009-02-24 12:32:28 +0900110static int pcpu_nr_slots __read_mostly;
111static size_t pcpu_chunk_struct_size __read_mostly;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900112
Tejun Heo2f39e632009-07-04 08:11:00 +0900113/* cpus with the lowest and highest unit numbers */
114static unsigned int pcpu_first_unit_cpu __read_mostly;
115static unsigned int pcpu_last_unit_cpu __read_mostly;
116
Tejun Heofbf59bc2009-02-20 16:29:08 +0900117/* the address of the first chunk which starts with the kernel static area */
Tejun Heo40150d32009-02-24 12:32:28 +0900118void *pcpu_base_addr __read_mostly;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900119EXPORT_SYMBOL_GPL(pcpu_base_addr);
120
Tejun Heofb435d52009-08-14 15:00:51 +0900121static const int *pcpu_unit_map __read_mostly; /* cpu -> unit */
122const unsigned long *pcpu_unit_offsets __read_mostly; /* cpu -> unit offset */
Tejun Heo2f39e632009-07-04 08:11:00 +0900123
Tejun Heo65632972009-08-14 15:00:52 +0900124/* group information, used for vm allocation */
125static int pcpu_nr_groups __read_mostly;
126static const unsigned long *pcpu_group_offsets __read_mostly;
127static const size_t *pcpu_group_sizes __read_mostly;
128
Tejun Heoae9e6bc2009-04-02 13:19:54 +0900129/*
130 * The first chunk which always exists. Note that unlike other
131 * chunks, this one can be allocated and mapped in several different
132 * ways and thus often doesn't live in the vmalloc area.
133 */
134static struct pcpu_chunk *pcpu_first_chunk;
135
136/*
137 * Optional reserved chunk. This chunk reserves part of the first
138 * chunk and serves it for reserved allocations. The amount of
139 * reserved offset is in pcpu_reserved_chunk_limit. When reserved
140 * area doesn't exist, the following variables contain NULL and 0
141 * respectively.
142 */
Tejun Heoedcb4632009-03-06 14:33:59 +0900143static struct pcpu_chunk *pcpu_reserved_chunk;
Tejun Heoedcb4632009-03-06 14:33:59 +0900144static int pcpu_reserved_chunk_limit;
145
Tejun Heofbf59bc2009-02-20 16:29:08 +0900146/*
Tejun Heoccea34b2009-03-07 00:44:13 +0900147 * Synchronization rules.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900148 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900149 * There are two locks - pcpu_alloc_mutex and pcpu_lock. The former
Tejun Heoce3141a2009-07-04 08:11:00 +0900150 * protects allocation/reclaim paths, chunks, populated bitmap and
151 * vmalloc mapping. The latter is a spinlock and protects the index
152 * data structures - chunk slots, chunks and area maps in chunks.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900153 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900154 * During allocation, pcpu_alloc_mutex is kept locked all the time and
155 * pcpu_lock is grabbed and released as necessary. All actual memory
Jiri Kosina403a91b2009-10-29 00:25:59 +0900156 * allocations are done using GFP_KERNEL with pcpu_lock released. In
157 * general, percpu memory can't be allocated with irq off but
158 * irqsave/restore are still used in alloc path so that it can be used
159 * from early init path - sched_init() specifically.
Tejun Heoccea34b2009-03-07 00:44:13 +0900160 *
161 * Free path accesses and alters only the index data structures, so it
162 * can be safely called from atomic context. When memory needs to be
163 * returned to the system, free path schedules reclaim_work which
164 * grabs both pcpu_alloc_mutex and pcpu_lock, unlinks chunks to be
165 * reclaimed, release both locks and frees the chunks. Note that it's
166 * necessary to grab both locks to remove a chunk from circulation as
167 * allocation path might be referencing the chunk with only
168 * pcpu_alloc_mutex locked.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900169 */
Tejun Heoccea34b2009-03-07 00:44:13 +0900170static DEFINE_MUTEX(pcpu_alloc_mutex); /* protects whole alloc and reclaim */
171static DEFINE_SPINLOCK(pcpu_lock); /* protects index data structures */
Tejun Heofbf59bc2009-02-20 16:29:08 +0900172
Tejun Heo40150d32009-02-24 12:32:28 +0900173static struct list_head *pcpu_slot __read_mostly; /* chunk list slots */
Tejun Heofbf59bc2009-02-20 16:29:08 +0900174
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900175/* reclaim work to release fully free chunks, scheduled from free path */
176static void pcpu_reclaim(struct work_struct *work);
177static DECLARE_WORK(pcpu_reclaim_work, pcpu_reclaim);
178
Tejun Heo020ec652010-04-09 18:57:00 +0900179static bool pcpu_addr_in_first_chunk(void *addr)
180{
181 void *first_start = pcpu_first_chunk->base_addr;
182
183 return addr >= first_start && addr < first_start + pcpu_unit_size;
184}
185
186static bool pcpu_addr_in_reserved_chunk(void *addr)
187{
188 void *first_start = pcpu_first_chunk->base_addr;
189
190 return addr >= first_start &&
191 addr < first_start + pcpu_reserved_chunk_limit;
192}
193
Tejun Heod9b55ee2009-02-24 11:57:21 +0900194static int __pcpu_size_to_slot(int size)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900195{
Tejun Heocae3aeb2009-02-21 16:56:23 +0900196 int highbit = fls(size); /* size is in bytes */
Tejun Heofbf59bc2009-02-20 16:29:08 +0900197 return max(highbit - PCPU_SLOT_BASE_SHIFT + 2, 1);
198}
199
Tejun Heod9b55ee2009-02-24 11:57:21 +0900200static int pcpu_size_to_slot(int size)
201{
202 if (size == pcpu_unit_size)
203 return pcpu_nr_slots - 1;
204 return __pcpu_size_to_slot(size);
205}
206
Tejun Heofbf59bc2009-02-20 16:29:08 +0900207static int pcpu_chunk_slot(const struct pcpu_chunk *chunk)
208{
209 if (chunk->free_size < sizeof(int) || chunk->contig_hint < sizeof(int))
210 return 0;
211
212 return pcpu_size_to_slot(chunk->free_size);
213}
214
Tejun Heo88999a82010-04-09 18:57:01 +0900215/* set the pointer to a chunk in a page struct */
216static void pcpu_set_page_chunk(struct page *page, struct pcpu_chunk *pcpu)
217{
218 page->index = (unsigned long)pcpu;
219}
220
221/* obtain pointer to a chunk from a page struct */
222static struct pcpu_chunk *pcpu_get_page_chunk(struct page *page)
223{
224 return (struct pcpu_chunk *)page->index;
225}
226
227static int __maybe_unused pcpu_page_idx(unsigned int cpu, int page_idx)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900228{
Tejun Heo2f39e632009-07-04 08:11:00 +0900229 return pcpu_unit_map[cpu] * pcpu_unit_pages + page_idx;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900230}
231
Tejun Heo9983b6f2010-06-18 11:44:31 +0200232static unsigned long pcpu_chunk_addr(struct pcpu_chunk *chunk,
233 unsigned int cpu, int page_idx)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900234{
Tejun Heobba174f2009-08-14 15:00:51 +0900235 return (unsigned long)chunk->base_addr + pcpu_unit_offsets[cpu] +
Tejun Heofb435d52009-08-14 15:00:51 +0900236 (page_idx << PAGE_SHIFT);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900237}
238
Tejun Heo88999a82010-04-09 18:57:01 +0900239static void __maybe_unused pcpu_next_unpop(struct pcpu_chunk *chunk,
240 int *rs, int *re, int end)
Tejun Heoce3141a2009-07-04 08:11:00 +0900241{
242 *rs = find_next_zero_bit(chunk->populated, end, *rs);
243 *re = find_next_bit(chunk->populated, end, *rs + 1);
244}
245
Tejun Heo88999a82010-04-09 18:57:01 +0900246static void __maybe_unused pcpu_next_pop(struct pcpu_chunk *chunk,
247 int *rs, int *re, int end)
Tejun Heoce3141a2009-07-04 08:11:00 +0900248{
249 *rs = find_next_bit(chunk->populated, end, *rs);
250 *re = find_next_zero_bit(chunk->populated, end, *rs + 1);
251}
252
253/*
254 * (Un)populated page region iterators. Iterate over (un)populated
255 * page regions betwen @start and @end in @chunk. @rs and @re should
256 * be integer variables and will be set to start and end page index of
257 * the current region.
258 */
259#define pcpu_for_each_unpop_region(chunk, rs, re, start, end) \
260 for ((rs) = (start), pcpu_next_unpop((chunk), &(rs), &(re), (end)); \
261 (rs) < (re); \
262 (rs) = (re) + 1, pcpu_next_unpop((chunk), &(rs), &(re), (end)))
263
264#define pcpu_for_each_pop_region(chunk, rs, re, start, end) \
265 for ((rs) = (start), pcpu_next_pop((chunk), &(rs), &(re), (end)); \
266 (rs) < (re); \
267 (rs) = (re) + 1, pcpu_next_pop((chunk), &(rs), &(re), (end)))
268
Tejun Heofbf59bc2009-02-20 16:29:08 +0900269/**
Tejun Heo1880d932009-03-07 00:44:09 +0900270 * pcpu_mem_alloc - allocate memory
271 * @size: bytes to allocate
Tejun Heofbf59bc2009-02-20 16:29:08 +0900272 *
Tejun Heo1880d932009-03-07 00:44:09 +0900273 * Allocate @size bytes. If @size is smaller than PAGE_SIZE,
274 * kzalloc() is used; otherwise, vmalloc() is used. The returned
275 * memory is always zeroed.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900276 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900277 * CONTEXT:
278 * Does GFP_KERNEL allocation.
279 *
Tejun Heofbf59bc2009-02-20 16:29:08 +0900280 * RETURNS:
Tejun Heo1880d932009-03-07 00:44:09 +0900281 * Pointer to the allocated area on success, NULL on failure.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900282 */
Tejun Heo1880d932009-03-07 00:44:09 +0900283static void *pcpu_mem_alloc(size_t size)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900284{
Tejun Heofbf59bc2009-02-20 16:29:08 +0900285 if (size <= PAGE_SIZE)
Tejun Heo1880d932009-03-07 00:44:09 +0900286 return kzalloc(size, GFP_KERNEL);
287 else {
288 void *ptr = vmalloc(size);
289 if (ptr)
290 memset(ptr, 0, size);
291 return ptr;
292 }
293}
Tejun Heofbf59bc2009-02-20 16:29:08 +0900294
Tejun Heo1880d932009-03-07 00:44:09 +0900295/**
296 * pcpu_mem_free - free memory
297 * @ptr: memory to free
298 * @size: size of the area
299 *
300 * Free @ptr. @ptr should have been allocated using pcpu_mem_alloc().
301 */
302static void pcpu_mem_free(void *ptr, size_t size)
303{
304 if (size <= PAGE_SIZE)
305 kfree(ptr);
306 else
307 vfree(ptr);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900308}
309
310/**
311 * pcpu_chunk_relocate - put chunk in the appropriate chunk slot
312 * @chunk: chunk of interest
313 * @oslot: the previous slot it was on
314 *
315 * This function is called after an allocation or free changed @chunk.
316 * New slot according to the changed state is determined and @chunk is
Tejun Heoedcb4632009-03-06 14:33:59 +0900317 * moved to the slot. Note that the reserved chunk is never put on
318 * chunk slots.
Tejun Heoccea34b2009-03-07 00:44:13 +0900319 *
320 * CONTEXT:
321 * pcpu_lock.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900322 */
323static void pcpu_chunk_relocate(struct pcpu_chunk *chunk, int oslot)
324{
325 int nslot = pcpu_chunk_slot(chunk);
326
Tejun Heoedcb4632009-03-06 14:33:59 +0900327 if (chunk != pcpu_reserved_chunk && oslot != nslot) {
Tejun Heofbf59bc2009-02-20 16:29:08 +0900328 if (oslot < nslot)
329 list_move(&chunk->list, &pcpu_slot[nslot]);
330 else
331 list_move_tail(&chunk->list, &pcpu_slot[nslot]);
332 }
333}
334
Tejun Heofbf59bc2009-02-20 16:29:08 +0900335/**
Tejun Heo833af842009-11-11 15:35:18 +0900336 * pcpu_need_to_extend - determine whether chunk area map needs to be extended
337 * @chunk: chunk of interest
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900338 *
Tejun Heo833af842009-11-11 15:35:18 +0900339 * Determine whether area map of @chunk needs to be extended to
340 * accomodate a new allocation.
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900341 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900342 * CONTEXT:
Tejun Heo833af842009-11-11 15:35:18 +0900343 * pcpu_lock.
Tejun Heoccea34b2009-03-07 00:44:13 +0900344 *
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900345 * RETURNS:
Tejun Heo833af842009-11-11 15:35:18 +0900346 * New target map allocation length if extension is necessary, 0
347 * otherwise.
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900348 */
Tejun Heo833af842009-11-11 15:35:18 +0900349static int pcpu_need_to_extend(struct pcpu_chunk *chunk)
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900350{
351 int new_alloc;
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900352
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900353 if (chunk->map_alloc >= chunk->map_used + 2)
354 return 0;
355
356 new_alloc = PCPU_DFL_MAP_ALLOC;
357 while (new_alloc < chunk->map_used + 2)
358 new_alloc *= 2;
359
Tejun Heo833af842009-11-11 15:35:18 +0900360 return new_alloc;
361}
362
363/**
364 * pcpu_extend_area_map - extend area map of a chunk
365 * @chunk: chunk of interest
366 * @new_alloc: new target allocation length of the area map
367 *
368 * Extend area map of @chunk to have @new_alloc entries.
369 *
370 * CONTEXT:
371 * Does GFP_KERNEL allocation. Grabs and releases pcpu_lock.
372 *
373 * RETURNS:
374 * 0 on success, -errno on failure.
375 */
376static int pcpu_extend_area_map(struct pcpu_chunk *chunk, int new_alloc)
377{
378 int *old = NULL, *new = NULL;
379 size_t old_size = 0, new_size = new_alloc * sizeof(new[0]);
380 unsigned long flags;
381
382 new = pcpu_mem_alloc(new_size);
383 if (!new)
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900384 return -ENOMEM;
Tejun Heoccea34b2009-03-07 00:44:13 +0900385
Tejun Heo833af842009-11-11 15:35:18 +0900386 /* acquire pcpu_lock and switch to new area map */
387 spin_lock_irqsave(&pcpu_lock, flags);
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900388
Tejun Heo833af842009-11-11 15:35:18 +0900389 if (new_alloc <= chunk->map_alloc)
390 goto out_unlock;
391
392 old_size = chunk->map_alloc * sizeof(chunk->map[0]);
393 memcpy(new, chunk->map, old_size);
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900394
395 /*
396 * map_alloc < PCPU_DFL_MAP_ALLOC indicates that the chunk is
397 * one of the first chunks and still using static map.
398 */
399 if (chunk->map_alloc >= PCPU_DFL_MAP_ALLOC)
Tejun Heo833af842009-11-11 15:35:18 +0900400 old = chunk->map;
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900401
402 chunk->map_alloc = new_alloc;
403 chunk->map = new;
Tejun Heo833af842009-11-11 15:35:18 +0900404 new = NULL;
405
406out_unlock:
407 spin_unlock_irqrestore(&pcpu_lock, flags);
408
409 /*
410 * pcpu_mem_free() might end up calling vfree() which uses
411 * IRQ-unsafe lock and thus can't be called under pcpu_lock.
412 */
413 pcpu_mem_free(old, old_size);
414 pcpu_mem_free(new, new_size);
415
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900416 return 0;
417}
418
419/**
Tejun Heofbf59bc2009-02-20 16:29:08 +0900420 * pcpu_split_block - split a map block
421 * @chunk: chunk of interest
422 * @i: index of map block to split
Tejun Heocae3aeb2009-02-21 16:56:23 +0900423 * @head: head size in bytes (can be 0)
424 * @tail: tail size in bytes (can be 0)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900425 *
426 * Split the @i'th map block into two or three blocks. If @head is
427 * non-zero, @head bytes block is inserted before block @i moving it
428 * to @i+1 and reducing its size by @head bytes.
429 *
430 * If @tail is non-zero, the target block, which can be @i or @i+1
431 * depending on @head, is reduced by @tail bytes and @tail byte block
432 * is inserted after the target block.
433 *
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900434 * @chunk->map must have enough free slots to accomodate the split.
Tejun Heoccea34b2009-03-07 00:44:13 +0900435 *
436 * CONTEXT:
437 * pcpu_lock.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900438 */
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900439static void pcpu_split_block(struct pcpu_chunk *chunk, int i,
440 int head, int tail)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900441{
442 int nr_extra = !!head + !!tail;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900443
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900444 BUG_ON(chunk->map_alloc < chunk->map_used + nr_extra);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900445
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900446 /* insert new subblocks */
Tejun Heofbf59bc2009-02-20 16:29:08 +0900447 memmove(&chunk->map[i + nr_extra], &chunk->map[i],
448 sizeof(chunk->map[0]) * (chunk->map_used - i));
449 chunk->map_used += nr_extra;
450
451 if (head) {
452 chunk->map[i + 1] = chunk->map[i] - head;
453 chunk->map[i++] = head;
454 }
455 if (tail) {
456 chunk->map[i++] -= tail;
457 chunk->map[i] = tail;
458 }
Tejun Heofbf59bc2009-02-20 16:29:08 +0900459}
460
461/**
462 * pcpu_alloc_area - allocate area from a pcpu_chunk
463 * @chunk: chunk of interest
Tejun Heocae3aeb2009-02-21 16:56:23 +0900464 * @size: wanted size in bytes
Tejun Heofbf59bc2009-02-20 16:29:08 +0900465 * @align: wanted align
466 *
467 * Try to allocate @size bytes area aligned at @align from @chunk.
468 * Note that this function only allocates the offset. It doesn't
469 * populate or map the area.
470 *
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900471 * @chunk->map must have at least two free slots.
472 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900473 * CONTEXT:
474 * pcpu_lock.
475 *
Tejun Heofbf59bc2009-02-20 16:29:08 +0900476 * RETURNS:
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900477 * Allocated offset in @chunk on success, -1 if no matching area is
478 * found.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900479 */
480static int pcpu_alloc_area(struct pcpu_chunk *chunk, int size, int align)
481{
482 int oslot = pcpu_chunk_slot(chunk);
483 int max_contig = 0;
484 int i, off;
485
Tejun Heofbf59bc2009-02-20 16:29:08 +0900486 for (i = 0, off = 0; i < chunk->map_used; off += abs(chunk->map[i++])) {
487 bool is_last = i + 1 == chunk->map_used;
488 int head, tail;
489
490 /* extra for alignment requirement */
491 head = ALIGN(off, align) - off;
492 BUG_ON(i == 0 && head != 0);
493
494 if (chunk->map[i] < 0)
495 continue;
496 if (chunk->map[i] < head + size) {
497 max_contig = max(chunk->map[i], max_contig);
498 continue;
499 }
500
501 /*
502 * If head is small or the previous block is free,
503 * merge'em. Note that 'small' is defined as smaller
504 * than sizeof(int), which is very small but isn't too
505 * uncommon for percpu allocations.
506 */
507 if (head && (head < sizeof(int) || chunk->map[i - 1] > 0)) {
508 if (chunk->map[i - 1] > 0)
509 chunk->map[i - 1] += head;
510 else {
511 chunk->map[i - 1] -= head;
512 chunk->free_size -= head;
513 }
514 chunk->map[i] -= head;
515 off += head;
516 head = 0;
517 }
518
519 /* if tail is small, just keep it around */
520 tail = chunk->map[i] - head - size;
521 if (tail < sizeof(int))
522 tail = 0;
523
524 /* split if warranted */
525 if (head || tail) {
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900526 pcpu_split_block(chunk, i, head, tail);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900527 if (head) {
528 i++;
529 off += head;
530 max_contig = max(chunk->map[i - 1], max_contig);
531 }
532 if (tail)
533 max_contig = max(chunk->map[i + 1], max_contig);
534 }
535
536 /* update hint and mark allocated */
537 if (is_last)
538 chunk->contig_hint = max_contig; /* fully scanned */
539 else
540 chunk->contig_hint = max(chunk->contig_hint,
541 max_contig);
542
543 chunk->free_size -= chunk->map[i];
544 chunk->map[i] = -chunk->map[i];
545
546 pcpu_chunk_relocate(chunk, oslot);
547 return off;
548 }
549
550 chunk->contig_hint = max_contig; /* fully scanned */
551 pcpu_chunk_relocate(chunk, oslot);
552
Tejun Heo9f7dcf22009-03-07 00:44:09 +0900553 /* tell the upper layer that this chunk has no matching area */
554 return -1;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900555}
556
557/**
558 * pcpu_free_area - free area to a pcpu_chunk
559 * @chunk: chunk of interest
560 * @freeme: offset of area to free
561 *
562 * Free area starting from @freeme to @chunk. Note that this function
563 * only modifies the allocation map. It doesn't depopulate or unmap
564 * the area.
Tejun Heoccea34b2009-03-07 00:44:13 +0900565 *
566 * CONTEXT:
567 * pcpu_lock.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900568 */
569static void pcpu_free_area(struct pcpu_chunk *chunk, int freeme)
570{
571 int oslot = pcpu_chunk_slot(chunk);
572 int i, off;
573
574 for (i = 0, off = 0; i < chunk->map_used; off += abs(chunk->map[i++]))
575 if (off == freeme)
576 break;
577 BUG_ON(off != freeme);
578 BUG_ON(chunk->map[i] > 0);
579
580 chunk->map[i] = -chunk->map[i];
581 chunk->free_size += chunk->map[i];
582
583 /* merge with previous? */
584 if (i > 0 && chunk->map[i - 1] >= 0) {
585 chunk->map[i - 1] += chunk->map[i];
586 chunk->map_used--;
587 memmove(&chunk->map[i], &chunk->map[i + 1],
588 (chunk->map_used - i) * sizeof(chunk->map[0]));
589 i--;
590 }
591 /* merge with next? */
592 if (i + 1 < chunk->map_used && chunk->map[i + 1] >= 0) {
593 chunk->map[i] += chunk->map[i + 1];
594 chunk->map_used--;
595 memmove(&chunk->map[i + 1], &chunk->map[i + 2],
596 (chunk->map_used - (i + 1)) * sizeof(chunk->map[0]));
597 }
598
599 chunk->contig_hint = max(chunk->map[i], chunk->contig_hint);
600 pcpu_chunk_relocate(chunk, oslot);
601}
602
Tejun Heo60810892010-04-09 18:57:01 +0900603static struct pcpu_chunk *pcpu_alloc_chunk(void)
604{
605 struct pcpu_chunk *chunk;
606
607 chunk = kzalloc(pcpu_chunk_struct_size, GFP_KERNEL);
608 if (!chunk)
609 return NULL;
610
611 chunk->map = pcpu_mem_alloc(PCPU_DFL_MAP_ALLOC * sizeof(chunk->map[0]));
612 if (!chunk->map) {
613 kfree(chunk);
614 return NULL;
615 }
616
617 chunk->map_alloc = PCPU_DFL_MAP_ALLOC;
618 chunk->map[chunk->map_used++] = pcpu_unit_size;
619
620 INIT_LIST_HEAD(&chunk->list);
621 chunk->free_size = pcpu_unit_size;
622 chunk->contig_hint = pcpu_unit_size;
623
624 return chunk;
625}
626
627static void pcpu_free_chunk(struct pcpu_chunk *chunk)
628{
629 if (!chunk)
630 return;
631 pcpu_mem_free(chunk->map, chunk->map_alloc * sizeof(chunk->map[0]));
632 kfree(chunk);
633}
634
Tejun Heo9f645532010-04-09 18:57:01 +0900635/*
636 * Chunk management implementation.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900637 *
Tejun Heo9f645532010-04-09 18:57:01 +0900638 * To allow different implementations, chunk alloc/free and
639 * [de]population are implemented in a separate file which is pulled
640 * into this file and compiled together. The following functions
641 * should be implemented.
Tejun Heoce3141a2009-07-04 08:11:00 +0900642 *
Tejun Heo9f645532010-04-09 18:57:01 +0900643 * pcpu_populate_chunk - populate the specified range of a chunk
644 * pcpu_depopulate_chunk - depopulate the specified range of a chunk
645 * pcpu_create_chunk - create a new chunk
646 * pcpu_destroy_chunk - destroy a chunk, always preceded by full depop
647 * pcpu_addr_to_page - translate address to physical address
648 * pcpu_verify_alloc_info - check alloc_info is acceptable during init
Tejun Heofbf59bc2009-02-20 16:29:08 +0900649 */
Tejun Heo9f645532010-04-09 18:57:01 +0900650static int pcpu_populate_chunk(struct pcpu_chunk *chunk, int off, int size);
651static void pcpu_depopulate_chunk(struct pcpu_chunk *chunk, int off, int size);
652static struct pcpu_chunk *pcpu_create_chunk(void);
653static void pcpu_destroy_chunk(struct pcpu_chunk *chunk);
654static struct page *pcpu_addr_to_page(void *addr);
655static int __init pcpu_verify_alloc_info(const struct pcpu_alloc_info *ai);
Tejun Heoce3141a2009-07-04 08:11:00 +0900656
Tejun Heob0c97782010-04-09 18:57:01 +0900657#ifdef CONFIG_NEED_PER_CPU_KM
658#include "percpu-km.c"
659#else
Tejun Heo9f645532010-04-09 18:57:01 +0900660#include "percpu-vm.c"
Tejun Heob0c97782010-04-09 18:57:01 +0900661#endif
Tejun Heofbf59bc2009-02-20 16:29:08 +0900662
663/**
Tejun Heo88999a82010-04-09 18:57:01 +0900664 * pcpu_chunk_addr_search - determine chunk containing specified address
665 * @addr: address for which the chunk needs to be determined.
666 *
667 * RETURNS:
668 * The address of the found chunk.
669 */
670static struct pcpu_chunk *pcpu_chunk_addr_search(void *addr)
671{
672 /* is it in the first chunk? */
673 if (pcpu_addr_in_first_chunk(addr)) {
674 /* is it in the reserved area? */
675 if (pcpu_addr_in_reserved_chunk(addr))
676 return pcpu_reserved_chunk;
677 return pcpu_first_chunk;
678 }
679
680 /*
681 * The address is relative to unit0 which might be unused and
682 * thus unmapped. Offset the address to the unit space of the
683 * current processor before looking it up in the vmalloc
684 * space. Note that any possible cpu id can be used here, so
685 * there's no need to worry about preemption or cpu hotplug.
686 */
687 addr += pcpu_unit_offsets[raw_smp_processor_id()];
Tejun Heo9f645532010-04-09 18:57:01 +0900688 return pcpu_get_page_chunk(pcpu_addr_to_page(addr));
Tejun Heo88999a82010-04-09 18:57:01 +0900689}
690
691/**
Tejun Heoedcb4632009-03-06 14:33:59 +0900692 * pcpu_alloc - the percpu allocator
Tejun Heocae3aeb2009-02-21 16:56:23 +0900693 * @size: size of area to allocate in bytes
Tejun Heofbf59bc2009-02-20 16:29:08 +0900694 * @align: alignment of area (max PAGE_SIZE)
Tejun Heoedcb4632009-03-06 14:33:59 +0900695 * @reserved: allocate from the reserved chunk if available
Tejun Heofbf59bc2009-02-20 16:29:08 +0900696 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900697 * Allocate percpu area of @size bytes aligned at @align.
698 *
699 * CONTEXT:
700 * Does GFP_KERNEL allocation.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900701 *
702 * RETURNS:
703 * Percpu pointer to the allocated area on success, NULL on failure.
704 */
Tejun Heo43cf38e2010-02-02 14:38:57 +0900705static void __percpu *pcpu_alloc(size_t size, size_t align, bool reserved)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900706{
Tejun Heof2badb02009-09-29 09:17:58 +0900707 static int warn_limit = 10;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900708 struct pcpu_chunk *chunk;
Tejun Heof2badb02009-09-29 09:17:58 +0900709 const char *err;
Tejun Heo833af842009-11-11 15:35:18 +0900710 int slot, off, new_alloc;
Jiri Kosina403a91b2009-10-29 00:25:59 +0900711 unsigned long flags;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900712
Tejun Heo8d408b42009-02-24 11:57:21 +0900713 if (unlikely(!size || size > PCPU_MIN_UNIT_SIZE || align > PAGE_SIZE)) {
Tejun Heofbf59bc2009-02-20 16:29:08 +0900714 WARN(true, "illegal size (%zu) or align (%zu) for "
715 "percpu allocation\n", size, align);
716 return NULL;
717 }
718
Tejun Heoccea34b2009-03-07 00:44:13 +0900719 mutex_lock(&pcpu_alloc_mutex);
Jiri Kosina403a91b2009-10-29 00:25:59 +0900720 spin_lock_irqsave(&pcpu_lock, flags);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900721
Tejun Heoedcb4632009-03-06 14:33:59 +0900722 /* serve reserved allocations from the reserved chunk if available */
723 if (reserved && pcpu_reserved_chunk) {
724 chunk = pcpu_reserved_chunk;
Tejun Heo833af842009-11-11 15:35:18 +0900725
726 if (size > chunk->contig_hint) {
727 err = "alloc from reserved chunk failed";
Tejun Heoccea34b2009-03-07 00:44:13 +0900728 goto fail_unlock;
Tejun Heof2badb02009-09-29 09:17:58 +0900729 }
Tejun Heo833af842009-11-11 15:35:18 +0900730
731 while ((new_alloc = pcpu_need_to_extend(chunk))) {
732 spin_unlock_irqrestore(&pcpu_lock, flags);
733 if (pcpu_extend_area_map(chunk, new_alloc) < 0) {
734 err = "failed to extend area map of reserved chunk";
735 goto fail_unlock_mutex;
736 }
737 spin_lock_irqsave(&pcpu_lock, flags);
738 }
739
Tejun Heoedcb4632009-03-06 14:33:59 +0900740 off = pcpu_alloc_area(chunk, size, align);
741 if (off >= 0)
742 goto area_found;
Tejun Heo833af842009-11-11 15:35:18 +0900743
Tejun Heof2badb02009-09-29 09:17:58 +0900744 err = "alloc from reserved chunk failed";
Tejun Heoccea34b2009-03-07 00:44:13 +0900745 goto fail_unlock;
Tejun Heoedcb4632009-03-06 14:33:59 +0900746 }
747
Tejun Heoccea34b2009-03-07 00:44:13 +0900748restart:
Tejun Heoedcb4632009-03-06 14:33:59 +0900749 /* search through normal chunks */
Tejun Heofbf59bc2009-02-20 16:29:08 +0900750 for (slot = pcpu_size_to_slot(size); slot < pcpu_nr_slots; slot++) {
751 list_for_each_entry(chunk, &pcpu_slot[slot], list) {
752 if (size > chunk->contig_hint)
753 continue;
Tejun Heoccea34b2009-03-07 00:44:13 +0900754
Tejun Heo833af842009-11-11 15:35:18 +0900755 new_alloc = pcpu_need_to_extend(chunk);
756 if (new_alloc) {
757 spin_unlock_irqrestore(&pcpu_lock, flags);
758 if (pcpu_extend_area_map(chunk,
759 new_alloc) < 0) {
760 err = "failed to extend area map";
761 goto fail_unlock_mutex;
762 }
763 spin_lock_irqsave(&pcpu_lock, flags);
764 /*
765 * pcpu_lock has been dropped, need to
766 * restart cpu_slot list walking.
767 */
768 goto restart;
Tejun Heoccea34b2009-03-07 00:44:13 +0900769 }
770
Tejun Heofbf59bc2009-02-20 16:29:08 +0900771 off = pcpu_alloc_area(chunk, size, align);
772 if (off >= 0)
773 goto area_found;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900774 }
775 }
776
777 /* hmmm... no space left, create a new chunk */
Jiri Kosina403a91b2009-10-29 00:25:59 +0900778 spin_unlock_irqrestore(&pcpu_lock, flags);
Tejun Heoccea34b2009-03-07 00:44:13 +0900779
Tejun Heo60810892010-04-09 18:57:01 +0900780 chunk = pcpu_create_chunk();
Tejun Heof2badb02009-09-29 09:17:58 +0900781 if (!chunk) {
782 err = "failed to allocate new chunk";
Tejun Heoccea34b2009-03-07 00:44:13 +0900783 goto fail_unlock_mutex;
Tejun Heof2badb02009-09-29 09:17:58 +0900784 }
Tejun Heoccea34b2009-03-07 00:44:13 +0900785
Jiri Kosina403a91b2009-10-29 00:25:59 +0900786 spin_lock_irqsave(&pcpu_lock, flags);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900787 pcpu_chunk_relocate(chunk, -1);
Tejun Heoccea34b2009-03-07 00:44:13 +0900788 goto restart;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900789
790area_found:
Jiri Kosina403a91b2009-10-29 00:25:59 +0900791 spin_unlock_irqrestore(&pcpu_lock, flags);
Tejun Heoccea34b2009-03-07 00:44:13 +0900792
Tejun Heofbf59bc2009-02-20 16:29:08 +0900793 /* populate, map and clear the area */
794 if (pcpu_populate_chunk(chunk, off, size)) {
Jiri Kosina403a91b2009-10-29 00:25:59 +0900795 spin_lock_irqsave(&pcpu_lock, flags);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900796 pcpu_free_area(chunk, off);
Tejun Heof2badb02009-09-29 09:17:58 +0900797 err = "failed to populate";
Tejun Heoccea34b2009-03-07 00:44:13 +0900798 goto fail_unlock;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900799 }
800
Tejun Heoccea34b2009-03-07 00:44:13 +0900801 mutex_unlock(&pcpu_alloc_mutex);
802
Tejun Heobba174f2009-08-14 15:00:51 +0900803 /* return address relative to base address */
804 return __addr_to_pcpu_ptr(chunk->base_addr + off);
Tejun Heoccea34b2009-03-07 00:44:13 +0900805
806fail_unlock:
Jiri Kosina403a91b2009-10-29 00:25:59 +0900807 spin_unlock_irqrestore(&pcpu_lock, flags);
Tejun Heoccea34b2009-03-07 00:44:13 +0900808fail_unlock_mutex:
809 mutex_unlock(&pcpu_alloc_mutex);
Tejun Heof2badb02009-09-29 09:17:58 +0900810 if (warn_limit) {
811 pr_warning("PERCPU: allocation failed, size=%zu align=%zu, "
812 "%s\n", size, align, err);
813 dump_stack();
814 if (!--warn_limit)
815 pr_info("PERCPU: limit reached, disable warning\n");
816 }
Tejun Heoccea34b2009-03-07 00:44:13 +0900817 return NULL;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900818}
Tejun Heoedcb4632009-03-06 14:33:59 +0900819
820/**
821 * __alloc_percpu - allocate dynamic percpu area
822 * @size: size of area to allocate in bytes
823 * @align: alignment of area (max PAGE_SIZE)
824 *
825 * Allocate percpu area of @size bytes aligned at @align. Might
826 * sleep. Might trigger writeouts.
827 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900828 * CONTEXT:
829 * Does GFP_KERNEL allocation.
830 *
Tejun Heoedcb4632009-03-06 14:33:59 +0900831 * RETURNS:
832 * Percpu pointer to the allocated area on success, NULL on failure.
833 */
Tejun Heo43cf38e2010-02-02 14:38:57 +0900834void __percpu *__alloc_percpu(size_t size, size_t align)
Tejun Heoedcb4632009-03-06 14:33:59 +0900835{
836 return pcpu_alloc(size, align, false);
837}
Tejun Heofbf59bc2009-02-20 16:29:08 +0900838EXPORT_SYMBOL_GPL(__alloc_percpu);
839
Tejun Heoedcb4632009-03-06 14:33:59 +0900840/**
841 * __alloc_reserved_percpu - allocate reserved percpu area
842 * @size: size of area to allocate in bytes
843 * @align: alignment of area (max PAGE_SIZE)
844 *
845 * Allocate percpu area of @size bytes aligned at @align from reserved
846 * percpu area if arch has set it up; otherwise, allocation is served
847 * from the same dynamic area. Might sleep. Might trigger writeouts.
848 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900849 * CONTEXT:
850 * Does GFP_KERNEL allocation.
851 *
Tejun Heoedcb4632009-03-06 14:33:59 +0900852 * RETURNS:
853 * Percpu pointer to the allocated area on success, NULL on failure.
854 */
Tejun Heo43cf38e2010-02-02 14:38:57 +0900855void __percpu *__alloc_reserved_percpu(size_t size, size_t align)
Tejun Heoedcb4632009-03-06 14:33:59 +0900856{
857 return pcpu_alloc(size, align, true);
858}
859
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900860/**
861 * pcpu_reclaim - reclaim fully free chunks, workqueue function
862 * @work: unused
863 *
864 * Reclaim all fully free chunks except for the first one.
Tejun Heoccea34b2009-03-07 00:44:13 +0900865 *
866 * CONTEXT:
867 * workqueue context.
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900868 */
869static void pcpu_reclaim(struct work_struct *work)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900870{
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900871 LIST_HEAD(todo);
872 struct list_head *head = &pcpu_slot[pcpu_nr_slots - 1];
873 struct pcpu_chunk *chunk, *next;
874
Tejun Heoccea34b2009-03-07 00:44:13 +0900875 mutex_lock(&pcpu_alloc_mutex);
876 spin_lock_irq(&pcpu_lock);
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900877
878 list_for_each_entry_safe(chunk, next, head, list) {
879 WARN_ON(chunk->immutable);
880
881 /* spare the first one */
882 if (chunk == list_first_entry(head, struct pcpu_chunk, list))
883 continue;
884
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900885 list_move(&chunk->list, &todo);
886 }
887
Tejun Heoccea34b2009-03-07 00:44:13 +0900888 spin_unlock_irq(&pcpu_lock);
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900889
890 list_for_each_entry_safe(chunk, next, &todo, list) {
Tejun Heoce3141a2009-07-04 08:11:00 +0900891 pcpu_depopulate_chunk(chunk, 0, pcpu_unit_size);
Tejun Heo60810892010-04-09 18:57:01 +0900892 pcpu_destroy_chunk(chunk);
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900893 }
Tejun Heo971f3912009-08-14 15:00:49 +0900894
895 mutex_unlock(&pcpu_alloc_mutex);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900896}
897
898/**
899 * free_percpu - free percpu area
900 * @ptr: pointer to area to free
901 *
Tejun Heoccea34b2009-03-07 00:44:13 +0900902 * Free percpu area @ptr.
903 *
904 * CONTEXT:
905 * Can be called from atomic context.
Tejun Heofbf59bc2009-02-20 16:29:08 +0900906 */
Tejun Heo43cf38e2010-02-02 14:38:57 +0900907void free_percpu(void __percpu *ptr)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900908{
Andrew Morton129182e2010-01-08 14:42:39 -0800909 void *addr;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900910 struct pcpu_chunk *chunk;
Tejun Heoccea34b2009-03-07 00:44:13 +0900911 unsigned long flags;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900912 int off;
913
914 if (!ptr)
915 return;
916
Andrew Morton129182e2010-01-08 14:42:39 -0800917 addr = __pcpu_ptr_to_addr(ptr);
918
Tejun Heoccea34b2009-03-07 00:44:13 +0900919 spin_lock_irqsave(&pcpu_lock, flags);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900920
921 chunk = pcpu_chunk_addr_search(addr);
Tejun Heobba174f2009-08-14 15:00:51 +0900922 off = addr - chunk->base_addr;
Tejun Heofbf59bc2009-02-20 16:29:08 +0900923
924 pcpu_free_area(chunk, off);
925
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900926 /* if there are more than one fully free chunks, wake up grim reaper */
Tejun Heofbf59bc2009-02-20 16:29:08 +0900927 if (chunk->free_size == pcpu_unit_size) {
928 struct pcpu_chunk *pos;
929
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900930 list_for_each_entry(pos, &pcpu_slot[pcpu_nr_slots - 1], list)
Tejun Heofbf59bc2009-02-20 16:29:08 +0900931 if (pos != chunk) {
Tejun Heoa56dbdd2009-03-07 00:44:11 +0900932 schedule_work(&pcpu_reclaim_work);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900933 break;
934 }
935 }
936
Tejun Heoccea34b2009-03-07 00:44:13 +0900937 spin_unlock_irqrestore(&pcpu_lock, flags);
Tejun Heofbf59bc2009-02-20 16:29:08 +0900938}
939EXPORT_SYMBOL_GPL(free_percpu);
940
Vivek Goyal3b034b02009-11-24 15:50:03 +0900941/**
Tejun Heo10fad5e2010-03-10 18:57:54 +0900942 * is_kernel_percpu_address - test whether address is from static percpu area
943 * @addr: address to test
944 *
945 * Test whether @addr belongs to in-kernel static percpu area. Module
946 * static percpu areas are not considered. For those, use
947 * is_module_percpu_address().
948 *
949 * RETURNS:
950 * %true if @addr is from in-kernel static percpu area, %false otherwise.
951 */
952bool is_kernel_percpu_address(unsigned long addr)
953{
954 const size_t static_size = __per_cpu_end - __per_cpu_start;
955 void __percpu *base = __addr_to_pcpu_ptr(pcpu_base_addr);
956 unsigned int cpu;
957
958 for_each_possible_cpu(cpu) {
959 void *start = per_cpu_ptr(base, cpu);
960
961 if ((void *)addr >= start && (void *)addr < start + static_size)
962 return true;
963 }
964 return false;
965}
966
967/**
Vivek Goyal3b034b02009-11-24 15:50:03 +0900968 * per_cpu_ptr_to_phys - convert translated percpu address to physical address
969 * @addr: the address to be converted to physical address
970 *
971 * Given @addr which is dereferenceable address obtained via one of
972 * percpu access macros, this function translates it into its physical
973 * address. The caller is responsible for ensuring @addr stays valid
974 * until this function finishes.
975 *
976 * RETURNS:
977 * The physical address for @addr.
978 */
979phys_addr_t per_cpu_ptr_to_phys(void *addr)
980{
Tejun Heo9983b6f2010-06-18 11:44:31 +0200981 void __percpu *base = __addr_to_pcpu_ptr(pcpu_base_addr);
982 bool in_first_chunk = false;
983 unsigned long first_start, first_end;
984 unsigned int cpu;
985
986 /*
987 * The following test on first_start/end isn't strictly
988 * necessary but will speed up lookups of addresses which
989 * aren't in the first chunk.
990 */
991 first_start = pcpu_chunk_addr(pcpu_first_chunk, pcpu_first_unit_cpu, 0);
992 first_end = pcpu_chunk_addr(pcpu_first_chunk, pcpu_last_unit_cpu,
993 pcpu_unit_pages);
994 if ((unsigned long)addr >= first_start &&
995 (unsigned long)addr < first_end) {
996 for_each_possible_cpu(cpu) {
997 void *start = per_cpu_ptr(base, cpu);
998
999 if (addr >= start && addr < start + pcpu_unit_size) {
1000 in_first_chunk = true;
1001 break;
1002 }
1003 }
1004 }
1005
1006 if (in_first_chunk) {
Tejun Heo020ec652010-04-09 18:57:00 +09001007 if ((unsigned long)addr < VMALLOC_START ||
1008 (unsigned long)addr >= VMALLOC_END)
1009 return __pa(addr);
1010 else
1011 return page_to_phys(vmalloc_to_page(addr));
1012 } else
Tejun Heo9f645532010-04-09 18:57:01 +09001013 return page_to_phys(pcpu_addr_to_page(addr));
Vivek Goyal3b034b02009-11-24 15:50:03 +09001014}
1015
Tejun Heo033e48f2009-08-14 15:00:51 +09001016static inline size_t pcpu_calc_fc_sizes(size_t static_size,
1017 size_t reserved_size,
1018 ssize_t *dyn_sizep)
1019{
1020 size_t size_sum;
1021
1022 size_sum = PFN_ALIGN(static_size + reserved_size +
1023 (*dyn_sizep >= 0 ? *dyn_sizep : 0));
1024 if (*dyn_sizep != 0)
1025 *dyn_sizep = size_sum - static_size - reserved_size;
1026
1027 return size_sum;
1028}
1029
Tejun Heofbf59bc2009-02-20 16:29:08 +09001030/**
Tejun Heofd1e8a12009-08-14 15:00:51 +09001031 * pcpu_alloc_alloc_info - allocate percpu allocation info
1032 * @nr_groups: the number of groups
1033 * @nr_units: the number of units
Tejun Heo033e48f2009-08-14 15:00:51 +09001034 *
Tejun Heofd1e8a12009-08-14 15:00:51 +09001035 * Allocate ai which is large enough for @nr_groups groups containing
1036 * @nr_units units. The returned ai's groups[0].cpu_map points to the
1037 * cpu_map array which is long enough for @nr_units and filled with
1038 * NR_CPUS. It's the caller's responsibility to initialize cpu_map
1039 * pointer of other groups.
Tejun Heo033e48f2009-08-14 15:00:51 +09001040 *
1041 * RETURNS:
Tejun Heofd1e8a12009-08-14 15:00:51 +09001042 * Pointer to the allocated pcpu_alloc_info on success, NULL on
1043 * failure.
Tejun Heo033e48f2009-08-14 15:00:51 +09001044 */
Tejun Heofd1e8a12009-08-14 15:00:51 +09001045struct pcpu_alloc_info * __init pcpu_alloc_alloc_info(int nr_groups,
1046 int nr_units)
1047{
1048 struct pcpu_alloc_info *ai;
1049 size_t base_size, ai_size;
1050 void *ptr;
1051 int unit;
1052
1053 base_size = ALIGN(sizeof(*ai) + nr_groups * sizeof(ai->groups[0]),
1054 __alignof__(ai->groups[0].cpu_map[0]));
1055 ai_size = base_size + nr_units * sizeof(ai->groups[0].cpu_map[0]);
1056
1057 ptr = alloc_bootmem_nopanic(PFN_ALIGN(ai_size));
1058 if (!ptr)
1059 return NULL;
1060 ai = ptr;
1061 ptr += base_size;
1062
1063 ai->groups[0].cpu_map = ptr;
1064
1065 for (unit = 0; unit < nr_units; unit++)
1066 ai->groups[0].cpu_map[unit] = NR_CPUS;
1067
1068 ai->nr_groups = nr_groups;
1069 ai->__ai_size = PFN_ALIGN(ai_size);
1070
1071 return ai;
1072}
1073
1074/**
1075 * pcpu_free_alloc_info - free percpu allocation info
1076 * @ai: pcpu_alloc_info to free
1077 *
1078 * Free @ai which was allocated by pcpu_alloc_alloc_info().
1079 */
1080void __init pcpu_free_alloc_info(struct pcpu_alloc_info *ai)
1081{
1082 free_bootmem(__pa(ai), ai->__ai_size);
1083}
1084
1085/**
1086 * pcpu_build_alloc_info - build alloc_info considering distances between CPUs
Tejun Heoedcb4632009-03-06 14:33:59 +09001087 * @reserved_size: the size of reserved percpu area in bytes
Tejun Heocafe8812009-03-06 14:33:59 +09001088 * @dyn_size: free size for dynamic allocation in bytes, -1 for auto
Tejun Heofd1e8a12009-08-14 15:00:51 +09001089 * @atom_size: allocation atom size
1090 * @cpu_distance_fn: callback to determine distance between cpus, optional
1091 *
1092 * This function determines grouping of units, their mappings to cpus
1093 * and other parameters considering needed percpu size, allocation
1094 * atom size and distances between CPUs.
1095 *
1096 * Groups are always mutliples of atom size and CPUs which are of
1097 * LOCAL_DISTANCE both ways are grouped together and share space for
1098 * units in the same group. The returned configuration is guaranteed
1099 * to have CPUs on different nodes on different groups and >=75% usage
1100 * of allocated virtual address space.
1101 *
1102 * RETURNS:
1103 * On success, pointer to the new allocation_info is returned. On
1104 * failure, ERR_PTR value is returned.
1105 */
1106struct pcpu_alloc_info * __init pcpu_build_alloc_info(
1107 size_t reserved_size, ssize_t dyn_size,
1108 size_t atom_size,
1109 pcpu_fc_cpu_distance_fn_t cpu_distance_fn)
Tejun Heo033e48f2009-08-14 15:00:51 +09001110{
1111 static int group_map[NR_CPUS] __initdata;
1112 static int group_cnt[NR_CPUS] __initdata;
1113 const size_t static_size = __per_cpu_end - __per_cpu_start;
Pavel V. Panteleeva92d3ff2010-06-17 10:07:25 +02001114 int nr_groups = 1, nr_units = 0;
Tejun Heo033e48f2009-08-14 15:00:51 +09001115 size_t size_sum, min_unit_size, alloc_size;
1116 int upa, max_upa, uninitialized_var(best_upa); /* units_per_alloc */
Tejun Heofd1e8a12009-08-14 15:00:51 +09001117 int last_allocs, group, unit;
Tejun Heo033e48f2009-08-14 15:00:51 +09001118 unsigned int cpu, tcpu;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001119 struct pcpu_alloc_info *ai;
1120 unsigned int *cpu_map;
Tejun Heo033e48f2009-08-14 15:00:51 +09001121
Tejun Heofb59e722009-09-24 18:50:34 +09001122 /* this function may be called multiple times */
1123 memset(group_map, 0, sizeof(group_map));
Pavel V. Panteleeva92d3ff2010-06-17 10:07:25 +02001124 memset(group_cnt, 0, sizeof(group_cnt));
Tejun Heofb59e722009-09-24 18:50:34 +09001125
Tejun Heo033e48f2009-08-14 15:00:51 +09001126 /*
1127 * Determine min_unit_size, alloc_size and max_upa such that
Tejun Heofd1e8a12009-08-14 15:00:51 +09001128 * alloc_size is multiple of atom_size and is the smallest
Tejun Heo033e48f2009-08-14 15:00:51 +09001129 * which can accomodate 4k aligned segments which are equal to
1130 * or larger than min_unit_size.
1131 */
Tejun Heofd1e8a12009-08-14 15:00:51 +09001132 size_sum = pcpu_calc_fc_sizes(static_size, reserved_size, &dyn_size);
Tejun Heo033e48f2009-08-14 15:00:51 +09001133 min_unit_size = max_t(size_t, size_sum, PCPU_MIN_UNIT_SIZE);
1134
Tejun Heofd1e8a12009-08-14 15:00:51 +09001135 alloc_size = roundup(min_unit_size, atom_size);
Tejun Heo033e48f2009-08-14 15:00:51 +09001136 upa = alloc_size / min_unit_size;
1137 while (alloc_size % upa || ((alloc_size / upa) & ~PAGE_MASK))
1138 upa--;
1139 max_upa = upa;
1140
1141 /* group cpus according to their proximity */
1142 for_each_possible_cpu(cpu) {
1143 group = 0;
1144 next_group:
1145 for_each_possible_cpu(tcpu) {
1146 if (cpu == tcpu)
1147 break;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001148 if (group_map[tcpu] == group && cpu_distance_fn &&
Tejun Heo033e48f2009-08-14 15:00:51 +09001149 (cpu_distance_fn(cpu, tcpu) > LOCAL_DISTANCE ||
1150 cpu_distance_fn(tcpu, cpu) > LOCAL_DISTANCE)) {
1151 group++;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001152 nr_groups = max(nr_groups, group + 1);
Tejun Heo033e48f2009-08-14 15:00:51 +09001153 goto next_group;
1154 }
1155 }
1156 group_map[cpu] = group;
1157 group_cnt[group]++;
Tejun Heo033e48f2009-08-14 15:00:51 +09001158 }
1159
1160 /*
1161 * Expand unit size until address space usage goes over 75%
1162 * and then as much as possible without using more address
1163 * space.
1164 */
1165 last_allocs = INT_MAX;
1166 for (upa = max_upa; upa; upa--) {
1167 int allocs = 0, wasted = 0;
1168
1169 if (alloc_size % upa || ((alloc_size / upa) & ~PAGE_MASK))
1170 continue;
1171
Tejun Heofd1e8a12009-08-14 15:00:51 +09001172 for (group = 0; group < nr_groups; group++) {
Tejun Heo033e48f2009-08-14 15:00:51 +09001173 int this_allocs = DIV_ROUND_UP(group_cnt[group], upa);
1174 allocs += this_allocs;
1175 wasted += this_allocs * upa - group_cnt[group];
1176 }
1177
1178 /*
1179 * Don't accept if wastage is over 25%. The
1180 * greater-than comparison ensures upa==1 always
1181 * passes the following check.
1182 */
1183 if (wasted > num_possible_cpus() / 3)
1184 continue;
1185
1186 /* and then don't consume more memory */
1187 if (allocs > last_allocs)
1188 break;
1189 last_allocs = allocs;
1190 best_upa = upa;
1191 }
Tejun Heofd1e8a12009-08-14 15:00:51 +09001192 upa = best_upa;
Tejun Heo033e48f2009-08-14 15:00:51 +09001193
Tejun Heofd1e8a12009-08-14 15:00:51 +09001194 /* allocate and fill alloc_info */
1195 for (group = 0; group < nr_groups; group++)
1196 nr_units += roundup(group_cnt[group], upa);
1197
1198 ai = pcpu_alloc_alloc_info(nr_groups, nr_units);
1199 if (!ai)
1200 return ERR_PTR(-ENOMEM);
1201 cpu_map = ai->groups[0].cpu_map;
1202
1203 for (group = 0; group < nr_groups; group++) {
1204 ai->groups[group].cpu_map = cpu_map;
1205 cpu_map += roundup(group_cnt[group], upa);
Tejun Heo033e48f2009-08-14 15:00:51 +09001206 }
1207
Tejun Heofd1e8a12009-08-14 15:00:51 +09001208 ai->static_size = static_size;
1209 ai->reserved_size = reserved_size;
1210 ai->dyn_size = dyn_size;
1211 ai->unit_size = alloc_size / upa;
1212 ai->atom_size = atom_size;
1213 ai->alloc_size = alloc_size;
1214
1215 for (group = 0, unit = 0; group_cnt[group]; group++) {
1216 struct pcpu_group_info *gi = &ai->groups[group];
1217
1218 /*
1219 * Initialize base_offset as if all groups are located
1220 * back-to-back. The caller should update this to
1221 * reflect actual allocation.
1222 */
1223 gi->base_offset = unit * ai->unit_size;
1224
1225 for_each_possible_cpu(cpu)
1226 if (group_map[cpu] == group)
1227 gi->cpu_map[gi->nr_units++] = cpu;
1228 gi->nr_units = roundup(gi->nr_units, upa);
1229 unit += gi->nr_units;
1230 }
1231 BUG_ON(unit != nr_units);
1232
1233 return ai;
Tejun Heo033e48f2009-08-14 15:00:51 +09001234}
1235
Tejun Heofd1e8a12009-08-14 15:00:51 +09001236/**
1237 * pcpu_dump_alloc_info - print out information about pcpu_alloc_info
1238 * @lvl: loglevel
1239 * @ai: allocation info to dump
1240 *
1241 * Print out information about @ai using loglevel @lvl.
1242 */
1243static void pcpu_dump_alloc_info(const char *lvl,
1244 const struct pcpu_alloc_info *ai)
Tejun Heo033e48f2009-08-14 15:00:51 +09001245{
Tejun Heofd1e8a12009-08-14 15:00:51 +09001246 int group_width = 1, cpu_width = 1, width;
Tejun Heo033e48f2009-08-14 15:00:51 +09001247 char empty_str[] = "--------";
Tejun Heofd1e8a12009-08-14 15:00:51 +09001248 int alloc = 0, alloc_end = 0;
1249 int group, v;
1250 int upa, apl; /* units per alloc, allocs per line */
Tejun Heo033e48f2009-08-14 15:00:51 +09001251
Tejun Heofd1e8a12009-08-14 15:00:51 +09001252 v = ai->nr_groups;
Tejun Heo033e48f2009-08-14 15:00:51 +09001253 while (v /= 10)
Tejun Heofd1e8a12009-08-14 15:00:51 +09001254 group_width++;
Tejun Heo033e48f2009-08-14 15:00:51 +09001255
Tejun Heofd1e8a12009-08-14 15:00:51 +09001256 v = num_possible_cpus();
1257 while (v /= 10)
1258 cpu_width++;
1259 empty_str[min_t(int, cpu_width, sizeof(empty_str) - 1)] = '\0';
Tejun Heo033e48f2009-08-14 15:00:51 +09001260
Tejun Heofd1e8a12009-08-14 15:00:51 +09001261 upa = ai->alloc_size / ai->unit_size;
1262 width = upa * (cpu_width + 1) + group_width + 3;
1263 apl = rounddown_pow_of_two(max(60 / width, 1));
Tejun Heo033e48f2009-08-14 15:00:51 +09001264
Tejun Heofd1e8a12009-08-14 15:00:51 +09001265 printk("%spcpu-alloc: s%zu r%zu d%zu u%zu alloc=%zu*%zu",
1266 lvl, ai->static_size, ai->reserved_size, ai->dyn_size,
1267 ai->unit_size, ai->alloc_size / ai->atom_size, ai->atom_size);
1268
1269 for (group = 0; group < ai->nr_groups; group++) {
1270 const struct pcpu_group_info *gi = &ai->groups[group];
1271 int unit = 0, unit_end = 0;
1272
1273 BUG_ON(gi->nr_units % upa);
1274 for (alloc_end += gi->nr_units / upa;
1275 alloc < alloc_end; alloc++) {
1276 if (!(alloc % apl)) {
Tejun Heo033e48f2009-08-14 15:00:51 +09001277 printk("\n");
Tejun Heofd1e8a12009-08-14 15:00:51 +09001278 printk("%spcpu-alloc: ", lvl);
1279 }
1280 printk("[%0*d] ", group_width, group);
1281
1282 for (unit_end += upa; unit < unit_end; unit++)
1283 if (gi->cpu_map[unit] != NR_CPUS)
1284 printk("%0*d ", cpu_width,
1285 gi->cpu_map[unit]);
1286 else
1287 printk("%s ", empty_str);
Tejun Heo033e48f2009-08-14 15:00:51 +09001288 }
Tejun Heo033e48f2009-08-14 15:00:51 +09001289 }
1290 printk("\n");
1291}
Tejun Heo033e48f2009-08-14 15:00:51 +09001292
Tejun Heofbf59bc2009-02-20 16:29:08 +09001293/**
Tejun Heo8d408b42009-02-24 11:57:21 +09001294 * pcpu_setup_first_chunk - initialize the first percpu chunk
Tejun Heofd1e8a12009-08-14 15:00:51 +09001295 * @ai: pcpu_alloc_info describing how to percpu area is shaped
Tejun Heo38a6be52009-07-04 08:10:59 +09001296 * @base_addr: mapped address
Tejun Heofbf59bc2009-02-20 16:29:08 +09001297 *
Tejun Heo8d408b42009-02-24 11:57:21 +09001298 * Initialize the first percpu chunk which contains the kernel static
1299 * perpcu area. This function is to be called from arch percpu area
Tejun Heo38a6be52009-07-04 08:10:59 +09001300 * setup path.
Tejun Heo8d408b42009-02-24 11:57:21 +09001301 *
Tejun Heofd1e8a12009-08-14 15:00:51 +09001302 * @ai contains all information necessary to initialize the first
1303 * chunk and prime the dynamic percpu allocator.
Tejun Heo8d408b42009-02-24 11:57:21 +09001304 *
Tejun Heofd1e8a12009-08-14 15:00:51 +09001305 * @ai->static_size is the size of static percpu area.
1306 *
1307 * @ai->reserved_size, if non-zero, specifies the amount of bytes to
Tejun Heoedcb4632009-03-06 14:33:59 +09001308 * reserve after the static area in the first chunk. This reserves
1309 * the first chunk such that it's available only through reserved
1310 * percpu allocation. This is primarily used to serve module percpu
1311 * static areas on architectures where the addressing model has
1312 * limited offset range for symbol relocations to guarantee module
1313 * percpu symbols fall inside the relocatable range.
1314 *
Tejun Heofd1e8a12009-08-14 15:00:51 +09001315 * @ai->dyn_size determines the number of bytes available for dynamic
1316 * allocation in the first chunk. The area between @ai->static_size +
1317 * @ai->reserved_size + @ai->dyn_size and @ai->unit_size is unused.
Tejun Heo6074d5b2009-03-10 16:27:48 +09001318 *
Tejun Heofd1e8a12009-08-14 15:00:51 +09001319 * @ai->unit_size specifies unit size and must be aligned to PAGE_SIZE
1320 * and equal to or larger than @ai->static_size + @ai->reserved_size +
1321 * @ai->dyn_size.
Tejun Heo8d408b42009-02-24 11:57:21 +09001322 *
Tejun Heofd1e8a12009-08-14 15:00:51 +09001323 * @ai->atom_size is the allocation atom size and used as alignment
1324 * for vm areas.
Tejun Heo8d408b42009-02-24 11:57:21 +09001325 *
Tejun Heofd1e8a12009-08-14 15:00:51 +09001326 * @ai->alloc_size is the allocation size and always multiple of
1327 * @ai->atom_size. This is larger than @ai->atom_size if
1328 * @ai->unit_size is larger than @ai->atom_size.
1329 *
1330 * @ai->nr_groups and @ai->groups describe virtual memory layout of
1331 * percpu areas. Units which should be colocated are put into the
1332 * same group. Dynamic VM areas will be allocated according to these
1333 * groupings. If @ai->nr_groups is zero, a single group containing
1334 * all units is assumed.
Tejun Heo8d408b42009-02-24 11:57:21 +09001335 *
Tejun Heo38a6be52009-07-04 08:10:59 +09001336 * The caller should have mapped the first chunk at @base_addr and
1337 * copied static data to each unit.
Tejun Heofbf59bc2009-02-20 16:29:08 +09001338 *
Tejun Heoedcb4632009-03-06 14:33:59 +09001339 * If the first chunk ends up with both reserved and dynamic areas, it
1340 * is served by two chunks - one to serve the core static and reserved
1341 * areas and the other for the dynamic area. They share the same vm
1342 * and page map but uses different area allocation map to stay away
1343 * from each other. The latter chunk is circulated in the chunk slots
1344 * and available for dynamic allocation like any other chunks.
1345 *
Tejun Heofbf59bc2009-02-20 16:29:08 +09001346 * RETURNS:
Tejun Heofb435d52009-08-14 15:00:51 +09001347 * 0 on success, -errno on failure.
Tejun Heofbf59bc2009-02-20 16:29:08 +09001348 */
Tejun Heofb435d52009-08-14 15:00:51 +09001349int __init pcpu_setup_first_chunk(const struct pcpu_alloc_info *ai,
1350 void *base_addr)
Tejun Heofbf59bc2009-02-20 16:29:08 +09001351{
Tejun Heo635b75f2009-09-24 09:43:11 +09001352 static char cpus_buf[4096] __initdata;
Tejun Heoedcb4632009-03-06 14:33:59 +09001353 static int smap[2], dmap[2];
Tejun Heofd1e8a12009-08-14 15:00:51 +09001354 size_t dyn_size = ai->dyn_size;
1355 size_t size_sum = ai->static_size + ai->reserved_size + dyn_size;
Tejun Heoedcb4632009-03-06 14:33:59 +09001356 struct pcpu_chunk *schunk, *dchunk = NULL;
Tejun Heo65632972009-08-14 15:00:52 +09001357 unsigned long *group_offsets;
1358 size_t *group_sizes;
Tejun Heofb435d52009-08-14 15:00:51 +09001359 unsigned long *unit_off;
Tejun Heofbf59bc2009-02-20 16:29:08 +09001360 unsigned int cpu;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001361 int *unit_map;
1362 int group, unit, i;
Tejun Heofbf59bc2009-02-20 16:29:08 +09001363
Tejun Heo635b75f2009-09-24 09:43:11 +09001364 cpumask_scnprintf(cpus_buf, sizeof(cpus_buf), cpu_possible_mask);
1365
1366#define PCPU_SETUP_BUG_ON(cond) do { \
1367 if (unlikely(cond)) { \
1368 pr_emerg("PERCPU: failed to initialize, %s", #cond); \
1369 pr_emerg("PERCPU: cpu_possible_mask=%s\n", cpus_buf); \
1370 pcpu_dump_alloc_info(KERN_EMERG, ai); \
1371 BUG(); \
1372 } \
1373} while (0)
1374
Tejun Heo2f39e632009-07-04 08:11:00 +09001375 /* sanity checks */
Tejun Heoedcb4632009-03-06 14:33:59 +09001376 BUILD_BUG_ON(ARRAY_SIZE(smap) >= PCPU_DFL_MAP_ALLOC ||
1377 ARRAY_SIZE(dmap) >= PCPU_DFL_MAP_ALLOC);
Tejun Heo635b75f2009-09-24 09:43:11 +09001378 PCPU_SETUP_BUG_ON(ai->nr_groups <= 0);
1379 PCPU_SETUP_BUG_ON(!ai->static_size);
1380 PCPU_SETUP_BUG_ON(!base_addr);
1381 PCPU_SETUP_BUG_ON(ai->unit_size < size_sum);
1382 PCPU_SETUP_BUG_ON(ai->unit_size & ~PAGE_MASK);
1383 PCPU_SETUP_BUG_ON(ai->unit_size < PCPU_MIN_UNIT_SIZE);
Tejun Heo9f645532010-04-09 18:57:01 +09001384 PCPU_SETUP_BUG_ON(pcpu_verify_alloc_info(ai) < 0);
Tejun Heo8d408b42009-02-24 11:57:21 +09001385
Tejun Heo65632972009-08-14 15:00:52 +09001386 /* process group information and build config tables accordingly */
1387 group_offsets = alloc_bootmem(ai->nr_groups * sizeof(group_offsets[0]));
1388 group_sizes = alloc_bootmem(ai->nr_groups * sizeof(group_sizes[0]));
Tejun Heofd1e8a12009-08-14 15:00:51 +09001389 unit_map = alloc_bootmem(nr_cpu_ids * sizeof(unit_map[0]));
Tejun Heofb435d52009-08-14 15:00:51 +09001390 unit_off = alloc_bootmem(nr_cpu_ids * sizeof(unit_off[0]));
Tejun Heo2f39e632009-07-04 08:11:00 +09001391
Tejun Heofd1e8a12009-08-14 15:00:51 +09001392 for (cpu = 0; cpu < nr_cpu_ids; cpu++)
Tejun Heoffe0d5a2009-09-29 09:17:56 +09001393 unit_map[cpu] = UINT_MAX;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001394 pcpu_first_unit_cpu = NR_CPUS;
Tejun Heo2f39e632009-07-04 08:11:00 +09001395
Tejun Heofd1e8a12009-08-14 15:00:51 +09001396 for (group = 0, unit = 0; group < ai->nr_groups; group++, unit += i) {
1397 const struct pcpu_group_info *gi = &ai->groups[group];
Tejun Heo2f39e632009-07-04 08:11:00 +09001398
Tejun Heo65632972009-08-14 15:00:52 +09001399 group_offsets[group] = gi->base_offset;
1400 group_sizes[group] = gi->nr_units * ai->unit_size;
1401
Tejun Heofd1e8a12009-08-14 15:00:51 +09001402 for (i = 0; i < gi->nr_units; i++) {
1403 cpu = gi->cpu_map[i];
1404 if (cpu == NR_CPUS)
1405 continue;
1406
Tejun Heo635b75f2009-09-24 09:43:11 +09001407 PCPU_SETUP_BUG_ON(cpu > nr_cpu_ids);
1408 PCPU_SETUP_BUG_ON(!cpu_possible(cpu));
1409 PCPU_SETUP_BUG_ON(unit_map[cpu] != UINT_MAX);
Tejun Heofd1e8a12009-08-14 15:00:51 +09001410
1411 unit_map[cpu] = unit + i;
Tejun Heofb435d52009-08-14 15:00:51 +09001412 unit_off[cpu] = gi->base_offset + i * ai->unit_size;
1413
Tejun Heofd1e8a12009-08-14 15:00:51 +09001414 if (pcpu_first_unit_cpu == NR_CPUS)
Tejun Heo2f39e632009-07-04 08:11:00 +09001415 pcpu_first_unit_cpu = cpu;
Tejun Heo2f39e632009-07-04 08:11:00 +09001416 }
Tejun Heo2f39e632009-07-04 08:11:00 +09001417 }
Tejun Heofd1e8a12009-08-14 15:00:51 +09001418 pcpu_last_unit_cpu = cpu;
1419 pcpu_nr_units = unit;
1420
1421 for_each_possible_cpu(cpu)
Tejun Heo635b75f2009-09-24 09:43:11 +09001422 PCPU_SETUP_BUG_ON(unit_map[cpu] == UINT_MAX);
1423
1424 /* we're done parsing the input, undefine BUG macro and dump config */
1425#undef PCPU_SETUP_BUG_ON
1426 pcpu_dump_alloc_info(KERN_INFO, ai);
Tejun Heofd1e8a12009-08-14 15:00:51 +09001427
Tejun Heo65632972009-08-14 15:00:52 +09001428 pcpu_nr_groups = ai->nr_groups;
1429 pcpu_group_offsets = group_offsets;
1430 pcpu_group_sizes = group_sizes;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001431 pcpu_unit_map = unit_map;
Tejun Heofb435d52009-08-14 15:00:51 +09001432 pcpu_unit_offsets = unit_off;
Tejun Heo2f39e632009-07-04 08:11:00 +09001433
1434 /* determine basic parameters */
Tejun Heofd1e8a12009-08-14 15:00:51 +09001435 pcpu_unit_pages = ai->unit_size >> PAGE_SHIFT;
Tejun Heod9b55ee2009-02-24 11:57:21 +09001436 pcpu_unit_size = pcpu_unit_pages << PAGE_SHIFT;
Tejun Heo65632972009-08-14 15:00:52 +09001437 pcpu_atom_size = ai->atom_size;
Tejun Heoce3141a2009-07-04 08:11:00 +09001438 pcpu_chunk_struct_size = sizeof(struct pcpu_chunk) +
1439 BITS_TO_LONGS(pcpu_unit_pages) * sizeof(unsigned long);
Tejun Heocafe8812009-03-06 14:33:59 +09001440
Tejun Heod9b55ee2009-02-24 11:57:21 +09001441 /*
1442 * Allocate chunk slots. The additional last slot is for
1443 * empty chunks.
1444 */
1445 pcpu_nr_slots = __pcpu_size_to_slot(pcpu_unit_size) + 2;
Tejun Heofbf59bc2009-02-20 16:29:08 +09001446 pcpu_slot = alloc_bootmem(pcpu_nr_slots * sizeof(pcpu_slot[0]));
1447 for (i = 0; i < pcpu_nr_slots; i++)
1448 INIT_LIST_HEAD(&pcpu_slot[i]);
1449
Tejun Heoedcb4632009-03-06 14:33:59 +09001450 /*
1451 * Initialize static chunk. If reserved_size is zero, the
1452 * static chunk covers static area + dynamic allocation area
1453 * in the first chunk. If reserved_size is not zero, it
1454 * covers static area + reserved area (mostly used for module
1455 * static percpu allocation).
1456 */
Tejun Heo2441d152009-03-06 14:33:59 +09001457 schunk = alloc_bootmem(pcpu_chunk_struct_size);
1458 INIT_LIST_HEAD(&schunk->list);
Tejun Heobba174f2009-08-14 15:00:51 +09001459 schunk->base_addr = base_addr;
Tejun Heo61ace7f2009-03-06 14:33:59 +09001460 schunk->map = smap;
1461 schunk->map_alloc = ARRAY_SIZE(smap);
Tejun Heo38a6be52009-07-04 08:10:59 +09001462 schunk->immutable = true;
Tejun Heoce3141a2009-07-04 08:11:00 +09001463 bitmap_fill(schunk->populated, pcpu_unit_pages);
Tejun Heoedcb4632009-03-06 14:33:59 +09001464
Tejun Heofd1e8a12009-08-14 15:00:51 +09001465 if (ai->reserved_size) {
1466 schunk->free_size = ai->reserved_size;
Tejun Heoae9e6bc2009-04-02 13:19:54 +09001467 pcpu_reserved_chunk = schunk;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001468 pcpu_reserved_chunk_limit = ai->static_size + ai->reserved_size;
Tejun Heoedcb4632009-03-06 14:33:59 +09001469 } else {
1470 schunk->free_size = dyn_size;
1471 dyn_size = 0; /* dynamic area covered */
1472 }
Tejun Heo2441d152009-03-06 14:33:59 +09001473 schunk->contig_hint = schunk->free_size;
Tejun Heofbf59bc2009-02-20 16:29:08 +09001474
Tejun Heofd1e8a12009-08-14 15:00:51 +09001475 schunk->map[schunk->map_used++] = -ai->static_size;
Tejun Heo61ace7f2009-03-06 14:33:59 +09001476 if (schunk->free_size)
1477 schunk->map[schunk->map_used++] = schunk->free_size;
1478
Tejun Heoedcb4632009-03-06 14:33:59 +09001479 /* init dynamic chunk if necessary */
1480 if (dyn_size) {
Tejun Heoce3141a2009-07-04 08:11:00 +09001481 dchunk = alloc_bootmem(pcpu_chunk_struct_size);
Tejun Heoedcb4632009-03-06 14:33:59 +09001482 INIT_LIST_HEAD(&dchunk->list);
Tejun Heobba174f2009-08-14 15:00:51 +09001483 dchunk->base_addr = base_addr;
Tejun Heoedcb4632009-03-06 14:33:59 +09001484 dchunk->map = dmap;
1485 dchunk->map_alloc = ARRAY_SIZE(dmap);
Tejun Heo38a6be52009-07-04 08:10:59 +09001486 dchunk->immutable = true;
Tejun Heoce3141a2009-07-04 08:11:00 +09001487 bitmap_fill(dchunk->populated, pcpu_unit_pages);
Tejun Heoedcb4632009-03-06 14:33:59 +09001488
1489 dchunk->contig_hint = dchunk->free_size = dyn_size;
1490 dchunk->map[dchunk->map_used++] = -pcpu_reserved_chunk_limit;
1491 dchunk->map[dchunk->map_used++] = dchunk->free_size;
1492 }
1493
Tejun Heo2441d152009-03-06 14:33:59 +09001494 /* link the first chunk in */
Tejun Heoae9e6bc2009-04-02 13:19:54 +09001495 pcpu_first_chunk = dchunk ?: schunk;
1496 pcpu_chunk_relocate(pcpu_first_chunk, -1);
Tejun Heofbf59bc2009-02-20 16:29:08 +09001497
1498 /* we're done */
Tejun Heobba174f2009-08-14 15:00:51 +09001499 pcpu_base_addr = base_addr;
Tejun Heofb435d52009-08-14 15:00:51 +09001500 return 0;
Tejun Heofbf59bc2009-02-20 16:29:08 +09001501}
Tejun Heo66c3a752009-03-10 16:27:48 +09001502
Tejun Heof58dc012009-08-14 15:00:50 +09001503const char *pcpu_fc_names[PCPU_FC_NR] __initdata = {
1504 [PCPU_FC_AUTO] = "auto",
1505 [PCPU_FC_EMBED] = "embed",
1506 [PCPU_FC_PAGE] = "page",
Tejun Heof58dc012009-08-14 15:00:50 +09001507};
Tejun Heo66c3a752009-03-10 16:27:48 +09001508
Tejun Heof58dc012009-08-14 15:00:50 +09001509enum pcpu_fc pcpu_chosen_fc __initdata = PCPU_FC_AUTO;
1510
1511static int __init percpu_alloc_setup(char *str)
Tejun Heo66c3a752009-03-10 16:27:48 +09001512{
Tejun Heof58dc012009-08-14 15:00:50 +09001513 if (0)
1514 /* nada */;
1515#ifdef CONFIG_NEED_PER_CPU_EMBED_FIRST_CHUNK
1516 else if (!strcmp(str, "embed"))
1517 pcpu_chosen_fc = PCPU_FC_EMBED;
1518#endif
1519#ifdef CONFIG_NEED_PER_CPU_PAGE_FIRST_CHUNK
1520 else if (!strcmp(str, "page"))
1521 pcpu_chosen_fc = PCPU_FC_PAGE;
1522#endif
Tejun Heof58dc012009-08-14 15:00:50 +09001523 else
1524 pr_warning("PERCPU: unknown allocator %s specified\n", str);
Tejun Heo66c3a752009-03-10 16:27:48 +09001525
Tejun Heof58dc012009-08-14 15:00:50 +09001526 return 0;
Tejun Heo66c3a752009-03-10 16:27:48 +09001527}
Tejun Heof58dc012009-08-14 15:00:50 +09001528early_param("percpu_alloc", percpu_alloc_setup);
Tejun Heo66c3a752009-03-10 16:27:48 +09001529
Tejun Heo08fc4582009-08-14 15:00:49 +09001530#if defined(CONFIG_NEED_PER_CPU_EMBED_FIRST_CHUNK) || \
1531 !defined(CONFIG_HAVE_SETUP_PER_CPU_AREA)
Tejun Heo66c3a752009-03-10 16:27:48 +09001532/**
1533 * pcpu_embed_first_chunk - embed the first percpu chunk into bootmem
Tejun Heo66c3a752009-03-10 16:27:48 +09001534 * @reserved_size: the size of reserved percpu area in bytes
1535 * @dyn_size: free size for dynamic allocation in bytes, -1 for auto
Tejun Heoc8826dd2009-08-14 15:00:52 +09001536 * @atom_size: allocation atom size
1537 * @cpu_distance_fn: callback to determine distance between cpus, optional
1538 * @alloc_fn: function to allocate percpu page
1539 * @free_fn: funtion to free percpu page
Tejun Heo66c3a752009-03-10 16:27:48 +09001540 *
1541 * This is a helper to ease setting up embedded first percpu chunk and
1542 * can be called where pcpu_setup_first_chunk() is expected.
1543 *
1544 * If this function is used to setup the first chunk, it is allocated
Tejun Heoc8826dd2009-08-14 15:00:52 +09001545 * by calling @alloc_fn and used as-is without being mapped into
1546 * vmalloc area. Allocations are always whole multiples of @atom_size
1547 * aligned to @atom_size.
1548 *
1549 * This enables the first chunk to piggy back on the linear physical
1550 * mapping which often uses larger page size. Please note that this
1551 * can result in very sparse cpu->unit mapping on NUMA machines thus
1552 * requiring large vmalloc address space. Don't use this allocator if
1553 * vmalloc space is not orders of magnitude larger than distances
1554 * between node memory addresses (ie. 32bit NUMA machines).
Tejun Heo66c3a752009-03-10 16:27:48 +09001555 *
1556 * When @dyn_size is positive, dynamic area might be larger than
Tejun Heo788e5ab2009-07-04 08:10:58 +09001557 * specified to fill page alignment. When @dyn_size is auto,
1558 * @dyn_size is just big enough to fill page alignment after static
1559 * and reserved areas.
Tejun Heo66c3a752009-03-10 16:27:48 +09001560 *
1561 * If the needed size is smaller than the minimum or specified unit
Tejun Heoc8826dd2009-08-14 15:00:52 +09001562 * size, the leftover is returned using @free_fn.
Tejun Heo66c3a752009-03-10 16:27:48 +09001563 *
1564 * RETURNS:
Tejun Heofb435d52009-08-14 15:00:51 +09001565 * 0 on success, -errno on failure.
Tejun Heo66c3a752009-03-10 16:27:48 +09001566 */
Tejun Heoc8826dd2009-08-14 15:00:52 +09001567int __init pcpu_embed_first_chunk(size_t reserved_size, ssize_t dyn_size,
1568 size_t atom_size,
1569 pcpu_fc_cpu_distance_fn_t cpu_distance_fn,
1570 pcpu_fc_alloc_fn_t alloc_fn,
1571 pcpu_fc_free_fn_t free_fn)
Tejun Heo66c3a752009-03-10 16:27:48 +09001572{
Tejun Heoc8826dd2009-08-14 15:00:52 +09001573 void *base = (void *)ULONG_MAX;
1574 void **areas = NULL;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001575 struct pcpu_alloc_info *ai;
Tejun Heo6ea529a2009-09-24 18:46:01 +09001576 size_t size_sum, areas_size, max_distance;
Tejun Heoc8826dd2009-08-14 15:00:52 +09001577 int group, i, rc;
Tejun Heo66c3a752009-03-10 16:27:48 +09001578
Tejun Heoc8826dd2009-08-14 15:00:52 +09001579 ai = pcpu_build_alloc_info(reserved_size, dyn_size, atom_size,
1580 cpu_distance_fn);
Tejun Heofd1e8a12009-08-14 15:00:51 +09001581 if (IS_ERR(ai))
1582 return PTR_ERR(ai);
Tejun Heo66c3a752009-03-10 16:27:48 +09001583
Tejun Heofd1e8a12009-08-14 15:00:51 +09001584 size_sum = ai->static_size + ai->reserved_size + ai->dyn_size;
Tejun Heoc8826dd2009-08-14 15:00:52 +09001585 areas_size = PFN_ALIGN(ai->nr_groups * sizeof(void *));
Tejun Heo66c3a752009-03-10 16:27:48 +09001586
Tejun Heoc8826dd2009-08-14 15:00:52 +09001587 areas = alloc_bootmem_nopanic(areas_size);
1588 if (!areas) {
Tejun Heofb435d52009-08-14 15:00:51 +09001589 rc = -ENOMEM;
Tejun Heoc8826dd2009-08-14 15:00:52 +09001590 goto out_free;
Tejun Heofa8a7092009-06-22 11:56:24 +09001591 }
Tejun Heo66c3a752009-03-10 16:27:48 +09001592
Tejun Heoc8826dd2009-08-14 15:00:52 +09001593 /* allocate, copy and determine base address */
1594 for (group = 0; group < ai->nr_groups; group++) {
1595 struct pcpu_group_info *gi = &ai->groups[group];
1596 unsigned int cpu = NR_CPUS;
1597 void *ptr;
Tejun Heo66c3a752009-03-10 16:27:48 +09001598
Tejun Heoc8826dd2009-08-14 15:00:52 +09001599 for (i = 0; i < gi->nr_units && cpu == NR_CPUS; i++)
1600 cpu = gi->cpu_map[i];
1601 BUG_ON(cpu == NR_CPUS);
1602
1603 /* allocate space for the whole group */
1604 ptr = alloc_fn(cpu, gi->nr_units * ai->unit_size, atom_size);
1605 if (!ptr) {
1606 rc = -ENOMEM;
1607 goto out_free_areas;
1608 }
1609 areas[group] = ptr;
1610
1611 base = min(ptr, base);
1612
1613 for (i = 0; i < gi->nr_units; i++, ptr += ai->unit_size) {
1614 if (gi->cpu_map[i] == NR_CPUS) {
1615 /* unused unit, free whole */
1616 free_fn(ptr, ai->unit_size);
1617 continue;
1618 }
1619 /* copy and return the unused part */
1620 memcpy(ptr, __per_cpu_load, ai->static_size);
1621 free_fn(ptr + size_sum, ai->unit_size - size_sum);
1622 }
Tejun Heo66c3a752009-03-10 16:27:48 +09001623 }
1624
Tejun Heoc8826dd2009-08-14 15:00:52 +09001625 /* base address is now known, determine group base offsets */
Tejun Heo6ea529a2009-09-24 18:46:01 +09001626 max_distance = 0;
1627 for (group = 0; group < ai->nr_groups; group++) {
Tejun Heoc8826dd2009-08-14 15:00:52 +09001628 ai->groups[group].base_offset = areas[group] - base;
Tejun Heo1a0c3292009-10-04 09:31:05 +09001629 max_distance = max_t(size_t, max_distance,
1630 ai->groups[group].base_offset);
Tejun Heo6ea529a2009-09-24 18:46:01 +09001631 }
1632 max_distance += ai->unit_size;
1633
1634 /* warn if maximum distance is further than 75% of vmalloc space */
1635 if (max_distance > (VMALLOC_END - VMALLOC_START) * 3 / 4) {
Tejun Heo1a0c3292009-10-04 09:31:05 +09001636 pr_warning("PERCPU: max_distance=0x%zx too large for vmalloc "
Tejun Heo6ea529a2009-09-24 18:46:01 +09001637 "space 0x%lx\n",
1638 max_distance, VMALLOC_END - VMALLOC_START);
1639#ifdef CONFIG_NEED_PER_CPU_PAGE_FIRST_CHUNK
1640 /* and fail if we have fallback */
1641 rc = -EINVAL;
1642 goto out_free;
1643#endif
1644 }
Tejun Heoc8826dd2009-08-14 15:00:52 +09001645
Tejun Heo004018e2009-08-14 15:00:49 +09001646 pr_info("PERCPU: Embedded %zu pages/cpu @%p s%zu r%zu d%zu u%zu\n",
Tejun Heofd1e8a12009-08-14 15:00:51 +09001647 PFN_DOWN(size_sum), base, ai->static_size, ai->reserved_size,
1648 ai->dyn_size, ai->unit_size);
Tejun Heo66c3a752009-03-10 16:27:48 +09001649
Tejun Heofb435d52009-08-14 15:00:51 +09001650 rc = pcpu_setup_first_chunk(ai, base);
Tejun Heoc8826dd2009-08-14 15:00:52 +09001651 goto out_free;
1652
1653out_free_areas:
1654 for (group = 0; group < ai->nr_groups; group++)
1655 free_fn(areas[group],
1656 ai->groups[group].nr_units * ai->unit_size);
1657out_free:
Tejun Heofd1e8a12009-08-14 15:00:51 +09001658 pcpu_free_alloc_info(ai);
Tejun Heoc8826dd2009-08-14 15:00:52 +09001659 if (areas)
1660 free_bootmem(__pa(areas), areas_size);
Tejun Heofb435d52009-08-14 15:00:51 +09001661 return rc;
Tejun Heod4b95f82009-07-04 08:10:59 +09001662}
Tejun Heo08fc4582009-08-14 15:00:49 +09001663#endif /* CONFIG_NEED_PER_CPU_EMBED_FIRST_CHUNK ||
1664 !CONFIG_HAVE_SETUP_PER_CPU_AREA */
Tejun Heod4b95f82009-07-04 08:10:59 +09001665
Tejun Heo08fc4582009-08-14 15:00:49 +09001666#ifdef CONFIG_NEED_PER_CPU_PAGE_FIRST_CHUNK
Tejun Heod4b95f82009-07-04 08:10:59 +09001667/**
Tejun Heo00ae4062009-08-14 15:00:49 +09001668 * pcpu_page_first_chunk - map the first chunk using PAGE_SIZE pages
Tejun Heod4b95f82009-07-04 08:10:59 +09001669 * @reserved_size: the size of reserved percpu area in bytes
1670 * @alloc_fn: function to allocate percpu page, always called with PAGE_SIZE
1671 * @free_fn: funtion to free percpu page, always called with PAGE_SIZE
1672 * @populate_pte_fn: function to populate pte
1673 *
Tejun Heo00ae4062009-08-14 15:00:49 +09001674 * This is a helper to ease setting up page-remapped first percpu
1675 * chunk and can be called where pcpu_setup_first_chunk() is expected.
Tejun Heod4b95f82009-07-04 08:10:59 +09001676 *
1677 * This is the basic allocator. Static percpu area is allocated
1678 * page-by-page into vmalloc area.
1679 *
1680 * RETURNS:
Tejun Heofb435d52009-08-14 15:00:51 +09001681 * 0 on success, -errno on failure.
Tejun Heod4b95f82009-07-04 08:10:59 +09001682 */
Tejun Heofb435d52009-08-14 15:00:51 +09001683int __init pcpu_page_first_chunk(size_t reserved_size,
1684 pcpu_fc_alloc_fn_t alloc_fn,
1685 pcpu_fc_free_fn_t free_fn,
1686 pcpu_fc_populate_pte_fn_t populate_pte_fn)
Tejun Heod4b95f82009-07-04 08:10:59 +09001687{
Tejun Heo8f05a6a2009-07-04 08:10:59 +09001688 static struct vm_struct vm;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001689 struct pcpu_alloc_info *ai;
Tejun Heo00ae4062009-08-14 15:00:49 +09001690 char psize_str[16];
Tejun Heoce3141a2009-07-04 08:11:00 +09001691 int unit_pages;
Tejun Heod4b95f82009-07-04 08:10:59 +09001692 size_t pages_size;
Tejun Heoce3141a2009-07-04 08:11:00 +09001693 struct page **pages;
Tejun Heofb435d52009-08-14 15:00:51 +09001694 int unit, i, j, rc;
Tejun Heod4b95f82009-07-04 08:10:59 +09001695
Tejun Heo00ae4062009-08-14 15:00:49 +09001696 snprintf(psize_str, sizeof(psize_str), "%luK", PAGE_SIZE >> 10);
1697
Tejun Heofd1e8a12009-08-14 15:00:51 +09001698 ai = pcpu_build_alloc_info(reserved_size, -1, PAGE_SIZE, NULL);
1699 if (IS_ERR(ai))
1700 return PTR_ERR(ai);
1701 BUG_ON(ai->nr_groups != 1);
1702 BUG_ON(ai->groups[0].nr_units != num_possible_cpus());
1703
1704 unit_pages = ai->unit_size >> PAGE_SHIFT;
Tejun Heod4b95f82009-07-04 08:10:59 +09001705
1706 /* unaligned allocations can't be freed, round up to page size */
Tejun Heofd1e8a12009-08-14 15:00:51 +09001707 pages_size = PFN_ALIGN(unit_pages * num_possible_cpus() *
1708 sizeof(pages[0]));
Tejun Heoce3141a2009-07-04 08:11:00 +09001709 pages = alloc_bootmem(pages_size);
Tejun Heod4b95f82009-07-04 08:10:59 +09001710
Tejun Heo8f05a6a2009-07-04 08:10:59 +09001711 /* allocate pages */
Tejun Heod4b95f82009-07-04 08:10:59 +09001712 j = 0;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001713 for (unit = 0; unit < num_possible_cpus(); unit++)
Tejun Heoce3141a2009-07-04 08:11:00 +09001714 for (i = 0; i < unit_pages; i++) {
Tejun Heofd1e8a12009-08-14 15:00:51 +09001715 unsigned int cpu = ai->groups[0].cpu_map[unit];
Tejun Heod4b95f82009-07-04 08:10:59 +09001716 void *ptr;
1717
Tejun Heo3cbc8562009-08-14 15:00:50 +09001718 ptr = alloc_fn(cpu, PAGE_SIZE, PAGE_SIZE);
Tejun Heod4b95f82009-07-04 08:10:59 +09001719 if (!ptr) {
Tejun Heo00ae4062009-08-14 15:00:49 +09001720 pr_warning("PERCPU: failed to allocate %s page "
1721 "for cpu%u\n", psize_str, cpu);
Tejun Heod4b95f82009-07-04 08:10:59 +09001722 goto enomem;
1723 }
Tejun Heoce3141a2009-07-04 08:11:00 +09001724 pages[j++] = virt_to_page(ptr);
Tejun Heod4b95f82009-07-04 08:10:59 +09001725 }
1726
Tejun Heo8f05a6a2009-07-04 08:10:59 +09001727 /* allocate vm area, map the pages and copy static data */
1728 vm.flags = VM_ALLOC;
Tejun Heofd1e8a12009-08-14 15:00:51 +09001729 vm.size = num_possible_cpus() * ai->unit_size;
Tejun Heo8f05a6a2009-07-04 08:10:59 +09001730 vm_area_register_early(&vm, PAGE_SIZE);
1731
Tejun Heofd1e8a12009-08-14 15:00:51 +09001732 for (unit = 0; unit < num_possible_cpus(); unit++) {
Tejun Heo1d9d3252009-08-14 15:00:50 +09001733 unsigned long unit_addr =
Tejun Heofd1e8a12009-08-14 15:00:51 +09001734 (unsigned long)vm.addr + unit * ai->unit_size;
Tejun Heo8f05a6a2009-07-04 08:10:59 +09001735
Tejun Heoce3141a2009-07-04 08:11:00 +09001736 for (i = 0; i < unit_pages; i++)
Tejun Heo8f05a6a2009-07-04 08:10:59 +09001737 populate_pte_fn(unit_addr + (i << PAGE_SHIFT));
1738
1739 /* pte already populated, the following shouldn't fail */
Tejun Heofb435d52009-08-14 15:00:51 +09001740 rc = __pcpu_map_pages(unit_addr, &pages[unit * unit_pages],
1741 unit_pages);
1742 if (rc < 0)
1743 panic("failed to map percpu area, err=%d\n", rc);
Tejun Heo8f05a6a2009-07-04 08:10:59 +09001744
1745 /*
1746 * FIXME: Archs with virtual cache should flush local
1747 * cache for the linear mapping here - something
1748 * equivalent to flush_cache_vmap() on the local cpu.
1749 * flush_cache_vmap() can't be used as most supporting
1750 * data structures are not set up yet.
1751 */
1752
1753 /* copy static data */
Tejun Heofd1e8a12009-08-14 15:00:51 +09001754 memcpy((void *)unit_addr, __per_cpu_load, ai->static_size);
Tejun Heo66c3a752009-03-10 16:27:48 +09001755 }
1756
1757 /* we're ready, commit */
Tejun Heo1d9d3252009-08-14 15:00:50 +09001758 pr_info("PERCPU: %d %s pages/cpu @%p s%zu r%zu d%zu\n",
Tejun Heofd1e8a12009-08-14 15:00:51 +09001759 unit_pages, psize_str, vm.addr, ai->static_size,
1760 ai->reserved_size, ai->dyn_size);
Tejun Heo66c3a752009-03-10 16:27:48 +09001761
Tejun Heofb435d52009-08-14 15:00:51 +09001762 rc = pcpu_setup_first_chunk(ai, vm.addr);
Tejun Heod4b95f82009-07-04 08:10:59 +09001763 goto out_free_ar;
1764
1765enomem:
1766 while (--j >= 0)
Tejun Heoce3141a2009-07-04 08:11:00 +09001767 free_fn(page_address(pages[j]), PAGE_SIZE);
Tejun Heofb435d52009-08-14 15:00:51 +09001768 rc = -ENOMEM;
Tejun Heod4b95f82009-07-04 08:10:59 +09001769out_free_ar:
Tejun Heoce3141a2009-07-04 08:11:00 +09001770 free_bootmem(__pa(pages), pages_size);
Tejun Heofd1e8a12009-08-14 15:00:51 +09001771 pcpu_free_alloc_info(ai);
Tejun Heofb435d52009-08-14 15:00:51 +09001772 return rc;
Tejun Heo66c3a752009-03-10 16:27:48 +09001773}
Tejun Heo08fc4582009-08-14 15:00:49 +09001774#endif /* CONFIG_NEED_PER_CPU_PAGE_FIRST_CHUNK */
Tejun Heod4b95f82009-07-04 08:10:59 +09001775
Tejun Heo8c4bfc62009-07-04 08:10:59 +09001776/*
Tejun Heoe74e3962009-03-30 19:07:44 +09001777 * Generic percpu area setup.
1778 *
1779 * The embedding helper is used because its behavior closely resembles
1780 * the original non-dynamic generic percpu area setup. This is
1781 * important because many archs have addressing restrictions and might
1782 * fail if the percpu area is located far away from the previous
1783 * location. As an added bonus, in non-NUMA cases, embedding is
1784 * generally a good idea TLB-wise because percpu area can piggy back
1785 * on the physical linear memory mapping which uses large page
1786 * mappings on applicable archs.
1787 */
1788#ifndef CONFIG_HAVE_SETUP_PER_CPU_AREA
1789unsigned long __per_cpu_offset[NR_CPUS] __read_mostly;
1790EXPORT_SYMBOL(__per_cpu_offset);
1791
Tejun Heoc8826dd2009-08-14 15:00:52 +09001792static void * __init pcpu_dfl_fc_alloc(unsigned int cpu, size_t size,
1793 size_t align)
1794{
1795 return __alloc_bootmem_nopanic(size, align, __pa(MAX_DMA_ADDRESS));
1796}
1797
1798static void __init pcpu_dfl_fc_free(void *ptr, size_t size)
1799{
1800 free_bootmem(__pa(ptr), size);
1801}
1802
Tejun Heoe74e3962009-03-30 19:07:44 +09001803void __init setup_per_cpu_areas(void)
1804{
Tejun Heoe74e3962009-03-30 19:07:44 +09001805 unsigned long delta;
1806 unsigned int cpu;
Tejun Heofb435d52009-08-14 15:00:51 +09001807 int rc;
Tejun Heoe74e3962009-03-30 19:07:44 +09001808
1809 /*
1810 * Always reserve area for module percpu variables. That's
1811 * what the legacy allocator did.
1812 */
Tejun Heofb435d52009-08-14 15:00:51 +09001813 rc = pcpu_embed_first_chunk(PERCPU_MODULE_RESERVE,
Tejun Heoc8826dd2009-08-14 15:00:52 +09001814 PERCPU_DYNAMIC_RESERVE, PAGE_SIZE, NULL,
1815 pcpu_dfl_fc_alloc, pcpu_dfl_fc_free);
Tejun Heofb435d52009-08-14 15:00:51 +09001816 if (rc < 0)
Tejun Heoe74e3962009-03-30 19:07:44 +09001817 panic("Failed to initialized percpu areas.");
1818
1819 delta = (unsigned long)pcpu_base_addr - (unsigned long)__per_cpu_start;
1820 for_each_possible_cpu(cpu)
Tejun Heofb435d52009-08-14 15:00:51 +09001821 __per_cpu_offset[cpu] = delta + pcpu_unit_offsets[cpu];
Tejun Heoe74e3962009-03-30 19:07:44 +09001822}
1823#endif /* CONFIG_HAVE_SETUP_PER_CPU_AREA */