2019-05-29 17:57:47 -06:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2009-01-09 04:19:52 -07:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2008 Advanced Micro Devices, Inc.
|
|
|
|
*
|
|
|
|
* Author: Joerg Roedel <joerg.roedel@amd.com>
|
|
|
|
*/
|
|
|
|
|
2018-12-10 07:00:27 -07:00
|
|
|
#define pr_fmt(fmt) "DMA-API: " fmt
|
|
|
|
|
2017-02-08 10:51:37 -07:00
|
|
|
#include <linux/sched/task_stack.h>
|
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>
|
2017-02-08 10:51:36 -07:00
|
|
|
#include <linux/sched/task.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>
|
2016-08-11 03:35:22 -06:00
|
|
|
#include <linux/vmalloc.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>
|
|
|
|
|
2019-10-30 12:48:44 -06:00
|
|
|
#define HASH_SIZE 16384ULL
|
2009-01-09 04:34:49 -07:00
|
|
|
#define HASH_FN_SHIFT 13
|
|
|
|
#define HASH_FN_MASK (HASH_SIZE - 1)
|
|
|
|
|
2018-04-16 09:22:28 -06:00
|
|
|
#define PREALLOC_DMA_DEBUG_ENTRIES (1 << 16)
|
2018-12-10 07:00:29 -07:00
|
|
|
/* If the pool runs out, add this many new entries at once */
|
2018-12-10 07:00:33 -07:00
|
|
|
#define DMA_DEBUG_DYNAMIC_ENTRIES (PAGE_SIZE / sizeof(struct dma_debug_entry))
|
2018-04-16 09:22:28 -06:00
|
|
|
|
2009-01-09 04:19:52 -07:00
|
|
|
enum {
|
|
|
|
dma_debug_single,
|
|
|
|
dma_debug_sg,
|
|
|
|
dma_debug_coherent,
|
2016-08-10 05:22:15 -06:00
|
|
|
dma_debug_resource,
|
2009-01-09 04:19:52 -07:00
|
|
|
};
|
|
|
|
|
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
|
|
|
|
* @size: length of the mapping
|
2019-10-30 13:32:04 -06:00
|
|
|
* @type: single, page, sg, coherent
|
2014-01-21 16:48:12 -07:00
|
|
|
* @direction: enum dma_data_direction
|
|
|
|
* @sg_call_ents: 'nents' from dma_map_sg
|
|
|
|
* @sg_mapped_ents: 'mapped_ents' from dma_map_sg
|
2019-10-30 13:32:04 -06:00
|
|
|
* @pfn: page frame of the start address
|
|
|
|
* @offset: offset of mapping relative to pfn
|
2014-01-21 16:48:12 -07:00
|
|
|
* @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;
|
|
|
|
u64 dev_addr;
|
|
|
|
u64 size;
|
2019-10-30 13:32:04 -06:00
|
|
|
int type;
|
2009-01-09 04:19:52 -07:00
|
|
|
int direction;
|
|
|
|
int sg_call_ents;
|
|
|
|
int sg_mapped_ents;
|
2019-10-30 13:32:04 -06:00
|
|
|
unsigned long pfn;
|
|
|
|
size_t offset;
|
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
|
2019-04-25 03:45:05 -06:00
|
|
|
unsigned int stack_len;
|
|
|
|
unsigned long stack_entries[DMA_DEBUG_STACKTRACE_ENTRIES];
|
2009-01-19 08:52:39 -07:00
|
|
|
#endif
|
2019-10-30 13:32:04 -06:00
|
|
|
} ____cacheline_aligned_in_smp;
|
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;
|
2019-10-30 12:48:44 -06:00
|
|
|
};
|
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 */
|
2015-09-26 16:04:07 -06:00
|
|
|
static bool global_disable __read_mostly;
|
2009-01-09 04:42:46 -07:00
|
|
|
|
dma-debug: prevent early callers from crashing
dma_debug_init() is called by architecture specific code at different
levels, but typically as a fs_initcall due to the debugfs initialization.
Some platforms may have early callers of the DMA-API, running prior to the
fs_initcall() level, which is not much of an issue unless
CONFIG_DMA_API_DEBUG is set. When the DMA-API debugging facilities are
turned on a caller will go through:
debug_dma_map_{single,page}
-> dma_mapping_error (inline function usually)
-> debug_dma_mapping_error
-> get_hash_bucket
Calling get_hash_bucket() returns a valid hash value since we hash on high
bits of the dma_addr cookie, but we will grab an unitialized spinlock,
which typically won't crash but produce a warning, the real crash will
however happen during the bucket list traversal because the list has not
been initialized yet.
An obvious solution is of course to move some of the offenders to run
after the fs_initcall level, but since this might not always be an option,
we add a flag "dma_debug_initialized" which is set to false by default,
and set to true once dma_debug_init() has had a chance to run.
The dma_debug_disabled() helper function previously introduced just needs
to check for dma_debug_initialized to allow the caller to proceed or not.
Signed-off-by: Florian Fainelli <f.fainelli@gmail.com>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Jiri Kosina <jkosina@suse.cz>
Cc: Horia Geanta <horia.geanta@freescale.com>
Cc: Brian Norris <computersforpeace@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-12-10 16:41:25 -07:00
|
|
|
/* Early initialization disable flag, set at the end of dma_debug_init */
|
|
|
|
static bool dma_debug_initialized __read_mostly;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
static inline bool dma_debug_disabled(void)
|
|
|
|
{
|
dma-debug: prevent early callers from crashing
dma_debug_init() is called by architecture specific code at different
levels, but typically as a fs_initcall due to the debugfs initialization.
Some platforms may have early callers of the DMA-API, running prior to the
fs_initcall() level, which is not much of an issue unless
CONFIG_DMA_API_DEBUG is set. When the DMA-API debugging facilities are
turned on a caller will go through:
debug_dma_map_{single,page}
-> dma_mapping_error (inline function usually)
-> debug_dma_mapping_error
-> get_hash_bucket
Calling get_hash_bucket() returns a valid hash value since we hash on high
bits of the dma_addr cookie, but we will grab an unitialized spinlock,
which typically won't crash but produce a warning, the real crash will
however happen during the bucket list traversal because the list has not
been initialized yet.
An obvious solution is of course to move some of the offenders to run
after the fs_initcall level, but since this might not always be an option,
we add a flag "dma_debug_initialized" which is set to false by default,
and set to true once dma_debug_init() has had a chance to run.
The dma_debug_disabled() helper function previously introduced just needs
to check for dma_debug_initialized to allow the caller to proceed or not.
Signed-off-by: Florian Fainelli <f.fainelli@gmail.com>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Jiri Kosina <jkosina@suse.cz>
Cc: Horia Geanta <horia.geanta@freescale.com>
Cc: Brian Norris <computersforpeace@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-12-10 16:41:25 -07:00
|
|
|
return global_disable || !dma_debug_initialized;
|
2014-12-10 16:41:23 -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 */
|
2018-04-24 01:40:51 -06:00
|
|
|
static u32 nr_prealloc_entries = PREALLOC_DMA_DEBUG_ENTRIES;
|
2009-01-09 05:01:56 -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",
|
|
|
|
};
|
|
|
|
|
2020-04-08 13:43:00 -06:00
|
|
|
static const char *type2name[] = {
|
|
|
|
[dma_debug_single] = "single",
|
|
|
|
[dma_debug_sg] = "scather-gather",
|
|
|
|
[dma_debug_coherent] = "coherent",
|
|
|
|
[dma_debug_resource] = "resource",
|
|
|
|
};
|
2009-01-09 06:10:26 -07:00
|
|
|
|
2020-07-16 09:00:16 -06:00
|
|
|
static const char *dir2name[] = {
|
|
|
|
[DMA_BIDIRECTIONAL] = "DMA_BIDIRECTIONAL",
|
|
|
|
[DMA_TO_DEVICE] = "DMA_TO_DEVICE",
|
|
|
|
[DMA_FROM_DEVICE] = "DMA_FROM_DEVICE",
|
|
|
|
[DMA_NONE] = "DMA_NONE",
|
|
|
|
};
|
2009-01-09 06:10:26 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* 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) {
|
2019-10-17 21:18:42 -06:00
|
|
|
pr_warn("Mapped at:\n");
|
2019-04-25 03:45:05 -06:00
|
|
|
stack_trace_print(entry->stack_entries, entry->stack_len, 0);
|
2009-01-19 08:52:39 -07:00
|
|
|
}
|
|
|
|
#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)) { \
|
2018-12-10 07:00:27 -07:00
|
|
|
WARN(1, pr_fmt("%s %s: ") format, \
|
2009-08-19 19:17:08 -06:00
|
|
|
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)
|
2016-07-26 16:21:08 -06:00
|
|
|
__acquires(&dma_entry_hash[idx].lock)
|
2009-01-09 04:34:49 -07:00
|
|
|
{
|
|
|
|
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,
|
2019-11-18 23:18:19 -07:00
|
|
|
unsigned long flags)
|
2016-07-26 16:21:08 -06:00
|
|
|
__releases(&bucket->lock)
|
2009-01-09 04:34:49 -07:00
|
|
|
{
|
2019-11-18 23:18:19 -07:00
|
|
|
spin_unlock_irqrestore(&bucket->lock, flags);
|
2009-01-09 04:34:49 -07:00
|
|
|
}
|
|
|
|
|
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) {
|
2015-04-16 13:43:25 -06:00
|
|
|
entry = __hash_bucket_find(*bucket, ref, containing_match);
|
2011-08-08 13:13:54 -06:00
|
|
|
|
|
|
|
if (entry)
|
|
|
|
return entry;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Nothing found, go back a hash bucket
|
|
|
|
*/
|
2019-11-18 23:18:19 -07:00
|
|
|
put_hash_bucket(*bucket, *flags);
|
2011-08-08 13:13:54 -06:00
|
|
|
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)
|
|
|
|
{
|
2016-08-10 05:22:15 -06:00
|
|
|
if (entry->type == dma_debug_resource)
|
|
|
|
return __pfn_to_phys(entry->pfn) + entry->offset;
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
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);
|
2019-10-28 15:56:46 -06:00
|
|
|
cond_resched();
|
2009-02-12 08:19:13 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
/*
|
2014-03-03 16:38:21 -07:00
|
|
|
* For each mapping (initial cacheline in the case of
|
|
|
|
* dma_alloc_coherent/dma_map_page, initial cacheline in each page of a
|
|
|
|
* scatterlist, or the cacheline specified in dma_map_single) insert
|
|
|
|
* into this tree using the cacheline as the key. At
|
2014-01-21 16:48:12 -07:00
|
|
|
* dma_unmap_{single|sg|page} or dma_free_coherent delete the entry. If
|
2014-03-03 16:38:21 -07:00
|
|
|
* the entry already exists at insertion time add a tag as a reference
|
2014-01-21 16:48:12 -07:00
|
|
|
* count for the overlapping mappings. For now, the overlap tracking
|
2014-03-03 16:38:21 -07:00
|
|
|
* just ensures that 'unmaps' balance 'maps' before marking the
|
|
|
|
* cacheline idle, but we should also be flagging overlaps as an API
|
|
|
|
* violation.
|
2014-01-21 16:48:12 -07:00
|
|
|
*
|
|
|
|
* Memory usage is mostly constrained by the maximum number of available
|
|
|
|
* dma-debug entries in that we need a free dma_debug_entry before
|
2014-03-03 16:38:21 -07:00
|
|
|
* inserting into the tree. In the case of dma_map_page and
|
|
|
|
* dma_alloc_coherent there is only one dma_debug_entry and one
|
|
|
|
* dma_active_cacheline entry to track per event. dma_map_sg(), on the
|
|
|
|
* other hand, consumes a single dma_debug_entry, but inserts 'nents'
|
|
|
|
* entries into the tree.
|
2014-01-21 16:48:12 -07:00
|
|
|
*/
|
2014-03-03 16:38:21 -07:00
|
|
|
static RADIX_TREE(dma_active_cacheline, GFP_NOWAIT);
|
2014-01-21 16:48:12 -07:00
|
|
|
static DEFINE_SPINLOCK(radix_lock);
|
2014-03-03 16:38:21 -07:00
|
|
|
#define ACTIVE_CACHELINE_MAX_OVERLAP ((1 << RADIX_TREE_MAX_TAGS) - 1)
|
|
|
|
#define CACHELINE_PER_PAGE_SHIFT (PAGE_SHIFT - L1_CACHE_SHIFT)
|
|
|
|
#define CACHELINES_PER_PAGE (1 << CACHELINE_PER_PAGE_SHIFT)
|
2014-01-21 16:48:12 -07:00
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
static phys_addr_t to_cacheline_number(struct dma_debug_entry *entry)
|
|
|
|
{
|
|
|
|
return (entry->pfn << CACHELINE_PER_PAGE_SHIFT) +
|
|
|
|
(entry->offset >> L1_CACHE_SHIFT);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int active_cacheline_read_overlap(phys_addr_t cln)
|
2014-01-21 16:48:12 -07:00
|
|
|
{
|
|
|
|
int overlap = 0, i;
|
|
|
|
|
|
|
|
for (i = RADIX_TREE_MAX_TAGS - 1; i >= 0; i--)
|
2014-03-03 16:38:21 -07:00
|
|
|
if (radix_tree_tag_get(&dma_active_cacheline, cln, i))
|
2014-01-21 16:48:12 -07:00
|
|
|
overlap |= 1 << i;
|
|
|
|
return overlap;
|
|
|
|
}
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
static int active_cacheline_set_overlap(phys_addr_t cln, int overlap)
|
2014-01-21 16:48:12 -07:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
if (overlap > ACTIVE_CACHELINE_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)
|
2014-03-03 16:38:21 -07:00
|
|
|
radix_tree_tag_set(&dma_active_cacheline, cln, i);
|
2014-01-21 16:48:12 -07:00
|
|
|
else
|
2014-03-03 16:38:21 -07:00
|
|
|
radix_tree_tag_clear(&dma_active_cacheline, cln, i);
|
2014-01-21 16:48:12 -07:00
|
|
|
|
|
|
|
return overlap;
|
|
|
|
}
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
static void active_cacheline_inc_overlap(phys_addr_t cln)
|
2014-01-21 16:48:12 -07:00
|
|
|
{
|
2014-03-03 16:38:21 -07:00
|
|
|
int overlap = active_cacheline_read_overlap(cln);
|
2014-01-21 16:48:12 -07:00
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
overlap = active_cacheline_set_overlap(cln, ++overlap);
|
2014-01-21 16:48:12 -07:00
|
|
|
|
|
|
|
/* If we overflowed the overlap counter then we're potentially
|
2020-08-14 16:22:43 -06:00
|
|
|
* leaking dma-mappings.
|
2014-01-21 16:48:12 -07:00
|
|
|
*/
|
2014-03-03 16:38:21 -07:00
|
|
|
WARN_ONCE(overlap > ACTIVE_CACHELINE_MAX_OVERLAP,
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_fmt("exceeded %d overlapping mappings of cacheline %pa\n"),
|
2014-03-03 16:38:21 -07:00
|
|
|
ACTIVE_CACHELINE_MAX_OVERLAP, &cln);
|
2014-01-21 16:48:12 -07:00
|
|
|
}
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
static int active_cacheline_dec_overlap(phys_addr_t cln)
|
2014-01-21 16:48:12 -07:00
|
|
|
{
|
2014-03-03 16:38:21 -07:00
|
|
|
int overlap = active_cacheline_read_overlap(cln);
|
2014-01-21 16:48:12 -07:00
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
return active_cacheline_set_overlap(cln, --overlap);
|
2014-01-21 16:48:12 -07:00
|
|
|
}
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
static int active_cacheline_insert(struct dma_debug_entry *entry)
|
2014-01-21 16:48:12 -07:00
|
|
|
{
|
2014-03-03 16:38:21 -07:00
|
|
|
phys_addr_t cln = to_cacheline_number(entry);
|
2014-01-21 16:48:12 -07:00
|
|
|
unsigned long flags;
|
|
|
|
int rc;
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
/* If the device is not writing memory then we don't have any
|
|
|
|
* concerns about the cpu consuming stale data. This mitigates
|
|
|
|
* legitimate usages of overlapping mappings.
|
|
|
|
*/
|
|
|
|
if (entry->direction == DMA_TO_DEVICE)
|
|
|
|
return 0;
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
spin_lock_irqsave(&radix_lock, flags);
|
2014-03-03 16:38:21 -07:00
|
|
|
rc = radix_tree_insert(&dma_active_cacheline, cln, entry);
|
2014-01-21 16:48:12 -07:00
|
|
|
if (rc == -EEXIST)
|
2014-03-03 16:38:21 -07:00
|
|
|
active_cacheline_inc_overlap(cln);
|
2014-01-21 16:48:12 -07:00
|
|
|
spin_unlock_irqrestore(&radix_lock, flags);
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
static void active_cacheline_remove(struct dma_debug_entry *entry)
|
2014-01-21 16:48:12 -07:00
|
|
|
{
|
2014-03-03 16:38:21 -07:00
|
|
|
phys_addr_t cln = to_cacheline_number(entry);
|
2014-01-21 16:48:12 -07:00
|
|
|
unsigned long flags;
|
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
/* ...mirror the insert case */
|
|
|
|
if (entry->direction == DMA_TO_DEVICE)
|
|
|
|
return;
|
|
|
|
|
2014-01-21 16:48:12 -07:00
|
|
|
spin_lock_irqsave(&radix_lock, flags);
|
2014-01-29 15:05:53 -07:00
|
|
|
/* since we are counting overlaps the final put of the
|
2014-03-03 16:38:21 -07:00
|
|
|
* cacheline will occur when the overlap count is 0.
|
|
|
|
* active_cacheline_dec_overlap() returns -1 in that case
|
2014-01-29 15:05:53 -07:00
|
|
|
*/
|
2014-03-03 16:38:21 -07:00
|
|
|
if (active_cacheline_dec_overlap(cln) < 0)
|
|
|
|
radix_tree_delete(&dma_active_cacheline, cln);
|
2014-01-21 16:48:12 -07:00
|
|
|
spin_unlock_irqrestore(&radix_lock, flags);
|
|
|
|
}
|
|
|
|
|
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);
|
2019-11-18 23:18:19 -07:00
|
|
|
put_hash_bucket(bucket, flags);
|
2014-01-21 16:48:12 -07:00
|
|
|
|
2014-03-03 16:38:21 -07:00
|
|
|
rc = active_cacheline_insert(entry);
|
2014-01-21 16:48:12 -07:00
|
|
|
if (rc == -ENOMEM) {
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_err("cacheline tracking ENOMEM, dma-debug disabled\n");
|
2014-01-21 16:48:12 -07:00
|
|
|
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
|
|
|
}
|
|
|
|
|
2018-12-10 07:00:33 -07:00
|
|
|
static int dma_debug_create_entries(gfp_t gfp)
|
2018-12-10 07:00:29 -07:00
|
|
|
{
|
2018-12-10 07:00:33 -07:00
|
|
|
struct dma_debug_entry *entry;
|
2018-12-10 07:00:29 -07:00
|
|
|
int i;
|
|
|
|
|
2018-12-10 07:00:33 -07:00
|
|
|
entry = (void *)get_zeroed_page(gfp);
|
|
|
|
if (!entry)
|
|
|
|
return -ENOMEM;
|
2018-12-10 07:00:29 -07:00
|
|
|
|
2018-12-10 07:00:33 -07:00
|
|
|
for (i = 0; i < DMA_DEBUG_DYNAMIC_ENTRIES; i++)
|
|
|
|
list_add_tail(&entry[i].list, &free_entries);
|
2018-12-10 07:00:29 -07:00
|
|
|
|
2018-12-10 07:00:33 -07:00
|
|
|
num_free_entries += DMA_DEBUG_DYNAMIC_ENTRIES;
|
|
|
|
nr_total_entries += DMA_DEBUG_DYNAMIC_ENTRIES;
|
2018-12-10 07:00:29 -07:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2020-04-17 01:36:05 -06:00
|
|
|
static void __dma_entry_alloc_check_leak(void)
|
2018-12-10 07:00:30 -07:00
|
|
|
{
|
|
|
|
u32 tmp = nr_total_entries % nr_prealloc_entries;
|
|
|
|
|
|
|
|
/* Shout each time we tick over some multiple of the initial pool */
|
|
|
|
if (tmp < DMA_DEBUG_DYNAMIC_ENTRIES) {
|
|
|
|
pr_info("dma_debug_entry pool grown to %u (%u00%%)\n",
|
|
|
|
nr_total_entries,
|
|
|
|
(nr_total_entries / nr_prealloc_entries));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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);
|
2018-12-10 07:00:29 -07:00
|
|
|
if (num_free_entries == 0) {
|
2018-12-10 07:00:33 -07:00
|
|
|
if (dma_debug_create_entries(GFP_ATOMIC)) {
|
2018-12-10 07:00:29 -07:00
|
|
|
global_disable = true;
|
|
|
|
spin_unlock_irqrestore(&free_entries_lock, flags);
|
|
|
|
pr_err("debugging out of memory - disabling\n");
|
|
|
|
return NULL;
|
|
|
|
}
|
2018-12-10 07:00:30 -07:00
|
|
|
__dma_entry_alloc_check_leak();
|
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
|
2019-04-25 03:45:05 -06:00
|
|
|
entry->stack_len = stack_trace_save(entry->stack_entries,
|
|
|
|
ARRAY_SIZE(entry->stack_entries),
|
|
|
|
1);
|
2009-01-19 08:52:39 -07:00
|
|
|
#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-03-03 16:38:21 -07:00
|
|
|
active_cacheline_remove(entry);
|
2014-01-21 16:48:12 -07:00
|
|
|
|
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-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
|
|
|
|
*/
|
|
|
|
|
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])
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_info("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;
|
|
|
|
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_info("enable driver filter for driver [%s]\n",
|
2009-06-08 07:39:24 -06:00
|
|
|
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
|
|
|
};
|
|
|
|
|
2019-01-18 06:44:18 -07:00
|
|
|
static int dump_show(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
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) {
|
|
|
|
seq_printf(seq,
|
|
|
|
"%s %s %s idx %d P=%llx N=%lx D=%llx L=%llx %s %s\n",
|
|
|
|
dev_name(entry->dev),
|
|
|
|
dev_driver_string(entry->dev),
|
|
|
|
type2name[entry->type], idx,
|
|
|
|
phys_addr(entry), entry->pfn,
|
|
|
|
entry->dev_addr, entry->size,
|
|
|
|
dir2name[entry->direction],
|
|
|
|
maperr2str[entry->map_err_type]);
|
|
|
|
}
|
|
|
|
spin_unlock_irqrestore(&bucket->lock, flags);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
DEFINE_SHOW_ATTRIBUTE(dump);
|
|
|
|
|
2019-01-22 08:21:38 -07:00
|
|
|
static void dma_debug_fs_init(void)
|
2009-01-09 05:13:27 -07:00
|
|
|
{
|
2019-01-22 08:21:38 -07:00
|
|
|
struct dentry *dentry = debugfs_create_dir("dma-api", NULL);
|
2009-01-09 05:13:27 -07:00
|
|
|
|
2019-01-22 08:21:38 -07:00
|
|
|
debugfs_create_bool("disabled", 0444, dentry, &global_disable);
|
|
|
|
debugfs_create_u32("error_count", 0444, dentry, &error_count);
|
|
|
|
debugfs_create_u32("all_errors", 0644, dentry, &show_all_errors);
|
|
|
|
debugfs_create_u32("num_errors", 0644, dentry, &show_num_errors);
|
|
|
|
debugfs_create_u32("num_free_entries", 0444, dentry, &num_free_entries);
|
|
|
|
debugfs_create_u32("min_free_entries", 0444, dentry, &min_free_entries);
|
|
|
|
debugfs_create_u32("nr_total_entries", 0444, dentry, &nr_total_entries);
|
|
|
|
debugfs_create_file("driver_filter", 0644, dentry, NULL, &filter_fops);
|
2019-01-18 06:44:18 -07:00
|
|
|
debugfs_create_file("dump", 0444, dentry, NULL, &dump_fops);
|
2009-01-09 05:13:27 -07:00
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
|
|
|
|
for (i = 0; i < HASH_SIZE; ++i) {
|
2017-05-03 15:51:28 -06:00
|
|
|
spin_lock_irqsave(&dma_entry_hash[i].lock, flags);
|
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
|
|
|
}
|
2017-05-03 15:51:28 -06:00
|
|
|
spin_unlock_irqrestore(&dma_entry_hash[i].lock, 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;
|
treewide: Remove uninitialized_var() usage
Using uninitialized_var() is dangerous as it papers over real bugs[1]
(or can in the future), and suppresses unrelated compiler warnings
(e.g. "unused variable"). If the compiler thinks it is uninitialized,
either simply initialize the variable or make compiler changes.
In preparation for removing[2] the[3] macro[4], remove all remaining
needless uses with the following script:
git grep '\buninitialized_var\b' | cut -d: -f1 | sort -u | \
xargs perl -pi -e \
's/\buninitialized_var\(([^\)]+)\)/\1/g;
s:\s*/\* (GCC be quiet|to make compiler happy) \*/$::g;'
drivers/video/fbdev/riva/riva_hw.c was manually tweaked to avoid
pathological white-space.
No outstanding warnings were found building allmodconfig with GCC 9.3.0
for x86_64, i386, arm64, arm, powerpc, powerpc64le, s390x, mips, sparc64,
alpha, and m68k.
[1] https://lore.kernel.org/lkml/20200603174714.192027-1-glider@google.com/
[2] https://lore.kernel.org/lkml/CA+55aFw+Vbj0i=1TGqCR5vQkCzWJ0QxK6CernOU6eedsudAixw@mail.gmail.com/
[3] https://lore.kernel.org/lkml/CA+55aFwgbgqhbp1fkxvRKEpzyR5J8n1vKT1VZdz9knmPuXhOeg@mail.gmail.com/
[4] https://lore.kernel.org/lkml/CA+55aFz2500WfbKXAx8s67wrm9=yVJu65TpLgN_ybYNv0VEOKA@mail.gmail.com/
Reviewed-by: Leon Romanovsky <leonro@mellanox.com> # drivers/infiniband and mlx4/mlx5
Acked-by: Jason Gunthorpe <jgg@mellanox.com> # IB
Acked-by: Kalle Valo <kvalo@codeaurora.org> # wireless drivers
Reviewed-by: Chao Yu <yuchao0@huawei.com> # erofs
Signed-off-by: Kees Cook <keescook@chromium.org>
2020-06-03 14:09:38 -06:00
|
|
|
struct dma_debug_entry *entry;
|
2009-05-22 09:16:04 -06:00
|
|
|
int count;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (dma_debug_disabled())
|
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;
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, entry, "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;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (dma_debug_disabled())
|
2009-12-17 17:00:36 -07:00
|
|
|
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
|
|
|
|
2018-04-16 09:22:28 -06:00
|
|
|
static int dma_debug_init(void)
|
2009-01-09 04:54:42 -07:00
|
|
|
{
|
2018-12-10 07:00:33 -07:00
|
|
|
int i, nr_pages;
|
2009-01-09 04:54:42 -07:00
|
|
|
|
dma-debug: prevent early callers from crashing
dma_debug_init() is called by architecture specific code at different
levels, but typically as a fs_initcall due to the debugfs initialization.
Some platforms may have early callers of the DMA-API, running prior to the
fs_initcall() level, which is not much of an issue unless
CONFIG_DMA_API_DEBUG is set. When the DMA-API debugging facilities are
turned on a caller will go through:
debug_dma_map_{single,page}
-> dma_mapping_error (inline function usually)
-> debug_dma_mapping_error
-> get_hash_bucket
Calling get_hash_bucket() returns a valid hash value since we hash on high
bits of the dma_addr cookie, but we will grab an unitialized spinlock,
which typically won't crash but produce a warning, the real crash will
however happen during the bucket list traversal because the list has not
been initialized yet.
An obvious solution is of course to move some of the offenders to run
after the fs_initcall level, but since this might not always be an option,
we add a flag "dma_debug_initialized" which is set to false by default,
and set to true once dma_debug_init() has had a chance to run.
The dma_debug_disabled() helper function previously introduced just needs
to check for dma_debug_initialized to allow the caller to proceed or not.
Signed-off-by: Florian Fainelli <f.fainelli@gmail.com>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Jiri Kosina <jkosina@suse.cz>
Cc: Horia Geanta <horia.geanta@freescale.com>
Cc: Brian Norris <computersforpeace@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-12-10 16:41:25 -07:00
|
|
|
/* Do not use dma_debug_initialized here, since we really want to be
|
|
|
|
* called to set dma_debug_initialized
|
|
|
|
*/
|
|
|
|
if (global_disable)
|
2018-04-16 09:22:28 -06:00
|
|
|
return 0;
|
2009-01-09 04:54:42 -07:00
|
|
|
|
|
|
|
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
|
|
|
}
|
|
|
|
|
2019-01-22 08:21:38 -07:00
|
|
|
dma_debug_fs_init();
|
2009-01-09 05:13:27 -07:00
|
|
|
|
2018-12-10 07:00:33 -07:00
|
|
|
nr_pages = DIV_ROUND_UP(nr_prealloc_entries, DMA_DEBUG_DYNAMIC_ENTRIES);
|
|
|
|
for (i = 0; i < nr_pages; ++i)
|
|
|
|
dma_debug_create_entries(GFP_KERNEL);
|
|
|
|
if (num_free_entries >= nr_prealloc_entries) {
|
|
|
|
pr_info("preallocated %d debug entries\n", nr_total_entries);
|
|
|
|
} else if (num_free_entries > 0) {
|
|
|
|
pr_warn("%d debug entries requested but only %d allocated\n",
|
|
|
|
nr_prealloc_entries, nr_total_entries);
|
|
|
|
} else {
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_err("debugging out of memory error - disabled\n");
|
2009-01-09 04:54:42 -07:00
|
|
|
global_disable = true;
|
|
|
|
|
2018-04-16 09:22:28 -06:00
|
|
|
return 0;
|
2009-01-09 04:54:42 -07:00
|
|
|
}
|
2018-12-10 07:00:29 -07:00
|
|
|
min_free_entries = num_free_entries;
|
2009-04-15 03:22:41 -06:00
|
|
|
|
dma-debug: prevent early callers from crashing
dma_debug_init() is called by architecture specific code at different
levels, but typically as a fs_initcall due to the debugfs initialization.
Some platforms may have early callers of the DMA-API, running prior to the
fs_initcall() level, which is not much of an issue unless
CONFIG_DMA_API_DEBUG is set. When the DMA-API debugging facilities are
turned on a caller will go through:
debug_dma_map_{single,page}
-> dma_mapping_error (inline function usually)
-> debug_dma_mapping_error
-> get_hash_bucket
Calling get_hash_bucket() returns a valid hash value since we hash on high
bits of the dma_addr cookie, but we will grab an unitialized spinlock,
which typically won't crash but produce a warning, the real crash will
however happen during the bucket list traversal because the list has not
been initialized yet.
An obvious solution is of course to move some of the offenders to run
after the fs_initcall level, but since this might not always be an option,
we add a flag "dma_debug_initialized" which is set to false by default,
and set to true once dma_debug_init() has had a chance to run.
The dma_debug_disabled() helper function previously introduced just needs
to check for dma_debug_initialized to allow the caller to proceed or not.
Signed-off-by: Florian Fainelli <f.fainelli@gmail.com>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Jiri Kosina <jkosina@suse.cz>
Cc: Horia Geanta <horia.geanta@freescale.com>
Cc: Brian Norris <computersforpeace@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-12-10 16:41:25 -07:00
|
|
|
dma_debug_initialized = true;
|
|
|
|
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_info("debugging enabled by kernel config\n");
|
2018-04-16 09:22:28 -06:00
|
|
|
return 0;
|
2009-01-09 04:54:42 -07:00
|
|
|
}
|
2018-04-16 09:22:28 -06:00
|
|
|
core_initcall(dma_debug_init);
|
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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_info("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)
|
|
|
|
{
|
|
|
|
if (!str)
|
|
|
|
return -EINVAL;
|
2018-04-24 01:40:51 -06:00
|
|
|
if (!get_option(&str, &nr_prealloc_entries))
|
|
|
|
nr_prealloc_entries = PREALLOC_DMA_DEBUG_ENTRIES;
|
2009-01-09 05:01:56 -07:00
|
|
|
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 */
|
2019-11-18 23:18:19 -07:00
|
|
|
put_hash_bucket(bucket, flags);
|
2013-03-22 16:04:48 -06:00
|
|
|
|
2012-11-03 17:00:07 -06:00
|
|
|
if (dma_mapping_error(ref->dev, ref->dev_addr)) {
|
|
|
|
err_printk(ref->dev, NULL,
|
2018-12-10 07:00:27 -07:00
|
|
|
"device driver tries to free an "
|
2013-03-22 16:04:48 -06:00
|
|
|
"invalid DMA memory address\n");
|
|
|
|
} else {
|
|
|
|
err_printk(ref->dev, NULL,
|
2018-12-10 07:00:27 -07:00
|
|
|
"device driver tries to free DMA "
|
2013-03-22 16:04:48 -06:00
|
|
|
"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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(ref->dev, entry, "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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(ref->dev, entry, "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))) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(ref->dev, entry, "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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(ref->dev, entry, "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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(ref->dev, entry, "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]);
|
|
|
|
}
|
|
|
|
|
2017-02-22 16:40:09 -07:00
|
|
|
/*
|
|
|
|
* Drivers should use dma_mapping_error() to check the returned
|
|
|
|
* addresses of dma_map_single() and dma_map_page().
|
2020-06-23 01:09:10 -06:00
|
|
|
* If not, print this warning message. See Documentation/core-api/dma-api.rst.
|
2017-02-22 16:40:09 -07:00
|
|
|
*/
|
2012-10-08 11:08:06 -06:00
|
|
|
if (entry->map_err_type == MAP_ERR_NOT_CHECKED) {
|
|
|
|
err_printk(ref->dev, entry,
|
2018-12-10 07:00:27 -07:00
|
|
|
"device driver failed to check map error"
|
2012-10-08 11:08:06 -06:00
|
|
|
"[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);
|
|
|
|
|
2019-11-18 23:18:19 -07:00
|
|
|
put_hash_bucket(bucket, flags);
|
2009-01-09 06:10:26 -07:00
|
|
|
}
|
|
|
|
|
2016-08-11 03:35:22 -06:00
|
|
|
static void check_for_stack(struct device *dev,
|
|
|
|
struct page *page, size_t offset)
|
2009-01-09 06:10:26 -07:00
|
|
|
{
|
2016-08-11 03:35:22 -06:00
|
|
|
void *addr;
|
|
|
|
struct vm_struct *stack_vm_area = task_stack_vm_area(current);
|
|
|
|
|
|
|
|
if (!stack_vm_area) {
|
|
|
|
/* Stack is direct-mapped. */
|
|
|
|
if (PageHighMem(page))
|
|
|
|
return;
|
|
|
|
addr = page_address(page) + offset;
|
|
|
|
if (object_is_on_stack(addr))
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "device driver maps memory from stack [addr=%p]\n", addr);
|
2016-08-11 03:35:22 -06:00
|
|
|
} else {
|
|
|
|
/* Stack is vmalloced. */
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < stack_vm_area->nr_pages; i++) {
|
|
|
|
if (page != stack_vm_area->pages[i])
|
|
|
|
continue;
|
|
|
|
|
|
|
|
addr = (u8 *)current->stack + i * PAGE_SIZE + offset;
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "device driver maps memory from stack [probable addr=%p]\n", addr);
|
2016-08-11 03:35:22 -06:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
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
|
|
|
{
|
2016-01-14 16:16:50 -07:00
|
|
|
if (overlap(addr, len, _stext, _etext) ||
|
2009-07-10 13:38:02 -06:00
|
|
|
overlap(addr, len, __start_rodata, __end_rodata))
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, entry, "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) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, entry, "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))
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, entry, "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))
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, entry, "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
|
|
|
|
2015-11-06 17:32:55 -07:00
|
|
|
if (ref->sg_call_ents && ref->type == dma_debug_sg &&
|
|
|
|
ref->sg_call_ents != entry->sg_call_ents) {
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(ref->dev, entry, "device driver syncs "
|
2015-11-06 17:32:55 -07:00
|
|
|
"DMA sg list with different entry count "
|
|
|
|
"[map count=%d] [sync count=%d]\n",
|
|
|
|
entry->sg_call_ents, ref->sg_call_ents);
|
|
|
|
}
|
|
|
|
|
2009-01-09 06:10:26 -07:00
|
|
|
out:
|
2019-11-18 23:18:19 -07:00
|
|
|
put_hash_bucket(bucket, flags);
|
2009-01-09 06:10:26 -07:00
|
|
|
}
|
|
|
|
|
2018-05-21 05:35:13 -06:00
|
|
|
static void check_sg_segment(struct device *dev, struct scatterlist *sg)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_DMA_API_DEBUG_SG
|
|
|
|
unsigned int max_seg = dma_get_max_seg_size(dev);
|
|
|
|
u64 start, end, boundary = dma_get_seg_boundary(dev);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Either the driver forgot to set dma_parms appropriately, or
|
|
|
|
* whoever generated the list forgot to check them.
|
|
|
|
*/
|
|
|
|
if (sg->length > max_seg)
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "mapping sg segment longer than device claims to support [len=%u] [max=%u]\n",
|
2018-05-21 05:35:13 -06:00
|
|
|
sg->length, max_seg);
|
|
|
|
/*
|
|
|
|
* In some cases this could potentially be the DMA API
|
|
|
|
* implementation's fault, but it would usually imply that
|
|
|
|
* the scatterlist was built inappropriately to begin with.
|
|
|
|
*/
|
|
|
|
start = sg_dma_address(sg);
|
|
|
|
end = start + sg_dma_len(sg) - 1;
|
|
|
|
if ((start ^ end) & ~boundary)
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "mapping sg segment across boundary [start=0x%016llx] [end=0x%016llx] [boundary=0x%016llx]\n",
|
2018-05-21 05:35:13 -06:00
|
|
|
start, end, boundary);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2018-10-08 01:20:07 -06:00
|
|
|
void debug_dma_map_single(struct device *dev, const void *addr,
|
|
|
|
unsigned long len)
|
|
|
|
{
|
|
|
|
if (unlikely(dma_debug_disabled()))
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!virt_addr_valid(addr))
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "device driver maps memory from invalid area [addr=%p] [len=%lu]\n",
|
2018-10-08 01:20:07 -06:00
|
|
|
addr, len);
|
|
|
|
|
|
|
|
if (is_vmalloc_addr(addr))
|
2018-12-10 07:00:27 -07:00
|
|
|
err_printk(dev, NULL, "device driver maps memory from vmalloc area [addr=%p] [len=%lu]\n",
|
2018-10-08 01:20:07 -06:00
|
|
|
addr, len);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_map_single);
|
|
|
|
|
2009-01-09 06:14:49 -07:00
|
|
|
void debug_dma_map_page(struct device *dev, struct page *page, size_t offset,
|
2018-12-25 00:50:35 -07:00
|
|
|
size_t size, int direction, dma_addr_t dma_addr)
|
2009-01-09 06:14:49 -07:00
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:14:49 -07:00
|
|
|
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;
|
2018-12-25 00:50:35 -07:00
|
|
|
entry->type = dma_debug_single;
|
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
|
|
|
|
2016-08-11 03:35:22 -06:00
|
|
|
check_for_stack(dev, page, offset);
|
|
|
|
|
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_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;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2012-10-08 11:08:06 -06:00
|
|
|
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
|
|
|
|
2019-11-18 23:18:19 -07:00
|
|
|
put_hash_bucket(bucket, flags);
|
2012-10-08 11:08:06 -06:00
|
|
|
}
|
|
|
|
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,
|
2018-12-25 00:50:35 -07:00
|
|
|
size_t size, int direction)
|
2009-01-09 06:14:49 -07:00
|
|
|
{
|
|
|
|
struct dma_debug_entry ref = {
|
2018-12-25 00:50:35 -07:00
|
|
|
.type = dma_debug_single,
|
2009-01-09 06:14:49 -07:00
|
|
|
.dev = dev,
|
|
|
|
.dev_addr = addr,
|
|
|
|
.size = size,
|
|
|
|
.direction = direction,
|
|
|
|
};
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:14:49 -07:00
|
|
|
return;
|
|
|
|
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;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:19:54 -07:00
|
|
|
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;
|
|
|
|
|
2016-08-11 03:35:22 -06:00
|
|
|
check_for_stack(dev, sg_page(s), s->offset);
|
|
|
|
|
2009-03-23 08:35:08 -06:00
|
|
|
if (!PageHighMem(sg_page(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
|
|
|
|
2018-05-21 05:35:13 -06:00
|
|
|
check_sg_segment(dev, s);
|
|
|
|
|
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;
|
2019-11-18 23:18:19 -07:00
|
|
|
put_hash_bucket(bucket, flags);
|
2009-05-26 18:43:03 -06:00
|
|
|
|
|
|
|
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;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:19:54 -07:00
|
|
|
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;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:38:50 -07:00
|
|
|
return;
|
|
|
|
|
|
|
|
if (unlikely(virt == NULL))
|
|
|
|
return;
|
|
|
|
|
2018-02-22 04:22:20 -07:00
|
|
|
/* handle vmalloc and linear addresses */
|
|
|
|
if (!is_vmalloc_addr(virt) && !virt_addr_valid(virt))
|
2009-01-09 06:38:50 -07:00
|
|
|
return;
|
|
|
|
|
2018-02-22 04:22:20 -07:00
|
|
|
entry = dma_entry_alloc();
|
|
|
|
if (!entry)
|
2017-11-17 16:26:19 -07:00
|
|
|
return;
|
|
|
|
|
2009-01-09 06:38:50 -07:00
|
|
|
entry->type = dma_debug_coherent;
|
|
|
|
entry->dev = dev;
|
2017-04-21 19:18:05 -06:00
|
|
|
entry->offset = offset_in_page(virt);
|
2009-01-09 06:38:50 -07:00
|
|
|
entry->size = size;
|
|
|
|
entry->dev_addr = dma_addr;
|
|
|
|
entry->direction = DMA_BIDIRECTIONAL;
|
|
|
|
|
2017-11-17 16:26:19 -07:00
|
|
|
if (is_vmalloc_addr(virt))
|
|
|
|
entry->pfn = vmalloc_to_pfn(virt);
|
|
|
|
else
|
|
|
|
entry->pfn = page_to_pfn(virt_to_page(virt));
|
|
|
|
|
2009-01-09 06:38:50 -07:00
|
|
|
add_dma_entry(entry);
|
|
|
|
}
|
|
|
|
|
|
|
|
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,
|
2017-04-21 19:18:05 -06:00
|
|
|
.offset = offset_in_page(virt),
|
2009-01-09 06:38:50 -07:00
|
|
|
.dev_addr = addr,
|
|
|
|
.size = size,
|
|
|
|
.direction = DMA_BIDIRECTIONAL,
|
|
|
|
};
|
|
|
|
|
2017-11-17 16:26:19 -07:00
|
|
|
/* handle vmalloc and linear addresses */
|
2018-02-22 04:22:20 -07:00
|
|
|
if (!is_vmalloc_addr(virt) && !virt_addr_valid(virt))
|
2017-11-17 16:26:19 -07:00
|
|
|
return;
|
|
|
|
|
|
|
|
if (is_vmalloc_addr(virt))
|
|
|
|
ref.pfn = vmalloc_to_pfn(virt);
|
|
|
|
else
|
|
|
|
ref.pfn = page_to_pfn(virt_to_page(virt));
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:38:50 -07:00
|
|
|
return;
|
|
|
|
|
|
|
|
check_unmap(&ref);
|
|
|
|
}
|
|
|
|
|
2016-08-10 05:22:15 -06:00
|
|
|
void debug_dma_map_resource(struct device *dev, phys_addr_t addr, size_t size,
|
|
|
|
int direction, dma_addr_t dma_addr)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry *entry;
|
|
|
|
|
|
|
|
if (unlikely(dma_debug_disabled()))
|
|
|
|
return;
|
|
|
|
|
|
|
|
entry = dma_entry_alloc();
|
|
|
|
if (!entry)
|
|
|
|
return;
|
|
|
|
|
|
|
|
entry->type = dma_debug_resource;
|
|
|
|
entry->dev = dev;
|
2016-09-29 13:59:15 -06:00
|
|
|
entry->pfn = PHYS_PFN(addr);
|
2016-08-10 05:22:15 -06:00
|
|
|
entry->offset = offset_in_page(addr);
|
|
|
|
entry->size = size;
|
|
|
|
entry->dev_addr = dma_addr;
|
|
|
|
entry->direction = direction;
|
|
|
|
entry->map_err_type = MAP_ERR_NOT_CHECKED;
|
|
|
|
|
|
|
|
add_dma_entry(entry);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_map_resource);
|
|
|
|
|
|
|
|
void debug_dma_unmap_resource(struct device *dev, dma_addr_t dma_addr,
|
|
|
|
size_t size, int direction)
|
|
|
|
{
|
|
|
|
struct dma_debug_entry ref = {
|
|
|
|
.type = dma_debug_resource,
|
|
|
|
.dev = dev,
|
|
|
|
.dev_addr = dma_addr,
|
|
|
|
.size = size,
|
|
|
|
.direction = direction,
|
|
|
|
};
|
|
|
|
|
|
|
|
if (unlikely(dma_debug_disabled()))
|
|
|
|
return;
|
|
|
|
|
|
|
|
check_unmap(&ref);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(debug_dma_unmap_resource);
|
|
|
|
|
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;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:43:04 -07:00
|
|
|
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;
|
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 06:43:04 -07:00
|
|
|
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 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
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 07:01:12 -07:00
|
|
|
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
|
|
|
|
2014-12-10 16:41:23 -07:00
|
|
|
if (unlikely(dma_debug_disabled()))
|
2009-01-09 07:01:12 -07:00
|
|
|
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])
|
2018-12-10 07:00:27 -07:00
|
|
|
pr_info("enable driver filter for driver [%s]\n",
|
2009-06-08 07:39:24 -06:00
|
|
|
current_driver_name);
|
2009-05-22 13:49:51 -06:00
|
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
__setup("dma_debug_driver=", dma_debug_driver_setup);
|