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
|
2008-06-29 10:18:46 +00:00
|
|
|
/*
|
|
|
|
* Coherent per-device memory handling.
|
|
|
|
* Borrowed from i386
|
|
|
|
*/
|
2016-03-22 21:28:03 +00:00
|
|
|
#include <linux/io.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2008-06-29 10:18:46 +00:00
|
|
|
#include <linux/kernel.h>
|
2011-07-01 20:07:32 +00:00
|
|
|
#include <linux/module.h>
|
2020-09-17 16:43:40 +00:00
|
|
|
#include <linux/dma-direct.h>
|
2020-09-22 13:31:03 +00:00
|
|
|
#include <linux/dma-map-ops.h>
|
2008-06-29 10:18:46 +00:00
|
|
|
|
|
|
|
struct dma_coherent_mem {
|
|
|
|
void *virt_base;
|
2010-05-31 10:03:04 +00:00
|
|
|
dma_addr_t device_base;
|
2014-05-20 22:54:22 +00:00
|
|
|
unsigned long pfn_base;
|
2008-06-29 10:18:46 +00:00
|
|
|
int size;
|
|
|
|
unsigned long *bitmap;
|
2014-10-13 22:51:07 +00:00
|
|
|
spinlock_t spinlock;
|
2017-06-26 09:18:57 +00:00
|
|
|
bool use_dev_dma_pfn_offset;
|
2008-06-29 10:18:46 +00:00
|
|
|
};
|
|
|
|
|
2017-06-26 09:18:58 +00:00
|
|
|
static struct dma_coherent_mem *dma_coherent_default_memory __ro_after_init;
|
|
|
|
|
|
|
|
static inline struct dma_coherent_mem *dev_get_coherent_memory(struct device *dev)
|
|
|
|
{
|
|
|
|
if (dev && dev->dma_mem)
|
|
|
|
return dev->dma_mem;
|
2017-07-20 10:19:58 +00:00
|
|
|
return NULL;
|
2017-06-26 09:18:58 +00:00
|
|
|
}
|
|
|
|
|
2017-06-26 09:18:57 +00:00
|
|
|
static inline dma_addr_t dma_get_device_base(struct device *dev,
|
|
|
|
struct dma_coherent_mem * mem)
|
|
|
|
{
|
|
|
|
if (mem->use_dev_dma_pfn_offset)
|
2020-09-17 16:43:40 +00:00
|
|
|
return phys_to_dma(dev, PFN_PHYS(mem->pfn_base));
|
|
|
|
return mem->device_base;
|
2017-06-26 09:18:57 +00:00
|
|
|
}
|
|
|
|
|
2018-12-25 12:29:54 +00:00
|
|
|
static int dma_init_coherent_memory(phys_addr_t phys_addr,
|
|
|
|
dma_addr_t device_addr, size_t size,
|
|
|
|
struct dma_coherent_mem **mem)
|
2008-06-29 10:18:46 +00:00
|
|
|
{
|
2014-10-13 22:51:07 +00:00
|
|
|
struct dma_coherent_mem *dma_mem = NULL;
|
2019-02-01 21:25:09 +00:00
|
|
|
void *mem_base = NULL;
|
2008-06-29 10:18:46 +00:00
|
|
|
int pages = size >> PAGE_SHIFT;
|
|
|
|
int bitmap_size = BITS_TO_LONGS(pages) * sizeof(long);
|
2017-09-05 08:10:09 +00:00
|
|
|
int ret;
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2017-09-05 08:10:09 +00:00
|
|
|
if (!size) {
|
|
|
|
ret = -EINVAL;
|
2008-06-29 10:18:46 +00:00
|
|
|
goto out;
|
2017-09-05 08:10:09 +00:00
|
|
|
}
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2017-08-25 15:13:09 +00:00
|
|
|
mem_base = memremap(phys_addr, size, MEMREMAP_WC);
|
2017-09-05 08:10:09 +00:00
|
|
|
if (!mem_base) {
|
|
|
|
ret = -EINVAL;
|
2008-06-29 10:18:46 +00:00
|
|
|
goto out;
|
2017-09-05 08:10:09 +00:00
|
|
|
}
|
2014-10-13 22:51:07 +00:00
|
|
|
dma_mem = kzalloc(sizeof(struct dma_coherent_mem), GFP_KERNEL);
|
2017-09-05 08:10:09 +00:00
|
|
|
if (!dma_mem) {
|
|
|
|
ret = -ENOMEM;
|
2008-06-29 10:18:46 +00:00
|
|
|
goto out;
|
2017-09-05 08:10:09 +00:00
|
|
|
}
|
2014-10-13 22:51:07 +00:00
|
|
|
dma_mem->bitmap = kzalloc(bitmap_size, GFP_KERNEL);
|
2017-09-05 08:10:09 +00:00
|
|
|
if (!dma_mem->bitmap) {
|
|
|
|
ret = -ENOMEM;
|
2014-10-13 22:51:07 +00:00
|
|
|
goto out;
|
2017-09-05 08:10:09 +00:00
|
|
|
}
|
2014-10-13 22:51:07 +00:00
|
|
|
|
|
|
|
dma_mem->virt_base = mem_base;
|
|
|
|
dma_mem->device_base = device_addr;
|
|
|
|
dma_mem->pfn_base = PFN_DOWN(phys_addr);
|
|
|
|
dma_mem->size = pages;
|
|
|
|
spin_lock_init(&dma_mem->spinlock);
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2014-10-13 22:51:07 +00:00
|
|
|
*mem = dma_mem;
|
2017-09-05 08:10:09 +00:00
|
|
|
return 0;
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2014-10-13 22:51:07 +00:00
|
|
|
out:
|
|
|
|
kfree(dma_mem);
|
2017-08-25 15:13:09 +00:00
|
|
|
if (mem_base)
|
|
|
|
memunmap(mem_base);
|
2017-09-05 08:10:09 +00:00
|
|
|
return ret;
|
2008-06-29 10:18:46 +00:00
|
|
|
}
|
2014-10-13 22:51:07 +00:00
|
|
|
|
|
|
|
static void dma_release_coherent_memory(struct dma_coherent_mem *mem)
|
|
|
|
{
|
|
|
|
if (!mem)
|
|
|
|
return;
|
2016-03-22 21:28:03 +00:00
|
|
|
|
2017-08-25 15:13:09 +00:00
|
|
|
memunmap(mem->virt_base);
|
2014-10-13 22:51:07 +00:00
|
|
|
kfree(mem->bitmap);
|
|
|
|
kfree(mem);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int dma_assign_coherent_memory(struct device *dev,
|
|
|
|
struct dma_coherent_mem *mem)
|
|
|
|
{
|
2017-06-26 09:18:58 +00:00
|
|
|
if (!dev)
|
|
|
|
return -ENODEV;
|
|
|
|
|
2014-10-13 22:51:07 +00:00
|
|
|
if (dev->dma_mem)
|
|
|
|
return -EBUSY;
|
|
|
|
|
|
|
|
dev->dma_mem = mem;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-08-18 17:32:42 +00:00
|
|
|
/*
|
|
|
|
* Declare a region of memory to be handed out by dma_alloc_coherent() when it
|
|
|
|
* is asked for coherent memory for this device. This shall only be used
|
|
|
|
* from platform code, usually based on the device tree description.
|
2021-06-08 07:52:19 +00:00
|
|
|
*
|
2020-08-18 17:32:42 +00:00
|
|
|
* phys_addr is the CPU physical address to which the memory is currently
|
|
|
|
* assigned (this will be ioremapped so the CPU can access the region).
|
|
|
|
*
|
|
|
|
* device_addr is the DMA address the device needs to be programmed with to
|
|
|
|
* actually address this memory (this will be handed out as the dma_addr_t in
|
|
|
|
* dma_alloc_coherent()).
|
|
|
|
*
|
|
|
|
* size is the size of the area (must be a multiple of PAGE_SIZE).
|
|
|
|
*
|
|
|
|
* As a simplification for the platforms, only *one* such region of memory may
|
|
|
|
* be declared per device.
|
|
|
|
*/
|
2014-10-13 22:51:07 +00:00
|
|
|
int dma_declare_coherent_memory(struct device *dev, phys_addr_t phys_addr,
|
2018-12-25 12:29:54 +00:00
|
|
|
dma_addr_t device_addr, size_t size)
|
2014-10-13 22:51:07 +00:00
|
|
|
{
|
|
|
|
struct dma_coherent_mem *mem;
|
2017-08-25 15:13:09 +00:00
|
|
|
int ret;
|
2014-10-13 22:51:07 +00:00
|
|
|
|
2018-12-25 12:29:54 +00:00
|
|
|
ret = dma_init_coherent_memory(phys_addr, device_addr, size, &mem);
|
2017-08-25 15:13:09 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
2014-10-13 22:51:07 +00:00
|
|
|
|
2017-08-25 15:13:09 +00:00
|
|
|
ret = dma_assign_coherent_memory(dev, mem);
|
|
|
|
if (ret)
|
|
|
|
dma_release_coherent_memory(mem);
|
|
|
|
return ret;
|
2014-10-13 22:51:07 +00:00
|
|
|
}
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2019-10-30 10:13:13 +00:00
|
|
|
static void *__dma_alloc_from_coherent(struct device *dev,
|
|
|
|
struct dma_coherent_mem *mem,
|
|
|
|
ssize_t size, dma_addr_t *dma_handle)
|
2008-06-29 10:18:46 +00:00
|
|
|
{
|
|
|
|
int order = get_order(size);
|
2014-10-13 22:51:07 +00:00
|
|
|
unsigned long flags;
|
2009-01-06 22:43:09 +00:00
|
|
|
int pageno;
|
2017-07-20 10:19:58 +00:00
|
|
|
void *ret;
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2014-10-13 22:51:07 +00:00
|
|
|
spin_lock_irqsave(&mem->spinlock, flags);
|
2009-01-21 09:51:53 +00:00
|
|
|
|
2020-03-12 15:41:45 +00:00
|
|
|
if (unlikely(size > ((dma_addr_t)mem->size << PAGE_SHIFT)))
|
2009-01-21 09:51:53 +00:00
|
|
|
goto err;
|
2009-01-06 22:43:09 +00:00
|
|
|
|
|
|
|
pageno = bitmap_find_free_region(mem->bitmap, mem->size, order);
|
2009-01-21 09:51:53 +00:00
|
|
|
if (unlikely(pageno < 0))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/*
|
2017-07-20 10:19:58 +00:00
|
|
|
* Memory was found in the coherent area.
|
2009-01-21 09:51:53 +00:00
|
|
|
*/
|
2020-03-12 15:41:45 +00:00
|
|
|
*dma_handle = dma_get_device_base(dev, mem) +
|
|
|
|
((dma_addr_t)pageno << PAGE_SHIFT);
|
|
|
|
ret = mem->virt_base + ((dma_addr_t)pageno << PAGE_SHIFT);
|
2016-09-28 07:51:57 +00:00
|
|
|
spin_unlock_irqrestore(&mem->spinlock, flags);
|
2017-08-25 15:13:09 +00:00
|
|
|
memset(ret, 0, size);
|
2017-07-20 10:19:58 +00:00
|
|
|
return ret;
|
2009-01-21 09:51:53 +00:00
|
|
|
err:
|
2014-10-13 22:51:07 +00:00
|
|
|
spin_unlock_irqrestore(&mem->spinlock, flags);
|
2017-07-20 10:19:58 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* dma_alloc_from_dev_coherent() - allocate memory from device coherent pool
|
|
|
|
* @dev: device from which we allocate memory
|
|
|
|
* @size: size of requested memory area
|
|
|
|
* @dma_handle: This will be filled with the correct dma handle
|
|
|
|
* @ret: This pointer will be filled with the virtual address
|
|
|
|
* to allocated area.
|
|
|
|
*
|
|
|
|
* This function should be only called from per-arch dma_alloc_coherent()
|
|
|
|
* to support allocation from per-device coherent memory pools.
|
|
|
|
*
|
|
|
|
* Returns 0 if dma_alloc_coherent should continue with allocating from
|
|
|
|
* generic memory areas, or !0 if dma_alloc_coherent should return @ret.
|
|
|
|
*/
|
|
|
|
int dma_alloc_from_dev_coherent(struct device *dev, ssize_t size,
|
|
|
|
dma_addr_t *dma_handle, void **ret)
|
|
|
|
{
|
|
|
|
struct dma_coherent_mem *mem = dev_get_coherent_memory(dev);
|
|
|
|
|
|
|
|
if (!mem)
|
|
|
|
return 0;
|
|
|
|
|
2019-10-30 10:13:13 +00:00
|
|
|
*ret = __dma_alloc_from_coherent(dev, mem, size, dma_handle);
|
2018-12-25 12:29:54 +00:00
|
|
|
return 1;
|
2008-06-29 10:18:46 +00:00
|
|
|
}
|
|
|
|
|
2019-10-30 10:13:13 +00:00
|
|
|
void *dma_alloc_from_global_coherent(struct device *dev, ssize_t size,
|
|
|
|
dma_addr_t *dma_handle)
|
2008-06-29 10:18:46 +00:00
|
|
|
{
|
2017-07-20 10:19:58 +00:00
|
|
|
if (!dma_coherent_default_memory)
|
|
|
|
return NULL;
|
|
|
|
|
2019-10-30 10:13:13 +00:00
|
|
|
return __dma_alloc_from_coherent(dev, dma_coherent_default_memory, size,
|
|
|
|
dma_handle);
|
2017-07-20 10:19:58 +00:00
|
|
|
}
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2017-07-20 10:19:58 +00:00
|
|
|
static int __dma_release_from_coherent(struct dma_coherent_mem *mem,
|
|
|
|
int order, void *vaddr)
|
|
|
|
{
|
2008-06-29 10:18:46 +00:00
|
|
|
if (mem && vaddr >= mem->virt_base && vaddr <
|
2020-03-12 15:41:45 +00:00
|
|
|
(mem->virt_base + ((dma_addr_t)mem->size << PAGE_SHIFT))) {
|
2008-06-29 10:18:46 +00:00
|
|
|
int page = (vaddr - mem->virt_base) >> PAGE_SHIFT;
|
2014-10-13 22:51:07 +00:00
|
|
|
unsigned long flags;
|
2008-06-29 10:18:46 +00:00
|
|
|
|
2014-10-13 22:51:07 +00:00
|
|
|
spin_lock_irqsave(&mem->spinlock, flags);
|
2008-06-29 10:18:46 +00:00
|
|
|
bitmap_release_region(mem->bitmap, page, order);
|
2014-10-13 22:51:07 +00:00
|
|
|
spin_unlock_irqrestore(&mem->spinlock, flags);
|
2008-06-29 10:18:46 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2012-03-23 12:05:14 +00:00
|
|
|
|
|
|
|
/**
|
2017-07-20 10:19:58 +00:00
|
|
|
* dma_release_from_dev_coherent() - free memory to device coherent memory pool
|
2012-03-23 12:05:14 +00:00
|
|
|
* @dev: device from which the memory was allocated
|
2017-07-20 10:19:58 +00:00
|
|
|
* @order: the order of pages allocated
|
|
|
|
* @vaddr: virtual address of allocated pages
|
2012-03-23 12:05:14 +00:00
|
|
|
*
|
|
|
|
* This checks whether the memory was allocated from the per-device
|
2017-07-20 10:19:58 +00:00
|
|
|
* coherent memory pool and if so, releases that memory.
|
2012-03-23 12:05:14 +00:00
|
|
|
*
|
2017-07-20 10:19:58 +00:00
|
|
|
* Returns 1 if we correctly released the memory, or 0 if the caller should
|
|
|
|
* proceed with releasing memory from generic pools.
|
2012-03-23 12:05:14 +00:00
|
|
|
*/
|
2017-07-20 10:19:58 +00:00
|
|
|
int dma_release_from_dev_coherent(struct device *dev, int order, void *vaddr)
|
2012-03-23 12:05:14 +00:00
|
|
|
{
|
2017-06-26 09:18:58 +00:00
|
|
|
struct dma_coherent_mem *mem = dev_get_coherent_memory(dev);
|
2012-03-23 12:05:14 +00:00
|
|
|
|
2017-07-20 10:19:58 +00:00
|
|
|
return __dma_release_from_coherent(mem, order, vaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
int dma_release_from_global_coherent(int order, void *vaddr)
|
|
|
|
{
|
|
|
|
if (!dma_coherent_default_memory)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return __dma_release_from_coherent(dma_coherent_default_memory, order,
|
|
|
|
vaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int __dma_mmap_from_coherent(struct dma_coherent_mem *mem,
|
|
|
|
struct vm_area_struct *vma, void *vaddr, size_t size, int *ret)
|
|
|
|
{
|
2012-03-23 12:05:14 +00:00
|
|
|
if (mem && vaddr >= mem->virt_base && vaddr + size <=
|
2020-03-12 15:41:45 +00:00
|
|
|
(mem->virt_base + ((dma_addr_t)mem->size << PAGE_SHIFT))) {
|
2012-03-23 12:05:14 +00:00
|
|
|
unsigned long off = vma->vm_pgoff;
|
|
|
|
int start = (vaddr - mem->virt_base) >> PAGE_SHIFT;
|
2020-03-12 15:41:45 +00:00
|
|
|
unsigned long user_count = vma_pages(vma);
|
2016-09-28 07:51:56 +00:00
|
|
|
int count = PAGE_ALIGN(size) >> PAGE_SHIFT;
|
2012-03-23 12:05:14 +00:00
|
|
|
|
|
|
|
*ret = -ENXIO;
|
|
|
|
if (off < count && user_count <= count - off) {
|
2014-05-20 22:54:22 +00:00
|
|
|
unsigned long pfn = mem->pfn_base + start + off;
|
2012-03-23 12:05:14 +00:00
|
|
|
*ret = remap_pfn_range(vma, vma->vm_start, pfn,
|
|
|
|
user_count << PAGE_SHIFT,
|
|
|
|
vma->vm_page_prot);
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2017-07-20 10:19:58 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* dma_mmap_from_dev_coherent() - mmap memory from the device coherent pool
|
|
|
|
* @dev: device from which the memory was allocated
|
|
|
|
* @vma: vm_area for the userspace memory
|
|
|
|
* @vaddr: cpu address returned by dma_alloc_from_dev_coherent
|
|
|
|
* @size: size of the memory buffer allocated
|
|
|
|
* @ret: result from remap_pfn_range()
|
|
|
|
*
|
|
|
|
* This checks whether the memory was allocated from the per-device
|
|
|
|
* coherent memory pool and if so, maps that memory to the provided vma.
|
|
|
|
*
|
2018-04-09 17:59:14 +00:00
|
|
|
* Returns 1 if @vaddr belongs to the device coherent pool and the caller
|
|
|
|
* should return @ret, or 0 if they should proceed with mapping memory from
|
|
|
|
* generic areas.
|
2017-07-20 10:19:58 +00:00
|
|
|
*/
|
|
|
|
int dma_mmap_from_dev_coherent(struct device *dev, struct vm_area_struct *vma,
|
|
|
|
void *vaddr, size_t size, int *ret)
|
|
|
|
{
|
|
|
|
struct dma_coherent_mem *mem = dev_get_coherent_memory(dev);
|
|
|
|
|
|
|
|
return __dma_mmap_from_coherent(mem, vma, vaddr, size, ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
int dma_mmap_from_global_coherent(struct vm_area_struct *vma, void *vaddr,
|
|
|
|
size_t size, int *ret)
|
|
|
|
{
|
|
|
|
if (!dma_coherent_default_memory)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return __dma_mmap_from_coherent(dma_coherent_default_memory, vma,
|
|
|
|
vaddr, size, ret);
|
|
|
|
}
|
2014-10-13 22:51:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Support for reserved memory regions defined in device tree
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_OF_RESERVED_MEM
|
|
|
|
#include <linux/of.h>
|
|
|
|
#include <linux/of_fdt.h>
|
|
|
|
#include <linux/of_reserved_mem.h>
|
|
|
|
|
2017-06-26 09:18:58 +00:00
|
|
|
static struct reserved_mem *dma_reserved_default_memory __initdata;
|
|
|
|
|
2014-10-13 22:51:07 +00:00
|
|
|
static int rmem_dma_device_init(struct reserved_mem *rmem, struct device *dev)
|
|
|
|
{
|
|
|
|
struct dma_coherent_mem *mem = rmem->priv;
|
2017-09-05 08:10:09 +00:00
|
|
|
int ret;
|
|
|
|
|
2017-09-15 15:08:16 +00:00
|
|
|
if (!mem) {
|
|
|
|
ret = dma_init_coherent_memory(rmem->base, rmem->base,
|
2018-12-25 12:29:54 +00:00
|
|
|
rmem->size, &mem);
|
2017-09-15 15:08:16 +00:00
|
|
|
if (ret) {
|
|
|
|
pr_err("Reserved memory: failed to init DMA memory pool at %pa, size %ld MiB\n",
|
|
|
|
&rmem->base, (unsigned long)rmem->size / SZ_1M);
|
|
|
|
return ret;
|
|
|
|
}
|
2014-10-13 22:51:07 +00:00
|
|
|
}
|
2017-06-26 09:18:57 +00:00
|
|
|
mem->use_dev_dma_pfn_offset = true;
|
2014-10-13 22:51:07 +00:00
|
|
|
rmem->priv = mem;
|
|
|
|
dma_assign_coherent_memory(dev, mem);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void rmem_dma_device_release(struct reserved_mem *rmem,
|
|
|
|
struct device *dev)
|
|
|
|
{
|
2017-06-26 09:18:58 +00:00
|
|
|
if (dev)
|
|
|
|
dev->dma_mem = NULL;
|
2014-10-13 22:51:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static const struct reserved_mem_ops rmem_dma_ops = {
|
|
|
|
.device_init = rmem_dma_device_init,
|
|
|
|
.device_release = rmem_dma_device_release,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init rmem_dma_setup(struct reserved_mem *rmem)
|
|
|
|
{
|
|
|
|
unsigned long node = rmem->fdt_node;
|
|
|
|
|
|
|
|
if (of_get_flat_dt_prop(node, "reusable", NULL))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
#ifdef CONFIG_ARM
|
|
|
|
if (!of_get_flat_dt_prop(node, "no-map", NULL)) {
|
|
|
|
pr_err("Reserved memory: regions without no-map are not yet supported\n");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2017-06-26 09:18:58 +00:00
|
|
|
|
|
|
|
if (of_get_flat_dt_prop(node, "linux,dma-default", NULL)) {
|
|
|
|
WARN(dma_reserved_default_memory,
|
|
|
|
"Reserved memory: region for default DMA coherent area is redefined\n");
|
|
|
|
dma_reserved_default_memory = rmem;
|
|
|
|
}
|
2014-10-13 22:51:07 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
rmem->ops = &rmem_dma_ops;
|
|
|
|
pr_info("Reserved memory: created DMA memory pool at %pa, size %ld MiB\n",
|
|
|
|
&rmem->base, (unsigned long)rmem->size / SZ_1M);
|
|
|
|
return 0;
|
|
|
|
}
|
2017-06-26 09:18:58 +00:00
|
|
|
|
|
|
|
static int __init dma_init_reserved_memory(void)
|
|
|
|
{
|
|
|
|
const struct reserved_mem_ops *ops;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!dma_reserved_default_memory)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
ops = dma_reserved_default_memory->ops;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We rely on rmem_dma_device_init() does not propagate error of
|
|
|
|
* dma_assign_coherent_memory() for "NULL" device.
|
|
|
|
*/
|
|
|
|
ret = ops->device_init(dma_reserved_default_memory, NULL);
|
|
|
|
|
|
|
|
if (!ret) {
|
|
|
|
dma_coherent_default_memory = dma_reserved_default_memory->priv;
|
|
|
|
pr_info("DMA: default coherent area is set\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
core_initcall(dma_init_reserved_memory);
|
|
|
|
|
2014-10-13 22:51:07 +00:00
|
|
|
RESERVEDMEM_OF_DECLARE(dma, "shared-dma-pool", rmem_dma_setup);
|
|
|
|
#endif
|