1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3 * Copyright (C) 2008 Advanced Micro Devices, Inc.
4 *
5 * Author: Joerg Roedel <joerg.roedel@amd.com>
6 */
7
8 #define pr_fmt(fmt) "DMA-API: " fmt
9
10 #include <linux/sched/task_stack.h>
11 #include <linux/scatterlist.h>
12 #include <linux/dma-map-ops.h>
13 #include <linux/sched/task.h>
14 #include <linux/stacktrace.h>
15 #include <linux/spinlock.h>
16 #include <linux/vmalloc.h>
17 #include <linux/debugfs.h>
18 #include <linux/uaccess.h>
19 #include <linux/export.h>
20 #include <linux/device.h>
21 #include <linux/types.h>
22 #include <linux/sched.h>
23 #include <linux/ctype.h>
24 #include <linux/list.h>
25 #include <linux/slab.h>
26 #include <asm/sections.h>
27 #include "debug.h"
28
29 #define HASH_SIZE 16384ULL
30 #define HASH_FN_SHIFT 13
31 #define HASH_FN_MASK (HASH_SIZE - 1)
32
33 #define PREALLOC_DMA_DEBUG_ENTRIES (1 << 16)
34 /* If the pool runs out, add this many new entries at once */
35 #define DMA_DEBUG_DYNAMIC_ENTRIES (PAGE_SIZE / sizeof(struct dma_debug_entry))
36
37 enum {
38 dma_debug_single,
39 dma_debug_sg,
40 dma_debug_coherent,
41 dma_debug_resource,
42 };
43
44 enum map_err_types {
45 MAP_ERR_CHECK_NOT_APPLICABLE,
46 MAP_ERR_NOT_CHECKED,
47 MAP_ERR_CHECKED,
48 };
49
50 #define DMA_DEBUG_STACKTRACE_ENTRIES 5
51
52 /**
53 * struct dma_debug_entry - track a dma_map* or dma_alloc_coherent mapping
54 * @list: node on pre-allocated free_entries list
55 * @dev: 'dev' argument to dma_map_{page|single|sg} or dma_alloc_coherent
56 * @size: length of the mapping
57 * @type: single, page, sg, coherent
58 * @direction: enum dma_data_direction
59 * @sg_call_ents: 'nents' from dma_map_sg
60 * @sg_mapped_ents: 'mapped_ents' from dma_map_sg
61 * @pfn: page frame of the start address
62 * @offset: offset of mapping relative to pfn
63 * @map_err_type: track whether dma_mapping_error() was checked
64 * @stacktrace: support backtraces when a violation is detected
65 */
66 struct dma_debug_entry {
67 struct list_head list;
68 struct device *dev;
69 u64 dev_addr;
70 u64 size;
71 int type;
72 int direction;
73 int sg_call_ents;
74 int sg_mapped_ents;
75 unsigned long pfn;
76 size_t offset;
77 enum map_err_types map_err_type;
78 #ifdef CONFIG_STACKTRACE
79 unsigned int stack_len;
80 unsigned long stack_entries[DMA_DEBUG_STACKTRACE_ENTRIES];
81 #endif
82 } ____cacheline_aligned_in_smp;
83
84 typedef bool (*match_fn)(struct dma_debug_entry *, struct dma_debug_entry *);
85
86 struct hash_bucket {
87 struct list_head list;
88 spinlock_t lock;
89 };
90
91 /* Hash list to save the allocated dma addresses */
92 static struct hash_bucket dma_entry_hash[HASH_SIZE];
93 /* List of pre-allocated dma_debug_entry's */
94 static LIST_HEAD(free_entries);
95 /* Lock for the list above */
96 static DEFINE_SPINLOCK(free_entries_lock);
97
98 /* Global disable flag - will be set in case of an error */
99 static bool global_disable __read_mostly;
100
101 /* Early initialization disable flag, set at the end of dma_debug_init */
102 static bool dma_debug_initialized __read_mostly;
103
dma_debug_disabled(void)104 static inline bool dma_debug_disabled(void)
105 {
106 return global_disable || !dma_debug_initialized;
107 }
108
109 /* Global error count */
110 static u32 error_count;
111
112 /* Global error show enable*/
113 static u32 show_all_errors __read_mostly;
114 /* Number of errors to show */
115 static u32 show_num_errors = 1;
116
117 static u32 num_free_entries;
118 static u32 min_free_entries;
119 static u32 nr_total_entries;
120
121 /* number of preallocated entries requested by kernel cmdline */
122 static u32 nr_prealloc_entries = PREALLOC_DMA_DEBUG_ENTRIES;
123
124 /* per-driver filter related state */
125
126 #define NAME_MAX_LEN 64
127
128 static char current_driver_name[NAME_MAX_LEN] __read_mostly;
129 static struct device_driver *current_driver __read_mostly;
130
131 static DEFINE_RWLOCK(driver_name_lock);
132
133 static const char *const maperr2str[] = {
134 [MAP_ERR_CHECK_NOT_APPLICABLE] = "dma map error check not applicable",
135 [MAP_ERR_NOT_CHECKED] = "dma map error not checked",
136 [MAP_ERR_CHECKED] = "dma map error checked",
137 };
138
139 static const char *type2name[] = {
140 [dma_debug_single] = "single",
141 [dma_debug_sg] = "scather-gather",
142 [dma_debug_coherent] = "coherent",
143 [dma_debug_resource] = "resource",
144 };
145
146 static const char *dir2name[] = {
147 [DMA_BIDIRECTIONAL] = "DMA_BIDIRECTIONAL",
148 [DMA_TO_DEVICE] = "DMA_TO_DEVICE",
149 [DMA_FROM_DEVICE] = "DMA_FROM_DEVICE",
150 [DMA_NONE] = "DMA_NONE",
151 };
152
153 /*
154 * The access to some variables in this macro is racy. We can't use atomic_t
155 * here because all these variables are exported to debugfs. Some of them even
156 * writeable. This is also the reason why a lock won't help much. But anyway,
157 * the races are no big deal. Here is why:
158 *
159 * error_count: the addition is racy, but the worst thing that can happen is
160 * that we don't count some errors
161 * show_num_errors: the subtraction is racy. Also no big deal because in
162 * worst case this will result in one warning more in the
163 * system log than the user configured. This variable is
164 * writeable via debugfs.
165 */
dump_entry_trace(struct dma_debug_entry * entry)166 static inline void dump_entry_trace(struct dma_debug_entry *entry)
167 {
168 #ifdef CONFIG_STACKTRACE
169 if (entry) {
170 pr_warn("Mapped at:\n");
171 stack_trace_print(entry->stack_entries, entry->stack_len, 0);
172 }
173 #endif
174 }
175
driver_filter(struct device * dev)176 static bool driver_filter(struct device *dev)
177 {
178 struct device_driver *drv;
179 unsigned long flags;
180 bool ret;
181
182 /* driver filter off */
183 if (likely(!current_driver_name[0]))
184 return true;
185
186 /* driver filter on and initialized */
187 if (current_driver && dev && dev->driver == current_driver)
188 return true;
189
190 /* driver filter on, but we can't filter on a NULL device... */
191 if (!dev)
192 return false;
193
194 if (current_driver || !current_driver_name[0])
195 return false;
196
197 /* driver filter on but not yet initialized */
198 drv = dev->driver;
199 if (!drv)
200 return false;
201
202 /* lock to protect against change of current_driver_name */
203 read_lock_irqsave(&driver_name_lock, flags);
204
205 ret = false;
206 if (drv->name &&
207 strncmp(current_driver_name, drv->name, NAME_MAX_LEN - 1) == 0) {
208 current_driver = drv;
209 ret = true;
210 }
211
212 read_unlock_irqrestore(&driver_name_lock, flags);
213
214 return ret;
215 }
216
217 #define err_printk(dev, entry, format, arg...) do { \
218 error_count += 1; \
219 if (driver_filter(dev) && \
220 (show_all_errors || show_num_errors > 0)) { \
221 WARN(1, pr_fmt("%s %s: ") format, \
222 dev ? dev_driver_string(dev) : "NULL", \
223 dev ? dev_name(dev) : "NULL", ## arg); \
224 dump_entry_trace(entry); \
225 } \
226 if (!show_all_errors && show_num_errors > 0) \
227 show_num_errors -= 1; \
228 } while (0);
229
230 /*
231 * Hash related functions
232 *
233 * Every DMA-API request is saved into a struct dma_debug_entry. To
234 * have quick access to these structs they are stored into a hash.
235 */
hash_fn(struct dma_debug_entry * entry)236 static int hash_fn(struct dma_debug_entry *entry)
237 {
238 /*
239 * Hash function is based on the dma address.
240 * We use bits 20-27 here as the index into the hash
241 */
242 return (entry->dev_addr >> HASH_FN_SHIFT) & HASH_FN_MASK;
243 }
244
245 /*
246 * Request exclusive access to a hash bucket for a given dma_debug_entry.
247 */
get_hash_bucket(struct dma_debug_entry * entry,unsigned long * flags)248 static struct hash_bucket *get_hash_bucket(struct dma_debug_entry *entry,
249 unsigned long *flags)
250 __acquires(&dma_entry_hash[idx].lock)
251 {
252 int idx = hash_fn(entry);
253 unsigned long __flags;
254
255 spin_lock_irqsave(&dma_entry_hash[idx].lock, __flags);
256 *flags = __flags;
257 return &dma_entry_hash[idx];
258 }
259
260 /*
261 * Give up exclusive access to the hash bucket
262 */
put_hash_bucket(struct hash_bucket * bucket,unsigned long flags)263 static void put_hash_bucket(struct hash_bucket *bucket,
264 unsigned long flags)
265 __releases(&bucket->lock)
266 {
267 spin_unlock_irqrestore(&bucket->lock, flags);
268 }
269
exact_match(struct dma_debug_entry * a,struct dma_debug_entry * b)270 static bool exact_match(struct dma_debug_entry *a, struct dma_debug_entry *b)
271 {
272 return ((a->dev_addr == b->dev_addr) &&
273 (a->dev == b->dev)) ? true : false;
274 }
275
containing_match(struct dma_debug_entry * a,struct dma_debug_entry * b)276 static bool containing_match(struct dma_debug_entry *a,
277 struct dma_debug_entry *b)
278 {
279 if (a->dev != b->dev)
280 return false;
281
282 if ((b->dev_addr <= a->dev_addr) &&
283 ((b->dev_addr + b->size) >= (a->dev_addr + a->size)))
284 return true;
285
286 return false;
287 }
288
289 /*
290 * Search a given entry in the hash bucket list
291 */
__hash_bucket_find(struct hash_bucket * bucket,struct dma_debug_entry * ref,match_fn match)292 static struct dma_debug_entry *__hash_bucket_find(struct hash_bucket *bucket,
293 struct dma_debug_entry *ref,
294 match_fn match)
295 {
296 struct dma_debug_entry *entry, *ret = NULL;
297 int matches = 0, match_lvl, last_lvl = -1;
298
299 list_for_each_entry(entry, &bucket->list, list) {
300 if (!match(ref, entry))
301 continue;
302
303 /*
304 * Some drivers map the same physical address multiple
305 * times. Without a hardware IOMMU this results in the
306 * same device addresses being put into the dma-debug
307 * hash multiple times too. This can result in false
308 * positives being reported. Therefore we implement a
309 * best-fit algorithm here which returns the entry from
310 * the hash which fits best to the reference value
311 * instead of the first-fit.
312 */
313 matches += 1;
314 match_lvl = 0;
315 entry->size == ref->size ? ++match_lvl : 0;
316 entry->type == ref->type ? ++match_lvl : 0;
317 entry->direction == ref->direction ? ++match_lvl : 0;
318 entry->sg_call_ents == ref->sg_call_ents ? ++match_lvl : 0;
319
320 if (match_lvl == 4) {
321 /* perfect-fit - return the result */
322 return entry;
323 } else if (match_lvl > last_lvl) {
324 /*
325 * We found an entry that fits better then the
326 * previous one or it is the 1st match.
327 */
328 last_lvl = match_lvl;
329 ret = entry;
330 }
331 }
332
333 /*
334 * If we have multiple matches but no perfect-fit, just return
335 * NULL.
336 */
337 ret = (matches == 1) ? ret : NULL;
338
339 return ret;
340 }
341
bucket_find_exact(struct hash_bucket * bucket,struct dma_debug_entry * ref)342 static struct dma_debug_entry *bucket_find_exact(struct hash_bucket *bucket,
343 struct dma_debug_entry *ref)
344 {
345 return __hash_bucket_find(bucket, ref, exact_match);
346 }
347
bucket_find_contain(struct hash_bucket ** bucket,struct dma_debug_entry * ref,unsigned long * flags)348 static struct dma_debug_entry *bucket_find_contain(struct hash_bucket **bucket,
349 struct dma_debug_entry *ref,
350 unsigned long *flags)
351 {
352
353 unsigned int max_range = dma_get_max_seg_size(ref->dev);
354 struct dma_debug_entry *entry, index = *ref;
355 unsigned int range = 0;
356
357 while (range <= max_range) {
358 entry = __hash_bucket_find(*bucket, ref, containing_match);
359
360 if (entry)
361 return entry;
362
363 /*
364 * Nothing found, go back a hash bucket
365 */
366 put_hash_bucket(*bucket, *flags);
367 range += (1 << HASH_FN_SHIFT);
368 index.dev_addr -= (1 << HASH_FN_SHIFT);
369 *bucket = get_hash_bucket(&index, flags);
370 }
371
372 return NULL;
373 }
374
375 /*
376 * Add an entry to a hash bucket
377 */
hash_bucket_add(struct hash_bucket * bucket,struct dma_debug_entry * entry)378 static void hash_bucket_add(struct hash_bucket *bucket,
379 struct dma_debug_entry *entry)
380 {
381 list_add_tail(&entry->list, &bucket->list);
382 }
383
384 /*
385 * Remove entry from a hash bucket list
386 */
hash_bucket_del(struct dma_debug_entry * entry)387 static void hash_bucket_del(struct dma_debug_entry *entry)
388 {
389 list_del(&entry->list);
390 }
391
phys_addr(struct dma_debug_entry * entry)392 static unsigned long long phys_addr(struct dma_debug_entry *entry)
393 {
394 if (entry->type == dma_debug_resource)
395 return __pfn_to_phys(entry->pfn) + entry->offset;
396
397 return page_to_phys(pfn_to_page(entry->pfn)) + entry->offset;
398 }
399
400 /*
401 * Dump mapping entries for debugging purposes
402 */
debug_dma_dump_mappings(struct device * dev)403 void debug_dma_dump_mappings(struct device *dev)
404 {
405 int idx;
406
407 for (idx = 0; idx < HASH_SIZE; idx++) {
408 struct hash_bucket *bucket = &dma_entry_hash[idx];
409 struct dma_debug_entry *entry;
410 unsigned long flags;
411
412 spin_lock_irqsave(&bucket->lock, flags);
413
414 list_for_each_entry(entry, &bucket->list, list) {
415 if (!dev || dev == entry->dev) {
416 dev_info(entry->dev,
417 "%s idx %d P=%Lx N=%lx D=%Lx L=%Lx %s %s\n",
418 type2name[entry->type], idx,
419 phys_addr(entry), entry->pfn,
420 entry->dev_addr, entry->size,
421 dir2name[entry->direction],
422 maperr2str[entry->map_err_type]);
423 }
424 }
425
426 spin_unlock_irqrestore(&bucket->lock, flags);
427 cond_resched();
428 }
429 }
430
431 /*
432 * For each mapping (initial cacheline in the case of
433 * dma_alloc_coherent/dma_map_page, initial cacheline in each page of a
434 * scatterlist, or the cacheline specified in dma_map_single) insert
435 * into this tree using the cacheline as the key. At
436 * dma_unmap_{single|sg|page} or dma_free_coherent delete the entry. If
437 * the entry already exists at insertion time add a tag as a reference
438 * count for the overlapping mappings. For now, the overlap tracking
439 * just ensures that 'unmaps' balance 'maps' before marking the
440 * cacheline idle, but we should also be flagging overlaps as an API
441 * violation.
442 *
443 * Memory usage is mostly constrained by the maximum number of available
444 * dma-debug entries in that we need a free dma_debug_entry before
445 * inserting into the tree. In the case of dma_map_page and
446 * dma_alloc_coherent there is only one dma_debug_entry and one
447 * dma_active_cacheline entry to track per event. dma_map_sg(), on the
448 * other hand, consumes a single dma_debug_entry, but inserts 'nents'
449 * entries into the tree.
450 */
451 static RADIX_TREE(dma_active_cacheline, GFP_ATOMIC);
452 static DEFINE_SPINLOCK(radix_lock);
453 #define ACTIVE_CACHELINE_MAX_OVERLAP ((1 << RADIX_TREE_MAX_TAGS) - 1)
454 #define CACHELINE_PER_PAGE_SHIFT (PAGE_SHIFT - L1_CACHE_SHIFT)
455 #define CACHELINES_PER_PAGE (1 << CACHELINE_PER_PAGE_SHIFT)
456
to_cacheline_number(struct dma_debug_entry * entry)457 static phys_addr_t to_cacheline_number(struct dma_debug_entry *entry)
458 {
459 return (entry->pfn << CACHELINE_PER_PAGE_SHIFT) +
460 (entry->offset >> L1_CACHE_SHIFT);
461 }
462
active_cacheline_read_overlap(phys_addr_t cln)463 static int active_cacheline_read_overlap(phys_addr_t cln)
464 {
465 int overlap = 0, i;
466
467 for (i = RADIX_TREE_MAX_TAGS - 1; i >= 0; i--)
468 if (radix_tree_tag_get(&dma_active_cacheline, cln, i))
469 overlap |= 1 << i;
470 return overlap;
471 }
472
active_cacheline_set_overlap(phys_addr_t cln,int overlap)473 static int active_cacheline_set_overlap(phys_addr_t cln, int overlap)
474 {
475 int i;
476
477 if (overlap > ACTIVE_CACHELINE_MAX_OVERLAP || overlap < 0)
478 return overlap;
479
480 for (i = RADIX_TREE_MAX_TAGS - 1; i >= 0; i--)
481 if (overlap & 1 << i)
482 radix_tree_tag_set(&dma_active_cacheline, cln, i);
483 else
484 radix_tree_tag_clear(&dma_active_cacheline, cln, i);
485
486 return overlap;
487 }
488
active_cacheline_inc_overlap(phys_addr_t cln)489 static void active_cacheline_inc_overlap(phys_addr_t cln)
490 {
491 int overlap = active_cacheline_read_overlap(cln);
492
493 overlap = active_cacheline_set_overlap(cln, ++overlap);
494
495 /* If we overflowed the overlap counter then we're potentially
496 * leaking dma-mappings.
497 */
498 WARN_ONCE(overlap > ACTIVE_CACHELINE_MAX_OVERLAP,
499 pr_fmt("exceeded %d overlapping mappings of cacheline %pa\n"),
500 ACTIVE_CACHELINE_MAX_OVERLAP, &cln);
501 }
502
active_cacheline_dec_overlap(phys_addr_t cln)503 static int active_cacheline_dec_overlap(phys_addr_t cln)
504 {
505 int overlap = active_cacheline_read_overlap(cln);
506
507 return active_cacheline_set_overlap(cln, --overlap);
508 }
509
active_cacheline_insert(struct dma_debug_entry * entry)510 static int active_cacheline_insert(struct dma_debug_entry *entry)
511 {
512 phys_addr_t cln = to_cacheline_number(entry);
513 unsigned long flags;
514 int rc;
515
516 /* If the device is not writing memory then we don't have any
517 * concerns about the cpu consuming stale data. This mitigates
518 * legitimate usages of overlapping mappings.
519 */
520 if (entry->direction == DMA_TO_DEVICE)
521 return 0;
522
523 spin_lock_irqsave(&radix_lock, flags);
524 rc = radix_tree_insert(&dma_active_cacheline, cln, entry);
525 if (rc == -EEXIST)
526 active_cacheline_inc_overlap(cln);
527 spin_unlock_irqrestore(&radix_lock, flags);
528
529 return rc;
530 }
531
active_cacheline_remove(struct dma_debug_entry * entry)532 static void active_cacheline_remove(struct dma_debug_entry *entry)
533 {
534 phys_addr_t cln = to_cacheline_number(entry);
535 unsigned long flags;
536
537 /* ...mirror the insert case */
538 if (entry->direction == DMA_TO_DEVICE)
539 return;
540
541 spin_lock_irqsave(&radix_lock, flags);
542 /* since we are counting overlaps the final put of the
543 * cacheline will occur when the overlap count is 0.
544 * active_cacheline_dec_overlap() returns -1 in that case
545 */
546 if (active_cacheline_dec_overlap(cln) < 0)
547 radix_tree_delete(&dma_active_cacheline, cln);
548 spin_unlock_irqrestore(&radix_lock, flags);
549 }
550
551 /*
552 * Wrapper function for adding an entry to the hash.
553 * This function takes care of locking itself.
554 */
add_dma_entry(struct dma_debug_entry * entry,unsigned long attrs)555 static void add_dma_entry(struct dma_debug_entry *entry, unsigned long attrs)
556 {
557 struct hash_bucket *bucket;
558 unsigned long flags;
559 int rc;
560
561 bucket = get_hash_bucket(entry, &flags);
562 hash_bucket_add(bucket, entry);
563 put_hash_bucket(bucket, flags);
564
565 rc = active_cacheline_insert(entry);
566 if (rc == -ENOMEM) {
567 pr_err_once("cacheline tracking ENOMEM, dma-debug disabled\n");
568 global_disable = true;
569 } else if (rc == -EEXIST && !(attrs & DMA_ATTR_SKIP_CPU_SYNC)) {
570 err_printk(entry->dev, entry,
571 "cacheline tracking EEXIST, overlapping mappings aren't supported\n");
572 }
573 }
574
dma_debug_create_entries(gfp_t gfp)575 static int dma_debug_create_entries(gfp_t gfp)
576 {
577 struct dma_debug_entry *entry;
578 int i;
579
580 entry = (void *)get_zeroed_page(gfp);
581 if (!entry)
582 return -ENOMEM;
583
584 for (i = 0; i < DMA_DEBUG_DYNAMIC_ENTRIES; i++)
585 list_add_tail(&entry[i].list, &free_entries);
586
587 num_free_entries += DMA_DEBUG_DYNAMIC_ENTRIES;
588 nr_total_entries += DMA_DEBUG_DYNAMIC_ENTRIES;
589
590 return 0;
591 }
592
__dma_entry_alloc(void)593 static struct dma_debug_entry *__dma_entry_alloc(void)
594 {
595 struct dma_debug_entry *entry;
596
597 entry = list_entry(free_entries.next, struct dma_debug_entry, list);
598 list_del(&entry->list);
599 memset(entry, 0, sizeof(*entry));
600
601 num_free_entries -= 1;
602 if (num_free_entries < min_free_entries)
603 min_free_entries = num_free_entries;
604
605 return entry;
606 }
607
608 /*
609 * This should be called outside of free_entries_lock scope to avoid potential
610 * deadlocks with serial consoles that use DMA.
611 */
__dma_entry_alloc_check_leak(u32 nr_entries)612 static void __dma_entry_alloc_check_leak(u32 nr_entries)
613 {
614 u32 tmp = nr_entries % nr_prealloc_entries;
615
616 /* Shout each time we tick over some multiple of the initial pool */
617 if (tmp < DMA_DEBUG_DYNAMIC_ENTRIES) {
618 pr_info("dma_debug_entry pool grown to %u (%u00%%)\n",
619 nr_entries,
620 (nr_entries / nr_prealloc_entries));
621 }
622 }
623
624 /* struct dma_entry allocator
625 *
626 * The next two functions implement the allocator for
627 * struct dma_debug_entries.
628 */
dma_entry_alloc(void)629 static struct dma_debug_entry *dma_entry_alloc(void)
630 {
631 bool alloc_check_leak = false;
632 struct dma_debug_entry *entry;
633 unsigned long flags;
634 u32 nr_entries;
635
636 spin_lock_irqsave(&free_entries_lock, flags);
637 if (num_free_entries == 0) {
638 if (dma_debug_create_entries(GFP_ATOMIC)) {
639 global_disable = true;
640 spin_unlock_irqrestore(&free_entries_lock, flags);
641 pr_err("debugging out of memory - disabling\n");
642 return NULL;
643 }
644 alloc_check_leak = true;
645 nr_entries = nr_total_entries;
646 }
647
648 entry = __dma_entry_alloc();
649
650 spin_unlock_irqrestore(&free_entries_lock, flags);
651
652 if (alloc_check_leak)
653 __dma_entry_alloc_check_leak(nr_entries);
654
655 #ifdef CONFIG_STACKTRACE
656 entry->stack_len = stack_trace_save(entry->stack_entries,
657 ARRAY_SIZE(entry->stack_entries),
658 1);
659 #endif
660 return entry;
661 }
662
dma_entry_free(struct dma_debug_entry * entry)663 static void dma_entry_free(struct dma_debug_entry *entry)
664 {
665 unsigned long flags;
666
667 active_cacheline_remove(entry);
668
669 /*
670 * add to beginning of the list - this way the entries are
671 * more likely cache hot when they are reallocated.
672 */
673 spin_lock_irqsave(&free_entries_lock, flags);
674 list_add(&entry->list, &free_entries);
675 num_free_entries += 1;
676 spin_unlock_irqrestore(&free_entries_lock, flags);
677 }
678
679 /*
680 * DMA-API debugging init code
681 *
682 * The init code does two things:
683 * 1. Initialize core data structures
684 * 2. Preallocate a given number of dma_debug_entry structs
685 */
686
filter_read(struct file * file,char __user * user_buf,size_t count,loff_t * ppos)687 static ssize_t filter_read(struct file *file, char __user *user_buf,
688 size_t count, loff_t *ppos)
689 {
690 char buf[NAME_MAX_LEN + 1];
691 unsigned long flags;
692 int len;
693
694 if (!current_driver_name[0])
695 return 0;
696
697 /*
698 * We can't copy to userspace directly because current_driver_name can
699 * only be read under the driver_name_lock with irqs disabled. So
700 * create a temporary copy first.
701 */
702 read_lock_irqsave(&driver_name_lock, flags);
703 len = scnprintf(buf, NAME_MAX_LEN + 1, "%s\n", current_driver_name);
704 read_unlock_irqrestore(&driver_name_lock, flags);
705
706 return simple_read_from_buffer(user_buf, count, ppos, buf, len);
707 }
708
filter_write(struct file * file,const char __user * userbuf,size_t count,loff_t * ppos)709 static ssize_t filter_write(struct file *file, const char __user *userbuf,
710 size_t count, loff_t *ppos)
711 {
712 char buf[NAME_MAX_LEN];
713 unsigned long flags;
714 size_t len;
715 int i;
716
717 /*
718 * We can't copy from userspace directly. Access to
719 * current_driver_name is protected with a write_lock with irqs
720 * disabled. Since copy_from_user can fault and may sleep we
721 * need to copy to temporary buffer first
722 */
723 len = min(count, (size_t)(NAME_MAX_LEN - 1));
724 if (copy_from_user(buf, userbuf, len))
725 return -EFAULT;
726
727 buf[len] = 0;
728
729 write_lock_irqsave(&driver_name_lock, flags);
730
731 /*
732 * Now handle the string we got from userspace very carefully.
733 * The rules are:
734 * - only use the first token we got
735 * - token delimiter is everything looking like a space
736 * character (' ', '\n', '\t' ...)
737 *
738 */
739 if (!isalnum(buf[0])) {
740 /*
741 * If the first character userspace gave us is not
742 * alphanumerical then assume the filter should be
743 * switched off.
744 */
745 if (current_driver_name[0])
746 pr_info("switching off dma-debug driver filter\n");
747 current_driver_name[0] = 0;
748 current_driver = NULL;
749 goto out_unlock;
750 }
751
752 /*
753 * Now parse out the first token and use it as the name for the
754 * driver to filter for.
755 */
756 for (i = 0; i < NAME_MAX_LEN - 1; ++i) {
757 current_driver_name[i] = buf[i];
758 if (isspace(buf[i]) || buf[i] == ' ' || buf[i] == 0)
759 break;
760 }
761 current_driver_name[i] = 0;
762 current_driver = NULL;
763
764 pr_info("enable driver filter for driver [%s]\n",
765 current_driver_name);
766
767 out_unlock:
768 write_unlock_irqrestore(&driver_name_lock, flags);
769
770 return count;
771 }
772
773 static const struct file_operations filter_fops = {
774 .read = filter_read,
775 .write = filter_write,
776 .llseek = default_llseek,
777 };
778
dump_show(struct seq_file * seq,void * v)779 static int dump_show(struct seq_file *seq, void *v)
780 {
781 int idx;
782
783 for (idx = 0; idx < HASH_SIZE; idx++) {
784 struct hash_bucket *bucket = &dma_entry_hash[idx];
785 struct dma_debug_entry *entry;
786 unsigned long flags;
787
788 spin_lock_irqsave(&bucket->lock, flags);
789 list_for_each_entry(entry, &bucket->list, list) {
790 seq_printf(seq,
791 "%s %s %s idx %d P=%llx N=%lx D=%llx L=%llx %s %s\n",
792 dev_name(entry->dev),
793 dev_driver_string(entry->dev),
794 type2name[entry->type], idx,
795 phys_addr(entry), entry->pfn,
796 entry->dev_addr, entry->size,
797 dir2name[entry->direction],
798 maperr2str[entry->map_err_type]);
799 }
800 spin_unlock_irqrestore(&bucket->lock, flags);
801 }
802 return 0;
803 }
804 DEFINE_SHOW_ATTRIBUTE(dump);
805
dma_debug_fs_init(void)806 static int __init dma_debug_fs_init(void)
807 {
808 struct dentry *dentry = debugfs_create_dir("dma-api", NULL);
809
810 debugfs_create_bool("disabled", 0444, dentry, &global_disable);
811 debugfs_create_u32("error_count", 0444, dentry, &error_count);
812 debugfs_create_u32("all_errors", 0644, dentry, &show_all_errors);
813 debugfs_create_u32("num_errors", 0644, dentry, &show_num_errors);
814 debugfs_create_u32("num_free_entries", 0444, dentry, &num_free_entries);
815 debugfs_create_u32("min_free_entries", 0444, dentry, &min_free_entries);
816 debugfs_create_u32("nr_total_entries", 0444, dentry, &nr_total_entries);
817 debugfs_create_file("driver_filter", 0644, dentry, NULL, &filter_fops);
818 debugfs_create_file("dump", 0444, dentry, NULL, &dump_fops);
819
820 return 0;
821 }
822 core_initcall_sync(dma_debug_fs_init);
823
device_dma_allocations(struct device * dev,struct dma_debug_entry ** out_entry)824 static int device_dma_allocations(struct device *dev, struct dma_debug_entry **out_entry)
825 {
826 struct dma_debug_entry *entry;
827 unsigned long flags;
828 int count = 0, i;
829
830 for (i = 0; i < HASH_SIZE; ++i) {
831 spin_lock_irqsave(&dma_entry_hash[i].lock, flags);
832 list_for_each_entry(entry, &dma_entry_hash[i].list, list) {
833 if (entry->dev == dev) {
834 count += 1;
835 *out_entry = entry;
836 }
837 }
838 spin_unlock_irqrestore(&dma_entry_hash[i].lock, flags);
839 }
840
841 return count;
842 }
843
dma_debug_device_change(struct notifier_block * nb,unsigned long action,void * data)844 static int dma_debug_device_change(struct notifier_block *nb, unsigned long action, void *data)
845 {
846 struct device *dev = data;
847 struct dma_debug_entry *entry;
848 int count;
849
850 if (dma_debug_disabled())
851 return 0;
852
853 switch (action) {
854 case BUS_NOTIFY_UNBOUND_DRIVER:
855 count = device_dma_allocations(dev, &entry);
856 if (count == 0)
857 break;
858 err_printk(dev, entry, "device driver has pending "
859 "DMA allocations while released from device "
860 "[count=%d]\n"
861 "One of leaked entries details: "
862 "[device address=0x%016llx] [size=%llu bytes] "
863 "[mapped with %s] [mapped as %s]\n",
864 count, entry->dev_addr, entry->size,
865 dir2name[entry->direction], type2name[entry->type]);
866 break;
867 default:
868 break;
869 }
870
871 return 0;
872 }
873
dma_debug_add_bus(struct bus_type * bus)874 void dma_debug_add_bus(struct bus_type *bus)
875 {
876 struct notifier_block *nb;
877
878 if (dma_debug_disabled())
879 return;
880
881 nb = kzalloc(sizeof(struct notifier_block), GFP_KERNEL);
882 if (nb == NULL) {
883 pr_err("dma_debug_add_bus: out of memory\n");
884 return;
885 }
886
887 nb->notifier_call = dma_debug_device_change;
888
889 bus_register_notifier(bus, nb);
890 }
891
dma_debug_init(void)892 static int dma_debug_init(void)
893 {
894 int i, nr_pages;
895
896 /* Do not use dma_debug_initialized here, since we really want to be
897 * called to set dma_debug_initialized
898 */
899 if (global_disable)
900 return 0;
901
902 for (i = 0; i < HASH_SIZE; ++i) {
903 INIT_LIST_HEAD(&dma_entry_hash[i].list);
904 spin_lock_init(&dma_entry_hash[i].lock);
905 }
906
907 nr_pages = DIV_ROUND_UP(nr_prealloc_entries, DMA_DEBUG_DYNAMIC_ENTRIES);
908 for (i = 0; i < nr_pages; ++i)
909 dma_debug_create_entries(GFP_KERNEL);
910 if (num_free_entries >= nr_prealloc_entries) {
911 pr_info("preallocated %d debug entries\n", nr_total_entries);
912 } else if (num_free_entries > 0) {
913 pr_warn("%d debug entries requested but only %d allocated\n",
914 nr_prealloc_entries, nr_total_entries);
915 } else {
916 pr_err("debugging out of memory error - disabled\n");
917 global_disable = true;
918
919 return 0;
920 }
921 min_free_entries = num_free_entries;
922
923 dma_debug_initialized = true;
924
925 pr_info("debugging enabled by kernel config\n");
926 return 0;
927 }
928 core_initcall(dma_debug_init);
929
dma_debug_cmdline(char * str)930 static __init int dma_debug_cmdline(char *str)
931 {
932 if (!str)
933 return -EINVAL;
934
935 if (strncmp(str, "off", 3) == 0) {
936 pr_info("debugging disabled on kernel command line\n");
937 global_disable = true;
938 }
939
940 return 1;
941 }
942
dma_debug_entries_cmdline(char * str)943 static __init int dma_debug_entries_cmdline(char *str)
944 {
945 if (!str)
946 return -EINVAL;
947 if (!get_option(&str, &nr_prealloc_entries))
948 nr_prealloc_entries = PREALLOC_DMA_DEBUG_ENTRIES;
949 return 1;
950 }
951
952 __setup("dma_debug=", dma_debug_cmdline);
953 __setup("dma_debug_entries=", dma_debug_entries_cmdline);
954
check_unmap(struct dma_debug_entry * ref)955 static void check_unmap(struct dma_debug_entry *ref)
956 {
957 struct dma_debug_entry *entry;
958 struct hash_bucket *bucket;
959 unsigned long flags;
960
961 bucket = get_hash_bucket(ref, &flags);
962 entry = bucket_find_exact(bucket, ref);
963
964 if (!entry) {
965 /* must drop lock before calling dma_mapping_error */
966 put_hash_bucket(bucket, flags);
967
968 if (dma_mapping_error(ref->dev, ref->dev_addr)) {
969 err_printk(ref->dev, NULL,
970 "device driver tries to free an "
971 "invalid DMA memory address\n");
972 } else {
973 err_printk(ref->dev, NULL,
974 "device driver tries to free DMA "
975 "memory it has not allocated [device "
976 "address=0x%016llx] [size=%llu bytes]\n",
977 ref->dev_addr, ref->size);
978 }
979 return;
980 }
981
982 if (ref->size != entry->size) {
983 err_printk(ref->dev, entry, "device driver frees "
984 "DMA memory with different size "
985 "[device address=0x%016llx] [map size=%llu bytes] "
986 "[unmap size=%llu bytes]\n",
987 ref->dev_addr, entry->size, ref->size);
988 }
989
990 if (ref->type != entry->type) {
991 err_printk(ref->dev, entry, "device driver frees "
992 "DMA memory with wrong function "
993 "[device address=0x%016llx] [size=%llu bytes] "
994 "[mapped as %s] [unmapped as %s]\n",
995 ref->dev_addr, ref->size,
996 type2name[entry->type], type2name[ref->type]);
997 } else if ((entry->type == dma_debug_coherent) &&
998 (phys_addr(ref) != phys_addr(entry))) {
999 err_printk(ref->dev, entry, "device driver frees "
1000 "DMA memory with different CPU address "
1001 "[device address=0x%016llx] [size=%llu bytes] "
1002 "[cpu alloc address=0x%016llx] "
1003 "[cpu free address=0x%016llx]",
1004 ref->dev_addr, ref->size,
1005 phys_addr(entry),
1006 phys_addr(ref));
1007 }
1008
1009 if (ref->sg_call_ents && ref->type == dma_debug_sg &&
1010 ref->sg_call_ents != entry->sg_call_ents) {
1011 err_printk(ref->dev, entry, "device driver frees "
1012 "DMA sg list with different entry count "
1013 "[map count=%d] [unmap count=%d]\n",
1014 entry->sg_call_ents, ref->sg_call_ents);
1015 }
1016
1017 /*
1018 * This may be no bug in reality - but most implementations of the
1019 * DMA API don't handle this properly, so check for it here
1020 */
1021 if (ref->direction != entry->direction) {
1022 err_printk(ref->dev, entry, "device driver frees "
1023 "DMA memory with different direction "
1024 "[device address=0x%016llx] [size=%llu bytes] "
1025 "[mapped with %s] [unmapped with %s]\n",
1026 ref->dev_addr, ref->size,
1027 dir2name[entry->direction],
1028 dir2name[ref->direction]);
1029 }
1030
1031 /*
1032 * Drivers should use dma_mapping_error() to check the returned
1033 * addresses of dma_map_single() and dma_map_page().
1034 * If not, print this warning message. See Documentation/core-api/dma-api.rst.
1035 */
1036 if (entry->map_err_type == MAP_ERR_NOT_CHECKED) {
1037 err_printk(ref->dev, entry,
1038 "device driver failed to check map error"
1039 "[device address=0x%016llx] [size=%llu bytes] "
1040 "[mapped as %s]",
1041 ref->dev_addr, ref->size,
1042 type2name[entry->type]);
1043 }
1044
1045 hash_bucket_del(entry);
1046 dma_entry_free(entry);
1047
1048 put_hash_bucket(bucket, flags);
1049 }
1050
check_for_stack(struct device * dev,struct page * page,size_t offset)1051 static void check_for_stack(struct device *dev,
1052 struct page *page, size_t offset)
1053 {
1054 void *addr;
1055 struct vm_struct *stack_vm_area = task_stack_vm_area(current);
1056
1057 if (!stack_vm_area) {
1058 /* Stack is direct-mapped. */
1059 if (PageHighMem(page))
1060 return;
1061 addr = page_address(page) + offset;
1062 if (object_is_on_stack(addr))
1063 err_printk(dev, NULL, "device driver maps memory from stack [addr=%p]\n", addr);
1064 } else {
1065 /* Stack is vmalloced. */
1066 int i;
1067
1068 for (i = 0; i < stack_vm_area->nr_pages; i++) {
1069 if (page != stack_vm_area->pages[i])
1070 continue;
1071
1072 addr = (u8 *)current->stack + i * PAGE_SIZE + offset;
1073 err_printk(dev, NULL, "device driver maps memory from stack [probable addr=%p]\n", addr);
1074 break;
1075 }
1076 }
1077 }
1078
check_for_illegal_area(struct device * dev,void * addr,unsigned long len)1079 static void check_for_illegal_area(struct device *dev, void *addr, unsigned long len)
1080 {
1081 if (memory_intersects(_stext, _etext, addr, len) ||
1082 memory_intersects(__start_rodata, __end_rodata, addr, len))
1083 err_printk(dev, NULL, "device driver maps memory from kernel text or rodata [addr=%p] [len=%lu]\n", addr, len);
1084 }
1085
check_sync(struct device * dev,struct dma_debug_entry * ref,bool to_cpu)1086 static void check_sync(struct device *dev,
1087 struct dma_debug_entry *ref,
1088 bool to_cpu)
1089 {
1090 struct dma_debug_entry *entry;
1091 struct hash_bucket *bucket;
1092 unsigned long flags;
1093
1094 bucket = get_hash_bucket(ref, &flags);
1095
1096 entry = bucket_find_contain(&bucket, ref, &flags);
1097
1098 if (!entry) {
1099 err_printk(dev, NULL, "device driver tries "
1100 "to sync DMA memory it has not allocated "
1101 "[device address=0x%016llx] [size=%llu bytes]\n",
1102 (unsigned long long)ref->dev_addr, ref->size);
1103 goto out;
1104 }
1105
1106 if (ref->size > entry->size) {
1107 err_printk(dev, entry, "device driver syncs"
1108 " DMA memory outside allocated range "
1109 "[device address=0x%016llx] "
1110 "[allocation size=%llu bytes] "
1111 "[sync offset+size=%llu]\n",
1112 entry->dev_addr, entry->size,
1113 ref->size);
1114 }
1115
1116 if (entry->direction == DMA_BIDIRECTIONAL)
1117 goto out;
1118
1119 if (ref->direction != entry->direction) {
1120 err_printk(dev, entry, "device driver syncs "
1121 "DMA memory with different direction "
1122 "[device address=0x%016llx] [size=%llu bytes] "
1123 "[mapped with %s] [synced with %s]\n",
1124 (unsigned long long)ref->dev_addr, entry->size,
1125 dir2name[entry->direction],
1126 dir2name[ref->direction]);
1127 }
1128
1129 if (to_cpu && !(entry->direction == DMA_FROM_DEVICE) &&
1130 !(ref->direction == DMA_TO_DEVICE))
1131 err_printk(dev, entry, "device driver syncs "
1132 "device read-only DMA memory for cpu "
1133 "[device address=0x%016llx] [size=%llu bytes] "
1134 "[mapped with %s] [synced with %s]\n",
1135 (unsigned long long)ref->dev_addr, entry->size,
1136 dir2name[entry->direction],
1137 dir2name[ref->direction]);
1138
1139 if (!to_cpu && !(entry->direction == DMA_TO_DEVICE) &&
1140 !(ref->direction == DMA_FROM_DEVICE))
1141 err_printk(dev, entry, "device driver syncs "
1142 "device write-only DMA memory to device "
1143 "[device address=0x%016llx] [size=%llu bytes] "
1144 "[mapped with %s] [synced with %s]\n",
1145 (unsigned long long)ref->dev_addr, entry->size,
1146 dir2name[entry->direction],
1147 dir2name[ref->direction]);
1148
1149 if (ref->sg_call_ents && ref->type == dma_debug_sg &&
1150 ref->sg_call_ents != entry->sg_call_ents) {
1151 err_printk(ref->dev, entry, "device driver syncs "
1152 "DMA sg list with different entry count "
1153 "[map count=%d] [sync count=%d]\n",
1154 entry->sg_call_ents, ref->sg_call_ents);
1155 }
1156
1157 out:
1158 put_hash_bucket(bucket, flags);
1159 }
1160
check_sg_segment(struct device * dev,struct scatterlist * sg)1161 static void check_sg_segment(struct device *dev, struct scatterlist *sg)
1162 {
1163 #ifdef CONFIG_DMA_API_DEBUG_SG
1164 unsigned int max_seg = dma_get_max_seg_size(dev);
1165 u64 start, end, boundary = dma_get_seg_boundary(dev);
1166
1167 /*
1168 * Either the driver forgot to set dma_parms appropriately, or
1169 * whoever generated the list forgot to check them.
1170 */
1171 if (sg->length > max_seg)
1172 err_printk(dev, NULL, "mapping sg segment longer than device claims to support [len=%u] [max=%u]\n",
1173 sg->length, max_seg);
1174 /*
1175 * In some cases this could potentially be the DMA API
1176 * implementation's fault, but it would usually imply that
1177 * the scatterlist was built inappropriately to begin with.
1178 */
1179 start = sg_dma_address(sg);
1180 end = start + sg_dma_len(sg) - 1;
1181 if ((start ^ end) & ~boundary)
1182 err_printk(dev, NULL, "mapping sg segment across boundary [start=0x%016llx] [end=0x%016llx] [boundary=0x%016llx]\n",
1183 start, end, boundary);
1184 #endif
1185 }
1186
debug_dma_map_single(struct device * dev,const void * addr,unsigned long len)1187 void debug_dma_map_single(struct device *dev, const void *addr,
1188 unsigned long len)
1189 {
1190 if (unlikely(dma_debug_disabled()))
1191 return;
1192
1193 if (!virt_addr_valid(addr))
1194 err_printk(dev, NULL, "device driver maps memory from invalid area [addr=%p] [len=%lu]\n",
1195 addr, len);
1196
1197 if (is_vmalloc_addr(addr))
1198 err_printk(dev, NULL, "device driver maps memory from vmalloc area [addr=%p] [len=%lu]\n",
1199 addr, len);
1200 }
1201 EXPORT_SYMBOL(debug_dma_map_single);
1202
debug_dma_map_page(struct device * dev,struct page * page,size_t offset,size_t size,int direction,dma_addr_t dma_addr,unsigned long attrs)1203 void debug_dma_map_page(struct device *dev, struct page *page, size_t offset,
1204 size_t size, int direction, dma_addr_t dma_addr,
1205 unsigned long attrs)
1206 {
1207 struct dma_debug_entry *entry;
1208
1209 if (unlikely(dma_debug_disabled()))
1210 return;
1211
1212 if (dma_mapping_error(dev, dma_addr))
1213 return;
1214
1215 entry = dma_entry_alloc();
1216 if (!entry)
1217 return;
1218
1219 entry->dev = dev;
1220 entry->type = dma_debug_single;
1221 entry->pfn = page_to_pfn(page);
1222 entry->offset = offset;
1223 entry->dev_addr = dma_addr;
1224 entry->size = size;
1225 entry->direction = direction;
1226 entry->map_err_type = MAP_ERR_NOT_CHECKED;
1227
1228 check_for_stack(dev, page, offset);
1229
1230 if (!PageHighMem(page)) {
1231 void *addr = page_address(page) + offset;
1232
1233 check_for_illegal_area(dev, addr, size);
1234 }
1235
1236 add_dma_entry(entry, attrs);
1237 }
1238
debug_dma_mapping_error(struct device * dev,dma_addr_t dma_addr)1239 void debug_dma_mapping_error(struct device *dev, dma_addr_t dma_addr)
1240 {
1241 struct dma_debug_entry ref;
1242 struct dma_debug_entry *entry;
1243 struct hash_bucket *bucket;
1244 unsigned long flags;
1245
1246 if (unlikely(dma_debug_disabled()))
1247 return;
1248
1249 ref.dev = dev;
1250 ref.dev_addr = dma_addr;
1251 bucket = get_hash_bucket(&ref, &flags);
1252
1253 list_for_each_entry(entry, &bucket->list, list) {
1254 if (!exact_match(&ref, entry))
1255 continue;
1256
1257 /*
1258 * The same physical address can be mapped multiple
1259 * times. Without a hardware IOMMU this results in the
1260 * same device addresses being put into the dma-debug
1261 * hash multiple times too. This can result in false
1262 * positives being reported. Therefore we implement a
1263 * best-fit algorithm here which updates the first entry
1264 * from the hash which fits the reference value and is
1265 * not currently listed as being checked.
1266 */
1267 if (entry->map_err_type == MAP_ERR_NOT_CHECKED) {
1268 entry->map_err_type = MAP_ERR_CHECKED;
1269 break;
1270 }
1271 }
1272
1273 put_hash_bucket(bucket, flags);
1274 }
1275 EXPORT_SYMBOL(debug_dma_mapping_error);
1276
debug_dma_unmap_page(struct device * dev,dma_addr_t addr,size_t size,int direction)1277 void debug_dma_unmap_page(struct device *dev, dma_addr_t addr,
1278 size_t size, int direction)
1279 {
1280 struct dma_debug_entry ref = {
1281 .type = dma_debug_single,
1282 .dev = dev,
1283 .dev_addr = addr,
1284 .size = size,
1285 .direction = direction,
1286 };
1287
1288 if (unlikely(dma_debug_disabled()))
1289 return;
1290 check_unmap(&ref);
1291 }
1292
debug_dma_map_sg(struct device * dev,struct scatterlist * sg,int nents,int mapped_ents,int direction,unsigned long attrs)1293 void debug_dma_map_sg(struct device *dev, struct scatterlist *sg,
1294 int nents, int mapped_ents, int direction,
1295 unsigned long attrs)
1296 {
1297 struct dma_debug_entry *entry;
1298 struct scatterlist *s;
1299 int i;
1300
1301 if (unlikely(dma_debug_disabled()))
1302 return;
1303
1304 for_each_sg(sg, s, nents, i) {
1305 check_for_stack(dev, sg_page(s), s->offset);
1306 if (!PageHighMem(sg_page(s)))
1307 check_for_illegal_area(dev, sg_virt(s), s->length);
1308 }
1309
1310 for_each_sg(sg, s, mapped_ents, i) {
1311 entry = dma_entry_alloc();
1312 if (!entry)
1313 return;
1314
1315 entry->type = dma_debug_sg;
1316 entry->dev = dev;
1317 entry->pfn = page_to_pfn(sg_page(s));
1318 entry->offset = s->offset;
1319 entry->size = sg_dma_len(s);
1320 entry->dev_addr = sg_dma_address(s);
1321 entry->direction = direction;
1322 entry->sg_call_ents = nents;
1323 entry->sg_mapped_ents = mapped_ents;
1324
1325 check_sg_segment(dev, s);
1326
1327 add_dma_entry(entry, attrs);
1328 }
1329 }
1330
get_nr_mapped_entries(struct device * dev,struct dma_debug_entry * ref)1331 static int get_nr_mapped_entries(struct device *dev,
1332 struct dma_debug_entry *ref)
1333 {
1334 struct dma_debug_entry *entry;
1335 struct hash_bucket *bucket;
1336 unsigned long flags;
1337 int mapped_ents;
1338
1339 bucket = get_hash_bucket(ref, &flags);
1340 entry = bucket_find_exact(bucket, ref);
1341 mapped_ents = 0;
1342
1343 if (entry)
1344 mapped_ents = entry->sg_mapped_ents;
1345 put_hash_bucket(bucket, flags);
1346
1347 return mapped_ents;
1348 }
1349
debug_dma_unmap_sg(struct device * dev,struct scatterlist * sglist,int nelems,int dir)1350 void debug_dma_unmap_sg(struct device *dev, struct scatterlist *sglist,
1351 int nelems, int dir)
1352 {
1353 struct scatterlist *s;
1354 int mapped_ents = 0, i;
1355
1356 if (unlikely(dma_debug_disabled()))
1357 return;
1358
1359 for_each_sg(sglist, s, nelems, i) {
1360
1361 struct dma_debug_entry ref = {
1362 .type = dma_debug_sg,
1363 .dev = dev,
1364 .pfn = page_to_pfn(sg_page(s)),
1365 .offset = s->offset,
1366 .dev_addr = sg_dma_address(s),
1367 .size = sg_dma_len(s),
1368 .direction = dir,
1369 .sg_call_ents = nelems,
1370 };
1371
1372 if (mapped_ents && i >= mapped_ents)
1373 break;
1374
1375 if (!i)
1376 mapped_ents = get_nr_mapped_entries(dev, &ref);
1377
1378 check_unmap(&ref);
1379 }
1380 }
1381
debug_dma_alloc_coherent(struct device * dev,size_t size,dma_addr_t dma_addr,void * virt,unsigned long attrs)1382 void debug_dma_alloc_coherent(struct device *dev, size_t size,
1383 dma_addr_t dma_addr, void *virt,
1384 unsigned long attrs)
1385 {
1386 struct dma_debug_entry *entry;
1387
1388 if (unlikely(dma_debug_disabled()))
1389 return;
1390
1391 if (unlikely(virt == NULL))
1392 return;
1393
1394 /* handle vmalloc and linear addresses */
1395 if (!is_vmalloc_addr(virt) && !virt_addr_valid(virt))
1396 return;
1397
1398 entry = dma_entry_alloc();
1399 if (!entry)
1400 return;
1401
1402 entry->type = dma_debug_coherent;
1403 entry->dev = dev;
1404 entry->offset = offset_in_page(virt);
1405 entry->size = size;
1406 entry->dev_addr = dma_addr;
1407 entry->direction = DMA_BIDIRECTIONAL;
1408
1409 if (is_vmalloc_addr(virt))
1410 entry->pfn = vmalloc_to_pfn(virt);
1411 else
1412 entry->pfn = page_to_pfn(virt_to_page(virt));
1413
1414 add_dma_entry(entry, attrs);
1415 }
1416
debug_dma_free_coherent(struct device * dev,size_t size,void * virt,dma_addr_t addr)1417 void debug_dma_free_coherent(struct device *dev, size_t size,
1418 void *virt, dma_addr_t addr)
1419 {
1420 struct dma_debug_entry ref = {
1421 .type = dma_debug_coherent,
1422 .dev = dev,
1423 .offset = offset_in_page(virt),
1424 .dev_addr = addr,
1425 .size = size,
1426 .direction = DMA_BIDIRECTIONAL,
1427 };
1428
1429 /* handle vmalloc and linear addresses */
1430 if (!is_vmalloc_addr(virt) && !virt_addr_valid(virt))
1431 return;
1432
1433 if (is_vmalloc_addr(virt))
1434 ref.pfn = vmalloc_to_pfn(virt);
1435 else
1436 ref.pfn = page_to_pfn(virt_to_page(virt));
1437
1438 if (unlikely(dma_debug_disabled()))
1439 return;
1440
1441 check_unmap(&ref);
1442 }
1443
debug_dma_map_resource(struct device * dev,phys_addr_t addr,size_t size,int direction,dma_addr_t dma_addr,unsigned long attrs)1444 void debug_dma_map_resource(struct device *dev, phys_addr_t addr, size_t size,
1445 int direction, dma_addr_t dma_addr,
1446 unsigned long attrs)
1447 {
1448 struct dma_debug_entry *entry;
1449
1450 if (unlikely(dma_debug_disabled()))
1451 return;
1452
1453 entry = dma_entry_alloc();
1454 if (!entry)
1455 return;
1456
1457 entry->type = dma_debug_resource;
1458 entry->dev = dev;
1459 entry->pfn = PHYS_PFN(addr);
1460 entry->offset = offset_in_page(addr);
1461 entry->size = size;
1462 entry->dev_addr = dma_addr;
1463 entry->direction = direction;
1464 entry->map_err_type = MAP_ERR_NOT_CHECKED;
1465
1466 add_dma_entry(entry, attrs);
1467 }
1468
debug_dma_unmap_resource(struct device * dev,dma_addr_t dma_addr,size_t size,int direction)1469 void debug_dma_unmap_resource(struct device *dev, dma_addr_t dma_addr,
1470 size_t size, int direction)
1471 {
1472 struct dma_debug_entry ref = {
1473 .type = dma_debug_resource,
1474 .dev = dev,
1475 .dev_addr = dma_addr,
1476 .size = size,
1477 .direction = direction,
1478 };
1479
1480 if (unlikely(dma_debug_disabled()))
1481 return;
1482
1483 check_unmap(&ref);
1484 }
1485
debug_dma_sync_single_for_cpu(struct device * dev,dma_addr_t dma_handle,size_t size,int direction)1486 void debug_dma_sync_single_for_cpu(struct device *dev, dma_addr_t dma_handle,
1487 size_t size, int direction)
1488 {
1489 struct dma_debug_entry ref;
1490
1491 if (unlikely(dma_debug_disabled()))
1492 return;
1493
1494 ref.type = dma_debug_single;
1495 ref.dev = dev;
1496 ref.dev_addr = dma_handle;
1497 ref.size = size;
1498 ref.direction = direction;
1499 ref.sg_call_ents = 0;
1500
1501 check_sync(dev, &ref, true);
1502 }
1503
debug_dma_sync_single_for_device(struct device * dev,dma_addr_t dma_handle,size_t size,int direction)1504 void debug_dma_sync_single_for_device(struct device *dev,
1505 dma_addr_t dma_handle, size_t size,
1506 int direction)
1507 {
1508 struct dma_debug_entry ref;
1509
1510 if (unlikely(dma_debug_disabled()))
1511 return;
1512
1513 ref.type = dma_debug_single;
1514 ref.dev = dev;
1515 ref.dev_addr = dma_handle;
1516 ref.size = size;
1517 ref.direction = direction;
1518 ref.sg_call_ents = 0;
1519
1520 check_sync(dev, &ref, false);
1521 }
1522
debug_dma_sync_sg_for_cpu(struct device * dev,struct scatterlist * sg,int nelems,int direction)1523 void debug_dma_sync_sg_for_cpu(struct device *dev, struct scatterlist *sg,
1524 int nelems, int direction)
1525 {
1526 struct scatterlist *s;
1527 int mapped_ents = 0, i;
1528
1529 if (unlikely(dma_debug_disabled()))
1530 return;
1531
1532 for_each_sg(sg, s, nelems, i) {
1533
1534 struct dma_debug_entry ref = {
1535 .type = dma_debug_sg,
1536 .dev = dev,
1537 .pfn = page_to_pfn(sg_page(s)),
1538 .offset = s->offset,
1539 .dev_addr = sg_dma_address(s),
1540 .size = sg_dma_len(s),
1541 .direction = direction,
1542 .sg_call_ents = nelems,
1543 };
1544
1545 if (!i)
1546 mapped_ents = get_nr_mapped_entries(dev, &ref);
1547
1548 if (i >= mapped_ents)
1549 break;
1550
1551 check_sync(dev, &ref, true);
1552 }
1553 }
1554
debug_dma_sync_sg_for_device(struct device * dev,struct scatterlist * sg,int nelems,int direction)1555 void debug_dma_sync_sg_for_device(struct device *dev, struct scatterlist *sg,
1556 int nelems, int direction)
1557 {
1558 struct scatterlist *s;
1559 int mapped_ents = 0, i;
1560
1561 if (unlikely(dma_debug_disabled()))
1562 return;
1563
1564 for_each_sg(sg, s, nelems, i) {
1565
1566 struct dma_debug_entry ref = {
1567 .type = dma_debug_sg,
1568 .dev = dev,
1569 .pfn = page_to_pfn(sg_page(s)),
1570 .offset = s->offset,
1571 .dev_addr = sg_dma_address(s),
1572 .size = sg_dma_len(s),
1573 .direction = direction,
1574 .sg_call_ents = nelems,
1575 };
1576 if (!i)
1577 mapped_ents = get_nr_mapped_entries(dev, &ref);
1578
1579 if (i >= mapped_ents)
1580 break;
1581
1582 check_sync(dev, &ref, false);
1583 }
1584 }
1585
dma_debug_driver_setup(char * str)1586 static int __init dma_debug_driver_setup(char *str)
1587 {
1588 int i;
1589
1590 for (i = 0; i < NAME_MAX_LEN - 1; ++i, ++str) {
1591 current_driver_name[i] = *str;
1592 if (*str == 0)
1593 break;
1594 }
1595
1596 if (current_driver_name[0])
1597 pr_info("enable driver filter for driver [%s]\n",
1598 current_driver_name);
1599
1600
1601 return 1;
1602 }
1603 __setup("dma_debug_driver=", dma_debug_driver_setup);
1604