mem.c 15 KB

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