memblock.h 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254
  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. phys_addr_t total_size; /* size of all regions */
  29. struct memblock_region *regions;
  30. };
  31. struct memblock {
  32. phys_addr_t current_limit;
  33. struct memblock_type memory;
  34. struct memblock_type reserved;
  35. };
  36. extern struct memblock memblock;
  37. extern int memblock_debug;
  38. #define memblock_dbg(fmt, ...) \
  39. if (memblock_debug) printk(KERN_INFO pr_fmt(fmt), ##__VA_ARGS__)
  40. phys_addr_t memblock_find_in_range_node(phys_addr_t start, phys_addr_t end,
  41. phys_addr_t size, phys_addr_t align, int nid);
  42. phys_addr_t memblock_find_in_range(phys_addr_t start, phys_addr_t end,
  43. phys_addr_t size, phys_addr_t align);
  44. phys_addr_t get_allocated_memblock_reserved_regions_info(phys_addr_t *addr);
  45. void memblock_allow_resize(void);
  46. int memblock_add_node(phys_addr_t base, phys_addr_t size, int nid);
  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 memblock_trim_memory(phys_addr_t align);
  52. #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
  53. void __next_mem_pfn_range(int *idx, int nid, unsigned long *out_start_pfn,
  54. unsigned long *out_end_pfn, int *out_nid);
  55. /**
  56. * for_each_mem_pfn_range - early memory pfn range iterator
  57. * @i: an integer used as loop variable
  58. * @nid: node selector, %MAX_NUMNODES for all nodes
  59. * @p_start: ptr to ulong for start pfn of the range, can be %NULL
  60. * @p_end: ptr to ulong for end pfn of the range, can be %NULL
  61. * @p_nid: ptr to int for nid of the range, can be %NULL
  62. *
  63. * Walks over configured memory ranges. Available after early_node_map is
  64. * populated.
  65. */
  66. #define for_each_mem_pfn_range(i, nid, p_start, p_end, p_nid) \
  67. for (i = -1, __next_mem_pfn_range(&i, nid, p_start, p_end, p_nid); \
  68. i >= 0; __next_mem_pfn_range(&i, nid, p_start, p_end, p_nid))
  69. #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
  70. void __next_free_mem_range(u64 *idx, int nid, phys_addr_t *out_start,
  71. phys_addr_t *out_end, int *out_nid);
  72. /**
  73. * for_each_free_mem_range - iterate through free memblock areas
  74. * @i: u64 used as loop variable
  75. * @nid: node selector, %MAX_NUMNODES for all nodes
  76. * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
  77. * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
  78. * @p_nid: ptr to int for nid of the range, can be %NULL
  79. *
  80. * Walks over free (memory && !reserved) areas of memblock. Available as
  81. * soon as memblock is initialized.
  82. */
  83. #define for_each_free_mem_range(i, nid, p_start, p_end, p_nid) \
  84. for (i = 0, \
  85. __next_free_mem_range(&i, nid, p_start, p_end, p_nid); \
  86. i != (u64)ULLONG_MAX; \
  87. __next_free_mem_range(&i, nid, p_start, p_end, p_nid))
  88. void __next_free_mem_range_rev(u64 *idx, int nid, phys_addr_t *out_start,
  89. phys_addr_t *out_end, int *out_nid);
  90. /**
  91. * for_each_free_mem_range_reverse - rev-iterate through free memblock areas
  92. * @i: u64 used as loop variable
  93. * @nid: node selector, %MAX_NUMNODES for all nodes
  94. * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
  95. * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
  96. * @p_nid: ptr to int for nid of the range, can be %NULL
  97. *
  98. * Walks over free (memory && !reserved) areas of memblock in reverse
  99. * order. Available as soon as memblock is initialized.
  100. */
  101. #define for_each_free_mem_range_reverse(i, nid, p_start, p_end, p_nid) \
  102. for (i = (u64)ULLONG_MAX, \
  103. __next_free_mem_range_rev(&i, nid, p_start, p_end, p_nid); \
  104. i != (u64)ULLONG_MAX; \
  105. __next_free_mem_range_rev(&i, nid, p_start, p_end, p_nid))
  106. #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
  107. int memblock_set_node(phys_addr_t base, phys_addr_t size, int nid);
  108. static inline void memblock_set_region_node(struct memblock_region *r, int nid)
  109. {
  110. r->nid = nid;
  111. }
  112. static inline int memblock_get_region_node(const struct memblock_region *r)
  113. {
  114. return r->nid;
  115. }
  116. #else
  117. static inline void memblock_set_region_node(struct memblock_region *r, int nid)
  118. {
  119. }
  120. static inline int memblock_get_region_node(const struct memblock_region *r)
  121. {
  122. return 0;
  123. }
  124. #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
  125. phys_addr_t memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid);
  126. phys_addr_t memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid);
  127. phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align);
  128. /* Flags for memblock_alloc_base() amd __memblock_alloc_base() */
  129. #define MEMBLOCK_ALLOC_ANYWHERE (~(phys_addr_t)0)
  130. #define MEMBLOCK_ALLOC_ACCESSIBLE 0
  131. phys_addr_t memblock_alloc_base(phys_addr_t size, phys_addr_t align,
  132. phys_addr_t max_addr);
  133. phys_addr_t __memblock_alloc_base(phys_addr_t size, phys_addr_t align,
  134. phys_addr_t max_addr);
  135. phys_addr_t memblock_phys_mem_size(void);
  136. phys_addr_t memblock_start_of_DRAM(void);
  137. phys_addr_t memblock_end_of_DRAM(void);
  138. void memblock_enforce_memory_limit(phys_addr_t memory_limit);
  139. int memblock_is_memory(phys_addr_t addr);
  140. int memblock_is_region_memory(phys_addr_t base, phys_addr_t size);
  141. int memblock_overlaps_memory(phys_addr_t base, phys_addr_t size);
  142. int memblock_is_reserved(phys_addr_t addr);
  143. int memblock_is_region_reserved(phys_addr_t base, phys_addr_t size);
  144. extern void __memblock_dump_all(void);
  145. static inline void memblock_dump_all(void)
  146. {
  147. if (memblock_debug)
  148. __memblock_dump_all();
  149. }
  150. /**
  151. * memblock_set_current_limit - Set the current allocation limit to allow
  152. * limiting allocations to what is currently
  153. * accessible during boot
  154. * @limit: New limit value (physical address)
  155. */
  156. void memblock_set_current_limit(phys_addr_t limit);
  157. /*
  158. * pfn conversion functions
  159. *
  160. * While the memory MEMBLOCKs should always be page aligned, the reserved
  161. * MEMBLOCKs may not be. This accessor attempt to provide a very clear
  162. * idea of what they return for such non aligned MEMBLOCKs.
  163. */
  164. /**
  165. * memblock_region_memory_base_pfn - Return the lowest pfn intersecting with the memory region
  166. * @reg: memblock_region structure
  167. */
  168. static inline unsigned long memblock_region_memory_base_pfn(const struct memblock_region *reg)
  169. {
  170. return PFN_UP(reg->base);
  171. }
  172. /**
  173. * memblock_region_memory_end_pfn - Return the end_pfn this region
  174. * @reg: memblock_region structure
  175. */
  176. static inline unsigned long memblock_region_memory_end_pfn(const struct memblock_region *reg)
  177. {
  178. return PFN_DOWN(reg->base + reg->size);
  179. }
  180. /**
  181. * memblock_region_reserved_base_pfn - Return the lowest pfn intersecting with the reserved region
  182. * @reg: memblock_region structure
  183. */
  184. static inline unsigned long memblock_region_reserved_base_pfn(const struct memblock_region *reg)
  185. {
  186. return PFN_DOWN(reg->base);
  187. }
  188. /**
  189. * memblock_region_reserved_end_pfn - Return the end_pfn this region
  190. * @reg: memblock_region structure
  191. */
  192. static inline unsigned long memblock_region_reserved_end_pfn(const struct memblock_region *reg)
  193. {
  194. return PFN_UP(reg->base + reg->size);
  195. }
  196. #define for_each_memblock(memblock_type, region) \
  197. for (region = memblock.memblock_type.regions; \
  198. region < (memblock.memblock_type.regions + memblock.memblock_type.cnt); \
  199. region++)
  200. #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
  201. #define __init_memblock __meminit
  202. #define __initdata_memblock __meminitdata
  203. #else
  204. #define __init_memblock
  205. #define __initdata_memblock
  206. #endif
  207. #else
  208. static inline phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align)
  209. {
  210. return 0;
  211. }
  212. #endif /* CONFIG_HAVE_MEMBLOCK */
  213. #endif /* __KERNEL__ */
  214. #endif /* _LINUX_MEMBLOCK_H */