Blame view
mm/sparse-vmemmap.c
6.87 KB
b24413180
|
1 |
// SPDX-License-Identifier: GPL-2.0 |
8f6aac419
|
2 3 4 |
/* * Virtual Memory Map support * |
cde535359
|
5 |
* (C) 2007 sgi. Christoph Lameter. |
8f6aac419
|
6 7 8 9 10 11 12 |
* * Virtual memory maps allow VM primitives pfn_to_page, page_to_pfn, * virt_to_page, page_address() to be implemented as a base offset * calculation without memory access. * * However, virtual mappings need a page table and TLBs. Many Linux * architectures already map their physical space using 1-1 mappings |
b595076a1
|
13 |
* via TLBs. For those arches the virtual memory map is essentially |
8f6aac419
|
14 15 16 17 |
* for free if we use the same page size as the 1-1 mappings. In that * case the overhead consists of a few additional pages that are * allocated to create a view of memory for vmemmap. * |
29c71111d
|
18 19 |
* The architecture is expected to provide a vmemmap_populate() function * to instantiate the mapping. |
8f6aac419
|
20 21 22 |
*/ #include <linux/mm.h> #include <linux/mmzone.h> |
97ad1087e
|
23 |
#include <linux/memblock.h> |
4b94ffdc4
|
24 |
#include <linux/memremap.h> |
8f6aac419
|
25 |
#include <linux/highmem.h> |
5a0e3ad6a
|
26 |
#include <linux/slab.h> |
8f6aac419
|
27 28 |
#include <linux/spinlock.h> #include <linux/vmalloc.h> |
8bca44bbd
|
29 |
#include <linux/sched.h> |
8f6aac419
|
30 31 32 33 34 35 36 37 38 |
#include <asm/dma.h> #include <asm/pgalloc.h> #include <asm/pgtable.h> /* * Allocate a block of memory to be used to back the virtual memory map * or to back the page tables that are used to create the mapping. * Uses the main allocators if they are available, else bootmem. */ |
e0dc3a53d
|
39 |
|
bd721ea73
|
40 |
static void * __ref __earlyonly_bootmem_alloc(int node, |
e0dc3a53d
|
41 42 43 44 |
unsigned long size, unsigned long align, unsigned long goal) { |
eb31d559f
|
45 |
return memblock_alloc_try_nid_raw(size, align, goal, |
97ad1087e
|
46 |
MEMBLOCK_ALLOC_ACCESSIBLE, node); |
e0dc3a53d
|
47 |
} |
8f6aac419
|
48 49 50 51 |
void * __meminit vmemmap_alloc_block(unsigned long size, int node) { /* If the main allocator is up use that, fallback to bootmem. */ if (slab_is_available()) { |
fcdaf842b
|
52 53 54 |
gfp_t gfp_mask = GFP_KERNEL|__GFP_RETRY_MAYFAIL|__GFP_NOWARN; int order = get_order(size); static bool warned; |
f52407ce2
|
55 |
struct page *page; |
fcdaf842b
|
56 |
page = alloc_pages_node(node, gfp_mask, order); |
8f6aac419
|
57 58 |
if (page) return page_address(page); |
fcdaf842b
|
59 60 61 62 63 64 |
if (!warned) { warn_alloc(gfp_mask & ~__GFP_NOWARN, NULL, "vmemmap alloc failure: order:%u", order); warned = true; } |
8f6aac419
|
65 66 |
return NULL; } else |
e0dc3a53d
|
67 |
return __earlyonly_bootmem_alloc(node, size, size, |
8f6aac419
|
68 69 |
__pa(MAX_DMA_ADDRESS)); } |
9bdac9142
|
70 |
/* need to make sure size is all the same during early stage */ |
a8fc357b2
|
71 |
void * __meminit vmemmap_alloc_block_buf(unsigned long size, int node) |
9bdac9142
|
72 |
{ |
35fd1eb1e
|
73 |
void *ptr = sparse_buffer_alloc(size); |
9bdac9142
|
74 |
|
35fd1eb1e
|
75 76 |
if (!ptr) ptr = vmemmap_alloc_block(size, node); |
9bdac9142
|
77 78 |
return ptr; } |
4b94ffdc4
|
79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 |
static unsigned long __meminit vmem_altmap_next_pfn(struct vmem_altmap *altmap) { return altmap->base_pfn + altmap->reserve + altmap->alloc + altmap->align; } static unsigned long __meminit vmem_altmap_nr_free(struct vmem_altmap *altmap) { unsigned long allocated = altmap->alloc + altmap->align; if (altmap->free > allocated) return altmap->free - allocated; return 0; } /** |
eb8045335
|
95 96 97 |
* altmap_alloc_block_buf - allocate pages from the device page map * @altmap: device page map * @size: size (in bytes) of the allocation |
4b94ffdc4
|
98 |
* |
eb8045335
|
99 |
* Allocations are aligned to the size of the request. |
4b94ffdc4
|
100 |
*/ |
a8fc357b2
|
101 |
void * __meminit altmap_alloc_block_buf(unsigned long size, |
4b94ffdc4
|
102 103 |
struct vmem_altmap *altmap) { |
eb8045335
|
104 |
unsigned long pfn, nr_pfns, nr_align; |
4b94ffdc4
|
105 106 107 108 109 110 111 |
if (size & ~PAGE_MASK) { pr_warn_once("%s: allocations must be multiple of PAGE_SIZE (%ld) ", __func__, size); return NULL; } |
eb8045335
|
112 |
pfn = vmem_altmap_next_pfn(altmap); |
4b94ffdc4
|
113 |
nr_pfns = size >> PAGE_SHIFT; |
eb8045335
|
114 115 116 117 118 119 120 121 |
nr_align = 1UL << find_first_bit(&nr_pfns, BITS_PER_LONG); nr_align = ALIGN(pfn, nr_align) - pfn; if (nr_pfns + nr_align > vmem_altmap_nr_free(altmap)) return NULL; altmap->alloc += nr_pfns; altmap->align += nr_align; pfn += nr_align; |
4b94ffdc4
|
122 123 124 |
pr_debug("%s: pfn: %#lx alloc: %ld align: %ld nr: %#lx ", __func__, pfn, altmap->alloc, altmap->align, nr_pfns); |
eb8045335
|
125 |
return __va(__pfn_to_phys(pfn)); |
4b94ffdc4
|
126 |
} |
8f6aac419
|
127 128 129 130 131 |
void __meminit vmemmap_verify(pte_t *pte, int node, unsigned long start, unsigned long end) { unsigned long pfn = pte_pfn(*pte); int actual_node = early_pfn_to_nid(pfn); |
b41ad14c3
|
132 |
if (node_distance(actual_node, node) > LOCAL_DISTANCE) |
1170532bb
|
133 134 135 |
pr_warn("[%lx-%lx] potential offnode page_structs ", start, end - 1); |
8f6aac419
|
136 |
} |
29c71111d
|
137 |
pte_t * __meminit vmemmap_pte_populate(pmd_t *pmd, unsigned long addr, int node) |
8f6aac419
|
138 |
{ |
29c71111d
|
139 140 141 |
pte_t *pte = pte_offset_kernel(pmd, addr); if (pte_none(*pte)) { pte_t entry; |
a8fc357b2
|
142 |
void *p = vmemmap_alloc_block_buf(PAGE_SIZE, node); |
29c71111d
|
143 |
if (!p) |
9dce07f1a
|
144 |
return NULL; |
29c71111d
|
145 146 147 148 |
entry = pfn_pte(__pa(p) >> PAGE_SHIFT, PAGE_KERNEL); set_pte_at(&init_mm, addr, pte, entry); } return pte; |
8f6aac419
|
149 |
} |
f7f99100d
|
150 151 152 153 154 155 156 157 158 159 |
static void * __meminit vmemmap_alloc_block_zero(unsigned long size, int node) { void *p = vmemmap_alloc_block(size, node); if (!p) return NULL; memset(p, 0, size); return p; } |
29c71111d
|
160 |
pmd_t * __meminit vmemmap_pmd_populate(pud_t *pud, unsigned long addr, int node) |
8f6aac419
|
161 |
{ |
29c71111d
|
162 163 |
pmd_t *pmd = pmd_offset(pud, addr); if (pmd_none(*pmd)) { |
f7f99100d
|
164 |
void *p = vmemmap_alloc_block_zero(PAGE_SIZE, node); |
29c71111d
|
165 |
if (!p) |
9dce07f1a
|
166 |
return NULL; |
29c71111d
|
167 |
pmd_populate_kernel(&init_mm, pmd, p); |
8f6aac419
|
168 |
} |
29c71111d
|
169 |
return pmd; |
8f6aac419
|
170 |
} |
8f6aac419
|
171 |
|
c2febafc6
|
172 |
pud_t * __meminit vmemmap_pud_populate(p4d_t *p4d, unsigned long addr, int node) |
8f6aac419
|
173 |
{ |
c2febafc6
|
174 |
pud_t *pud = pud_offset(p4d, addr); |
29c71111d
|
175 |
if (pud_none(*pud)) { |
f7f99100d
|
176 |
void *p = vmemmap_alloc_block_zero(PAGE_SIZE, node); |
29c71111d
|
177 |
if (!p) |
9dce07f1a
|
178 |
return NULL; |
29c71111d
|
179 180 181 182 |
pud_populate(&init_mm, pud, p); } return pud; } |
8f6aac419
|
183 |
|
c2febafc6
|
184 185 186 187 |
p4d_t * __meminit vmemmap_p4d_populate(pgd_t *pgd, unsigned long addr, int node) { p4d_t *p4d = p4d_offset(pgd, addr); if (p4d_none(*p4d)) { |
f7f99100d
|
188 |
void *p = vmemmap_alloc_block_zero(PAGE_SIZE, node); |
c2febafc6
|
189 190 191 192 193 194 |
if (!p) return NULL; p4d_populate(&init_mm, p4d, p); } return p4d; } |
29c71111d
|
195 196 197 198 |
pgd_t * __meminit vmemmap_pgd_populate(unsigned long addr, int node) { pgd_t *pgd = pgd_offset_k(addr); if (pgd_none(*pgd)) { |
f7f99100d
|
199 |
void *p = vmemmap_alloc_block_zero(PAGE_SIZE, node); |
29c71111d
|
200 |
if (!p) |
9dce07f1a
|
201 |
return NULL; |
29c71111d
|
202 |
pgd_populate(&init_mm, pgd, p); |
8f6aac419
|
203 |
} |
29c71111d
|
204 |
return pgd; |
8f6aac419
|
205 |
} |
0aad818b2
|
206 207 |
int __meminit vmemmap_populate_basepages(unsigned long start, unsigned long end, int node) |
8f6aac419
|
208 |
{ |
0aad818b2
|
209 |
unsigned long addr = start; |
29c71111d
|
210 |
pgd_t *pgd; |
c2febafc6
|
211 |
p4d_t *p4d; |
29c71111d
|
212 213 214 |
pud_t *pud; pmd_t *pmd; pte_t *pte; |
8f6aac419
|
215 |
|
29c71111d
|
216 217 218 219 |
for (; addr < end; addr += PAGE_SIZE) { pgd = vmemmap_pgd_populate(addr, node); if (!pgd) return -ENOMEM; |
c2febafc6
|
220 221 222 223 |
p4d = vmemmap_p4d_populate(pgd, addr, node); if (!p4d) return -ENOMEM; pud = vmemmap_pud_populate(p4d, addr, node); |
29c71111d
|
224 225 226 227 228 229 230 231 232 |
if (!pud) return -ENOMEM; pmd = vmemmap_pmd_populate(pud, addr, node); if (!pmd) return -ENOMEM; pte = vmemmap_pte_populate(pmd, addr, node); if (!pte) return -ENOMEM; vmemmap_verify(pte, node, addr, addr + PAGE_SIZE); |
8f6aac419
|
233 |
} |
29c71111d
|
234 235 |
return 0; |
8f6aac419
|
236 |
} |
8f6aac419
|
237 |
|
e9c0a3f05
|
238 239 |
struct page * __meminit __populate_section_memmap(unsigned long pfn, unsigned long nr_pages, int nid, struct vmem_altmap *altmap) |
8f6aac419
|
240 |
{ |
0aad818b2
|
241 242 |
unsigned long start; unsigned long end; |
0aad818b2
|
243 |
|
e9c0a3f05
|
244 245 246 247 248 249 250 251 252 253 254 |
/* * The minimum granularity of memmap extensions is * PAGES_PER_SUBSECTION as allocations are tracked in the * 'subsection_map' bitmap of the section. */ end = ALIGN(pfn + nr_pages, PAGES_PER_SUBSECTION); pfn &= PAGE_SUBSECTION_MASK; nr_pages = end - pfn; start = (unsigned long) pfn_to_page(pfn); end = start + nr_pages * sizeof(struct page); |
0aad818b2
|
255 |
|
7b73d978a
|
256 |
if (vmemmap_populate(start, end, nid, altmap)) |
8f6aac419
|
257 |
return NULL; |
e9c0a3f05
|
258 |
return pfn_to_page(pfn); |
8f6aac419
|
259 |
} |