4 * Copyright (C) 1999 Ingo Molnar
5 * Discontiguous memory support, Kanoj Sarcar, SGI, Nov 1999
7 * simple boot-time physical memory area allocator and
8 * free memory collector. It's used to deal with reserved
9 * system memory and memory holes as well.
13 #include <linux/kernel_stat.h>
14 #include <linux/swap.h>
15 #include <linux/interrupt.h>
16 #include <linux/init.h>
17 #include <linux/bootmem.h>
18 #include <linux/mmzone.h>
19 #include <linux/module.h>
25 * Access to this subsystem has to be serialized externally. (this is
26 * true for the boot process anyway)
28 unsigned long max_low_pfn
;
29 unsigned long min_low_pfn
;
30 unsigned long max_pfn
;
32 EXPORT_SYMBOL(max_pfn
); /* This is exported so
33 * dma_get_required_mask(), which uses
34 * it, can be an inline function */
36 #ifdef CONFIG_CRASH_DUMP
38 * If we have booted due to a crash, max_pfn will be a very low value. We need
39 * to know the amount of memory that the previous kernel used.
41 unsigned long saved_max_pfn
;
44 /* return the number of _pages_ that will be allocated for the boot bitmap */
45 unsigned long __init
bootmem_bootmap_pages (unsigned long pages
)
47 unsigned long mapsize
;
49 mapsize
= (pages
+7)/8;
50 mapsize
= (mapsize
+ ~PAGE_MASK
) & PAGE_MASK
;
51 mapsize
>>= PAGE_SHIFT
;
57 * Called once to set up the allocator itself.
59 static unsigned long __init
init_bootmem_core (pg_data_t
*pgdat
,
60 unsigned long mapstart
, unsigned long start
, unsigned long end
)
62 bootmem_data_t
*bdata
= pgdat
->bdata
;
63 unsigned long mapsize
= ((end
- start
)+7)/8;
65 pgdat
->pgdat_next
= pgdat_list
;
68 mapsize
= ALIGN(mapsize
, sizeof(long));
69 bdata
->node_bootmem_map
= phys_to_virt(mapstart
<< PAGE_SHIFT
);
70 bdata
->node_boot_start
= (start
<< PAGE_SHIFT
);
71 bdata
->node_low_pfn
= end
;
74 * Initially all pages are reserved - setup_arch() has to
75 * register free RAM areas explicitly.
77 memset(bdata
->node_bootmem_map
, 0xff, mapsize
);
83 * Marks a particular physical memory range as unallocatable. Usable RAM
84 * might be used for boot-time allocations - or it might get added
85 * to the free page pool later on.
87 static void __init
reserve_bootmem_core(bootmem_data_t
*bdata
, unsigned long addr
, unsigned long size
)
91 * round up, partially reserved pages are considered
94 unsigned long sidx
= (addr
- bdata
->node_boot_start
)/PAGE_SIZE
;
95 unsigned long eidx
= (addr
+ size
- bdata
->node_boot_start
+
96 PAGE_SIZE
-1)/PAGE_SIZE
;
97 unsigned long end
= (addr
+ size
+ PAGE_SIZE
-1)/PAGE_SIZE
;
100 BUG_ON(sidx
>= eidx
);
101 BUG_ON((addr
>> PAGE_SHIFT
) >= bdata
->node_low_pfn
);
102 BUG_ON(end
> bdata
->node_low_pfn
);
104 for (i
= sidx
; i
< eidx
; i
++)
105 if (test_and_set_bit(i
, bdata
->node_bootmem_map
)) {
106 #ifdef CONFIG_DEBUG_BOOTMEM
107 printk("hm, page %08lx reserved twice.\n", i
*PAGE_SIZE
);
112 static void __init
free_bootmem_core(bootmem_data_t
*bdata
, unsigned long addr
, unsigned long size
)
117 * round down end of usable mem, partially free pages are
118 * considered reserved.
121 unsigned long eidx
= (addr
+ size
- bdata
->node_boot_start
)/PAGE_SIZE
;
122 unsigned long end
= (addr
+ size
)/PAGE_SIZE
;
125 BUG_ON(end
> bdata
->node_low_pfn
);
127 if (addr
< bdata
->last_success
)
128 bdata
->last_success
= addr
;
131 * Round up the beginning of the address.
133 start
= (addr
+ PAGE_SIZE
-1) / PAGE_SIZE
;
134 sidx
= start
- (bdata
->node_boot_start
/PAGE_SIZE
);
136 for (i
= sidx
; i
< eidx
; i
++) {
137 if (unlikely(!test_and_clear_bit(i
, bdata
->node_bootmem_map
)))
143 * We 'merge' subsequent allocations to save space. We might 'lose'
144 * some fraction of a page if allocations cannot be satisfied due to
145 * size constraints on boxes where there is physical RAM space
146 * fragmentation - in these cases (mostly large memory boxes) this
149 * On low memory boxes we get it right in 100% of the cases.
151 * alignment has to be a power of 2 value.
153 * NOTE: This function is _not_ reentrant.
156 __alloc_bootmem_core(struct bootmem_data
*bdata
, unsigned long size
,
157 unsigned long align
, unsigned long goal
)
159 unsigned long offset
, remaining_size
, areasize
, preferred
;
160 unsigned long i
, start
= 0, incr
, eidx
;
164 printk("__alloc_bootmem_core(): zero-sized request\n");
167 BUG_ON(align
& (align
-1));
169 eidx
= bdata
->node_low_pfn
- (bdata
->node_boot_start
>> PAGE_SHIFT
);
172 (bdata
->node_boot_start
& (align
- 1UL)) != 0)
173 offset
= (align
- (bdata
->node_boot_start
& (align
- 1UL)));
174 offset
>>= PAGE_SHIFT
;
177 * We try to allocate bootmem pages above 'goal'
178 * first, then we try to allocate lower pages.
180 if (goal
&& (goal
>= bdata
->node_boot_start
) &&
181 ((goal
>> PAGE_SHIFT
) < bdata
->node_low_pfn
)) {
182 preferred
= goal
- bdata
->node_boot_start
;
184 if (bdata
->last_success
>= preferred
)
185 preferred
= bdata
->last_success
;
189 preferred
= ALIGN(preferred
, align
) >> PAGE_SHIFT
;
191 areasize
= (size
+PAGE_SIZE
-1)/PAGE_SIZE
;
192 incr
= align
>> PAGE_SHIFT
? : 1;
195 for (i
= preferred
; i
< eidx
; i
+= incr
) {
197 i
= find_next_zero_bit(bdata
->node_bootmem_map
, eidx
, i
);
199 if (test_bit(i
, bdata
->node_bootmem_map
))
201 for (j
= i
+ 1; j
< i
+ areasize
; ++j
) {
204 if (test_bit (j
, bdata
->node_bootmem_map
))
213 if (preferred
> offset
) {
220 bdata
->last_success
= start
<< PAGE_SHIFT
;
221 BUG_ON(start
>= eidx
);
224 * Is the next page of the previous allocation-end the start
225 * of this allocation's buffer? If yes then we can 'merge'
226 * the previous partial page with this allocation.
228 if (align
< PAGE_SIZE
&&
229 bdata
->last_offset
&& bdata
->last_pos
+1 == start
) {
230 offset
= ALIGN(bdata
->last_offset
, align
);
231 BUG_ON(offset
> PAGE_SIZE
);
232 remaining_size
= PAGE_SIZE
-offset
;
233 if (size
< remaining_size
) {
235 /* last_pos unchanged */
236 bdata
->last_offset
= offset
+size
;
237 ret
= phys_to_virt(bdata
->last_pos
*PAGE_SIZE
+ offset
+
238 bdata
->node_boot_start
);
240 remaining_size
= size
- remaining_size
;
241 areasize
= (remaining_size
+PAGE_SIZE
-1)/PAGE_SIZE
;
242 ret
= phys_to_virt(bdata
->last_pos
*PAGE_SIZE
+ offset
+
243 bdata
->node_boot_start
);
244 bdata
->last_pos
= start
+areasize
-1;
245 bdata
->last_offset
= remaining_size
;
247 bdata
->last_offset
&= ~PAGE_MASK
;
249 bdata
->last_pos
= start
+ areasize
- 1;
250 bdata
->last_offset
= size
& ~PAGE_MASK
;
251 ret
= phys_to_virt(start
* PAGE_SIZE
+ bdata
->node_boot_start
);
255 * Reserve the area now:
257 for (i
= start
; i
< start
+areasize
; i
++)
258 if (unlikely(test_and_set_bit(i
, bdata
->node_bootmem_map
)))
260 memset(ret
, 0, size
);
264 static unsigned long __init
free_all_bootmem_core(pg_data_t
*pgdat
)
268 bootmem_data_t
*bdata
= pgdat
->bdata
;
269 unsigned long i
, count
, total
= 0;
274 BUG_ON(!bdata
->node_bootmem_map
);
277 /* first extant page of the node */
278 pfn
= bdata
->node_boot_start
>> PAGE_SHIFT
;
279 idx
= bdata
->node_low_pfn
- (bdata
->node_boot_start
>> PAGE_SHIFT
);
280 map
= bdata
->node_bootmem_map
;
281 /* Check physaddr is O(LOG2(BITS_PER_LONG)) page aligned */
282 if (bdata
->node_boot_start
== 0 ||
283 ffs(bdata
->node_boot_start
) - PAGE_SHIFT
> ffs(BITS_PER_LONG
))
285 for (i
= 0; i
< idx
; ) {
286 unsigned long v
= ~map
[i
/ BITS_PER_LONG
];
288 if (gofast
&& v
== ~0UL) {
291 page
= pfn_to_page(pfn
);
292 count
+= BITS_PER_LONG
;
293 __ClearPageReserved(page
);
294 order
= ffs(BITS_PER_LONG
) - 1;
295 set_page_refs(page
, order
);
296 for (j
= 1; j
< BITS_PER_LONG
; j
++) {
297 if (j
+ 16 < BITS_PER_LONG
)
298 prefetchw(page
+ j
+ 16);
299 __ClearPageReserved(page
+ j
);
301 __free_pages(page
, order
);
303 page
+= BITS_PER_LONG
;
307 page
= pfn_to_page(pfn
);
308 for (m
= 1; m
&& i
< idx
; m
<<=1, page
++, i
++) {
311 __ClearPageReserved(page
);
312 set_page_refs(page
, 0);
319 pfn
+= BITS_PER_LONG
;
324 * Now free the allocator bitmap itself, it's not
327 page
= virt_to_page(bdata
->node_bootmem_map
);
329 for (i
= 0; i
< ((bdata
->node_low_pfn
-(bdata
->node_boot_start
>> PAGE_SHIFT
))/8 + PAGE_SIZE
-1)/PAGE_SIZE
; i
++,page
++) {
331 __ClearPageReserved(page
);
332 set_page_count(page
, 1);
336 bdata
->node_bootmem_map
= NULL
;
341 unsigned long __init
init_bootmem_node (pg_data_t
*pgdat
, unsigned long freepfn
, unsigned long startpfn
, unsigned long endpfn
)
343 return(init_bootmem_core(pgdat
, freepfn
, startpfn
, endpfn
));
346 void __init
reserve_bootmem_node (pg_data_t
*pgdat
, unsigned long physaddr
, unsigned long size
)
348 reserve_bootmem_core(pgdat
->bdata
, physaddr
, size
);
351 void __init
free_bootmem_node (pg_data_t
*pgdat
, unsigned long physaddr
, unsigned long size
)
353 free_bootmem_core(pgdat
->bdata
, physaddr
, size
);
356 unsigned long __init
free_all_bootmem_node (pg_data_t
*pgdat
)
358 return(free_all_bootmem_core(pgdat
));
361 unsigned long __init
init_bootmem (unsigned long start
, unsigned long pages
)
365 return(init_bootmem_core(NODE_DATA(0), start
, 0, pages
));
368 #ifndef CONFIG_HAVE_ARCH_BOOTMEM_NODE
369 void __init
reserve_bootmem (unsigned long addr
, unsigned long size
)
371 reserve_bootmem_core(NODE_DATA(0)->bdata
, addr
, size
);
373 #endif /* !CONFIG_HAVE_ARCH_BOOTMEM_NODE */
375 void __init
free_bootmem (unsigned long addr
, unsigned long size
)
377 free_bootmem_core(NODE_DATA(0)->bdata
, addr
, size
);
380 unsigned long __init
free_all_bootmem (void)
382 return(free_all_bootmem_core(NODE_DATA(0)));
385 void * __init
__alloc_bootmem (unsigned long size
, unsigned long align
, unsigned long goal
)
387 pg_data_t
*pgdat
= pgdat_list
;
390 for_each_pgdat(pgdat
)
391 if ((ptr
= __alloc_bootmem_core(pgdat
->bdata
, size
,
396 * Whoops, we cannot satisfy the allocation request.
398 printk(KERN_ALERT
"bootmem alloc of %lu bytes failed!\n", size
);
399 panic("Out of memory");
403 void * __init
__alloc_bootmem_node (pg_data_t
*pgdat
, unsigned long size
, unsigned long align
, unsigned long goal
)
407 ptr
= __alloc_bootmem_core(pgdat
->bdata
, size
, align
, goal
);
411 return __alloc_bootmem(size
, align
, goal
);