2005-04-16 16:20:36 -06:00
|
|
|
/*
|
2006-10-03 15:01:26 -06:00
|
|
|
* linux/arch/m68k/mm/motorola.c
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
|
|
|
* Routines specific to the Motorola MMU, originally from:
|
|
|
|
* linux/arch/m68k/init.c
|
|
|
|
* which are Copyright (C) 1995 Hamish Macdonald
|
|
|
|
*
|
|
|
|
* Moved 8/20/1999 Sam Creasey
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/signal.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/swap.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/bootmem.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 02:04:11 -06:00
|
|
|
#include <linux/gfp.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#include <asm/setup.h>
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <asm/page.h>
|
|
|
|
#include <asm/pgalloc.h>
|
|
|
|
#include <asm/machdep.h>
|
|
|
|
#include <asm/io.h>
|
|
|
|
#include <asm/dma.h>
|
|
|
|
#ifdef CONFIG_ATARI
|
|
|
|
#include <asm/atari_stram.h>
|
|
|
|
#endif
|
2008-12-21 04:03:37 -07:00
|
|
|
#include <asm/sections.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#undef DEBUG
|
|
|
|
|
|
|
|
#ifndef mm_cachebits
|
|
|
|
/*
|
|
|
|
* Bits to add to page descriptors for "normal" caching mode.
|
|
|
|
* For 68020/030 this is 0.
|
|
|
|
* For 68040, this is _PAGE_CACHE040 (cachable, copyback)
|
|
|
|
*/
|
|
|
|
unsigned long mm_cachebits;
|
|
|
|
EXPORT_SYMBOL(mm_cachebits);
|
|
|
|
#endif
|
|
|
|
|
2007-05-31 01:40:54 -06:00
|
|
|
/* size of memory already mapped in head.S */
|
|
|
|
#define INIT_MAPPED_SIZE (4UL<<20)
|
|
|
|
|
|
|
|
extern unsigned long availmem;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
static pte_t * __init kernel_page_table(void)
|
|
|
|
{
|
|
|
|
pte_t *ptablep;
|
|
|
|
|
|
|
|
ptablep = (pte_t *)alloc_bootmem_low_pages(PAGE_SIZE);
|
|
|
|
|
|
|
|
clear_page(ptablep);
|
|
|
|
__flush_page_to_ram(ptablep);
|
|
|
|
flush_tlb_kernel_page(ptablep);
|
|
|
|
nocache_page(ptablep);
|
|
|
|
|
|
|
|
return ptablep;
|
|
|
|
}
|
|
|
|
|
|
|
|
static pmd_t *last_pgtable __initdata = NULL;
|
|
|
|
pmd_t *zero_pgtable __initdata = NULL;
|
|
|
|
|
|
|
|
static pmd_t * __init kernel_ptr_table(void)
|
|
|
|
{
|
|
|
|
if (!last_pgtable) {
|
|
|
|
unsigned long pmd, last;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Find the last ptr table that was used in head.S and
|
|
|
|
* reuse the remaining space in that page for further
|
|
|
|
* ptr tables.
|
|
|
|
*/
|
|
|
|
last = (unsigned long)kernel_pg_dir;
|
|
|
|
for (i = 0; i < PTRS_PER_PGD; i++) {
|
|
|
|
if (!pgd_present(kernel_pg_dir[i]))
|
|
|
|
continue;
|
|
|
|
pmd = __pgd_page(kernel_pg_dir[i]);
|
|
|
|
if (pmd > last)
|
|
|
|
last = pmd;
|
|
|
|
}
|
|
|
|
|
|
|
|
last_pgtable = (pmd_t *)last;
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk("kernel_ptr_init: %p\n", last_pgtable);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
last_pgtable += PTRS_PER_PMD;
|
|
|
|
if (((unsigned long)last_pgtable & ~PAGE_MASK) == 0) {
|
|
|
|
last_pgtable = (pmd_t *)alloc_bootmem_low_pages(PAGE_SIZE);
|
|
|
|
|
|
|
|
clear_page(last_pgtable);
|
|
|
|
__flush_page_to_ram(last_pgtable);
|
|
|
|
flush_tlb_kernel_page(last_pgtable);
|
|
|
|
nocache_page(last_pgtable);
|
|
|
|
}
|
|
|
|
|
|
|
|
return last_pgtable;
|
|
|
|
}
|
|
|
|
|
2007-05-31 01:40:54 -06:00
|
|
|
static void __init map_node(int node)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
#define PTRTREESIZE (256*1024)
|
|
|
|
#define ROOTTREESIZE (32*1024*1024)
|
2007-05-31 01:40:54 -06:00
|
|
|
unsigned long physaddr, virtaddr, size;
|
2005-04-16 16:20:36 -06:00
|
|
|
pgd_t *pgd_dir;
|
|
|
|
pmd_t *pmd_dir;
|
|
|
|
pte_t *pte_dir;
|
|
|
|
|
2007-05-31 01:40:54 -06:00
|
|
|
size = m68k_memory[node].size;
|
|
|
|
physaddr = m68k_memory[node].addr;
|
|
|
|
virtaddr = (unsigned long)phys_to_virt(physaddr);
|
|
|
|
physaddr |= m68k_supervisor_cachemode |
|
|
|
|
_PAGE_PRESENT | _PAGE_ACCESSED | _PAGE_DIRTY;
|
2005-04-16 16:20:36 -06:00
|
|
|
if (CPU_IS_040_OR_060)
|
|
|
|
physaddr |= _PAGE_GLOBAL040;
|
|
|
|
|
|
|
|
while (size > 0) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
if (!(virtaddr & (PTRTREESIZE-1)))
|
|
|
|
printk ("\npa=%#lx va=%#lx ", physaddr & PAGE_MASK,
|
|
|
|
virtaddr);
|
|
|
|
#endif
|
|
|
|
pgd_dir = pgd_offset_k(virtaddr);
|
|
|
|
if (virtaddr && CPU_IS_020_OR_030) {
|
|
|
|
if (!(virtaddr & (ROOTTREESIZE-1)) &&
|
|
|
|
size >= ROOTTREESIZE) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk ("[very early term]");
|
|
|
|
#endif
|
|
|
|
pgd_val(*pgd_dir) = physaddr;
|
|
|
|
size -= ROOTTREESIZE;
|
|
|
|
virtaddr += ROOTTREESIZE;
|
|
|
|
physaddr += ROOTTREESIZE;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!pgd_present(*pgd_dir)) {
|
|
|
|
pmd_dir = kernel_ptr_table();
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk ("[new pointer %p]", pmd_dir);
|
|
|
|
#endif
|
|
|
|
pgd_set(pgd_dir, pmd_dir);
|
|
|
|
} else
|
|
|
|
pmd_dir = pmd_offset(pgd_dir, virtaddr);
|
|
|
|
|
|
|
|
if (CPU_IS_020_OR_030) {
|
|
|
|
if (virtaddr) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk ("[early term]");
|
|
|
|
#endif
|
|
|
|
pmd_dir->pmd[(virtaddr/PTRTREESIZE) & 15] = physaddr;
|
|
|
|
physaddr += PTRTREESIZE;
|
|
|
|
} else {
|
|
|
|
int i;
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk ("[zero map]");
|
|
|
|
#endif
|
|
|
|
zero_pgtable = kernel_ptr_table();
|
|
|
|
pte_dir = (pte_t *)zero_pgtable;
|
|
|
|
pmd_dir->pmd[0] = virt_to_phys(pte_dir) |
|
|
|
|
_PAGE_TABLE | _PAGE_ACCESSED;
|
|
|
|
pte_val(*pte_dir++) = 0;
|
|
|
|
physaddr += PAGE_SIZE;
|
|
|
|
for (i = 1; i < 64; physaddr += PAGE_SIZE, i++)
|
|
|
|
pte_val(*pte_dir++) = physaddr;
|
|
|
|
}
|
|
|
|
size -= PTRTREESIZE;
|
|
|
|
virtaddr += PTRTREESIZE;
|
|
|
|
} else {
|
|
|
|
if (!pmd_present(*pmd_dir)) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk ("[new table]");
|
|
|
|
#endif
|
|
|
|
pte_dir = kernel_page_table();
|
|
|
|
pmd_set(pmd_dir, pte_dir);
|
|
|
|
}
|
|
|
|
pte_dir = pte_offset_kernel(pmd_dir, virtaddr);
|
|
|
|
|
|
|
|
if (virtaddr) {
|
|
|
|
if (!pte_present(*pte_dir))
|
|
|
|
pte_val(*pte_dir) = physaddr;
|
|
|
|
} else
|
|
|
|
pte_val(*pte_dir) = 0;
|
|
|
|
size -= PAGE_SIZE;
|
|
|
|
virtaddr += PAGE_SIZE;
|
|
|
|
physaddr += PAGE_SIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk("\n");
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* paging_init() continues the virtual memory environment setup which
|
|
|
|
* was begun by the code in arch/head.S.
|
|
|
|
*/
|
|
|
|
void __init paging_init(void)
|
|
|
|
{
|
2006-06-23 03:04:58 -06:00
|
|
|
unsigned long zones_size[MAX_NR_ZONES] = { 0, };
|
2007-05-31 01:40:54 -06:00
|
|
|
unsigned long min_addr, max_addr;
|
|
|
|
unsigned long addr, size, end;
|
|
|
|
int i;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#ifdef DEBUG
|
2007-08-22 15:01:30 -06:00
|
|
|
printk ("start of paging_init (%p, %lx)\n", kernel_pg_dir, availmem);
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Fix the cache mode in the page descriptors for the 680[46]0. */
|
|
|
|
if (CPU_IS_040_OR_060) {
|
|
|
|
int i;
|
|
|
|
#ifndef mm_cachebits
|
|
|
|
mm_cachebits = _PAGE_CACHE040;
|
|
|
|
#endif
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
pgprot_val(protection_map[i]) |= _PAGE_CACHE040;
|
|
|
|
}
|
|
|
|
|
2007-05-31 01:40:54 -06:00
|
|
|
min_addr = m68k_memory[0].addr;
|
|
|
|
max_addr = min_addr + m68k_memory[0].size;
|
|
|
|
for (i = 1; i < m68k_num_memory;) {
|
|
|
|
if (m68k_memory[i].addr < min_addr) {
|
|
|
|
printk("Ignoring memory chunk at 0x%lx:0x%lx before the first chunk\n",
|
|
|
|
m68k_memory[i].addr, m68k_memory[i].size);
|
|
|
|
printk("Fix your bootloader or use a memfile to make use of this area!\n");
|
|
|
|
m68k_num_memory--;
|
|
|
|
memmove(m68k_memory + i, m68k_memory + i + 1,
|
|
|
|
(m68k_num_memory - i) * sizeof(struct mem_info));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
addr = m68k_memory[i].addr + m68k_memory[i].size;
|
|
|
|
if (addr > max_addr)
|
|
|
|
max_addr = addr;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
m68k_memoffset = min_addr - PAGE_OFFSET;
|
|
|
|
m68k_virt_to_node_shift = fls(max_addr - min_addr - 1) - 6;
|
|
|
|
|
2007-05-31 01:40:50 -06:00
|
|
|
module_fixup(NULL, __start_fixup, __stop_fixup);
|
|
|
|
flush_icache();
|
|
|
|
|
2007-05-31 01:40:54 -06:00
|
|
|
high_memory = phys_to_virt(max_addr);
|
|
|
|
|
|
|
|
min_low_pfn = availmem >> PAGE_SHIFT;
|
|
|
|
max_low_pfn = max_addr >> PAGE_SHIFT;
|
|
|
|
|
|
|
|
for (i = 0; i < m68k_num_memory; i++) {
|
|
|
|
addr = m68k_memory[i].addr;
|
|
|
|
end = addr + m68k_memory[i].size;
|
|
|
|
m68k_setup_node(i);
|
|
|
|
availmem = PAGE_ALIGN(availmem);
|
|
|
|
availmem += init_bootmem_node(NODE_DATA(i),
|
|
|
|
availmem >> PAGE_SHIFT,
|
|
|
|
addr >> PAGE_SHIFT,
|
|
|
|
end >> PAGE_SHIFT);
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Map the physical memory available into the kernel virtual
|
2007-05-31 01:40:54 -06:00
|
|
|
* address space. First initialize the bootmem allocator with
|
|
|
|
* the memory we already mapped, so map_node() has something
|
|
|
|
* to allocate.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2007-05-31 01:40:54 -06:00
|
|
|
addr = m68k_memory[0].addr;
|
|
|
|
size = m68k_memory[0].size;
|
|
|
|
free_bootmem_node(NODE_DATA(0), availmem, min(INIT_MAPPED_SIZE, size) - (availmem - addr));
|
|
|
|
map_node(0);
|
|
|
|
if (size > INIT_MAPPED_SIZE)
|
|
|
|
free_bootmem_node(NODE_DATA(0), addr + INIT_MAPPED_SIZE, size - INIT_MAPPED_SIZE);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-05-31 01:40:54 -06:00
|
|
|
for (i = 1; i < m68k_num_memory; i++)
|
|
|
|
map_node(i);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
flush_tlb_all();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* initialize the bad page table and bad page to point
|
|
|
|
* to a couple of allocated pages
|
|
|
|
*/
|
|
|
|
empty_zero_page = alloc_bootmem_pages(PAGE_SIZE);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up SFC/DFC registers
|
|
|
|
*/
|
|
|
|
set_fs(KERNEL_DS);
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk ("before free_area_init\n");
|
|
|
|
#endif
|
2007-05-31 01:40:54 -06:00
|
|
|
for (i = 0; i < m68k_num_memory; i++) {
|
|
|
|
zones_size[ZONE_DMA] = m68k_memory[i].size >> PAGE_SHIFT;
|
2008-07-23 22:27:20 -06:00
|
|
|
free_area_init_node(i, zones_size,
|
2007-05-31 01:40:54 -06:00
|
|
|
m68k_memory[i].addr >> PAGE_SHIFT, NULL);
|
2011-04-25 20:51:53 -06:00
|
|
|
if (node_present_pages(i))
|
|
|
|
node_set_state(i, N_NORMAL_MEMORY);
|
2007-05-31 01:40:54 -06:00
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|