b24413180f
Many source files in the tree are missing licensing information, which makes it harder for compliance tools to determine the correct license. By default all files without license information are under the default license of the kernel, which is GPL version 2. Update the files which contain no license information with the 'GPL-2.0' SPDX license identifier. The SPDX identifier is a legally binding shorthand, which can be used instead of the full boiler plate text. This patch is based on work done by Thomas Gleixner and Kate Stewart and Philippe Ombredanne. How this work was done: Patches were generated and checked against linux-4.14-rc6 for a subset of the use cases: - file had no licensing information it it. - file was a */uapi/* one with no licensing information in it, - file was a */uapi/* one with existing licensing information, Further patches will be generated in subsequent months to fix up cases where non-standard license headers were used, and references to license had to be inferred by heuristics based on keywords. The analysis to determine which SPDX License Identifier to be applied to a file was done in a spreadsheet of side by side results from of the output of two independent scanners (ScanCode & Windriver) producing SPDX tag:value files created by Philippe Ombredanne. Philippe prepared the base worksheet, and did an initial spot review of a few 1000 files. The 4.13 kernel was the starting point of the analysis with 60,537 files assessed. Kate Stewart did a file by file comparison of the scanner results in the spreadsheet to determine which SPDX license identifier(s) to be applied to the file. She confirmed any determination that was not immediately clear with lawyers working with the Linux Foundation. Criteria used to select files for SPDX license identifier tagging was: - Files considered eligible had to be source code files. - Make and config files were included as candidates if they contained >5 lines of source - File already had some variant of a license header in it (even if <5 lines). All documentation files were explicitly excluded. The following heuristics were used to determine which SPDX license identifiers to apply. - when both scanners couldn't find any license traces, file was considered to have no license information in it, and the top level COPYING file license applied. For non */uapi/* files that summary was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 11139 and resulted in the first patch in this series. If that file was a */uapi/* path one, it was "GPL-2.0 WITH Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 WITH Linux-syscall-note 930 and resulted in the second patch in this series. - if a file had some form of licensing information in it, and was one of the */uapi/* ones, it was denoted with the Linux-syscall-note if any GPL family license was found in the file or had no licensing in it (per prior point). Results summary: SPDX license identifier # files ---------------------------------------------------|------ GPL-2.0 WITH Linux-syscall-note 270 GPL-2.0+ WITH Linux-syscall-note 169 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17 LGPL-2.1+ WITH Linux-syscall-note 15 GPL-1.0+ WITH Linux-syscall-note 14 ((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5 LGPL-2.0+ WITH Linux-syscall-note 4 LGPL-2.1 WITH Linux-syscall-note 3 ((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3 ((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1 and that resulted in the third patch in this series. - when the two scanners agreed on the detected license(s), that became the concluded license(s). - when there was disagreement between the two scanners (one detected a license but the other didn't, or they both detected different licenses) a manual inspection of the file occurred. - In most cases a manual inspection of the information in the file resulted in a clear resolution of the license that should apply (and which scanner probably needed to revisit its heuristics). - When it was not immediately clear, the license identifier was confirmed with lawyers working with the Linux Foundation. - If there was any question as to the appropriate license identifier, the file was flagged for further research and to be revisited later in time. In total, over 70 hours of logged manual review was done on the spreadsheet to determine the SPDX license identifiers to apply to the source files by Kate, Philippe, Thomas and, in some cases, confirmation by lawyers working with the Linux Foundation. Kate also obtained a third independent scan of the 4.13 code base from FOSSology, and compared selected files where the other two scanners disagreed against that SPDX file, to see if there was new insights. The Windriver scanner is based on an older version of FOSSology in part, so they are related. Thomas did random spot checks in about 500 files from the spreadsheets for the uapi headers and agreed with SPDX license identifier in the files he inspected. For the non-uapi files Thomas did random spot checks in about 15000 files. In initial set of patches against 4.14-rc6, 3 files were found to have copy/paste license identifier errors, and have been fixed to reflect the correct identifier. Additionally Philippe spent 10 hours this week doing a detailed manual inspection and review of the 12,461 patched files from the initial patch version early this week with: - a full scancode scan run, collecting the matched texts, detected license ids and scores - reviewing anything where there was a license detected (about 500+ files) to ensure that the applied SPDX license was correct - reviewing anything where there was no detection but the patch license was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied SPDX license was correct This produced a worksheet with 20 files needing minor correction. This worksheet was then exported into 3 different .csv files for the different types of files to be modified. These .csv files were then reviewed by Greg. Thomas wrote a script to parse the csv files and add the proper SPDX tag to the file, in the format that the file expected. This script was further refined by Greg based on the output to detect more types of files automatically and to distinguish between header and source .c files (which need different comment types.) Finally Greg ran the script using the .csv files to generate the patches. Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com> Reviewed-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
339 lines
8.0 KiB
C
339 lines
8.0 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/*
|
|
* Copyright (c) 2015 Oracle. All rights reserved.
|
|
* Copyright (c) 2003-2007 Network Appliance, Inc. All rights reserved.
|
|
*/
|
|
|
|
/* Lightweight memory registration using Fast Memory Regions (FMR).
|
|
* Referred to sometimes as MTHCAFMR mode.
|
|
*
|
|
* FMR uses synchronous memory registration and deregistration.
|
|
* FMR registration is known to be fast, but FMR deregistration
|
|
* can take tens of usecs to complete.
|
|
*/
|
|
|
|
/* Normal operation
|
|
*
|
|
* A Memory Region is prepared for RDMA READ or WRITE using the
|
|
* ib_map_phys_fmr verb (fmr_op_map). When the RDMA operation is
|
|
* finished, the Memory Region is unmapped using the ib_unmap_fmr
|
|
* verb (fmr_op_unmap).
|
|
*/
|
|
|
|
#include "xprt_rdma.h"
|
|
|
|
#if IS_ENABLED(CONFIG_SUNRPC_DEBUG)
|
|
# define RPCDBG_FACILITY RPCDBG_TRANS
|
|
#endif
|
|
|
|
/* Maximum scatter/gather per FMR */
|
|
#define RPCRDMA_MAX_FMR_SGES (64)
|
|
|
|
/* Access mode of externally registered pages */
|
|
enum {
|
|
RPCRDMA_FMR_ACCESS_FLAGS = IB_ACCESS_REMOTE_WRITE |
|
|
IB_ACCESS_REMOTE_READ,
|
|
};
|
|
|
|
bool
|
|
fmr_is_supported(struct rpcrdma_ia *ia)
|
|
{
|
|
if (!ia->ri_device->alloc_fmr) {
|
|
pr_info("rpcrdma: 'fmr' mode is not supported by device %s\n",
|
|
ia->ri_device->name);
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
static int
|
|
fmr_op_init_mr(struct rpcrdma_ia *ia, struct rpcrdma_mw *mw)
|
|
{
|
|
static struct ib_fmr_attr fmr_attr = {
|
|
.max_pages = RPCRDMA_MAX_FMR_SGES,
|
|
.max_maps = 1,
|
|
.page_shift = PAGE_SHIFT
|
|
};
|
|
|
|
mw->fmr.fm_physaddrs = kcalloc(RPCRDMA_MAX_FMR_SGES,
|
|
sizeof(u64), GFP_KERNEL);
|
|
if (!mw->fmr.fm_physaddrs)
|
|
goto out_free;
|
|
|
|
mw->mw_sg = kcalloc(RPCRDMA_MAX_FMR_SGES,
|
|
sizeof(*mw->mw_sg), GFP_KERNEL);
|
|
if (!mw->mw_sg)
|
|
goto out_free;
|
|
|
|
sg_init_table(mw->mw_sg, RPCRDMA_MAX_FMR_SGES);
|
|
|
|
mw->fmr.fm_mr = ib_alloc_fmr(ia->ri_pd, RPCRDMA_FMR_ACCESS_FLAGS,
|
|
&fmr_attr);
|
|
if (IS_ERR(mw->fmr.fm_mr))
|
|
goto out_fmr_err;
|
|
|
|
return 0;
|
|
|
|
out_fmr_err:
|
|
dprintk("RPC: %s: ib_alloc_fmr returned %ld\n", __func__,
|
|
PTR_ERR(mw->fmr.fm_mr));
|
|
|
|
out_free:
|
|
kfree(mw->mw_sg);
|
|
kfree(mw->fmr.fm_physaddrs);
|
|
return -ENOMEM;
|
|
}
|
|
|
|
static int
|
|
__fmr_unmap(struct rpcrdma_mw *mw)
|
|
{
|
|
LIST_HEAD(l);
|
|
int rc;
|
|
|
|
list_add(&mw->fmr.fm_mr->list, &l);
|
|
rc = ib_unmap_fmr(&l);
|
|
list_del(&mw->fmr.fm_mr->list);
|
|
return rc;
|
|
}
|
|
|
|
static void
|
|
fmr_op_release_mr(struct rpcrdma_mw *r)
|
|
{
|
|
LIST_HEAD(unmap_list);
|
|
int rc;
|
|
|
|
/* Ensure MW is not on any rl_registered list */
|
|
if (!list_empty(&r->mw_list))
|
|
list_del(&r->mw_list);
|
|
|
|
kfree(r->fmr.fm_physaddrs);
|
|
kfree(r->mw_sg);
|
|
|
|
/* In case this one was left mapped, try to unmap it
|
|
* to prevent dealloc_fmr from failing with EBUSY
|
|
*/
|
|
rc = __fmr_unmap(r);
|
|
if (rc)
|
|
pr_err("rpcrdma: final ib_unmap_fmr for %p failed %i\n",
|
|
r, rc);
|
|
|
|
rc = ib_dealloc_fmr(r->fmr.fm_mr);
|
|
if (rc)
|
|
pr_err("rpcrdma: final ib_dealloc_fmr for %p returned %i\n",
|
|
r, rc);
|
|
|
|
kfree(r);
|
|
}
|
|
|
|
/* Reset of a single FMR.
|
|
*/
|
|
static void
|
|
fmr_op_recover_mr(struct rpcrdma_mw *mw)
|
|
{
|
|
struct rpcrdma_xprt *r_xprt = mw->mw_xprt;
|
|
int rc;
|
|
|
|
/* ORDER: invalidate first */
|
|
rc = __fmr_unmap(mw);
|
|
|
|
/* ORDER: then DMA unmap */
|
|
ib_dma_unmap_sg(r_xprt->rx_ia.ri_device,
|
|
mw->mw_sg, mw->mw_nents, mw->mw_dir);
|
|
if (rc)
|
|
goto out_release;
|
|
|
|
rpcrdma_put_mw(r_xprt, mw);
|
|
r_xprt->rx_stats.mrs_recovered++;
|
|
return;
|
|
|
|
out_release:
|
|
pr_err("rpcrdma: FMR reset failed (%d), %p released\n", rc, mw);
|
|
r_xprt->rx_stats.mrs_orphaned++;
|
|
|
|
spin_lock(&r_xprt->rx_buf.rb_mwlock);
|
|
list_del(&mw->mw_all);
|
|
spin_unlock(&r_xprt->rx_buf.rb_mwlock);
|
|
|
|
fmr_op_release_mr(mw);
|
|
}
|
|
|
|
static int
|
|
fmr_op_open(struct rpcrdma_ia *ia, struct rpcrdma_ep *ep,
|
|
struct rpcrdma_create_data_internal *cdata)
|
|
{
|
|
ia->ri_max_segs = max_t(unsigned int, 1, RPCRDMA_MAX_DATA_SEGS /
|
|
RPCRDMA_MAX_FMR_SGES);
|
|
return 0;
|
|
}
|
|
|
|
/* FMR mode conveys up to 64 pages of payload per chunk segment.
|
|
*/
|
|
static size_t
|
|
fmr_op_maxpages(struct rpcrdma_xprt *r_xprt)
|
|
{
|
|
return min_t(unsigned int, RPCRDMA_MAX_DATA_SEGS,
|
|
RPCRDMA_MAX_HDR_SEGS * RPCRDMA_MAX_FMR_SGES);
|
|
}
|
|
|
|
/* Use the ib_map_phys_fmr() verb to register a memory region
|
|
* for remote access via RDMA READ or RDMA WRITE.
|
|
*/
|
|
static struct rpcrdma_mr_seg *
|
|
fmr_op_map(struct rpcrdma_xprt *r_xprt, struct rpcrdma_mr_seg *seg,
|
|
int nsegs, bool writing, struct rpcrdma_mw **out)
|
|
{
|
|
struct rpcrdma_mr_seg *seg1 = seg;
|
|
int len, pageoff, i, rc;
|
|
struct rpcrdma_mw *mw;
|
|
u64 *dma_pages;
|
|
|
|
mw = rpcrdma_get_mw(r_xprt);
|
|
if (!mw)
|
|
return ERR_PTR(-ENOBUFS);
|
|
|
|
pageoff = offset_in_page(seg1->mr_offset);
|
|
seg1->mr_offset -= pageoff; /* start of page */
|
|
seg1->mr_len += pageoff;
|
|
len = -pageoff;
|
|
if (nsegs > RPCRDMA_MAX_FMR_SGES)
|
|
nsegs = RPCRDMA_MAX_FMR_SGES;
|
|
for (i = 0; i < nsegs;) {
|
|
if (seg->mr_page)
|
|
sg_set_page(&mw->mw_sg[i],
|
|
seg->mr_page,
|
|
seg->mr_len,
|
|
offset_in_page(seg->mr_offset));
|
|
else
|
|
sg_set_buf(&mw->mw_sg[i], seg->mr_offset,
|
|
seg->mr_len);
|
|
len += seg->mr_len;
|
|
++seg;
|
|
++i;
|
|
/* Check for holes */
|
|
if ((i < nsegs && offset_in_page(seg->mr_offset)) ||
|
|
offset_in_page((seg-1)->mr_offset + (seg-1)->mr_len))
|
|
break;
|
|
}
|
|
mw->mw_dir = rpcrdma_data_dir(writing);
|
|
|
|
mw->mw_nents = ib_dma_map_sg(r_xprt->rx_ia.ri_device,
|
|
mw->mw_sg, i, mw->mw_dir);
|
|
if (!mw->mw_nents)
|
|
goto out_dmamap_err;
|
|
|
|
for (i = 0, dma_pages = mw->fmr.fm_physaddrs; i < mw->mw_nents; i++)
|
|
dma_pages[i] = sg_dma_address(&mw->mw_sg[i]);
|
|
rc = ib_map_phys_fmr(mw->fmr.fm_mr, dma_pages, mw->mw_nents,
|
|
dma_pages[0]);
|
|
if (rc)
|
|
goto out_maperr;
|
|
|
|
mw->mw_handle = mw->fmr.fm_mr->rkey;
|
|
mw->mw_length = len;
|
|
mw->mw_offset = dma_pages[0] + pageoff;
|
|
|
|
*out = mw;
|
|
return seg;
|
|
|
|
out_dmamap_err:
|
|
pr_err("rpcrdma: failed to DMA map sg %p sg_nents %d\n",
|
|
mw->mw_sg, i);
|
|
rpcrdma_put_mw(r_xprt, mw);
|
|
return ERR_PTR(-EIO);
|
|
|
|
out_maperr:
|
|
pr_err("rpcrdma: ib_map_phys_fmr %u@0x%llx+%i (%d) status %i\n",
|
|
len, (unsigned long long)dma_pages[0],
|
|
pageoff, mw->mw_nents, rc);
|
|
ib_dma_unmap_sg(r_xprt->rx_ia.ri_device,
|
|
mw->mw_sg, mw->mw_nents, mw->mw_dir);
|
|
rpcrdma_put_mw(r_xprt, mw);
|
|
return ERR_PTR(-EIO);
|
|
}
|
|
|
|
/* Invalidate all memory regions that were registered for "req".
|
|
*
|
|
* Sleeps until it is safe for the host CPU to access the
|
|
* previously mapped memory regions.
|
|
*
|
|
* Caller ensures that @mws is not empty before the call. This
|
|
* function empties the list.
|
|
*/
|
|
static void
|
|
fmr_op_unmap_sync(struct rpcrdma_xprt *r_xprt, struct list_head *mws)
|
|
{
|
|
struct rpcrdma_mw *mw;
|
|
LIST_HEAD(unmap_list);
|
|
int rc;
|
|
|
|
/* ORDER: Invalidate all of the req's MRs first
|
|
*
|
|
* ib_unmap_fmr() is slow, so use a single call instead
|
|
* of one call per mapped FMR.
|
|
*/
|
|
list_for_each_entry(mw, mws, mw_list) {
|
|
dprintk("RPC: %s: unmapping fmr %p\n",
|
|
__func__, &mw->fmr);
|
|
list_add_tail(&mw->fmr.fm_mr->list, &unmap_list);
|
|
}
|
|
r_xprt->rx_stats.local_inv_needed++;
|
|
rc = ib_unmap_fmr(&unmap_list);
|
|
if (rc)
|
|
goto out_reset;
|
|
|
|
/* ORDER: Now DMA unmap all of the req's MRs, and return
|
|
* them to the free MW list.
|
|
*/
|
|
while (!list_empty(mws)) {
|
|
mw = rpcrdma_pop_mw(mws);
|
|
dprintk("RPC: %s: DMA unmapping fmr %p\n",
|
|
__func__, &mw->fmr);
|
|
list_del(&mw->fmr.fm_mr->list);
|
|
ib_dma_unmap_sg(r_xprt->rx_ia.ri_device,
|
|
mw->mw_sg, mw->mw_nents, mw->mw_dir);
|
|
rpcrdma_put_mw(r_xprt, mw);
|
|
}
|
|
|
|
return;
|
|
|
|
out_reset:
|
|
pr_err("rpcrdma: ib_unmap_fmr failed (%i)\n", rc);
|
|
|
|
while (!list_empty(mws)) {
|
|
mw = rpcrdma_pop_mw(mws);
|
|
list_del(&mw->fmr.fm_mr->list);
|
|
fmr_op_recover_mr(mw);
|
|
}
|
|
}
|
|
|
|
/* Use a slow, safe mechanism to invalidate all memory regions
|
|
* that were registered for "req".
|
|
*/
|
|
static void
|
|
fmr_op_unmap_safe(struct rpcrdma_xprt *r_xprt, struct rpcrdma_req *req,
|
|
bool sync)
|
|
{
|
|
struct rpcrdma_mw *mw;
|
|
|
|
while (!list_empty(&req->rl_registered)) {
|
|
mw = rpcrdma_pop_mw(&req->rl_registered);
|
|
if (sync)
|
|
fmr_op_recover_mr(mw);
|
|
else
|
|
rpcrdma_defer_mr_recovery(mw);
|
|
}
|
|
}
|
|
|
|
const struct rpcrdma_memreg_ops rpcrdma_fmr_memreg_ops = {
|
|
.ro_map = fmr_op_map,
|
|
.ro_unmap_sync = fmr_op_unmap_sync,
|
|
.ro_unmap_safe = fmr_op_unmap_safe,
|
|
.ro_recover_mr = fmr_op_recover_mr,
|
|
.ro_open = fmr_op_open,
|
|
.ro_maxpages = fmr_op_maxpages,
|
|
.ro_init_mr = fmr_op_init_mr,
|
|
.ro_release_mr = fmr_op_release_mr,
|
|
.ro_displayname = "fmr",
|
|
.ro_send_w_inv_ok = 0,
|
|
};
|