2 * linux/arch/m68k/mm/memory.c
4 * Copyright (C) 1995 Hamish Macdonald
7 #include <linux/config.h>
9 #include <linux/kernel.h>
10 #include <linux/string.h>
11 #include <linux/types.h>
12 #include <linux/slab.h>
13 #include <linux/init.h>
14 #include <linux/pagemap.h>
16 #include <asm/setup.h>
17 #include <asm/segment.h>
19 #include <asm/pgalloc.h>
20 #include <asm/system.h>
21 #include <asm/traps.h>
22 #include <asm/machdep.h>
25 /* ++andreas: {get,free}_pointer_table rewritten to use unused fields from
26 struct page instead of separately kmalloced struct. Stolen from
27 arch/sparc/mm/srmmu.c ... */
29 typedef struct list_head ptable_desc;
30 static LIST_HEAD(ptable_list);
32 #define PD_PTABLE(page) ((ptable_desc *)&(virt_to_page(page)->lru))
33 #define PD_PAGE(ptable) (list_entry(ptable, struct page, lru))
34 #define PD_MARKBITS(dp) (*(unsigned char *)&PD_PAGE(dp)->index)
36 #define PTABLE_SIZE (PTRS_PER_PMD * sizeof(pmd_t))
38 void __init init_pointer_table(unsigned long ptable)
41 unsigned long page = ptable & PAGE_MASK;
42 unsigned char mask = 1 << ((ptable - page)/PTABLE_SIZE);
45 if (!(PD_MARKBITS(dp) & mask)) {
46 PD_MARKBITS(dp) = 0xff;
47 list_add(dp, &ptable_list);
50 PD_MARKBITS(dp) &= ~mask;
52 printk("init_pointer_table: %lx, %x\n", ptable, PD_MARKBITS(dp));
55 /* unreserve the page so it's possible to free that page */
56 PD_PAGE(dp)->flags &= ~(1 << PG_reserved);
57 set_page_count(PD_PAGE(dp), 1);
62 pmd_t *get_pointer_table (void)
64 ptable_desc *dp = ptable_list.next;
65 unsigned char mask = PD_MARKBITS (dp);
70 * For a pointer table for a user process address space, a
71 * table is taken from a page allocated for the purpose. Each
72 * page can hold 8 pointer tables. The page is remapped in
73 * virtual address space to be noncacheable.
79 if (!(page = (void *)get_zeroed_page(GFP_KERNEL)))
82 flush_tlb_kernel_page(page);
85 new = PD_PTABLE(page);
86 PD_MARKBITS(new) = 0xfe;
87 list_add_tail(new, dp);
92 for (tmp = 1, off = 0; (mask & tmp) == 0; tmp <<= 1, off += PTABLE_SIZE)
94 PD_MARKBITS(dp) = mask & ~tmp;
95 if (!PD_MARKBITS(dp)) {
96 /* move to end of list */
98 list_add_tail(dp, &ptable_list);
100 return (pmd_t *) (page_address(PD_PAGE(dp)) + off);
103 int free_pointer_table (pmd_t *ptable)
106 unsigned long page = (unsigned long)ptable & PAGE_MASK;
107 unsigned char mask = 1 << (((unsigned long)ptable - page)/PTABLE_SIZE);
109 dp = PD_PTABLE(page);
110 if (PD_MARKBITS (dp) & mask)
111 panic ("table already free!");
113 PD_MARKBITS (dp) |= mask;
115 if (PD_MARKBITS(dp) == 0xff) {
116 /* all tables in page are free, free page */
118 cache_page((void *)page);
121 } else if (ptable_list.next != dp) {
123 * move this descriptor to the front of the list, since
124 * it has one or more free tables.
127 list_add(dp, &ptable_list);
132 #ifdef DEBUG_INVALID_PTOV
136 #ifndef CONFIG_SINGLE_MEMORY_CHUNK
138 * The following two routines map from a physical address to a kernel
139 * virtual address and vice versa.
141 unsigned long mm_vtop(unsigned long vaddr)
144 unsigned long voff = (unsigned long)vaddr - PAGE_OFFSET;
147 if (voff < m68k_memory[i].size) {
149 printk ("VTOP(%p)=%lx\n", vaddr,
150 m68k_memory[i].addr + voff);
152 return m68k_memory[i].addr + voff;
154 voff -= m68k_memory[i].size;
155 } while (++i < m68k_num_memory);
157 /* As a special case allow `__pa(high_memory)'. */
159 return m68k_memory[i-1].addr + m68k_memory[i-1].size;
165 #ifndef CONFIG_SINGLE_MEMORY_CHUNK
166 unsigned long mm_ptov (unsigned long paddr)
169 unsigned long poff, voff = PAGE_OFFSET;
172 poff = paddr - m68k_memory[i].addr;
173 if (poff < m68k_memory[i].size) {
175 printk ("PTOV(%lx)=%lx\n", paddr, poff + voff);
179 voff += m68k_memory[i].size;
180 } while (++i < m68k_num_memory);
182 #ifdef DEBUG_INVALID_PTOV
183 if (mm_inv_cnt > 0) {
185 printk("Invalid use of phys_to_virt(0x%lx) at 0x%p!\n",
186 paddr, __builtin_return_address(0));
193 /* invalidate page in both caches */
194 static inline void clear040(unsigned long paddr)
199 "cinvp %%bc,(%0)\n\t"
204 /* invalidate page in i-cache */
205 static inline void cleari040(unsigned long paddr)
210 "cinvp %%ic,(%0)\n\t"
215 /* push page in both caches */
216 /* RZ: cpush %bc DOES invalidate %ic, regardless of DPI */
217 static inline void push040(unsigned long paddr)
222 "cpushp %%bc,(%0)\n\t"
227 /* push and invalidate page in both caches, must disable ints
228 * to avoid invalidating valid data */
229 static inline void pushcl040(unsigned long paddr)
233 local_irq_save(flags);
237 local_irq_restore(flags);
241 * 040: Hit every page containing an address in the range paddr..paddr+len-1.
242 * (Low order bits of the ea of a CINVP/CPUSHP are "don't care"s).
243 * Hit every page until there is a page or less to go. Hit the next page,
244 * and the one after that if the range hits it.
246 /* ++roman: A little bit more care is required here: The CINVP instruction
247 * invalidates cache entries WITHOUT WRITING DIRTY DATA BACK! So the beginning
248 * and the end of the region must be treated differently if they are not
249 * exactly at the beginning or end of a page boundary. Else, maybe too much
250 * data becomes invalidated and thus lost forever. CPUSHP does what we need:
251 * it invalidates the page after pushing dirty data to memory. (Thanks to Jes
252 * for discovering the problem!)
254 /* ... but on the '060, CPUSH doesn't invalidate (for us, since we have set
255 * the DPI bit in the CACR; would it cause problems with temporarily changing
256 * this?). So we have to push first and then additionally to invalidate.
261 * cache_clear() semantics: Clear any cache entries for the area in question,
262 * without writing back dirty entries first. This is useful if the data will
263 * be overwritten anyway, e.g. by DMA to memory. The range is defined by a
264 * _physical_ address.
267 void cache_clear (unsigned long paddr, int len)
269 if (CPU_IS_040_OR_060) {
273 * We need special treatment for the first page, in case it
274 * is not page-aligned. Page align the addresses to work
275 * around bug I17 in the 68060.
277 if ((tmp = -paddr & (PAGE_SIZE - 1))) {
278 pushcl040(paddr & PAGE_MASK);
279 if ((len -= tmp) <= 0)
285 while ((len -= tmp) >= 0) {
290 /* a page boundary gets crossed at the end */
293 else /* 68030 or 68020 */
294 asm volatile ("movec %/cacr,%/d0\n\t"
297 : : "i" (FLUSH_I_AND_D)
299 #ifdef CONFIG_M68K_L2_CACHE
307 * cache_push() semantics: Write back any dirty cache data in the given area,
308 * and invalidate the range in the instruction cache. It needs not (but may)
309 * invalidate those entries also in the data cache. The range is defined by a
310 * _physical_ address.
313 void cache_push (unsigned long paddr, int len)
315 if (CPU_IS_040_OR_060) {
319 * on 68040 or 68060, push cache lines for pages in the range;
320 * on the '040 this also invalidates the pushed lines, but not on
323 len += paddr & (PAGE_SIZE - 1);
326 * Work around bug I17 in the 68060 affecting some instruction
327 * lines not being invalidated properly.
334 } while ((len -= tmp) > 0);
337 * 68030/68020 have no writeback cache. On the other hand,
338 * cache_push is actually a superset of cache_clear (the lines
339 * get written back and invalidated), so we should make sure
340 * to perform the corresponding actions. After all, this is getting
341 * called in places where we've just loaded code, or whatever, so
342 * flushing the icache is appropriate; flushing the dcache shouldn't
345 else /* 68030 or 68020 */
346 asm volatile ("movec %/cacr,%/d0\n\t"
351 #ifdef CONFIG_M68K_L2_CACHE
357 #ifndef CONFIG_SINGLE_MEMORY_CHUNK
358 int mm_end_of_chunk (unsigned long addr, int len)
362 for (i = 0; i < m68k_num_memory; i++)
363 if (m68k_memory[i].addr + m68k_memory[i].size == addr + len)