mem.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534
  1. /*
  2. * PowerPC version
  3. * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
  4. *
  5. * Modifications by Paul Mackerras (PowerMac) (paulus@cs.anu.edu.au)
  6. * and Cort Dougan (PReP) (cort@cs.nmt.edu)
  7. * Copyright (C) 1996 Paul Mackerras
  8. * Amiga/APUS changes by Jesper Skov (jskov@cygnus.co.uk).
  9. * PPC44x/36-bit changes by Matt Porter (mporter@mvista.com)
  10. *
  11. * Derived from "arch/i386/mm/init.c"
  12. * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
  13. *
  14. * This program is free software; you can redistribute it and/or
  15. * modify it under the terms of the GNU General Public License
  16. * as published by the Free Software Foundation; either version
  17. * 2 of the License, or (at your option) any later version.
  18. *
  19. */
  20. #include <linux/module.h>
  21. #include <linux/sched.h>
  22. #include <linux/kernel.h>
  23. #include <linux/errno.h>
  24. #include <linux/string.h>
  25. #include <linux/types.h>
  26. #include <linux/mm.h>
  27. #include <linux/stddef.h>
  28. #include <linux/init.h>
  29. #include <linux/bootmem.h>
  30. #include <linux/highmem.h>
  31. #include <linux/initrd.h>
  32. #include <linux/pagemap.h>
  33. #include <asm/pgalloc.h>
  34. #include <asm/prom.h>
  35. #include <asm/io.h>
  36. #include <asm/mmu_context.h>
  37. #include <asm/pgtable.h>
  38. #include <asm/mmu.h>
  39. #include <asm/smp.h>
  40. #include <asm/machdep.h>
  41. #include <asm/btext.h>
  42. #include <asm/tlb.h>
  43. #include <asm/prom.h>
  44. #include <asm/lmb.h>
  45. #include <asm/sections.h>
  46. #include <asm/vdso.h>
  47. #include "mmu_decl.h"
  48. #ifndef CPU_FTR_COHERENT_ICACHE
  49. #define CPU_FTR_COHERENT_ICACHE 0 /* XXX for now */
  50. #define CPU_FTR_NOEXECUTE 0
  51. #endif
  52. int init_bootmem_done;
  53. int mem_init_done;
  54. unsigned long memory_limit;
  55. extern void hash_preload(struct mm_struct *mm, unsigned long ea,
  56. unsigned long access, unsigned long trap);
  57. /*
  58. * This is called by /dev/mem to know if a given address has to
  59. * be mapped non-cacheable or not
  60. */
  61. int page_is_ram(unsigned long pfn)
  62. {
  63. unsigned long paddr = (pfn << PAGE_SHIFT);
  64. #ifndef CONFIG_PPC64 /* XXX for now */
  65. return paddr < __pa(high_memory);
  66. #else
  67. int i;
  68. for (i=0; i < lmb.memory.cnt; i++) {
  69. unsigned long base;
  70. base = lmb.memory.region[i].base;
  71. if ((paddr >= base) &&
  72. (paddr < (base + lmb.memory.region[i].size))) {
  73. return 1;
  74. }
  75. }
  76. return 0;
  77. #endif
  78. }
  79. EXPORT_SYMBOL(page_is_ram);
  80. pgprot_t phys_mem_access_prot(struct file *file, unsigned long pfn,
  81. unsigned long size, pgprot_t vma_prot)
  82. {
  83. if (ppc_md.phys_mem_access_prot)
  84. return ppc_md.phys_mem_access_prot(file, pfn, size, vma_prot);
  85. if (!page_is_ram(pfn))
  86. vma_prot = __pgprot(pgprot_val(vma_prot)
  87. | _PAGE_GUARDED | _PAGE_NO_CACHE);
  88. return vma_prot;
  89. }
  90. EXPORT_SYMBOL(phys_mem_access_prot);
  91. #ifdef CONFIG_MEMORY_HOTPLUG
  92. void online_page(struct page *page)
  93. {
  94. ClearPageReserved(page);
  95. init_page_count(page);
  96. __free_page(page);
  97. totalram_pages++;
  98. num_physpages++;
  99. }
  100. #ifdef CONFIG_NUMA
  101. int memory_add_physaddr_to_nid(u64 start)
  102. {
  103. return hot_add_scn_to_nid(start);
  104. }
  105. #endif
  106. int __devinit arch_add_memory(int nid, u64 start, u64 size)
  107. {
  108. struct pglist_data *pgdata;
  109. struct zone *zone;
  110. unsigned long start_pfn = start >> PAGE_SHIFT;
  111. unsigned long nr_pages = size >> PAGE_SHIFT;
  112. pgdata = NODE_DATA(nid);
  113. start = (unsigned long)__va(start);
  114. create_section_mapping(start, start + size);
  115. /* this should work for most non-highmem platforms */
  116. zone = pgdata->node_zones;
  117. return __add_pages(zone, start_pfn, nr_pages);
  118. return 0;
  119. }
  120. /*
  121. * First pass at this code will check to determine if the remove
  122. * request is within the RMO. Do not allow removal within the RMO.
  123. */
  124. int __devinit remove_memory(u64 start, u64 size)
  125. {
  126. struct zone *zone;
  127. unsigned long start_pfn, end_pfn, nr_pages;
  128. start_pfn = start >> PAGE_SHIFT;
  129. nr_pages = size >> PAGE_SHIFT;
  130. end_pfn = start_pfn + nr_pages;
  131. printk("%s(): Attempting to remove memoy in range "
  132. "%lx to %lx\n", __func__, start, start+size);
  133. /*
  134. * check for range within RMO
  135. */
  136. zone = page_zone(pfn_to_page(start_pfn));
  137. printk("%s(): memory will be removed from "
  138. "the %s zone\n", __func__, zone->name);
  139. /*
  140. * not handling removing memory ranges that
  141. * overlap multiple zones yet
  142. */
  143. if (end_pfn > (zone->zone_start_pfn + zone->spanned_pages))
  144. goto overlap;
  145. /* make sure it is NOT in RMO */
  146. if ((start < lmb.rmo_size) || ((start+size) < lmb.rmo_size)) {
  147. printk("%s(): range to be removed must NOT be in RMO!\n",
  148. __func__);
  149. goto in_rmo;
  150. }
  151. return __remove_pages(zone, start_pfn, nr_pages);
  152. overlap:
  153. printk("%s(): memory range to be removed overlaps "
  154. "multiple zones!!!\n", __func__);
  155. in_rmo:
  156. return -1;
  157. }
  158. #endif /* CONFIG_MEMORY_HOTPLUG */
  159. void show_mem(void)
  160. {
  161. unsigned long total = 0, reserved = 0;
  162. unsigned long shared = 0, cached = 0;
  163. unsigned long highmem = 0;
  164. struct page *page;
  165. pg_data_t *pgdat;
  166. unsigned long i;
  167. printk("Mem-info:\n");
  168. show_free_areas();
  169. printk("Free swap: %6ldkB\n", nr_swap_pages<<(PAGE_SHIFT-10));
  170. for_each_online_pgdat(pgdat) {
  171. unsigned long flags;
  172. pgdat_resize_lock(pgdat, &flags);
  173. for (i = 0; i < pgdat->node_spanned_pages; i++) {
  174. if (!pfn_valid(pgdat->node_start_pfn + i))
  175. continue;
  176. page = pgdat_page_nr(pgdat, i);
  177. total++;
  178. if (PageHighMem(page))
  179. highmem++;
  180. if (PageReserved(page))
  181. reserved++;
  182. else if (PageSwapCache(page))
  183. cached++;
  184. else if (page_count(page))
  185. shared += page_count(page) - 1;
  186. }
  187. pgdat_resize_unlock(pgdat, &flags);
  188. }
  189. printk("%ld pages of RAM\n", total);
  190. #ifdef CONFIG_HIGHMEM
  191. printk("%ld pages of HIGHMEM\n", highmem);
  192. #endif
  193. printk("%ld reserved pages\n", reserved);
  194. printk("%ld pages shared\n", shared);
  195. printk("%ld pages swap cached\n", cached);
  196. }
  197. /*
  198. * Initialize the bootmem system and give it all the memory we
  199. * have available. If we are using highmem, we only put the
  200. * lowmem into the bootmem system.
  201. */
  202. #ifndef CONFIG_NEED_MULTIPLE_NODES
  203. void __init do_init_bootmem(void)
  204. {
  205. unsigned long i;
  206. unsigned long start, bootmap_pages;
  207. unsigned long total_pages;
  208. int boot_mapsize;
  209. max_pfn = total_pages = lmb_end_of_DRAM() >> PAGE_SHIFT;
  210. #ifdef CONFIG_HIGHMEM
  211. total_pages = total_lowmem >> PAGE_SHIFT;
  212. #endif
  213. /*
  214. * Find an area to use for the bootmem bitmap. Calculate the size of
  215. * bitmap required as (Total Memory) / PAGE_SIZE / BITS_PER_BYTE.
  216. * Add 1 additional page in case the address isn't page-aligned.
  217. */
  218. bootmap_pages = bootmem_bootmap_pages(total_pages);
  219. start = lmb_alloc(bootmap_pages << PAGE_SHIFT, PAGE_SIZE);
  220. boot_mapsize = init_bootmem(start >> PAGE_SHIFT, total_pages);
  221. /* Add active regions with valid PFNs */
  222. for (i = 0; i < lmb.memory.cnt; i++) {
  223. unsigned long start_pfn, end_pfn;
  224. start_pfn = lmb.memory.region[i].base >> PAGE_SHIFT;
  225. end_pfn = start_pfn + lmb_size_pages(&lmb.memory, i);
  226. add_active_range(0, start_pfn, end_pfn);
  227. }
  228. /* Add all physical memory to the bootmem map, mark each area
  229. * present.
  230. */
  231. #ifdef CONFIG_HIGHMEM
  232. free_bootmem_with_active_regions(0, total_lowmem >> PAGE_SHIFT);
  233. #else
  234. free_bootmem_with_active_regions(0, max_pfn);
  235. #endif
  236. /* reserve the sections we're already using */
  237. for (i = 0; i < lmb.reserved.cnt; i++)
  238. reserve_bootmem(lmb.reserved.region[i].base,
  239. lmb_size_bytes(&lmb.reserved, i));
  240. /* XXX need to clip this if using highmem? */
  241. sparse_memory_present_with_active_regions(0);
  242. init_bootmem_done = 1;
  243. }
  244. /*
  245. * paging_init() sets up the page tables - in fact we've already done this.
  246. */
  247. void __init paging_init(void)
  248. {
  249. unsigned long total_ram = lmb_phys_mem_size();
  250. unsigned long top_of_ram = lmb_end_of_DRAM();
  251. unsigned long max_zone_pfns[MAX_NR_ZONES];
  252. #ifdef CONFIG_HIGHMEM
  253. map_page(PKMAP_BASE, 0, 0); /* XXX gross */
  254. pkmap_page_table = pte_offset_kernel(pmd_offset(pgd_offset_k
  255. (PKMAP_BASE), PKMAP_BASE), PKMAP_BASE);
  256. map_page(KMAP_FIX_BEGIN, 0, 0); /* XXX gross */
  257. kmap_pte = pte_offset_kernel(pmd_offset(pgd_offset_k
  258. (KMAP_FIX_BEGIN), KMAP_FIX_BEGIN), KMAP_FIX_BEGIN);
  259. kmap_prot = PAGE_KERNEL;
  260. #endif /* CONFIG_HIGHMEM */
  261. printk(KERN_DEBUG "Top of RAM: 0x%lx, Total RAM: 0x%lx\n",
  262. top_of_ram, total_ram);
  263. printk(KERN_DEBUG "Memory hole size: %ldMB\n",
  264. (top_of_ram - total_ram) >> 20);
  265. memset(max_zone_pfns, 0, sizeof(max_zone_pfns));
  266. #ifdef CONFIG_HIGHMEM
  267. max_zone_pfns[ZONE_DMA] = total_lowmem >> PAGE_SHIFT;
  268. max_zone_pfns[ZONE_HIGHMEM] = top_of_ram >> PAGE_SHIFT;
  269. #else
  270. max_zone_pfns[ZONE_DMA] = top_of_ram >> PAGE_SHIFT;
  271. #endif
  272. free_area_init_nodes(max_zone_pfns);
  273. }
  274. #endif /* ! CONFIG_NEED_MULTIPLE_NODES */
  275. void __init mem_init(void)
  276. {
  277. #ifdef CONFIG_NEED_MULTIPLE_NODES
  278. int nid;
  279. #endif
  280. pg_data_t *pgdat;
  281. unsigned long i;
  282. struct page *page;
  283. unsigned long reservedpages = 0, codesize, initsize, datasize, bsssize;
  284. num_physpages = lmb.memory.size >> PAGE_SHIFT;
  285. high_memory = (void *) __va(max_low_pfn * PAGE_SIZE);
  286. #ifdef CONFIG_NEED_MULTIPLE_NODES
  287. for_each_online_node(nid) {
  288. if (NODE_DATA(nid)->node_spanned_pages != 0) {
  289. printk("freeing bootmem node %d\n", nid);
  290. totalram_pages +=
  291. free_all_bootmem_node(NODE_DATA(nid));
  292. }
  293. }
  294. #else
  295. max_mapnr = max_pfn;
  296. totalram_pages += free_all_bootmem();
  297. #endif
  298. for_each_online_pgdat(pgdat) {
  299. for (i = 0; i < pgdat->node_spanned_pages; i++) {
  300. if (!pfn_valid(pgdat->node_start_pfn + i))
  301. continue;
  302. page = pgdat_page_nr(pgdat, i);
  303. if (PageReserved(page))
  304. reservedpages++;
  305. }
  306. }
  307. codesize = (unsigned long)&_sdata - (unsigned long)&_stext;
  308. datasize = (unsigned long)&_edata - (unsigned long)&_sdata;
  309. initsize = (unsigned long)&__init_end - (unsigned long)&__init_begin;
  310. bsssize = (unsigned long)&__bss_stop - (unsigned long)&__bss_start;
  311. #ifdef CONFIG_HIGHMEM
  312. {
  313. unsigned long pfn, highmem_mapnr;
  314. highmem_mapnr = total_lowmem >> PAGE_SHIFT;
  315. for (pfn = highmem_mapnr; pfn < max_mapnr; ++pfn) {
  316. struct page *page = pfn_to_page(pfn);
  317. ClearPageReserved(page);
  318. init_page_count(page);
  319. __free_page(page);
  320. totalhigh_pages++;
  321. }
  322. totalram_pages += totalhigh_pages;
  323. printk(KERN_DEBUG "High memory: %luk\n",
  324. totalhigh_pages << (PAGE_SHIFT-10));
  325. }
  326. #endif /* CONFIG_HIGHMEM */
  327. printk(KERN_INFO "Memory: %luk/%luk available (%luk kernel code, "
  328. "%luk reserved, %luk data, %luk bss, %luk init)\n",
  329. (unsigned long)nr_free_pages() << (PAGE_SHIFT-10),
  330. num_physpages << (PAGE_SHIFT-10),
  331. codesize >> 10,
  332. reservedpages << (PAGE_SHIFT-10),
  333. datasize >> 10,
  334. bsssize >> 10,
  335. initsize >> 10);
  336. mem_init_done = 1;
  337. /* Initialize the vDSO */
  338. vdso_init();
  339. }
  340. /*
  341. * This is called when a page has been modified by the kernel.
  342. * It just marks the page as not i-cache clean. We do the i-cache
  343. * flush later when the page is given to a user process, if necessary.
  344. */
  345. void flush_dcache_page(struct page *page)
  346. {
  347. if (cpu_has_feature(CPU_FTR_COHERENT_ICACHE))
  348. return;
  349. /* avoid an atomic op if possible */
  350. if (test_bit(PG_arch_1, &page->flags))
  351. clear_bit(PG_arch_1, &page->flags);
  352. }
  353. EXPORT_SYMBOL(flush_dcache_page);
  354. void flush_dcache_icache_page(struct page *page)
  355. {
  356. #ifdef CONFIG_BOOKE
  357. void *start = kmap_atomic(page, KM_PPC_SYNC_ICACHE);
  358. __flush_dcache_icache(start);
  359. kunmap_atomic(start, KM_PPC_SYNC_ICACHE);
  360. #elif defined(CONFIG_8xx) || defined(CONFIG_PPC64)
  361. /* On 8xx there is no need to kmap since highmem is not supported */
  362. __flush_dcache_icache(page_address(page));
  363. #else
  364. __flush_dcache_icache_phys(page_to_pfn(page) << PAGE_SHIFT);
  365. #endif
  366. }
  367. void clear_user_page(void *page, unsigned long vaddr, struct page *pg)
  368. {
  369. clear_page(page);
  370. /*
  371. * We shouldnt have to do this, but some versions of glibc
  372. * require it (ld.so assumes zero filled pages are icache clean)
  373. * - Anton
  374. */
  375. flush_dcache_page(pg);
  376. }
  377. EXPORT_SYMBOL(clear_user_page);
  378. void copy_user_page(void *vto, void *vfrom, unsigned long vaddr,
  379. struct page *pg)
  380. {
  381. copy_page(vto, vfrom);
  382. /*
  383. * We should be able to use the following optimisation, however
  384. * there are two problems.
  385. * Firstly a bug in some versions of binutils meant PLT sections
  386. * were not marked executable.
  387. * Secondly the first word in the GOT section is blrl, used
  388. * to establish the GOT address. Until recently the GOT was
  389. * not marked executable.
  390. * - Anton
  391. */
  392. #if 0
  393. if (!vma->vm_file && ((vma->vm_flags & VM_EXEC) == 0))
  394. return;
  395. #endif
  396. flush_dcache_page(pg);
  397. }
  398. void flush_icache_user_range(struct vm_area_struct *vma, struct page *page,
  399. unsigned long addr, int len)
  400. {
  401. unsigned long maddr;
  402. maddr = (unsigned long) kmap(page) + (addr & ~PAGE_MASK);
  403. flush_icache_range(maddr, maddr + len);
  404. kunmap(page);
  405. }
  406. EXPORT_SYMBOL(flush_icache_user_range);
  407. /*
  408. * This is called at the end of handling a user page fault, when the
  409. * fault has been handled by updating a PTE in the linux page tables.
  410. * We use it to preload an HPTE into the hash table corresponding to
  411. * the updated linux PTE.
  412. *
  413. * This must always be called with the pte lock held.
  414. */
  415. void update_mmu_cache(struct vm_area_struct *vma, unsigned long address,
  416. pte_t pte)
  417. {
  418. #ifdef CONFIG_PPC_STD_MMU
  419. unsigned long access = 0, trap;
  420. #endif
  421. unsigned long pfn = pte_pfn(pte);
  422. /* handle i-cache coherency */
  423. if (!cpu_has_feature(CPU_FTR_COHERENT_ICACHE) &&
  424. !cpu_has_feature(CPU_FTR_NOEXECUTE) &&
  425. pfn_valid(pfn)) {
  426. struct page *page = pfn_to_page(pfn);
  427. if (!PageReserved(page)
  428. && !test_bit(PG_arch_1, &page->flags)) {
  429. if (vma->vm_mm == current->active_mm) {
  430. #ifdef CONFIG_8xx
  431. /* On 8xx, cache control instructions (particularly
  432. * "dcbst" from flush_dcache_icache) fault as write
  433. * operation if there is an unpopulated TLB entry
  434. * for the address in question. To workaround that,
  435. * we invalidate the TLB here, thus avoiding dcbst
  436. * misbehaviour.
  437. */
  438. _tlbie(address);
  439. #endif
  440. __flush_dcache_icache((void *) address);
  441. } else
  442. flush_dcache_icache_page(page);
  443. set_bit(PG_arch_1, &page->flags);
  444. }
  445. }
  446. #ifdef CONFIG_PPC_STD_MMU
  447. /* We only want HPTEs for linux PTEs that have _PAGE_ACCESSED set */
  448. if (!pte_young(pte) || address >= TASK_SIZE)
  449. return;
  450. /* We try to figure out if we are coming from an instruction
  451. * access fault and pass that down to __hash_page so we avoid
  452. * double-faulting on execution of fresh text. We have to test
  453. * for regs NULL since init will get here first thing at boot
  454. *
  455. * We also avoid filling the hash if not coming from a fault
  456. */
  457. if (current->thread.regs == NULL)
  458. return;
  459. trap = TRAP(current->thread.regs);
  460. if (trap == 0x400)
  461. access |= _PAGE_EXEC;
  462. else if (trap != 0x300)
  463. return;
  464. hash_preload(vma->vm_mm, address, access, trap);
  465. #endif /* CONFIG_PPC_STD_MMU */
  466. }