2 * Procedures for maintaining information about logical memory blocks.
4 * Peter Bergner, IBM Corp. June 2001.
5 * Copyright (C) 2001 Peter Bergner.
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
13 #include <linux/kernel.h>
14 #include <linux/slab.h>
15 #include <linux/init.h>
16 #include <linux/bitops.h>
17 #include <linux/poison.h>
18 #include <linux/pfn.h>
19 #include <linux/debugfs.h>
20 #include <linux/seq_file.h>
21 #include <linux/memblock.h>
23 struct memblock memblock __initdata_memblock
;
25 int memblock_debug __initdata_memblock
;
26 int memblock_can_resize __initdata_memblock
;
27 static struct memblock_region memblock_memory_init_regions
[INIT_MEMBLOCK_REGIONS
+ 1] __initdata_memblock
;
28 static struct memblock_region memblock_reserved_init_regions
[INIT_MEMBLOCK_REGIONS
+ 1] __initdata_memblock
;
30 /* inline so we don't get a warning when pr_debug is compiled out */
31 static inline const char *memblock_type_name(struct memblock_type
*type
)
33 if (type
== &memblock
.memory
)
35 else if (type
== &memblock
.reserved
)
42 * Address comparison utilities
45 static phys_addr_t __init_memblock
memblock_align_down(phys_addr_t addr
, phys_addr_t size
)
47 return addr
& ~(size
- 1);
50 static phys_addr_t __init_memblock
memblock_align_up(phys_addr_t addr
, phys_addr_t size
)
52 return (addr
+ (size
- 1)) & ~(size
- 1);
55 static unsigned long __init_memblock
memblock_addrs_overlap(phys_addr_t base1
, phys_addr_t size1
,
56 phys_addr_t base2
, phys_addr_t size2
)
58 return ((base1
< (base2
+ size2
)) && (base2
< (base1
+ size1
)));
61 static long __init_memblock
memblock_addrs_adjacent(phys_addr_t base1
, phys_addr_t size1
,
62 phys_addr_t base2
, phys_addr_t size2
)
64 if (base2
== base1
+ size1
)
66 else if (base1
== base2
+ size2
)
72 static long __init_memblock
memblock_regions_adjacent(struct memblock_type
*type
,
73 unsigned long r1
, unsigned long r2
)
75 phys_addr_t base1
= type
->regions
[r1
].base
;
76 phys_addr_t size1
= type
->regions
[r1
].size
;
77 phys_addr_t base2
= type
->regions
[r2
].base
;
78 phys_addr_t size2
= type
->regions
[r2
].size
;
80 return memblock_addrs_adjacent(base1
, size1
, base2
, size2
);
83 long __init_memblock
memblock_overlaps_region(struct memblock_type
*type
, phys_addr_t base
, phys_addr_t size
)
87 for (i
= 0; i
< type
->cnt
; i
++) {
88 phys_addr_t rgnbase
= type
->regions
[i
].base
;
89 phys_addr_t rgnsize
= type
->regions
[i
].size
;
90 if (memblock_addrs_overlap(base
, size
, rgnbase
, rgnsize
))
94 return (i
< type
->cnt
) ? i
: -1;
98 * Find, allocate, deallocate or reserve unreserved regions. All allocations
102 static phys_addr_t __init
memblock_find_region(phys_addr_t start
, phys_addr_t end
,
103 phys_addr_t size
, phys_addr_t align
)
105 phys_addr_t base
, res_base
;
108 /* Prevent allocations returning 0 as it's also used to
109 * indicate an allocation failure
114 base
= memblock_align_down((end
- size
), align
);
115 while (start
<= base
) {
116 j
= memblock_overlaps_region(&memblock
.reserved
, base
, size
);
119 res_base
= memblock
.reserved
.regions
[j
].base
;
122 base
= memblock_align_down(res_base
- size
, align
);
125 return MEMBLOCK_ERROR
;
128 static phys_addr_t __init
memblock_find_base(phys_addr_t size
, phys_addr_t align
,
129 phys_addr_t start
, phys_addr_t end
)
135 size
= memblock_align_up(size
, align
);
137 /* Pump up max_addr */
138 if (end
== MEMBLOCK_ALLOC_ACCESSIBLE
)
139 end
= memblock
.current_limit
;
141 /* We do a top-down search, this tends to limit memory
142 * fragmentation by keeping early boot allocs near the
145 for (i
= memblock
.memory
.cnt
- 1; i
>= 0; i
--) {
146 phys_addr_t memblockbase
= memblock
.memory
.regions
[i
].base
;
147 phys_addr_t memblocksize
= memblock
.memory
.regions
[i
].size
;
148 phys_addr_t bottom
, top
, found
;
150 if (memblocksize
< size
)
152 if ((memblockbase
+ memblocksize
) <= start
)
154 bottom
= max(memblockbase
, start
);
155 top
= min(memblockbase
+ memblocksize
, end
);
158 found
= memblock_find_region(bottom
, top
, size
, align
);
159 if (found
!= MEMBLOCK_ERROR
)
162 return MEMBLOCK_ERROR
;
166 * Find a free area with specified alignment in a specific range.
168 u64 __init_memblock
memblock_find_in_range(u64 start
, u64 end
, u64 size
, u64 align
)
170 return memblock_find_base(size
, align
, start
, end
);
173 static void __init_memblock
memblock_remove_region(struct memblock_type
*type
, unsigned long r
)
177 for (i
= r
; i
< type
->cnt
- 1; i
++) {
178 type
->regions
[i
].base
= type
->regions
[i
+ 1].base
;
179 type
->regions
[i
].size
= type
->regions
[i
+ 1].size
;
184 /* Assumption: base addr of region 1 < base addr of region 2 */
185 static void __init_memblock
memblock_coalesce_regions(struct memblock_type
*type
,
186 unsigned long r1
, unsigned long r2
)
188 type
->regions
[r1
].size
+= type
->regions
[r2
].size
;
189 memblock_remove_region(type
, r2
);
192 /* Defined below but needed now */
193 static long memblock_add_region(struct memblock_type
*type
, phys_addr_t base
, phys_addr_t size
);
195 static int __init_memblock
memblock_double_array(struct memblock_type
*type
)
197 struct memblock_region
*new_array
, *old_array
;
198 phys_addr_t old_size
, new_size
, addr
;
199 int use_slab
= slab_is_available();
201 /* We don't allow resizing until we know about the reserved regions
202 * of memory that aren't suitable for allocation
204 if (!memblock_can_resize
)
207 /* Calculate new doubled size */
208 old_size
= type
->max
* sizeof(struct memblock_region
);
209 new_size
= old_size
<< 1;
211 /* Try to find some space for it.
213 * WARNING: We assume that either slab_is_available() and we use it or
214 * we use MEMBLOCK for allocations. That means that this is unsafe to use
215 * when bootmem is currently active (unless bootmem itself is implemented
216 * on top of MEMBLOCK which isn't the case yet)
218 * This should however not be an issue for now, as we currently only
219 * call into MEMBLOCK while it's still active, or much later when slab is
220 * active for memory hotplug operations
223 new_array
= kmalloc(new_size
, GFP_KERNEL
);
224 addr
= new_array
== NULL
? MEMBLOCK_ERROR
: __pa(new_array
);
226 addr
= memblock_find_base(new_size
, sizeof(phys_addr_t
), 0, MEMBLOCK_ALLOC_ACCESSIBLE
);
227 if (addr
== MEMBLOCK_ERROR
) {
228 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
229 memblock_type_name(type
), type
->max
, type
->max
* 2);
232 new_array
= __va(addr
);
234 memblock_dbg("memblock: %s array is doubled to %ld at [%#010llx-%#010llx]",
235 memblock_type_name(type
), type
->max
* 2, (u64
)addr
, (u64
)addr
+ new_size
- 1);
237 /* Found space, we now need to move the array over before
238 * we add the reserved region since it may be our reserved
239 * array itself that is full.
241 memcpy(new_array
, type
->regions
, old_size
);
242 memset(new_array
+ type
->max
, 0, old_size
);
243 old_array
= type
->regions
;
244 type
->regions
= new_array
;
247 /* If we use SLAB that's it, we are done */
251 /* Add the new reserved region now. Should not fail ! */
252 BUG_ON(memblock_add_region(&memblock
.reserved
, addr
, new_size
) < 0);
254 /* If the array wasn't our static init one, then free it. We only do
255 * that before SLAB is available as later on, we don't know whether
256 * to use kfree or free_bootmem_pages(). Shouldn't be a big deal
259 if (old_array
!= memblock_memory_init_regions
&&
260 old_array
!= memblock_reserved_init_regions
)
261 memblock_free(__pa(old_array
), old_size
);
266 extern int __init_memblock __weak
memblock_memory_can_coalesce(phys_addr_t addr1
, phys_addr_t size1
,
267 phys_addr_t addr2
, phys_addr_t size2
)
272 static long __init_memblock
memblock_add_region(struct memblock_type
*type
, phys_addr_t base
, phys_addr_t size
)
274 unsigned long coalesced
= 0;
277 if ((type
->cnt
== 1) && (type
->regions
[0].size
== 0)) {
278 type
->regions
[0].base
= base
;
279 type
->regions
[0].size
= size
;
283 /* First try and coalesce this MEMBLOCK with another. */
284 for (i
= 0; i
< type
->cnt
; i
++) {
285 phys_addr_t rgnbase
= type
->regions
[i
].base
;
286 phys_addr_t rgnsize
= type
->regions
[i
].size
;
288 if ((rgnbase
== base
) && (rgnsize
== size
))
289 /* Already have this region, so we're done */
292 adjacent
= memblock_addrs_adjacent(base
, size
, rgnbase
, rgnsize
);
293 /* Check if arch allows coalescing */
294 if (adjacent
!= 0 && type
== &memblock
.memory
&&
295 !memblock_memory_can_coalesce(base
, size
, rgnbase
, rgnsize
))
298 type
->regions
[i
].base
-= size
;
299 type
->regions
[i
].size
+= size
;
302 } else if (adjacent
< 0) {
303 type
->regions
[i
].size
+= size
;
309 /* If we plugged a hole, we may want to also coalesce with the
312 if ((i
< type
->cnt
- 1) && memblock_regions_adjacent(type
, i
, i
+1) &&
313 ((type
!= &memblock
.memory
|| memblock_memory_can_coalesce(type
->regions
[i
].base
,
314 type
->regions
[i
].size
,
315 type
->regions
[i
+1].base
,
316 type
->regions
[i
+1].size
)))) {
317 memblock_coalesce_regions(type
, i
, i
+1);
324 /* If we are out of space, we fail. It's too late to resize the array
325 * but then this shouldn't have happened in the first place.
327 if (WARN_ON(type
->cnt
>= type
->max
))
330 /* Couldn't coalesce the MEMBLOCK, so add it to the sorted table. */
331 for (i
= type
->cnt
- 1; i
>= 0; i
--) {
332 if (base
< type
->regions
[i
].base
) {
333 type
->regions
[i
+1].base
= type
->regions
[i
].base
;
334 type
->regions
[i
+1].size
= type
->regions
[i
].size
;
336 type
->regions
[i
+1].base
= base
;
337 type
->regions
[i
+1].size
= size
;
342 if (base
< type
->regions
[0].base
) {
343 type
->regions
[0].base
= base
;
344 type
->regions
[0].size
= size
;
348 /* The array is full ? Try to resize it. If that fails, we undo
349 * our allocation and return an error
351 if (type
->cnt
== type
->max
&& memblock_double_array(type
)) {
359 long __init_memblock
memblock_add(phys_addr_t base
, phys_addr_t size
)
361 return memblock_add_region(&memblock
.memory
, base
, size
);
365 static long __init_memblock
__memblock_remove(struct memblock_type
*type
, phys_addr_t base
, phys_addr_t size
)
367 phys_addr_t rgnbegin
, rgnend
;
368 phys_addr_t end
= base
+ size
;
371 rgnbegin
= rgnend
= 0; /* supress gcc warnings */
373 /* Find the region where (base, size) belongs to */
374 for (i
=0; i
< type
->cnt
; i
++) {
375 rgnbegin
= type
->regions
[i
].base
;
376 rgnend
= rgnbegin
+ type
->regions
[i
].size
;
378 if ((rgnbegin
<= base
) && (end
<= rgnend
))
382 /* Didn't find the region */
386 /* Check to see if we are removing entire region */
387 if ((rgnbegin
== base
) && (rgnend
== end
)) {
388 memblock_remove_region(type
, i
);
392 /* Check to see if region is matching at the front */
393 if (rgnbegin
== base
) {
394 type
->regions
[i
].base
= end
;
395 type
->regions
[i
].size
-= size
;
399 /* Check to see if the region is matching at the end */
401 type
->regions
[i
].size
-= size
;
406 * We need to split the entry - adjust the current one to the
407 * beginging of the hole and add the region after hole.
409 type
->regions
[i
].size
= base
- type
->regions
[i
].base
;
410 return memblock_add_region(type
, end
, rgnend
- end
);
413 long __init_memblock
memblock_remove(phys_addr_t base
, phys_addr_t size
)
415 return __memblock_remove(&memblock
.memory
, base
, size
);
418 long __init
memblock_free(phys_addr_t base
, phys_addr_t size
)
420 return __memblock_remove(&memblock
.reserved
, base
, size
);
423 long __init
memblock_reserve(phys_addr_t base
, phys_addr_t size
)
425 struct memblock_type
*_rgn
= &memblock
.reserved
;
429 return memblock_add_region(_rgn
, base
, size
);
432 phys_addr_t __init
__memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
436 /* We align the size to limit fragmentation. Without this, a lot of
437 * small allocs quickly eat up the whole reserve array on sparc
439 size
= memblock_align_up(size
, align
);
441 found
= memblock_find_base(size
, align
, 0, max_addr
);
442 if (found
!= MEMBLOCK_ERROR
&&
443 memblock_add_region(&memblock
.reserved
, found
, size
) >= 0)
449 phys_addr_t __init
memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
453 alloc
= __memblock_alloc_base(size
, align
, max_addr
);
456 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
457 (unsigned long long) size
, (unsigned long long) max_addr
);
462 phys_addr_t __init
memblock_alloc(phys_addr_t size
, phys_addr_t align
)
464 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
);
469 * Additional node-local allocators. Search for node memory is bottom up
470 * and walks memblock regions within that node bottom-up as well, but allocation
471 * within an memblock region is top-down. XXX I plan to fix that at some stage
473 * WARNING: Only available after early_node_map[] has been populated,
474 * on some architectures, that is after all the calls to add_active_range()
475 * have been done to populate it.
478 phys_addr_t __weak __init
memblock_nid_range(phys_addr_t start
, phys_addr_t end
, int *nid
)
480 #ifdef CONFIG_ARCH_POPULATES_NODE_MAP
482 * This code originates from sparc which really wants use to walk by addresses
483 * and returns the nid. This is not very convenient for early_pfn_map[] users
484 * as the map isn't sorted yet, and it really wants to be walked by nid.
486 * For now, I implement the inefficient method below which walks the early
487 * map multiple times. Eventually we may want to use an ARCH config option
488 * to implement a completely different method for both case.
490 unsigned long start_pfn
, end_pfn
;
493 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
494 get_pfn_range_for_nid(i
, &start_pfn
, &end_pfn
);
495 if (start
< PFN_PHYS(start_pfn
) || start
>= PFN_PHYS(end_pfn
))
498 return min(end
, PFN_PHYS(end_pfn
));
506 static phys_addr_t __init
memblock_alloc_nid_region(struct memblock_region
*mp
,
508 phys_addr_t align
, int nid
)
510 phys_addr_t start
, end
;
513 end
= start
+ mp
->size
;
515 start
= memblock_align_up(start
, align
);
516 while (start
< end
) {
517 phys_addr_t this_end
;
520 this_end
= memblock_nid_range(start
, end
, &this_nid
);
521 if (this_nid
== nid
) {
522 phys_addr_t ret
= memblock_find_region(start
, this_end
, size
, align
);
523 if (ret
!= MEMBLOCK_ERROR
&&
524 memblock_add_region(&memblock
.reserved
, ret
, size
) >= 0)
530 return MEMBLOCK_ERROR
;
533 phys_addr_t __init
memblock_alloc_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
535 struct memblock_type
*mem
= &memblock
.memory
;
540 /* We align the size to limit fragmentation. Without this, a lot of
541 * small allocs quickly eat up the whole reserve array on sparc
543 size
= memblock_align_up(size
, align
);
545 /* We do a bottom-up search for a region with the right
546 * nid since that's easier considering how memblock_nid_range()
549 for (i
= 0; i
< mem
->cnt
; i
++) {
550 phys_addr_t ret
= memblock_alloc_nid_region(&mem
->regions
[i
],
552 if (ret
!= MEMBLOCK_ERROR
)
559 phys_addr_t __init
memblock_alloc_try_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
561 phys_addr_t res
= memblock_alloc_nid(size
, align
, nid
);
565 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ANYWHERE
);
570 * Remaining API functions
573 /* You must call memblock_analyze() before this. */
574 phys_addr_t __init
memblock_phys_mem_size(void)
576 return memblock
.memory_size
;
579 phys_addr_t __init_memblock
memblock_end_of_DRAM(void)
581 int idx
= memblock
.memory
.cnt
- 1;
583 return (memblock
.memory
.regions
[idx
].base
+ memblock
.memory
.regions
[idx
].size
);
586 /* You must call memblock_analyze() after this. */
587 void __init
memblock_enforce_memory_limit(phys_addr_t memory_limit
)
591 struct memblock_region
*p
;
596 /* Truncate the memblock regions to satisfy the memory limit. */
597 limit
= memory_limit
;
598 for (i
= 0; i
< memblock
.memory
.cnt
; i
++) {
599 if (limit
> memblock
.memory
.regions
[i
].size
) {
600 limit
-= memblock
.memory
.regions
[i
].size
;
604 memblock
.memory
.regions
[i
].size
= limit
;
605 memblock
.memory
.cnt
= i
+ 1;
609 memory_limit
= memblock_end_of_DRAM();
611 /* And truncate any reserves above the limit also. */
612 for (i
= 0; i
< memblock
.reserved
.cnt
; i
++) {
613 p
= &memblock
.reserved
.regions
[i
];
615 if (p
->base
> memory_limit
)
617 else if ((p
->base
+ p
->size
) > memory_limit
)
618 p
->size
= memory_limit
- p
->base
;
621 memblock_remove_region(&memblock
.reserved
, i
);
627 static int memblock_search(struct memblock_type
*type
, phys_addr_t addr
)
629 unsigned int left
= 0, right
= type
->cnt
;
632 unsigned int mid
= (right
+ left
) / 2;
634 if (addr
< type
->regions
[mid
].base
)
636 else if (addr
>= (type
->regions
[mid
].base
+
637 type
->regions
[mid
].size
))
641 } while (left
< right
);
645 int __init
memblock_is_reserved(phys_addr_t addr
)
647 return memblock_search(&memblock
.reserved
, addr
) != -1;
650 int memblock_is_memory(phys_addr_t addr
)
652 return memblock_search(&memblock
.memory
, addr
) != -1;
655 int memblock_is_region_memory(phys_addr_t base
, phys_addr_t size
)
657 int idx
= memblock_search(&memblock
.reserved
, base
);
661 return memblock
.reserved
.regions
[idx
].base
<= base
&&
662 (memblock
.reserved
.regions
[idx
].base
+
663 memblock
.reserved
.regions
[idx
].size
) >= (base
+ size
);
666 int __init_memblock
memblock_is_region_reserved(phys_addr_t base
, phys_addr_t size
)
668 return memblock_overlaps_region(&memblock
.reserved
, base
, size
) >= 0;
672 void __init
memblock_set_current_limit(phys_addr_t limit
)
674 memblock
.current_limit
= limit
;
677 static void __init_memblock
memblock_dump(struct memblock_type
*region
, char *name
)
679 unsigned long long base
, size
;
682 pr_info(" %s.cnt = 0x%lx\n", name
, region
->cnt
);
684 for (i
= 0; i
< region
->cnt
; i
++) {
685 base
= region
->regions
[i
].base
;
686 size
= region
->regions
[i
].size
;
688 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes\n",
689 name
, i
, base
, base
+ size
- 1, size
);
693 void __init_memblock
memblock_dump_all(void)
698 pr_info("MEMBLOCK configuration:\n");
699 pr_info(" memory size = 0x%llx\n", (unsigned long long)memblock
.memory_size
);
701 memblock_dump(&memblock
.memory
, "memory");
702 memblock_dump(&memblock
.reserved
, "reserved");
705 void __init
memblock_analyze(void)
709 /* Check marker in the unused last array entry */
710 WARN_ON(memblock_memory_init_regions
[INIT_MEMBLOCK_REGIONS
].base
711 != (phys_addr_t
)RED_INACTIVE
);
712 WARN_ON(memblock_reserved_init_regions
[INIT_MEMBLOCK_REGIONS
].base
713 != (phys_addr_t
)RED_INACTIVE
);
715 memblock
.memory_size
= 0;
717 for (i
= 0; i
< memblock
.memory
.cnt
; i
++)
718 memblock
.memory_size
+= memblock
.memory
.regions
[i
].size
;
720 /* We allow resizing from there */
721 memblock_can_resize
= 1;
724 void __init
memblock_init(void)
726 /* Hookup the initial arrays */
727 memblock
.memory
.regions
= memblock_memory_init_regions
;
728 memblock
.memory
.max
= INIT_MEMBLOCK_REGIONS
;
729 memblock
.reserved
.regions
= memblock_reserved_init_regions
;
730 memblock
.reserved
.max
= INIT_MEMBLOCK_REGIONS
;
732 /* Write a marker in the unused last array entry */
733 memblock
.memory
.regions
[INIT_MEMBLOCK_REGIONS
].base
= (phys_addr_t
)RED_INACTIVE
;
734 memblock
.reserved
.regions
[INIT_MEMBLOCK_REGIONS
].base
= (phys_addr_t
)RED_INACTIVE
;
736 /* Create a dummy zero size MEMBLOCK which will get coalesced away later.
737 * This simplifies the memblock_add() code below...
739 memblock
.memory
.regions
[0].base
= 0;
740 memblock
.memory
.regions
[0].size
= 0;
741 memblock
.memory
.cnt
= 1;
744 memblock
.reserved
.regions
[0].base
= 0;
745 memblock
.reserved
.regions
[0].size
= 0;
746 memblock
.reserved
.cnt
= 1;
748 memblock
.current_limit
= MEMBLOCK_ALLOC_ANYWHERE
;
751 static int __init
early_memblock(char *p
)
753 if (p
&& strstr(p
, "debug"))
757 early_param("memblock", early_memblock
);
759 #if defined(CONFIG_DEBUG_FS) && !defined(ARCH_DISCARD_MEMBLOCK)
761 static int memblock_debug_show(struct seq_file
*m
, void *private)
763 struct memblock_type
*type
= m
->private;
764 struct memblock_region
*reg
;
767 for (i
= 0; i
< type
->cnt
; i
++) {
768 reg
= &type
->regions
[i
];
769 seq_printf(m
, "%4d: ", i
);
770 if (sizeof(phys_addr_t
) == 4)
771 seq_printf(m
, "0x%08lx..0x%08lx\n",
772 (unsigned long)reg
->base
,
773 (unsigned long)(reg
->base
+ reg
->size
- 1));
775 seq_printf(m
, "0x%016llx..0x%016llx\n",
776 (unsigned long long)reg
->base
,
777 (unsigned long long)(reg
->base
+ reg
->size
- 1));
783 static int memblock_debug_open(struct inode
*inode
, struct file
*file
)
785 return single_open(file
, memblock_debug_show
, inode
->i_private
);
788 static const struct file_operations memblock_debug_fops
= {
789 .open
= memblock_debug_open
,
792 .release
= single_release
,
795 static int __init
memblock_init_debugfs(void)
797 struct dentry
*root
= debugfs_create_dir("memblock", NULL
);
800 debugfs_create_file("memory", S_IRUGO
, root
, &memblock
.memory
, &memblock_debug_fops
);
801 debugfs_create_file("reserved", S_IRUGO
, root
, &memblock
.reserved
, &memblock_debug_fops
);
805 __initcall(memblock_init_debugfs
);
807 #endif /* CONFIG_DEBUG_FS */