2019-05-19 12:08:55 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Dynamic DMA mapping support.
|
|
|
|
*
|
2007-02-06 02:51:25 +00:00
|
|
|
* This implementation is a fallback for platforms that do not support
|
2005-04-16 22:20:36 +00:00
|
|
|
* I/O TLBs (aka DMA address translation hardware).
|
|
|
|
* Copyright (C) 2000 Asit Mallick <Asit.K.Mallick@intel.com>
|
|
|
|
* Copyright (C) 2000 Goutham Rao <goutham.rao@intel.com>
|
|
|
|
* Copyright (C) 2000, 2003 Hewlett-Packard Co
|
|
|
|
* David Mosberger-Tang <davidm@hpl.hp.com>
|
|
|
|
*
|
|
|
|
* 03/05/07 davidm Switch from PCI-DMA to generic device DMA API.
|
|
|
|
* 00/12/13 davidm Rename to swiotlb.c and add mark_clean() to avoid
|
|
|
|
* unnecessary i-cache flushing.
|
2005-09-29 21:45:24 +00:00
|
|
|
* 04/07/.. ak Better overflow handling. Assorted fixes.
|
|
|
|
* 05/09/10 linville Add support for syncing ranges, support syncing for
|
|
|
|
* DMA_BIDIRECTIONAL mappings, miscellaneous cleanup.
|
2008-12-22 18:26:09 +00:00
|
|
|
* 08/12/11 beckyb Add highmem support
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
|
2018-07-10 23:22:22 +00:00
|
|
|
#define pr_fmt(fmt) "software IO TLB: " fmt
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/cache.h>
|
2022-01-24 16:40:18 +00:00
|
|
|
#include <linux/cc_platform.h>
|
|
|
|
#include <linux/ctype.h>
|
|
|
|
#include <linux/debugfs.h>
|
2018-01-10 15:21:13 +00:00
|
|
|
#include <linux/dma-direct.h>
|
2020-09-22 13:36:11 +00:00
|
|
|
#include <linux/dma-map-ops.h>
|
2011-11-17 02:29:17 +00:00
|
|
|
#include <linux/export.h>
|
2022-01-24 16:40:18 +00:00
|
|
|
#include <linux/gfp.h>
|
|
|
|
#include <linux/highmem.h>
|
|
|
|
#include <linux/io.h>
|
|
|
|
#include <linux/iommu-helper.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/memblock.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/pfn.h>
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
#include <linux/rculist.h>
|
2022-01-24 16:40:18 +00:00
|
|
|
#include <linux/scatterlist.h>
|
|
|
|
#include <linux/set_memory.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/string.h>
|
2008-12-16 20:17:27 +00:00
|
|
|
#include <linux/swiotlb.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/types.h>
|
2021-06-19 03:40:41 +00:00
|
|
|
#ifdef CONFIG_DMA_RESTRICTED_POOL
|
|
|
|
#include <linux/of.h>
|
|
|
|
#include <linux/of_fdt.h>
|
|
|
|
#include <linux/of_reserved_mem.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#endif
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2013-10-23 11:32:04 +00:00
|
|
|
#define CREATE_TRACE_POINTS
|
2013-09-04 20:11:05 +00:00
|
|
|
#include <trace/events/swiotlb.h>
|
|
|
|
|
2005-09-06 17:20:49 +00:00
|
|
|
#define SLABS_PER_PAGE (1 << (PAGE_SHIFT - IO_TLB_SHIFT))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Minimum IO TLB size to bother booting with. Systems with mainly
|
|
|
|
* 64bit capable cards will only lightly use the swiotlb. If we can't
|
|
|
|
* allocate a contiguous 1MB, we're probably in trouble anyway.
|
|
|
|
*/
|
|
|
|
#define IO_TLB_MIN_SLABS ((1<<20) >> IO_TLB_SHIFT)
|
|
|
|
|
2021-03-18 16:14:22 +00:00
|
|
|
#define INVALID_PHYS_ADDR (~(phys_addr_t)0)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2023-08-01 06:23:58 +00:00
|
|
|
/**
|
|
|
|
* struct io_tlb_slot - IO TLB slot descriptor
|
|
|
|
* @orig_addr: The original address corresponding to a mapped entry.
|
|
|
|
* @alloc_size: Size of the allocated buffer.
|
|
|
|
* @list: The free list describing the number of free entries available
|
|
|
|
* from each index.
|
|
|
|
*/
|
2022-07-12 06:43:07 +00:00
|
|
|
struct io_tlb_slot {
|
|
|
|
phys_addr_t orig_addr;
|
|
|
|
size_t alloc_size;
|
|
|
|
unsigned int list;
|
|
|
|
};
|
|
|
|
|
2022-03-29 15:27:33 +00:00
|
|
|
static bool swiotlb_force_bounce;
|
|
|
|
static bool swiotlb_force_disable;
|
2019-01-18 07:10:27 +00:00
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
|
|
|
|
static void swiotlb_dyn_alloc(struct work_struct *work);
|
|
|
|
|
|
|
|
static struct io_tlb_mem io_tlb_default_mem = {
|
|
|
|
.lock = __SPIN_LOCK_UNLOCKED(io_tlb_default_mem.lock),
|
|
|
|
.pools = LIST_HEAD_INIT(io_tlb_default_mem.pools),
|
|
|
|
.dyn_alloc = __WORK_INITIALIZER(io_tlb_default_mem.dyn_alloc,
|
|
|
|
swiotlb_dyn_alloc),
|
|
|
|
};
|
|
|
|
|
|
|
|
#else /* !CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
2023-08-01 06:23:57 +00:00
|
|
|
static struct io_tlb_mem io_tlb_default_mem;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
#endif /* CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
2021-03-18 16:14:23 +00:00
|
|
|
static unsigned long default_nslabs = IO_TLB_DEFAULT_SIZE >> IO_TLB_SHIFT;
|
2022-07-08 16:15:44 +00:00
|
|
|
static unsigned long default_nareas;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* struct io_tlb_area - IO TLB memory area descriptor
|
|
|
|
*
|
|
|
|
* This is a single area with a single lock.
|
|
|
|
*
|
|
|
|
* @used: The number of used IO TLB block.
|
|
|
|
* @index: The slot index to start searching in this area for next round.
|
|
|
|
* @lock: The lock to protect the above data structures in the map and
|
|
|
|
* unmap calls.
|
|
|
|
*/
|
|
|
|
struct io_tlb_area {
|
|
|
|
unsigned long used;
|
|
|
|
unsigned int index;
|
|
|
|
spinlock_t lock;
|
|
|
|
};
|
|
|
|
|
2022-07-15 10:45:34 +00:00
|
|
|
/*
|
|
|
|
* Round up number of slabs to the next power of 2. The last area is going
|
|
|
|
* be smaller than the rest if default_nslabs is not power of two.
|
2022-07-15 10:45:35 +00:00
|
|
|
* The number of slot in an area should be a multiple of IO_TLB_SEGSIZE,
|
|
|
|
* otherwise a segment may span two or more areas. It conflicts with free
|
|
|
|
* contiguous slots tracking: free slots are treated contiguous no matter
|
|
|
|
* whether they cross an area boundary.
|
2022-07-15 10:45:34 +00:00
|
|
|
*
|
|
|
|
* Return true if default_nslabs is rounded up.
|
|
|
|
*/
|
|
|
|
static bool round_up_default_nslabs(void)
|
|
|
|
{
|
2022-07-15 10:45:35 +00:00
|
|
|
if (!default_nareas)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (default_nslabs < IO_TLB_SEGSIZE * default_nareas)
|
|
|
|
default_nslabs = IO_TLB_SEGSIZE * default_nareas;
|
|
|
|
else if (is_power_of_2(default_nslabs))
|
2022-07-15 10:45:34 +00:00
|
|
|
return false;
|
|
|
|
default_nslabs = roundup_pow_of_two(default_nslabs);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-06-26 13:01:03 +00:00
|
|
|
/**
|
|
|
|
* swiotlb_adjust_nareas() - adjust the number of areas and slots
|
|
|
|
* @nareas: Desired number of areas. Zero is treated as 1.
|
|
|
|
*
|
|
|
|
* Adjust the default number of areas in a memory pool.
|
|
|
|
* The default size of the memory pool may also change to meet minimum area
|
|
|
|
* size requirements.
|
|
|
|
*/
|
2022-07-08 16:15:44 +00:00
|
|
|
static void swiotlb_adjust_nareas(unsigned int nareas)
|
|
|
|
{
|
2022-07-22 03:38:46 +00:00
|
|
|
if (!nareas)
|
|
|
|
nareas = 1;
|
|
|
|
else if (!is_power_of_2(nareas))
|
2022-07-08 16:15:44 +00:00
|
|
|
nareas = roundup_pow_of_two(nareas);
|
|
|
|
|
|
|
|
default_nareas = nareas;
|
|
|
|
|
|
|
|
pr_info("area num %d.\n", nareas);
|
2022-07-15 10:45:34 +00:00
|
|
|
if (round_up_default_nslabs())
|
2022-07-08 16:15:44 +00:00
|
|
|
pr_info("SWIOTLB bounce buffer size roundup to %luMB",
|
|
|
|
(default_nslabs << IO_TLB_SHIFT) >> 20);
|
|
|
|
}
|
2021-03-18 16:14:23 +00:00
|
|
|
|
swiotlb: reduce the number of areas to match actual memory pool size
Although the desired size of the SWIOTLB memory pool is increased in
swiotlb_adjust_nareas() to match the number of areas, the actual allocation
may be smaller, which may require reducing the number of areas.
For example, Xen uses swiotlb_init_late(), which in turn uses the page
allocator. On x86, page size is 4 KiB and MAX_ORDER is 10 (1024 pages),
resulting in a maximum memory pool size of 4 MiB. This corresponds to 2048
slots of 2 KiB each. The minimum area size is 128 (IO_TLB_SEGSIZE),
allowing at most 2048 / 128 = 16 areas.
If num_possible_cpus() is greater than the maximum number of areas, areas
are smaller than IO_TLB_SEGSIZE and contiguous groups of free slots will
span multiple areas. When allocating and freeing slots, only one area will
be properly locked, causing race conditions on the unlocked slots and
ultimately data corruption, kernel hangs and crashes.
Fixes: 20347fca71a3 ("swiotlb: split up the global swiotlb lock")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Roberto Sassu <roberto.sassu@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-06-26 13:01:04 +00:00
|
|
|
/**
|
|
|
|
* limit_nareas() - get the maximum number of areas for a given memory pool size
|
|
|
|
* @nareas: Desired number of areas.
|
|
|
|
* @nslots: Total number of slots in the memory pool.
|
|
|
|
*
|
|
|
|
* Limit the number of areas to the maximum possible number of areas in
|
|
|
|
* a memory pool of the given size.
|
|
|
|
*
|
|
|
|
* Return: Maximum possible number of areas.
|
|
|
|
*/
|
|
|
|
static unsigned int limit_nareas(unsigned int nareas, unsigned long nslots)
|
|
|
|
{
|
|
|
|
if (nslots < nareas * IO_TLB_SEGSIZE)
|
|
|
|
return nslots / IO_TLB_SEGSIZE;
|
|
|
|
return nareas;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static int __init
|
|
|
|
setup_io_tlb_npages(char *str)
|
|
|
|
{
|
|
|
|
if (isdigit(*str)) {
|
|
|
|
/* avoid tail segment of size < IO_TLB_SEGSIZE */
|
2021-03-18 16:14:23 +00:00
|
|
|
default_nslabs =
|
|
|
|
ALIGN(simple_strtoul(str, &str, 0), IO_TLB_SEGSIZE);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2022-07-08 16:15:44 +00:00
|
|
|
if (*str == ',')
|
|
|
|
++str;
|
|
|
|
if (isdigit(*str))
|
|
|
|
swiotlb_adjust_nareas(simple_strtoul(str, &str, 0));
|
2005-04-16 22:20:36 +00:00
|
|
|
if (*str == ',')
|
|
|
|
++str;
|
2021-03-23 01:53:49 +00:00
|
|
|
if (!strcmp(str, "force"))
|
2022-03-29 15:27:33 +00:00
|
|
|
swiotlb_force_bounce = true;
|
2021-03-23 01:53:49 +00:00
|
|
|
else if (!strcmp(str, "noforce"))
|
2022-03-29 15:27:33 +00:00
|
|
|
swiotlb_force_disable = true;
|
2009-11-11 15:03:28 +00:00
|
|
|
|
2013-04-16 05:23:45 +00:00
|
|
|
return 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2013-04-16 05:23:45 +00:00
|
|
|
early_param("swiotlb", setup_io_tlb_npages);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2013-04-16 05:23:45 +00:00
|
|
|
unsigned long swiotlb_size_or_default(void)
|
|
|
|
{
|
2021-03-18 16:14:23 +00:00
|
|
|
return default_nslabs << IO_TLB_SHIFT;
|
2013-04-16 05:23:45 +00:00
|
|
|
}
|
|
|
|
|
2021-03-18 16:14:23 +00:00
|
|
|
void __init swiotlb_adjust_size(unsigned long size)
|
2020-12-10 01:25:15 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* If swiotlb parameter has not been specified, give a chance to
|
|
|
|
* architectures such as those supporting memory encryption to
|
|
|
|
* adjust/expand SWIOTLB size for their use.
|
|
|
|
*/
|
2021-04-29 06:28:59 +00:00
|
|
|
if (default_nslabs != IO_TLB_DEFAULT_SIZE >> IO_TLB_SHIFT)
|
|
|
|
return;
|
2022-07-08 16:15:44 +00:00
|
|
|
|
2021-03-18 16:14:23 +00:00
|
|
|
size = ALIGN(size, IO_TLB_SIZE);
|
|
|
|
default_nslabs = ALIGN(size >> IO_TLB_SHIFT, IO_TLB_SEGSIZE);
|
2022-07-15 10:45:34 +00:00
|
|
|
if (round_up_default_nslabs())
|
2022-07-08 16:15:44 +00:00
|
|
|
size = default_nslabs << IO_TLB_SHIFT;
|
2021-03-18 16:14:23 +00:00
|
|
|
pr_info("SWIOTLB bounce buffer size adjusted to %luMB", size >> 20);
|
2020-12-10 01:25:15 +00:00
|
|
|
}
|
|
|
|
|
2009-11-10 10:46:19 +00:00
|
|
|
void swiotlb_print_info(void)
|
2008-12-16 20:17:34 +00:00
|
|
|
{
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *mem = &io_tlb_default_mem.defpool;
|
2008-12-16 20:17:34 +00:00
|
|
|
|
2021-07-20 13:38:24 +00:00
|
|
|
if (!mem->nslabs) {
|
2018-07-10 23:22:22 +00:00
|
|
|
pr_warn("No low mem\n");
|
x86: Don't panic if can not alloc buffer for swiotlb
Normal boot path on system with iommu support:
swiotlb buffer will be allocated early at first and then try to initialize
iommu, if iommu for intel or AMD could setup properly, swiotlb buffer
will be freed.
The early allocating is with bootmem, and could panic when we try to use
kdump with buffer above 4G only, or with memmap to limit mem under 4G.
for example: memmap=4095M$1M to remove memory under 4G.
According to Eric, add _nopanic version and no_iotlb_memory to fail
map single later if swiotlb is still needed.
-v2: don't pass nopanic, and use -ENOMEM return value according to Eric.
panic early instead of using swiotlb_full to panic...according to Eric/Konrad.
-v3: make swiotlb_init to be notpanic, but will affect:
arm64, ia64, powerpc, tile, unicore32, x86.
-v4: cleanup swiotlb_init by removing swiotlb_init_with_default_size.
Suggested-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Yinghai Lu <yinghai@kernel.org>
Link: http://lkml.kernel.org/r/1359058816-7615-36-git-send-email-yinghai@kernel.org
Reviewed-and-tested-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
Cc: Joerg Roedel <joro@8bytes.org>
Cc: Ralf Baechle <ralf@linux-mips.org>
Cc: Jeremy Fitzhardinge <jeremy@goop.org>
Cc: Kyungmin Park <kyungmin.park@samsung.com>
Cc: Marek Szyprowski <m.szyprowski@samsung.com>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Andrzej Pietrasiewicz <andrzej.p@samsung.com>
Cc: linux-mips@linux-mips.org
Cc: xen-devel@lists.xensource.com
Cc: virtualization@lists.linux-foundation.org
Cc: Shuah Khan <shuahkhan@gmail.com>
Signed-off-by: H. Peter Anvin <hpa@linux.intel.com>
2013-01-24 20:20:16 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2021-03-18 16:14:22 +00:00
|
|
|
pr_info("mapped [mem %pa-%pa] (%luMB)\n", &mem->start, &mem->end,
|
2021-03-18 16:14:23 +00:00
|
|
|
(mem->nslabs << IO_TLB_SHIFT) >> 20);
|
2008-12-16 20:17:34 +00:00
|
|
|
}
|
|
|
|
|
2021-02-04 09:11:20 +00:00
|
|
|
static inline unsigned long io_tlb_offset(unsigned long val)
|
|
|
|
{
|
|
|
|
return val & (IO_TLB_SEGSIZE - 1);
|
|
|
|
}
|
|
|
|
|
2021-02-05 10:19:34 +00:00
|
|
|
static inline unsigned long nr_slots(u64 val)
|
|
|
|
{
|
|
|
|
return DIV_ROUND_UP(val, IO_TLB_SIZE);
|
|
|
|
}
|
|
|
|
|
2017-07-17 21:10:21 +00:00
|
|
|
/*
|
|
|
|
* Early SWIOTLB allocation may be too early to allow an architecture to
|
|
|
|
* perform the desired operations. This function allows the architecture to
|
|
|
|
* call SWIOTLB when the operations are possible. It needs to be called
|
|
|
|
* before the SWIOTLB memory is used.
|
|
|
|
*/
|
|
|
|
void __init swiotlb_update_mem_attributes(void)
|
|
|
|
{
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *mem = &io_tlb_default_mem.defpool;
|
2017-07-17 21:10:21 +00:00
|
|
|
unsigned long bytes;
|
|
|
|
|
2021-07-20 13:38:24 +00:00
|
|
|
if (!mem->nslabs || mem->late_alloc)
|
2017-07-17 21:10:21 +00:00
|
|
|
return;
|
2021-03-18 16:14:22 +00:00
|
|
|
bytes = PAGE_ALIGN(mem->nslabs << IO_TLB_SHIFT);
|
2023-03-26 13:52:02 +00:00
|
|
|
set_memory_decrypted((unsigned long)mem->vaddr, bytes >> PAGE_SHIFT);
|
2017-07-17 21:10:21 +00:00
|
|
|
}
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
static void swiotlb_init_io_tlb_pool(struct io_tlb_pool *mem, phys_addr_t start,
|
|
|
|
unsigned long nslabs, bool late_alloc, unsigned int nareas)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2021-06-19 03:40:32 +00:00
|
|
|
void *vaddr = phys_to_virt(start);
|
2021-03-18 16:14:23 +00:00
|
|
|
unsigned long bytes = nslabs << IO_TLB_SHIFT, i;
|
2021-06-19 03:40:32 +00:00
|
|
|
|
|
|
|
mem->nslabs = nslabs;
|
|
|
|
mem->start = start;
|
|
|
|
mem->end = mem->start + bytes;
|
|
|
|
mem->late_alloc = late_alloc;
|
2022-07-08 16:15:44 +00:00
|
|
|
mem->nareas = nareas;
|
|
|
|
mem->area_nslabs = nslabs / mem->nareas;
|
2021-06-24 15:55:20 +00:00
|
|
|
|
2022-07-08 16:15:44 +00:00
|
|
|
for (i = 0; i < mem->nareas; i++) {
|
|
|
|
spin_lock_init(&mem->areas[i].lock);
|
|
|
|
mem->areas[i].index = 0;
|
2022-07-22 03:38:46 +00:00
|
|
|
mem->areas[i].used = 0;
|
2022-07-08 16:15:44 +00:00
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:32 +00:00
|
|
|
for (i = 0; i < mem->nslabs; i++) {
|
2023-11-08 11:12:49 +00:00
|
|
|
mem->slots[i].list = min(IO_TLB_SEGSIZE - io_tlb_offset(i),
|
|
|
|
mem->nslabs - i);
|
2021-06-19 03:40:32 +00:00
|
|
|
mem->slots[i].orig_addr = INVALID_PHYS_ADDR;
|
|
|
|
mem->slots[i].alloc_size = 0;
|
|
|
|
}
|
2021-12-13 07:14:02 +00:00
|
|
|
|
2021-06-19 03:40:32 +00:00
|
|
|
memset(vaddr, 0, bytes);
|
2021-12-13 07:14:02 +00:00
|
|
|
mem->vaddr = vaddr;
|
|
|
|
return;
|
2021-06-19 03:40:32 +00:00
|
|
|
}
|
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
/**
|
|
|
|
* add_mem_pool() - add a memory pool to the allocator
|
|
|
|
* @mem: Software IO TLB allocator.
|
|
|
|
* @pool: Memory pool to be added.
|
|
|
|
*/
|
|
|
|
static void add_mem_pool(struct io_tlb_mem *mem, struct io_tlb_pool *pool)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
spin_lock(&mem->lock);
|
|
|
|
list_add_rcu(&pool->node, &mem->pools);
|
|
|
|
mem->nslabs += pool->nslabs;
|
|
|
|
spin_unlock(&mem->lock);
|
|
|
|
#else
|
|
|
|
mem->nslabs = pool->nslabs;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2023-02-22 07:04:11 +00:00
|
|
|
static void __init *swiotlb_memblock_alloc(unsigned long nslabs,
|
|
|
|
unsigned int flags,
|
2022-10-31 08:13:27 +00:00
|
|
|
int (*remap)(void *tlb, unsigned long nslabs))
|
|
|
|
{
|
|
|
|
size_t bytes = PAGE_ALIGN(nslabs << IO_TLB_SHIFT);
|
|
|
|
void *tlb;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* By default allocate the bounce buffer memory from low memory, but
|
|
|
|
* allow to pick a location everywhere for hypervisors with guest
|
|
|
|
* memory encryption.
|
|
|
|
*/
|
|
|
|
if (flags & SWIOTLB_ANY)
|
|
|
|
tlb = memblock_alloc(bytes, PAGE_SIZE);
|
|
|
|
else
|
|
|
|
tlb = memblock_alloc_low(bytes, PAGE_SIZE);
|
|
|
|
|
|
|
|
if (!tlb) {
|
|
|
|
pr_warn("%s: Failed to allocate %zu bytes tlb structure\n",
|
|
|
|
__func__, bytes);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (remap && remap(tlb, nslabs) < 0) {
|
|
|
|
memblock_free(tlb, PAGE_ALIGN(bytes));
|
|
|
|
pr_warn("%s: Failed to remap %zu bytes\n", __func__, bytes);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return tlb;
|
|
|
|
}
|
|
|
|
|
2010-05-10 19:15:12 +00:00
|
|
|
/*
|
|
|
|
* Statically reserve bounce buffer space and initialize bounce buffer data
|
|
|
|
* structures for the software IO TLB used to implement the DMA API.
|
|
|
|
*/
|
2022-03-14 07:02:57 +00:00
|
|
|
void __init swiotlb_init_remap(bool addressing_limit, unsigned int flags,
|
|
|
|
int (*remap)(void *tlb, unsigned long nslabs))
|
2010-05-10 19:15:12 +00:00
|
|
|
{
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *mem = &io_tlb_default_mem.defpool;
|
2022-07-08 16:15:44 +00:00
|
|
|
unsigned long nslabs;
|
swiotlb: reduce the number of areas to match actual memory pool size
Although the desired size of the SWIOTLB memory pool is increased in
swiotlb_adjust_nareas() to match the number of areas, the actual allocation
may be smaller, which may require reducing the number of areas.
For example, Xen uses swiotlb_init_late(), which in turn uses the page
allocator. On x86, page size is 4 KiB and MAX_ORDER is 10 (1024 pages),
resulting in a maximum memory pool size of 4 MiB. This corresponds to 2048
slots of 2 KiB each. The minimum area size is 128 (IO_TLB_SEGSIZE),
allowing at most 2048 / 128 = 16 areas.
If num_possible_cpus() is greater than the maximum number of areas, areas
are smaller than IO_TLB_SEGSIZE and contiguous groups of free slots will
span multiple areas. When allocating and freeing slots, only one area will
be properly locked, causing race conditions on the unlocked slots and
ultimately data corruption, kernel hangs and crashes.
Fixes: 20347fca71a3 ("swiotlb: split up the global swiotlb lock")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Roberto Sassu <roberto.sassu@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-06-26 13:01:04 +00:00
|
|
|
unsigned int nareas;
|
2022-05-11 06:13:57 +00:00
|
|
|
size_t alloc_size;
|
2021-03-18 16:14:23 +00:00
|
|
|
void *tlb;
|
2010-05-10 19:15:12 +00:00
|
|
|
|
2022-03-29 15:27:33 +00:00
|
|
|
if (!addressing_limit && !swiotlb_force_bounce)
|
|
|
|
return;
|
|
|
|
if (swiotlb_force_disable)
|
2021-03-23 01:53:49 +00:00
|
|
|
return;
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
io_tlb_default_mem.force_bounce =
|
|
|
|
swiotlb_force_bounce || (flags & SWIOTLB_FORCE);
|
|
|
|
|
2023-08-01 06:24:00 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
if (!remap)
|
|
|
|
io_tlb_default_mem.can_grow = true;
|
2023-08-01 06:24:02 +00:00
|
|
|
if (flags & SWIOTLB_ANY)
|
|
|
|
io_tlb_default_mem.phys_limit = virt_to_phys(high_memory - 1);
|
|
|
|
else
|
|
|
|
io_tlb_default_mem.phys_limit = ARCH_LOW_ADDRESS_LIMIT;
|
2023-08-01 06:24:00 +00:00
|
|
|
#endif
|
|
|
|
|
2022-07-08 16:15:44 +00:00
|
|
|
if (!default_nareas)
|
|
|
|
swiotlb_adjust_nareas(num_possible_cpus());
|
|
|
|
|
|
|
|
nslabs = default_nslabs;
|
swiotlb: reduce the number of areas to match actual memory pool size
Although the desired size of the SWIOTLB memory pool is increased in
swiotlb_adjust_nareas() to match the number of areas, the actual allocation
may be smaller, which may require reducing the number of areas.
For example, Xen uses swiotlb_init_late(), which in turn uses the page
allocator. On x86, page size is 4 KiB and MAX_ORDER is 10 (1024 pages),
resulting in a maximum memory pool size of 4 MiB. This corresponds to 2048
slots of 2 KiB each. The minimum area size is 128 (IO_TLB_SEGSIZE),
allowing at most 2048 / 128 = 16 areas.
If num_possible_cpus() is greater than the maximum number of areas, areas
are smaller than IO_TLB_SEGSIZE and contiguous groups of free slots will
span multiple areas. When allocating and freeing slots, only one area will
be properly locked, causing race conditions on the unlocked slots and
ultimately data corruption, kernel hangs and crashes.
Fixes: 20347fca71a3 ("swiotlb: split up the global swiotlb lock")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Roberto Sassu <roberto.sassu@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-06-26 13:01:04 +00:00
|
|
|
nareas = limit_nareas(default_nareas, nslabs);
|
2022-10-31 08:13:27 +00:00
|
|
|
while ((tlb = swiotlb_memblock_alloc(nslabs, flags, remap)) == NULL) {
|
|
|
|
if (nslabs <= IO_TLB_MIN_SLABS)
|
|
|
|
return;
|
2022-03-14 07:02:57 +00:00
|
|
|
nslabs = ALIGN(nslabs >> 1, IO_TLB_SEGSIZE);
|
swiotlb: reduce the number of areas to match actual memory pool size
Although the desired size of the SWIOTLB memory pool is increased in
swiotlb_adjust_nareas() to match the number of areas, the actual allocation
may be smaller, which may require reducing the number of areas.
For example, Xen uses swiotlb_init_late(), which in turn uses the page
allocator. On x86, page size is 4 KiB and MAX_ORDER is 10 (1024 pages),
resulting in a maximum memory pool size of 4 MiB. This corresponds to 2048
slots of 2 KiB each. The minimum area size is 128 (IO_TLB_SEGSIZE),
allowing at most 2048 / 128 = 16 areas.
If num_possible_cpus() is greater than the maximum number of areas, areas
are smaller than IO_TLB_SEGSIZE and contiguous groups of free slots will
span multiple areas. When allocating and freeing slots, only one area will
be properly locked, causing race conditions on the unlocked slots and
ultimately data corruption, kernel hangs and crashes.
Fixes: 20347fca71a3 ("swiotlb: split up the global swiotlb lock")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Roberto Sassu <roberto.sassu@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-06-26 13:01:04 +00:00
|
|
|
nareas = limit_nareas(nareas, nslabs);
|
2022-10-31 08:13:27 +00:00
|
|
|
}
|
2022-09-07 13:38:33 +00:00
|
|
|
|
2022-10-31 08:13:27 +00:00
|
|
|
if (default_nslabs != nslabs) {
|
|
|
|
pr_info("SWIOTLB bounce buffer size adjusted %lu -> %lu slabs",
|
|
|
|
default_nslabs, nslabs);
|
|
|
|
default_nslabs = nslabs;
|
2022-03-14 07:02:57 +00:00
|
|
|
}
|
2021-03-18 16:14:23 +00:00
|
|
|
|
2022-05-11 06:13:57 +00:00
|
|
|
alloc_size = PAGE_ALIGN(array_size(sizeof(*mem->slots), nslabs));
|
2022-03-15 06:41:04 +00:00
|
|
|
mem->slots = memblock_alloc(alloc_size, PAGE_SIZE);
|
2022-09-07 13:38:33 +00:00
|
|
|
if (!mem->slots) {
|
|
|
|
pr_warn("%s: Failed to allocate %zu bytes align=0x%lx\n",
|
|
|
|
__func__, alloc_size, PAGE_SIZE);
|
|
|
|
return;
|
|
|
|
}
|
2022-03-15 06:41:04 +00:00
|
|
|
|
2022-07-22 03:38:46 +00:00
|
|
|
mem->areas = memblock_alloc(array_size(sizeof(struct io_tlb_area),
|
2023-09-11 10:32:51 +00:00
|
|
|
nareas), SMP_CACHE_BYTES);
|
2022-09-07 13:38:33 +00:00
|
|
|
if (!mem->areas) {
|
|
|
|
pr_warn("%s: Failed to allocate mem->areas.\n", __func__);
|
|
|
|
return;
|
|
|
|
}
|
2022-07-08 16:15:44 +00:00
|
|
|
|
2023-09-11 10:32:51 +00:00
|
|
|
swiotlb_init_io_tlb_pool(mem, __pa(tlb), nslabs, false, nareas);
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
add_mem_pool(&io_tlb_default_mem, mem);
|
2022-03-15 06:41:04 +00:00
|
|
|
|
|
|
|
if (flags & SWIOTLB_VERBOSE)
|
|
|
|
swiotlb_print_info();
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2022-03-14 07:02:57 +00:00
|
|
|
void __init swiotlb_init(bool addressing_limit, unsigned int flags)
|
|
|
|
{
|
2022-06-11 08:25:12 +00:00
|
|
|
swiotlb_init_remap(addressing_limit, flags, NULL);
|
2022-03-14 07:02:57 +00:00
|
|
|
}
|
|
|
|
|
2005-09-06 17:20:49 +00:00
|
|
|
/*
|
|
|
|
* Systems with larger DMA zones (those that don't support ISA) can
|
|
|
|
* initialize the swiotlb later using the slab allocator if needed.
|
|
|
|
* This should be just like above, but with some error catching.
|
|
|
|
*/
|
2022-03-14 07:02:57 +00:00
|
|
|
int swiotlb_init_late(size_t size, gfp_t gfp_mask,
|
|
|
|
int (*remap)(void *tlb, unsigned long nslabs))
|
2005-09-06 17:20:49 +00:00
|
|
|
{
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *mem = &io_tlb_default_mem.defpool;
|
2022-02-14 10:07:28 +00:00
|
|
|
unsigned long nslabs = ALIGN(size >> IO_TLB_SHIFT, IO_TLB_SEGSIZE);
|
swiotlb: reduce the number of areas to match actual memory pool size
Although the desired size of the SWIOTLB memory pool is increased in
swiotlb_adjust_nareas() to match the number of areas, the actual allocation
may be smaller, which may require reducing the number of areas.
For example, Xen uses swiotlb_init_late(), which in turn uses the page
allocator. On x86, page size is 4 KiB and MAX_ORDER is 10 (1024 pages),
resulting in a maximum memory pool size of 4 MiB. This corresponds to 2048
slots of 2 KiB each. The minimum area size is 128 (IO_TLB_SEGSIZE),
allowing at most 2048 / 128 = 16 areas.
If num_possible_cpus() is greater than the maximum number of areas, areas
are smaller than IO_TLB_SEGSIZE and contiguous groups of free slots will
span multiple areas. When allocating and freeing slots, only one area will
be properly locked, causing race conditions on the unlocked slots and
ultimately data corruption, kernel hangs and crashes.
Fixes: 20347fca71a3 ("swiotlb: split up the global swiotlb lock")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Roberto Sassu <roberto.sassu@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-06-26 13:01:04 +00:00
|
|
|
unsigned int nareas;
|
2012-10-15 17:19:28 +00:00
|
|
|
unsigned char *vstart = NULL;
|
2022-07-08 16:15:44 +00:00
|
|
|
unsigned int order, area_order;
|
2022-05-11 06:24:10 +00:00
|
|
|
bool retried = false;
|
2012-07-28 00:55:27 +00:00
|
|
|
int rc = 0;
|
2005-09-06 17:20:49 +00:00
|
|
|
|
2023-08-01 06:23:56 +00:00
|
|
|
if (io_tlb_default_mem.nslabs)
|
|
|
|
return 0;
|
|
|
|
|
2022-03-29 15:27:33 +00:00
|
|
|
if (swiotlb_force_disable)
|
2021-03-23 01:53:49 +00:00
|
|
|
return 0;
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
io_tlb_default_mem.force_bounce = swiotlb_force_bounce;
|
|
|
|
|
2023-08-01 06:24:00 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
if (!remap)
|
|
|
|
io_tlb_default_mem.can_grow = true;
|
2023-08-01 06:24:02 +00:00
|
|
|
if (IS_ENABLED(CONFIG_ZONE_DMA) && (gfp_mask & __GFP_DMA))
|
|
|
|
io_tlb_default_mem.phys_limit = DMA_BIT_MASK(zone_dma_bits);
|
|
|
|
else if (IS_ENABLED(CONFIG_ZONE_DMA32) && (gfp_mask & __GFP_DMA32))
|
|
|
|
io_tlb_default_mem.phys_limit = DMA_BIT_MASK(32);
|
|
|
|
else
|
|
|
|
io_tlb_default_mem.phys_limit = virt_to_phys(high_memory - 1);
|
2023-08-01 06:24:00 +00:00
|
|
|
#endif
|
|
|
|
|
2023-06-26 13:01:03 +00:00
|
|
|
if (!default_nareas)
|
|
|
|
swiotlb_adjust_nareas(num_possible_cpus());
|
|
|
|
|
2022-03-14 07:02:57 +00:00
|
|
|
retry:
|
2021-03-18 16:14:23 +00:00
|
|
|
order = get_order(nslabs << IO_TLB_SHIFT);
|
|
|
|
nslabs = SLABS_PER_PAGE << order;
|
2005-09-06 17:20:49 +00:00
|
|
|
|
|
|
|
while ((SLABS_PER_PAGE << order) > IO_TLB_MIN_SLABS) {
|
2022-02-14 10:12:59 +00:00
|
|
|
vstart = (void *)__get_free_pages(gfp_mask | __GFP_NOWARN,
|
2012-10-15 17:19:28 +00:00
|
|
|
order);
|
|
|
|
if (vstart)
|
2005-09-06 17:20:49 +00:00
|
|
|
break;
|
|
|
|
order--;
|
2022-05-11 06:24:10 +00:00
|
|
|
nslabs = SLABS_PER_PAGE << order;
|
|
|
|
retried = true;
|
2005-09-06 17:20:49 +00:00
|
|
|
}
|
|
|
|
|
2021-03-18 16:14:23 +00:00
|
|
|
if (!vstart)
|
2012-07-28 00:55:27 +00:00
|
|
|
return -ENOMEM;
|
2021-03-18 16:14:23 +00:00
|
|
|
|
2022-03-14 07:02:57 +00:00
|
|
|
if (remap)
|
|
|
|
rc = remap(vstart, nslabs);
|
|
|
|
if (rc) {
|
|
|
|
free_pages((unsigned long)vstart, order);
|
|
|
|
|
|
|
|
nslabs = ALIGN(nslabs >> 1, IO_TLB_SEGSIZE);
|
|
|
|
if (nslabs < IO_TLB_MIN_SLABS)
|
|
|
|
return rc;
|
2022-05-11 06:24:10 +00:00
|
|
|
retried = true;
|
2022-03-14 07:02:57 +00:00
|
|
|
goto retry;
|
|
|
|
}
|
2021-03-01 07:44:31 +00:00
|
|
|
|
2022-05-11 06:24:10 +00:00
|
|
|
if (retried) {
|
|
|
|
pr_warn("only able to allocate %ld MB\n",
|
|
|
|
(PAGE_SIZE << order) >> 20);
|
|
|
|
}
|
|
|
|
|
swiotlb: reduce the number of areas to match actual memory pool size
Although the desired size of the SWIOTLB memory pool is increased in
swiotlb_adjust_nareas() to match the number of areas, the actual allocation
may be smaller, which may require reducing the number of areas.
For example, Xen uses swiotlb_init_late(), which in turn uses the page
allocator. On x86, page size is 4 KiB and MAX_ORDER is 10 (1024 pages),
resulting in a maximum memory pool size of 4 MiB. This corresponds to 2048
slots of 2 KiB each. The minimum area size is 128 (IO_TLB_SEGSIZE),
allowing at most 2048 / 128 = 16 areas.
If num_possible_cpus() is greater than the maximum number of areas, areas
are smaller than IO_TLB_SEGSIZE and contiguous groups of free slots will
span multiple areas. When allocating and freeing slots, only one area will
be properly locked, causing race conditions on the unlocked slots and
ultimately data corruption, kernel hangs and crashes.
Fixes: 20347fca71a3 ("swiotlb: split up the global swiotlb lock")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Roberto Sassu <roberto.sassu@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-06-26 13:01:04 +00:00
|
|
|
nareas = limit_nareas(default_nareas, nslabs);
|
|
|
|
area_order = get_order(array_size(sizeof(*mem->areas), nareas));
|
2022-07-08 16:15:44 +00:00
|
|
|
mem->areas = (struct io_tlb_area *)
|
|
|
|
__get_free_pages(GFP_KERNEL | __GFP_ZERO, area_order);
|
|
|
|
if (!mem->areas)
|
|
|
|
goto error_area;
|
|
|
|
|
2021-07-20 13:38:24 +00:00
|
|
|
mem->slots = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO,
|
|
|
|
get_order(array_size(sizeof(*mem->slots), nslabs)));
|
2022-07-08 16:15:44 +00:00
|
|
|
if (!mem->slots)
|
|
|
|
goto error_slots;
|
2012-07-28 00:55:27 +00:00
|
|
|
|
2022-05-11 06:24:10 +00:00
|
|
|
set_memory_decrypted((unsigned long)vstart,
|
|
|
|
(nslabs << IO_TLB_SHIFT) >> PAGE_SHIFT);
|
2023-08-01 06:23:59 +00:00
|
|
|
swiotlb_init_io_tlb_pool(mem, virt_to_phys(vstart), nslabs, true,
|
|
|
|
nareas);
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
add_mem_pool(&io_tlb_default_mem, mem);
|
2005-09-06 17:20:49 +00:00
|
|
|
|
2009-11-10 10:46:19 +00:00
|
|
|
swiotlb_print_info();
|
2005-09-06 17:20:49 +00:00
|
|
|
return 0;
|
2022-07-08 16:15:44 +00:00
|
|
|
|
|
|
|
error_slots:
|
|
|
|
free_pages((unsigned long)mem->areas, area_order);
|
|
|
|
error_area:
|
|
|
|
free_pages((unsigned long)vstart, order);
|
|
|
|
return -ENOMEM;
|
2005-09-06 17:20:49 +00:00
|
|
|
}
|
|
|
|
|
2017-12-23 13:14:54 +00:00
|
|
|
void __init swiotlb_exit(void)
|
2009-11-10 10:46:18 +00:00
|
|
|
{
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *mem = &io_tlb_default_mem.defpool;
|
2021-07-20 13:38:26 +00:00
|
|
|
unsigned long tbl_vaddr;
|
|
|
|
size_t tbl_size, slots_size;
|
2022-07-08 16:15:44 +00:00
|
|
|
unsigned int area_order;
|
2021-03-18 16:14:22 +00:00
|
|
|
|
2022-03-29 15:27:33 +00:00
|
|
|
if (swiotlb_force_bounce)
|
2022-02-14 09:01:26 +00:00
|
|
|
return;
|
|
|
|
|
2021-07-20 13:38:24 +00:00
|
|
|
if (!mem->nslabs)
|
2009-11-10 10:46:18 +00:00
|
|
|
return;
|
|
|
|
|
2021-07-20 13:38:25 +00:00
|
|
|
pr_info("tearing down default memory pool\n");
|
2021-07-20 13:38:26 +00:00
|
|
|
tbl_vaddr = (unsigned long)phys_to_virt(mem->start);
|
|
|
|
tbl_size = PAGE_ALIGN(mem->end - mem->start);
|
|
|
|
slots_size = PAGE_ALIGN(array_size(sizeof(*mem->slots), mem->nslabs));
|
|
|
|
|
|
|
|
set_memory_encrypted(tbl_vaddr, tbl_size >> PAGE_SHIFT);
|
|
|
|
if (mem->late_alloc) {
|
2022-07-08 16:15:44 +00:00
|
|
|
area_order = get_order(array_size(sizeof(*mem->areas),
|
|
|
|
mem->nareas));
|
|
|
|
free_pages((unsigned long)mem->areas, area_order);
|
2021-07-20 13:38:26 +00:00
|
|
|
free_pages(tbl_vaddr, get_order(tbl_size));
|
|
|
|
free_pages((unsigned long)mem->slots, get_order(slots_size));
|
|
|
|
} else {
|
2022-07-08 16:15:44 +00:00
|
|
|
memblock_free_late(__pa(mem->areas),
|
2022-07-22 03:38:46 +00:00
|
|
|
array_size(sizeof(*mem->areas), mem->nareas));
|
2021-07-20 13:38:26 +00:00
|
|
|
memblock_free_late(mem->start, tbl_size);
|
|
|
|
memblock_free_late(__pa(mem->slots), slots_size);
|
|
|
|
}
|
|
|
|
|
2021-07-20 13:38:24 +00:00
|
|
|
memset(mem, 0, sizeof(*mem));
|
2009-11-10 10:46:18 +00:00
|
|
|
}
|
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
|
|
|
|
/**
|
|
|
|
* alloc_dma_pages() - allocate pages to be used for DMA
|
|
|
|
* @gfp: GFP flags for the allocation.
|
|
|
|
* @bytes: Size of the buffer.
|
2023-11-02 09:36:49 +00:00
|
|
|
* @phys_limit: Maximum allowed physical address of the buffer.
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
*
|
|
|
|
* Allocate pages from the buddy allocator. If successful, make the allocated
|
|
|
|
* pages decrypted that they can be used for DMA.
|
|
|
|
*
|
2023-11-02 09:36:49 +00:00
|
|
|
* Return: Decrypted pages, %NULL on allocation failure, or ERR_PTR(-EAGAIN)
|
|
|
|
* if the allocated physical address was above @phys_limit.
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
*/
|
2023-11-02 09:36:49 +00:00
|
|
|
static struct page *alloc_dma_pages(gfp_t gfp, size_t bytes, u64 phys_limit)
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
{
|
|
|
|
unsigned int order = get_order(bytes);
|
|
|
|
struct page *page;
|
2023-11-02 09:36:49 +00:00
|
|
|
phys_addr_t paddr;
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
void *vaddr;
|
|
|
|
|
|
|
|
page = alloc_pages(gfp, order);
|
|
|
|
if (!page)
|
|
|
|
return NULL;
|
|
|
|
|
2023-11-02 09:36:49 +00:00
|
|
|
paddr = page_to_phys(page);
|
|
|
|
if (paddr + bytes - 1 > phys_limit) {
|
|
|
|
__free_pages(page, order);
|
|
|
|
return ERR_PTR(-EAGAIN);
|
|
|
|
}
|
|
|
|
|
|
|
|
vaddr = phys_to_virt(paddr);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
if (set_memory_decrypted((unsigned long)vaddr, PFN_UP(bytes)))
|
|
|
|
goto error;
|
|
|
|
return page;
|
|
|
|
|
|
|
|
error:
|
2023-11-02 09:36:49 +00:00
|
|
|
/* Intentional leak if pages cannot be encrypted again. */
|
|
|
|
if (!set_memory_encrypted((unsigned long)vaddr, PFN_UP(bytes)))
|
|
|
|
__free_pages(page, order);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* swiotlb_alloc_tlb() - allocate a dynamic IO TLB buffer
|
|
|
|
* @dev: Device for which a memory pool is allocated.
|
|
|
|
* @bytes: Size of the buffer.
|
|
|
|
* @phys_limit: Maximum allowed physical address of the buffer.
|
|
|
|
* @gfp: GFP flags for the allocation.
|
|
|
|
*
|
|
|
|
* Return: Allocated pages, or %NULL on allocation failure.
|
|
|
|
*/
|
|
|
|
static struct page *swiotlb_alloc_tlb(struct device *dev, size_t bytes,
|
|
|
|
u64 phys_limit, gfp_t gfp)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate from the atomic pools if memory is encrypted and
|
|
|
|
* the allocation is atomic, because decrypting may block.
|
|
|
|
*/
|
|
|
|
if (!gfpflags_allow_blocking(gfp) && dev && force_dma_unencrypted(dev)) {
|
|
|
|
void *vaddr;
|
|
|
|
|
|
|
|
if (!IS_ENABLED(CONFIG_DMA_COHERENT_POOL))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return dma_alloc_from_pool(dev, bytes, &vaddr, gfp,
|
|
|
|
dma_coherent_ok);
|
|
|
|
}
|
|
|
|
|
|
|
|
gfp &= ~GFP_ZONEMASK;
|
|
|
|
if (phys_limit <= DMA_BIT_MASK(zone_dma_bits))
|
|
|
|
gfp |= __GFP_DMA;
|
|
|
|
else if (phys_limit <= DMA_BIT_MASK(32))
|
|
|
|
gfp |= __GFP_DMA32;
|
|
|
|
|
2023-11-02 09:36:49 +00:00
|
|
|
while (IS_ERR(page = alloc_dma_pages(gfp, bytes, phys_limit))) {
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
if (IS_ENABLED(CONFIG_ZONE_DMA32) &&
|
|
|
|
phys_limit < DMA_BIT_MASK(64) &&
|
|
|
|
!(gfp & (__GFP_DMA32 | __GFP_DMA)))
|
|
|
|
gfp |= __GFP_DMA32;
|
|
|
|
else if (IS_ENABLED(CONFIG_ZONE_DMA) &&
|
|
|
|
!(gfp & __GFP_DMA))
|
|
|
|
gfp = (gfp & ~__GFP_DMA32) | __GFP_DMA;
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return page;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* swiotlb_free_tlb() - free a dynamically allocated IO TLB buffer
|
|
|
|
* @vaddr: Virtual address of the buffer.
|
|
|
|
* @bytes: Size of the buffer.
|
|
|
|
*/
|
|
|
|
static void swiotlb_free_tlb(void *vaddr, size_t bytes)
|
|
|
|
{
|
|
|
|
if (IS_ENABLED(CONFIG_DMA_COHERENT_POOL) &&
|
|
|
|
dma_free_from_pool(NULL, vaddr, bytes))
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* Intentional leak if pages cannot be encrypted again. */
|
|
|
|
if (!set_memory_encrypted((unsigned long)vaddr, PFN_UP(bytes)))
|
|
|
|
__free_pages(virt_to_page(vaddr), get_order(bytes));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* swiotlb_alloc_pool() - allocate a new IO TLB memory pool
|
|
|
|
* @dev: Device for which a memory pool is allocated.
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
* @minslabs: Minimum number of slabs.
|
|
|
|
* @nslabs: Desired (maximum) number of slabs.
|
|
|
|
* @nareas: Number of areas.
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
* @phys_limit: Maximum DMA buffer physical address.
|
|
|
|
* @gfp: GFP flags for the allocations.
|
|
|
|
*
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
* Allocate and initialize a new IO TLB memory pool. The actual number of
|
|
|
|
* slabs may be reduced if allocation of @nslabs fails. If even
|
|
|
|
* @minslabs cannot be allocated, this function fails.
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
*
|
|
|
|
* Return: New memory pool, or %NULL on allocation failure.
|
|
|
|
*/
|
|
|
|
static struct io_tlb_pool *swiotlb_alloc_pool(struct device *dev,
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
unsigned long minslabs, unsigned long nslabs,
|
|
|
|
unsigned int nareas, u64 phys_limit, gfp_t gfp)
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
{
|
|
|
|
struct io_tlb_pool *pool;
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
unsigned int slot_order;
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
struct page *tlb;
|
|
|
|
size_t pool_size;
|
|
|
|
size_t tlb_size;
|
|
|
|
|
2023-12-28 14:47:04 +00:00
|
|
|
if (nslabs > SLABS_PER_PAGE << MAX_PAGE_ORDER) {
|
|
|
|
nslabs = SLABS_PER_PAGE << MAX_PAGE_ORDER;
|
2023-10-25 08:44:25 +00:00
|
|
|
nareas = limit_nareas(nareas, nslabs);
|
|
|
|
}
|
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
pool_size = sizeof(*pool) + array_size(sizeof(*pool->areas), nareas);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
pool = kzalloc(pool_size, gfp);
|
|
|
|
if (!pool)
|
|
|
|
goto error;
|
|
|
|
pool->areas = (void *)pool + sizeof(*pool);
|
|
|
|
|
|
|
|
tlb_size = nslabs << IO_TLB_SHIFT;
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
while (!(tlb = swiotlb_alloc_tlb(dev, tlb_size, phys_limit, gfp))) {
|
|
|
|
if (nslabs <= minslabs)
|
|
|
|
goto error_tlb;
|
|
|
|
nslabs = ALIGN(nslabs >> 1, IO_TLB_SEGSIZE);
|
|
|
|
nareas = limit_nareas(nareas, nslabs);
|
|
|
|
tlb_size = nslabs << IO_TLB_SHIFT;
|
|
|
|
}
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
slot_order = get_order(array_size(sizeof(*pool->slots), nslabs));
|
|
|
|
pool->slots = (struct io_tlb_slot *)
|
|
|
|
__get_free_pages(gfp, slot_order);
|
|
|
|
if (!pool->slots)
|
|
|
|
goto error_slots;
|
|
|
|
|
|
|
|
swiotlb_init_io_tlb_pool(pool, page_to_phys(tlb), nslabs, true, nareas);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
return pool;
|
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
error_slots:
|
|
|
|
swiotlb_free_tlb(page_address(tlb), tlb_size);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
error_tlb:
|
|
|
|
kfree(pool);
|
|
|
|
error:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
/**
|
|
|
|
* swiotlb_dyn_alloc() - dynamic memory pool allocation worker
|
|
|
|
* @work: Pointer to dyn_alloc in struct io_tlb_mem.
|
|
|
|
*/
|
|
|
|
static void swiotlb_dyn_alloc(struct work_struct *work)
|
|
|
|
{
|
|
|
|
struct io_tlb_mem *mem =
|
|
|
|
container_of(work, struct io_tlb_mem, dyn_alloc);
|
|
|
|
struct io_tlb_pool *pool;
|
|
|
|
|
|
|
|
pool = swiotlb_alloc_pool(NULL, IO_TLB_MIN_SLABS, default_nslabs,
|
|
|
|
default_nareas, mem->phys_limit, GFP_KERNEL);
|
|
|
|
if (!pool) {
|
|
|
|
pr_warn_ratelimited("Failed to allocate new pool");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
add_mem_pool(mem, pool);
|
|
|
|
}
|
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
/**
|
|
|
|
* swiotlb_dyn_free() - RCU callback to free a memory pool
|
|
|
|
* @rcu: RCU head in the corresponding struct io_tlb_pool.
|
|
|
|
*/
|
|
|
|
static void swiotlb_dyn_free(struct rcu_head *rcu)
|
|
|
|
{
|
|
|
|
struct io_tlb_pool *pool = container_of(rcu, struct io_tlb_pool, rcu);
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
size_t slots_size = array_size(sizeof(*pool->slots), pool->nslabs);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
size_t tlb_size = pool->end - pool->start;
|
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
free_pages((unsigned long)pool->slots, get_order(slots_size));
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
swiotlb_free_tlb(pool->vaddr, tlb_size);
|
|
|
|
kfree(pool);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* swiotlb_find_pool() - find the IO TLB pool for a physical address
|
|
|
|
* @dev: Device which has mapped the DMA buffer.
|
|
|
|
* @paddr: Physical address within the DMA buffer.
|
|
|
|
*
|
|
|
|
* Find the IO TLB memory pool descriptor which contains the given physical
|
|
|
|
* address, if any.
|
|
|
|
*
|
|
|
|
* Return: Memory pool which contains @paddr, or %NULL if none.
|
|
|
|
*/
|
|
|
|
struct io_tlb_pool *swiotlb_find_pool(struct device *dev, phys_addr_t paddr)
|
|
|
|
{
|
|
|
|
struct io_tlb_mem *mem = dev->dma_io_tlb_mem;
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
struct io_tlb_pool *pool;
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
|
|
|
|
rcu_read_lock();
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
list_for_each_entry_rcu(pool, &mem->pools, node) {
|
|
|
|
if (paddr >= pool->start && paddr < pool->end)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
list_for_each_entry_rcu(pool, &dev->dma_io_tlb_pools, node) {
|
|
|
|
if (paddr >= pool->start && paddr < pool->end)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
pool = NULL;
|
|
|
|
out:
|
|
|
|
rcu_read_unlock();
|
|
|
|
return pool;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* swiotlb_del_pool() - remove an IO TLB pool from a device
|
|
|
|
* @dev: Owning device.
|
|
|
|
* @pool: Memory pool to be removed.
|
|
|
|
*/
|
|
|
|
static void swiotlb_del_pool(struct device *dev, struct io_tlb_pool *pool)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&dev->dma_io_tlb_lock, flags);
|
|
|
|
list_del_rcu(&pool->node);
|
|
|
|
spin_unlock_irqrestore(&dev->dma_io_tlb_lock, flags);
|
|
|
|
|
|
|
|
call_rcu(&pool->rcu, swiotlb_dyn_free);
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
2023-08-01 06:23:57 +00:00
|
|
|
/**
|
|
|
|
* swiotlb_dev_init() - initialize swiotlb fields in &struct device
|
|
|
|
* @dev: Device to be initialized.
|
|
|
|
*/
|
|
|
|
void swiotlb_dev_init(struct device *dev)
|
|
|
|
{
|
|
|
|
dev->dma_io_tlb_mem = &io_tlb_default_mem;
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
INIT_LIST_HEAD(&dev->dma_io_tlb_pools);
|
|
|
|
spin_lock_init(&dev->dma_io_tlb_lock);
|
2023-08-01 06:24:04 +00:00
|
|
|
dev->dma_uses_io_tlb = false;
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
#endif
|
2023-08-01 06:23:57 +00:00
|
|
|
}
|
|
|
|
|
swiotlb: manipulate orig_addr when tlb_addr has offset
in case of driver wants to sync part of ranges with offset,
swiotlb_tbl_sync_single() copies from orig_addr base to tlb_addr with
offset and ends up with data mismatch.
It was removed from
"swiotlb: don't modify orig_addr in swiotlb_tbl_sync_single",
but said logic has to be added back in.
From Linus's email:
"That commit which the removed the offset calculation entirely, because the old
(unsigned long)tlb_addr & (IO_TLB_SIZE - 1)
was wrong, but instead of removing it, I think it should have just
fixed it to be
(tlb_addr - mem->start) & (IO_TLB_SIZE - 1);
instead. That way the slot offset always matches the slot index calculation."
(Unfortunatly that broke NVMe).
The use-case that drivers are hitting is as follow:
1. Get dma_addr_t from dma_map_single()
dma_addr_t tlb_addr = dma_map_single(dev, vaddr, vsize, DMA_TO_DEVICE);
|<---------------vsize------------->|
+-----------------------------------+
| | original buffer
+-----------------------------------+
vaddr
swiotlb_align_offset
|<----->|<---------------vsize------------->|
+-------+-----------------------------------+
| | | swiotlb buffer
+-------+-----------------------------------+
tlb_addr
2. Do something
3. Sync dma_addr_t through dma_sync_single_for_device(..)
dma_sync_single_for_device(dev, tlb_addr + offset, size, DMA_TO_DEVICE);
Error case.
Copy data to original buffer but it is from base addr (instead of
base addr + offset) in original buffer:
swiotlb_align_offset
|<----->|<- offset ->|<- size ->|
+-------+-----------------------------------+
| | |##########| | swiotlb buffer
+-------+-----------------------------------+
tlb_addr
|<- size ->|
+-----------------------------------+
|##########| | original buffer
+-----------------------------------+
vaddr
The fix is to copy the data to the original buffer and take into
account the offset, like so:
swiotlb_align_offset
|<----->|<- offset ->|<- size ->|
+-------+-----------------------------------+
| | |##########| | swiotlb buffer
+-------+-----------------------------------+
tlb_addr
|<- offset ->|<- size ->|
+-----------------------------------+
| |##########| | original buffer
+-----------------------------------+
vaddr
[One fix which was Linus's that made more sense to as it created a
symmetry would break NVMe. The reason for that is the:
unsigned int offset = (tlb_addr - mem->start) & (IO_TLB_SIZE - 1);
would come up with the proper offset, but it would lose the
alignment (which this patch contains).]
Fixes: 16fc3cef33a0 ("swiotlb: don't modify orig_addr in swiotlb_tbl_sync_single")
Signed-off-by: Bumyong Lee <bumyong.lee@samsung.com>
Signed-off-by: Chanho Park <chanho61.park@samsung.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Reported-by: Dominique MARTINET <dominique.martinet@atmark-techno.com>
Reported-by: Horia Geantă <horia.geanta@nxp.com>
Tested-by: Horia Geantă <horia.geanta@nxp.com>
CC: stable@vger.kernel.org
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
2021-05-10 09:10:04 +00:00
|
|
|
/*
|
|
|
|
* Return the offset into a iotlb slot required to keep the device happy.
|
|
|
|
*/
|
|
|
|
static unsigned int swiotlb_align_offset(struct device *dev, u64 addr)
|
|
|
|
{
|
|
|
|
return addr & dma_get_min_align_mask(dev) & (IO_TLB_SIZE - 1);
|
|
|
|
}
|
|
|
|
|
2008-12-22 18:26:09 +00:00
|
|
|
/*
|
2019-01-18 07:10:26 +00:00
|
|
|
* Bounce: copy the swiotlb buffer from or back to the original dma location
|
2008-12-22 18:26:09 +00:00
|
|
|
*/
|
2021-03-01 07:44:25 +00:00
|
|
|
static void swiotlb_bounce(struct device *dev, phys_addr_t tlb_addr, size_t size,
|
|
|
|
enum dma_data_direction dir)
|
2008-12-22 18:26:09 +00:00
|
|
|
{
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
struct io_tlb_pool *mem = swiotlb_find_pool(dev, tlb_addr);
|
2021-03-18 16:14:22 +00:00
|
|
|
int index = (tlb_addr - mem->start) >> IO_TLB_SHIFT;
|
2021-03-18 16:14:23 +00:00
|
|
|
phys_addr_t orig_addr = mem->slots[index].orig_addr;
|
|
|
|
size_t alloc_size = mem->slots[index].alloc_size;
|
2012-10-15 17:19:55 +00:00
|
|
|
unsigned long pfn = PFN_DOWN(orig_addr);
|
2021-12-13 07:14:02 +00:00
|
|
|
unsigned char *vaddr = mem->vaddr + tlb_addr - mem->start;
|
2021-07-07 05:12:54 +00:00
|
|
|
unsigned int tlb_offset, orig_addr_offset;
|
2008-12-22 18:26:09 +00:00
|
|
|
|
2021-03-01 07:44:25 +00:00
|
|
|
if (orig_addr == INVALID_PHYS_ADDR)
|
|
|
|
return;
|
|
|
|
|
2021-07-07 05:12:54 +00:00
|
|
|
tlb_offset = tlb_addr & (IO_TLB_SIZE - 1);
|
|
|
|
orig_addr_offset = swiotlb_align_offset(dev, orig_addr);
|
|
|
|
if (tlb_offset < orig_addr_offset) {
|
|
|
|
dev_WARN_ONCE(dev, 1,
|
|
|
|
"Access before mapping start detected. orig offset %u, requested offset %u.\n",
|
|
|
|
orig_addr_offset, tlb_offset);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
tlb_offset -= orig_addr_offset;
|
|
|
|
if (tlb_offset > alloc_size) {
|
|
|
|
dev_WARN_ONCE(dev, 1,
|
|
|
|
"Buffer overflow detected. Allocation size: %zu. Mapping size: %zu+%u.\n",
|
|
|
|
alloc_size, size, tlb_offset);
|
|
|
|
return;
|
|
|
|
}
|
swiotlb: manipulate orig_addr when tlb_addr has offset
in case of driver wants to sync part of ranges with offset,
swiotlb_tbl_sync_single() copies from orig_addr base to tlb_addr with
offset and ends up with data mismatch.
It was removed from
"swiotlb: don't modify orig_addr in swiotlb_tbl_sync_single",
but said logic has to be added back in.
From Linus's email:
"That commit which the removed the offset calculation entirely, because the old
(unsigned long)tlb_addr & (IO_TLB_SIZE - 1)
was wrong, but instead of removing it, I think it should have just
fixed it to be
(tlb_addr - mem->start) & (IO_TLB_SIZE - 1);
instead. That way the slot offset always matches the slot index calculation."
(Unfortunatly that broke NVMe).
The use-case that drivers are hitting is as follow:
1. Get dma_addr_t from dma_map_single()
dma_addr_t tlb_addr = dma_map_single(dev, vaddr, vsize, DMA_TO_DEVICE);
|<---------------vsize------------->|
+-----------------------------------+
| | original buffer
+-----------------------------------+
vaddr
swiotlb_align_offset
|<----->|<---------------vsize------------->|
+-------+-----------------------------------+
| | | swiotlb buffer
+-------+-----------------------------------+
tlb_addr
2. Do something
3. Sync dma_addr_t through dma_sync_single_for_device(..)
dma_sync_single_for_device(dev, tlb_addr + offset, size, DMA_TO_DEVICE);
Error case.
Copy data to original buffer but it is from base addr (instead of
base addr + offset) in original buffer:
swiotlb_align_offset
|<----->|<- offset ->|<- size ->|
+-------+-----------------------------------+
| | |##########| | swiotlb buffer
+-------+-----------------------------------+
tlb_addr
|<- size ->|
+-----------------------------------+
|##########| | original buffer
+-----------------------------------+
vaddr
The fix is to copy the data to the original buffer and take into
account the offset, like so:
swiotlb_align_offset
|<----->|<- offset ->|<- size ->|
+-------+-----------------------------------+
| | |##########| | swiotlb buffer
+-------+-----------------------------------+
tlb_addr
|<- offset ->|<- size ->|
+-----------------------------------+
| |##########| | original buffer
+-----------------------------------+
vaddr
[One fix which was Linus's that made more sense to as it created a
symmetry would break NVMe. The reason for that is the:
unsigned int offset = (tlb_addr - mem->start) & (IO_TLB_SIZE - 1);
would come up with the proper offset, but it would lose the
alignment (which this patch contains).]
Fixes: 16fc3cef33a0 ("swiotlb: don't modify orig_addr in swiotlb_tbl_sync_single")
Signed-off-by: Bumyong Lee <bumyong.lee@samsung.com>
Signed-off-by: Chanho Park <chanho61.park@samsung.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Reported-by: Dominique MARTINET <dominique.martinet@atmark-techno.com>
Reported-by: Horia Geantă <horia.geanta@nxp.com>
Tested-by: Horia Geantă <horia.geanta@nxp.com>
CC: stable@vger.kernel.org
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
2021-05-10 09:10:04 +00:00
|
|
|
|
|
|
|
orig_addr += tlb_offset;
|
|
|
|
alloc_size -= tlb_offset;
|
|
|
|
|
2021-03-01 07:44:25 +00:00
|
|
|
if (size > alloc_size) {
|
|
|
|
dev_WARN_ONCE(dev, 1,
|
|
|
|
"Buffer overflow detected. Allocation size: %zu. Mapping size: %zu.\n",
|
|
|
|
alloc_size, size);
|
|
|
|
size = alloc_size;
|
|
|
|
}
|
|
|
|
|
2008-12-22 18:26:09 +00:00
|
|
|
if (PageHighMem(pfn_to_page(pfn))) {
|
2012-10-15 17:19:55 +00:00
|
|
|
unsigned int offset = orig_addr & ~PAGE_MASK;
|
2022-09-01 13:29:06 +00:00
|
|
|
struct page *page;
|
2008-12-22 18:26:09 +00:00
|
|
|
unsigned int sz = 0;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
while (size) {
|
2009-04-08 14:09:16 +00:00
|
|
|
sz = min_t(size_t, PAGE_SIZE - offset, size);
|
2008-12-22 18:26:09 +00:00
|
|
|
|
|
|
|
local_irq_save(flags);
|
2022-09-01 13:29:06 +00:00
|
|
|
page = pfn_to_page(pfn);
|
2008-12-22 18:26:09 +00:00
|
|
|
if (dir == DMA_TO_DEVICE)
|
2022-09-01 13:29:06 +00:00
|
|
|
memcpy_from_page(vaddr, page, offset, sz);
|
2008-12-16 20:17:33 +00:00
|
|
|
else
|
2022-09-01 13:29:06 +00:00
|
|
|
memcpy_to_page(page, offset, vaddr, sz);
|
2008-12-16 20:17:33 +00:00
|
|
|
local_irq_restore(flags);
|
2008-12-22 18:26:09 +00:00
|
|
|
|
|
|
|
size -= sz;
|
|
|
|
pfn++;
|
2012-10-15 17:19:55 +00:00
|
|
|
vaddr += sz;
|
2008-12-22 18:26:09 +00:00
|
|
|
offset = 0;
|
2008-12-16 20:17:33 +00:00
|
|
|
}
|
2012-10-15 17:19:55 +00:00
|
|
|
} else if (dir == DMA_TO_DEVICE) {
|
|
|
|
memcpy(vaddr, phys_to_virt(orig_addr), size);
|
2008-12-16 20:17:33 +00:00
|
|
|
} else {
|
2012-10-15 17:19:55 +00:00
|
|
|
memcpy(phys_to_virt(orig_addr), vaddr, size);
|
2008-12-16 20:17:33 +00:00
|
|
|
}
|
2008-12-16 20:17:32 +00:00
|
|
|
}
|
|
|
|
|
2022-08-19 08:45:37 +00:00
|
|
|
static inline phys_addr_t slot_addr(phys_addr_t start, phys_addr_t idx)
|
|
|
|
{
|
|
|
|
return start + (idx << IO_TLB_SHIFT);
|
|
|
|
}
|
2017-07-17 21:10:22 +00:00
|
|
|
|
2021-02-04 10:08:35 +00:00
|
|
|
/*
|
|
|
|
* Carefully handle integer overflow which can occur when boundary_mask == ~0UL.
|
|
|
|
*/
|
|
|
|
static inline unsigned long get_max_slots(unsigned long boundary_mask)
|
|
|
|
{
|
2023-08-03 11:59:41 +00:00
|
|
|
return (boundary_mask >> IO_TLB_SHIFT) + 1;
|
2021-02-04 10:08:35 +00:00
|
|
|
}
|
2008-02-05 06:28:16 +00:00
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
static unsigned int wrap_area_index(struct io_tlb_pool *mem, unsigned int index)
|
2021-02-04 10:08:35 +00:00
|
|
|
{
|
2022-07-08 16:15:44 +00:00
|
|
|
if (index >= mem->area_nslabs)
|
2021-02-04 10:08:35 +00:00
|
|
|
return 0;
|
|
|
|
return index;
|
|
|
|
}
|
swiotlb: add swiotlb_tbl_map_single library function
swiotlb_tbl_map_single() takes the dma address of iotlb instead of
using swiotlb_virt_to_bus().
[v2: changed swiotlb_tlb to swiotlb_tbl]
[v3: changed u64 to dma_addr_t]
This patch:
This is a set of patches that separate the address translation
(virt_to_phys, virt_to_bus, etc) and allocation of the SWIOTLB buffer
from the SWIOTLB library.
The idea behind this set of patches is to make it possible to have separate
mechanisms for translating virtual to physical or virtual to DMA addresses
on platforms which need an SWIOTLB, and where physical != PCI bus address
and also to allocate the core IOTLB memory outside SWIOTLB.
One customers of this is the pv-ops project, which can switch between
different modes of operation depending on the environment it is running in:
bare-metal or virtualized (Xen for now). Another is the Wii DMA - used to
implement the MEM2 DMA facility needed by its EHCI controller (for details:
http://lkml.org/lkml/2010/5/18/303)
On bare-metal SWIOTLB is used when there are no hardware IOMMU. In virtualized
environment it used when PCI pass-through is enabled for the guest. The problems
with PCI pass-through is that the guest's idea of PFN's is not the real thing.
To fix that, there is translation layer for PFN->machine frame number and vice-versa.
To bubble that up to the SWIOTLB layer there are two possible solutions.
One solution has been to wholesale copy the SWIOTLB, stick it in
arch/x86/xen/swiotlb.c and modify the virt_to_phys, phys_to_virt and others
to use the Xen address translation functions. Unfortunately, since the kernel can
run on bare-metal, there would be big code overlap with the real SWIOTLB.
(git://git.kernel.org/pub/scm/linux/kernel/git/jeremy/xen.git xen/dom0/swiotlb-new)
Another approach, which this set of patches explores, is to abstract the
address translation and address determination functions away from the
SWIOTLB book-keeping functions. This way the core SWIOTLB library functions
are present in one place, while the address related functions are in
a separate library that can be loaded when running under non-bare-metal platform.
Changelog:
Since the last posting [v8.2] Konrad has done:
- Added this changelog in the patch and referenced in the other patches
this description.
- 'enum dma_data_direction direction' to 'enum dma.. dir' so to be
unified.
[v8-v8.2 changes:]
- Rolled-up the last two patches in one.
- Rebased against linus latest. That meant dealing with swiotlb_sync_single_range_* changes.
- added Acked-by: Fujita Tomonori and Tested-by: Albert Herranz
[v7-v8 changes:]
- Minimized the list of exported functions.
- Integrated Fujita's patches and changed "swiotlb_tlb" to "swiotlb_tbl" in them.
[v6-v7 changes:]
- Minimized the amount of exported functions/variable with a prefix of: "swiotbl_tbl".
- Made the usage of 'int dir' to be 'enum dma_data_direction'.
[v5-v6 changes:]
- Made the exported functions/variables have the 'swiotlb_bk' prefix.
- dropped the checkpatches/other reworks
Signed-off-by: FUJITA Tomonori <fujita.tomonori@lab.ntt.co.jp>
Reviewed-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
Tested-by: Albert Herranz <albert_herranz@yahoo.es>
2010-05-10 19:14:54 +00:00
|
|
|
|
2023-04-13 17:57:37 +00:00
|
|
|
/*
|
|
|
|
* Track the total used slots with a global atomic value in order to have
|
|
|
|
* correct information to determine the high water mark. The mem_used()
|
|
|
|
* function gives imprecise results because there's no locking across
|
|
|
|
* multiple areas.
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
static void inc_used_and_hiwater(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
unsigned long old_hiwater, new_used;
|
|
|
|
|
|
|
|
new_used = atomic_long_add_return(nslots, &mem->total_used);
|
|
|
|
old_hiwater = atomic_long_read(&mem->used_hiwater);
|
|
|
|
do {
|
|
|
|
if (new_used <= old_hiwater)
|
|
|
|
break;
|
|
|
|
} while (!atomic_long_try_cmpxchg(&mem->used_hiwater,
|
|
|
|
&old_hiwater, new_used));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void dec_used(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
atomic_long_sub(nslots, &mem->total_used);
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* !CONFIG_DEBUG_FS */
|
|
|
|
static void inc_used_and_hiwater(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
static void dec_used(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_DEBUG_FS */
|
|
|
|
|
2024-01-09 07:04:56 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
static void inc_transient_used(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
atomic_long_add(nslots, &mem->transient_nslabs);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void dec_transient_used(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
atomic_long_sub(nslots, &mem->transient_nslabs);
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* !CONFIG_DEBUG_FS */
|
|
|
|
static void inc_transient_used(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
static void dec_transient_used(struct io_tlb_mem *mem, unsigned int nslots)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_DEBUG_FS */
|
|
|
|
#endif /* CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
2023-08-01 06:23:58 +00:00
|
|
|
/**
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
* swiotlb_search_pool_area() - search one memory area in one pool
|
2023-08-01 06:23:58 +00:00
|
|
|
* @dev: Device which maps the buffer.
|
2023-08-01 06:23:59 +00:00
|
|
|
* @pool: Memory pool to be searched.
|
2023-08-01 06:23:58 +00:00
|
|
|
* @area_index: Index of the IO TLB memory area to be searched.
|
|
|
|
* @orig_addr: Original (non-bounced) IO buffer address.
|
|
|
|
* @alloc_size: Total requested size of the bounce buffer,
|
|
|
|
* including initial alignment padding.
|
|
|
|
* @alloc_align_mask: Required alignment of the allocated buffer.
|
|
|
|
*
|
|
|
|
* Find a suitable sequence of IO TLB entries for the request and allocate
|
|
|
|
* a buffer from the given IO TLB memory area.
|
|
|
|
* This function takes care of locking.
|
|
|
|
*
|
|
|
|
* Return: Index of the first allocated slot, or -1 on error.
|
2021-02-04 10:08:35 +00:00
|
|
|
*/
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
static int swiotlb_search_pool_area(struct device *dev, struct io_tlb_pool *pool,
|
2023-08-01 06:23:59 +00:00
|
|
|
int area_index, phys_addr_t orig_addr, size_t alloc_size,
|
2022-07-22 03:38:46 +00:00
|
|
|
unsigned int alloc_align_mask)
|
2021-02-04 10:08:35 +00:00
|
|
|
{
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_area *area = pool->areas + area_index;
|
2021-02-04 10:08:35 +00:00
|
|
|
unsigned long boundary_mask = dma_get_seg_boundary(dev);
|
|
|
|
dma_addr_t tbl_dma_addr =
|
2023-08-01 06:23:59 +00:00
|
|
|
phys_to_dma_unencrypted(dev, pool->start) & boundary_mask;
|
2021-02-04 10:08:35 +00:00
|
|
|
unsigned long max_slots = get_max_slots(boundary_mask);
|
2024-03-08 15:28:27 +00:00
|
|
|
unsigned int iotlb_align_mask = dma_get_min_align_mask(dev);
|
2021-02-22 19:39:44 +00:00
|
|
|
unsigned int nslots = nr_slots(alloc_size), stride;
|
2021-06-24 15:55:21 +00:00
|
|
|
unsigned int offset = swiotlb_align_offset(dev, orig_addr);
|
2023-02-22 16:53:15 +00:00
|
|
|
unsigned int index, slots_checked, count = 0, i;
|
2021-02-04 10:08:35 +00:00
|
|
|
unsigned long flags;
|
2022-07-08 16:15:44 +00:00
|
|
|
unsigned int slot_base;
|
|
|
|
unsigned int slot_index;
|
2008-12-16 20:17:29 +00:00
|
|
|
|
2021-02-04 10:08:35 +00:00
|
|
|
BUG_ON(!nslots);
|
2023-08-01 06:23:59 +00:00
|
|
|
BUG_ON(area_index >= pool->nareas);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2024-03-08 15:28:27 +00:00
|
|
|
/*
|
|
|
|
* Ensure that the allocation is at least slot-aligned and update
|
|
|
|
* 'iotlb_align_mask' to ignore bits that will be preserved when
|
|
|
|
* offsetting into the allocation.
|
|
|
|
*/
|
|
|
|
alloc_align_mask |= (IO_TLB_SIZE - 1);
|
|
|
|
iotlb_align_mask &= ~alloc_align_mask;
|
|
|
|
|
swiotlb: fix slot alignment checks
Explicit alignment and page alignment are used only to calculate
the stride, not when checking actual slot physical address.
Originally, only page alignment was implemented, and that worked,
because the whole SWIOTLB is allocated on a page boundary, so
aligning the start index was sufficient to ensure a page-aligned
slot.
When commit 1f221a0d0dbf ("swiotlb: respect min_align_mask") added
support for min_align_mask, the index could be incremented in the
search loop, potentially finding an unaligned slot if minimum device
alignment is between IO_TLB_SIZE and PAGE_SIZE. The bug could go
unnoticed, because the slot size is 2 KiB, and the most common page
size is 4 KiB, so there is no alignment value in between.
IIUC the intention has been to find a slot that conforms to all
alignment constraints: device minimum alignment, an explicit
alignment (given as function parameter) and optionally page
alignment (if allocation size is >= PAGE_SIZE). The most
restrictive mask can be trivially computed with logical AND. The
rest can stay.
Fixes: 1f221a0d0dbf ("swiotlb: respect min_align_mask")
Fixes: e81e99bacc9f ("swiotlb: Support aligned swiotlb buffers")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-03-21 08:31:27 +00:00
|
|
|
/*
|
2024-03-08 15:28:24 +00:00
|
|
|
* For mappings with an alignment requirement don't bother looping to
|
|
|
|
* unaligned slots once we found an aligned one.
|
swiotlb: fix slot alignment checks
Explicit alignment and page alignment are used only to calculate
the stride, not when checking actual slot physical address.
Originally, only page alignment was implemented, and that worked,
because the whole SWIOTLB is allocated on a page boundary, so
aligning the start index was sufficient to ensure a page-aligned
slot.
When commit 1f221a0d0dbf ("swiotlb: respect min_align_mask") added
support for min_align_mask, the index could be incremented in the
search loop, potentially finding an unaligned slot if minimum device
alignment is between IO_TLB_SIZE and PAGE_SIZE. The bug could go
unnoticed, because the slot size is 2 KiB, and the most common page
size is 4 KiB, so there is no alignment value in between.
IIUC the intention has been to find a slot that conforms to all
alignment constraints: device minimum alignment, an explicit
alignment (given as function parameter) and optionally page
alignment (if allocation size is >= PAGE_SIZE). The most
restrictive mask can be trivially computed with logical AND. The
rest can stay.
Fixes: 1f221a0d0dbf ("swiotlb: respect min_align_mask")
Fixes: e81e99bacc9f ("swiotlb: Support aligned swiotlb buffers")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-03-21 08:31:27 +00:00
|
|
|
*/
|
2024-03-08 15:28:24 +00:00
|
|
|
stride = get_max_slots(max(alloc_align_mask, iotlb_align_mask));
|
swiotlb: fix slot alignment checks
Explicit alignment and page alignment are used only to calculate
the stride, not when checking actual slot physical address.
Originally, only page alignment was implemented, and that worked,
because the whole SWIOTLB is allocated on a page boundary, so
aligning the start index was sufficient to ensure a page-aligned
slot.
When commit 1f221a0d0dbf ("swiotlb: respect min_align_mask") added
support for min_align_mask, the index could be incremented in the
search loop, potentially finding an unaligned slot if minimum device
alignment is between IO_TLB_SIZE and PAGE_SIZE. The bug could go
unnoticed, because the slot size is 2 KiB, and the most common page
size is 4 KiB, so there is no alignment value in between.
IIUC the intention has been to find a slot that conforms to all
alignment constraints: device minimum alignment, an explicit
alignment (given as function parameter) and optionally page
alignment (if allocation size is >= PAGE_SIZE). The most
restrictive mask can be trivially computed with logical AND. The
rest can stay.
Fixes: 1f221a0d0dbf ("swiotlb: respect min_align_mask")
Fixes: e81e99bacc9f ("swiotlb: Support aligned swiotlb buffers")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-03-21 08:31:27 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
2024-03-08 15:28:24 +00:00
|
|
|
* For allocations of PAGE_SIZE or larger only look for page aligned
|
|
|
|
* allocations.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2024-03-08 15:28:24 +00:00
|
|
|
if (alloc_size >= PAGE_SIZE)
|
|
|
|
stride = umax(stride, PAGE_SHIFT - IO_TLB_SHIFT + 1);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2022-07-08 16:15:44 +00:00
|
|
|
spin_lock_irqsave(&area->lock, flags);
|
2023-08-01 06:23:59 +00:00
|
|
|
if (unlikely(nslots > pool->area_nslabs - area->used))
|
2019-01-18 07:10:28 +00:00
|
|
|
goto not_found;
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
slot_base = area_index * pool->area_nslabs;
|
swiotlb: fix slot alignment checks
Explicit alignment and page alignment are used only to calculate
the stride, not when checking actual slot physical address.
Originally, only page alignment was implemented, and that worked,
because the whole SWIOTLB is allocated on a page boundary, so
aligning the start index was sufficient to ensure a page-aligned
slot.
When commit 1f221a0d0dbf ("swiotlb: respect min_align_mask") added
support for min_align_mask, the index could be incremented in the
search loop, potentially finding an unaligned slot if minimum device
alignment is between IO_TLB_SIZE and PAGE_SIZE. The bug could go
unnoticed, because the slot size is 2 KiB, and the most common page
size is 4 KiB, so there is no alignment value in between.
IIUC the intention has been to find a slot that conforms to all
alignment constraints: device minimum alignment, an explicit
alignment (given as function parameter) and optionally page
alignment (if allocation size is >= PAGE_SIZE). The most
restrictive mask can be trivially computed with logical AND. The
rest can stay.
Fixes: 1f221a0d0dbf ("swiotlb: respect min_align_mask")
Fixes: e81e99bacc9f ("swiotlb: Support aligned swiotlb buffers")
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-03-21 08:31:27 +00:00
|
|
|
index = area->index;
|
2022-07-08 16:15:44 +00:00
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
for (slots_checked = 0; slots_checked < pool->area_nslabs; ) {
|
2024-03-08 15:28:24 +00:00
|
|
|
phys_addr_t tlb_addr;
|
|
|
|
|
2022-07-08 16:15:44 +00:00
|
|
|
slot_index = slot_base + index;
|
2024-03-08 15:28:24 +00:00
|
|
|
tlb_addr = slot_addr(tbl_dma_addr, slot_index);
|
2022-07-08 16:15:44 +00:00
|
|
|
|
2024-03-08 15:28:24 +00:00
|
|
|
if ((tlb_addr & alloc_align_mask) ||
|
|
|
|
(orig_addr && (tlb_addr & iotlb_align_mask) !=
|
|
|
|
(orig_addr & iotlb_align_mask))) {
|
2023-08-01 06:23:59 +00:00
|
|
|
index = wrap_area_index(pool, index + 1);
|
2023-02-22 16:53:15 +00:00
|
|
|
slots_checked++;
|
2021-02-22 19:39:44 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2022-07-08 16:15:44 +00:00
|
|
|
if (!iommu_is_span_boundary(slot_index, nslots,
|
2021-02-04 10:08:35 +00:00
|
|
|
nr_slots(tbl_dma_addr),
|
|
|
|
max_slots)) {
|
2023-08-01 06:23:59 +00:00
|
|
|
if (pool->slots[slot_index].list >= nslots)
|
2021-02-04 10:08:35 +00:00
|
|
|
goto found;
|
2008-04-29 07:59:36 +00:00
|
|
|
}
|
2023-08-01 06:23:59 +00:00
|
|
|
index = wrap_area_index(pool, index + stride);
|
2023-02-22 16:53:15 +00:00
|
|
|
slots_checked += stride;
|
|
|
|
}
|
2008-04-29 07:59:36 +00:00
|
|
|
|
|
|
|
not_found:
|
2022-07-08 16:15:44 +00:00
|
|
|
spin_unlock_irqrestore(&area->lock, flags);
|
2021-02-04 10:08:35 +00:00
|
|
|
return -1;
|
|
|
|
|
2008-04-29 07:59:36 +00:00
|
|
|
found:
|
2023-08-02 16:30:34 +00:00
|
|
|
/*
|
|
|
|
* If we find a slot that indicates we have 'nslots' number of
|
|
|
|
* contiguous buffers, we allocate the buffers from that slot onwards
|
|
|
|
* and set the list of free entries to '0' indicating unavailable.
|
|
|
|
*/
|
2022-07-08 16:15:44 +00:00
|
|
|
for (i = slot_index; i < slot_index + nslots; i++) {
|
2023-08-01 06:23:59 +00:00
|
|
|
pool->slots[i].list = 0;
|
|
|
|
pool->slots[i].alloc_size = alloc_size - (offset +
|
2022-07-08 16:15:44 +00:00
|
|
|
((i - slot_index) << IO_TLB_SHIFT));
|
2021-06-24 15:55:21 +00:00
|
|
|
}
|
2022-07-08 16:15:44 +00:00
|
|
|
for (i = slot_index - 1;
|
2021-02-04 10:08:35 +00:00
|
|
|
io_tlb_offset(i) != IO_TLB_SEGSIZE - 1 &&
|
2023-08-01 06:23:59 +00:00
|
|
|
pool->slots[i].list; i--)
|
|
|
|
pool->slots[i].list = ++count;
|
2021-02-04 10:08:35 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Update the indices to avoid searching in the next round.
|
|
|
|
*/
|
2023-08-01 06:23:59 +00:00
|
|
|
area->index = wrap_area_index(pool, index + nslots);
|
2022-07-08 16:15:44 +00:00
|
|
|
area->used += nslots;
|
|
|
|
spin_unlock_irqrestore(&area->lock, flags);
|
2023-04-13 17:57:37 +00:00
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
inc_used_and_hiwater(dev->dma_io_tlb_mem, nslots);
|
2022-07-08 16:15:44 +00:00
|
|
|
return slot_index;
|
|
|
|
}
|
2021-02-04 10:08:35 +00:00
|
|
|
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
|
2023-08-01 06:23:58 +00:00
|
|
|
/**
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
* swiotlb_search_area() - search one memory area in all pools
|
2023-08-01 06:23:58 +00:00
|
|
|
* @dev: Device which maps the buffer.
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
* @start_cpu: Start CPU number.
|
|
|
|
* @cpu_offset: Offset from @start_cpu.
|
2023-08-01 06:23:58 +00:00
|
|
|
* @orig_addr: Original (non-bounced) IO buffer address.
|
|
|
|
* @alloc_size: Total requested size of the bounce buffer,
|
|
|
|
* including initial alignment padding.
|
|
|
|
* @alloc_align_mask: Required alignment of the allocated buffer.
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
* @retpool: Used memory pool, updated on return.
|
2023-08-01 06:23:58 +00:00
|
|
|
*
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
* Search one memory area in all pools for a sequence of slots that match the
|
2023-08-01 06:23:59 +00:00
|
|
|
* allocation constraints.
|
2023-08-01 06:23:58 +00:00
|
|
|
*
|
|
|
|
* Return: Index of the first allocated slot, or -1 on error.
|
|
|
|
*/
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
static int swiotlb_search_area(struct device *dev, int start_cpu,
|
|
|
|
int cpu_offset, phys_addr_t orig_addr, size_t alloc_size,
|
|
|
|
unsigned int alloc_align_mask, struct io_tlb_pool **retpool)
|
2022-07-08 16:15:44 +00:00
|
|
|
{
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
struct io_tlb_mem *mem = dev->dma_io_tlb_mem;
|
|
|
|
struct io_tlb_pool *pool;
|
|
|
|
int area_index;
|
|
|
|
int index = -1;
|
2022-07-08 16:15:44 +00:00
|
|
|
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(pool, &mem->pools, node) {
|
|
|
|
if (cpu_offset >= pool->nareas)
|
|
|
|
continue;
|
|
|
|
area_index = (start_cpu + cpu_offset) & (pool->nareas - 1);
|
|
|
|
index = swiotlb_search_pool_area(dev, pool, area_index,
|
|
|
|
orig_addr, alloc_size,
|
|
|
|
alloc_align_mask);
|
|
|
|
if (index >= 0) {
|
|
|
|
*retpool = pool;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
return index;
|
2022-07-08 16:15:44 +00:00
|
|
|
}
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
/**
|
|
|
|
* swiotlb_find_slots() - search for slots in the whole swiotlb
|
|
|
|
* @dev: Device which maps the buffer.
|
|
|
|
* @orig_addr: Original (non-bounced) IO buffer address.
|
|
|
|
* @alloc_size: Total requested size of the bounce buffer,
|
|
|
|
* including initial alignment padding.
|
|
|
|
* @alloc_align_mask: Required alignment of the allocated buffer.
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
* @retpool: Used memory pool, updated on return.
|
2023-08-01 06:23:59 +00:00
|
|
|
*
|
|
|
|
* Search through the whole software IO TLB to find a sequence of slots that
|
|
|
|
* match the allocation constraints.
|
|
|
|
*
|
|
|
|
* Return: Index of the first allocated slot, or -1 on error.
|
|
|
|
*/
|
|
|
|
static int swiotlb_find_slots(struct device *dev, phys_addr_t orig_addr,
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
size_t alloc_size, unsigned int alloc_align_mask,
|
|
|
|
struct io_tlb_pool **retpool)
|
2023-08-01 06:23:59 +00:00
|
|
|
{
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
struct io_tlb_mem *mem = dev->dma_io_tlb_mem;
|
|
|
|
struct io_tlb_pool *pool;
|
|
|
|
unsigned long nslabs;
|
|
|
|
unsigned long flags;
|
|
|
|
u64 phys_limit;
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
int cpu, i;
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
int index;
|
|
|
|
|
2024-01-09 02:45:47 +00:00
|
|
|
if (alloc_size > IO_TLB_SEGSIZE * IO_TLB_SIZE)
|
|
|
|
return -1;
|
|
|
|
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
cpu = raw_smp_processor_id();
|
|
|
|
for (i = 0; i < default_nareas; ++i) {
|
|
|
|
index = swiotlb_search_area(dev, cpu, i, orig_addr, alloc_size,
|
|
|
|
alloc_align_mask, &pool);
|
|
|
|
if (index >= 0)
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
goto found;
|
|
|
|
}
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
if (!mem->can_grow)
|
|
|
|
return -1;
|
|
|
|
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
schedule_work(&mem->dyn_alloc);
|
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
nslabs = nr_slots(alloc_size);
|
|
|
|
phys_limit = min_not_zero(*dev->dma_mask, dev->bus_dma_limit);
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
pool = swiotlb_alloc_pool(dev, nslabs, nslabs, 1, phys_limit,
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
GFP_NOWAIT | __GFP_NOWARN);
|
|
|
|
if (!pool)
|
|
|
|
return -1;
|
|
|
|
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
index = swiotlb_search_pool_area(dev, pool, 0, orig_addr,
|
|
|
|
alloc_size, alloc_align_mask);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
if (index < 0) {
|
|
|
|
swiotlb_dyn_free(&pool->rcu);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
pool->transient = true;
|
|
|
|
spin_lock_irqsave(&dev->dma_io_tlb_lock, flags);
|
|
|
|
list_add_rcu(&pool->node, &dev->dma_io_tlb_pools);
|
|
|
|
spin_unlock_irqrestore(&dev->dma_io_tlb_lock, flags);
|
2024-01-09 07:04:56 +00:00
|
|
|
inc_transient_used(mem, pool->nslabs);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
|
|
|
|
found:
|
swiotlb: fix the check whether a device has used software IO TLB
When CONFIG_SWIOTLB_DYNAMIC=y, devices which do not use the software IO TLB
can avoid swiotlb lookup. A flag is added by commit 1395706a1490 ("swiotlb:
search the software IO TLB only if the device makes use of it"), the flag
is correctly set, but it is then never checked. Add the actual check here.
Note that this code is an alternative to the default pool check, not an
additional check, because:
1. swiotlb_find_pool() also searches the default pool;
2. if dma_uses_io_tlb is false, the default swiotlb pool is not used.
Tested in a KVM guest against a QEMU RAM-backed SATA disk over virtio and
*not* using software IO TLB, this patch increases IOPS by approx 2% for
4-way parallel I/O.
The write memory barrier in swiotlb_dyn_alloc() is not needed, because a
newly allocated pool must always be observed by swiotlb_find_slots() before
an address from that pool is passed to is_swiotlb_buffer().
Correctness was verified using the following litmus test:
C swiotlb-new-pool
(*
* Result: Never
*
* Check that a newly allocated pool is always visible when the
* corresponding swiotlb buffer is visible.
*)
{
mem_pools = default;
}
P0(int **mem_pools, int *pool)
{
/* add_mem_pool() */
WRITE_ONCE(*pool, 999);
rcu_assign_pointer(*mem_pools, pool);
}
P1(int **mem_pools, int *flag, int *buf)
{
/* swiotlb_find_slots() */
int *r0;
int r1;
rcu_read_lock();
r0 = READ_ONCE(*mem_pools);
r1 = READ_ONCE(*r0);
rcu_read_unlock();
if (r1) {
WRITE_ONCE(*flag, 1);
smp_mb();
}
/* device driver (presumed) */
WRITE_ONCE(*buf, r1);
}
P2(int **mem_pools, int *flag, int *buf)
{
/* device driver (presumed) */
int r0 = READ_ONCE(*buf);
/* is_swiotlb_buffer() */
int r1;
int *r2;
int r3;
smp_rmb();
r1 = READ_ONCE(*flag);
if (r1) {
/* swiotlb_find_pool() */
rcu_read_lock();
r2 = READ_ONCE(*mem_pools);
r3 = READ_ONCE(*r2);
rcu_read_unlock();
}
}
exists (2:r0<>0 /\ 2:r3=0) (* Not found. *)
Fixes: 1395706a1490 ("swiotlb: search the software IO TLB only if the device makes use of it")
Reported-by: Jonathan Corbet <corbet@lwn.net>
Closes: https://lore.kernel.org/linux-iommu/87a5uz3ob8.fsf@meer.lwn.net/
Signed-off-by: Petr Tesarik <petr@tesarici.cz>
Reviewed-by: Catalin Marinas <catalin.marinas@arm.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-09-26 18:55:56 +00:00
|
|
|
WRITE_ONCE(dev->dma_uses_io_tlb, true);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The general barrier orders reads and writes against a presumed store
|
|
|
|
* of the SWIOTLB buffer address by a device driver (to a driver private
|
|
|
|
* data structure). It serves two purposes.
|
|
|
|
*
|
|
|
|
* First, the store to dev->dma_uses_io_tlb must be ordered before the
|
|
|
|
* presumed store. This guarantees that the returned buffer address
|
|
|
|
* cannot be passed to another CPU before updating dev->dma_uses_io_tlb.
|
|
|
|
*
|
|
|
|
* Second, the load from mem->pools must be ordered before the same
|
|
|
|
* presumed store. This guarantees that the returned buffer address
|
|
|
|
* cannot be observed by another CPU before an update of the RCU list
|
|
|
|
* that was made by swiotlb_dyn_alloc() on a third CPU (cf. multicopy
|
|
|
|
* atomicity).
|
|
|
|
*
|
|
|
|
* See also the comment in is_swiotlb_buffer().
|
|
|
|
*/
|
|
|
|
smp_mb();
|
2023-08-01 06:24:04 +00:00
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
*retpool = pool;
|
|
|
|
return index;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* !CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
|
|
|
static int swiotlb_find_slots(struct device *dev, phys_addr_t orig_addr,
|
|
|
|
size_t alloc_size, unsigned int alloc_align_mask,
|
|
|
|
struct io_tlb_pool **retpool)
|
|
|
|
{
|
swiotlb: reduce area lock contention for non-primary IO TLB pools
If multiple areas and multiple IO TLB pools exist, first iterate the
current CPU specific area in all pools. Then move to the next area index.
This is best illustrated by a diagram:
area 0 | area 1 | ... | area M |
pool 0 A B C
pool 1 D E
...
pool N F G H
Currently, each pool is searched before moving on to the next pool,
i.e. the search order is A, B ... C, D, E ... F, G ... H. With this patch,
each area is searched in all pools before moving on to the next area,
i.e. the search order is A, D ... F, B, E ... G ... C ... H.
Note that preemption is not disabled, and raw_smp_processor_id() may not
return a stable result, but it is called only once to determine the initial
area index. The search will iterate over all areas eventually, even if the
current task is preempted.
Next, some pools may have less (but not more) areas than default_nareas.
Skip such pools if the distance from the initial area index is greater than
pool->nareas. This logic ensures that for every pool the search starts in
the initial CPU's own area and never tries any area twice.
To verify performance impact, I booted the kernel with a minimum pool
size ("swiotlb=512,4,force"), so multiple pools get allocated, and I ran
these benchmarks:
- small: single-threaded I/O of 4 KiB blocks,
- big: single-threaded I/O of 64 KiB blocks,
- 4way: 4-way parallel I/O of 4 KiB blocks.
The "var" column in the tables below is the coefficient of variance over 5
runs of the test, the "diff" column is the relative difference against base
in read-write I/O bandwidth (MiB/s).
Tested on an x86 VM against a QEMU virtio SATA driver backed by a RAM-based
block device on the host:
base patched
var var diff
small 0.69% 0.62% +25.4%
big 2.14% 2.27% +25.7%
4way 2.65% 1.70% +23.6%
Tested on a Raspberry Pi against a class-10 A1 microSD card:
base patched
var var diff
small 0.53% 1.96% -0.3%
big 0.02% 0.57% +0.8%
4way 6.17% 0.40% +0.3%
These results confirm that there is significant performance boost in the
software IO TLB slot allocation itself. Where performance is dominated by
actual hardware, there is no measurable change.
Signed-off-by: Petr Tesarik <petr.tesarik1@huawei-partners.com>
Reviewed-by: Mirsad Todorovac <mirsad.todorovac@alu.unizg.hr>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-12-01 12:13:52 +00:00
|
|
|
struct io_tlb_pool *pool;
|
|
|
|
int start, i;
|
|
|
|
int index;
|
|
|
|
|
|
|
|
*retpool = pool = &dev->dma_io_tlb_mem->defpool;
|
|
|
|
i = start = raw_smp_processor_id() & (pool->nareas - 1);
|
|
|
|
do {
|
|
|
|
index = swiotlb_search_pool_area(dev, pool, i, orig_addr,
|
|
|
|
alloc_size, alloc_align_mask);
|
|
|
|
if (index >= 0)
|
|
|
|
return index;
|
|
|
|
if (++i >= pool->nareas)
|
|
|
|
i = 0;
|
|
|
|
} while (i != start);
|
|
|
|
return -1;
|
2023-08-01 06:23:59 +00:00
|
|
|
}
|
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
#endif /* CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
2023-06-07 09:04:18 +00:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
|
2023-08-01 06:23:58 +00:00
|
|
|
/**
|
|
|
|
* mem_used() - get number of used slots in an allocator
|
|
|
|
* @mem: Software IO TLB allocator.
|
|
|
|
*
|
|
|
|
* The result is accurate in this version of the function, because an atomic
|
|
|
|
* counter is available if CONFIG_DEBUG_FS is set.
|
|
|
|
*
|
|
|
|
* Return: Number of used slots.
|
|
|
|
*/
|
2023-06-07 09:04:18 +00:00
|
|
|
static unsigned long mem_used(struct io_tlb_mem *mem)
|
|
|
|
{
|
|
|
|
return atomic_long_read(&mem->total_used);
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* !CONFIG_DEBUG_FS */
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
/**
|
|
|
|
* mem_pool_used() - get number of used slots in a memory pool
|
|
|
|
* @pool: Software IO TLB memory pool.
|
|
|
|
*
|
|
|
|
* The result is not accurate, see mem_used().
|
|
|
|
*
|
|
|
|
* Return: Approximate number of used slots.
|
|
|
|
*/
|
|
|
|
static unsigned long mem_pool_used(struct io_tlb_pool *pool)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
unsigned long used = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < pool->nareas; i++)
|
|
|
|
used += pool->areas[i].used;
|
|
|
|
return used;
|
|
|
|
}
|
|
|
|
|
2023-08-01 06:23:58 +00:00
|
|
|
/**
|
|
|
|
* mem_used() - get number of used slots in an allocator
|
|
|
|
* @mem: Software IO TLB allocator.
|
|
|
|
*
|
|
|
|
* The result is not accurate, because there is no locking of individual
|
|
|
|
* areas.
|
|
|
|
*
|
|
|
|
* Return: Approximate number of used slots.
|
|
|
|
*/
|
2022-07-08 16:15:44 +00:00
|
|
|
static unsigned long mem_used(struct io_tlb_mem *mem)
|
|
|
|
{
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
struct io_tlb_pool *pool;
|
|
|
|
unsigned long used = 0;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(pool, &mem->pools, node)
|
|
|
|
used += mem_pool_used(pool);
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return used;
|
|
|
|
#else
|
2023-08-01 06:23:59 +00:00
|
|
|
return mem_pool_used(&mem->defpool);
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
#endif
|
2021-02-04 10:08:35 +00:00
|
|
|
}
|
|
|
|
|
2023-06-07 09:04:18 +00:00
|
|
|
#endif /* CONFIG_DEBUG_FS */
|
|
|
|
|
2021-02-04 10:08:35 +00:00
|
|
|
phys_addr_t swiotlb_tbl_map_single(struct device *dev, phys_addr_t orig_addr,
|
|
|
|
size_t mapping_size, size_t alloc_size,
|
2021-09-29 02:32:59 +00:00
|
|
|
unsigned int alloc_align_mask, enum dma_data_direction dir,
|
|
|
|
unsigned long attrs)
|
2021-02-04 10:08:35 +00:00
|
|
|
{
|
2021-06-19 03:40:34 +00:00
|
|
|
struct io_tlb_mem *mem = dev->dma_io_tlb_mem;
|
2021-02-22 19:39:44 +00:00
|
|
|
unsigned int offset = swiotlb_align_offset(dev, orig_addr);
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *pool;
|
2021-04-22 08:14:53 +00:00
|
|
|
unsigned int i;
|
|
|
|
int index;
|
2021-02-04 10:08:35 +00:00
|
|
|
phys_addr_t tlb_addr;
|
|
|
|
|
2022-09-07 13:38:33 +00:00
|
|
|
if (!mem || !mem->nslabs) {
|
|
|
|
dev_warn_ratelimited(dev,
|
|
|
|
"Can not allocate SWIOTLB buffer earlier and can't now provide you with the DMA bounce buffer");
|
|
|
|
return (phys_addr_t)DMA_MAPPING_ERROR;
|
|
|
|
}
|
2021-02-04 10:08:35 +00:00
|
|
|
|
2021-09-08 22:58:39 +00:00
|
|
|
if (cc_platform_has(CC_ATTR_MEM_ENCRYPT))
|
2021-02-04 10:08:35 +00:00
|
|
|
pr_warn_once("Memory encryption is active and system is using DMA bounce buffers\n");
|
|
|
|
|
|
|
|
if (mapping_size > alloc_size) {
|
|
|
|
dev_warn_once(dev, "Invalid sizes (mapping: %zd bytes, alloc: %zd bytes)",
|
|
|
|
mapping_size, alloc_size);
|
|
|
|
return (phys_addr_t)DMA_MAPPING_ERROR;
|
|
|
|
}
|
|
|
|
|
2021-09-29 02:32:59 +00:00
|
|
|
index = swiotlb_find_slots(dev, orig_addr,
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
alloc_size + offset, alloc_align_mask, &pool);
|
2021-02-04 10:08:35 +00:00
|
|
|
if (index == -1) {
|
|
|
|
if (!(attrs & DMA_ATTR_NO_WARN))
|
|
|
|
dev_warn_ratelimited(dev,
|
|
|
|
"swiotlb buffer is full (sz: %zd bytes), total %lu (slots), used %lu (slots)\n",
|
2022-07-08 16:15:44 +00:00
|
|
|
alloc_size, mem->nslabs, mem_used(mem));
|
2021-02-04 10:08:35 +00:00
|
|
|
return (phys_addr_t)DMA_MAPPING_ERROR;
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Save away the mapping from the original address to the DMA address.
|
|
|
|
* This is needed when we sync the memory. Then we sync the buffer if
|
|
|
|
* needed.
|
|
|
|
*/
|
2021-06-24 15:55:21 +00:00
|
|
|
for (i = 0; i < nr_slots(alloc_size + offset); i++)
|
2023-08-01 06:23:59 +00:00
|
|
|
pool->slots[index + i].orig_addr = slot_addr(orig_addr, i);
|
|
|
|
tlb_addr = slot_addr(pool->start, index) + offset;
|
2022-03-28 18:37:05 +00:00
|
|
|
/*
|
swiotlb: rewrite comment explaining why the source is preserved on DMA_FROM_DEVICE
Rewrite the comment explaining why swiotlb copies the original buffer to
the TLB buffer before initiating DMA *from* the device, i.e. before the
device DMAs into the TLB buffer. The existing comment's argument that
preserving the original data can prevent a kernel memory leak is bogus.
If the driver that triggered the mapping _knows_ that the device will
overwrite the entire mapping, or the driver will consume only the written
parts, then copying from the original memory is completely pointless.
If neither of the above holds true, then copying from the original adds
value only if preserving the data is necessary for functional
correctness, or the driver explicitly initialized the original memory.
If the driver didn't initialize the memory, then copying the original
buffer to the TLB buffer simply changes what kernel data is leaked to
user space.
Writing the entire TLB buffer _does_ prevent leaking stale TLB buffer
data from a previous bounce, but that can be achieved by simply zeroing
the TLB buffer when grabbing a slot.
The real reason swiotlb ended up initializing the TLB buffer with the
original buffer is that it's necessary to make swiotlb operate as
transparently as possible, i.e. to behave as closely as possible to
hardware, and to avoid corrupting the original buffer, e.g. if the driver
knows the device will do partial writes and is relying on the unwritten
data to be preserved.
Reviewed-by: Robin Murphy <robin.murphy@arm.com>
Link: https://lore.kernel.org/all/ZN5elYQ5szQndN8n@google.com
Signed-off-by: Sean Christopherson <seanjc@google.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-10-20 15:42:15 +00:00
|
|
|
* When the device is writing memory, i.e. dir == DMA_FROM_DEVICE, copy
|
|
|
|
* the original buffer to the TLB buffer before initiating DMA in order
|
|
|
|
* to preserve the original's data if the device does a partial write,
|
|
|
|
* i.e. if the device doesn't overwrite the entire buffer. Preserving
|
|
|
|
* the original data, even if it's garbage, is necessary to match
|
|
|
|
* hardware behavior. Use of swiotlb is supposed to be transparent,
|
|
|
|
* i.e. swiotlb must not corrupt memory by clobbering unwritten bytes.
|
2022-03-28 18:37:05 +00:00
|
|
|
*/
|
|
|
|
swiotlb_bounce(dev, tlb_addr, mapping_size, DMA_TO_DEVICE);
|
2012-10-15 17:19:39 +00:00
|
|
|
return tlb_addr;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:39 +00:00
|
|
|
static void swiotlb_release_slots(struct device *dev, phys_addr_t tlb_addr)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
struct io_tlb_pool *mem = swiotlb_find_pool(dev, tlb_addr);
|
2005-04-16 22:20:36 +00:00
|
|
|
unsigned long flags;
|
2021-06-19 03:40:39 +00:00
|
|
|
unsigned int offset = swiotlb_align_offset(dev, tlb_addr);
|
2021-03-18 16:14:22 +00:00
|
|
|
int index = (tlb_addr - offset - mem->start) >> IO_TLB_SHIFT;
|
2021-03-18 16:14:23 +00:00
|
|
|
int nslots = nr_slots(mem->slots[index].alloc_size + offset);
|
2022-07-08 16:15:44 +00:00
|
|
|
int aindex = index / mem->area_nslabs;
|
|
|
|
struct io_tlb_area *area = &mem->areas[aindex];
|
2021-03-01 07:44:25 +00:00
|
|
|
int count, i;
|
2021-01-12 15:07:29 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Return the buffer to the free list by setting the corresponding
|
tree-wide: fix assorted typos all over the place
That is "success", "unknown", "through", "performance", "[re|un]mapping"
, "access", "default", "reasonable", "[con]currently", "temperature"
, "channel", "[un]used", "application", "example","hierarchy", "therefore"
, "[over|under]flow", "contiguous", "threshold", "enough" and others.
Signed-off-by: André Goddard Rosa <andre.goddard@gmail.com>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
2009-11-14 15:09:05 +00:00
|
|
|
* entries to indicate the number of contiguous entries available.
|
2005-04-16 22:20:36 +00:00
|
|
|
* While returning the entries to the free list, we merge the entries
|
|
|
|
* with slots below and above the pool being returned.
|
|
|
|
*/
|
2022-07-08 16:15:44 +00:00
|
|
|
BUG_ON(aindex >= mem->nareas);
|
|
|
|
|
|
|
|
spin_lock_irqsave(&area->lock, flags);
|
2021-02-04 09:13:40 +00:00
|
|
|
if (index + nslots < ALIGN(index + 1, IO_TLB_SEGSIZE))
|
2021-03-18 16:14:23 +00:00
|
|
|
count = mem->slots[index + nslots].list;
|
2021-02-04 09:13:40 +00:00
|
|
|
else
|
|
|
|
count = 0;
|
2019-01-18 07:10:27 +00:00
|
|
|
|
2021-02-04 09:13:40 +00:00
|
|
|
/*
|
|
|
|
* Step 1: return the slots to the free list, merging the slots with
|
|
|
|
* superceeding slots
|
|
|
|
*/
|
|
|
|
for (i = index + nslots - 1; i >= index; i--) {
|
2021-03-18 16:14:23 +00:00
|
|
|
mem->slots[i].list = ++count;
|
|
|
|
mem->slots[i].orig_addr = INVALID_PHYS_ADDR;
|
|
|
|
mem->slots[i].alloc_size = 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2021-02-04 09:13:40 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 2: merge the returned slots with the preceding slots, if
|
|
|
|
* available (non zero)
|
|
|
|
*/
|
|
|
|
for (i = index - 1;
|
2021-03-18 16:14:23 +00:00
|
|
|
io_tlb_offset(i) != IO_TLB_SEGSIZE - 1 && mem->slots[i].list;
|
2021-02-04 09:13:40 +00:00
|
|
|
i--)
|
2021-03-18 16:14:23 +00:00
|
|
|
mem->slots[i].list = ++count;
|
2022-07-08 16:15:44 +00:00
|
|
|
area->used -= nslots;
|
|
|
|
spin_unlock_irqrestore(&area->lock, flags);
|
2023-04-13 17:57:37 +00:00
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
dec_used(dev->dma_io_tlb_mem, nslots);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
|
|
|
|
/**
|
|
|
|
* swiotlb_del_transient() - delete a transient memory pool
|
|
|
|
* @dev: Device which mapped the buffer.
|
|
|
|
* @tlb_addr: Physical address within a bounce buffer.
|
|
|
|
*
|
|
|
|
* Check whether the address belongs to a transient SWIOTLB memory pool.
|
|
|
|
* If yes, then delete the pool.
|
|
|
|
*
|
|
|
|
* Return: %true if @tlb_addr belonged to a transient pool that was released.
|
|
|
|
*/
|
|
|
|
static bool swiotlb_del_transient(struct device *dev, phys_addr_t tlb_addr)
|
|
|
|
{
|
|
|
|
struct io_tlb_pool *pool;
|
|
|
|
|
|
|
|
pool = swiotlb_find_pool(dev, tlb_addr);
|
|
|
|
if (!pool->transient)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
dec_used(dev->dma_io_tlb_mem, pool->nslabs);
|
|
|
|
swiotlb_del_pool(dev, pool);
|
2024-01-09 07:04:56 +00:00
|
|
|
dec_transient_used(dev->dma_io_tlb_mem, pool->nslabs);
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* !CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
|
|
|
static inline bool swiotlb_del_transient(struct device *dev,
|
|
|
|
phys_addr_t tlb_addr)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_SWIOTLB_DYNAMIC */
|
|
|
|
|
2021-06-19 03:40:39 +00:00
|
|
|
/*
|
|
|
|
* tlb_addr is the physical address of the bounce buffer to unmap.
|
|
|
|
*/
|
|
|
|
void swiotlb_tbl_unmap_single(struct device *dev, phys_addr_t tlb_addr,
|
|
|
|
size_t mapping_size, enum dma_data_direction dir,
|
|
|
|
unsigned long attrs)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* First, sync the memory before unmapping the entry
|
|
|
|
*/
|
|
|
|
if (!(attrs & DMA_ATTR_SKIP_CPU_SYNC) &&
|
|
|
|
(dir == DMA_FROM_DEVICE || dir == DMA_BIDIRECTIONAL))
|
|
|
|
swiotlb_bounce(dev, tlb_addr, mapping_size, DMA_FROM_DEVICE);
|
|
|
|
|
swiotlb: if swiotlb is full, fall back to a transient memory pool
Try to allocate a transient memory pool if no suitable slots can be found
and the respective SWIOTLB is allowed to grow. The transient pool is just
enough big for this one bounce buffer. It is inserted into a per-device
list of transient memory pools, and it is freed again when the bounce
buffer is unmapped.
Transient memory pools are kept in an RCU list. A memory barrier is
required after adding a new entry, because any address within a transient
buffer must be immediately recognized as belonging to the SWIOTLB, even if
it is passed to another CPU.
Deletion does not require any synchronization beyond RCU ordering
guarantees. After a buffer is unmapped, its physical addresses may no
longer be passed to the DMA API, so the memory range of the corresponding
stale entry in the RCU list never matches. If the memory range gets
allocated again, then it happens only after a RCU quiescent state.
Since bounce buffers can now be allocated from different pools, add a
parameter to swiotlb_alloc_pool() to let the caller know which memory pool
is used. Add swiotlb_find_pool() to find the memory pool corresponding to
an address. This function is now also used by is_swiotlb_buffer(), because
a simple boundary check is no longer sufficient.
The logic in swiotlb_alloc_tlb() is taken from __dma_direct_alloc_pages(),
simplified and enhanced to use coherent memory pools if needed.
Note that this is not the most efficient way to provide a bounce buffer,
but when a DMA buffer can't be mapped, something may (and will) actually
break. At that point it is better to make an allocation, even if it may be
an expensive operation.
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Reviewed-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:01 +00:00
|
|
|
if (swiotlb_del_transient(dev, tlb_addr))
|
|
|
|
return;
|
2021-06-19 03:40:39 +00:00
|
|
|
swiotlb_release_slots(dev, tlb_addr);
|
|
|
|
}
|
|
|
|
|
2021-03-01 07:44:26 +00:00
|
|
|
void swiotlb_sync_single_for_device(struct device *dev, phys_addr_t tlb_addr,
|
|
|
|
size_t size, enum dma_data_direction dir)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
Revert "swiotlb: rework "fix info leak with DMA_FROM_DEVICE""
This reverts commit aa6f8dcbab473f3a3c7454b74caa46d36cdc5d13.
It turns out this breaks at least the ath9k wireless driver, and
possibly others.
What the ath9k driver does on packet receive is to set up the DMA
transfer with:
int ath_rx_init(..)
..
bf->bf_buf_addr = dma_map_single(sc->dev, skb->data,
common->rx_bufsize,
DMA_FROM_DEVICE);
and then the receive logic (through ath_rx_tasklet()) will fetch
incoming packets
static bool ath_edma_get_buffers(..)
..
dma_sync_single_for_cpu(sc->dev, bf->bf_buf_addr,
common->rx_bufsize, DMA_FROM_DEVICE);
ret = ath9k_hw_process_rxdesc_edma(ah, rs, skb->data);
if (ret == -EINPROGRESS) {
/*let device gain the buffer again*/
dma_sync_single_for_device(sc->dev, bf->bf_buf_addr,
common->rx_bufsize, DMA_FROM_DEVICE);
return false;
}
and it's worth noting how that first DMA sync:
dma_sync_single_for_cpu(..DMA_FROM_DEVICE);
is there to make sure the CPU can read the DMA buffer (possibly by
copying it from the bounce buffer area, or by doing some cache flush).
The iommu correctly turns that into a "copy from bounce bufer" so that
the driver can look at the state of the packets.
In the meantime, the device may continue to write to the DMA buffer, but
we at least have a snapshot of the state due to that first DMA sync.
But that _second_ DMA sync:
dma_sync_single_for_device(..DMA_FROM_DEVICE);
is telling the DMA mapping that the CPU wasn't interested in the area
because the packet wasn't there. In the case of a DMA bounce buffer,
that is a no-op.
Note how it's not a sync for the CPU (the "for_device()" part), and it's
not a sync for data written by the CPU (the "DMA_FROM_DEVICE" part).
Or rather, it _should_ be a no-op. That's what commit aa6f8dcbab47
broke: it made the code bounce the buffer unconditionally, and changed
the DMA_FROM_DEVICE to just unconditionally and illogically be
DMA_TO_DEVICE.
[ Side note: purely within the confines of the swiotlb driver it wasn't
entirely illogical: The reason it did that odd DMA_FROM_DEVICE ->
DMA_TO_DEVICE conversion thing is because inside the swiotlb driver,
it uses just a swiotlb_bounce() helper that doesn't care about the
whole distinction of who the sync is for - only which direction to
bounce.
So it took the "sync for device" to mean that the CPU must have been
the one writing, and thought it meant DMA_TO_DEVICE. ]
Also note how the commentary in that commit was wrong, probably due to
that whole confusion, claiming that the commit makes the swiotlb code
"bounce unconditionally (that is, also
when dir == DMA_TO_DEVICE) in order do avoid synchronising back stale
data from the swiotlb buffer"
which is nonsensical for two reasons:
- that "also when dir == DMA_TO_DEVICE" is nonsensical, as that was
exactly when it always did - and should do - the bounce.
- since this is a sync for the device (not for the CPU), we're clearly
fundamentally not coping back stale data from the bounce buffers at
all, because we'd be copying *to* the bounce buffers.
So that commit was just very confused. It confused the direction of the
synchronization (to the device, not the cpu) with the direction of the
DMA (from the device).
Reported-and-bisected-by: Oleksandr Natalenko <oleksandr@natalenko.name>
Reported-by: Olha Cherevyk <olha.cherevyk@gmail.com>
Cc: Halil Pasic <pasic@linux.ibm.com>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Kalle Valo <kvalo@kernel.org>
Cc: Robin Murphy <robin.murphy@arm.com>
Cc: Toke Høiland-Jørgensen <toke@toke.dk>
Cc: Maxime Bizon <mbizon@freebox.fr>
Cc: Johannes Berg <johannes@sipsolutions.net>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2022-03-26 17:42:04 +00:00
|
|
|
if (dir == DMA_TO_DEVICE || dir == DMA_BIDIRECTIONAL)
|
|
|
|
swiotlb_bounce(dev, tlb_addr, size, DMA_TO_DEVICE);
|
|
|
|
else
|
|
|
|
BUG_ON(dir != DMA_FROM_DEVICE);
|
2021-03-01 07:44:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void swiotlb_sync_single_for_cpu(struct device *dev, phys_addr_t tlb_addr,
|
|
|
|
size_t size, enum dma_data_direction dir)
|
|
|
|
{
|
|
|
|
if (dir == DMA_FROM_DEVICE || dir == DMA_BIDIRECTIONAL)
|
|
|
|
swiotlb_bounce(dev, tlb_addr, size, DMA_FROM_DEVICE);
|
|
|
|
else
|
|
|
|
BUG_ON(dir != DMA_TO_DEVICE);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2018-12-03 10:43:54 +00:00
|
|
|
/*
|
2020-02-03 13:44:38 +00:00
|
|
|
* Create a swiotlb mapping for the buffer at @paddr, and in case of DMAing
|
2018-12-03 10:43:54 +00:00
|
|
|
* to the device copy the data into it as well.
|
|
|
|
*/
|
2020-02-03 13:44:38 +00:00
|
|
|
dma_addr_t swiotlb_map(struct device *dev, phys_addr_t paddr, size_t size,
|
|
|
|
enum dma_data_direction dir, unsigned long attrs)
|
2018-08-20 14:21:10 +00:00
|
|
|
{
|
2020-02-03 13:44:38 +00:00
|
|
|
phys_addr_t swiotlb_addr;
|
|
|
|
dma_addr_t dma_addr;
|
2018-08-20 14:21:10 +00:00
|
|
|
|
2022-03-29 15:27:33 +00:00
|
|
|
trace_swiotlb_bounced(dev, phys_to_dma(dev, paddr), size);
|
2018-08-20 14:21:10 +00:00
|
|
|
|
2021-09-29 02:32:59 +00:00
|
|
|
swiotlb_addr = swiotlb_tbl_map_single(dev, paddr, size, size, 0, dir,
|
2020-10-23 06:33:09 +00:00
|
|
|
attrs);
|
2020-02-03 13:44:38 +00:00
|
|
|
if (swiotlb_addr == (phys_addr_t)DMA_MAPPING_ERROR)
|
|
|
|
return DMA_MAPPING_ERROR;
|
2018-08-20 14:21:10 +00:00
|
|
|
|
|
|
|
/* Ensure that the address returned is DMA'ble */
|
2020-08-17 15:34:03 +00:00
|
|
|
dma_addr = phys_to_dma_unencrypted(dev, swiotlb_addr);
|
2020-02-03 13:44:38 +00:00
|
|
|
if (unlikely(!dma_capable(dev, dma_addr, size, true))) {
|
2021-03-01 07:44:24 +00:00
|
|
|
swiotlb_tbl_unmap_single(dev, swiotlb_addr, size, dir,
|
2018-08-20 14:21:10 +00:00
|
|
|
attrs | DMA_ATTR_SKIP_CPU_SYNC);
|
2020-02-03 13:44:38 +00:00
|
|
|
dev_WARN_ONCE(dev, 1,
|
|
|
|
"swiotlb addr %pad+%zu overflow (mask %llx, bus limit %llx).\n",
|
|
|
|
&dma_addr, size, *dev->dma_mask, dev->bus_dma_limit);
|
|
|
|
return DMA_MAPPING_ERROR;
|
2018-10-19 06:51:53 +00:00
|
|
|
}
|
|
|
|
|
2020-02-03 13:44:38 +00:00
|
|
|
if (!dev_is_dma_coherent(dev) && !(attrs & DMA_ATTR_SKIP_CPU_SYNC))
|
|
|
|
arch_sync_dma_for_device(swiotlb_addr, size, dir);
|
|
|
|
return dma_addr;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2019-02-07 11:59:13 +00:00
|
|
|
size_t swiotlb_max_mapping_size(struct device *dev)
|
|
|
|
{
|
2022-05-10 14:21:09 +00:00
|
|
|
int min_align_mask = dma_get_min_align_mask(dev);
|
|
|
|
int min_align = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* swiotlb_find_slots() skips slots according to
|
|
|
|
* min align mask. This affects max mapping size.
|
|
|
|
* Take it into acount here.
|
|
|
|
*/
|
|
|
|
if (min_align_mask)
|
|
|
|
min_align = roundup(min_align_mask, IO_TLB_SIZE);
|
|
|
|
|
|
|
|
return ((size_t)IO_TLB_SIZE) * IO_TLB_SEGSIZE - min_align;
|
2019-02-07 11:59:13 +00:00
|
|
|
}
|
2019-02-07 11:59:14 +00:00
|
|
|
|
2023-08-01 06:23:57 +00:00
|
|
|
/**
|
|
|
|
* is_swiotlb_allocated() - check if the default software IO TLB is initialized
|
|
|
|
*/
|
|
|
|
bool is_swiotlb_allocated(void)
|
|
|
|
{
|
|
|
|
return io_tlb_default_mem.nslabs;
|
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:36 +00:00
|
|
|
bool is_swiotlb_active(struct device *dev)
|
2019-02-07 11:59:14 +00:00
|
|
|
{
|
2021-07-20 13:38:24 +00:00
|
|
|
struct io_tlb_mem *mem = dev->dma_io_tlb_mem;
|
|
|
|
|
|
|
|
return mem && mem->nslabs;
|
2019-02-07 11:59:14 +00:00
|
|
|
}
|
2019-03-10 19:47:57 +00:00
|
|
|
|
2023-08-01 06:23:57 +00:00
|
|
|
/**
|
|
|
|
* default_swiotlb_base() - get the base address of the default SWIOTLB
|
|
|
|
*
|
|
|
|
* Get the lowest physical address used by the default software IO TLB pool.
|
|
|
|
*/
|
|
|
|
phys_addr_t default_swiotlb_base(void)
|
|
|
|
{
|
2023-08-01 06:24:00 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
io_tlb_default_mem.can_grow = false;
|
|
|
|
#endif
|
2023-08-01 06:23:59 +00:00
|
|
|
return io_tlb_default_mem.defpool.start;
|
2023-08-01 06:23:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* default_swiotlb_limit() - get the address limit of the default SWIOTLB
|
|
|
|
*
|
|
|
|
* Get the highest physical address used by the default software IO TLB pool.
|
|
|
|
*/
|
|
|
|
phys_addr_t default_swiotlb_limit(void)
|
|
|
|
{
|
2023-08-01 06:24:02 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
return io_tlb_default_mem.phys_limit;
|
|
|
|
#else
|
2023-08-01 06:23:59 +00:00
|
|
|
return io_tlb_default_mem.defpool.end - 1;
|
2023-08-01 06:24:02 +00:00
|
|
|
#endif
|
2023-08-01 06:23:57 +00:00
|
|
|
}
|
|
|
|
|
2023-04-20 09:58:58 +00:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
2024-01-09 07:04:56 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
static unsigned long mem_transient_used(struct io_tlb_mem *mem)
|
|
|
|
{
|
|
|
|
return atomic_long_read(&mem->transient_nslabs);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int io_tlb_transient_used_get(void *data, u64 *val)
|
|
|
|
{
|
|
|
|
struct io_tlb_mem *mem = data;
|
|
|
|
|
|
|
|
*val = mem_transient_used(mem);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
DEFINE_DEBUGFS_ATTRIBUTE(fops_io_tlb_transient_used, io_tlb_transient_used_get,
|
|
|
|
NULL, "%llu\n");
|
|
|
|
#endif /* CONFIG_SWIOTLB_DYNAMIC */
|
2023-04-20 09:58:58 +00:00
|
|
|
|
2022-07-28 07:24:20 +00:00
|
|
|
static int io_tlb_used_get(void *data, u64 *val)
|
|
|
|
{
|
2023-04-13 15:37:30 +00:00
|
|
|
struct io_tlb_mem *mem = data;
|
|
|
|
|
|
|
|
*val = mem_used(mem);
|
2022-07-28 07:24:20 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2023-04-13 17:57:37 +00:00
|
|
|
|
|
|
|
static int io_tlb_hiwater_get(void *data, u64 *val)
|
|
|
|
{
|
|
|
|
struct io_tlb_mem *mem = data;
|
|
|
|
|
|
|
|
*val = atomic_long_read(&mem->used_hiwater);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int io_tlb_hiwater_set(void *data, u64 val)
|
|
|
|
{
|
|
|
|
struct io_tlb_mem *mem = data;
|
|
|
|
|
|
|
|
/* Only allow setting to zero */
|
|
|
|
if (val != 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
atomic_long_set(&mem->used_hiwater, val);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2022-07-28 07:24:20 +00:00
|
|
|
DEFINE_DEBUGFS_ATTRIBUTE(fops_io_tlb_used, io_tlb_used_get, NULL, "%llu\n");
|
2023-04-13 17:57:37 +00:00
|
|
|
DEFINE_DEBUGFS_ATTRIBUTE(fops_io_tlb_hiwater, io_tlb_hiwater_get,
|
|
|
|
io_tlb_hiwater_set, "%llu\n");
|
2022-07-28 07:24:20 +00:00
|
|
|
|
2022-01-24 16:40:17 +00:00
|
|
|
static void swiotlb_create_debugfs_files(struct io_tlb_mem *mem,
|
|
|
|
const char *dirname)
|
2019-01-18 07:10:27 +00:00
|
|
|
{
|
2023-04-13 17:57:37 +00:00
|
|
|
atomic_long_set(&mem->total_used, 0);
|
|
|
|
atomic_long_set(&mem->used_hiwater, 0);
|
|
|
|
|
2022-01-24 16:40:17 +00:00
|
|
|
mem->debugfs = debugfs_create_dir(dirname, io_tlb_default_mem.debugfs);
|
|
|
|
if (!mem->nslabs)
|
|
|
|
return;
|
|
|
|
|
2021-03-18 16:14:22 +00:00
|
|
|
debugfs_create_ulong("io_tlb_nslabs", 0400, mem->debugfs, &mem->nslabs);
|
2023-04-13 15:37:30 +00:00
|
|
|
debugfs_create_file("io_tlb_used", 0400, mem->debugfs, mem,
|
2022-07-28 07:24:20 +00:00
|
|
|
&fops_io_tlb_used);
|
2023-04-13 17:57:37 +00:00
|
|
|
debugfs_create_file("io_tlb_used_hiwater", 0600, mem->debugfs, mem,
|
|
|
|
&fops_io_tlb_hiwater);
|
2024-01-09 07:04:56 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
atomic_long_set(&mem->transient_nslabs, 0);
|
|
|
|
debugfs_create_file("io_tlb_transient_nslabs", 0400, mem->debugfs,
|
|
|
|
mem, &fops_io_tlb_transient_used);
|
|
|
|
#endif
|
2021-06-19 03:40:33 +00:00
|
|
|
}
|
|
|
|
|
2023-04-20 09:58:58 +00:00
|
|
|
static int __init swiotlb_create_default_debugfs(void)
|
2021-06-19 03:40:33 +00:00
|
|
|
{
|
2022-01-24 16:40:17 +00:00
|
|
|
swiotlb_create_debugfs_files(&io_tlb_default_mem, "swiotlb");
|
2019-01-18 07:10:27 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:33 +00:00
|
|
|
late_initcall(swiotlb_create_default_debugfs);
|
2023-04-20 09:58:58 +00:00
|
|
|
|
|
|
|
#else /* !CONFIG_DEBUG_FS */
|
|
|
|
|
|
|
|
static inline void swiotlb_create_debugfs_files(struct io_tlb_mem *mem,
|
|
|
|
const char *dirname)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_DEBUG_FS */
|
2021-06-19 03:40:40 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_DMA_RESTRICTED_POOL
|
2021-07-01 03:31:30 +00:00
|
|
|
|
2021-06-19 03:40:40 +00:00
|
|
|
struct page *swiotlb_alloc(struct device *dev, size_t size)
|
|
|
|
{
|
|
|
|
struct io_tlb_mem *mem = dev->dma_io_tlb_mem;
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *pool;
|
2021-06-19 03:40:40 +00:00
|
|
|
phys_addr_t tlb_addr;
|
2024-03-08 15:28:26 +00:00
|
|
|
unsigned int align;
|
2021-06-19 03:40:40 +00:00
|
|
|
int index;
|
|
|
|
|
|
|
|
if (!mem)
|
|
|
|
return NULL;
|
|
|
|
|
2024-03-08 15:28:26 +00:00
|
|
|
align = (1 << (get_order(size) + PAGE_SHIFT)) - 1;
|
|
|
|
index = swiotlb_find_slots(dev, 0, size, align, &pool);
|
2021-06-19 03:40:40 +00:00
|
|
|
if (index == -1)
|
|
|
|
return NULL;
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
tlb_addr = slot_addr(pool->start, index);
|
2024-03-08 15:28:25 +00:00
|
|
|
if (unlikely(!PAGE_ALIGNED(tlb_addr))) {
|
|
|
|
dev_WARN_ONCE(dev, 1, "Cannot allocate pages from non page-aligned swiotlb addr 0x%pa.\n",
|
|
|
|
&tlb_addr);
|
|
|
|
swiotlb_release_slots(dev, tlb_addr);
|
|
|
|
return NULL;
|
|
|
|
}
|
2021-06-19 03:40:40 +00:00
|
|
|
|
|
|
|
return pfn_to_page(PFN_DOWN(tlb_addr));
|
|
|
|
}
|
|
|
|
|
|
|
|
bool swiotlb_free(struct device *dev, struct page *page, size_t size)
|
|
|
|
{
|
|
|
|
phys_addr_t tlb_addr = page_to_phys(page);
|
|
|
|
|
|
|
|
if (!is_swiotlb_buffer(dev, tlb_addr))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
swiotlb_release_slots(dev, tlb_addr);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:41 +00:00
|
|
|
static int rmem_swiotlb_device_init(struct reserved_mem *rmem,
|
|
|
|
struct device *dev)
|
|
|
|
{
|
|
|
|
struct io_tlb_mem *mem = rmem->priv;
|
|
|
|
unsigned long nslabs = rmem->size >> IO_TLB_SHIFT;
|
|
|
|
|
2022-07-08 16:15:44 +00:00
|
|
|
/* Set Per-device io tlb area to one */
|
|
|
|
unsigned int nareas = 1;
|
|
|
|
|
2023-04-14 21:29:25 +00:00
|
|
|
if (PageHighMem(pfn_to_page(PHYS_PFN(rmem->base)))) {
|
|
|
|
dev_err(dev, "Restricted DMA pool must be accessible within the linear mapping.");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:41 +00:00
|
|
|
/*
|
|
|
|
* Since multiple devices can share the same pool, the private data,
|
|
|
|
* io_tlb_mem struct, will be initialized by the first device attached
|
|
|
|
* to it.
|
|
|
|
*/
|
|
|
|
if (!mem) {
|
2023-08-01 06:23:59 +00:00
|
|
|
struct io_tlb_pool *pool;
|
|
|
|
|
2021-07-20 13:38:24 +00:00
|
|
|
mem = kzalloc(sizeof(*mem), GFP_KERNEL);
|
2021-06-19 03:40:41 +00:00
|
|
|
if (!mem)
|
|
|
|
return -ENOMEM;
|
2023-08-01 06:23:59 +00:00
|
|
|
pool = &mem->defpool;
|
2021-06-19 03:40:41 +00:00
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
pool->slots = kcalloc(nslabs, sizeof(*pool->slots), GFP_KERNEL);
|
|
|
|
if (!pool->slots) {
|
2021-07-20 13:38:24 +00:00
|
|
|
kfree(mem);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2023-08-01 06:23:59 +00:00
|
|
|
pool->areas = kcalloc(nareas, sizeof(*pool->areas),
|
2022-07-08 16:15:44 +00:00
|
|
|
GFP_KERNEL);
|
2023-08-01 06:23:59 +00:00
|
|
|
if (!pool->areas) {
|
|
|
|
kfree(pool->slots);
|
2022-07-15 08:19:50 +00:00
|
|
|
kfree(mem);
|
2022-07-08 16:15:44 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2021-06-19 03:40:41 +00:00
|
|
|
set_memory_decrypted((unsigned long)phys_to_virt(rmem->base),
|
|
|
|
rmem->size >> PAGE_SHIFT);
|
2023-08-01 06:23:59 +00:00
|
|
|
swiotlb_init_io_tlb_pool(pool, rmem->base, nslabs,
|
|
|
|
false, nareas);
|
|
|
|
mem->force_bounce = true;
|
2021-06-19 03:40:41 +00:00
|
|
|
mem->for_alloc = true;
|
swiotlb: allocate a new memory pool when existing pools are full
When swiotlb_find_slots() cannot find suitable slots, schedule the
allocation of a new memory pool. It is not possible to allocate the pool
immediately, because this code may run in interrupt context, which is not
suitable for large memory allocations. This means that the memory pool will
be available too late for the currently requested mapping, but the stress
on the software IO TLB allocator is likely to continue, and subsequent
allocations will benefit from the additional pool eventually.
Keep all memory pools for an allocator in an RCU list to avoid locking on
the read side. For modifications, add a new spinlock to struct io_tlb_mem.
The spinlock also protects updates to the total number of slabs (nslabs in
struct io_tlb_mem), but not reads of the value. Readers may therefore
encounter a stale value, but this is not an issue:
- swiotlb_tbl_map_single() and is_swiotlb_active() only check for non-zero
value. This is ensured by the existence of the default memory pool,
allocated at boot.
- The exact value is used only for non-critical purposes (debugfs, kernel
messages).
Signed-off-by: Petr Tesarik <petr.tesarik.ext@huawei.com>
Signed-off-by: Christoph Hellwig <hch@lst.de>
2023-08-01 06:24:03 +00:00
|
|
|
#ifdef CONFIG_SWIOTLB_DYNAMIC
|
|
|
|
spin_lock_init(&mem->lock);
|
|
|
|
#endif
|
|
|
|
add_mem_pool(mem, pool);
|
2021-06-19 03:40:41 +00:00
|
|
|
|
|
|
|
rmem->priv = mem;
|
|
|
|
|
2022-01-24 16:40:17 +00:00
|
|
|
swiotlb_create_debugfs_files(mem, rmem->name);
|
2021-06-19 03:40:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
dev->dma_io_tlb_mem = mem;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void rmem_swiotlb_device_release(struct reserved_mem *rmem,
|
|
|
|
struct device *dev)
|
|
|
|
{
|
2021-07-20 13:38:24 +00:00
|
|
|
dev->dma_io_tlb_mem = &io_tlb_default_mem;
|
2021-06-19 03:40:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static const struct reserved_mem_ops rmem_swiotlb_ops = {
|
|
|
|
.device_init = rmem_swiotlb_device_init,
|
|
|
|
.device_release = rmem_swiotlb_device_release,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init rmem_swiotlb_setup(struct reserved_mem *rmem)
|
|
|
|
{
|
|
|
|
unsigned long node = rmem->fdt_node;
|
|
|
|
|
|
|
|
if (of_get_flat_dt_prop(node, "reusable", NULL) ||
|
|
|
|
of_get_flat_dt_prop(node, "linux,cma-default", NULL) ||
|
|
|
|
of_get_flat_dt_prop(node, "linux,dma-default", NULL) ||
|
|
|
|
of_get_flat_dt_prop(node, "no-map", NULL))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
rmem->ops = &rmem_swiotlb_ops;
|
|
|
|
pr_info("Reserved memory: created restricted DMA pool at %pa, size %ld MiB\n",
|
|
|
|
&rmem->base, (unsigned long)rmem->size / SZ_1M);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
RESERVEDMEM_OF_DECLARE(dma, "restricted-dma-pool", rmem_swiotlb_setup);
|
2021-06-19 03:40:40 +00:00
|
|
|
#endif /* CONFIG_DMA_RESTRICTED_POOL */
|