2 * Virtual Memory Map support
4 * (C) 2007 sgi. Christoph Lameter.
6 * Virtual memory maps allow VM primitives pfn_to_page, page_to_pfn,
7 * virt_to_page, page_address() to be implemented as a base offset
8 * calculation without memory access.
10 * However, virtual mappings need a page table and TLBs. Many Linux
11 * architectures already map their physical space using 1-1 mappings
12 * via TLBs. For those arches the virtual memmory map is essentially
13 * for free if we use the same page size as the 1-1 mappings. In that
14 * case the overhead consists of a few additional pages that are
15 * allocated to create a view of memory for vmemmap.
17 * The architecture is expected to provide a vmemmap_populate() function
18 * to instantiate the mapping.
21 #include <linux/mmzone.h>
22 #include <linux/bootmem.h>
23 #include <linux/highmem.h>
24 #include <linux/module.h>
25 #include <linux/spinlock.h>
26 #include <linux/vmalloc.h>
27 #include <linux/sched.h>
29 #include <asm/pgalloc.h>
30 #include <asm/pgtable.h>
33 * Allocate a block of memory to be used to back the virtual memory map
34 * or to back the page tables that are used to create the mapping.
35 * Uses the main allocators if they are available, else bootmem.
38 static void * __init_refok
__earlyonly_bootmem_alloc(int node
,
43 return __alloc_bootmem_node(NODE_DATA(node
), size
, align
, goal
);
47 void * __meminit
vmemmap_alloc_block(unsigned long size
, int node
)
49 /* If the main allocator is up use that, fallback to bootmem. */
50 if (slab_is_available()) {
53 if (node_state(node
, N_HIGH_MEMORY
))
54 page
= alloc_pages_node(node
,
55 GFP_KERNEL
| __GFP_ZERO
, get_order(size
));
57 page
= alloc_pages(GFP_KERNEL
| __GFP_ZERO
,
60 return page_address(page
);
63 return __earlyonly_bootmem_alloc(node
, size
, size
,
64 __pa(MAX_DMA_ADDRESS
));
67 void __meminit
vmemmap_verify(pte_t
*pte
, int node
,
68 unsigned long start
, unsigned long end
)
70 unsigned long pfn
= pte_pfn(*pte
);
71 int actual_node
= early_pfn_to_nid(pfn
);
73 if (node_distance(actual_node
, node
) > LOCAL_DISTANCE
)
74 printk(KERN_WARNING
"[%lx-%lx] potential offnode "
75 "page_structs\n", start
, end
- 1);
78 pte_t
* __meminit
vmemmap_pte_populate(pmd_t
*pmd
, unsigned long addr
, int node
)
80 pte_t
*pte
= pte_offset_kernel(pmd
, addr
);
83 void *p
= vmemmap_alloc_block(PAGE_SIZE
, node
);
86 entry
= pfn_pte(__pa(p
) >> PAGE_SHIFT
, PAGE_KERNEL
);
87 set_pte_at(&init_mm
, addr
, pte
, entry
);
92 pmd_t
* __meminit
vmemmap_pmd_populate(pud_t
*pud
, unsigned long addr
, int node
)
94 pmd_t
*pmd
= pmd_offset(pud
, addr
);
96 void *p
= vmemmap_alloc_block(PAGE_SIZE
, node
);
99 pmd_populate_kernel(&init_mm
, pmd
, p
);
104 pud_t
* __meminit
vmemmap_pud_populate(pgd_t
*pgd
, unsigned long addr
, int node
)
106 pud_t
*pud
= pud_offset(pgd
, addr
);
107 if (pud_none(*pud
)) {
108 void *p
= vmemmap_alloc_block(PAGE_SIZE
, node
);
111 pud_populate(&init_mm
, pud
, p
);
116 pgd_t
* __meminit
vmemmap_pgd_populate(unsigned long addr
, int node
)
118 pgd_t
*pgd
= pgd_offset_k(addr
);
119 if (pgd_none(*pgd
)) {
120 void *p
= vmemmap_alloc_block(PAGE_SIZE
, node
);
123 pgd_populate(&init_mm
, pgd
, p
);
128 int __meminit
vmemmap_populate_basepages(struct page
*start_page
,
129 unsigned long size
, int node
)
131 unsigned long addr
= (unsigned long)start_page
;
132 unsigned long end
= (unsigned long)(start_page
+ size
);
138 for (; addr
< end
; addr
+= PAGE_SIZE
) {
139 pgd
= vmemmap_pgd_populate(addr
, node
);
142 pud
= vmemmap_pud_populate(pgd
, addr
, node
);
145 pmd
= vmemmap_pmd_populate(pud
, addr
, node
);
148 pte
= vmemmap_pte_populate(pmd
, addr
, node
);
151 vmemmap_verify(pte
, node
, addr
, addr
+ PAGE_SIZE
);
157 struct page
* __meminit
sparse_mem_map_populate(unsigned long pnum
, int nid
)
159 struct page
*map
= pfn_to_page(pnum
* PAGES_PER_SECTION
);
160 int error
= vmemmap_populate(map
, PAGES_PER_SECTION
, nid
);
This page took 0.032625 seconds and 5 git commands to generate.