memblock.h 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217
  1. #ifndef _LINUX_MEMBLOCK_H
  2. #define _LINUX_MEMBLOCK_H
  3. #ifdef __KERNEL__
  4. #ifdef CONFIG_HAVE_MEMBLOCK
  5. /*
  6. * Logical memory blocks.
  7. *
  8. * Copyright (C) 2001 Peter Bergner, IBM Corp.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public License
  12. * as published by the Free Software Foundation; either version
  13. * 2 of the License, or (at your option) any later version.
  14. */
  15. #include <linux/init.h>
  16. #include <linux/mm.h>
  17. #define INIT_MEMBLOCK_REGIONS 128
  18. struct memblock_region {
  19. phys_addr_t base;
  20. phys_addr_t size;
  21. #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
  22. int nid;
  23. #endif
  24. };
  25. struct memblock_type {
  26. unsigned long cnt; /* number of regions */
  27. unsigned long max; /* size of the allocated array */
  28. struct memblock_region *regions;
  29. };
  30. struct memblock {
  31. phys_addr_t current_limit;
  32. phys_addr_t memory_size; /* Updated by memblock_analyze() */
  33. struct memblock_type memory;
  34. struct memblock_type reserved;
  35. };
  36. extern struct memblock memblock;
  37. extern int memblock_debug;
  38. extern int memblock_can_resize;
  39. #define memblock_dbg(fmt, ...) \
  40. if (memblock_debug) printk(KERN_INFO pr_fmt(fmt), ##__VA_ARGS__)
  41. phys_addr_t memblock_find_in_range(phys_addr_t start, phys_addr_t end,
  42. phys_addr_t size, phys_addr_t align);
  43. int memblock_free_reserved_regions(void);
  44. int memblock_reserve_reserved_regions(void);
  45. void memblock_init(void);
  46. void memblock_analyze(void);
  47. int memblock_add(phys_addr_t base, phys_addr_t size);
  48. int memblock_remove(phys_addr_t base, phys_addr_t size);
  49. int memblock_free(phys_addr_t base, phys_addr_t size);
  50. int memblock_reserve(phys_addr_t base, phys_addr_t size);
  51. void __next_free_mem_range(u64 *idx, int nid, phys_addr_t *out_start,
  52. phys_addr_t *out_end, int *out_nid);
  53. /**
  54. * for_each_free_mem_range - iterate through free memblock areas
  55. * @i: u64 used as loop variable
  56. * @nid: node selector, %MAX_NUMNODES for all nodes
  57. * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
  58. * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
  59. * @p_nid: ptr to int for nid of the range, can be %NULL
  60. *
  61. * Walks over free (memory && !reserved) areas of memblock. Available as
  62. * soon as memblock is initialized.
  63. */
  64. #define for_each_free_mem_range(i, nid, p_start, p_end, p_nid) \
  65. for (i = 0, \
  66. __next_free_mem_range(&i, nid, p_start, p_end, p_nid); \
  67. i != (u64)ULLONG_MAX; \
  68. __next_free_mem_range(&i, nid, p_start, p_end, p_nid))
  69. #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
  70. int memblock_set_node(phys_addr_t base, phys_addr_t size, int nid);
  71. static inline void memblock_set_region_node(struct memblock_region *r, int nid)
  72. {
  73. r->nid = nid;
  74. }
  75. static inline int memblock_get_region_node(const struct memblock_region *r)
  76. {
  77. return r->nid;
  78. }
  79. #else
  80. static inline void memblock_set_region_node(struct memblock_region *r, int nid)
  81. {
  82. }
  83. static inline int memblock_get_region_node(const struct memblock_region *r)
  84. {
  85. return 0;
  86. }
  87. #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
  88. /* The numa aware allocator is only available if
  89. * CONFIG_ARCH_POPULATES_NODE_MAP is set
  90. */
  91. phys_addr_t memblock_find_in_range_node(phys_addr_t start, phys_addr_t end,
  92. phys_addr_t size, phys_addr_t align, int nid);
  93. phys_addr_t memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid);
  94. phys_addr_t memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid);
  95. phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align);
  96. /* Flags for memblock_alloc_base() amd __memblock_alloc_base() */
  97. #define MEMBLOCK_ALLOC_ANYWHERE (~(phys_addr_t)0)
  98. #define MEMBLOCK_ALLOC_ACCESSIBLE 0
  99. phys_addr_t memblock_alloc_base(phys_addr_t size, phys_addr_t align,
  100. phys_addr_t max_addr);
  101. phys_addr_t __memblock_alloc_base(phys_addr_t size, phys_addr_t align,
  102. phys_addr_t max_addr);
  103. phys_addr_t memblock_phys_mem_size(void);
  104. phys_addr_t memblock_start_of_DRAM(void);
  105. phys_addr_t memblock_end_of_DRAM(void);
  106. void memblock_enforce_memory_limit(phys_addr_t memory_limit);
  107. int memblock_is_memory(phys_addr_t addr);
  108. int memblock_is_region_memory(phys_addr_t base, phys_addr_t size);
  109. int memblock_is_reserved(phys_addr_t addr);
  110. int memblock_is_region_reserved(phys_addr_t base, phys_addr_t size);
  111. extern void __memblock_dump_all(void);
  112. static inline void memblock_dump_all(void)
  113. {
  114. if (memblock_debug)
  115. __memblock_dump_all();
  116. }
  117. /**
  118. * memblock_set_current_limit - Set the current allocation limit to allow
  119. * limiting allocations to what is currently
  120. * accessible during boot
  121. * @limit: New limit value (physical address)
  122. */
  123. void memblock_set_current_limit(phys_addr_t limit);
  124. /*
  125. * pfn conversion functions
  126. *
  127. * While the memory MEMBLOCKs should always be page aligned, the reserved
  128. * MEMBLOCKs may not be. This accessor attempt to provide a very clear
  129. * idea of what they return for such non aligned MEMBLOCKs.
  130. */
  131. /**
  132. * memblock_region_memory_base_pfn - Return the lowest pfn intersecting with the memory region
  133. * @reg: memblock_region structure
  134. */
  135. static inline unsigned long memblock_region_memory_base_pfn(const struct memblock_region *reg)
  136. {
  137. return PFN_UP(reg->base);
  138. }
  139. /**
  140. * memblock_region_memory_end_pfn - Return the end_pfn this region
  141. * @reg: memblock_region structure
  142. */
  143. static inline unsigned long memblock_region_memory_end_pfn(const struct memblock_region *reg)
  144. {
  145. return PFN_DOWN(reg->base + reg->size);
  146. }
  147. /**
  148. * memblock_region_reserved_base_pfn - Return the lowest pfn intersecting with the reserved region
  149. * @reg: memblock_region structure
  150. */
  151. static inline unsigned long memblock_region_reserved_base_pfn(const struct memblock_region *reg)
  152. {
  153. return PFN_DOWN(reg->base);
  154. }
  155. /**
  156. * memblock_region_reserved_end_pfn - Return the end_pfn this region
  157. * @reg: memblock_region structure
  158. */
  159. static inline unsigned long memblock_region_reserved_end_pfn(const struct memblock_region *reg)
  160. {
  161. return PFN_UP(reg->base + reg->size);
  162. }
  163. #define for_each_memblock(memblock_type, region) \
  164. for (region = memblock.memblock_type.regions; \
  165. region < (memblock.memblock_type.regions + memblock.memblock_type.cnt); \
  166. region++)
  167. #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
  168. #define __init_memblock __meminit
  169. #define __initdata_memblock __meminitdata
  170. #else
  171. #define __init_memblock
  172. #define __initdata_memblock
  173. #endif
  174. #else
  175. static inline phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align)
  176. {
  177. return 0;
  178. }
  179. #endif /* CONFIG_HAVE_MEMBLOCK */
  180. #endif /* __KERNEL__ */
  181. #endif /* _LINUX_MEMBLOCK_H */