ranges.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * powerpc code to implement the kexec_file_load syscall
  4. *
  5. * Copyright (C) 2004 Adam Litke ([email protected])
  6. * Copyright (C) 2004 IBM Corp.
  7. * Copyright (C) 2004,2005 Milton D Miller II, IBM Corporation
  8. * Copyright (C) 2005 R Sharada ([email protected])
  9. * Copyright (C) 2006 Mohan Kumar M ([email protected])
  10. * Copyright (C) 2020 IBM Corporation
  11. *
  12. * Based on kexec-tools' kexec-ppc64.c, fs2dt.c.
  13. * Heavily modified for the kernel by
  14. * Hari Bathini, IBM Corporation.
  15. */
  16. #define pr_fmt(fmt) "kexec ranges: " fmt
  17. #include <linux/sort.h>
  18. #include <linux/kexec.h>
  19. #include <linux/of_device.h>
  20. #include <linux/slab.h>
  21. #include <asm/sections.h>
  22. #include <asm/kexec_ranges.h>
  23. /**
  24. * get_max_nr_ranges - Get the max no. of ranges crash_mem structure
  25. * could hold, given the size allocated for it.
  26. * @size: Allocation size of crash_mem structure.
  27. *
  28. * Returns the maximum no. of ranges.
  29. */
  30. static inline unsigned int get_max_nr_ranges(size_t size)
  31. {
  32. return ((size - sizeof(struct crash_mem)) /
  33. sizeof(struct crash_mem_range));
  34. }
  35. /**
  36. * get_mem_rngs_size - Get the allocated size of mem_rngs based on
  37. * max_nr_ranges and chunk size.
  38. * @mem_rngs: Memory ranges.
  39. *
  40. * Returns the maximum size of @mem_rngs.
  41. */
  42. static inline size_t get_mem_rngs_size(struct crash_mem *mem_rngs)
  43. {
  44. size_t size;
  45. if (!mem_rngs)
  46. return 0;
  47. size = (sizeof(struct crash_mem) +
  48. (mem_rngs->max_nr_ranges * sizeof(struct crash_mem_range)));
  49. /*
  50. * Memory is allocated in size multiple of MEM_RANGE_CHUNK_SZ.
  51. * So, align to get the actual length.
  52. */
  53. return ALIGN(size, MEM_RANGE_CHUNK_SZ);
  54. }
  55. /**
  56. * __add_mem_range - add a memory range to memory ranges list.
  57. * @mem_ranges: Range list to add the memory range to.
  58. * @base: Base address of the range to add.
  59. * @size: Size of the memory range to add.
  60. *
  61. * (Re)allocates memory, if needed.
  62. *
  63. * Returns 0 on success, negative errno on error.
  64. */
  65. static int __add_mem_range(struct crash_mem **mem_ranges, u64 base, u64 size)
  66. {
  67. struct crash_mem *mem_rngs = *mem_ranges;
  68. if (!mem_rngs || (mem_rngs->nr_ranges == mem_rngs->max_nr_ranges)) {
  69. mem_rngs = realloc_mem_ranges(mem_ranges);
  70. if (!mem_rngs)
  71. return -ENOMEM;
  72. }
  73. mem_rngs->ranges[mem_rngs->nr_ranges].start = base;
  74. mem_rngs->ranges[mem_rngs->nr_ranges].end = base + size - 1;
  75. pr_debug("Added memory range [%#016llx - %#016llx] at index %d\n",
  76. base, base + size - 1, mem_rngs->nr_ranges);
  77. mem_rngs->nr_ranges++;
  78. return 0;
  79. }
  80. /**
  81. * __merge_memory_ranges - Merges the given memory ranges list.
  82. * @mem_rngs: Range list to merge.
  83. *
  84. * Assumes a sorted range list.
  85. *
  86. * Returns nothing.
  87. */
  88. static void __merge_memory_ranges(struct crash_mem *mem_rngs)
  89. {
  90. struct crash_mem_range *ranges;
  91. int i, idx;
  92. if (!mem_rngs)
  93. return;
  94. idx = 0;
  95. ranges = &(mem_rngs->ranges[0]);
  96. for (i = 1; i < mem_rngs->nr_ranges; i++) {
  97. if (ranges[i].start <= (ranges[i-1].end + 1))
  98. ranges[idx].end = ranges[i].end;
  99. else {
  100. idx++;
  101. if (i == idx)
  102. continue;
  103. ranges[idx] = ranges[i];
  104. }
  105. }
  106. mem_rngs->nr_ranges = idx + 1;
  107. }
  108. /* cmp_func_t callback to sort ranges with sort() */
  109. static int rngcmp(const void *_x, const void *_y)
  110. {
  111. const struct crash_mem_range *x = _x, *y = _y;
  112. if (x->start > y->start)
  113. return 1;
  114. if (x->start < y->start)
  115. return -1;
  116. return 0;
  117. }
  118. /**
  119. * sort_memory_ranges - Sorts the given memory ranges list.
  120. * @mem_rngs: Range list to sort.
  121. * @merge: If true, merge the list after sorting.
  122. *
  123. * Returns nothing.
  124. */
  125. void sort_memory_ranges(struct crash_mem *mem_rngs, bool merge)
  126. {
  127. int i;
  128. if (!mem_rngs)
  129. return;
  130. /* Sort the ranges in-place */
  131. sort(&(mem_rngs->ranges[0]), mem_rngs->nr_ranges,
  132. sizeof(mem_rngs->ranges[0]), rngcmp, NULL);
  133. if (merge)
  134. __merge_memory_ranges(mem_rngs);
  135. /* For debugging purpose */
  136. pr_debug("Memory ranges:\n");
  137. for (i = 0; i < mem_rngs->nr_ranges; i++) {
  138. pr_debug("\t[%03d][%#016llx - %#016llx]\n", i,
  139. mem_rngs->ranges[i].start,
  140. mem_rngs->ranges[i].end);
  141. }
  142. }
  143. /**
  144. * realloc_mem_ranges - reallocate mem_ranges with size incremented
  145. * by MEM_RANGE_CHUNK_SZ. Frees up the old memory,
  146. * if memory allocation fails.
  147. * @mem_ranges: Memory ranges to reallocate.
  148. *
  149. * Returns pointer to reallocated memory on success, NULL otherwise.
  150. */
  151. struct crash_mem *realloc_mem_ranges(struct crash_mem **mem_ranges)
  152. {
  153. struct crash_mem *mem_rngs = *mem_ranges;
  154. unsigned int nr_ranges;
  155. size_t size;
  156. size = get_mem_rngs_size(mem_rngs);
  157. nr_ranges = mem_rngs ? mem_rngs->nr_ranges : 0;
  158. size += MEM_RANGE_CHUNK_SZ;
  159. mem_rngs = krealloc(*mem_ranges, size, GFP_KERNEL);
  160. if (!mem_rngs) {
  161. kfree(*mem_ranges);
  162. *mem_ranges = NULL;
  163. return NULL;
  164. }
  165. mem_rngs->nr_ranges = nr_ranges;
  166. mem_rngs->max_nr_ranges = get_max_nr_ranges(size);
  167. *mem_ranges = mem_rngs;
  168. return mem_rngs;
  169. }
  170. /**
  171. * add_mem_range - Updates existing memory range, if there is an overlap.
  172. * Else, adds a new memory range.
  173. * @mem_ranges: Range list to add the memory range to.
  174. * @base: Base address of the range to add.
  175. * @size: Size of the memory range to add.
  176. *
  177. * (Re)allocates memory, if needed.
  178. *
  179. * Returns 0 on success, negative errno on error.
  180. */
  181. int add_mem_range(struct crash_mem **mem_ranges, u64 base, u64 size)
  182. {
  183. struct crash_mem *mem_rngs = *mem_ranges;
  184. u64 mstart, mend, end;
  185. unsigned int i;
  186. if (!size)
  187. return 0;
  188. end = base + size - 1;
  189. if (!mem_rngs || !(mem_rngs->nr_ranges))
  190. return __add_mem_range(mem_ranges, base, size);
  191. for (i = 0; i < mem_rngs->nr_ranges; i++) {
  192. mstart = mem_rngs->ranges[i].start;
  193. mend = mem_rngs->ranges[i].end;
  194. if (base < mend && end > mstart) {
  195. if (base < mstart)
  196. mem_rngs->ranges[i].start = base;
  197. if (end > mend)
  198. mem_rngs->ranges[i].end = end;
  199. return 0;
  200. }
  201. }
  202. return __add_mem_range(mem_ranges, base, size);
  203. }
  204. /**
  205. * add_tce_mem_ranges - Adds tce-table range to the given memory ranges list.
  206. * @mem_ranges: Range list to add the memory range(s) to.
  207. *
  208. * Returns 0 on success, negative errno on error.
  209. */
  210. int add_tce_mem_ranges(struct crash_mem **mem_ranges)
  211. {
  212. struct device_node *dn = NULL;
  213. int ret = 0;
  214. for_each_node_by_type(dn, "pci") {
  215. u64 base;
  216. u32 size;
  217. ret = of_property_read_u64(dn, "linux,tce-base", &base);
  218. ret |= of_property_read_u32(dn, "linux,tce-size", &size);
  219. if (ret) {
  220. /*
  221. * It is ok to have pci nodes without tce. So, ignore
  222. * property does not exist error.
  223. */
  224. if (ret == -EINVAL) {
  225. ret = 0;
  226. continue;
  227. }
  228. break;
  229. }
  230. ret = add_mem_range(mem_ranges, base, size);
  231. if (ret)
  232. break;
  233. }
  234. of_node_put(dn);
  235. return ret;
  236. }
  237. /**
  238. * add_initrd_mem_range - Adds initrd range to the given memory ranges list,
  239. * if the initrd was retained.
  240. * @mem_ranges: Range list to add the memory range to.
  241. *
  242. * Returns 0 on success, negative errno on error.
  243. */
  244. int add_initrd_mem_range(struct crash_mem **mem_ranges)
  245. {
  246. u64 base, end;
  247. int ret;
  248. /* This range means something, only if initrd was retained */
  249. if (!strstr(saved_command_line, "retain_initrd"))
  250. return 0;
  251. ret = of_property_read_u64(of_chosen, "linux,initrd-start", &base);
  252. ret |= of_property_read_u64(of_chosen, "linux,initrd-end", &end);
  253. if (!ret)
  254. ret = add_mem_range(mem_ranges, base, end - base + 1);
  255. return ret;
  256. }
  257. #ifdef CONFIG_PPC_64S_HASH_MMU
  258. /**
  259. * add_htab_mem_range - Adds htab range to the given memory ranges list,
  260. * if it exists
  261. * @mem_ranges: Range list to add the memory range to.
  262. *
  263. * Returns 0 on success, negative errno on error.
  264. */
  265. int add_htab_mem_range(struct crash_mem **mem_ranges)
  266. {
  267. if (!htab_address)
  268. return 0;
  269. return add_mem_range(mem_ranges, __pa(htab_address), htab_size_bytes);
  270. }
  271. #endif
  272. /**
  273. * add_kernel_mem_range - Adds kernel text region to the given
  274. * memory ranges list.
  275. * @mem_ranges: Range list to add the memory range to.
  276. *
  277. * Returns 0 on success, negative errno on error.
  278. */
  279. int add_kernel_mem_range(struct crash_mem **mem_ranges)
  280. {
  281. return add_mem_range(mem_ranges, 0, __pa(_end));
  282. }
  283. /**
  284. * add_rtas_mem_range - Adds RTAS region to the given memory ranges list.
  285. * @mem_ranges: Range list to add the memory range to.
  286. *
  287. * Returns 0 on success, negative errno on error.
  288. */
  289. int add_rtas_mem_range(struct crash_mem **mem_ranges)
  290. {
  291. struct device_node *dn;
  292. u32 base, size;
  293. int ret = 0;
  294. dn = of_find_node_by_path("/rtas");
  295. if (!dn)
  296. return 0;
  297. ret = of_property_read_u32(dn, "linux,rtas-base", &base);
  298. ret |= of_property_read_u32(dn, "rtas-size", &size);
  299. if (!ret)
  300. ret = add_mem_range(mem_ranges, base, size);
  301. of_node_put(dn);
  302. return ret;
  303. }
  304. /**
  305. * add_opal_mem_range - Adds OPAL region to the given memory ranges list.
  306. * @mem_ranges: Range list to add the memory range to.
  307. *
  308. * Returns 0 on success, negative errno on error.
  309. */
  310. int add_opal_mem_range(struct crash_mem **mem_ranges)
  311. {
  312. struct device_node *dn;
  313. u64 base, size;
  314. int ret;
  315. dn = of_find_node_by_path("/ibm,opal");
  316. if (!dn)
  317. return 0;
  318. ret = of_property_read_u64(dn, "opal-base-address", &base);
  319. ret |= of_property_read_u64(dn, "opal-runtime-size", &size);
  320. if (!ret)
  321. ret = add_mem_range(mem_ranges, base, size);
  322. of_node_put(dn);
  323. return ret;
  324. }
  325. /**
  326. * add_reserved_mem_ranges - Adds "/reserved-ranges" regions exported by f/w
  327. * to the given memory ranges list.
  328. * @mem_ranges: Range list to add the memory ranges to.
  329. *
  330. * Returns 0 on success, negative errno on error.
  331. */
  332. int add_reserved_mem_ranges(struct crash_mem **mem_ranges)
  333. {
  334. int n_mem_addr_cells, n_mem_size_cells, i, len, cells, ret = 0;
  335. const __be32 *prop;
  336. prop = of_get_property(of_root, "reserved-ranges", &len);
  337. if (!prop)
  338. return 0;
  339. n_mem_addr_cells = of_n_addr_cells(of_root);
  340. n_mem_size_cells = of_n_size_cells(of_root);
  341. cells = n_mem_addr_cells + n_mem_size_cells;
  342. /* Each reserved range is an (address,size) pair */
  343. for (i = 0; i < (len / (sizeof(u32) * cells)); i++) {
  344. u64 base, size;
  345. base = of_read_number(prop + (i * cells), n_mem_addr_cells);
  346. size = of_read_number(prop + (i * cells) + n_mem_addr_cells,
  347. n_mem_size_cells);
  348. ret = add_mem_range(mem_ranges, base, size);
  349. if (ret)
  350. break;
  351. }
  352. return ret;
  353. }