1 #ifndef LINUX_QUICKLIST_H
2 #define LINUX_QUICKLIST_H
4 * Fast allocations and disposal of pages. Pages must be in the condition
5 * as needed after allocation when they are freed. Per cpu lists of pages
6 * are kept that only contain node local pages.
8 * (C) 2007, SGI. Christoph Lameter <clameter@sgi.com>
10 #include <linux/kernel.h>
11 #include <linux/gfp.h>
12 #include <linux/percpu.h>
14 #ifdef CONFIG_QUICKLIST
21 DECLARE_PER_CPU(struct quicklist, quicklist)[CONFIG_NR_QUICK];
24 * The two key functions quicklist_alloc and quicklist_free are inline so
25 * that they may be custom compiled for the platform.
26 * Specifying a NULL ctor can remove constructor support. Specifying
27 * a constant quicklist allows the determination of the exact address
28 * in the per cpu area.
30 * The fast patch in quicklist_alloc touched only a per cpu cacheline and
31 * the first cacheline of the page itself. There is minmal overhead involved.
33 static inline void *quicklist_alloc(int nr, gfp_t flags, void (*ctor)(void *))
38 q =&get_cpu_var(quicklist)[nr];
45 put_cpu_var(quicklist);
49 p = (void *)__get_free_page(flags | __GFP_ZERO);
55 static inline void __quicklist_free(int nr, void (*dtor)(void *), void *p,
60 q = &get_cpu_var(quicklist)[nr];
61 *(void **)p = q->page;
64 put_cpu_var(quicklist);
67 static inline void quicklist_free(int nr, void (*dtor)(void *), void *pp)
69 __quicklist_free(nr, dtor, pp, virt_to_page(pp));
72 static inline void quicklist_free_page(int nr, void (*dtor)(void *),
75 __quicklist_free(nr, dtor, page_address(page), page);
78 void quicklist_trim(int nr, void (*dtor)(void *),
79 unsigned long min_pages, unsigned long max_free);
81 unsigned long quicklist_total_size(void);
85 #endif /* LINUX_QUICKLIST_H */