License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 14:07:57 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2016-02-03 05:46:32 +00:00
|
|
|
/*
|
2020-09-01 11:34:33 +00:00
|
|
|
* Copyright (C) 2018-2020 Christoph Hellwig.
|
2018-09-08 09:22:43 +00:00
|
|
|
*
|
|
|
|
* DMA operations that map physical memory directly without using an IOMMU.
|
2016-02-03 05:46:32 +00:00
|
|
|
*/
|
2018-10-30 22:09:49 +00:00
|
|
|
#include <linux/memblock.h> /* for max_pfn */
|
2016-02-03 05:46:32 +00:00
|
|
|
#include <linux/export.h>
|
|
|
|
#include <linux/mm.h>
|
2020-09-22 13:31:03 +00:00
|
|
|
#include <linux/dma-map-ops.h>
|
2016-02-03 05:46:32 +00:00
|
|
|
#include <linux/scatterlist.h>
|
2017-06-26 09:18:55 +00:00
|
|
|
#include <linux/pfn.h>
|
2019-10-29 10:06:32 +00:00
|
|
|
#include <linux/vmalloc.h>
|
2018-03-19 10:38:25 +00:00
|
|
|
#include <linux/set_memory.h>
|
2020-09-17 16:43:40 +00:00
|
|
|
#include <linux/slab.h>
|
2020-09-22 13:34:22 +00:00
|
|
|
#include "direct.h"
|
2016-02-03 05:46:32 +00:00
|
|
|
|
2018-01-09 22:39:03 +00:00
|
|
|
/*
|
2020-10-16 03:10:28 +00:00
|
|
|
* Most architectures use ZONE_DMA for the first 16 Megabytes, but some use
|
2019-10-14 18:31:03 +00:00
|
|
|
* it for entirely different regions. In that case the arch code needs to
|
|
|
|
* override the variable below for dma-direct to work properly.
|
2018-01-09 22:39:03 +00:00
|
|
|
*/
|
2019-10-14 18:31:03 +00:00
|
|
|
unsigned int zone_dma_bits __ro_after_init = 24;
|
2018-01-09 22:39:03 +00:00
|
|
|
|
2018-09-20 11:26:13 +00:00
|
|
|
static inline dma_addr_t phys_to_dma_direct(struct device *dev,
|
|
|
|
phys_addr_t phys)
|
|
|
|
{
|
2019-07-10 19:01:19 +00:00
|
|
|
if (force_dma_unencrypted(dev))
|
2020-08-17 15:34:03 +00:00
|
|
|
return phys_to_dma_unencrypted(dev, phys);
|
2018-09-20 11:26:13 +00:00
|
|
|
return phys_to_dma(dev, phys);
|
|
|
|
}
|
|
|
|
|
2019-10-29 10:01:37 +00:00
|
|
|
static inline struct page *dma_direct_to_page(struct device *dev,
|
|
|
|
dma_addr_t dma_addr)
|
|
|
|
{
|
|
|
|
return pfn_to_page(PHYS_PFN(dma_to_phys(dev, dma_addr)));
|
|
|
|
}
|
|
|
|
|
2018-09-20 11:26:13 +00:00
|
|
|
u64 dma_direct_get_required_mask(struct device *dev)
|
|
|
|
{
|
2020-04-06 05:28:36 +00:00
|
|
|
phys_addr_t phys = (phys_addr_t)(max_pfn - 1) << PAGE_SHIFT;
|
|
|
|
u64 max_dma = phys_to_dma_direct(dev, phys);
|
2018-09-20 11:26:13 +00:00
|
|
|
|
|
|
|
return (1ULL << (fls64(max_dma) - 1)) * 2 - 1;
|
|
|
|
}
|
|
|
|
|
2020-08-14 10:26:24 +00:00
|
|
|
static gfp_t dma_direct_optimal_gfp_mask(struct device *dev, u64 dma_mask,
|
2020-04-15 00:04:55 +00:00
|
|
|
u64 *phys_limit)
|
2018-09-07 00:30:54 +00:00
|
|
|
{
|
2019-11-21 09:26:44 +00:00
|
|
|
u64 dma_limit = min_not_zero(dma_mask, dev->bus_dma_limit);
|
2018-09-20 12:04:08 +00:00
|
|
|
|
2018-10-01 14:40:53 +00:00
|
|
|
/*
|
|
|
|
* Optimistically try the zone that the physical address mask falls
|
|
|
|
* into first. If that returns memory that isn't actually addressable
|
|
|
|
* we will fallback to the next lower zone and try again.
|
|
|
|
*
|
|
|
|
* Note that GFP_DMA32 and GFP_DMA are no ops without the corresponding
|
|
|
|
* zones.
|
|
|
|
*/
|
2020-09-08 15:56:22 +00:00
|
|
|
*phys_limit = dma_to_phys(dev, dma_limit);
|
2019-11-21 09:26:44 +00:00
|
|
|
if (*phys_limit <= DMA_BIT_MASK(zone_dma_bits))
|
2018-09-07 00:30:54 +00:00
|
|
|
return GFP_DMA;
|
2019-11-21 09:26:44 +00:00
|
|
|
if (*phys_limit <= DMA_BIT_MASK(32))
|
2018-09-07 00:30:54 +00:00
|
|
|
return GFP_DMA32;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-08-14 10:26:24 +00:00
|
|
|
static bool dma_coherent_ok(struct device *dev, phys_addr_t phys, size_t size)
|
2018-01-09 22:40:57 +00:00
|
|
|
{
|
2020-09-17 16:43:40 +00:00
|
|
|
dma_addr_t dma_addr = phys_to_dma_direct(dev, phys);
|
|
|
|
|
|
|
|
if (dma_addr == DMA_MAPPING_ERROR)
|
|
|
|
return false;
|
|
|
|
return dma_addr + size - 1 <=
|
|
|
|
min_not_zero(dev->coherent_dma_mask, dev->bus_dma_limit);
|
2018-01-09 22:40:57 +00:00
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:40 +00:00
|
|
|
static void __dma_direct_free_pages(struct device *dev, struct page *page,
|
|
|
|
size_t size)
|
|
|
|
{
|
|
|
|
if (IS_ENABLED(CONFIG_DMA_RESTRICTED_POOL) &&
|
|
|
|
swiotlb_free(dev, page, size))
|
|
|
|
return;
|
|
|
|
dma_free_contiguous(dev, page, size);
|
|
|
|
}
|
|
|
|
|
2020-06-15 06:52:31 +00:00
|
|
|
static struct page *__dma_direct_alloc_pages(struct device *dev, size_t size,
|
2020-08-17 15:14:28 +00:00
|
|
|
gfp_t gfp)
|
2016-02-03 05:46:32 +00:00
|
|
|
{
|
2019-08-20 02:45:49 +00:00
|
|
|
int node = dev_to_node(dev);
|
2017-12-22 10:51:44 +00:00
|
|
|
struct page *page = NULL;
|
2019-11-21 09:26:44 +00:00
|
|
|
u64 phys_limit;
|
2016-02-03 05:46:32 +00:00
|
|
|
|
2020-06-11 19:20:28 +00:00
|
|
|
WARN_ON_ONCE(!PAGE_ALIGNED(size));
|
|
|
|
|
2020-04-15 00:04:55 +00:00
|
|
|
gfp |= dma_direct_optimal_gfp_mask(dev, dev->coherent_dma_mask,
|
|
|
|
&phys_limit);
|
2021-06-19 03:40:40 +00:00
|
|
|
if (IS_ENABLED(CONFIG_DMA_RESTRICTED_POOL) &&
|
|
|
|
is_swiotlb_for_alloc(dev)) {
|
|
|
|
page = swiotlb_alloc(dev, size);
|
|
|
|
if (page && !dma_coherent_ok(dev, page_to_phys(page), size)) {
|
|
|
|
__dma_direct_free_pages(dev, page, size);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return page;
|
|
|
|
}
|
|
|
|
|
2020-06-11 19:20:28 +00:00
|
|
|
page = dma_alloc_contiguous(dev, size, gfp);
|
2019-08-20 02:45:49 +00:00
|
|
|
if (page && !dma_coherent_ok(dev, page_to_phys(page), size)) {
|
2020-06-11 19:20:28 +00:00
|
|
|
dma_free_contiguous(dev, page, size);
|
2019-08-20 02:45:49 +00:00
|
|
|
page = NULL;
|
|
|
|
}
|
2018-01-09 22:40:57 +00:00
|
|
|
again:
|
2019-08-20 02:45:49 +00:00
|
|
|
if (!page)
|
2020-06-11 19:20:28 +00:00
|
|
|
page = alloc_pages_node(node, gfp, get_order(size));
|
2018-01-09 22:40:57 +00:00
|
|
|
if (page && !dma_coherent_ok(dev, page_to_phys(page), size)) {
|
dma-contiguous: add dma_{alloc,free}_contiguous() helpers
Both dma_alloc_from_contiguous() and dma_release_from_contiguous() are
very simply implemented, but requiring callers to pass certain
parameters like count and align, and taking a boolean parameter to check
__GFP_NOWARN in the allocation flags. So every function call duplicates
similar work:
unsigned long order = get_order(size);
size_t count = size >> PAGE_SHIFT;
page = dma_alloc_from_contiguous(dev, count, order,
gfp & __GFP_NOWARN);
[...]
dma_release_from_contiguous(dev, page, size >> PAGE_SHIFT);
Additionally, as CMA can be used only in the context which permits
sleeping, most of callers do a gfpflags_allow_blocking() check and a
corresponding fallback allocation of normal pages upon any false result:
if (gfpflags_allow_blocking(flag))
page = dma_alloc_from_contiguous();
if (!page)
page = alloc_pages();
[...]
if (!dma_release_from_contiguous(dev, page, count))
__free_pages(page, get_order(size));
So this patch simplifies those function calls by abstracting these
operations into the two new functions: dma_{alloc,free}_contiguous.
As some callers of dma_{alloc,release}_from_contiguous() might be
complicated, this patch just implements these two new functions to
kernel/dma/direct.c only as an initial step.
Suggested-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Nicolin Chen <nicoleotsuka@gmail.com>
Tested-by: dann frazier <dann.frazier@canonical.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2019-05-24 04:06:32 +00:00
|
|
|
dma_free_contiguous(dev, page, size);
|
2018-01-09 22:40:57 +00:00
|
|
|
page = NULL;
|
|
|
|
|
2018-04-16 15:18:19 +00:00
|
|
|
if (IS_ENABLED(CONFIG_ZONE_DMA32) &&
|
2019-11-21 09:26:44 +00:00
|
|
|
phys_limit < DMA_BIT_MASK(64) &&
|
2018-04-16 15:18:19 +00:00
|
|
|
!(gfp & (GFP_DMA32 | GFP_DMA))) {
|
|
|
|
gfp |= GFP_DMA32;
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
|
2019-02-13 07:01:03 +00:00
|
|
|
if (IS_ENABLED(CONFIG_ZONE_DMA) && !(gfp & GFP_DMA)) {
|
2018-01-09 22:40:57 +00:00
|
|
|
gfp = (gfp & ~GFP_DMA32) | GFP_DMA;
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-04 16:27:56 +00:00
|
|
|
return page;
|
|
|
|
}
|
|
|
|
|
2020-10-07 09:06:09 +00:00
|
|
|
static void *dma_direct_alloc_from_pool(struct device *dev, size_t size,
|
|
|
|
dma_addr_t *dma_handle, gfp_t gfp)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
u64 phys_mask;
|
|
|
|
void *ret;
|
|
|
|
|
|
|
|
gfp |= dma_direct_optimal_gfp_mask(dev, dev->coherent_dma_mask,
|
|
|
|
&phys_mask);
|
|
|
|
page = dma_alloc_from_pool(dev, size, &ret, gfp, dma_coherent_ok);
|
|
|
|
if (!page)
|
|
|
|
return NULL;
|
|
|
|
*dma_handle = phys_to_dma_direct(dev, page_to_phys(page));
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2020-08-17 15:06:40 +00:00
|
|
|
void *dma_direct_alloc(struct device *dev, size_t size,
|
2018-11-04 16:27:56 +00:00
|
|
|
dma_addr_t *dma_handle, gfp_t gfp, unsigned long attrs)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
void *ret;
|
2020-06-11 19:20:30 +00:00
|
|
|
int err;
|
2018-11-04 16:27:56 +00:00
|
|
|
|
2020-06-11 19:20:28 +00:00
|
|
|
size = PAGE_ALIGN(size);
|
2020-08-17 15:14:28 +00:00
|
|
|
if (attrs & DMA_ATTR_NO_WARN)
|
|
|
|
gfp |= __GFP_NOWARN;
|
2020-06-11 19:20:28 +00:00
|
|
|
|
2019-08-06 11:33:23 +00:00
|
|
|
if ((attrs & DMA_ATTR_NO_KERNEL_MAPPING) &&
|
2021-06-19 03:40:40 +00:00
|
|
|
!force_dma_unencrypted(dev) && !is_swiotlb_for_alloc(dev)) {
|
2020-10-07 09:04:08 +00:00
|
|
|
page = __dma_direct_alloc_pages(dev, size, gfp & ~__GFP_ZERO);
|
|
|
|
if (!page)
|
|
|
|
return NULL;
|
2019-06-14 14:17:27 +00:00
|
|
|
/* remove any dirty cache lines on the kernel alias */
|
|
|
|
if (!PageHighMem(page))
|
|
|
|
arch_dma_prep_coherent(page, size);
|
2020-10-07 09:04:08 +00:00
|
|
|
*dma_handle = phys_to_dma_direct(dev, page_to_phys(page));
|
2019-06-14 14:17:27 +00:00
|
|
|
/* return the page pointer as the opaque cookie */
|
2020-10-07 09:04:08 +00:00
|
|
|
return page;
|
2019-10-29 10:06:32 +00:00
|
|
|
}
|
|
|
|
|
2020-10-07 09:04:08 +00:00
|
|
|
if (!IS_ENABLED(CONFIG_ARCH_HAS_DMA_SET_UNCACHED) &&
|
2021-06-19 03:40:40 +00:00
|
|
|
!IS_ENABLED(CONFIG_DMA_DIRECT_REMAP) && !dev_is_dma_coherent(dev) &&
|
|
|
|
!is_swiotlb_for_alloc(dev))
|
2020-10-07 09:04:08 +00:00
|
|
|
return arch_dma_alloc(dev, size, dma_handle, gfp, attrs);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Remapping or decrypting memory may block. If either is required and
|
|
|
|
* we can't block, allocate the memory from the atomic pools.
|
2021-06-19 03:40:40 +00:00
|
|
|
* If restricted DMA (i.e., is_swiotlb_for_alloc) is required, one must
|
|
|
|
* set up another device coherent pool by shared-dma-pool and use
|
|
|
|
* dma_alloc_from_dev_coherent instead.
|
2020-10-07 09:04:08 +00:00
|
|
|
*/
|
|
|
|
if (IS_ENABLED(CONFIG_DMA_COHERENT_POOL) &&
|
|
|
|
!gfpflags_allow_blocking(gfp) &&
|
|
|
|
(force_dma_unencrypted(dev) ||
|
2021-06-19 03:40:40 +00:00
|
|
|
(IS_ENABLED(CONFIG_DMA_DIRECT_REMAP) &&
|
|
|
|
!dev_is_dma_coherent(dev))) &&
|
|
|
|
!is_swiotlb_for_alloc(dev))
|
2020-10-07 09:04:08 +00:00
|
|
|
return dma_direct_alloc_from_pool(dev, size, dma_handle, gfp);
|
|
|
|
|
|
|
|
/* we always manually zero the memory once we are done */
|
|
|
|
page = __dma_direct_alloc_pages(dev, size, gfp & ~__GFP_ZERO);
|
|
|
|
if (!page)
|
|
|
|
return NULL;
|
|
|
|
|
2019-10-29 10:06:32 +00:00
|
|
|
if ((IS_ENABLED(CONFIG_DMA_DIRECT_REMAP) &&
|
2020-10-07 09:04:08 +00:00
|
|
|
!dev_is_dma_coherent(dev)) ||
|
2019-10-29 10:06:32 +00:00
|
|
|
(IS_ENABLED(CONFIG_DMA_REMAP) && PageHighMem(page))) {
|
|
|
|
/* remove any dirty cache lines on the kernel alias */
|
2020-06-11 19:20:28 +00:00
|
|
|
arch_dma_prep_coherent(page, size);
|
2019-10-29 10:06:32 +00:00
|
|
|
|
|
|
|
/* create a coherent mapping */
|
2020-06-11 19:20:28 +00:00
|
|
|
ret = dma_common_contiguous_remap(page, size,
|
2019-10-29 10:06:32 +00:00
|
|
|
dma_pgprot(dev, PAGE_KERNEL, attrs),
|
|
|
|
__builtin_return_address(0));
|
2020-02-21 20:26:00 +00:00
|
|
|
if (!ret)
|
|
|
|
goto out_free_pages;
|
2020-06-11 19:20:32 +00:00
|
|
|
if (force_dma_unencrypted(dev)) {
|
|
|
|
err = set_memory_decrypted((unsigned long)ret,
|
|
|
|
1 << get_order(size));
|
|
|
|
if (err)
|
|
|
|
goto out_free_pages;
|
|
|
|
}
|
2019-10-29 10:06:32 +00:00
|
|
|
memset(ret, 0, size);
|
|
|
|
goto done;
|
2019-06-14 14:17:27 +00:00
|
|
|
}
|
|
|
|
|
2018-09-22 18:47:26 +00:00
|
|
|
if (PageHighMem(page)) {
|
|
|
|
/*
|
|
|
|
* Depending on the cma= arguments and per-arch setup
|
dma-contiguous: add dma_{alloc,free}_contiguous() helpers
Both dma_alloc_from_contiguous() and dma_release_from_contiguous() are
very simply implemented, but requiring callers to pass certain
parameters like count and align, and taking a boolean parameter to check
__GFP_NOWARN in the allocation flags. So every function call duplicates
similar work:
unsigned long order = get_order(size);
size_t count = size >> PAGE_SHIFT;
page = dma_alloc_from_contiguous(dev, count, order,
gfp & __GFP_NOWARN);
[...]
dma_release_from_contiguous(dev, page, size >> PAGE_SHIFT);
Additionally, as CMA can be used only in the context which permits
sleeping, most of callers do a gfpflags_allow_blocking() check and a
corresponding fallback allocation of normal pages upon any false result:
if (gfpflags_allow_blocking(flag))
page = dma_alloc_from_contiguous();
if (!page)
page = alloc_pages();
[...]
if (!dma_release_from_contiguous(dev, page, count))
__free_pages(page, get_order(size));
So this patch simplifies those function calls by abstracting these
operations into the two new functions: dma_{alloc,free}_contiguous.
As some callers of dma_{alloc,release}_from_contiguous() might be
complicated, this patch just implements these two new functions to
kernel/dma/direct.c only as an initial step.
Suggested-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Nicolin Chen <nicoleotsuka@gmail.com>
Tested-by: dann frazier <dann.frazier@canonical.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2019-05-24 04:06:32 +00:00
|
|
|
* dma_alloc_contiguous could return highmem pages.
|
2018-09-22 18:47:26 +00:00
|
|
|
* Without remapping there is no way to return them here,
|
|
|
|
* so log an error and fail.
|
|
|
|
*/
|
|
|
|
dev_info(dev, "Rejecting highmem page from CMA.\n");
|
2020-02-21 20:26:00 +00:00
|
|
|
goto out_free_pages;
|
2018-09-22 18:47:26 +00:00
|
|
|
}
|
|
|
|
|
2018-03-19 10:38:25 +00:00
|
|
|
ret = page_address(page);
|
2020-06-11 19:20:30 +00:00
|
|
|
if (force_dma_unencrypted(dev)) {
|
|
|
|
err = set_memory_decrypted((unsigned long)ret,
|
|
|
|
1 << get_order(size));
|
|
|
|
if (err)
|
|
|
|
goto out_free_pages;
|
|
|
|
}
|
2019-10-29 10:06:32 +00:00
|
|
|
|
2018-03-19 10:38:25 +00:00
|
|
|
memset(ret, 0, size);
|
2019-06-03 06:43:51 +00:00
|
|
|
|
2020-02-21 23:55:43 +00:00
|
|
|
if (IS_ENABLED(CONFIG_ARCH_HAS_DMA_SET_UNCACHED) &&
|
2020-10-07 09:04:08 +00:00
|
|
|
!dev_is_dma_coherent(dev)) {
|
2019-06-03 06:43:51 +00:00
|
|
|
arch_dma_prep_coherent(page, size);
|
2020-02-21 23:55:43 +00:00
|
|
|
ret = arch_dma_set_uncached(ret, size);
|
|
|
|
if (IS_ERR(ret))
|
2020-06-11 19:20:29 +00:00
|
|
|
goto out_encrypt_pages;
|
2019-06-03 06:43:51 +00:00
|
|
|
}
|
2019-10-29 10:06:32 +00:00
|
|
|
done:
|
2020-08-17 15:20:52 +00:00
|
|
|
*dma_handle = phys_to_dma_direct(dev, page_to_phys(page));
|
2018-03-19 10:38:25 +00:00
|
|
|
return ret;
|
2020-06-11 19:20:29 +00:00
|
|
|
|
|
|
|
out_encrypt_pages:
|
2020-06-11 19:20:30 +00:00
|
|
|
if (force_dma_unencrypted(dev)) {
|
|
|
|
err = set_memory_encrypted((unsigned long)page_address(page),
|
|
|
|
1 << get_order(size));
|
|
|
|
/* If memory cannot be re-encrypted, it must be leaked */
|
|
|
|
if (err)
|
|
|
|
return NULL;
|
|
|
|
}
|
2020-02-21 20:26:00 +00:00
|
|
|
out_free_pages:
|
2021-06-19 03:40:40 +00:00
|
|
|
__dma_direct_free_pages(dev, page, size);
|
2020-02-21 20:26:00 +00:00
|
|
|
return NULL;
|
2016-02-03 05:46:32 +00:00
|
|
|
}
|
|
|
|
|
2020-08-17 15:06:40 +00:00
|
|
|
void dma_direct_free(struct device *dev, size_t size,
|
|
|
|
void *cpu_addr, dma_addr_t dma_addr, unsigned long attrs)
|
2016-02-03 05:46:32 +00:00
|
|
|
{
|
2018-03-19 10:38:25 +00:00
|
|
|
unsigned int page_order = get_order(size);
|
2017-12-22 10:51:44 +00:00
|
|
|
|
2020-10-07 09:04:08 +00:00
|
|
|
if ((attrs & DMA_ATTR_NO_KERNEL_MAPPING) &&
|
2021-06-19 03:40:40 +00:00
|
|
|
!force_dma_unencrypted(dev) && !is_swiotlb_for_alloc(dev)) {
|
2020-10-07 09:04:08 +00:00
|
|
|
/* cpu_addr is a struct page cookie, not a kernel address */
|
|
|
|
dma_free_contiguous(dev, cpu_addr, size);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2020-08-17 15:06:40 +00:00
|
|
|
if (!IS_ENABLED(CONFIG_ARCH_HAS_DMA_SET_UNCACHED) &&
|
2021-06-19 03:40:40 +00:00
|
|
|
!IS_ENABLED(CONFIG_DMA_DIRECT_REMAP) && !dev_is_dma_coherent(dev) &&
|
|
|
|
!is_swiotlb_for_alloc(dev)) {
|
2020-08-17 15:06:40 +00:00
|
|
|
arch_dma_free(dev, size, cpu_addr, dma_addr, attrs);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2020-04-15 00:04:58 +00:00
|
|
|
/* If cpu_addr is not from an atomic pool, dma_free_from_pool() fails */
|
2020-10-07 09:04:08 +00:00
|
|
|
if (IS_ENABLED(CONFIG_DMA_COHERENT_POOL) &&
|
2020-04-15 00:04:58 +00:00
|
|
|
dma_free_from_pool(dev, cpu_addr, PAGE_ALIGN(size)))
|
|
|
|
return;
|
|
|
|
|
2019-07-10 19:01:19 +00:00
|
|
|
if (force_dma_unencrypted(dev))
|
2018-03-19 10:38:25 +00:00
|
|
|
set_memory_encrypted((unsigned long)cpu_addr, 1 << page_order);
|
2019-06-03 06:43:51 +00:00
|
|
|
|
2019-10-29 10:06:32 +00:00
|
|
|
if (IS_ENABLED(CONFIG_DMA_REMAP) && is_vmalloc_addr(cpu_addr))
|
|
|
|
vunmap(cpu_addr);
|
2020-02-21 20:35:05 +00:00
|
|
|
else if (IS_ENABLED(CONFIG_ARCH_HAS_DMA_CLEAR_UNCACHED))
|
|
|
|
arch_dma_clear_uncached(cpu_addr, size);
|
2019-10-29 10:06:32 +00:00
|
|
|
|
2021-06-19 03:40:40 +00:00
|
|
|
__dma_direct_free_pages(dev, dma_direct_to_page(dev, dma_addr), size);
|
2016-02-03 05:46:32 +00:00
|
|
|
}
|
|
|
|
|
2020-09-01 11:34:33 +00:00
|
|
|
struct page *dma_direct_alloc_pages(struct device *dev, size_t size,
|
|
|
|
dma_addr_t *dma_handle, enum dma_data_direction dir, gfp_t gfp)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
void *ret;
|
|
|
|
|
2020-10-07 09:04:08 +00:00
|
|
|
if (IS_ENABLED(CONFIG_DMA_COHERENT_POOL) &&
|
2021-06-19 03:40:40 +00:00
|
|
|
force_dma_unencrypted(dev) && !gfpflags_allow_blocking(gfp) &&
|
|
|
|
!is_swiotlb_for_alloc(dev))
|
2020-10-07 09:06:09 +00:00
|
|
|
return dma_direct_alloc_from_pool(dev, size, dma_handle, gfp);
|
2020-09-01 11:34:33 +00:00
|
|
|
|
|
|
|
page = __dma_direct_alloc_pages(dev, size, gfp);
|
|
|
|
if (!page)
|
|
|
|
return NULL;
|
2020-09-26 14:39:36 +00:00
|
|
|
if (PageHighMem(page)) {
|
|
|
|
/*
|
|
|
|
* Depending on the cma= arguments and per-arch setup
|
|
|
|
* dma_alloc_contiguous could return highmem pages.
|
|
|
|
* Without remapping there is no way to return them here,
|
|
|
|
* so log an error and fail.
|
|
|
|
*/
|
|
|
|
dev_info(dev, "Rejecting highmem page from CMA.\n");
|
|
|
|
goto out_free_pages;
|
|
|
|
}
|
|
|
|
|
2020-09-01 11:34:33 +00:00
|
|
|
ret = page_address(page);
|
|
|
|
if (force_dma_unencrypted(dev)) {
|
|
|
|
if (set_memory_decrypted((unsigned long)ret,
|
|
|
|
1 << get_order(size)))
|
|
|
|
goto out_free_pages;
|
|
|
|
}
|
|
|
|
memset(ret, 0, size);
|
|
|
|
*dma_handle = phys_to_dma_direct(dev, page_to_phys(page));
|
|
|
|
return page;
|
|
|
|
out_free_pages:
|
2021-06-19 03:40:40 +00:00
|
|
|
__dma_direct_free_pages(dev, page, size);
|
2020-09-01 11:34:33 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void dma_direct_free_pages(struct device *dev, size_t size,
|
|
|
|
struct page *page, dma_addr_t dma_addr,
|
|
|
|
enum dma_data_direction dir)
|
|
|
|
{
|
|
|
|
unsigned int page_order = get_order(size);
|
|
|
|
void *vaddr = page_address(page);
|
|
|
|
|
|
|
|
/* If cpu_addr is not from an atomic pool, dma_free_from_pool() fails */
|
2020-10-07 09:04:08 +00:00
|
|
|
if (IS_ENABLED(CONFIG_DMA_COHERENT_POOL) &&
|
2020-09-01 11:34:33 +00:00
|
|
|
dma_free_from_pool(dev, vaddr, size))
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (force_dma_unencrypted(dev))
|
|
|
|
set_memory_encrypted((unsigned long)vaddr, 1 << page_order);
|
|
|
|
|
2021-06-19 03:40:40 +00:00
|
|
|
__dma_direct_free_pages(dev, page, size);
|
2020-09-01 11:34:33 +00:00
|
|
|
}
|
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
#if defined(CONFIG_ARCH_HAS_SYNC_DMA_FOR_DEVICE) || \
|
|
|
|
defined(CONFIG_SWIOTLB)
|
|
|
|
void dma_direct_sync_sg_for_device(struct device *dev,
|
2018-09-08 09:22:43 +00:00
|
|
|
struct scatterlist *sgl, int nents, enum dma_data_direction dir)
|
|
|
|
{
|
|
|
|
struct scatterlist *sg;
|
|
|
|
int i;
|
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
for_each_sg(sgl, sg, nents, i) {
|
2019-07-19 09:26:48 +00:00
|
|
|
phys_addr_t paddr = dma_to_phys(dev, sg_dma_address(sg));
|
|
|
|
|
2021-06-19 03:40:35 +00:00
|
|
|
if (unlikely(is_swiotlb_buffer(dev, paddr)))
|
2021-03-01 07:44:26 +00:00
|
|
|
swiotlb_sync_single_for_device(dev, paddr, sg->length,
|
|
|
|
dir);
|
2018-09-08 09:22:43 +00:00
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
if (!dev_is_dma_coherent(dev))
|
2019-11-07 17:03:11 +00:00
|
|
|
arch_sync_dma_for_device(paddr, sg->length,
|
2018-12-03 10:43:54 +00:00
|
|
|
dir);
|
|
|
|
}
|
2018-09-08 09:22:43 +00:00
|
|
|
}
|
2018-12-03 10:14:09 +00:00
|
|
|
#endif
|
2018-09-08 09:22:43 +00:00
|
|
|
|
|
|
|
#if defined(CONFIG_ARCH_HAS_SYNC_DMA_FOR_CPU) || \
|
2018-12-03 10:43:54 +00:00
|
|
|
defined(CONFIG_ARCH_HAS_SYNC_DMA_FOR_CPU_ALL) || \
|
|
|
|
defined(CONFIG_SWIOTLB)
|
|
|
|
void dma_direct_sync_sg_for_cpu(struct device *dev,
|
2018-09-08 09:22:43 +00:00
|
|
|
struct scatterlist *sgl, int nents, enum dma_data_direction dir)
|
|
|
|
{
|
|
|
|
struct scatterlist *sg;
|
|
|
|
int i;
|
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
for_each_sg(sgl, sg, nents, i) {
|
2019-07-19 09:26:48 +00:00
|
|
|
phys_addr_t paddr = dma_to_phys(dev, sg_dma_address(sg));
|
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
if (!dev_is_dma_coherent(dev))
|
2019-11-07 17:03:11 +00:00
|
|
|
arch_sync_dma_for_cpu(paddr, sg->length, dir);
|
2019-07-19 09:26:48 +00:00
|
|
|
|
2021-06-19 03:40:35 +00:00
|
|
|
if (unlikely(is_swiotlb_buffer(dev, paddr)))
|
2021-03-01 07:44:26 +00:00
|
|
|
swiotlb_sync_single_for_cpu(dev, paddr, sg->length,
|
|
|
|
dir);
|
2020-08-17 14:41:50 +00:00
|
|
|
|
|
|
|
if (dir == DMA_FROM_DEVICE)
|
|
|
|
arch_dma_mark_clean(paddr, sg->length);
|
2018-12-03 10:43:54 +00:00
|
|
|
}
|
2018-09-08 09:22:43 +00:00
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
if (!dev_is_dma_coherent(dev))
|
2019-11-07 17:03:11 +00:00
|
|
|
arch_sync_dma_for_cpu_all();
|
2018-09-08 09:22:43 +00:00
|
|
|
}
|
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
void dma_direct_unmap_sg(struct device *dev, struct scatterlist *sgl,
|
2018-09-08 09:22:43 +00:00
|
|
|
int nents, enum dma_data_direction dir, unsigned long attrs)
|
|
|
|
{
|
2018-12-03 10:43:54 +00:00
|
|
|
struct scatterlist *sg;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for_each_sg(sgl, sg, nents, i)
|
|
|
|
dma_direct_unmap_page(dev, sg->dma_address, sg_dma_len(sg), dir,
|
|
|
|
attrs);
|
2018-09-08 09:22:43 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-04-16 13:24:51 +00:00
|
|
|
int dma_direct_map_sg(struct device *dev, struct scatterlist *sgl, int nents,
|
|
|
|
enum dma_data_direction dir, unsigned long attrs)
|
2016-02-03 05:46:32 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct scatterlist *sg;
|
|
|
|
|
|
|
|
for_each_sg(sgl, sg, nents, i) {
|
2018-12-03 10:14:09 +00:00
|
|
|
sg->dma_address = dma_direct_map_page(dev, sg_page(sg),
|
|
|
|
sg->offset, sg->length, dir, attrs);
|
|
|
|
if (sg->dma_address == DMA_MAPPING_ERROR)
|
2018-12-03 10:43:54 +00:00
|
|
|
goto out_unmap;
|
2016-02-03 05:46:32 +00:00
|
|
|
sg_dma_len(sg) = sg->length;
|
|
|
|
}
|
|
|
|
|
|
|
|
return nents;
|
2018-12-03 10:43:54 +00:00
|
|
|
|
|
|
|
out_unmap:
|
|
|
|
dma_direct_unmap_sg(dev, sgl, i, dir, attrs | DMA_ATTR_SKIP_CPU_SYNC);
|
|
|
|
return 0;
|
2016-02-03 05:46:32 +00:00
|
|
|
}
|
|
|
|
|
2019-01-04 17:20:05 +00:00
|
|
|
dma_addr_t dma_direct_map_resource(struct device *dev, phys_addr_t paddr,
|
|
|
|
size_t size, enum dma_data_direction dir, unsigned long attrs)
|
|
|
|
{
|
|
|
|
dma_addr_t dma_addr = paddr;
|
|
|
|
|
2019-11-19 16:38:58 +00:00
|
|
|
if (unlikely(!dma_capable(dev, dma_addr, size, false))) {
|
2020-02-03 13:54:50 +00:00
|
|
|
dev_err_once(dev,
|
|
|
|
"DMA addr %pad+%zu overflow (mask %llx, bus limit %llx).\n",
|
|
|
|
&dma_addr, size, *dev->dma_mask, dev->bus_dma_limit);
|
|
|
|
WARN_ON_ONCE(1);
|
2019-01-04 17:20:05 +00:00
|
|
|
return DMA_MAPPING_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
return dma_addr;
|
|
|
|
}
|
|
|
|
|
2019-10-29 10:01:37 +00:00
|
|
|
int dma_direct_get_sgtable(struct device *dev, struct sg_table *sgt,
|
|
|
|
void *cpu_addr, dma_addr_t dma_addr, size_t size,
|
|
|
|
unsigned long attrs)
|
|
|
|
{
|
|
|
|
struct page *page = dma_direct_to_page(dev, dma_addr);
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = sg_alloc_table(sgt, 1, GFP_KERNEL);
|
|
|
|
if (!ret)
|
|
|
|
sg_set_page(sgt->sgl, page, PAGE_ALIGN(size), 0);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool dma_direct_can_mmap(struct device *dev)
|
|
|
|
{
|
|
|
|
return dev_is_dma_coherent(dev) ||
|
|
|
|
IS_ENABLED(CONFIG_DMA_NONCOHERENT_MMAP);
|
|
|
|
}
|
|
|
|
|
|
|
|
int dma_direct_mmap(struct device *dev, struct vm_area_struct *vma,
|
|
|
|
void *cpu_addr, dma_addr_t dma_addr, size_t size,
|
|
|
|
unsigned long attrs)
|
|
|
|
{
|
|
|
|
unsigned long user_count = vma_pages(vma);
|
|
|
|
unsigned long count = PAGE_ALIGN(size) >> PAGE_SHIFT;
|
|
|
|
unsigned long pfn = PHYS_PFN(dma_to_phys(dev, dma_addr));
|
|
|
|
int ret = -ENXIO;
|
|
|
|
|
|
|
|
vma->vm_page_prot = dma_pgprot(dev, vma->vm_page_prot, attrs);
|
|
|
|
|
|
|
|
if (dma_mmap_from_dev_coherent(dev, vma, cpu_addr, size, &ret))
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
if (vma->vm_pgoff >= count || user_count > count - vma->vm_pgoff)
|
|
|
|
return -ENXIO;
|
|
|
|
return remap_pfn_range(vma, vma->vm_start, pfn + vma->vm_pgoff,
|
|
|
|
user_count << PAGE_SHIFT, vma->vm_page_prot);
|
|
|
|
}
|
|
|
|
|
2017-12-24 14:04:32 +00:00
|
|
|
int dma_direct_supported(struct device *dev, u64 mask)
|
|
|
|
{
|
2020-02-03 17:11:10 +00:00
|
|
|
u64 min_mask = (max_pfn - 1) << PAGE_SHIFT;
|
2018-09-07 07:31:58 +00:00
|
|
|
|
2020-02-03 17:11:10 +00:00
|
|
|
/*
|
|
|
|
* Because 32-bit DMA masks are so common we expect every architecture
|
|
|
|
* to be able to satisfy them - either by not supporting more physical
|
|
|
|
* memory, or by providing a ZONE_DMA32. If neither is the case, the
|
|
|
|
* architecture needs to use an IOMMU instead of the direct mapping.
|
|
|
|
*/
|
|
|
|
if (mask >= DMA_BIT_MASK(32))
|
|
|
|
return 1;
|
2018-09-07 07:31:58 +00:00
|
|
|
|
2018-12-17 14:39:16 +00:00
|
|
|
/*
|
2020-08-17 15:34:03 +00:00
|
|
|
* This check needs to be against the actual bit mask value, so use
|
|
|
|
* phys_to_dma_unencrypted() here so that the SME encryption mask isn't
|
2018-12-17 14:39:16 +00:00
|
|
|
* part of the check.
|
|
|
|
*/
|
2020-02-03 17:11:10 +00:00
|
|
|
if (IS_ENABLED(CONFIG_ZONE_DMA))
|
|
|
|
min_mask = min_t(u64, min_mask, DMA_BIT_MASK(zone_dma_bits));
|
2020-08-17 15:34:03 +00:00
|
|
|
return mask >= phys_to_dma_unencrypted(dev, min_mask);
|
2017-12-24 14:04:32 +00:00
|
|
|
}
|
2019-02-07 11:59:15 +00:00
|
|
|
|
|
|
|
size_t dma_direct_max_mapping_size(struct device *dev)
|
|
|
|
{
|
|
|
|
/* If SWIOTLB is active, use its maximum mapping size */
|
2021-06-19 03:40:36 +00:00
|
|
|
if (is_swiotlb_active(dev) &&
|
2021-06-24 15:55:20 +00:00
|
|
|
(dma_addressing_limited(dev) || is_swiotlb_force_bounce(dev)))
|
2019-07-16 20:00:54 +00:00
|
|
|
return swiotlb_max_mapping_size(dev);
|
|
|
|
return SIZE_MAX;
|
2019-02-07 11:59:15 +00:00
|
|
|
}
|
2020-06-29 13:03:56 +00:00
|
|
|
|
|
|
|
bool dma_direct_need_sync(struct device *dev, dma_addr_t dma_addr)
|
|
|
|
{
|
|
|
|
return !dev_is_dma_coherent(dev) ||
|
2021-06-19 03:40:35 +00:00
|
|
|
is_swiotlb_buffer(dev, dma_to_phys(dev, dma_addr));
|
2020-06-29 13:03:56 +00:00
|
|
|
}
|
2020-09-17 16:43:40 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* dma_direct_set_offset - Assign scalar offset for a single DMA range.
|
|
|
|
* @dev: device pointer; needed to "own" the alloced memory.
|
|
|
|
* @cpu_start: beginning of memory region covered by this offset.
|
|
|
|
* @dma_start: beginning of DMA/PCI region covered by this offset.
|
|
|
|
* @size: size of the region.
|
|
|
|
*
|
|
|
|
* This is for the simple case of a uniform offset which cannot
|
|
|
|
* be discovered by "dma-ranges".
|
|
|
|
*
|
|
|
|
* It returns -ENOMEM if out of memory, -EINVAL if a map
|
|
|
|
* already exists, 0 otherwise.
|
|
|
|
*
|
|
|
|
* Note: any call to this from a driver is a bug. The mapping needs
|
|
|
|
* to be described by the device tree or other firmware interfaces.
|
|
|
|
*/
|
|
|
|
int dma_direct_set_offset(struct device *dev, phys_addr_t cpu_start,
|
|
|
|
dma_addr_t dma_start, u64 size)
|
|
|
|
{
|
|
|
|
struct bus_dma_region *map;
|
|
|
|
u64 offset = (u64)cpu_start - (u64)dma_start;
|
|
|
|
|
|
|
|
if (dev->dma_range_map) {
|
|
|
|
dev_err(dev, "attempt to add DMA range to existing map\n");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!offset)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
map = kcalloc(2, sizeof(*map), GFP_KERNEL);
|
|
|
|
if (!map)
|
|
|
|
return -ENOMEM;
|
|
|
|
map[0].cpu_start = cpu_start;
|
|
|
|
map[0].dma_start = dma_start;
|
|
|
|
map[0].offset = offset;
|
|
|
|
map[0].size = size;
|
|
|
|
dev->dma_range_map = map;
|
|
|
|
return 0;
|
|
|
|
}
|