blob: 835088d55645af9138cece374ac9f48c0e2d1e81 [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001// SPDX-License-Identifier: GPL-2.0
Matt Mackall10cef602006-01-08 01:01:45 -08002/*
3 * SLOB Allocator: Simple List Of Blocks
4 *
5 * Matt Mackall <mpm@selenic.com> 12/30/03
6 *
Paul Mundt6193a2f2007-07-15 23:38:22 -07007 * NUMA support by Paul Mundt, 2007.
8 *
Matt Mackall10cef602006-01-08 01:01:45 -08009 * How SLOB works:
10 *
11 * The core of SLOB is a traditional K&R style heap allocator, with
12 * support for returning aligned objects. The granularity of this
Nick Piggin55394842007-07-15 23:38:09 -070013 * allocator is as little as 2 bytes, however typically most architectures
14 * will require 4 bytes on 32-bit and 8 bytes on 64-bit.
Nick Piggin95b35122007-07-15 23:38:07 -070015 *
Matt Mackall20cecba2008-02-04 22:29:37 -080016 * The slob heap is a set of linked list of pages from alloc_pages(),
17 * and within each page, there is a singly-linked list of free blocks
18 * (slob_t). The heap is grown on demand. To reduce fragmentation,
19 * heap pages are segregated into three lists, with objects less than
20 * 256 bytes, objects less than 1024 bytes, and all other objects.
21 *
22 * Allocation from heap involves first searching for a page with
23 * sufficient free blocks (using a next-fit-like approach) followed by
24 * a first-fit scan of the page. Deallocation inserts objects back
25 * into the free list in address order, so this is effectively an
26 * address-ordered first fit.
Matt Mackall10cef602006-01-08 01:01:45 -080027 *
28 * Above this is an implementation of kmalloc/kfree. Blocks returned
Nick Piggin55394842007-07-15 23:38:09 -070029 * from kmalloc are prepended with a 4-byte header with the kmalloc size.
Matt Mackall10cef602006-01-08 01:01:45 -080030 * If kmalloc is asked for objects of PAGE_SIZE or larger, it calls
Paul Mundt6193a2f2007-07-15 23:38:22 -070031 * alloc_pages() directly, allocating compound pages so the page order
Ezequiel Garcia999d8792012-10-19 09:33:10 -030032 * does not have to be separately tracked.
33 * These objects are detected in kfree() because PageSlab()
Nick Piggind87a1332007-07-15 23:38:08 -070034 * is false for them.
Matt Mackall10cef602006-01-08 01:01:45 -080035 *
36 * SLAB is emulated on top of SLOB by simply calling constructors and
Nick Piggin95b35122007-07-15 23:38:07 -070037 * destructors for every SLAB allocation. Objects are returned with the
38 * 4-byte alignment unless the SLAB_HWCACHE_ALIGN flag is set, in which
39 * case the low-level allocator will fragment blocks to create the proper
40 * alignment. Again, objects of page-size or greater are allocated by
Paul Mundt6193a2f2007-07-15 23:38:22 -070041 * calling alloc_pages(). As SLAB objects know their size, no separate
Nick Piggin95b35122007-07-15 23:38:07 -070042 * size bookkeeping is necessary and there is essentially no allocation
Nick Piggind87a1332007-07-15 23:38:08 -070043 * space overhead, and compound pages aren't needed for multi-page
44 * allocations.
Paul Mundt6193a2f2007-07-15 23:38:22 -070045 *
46 * NUMA support in SLOB is fairly simplistic, pushing most of the real
47 * logic down to the page allocator, and simply doing the node accounting
48 * on the upper levels. In the event that a node id is explicitly
Vlastimil Babka96db8002015-09-08 15:03:50 -070049 * provided, __alloc_pages_node() with the specified node id is used
Paul Mundt6193a2f2007-07-15 23:38:22 -070050 * instead. The common case (or when the node id isn't explicitly provided)
51 * will default to the current node, as per numa_node_id().
52 *
53 * Node aware pages are still inserted in to the global freelist, and
54 * these are scanned for by matching against the node id encoded in the
55 * page flags. As a result, block allocations that can be satisfied from
56 * the freelist will only be done so on pages residing on the same node,
57 * in order to prevent random node placement.
Matt Mackall10cef602006-01-08 01:01:45 -080058 */
59
Nick Piggin95b35122007-07-15 23:38:07 -070060#include <linux/kernel.h>
Matt Mackall10cef602006-01-08 01:01:45 -080061#include <linux/slab.h>
Christoph Lameter97d06602012-07-06 15:25:11 -050062
Matt Mackall10cef602006-01-08 01:01:45 -080063#include <linux/mm.h>
Nick Piggin1f0532e2009-05-05 19:13:45 +100064#include <linux/swap.h> /* struct reclaim_state */
Matt Mackall10cef602006-01-08 01:01:45 -080065#include <linux/cache.h>
66#include <linux/init.h>
Paul Gortmakerb95f1b312011-10-16 02:01:52 -040067#include <linux/export.h>
Nick Pigginafc0ced2007-05-16 22:10:49 -070068#include <linux/rcupdate.h>
Nick Piggin95b35122007-07-15 23:38:07 -070069#include <linux/list.h>
Catalin Marinas4374e612009-06-11 13:23:17 +010070#include <linux/kmemleak.h>
Li Zefan039ca4e2010-05-26 17:22:17 +080071
72#include <trace/events/kmem.h>
73
Arun Sharma600634972011-07-26 16:09:06 -070074#include <linux/atomic.h>
Matt Mackall10cef602006-01-08 01:01:45 -080075
Glauber Costab9ce5ef2012-12-18 14:22:46 -080076#include "slab.h"
Nick Piggin95b35122007-07-15 23:38:07 -070077/*
78 * slob_block has a field 'units', which indicates size of block if +ve,
79 * or offset of next block if -ve (in SLOB_UNITs).
80 *
81 * Free blocks of size 1 unit simply contain the offset of the next block.
82 * Those with larger size contain their size in the first SLOB_UNIT of
83 * memory, and the offset of the next free block in the second SLOB_UNIT.
84 */
Nick Piggin55394842007-07-15 23:38:09 -070085#if PAGE_SIZE <= (32767 * 2)
Nick Piggin95b35122007-07-15 23:38:07 -070086typedef s16 slobidx_t;
87#else
88typedef s32 slobidx_t;
89#endif
90
Matt Mackall10cef602006-01-08 01:01:45 -080091struct slob_block {
Nick Piggin95b35122007-07-15 23:38:07 -070092 slobidx_t units;
Nick Piggin55394842007-07-15 23:38:09 -070093};
Matt Mackall10cef602006-01-08 01:01:45 -080094typedef struct slob_block slob_t;
95
Nick Piggin95b35122007-07-15 23:38:07 -070096/*
Matt Mackall20cecba2008-02-04 22:29:37 -080097 * All partially free slob pages go on these lists.
Nick Piggin95b35122007-07-15 23:38:07 -070098 */
Matt Mackall20cecba2008-02-04 22:29:37 -080099#define SLOB_BREAK1 256
100#define SLOB_BREAK2 1024
101static LIST_HEAD(free_slob_small);
102static LIST_HEAD(free_slob_medium);
103static LIST_HEAD(free_slob_large);
Nick Piggin95b35122007-07-15 23:38:07 -0700104
105/*
Nick Piggin95b35122007-07-15 23:38:07 -0700106 * slob_page_free: true for pages on free_slob_pages list.
107 */
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500108static inline int slob_page_free(struct page *sp)
Nick Piggin95b35122007-07-15 23:38:07 -0700109{
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500110 return PageSlobFree(sp);
Nick Piggin95b35122007-07-15 23:38:07 -0700111}
112
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500113static void set_slob_page_free(struct page *sp, struct list_head *list)
Nick Piggin95b35122007-07-15 23:38:07 -0700114{
Tobin C. Hardingadab7b62019-05-13 17:16:06 -0700115 list_add(&sp->slab_list, list);
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500116 __SetPageSlobFree(sp);
Nick Piggin95b35122007-07-15 23:38:07 -0700117}
118
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500119static inline void clear_slob_page_free(struct page *sp)
Nick Piggin95b35122007-07-15 23:38:07 -0700120{
Tobin C. Hardingadab7b62019-05-13 17:16:06 -0700121 list_del(&sp->slab_list);
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500122 __ClearPageSlobFree(sp);
Nick Piggin95b35122007-07-15 23:38:07 -0700123}
124
Matt Mackall10cef602006-01-08 01:01:45 -0800125#define SLOB_UNIT sizeof(slob_t)
Sasha Levina6d78152012-12-20 14:11:39 -0500126#define SLOB_UNITS(size) DIV_ROUND_UP(size, SLOB_UNIT)
Matt Mackall10cef602006-01-08 01:01:45 -0800127
Nick Pigginafc0ced2007-05-16 22:10:49 -0700128/*
129 * struct slob_rcu is inserted at the tail of allocated slob blocks, which
Paul E. McKenney5f0d5a32017-01-18 02:53:44 -0800130 * were created with a SLAB_TYPESAFE_BY_RCU slab. slob_rcu is used to free
Nick Pigginafc0ced2007-05-16 22:10:49 -0700131 * the block using call_rcu.
132 */
133struct slob_rcu {
134 struct rcu_head head;
135 int size;
136};
137
Nick Piggin95b35122007-07-15 23:38:07 -0700138/*
139 * slob_lock protects all slob allocator structures.
140 */
Matt Mackall10cef602006-01-08 01:01:45 -0800141static DEFINE_SPINLOCK(slob_lock);
Matt Mackall10cef602006-01-08 01:01:45 -0800142
Nick Piggin95b35122007-07-15 23:38:07 -0700143/*
144 * Encode the given size and next info into a free slob block s.
145 */
146static void set_slob(slob_t *s, slobidx_t size, slob_t *next)
147{
148 slob_t *base = (slob_t *)((unsigned long)s & PAGE_MASK);
149 slobidx_t offset = next - base;
Dimitri Gorokhovikbcb4ddb2006-12-29 16:48:28 -0800150
Nick Piggin95b35122007-07-15 23:38:07 -0700151 if (size > 1) {
152 s[0].units = size;
153 s[1].units = offset;
154 } else
155 s[0].units = -offset;
156}
Matt Mackall10cef602006-01-08 01:01:45 -0800157
Nick Piggin95b35122007-07-15 23:38:07 -0700158/*
159 * Return the size of a slob block.
160 */
161static slobidx_t slob_units(slob_t *s)
162{
163 if (s->units > 0)
164 return s->units;
165 return 1;
166}
167
168/*
169 * Return the next free slob block pointer after this one.
170 */
171static slob_t *slob_next(slob_t *s)
172{
173 slob_t *base = (slob_t *)((unsigned long)s & PAGE_MASK);
174 slobidx_t next;
175
176 if (s[0].units < 0)
177 next = -s[0].units;
178 else
179 next = s[1].units;
180 return base+next;
181}
182
183/*
184 * Returns true if s is the last free block in its page.
185 */
186static int slob_last(slob_t *s)
187{
188 return !((unsigned long)slob_next(s) & ~PAGE_MASK);
189}
190
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800191static void *slob_new_pages(gfp_t gfp, int order, int node)
Paul Mundt6193a2f2007-07-15 23:38:22 -0700192{
Vlastimil Babka6a486c02019-10-06 17:58:42 -0700193 struct page *page;
Paul Mundt6193a2f2007-07-15 23:38:22 -0700194
195#ifdef CONFIG_NUMA
Ezequiel Garcia90f2cbb2012-09-08 17:47:51 -0300196 if (node != NUMA_NO_NODE)
Vlastimil Babka96db8002015-09-08 15:03:50 -0700197 page = __alloc_pages_node(node, gfp, order);
Paul Mundt6193a2f2007-07-15 23:38:22 -0700198 else
199#endif
200 page = alloc_pages(gfp, order);
201
202 if (!page)
203 return NULL;
204
Vlastimil Babka6a486c02019-10-06 17:58:42 -0700205 mod_node_page_state(page_pgdat(page), NR_SLAB_UNRECLAIMABLE,
206 1 << order);
Paul Mundt6193a2f2007-07-15 23:38:22 -0700207 return page_address(page);
208}
209
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800210static void slob_free_pages(void *b, int order)
211{
Vlastimil Babka6a486c02019-10-06 17:58:42 -0700212 struct page *sp = virt_to_page(b);
213
Nick Piggin1f0532e2009-05-05 19:13:45 +1000214 if (current->reclaim_state)
215 current->reclaim_state->reclaimed_slab += 1 << order;
Vlastimil Babka6a486c02019-10-06 17:58:42 -0700216
217 mod_node_page_state(page_pgdat(sp), NR_SLAB_UNRECLAIMABLE,
218 -(1 << order));
219 __free_pages(sp, order);
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800220}
221
Nick Piggin95b35122007-07-15 23:38:07 -0700222/*
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700223 * slob_page_alloc() - Allocate a slob block within a given slob_page sp.
224 * @sp: Page to look in.
225 * @size: Size of the allocation.
226 * @align: Allocation alignment.
227 * @page_removed_from_list: Return parameter.
228 *
229 * Tries to find a chunk of memory at least @size bytes big within @page.
230 *
231 * Return: Pointer to memory if allocated, %NULL otherwise. If the
232 * allocation fills up @page then the page is removed from the
233 * freelist, in this case @page_removed_from_list will be set to
234 * true (set to false otherwise).
Nick Piggin95b35122007-07-15 23:38:07 -0700235 */
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700236static void *slob_page_alloc(struct page *sp, size_t size, int align,
237 bool *page_removed_from_list)
Matt Mackall10cef602006-01-08 01:01:45 -0800238{
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800239 slob_t *prev, *cur, *aligned = NULL;
Matt Mackall10cef602006-01-08 01:01:45 -0800240 int delta = 0, units = SLOB_UNITS(size);
Matt Mackall10cef602006-01-08 01:01:45 -0800241
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700242 *page_removed_from_list = false;
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500243 for (prev = NULL, cur = sp->freelist; ; prev = cur, cur = slob_next(cur)) {
Nick Piggin95b35122007-07-15 23:38:07 -0700244 slobidx_t avail = slob_units(cur);
245
Matt Mackall10cef602006-01-08 01:01:45 -0800246 if (align) {
247 aligned = (slob_t *)ALIGN((unsigned long)cur, align);
248 delta = aligned - cur;
249 }
Nick Piggin95b35122007-07-15 23:38:07 -0700250 if (avail >= units + delta) { /* room enough? */
251 slob_t *next;
252
Matt Mackall10cef602006-01-08 01:01:45 -0800253 if (delta) { /* need to fragment head to align? */
Nick Piggin95b35122007-07-15 23:38:07 -0700254 next = slob_next(cur);
255 set_slob(aligned, avail - delta, next);
256 set_slob(cur, delta, aligned);
Matt Mackall10cef602006-01-08 01:01:45 -0800257 prev = cur;
258 cur = aligned;
Nick Piggin95b35122007-07-15 23:38:07 -0700259 avail = slob_units(cur);
Matt Mackall10cef602006-01-08 01:01:45 -0800260 }
261
Nick Piggin95b35122007-07-15 23:38:07 -0700262 next = slob_next(cur);
263 if (avail == units) { /* exact fit? unlink. */
264 if (prev)
265 set_slob(prev, slob_units(prev), next);
266 else
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500267 sp->freelist = next;
Nick Piggin95b35122007-07-15 23:38:07 -0700268 } else { /* fragment */
269 if (prev)
270 set_slob(prev, slob_units(prev), cur + units);
271 else
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500272 sp->freelist = cur + units;
Nick Piggin95b35122007-07-15 23:38:07 -0700273 set_slob(cur + units, avail - units, next);
Matt Mackall10cef602006-01-08 01:01:45 -0800274 }
275
Nick Piggin95b35122007-07-15 23:38:07 -0700276 sp->units -= units;
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700277 if (!sp->units) {
Nick Piggin95b35122007-07-15 23:38:07 -0700278 clear_slob_page_free(sp);
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700279 *page_removed_from_list = true;
280 }
Matt Mackall10cef602006-01-08 01:01:45 -0800281 return cur;
282 }
Nick Piggin95b35122007-07-15 23:38:07 -0700283 if (slob_last(cur))
284 return NULL;
Matt Mackall10cef602006-01-08 01:01:45 -0800285 }
286}
287
Nick Piggin95b35122007-07-15 23:38:07 -0700288/*
289 * slob_alloc: entry point into the slob allocator.
290 */
Paul Mundt6193a2f2007-07-15 23:38:22 -0700291static void *slob_alloc(size_t size, gfp_t gfp, int align, int node)
Nick Piggin95b35122007-07-15 23:38:07 -0700292{
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500293 struct page *sp;
Matt Mackall20cecba2008-02-04 22:29:37 -0800294 struct list_head *slob_list;
Nick Piggin95b35122007-07-15 23:38:07 -0700295 slob_t *b = NULL;
296 unsigned long flags;
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700297 bool _unused;
Nick Piggin95b35122007-07-15 23:38:07 -0700298
Matt Mackall20cecba2008-02-04 22:29:37 -0800299 if (size < SLOB_BREAK1)
300 slob_list = &free_slob_small;
301 else if (size < SLOB_BREAK2)
302 slob_list = &free_slob_medium;
303 else
304 slob_list = &free_slob_large;
305
Nick Piggin95b35122007-07-15 23:38:07 -0700306 spin_lock_irqsave(&slob_lock, flags);
307 /* Iterate through each partially free page, try to find room */
Tobin C. Hardingadab7b62019-05-13 17:16:06 -0700308 list_for_each_entry(sp, slob_list, slab_list) {
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700309 bool page_removed_from_list = false;
Paul Mundt6193a2f2007-07-15 23:38:22 -0700310#ifdef CONFIG_NUMA
311 /*
312 * If there's a node specification, search for a partial
313 * page with a matching node id in the freelist.
314 */
Ezequiel Garcia90f2cbb2012-09-08 17:47:51 -0300315 if (node != NUMA_NO_NODE && page_to_nid(sp) != node)
Paul Mundt6193a2f2007-07-15 23:38:22 -0700316 continue;
317#endif
Matt Mackalld6269542007-07-21 04:37:40 -0700318 /* Enough room on this page? */
319 if (sp->units < SLOB_UNITS(size))
320 continue;
Paul Mundt6193a2f2007-07-15 23:38:22 -0700321
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700322 b = slob_page_alloc(sp, size, align, &page_removed_from_list);
Matt Mackalld6269542007-07-21 04:37:40 -0700323 if (!b)
324 continue;
325
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700326 /*
327 * If slob_page_alloc() removed sp from the list then we
328 * cannot call list functions on sp. If so allocation
329 * did not fragment the page anyway so optimisation is
330 * unnecessary.
331 */
332 if (!page_removed_from_list) {
333 /*
334 * Improve fragment distribution and reduce our average
335 * search time by starting our next search here. (see
336 * Knuth vol 1, sec 2.5, pg 449)
337 */
Tobin C. Hardingadab7b62019-05-13 17:16:06 -0700338 if (!list_is_first(&sp->slab_list, slob_list))
339 list_rotate_to_front(&sp->slab_list, slob_list);
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700340 }
Matt Mackalld6269542007-07-21 04:37:40 -0700341 break;
Nick Piggin95b35122007-07-15 23:38:07 -0700342 }
343 spin_unlock_irqrestore(&slob_lock, flags);
344
345 /* Not enough space: must allocate a new page */
346 if (!b) {
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800347 b = slob_new_pages(gfp & ~__GFP_ZERO, 0, node);
Nick Piggin95b35122007-07-15 23:38:07 -0700348 if (!b)
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800349 return NULL;
Christoph Lameterb5568282012-06-13 10:24:54 -0500350 sp = virt_to_page(b);
351 __SetPageSlab(sp);
Nick Piggin95b35122007-07-15 23:38:07 -0700352
353 spin_lock_irqsave(&slob_lock, flags);
354 sp->units = SLOB_UNITS(PAGE_SIZE);
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500355 sp->freelist = b;
Tobin C. Hardingadab7b62019-05-13 17:16:06 -0700356 INIT_LIST_HEAD(&sp->slab_list);
Nick Piggin95b35122007-07-15 23:38:07 -0700357 set_slob(b, SLOB_UNITS(PAGE_SIZE), b + SLOB_UNITS(PAGE_SIZE));
Matt Mackall20cecba2008-02-04 22:29:37 -0800358 set_slob_page_free(sp, slob_list);
Tobin C. Harding130e8e02019-05-13 17:16:03 -0700359 b = slob_page_alloc(sp, size, align, &_unused);
Nick Piggin95b35122007-07-15 23:38:07 -0700360 BUG_ON(!b);
361 spin_unlock_irqrestore(&slob_lock, flags);
362 }
Miles Chen9f88fae2017-11-15 17:32:10 -0800363 if (unlikely(gfp & __GFP_ZERO))
Christoph Lameterd07dbea2007-07-17 04:03:23 -0700364 memset(b, 0, size);
Nick Piggin95b35122007-07-15 23:38:07 -0700365 return b;
366}
367
368/*
369 * slob_free: entry point into the slob allocator.
370 */
Matt Mackall10cef602006-01-08 01:01:45 -0800371static void slob_free(void *block, int size)
372{
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500373 struct page *sp;
Nick Piggin95b35122007-07-15 23:38:07 -0700374 slob_t *prev, *next, *b = (slob_t *)block;
375 slobidx_t units;
Matt Mackall10cef602006-01-08 01:01:45 -0800376 unsigned long flags;
Bob Liud602dab2010-07-10 18:05:33 +0800377 struct list_head *slob_list;
Matt Mackall10cef602006-01-08 01:01:45 -0800378
Satyam Sharma2408c552007-10-16 01:24:44 -0700379 if (unlikely(ZERO_OR_NULL_PTR(block)))
Matt Mackall10cef602006-01-08 01:01:45 -0800380 return;
Nick Piggin95b35122007-07-15 23:38:07 -0700381 BUG_ON(!size);
Matt Mackall10cef602006-01-08 01:01:45 -0800382
Christoph Lameterb5568282012-06-13 10:24:54 -0500383 sp = virt_to_page(block);
Nick Piggin95b35122007-07-15 23:38:07 -0700384 units = SLOB_UNITS(size);
Matt Mackall10cef602006-01-08 01:01:45 -0800385
Matt Mackall10cef602006-01-08 01:01:45 -0800386 spin_lock_irqsave(&slob_lock, flags);
Matt Mackall10cef602006-01-08 01:01:45 -0800387
Nick Piggin95b35122007-07-15 23:38:07 -0700388 if (sp->units + units == SLOB_UNITS(PAGE_SIZE)) {
389 /* Go directly to page allocator. Do not pass slob allocator */
390 if (slob_page_free(sp))
391 clear_slob_page_free(sp);
Nick Piggin6fb8f422009-03-16 21:00:28 +1100392 spin_unlock_irqrestore(&slob_lock, flags);
Christoph Lameterb5568282012-06-13 10:24:54 -0500393 __ClearPageSlab(sp);
Mel Gorman22b751c2013-02-22 16:34:59 -0800394 page_mapcount_reset(sp);
Nick Piggin1f0532e2009-05-05 19:13:45 +1000395 slob_free_pages(b, 0);
Nick Piggin6fb8f422009-03-16 21:00:28 +1100396 return;
Nick Piggin95b35122007-07-15 23:38:07 -0700397 }
Matt Mackall10cef602006-01-08 01:01:45 -0800398
Nick Piggin95b35122007-07-15 23:38:07 -0700399 if (!slob_page_free(sp)) {
400 /* This slob page is about to become partially free. Easy! */
401 sp->units = units;
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500402 sp->freelist = b;
Nick Piggin95b35122007-07-15 23:38:07 -0700403 set_slob(b, units,
404 (void *)((unsigned long)(b +
405 SLOB_UNITS(PAGE_SIZE)) & PAGE_MASK));
Bob Liud602dab2010-07-10 18:05:33 +0800406 if (size < SLOB_BREAK1)
407 slob_list = &free_slob_small;
408 else if (size < SLOB_BREAK2)
409 slob_list = &free_slob_medium;
410 else
411 slob_list = &free_slob_large;
412 set_slob_page_free(sp, slob_list);
Nick Piggin95b35122007-07-15 23:38:07 -0700413 goto out;
414 }
Matt Mackall10cef602006-01-08 01:01:45 -0800415
Nick Piggin95b35122007-07-15 23:38:07 -0700416 /*
417 * Otherwise the page is already partially free, so find reinsertion
418 * point.
419 */
420 sp->units += units;
Matt Mackall10cef602006-01-08 01:01:45 -0800421
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500422 if (b < (slob_t *)sp->freelist) {
423 if (b + units == sp->freelist) {
424 units += slob_units(sp->freelist);
425 sp->freelist = slob_next(sp->freelist);
Matt Mackall679299b2008-02-04 22:29:37 -0800426 }
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500427 set_slob(b, units, sp->freelist);
428 sp->freelist = b;
Nick Piggin95b35122007-07-15 23:38:07 -0700429 } else {
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500430 prev = sp->freelist;
Nick Piggin95b35122007-07-15 23:38:07 -0700431 next = slob_next(prev);
432 while (b > next) {
433 prev = next;
434 next = slob_next(prev);
435 }
436
437 if (!slob_last(prev) && b + units == next) {
438 units += slob_units(next);
439 set_slob(b, units, slob_next(next));
440 } else
441 set_slob(b, units, next);
442
443 if (prev + slob_units(prev) == b) {
444 units = slob_units(b) + slob_units(prev);
445 set_slob(prev, units, slob_next(b));
446 } else
447 set_slob(prev, slob_units(prev), b);
448 }
449out:
Matt Mackall10cef602006-01-08 01:01:45 -0800450 spin_unlock_irqrestore(&slob_lock, flags);
451}
452
Nick Piggin95b35122007-07-15 23:38:07 -0700453/*
454 * End of slob allocator proper. Begin kmem_cache_alloc and kmalloc frontend.
455 */
456
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300457static __always_inline void *
458__do_kmalloc_node(size_t size, gfp_t gfp, int node, unsigned long caller)
Matt Mackall10cef602006-01-08 01:01:45 -0800459{
Christoph Lameter6cb8f912007-07-17 04:03:22 -0700460 unsigned int *m;
Arnd Bergmann789306e2012-10-05 16:55:20 +0200461 int align = max_t(size_t, ARCH_KMALLOC_MINALIGN, ARCH_SLAB_MINALIGN);
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300462 void *ret;
Nick Piggin55394842007-07-15 23:38:09 -0700463
Steven Rostedtbd50cfa2011-06-07 07:18:45 -0400464 gfp &= gfp_allowed_mask;
465
Peter Zijlstrad92a8cf2017-03-03 10:13:38 +0100466 fs_reclaim_acquire(gfp);
467 fs_reclaim_release(gfp);
Nick Piggincf40bd12009-01-21 08:12:39 +0100468
Nick Piggin55394842007-07-15 23:38:09 -0700469 if (size < PAGE_SIZE - align) {
Christoph Lameter6cb8f912007-07-17 04:03:22 -0700470 if (!size)
471 return ZERO_SIZE_PTR;
472
Paul Mundt6193a2f2007-07-15 23:38:22 -0700473 m = slob_alloc(size + align, gfp, align, node);
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300474
MinChan Kim239f49c2008-05-19 22:12:08 +0900475 if (!m)
476 return NULL;
477 *m = size;
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300478 ret = (void *)m + align;
Nick Piggind87a1332007-07-15 23:38:08 -0700479
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300480 trace_kmalloc_node(caller, ret,
Eduard - Gabriel Munteanuca2b84cb2009-03-23 15:12:24 +0200481 size, size + align, gfp, node);
Nick Piggind87a1332007-07-15 23:38:08 -0700482 } else {
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300483 unsigned int order = get_order(size);
Nick Piggind87a1332007-07-15 23:38:08 -0700484
David Rientjes8df275a2010-08-22 16:16:06 -0700485 if (likely(order))
486 gfp |= __GFP_COMP;
487 ret = slob_new_pages(gfp, order, node);
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300488
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300489 trace_kmalloc_node(caller, ret,
Eduard - Gabriel Munteanuca2b84cb2009-03-23 15:12:24 +0200490 size, PAGE_SIZE << order, gfp, node);
Matt Mackall10cef602006-01-08 01:01:45 -0800491 }
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300492
Catalin Marinas4374e612009-06-11 13:23:17 +0100493 kmemleak_alloc(ret, size, 1, gfp);
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300494 return ret;
Matt Mackall10cef602006-01-08 01:01:45 -0800495}
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300496
Christoph Lameterf1b6eb62013-09-04 16:35:34 +0000497void *__kmalloc(size_t size, gfp_t gfp)
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300498{
Christoph Lameterf1b6eb62013-09-04 16:35:34 +0000499 return __do_kmalloc_node(size, gfp, NUMA_NO_NODE, _RET_IP_);
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300500}
Christoph Lameterf1b6eb62013-09-04 16:35:34 +0000501EXPORT_SYMBOL(__kmalloc);
Matt Mackall10cef602006-01-08 01:01:45 -0800502
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300503void *__kmalloc_track_caller(size_t size, gfp_t gfp, unsigned long caller)
504{
505 return __do_kmalloc_node(size, gfp, NUMA_NO_NODE, caller);
506}
507
508#ifdef CONFIG_NUMA
David Rientjes82bd5502012-09-25 12:53:51 -0700509void *__kmalloc_node_track_caller(size_t size, gfp_t gfp,
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300510 int node, unsigned long caller)
511{
512 return __do_kmalloc_node(size, gfp, node, caller);
513}
514#endif
Ezequiel Garciaf3f74102012-09-08 17:47:53 -0300515
Matt Mackall10cef602006-01-08 01:01:45 -0800516void kfree(const void *block)
517{
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500518 struct page *sp;
Matt Mackall10cef602006-01-08 01:01:45 -0800519
Pekka Enberg2121db72009-03-25 11:05:57 +0200520 trace_kfree(_RET_IP_, block);
521
Satyam Sharma2408c552007-10-16 01:24:44 -0700522 if (unlikely(ZERO_OR_NULL_PTR(block)))
Matt Mackall10cef602006-01-08 01:01:45 -0800523 return;
Catalin Marinas4374e612009-06-11 13:23:17 +0100524 kmemleak_free(block);
Matt Mackall10cef602006-01-08 01:01:45 -0800525
Christoph Lameterb5568282012-06-13 10:24:54 -0500526 sp = virt_to_page(block);
527 if (PageSlab(sp)) {
Arnd Bergmann789306e2012-10-05 16:55:20 +0200528 int align = max_t(size_t, ARCH_KMALLOC_MINALIGN, ARCH_SLAB_MINALIGN);
Nick Piggin55394842007-07-15 23:38:09 -0700529 unsigned int *m = (unsigned int *)(block - align);
530 slob_free(m, *m + align);
Vlastimil Babka6a486c02019-10-06 17:58:42 -0700531 } else {
532 unsigned int order = compound_order(sp);
533 mod_node_page_state(page_pgdat(sp), NR_SLAB_UNRECLAIMABLE,
534 -(1 << order));
535 __free_pages(sp, order);
536
537 }
Matt Mackall10cef602006-01-08 01:01:45 -0800538}
Matt Mackall10cef602006-01-08 01:01:45 -0800539EXPORT_SYMBOL(kfree);
540
Nick Piggind87a1332007-07-15 23:38:08 -0700541/* can't use ksize for kmem_cache_alloc memory, only kmalloc */
Marco Elver10d1f8c2019-07-11 20:54:14 -0700542size_t __ksize(const void *block)
Matt Mackall10cef602006-01-08 01:01:45 -0800543{
Christoph Lameterb8c24c42012-06-13 10:24:52 -0500544 struct page *sp;
Ezequiel Garcia999d8792012-10-19 09:33:10 -0300545 int align;
546 unsigned int *m;
Matt Mackall10cef602006-01-08 01:01:45 -0800547
Christoph Lameteref8b4522007-10-16 01:24:46 -0700548 BUG_ON(!block);
549 if (unlikely(block == ZERO_SIZE_PTR))
Matt Mackall10cef602006-01-08 01:01:45 -0800550 return 0;
551
Christoph Lameterb5568282012-06-13 10:24:54 -0500552 sp = virt_to_page(block);
Ezequiel Garcia999d8792012-10-19 09:33:10 -0300553 if (unlikely(!PageSlab(sp)))
Matthew Wilcox (Oracle)a50b8542019-09-23 15:34:25 -0700554 return page_size(sp);
Ezequiel Garcia999d8792012-10-19 09:33:10 -0300555
Arnd Bergmann789306e2012-10-05 16:55:20 +0200556 align = max_t(size_t, ARCH_KMALLOC_MINALIGN, ARCH_SLAB_MINALIGN);
Ezequiel Garcia999d8792012-10-19 09:33:10 -0300557 m = (unsigned int *)(block - align);
558 return SLOB_UNITS(*m) * SLOB_UNIT;
Matt Mackall10cef602006-01-08 01:01:45 -0800559}
Marco Elver10d1f8c2019-07-11 20:54:14 -0700560EXPORT_SYMBOL(__ksize);
Matt Mackall10cef602006-01-08 01:01:45 -0800561
Alexey Dobriyand50112e2017-11-15 17:32:18 -0800562int __kmem_cache_create(struct kmem_cache *c, slab_flags_t flags)
Matt Mackall10cef602006-01-08 01:01:45 -0800563{
Paul E. McKenney5f0d5a32017-01-18 02:53:44 -0800564 if (flags & SLAB_TYPESAFE_BY_RCU) {
Christoph Lameter278b1bb2012-09-05 00:20:34 +0000565 /* leave room for rcu footer at the end of object */
566 c->size += sizeof(struct slob_rcu);
Christoph Lameter039363f2012-07-06 15:25:10 -0500567 }
Christoph Lameter278b1bb2012-09-05 00:20:34 +0000568 c->flags = flags;
Christoph Lameter278b1bb2012-09-05 00:20:34 +0000569 return 0;
Matt Mackall10cef602006-01-08 01:01:45 -0800570}
Matt Mackall10cef602006-01-08 01:01:45 -0800571
Fabian Frederickc21a6da2015-04-14 15:44:34 -0700572static void *slob_alloc_node(struct kmem_cache *c, gfp_t flags, int node)
Matt Mackall10cef602006-01-08 01:01:45 -0800573{
574 void *b;
575
Steven Rostedtbd50cfa2011-06-07 07:18:45 -0400576 flags &= gfp_allowed_mask;
577
Peter Zijlstrad92a8cf2017-03-03 10:13:38 +0100578 fs_reclaim_acquire(flags);
579 fs_reclaim_release(flags);
Steven Rostedtbd50cfa2011-06-07 07:18:45 -0400580
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300581 if (c->size < PAGE_SIZE) {
Paul Mundt6193a2f2007-07-15 23:38:22 -0700582 b = slob_alloc(c->size, flags, c->align, node);
Ezequiel Garciafe74fe22012-10-19 09:33:11 -0300583 trace_kmem_cache_alloc_node(_RET_IP_, b, c->object_size,
Eduard - Gabriel Munteanuca2b84cb2009-03-23 15:12:24 +0200584 SLOB_UNITS(c->size) * SLOB_UNIT,
585 flags, node);
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300586 } else {
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800587 b = slob_new_pages(flags, get_order(c->size), node);
Ezequiel Garciafe74fe22012-10-19 09:33:11 -0300588 trace_kmem_cache_alloc_node(_RET_IP_, b, c->object_size,
Eduard - Gabriel Munteanuca2b84cb2009-03-23 15:12:24 +0200589 PAGE_SIZE << get_order(c->size),
590 flags, node);
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300591 }
Matt Mackall10cef602006-01-08 01:01:45 -0800592
Matthew Wilcox128227e2018-06-07 17:05:13 -0700593 if (b && c->ctor) {
594 WARN_ON_ONCE(flags & __GFP_ZERO);
Alexey Dobriyan51cc5062008-07-25 19:45:34 -0700595 c->ctor(b);
Matthew Wilcox128227e2018-06-07 17:05:13 -0700596 }
Matt Mackall10cef602006-01-08 01:01:45 -0800597
Catalin Marinas4374e612009-06-11 13:23:17 +0100598 kmemleak_alloc_recursive(b, c->size, 1, c->flags, flags);
Matt Mackall10cef602006-01-08 01:01:45 -0800599 return b;
600}
Christoph Lameterf1b6eb62013-09-04 16:35:34 +0000601
602void *kmem_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
603{
604 return slob_alloc_node(cachep, flags, NUMA_NO_NODE);
605}
606EXPORT_SYMBOL(kmem_cache_alloc);
607
608#ifdef CONFIG_NUMA
609void *__kmalloc_node(size_t size, gfp_t gfp, int node)
610{
611 return __do_kmalloc_node(size, gfp, node, _RET_IP_);
612}
613EXPORT_SYMBOL(__kmalloc_node);
614
615void *kmem_cache_alloc_node(struct kmem_cache *cachep, gfp_t gfp, int node)
616{
617 return slob_alloc_node(cachep, gfp, node);
618}
Paul Mundt6193a2f2007-07-15 23:38:22 -0700619EXPORT_SYMBOL(kmem_cache_alloc_node);
Christoph Lameterf1b6eb62013-09-04 16:35:34 +0000620#endif
Matt Mackall10cef602006-01-08 01:01:45 -0800621
Nick Pigginafc0ced2007-05-16 22:10:49 -0700622static void __kmem_cache_free(void *b, int size)
623{
624 if (size < PAGE_SIZE)
625 slob_free(b, size);
626 else
Américo Wang6e9ed0c2009-01-19 02:00:38 +0800627 slob_free_pages(b, get_order(size));
Nick Pigginafc0ced2007-05-16 22:10:49 -0700628}
629
630static void kmem_rcu_free(struct rcu_head *head)
631{
632 struct slob_rcu *slob_rcu = (struct slob_rcu *)head;
633 void *b = (void *)slob_rcu - (slob_rcu->size - sizeof(struct slob_rcu));
634
635 __kmem_cache_free(b, slob_rcu->size);
636}
637
Matt Mackall10cef602006-01-08 01:01:45 -0800638void kmem_cache_free(struct kmem_cache *c, void *b)
639{
Catalin Marinas4374e612009-06-11 13:23:17 +0100640 kmemleak_free_recursive(b, c->flags);
Paul E. McKenney5f0d5a32017-01-18 02:53:44 -0800641 if (unlikely(c->flags & SLAB_TYPESAFE_BY_RCU)) {
Nick Pigginafc0ced2007-05-16 22:10:49 -0700642 struct slob_rcu *slob_rcu;
643 slob_rcu = b + (c->size - sizeof(struct slob_rcu));
Nick Pigginafc0ced2007-05-16 22:10:49 -0700644 slob_rcu->size = c->size;
645 call_rcu(&slob_rcu->head, kmem_rcu_free);
646 } else {
Nick Pigginafc0ced2007-05-16 22:10:49 -0700647 __kmem_cache_free(b, c->size);
648 }
Eduard - Gabriel Munteanu3eae2cb22008-08-10 20:14:07 +0300649
Eduard - Gabriel Munteanuca2b84cb2009-03-23 15:12:24 +0200650 trace_kmem_cache_free(_RET_IP_, b);
Matt Mackall10cef602006-01-08 01:01:45 -0800651}
652EXPORT_SYMBOL(kmem_cache_free);
653
Christoph Lameter484748f2015-09-04 15:45:34 -0700654void kmem_cache_free_bulk(struct kmem_cache *s, size_t size, void **p)
655{
656 __kmem_cache_free_bulk(s, size, p);
657}
658EXPORT_SYMBOL(kmem_cache_free_bulk);
659
Jesper Dangaard Brouer865762a2015-11-20 15:57:58 -0800660int kmem_cache_alloc_bulk(struct kmem_cache *s, gfp_t flags, size_t size,
Christoph Lameter484748f2015-09-04 15:45:34 -0700661 void **p)
662{
663 return __kmem_cache_alloc_bulk(s, flags, size, p);
664}
665EXPORT_SYMBOL(kmem_cache_alloc_bulk);
666
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000667int __kmem_cache_shutdown(struct kmem_cache *c)
668{
669 /* No way to check for remaining objects */
670 return 0;
671}
672
Dmitry Safonov52b4b952016-02-17 13:11:37 -0800673void __kmem_cache_release(struct kmem_cache *c)
674{
675}
676
Vladimir Davydov89e364d2016-12-12 16:41:32 -0800677int __kmem_cache_shrink(struct kmem_cache *d)
Christoph Lameter2e892f42006-12-13 00:34:23 -0800678{
679 return 0;
680}
Christoph Lameter2e892f42006-12-13 00:34:23 -0800681
Christoph Lameter9b030cb2012-09-05 00:20:33 +0000682struct kmem_cache kmem_cache_boot = {
683 .name = "kmem_cache",
684 .size = sizeof(struct kmem_cache),
685 .flags = SLAB_PANIC,
686 .align = ARCH_KMALLOC_MINALIGN,
687};
688
Dimitri Gorokhovikbcb4ddb2006-12-29 16:48:28 -0800689void __init kmem_cache_init(void)
690{
Christoph Lameter9b030cb2012-09-05 00:20:33 +0000691 kmem_cache = &kmem_cache_boot;
Christoph Lameter97d06602012-07-06 15:25:11 -0500692 slab_state = UP;
Matt Mackall10cef602006-01-08 01:01:45 -0800693}
Wu Fengguangbbff2e42009-08-06 11:36:25 +0300694
695void __init kmem_cache_init_late(void)
696{
Christoph Lameter97d06602012-07-06 15:25:11 -0500697 slab_state = FULL;
Wu Fengguangbbff2e42009-08-06 11:36:25 +0300698}