2 * Microblaze support for cache consistent memory.
4 * Copyright (C) 2010 PetaLogix
7 * Based on PowerPC version derived from arch/arm/mm/consistent.c
9 * Copyright (C) 2000 Russell King
11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License version 2 as
13 * published by the Free Software Foundation.
16 #include <linux/export.h>
17 #include <linux/signal.h>
18 #include <linux/sched.h>
19 #include <linux/kernel.h>
20 #include <linux/errno.h>
21 #include <linux/string.h>
22 #include <linux/types.h>
23 #include <linux/ptrace.h>
24 #include <linux/mman.h>
26 #include <linux/swap.h>
27 #include <linux/stddef.h>
28 #include <linux/vmalloc.h>
29 #include <linux/init.h>
30 #include <linux/delay.h>
31 #include <linux/bootmem.h>
32 #include <linux/highmem.h>
33 #include <linux/pci.h>
34 #include <linux/interrupt.h>
35 #include <linux/gfp.h>
37 #include <asm/pgalloc.h>
39 #include <linux/hardirq.h>
40 #include <linux/mmu_context.h>
42 #include <linux/uaccess.h>
43 #include <asm/pgtable.h>
44 #include <asm/cpuinfo.h>
45 #include <asm/tlbflush.h>
48 /* I have to use dcache values because I can't relate on ram size */
49 # define UNCACHED_SHADOW_MASK (cpuinfo.dcache_high - cpuinfo.dcache_base + 1)
53 * Consistent memory allocators. Used for DMA devices that want to
54 * share uncached memory with the processor core.
55 * My crufty no-MMU approach is simple. In the HW platform we can optionally
56 * mirror the DDR up above the processor cacheable region. So, memory accessed
57 * in this mirror region will not be cached. It's alloced from the same
58 * pool as normal memory, but the handle we return is shifted up into the
59 * uncached region. This will no doubt cause big problems if memory allocated
60 * here is not also freed properly. -- JW
62 void *consistent_alloc(gfp_t gfp, size_t size, dma_addr_t *dma_handle)
64 unsigned long order, vaddr;
66 unsigned int i, err = 0;
67 struct page *page, *end;
71 struct vm_struct *area;
78 /* Only allocate page size areas. */
79 size = PAGE_ALIGN(size);
80 order = get_order(size);
82 vaddr = __get_free_pages(gfp, order);
87 * we need to ensure that there are no cachelines in use,
88 * or worse dirty in this area.
90 flush_dcache_range(virt_to_phys((void *)vaddr),
91 virt_to_phys((void *)vaddr) + size);
96 * Here's the magic! Note if the uncached shadow is not implemented,
97 * it's up to the calling code to also test that condition and make
98 * other arranegments, such as manually flushing the cache and so on.
100 # ifdef CONFIG_XILINX_UNCACHED_SHADOW
101 ret = (void *)((unsigned) ret | UNCACHED_SHADOW_MASK);
103 if ((unsigned int)ret > cpuinfo.dcache_base &&
104 (unsigned int)ret < cpuinfo.dcache_high)
105 pr_warn("ERROR: Your cache coherent area is CACHED!!!\n");
107 /* dma_handle is same as physical (shadowed) address */
108 *dma_handle = (dma_addr_t)ret;
110 /* Allocate some common virtual space to map the new pages. */
111 area = get_vm_area(size, VM_ALLOC);
113 free_pages(vaddr, order);
116 va = (unsigned long) area->addr;
119 /* This gives us the real physical address of the first page. */
120 *dma_handle = pa = __virt_to_phys(vaddr);
124 * free wasted pages. We skip the first page since we know
125 * that it will have count = 1 and won't require freeing.
126 * We also mark the pages in use as reserved so that
127 * remap_page_range works.
129 page = virt_to_page(vaddr);
130 end = page + (1 << order);
132 split_page(page, order);
134 for (i = 0; i < size && err == 0; i += PAGE_SIZE) {
136 /* MS: This is the whole magic - use cache inhibit pages */
137 err = map_page(va + i, pa + i, _PAGE_KERNEL | _PAGE_NO_CACHE);
140 SetPageReserved(page);
144 /* Free the otherwise unused pages. */
151 free_pages(vaddr, order);
157 EXPORT_SYMBOL(consistent_alloc);
160 static pte_t *consistent_virt_to_pte(void *vaddr)
162 unsigned long addr = (unsigned long)vaddr;
164 return pte_offset_kernel(pmd_offset(pgd_offset_k(addr), addr), addr);
167 unsigned long consistent_virt_to_pfn(void *vaddr)
169 pte_t *ptep = consistent_virt_to_pte(vaddr);
171 if (pte_none(*ptep) || !pte_present(*ptep))
174 return pte_pfn(*ptep);
179 * free page(s) as defined by the above mapping.
181 void consistent_free(size_t size, void *vaddr)
188 size = PAGE_ALIGN(size);
191 /* Clear SHADOW_MASK bit in address, and free as per usual */
192 # ifdef CONFIG_XILINX_UNCACHED_SHADOW
193 vaddr = (void *)((unsigned)vaddr & ~UNCACHED_SHADOW_MASK);
195 page = virt_to_page(vaddr);
198 __free_reserved_page(page);
200 } while (size -= PAGE_SIZE);
203 pte_t *ptep = consistent_virt_to_pte(vaddr);
206 if (!pte_none(*ptep) && pte_present(*ptep)) {
207 pfn = pte_pfn(*ptep);
208 pte_clear(&init_mm, (unsigned int)vaddr, ptep);
209 if (pfn_valid(pfn)) {
210 page = pfn_to_page(pfn);
211 __free_reserved_page(page);
215 } while (size -= PAGE_SIZE);
221 EXPORT_SYMBOL(consistent_free);
224 * make an area consistent.
226 void consistent_sync(void *vaddr, size_t size, int direction)
231 start = (unsigned long)vaddr;
233 /* Convert start address back down to unshadowed memory region */
234 #ifdef CONFIG_XILINX_UNCACHED_SHADOW
235 start &= ~UNCACHED_SHADOW_MASK;
242 case PCI_DMA_FROMDEVICE: /* invalidate only */
243 invalidate_dcache_range(start, end);
245 case PCI_DMA_TODEVICE: /* writeback only */
246 flush_dcache_range(start, end);
248 case PCI_DMA_BIDIRECTIONAL: /* writeback and invalidate */
249 flush_dcache_range(start, end);
253 EXPORT_SYMBOL(consistent_sync);
256 * consistent_sync_page makes memory consistent. identical
257 * to consistent_sync, but takes a struct page instead of a
260 void consistent_sync_page(struct page *page, unsigned long offset,
261 size_t size, int direction)
263 unsigned long start = (unsigned long)page_address(page) + offset;
264 consistent_sync((void *)start, size, direction);
266 EXPORT_SYMBOL(consistent_sync_page);