2 * linux/arch/m68k/mm/memory.c
4 * Copyright (C) 1995 Hamish Macdonald
7 #include <linux/module.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 init_page_count(PD_PAGE(dp
));
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 */
97 list_move_tail(dp
, &ptable_list
);
99 return (pmd_t
*) (page_address(PD_PAGE(dp
)) + off
);
102 int free_pointer_table (pmd_t
*ptable
)
105 unsigned long page
= (unsigned long)ptable
& PAGE_MASK
;
106 unsigned char mask
= 1 << (((unsigned long)ptable
- page
)/PTABLE_SIZE
);
108 dp
= PD_PTABLE(page
);
109 if (PD_MARKBITS (dp
) & mask
)
110 panic ("table already free!");
112 PD_MARKBITS (dp
) |= mask
;
114 if (PD_MARKBITS(dp
) == 0xff) {
115 /* all tables in page are free, free page */
117 cache_page((void *)page
);
120 } else if (ptable_list
.next
!= dp
) {
122 * move this descriptor to the front of the list, since
123 * it has one or more free tables.
125 list_move(dp
, &ptable_list
);
130 #ifdef DEBUG_INVALID_PTOV
134 #ifndef CONFIG_SINGLE_MEMORY_CHUNK
136 * The following two routines map from a physical address to a kernel
137 * virtual address and vice versa.
139 unsigned long mm_vtop(unsigned long vaddr
)
142 unsigned long voff
= (unsigned long)vaddr
- PAGE_OFFSET
;
145 if (voff
< m68k_memory
[i
].size
) {
147 printk ("VTOP(%p)=%lx\n", vaddr
,
148 m68k_memory
[i
].addr
+ voff
);
150 return m68k_memory
[i
].addr
+ voff
;
152 voff
-= m68k_memory
[i
].size
;
153 } while (++i
< m68k_num_memory
);
155 /* As a special case allow `__pa(high_memory)'. */
157 return m68k_memory
[i
-1].addr
+ m68k_memory
[i
-1].size
;
161 EXPORT_SYMBOL(mm_vtop
);
163 unsigned long mm_ptov (unsigned long paddr
)
166 unsigned long poff
, voff
= PAGE_OFFSET
;
169 poff
= paddr
- m68k_memory
[i
].addr
;
170 if (poff
< m68k_memory
[i
].size
) {
172 printk ("PTOV(%lx)=%lx\n", paddr
, poff
+ voff
);
176 voff
+= m68k_memory
[i
].size
;
177 } while (++i
< m68k_num_memory
);
179 #ifdef DEBUG_INVALID_PTOV
180 if (mm_inv_cnt
> 0) {
182 printk("Invalid use of phys_to_virt(0x%lx) at 0x%p!\n",
183 paddr
, __builtin_return_address(0));
188 EXPORT_SYMBOL(mm_ptov
);
191 /* invalidate page in both caches */
192 static inline void clear040(unsigned long paddr
)
197 "cinvp %%bc,(%0)\n\t"
202 /* invalidate page in i-cache */
203 static inline void cleari040(unsigned long paddr
)
208 "cinvp %%ic,(%0)\n\t"
213 /* push page in both caches */
214 /* RZ: cpush %bc DOES invalidate %ic, regardless of DPI */
215 static inline void push040(unsigned long paddr
)
220 "cpushp %%bc,(%0)\n\t"
225 /* push and invalidate page in both caches, must disable ints
226 * to avoid invalidating valid data */
227 static inline void pushcl040(unsigned long paddr
)
231 local_irq_save(flags
);
235 local_irq_restore(flags
);
239 * 040: Hit every page containing an address in the range paddr..paddr+len-1.
240 * (Low order bits of the ea of a CINVP/CPUSHP are "don't care"s).
241 * Hit every page until there is a page or less to go. Hit the next page,
242 * and the one after that if the range hits it.
244 /* ++roman: A little bit more care is required here: The CINVP instruction
245 * invalidates cache entries WITHOUT WRITING DIRTY DATA BACK! So the beginning
246 * and the end of the region must be treated differently if they are not
247 * exactly at the beginning or end of a page boundary. Else, maybe too much
248 * data becomes invalidated and thus lost forever. CPUSHP does what we need:
249 * it invalidates the page after pushing dirty data to memory. (Thanks to Jes
250 * for discovering the problem!)
252 /* ... but on the '060, CPUSH doesn't invalidate (for us, since we have set
253 * the DPI bit in the CACR; would it cause problems with temporarily changing
254 * this?). So we have to push first and then additionally to invalidate.
259 * cache_clear() semantics: Clear any cache entries for the area in question,
260 * without writing back dirty entries first. This is useful if the data will
261 * be overwritten anyway, e.g. by DMA to memory. The range is defined by a
262 * _physical_ address.
265 void cache_clear (unsigned long paddr
, int len
)
267 if (CPU_IS_040_OR_060
) {
271 * We need special treatment for the first page, in case it
272 * is not page-aligned. Page align the addresses to work
273 * around bug I17 in the 68060.
275 if ((tmp
= -paddr
& (PAGE_SIZE
- 1))) {
276 pushcl040(paddr
& PAGE_MASK
);
277 if ((len
-= tmp
) <= 0)
283 while ((len
-= tmp
) >= 0) {
288 /* a page boundary gets crossed at the end */
291 else /* 68030 or 68020 */
292 asm volatile ("movec %/cacr,%/d0\n\t"
295 : : "i" (FLUSH_I_AND_D
)
297 #ifdef CONFIG_M68K_L2_CACHE
302 EXPORT_SYMBOL(cache_clear
); /* probably can be unexported */
306 * cache_push() semantics: Write back any dirty cache data in the given area,
307 * and invalidate the range in the instruction cache. It needs not (but may)
308 * invalidate those entries also in the data cache. The range is defined by a
309 * _physical_ address.
312 void cache_push (unsigned long paddr
, int len
)
314 if (CPU_IS_040_OR_060
) {
318 * on 68040 or 68060, push cache lines for pages in the range;
319 * on the '040 this also invalidates the pushed lines, but not on
322 len
+= paddr
& (PAGE_SIZE
- 1);
325 * Work around bug I17 in the 68060 affecting some instruction
326 * lines not being invalidated properly.
333 } while ((len
-= tmp
) > 0);
336 * 68030/68020 have no writeback cache. On the other hand,
337 * cache_push is actually a superset of cache_clear (the lines
338 * get written back and invalidated), so we should make sure
339 * to perform the corresponding actions. After all, this is getting
340 * called in places where we've just loaded code, or whatever, so
341 * flushing the icache is appropriate; flushing the dcache shouldn't
344 else /* 68030 or 68020 */
345 asm volatile ("movec %/cacr,%/d0\n\t"
350 #ifdef CONFIG_M68K_L2_CACHE
355 EXPORT_SYMBOL(cache_push
); /* probably can be unexported */
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
)
367 EXPORT_SYMBOL(mm_end_of_chunk
);