diff options
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/Kconfig | 3 | ||||
| -rw-r--r-- | lib/Kconfig.debug | 32 | ||||
| -rw-r--r-- | lib/Makefile | 3 | ||||
| -rw-r--r-- | lib/checksum.c | 193 | ||||
| -rw-r--r-- | lib/cpumask.c | 23 | ||||
| -rw-r--r-- | lib/dma-debug.c | 432 | ||||
| -rw-r--r-- | lib/extable.c | 21 | ||||
| -rw-r--r-- | lib/rational.c | 62 | ||||
| -rw-r--r-- | lib/swiotlb.c | 119 | ||||
| -rw-r--r-- | lib/vsprintf.c | 56 |
10 files changed, 821 insertions, 123 deletions
diff --git a/lib/Kconfig b/lib/Kconfig index 8ade0a7a91e0..9960be04cbbe 100644 --- a/lib/Kconfig +++ b/lib/Kconfig | |||
| @@ -10,6 +10,9 @@ menu "Library routines" | |||
| 10 | config BITREVERSE | 10 | config BITREVERSE |
| 11 | tristate | 11 | tristate |
| 12 | 12 | ||
| 13 | config RATIONAL | ||
| 14 | boolean | ||
| 15 | |||
| 13 | config GENERIC_FIND_FIRST_BIT | 16 | config GENERIC_FIND_FIRST_BIT |
| 14 | bool | 17 | bool |
| 15 | 18 | ||
diff --git a/lib/Kconfig.debug b/lib/Kconfig.debug index 6cdcf38f2da9..116a35051be6 100644 --- a/lib/Kconfig.debug +++ b/lib/Kconfig.debug | |||
| @@ -336,6 +336,38 @@ config SLUB_STATS | |||
| 336 | out which slabs are relevant to a particular load. | 336 | out which slabs are relevant to a particular load. |
| 337 | Try running: slabinfo -DA | 337 | Try running: slabinfo -DA |
| 338 | 338 | ||
| 339 | config DEBUG_KMEMLEAK | ||
| 340 | bool "Kernel memory leak detector" | ||
| 341 | depends on DEBUG_KERNEL && EXPERIMENTAL && (X86 || ARM) && \ | ||
| 342 | !MEMORY_HOTPLUG | ||
| 343 | select DEBUG_SLAB if SLAB | ||
| 344 | select SLUB_DEBUG if SLUB | ||
| 345 | select DEBUG_FS if SYSFS | ||
| 346 | select STACKTRACE if STACKTRACE_SUPPORT | ||
| 347 | select KALLSYMS | ||
| 348 | help | ||
| 349 | Say Y here if you want to enable the memory leak | ||
| 350 | detector. The memory allocation/freeing is traced in a way | ||
| 351 | similar to the Boehm's conservative garbage collector, the | ||
| 352 | difference being that the orphan objects are not freed but | ||
| 353 | only shown in /sys/kernel/debug/kmemleak. Enabling this | ||
| 354 | feature will introduce an overhead to memory | ||
| 355 | allocations. See Documentation/kmemleak.txt for more | ||
| 356 | details. | ||
| 357 | |||
| 358 | In order to access the kmemleak file, debugfs needs to be | ||
| 359 | mounted (usually at /sys/kernel/debug). | ||
| 360 | |||
| 361 | config DEBUG_KMEMLEAK_TEST | ||
| 362 | tristate "Simple test for the kernel memory leak detector" | ||
| 363 | depends on DEBUG_KMEMLEAK | ||
| 364 | help | ||
| 365 | Say Y or M here to build a test for the kernel memory leak | ||
| 366 | detector. This option enables a module that explicitly leaks | ||
| 367 | memory. | ||
| 368 | |||
| 369 | If unsure, say N. | ||
| 370 | |||
| 339 | config DEBUG_PREEMPT | 371 | config DEBUG_PREEMPT |
| 340 | bool "Debug preemptible kernel" | 372 | bool "Debug preemptible kernel" |
| 341 | depends on DEBUG_KERNEL && PREEMPT && (TRACE_IRQFLAGS_SUPPORT || PPC64) | 373 | depends on DEBUG_KERNEL && PREEMPT && (TRACE_IRQFLAGS_SUPPORT || PPC64) |
diff --git a/lib/Makefile b/lib/Makefile index 33a40e40e3ee..34c5c0e6222e 100644 --- a/lib/Makefile +++ b/lib/Makefile | |||
| @@ -50,6 +50,7 @@ ifneq ($(CONFIG_HAVE_DEC_LOCK),y) | |||
| 50 | endif | 50 | endif |
| 51 | 51 | ||
| 52 | obj-$(CONFIG_BITREVERSE) += bitrev.o | 52 | obj-$(CONFIG_BITREVERSE) += bitrev.o |
| 53 | obj-$(CONFIG_RATIONAL) += rational.o | ||
| 53 | obj-$(CONFIG_CRC_CCITT) += crc-ccitt.o | 54 | obj-$(CONFIG_CRC_CCITT) += crc-ccitt.o |
| 54 | obj-$(CONFIG_CRC16) += crc16.o | 55 | obj-$(CONFIG_CRC16) += crc16.o |
| 55 | obj-$(CONFIG_CRC_T10DIF)+= crc-t10dif.o | 56 | obj-$(CONFIG_CRC_T10DIF)+= crc-t10dif.o |
| @@ -92,6 +93,8 @@ obj-$(CONFIG_NLATTR) += nlattr.o | |||
| 92 | 93 | ||
| 93 | obj-$(CONFIG_DMA_API_DEBUG) += dma-debug.o | 94 | obj-$(CONFIG_DMA_API_DEBUG) += dma-debug.o |
| 94 | 95 | ||
| 96 | obj-$(CONFIG_GENERIC_CSUM) += checksum.o | ||
| 97 | |||
| 95 | hostprogs-y := gen_crc32table | 98 | hostprogs-y := gen_crc32table |
| 96 | clean-files := crc32table.h | 99 | clean-files := crc32table.h |
| 97 | 100 | ||
diff --git a/lib/checksum.c b/lib/checksum.c new file mode 100644 index 000000000000..12e5a1c91cda --- /dev/null +++ b/lib/checksum.c | |||
| @@ -0,0 +1,193 @@ | |||
| 1 | /* | ||
| 2 | * | ||
| 3 | * INET An implementation of the TCP/IP protocol suite for the LINUX | ||
| 4 | * operating system. INET is implemented using the BSD Socket | ||
| 5 | * interface as the means of communication with the user level. | ||
| 6 | * | ||
| 7 | * IP/TCP/UDP checksumming routines | ||
| 8 | * | ||
| 9 | * Authors: Jorge Cwik, <jorge@laser.satlink.net> | ||
| 10 | * Arnt Gulbrandsen, <agulbra@nvg.unit.no> | ||
| 11 | * Tom May, <ftom@netcom.com> | ||
| 12 | * Andreas Schwab, <schwab@issan.informatik.uni-dortmund.de> | ||
| 13 | * Lots of code moved from tcp.c and ip.c; see those files | ||
| 14 | * for more names. | ||
| 15 | * | ||
| 16 | * 03/02/96 Jes Sorensen, Andreas Schwab, Roman Hodek: | ||
| 17 | * Fixed some nasty bugs, causing some horrible crashes. | ||
| 18 | * A: At some points, the sum (%0) was used as | ||
| 19 | * length-counter instead of the length counter | ||
| 20 | * (%1). Thanks to Roman Hodek for pointing this out. | ||
| 21 | * B: GCC seems to mess up if one uses too many | ||
| 22 | * data-registers to hold input values and one tries to | ||
| 23 | * specify d0 and d1 as scratch registers. Letting gcc | ||
| 24 | * choose these registers itself solves the problem. | ||
| 25 | * | ||
| 26 | * This program is free software; you can redistribute it and/or | ||
| 27 | * modify it under the terms of the GNU General Public License | ||
| 28 | * as published by the Free Software Foundation; either version | ||
| 29 | * 2 of the License, or (at your option) any later version. | ||
| 30 | */ | ||
| 31 | |||
| 32 | /* Revised by Kenneth Albanowski for m68knommu. Basic problem: unaligned access | ||
| 33 | kills, so most of the assembly has to go. */ | ||
| 34 | |||
| 35 | #include <linux/module.h> | ||
| 36 | #include <net/checksum.h> | ||
| 37 | |||
| 38 | #include <asm/byteorder.h> | ||
| 39 | |||
| 40 | static inline unsigned short from32to16(unsigned long x) | ||
| 41 | { | ||
| 42 | /* add up 16-bit and 16-bit for 16+c bit */ | ||
| 43 | x = (x & 0xffff) + (x >> 16); | ||
| 44 | /* add up carry.. */ | ||
| 45 | x = (x & 0xffff) + (x >> 16); | ||
| 46 | return x; | ||
| 47 | } | ||
| 48 | |||
| 49 | static unsigned int do_csum(const unsigned char *buff, int len) | ||
| 50 | { | ||
| 51 | int odd, count; | ||
| 52 | unsigned long result = 0; | ||
| 53 | |||
| 54 | if (len <= 0) | ||
| 55 | goto out; | ||
| 56 | odd = 1 & (unsigned long) buff; | ||
| 57 | if (odd) { | ||
| 58 | result = *buff; | ||
| 59 | len--; | ||
| 60 | buff++; | ||
| 61 | } | ||
| 62 | count = len >> 1; /* nr of 16-bit words.. */ | ||
| 63 | if (count) { | ||
| 64 | if (2 & (unsigned long) buff) { | ||
| 65 | result += *(unsigned short *) buff; | ||
| 66 | count--; | ||
| 67 | len -= 2; | ||
| 68 | buff += 2; | ||
| 69 | } | ||
| 70 | count >>= 1; /* nr of 32-bit words.. */ | ||
| 71 | if (count) { | ||
| 72 | unsigned long carry = 0; | ||
| 73 | do { | ||
| 74 | unsigned long w = *(unsigned long *) buff; | ||
| 75 | count--; | ||
| 76 | buff += 4; | ||
| 77 | result += carry; | ||
| 78 | result += w; | ||
| 79 | carry = (w > result); | ||
| 80 | } while (count); | ||
| 81 | result += carry; | ||
| 82 | result = (result & 0xffff) + (result >> 16); | ||
| 83 | } | ||
| 84 | if (len & 2) { | ||
| 85 | result += *(unsigned short *) buff; | ||
| 86 | buff += 2; | ||
| 87 | } | ||
| 88 | } | ||
| 89 | if (len & 1) | ||
| 90 | result += (*buff << 8); | ||
| 91 | result = from32to16(result); | ||
| 92 | if (odd) | ||
| 93 | result = ((result >> 8) & 0xff) | ((result & 0xff) << 8); | ||
| 94 | out: | ||
| 95 | return result; | ||
| 96 | } | ||
| 97 | |||
| 98 | /* | ||
| 99 | * This is a version of ip_compute_csum() optimized for IP headers, | ||
| 100 | * which always checksum on 4 octet boundaries. | ||
| 101 | */ | ||
| 102 | __sum16 ip_fast_csum(const void *iph, unsigned int ihl) | ||
| 103 | { | ||
| 104 | return (__force __sum16)~do_csum(iph, ihl*4); | ||
| 105 | } | ||
| 106 | EXPORT_SYMBOL(ip_fast_csum); | ||
| 107 | |||
| 108 | /* | ||
| 109 | * computes the checksum of a memory block at buff, length len, | ||
| 110 | * and adds in "sum" (32-bit) | ||
| 111 | * | ||
| 112 | * returns a 32-bit number suitable for feeding into itself | ||
| 113 | * or csum_tcpudp_magic | ||
| 114 | * | ||
| 115 | * this function must be called with even lengths, except | ||
| 116 | * for the last fragment, which may be odd | ||
| 117 | * | ||
| 118 | * it's best to have buff aligned on a 32-bit boundary | ||
| 119 | */ | ||
| 120 | __wsum csum_partial(const void *buff, int len, __wsum wsum) | ||
| 121 | { | ||
| 122 | unsigned int sum = (__force unsigned int)wsum; | ||
| 123 | unsigned int result = do_csum(buff, len); | ||
| 124 | |||
| 125 | /* add in old sum, and carry.. */ | ||
| 126 | result += sum; | ||
| 127 | if (sum > result) | ||
| 128 | result += 1; | ||
| 129 | return (__force __wsum)result; | ||
| 130 | } | ||
| 131 | EXPORT_SYMBOL(csum_partial); | ||
| 132 | |||
| 133 | /* | ||
| 134 | * this routine is used for miscellaneous IP-like checksums, mainly | ||
| 135 | * in icmp.c | ||
| 136 | */ | ||
| 137 | __sum16 ip_compute_csum(const void *buff, int len) | ||
| 138 | { | ||
| 139 | return (__force __sum16)~do_csum(buff, len); | ||
| 140 | } | ||
| 141 | EXPORT_SYMBOL(ip_compute_csum); | ||
| 142 | |||
| 143 | /* | ||
| 144 | * copy from fs while checksumming, otherwise like csum_partial | ||
| 145 | */ | ||
| 146 | __wsum | ||
| 147 | csum_partial_copy_from_user(const void __user *src, void *dst, int len, | ||
| 148 | __wsum sum, int *csum_err) | ||
| 149 | { | ||
| 150 | int missing; | ||
| 151 | |||
| 152 | missing = __copy_from_user(dst, src, len); | ||
| 153 | if (missing) { | ||
| 154 | memset(dst + len - missing, 0, missing); | ||
| 155 | *csum_err = -EFAULT; | ||
| 156 | } else | ||
| 157 | *csum_err = 0; | ||
| 158 | |||
| 159 | return csum_partial(dst, len, sum); | ||
| 160 | } | ||
| 161 | EXPORT_SYMBOL(csum_partial_copy_from_user); | ||
| 162 | |||
| 163 | /* | ||
| 164 | * copy from ds while checksumming, otherwise like csum_partial | ||
| 165 | */ | ||
| 166 | __wsum | ||
| 167 | csum_partial_copy(const void *src, void *dst, int len, __wsum sum) | ||
| 168 | { | ||
| 169 | memcpy(dst, src, len); | ||
| 170 | return csum_partial(dst, len, sum); | ||
| 171 | } | ||
| 172 | EXPORT_SYMBOL(csum_partial_copy); | ||
| 173 | |||
| 174 | #ifndef csum_tcpudp_nofold | ||
| 175 | __wsum csum_tcpudp_nofold(__be32 saddr, __be32 daddr, | ||
| 176 | unsigned short len, | ||
| 177 | unsigned short proto, | ||
| 178 | __wsum sum) | ||
| 179 | { | ||
| 180 | unsigned long long s = (__force u32)sum; | ||
| 181 | |||
| 182 | s += (__force u32)saddr; | ||
| 183 | s += (__force u32)daddr; | ||
| 184 | #ifdef __BIG_ENDIAN | ||
| 185 | s += proto + len; | ||
| 186 | #else | ||
| 187 | s += (proto + len) << 8; | ||
| 188 | #endif | ||
| 189 | s += (s >> 32); | ||
| 190 | return (__force __wsum)s; | ||
| 191 | } | ||
| 192 | EXPORT_SYMBOL(csum_tcpudp_nofold); | ||
| 193 | #endif | ||
diff --git a/lib/cpumask.c b/lib/cpumask.c index 1f71b97de0f9..7bb4142a502f 100644 --- a/lib/cpumask.c +++ b/lib/cpumask.c | |||
| @@ -92,15 +92,8 @@ int cpumask_any_but(const struct cpumask *mask, unsigned int cpu) | |||
| 92 | */ | 92 | */ |
| 93 | bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) | 93 | bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) |
| 94 | { | 94 | { |
| 95 | if (likely(slab_is_available())) | 95 | *mask = kmalloc_node(cpumask_size(), flags, node); |
| 96 | *mask = kmalloc_node(cpumask_size(), flags, node); | 96 | |
| 97 | else { | ||
| 98 | #ifdef CONFIG_DEBUG_PER_CPU_MAPS | ||
| 99 | printk(KERN_ERR | ||
| 100 | "=> alloc_cpumask_var: kmalloc not available!\n"); | ||
| 101 | #endif | ||
| 102 | *mask = NULL; | ||
| 103 | } | ||
| 104 | #ifdef CONFIG_DEBUG_PER_CPU_MAPS | 97 | #ifdef CONFIG_DEBUG_PER_CPU_MAPS |
| 105 | if (!*mask) { | 98 | if (!*mask) { |
| 106 | printk(KERN_ERR "=> alloc_cpumask_var: failed!\n"); | 99 | printk(KERN_ERR "=> alloc_cpumask_var: failed!\n"); |
| @@ -119,6 +112,12 @@ bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) | |||
| 119 | } | 112 | } |
| 120 | EXPORT_SYMBOL(alloc_cpumask_var_node); | 113 | EXPORT_SYMBOL(alloc_cpumask_var_node); |
| 121 | 114 | ||
| 115 | bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) | ||
| 116 | { | ||
| 117 | return alloc_cpumask_var_node(mask, flags | __GFP_ZERO, node); | ||
| 118 | } | ||
| 119 | EXPORT_SYMBOL(zalloc_cpumask_var_node); | ||
| 120 | |||
| 122 | /** | 121 | /** |
| 123 | * alloc_cpumask_var - allocate a struct cpumask | 122 | * alloc_cpumask_var - allocate a struct cpumask |
| 124 | * @mask: pointer to cpumask_var_t where the cpumask is returned | 123 | * @mask: pointer to cpumask_var_t where the cpumask is returned |
| @@ -135,6 +134,12 @@ bool alloc_cpumask_var(cpumask_var_t *mask, gfp_t flags) | |||
| 135 | } | 134 | } |
| 136 | EXPORT_SYMBOL(alloc_cpumask_var); | 135 | EXPORT_SYMBOL(alloc_cpumask_var); |
| 137 | 136 | ||
| 137 | bool zalloc_cpumask_var(cpumask_var_t *mask, gfp_t flags) | ||
| 138 | { | ||
| 139 | return alloc_cpumask_var(mask, flags | __GFP_ZERO); | ||
| 140 | } | ||
| 141 | EXPORT_SYMBOL(zalloc_cpumask_var); | ||
| 142 | |||
| 138 | /** | 143 | /** |
| 139 | * alloc_bootmem_cpumask_var - allocate a struct cpumask from the bootmem arena. | 144 | * alloc_bootmem_cpumask_var - allocate a struct cpumask from the bootmem arena. |
| 140 | * @mask: pointer to cpumask_var_t where the cpumask is returned | 145 | * @mask: pointer to cpumask_var_t where the cpumask is returned |
diff --git a/lib/dma-debug.c b/lib/dma-debug.c index 69da09a085a1..ad65fc0317d9 100644 --- a/lib/dma-debug.c +++ b/lib/dma-debug.c | |||
| @@ -23,9 +23,11 @@ | |||
| 23 | #include <linux/dma-debug.h> | 23 | #include <linux/dma-debug.h> |
| 24 | #include <linux/spinlock.h> | 24 | #include <linux/spinlock.h> |
| 25 | #include <linux/debugfs.h> | 25 | #include <linux/debugfs.h> |
| 26 | #include <linux/uaccess.h> | ||
| 26 | #include <linux/device.h> | 27 | #include <linux/device.h> |
| 27 | #include <linux/types.h> | 28 | #include <linux/types.h> |
| 28 | #include <linux/sched.h> | 29 | #include <linux/sched.h> |
| 30 | #include <linux/ctype.h> | ||
| 29 | #include <linux/list.h> | 31 | #include <linux/list.h> |
| 30 | #include <linux/slab.h> | 32 | #include <linux/slab.h> |
| 31 | 33 | ||
| @@ -85,6 +87,7 @@ static u32 show_num_errors = 1; | |||
| 85 | 87 | ||
| 86 | static u32 num_free_entries; | 88 | static u32 num_free_entries; |
| 87 | static u32 min_free_entries; | 89 | static u32 min_free_entries; |
| 90 | static u32 nr_total_entries; | ||
| 88 | 91 | ||
| 89 | /* number of preallocated entries requested by kernel cmdline */ | 92 | /* number of preallocated entries requested by kernel cmdline */ |
| 90 | static u32 req_entries; | 93 | static u32 req_entries; |
| @@ -97,6 +100,16 @@ static struct dentry *show_all_errors_dent __read_mostly; | |||
| 97 | static struct dentry *show_num_errors_dent __read_mostly; | 100 | static struct dentry *show_num_errors_dent __read_mostly; |
| 98 | static struct dentry *num_free_entries_dent __read_mostly; | 101 | static struct dentry *num_free_entries_dent __read_mostly; |
| 99 | static struct dentry *min_free_entries_dent __read_mostly; | 102 | static struct dentry *min_free_entries_dent __read_mostly; |
| 103 | static struct dentry *filter_dent __read_mostly; | ||
| 104 | |||
| 105 | /* per-driver filter related state */ | ||
| 106 | |||
| 107 | #define NAME_MAX_LEN 64 | ||
| 108 | |||
| 109 | static char current_driver_name[NAME_MAX_LEN] __read_mostly; | ||
| 110 | static struct device_driver *current_driver __read_mostly; | ||
| 111 | |||
| 112 | static DEFINE_RWLOCK(driver_name_lock); | ||
| 100 | 113 | ||
| 101 | static const char *type2name[4] = { "single", "page", | 114 | static const char *type2name[4] = { "single", "page", |
| 102 | "scather-gather", "coherent" }; | 115 | "scather-gather", "coherent" }; |
| @@ -104,6 +117,11 @@ static const char *type2name[4] = { "single", "page", | |||
| 104 | static const char *dir2name[4] = { "DMA_BIDIRECTIONAL", "DMA_TO_DEVICE", | 117 | static const char *dir2name[4] = { "DMA_BIDIRECTIONAL", "DMA_TO_DEVICE", |
| 105 | "DMA_FROM_DEVICE", "DMA_NONE" }; | 118 | "DMA_FROM_DEVICE", "DMA_NONE" }; |
| 106 | 119 | ||
| 120 | /* little merge helper - remove it after the merge window */ | ||
| 121 | #ifndef BUS_NOTIFY_UNBOUND_DRIVER | ||
| 122 | #define BUS_NOTIFY_UNBOUND_DRIVER 0x0005 | ||
| 123 | #endif | ||
| 124 | |||
| 107 | /* | 125 | /* |
| 108 | * The access to some variables in this macro is racy. We can't use atomic_t | 126 | * The access to some variables in this macro is racy. We can't use atomic_t |
| 109 | * here because all these variables are exported to debugfs. Some of them even | 127 | * here because all these variables are exported to debugfs. Some of them even |
| @@ -121,15 +139,54 @@ static inline void dump_entry_trace(struct dma_debug_entry *entry) | |||
| 121 | { | 139 | { |
| 122 | #ifdef CONFIG_STACKTRACE | 140 | #ifdef CONFIG_STACKTRACE |
| 123 | if (entry) { | 141 | if (entry) { |
| 124 | printk(KERN_WARNING "Mapped at:\n"); | 142 | pr_warning("Mapped at:\n"); |
| 125 | print_stack_trace(&entry->stacktrace, 0); | 143 | print_stack_trace(&entry->stacktrace, 0); |
| 126 | } | 144 | } |
| 127 | #endif | 145 | #endif |
| 128 | } | 146 | } |
| 129 | 147 | ||
| 148 | static bool driver_filter(struct device *dev) | ||
| 149 | { | ||
| 150 | struct device_driver *drv; | ||
| 151 | unsigned long flags; | ||
| 152 | bool ret; | ||
| 153 | |||
| 154 | /* driver filter off */ | ||
| 155 | if (likely(!current_driver_name[0])) | ||
| 156 | return true; | ||
| 157 | |||
| 158 | /* driver filter on and initialized */ | ||
| 159 | if (current_driver && dev->driver == current_driver) | ||
| 160 | return true; | ||
| 161 | |||
| 162 | if (current_driver || !current_driver_name[0]) | ||
| 163 | return false; | ||
| 164 | |||
| 165 | /* driver filter on but not yet initialized */ | ||
| 166 | drv = get_driver(dev->driver); | ||
| 167 | if (!drv) | ||
| 168 | return false; | ||
| 169 | |||
| 170 | /* lock to protect against change of current_driver_name */ | ||
| 171 | read_lock_irqsave(&driver_name_lock, flags); | ||
| 172 | |||
| 173 | ret = false; | ||
| 174 | if (drv->name && | ||
| 175 | strncmp(current_driver_name, drv->name, NAME_MAX_LEN - 1) == 0) { | ||
| 176 | current_driver = drv; | ||
| 177 | ret = true; | ||
| 178 | } | ||
| 179 | |||
| 180 | read_unlock_irqrestore(&driver_name_lock, flags); | ||
| 181 | put_driver(drv); | ||
| 182 | |||
| 183 | return ret; | ||
| 184 | } | ||
| 185 | |||
| 130 | #define err_printk(dev, entry, format, arg...) do { \ | 186 | #define err_printk(dev, entry, format, arg...) do { \ |
| 131 | error_count += 1; \ | 187 | error_count += 1; \ |
| 132 | if (show_all_errors || show_num_errors > 0) { \ | 188 | if (driver_filter(dev) && \ |
| 189 | (show_all_errors || show_num_errors > 0)) { \ | ||
| 133 | WARN(1, "%s %s: " format, \ | 190 | WARN(1, "%s %s: " format, \ |
| 134 | dev_driver_string(dev), \ | 191 | dev_driver_string(dev), \ |
| 135 | dev_name(dev) , ## arg); \ | 192 | dev_name(dev) , ## arg); \ |
| @@ -185,15 +242,50 @@ static void put_hash_bucket(struct hash_bucket *bucket, | |||
| 185 | static struct dma_debug_entry *hash_bucket_find(struct hash_bucket *bucket, | 242 | static struct dma_debug_entry *hash_bucket_find(struct hash_bucket *bucket, |
| 186 | struct dma_debug_entry *ref) | 243 | struct dma_debug_entry *ref) |
| 187 | { | 244 | { |
| 188 | struct dma_debug_entry *entry; | 245 | struct dma_debug_entry *entry, *ret = NULL; |
| 246 | int matches = 0, match_lvl, last_lvl = 0; | ||
| 189 | 247 | ||
| 190 | list_for_each_entry(entry, &bucket->list, list) { | 248 | list_for_each_entry(entry, &bucket->list, list) { |
| 191 | if ((entry->dev_addr == ref->dev_addr) && | 249 | if ((entry->dev_addr != ref->dev_addr) || |
| 192 | (entry->dev == ref->dev)) | 250 | (entry->dev != ref->dev)) |
| 251 | continue; | ||
| 252 | |||
| 253 | /* | ||
| 254 | * Some drivers map the same physical address multiple | ||
| 255 | * times. Without a hardware IOMMU this results in the | ||
| 256 | * same device addresses being put into the dma-debug | ||
| 257 | * hash multiple times too. This can result in false | ||
| 258 | * positives being reported. Therfore we implement a | ||
| 259 | * best-fit algorithm here which returns the entry from | ||
| 260 | * the hash which fits best to the reference value | ||
| 261 | * instead of the first-fit. | ||
| 262 | */ | ||
| 263 | matches += 1; | ||
| 264 | match_lvl = 0; | ||
| 265 | entry->size == ref->size ? ++match_lvl : match_lvl; | ||
| 266 | entry->type == ref->type ? ++match_lvl : match_lvl; | ||
| 267 | entry->direction == ref->direction ? ++match_lvl : match_lvl; | ||
| 268 | |||
| 269 | if (match_lvl == 3) { | ||
| 270 | /* perfect-fit - return the result */ | ||
| 193 | return entry; | 271 | return entry; |
| 272 | } else if (match_lvl > last_lvl) { | ||
| 273 | /* | ||
| 274 | * We found an entry that fits better then the | ||
| 275 | * previous one | ||
| 276 | */ | ||
| 277 | last_lvl = match_lvl; | ||
| 278 | ret = entry; | ||
| 279 | } | ||
| 194 | } | 280 | } |
| 195 | 281 | ||
| 196 | return NULL; | 282 | /* |
| 283 | * If we have multiple matches but no perfect-fit, just return | ||
| 284 | * NULL. | ||
| 285 | */ | ||
| 286 | ret = (matches == 1) ? ret : NULL; | ||
| 287 | |||
| 288 | return ret; | ||
| 197 | } | 289 | } |
| 198 | 290 | ||
| 199 | /* | 291 | /* |
| @@ -257,6 +349,21 @@ static void add_dma_entry(struct dma_debug_entry *entry) | |||
| 257 | put_hash_bucket(bucket, &flags); | 349 | put_hash_bucket(bucket, &flags); |
| 258 | } | 350 | } |
| 259 | 351 | ||
| 352 | static struct dma_debug_entry *__dma_entry_alloc(void) | ||
| 353 | { | ||
| 354 | struct dma_debug_entry *entry; | ||
| 355 | |||
| 356 | entry = list_entry(free_entries.next, struct dma_debug_entry, list); | ||
| 357 | list_del(&entry->list); | ||
| 358 | memset(entry, 0, sizeof(*entry)); | ||
| 359 | |||
| 360 | num_free_entries -= 1; | ||
| 361 | if (num_free_entries < min_free_entries) | ||
| 362 | min_free_entries = num_free_entries; | ||
| 363 | |||
| 364 | return entry; | ||
| 365 | } | ||
| 366 | |||
| 260 | /* struct dma_entry allocator | 367 | /* struct dma_entry allocator |
| 261 | * | 368 | * |
| 262 | * The next two functions implement the allocator for | 369 | * The next two functions implement the allocator for |
| @@ -270,15 +377,12 @@ static struct dma_debug_entry *dma_entry_alloc(void) | |||
| 270 | spin_lock_irqsave(&free_entries_lock, flags); | 377 | spin_lock_irqsave(&free_entries_lock, flags); |
| 271 | 378 | ||
| 272 | if (list_empty(&free_entries)) { | 379 | if (list_empty(&free_entries)) { |
| 273 | printk(KERN_ERR "DMA-API: debugging out of memory " | 380 | pr_err("DMA-API: debugging out of memory - disabling\n"); |
| 274 | "- disabling\n"); | ||
| 275 | global_disable = true; | 381 | global_disable = true; |
| 276 | goto out; | 382 | goto out; |
| 277 | } | 383 | } |
| 278 | 384 | ||
| 279 | entry = list_entry(free_entries.next, struct dma_debug_entry, list); | 385 | entry = __dma_entry_alloc(); |
| 280 | list_del(&entry->list); | ||
| 281 | memset(entry, 0, sizeof(*entry)); | ||
| 282 | 386 | ||
| 283 | #ifdef CONFIG_STACKTRACE | 387 | #ifdef CONFIG_STACKTRACE |
| 284 | entry->stacktrace.max_entries = DMA_DEBUG_STACKTRACE_ENTRIES; | 388 | entry->stacktrace.max_entries = DMA_DEBUG_STACKTRACE_ENTRIES; |
| @@ -286,9 +390,6 @@ static struct dma_debug_entry *dma_entry_alloc(void) | |||
| 286 | entry->stacktrace.skip = 2; | 390 | entry->stacktrace.skip = 2; |
| 287 | save_stack_trace(&entry->stacktrace); | 391 | save_stack_trace(&entry->stacktrace); |
| 288 | #endif | 392 | #endif |
| 289 | num_free_entries -= 1; | ||
| 290 | if (num_free_entries < min_free_entries) | ||
| 291 | min_free_entries = num_free_entries; | ||
| 292 | 393 | ||
| 293 | out: | 394 | out: |
| 294 | spin_unlock_irqrestore(&free_entries_lock, flags); | 395 | spin_unlock_irqrestore(&free_entries_lock, flags); |
| @@ -310,6 +411,53 @@ static void dma_entry_free(struct dma_debug_entry *entry) | |||
| 310 | spin_unlock_irqrestore(&free_entries_lock, flags); | 411 | spin_unlock_irqrestore(&free_entries_lock, flags); |
| 311 | } | 412 | } |
| 312 | 413 | ||
| 414 | int dma_debug_resize_entries(u32 num_entries) | ||
| 415 | { | ||
| 416 | int i, delta, ret = 0; | ||
| 417 | unsigned long flags; | ||
| 418 | struct dma_debug_entry *entry; | ||
| 419 | LIST_HEAD(tmp); | ||
| 420 | |||
| 421 | spin_lock_irqsave(&free_entries_lock, flags); | ||
| 422 | |||
| 423 | if (nr_total_entries < num_entries) { | ||
| 424 | delta = num_entries - nr_total_entries; | ||
| 425 | |||
| 426 | spin_unlock_irqrestore(&free_entries_lock, flags); | ||
| 427 | |||
| 428 | for (i = 0; i < delta; i++) { | ||
| 429 | entry = kzalloc(sizeof(*entry), GFP_KERNEL); | ||
| 430 | if (!entry) | ||
| 431 | break; | ||
| 432 | |||
| 433 | list_add_tail(&entry->list, &tmp); | ||
| 434 | } | ||
| 435 | |||
| 436 | spin_lock_irqsave(&free_entries_lock, flags); | ||
| 437 | |||
| 438 | list_splice(&tmp, &free_entries); | ||
| 439 | nr_total_entries += i; | ||
| 440 | num_free_entries += i; | ||
| 441 | } else { | ||
| 442 | delta = nr_total_entries - num_entries; | ||
| 443 | |||
| 444 | for (i = 0; i < delta && !list_empty(&free_entries); i++) { | ||
| 445 | entry = __dma_entry_alloc(); | ||
| 446 | kfree(entry); | ||
| 447 | } | ||
| 448 | |||
| 449 | nr_total_entries -= i; | ||
| 450 | } | ||
| 451 | |||
| 452 | if (nr_total_entries != num_entries) | ||
| 453 | ret = 1; | ||
| 454 | |||
| 455 | spin_unlock_irqrestore(&free_entries_lock, flags); | ||
| 456 | |||
| 457 | return ret; | ||
| 458 | } | ||
| 459 | EXPORT_SYMBOL(dma_debug_resize_entries); | ||
| 460 | |||
| 313 | /* | 461 | /* |
| 314 | * DMA-API debugging init code | 462 | * DMA-API debugging init code |
| 315 | * | 463 | * |
| @@ -334,8 +482,7 @@ static int prealloc_memory(u32 num_entries) | |||
| 334 | num_free_entries = num_entries; | 482 | num_free_entries = num_entries; |
| 335 | min_free_entries = num_entries; | 483 | min_free_entries = num_entries; |
| 336 | 484 | ||
| 337 | printk(KERN_INFO "DMA-API: preallocated %d debug entries\n", | 485 | pr_info("DMA-API: preallocated %d debug entries\n", num_entries); |
| 338 | num_entries); | ||
| 339 | 486 | ||
| 340 | return 0; | 487 | return 0; |
| 341 | 488 | ||
| @@ -349,11 +496,102 @@ out_err: | |||
| 349 | return -ENOMEM; | 496 | return -ENOMEM; |
| 350 | } | 497 | } |
| 351 | 498 | ||
| 499 | static ssize_t filter_read(struct file *file, char __user *user_buf, | ||
| 500 | size_t count, loff_t *ppos) | ||
| 501 | { | ||
| 502 | char buf[NAME_MAX_LEN + 1]; | ||
| 503 | unsigned long flags; | ||
| 504 | int len; | ||
| 505 | |||
| 506 | if (!current_driver_name[0]) | ||
| 507 | return 0; | ||
| 508 | |||
| 509 | /* | ||
| 510 | * We can't copy to userspace directly because current_driver_name can | ||
| 511 | * only be read under the driver_name_lock with irqs disabled. So | ||
| 512 | * create a temporary copy first. | ||
| 513 | */ | ||
| 514 | read_lock_irqsave(&driver_name_lock, flags); | ||
| 515 | len = scnprintf(buf, NAME_MAX_LEN + 1, "%s\n", current_driver_name); | ||
| 516 | read_unlock_irqrestore(&driver_name_lock, flags); | ||
| 517 | |||
| 518 | return simple_read_from_buffer(user_buf, count, ppos, buf, len); | ||
| 519 | } | ||
| 520 | |||
| 521 | static ssize_t filter_write(struct file *file, const char __user *userbuf, | ||
| 522 | size_t count, loff_t *ppos) | ||
| 523 | { | ||
| 524 | char buf[NAME_MAX_LEN]; | ||
| 525 | unsigned long flags; | ||
| 526 | size_t len; | ||
| 527 | int i; | ||
| 528 | |||
| 529 | /* | ||
| 530 | * We can't copy from userspace directly. Access to | ||
| 531 | * current_driver_name is protected with a write_lock with irqs | ||
| 532 | * disabled. Since copy_from_user can fault and may sleep we | ||
| 533 | * need to copy to temporary buffer first | ||
| 534 | */ | ||
| 535 | len = min(count, (size_t)(NAME_MAX_LEN - 1)); | ||
| 536 | if (copy_from_user(buf, userbuf, len)) | ||
| 537 | return -EFAULT; | ||
| 538 | |||
| 539 | buf[len] = 0; | ||
| 540 | |||
| 541 | write_lock_irqsave(&driver_name_lock, flags); | ||
| 542 | |||
| 543 | /* | ||
| 544 | * Now handle the string we got from userspace very carefully. | ||
| 545 | * The rules are: | ||
| 546 | * - only use the first token we got | ||
| 547 | * - token delimiter is everything looking like a space | ||
| 548 | * character (' ', '\n', '\t' ...) | ||
| 549 | * | ||
| 550 | */ | ||
| 551 | if (!isalnum(buf[0])) { | ||
| 552 | /* | ||
| 553 | * If the first character userspace gave us is not | ||
| 554 | * alphanumerical then assume the filter should be | ||
| 555 | * switched off. | ||
| 556 | */ | ||
| 557 | if (current_driver_name[0]) | ||
| 558 | pr_info("DMA-API: switching off dma-debug driver filter\n"); | ||
| 559 | current_driver_name[0] = 0; | ||
| 560 | current_driver = NULL; | ||
| 561 | goto out_unlock; | ||
| 562 | } | ||
| 563 | |||
| 564 | /* | ||
| 565 | * Now parse out the first token and use it as the name for the | ||
| 566 | * driver to filter for. | ||
| 567 | */ | ||
| 568 | for (i = 0; i < NAME_MAX_LEN; ++i) { | ||
| 569 | current_driver_name[i] = buf[i]; | ||
| 570 | if (isspace(buf[i]) || buf[i] == ' ' || buf[i] == 0) | ||
| 571 | break; | ||
| 572 | } | ||
| 573 | current_driver_name[i] = 0; | ||
| 574 | current_driver = NULL; | ||
| 575 | |||
| 576 | pr_info("DMA-API: enable driver filter for driver [%s]\n", | ||
| 577 | current_driver_name); | ||
| 578 | |||
| 579 | out_unlock: | ||
| 580 | write_unlock_irqrestore(&driver_name_lock, flags); | ||
| 581 | |||
| 582 | return count; | ||
| 583 | } | ||
| 584 | |||
| 585 | const struct file_operations filter_fops = { | ||
| 586 | .read = filter_read, | ||
| 587 | .write = filter_write, | ||
| 588 | }; | ||
| 589 | |||
| 352 | static int dma_debug_fs_init(void) | 590 | static int dma_debug_fs_init(void) |
| 353 | { | 591 | { |
| 354 | dma_debug_dent = debugfs_create_dir("dma-api", NULL); | 592 | dma_debug_dent = debugfs_create_dir("dma-api", NULL); |
| 355 | if (!dma_debug_dent) { | 593 | if (!dma_debug_dent) { |
| 356 | printk(KERN_ERR "DMA-API: can not create debugfs directory\n"); | 594 | pr_err("DMA-API: can not create debugfs directory\n"); |
| 357 | return -ENOMEM; | 595 | return -ENOMEM; |
| 358 | } | 596 | } |
| 359 | 597 | ||
| @@ -392,6 +630,11 @@ static int dma_debug_fs_init(void) | |||
| 392 | if (!min_free_entries_dent) | 630 | if (!min_free_entries_dent) |
| 393 | goto out_err; | 631 | goto out_err; |
| 394 | 632 | ||
| 633 | filter_dent = debugfs_create_file("driver_filter", 0644, | ||
| 634 | dma_debug_dent, NULL, &filter_fops); | ||
| 635 | if (!filter_dent) | ||
| 636 | goto out_err; | ||
| 637 | |||
| 395 | return 0; | 638 | return 0; |
| 396 | 639 | ||
| 397 | out_err: | 640 | out_err: |
| @@ -400,9 +643,64 @@ out_err: | |||
| 400 | return -ENOMEM; | 643 | return -ENOMEM; |
| 401 | } | 644 | } |
| 402 | 645 | ||
| 646 | static int device_dma_allocations(struct device *dev) | ||
| 647 | { | ||
| 648 | struct dma_debug_entry *entry; | ||
| 649 | unsigned long flags; | ||
| 650 | int count = 0, i; | ||
| 651 | |||
| 652 | local_irq_save(flags); | ||
| 653 | |||
| 654 | for (i = 0; i < HASH_SIZE; ++i) { | ||
| 655 | spin_lock(&dma_entry_hash[i].lock); | ||
| 656 | list_for_each_entry(entry, &dma_entry_hash[i].list, list) { | ||
| 657 | if (entry->dev == dev) | ||
| 658 | count += 1; | ||
| 659 | } | ||
| 660 | spin_unlock(&dma_entry_hash[i].lock); | ||
| 661 | } | ||
| 662 | |||
| 663 | local_irq_restore(flags); | ||
| 664 | |||
| 665 | return count; | ||
| 666 | } | ||
| 667 | |||
| 668 | static int dma_debug_device_change(struct notifier_block *nb, | ||
| 669 | unsigned long action, void *data) | ||
| 670 | { | ||
| 671 | struct device *dev = data; | ||
| 672 | int count; | ||
| 673 | |||
| 674 | |||
| 675 | switch (action) { | ||
| 676 | case BUS_NOTIFY_UNBOUND_DRIVER: | ||
| 677 | count = device_dma_allocations(dev); | ||
| 678 | if (count == 0) | ||
| 679 | break; | ||
| 680 | err_printk(dev, NULL, "DMA-API: device driver has pending " | ||
| 681 | "DMA allocations while released from device " | ||
| 682 | "[count=%d]\n", count); | ||
| 683 | break; | ||
| 684 | default: | ||
| 685 | break; | ||
| 686 | } | ||
| 687 | |||
| 688 | return 0; | ||
| 689 | } | ||
| 690 | |||
| 403 | void dma_debug_add_bus(struct bus_type *bus) | 691 | void dma_debug_add_bus(struct bus_type *bus) |
| 404 | { | 692 | { |
| 405 | /* FIXME: register notifier */ | 693 | struct notifier_block *nb; |
| 694 | |||
| 695 | nb = kzalloc(sizeof(struct notifier_block), GFP_KERNEL); | ||
| 696 | if (nb == NULL) { | ||
| 697 | pr_err("dma_debug_add_bus: out of memory\n"); | ||
| 698 | return; | ||
| 699 | } | ||
| 700 | |||
| 701 | nb->notifier_call = dma_debug_device_change; | ||
| 702 | |||
| 703 | bus_register_notifier(bus, nb); | ||
| 406 | } | 704 | } |
| 407 | 705 | ||
| 408 | /* | 706 | /* |
| @@ -421,8 +719,7 @@ void dma_debug_init(u32 num_entries) | |||
| 421 | } | 719 | } |
| 422 | 720 | ||
| 423 | if (dma_debug_fs_init() != 0) { | 721 | if (dma_debug_fs_init() != 0) { |
| 424 | printk(KERN_ERR "DMA-API: error creating debugfs entries " | 722 | pr_err("DMA-API: error creating debugfs entries - disabling\n"); |
| 425 | "- disabling\n"); | ||
| 426 | global_disable = true; | 723 | global_disable = true; |
| 427 | 724 | ||
| 428 | return; | 725 | return; |
| @@ -432,14 +729,15 @@ void dma_debug_init(u32 num_entries) | |||
| 432 | num_entries = req_entries; | 729 | num_entries = req_entries; |
| 433 | 730 | ||
| 434 | if (prealloc_memory(num_entries) != 0) { | 731 | if (prealloc_memory(num_entries) != 0) { |
| 435 | printk(KERN_ERR "DMA-API: debugging out of memory error " | 732 | pr_err("DMA-API: debugging out of memory error - disabled\n"); |
| 436 | "- disabled\n"); | ||
| 437 | global_disable = true; | 733 | global_disable = true; |
| 438 | 734 | ||
| 439 | return; | 735 | return; |
| 440 | } | 736 | } |
| 441 | 737 | ||
| 442 | printk(KERN_INFO "DMA-API: debugging enabled by kernel config\n"); | 738 | nr_total_entries = num_free_entries; |
| 739 | |||
| 740 | pr_info("DMA-API: debugging enabled by kernel config\n"); | ||
| 443 | } | 741 | } |
| 444 | 742 | ||
| 445 | static __init int dma_debug_cmdline(char *str) | 743 | static __init int dma_debug_cmdline(char *str) |
| @@ -448,8 +746,7 @@ static __init int dma_debug_cmdline(char *str) | |||
| 448 | return -EINVAL; | 746 | return -EINVAL; |
| 449 | 747 | ||
| 450 | if (strncmp(str, "off", 3) == 0) { | 748 | if (strncmp(str, "off", 3) == 0) { |
| 451 | printk(KERN_INFO "DMA-API: debugging disabled on kernel " | 749 | pr_info("DMA-API: debugging disabled on kernel command line\n"); |
| 452 | "command line\n"); | ||
| 453 | global_disable = true; | 750 | global_disable = true; |
| 454 | } | 751 | } |
| 455 | 752 | ||
| @@ -723,15 +1020,15 @@ void debug_dma_map_sg(struct device *dev, struct scatterlist *sg, | |||
| 723 | entry->type = dma_debug_sg; | 1020 | entry->type = dma_debug_sg; |
| 724 | entry->dev = dev; | 1021 | entry->dev = dev; |
| 725 | entry->paddr = sg_phys(s); | 1022 | entry->paddr = sg_phys(s); |
| 726 | entry->size = s->length; | 1023 | entry->size = sg_dma_len(s); |
| 727 | entry->dev_addr = s->dma_address; | 1024 | entry->dev_addr = sg_dma_address(s); |
| 728 | entry->direction = direction; | 1025 | entry->direction = direction; |
| 729 | entry->sg_call_ents = nents; | 1026 | entry->sg_call_ents = nents; |
| 730 | entry->sg_mapped_ents = mapped_ents; | 1027 | entry->sg_mapped_ents = mapped_ents; |
| 731 | 1028 | ||
| 732 | if (!PageHighMem(sg_page(s))) { | 1029 | if (!PageHighMem(sg_page(s))) { |
| 733 | check_for_stack(dev, sg_virt(s)); | 1030 | check_for_stack(dev, sg_virt(s)); |
| 734 | check_for_illegal_area(dev, sg_virt(s), s->length); | 1031 | check_for_illegal_area(dev, sg_virt(s), sg_dma_len(s)); |
| 735 | } | 1032 | } |
| 736 | 1033 | ||
| 737 | add_dma_entry(entry); | 1034 | add_dma_entry(entry); |
| @@ -739,13 +1036,33 @@ void debug_dma_map_sg(struct device *dev, struct scatterlist *sg, | |||
| 739 | } | 1036 | } |
| 740 | EXPORT_SYMBOL(debug_dma_map_sg); | 1037 | EXPORT_SYMBOL(debug_dma_map_sg); |
| 741 | 1038 | ||
| 1039 | static int get_nr_mapped_entries(struct device *dev, struct scatterlist *s) | ||
| 1040 | { | ||
| 1041 | struct dma_debug_entry *entry, ref; | ||
| 1042 | struct hash_bucket *bucket; | ||
| 1043 | unsigned long flags; | ||
| 1044 | int mapped_ents; | ||
| 1045 | |||
| 1046 | ref.dev = dev; | ||
| 1047 | ref.dev_addr = sg_dma_address(s); | ||
| 1048 | ref.size = sg_dma_len(s), | ||
| 1049 | |||
| 1050 | bucket = get_hash_bucket(&ref, &flags); | ||
| 1051 | entry = hash_bucket_find(bucket, &ref); | ||
| 1052 | mapped_ents = 0; | ||
| 1053 | |||
| 1054 | if (entry) | ||
| 1055 | mapped_ents = entry->sg_mapped_ents; | ||
| 1056 | put_hash_bucket(bucket, &flags); | ||
| 1057 | |||
| 1058 | return mapped_ents; | ||
| 1059 | } | ||
| 1060 | |||
| 742 | void debug_dma_unmap_sg(struct device *dev, struct scatterlist *sglist, | 1061 | void debug_dma_unmap_sg(struct device *dev, struct scatterlist *sglist, |
| 743 | int nelems, int dir) | 1062 | int nelems, int dir) |
| 744 | { | 1063 | { |
| 745 | struct dma_debug_entry *entry; | ||
| 746 | struct scatterlist *s; | 1064 | struct scatterlist *s; |
| 747 | int mapped_ents = 0, i; | 1065 | int mapped_ents = 0, i; |
| 748 | unsigned long flags; | ||
| 749 | 1066 | ||
| 750 | if (unlikely(global_disable)) | 1067 | if (unlikely(global_disable)) |
| 751 | return; | 1068 | return; |
| @@ -756,8 +1073,8 @@ void debug_dma_unmap_sg(struct device *dev, struct scatterlist *sglist, | |||
| 756 | .type = dma_debug_sg, | 1073 | .type = dma_debug_sg, |
| 757 | .dev = dev, | 1074 | .dev = dev, |
| 758 | .paddr = sg_phys(s), | 1075 | .paddr = sg_phys(s), |
| 759 | .dev_addr = s->dma_address, | 1076 | .dev_addr = sg_dma_address(s), |
| 760 | .size = s->length, | 1077 | .size = sg_dma_len(s), |
| 761 | .direction = dir, | 1078 | .direction = dir, |
| 762 | .sg_call_ents = 0, | 1079 | .sg_call_ents = 0, |
| 763 | }; | 1080 | }; |
| @@ -765,14 +1082,9 @@ void debug_dma_unmap_sg(struct device *dev, struct scatterlist *sglist, | |||
| 765 | if (mapped_ents && i >= mapped_ents) | 1082 | if (mapped_ents && i >= mapped_ents) |
| 766 | break; | 1083 | break; |
| 767 | 1084 | ||
| 768 | if (mapped_ents == 0) { | 1085 | if (!i) { |
| 769 | struct hash_bucket *bucket; | ||
| 770 | ref.sg_call_ents = nelems; | 1086 | ref.sg_call_ents = nelems; |
| 771 | bucket = get_hash_bucket(&ref, &flags); | 1087 | mapped_ents = get_nr_mapped_entries(dev, s); |
| 772 | entry = hash_bucket_find(bucket, &ref); | ||
| 773 | if (entry) | ||
| 774 | mapped_ents = entry->sg_mapped_ents; | ||
| 775 | put_hash_bucket(bucket, &flags); | ||
| 776 | } | 1088 | } |
| 777 | 1089 | ||
| 778 | check_unmap(&ref); | 1090 | check_unmap(&ref); |
| @@ -874,14 +1186,20 @@ void debug_dma_sync_sg_for_cpu(struct device *dev, struct scatterlist *sg, | |||
| 874 | int nelems, int direction) | 1186 | int nelems, int direction) |
| 875 | { | 1187 | { |
| 876 | struct scatterlist *s; | 1188 | struct scatterlist *s; |
| 877 | int i; | 1189 | int mapped_ents = 0, i; |
| 878 | 1190 | ||
| 879 | if (unlikely(global_disable)) | 1191 | if (unlikely(global_disable)) |
| 880 | return; | 1192 | return; |
| 881 | 1193 | ||
| 882 | for_each_sg(sg, s, nelems, i) { | 1194 | for_each_sg(sg, s, nelems, i) { |
| 883 | check_sync(dev, s->dma_address, s->dma_length, 0, | 1195 | if (!i) |
| 884 | direction, true); | 1196 | mapped_ents = get_nr_mapped_entries(dev, s); |
| 1197 | |||
| 1198 | if (i >= mapped_ents) | ||
| 1199 | break; | ||
| 1200 | |||
| 1201 | check_sync(dev, sg_dma_address(s), sg_dma_len(s), 0, | ||
| 1202 | direction, true); | ||
| 885 | } | 1203 | } |
| 886 | } | 1204 | } |
| 887 | EXPORT_SYMBOL(debug_dma_sync_sg_for_cpu); | 1205 | EXPORT_SYMBOL(debug_dma_sync_sg_for_cpu); |
| @@ -890,15 +1208,39 @@ void debug_dma_sync_sg_for_device(struct device *dev, struct scatterlist *sg, | |||
| 890 | int nelems, int direction) | 1208 | int nelems, int direction) |
| 891 | { | 1209 | { |
| 892 | struct scatterlist *s; | 1210 | struct scatterlist *s; |
| 893 | int i; | 1211 | int mapped_ents = 0, i; |
| 894 | 1212 | ||
| 895 | if (unlikely(global_disable)) | 1213 | if (unlikely(global_disable)) |
| 896 | return; | 1214 | return; |
| 897 | 1215 | ||
| 898 | for_each_sg(sg, s, nelems, i) { | 1216 | for_each_sg(sg, s, nelems, i) { |
| 899 | check_sync(dev, s->dma_address, s->dma_length, 0, | 1217 | if (!i) |
| 900 | direction, false); | 1218 | mapped_ents = get_nr_mapped_entries(dev, s); |
| 1219 | |||
| 1220 | if (i >= mapped_ents) | ||
| 1221 | break; | ||
| 1222 | |||
| 1223 | check_sync(dev, sg_dma_address(s), sg_dma_len(s), 0, | ||
| 1224 | direction, false); | ||
| 901 | } | 1225 | } |
| 902 | } | 1226 | } |
| 903 | EXPORT_SYMBOL(debug_dma_sync_sg_for_device); | 1227 | EXPORT_SYMBOL(debug_dma_sync_sg_for_device); |
| 904 | 1228 | ||
| 1229 | static int __init dma_debug_driver_setup(char *str) | ||
| 1230 | { | ||
| 1231 | int i; | ||
| 1232 | |||
| 1233 | for (i = 0; i < NAME_MAX_LEN - 1; ++i, ++str) { | ||
| 1234 | current_driver_name[i] = *str; | ||
| 1235 | if (*str == 0) | ||
| 1236 | break; | ||
| 1237 | } | ||
| 1238 | |||
| 1239 | if (current_driver_name[0]) | ||
| 1240 | pr_info("DMA-API: enable driver filter for driver [%s]\n", | ||
| 1241 | current_driver_name); | ||
| 1242 | |||
| 1243 | |||
| 1244 | return 1; | ||
| 1245 | } | ||
| 1246 | __setup("dma_debug_driver=", dma_debug_driver_setup); | ||
diff --git a/lib/extable.c b/lib/extable.c index 179c08745595..4cac81ec225e 100644 --- a/lib/extable.c +++ b/lib/extable.c | |||
| @@ -39,7 +39,26 @@ void sort_extable(struct exception_table_entry *start, | |||
| 39 | sort(start, finish - start, sizeof(struct exception_table_entry), | 39 | sort(start, finish - start, sizeof(struct exception_table_entry), |
| 40 | cmp_ex, NULL); | 40 | cmp_ex, NULL); |
| 41 | } | 41 | } |
| 42 | #endif | 42 | |
| 43 | #ifdef CONFIG_MODULES | ||
| 44 | /* | ||
| 45 | * If the exception table is sorted, any referring to the module init | ||
| 46 | * will be at the beginning or the end. | ||
| 47 | */ | ||
| 48 | void trim_init_extable(struct module *m) | ||
| 49 | { | ||
| 50 | /*trim the beginning*/ | ||
| 51 | while (m->num_exentries && within_module_init(m->extable[0].insn, m)) { | ||
| 52 | m->extable++; | ||
| 53 | m->num_exentries--; | ||
| 54 | } | ||
| 55 | /*trim the end*/ | ||
| 56 | while (m->num_exentries && | ||
| 57 | within_module_init(m->extable[m->num_exentries-1].insn, m)) | ||
| 58 | m->num_exentries--; | ||
| 59 | } | ||
| 60 | #endif /* CONFIG_MODULES */ | ||
| 61 | #endif /* !ARCH_HAS_SORT_EXTABLE */ | ||
| 43 | 62 | ||
| 44 | #ifndef ARCH_HAS_SEARCH_EXTABLE | 63 | #ifndef ARCH_HAS_SEARCH_EXTABLE |
| 45 | /* | 64 | /* |
diff --git a/lib/rational.c b/lib/rational.c new file mode 100644 index 000000000000..b3c099b5478e --- /dev/null +++ b/lib/rational.c | |||
| @@ -0,0 +1,62 @@ | |||
| 1 | /* | ||
| 2 | * rational fractions | ||
| 3 | * | ||
| 4 | * Copyright (C) 2009 emlix GmbH, Oskar Schirmer <os@emlix.com> | ||
| 5 | * | ||
| 6 | * helper functions when coping with rational numbers | ||
| 7 | */ | ||
| 8 | |||
| 9 | #include <linux/rational.h> | ||
| 10 | |||
| 11 | /* | ||
| 12 | * calculate best rational approximation for a given fraction | ||
| 13 | * taking into account restricted register size, e.g. to find | ||
| 14 | * appropriate values for a pll with 5 bit denominator and | ||
| 15 | * 8 bit numerator register fields, trying to set up with a | ||
| 16 | * frequency ratio of 3.1415, one would say: | ||
| 17 | * | ||
| 18 | * rational_best_approximation(31415, 10000, | ||
| 19 | * (1 << 8) - 1, (1 << 5) - 1, &n, &d); | ||
| 20 | * | ||
| 21 | * you may look at given_numerator as a fixed point number, | ||
| 22 | * with the fractional part size described in given_denominator. | ||
| 23 | * | ||
| 24 | * for theoretical background, see: | ||
| 25 | * http://en.wikipedia.org/wiki/Continued_fraction | ||
| 26 | */ | ||
| 27 | |||
| 28 | void rational_best_approximation( | ||
| 29 | unsigned long given_numerator, unsigned long given_denominator, | ||
| 30 | unsigned long max_numerator, unsigned long max_denominator, | ||
| 31 | unsigned long *best_numerator, unsigned long *best_denominator) | ||
| 32 | { | ||
| 33 | unsigned long n, d, n0, d0, n1, d1; | ||
| 34 | n = given_numerator; | ||
| 35 | d = given_denominator; | ||
| 36 | n0 = d1 = 0; | ||
| 37 | n1 = d0 = 1; | ||
| 38 | for (;;) { | ||
| 39 | unsigned long t, a; | ||
| 40 | if ((n1 > max_numerator) || (d1 > max_denominator)) { | ||
| 41 | n1 = n0; | ||
| 42 | d1 = d0; | ||
| 43 | break; | ||
| 44 | } | ||
| 45 | if (d == 0) | ||
| 46 | break; | ||
| 47 | t = d; | ||
| 48 | a = n / d; | ||
| 49 | d = n % d; | ||
| 50 | n = t; | ||
| 51 | t = n0 + a * n1; | ||
| 52 | n0 = n1; | ||
| 53 | n1 = t; | ||
| 54 | t = d0 + a * d1; | ||
| 55 | d0 = d1; | ||
| 56 | d1 = t; | ||
| 57 | } | ||
| 58 | *best_numerator = n1; | ||
| 59 | *best_denominator = d1; | ||
| 60 | } | ||
| 61 | |||
| 62 | EXPORT_SYMBOL(rational_best_approximation); | ||
diff --git a/lib/swiotlb.c b/lib/swiotlb.c index 2b0b5a7d2ced..bffe6d7ef9d9 100644 --- a/lib/swiotlb.c +++ b/lib/swiotlb.c | |||
| @@ -60,8 +60,8 @@ enum dma_sync_target { | |||
| 60 | int swiotlb_force; | 60 | int swiotlb_force; |
| 61 | 61 | ||
| 62 | /* | 62 | /* |
| 63 | * Used to do a quick range check in swiotlb_unmap_single and | 63 | * Used to do a quick range check in unmap_single and |
| 64 | * swiotlb_sync_single_*, to see if the memory was in fact allocated by this | 64 | * sync_single_*, to see if the memory was in fact allocated by this |
| 65 | * API. | 65 | * API. |
| 66 | */ | 66 | */ |
| 67 | static char *io_tlb_start, *io_tlb_end; | 67 | static char *io_tlb_start, *io_tlb_end; |
| @@ -129,7 +129,7 @@ dma_addr_t __weak swiotlb_phys_to_bus(struct device *hwdev, phys_addr_t paddr) | |||
| 129 | return paddr; | 129 | return paddr; |
| 130 | } | 130 | } |
| 131 | 131 | ||
| 132 | phys_addr_t __weak swiotlb_bus_to_phys(dma_addr_t baddr) | 132 | phys_addr_t __weak swiotlb_bus_to_phys(struct device *hwdev, dma_addr_t baddr) |
| 133 | { | 133 | { |
| 134 | return baddr; | 134 | return baddr; |
| 135 | } | 135 | } |
| @@ -140,9 +140,15 @@ static dma_addr_t swiotlb_virt_to_bus(struct device *hwdev, | |||
| 140 | return swiotlb_phys_to_bus(hwdev, virt_to_phys(address)); | 140 | return swiotlb_phys_to_bus(hwdev, virt_to_phys(address)); |
| 141 | } | 141 | } |
| 142 | 142 | ||
| 143 | static void *swiotlb_bus_to_virt(dma_addr_t address) | 143 | void * __weak swiotlb_bus_to_virt(struct device *hwdev, dma_addr_t address) |
| 144 | { | 144 | { |
| 145 | return phys_to_virt(swiotlb_bus_to_phys(address)); | 145 | return phys_to_virt(swiotlb_bus_to_phys(hwdev, address)); |
| 146 | } | ||
| 147 | |||
| 148 | int __weak swiotlb_arch_address_needs_mapping(struct device *hwdev, | ||
| 149 | dma_addr_t addr, size_t size) | ||
| 150 | { | ||
| 151 | return !is_buffer_dma_capable(dma_get_mask(hwdev), addr, size); | ||
| 146 | } | 152 | } |
| 147 | 153 | ||
| 148 | int __weak swiotlb_arch_range_needs_mapping(phys_addr_t paddr, size_t size) | 154 | int __weak swiotlb_arch_range_needs_mapping(phys_addr_t paddr, size_t size) |
| @@ -309,10 +315,10 @@ cleanup1: | |||
| 309 | return -ENOMEM; | 315 | return -ENOMEM; |
| 310 | } | 316 | } |
| 311 | 317 | ||
| 312 | static int | 318 | static inline int |
| 313 | address_needs_mapping(struct device *hwdev, dma_addr_t addr, size_t size) | 319 | address_needs_mapping(struct device *hwdev, dma_addr_t addr, size_t size) |
| 314 | { | 320 | { |
| 315 | return !is_buffer_dma_capable(dma_get_mask(hwdev), addr, size); | 321 | return swiotlb_arch_address_needs_mapping(hwdev, addr, size); |
| 316 | } | 322 | } |
| 317 | 323 | ||
| 318 | static inline int range_needs_mapping(phys_addr_t paddr, size_t size) | 324 | static inline int range_needs_mapping(phys_addr_t paddr, size_t size) |
| @@ -341,7 +347,7 @@ static void swiotlb_bounce(phys_addr_t phys, char *dma_addr, size_t size, | |||
| 341 | unsigned long flags; | 347 | unsigned long flags; |
| 342 | 348 | ||
| 343 | while (size) { | 349 | while (size) { |
| 344 | sz = min(PAGE_SIZE - offset, size); | 350 | sz = min_t(size_t, PAGE_SIZE - offset, size); |
| 345 | 351 | ||
| 346 | local_irq_save(flags); | 352 | local_irq_save(flags); |
| 347 | buffer = kmap_atomic(pfn_to_page(pfn), | 353 | buffer = kmap_atomic(pfn_to_page(pfn), |
| @@ -476,7 +482,7 @@ found: | |||
| 476 | * dma_addr is the kernel virtual address of the bounce buffer to unmap. | 482 | * dma_addr is the kernel virtual address of the bounce buffer to unmap. |
| 477 | */ | 483 | */ |
| 478 | static void | 484 | static void |
| 479 | unmap_single(struct device *hwdev, char *dma_addr, size_t size, int dir) | 485 | do_unmap_single(struct device *hwdev, char *dma_addr, size_t size, int dir) |
| 480 | { | 486 | { |
| 481 | unsigned long flags; | 487 | unsigned long flags; |
| 482 | int i, count, nslots = ALIGN(size, 1 << IO_TLB_SHIFT) >> IO_TLB_SHIFT; | 488 | int i, count, nslots = ALIGN(size, 1 << IO_TLB_SHIFT) >> IO_TLB_SHIFT; |
| @@ -560,7 +566,6 @@ swiotlb_alloc_coherent(struct device *hwdev, size_t size, | |||
| 560 | size)) { | 566 | size)) { |
| 561 | /* | 567 | /* |
| 562 | * The allocated memory isn't reachable by the device. | 568 | * The allocated memory isn't reachable by the device. |
| 563 | * Fall back on swiotlb_map_single(). | ||
| 564 | */ | 569 | */ |
| 565 | free_pages((unsigned long) ret, order); | 570 | free_pages((unsigned long) ret, order); |
| 566 | ret = NULL; | 571 | ret = NULL; |
| @@ -568,9 +573,8 @@ swiotlb_alloc_coherent(struct device *hwdev, size_t size, | |||
| 568 | if (!ret) { | 573 | if (!ret) { |
| 569 | /* | 574 | /* |
| 570 | * We are either out of memory or the device can't DMA | 575 | * We are either out of memory or the device can't DMA |
| 571 | * to GFP_DMA memory; fall back on | 576 | * to GFP_DMA memory; fall back on map_single(), which |
| 572 | * swiotlb_map_single(), which will grab memory from | 577 | * will grab memory from the lowest available address range. |
| 573 | * the lowest available address range. | ||
| 574 | */ | 578 | */ |
| 575 | ret = map_single(hwdev, 0, size, DMA_FROM_DEVICE); | 579 | ret = map_single(hwdev, 0, size, DMA_FROM_DEVICE); |
| 576 | if (!ret) | 580 | if (!ret) |
| @@ -587,7 +591,7 @@ swiotlb_alloc_coherent(struct device *hwdev, size_t size, | |||
| 587 | (unsigned long long)dev_addr); | 591 | (unsigned long long)dev_addr); |
| 588 | 592 | ||
| 589 | /* DMA_TO_DEVICE to avoid memcpy in unmap_single */ | 593 | /* DMA_TO_DEVICE to avoid memcpy in unmap_single */ |
| 590 | unmap_single(hwdev, ret, size, DMA_TO_DEVICE); | 594 | do_unmap_single(hwdev, ret, size, DMA_TO_DEVICE); |
| 591 | return NULL; | 595 | return NULL; |
| 592 | } | 596 | } |
| 593 | *dma_handle = dev_addr; | 597 | *dma_handle = dev_addr; |
| @@ -604,7 +608,7 @@ swiotlb_free_coherent(struct device *hwdev, size_t size, void *vaddr, | |||
| 604 | free_pages((unsigned long) vaddr, get_order(size)); | 608 | free_pages((unsigned long) vaddr, get_order(size)); |
| 605 | else | 609 | else |
| 606 | /* DMA_TO_DEVICE to avoid memcpy in unmap_single */ | 610 | /* DMA_TO_DEVICE to avoid memcpy in unmap_single */ |
| 607 | unmap_single(hwdev, vaddr, size, DMA_TO_DEVICE); | 611 | do_unmap_single(hwdev, vaddr, size, DMA_TO_DEVICE); |
| 608 | } | 612 | } |
| 609 | EXPORT_SYMBOL(swiotlb_free_coherent); | 613 | EXPORT_SYMBOL(swiotlb_free_coherent); |
| 610 | 614 | ||
| @@ -634,7 +638,7 @@ swiotlb_full(struct device *dev, size_t size, int dir, int do_panic) | |||
| 634 | * physical address to use is returned. | 638 | * physical address to use is returned. |
| 635 | * | 639 | * |
| 636 | * Once the device is given the dma address, the device owns this memory until | 640 | * Once the device is given the dma address, the device owns this memory until |
| 637 | * either swiotlb_unmap_single or swiotlb_dma_sync_single is performed. | 641 | * either swiotlb_unmap_page or swiotlb_dma_sync_single is performed. |
| 638 | */ | 642 | */ |
| 639 | dma_addr_t swiotlb_map_page(struct device *dev, struct page *page, | 643 | dma_addr_t swiotlb_map_page(struct device *dev, struct page *page, |
| 640 | unsigned long offset, size_t size, | 644 | unsigned long offset, size_t size, |
| @@ -642,18 +646,17 @@ dma_addr_t swiotlb_map_page(struct device *dev, struct page *page, | |||
| 642 | struct dma_attrs *attrs) | 646 | struct dma_attrs *attrs) |
| 643 | { | 647 | { |
| 644 | phys_addr_t phys = page_to_phys(page) + offset; | 648 | phys_addr_t phys = page_to_phys(page) + offset; |
| 645 | void *ptr = page_address(page) + offset; | ||
| 646 | dma_addr_t dev_addr = swiotlb_phys_to_bus(dev, phys); | 649 | dma_addr_t dev_addr = swiotlb_phys_to_bus(dev, phys); |
| 647 | void *map; | 650 | void *map; |
| 648 | 651 | ||
| 649 | BUG_ON(dir == DMA_NONE); | 652 | BUG_ON(dir == DMA_NONE); |
| 650 | /* | 653 | /* |
| 651 | * If the pointer passed in happens to be in the device's DMA window, | 654 | * If the address happens to be in the device's DMA window, |
| 652 | * we can safely return the device addr and not worry about bounce | 655 | * we can safely return the device addr and not worry about bounce |
| 653 | * buffering it. | 656 | * buffering it. |
| 654 | */ | 657 | */ |
| 655 | if (!address_needs_mapping(dev, dev_addr, size) && | 658 | if (!address_needs_mapping(dev, dev_addr, size) && |
| 656 | !range_needs_mapping(virt_to_phys(ptr), size)) | 659 | !range_needs_mapping(phys, size)) |
| 657 | return dev_addr; | 660 | return dev_addr; |
| 658 | 661 | ||
| 659 | /* | 662 | /* |
| @@ -679,23 +682,35 @@ EXPORT_SYMBOL_GPL(swiotlb_map_page); | |||
| 679 | 682 | ||
| 680 | /* | 683 | /* |
| 681 | * Unmap a single streaming mode DMA translation. The dma_addr and size must | 684 | * Unmap a single streaming mode DMA translation. The dma_addr and size must |
| 682 | * match what was provided for in a previous swiotlb_map_single call. All | 685 | * match what was provided for in a previous swiotlb_map_page call. All |
| 683 | * other usages are undefined. | 686 | * other usages are undefined. |
| 684 | * | 687 | * |
| 685 | * After this call, reads by the cpu to the buffer are guaranteed to see | 688 | * After this call, reads by the cpu to the buffer are guaranteed to see |
| 686 | * whatever the device wrote there. | 689 | * whatever the device wrote there. |
| 687 | */ | 690 | */ |
| 691 | static void unmap_single(struct device *hwdev, dma_addr_t dev_addr, | ||
| 692 | size_t size, int dir) | ||
| 693 | { | ||
| 694 | char *dma_addr = swiotlb_bus_to_virt(hwdev, dev_addr); | ||
| 695 | |||
| 696 | BUG_ON(dir == DMA_NONE); | ||
| 697 | |||
| 698 | if (is_swiotlb_buffer(dma_addr)) { | ||
| 699 | do_unmap_single(hwdev, dma_addr, size, dir); | ||
| 700 | return; | ||
| 701 | } | ||
| 702 | |||
| 703 | if (dir != DMA_FROM_DEVICE) | ||
| 704 | return; | ||
| 705 | |||
| 706 | dma_mark_clean(dma_addr, size); | ||
| 707 | } | ||
| 708 | |||
| 688 | void swiotlb_unmap_page(struct device *hwdev, dma_addr_t dev_addr, | 709 | void swiotlb_unmap_page(struct device *hwdev, dma_addr_t dev_addr, |
| 689 | size_t size, enum dma_data_direction dir, | 710 | size_t size, enum dma_data_direction dir, |
| 690 | struct dma_attrs *attrs) | 711 | struct dma_attrs *attrs) |
| 691 | { | 712 | { |
| 692 | char *dma_addr = swiotlb_bus_to_virt(dev_addr); | 713 | unmap_single(hwdev, dev_addr, size, dir); |
| 693 | |||
| 694 | BUG_ON(dir == DMA_NONE); | ||
| 695 | if (is_swiotlb_buffer(dma_addr)) | ||
| 696 | unmap_single(hwdev, dma_addr, size, dir); | ||
| 697 | else if (dir == DMA_FROM_DEVICE) | ||
| 698 | dma_mark_clean(dma_addr, size); | ||
| 699 | } | 714 | } |
| 700 | EXPORT_SYMBOL_GPL(swiotlb_unmap_page); | 715 | EXPORT_SYMBOL_GPL(swiotlb_unmap_page); |
| 701 | 716 | ||
| @@ -703,7 +718,7 @@ EXPORT_SYMBOL_GPL(swiotlb_unmap_page); | |||
| 703 | * Make physical memory consistent for a single streaming mode DMA translation | 718 | * Make physical memory consistent for a single streaming mode DMA translation |
| 704 | * after a transfer. | 719 | * after a transfer. |
| 705 | * | 720 | * |
| 706 | * If you perform a swiotlb_map_single() but wish to interrogate the buffer | 721 | * If you perform a swiotlb_map_page() but wish to interrogate the buffer |
| 707 | * using the cpu, yet do not wish to teardown the dma mapping, you must | 722 | * using the cpu, yet do not wish to teardown the dma mapping, you must |
| 708 | * call this function before doing so. At the next point you give the dma | 723 | * call this function before doing so. At the next point you give the dma |
| 709 | * address back to the card, you must first perform a | 724 | * address back to the card, you must first perform a |
| @@ -713,13 +728,19 @@ static void | |||
| 713 | swiotlb_sync_single(struct device *hwdev, dma_addr_t dev_addr, | 728 | swiotlb_sync_single(struct device *hwdev, dma_addr_t dev_addr, |
| 714 | size_t size, int dir, int target) | 729 | size_t size, int dir, int target) |
| 715 | { | 730 | { |
| 716 | char *dma_addr = swiotlb_bus_to_virt(dev_addr); | 731 | char *dma_addr = swiotlb_bus_to_virt(hwdev, dev_addr); |
| 717 | 732 | ||
| 718 | BUG_ON(dir == DMA_NONE); | 733 | BUG_ON(dir == DMA_NONE); |
| 719 | if (is_swiotlb_buffer(dma_addr)) | 734 | |
| 735 | if (is_swiotlb_buffer(dma_addr)) { | ||
| 720 | sync_single(hwdev, dma_addr, size, dir, target); | 736 | sync_single(hwdev, dma_addr, size, dir, target); |
| 721 | else if (dir == DMA_FROM_DEVICE) | 737 | return; |
| 722 | dma_mark_clean(dma_addr, size); | 738 | } |
| 739 | |||
| 740 | if (dir != DMA_FROM_DEVICE) | ||
| 741 | return; | ||
| 742 | |||
| 743 | dma_mark_clean(dma_addr, size); | ||
| 723 | } | 744 | } |
| 724 | 745 | ||
| 725 | void | 746 | void |
| @@ -746,13 +767,7 @@ swiotlb_sync_single_range(struct device *hwdev, dma_addr_t dev_addr, | |||
| 746 | unsigned long offset, size_t size, | 767 | unsigned long offset, size_t size, |
| 747 | int dir, int target) | 768 | int dir, int target) |
| 748 | { | 769 | { |
| 749 | char *dma_addr = swiotlb_bus_to_virt(dev_addr) + offset; | 770 | swiotlb_sync_single(hwdev, dev_addr + offset, size, dir, target); |
| 750 | |||
| 751 | BUG_ON(dir == DMA_NONE); | ||
| 752 | if (is_swiotlb_buffer(dma_addr)) | ||
| 753 | sync_single(hwdev, dma_addr, size, dir, target); | ||
| 754 | else if (dir == DMA_FROM_DEVICE) | ||
| 755 | dma_mark_clean(dma_addr, size); | ||
| 756 | } | 771 | } |
| 757 | 772 | ||
| 758 | void | 773 | void |
| @@ -777,7 +792,7 @@ EXPORT_SYMBOL_GPL(swiotlb_sync_single_range_for_device); | |||
| 777 | 792 | ||
| 778 | /* | 793 | /* |
| 779 | * Map a set of buffers described by scatterlist in streaming mode for DMA. | 794 | * Map a set of buffers described by scatterlist in streaming mode for DMA. |
| 780 | * This is the scatter-gather version of the above swiotlb_map_single | 795 | * This is the scatter-gather version of the above swiotlb_map_page |
| 781 | * interface. Here the scatter gather list elements are each tagged with the | 796 | * interface. Here the scatter gather list elements are each tagged with the |
| 782 | * appropriate dma address and length. They are obtained via | 797 | * appropriate dma address and length. They are obtained via |
| 783 | * sg_dma_{address,length}(SG). | 798 | * sg_dma_{address,length}(SG). |
| @@ -788,7 +803,7 @@ EXPORT_SYMBOL_GPL(swiotlb_sync_single_range_for_device); | |||
| 788 | * The routine returns the number of addr/length pairs actually | 803 | * The routine returns the number of addr/length pairs actually |
| 789 | * used, at most nents. | 804 | * used, at most nents. |
| 790 | * | 805 | * |
| 791 | * Device ownership issues as mentioned above for swiotlb_map_single are the | 806 | * Device ownership issues as mentioned above for swiotlb_map_page are the |
| 792 | * same here. | 807 | * same here. |
| 793 | */ | 808 | */ |
| 794 | int | 809 | int |
| @@ -836,7 +851,7 @@ EXPORT_SYMBOL(swiotlb_map_sg); | |||
| 836 | 851 | ||
| 837 | /* | 852 | /* |
| 838 | * Unmap a set of streaming mode DMA translations. Again, cpu read rules | 853 | * Unmap a set of streaming mode DMA translations. Again, cpu read rules |
| 839 | * concerning calls here are the same as for swiotlb_unmap_single() above. | 854 | * concerning calls here are the same as for swiotlb_unmap_page() above. |
| 840 | */ | 855 | */ |
| 841 | void | 856 | void |
| 842 | swiotlb_unmap_sg_attrs(struct device *hwdev, struct scatterlist *sgl, | 857 | swiotlb_unmap_sg_attrs(struct device *hwdev, struct scatterlist *sgl, |
| @@ -847,13 +862,9 @@ swiotlb_unmap_sg_attrs(struct device *hwdev, struct scatterlist *sgl, | |||
| 847 | 862 | ||
| 848 | BUG_ON(dir == DMA_NONE); | 863 | BUG_ON(dir == DMA_NONE); |
| 849 | 864 | ||
| 850 | for_each_sg(sgl, sg, nelems, i) { | 865 | for_each_sg(sgl, sg, nelems, i) |
| 851 | if (sg->dma_address != swiotlb_phys_to_bus(hwdev, sg_phys(sg))) | 866 | unmap_single(hwdev, sg->dma_address, sg->dma_length, dir); |
| 852 | unmap_single(hwdev, swiotlb_bus_to_virt(sg->dma_address), | 867 | |
| 853 | sg->dma_length, dir); | ||
| 854 | else if (dir == DMA_FROM_DEVICE) | ||
| 855 | dma_mark_clean(swiotlb_bus_to_virt(sg->dma_address), sg->dma_length); | ||
| 856 | } | ||
| 857 | } | 868 | } |
| 858 | EXPORT_SYMBOL(swiotlb_unmap_sg_attrs); | 869 | EXPORT_SYMBOL(swiotlb_unmap_sg_attrs); |
| 859 | 870 | ||
| @@ -879,15 +890,9 @@ swiotlb_sync_sg(struct device *hwdev, struct scatterlist *sgl, | |||
| 879 | struct scatterlist *sg; | 890 | struct scatterlist *sg; |
| 880 | int i; | 891 | int i; |
| 881 | 892 | ||
| 882 | BUG_ON(dir == DMA_NONE); | 893 | for_each_sg(sgl, sg, nelems, i) |
| 883 | 894 | swiotlb_sync_single(hwdev, sg->dma_address, | |
| 884 | for_each_sg(sgl, sg, nelems, i) { | ||
| 885 | if (sg->dma_address != swiotlb_phys_to_bus(hwdev, sg_phys(sg))) | ||
| 886 | sync_single(hwdev, swiotlb_bus_to_virt(sg->dma_address), | ||
| 887 | sg->dma_length, dir, target); | 895 | sg->dma_length, dir, target); |
| 888 | else if (dir == DMA_FROM_DEVICE) | ||
| 889 | dma_mark_clean(swiotlb_bus_to_virt(sg->dma_address), sg->dma_length); | ||
| 890 | } | ||
| 891 | } | 896 | } |
| 892 | 897 | ||
| 893 | void | 898 | void |
diff --git a/lib/vsprintf.c b/lib/vsprintf.c index 7536acea135b..756ccafa9cec 100644 --- a/lib/vsprintf.c +++ b/lib/vsprintf.c | |||
| @@ -408,6 +408,8 @@ enum format_type { | |||
| 408 | FORMAT_TYPE_LONG_LONG, | 408 | FORMAT_TYPE_LONG_LONG, |
| 409 | FORMAT_TYPE_ULONG, | 409 | FORMAT_TYPE_ULONG, |
| 410 | FORMAT_TYPE_LONG, | 410 | FORMAT_TYPE_LONG, |
| 411 | FORMAT_TYPE_UBYTE, | ||
| 412 | FORMAT_TYPE_BYTE, | ||
| 411 | FORMAT_TYPE_USHORT, | 413 | FORMAT_TYPE_USHORT, |
| 412 | FORMAT_TYPE_SHORT, | 414 | FORMAT_TYPE_SHORT, |
| 413 | FORMAT_TYPE_UINT, | 415 | FORMAT_TYPE_UINT, |
| @@ -573,12 +575,15 @@ static char *string(char *buf, char *end, char *s, struct printf_spec spec) | |||
| 573 | } | 575 | } |
| 574 | 576 | ||
| 575 | static char *symbol_string(char *buf, char *end, void *ptr, | 577 | static char *symbol_string(char *buf, char *end, void *ptr, |
| 576 | struct printf_spec spec) | 578 | struct printf_spec spec, char ext) |
| 577 | { | 579 | { |
| 578 | unsigned long value = (unsigned long) ptr; | 580 | unsigned long value = (unsigned long) ptr; |
| 579 | #ifdef CONFIG_KALLSYMS | 581 | #ifdef CONFIG_KALLSYMS |
| 580 | char sym[KSYM_SYMBOL_LEN]; | 582 | char sym[KSYM_SYMBOL_LEN]; |
| 581 | sprint_symbol(sym, value); | 583 | if (ext != 'f') |
| 584 | sprint_symbol(sym, value); | ||
| 585 | else | ||
| 586 | kallsyms_lookup(value, NULL, NULL, NULL, sym); | ||
| 582 | return string(buf, end, sym, spec); | 587 | return string(buf, end, sym, spec); |
| 583 | #else | 588 | #else |
| 584 | spec.field_width = 2*sizeof(void *); | 589 | spec.field_width = 2*sizeof(void *); |
| @@ -690,7 +695,8 @@ static char *ip4_addr_string(char *buf, char *end, u8 *addr, | |||
| 690 | * | 695 | * |
| 691 | * Right now we handle: | 696 | * Right now we handle: |
| 692 | * | 697 | * |
| 693 | * - 'F' For symbolic function descriptor pointers | 698 | * - 'F' For symbolic function descriptor pointers with offset |
| 699 | * - 'f' For simple symbolic function names without offset | ||
| 694 | * - 'S' For symbolic direct pointers | 700 | * - 'S' For symbolic direct pointers |
| 695 | * - 'R' For a struct resource pointer, it prints the range of | 701 | * - 'R' For a struct resource pointer, it prints the range of |
| 696 | * addresses (not the name nor the flags) | 702 | * addresses (not the name nor the flags) |
| @@ -713,10 +719,11 @@ static char *pointer(const char *fmt, char *buf, char *end, void *ptr, | |||
| 713 | 719 | ||
| 714 | switch (*fmt) { | 720 | switch (*fmt) { |
| 715 | case 'F': | 721 | case 'F': |
| 722 | case 'f': | ||
| 716 | ptr = dereference_function_descriptor(ptr); | 723 | ptr = dereference_function_descriptor(ptr); |
| 717 | /* Fallthrough */ | 724 | /* Fallthrough */ |
| 718 | case 'S': | 725 | case 'S': |
| 719 | return symbol_string(buf, end, ptr, spec); | 726 | return symbol_string(buf, end, ptr, spec, *fmt); |
| 720 | case 'R': | 727 | case 'R': |
| 721 | return resource_string(buf, end, ptr, spec); | 728 | return resource_string(buf, end, ptr, spec); |
| 722 | case 'm': | 729 | case 'm': |
| @@ -853,11 +860,15 @@ qualifier: | |||
| 853 | spec->qualifier = -1; | 860 | spec->qualifier = -1; |
| 854 | if (*fmt == 'h' || *fmt == 'l' || *fmt == 'L' || | 861 | if (*fmt == 'h' || *fmt == 'l' || *fmt == 'L' || |
| 855 | *fmt == 'Z' || *fmt == 'z' || *fmt == 't') { | 862 | *fmt == 'Z' || *fmt == 'z' || *fmt == 't') { |
| 856 | spec->qualifier = *fmt; | 863 | spec->qualifier = *fmt++; |
| 857 | ++fmt; | 864 | if (unlikely(spec->qualifier == *fmt)) { |
| 858 | if (spec->qualifier == 'l' && *fmt == 'l') { | 865 | if (spec->qualifier == 'l') { |
| 859 | spec->qualifier = 'L'; | 866 | spec->qualifier = 'L'; |
| 860 | ++fmt; | 867 | ++fmt; |
| 868 | } else if (spec->qualifier == 'h') { | ||
| 869 | spec->qualifier = 'H'; | ||
| 870 | ++fmt; | ||
| 871 | } | ||
| 861 | } | 872 | } |
| 862 | } | 873 | } |
| 863 | 874 | ||
| @@ -919,6 +930,11 @@ qualifier: | |||
| 919 | spec->type = FORMAT_TYPE_SIZE_T; | 930 | spec->type = FORMAT_TYPE_SIZE_T; |
| 920 | } else if (spec->qualifier == 't') { | 931 | } else if (spec->qualifier == 't') { |
| 921 | spec->type = FORMAT_TYPE_PTRDIFF; | 932 | spec->type = FORMAT_TYPE_PTRDIFF; |
| 933 | } else if (spec->qualifier == 'H') { | ||
| 934 | if (spec->flags & SIGN) | ||
| 935 | spec->type = FORMAT_TYPE_BYTE; | ||
| 936 | else | ||
| 937 | spec->type = FORMAT_TYPE_UBYTE; | ||
| 922 | } else if (spec->qualifier == 'h') { | 938 | } else if (spec->qualifier == 'h') { |
| 923 | if (spec->flags & SIGN) | 939 | if (spec->flags & SIGN) |
| 924 | spec->type = FORMAT_TYPE_SHORT; | 940 | spec->type = FORMAT_TYPE_SHORT; |
| @@ -943,7 +959,8 @@ qualifier: | |||
| 943 | * | 959 | * |
| 944 | * This function follows C99 vsnprintf, but has some extensions: | 960 | * This function follows C99 vsnprintf, but has some extensions: |
| 945 | * %pS output the name of a text symbol | 961 | * %pS output the name of a text symbol |
| 946 | * %pF output the name of a function pointer | 962 | * %pF output the name of a function pointer with its offset |
| 963 | * %pf output the name of a function pointer without its offset | ||
| 947 | * %pR output the address range in a struct resource | 964 | * %pR output the address range in a struct resource |
| 948 | * | 965 | * |
| 949 | * The return value is the number of characters which would | 966 | * The return value is the number of characters which would |
| @@ -1087,6 +1104,12 @@ int vsnprintf(char *buf, size_t size, const char *fmt, va_list args) | |||
| 1087 | case FORMAT_TYPE_PTRDIFF: | 1104 | case FORMAT_TYPE_PTRDIFF: |
| 1088 | num = va_arg(args, ptrdiff_t); | 1105 | num = va_arg(args, ptrdiff_t); |
| 1089 | break; | 1106 | break; |
| 1107 | case FORMAT_TYPE_UBYTE: | ||
| 1108 | num = (unsigned char) va_arg(args, int); | ||
| 1109 | break; | ||
| 1110 | case FORMAT_TYPE_BYTE: | ||
| 1111 | num = (signed char) va_arg(args, int); | ||
| 1112 | break; | ||
| 1090 | case FORMAT_TYPE_USHORT: | 1113 | case FORMAT_TYPE_USHORT: |
| 1091 | num = (unsigned short) va_arg(args, int); | 1114 | num = (unsigned short) va_arg(args, int); |
| 1092 | break; | 1115 | break; |
| @@ -1363,6 +1386,10 @@ do { \ | |||
| 1363 | case FORMAT_TYPE_PTRDIFF: | 1386 | case FORMAT_TYPE_PTRDIFF: |
| 1364 | save_arg(ptrdiff_t); | 1387 | save_arg(ptrdiff_t); |
| 1365 | break; | 1388 | break; |
| 1389 | case FORMAT_TYPE_UBYTE: | ||
| 1390 | case FORMAT_TYPE_BYTE: | ||
| 1391 | save_arg(char); | ||
| 1392 | break; | ||
| 1366 | case FORMAT_TYPE_USHORT: | 1393 | case FORMAT_TYPE_USHORT: |
| 1367 | case FORMAT_TYPE_SHORT: | 1394 | case FORMAT_TYPE_SHORT: |
| 1368 | save_arg(short); | 1395 | save_arg(short); |
| @@ -1391,7 +1418,8 @@ EXPORT_SYMBOL_GPL(vbin_printf); | |||
| 1391 | * | 1418 | * |
| 1392 | * The format follows C99 vsnprintf, but has some extensions: | 1419 | * The format follows C99 vsnprintf, but has some extensions: |
| 1393 | * %pS output the name of a text symbol | 1420 | * %pS output the name of a text symbol |
| 1394 | * %pF output the name of a function pointer | 1421 | * %pF output the name of a function pointer with its offset |
| 1422 | * %pf output the name of a function pointer without its offset | ||
| 1395 | * %pR output the address range in a struct resource | 1423 | * %pR output the address range in a struct resource |
| 1396 | * %n is ignored | 1424 | * %n is ignored |
| 1397 | * | 1425 | * |
| @@ -1538,6 +1566,12 @@ int bstr_printf(char *buf, size_t size, const char *fmt, const u32 *bin_buf) | |||
| 1538 | case FORMAT_TYPE_PTRDIFF: | 1566 | case FORMAT_TYPE_PTRDIFF: |
| 1539 | num = get_arg(ptrdiff_t); | 1567 | num = get_arg(ptrdiff_t); |
| 1540 | break; | 1568 | break; |
| 1569 | case FORMAT_TYPE_UBYTE: | ||
| 1570 | num = get_arg(unsigned char); | ||
| 1571 | break; | ||
| 1572 | case FORMAT_TYPE_BYTE: | ||
| 1573 | num = get_arg(signed char); | ||
| 1574 | break; | ||
| 1541 | case FORMAT_TYPE_USHORT: | 1575 | case FORMAT_TYPE_USHORT: |
| 1542 | num = get_arg(unsigned short); | 1576 | num = get_arg(unsigned short); |
| 1543 | break; | 1577 | break; |
