1 /* 2 * arch/sh/mm/consistent.c 3 * 4 * Copyright (C) 2004 - 2007 Paul Mundt 5 * 6 * Declared coherent memory functions based on arch/x86/kernel/pci-dma_32.c 7 * 8 * This file is subject to the terms and conditions of the GNU General Public 9 * License. See the file "COPYING" in the main directory of this archive 10 * for more details. 11 */ 12 #include <linux/mm.h> 13 #include <linux/init.h> 14 #include <linux/platform_device.h> 15 #include <linux/dma-mapping.h> 16 #include <linux/dma-debug.h> 17 #include <linux/io.h> 18 #include <linux/module.h> 19 #include <linux/gfp.h> 20 #include <asm/cacheflush.h> 21 #include <asm/addrspace.h> 22 23 #define PREALLOC_DMA_DEBUG_ENTRIES 4096 24 25 const struct dma_map_ops *dma_ops; 26 EXPORT_SYMBOL(dma_ops); 27 28 static int __init dma_init(void) 29 { 30 dma_debug_init(PREALLOC_DMA_DEBUG_ENTRIES); 31 return 0; 32 } 33 fs_initcall(dma_init); 34 35 void *dma_generic_alloc_coherent(struct device *dev, size_t size, 36 dma_addr_t *dma_handle, gfp_t gfp, 37 unsigned long attrs) 38 { 39 void *ret, *ret_nocache; 40 int order = get_order(size); 41 42 gfp |= __GFP_ZERO; 43 44 ret = (void *)__get_free_pages(gfp, order); 45 if (!ret) 46 return NULL; 47 48 /* 49 * Pages from the page allocator may have data present in 50 * cache. So flush the cache before using uncached memory. 51 */ 52 sh_sync_dma_for_device(ret, size, DMA_BIDIRECTIONAL); 53 54 ret_nocache = (void __force *)ioremap_nocache(virt_to_phys(ret), size); 55 if (!ret_nocache) { 56 free_pages((unsigned long)ret, order); 57 return NULL; 58 } 59 60 split_page(pfn_to_page(virt_to_phys(ret) >> PAGE_SHIFT), order); 61 62 *dma_handle = virt_to_phys(ret); 63 if (!WARN_ON(!dev)) 64 *dma_handle -= PFN_PHYS(dev->dma_pfn_offset); 65 66 return ret_nocache; 67 } 68 69 void dma_generic_free_coherent(struct device *dev, size_t size, 70 void *vaddr, dma_addr_t dma_handle, 71 unsigned long attrs) 72 { 73 int order = get_order(size); 74 unsigned long pfn = dma_handle >> PAGE_SHIFT; 75 int k; 76 77 if (!WARN_ON(!dev)) 78 pfn += dev->dma_pfn_offset; 79 80 for (k = 0; k < (1 << order); k++) 81 __free_pages(pfn_to_page(pfn + k), 0); 82 83 iounmap(vaddr); 84 } 85 86 void sh_sync_dma_for_device(void *vaddr, size_t size, 87 enum dma_data_direction direction) 88 { 89 void *addr; 90 91 addr = __in_29bit_mode() ? 92 (void *)CAC_ADDR((unsigned long)vaddr) : vaddr; 93 94 switch (direction) { 95 case DMA_FROM_DEVICE: /* invalidate only */ 96 __flush_invalidate_region(addr, size); 97 break; 98 case DMA_TO_DEVICE: /* writeback only */ 99 __flush_wback_region(addr, size); 100 break; 101 case DMA_BIDIRECTIONAL: /* writeback and invalidate */ 102 __flush_purge_region(addr, size); 103 break; 104 default: 105 BUG(); 106 } 107 } 108 EXPORT_SYMBOL(sh_sync_dma_for_device); 109 110 static int __init memchunk_setup(char *str) 111 { 112 return 1; /* accept anything that begins with "memchunk." */ 113 } 114 __setup("memchunk.", memchunk_setup); 115 116 static void __init memchunk_cmdline_override(char *name, unsigned long *sizep) 117 { 118 char *p = boot_command_line; 119 int k = strlen(name); 120 121 while ((p = strstr(p, "memchunk."))) { 122 p += 9; /* strlen("memchunk.") */ 123 if (!strncmp(name, p, k) && p[k] == '=') { 124 p += k + 1; 125 *sizep = memparse(p, NULL); 126 pr_info("%s: forcing memory chunk size to 0x%08lx\n", 127 name, *sizep); 128 break; 129 } 130 } 131 } 132 133 int __init platform_resource_setup_memory(struct platform_device *pdev, 134 char *name, unsigned long memsize) 135 { 136 struct resource *r; 137 dma_addr_t dma_handle; 138 void *buf; 139 140 r = pdev->resource + pdev->num_resources - 1; 141 if (r->flags) { 142 pr_warning("%s: unable to find empty space for resource\n", 143 name); 144 return -EINVAL; 145 } 146 147 memchunk_cmdline_override(name, &memsize); 148 if (!memsize) 149 return 0; 150 151 buf = dma_alloc_coherent(&pdev->dev, memsize, &dma_handle, GFP_KERNEL); 152 if (!buf) { 153 pr_warning("%s: unable to allocate memory\n", name); 154 return -ENOMEM; 155 } 156 157 memset(buf, 0, memsize); 158 159 r->flags = IORESOURCE_MEM; 160 r->start = dma_handle; 161 r->end = r->start + memsize - 1; 162 r->name = name; 163 return 0; 164 } 165