2009-01-09 04:19:52 -07:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2008 Advanced Micro Devices, Inc.
|
|
|
|
*
|
|
|
|
* Author: Joerg Roedel <joerg.roedel@amd.com>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License version 2 as published
|
|
|
|
* by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*/
|
|
|
|
|
2009-01-09 06:19:54 -07:00
|
|
|
#include <linux/scatterlist.h>
|
2009-01-09 06:10:26 -07:00
|
|
|
#include <linux/dma-mapping.h>
|
2009-01-19 08:52:39 -07:00
|
|
|
#include <linux/stacktrace.h>
|
2009-01-09 04:19:52 -07:00
|
|
|
#include <linux/dma-debug.h>
|
2009-01-09 04:34:49 -07:00
|
|
|
#include <linux/spinlock.h>
|
2009-01-09 05:13:27 -07:00
|
|
|
#include <linux/debugfs.h>
|
2009-05-22 13:23:13 -06:00
|
|
|
#include <linux/uaccess.h>
|
2011-07-01 14:23:59 -06:00
|
|
|
#include <linux/export.h>
|
2009-01-09 06:10:26 -07:00
|
|
|
#include <linux/device.h>
|
2009-01-09 04:19:52 -07:00
|
|
|
#include <linux/types.h>
|
2009-01-09 06:10:26 -07:00
|
|
|
#include <linux/sched.h>
|
2009-05-22 13:23:13 -06:00
|
|
|
#include <linux/ctype.h>
|
2009-01-09 04:19:52 -07:00
|
|
|
#include <linux/list.h>
|
2009-01-09 04:54:42 -07:00
|
|
|
#include <linux/slab.h>
|
2009-01-09 04:19:52 -07:00
|
|
|
|
2009-03-16 09:51:55 -06:00
|
|
|
#include <asm/sections.h>
|
|
|
|
|
2009-01-09 04:34:49 -07:00
|
|
|
#define HASH_SIZE 1024ULL
|
|
|
|
#define HASH_FN_SHIFT 13
|
|
|
|
#define HASH_FN_MASK (HASH_SIZE - 1)
|
|
|
|
|
2009-01-09 04:19:52 -07:00
|
|
|
enum {
|
|
|
|
dma_debug_single,
|
|
|
|
dma_debug_page,
|
|
|
|
dma_debug_sg,
|
|
|
|
dma_debug_coherent,
|
|
|
|
};
|
|
|
|
|
2012-10-08 11:08:06 -06:00
|
|
|
enum map_err_types {
|
|
|
|
MAP_ERR_CHECK_NOT_APPLICABLE,
|
|
|
|
MAP_ERR_NOT_CHECKED,
|
|
|
|
MAP_ERR_CHECKED,
|
|
|
|
};
|
|
|
|
|
2009-01-19 08:52:39 -07:00
|
|
|
#define DMA_DEBUG_STACKTRACE_ENTRIES 5
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
/**
|
|
|
|
* struct dma_debug_entry - track a dma_map* or dma_alloc_coherent mapping
|
|
|
|
* @list: node on pre-allocated free_entries list
|
|
|
|
* @dev: 'dev' argument to dma_map_{page|single|sg} or dma_alloc_coherent
|
|
|
|
* @type: single, page, sg, coherent
|
|
|
|
* @pfn: page frame of the start address
|
|
|
|
* @offset: offset of mapping relative to pfn
|
|
|
|
* @size: length of the mapping
|
|
|
|
* @direction: enum dma_data_direction
|
|
|
|
* @sg_call_ents: 'nents' from dma_map_sg
|
|
|
|
* @sg_mapped_ents: 'mapped_ents' from dma_map_sg
|
|
|
|
* @map_err_type: track whether dma_mapping_error() was checked
|
|
|
|
* @stacktrace: support backtraces when a violation is detected
|
|
|
|
*/
|
2009-01-09 04:19:52 -07:00
|
|
|
struct dma_debug_entry {
|
|
|
|
struct list_head list;
|
|
|
|
struct device *dev;
|
|
|
|
int type;
|
2014-01-21 16:48:12 -07:00
|
|
|
unsigned long pfn;
|
|
|
|
size_t offset;
|
2009-01-09 04:19:52 -07:00
|
|
|
u64 dev_addr;
|
|
|
|
u64 size;
|
|
|
|
int direction;
|
|
|
|
int sg_call_ents;
|
|
|
|
int sg_mapped_ents;
|
2012-10-08 11:08:06 -06:00
|
|
|
enum map_err_types map_err_type;
|
2009-01-19 08:52:39 -07:00
|
|
|
#ifdef CONFIG_STACKTRACE
|
|
|
|
struct stack_trace stacktrace;
|
|
|
|
unsigned long st_entries[DMA_DEBUG_STACKTRACE_ENTRIES];
|
|
|
|
#endif
|
2009-01-09 04:19:52 -07:00
|
|
|
};
|
|
|
|
|
2011-08-08 13:13:54 -06:00
|
|
|
typedef bool (*match_fn)(struct dma_debug_entry *, struct dma_debug_entry *);
|
|
|
|
|
2009-01-09 04:34:49 -07:00
|
|
|
struct hash_bucket {
|
|
|
|
struct list_head list;
|
|
|
|
spinlock_t lock;
|
2009-01-09 06:10:26 -07:00
|
|
|
} ____cacheline_aligned_in_smp;
|
2009-01-09 04:34:49 -07:00
|
|
|
|
|
|
|
/* Hash list to save the allocated dma addresses */
|
|
|
|
static struct hash_bucket dma_entry_hash[HASH_SIZE];
|
2009-01-09 04:42:46 -07:00
|
|
|
/* List of pre-allocated dma_debug_entry's */
|
|
|
|
static LIST_HEAD(free_entries);
|
|
|
|
/* Lock for the list above */
|
|
|
|
static DEFINE_SPINLOCK(free_entries_lock);
|
|
|
|
|
|
|
|
/* Global disable flag - will be set in case of an error */
|
2012-06-27 03:08:55 -06:00
|
|
|
static u32 global_disable __read_mostly;
|
2009-01-09 04:42:46 -07:00
|
|
|
|
2009-01-09 05:13:27 -07:00
|
|
|
/* Global error count */
|
|
|
|
static u32 error_count;
|
|
|
|
|
|
|
|
/* Global error show enable*/
|
|
|
|
static u32 show_all_errors __read_mostly;
|
|
|
|
/* Number of errors to show */
|
|
|
|
static u32 show_num_errors = 1;
|
|
|
|
|
2009-01-09 04:42:46 -07:00
|
|
|
static u32 num_free_entries;
|
|
|
|
static u32 min_free_entries;
|
2009-04-15 03:22:41 -06:00
|
|
|
static u32 nr_total_entries;
|
2009-01-09 04:34:49 -07:00
|
|
|
|
2009-01-09 05:01:56 -07:00
|
|
|
/* number of preallocated entries requested by kernel cmdline */
|
|
|
|
static u32 req_entries;
|
|
|
|
|
2009-01-09 05:13:27 -07:00
|
|
|
/* debugfs dentry's for the stuff above */
|
|
|
|
static struct dentry *dma_debug_dent __read_mostly;
|
|
|
|
static struct dentry *global_disable_dent __read_mostly;
|
|
|
|
static struct dentry *error_count_dent __read_mostly;
|
|
|
|
static struct dentry *show_all_errors_dent __read_mostly;
|
|
|
|
static struct dentry *show_num_errors_dent __read_mostly;
|
|
|
|
static struct dentry *num_free_entries_dent __read_mostly;
|
|
|
|
static struct dentry *min_free_entries_dent __read_mostly;
|
2009-05-22 13:23:13 -06:00
|
|
|
static struct dentry *filter_dent __read_mostly;
|
2009-01-09 05:13:27 -07:00
|
|
|
|
2009-05-22 10:24:20 -06:00
|
|
|
/* per-driver filter related state */
|
|
|
|
|
|
|
|
#define NAME_MAX_LEN 64
|
|
|
|
|
|
|
|
static char current_driver_name[NAME_MAX_LEN] __read_mostly;
|
|
|
|
static struct device_driver *current_driver __read_mostly;
|
|
|
|
|
|
|
|
static DEFINE_RWLOCK(driver_name_lock);
|
2009-01-09 05:13:27 -07:00
|
|
|
|
2012-10-08 11:08:06 -06:00
|
|
|
static const char *const maperr2str[] = {
|
|
|
|
[MAP_ERR_CHECK_NOT_APPLICABLE] = "dma map error check not applicable",
|
|
|
|
[MAP_ERR_NOT_CHECKED] = "dma map error not checked",
|
|
|
|
[MAP_ERR_CHECKED] = "dma map error checked",
|
|
|
|
};
|
|
|
|
|
2009-01-09 06:10:26 -07:00
|
|
|
static const char *type2name[4] = { "single", "page",
|
|
|
|
"scather-gather", "coherent" };
|
|
|
|
|
|
|
|
static const char *dir2name[4] = { "DMA_BIDIRECTIONAL", "DMA_TO_DEVICE",
|
|
|
|
"DMA_FROM_DEVICE", "DMA_NONE" };
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The access to some variables in this macro is racy. We can't use atomic_t
|
|
|
|
* here because all these variables are exported to debugfs. Some of them even
|
|
|
|
* writeable. This is also the reason why a lock won't help much. But anyway,
|
|
|
|
* the races are no big deal. Here is why:
|
|
|
|
*
|
|
|
|
* error_count: the addition is racy, but the worst thing that can happen is
|
|
|
|
* that we don't count some errors
|
|
|
|
* show_num_errors: the subtraction is racy. Also no big deal because in
|
|
|
|
* worst case this will result in one warning more in the
|
|
|
|
* system log than the user configured. This variable is
|
|
|
|
* writeable via debugfs.
|
|
|
|
*/
|
2009-01-19 08:52:39 -07:00
|
|
|
static inline void dump_entry_trace(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_STACKTRACE
|
|
|
|
if (entry) {
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_warning("Mapped at:\n");
|
2009-01-19 08:52:39 -07:00
|
|
|
print_stack_trace(&entry->stacktrace, 0);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2009-05-22 10:24:20 -06:00
|
|
|
static bool driver_filter(struct device *dev)
|
|
|
|
{
|
2009-06-08 07:53:46 -06:00
|
|
|
struct device_driver *drv;
|
|
|
|
unsigned long flags;
|
|
|
|
bool ret;
|
|
|
|
|
2009-05-22 10:24:20 -06:00
|
|
|
/* driver filter off */
|
|
|
|
if (likely(!current_driver_name[0]))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
/* driver filter on and initialized */
|
2009-08-19 19:17:08 -06:00
|
|
|
if (current_driver && dev && dev->driver == current_driver)
|
2009-05-22 10:24:20 -06:00
|
|
|
return true;
|
|
|
|
|
2009-08-19 19:17:08 -06:00
|
|
|
/* driver filter on, but we can't filter on a NULL device... */
|
|
|
|
if (!dev)
|
|
|
|
return false;
|
|
|
|
|
2009-06-08 07:53:46 -06:00
|
|
|
if (current_driver || !current_driver_name[0])
|
|
|
|
return false;
|
2009-05-22 10:24:20 -06:00
|
|
|
|
2009-06-08 07:53:46 -06:00
|
|
|
/* driver filter on but not yet initialized */
|
2012-01-24 11:35:24 -07:00
|
|
|
drv = dev->driver;
|
2009-06-08 07:53:46 -06:00
|
|
|
if (!drv)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
/* lock to protect against change of current_driver_name */
|
|
|
|
read_lock_irqsave(&driver_name_lock, flags);
|
|
|
|
|
|
|
|
ret = false;
|
|
|
|
if (drv->name &&
|
|
|
|
strncmp(current_driver_name, drv->name, NAME_MAX_LEN - 1) == 0) {
|
|
|
|
current_driver = drv;
|
|
|
|
ret = true;
|
2009-05-22 10:24:20 -06:00
|
|
|
}
|
|
|
|
|
2009-06-08 07:53:46 -06:00
|
|
|
read_unlock_irqrestore(&driver_name_lock, flags);
|
|
|
|
|
|
|
|
return ret;
|
2009-05-22 10:24:20 -06:00
|
|
|
}
|
|
|
|
|
2009-08-19 19:17:08 -06:00
|
|
|
#define err_printk(dev, entry, format, arg...) do { \
|
|
|
|
error_count += 1; \
|
|
|
|
if (driver_filter(dev) && \
|
|
|
|
(show_all_errors || show_num_errors > 0)) { \
|
|
|
|
WARN(1, "%s %s: " format, \
|
|
|
|
dev ? dev_driver_string(dev) : "NULL", \
|
|
|
|
dev ? dev_name(dev) : "NULL", ## arg); \
|
|
|
|
dump_entry_trace(entry); \
|
|
|
|
} \
|
|
|
|
if (!show_all_errors && show_num_errors > 0) \
|
|
|
|
show_num_errors -= 1; \
|
2009-01-09 06:10:26 -07:00
|
|
|
} while (0);
|
|
|
|
|
2009-01-09 04:34:49 -07:00
|
|
|
/*
|
|
|
|
* Hash related functions
|
|
|
|
*
|
|
|
|
* Every DMA-API request is saved into a struct dma_debug_entry. To
|
|
|
|
* have quick access to these structs they are stored into a hash.
|
|
|
|
*/
|
|
|
|
static int hash_fn(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Hash function is based on the dma address.
|
|
|
|
* We use bits 20-27 here as the index into the hash
|
|
|
|
*/
|
|
|
|
return (entry->dev_addr >> HASH_FN_SHIFT) & HASH_FN_MASK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Request exclusive access to a hash bucket for a given dma_debug_entry.
|
|
|
|
*/
|
|
|
|
static struct hash_bucket *get_hash_bucket(struct dma_debug_entry *entry,
|
|
|
|
unsigned long *flags)
|
|
|
|
{
|
|
|
|
int idx = hash_fn(entry);
|
|
|
|
unsigned long __flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&dma_entry_hash[idx].lock, __flags);
|
|
|
|
*flags = __flags;
|
|
|
|
return &dma_entry_hash[idx];
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Give up exclusive access to the hash bucket
|
|
|
|
*/
|
|
|
|
static void put_hash_bucket(struct hash_bucket *bucket,
|
|
|
|
unsigned long *flags)
|
|
|
|
{
|
|
|
|
unsigned long __flags = *flags;
|
|
|
|
|
|
|
|
spin_unlock_irqrestore(&bucket->lock, __flags);
|
|
|
|
}
|
|
|
|
|
2011-08-08 13:13:54 -06:00
|
|
|
static bool exact_match(struct dma_debug_entry *a, struct dma_debug_entry *b)
|
|
|
|
{
|
2011-11-17 12:31:02 -07:00
|
|
|
return ((a->dev_addr == b->dev_addr) &&
|
2011-08-08 13:13:54 -06:00
|
|
|
(a->dev == b->dev)) ? true : false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool containing_match(struct dma_debug_entry *a,
|
|
|
|
struct dma_debug_entry *b)
|
|
|
|
{
|
|
|
|
if (a->dev != b->dev)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if ((b->dev_addr <= a->dev_addr) &&
|
|
|
|
((b->dev_addr + b->size) >= (a->dev_addr + a->size)))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-01-09 04:34:49 -07:00
|
|
|
/*
|
|
|
|
* Search a given entry in the hash bucket list
|
|
|
|
*/
|
2011-08-08 13:13:54 -06:00
|
|
|
static struct dma_debug_entry *__hash_bucket_find(struct hash_bucket *bucket,
|
|
|
|
struct dma_debug_entry *ref,
|
|
|
|
match_fn match)
|
2009-01-09 04:34:49 -07:00
|
|
|
{
|
2009-06-05 04:01:35 -06:00
|
|
|
struct dma_debug_entry *entry, *ret = NULL;
|
2012-10-19 14:57:01 -06:00
|
|
|
int matches = 0, match_lvl, last_lvl = -1;
|
2009-01-09 04:34:49 -07:00
|
|
|
|
|
|
|
list_for_each_entry(entry, &bucket->list, list) {
|
2011-08-08 13:13:54 -06:00
|
|
|
if (!match(ref, entry))
|
2009-06-05 04:01:35 -06:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Some drivers map the same physical address multiple
|
|
|
|
* times. Without a hardware IOMMU this results in the
|
|
|
|
* same device addresses being put into the dma-debug
|
|
|
|
* hash multiple times too. This can result in false
|
tree-wide: fix assorted typos all over the place
That is "success", "unknown", "through", "performance", "[re|un]mapping"
, "access", "default", "reasonable", "[con]currently", "temperature"
, "channel", "[un]used", "application", "example","hierarchy", "therefore"
, "[over|under]flow", "contiguous", "threshold", "enough" and others.
Signed-off-by: André Goddard Rosa <andre.goddard@gmail.com>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
2009-11-14 08:09:05 -07:00
|
|
|
* positives being reported. Therefore we implement a
|
2009-06-05 04:01:35 -06:00
|
|
|
* best-fit algorithm here which returns the entry from
|
|
|
|
* the hash which fits best to the reference value
|
|
|
|
* instead of the first-fit.
|
|
|
|
*/
|
|
|
|
matches += 1;
|
|
|
|
match_lvl = 0;
|
2009-06-11 02:03:42 -06:00
|
|
|
entry->size == ref->size ? ++match_lvl : 0;
|
|
|
|
entry->type == ref->type ? ++match_lvl : 0;
|
|
|
|
entry->direction == ref->direction ? ++match_lvl : 0;
|
|
|
|
entry->sg_call_ents == ref->sg_call_ents ? ++match_lvl : 0;
|
2009-06-05 04:01:35 -06:00
|
|
|
|
2009-06-11 02:03:42 -06:00
|
|
|
if (match_lvl == 4) {
|
2009-06-05 04:01:35 -06:00
|
|
|
/* perfect-fit - return the result */
|
2009-01-09 04:34:49 -07:00
|
|
|
return entry;
|
2009-06-05 04:01:35 -06:00
|
|
|
} else if (match_lvl > last_lvl) {
|
|
|
|
/*
|
|
|
|
* We found an entry that fits better then the
|
2012-10-19 14:57:01 -06:00
|
|
|
* previous one or it is the 1st match.
|
2009-06-05 04:01:35 -06:00
|
|
|
*/
|
|
|
|
last_lvl = match_lvl;
|
|
|
|
ret = entry;
|
|
|
|
}
|
2009-01-09 04:34:49 -07:00
|
|
|
}
|
|
|
|
|
2009-06-05 04:01:35 -06:00
|
|
|
/*
|
|
|
|
* If we have multiple matches but no perfect-fit, just return
|
|
|
|
* NULL.
|
|
|
|
*/
|
|
|
|
ret = (matches == 1) ? ret : NULL;
|
|
|
|
|
|
|
|
return ret;
|
2009-01-09 04:34:49 -07:00
|
|
|
}
|
|
|
|
|
2011-08-08 13:13:54 -06:00
|
|
|
static struct dma_debug_entry *bucket_find_exact(struct hash_bucket *bucket,
|
|
|
|
struct dma_debug_entry *ref)
|
|
|
|
{
|
|
|
|
return __hash_bucket_find(bucket, ref, exact_match);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct dma_debug_entry *bucket_find_contain(struct hash_bucket **bucket,
|
|
|
|
struct dma_debug_entry *ref,
|
|
|
|
unsigned long *flags)
|
|
|
|
{
|
|
|
|
|
|
|
|
unsigned int max_range = dma_get_max_seg_size(ref->dev);
|
|
|
|
struct dma_debug_entry *entry, index = *ref;
|
|
|
|
unsigned int range = 0;
|
|
|
|
|
|
|
|
while (range <= max_range) {
|
|
|
|
entry = __hash_bucket_find(*bucket, &index, containing_match);
|
|
|
|
|
|
|
|
if (entry)
|
|
|
|
return entry;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Nothing found, go back a hash bucket
|
|
|
|
*/
|
|
|
|
put_hash_bucket(*bucket, flags);
|
|
|
|
range += (1 << HASH_FN_SHIFT);
|
|
|
|
index.dev_addr -= (1 << HASH_FN_SHIFT);
|
|
|
|
*bucket = get_hash_bucket(&index, flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2009-01-09 04:34:49 -07:00
|
|
|
/*
|
|
|
|
* Add an entry to a hash bucket
|
|
|
|
*/
|
|
|
|
static void hash_bucket_add(struct hash_bucket *bucket,
|
|
|
|
struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
list_add_tail(&entry->list, &bucket->list);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Remove entry from a hash bucket list
|
|
|
|
*/
|
|
|
|
static void hash_bucket_del(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
list_del(&entry->list);
|
|
|
|
}
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
static unsigned long long phys_addr(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
return page_to_phys(pfn_to_page(entry->pfn)) + entry->offset;
|
|
|
|
}
|
|
|
|
|
2009-02-12 08:19:13 -07:00
|
|
|
/*
|
|
|
|
* Dump mapping entries for debugging purposes
|
|
|
|
*/
|
|
|
|
void debug_dma_dump_mappings(struct device *dev)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
|
|
|
|
for (idx = 0; idx < HASH_SIZE; idx++) {
|
|
|
|
struct hash_bucket *bucket = &dma_entry_hash[idx];
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&bucket->lock, flags);
|
|
|
|
|
|
|
|
list_for_each_entry(entry, &bucket->list, list) {
|
|
|
|
if (!dev || dev == entry->dev) {
|
|
|
|
dev_info(entry->dev,
|
2014-01-21 16:48:12 -07:00
|
|
|
"%s idx %d P=%Lx N=%lx D=%Lx L=%Lx %s %s\n",
|
2009-02-12 08:19:13 -07:00
|
|
|
type2name[entry->type], idx,
|
2014-01-21 16:48:12 -07:00
|
|
|
phys_addr(entry), entry->pfn,
|
2009-02-12 08:19:13 -07:00
|
|
|
entry->dev_addr, entry->size,
|
2012-10-08 11:08:06 -06:00
|
|
|
dir2name[entry->direction],
|
|
|
|
maperr2str[entry->map_err_type]);
|
2009-02-12 08:19:13 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
spin_unlock_irqrestore(&bucket->lock, flags);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_dump_mappings);
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
/*
|
|
|
|
* For each page mapped (initial page in the case of
|
|
|
|
* dma_alloc_coherent/dma_map_{single|page}, or each page in a
|
|
|
|
* scatterlist) insert into this tree using the pfn as the key. At
|
|
|
|
* dma_unmap_{single|sg|page} or dma_free_coherent delete the entry. If
|
|
|
|
* the pfn already exists at insertion time add a tag as a reference
|
|
|
|
* count for the overlapping mappings. For now, the overlap tracking
|
|
|
|
* just ensures that 'unmaps' balance 'maps' before marking the pfn
|
|
|
|
* idle, but we should also be flagging overlaps as an API violation.
|
|
|
|
*
|
|
|
|
* Memory usage is mostly constrained by the maximum number of available
|
|
|
|
* dma-debug entries in that we need a free dma_debug_entry before
|
|
|
|
* inserting into the tree. In the case of dma_map_{single|page} and
|
|
|
|
* dma_alloc_coherent there is only one dma_debug_entry and one pfn to
|
|
|
|
* track per event. dma_map_sg(), on the other hand,
|
|
|
|
* consumes a single dma_debug_entry, but inserts 'nents' entries into
|
|
|
|
* the tree.
|
|
|
|
*
|
|
|
|
* At any time debug_dma_assert_idle() can be called to trigger a
|
|
|
|
* warning if the given page is in the active set.
|
|
|
|
*/
|
|
|
|
static RADIX_TREE(dma_active_pfn, GFP_NOWAIT);
|
|
|
|
static DEFINE_SPINLOCK(radix_lock);
|
|
|
|
#define ACTIVE_PFN_MAX_OVERLAP ((1 << RADIX_TREE_MAX_TAGS) - 1)
|
|
|
|
|
|
|
|
static int active_pfn_read_overlap(unsigned long pfn)
|
|
|
|
{
|
|
|
|
int overlap = 0, i;
|
|
|
|
|
|
|
|
for (i = RADIX_TREE_MAX_TAGS - 1; i >= 0; i--)
|
|
|
|
if (radix_tree_tag_get(&dma_active_pfn, pfn, i))
|
|
|
|
overlap |= 1 << i;
|
|
|
|
return overlap;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int active_pfn_set_overlap(unsigned long pfn, int overlap)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (overlap > ACTIVE_PFN_MAX_OVERLAP || overlap < 0)
|
2014-01-29 15:05:53 -07:00
|
|
|
return overlap;
|
2014-01-21 16:48:12 -07:00
|
|
|
|
|
|
|
for (i = RADIX_TREE_MAX_TAGS - 1; i >= 0; i--)
|
|
|
|
if (overlap & 1 << i)
|
|
|
|
radix_tree_tag_set(&dma_active_pfn, pfn, i);
|
|
|
|
else
|
|
|
|
radix_tree_tag_clear(&dma_active_pfn, pfn, i);
|
|
|
|
|
|
|
|
return overlap;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void active_pfn_inc_overlap(unsigned long pfn)
|
|
|
|
{
|
|
|
|
int overlap = active_pfn_read_overlap(pfn);
|
|
|
|
|
|
|
|
overlap = active_pfn_set_overlap(pfn, ++overlap);
|
|
|
|
|
|
|
|
/* If we overflowed the overlap counter then we're potentially
|
|
|
|
* leaking dma-mappings. Otherwise, if maps and unmaps are
|
|
|
|
* balanced then this overflow may cause false negatives in
|
|
|
|
* debug_dma_assert_idle() as the pfn may be marked idle
|
|
|
|
* prematurely.
|
|
|
|
*/
|
2014-01-29 15:05:53 -07:00
|
|
|
WARN_ONCE(overlap > ACTIVE_PFN_MAX_OVERLAP,
|
2014-01-21 16:48:12 -07:00
|
|
|
"DMA-API: exceeded %d overlapping mappings of pfn %lx\n",
|
|
|
|
ACTIVE_PFN_MAX_OVERLAP, pfn);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int active_pfn_dec_overlap(unsigned long pfn)
|
|
|
|
{
|
|
|
|
int overlap = active_pfn_read_overlap(pfn);
|
|
|
|
|
|
|
|
return active_pfn_set_overlap(pfn, --overlap);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int active_pfn_insert(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
int rc;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&radix_lock, flags);
|
|
|
|
rc = radix_tree_insert(&dma_active_pfn, entry->pfn, entry);
|
|
|
|
if (rc == -EEXIST)
|
|
|
|
active_pfn_inc_overlap(entry->pfn);
|
|
|
|
spin_unlock_irqrestore(&radix_lock, flags);
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void active_pfn_remove(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&radix_lock, flags);
|
2014-01-29 15:05:53 -07:00
|
|
|
/* since we are counting overlaps the final put of the
|
|
|
|
* entry->pfn will occur when the overlap count is 0.
|
|
|
|
* active_pfn_dec_overlap() returns -1 in that case
|
|
|
|
*/
|
|
|
|
if (active_pfn_dec_overlap(entry->pfn) < 0)
|
2014-01-21 16:48:12 -07:00
|
|
|
radix_tree_delete(&dma_active_pfn, entry->pfn);
|
|
|
|
spin_unlock_irqrestore(&radix_lock, flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* debug_dma_assert_idle() - assert that a page is not undergoing dma
|
|
|
|
* @page: page to lookup in the dma_active_pfn tree
|
|
|
|
*
|
|
|
|
* Place a call to this routine in cases where the cpu touching the page
|
|
|
|
* before the dma completes (page is dma_unmapped) will lead to data
|
|
|
|
* corruption.
|
|
|
|
*/
|
|
|
|
void debug_dma_assert_idle(struct page *page)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
|
|
|
|
if (!page)
|
|
|
|
return;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&radix_lock, flags);
|
|
|
|
entry = radix_tree_lookup(&dma_active_pfn, page_to_pfn(page));
|
|
|
|
spin_unlock_irqrestore(&radix_lock, flags);
|
|
|
|
|
|
|
|
if (!entry)
|
|
|
|
return;
|
|
|
|
|
|
|
|
err_printk(entry->dev, entry,
|
|
|
|
"DMA-API: cpu touching an active dma mapped page "
|
|
|
|
"[pfn=0x%lx]\n", entry->pfn);
|
|
|
|
}
|
|
|
|
|
2009-01-09 04:34:49 -07:00
|
|
|
/*
|
|
|
|
* Wrapper function for adding an entry to the hash.
|
|
|
|
* This function takes care of locking itself.
|
|
|
|
*/
|
|
|
|
static void add_dma_entry(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
struct hash_bucket *bucket;
|
|
|
|
unsigned long flags;
|
2014-01-21 16:48:12 -07:00
|
|
|
int rc;
|
2009-01-09 04:34:49 -07:00
|
|
|
|
|
|
|
bucket = get_hash_bucket(entry, &flags);
|
|
|
|
hash_bucket_add(bucket, entry);
|
|
|
|
put_hash_bucket(bucket, &flags);
|
2014-01-21 16:48:12 -07:00
|
|
|
|
|
|
|
rc = active_pfn_insert(entry);
|
|
|
|
if (rc == -ENOMEM) {
|
|
|
|
pr_err("DMA-API: pfn tracking ENOMEM, dma-debug disabled\n");
|
|
|
|
global_disable = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* TODO: report -EEXIST errors here as overlapping mappings are
|
|
|
|
* not supported by the DMA API
|
|
|
|
*/
|
2009-01-09 04:34:49 -07:00
|
|
|
}
|
|
|
|
|
2009-04-15 03:22:41 -06:00
|
|
|
static struct dma_debug_entry *__dma_entry_alloc(void)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
|
|
|
|
entry = list_entry(free_entries.next, struct dma_debug_entry, list);
|
|
|
|
list_del(&entry->list);
|
|
|
|
memset(entry, 0, sizeof(*entry));
|
|
|
|
|
|
|
|
num_free_entries -= 1;
|
|
|
|
if (num_free_entries < min_free_entries)
|
|
|
|
min_free_entries = num_free_entries;
|
|
|
|
|
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
2009-01-09 04:42:46 -07:00
|
|
|
/* struct dma_entry allocator
|
|
|
|
*
|
|
|
|
* The next two functions implement the allocator for
|
|
|
|
* struct dma_debug_entries.
|
|
|
|
*/
|
|
|
|
static struct dma_debug_entry *dma_entry_alloc(void)
|
|
|
|
{
|
2012-04-03 19:19:10 -06:00
|
|
|
struct dma_debug_entry *entry;
|
2009-01-09 04:42:46 -07:00
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&free_entries_lock, flags);
|
|
|
|
|
|
|
|
if (list_empty(&free_entries)) {
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_err("DMA-API: debugging out of memory - disabling\n");
|
2009-01-09 04:42:46 -07:00
|
|
|
global_disable = true;
|
2012-04-03 19:19:10 -06:00
|
|
|
spin_unlock_irqrestore(&free_entries_lock, flags);
|
|
|
|
return NULL;
|
2009-01-09 04:42:46 -07:00
|
|
|
}
|
|
|
|
|
2009-04-15 03:22:41 -06:00
|
|
|
entry = __dma_entry_alloc();
|
2009-01-09 04:42:46 -07:00
|
|
|
|
2012-04-03 19:19:10 -06:00
|
|
|
spin_unlock_irqrestore(&free_entries_lock, flags);
|
|
|
|
|
2009-01-19 08:52:39 -07:00
|
|
|
#ifdef CONFIG_STACKTRACE
|
|
|
|
entry->stacktrace.max_entries = DMA_DEBUG_STACKTRACE_ENTRIES;
|
|
|
|
entry->stacktrace.entries = entry->st_entries;
|
|
|
|
entry->stacktrace.skip = 2;
|
|
|
|
save_stack_trace(&entry->stacktrace);
|
|
|
|
#endif
|
2009-01-09 04:42:46 -07:00
|
|
|
|
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void dma_entry_free(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
active_pfn_remove(entry);
|
|
|
|
|
2009-01-09 04:42:46 -07:00
|
|
|
/*
|
|
|
|
* add to beginning of the list - this way the entries are
|
|
|
|
* more likely cache hot when they are reallocated.
|
|
|
|
*/
|
|
|
|
spin_lock_irqsave(&free_entries_lock, flags);
|
|
|
|
list_add(&entry->list, &free_entries);
|
|
|
|
num_free_entries += 1;
|
|
|
|
spin_unlock_irqrestore(&free_entries_lock, flags);
|
|
|
|
}
|
|
|
|
|
2009-04-15 03:22:41 -06:00
|
|
|
int dma_debug_resize_entries(u32 num_entries)
|
|
|
|
{
|
|
|
|
int i, delta, ret = 0;
|
|
|
|
unsigned long flags;
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
LIST_HEAD(tmp);
|
|
|
|
|
|
|
|
spin_lock_irqsave(&free_entries_lock, flags);
|
|
|
|
|
|
|
|
if (nr_total_entries < num_entries) {
|
|
|
|
delta = num_entries - nr_total_entries;
|
|
|
|
|
|
|
|
spin_unlock_irqrestore(&free_entries_lock, flags);
|
|
|
|
|
|
|
|
for (i = 0; i < delta; i++) {
|
|
|
|
entry = kzalloc(sizeof(*entry), GFP_KERNEL);
|
|
|
|
if (!entry)
|
|
|
|
break;
|
|
|
|
|
|
|
|
list_add_tail(&entry->list, &tmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
spin_lock_irqsave(&free_entries_lock, flags);
|
|
|
|
|
|
|
|
list_splice(&tmp, &free_entries);
|
|
|
|
nr_total_entries += i;
|
|
|
|
num_free_entries += i;
|
|
|
|
} else {
|
|
|
|
delta = nr_total_entries - num_entries;
|
|
|
|
|
|
|
|
for (i = 0; i < delta && !list_empty(&free_entries); i++) {
|
|
|
|
entry = __dma_entry_alloc();
|
|
|
|
kfree(entry);
|
|
|
|
}
|
|
|
|
|
|
|
|
nr_total_entries -= i;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nr_total_entries != num_entries)
|
|
|
|
ret = 1;
|
|
|
|
|
|
|
|
spin_unlock_irqrestore(&free_entries_lock, flags);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(dma_debug_resize_entries);
|
|
|
|
|
2009-01-09 04:54:42 -07:00
|
|
|
/*
|
|
|
|
* DMA-API debugging init code
|
|
|
|
*
|
|
|
|
* The init code does two things:
|
|
|
|
* 1. Initialize core data structures
|
|
|
|
* 2. Preallocate a given number of dma_debug_entry structs
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int prealloc_memory(u32 num_entries)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry, *next_entry;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < num_entries; ++i) {
|
|
|
|
entry = kzalloc(sizeof(*entry), GFP_KERNEL);
|
|
|
|
if (!entry)
|
|
|
|
goto out_err;
|
|
|
|
|
|
|
|
list_add_tail(&entry->list, &free_entries);
|
|
|
|
}
|
|
|
|
|
|
|
|
num_free_entries = num_entries;
|
|
|
|
min_free_entries = num_entries;
|
|
|
|
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_info("DMA-API: preallocated %d debug entries\n", num_entries);
|
2009-01-09 04:54:42 -07:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
out_err:
|
|
|
|
|
|
|
|
list_for_each_entry_safe(entry, next_entry, &free_entries, list) {
|
|
|
|
list_del(&entry->list);
|
|
|
|
kfree(entry);
|
|
|
|
}
|
|
|
|
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2009-05-22 13:23:13 -06:00
|
|
|
static ssize_t filter_read(struct file *file, char __user *user_buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
char buf[NAME_MAX_LEN + 1];
|
2009-06-08 07:19:29 -06:00
|
|
|
unsigned long flags;
|
2009-05-22 13:23:13 -06:00
|
|
|
int len;
|
|
|
|
|
|
|
|
if (!current_driver_name[0])
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We can't copy to userspace directly because current_driver_name can
|
|
|
|
* only be read under the driver_name_lock with irqs disabled. So
|
|
|
|
* create a temporary copy first.
|
|
|
|
*/
|
|
|
|
read_lock_irqsave(&driver_name_lock, flags);
|
|
|
|
len = scnprintf(buf, NAME_MAX_LEN + 1, "%s\n", current_driver_name);
|
|
|
|
read_unlock_irqrestore(&driver_name_lock, flags);
|
|
|
|
|
|
|
|
return simple_read_from_buffer(user_buf, count, ppos, buf, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t filter_write(struct file *file, const char __user *userbuf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
char buf[NAME_MAX_LEN];
|
2009-06-08 07:19:29 -06:00
|
|
|
unsigned long flags;
|
|
|
|
size_t len;
|
2009-05-22 13:23:13 -06:00
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We can't copy from userspace directly. Access to
|
|
|
|
* current_driver_name is protected with a write_lock with irqs
|
|
|
|
* disabled. Since copy_from_user can fault and may sleep we
|
|
|
|
* need to copy to temporary buffer first
|
|
|
|
*/
|
2009-06-08 07:39:24 -06:00
|
|
|
len = min(count, (size_t)(NAME_MAX_LEN - 1));
|
2009-05-22 13:23:13 -06:00
|
|
|
if (copy_from_user(buf, userbuf, len))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
buf[len] = 0;
|
|
|
|
|
|
|
|
write_lock_irqsave(&driver_name_lock, flags);
|
|
|
|
|
2009-06-08 07:07:08 -06:00
|
|
|
/*
|
|
|
|
* Now handle the string we got from userspace very carefully.
|
2009-05-22 13:23:13 -06:00
|
|
|
* The rules are:
|
|
|
|
* - only use the first token we got
|
|
|
|
* - token delimiter is everything looking like a space
|
|
|
|
* character (' ', '\n', '\t' ...)
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
if (!isalnum(buf[0])) {
|
|
|
|
/*
|
2009-06-08 07:07:08 -06:00
|
|
|
* If the first character userspace gave us is not
|
2009-05-22 13:23:13 -06:00
|
|
|
* alphanumerical then assume the filter should be
|
|
|
|
* switched off.
|
|
|
|
*/
|
|
|
|
if (current_driver_name[0])
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_info("DMA-API: switching off dma-debug driver filter\n");
|
2009-05-22 13:23:13 -06:00
|
|
|
current_driver_name[0] = 0;
|
|
|
|
current_driver = NULL;
|
|
|
|
goto out_unlock;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now parse out the first token and use it as the name for the
|
|
|
|
* driver to filter for.
|
|
|
|
*/
|
2010-04-06 10:45:12 -06:00
|
|
|
for (i = 0; i < NAME_MAX_LEN - 1; ++i) {
|
2009-05-22 13:23:13 -06:00
|
|
|
current_driver_name[i] = buf[i];
|
|
|
|
if (isspace(buf[i]) || buf[i] == ' ' || buf[i] == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
current_driver_name[i] = 0;
|
|
|
|
current_driver = NULL;
|
|
|
|
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_info("DMA-API: enable driver filter for driver [%s]\n",
|
|
|
|
current_driver_name);
|
2009-05-22 13:23:13 -06:00
|
|
|
|
|
|
|
out_unlock:
|
|
|
|
write_unlock_irqrestore(&driver_name_lock, flags);
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2010-01-18 16:57:33 -07:00
|
|
|
static const struct file_operations filter_fops = {
|
2009-05-22 13:23:13 -06:00
|
|
|
.read = filter_read,
|
|
|
|
.write = filter_write,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 10:52:59 -06:00
|
|
|
.llseek = default_llseek,
|
2009-05-22 13:23:13 -06:00
|
|
|
};
|
|
|
|
|
2009-01-09 05:13:27 -07:00
|
|
|
static int dma_debug_fs_init(void)
|
|
|
|
{
|
|
|
|
dma_debug_dent = debugfs_create_dir("dma-api", NULL);
|
|
|
|
if (!dma_debug_dent) {
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_err("DMA-API: can not create debugfs directory\n");
|
2009-01-09 05:13:27 -07:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
global_disable_dent = debugfs_create_bool("disabled", 0444,
|
|
|
|
dma_debug_dent,
|
2012-06-27 03:08:55 -06:00
|
|
|
&global_disable);
|
2009-01-09 05:13:27 -07:00
|
|
|
if (!global_disable_dent)
|
|
|
|
goto out_err;
|
|
|
|
|
|
|
|
error_count_dent = debugfs_create_u32("error_count", 0444,
|
|
|
|
dma_debug_dent, &error_count);
|
|
|
|
if (!error_count_dent)
|
|
|
|
goto out_err;
|
|
|
|
|
|
|
|
show_all_errors_dent = debugfs_create_u32("all_errors", 0644,
|
|
|
|
dma_debug_dent,
|
|
|
|
&show_all_errors);
|
|
|
|
if (!show_all_errors_dent)
|
|
|
|
goto out_err;
|
|
|
|
|
|
|
|
show_num_errors_dent = debugfs_create_u32("num_errors", 0644,
|
|
|
|
dma_debug_dent,
|
|
|
|
&show_num_errors);
|
|
|
|
if (!show_num_errors_dent)
|
|
|
|
goto out_err;
|
|
|
|
|
|
|
|
num_free_entries_dent = debugfs_create_u32("num_free_entries", 0444,
|
|
|
|
dma_debug_dent,
|
|
|
|
&num_free_entries);
|
|
|
|
if (!num_free_entries_dent)
|
|
|
|
goto out_err;
|
|
|
|
|
|
|
|
min_free_entries_dent = debugfs_create_u32("min_free_entries", 0444,
|
|
|
|
dma_debug_dent,
|
|
|
|
&min_free_entries);
|
|
|
|
if (!min_free_entries_dent)
|
|
|
|
goto out_err;
|
|
|
|
|
2009-05-22 13:23:13 -06:00
|
|
|
filter_dent = debugfs_create_file("driver_filter", 0644,
|
|
|
|
dma_debug_dent, NULL, &filter_fops);
|
|
|
|
if (!filter_dent)
|
|
|
|
goto out_err;
|
|
|
|
|
2009-01-09 05:13:27 -07:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
out_err:
|
|
|
|
debugfs_remove_recursive(dma_debug_dent);
|
|
|
|
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2011-03-31 06:08:09 -06:00
|
|
|
static int device_dma_allocations(struct device *dev, struct dma_debug_entry **out_entry)
|
2009-05-22 09:16:04 -06:00
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
unsigned long flags;
|
|
|
|
int count = 0, i;
|
|
|
|
|
2009-06-08 07:46:19 -06:00
|
|
|
local_irq_save(flags);
|
|
|
|
|
2009-05-22 09:16:04 -06:00
|
|
|
for (i = 0; i < HASH_SIZE; ++i) {
|
2009-06-08 07:46:19 -06:00
|
|
|
spin_lock(&dma_entry_hash[i].lock);
|
2009-05-22 09:16:04 -06:00
|
|
|
list_for_each_entry(entry, &dma_entry_hash[i].list, list) {
|
2011-03-31 06:08:09 -06:00
|
|
|
if (entry->dev == dev) {
|
2009-05-22 09:16:04 -06:00
|
|
|
count += 1;
|
2011-03-31 06:08:09 -06:00
|
|
|
*out_entry = entry;
|
|
|
|
}
|
2009-05-22 09:16:04 -06:00
|
|
|
}
|
2009-06-08 07:46:19 -06:00
|
|
|
spin_unlock(&dma_entry_hash[i].lock);
|
2009-05-22 09:16:04 -06:00
|
|
|
}
|
|
|
|
|
2009-06-08 07:46:19 -06:00
|
|
|
local_irq_restore(flags);
|
|
|
|
|
2009-05-22 09:16:04 -06:00
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2009-12-31 07:16:23 -07:00
|
|
|
static int dma_debug_device_change(struct notifier_block *nb, unsigned long action, void *data)
|
2009-05-22 09:16:04 -06:00
|
|
|
{
|
|
|
|
struct device *dev = data;
|
2011-03-31 06:08:09 -06:00
|
|
|
struct dma_debug_entry *uninitialized_var(entry);
|
2009-05-22 09:16:04 -06:00
|
|
|
int count;
|
|
|
|
|
2009-12-17 17:00:36 -07:00
|
|
|
if (global_disable)
|
2009-12-31 07:16:23 -07:00
|
|
|
return 0;
|
2009-05-22 09:16:04 -06:00
|
|
|
|
|
|
|
switch (action) {
|
|
|
|
case BUS_NOTIFY_UNBOUND_DRIVER:
|
2011-03-31 06:08:09 -06:00
|
|
|
count = device_dma_allocations(dev, &entry);
|
2009-05-22 09:16:04 -06:00
|
|
|
if (count == 0)
|
|
|
|
break;
|
2011-03-31 06:08:09 -06:00
|
|
|
err_printk(dev, entry, "DMA-API: device driver has pending "
|
2009-05-22 09:16:04 -06:00
|
|
|
"DMA allocations while released from device "
|
2011-03-31 06:08:09 -06:00
|
|
|
"[count=%d]\n"
|
|
|
|
"One of leaked entries details: "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
|
|
|
"[mapped with %s] [mapped as %s]\n",
|
|
|
|
count, entry->dev_addr, entry->size,
|
|
|
|
dir2name[entry->direction], type2name[entry->type]);
|
2009-05-22 09:16:04 -06:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-03-16 10:32:14 -06:00
|
|
|
void dma_debug_add_bus(struct bus_type *bus)
|
|
|
|
{
|
2009-05-22 09:16:04 -06:00
|
|
|
struct notifier_block *nb;
|
|
|
|
|
2009-12-17 17:00:36 -07:00
|
|
|
if (global_disable)
|
|
|
|
return;
|
|
|
|
|
2009-05-22 09:16:04 -06:00
|
|
|
nb = kzalloc(sizeof(struct notifier_block), GFP_KERNEL);
|
|
|
|
if (nb == NULL) {
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_err("dma_debug_add_bus: out of memory\n");
|
2009-05-22 09:16:04 -06:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
nb->notifier_call = dma_debug_device_change;
|
|
|
|
|
|
|
|
bus_register_notifier(bus, nb);
|
2009-03-16 10:32:14 -06:00
|
|
|
}
|
2009-01-09 05:13:27 -07:00
|
|
|
|
2009-01-09 04:54:42 -07:00
|
|
|
/*
|
|
|
|
* Let the architectures decide how many entries should be preallocated.
|
|
|
|
*/
|
|
|
|
void dma_debug_init(u32 num_entries)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (global_disable)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (i = 0; i < HASH_SIZE; ++i) {
|
|
|
|
INIT_LIST_HEAD(&dma_entry_hash[i].list);
|
2009-06-16 08:11:14 -06:00
|
|
|
spin_lock_init(&dma_entry_hash[i].lock);
|
2009-01-09 04:54:42 -07:00
|
|
|
}
|
|
|
|
|
2009-01-09 05:13:27 -07:00
|
|
|
if (dma_debug_fs_init() != 0) {
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_err("DMA-API: error creating debugfs entries - disabling\n");
|
2009-01-09 05:13:27 -07:00
|
|
|
global_disable = true;
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-01-09 05:01:56 -07:00
|
|
|
if (req_entries)
|
|
|
|
num_entries = req_entries;
|
|
|
|
|
2009-01-09 04:54:42 -07:00
|
|
|
if (prealloc_memory(num_entries) != 0) {
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_err("DMA-API: debugging out of memory error - disabled\n");
|
2009-01-09 04:54:42 -07:00
|
|
|
global_disable = true;
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-04-15 03:22:41 -06:00
|
|
|
nr_total_entries = num_free_entries;
|
|
|
|
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_info("DMA-API: debugging enabled by kernel config\n");
|
2009-01-09 04:54:42 -07:00
|
|
|
}
|
|
|
|
|
2009-01-09 05:01:56 -07:00
|
|
|
static __init int dma_debug_cmdline(char *str)
|
|
|
|
{
|
|
|
|
if (!str)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (strncmp(str, "off", 3) == 0) {
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_info("DMA-API: debugging disabled on kernel command line\n");
|
2009-01-09 05:01:56 -07:00
|
|
|
global_disable = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __init int dma_debug_entries_cmdline(char *str)
|
|
|
|
{
|
|
|
|
int res;
|
|
|
|
|
|
|
|
if (!str)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
res = get_option(&str, &req_entries);
|
|
|
|
|
|
|
|
if (!res)
|
|
|
|
req_entries = 0;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
__setup("dma_debug=", dma_debug_cmdline);
|
|
|
|
__setup("dma_debug_entries=", dma_debug_entries_cmdline);
|
|
|
|
|
2009-01-09 06:10:26 -07:00
|
|
|
static void check_unmap(struct dma_debug_entry *ref)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
struct hash_bucket *bucket;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
bucket = get_hash_bucket(ref, &flags);
|
2011-08-08 13:13:54 -06:00
|
|
|
entry = bucket_find_exact(bucket, ref);
|
2009-01-09 06:10:26 -07:00
|
|
|
|
|
|
|
if (!entry) {
|
2013-03-22 16:04:48 -06:00
|
|
|
/* must drop lock before calling dma_mapping_error */
|
|
|
|
put_hash_bucket(bucket, &flags);
|
|
|
|
|
2012-11-03 17:00:07 -06:00
|
|
|
if (dma_mapping_error(ref->dev, ref->dev_addr)) {
|
|
|
|
err_printk(ref->dev, NULL,
|
2013-03-22 16:04:48 -06:00
|
|
|
"DMA-API: device driver tries to free an "
|
|
|
|
"invalid DMA memory address\n");
|
|
|
|
} else {
|
|
|
|
err_printk(ref->dev, NULL,
|
|
|
|
"DMA-API: device driver tries to free DMA "
|
|
|
|
"memory it has not allocated [device "
|
|
|
|
"address=0x%016llx] [size=%llu bytes]\n",
|
|
|
|
ref->dev_addr, ref->size);
|
2012-11-03 17:00:07 -06:00
|
|
|
}
|
2013-03-22 16:04:48 -06:00
|
|
|
return;
|
2009-01-09 06:10:26 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ref->size != entry->size) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(ref->dev, entry, "DMA-API: device driver frees "
|
2009-01-09 06:10:26 -07:00
|
|
|
"DMA memory with different size "
|
|
|
|
"[device address=0x%016llx] [map size=%llu bytes] "
|
|
|
|
"[unmap size=%llu bytes]\n",
|
|
|
|
ref->dev_addr, entry->size, ref->size);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ref->type != entry->type) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(ref->dev, entry, "DMA-API: device driver frees "
|
2009-01-09 06:10:26 -07:00
|
|
|
"DMA memory with wrong function "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
|
|
|
"[mapped as %s] [unmapped as %s]\n",
|
|
|
|
ref->dev_addr, ref->size,
|
|
|
|
type2name[entry->type], type2name[ref->type]);
|
|
|
|
} else if ((entry->type == dma_debug_coherent) &&
|
2014-01-21 16:48:12 -07:00
|
|
|
(phys_addr(ref) != phys_addr(entry))) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(ref->dev, entry, "DMA-API: device driver frees "
|
2009-01-09 06:10:26 -07:00
|
|
|
"DMA memory with different CPU address "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
2009-10-29 09:25:50 -06:00
|
|
|
"[cpu alloc address=0x%016llx] "
|
|
|
|
"[cpu free address=0x%016llx]",
|
2009-01-09 06:10:26 -07:00
|
|
|
ref->dev_addr, ref->size,
|
2014-01-21 16:48:12 -07:00
|
|
|
phys_addr(entry),
|
|
|
|
phys_addr(ref));
|
2009-01-09 06:10:26 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ref->sg_call_ents && ref->type == dma_debug_sg &&
|
|
|
|
ref->sg_call_ents != entry->sg_call_ents) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(ref->dev, entry, "DMA-API: device driver frees "
|
2009-01-09 06:10:26 -07:00
|
|
|
"DMA sg list with different entry count "
|
|
|
|
"[map count=%d] [unmap count=%d]\n",
|
|
|
|
entry->sg_call_ents, ref->sg_call_ents);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This may be no bug in reality - but most implementations of the
|
|
|
|
* DMA API don't handle this properly, so check for it here
|
|
|
|
*/
|
|
|
|
if (ref->direction != entry->direction) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(ref->dev, entry, "DMA-API: device driver frees "
|
2009-01-09 06:10:26 -07:00
|
|
|
"DMA memory with different direction "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
|
|
|
"[mapped with %s] [unmapped with %s]\n",
|
|
|
|
ref->dev_addr, ref->size,
|
|
|
|
dir2name[entry->direction],
|
|
|
|
dir2name[ref->direction]);
|
|
|
|
}
|
|
|
|
|
2012-10-08 11:08:06 -06:00
|
|
|
if (entry->map_err_type == MAP_ERR_NOT_CHECKED) {
|
|
|
|
err_printk(ref->dev, entry,
|
|
|
|
"DMA-API: device driver failed to check map error"
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
|
|
|
"[mapped as %s]",
|
|
|
|
ref->dev_addr, ref->size,
|
|
|
|
type2name[entry->type]);
|
|
|
|
}
|
|
|
|
|
2009-01-09 06:10:26 -07:00
|
|
|
hash_bucket_del(entry);
|
|
|
|
dma_entry_free(entry);
|
|
|
|
|
|
|
|
put_hash_bucket(bucket, &flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_for_stack(struct device *dev, void *addr)
|
|
|
|
{
|
|
|
|
if (object_is_on_stack(addr))
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(dev, NULL, "DMA-API: device driver maps memory from"
|
|
|
|
"stack [addr=%p]\n", addr);
|
2009-01-09 06:10:26 -07:00
|
|
|
}
|
|
|
|
|
2009-07-10 13:38:02 -06:00
|
|
|
static inline bool overlap(void *addr, unsigned long len, void *start, void *end)
|
2009-03-16 09:51:55 -06:00
|
|
|
{
|
2009-07-10 13:38:02 -06:00
|
|
|
unsigned long a1 = (unsigned long)addr;
|
|
|
|
unsigned long b1 = a1 + len;
|
|
|
|
unsigned long a2 = (unsigned long)start;
|
|
|
|
unsigned long b2 = (unsigned long)end;
|
2009-03-16 09:51:55 -06:00
|
|
|
|
2009-07-10 13:38:02 -06:00
|
|
|
return !(b1 <= a2 || a1 >= b2);
|
2009-03-16 09:51:55 -06:00
|
|
|
}
|
|
|
|
|
2009-07-10 13:38:02 -06:00
|
|
|
static void check_for_illegal_area(struct device *dev, void *addr, unsigned long len)
|
2009-03-16 09:51:55 -06:00
|
|
|
{
|
2009-07-10 13:38:02 -06:00
|
|
|
if (overlap(addr, len, _text, _etext) ||
|
|
|
|
overlap(addr, len, __start_rodata, __end_rodata))
|
|
|
|
err_printk(dev, NULL, "DMA-API: device driver maps memory from kernel text or rodata [addr=%p] [len=%lu]\n", addr, len);
|
2009-03-16 09:51:55 -06:00
|
|
|
}
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
static void check_sync(struct device *dev,
|
|
|
|
struct dma_debug_entry *ref,
|
|
|
|
bool to_cpu)
|
2009-01-09 06:10:26 -07:00
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
struct hash_bucket *bucket;
|
|
|
|
unsigned long flags;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
bucket = get_hash_bucket(ref, &flags);
|
2009-01-09 06:10:26 -07:00
|
|
|
|
2011-08-08 13:13:54 -06:00
|
|
|
entry = bucket_find_contain(&bucket, ref, &flags);
|
2009-01-09 06:10:26 -07:00
|
|
|
|
|
|
|
if (!entry) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(dev, NULL, "DMA-API: device driver tries "
|
2009-01-09 06:10:26 -07:00
|
|
|
"to sync DMA memory it has not allocated "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes]\n",
|
2009-06-12 07:25:06 -06:00
|
|
|
(unsigned long long)ref->dev_addr, ref->size);
|
2009-01-09 06:10:26 -07:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
if (ref->size > entry->size) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(dev, entry, "DMA-API: device driver syncs"
|
2009-01-09 06:10:26 -07:00
|
|
|
" DMA memory outside allocated range "
|
|
|
|
"[device address=0x%016llx] "
|
2009-06-12 07:25:06 -06:00
|
|
|
"[allocation size=%llu bytes] "
|
|
|
|
"[sync offset+size=%llu]\n",
|
|
|
|
entry->dev_addr, entry->size,
|
|
|
|
ref->size);
|
2009-01-09 06:10:26 -07:00
|
|
|
}
|
|
|
|
|
2010-01-08 15:42:36 -07:00
|
|
|
if (entry->direction == DMA_BIDIRECTIONAL)
|
|
|
|
goto out;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
if (ref->direction != entry->direction) {
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(dev, entry, "DMA-API: device driver syncs "
|
2009-01-09 06:10:26 -07:00
|
|
|
"DMA memory with different direction "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
|
|
|
"[mapped with %s] [synced with %s]\n",
|
2009-06-12 07:25:06 -06:00
|
|
|
(unsigned long long)ref->dev_addr, entry->size,
|
2009-01-09 06:10:26 -07:00
|
|
|
dir2name[entry->direction],
|
2009-06-12 07:25:06 -06:00
|
|
|
dir2name[ref->direction]);
|
2009-01-09 06:10:26 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
if (to_cpu && !(entry->direction == DMA_FROM_DEVICE) &&
|
2009-06-12 07:25:06 -06:00
|
|
|
!(ref->direction == DMA_TO_DEVICE))
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(dev, entry, "DMA-API: device driver syncs "
|
2009-01-09 06:10:26 -07:00
|
|
|
"device read-only DMA memory for cpu "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
|
|
|
"[mapped with %s] [synced with %s]\n",
|
2009-06-12 07:25:06 -06:00
|
|
|
(unsigned long long)ref->dev_addr, entry->size,
|
2009-01-09 06:10:26 -07:00
|
|
|
dir2name[entry->direction],
|
2009-06-12 07:25:06 -06:00
|
|
|
dir2name[ref->direction]);
|
2009-01-09 06:10:26 -07:00
|
|
|
|
|
|
|
if (!to_cpu && !(entry->direction == DMA_TO_DEVICE) &&
|
2009-06-12 07:25:06 -06:00
|
|
|
!(ref->direction == DMA_FROM_DEVICE))
|
2009-01-19 08:52:39 -07:00
|
|
|
err_printk(dev, entry, "DMA-API: device driver syncs "
|
2009-01-09 06:10:26 -07:00
|
|
|
"device write-only DMA memory to device "
|
|
|
|
"[device address=0x%016llx] [size=%llu bytes] "
|
|
|
|
"[mapped with %s] [synced with %s]\n",
|
2009-06-12 07:25:06 -06:00
|
|
|
(unsigned long long)ref->dev_addr, entry->size,
|
2009-01-09 06:10:26 -07:00
|
|
|
dir2name[entry->direction],
|
2009-06-12 07:25:06 -06:00
|
|
|
dir2name[ref->direction]);
|
2009-01-09 06:10:26 -07:00
|
|
|
|
|
|
|
out:
|
|
|
|
put_hash_bucket(bucket, &flags);
|
|
|
|
}
|
|
|
|
|
2009-01-09 06:14:49 -07:00
|
|
|
void debug_dma_map_page(struct device *dev, struct page *page, size_t offset,
|
|
|
|
size_t size, int direction, dma_addr_t dma_addr,
|
|
|
|
bool map_single)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
2012-11-03 17:00:07 -06:00
|
|
|
if (dma_mapping_error(dev, dma_addr))
|
2009-01-09 06:14:49 -07:00
|
|
|
return;
|
|
|
|
|
|
|
|
entry = dma_entry_alloc();
|
|
|
|
if (!entry)
|
|
|
|
return;
|
|
|
|
|
|
|
|
entry->dev = dev;
|
|
|
|
entry->type = dma_debug_page;
|
2014-01-21 16:48:12 -07:00
|
|
|
entry->pfn = page_to_pfn(page);
|
|
|
|
entry->offset = offset,
|
2009-01-09 06:14:49 -07:00
|
|
|
entry->dev_addr = dma_addr;
|
|
|
|
entry->size = size;
|
|
|
|
entry->direction = direction;
|
2012-10-08 11:08:06 -06:00
|
|
|
entry->map_err_type = MAP_ERR_NOT_CHECKED;
|
2009-01-09 06:14:49 -07:00
|
|
|
|
2009-03-23 08:35:08 -06:00
|
|
|
if (map_single)
|
2009-01-09 06:14:49 -07:00
|
|
|
entry->type = dma_debug_single;
|
2009-03-23 08:35:08 -06:00
|
|
|
|
|
|
|
if (!PageHighMem(page)) {
|
2009-07-10 13:38:02 -06:00
|
|
|
void *addr = page_address(page) + offset;
|
|
|
|
|
2009-03-16 09:51:55 -06:00
|
|
|
check_for_stack(dev, addr);
|
|
|
|
check_for_illegal_area(dev, addr, size);
|
2009-01-09 06:14:49 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
add_dma_entry(entry);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_map_page);
|
|
|
|
|
2012-10-08 11:08:06 -06:00
|
|
|
void debug_dma_mapping_error(struct device *dev, dma_addr_t dma_addr)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry ref;
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
struct hash_bucket *bucket;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
ref.dev = dev;
|
|
|
|
ref.dev_addr = dma_addr;
|
|
|
|
bucket = get_hash_bucket(&ref, &flags);
|
|
|
|
|
2013-03-22 16:04:49 -06:00
|
|
|
list_for_each_entry(entry, &bucket->list, list) {
|
|
|
|
if (!exact_match(&ref, entry))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The same physical address can be mapped multiple
|
|
|
|
* times. Without a hardware IOMMU this results in the
|
|
|
|
* same device addresses being put into the dma-debug
|
|
|
|
* hash multiple times too. This can result in false
|
|
|
|
* positives being reported. Therefore we implement a
|
|
|
|
* best-fit algorithm here which updates the first entry
|
|
|
|
* from the hash which fits the reference value and is
|
|
|
|
* not currently listed as being checked.
|
|
|
|
*/
|
|
|
|
if (entry->map_err_type == MAP_ERR_NOT_CHECKED) {
|
|
|
|
entry->map_err_type = MAP_ERR_CHECKED;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2012-10-08 11:08:06 -06:00
|
|
|
|
|
|
|
put_hash_bucket(bucket, &flags);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_mapping_error);
|
|
|
|
|
2009-01-09 06:14:49 -07:00
|
|
|
void debug_dma_unmap_page(struct device *dev, dma_addr_t addr,
|
|
|
|
size_t size, int direction, bool map_single)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry ref = {
|
|
|
|
.type = dma_debug_page,
|
|
|
|
.dev = dev,
|
|
|
|
.dev_addr = addr,
|
|
|
|
.size = size,
|
|
|
|
.direction = direction,
|
|
|
|
};
|
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (map_single)
|
|
|
|
ref.type = dma_debug_single;
|
|
|
|
|
|
|
|
check_unmap(&ref);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_unmap_page);
|
|
|
|
|
2009-01-09 06:19:54 -07:00
|
|
|
void debug_dma_map_sg(struct device *dev, struct scatterlist *sg,
|
|
|
|
int nents, int mapped_ents, int direction)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
struct scatterlist *s;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_sg(sg, s, mapped_ents, i) {
|
|
|
|
entry = dma_entry_alloc();
|
|
|
|
if (!entry)
|
|
|
|
return;
|
|
|
|
|
|
|
|
entry->type = dma_debug_sg;
|
|
|
|
entry->dev = dev;
|
2014-01-21 16:48:12 -07:00
|
|
|
entry->pfn = page_to_pfn(sg_page(s));
|
|
|
|
entry->offset = s->offset,
|
2009-05-26 18:43:02 -06:00
|
|
|
entry->size = sg_dma_len(s);
|
2009-05-26 18:43:01 -06:00
|
|
|
entry->dev_addr = sg_dma_address(s);
|
2009-01-09 06:19:54 -07:00
|
|
|
entry->direction = direction;
|
|
|
|
entry->sg_call_ents = nents;
|
|
|
|
entry->sg_mapped_ents = mapped_ents;
|
|
|
|
|
2009-03-23 08:35:08 -06:00
|
|
|
if (!PageHighMem(sg_page(s))) {
|
|
|
|
check_for_stack(dev, sg_virt(s));
|
2009-05-26 18:43:02 -06:00
|
|
|
check_for_illegal_area(dev, sg_virt(s), sg_dma_len(s));
|
2009-03-23 08:35:08 -06:00
|
|
|
}
|
2009-01-09 06:19:54 -07:00
|
|
|
|
|
|
|
add_dma_entry(entry);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_map_sg);
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
static int get_nr_mapped_entries(struct device *dev,
|
|
|
|
struct dma_debug_entry *ref)
|
2009-05-26 18:43:03 -06:00
|
|
|
{
|
2009-06-12 07:25:06 -06:00
|
|
|
struct dma_debug_entry *entry;
|
2009-05-26 18:43:03 -06:00
|
|
|
struct hash_bucket *bucket;
|
|
|
|
unsigned long flags;
|
2009-06-08 07:19:29 -06:00
|
|
|
int mapped_ents;
|
2009-05-26 18:43:03 -06:00
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
bucket = get_hash_bucket(ref, &flags);
|
2011-08-08 13:13:54 -06:00
|
|
|
entry = bucket_find_exact(bucket, ref);
|
2009-06-08 07:19:29 -06:00
|
|
|
mapped_ents = 0;
|
2009-05-26 18:43:03 -06:00
|
|
|
|
|
|
|
if (entry)
|
|
|
|
mapped_ents = entry->sg_mapped_ents;
|
|
|
|
put_hash_bucket(bucket, &flags);
|
|
|
|
|
|
|
|
return mapped_ents;
|
|
|
|
}
|
|
|
|
|
2009-01-09 06:19:54 -07:00
|
|
|
void debug_dma_unmap_sg(struct device *dev, struct scatterlist *sglist,
|
|
|
|
int nelems, int dir)
|
|
|
|
{
|
|
|
|
struct scatterlist *s;
|
|
|
|
int mapped_ents = 0, i;
|
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_sg(sglist, s, nelems, i) {
|
|
|
|
|
|
|
|
struct dma_debug_entry ref = {
|
|
|
|
.type = dma_debug_sg,
|
|
|
|
.dev = dev,
|
2014-01-21 16:48:12 -07:00
|
|
|
.pfn = page_to_pfn(sg_page(s)),
|
|
|
|
.offset = s->offset,
|
2009-05-26 18:43:01 -06:00
|
|
|
.dev_addr = sg_dma_address(s),
|
2009-05-26 18:43:02 -06:00
|
|
|
.size = sg_dma_len(s),
|
2009-01-09 06:19:54 -07:00
|
|
|
.direction = dir,
|
2009-06-11 02:03:42 -06:00
|
|
|
.sg_call_ents = nelems,
|
2009-01-09 06:19:54 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
if (mapped_ents && i >= mapped_ents)
|
|
|
|
break;
|
|
|
|
|
2009-06-11 02:03:42 -06:00
|
|
|
if (!i)
|
2009-06-12 07:25:06 -06:00
|
|
|
mapped_ents = get_nr_mapped_entries(dev, &ref);
|
2009-01-09 06:19:54 -07:00
|
|
|
|
|
|
|
check_unmap(&ref);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_unmap_sg);
|
|
|
|
|
2009-01-09 06:38:50 -07:00
|
|
|
void debug_dma_alloc_coherent(struct device *dev, size_t size,
|
|
|
|
dma_addr_t dma_addr, void *virt)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (unlikely(virt == NULL))
|
|
|
|
return;
|
|
|
|
|
|
|
|
entry = dma_entry_alloc();
|
|
|
|
if (!entry)
|
|
|
|
return;
|
|
|
|
|
|
|
|
entry->type = dma_debug_coherent;
|
|
|
|
entry->dev = dev;
|
2014-01-21 16:48:12 -07:00
|
|
|
entry->pfn = page_to_pfn(virt_to_page(virt));
|
|
|
|
entry->offset = (size_t) virt & PAGE_MASK;
|
2009-01-09 06:38:50 -07:00
|
|
|
entry->size = size;
|
|
|
|
entry->dev_addr = dma_addr;
|
|
|
|
entry->direction = DMA_BIDIRECTIONAL;
|
|
|
|
|
|
|
|
add_dma_entry(entry);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_alloc_coherent);
|
|
|
|
|
|
|
|
void debug_dma_free_coherent(struct device *dev, size_t size,
|
|
|
|
void *virt, dma_addr_t addr)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry ref = {
|
|
|
|
.type = dma_debug_coherent,
|
|
|
|
.dev = dev,
|
2014-01-21 16:48:12 -07:00
|
|
|
.pfn = page_to_pfn(virt_to_page(virt)),
|
|
|
|
.offset = (size_t) virt & PAGE_MASK,
|
2009-01-09 06:38:50 -07:00
|
|
|
.dev_addr = addr,
|
|
|
|
.size = size,
|
|
|
|
.direction = DMA_BIDIRECTIONAL,
|
|
|
|
};
|
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
check_unmap(&ref);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_free_coherent);
|
|
|
|
|
2009-01-09 06:43:04 -07:00
|
|
|
void debug_dma_sync_single_for_cpu(struct device *dev, dma_addr_t dma_handle,
|
|
|
|
size_t size, int direction)
|
|
|
|
{
|
2009-06-12 07:25:06 -06:00
|
|
|
struct dma_debug_entry ref;
|
|
|
|
|
2009-01-09 06:43:04 -07:00
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
ref.type = dma_debug_single;
|
|
|
|
ref.dev = dev;
|
|
|
|
ref.dev_addr = dma_handle;
|
|
|
|
ref.size = size;
|
|
|
|
ref.direction = direction;
|
|
|
|
ref.sg_call_ents = 0;
|
|
|
|
|
|
|
|
check_sync(dev, &ref, true);
|
2009-01-09 06:43:04 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_sync_single_for_cpu);
|
|
|
|
|
|
|
|
void debug_dma_sync_single_for_device(struct device *dev,
|
|
|
|
dma_addr_t dma_handle, size_t size,
|
|
|
|
int direction)
|
|
|
|
{
|
2009-06-12 07:25:06 -06:00
|
|
|
struct dma_debug_entry ref;
|
|
|
|
|
2009-01-09 06:43:04 -07:00
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
ref.type = dma_debug_single;
|
|
|
|
ref.dev = dev;
|
|
|
|
ref.dev_addr = dma_handle;
|
|
|
|
ref.size = size;
|
|
|
|
ref.direction = direction;
|
|
|
|
ref.sg_call_ents = 0;
|
|
|
|
|
|
|
|
check_sync(dev, &ref, false);
|
2009-01-09 06:43:04 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_sync_single_for_device);
|
|
|
|
|
2009-01-09 06:55:38 -07:00
|
|
|
void debug_dma_sync_single_range_for_cpu(struct device *dev,
|
|
|
|
dma_addr_t dma_handle,
|
|
|
|
unsigned long offset, size_t size,
|
|
|
|
int direction)
|
|
|
|
{
|
2009-06-12 07:25:06 -06:00
|
|
|
struct dma_debug_entry ref;
|
|
|
|
|
2009-01-09 06:55:38 -07:00
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
ref.type = dma_debug_single;
|
|
|
|
ref.dev = dev;
|
|
|
|
ref.dev_addr = dma_handle;
|
|
|
|
ref.size = offset + size;
|
|
|
|
ref.direction = direction;
|
|
|
|
ref.sg_call_ents = 0;
|
|
|
|
|
|
|
|
check_sync(dev, &ref, true);
|
2009-01-09 06:55:38 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_sync_single_range_for_cpu);
|
|
|
|
|
|
|
|
void debug_dma_sync_single_range_for_device(struct device *dev,
|
|
|
|
dma_addr_t dma_handle,
|
|
|
|
unsigned long offset,
|
|
|
|
size_t size, int direction)
|
|
|
|
{
|
2009-06-12 07:25:06 -06:00
|
|
|
struct dma_debug_entry ref;
|
|
|
|
|
2009-01-09 06:55:38 -07:00
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
ref.type = dma_debug_single;
|
|
|
|
ref.dev = dev;
|
|
|
|
ref.dev_addr = dma_handle;
|
|
|
|
ref.size = offset + size;
|
|
|
|
ref.direction = direction;
|
|
|
|
ref.sg_call_ents = 0;
|
|
|
|
|
|
|
|
check_sync(dev, &ref, false);
|
2009-01-09 06:55:38 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_sync_single_range_for_device);
|
|
|
|
|
2009-01-09 07:01:12 -07:00
|
|
|
void debug_dma_sync_sg_for_cpu(struct device *dev, struct scatterlist *sg,
|
|
|
|
int nelems, int direction)
|
|
|
|
{
|
|
|
|
struct scatterlist *s;
|
2009-05-26 18:43:03 -06:00
|
|
|
int mapped_ents = 0, i;
|
2009-01-09 07:01:12 -07:00
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_sg(sg, s, nelems, i) {
|
2009-06-12 07:25:06 -06:00
|
|
|
|
|
|
|
struct dma_debug_entry ref = {
|
|
|
|
.type = dma_debug_sg,
|
|
|
|
.dev = dev,
|
2014-01-21 16:48:12 -07:00
|
|
|
.pfn = page_to_pfn(sg_page(s)),
|
|
|
|
.offset = s->offset,
|
2009-06-12 07:25:06 -06:00
|
|
|
.dev_addr = sg_dma_address(s),
|
|
|
|
.size = sg_dma_len(s),
|
|
|
|
.direction = direction,
|
|
|
|
.sg_call_ents = nelems,
|
|
|
|
};
|
|
|
|
|
2009-05-26 18:43:03 -06:00
|
|
|
if (!i)
|
2009-06-12 07:25:06 -06:00
|
|
|
mapped_ents = get_nr_mapped_entries(dev, &ref);
|
2009-05-26 18:43:03 -06:00
|
|
|
|
|
|
|
if (i >= mapped_ents)
|
|
|
|
break;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
check_sync(dev, &ref, true);
|
2009-01-09 07:01:12 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_sync_sg_for_cpu);
|
|
|
|
|
|
|
|
void debug_dma_sync_sg_for_device(struct device *dev, struct scatterlist *sg,
|
|
|
|
int nelems, int direction)
|
|
|
|
{
|
|
|
|
struct scatterlist *s;
|
2009-05-26 18:43:03 -06:00
|
|
|
int mapped_ents = 0, i;
|
2009-01-09 07:01:12 -07:00
|
|
|
|
|
|
|
if (unlikely(global_disable))
|
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_sg(sg, s, nelems, i) {
|
2009-06-12 07:25:06 -06:00
|
|
|
|
|
|
|
struct dma_debug_entry ref = {
|
|
|
|
.type = dma_debug_sg,
|
|
|
|
.dev = dev,
|
2014-01-21 16:48:12 -07:00
|
|
|
.pfn = page_to_pfn(sg_page(s)),
|
|
|
|
.offset = s->offset,
|
2009-06-12 07:25:06 -06:00
|
|
|
.dev_addr = sg_dma_address(s),
|
|
|
|
.size = sg_dma_len(s),
|
|
|
|
.direction = direction,
|
|
|
|
.sg_call_ents = nelems,
|
|
|
|
};
|
2009-05-26 18:43:03 -06:00
|
|
|
if (!i)
|
2009-06-12 07:25:06 -06:00
|
|
|
mapped_ents = get_nr_mapped_entries(dev, &ref);
|
2009-05-26 18:43:03 -06:00
|
|
|
|
|
|
|
if (i >= mapped_ents)
|
|
|
|
break;
|
|
|
|
|
2009-06-12 07:25:06 -06:00
|
|
|
check_sync(dev, &ref, false);
|
2009-01-09 07:01:12 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_sync_sg_for_device);
|
|
|
|
|
2009-05-22 13:49:51 -06:00
|
|
|
static int __init dma_debug_driver_setup(char *str)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < NAME_MAX_LEN - 1; ++i, ++str) {
|
|
|
|
current_driver_name[i] = *str;
|
|
|
|
if (*str == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (current_driver_name[0])
|
2009-06-08 07:39:24 -06:00
|
|
|
pr_info("DMA-API: enable driver filter for driver [%s]\n",
|
|
|
|
current_driver_name);
|
2009-05-22 13:49:51 -06:00
|
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
__setup("dma_debug_driver=", dma_debug_driver_setup);
|