init.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641
  1. /*
  2. * linux/arch/arm/mm/init.c
  3. *
  4. * Copyright (C) 1995-2005 Russell King
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License version 2 as
  8. * published by the Free Software Foundation.
  9. */
  10. #include <linux/kernel.h>
  11. #include <linux/errno.h>
  12. #include <linux/swap.h>
  13. #include <linux/init.h>
  14. #include <linux/bootmem.h>
  15. #include <linux/mman.h>
  16. #include <linux/nodemask.h>
  17. #include <linux/initrd.h>
  18. #include <linux/sort.h>
  19. #include <linux/highmem.h>
  20. #include <asm/mach-types.h>
  21. #include <asm/sections.h>
  22. #include <asm/setup.h>
  23. #include <asm/sizes.h>
  24. #include <asm/tlb.h>
  25. #include <asm/mach/arch.h>
  26. #include <asm/mach/map.h>
  27. #include "mm.h"
  28. static unsigned long phys_initrd_start __initdata = 0;
  29. static unsigned long phys_initrd_size __initdata = 0;
  30. static void __init early_initrd(char **p)
  31. {
  32. unsigned long start, size;
  33. start = memparse(*p, p);
  34. if (**p == ',') {
  35. size = memparse((*p) + 1, p);
  36. phys_initrd_start = start;
  37. phys_initrd_size = size;
  38. }
  39. }
  40. __early_param("initrd=", early_initrd);
  41. static int __init parse_tag_initrd(const struct tag *tag)
  42. {
  43. printk(KERN_WARNING "ATAG_INITRD is deprecated; "
  44. "please update your bootloader.\n");
  45. phys_initrd_start = __virt_to_phys(tag->u.initrd.start);
  46. phys_initrd_size = tag->u.initrd.size;
  47. return 0;
  48. }
  49. __tagtable(ATAG_INITRD, parse_tag_initrd);
  50. static int __init parse_tag_initrd2(const struct tag *tag)
  51. {
  52. phys_initrd_start = tag->u.initrd.start;
  53. phys_initrd_size = tag->u.initrd.size;
  54. return 0;
  55. }
  56. __tagtable(ATAG_INITRD2, parse_tag_initrd2);
  57. /*
  58. * This keeps memory configuration data used by a couple memory
  59. * initialization functions, as well as show_mem() for the skipping
  60. * of holes in the memory map. It is populated by arm_add_memory().
  61. */
  62. struct meminfo meminfo;
  63. void show_mem(void)
  64. {
  65. int free = 0, total = 0, reserved = 0;
  66. int shared = 0, cached = 0, slab = 0, node, i;
  67. struct meminfo * mi = &meminfo;
  68. printk("Mem-info:\n");
  69. show_free_areas();
  70. for_each_online_node(node) {
  71. pg_data_t *n = NODE_DATA(node);
  72. struct page *map = pgdat_page_nr(n, 0) - n->node_start_pfn;
  73. for_each_nodebank (i,mi,node) {
  74. struct membank *bank = &mi->bank[i];
  75. unsigned int pfn1, pfn2;
  76. struct page *page, *end;
  77. pfn1 = bank_pfn_start(bank);
  78. pfn2 = bank_pfn_end(bank);
  79. page = map + pfn1;
  80. end = map + pfn2;
  81. do {
  82. total++;
  83. if (PageReserved(page))
  84. reserved++;
  85. else if (PageSwapCache(page))
  86. cached++;
  87. else if (PageSlab(page))
  88. slab++;
  89. else if (!page_count(page))
  90. free++;
  91. else
  92. shared += page_count(page) - 1;
  93. page++;
  94. } while (page < end);
  95. }
  96. }
  97. printk("%d pages of RAM\n", total);
  98. printk("%d free pages\n", free);
  99. printk("%d reserved pages\n", reserved);
  100. printk("%d slab pages\n", slab);
  101. printk("%d pages shared\n", shared);
  102. printk("%d pages swap cached\n", cached);
  103. }
  104. static void __init find_node_limits(int node, struct meminfo *mi,
  105. unsigned long *min, unsigned long *max_low, unsigned long *max_high)
  106. {
  107. int i;
  108. *min = -1UL;
  109. *max_low = *max_high = 0;
  110. for_each_nodebank(i, mi, node) {
  111. struct membank *bank = &mi->bank[i];
  112. unsigned long start, end;
  113. start = bank_pfn_start(bank);
  114. end = bank_pfn_end(bank);
  115. if (*min > start)
  116. *min = start;
  117. if (*max_high < end)
  118. *max_high = end;
  119. if (bank->highmem)
  120. continue;
  121. if (*max_low < end)
  122. *max_low = end;
  123. }
  124. }
  125. /*
  126. * FIXME: We really want to avoid allocating the bootmap bitmap
  127. * over the top of the initrd. Hopefully, this is located towards
  128. * the start of a bank, so if we allocate the bootmap bitmap at
  129. * the end, we won't clash.
  130. */
  131. static unsigned int __init
  132. find_bootmap_pfn(int node, struct meminfo *mi, unsigned int bootmap_pages)
  133. {
  134. unsigned int start_pfn, i, bootmap_pfn;
  135. start_pfn = PAGE_ALIGN(__pa(_end)) >> PAGE_SHIFT;
  136. bootmap_pfn = 0;
  137. for_each_nodebank(i, mi, node) {
  138. struct membank *bank = &mi->bank[i];
  139. unsigned int start, end;
  140. start = bank_pfn_start(bank);
  141. end = bank_pfn_end(bank);
  142. if (end < start_pfn)
  143. continue;
  144. if (start < start_pfn)
  145. start = start_pfn;
  146. if (end <= start)
  147. continue;
  148. if (end - start >= bootmap_pages) {
  149. bootmap_pfn = start;
  150. break;
  151. }
  152. }
  153. if (bootmap_pfn == 0)
  154. BUG();
  155. return bootmap_pfn;
  156. }
  157. static int __init check_initrd(struct meminfo *mi)
  158. {
  159. int initrd_node = -2;
  160. #ifdef CONFIG_BLK_DEV_INITRD
  161. unsigned long end = phys_initrd_start + phys_initrd_size;
  162. /*
  163. * Make sure that the initrd is within a valid area of
  164. * memory.
  165. */
  166. if (phys_initrd_size) {
  167. unsigned int i;
  168. initrd_node = -1;
  169. for (i = 0; i < mi->nr_banks; i++) {
  170. struct membank *bank = &mi->bank[i];
  171. if (bank_phys_start(bank) <= phys_initrd_start &&
  172. end <= bank_phys_end(bank))
  173. initrd_node = bank->node;
  174. }
  175. }
  176. if (initrd_node == -1) {
  177. printk(KERN_ERR "INITRD: 0x%08lx+0x%08lx extends beyond "
  178. "physical memory - disabling initrd\n",
  179. phys_initrd_start, phys_initrd_size);
  180. phys_initrd_start = phys_initrd_size = 0;
  181. }
  182. #endif
  183. return initrd_node;
  184. }
  185. static inline void map_memory_bank(struct membank *bank)
  186. {
  187. #ifdef CONFIG_MMU
  188. struct map_desc map;
  189. map.pfn = bank_pfn_start(bank);
  190. map.virtual = __phys_to_virt(bank_phys_start(bank));
  191. map.length = bank_phys_size(bank);
  192. map.type = MT_MEMORY;
  193. create_mapping(&map);
  194. #endif
  195. }
  196. static void __init bootmem_init_node(int node, struct meminfo *mi,
  197. unsigned long start_pfn, unsigned long end_pfn)
  198. {
  199. unsigned long boot_pfn;
  200. unsigned int boot_pages;
  201. pg_data_t *pgdat;
  202. int i;
  203. /*
  204. * Map the memory banks for this node.
  205. */
  206. for_each_nodebank(i, mi, node) {
  207. struct membank *bank = &mi->bank[i];
  208. if (!bank->highmem)
  209. map_memory_bank(bank);
  210. }
  211. /*
  212. * Allocate the bootmem bitmap page.
  213. */
  214. boot_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
  215. boot_pfn = find_bootmap_pfn(node, mi, boot_pages);
  216. /*
  217. * Initialise the bootmem allocator for this node, handing the
  218. * memory banks over to bootmem.
  219. */
  220. node_set_online(node);
  221. pgdat = NODE_DATA(node);
  222. init_bootmem_node(pgdat, boot_pfn, start_pfn, end_pfn);
  223. for_each_nodebank(i, mi, node) {
  224. struct membank *bank = &mi->bank[i];
  225. if (!bank->highmem)
  226. free_bootmem_node(pgdat, bank_phys_start(bank), bank_phys_size(bank));
  227. memory_present(node, bank_pfn_start(bank), bank_pfn_end(bank));
  228. }
  229. /*
  230. * Reserve the bootmem bitmap for this node.
  231. */
  232. reserve_bootmem_node(pgdat, boot_pfn << PAGE_SHIFT,
  233. boot_pages << PAGE_SHIFT, BOOTMEM_DEFAULT);
  234. }
  235. static void __init bootmem_reserve_initrd(int node)
  236. {
  237. #ifdef CONFIG_BLK_DEV_INITRD
  238. pg_data_t *pgdat = NODE_DATA(node);
  239. int res;
  240. res = reserve_bootmem_node(pgdat, phys_initrd_start,
  241. phys_initrd_size, BOOTMEM_EXCLUSIVE);
  242. if (res == 0) {
  243. initrd_start = __phys_to_virt(phys_initrd_start);
  244. initrd_end = initrd_start + phys_initrd_size;
  245. } else {
  246. printk(KERN_ERR
  247. "INITRD: 0x%08lx+0x%08lx overlaps in-use "
  248. "memory region - disabling initrd\n",
  249. phys_initrd_start, phys_initrd_size);
  250. }
  251. #endif
  252. }
  253. static void __init bootmem_free_node(int node, struct meminfo *mi)
  254. {
  255. unsigned long zone_size[MAX_NR_ZONES], zhole_size[MAX_NR_ZONES];
  256. unsigned long min, max_low, max_high;
  257. int i;
  258. find_node_limits(node, mi, &min, &max_low, &max_high);
  259. /*
  260. * initialise the zones within this node.
  261. */
  262. memset(zone_size, 0, sizeof(zone_size));
  263. /*
  264. * The size of this node has already been determined. If we need
  265. * to do anything fancy with the allocation of this memory to the
  266. * zones, now is the time to do it.
  267. */
  268. zone_size[0] = max_low - min;
  269. #ifdef CONFIG_HIGHMEM
  270. zone_size[ZONE_HIGHMEM] = max_high - max_low;
  271. #endif
  272. /*
  273. * For each bank in this node, calculate the size of the holes.
  274. * holes = node_size - sum(bank_sizes_in_node)
  275. */
  276. memcpy(zhole_size, zone_size, sizeof(zhole_size));
  277. for_each_nodebank(i, mi, node) {
  278. int idx = 0;
  279. #ifdef CONFIG_HIGHMEM
  280. if (mi->bank[i].highmem)
  281. idx = ZONE_HIGHMEM;
  282. #endif
  283. zhole_size[idx] -= bank_pfn_size(&mi->bank[i]);
  284. }
  285. /*
  286. * Adjust the sizes according to any special requirements for
  287. * this machine type.
  288. */
  289. arch_adjust_zones(node, zone_size, zhole_size);
  290. free_area_init_node(node, zone_size, min, zhole_size);
  291. }
  292. #ifndef CONFIG_SPARSEMEM
  293. int pfn_valid(unsigned long pfn)
  294. {
  295. struct meminfo *mi = &meminfo;
  296. unsigned int left = 0, right = mi->nr_banks;
  297. do {
  298. unsigned int mid = (right + left) / 2;
  299. struct membank *bank = &mi->bank[mid];
  300. if (pfn < bank_pfn_start(bank))
  301. right = mid;
  302. else if (pfn >= bank_pfn_end(bank))
  303. left = mid + 1;
  304. else
  305. return 1;
  306. } while (left < right);
  307. return 0;
  308. }
  309. EXPORT_SYMBOL(pfn_valid);
  310. #endif
  311. static int __init meminfo_cmp(const void *_a, const void *_b)
  312. {
  313. const struct membank *a = _a, *b = _b;
  314. long cmp = bank_pfn_start(a) - bank_pfn_start(b);
  315. return cmp < 0 ? -1 : cmp > 0 ? 1 : 0;
  316. }
  317. void __init bootmem_init(void)
  318. {
  319. struct meminfo *mi = &meminfo;
  320. unsigned long min, max_low, max_high;
  321. int node, initrd_node;
  322. sort(&mi->bank, mi->nr_banks, sizeof(mi->bank[0]), meminfo_cmp, NULL);
  323. /*
  324. * Locate which node contains the ramdisk image, if any.
  325. */
  326. initrd_node = check_initrd(mi);
  327. max_low = max_high = 0;
  328. /*
  329. * Run through each node initialising the bootmem allocator.
  330. */
  331. for_each_node(node) {
  332. unsigned long node_low, node_high;
  333. find_node_limits(node, mi, &min, &node_low, &node_high);
  334. if (node_low > max_low)
  335. max_low = node_low;
  336. if (node_high > max_high)
  337. max_high = node_high;
  338. /*
  339. * If there is no memory in this node, ignore it.
  340. * (We can't have nodes which have no lowmem)
  341. */
  342. if (node_low == 0)
  343. continue;
  344. bootmem_init_node(node, mi, min, node_low);
  345. /*
  346. * Reserve any special node zero regions.
  347. */
  348. if (node == 0)
  349. reserve_node_zero(NODE_DATA(node));
  350. /*
  351. * If the initrd is in this node, reserve its memory.
  352. */
  353. if (node == initrd_node)
  354. bootmem_reserve_initrd(node);
  355. }
  356. /*
  357. * sparse_init() needs the bootmem allocator up and running.
  358. */
  359. sparse_init();
  360. /*
  361. * Now free memory in each node - free_area_init_node needs
  362. * the sparse mem_map arrays initialized by sparse_init()
  363. * for memmap_init_zone(), otherwise all PFNs are invalid.
  364. */
  365. for_each_node(node)
  366. bootmem_free_node(node, mi);
  367. high_memory = __va((max_low << PAGE_SHIFT) - 1) + 1;
  368. /*
  369. * This doesn't seem to be used by the Linux memory manager any
  370. * more, but is used by ll_rw_block. If we can get rid of it, we
  371. * also get rid of some of the stuff above as well.
  372. *
  373. * Note: max_low_pfn and max_pfn reflect the number of _pages_ in
  374. * the system, not the maximum PFN.
  375. */
  376. max_low_pfn = max_low - PHYS_PFN_OFFSET;
  377. max_pfn = max_high - PHYS_PFN_OFFSET;
  378. }
  379. static inline int free_area(unsigned long pfn, unsigned long end, char *s)
  380. {
  381. unsigned int pages = 0, size = (end - pfn) << (PAGE_SHIFT - 10);
  382. for (; pfn < end; pfn++) {
  383. struct page *page = pfn_to_page(pfn);
  384. ClearPageReserved(page);
  385. init_page_count(page);
  386. __free_page(page);
  387. pages++;
  388. }
  389. if (size && s)
  390. printk(KERN_INFO "Freeing %s memory: %dK\n", s, size);
  391. return pages;
  392. }
  393. static inline void
  394. free_memmap(int node, unsigned long start_pfn, unsigned long end_pfn)
  395. {
  396. struct page *start_pg, *end_pg;
  397. unsigned long pg, pgend;
  398. /*
  399. * Convert start_pfn/end_pfn to a struct page pointer.
  400. */
  401. start_pg = pfn_to_page(start_pfn);
  402. end_pg = pfn_to_page(end_pfn);
  403. /*
  404. * Convert to physical addresses, and
  405. * round start upwards and end downwards.
  406. */
  407. pg = PAGE_ALIGN(__pa(start_pg));
  408. pgend = __pa(end_pg) & PAGE_MASK;
  409. /*
  410. * If there are free pages between these,
  411. * free the section of the memmap array.
  412. */
  413. if (pg < pgend)
  414. free_bootmem_node(NODE_DATA(node), pg, pgend - pg);
  415. }
  416. /*
  417. * The mem_map array can get very big. Free the unused area of the memory map.
  418. */
  419. static void __init free_unused_memmap_node(int node, struct meminfo *mi)
  420. {
  421. unsigned long bank_start, prev_bank_end = 0;
  422. unsigned int i;
  423. /*
  424. * [FIXME] This relies on each bank being in address order. This
  425. * may not be the case, especially if the user has provided the
  426. * information on the command line.
  427. */
  428. for_each_nodebank(i, mi, node) {
  429. struct membank *bank = &mi->bank[i];
  430. bank_start = bank_pfn_start(bank);
  431. if (bank_start < prev_bank_end) {
  432. printk(KERN_ERR "MEM: unordered memory banks. "
  433. "Not freeing memmap.\n");
  434. break;
  435. }
  436. /*
  437. * If we had a previous bank, and there is a space
  438. * between the current bank and the previous, free it.
  439. */
  440. if (prev_bank_end && prev_bank_end != bank_start)
  441. free_memmap(node, prev_bank_end, bank_start);
  442. prev_bank_end = bank_pfn_end(bank);
  443. }
  444. }
  445. /*
  446. * mem_init() marks the free areas in the mem_map and tells us how much
  447. * memory is free. This is done after various parts of the system have
  448. * claimed their memory after the kernel image.
  449. */
  450. void __init mem_init(void)
  451. {
  452. unsigned int codesize, datasize, initsize;
  453. int i, node;
  454. #ifndef CONFIG_DISCONTIGMEM
  455. max_mapnr = pfn_to_page(max_pfn + PHYS_PFN_OFFSET) - mem_map;
  456. #endif
  457. /* this will put all unused low memory onto the freelists */
  458. for_each_online_node(node) {
  459. pg_data_t *pgdat = NODE_DATA(node);
  460. free_unused_memmap_node(node, &meminfo);
  461. if (pgdat->node_spanned_pages != 0)
  462. totalram_pages += free_all_bootmem_node(pgdat);
  463. }
  464. #ifdef CONFIG_SA1111
  465. /* now that our DMA memory is actually so designated, we can free it */
  466. totalram_pages += free_area(PHYS_PFN_OFFSET,
  467. __phys_to_pfn(__pa(swapper_pg_dir)), NULL);
  468. #endif
  469. #ifdef CONFIG_HIGHMEM
  470. /* set highmem page free */
  471. for_each_online_node(node) {
  472. for_each_nodebank (i, &meminfo, node) {
  473. unsigned long start = bank_pfn_start(&meminfo.bank[i]);
  474. unsigned long end = bank_pfn_end(&meminfo.bank[i]);
  475. if (start >= max_low_pfn + PHYS_PFN_OFFSET)
  476. totalhigh_pages += free_area(start, end, NULL);
  477. }
  478. }
  479. totalram_pages += totalhigh_pages;
  480. #endif
  481. /*
  482. * Since our memory may not be contiguous, calculate the
  483. * real number of pages we have in this system
  484. */
  485. printk(KERN_INFO "Memory:");
  486. num_physpages = 0;
  487. for (i = 0; i < meminfo.nr_banks; i++) {
  488. num_physpages += bank_pfn_size(&meminfo.bank[i]);
  489. printk(" %ldMB", bank_phys_size(&meminfo.bank[i]) >> 20);
  490. }
  491. printk(" = %luMB total\n", num_physpages >> (20 - PAGE_SHIFT));
  492. codesize = _etext - _text;
  493. datasize = _end - _data;
  494. initsize = __init_end - __init_begin;
  495. printk(KERN_NOTICE "Memory: %luKB available (%dK code, "
  496. "%dK data, %dK init, %luK highmem)\n",
  497. nr_free_pages() << (PAGE_SHIFT-10), codesize >> 10,
  498. datasize >> 10, initsize >> 10,
  499. (unsigned long) (totalhigh_pages << (PAGE_SHIFT-10)));
  500. if (PAGE_SIZE >= 16384 && num_physpages <= 128) {
  501. extern int sysctl_overcommit_memory;
  502. /*
  503. * On a machine this small we won't get
  504. * anywhere without overcommit, so turn
  505. * it on by default.
  506. */
  507. sysctl_overcommit_memory = OVERCOMMIT_ALWAYS;
  508. }
  509. }
  510. void free_initmem(void)
  511. {
  512. if (!machine_is_integrator() && !machine_is_cintegrator())
  513. totalram_pages += free_area(__phys_to_pfn(__pa(__init_begin)),
  514. __phys_to_pfn(__pa(__init_end)),
  515. "init");
  516. }
  517. #ifdef CONFIG_BLK_DEV_INITRD
  518. static int keep_initrd;
  519. void free_initrd_mem(unsigned long start, unsigned long end)
  520. {
  521. if (!keep_initrd)
  522. totalram_pages += free_area(__phys_to_pfn(__pa(start)),
  523. __phys_to_pfn(__pa(end)),
  524. "initrd");
  525. }
  526. static int __init keepinitrd_setup(char *__unused)
  527. {
  528. keep_initrd = 1;
  529. return 1;
  530. }
  531. __setup("keepinitrd", keepinitrd_setup);
  532. #endif