License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 22:07:57 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2017-03-17 11:17:32 +08:00
|
|
|
/*
|
|
|
|
* channel program interfaces
|
|
|
|
*
|
|
|
|
* Copyright IBM Corp. 2017
|
|
|
|
*
|
|
|
|
* Author(s): Dong Jia Shi <bjsdjshi@linux.vnet.ibm.com>
|
|
|
|
* Xiao Feng Ren <renxiaof@linux.vnet.ibm.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/iommu.h>
|
|
|
|
#include <linux/vfio.h>
|
|
|
|
#include <asm/idals.h>
|
|
|
|
|
|
|
|
#include "vfio_ccw_cp.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Max length for ccw chain.
|
|
|
|
* XXX: Limit to 256, need to check more?
|
|
|
|
*/
|
|
|
|
#define CCWCHAIN_LEN_MAX 256
|
|
|
|
|
|
|
|
struct pfn_array {
|
2018-05-23 10:56:42 +08:00
|
|
|
/* Starting guest physical I/O address. */
|
2017-03-17 11:17:32 +08:00
|
|
|
unsigned long pa_iova;
|
2018-05-23 10:56:42 +08:00
|
|
|
/* Array that stores PFNs of the pages need to pin. */
|
2017-03-17 11:17:32 +08:00
|
|
|
unsigned long *pa_iova_pfn;
|
2018-05-23 10:56:42 +08:00
|
|
|
/* Array that receives PFNs of the pages pinned. */
|
2017-03-17 11:17:32 +08:00
|
|
|
unsigned long *pa_pfn;
|
2018-05-23 10:56:43 +08:00
|
|
|
/* Number of pages pinned from @pa_iova. */
|
2017-03-17 11:17:32 +08:00
|
|
|
int pa_nr;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct pfn_array_table {
|
|
|
|
struct pfn_array *pat_pa;
|
|
|
|
int pat_nr;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ccwchain {
|
|
|
|
struct list_head next;
|
|
|
|
struct ccw1 *ch_ccw;
|
|
|
|
/* Guest physical address of the current chain. */
|
|
|
|
u64 ch_iova;
|
|
|
|
/* Count of the valid ccws in chain. */
|
|
|
|
int ch_len;
|
|
|
|
/* Pinned PAGEs for the original data. */
|
|
|
|
struct pfn_array_table *ch_pat;
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
2019-05-15 07:42:44 +08:00
|
|
|
* pfn_array_alloc() - alloc memory for PFNs
|
2017-03-17 11:17:32 +08:00
|
|
|
* @pa: pfn_array on which to perform the operation
|
2018-05-23 10:56:43 +08:00
|
|
|
* @iova: target guest physical address
|
|
|
|
* @len: number of bytes that should be pinned from @iova
|
2017-03-17 11:17:32 +08:00
|
|
|
*
|
2019-05-15 07:42:44 +08:00
|
|
|
* Attempt to allocate memory for PFNs.
|
2017-03-17 11:17:32 +08:00
|
|
|
*
|
|
|
|
* Usage of pfn_array:
|
2018-05-23 10:56:43 +08:00
|
|
|
* We expect (pa_nr == 0) and (pa_iova_pfn == NULL), any field in
|
|
|
|
* this structure will be filled in by this function.
|
2017-03-17 11:17:32 +08:00
|
|
|
*
|
|
|
|
* Returns:
|
2019-05-15 07:42:44 +08:00
|
|
|
* 0 if PFNs are allocated
|
|
|
|
* -EINVAL if pa->pa_nr is not initially zero, or pa->pa_iova_pfn is not NULL
|
|
|
|
* -ENOMEM if alloc failed
|
2017-03-17 11:17:32 +08:00
|
|
|
*/
|
2019-05-15 07:42:44 +08:00
|
|
|
static int pfn_array_alloc(struct pfn_array *pa, u64 iova, unsigned int len)
|
2017-03-17 11:17:32 +08:00
|
|
|
{
|
2019-05-15 07:42:44 +08:00
|
|
|
int i;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
2017-10-11 10:38:22 +08:00
|
|
|
if (!len)
|
|
|
|
return 0;
|
|
|
|
|
2018-05-23 10:56:43 +08:00
|
|
|
if (pa->pa_nr || pa->pa_iova_pfn)
|
2017-03-17 11:17:32 +08:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
pa->pa_iova = iova;
|
|
|
|
|
|
|
|
pa->pa_nr = ((iova & ~PAGE_MASK) + len + (PAGE_SIZE - 1)) >> PAGE_SHIFT;
|
|
|
|
if (!pa->pa_nr)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
pa->pa_iova_pfn = kcalloc(pa->pa_nr,
|
|
|
|
sizeof(*pa->pa_iova_pfn) +
|
|
|
|
sizeof(*pa->pa_pfn),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (unlikely(!pa->pa_iova_pfn))
|
|
|
|
return -ENOMEM;
|
|
|
|
pa->pa_pfn = pa->pa_iova_pfn + pa->pa_nr;
|
|
|
|
|
2018-05-23 10:56:43 +08:00
|
|
|
pa->pa_iova_pfn[0] = pa->pa_iova >> PAGE_SHIFT;
|
|
|
|
for (i = 1; i < pa->pa_nr; i++)
|
|
|
|
pa->pa_iova_pfn[i] = pa->pa_iova_pfn[i - 1] + 1;
|
|
|
|
|
2019-05-15 07:42:44 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* pfn_array_pin() - Pin user pages in memory
|
|
|
|
* @pa: pfn_array on which to perform the operation
|
|
|
|
* @mdev: the mediated device to perform pin operations
|
|
|
|
*
|
|
|
|
* Returns number of pages pinned upon success.
|
|
|
|
* If the pin request partially succeeds, or fails completely,
|
|
|
|
* all pages are left unpinned and a negative error value is returned.
|
|
|
|
*/
|
|
|
|
static int pfn_array_pin(struct pfn_array *pa, struct device *mdev)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
2018-05-23 10:56:43 +08:00
|
|
|
ret = vfio_pin_pages(mdev, pa->pa_iova_pfn, pa->pa_nr,
|
|
|
|
IOMMU_READ | IOMMU_WRITE, pa->pa_pfn);
|
2017-03-17 11:17:32 +08:00
|
|
|
|
2018-05-23 10:56:43 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
goto err_out;
|
|
|
|
} else if (ret > 0 && ret != pa->pa_nr) {
|
|
|
|
vfio_unpin_pages(mdev, pa->pa_iova_pfn, ret);
|
2017-03-17 11:17:32 +08:00
|
|
|
ret = -EINVAL;
|
2018-05-23 10:56:43 +08:00
|
|
|
goto err_out;
|
|
|
|
}
|
2017-03-17 11:17:32 +08:00
|
|
|
|
2018-05-23 10:56:43 +08:00
|
|
|
return ret;
|
|
|
|
|
|
|
|
err_out:
|
|
|
|
pa->pa_nr = 0;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2018-05-23 10:56:43 +08:00
|
|
|
/* Unpin the pages before releasing the memory. */
|
|
|
|
static void pfn_array_unpin_free(struct pfn_array *pa, struct device *mdev)
|
|
|
|
{
|
2019-05-15 07:42:44 +08:00
|
|
|
/* Only unpin if any pages were pinned to begin with */
|
|
|
|
if (pa->pa_nr)
|
|
|
|
vfio_unpin_pages(mdev, pa->pa_iova_pfn, pa->pa_nr);
|
2018-05-23 10:56:43 +08:00
|
|
|
pa->pa_nr = 0;
|
|
|
|
kfree(pa->pa_iova_pfn);
|
|
|
|
}
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
static int pfn_array_table_init(struct pfn_array_table *pat, int nr)
|
|
|
|
{
|
|
|
|
pat->pat_pa = kcalloc(nr, sizeof(*pat->pat_pa), GFP_KERNEL);
|
|
|
|
if (unlikely(ZERO_OR_NULL_PTR(pat->pat_pa))) {
|
|
|
|
pat->pat_nr = 0;
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
pat->pat_nr = nr;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void pfn_array_table_unpin_free(struct pfn_array_table *pat,
|
|
|
|
struct device *mdev)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < pat->pat_nr; i++)
|
|
|
|
pfn_array_unpin_free(pat->pat_pa + i, mdev);
|
|
|
|
|
|
|
|
if (pat->pat_nr) {
|
|
|
|
kfree(pat->pat_pa);
|
|
|
|
pat->pat_pa = NULL;
|
|
|
|
pat->pat_nr = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool pfn_array_table_iova_pinned(struct pfn_array_table *pat,
|
|
|
|
unsigned long iova)
|
|
|
|
{
|
|
|
|
struct pfn_array *pa = pat->pat_pa;
|
|
|
|
unsigned long iova_pfn = iova >> PAGE_SHIFT;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
for (i = 0; i < pat->pat_nr; i++, pa++)
|
|
|
|
for (j = 0; j < pa->pa_nr; j++)
|
2018-10-02 09:02:35 +08:00
|
|
|
if (pa->pa_iova_pfn[j] == iova_pfn)
|
2017-03-17 11:17:32 +08:00
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
/* Create the list idal words for a pfn_array_table. */
|
|
|
|
static inline void pfn_array_table_idal_create_words(
|
|
|
|
struct pfn_array_table *pat,
|
|
|
|
unsigned long *idaws)
|
|
|
|
{
|
|
|
|
struct pfn_array *pa;
|
|
|
|
int i, j, k;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Idal words (execept the first one) rely on the memory being 4k
|
|
|
|
* aligned. If a user virtual address is 4K aligned, then it's
|
|
|
|
* corresponding kernel physical address will also be 4K aligned. Thus
|
|
|
|
* there will be no problem here to simply use the phys to create an
|
|
|
|
* idaw.
|
|
|
|
*/
|
|
|
|
k = 0;
|
|
|
|
for (i = 0; i < pat->pat_nr; i++) {
|
|
|
|
pa = pat->pat_pa + i;
|
|
|
|
for (j = 0; j < pa->pa_nr; j++) {
|
|
|
|
idaws[k] = pa->pa_pfn[j] << PAGE_SHIFT;
|
|
|
|
if (k == 0)
|
|
|
|
idaws[k] += pa->pa_iova & (PAGE_SIZE - 1);
|
|
|
|
k++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Within the domain (@mdev), copy @n bytes from a guest physical
|
|
|
|
* address (@iova) to a host physical address (@to).
|
|
|
|
*/
|
|
|
|
static long copy_from_iova(struct device *mdev,
|
|
|
|
void *to, u64 iova,
|
|
|
|
unsigned long n)
|
|
|
|
{
|
|
|
|
struct pfn_array pa = {0};
|
|
|
|
u64 from;
|
|
|
|
int i, ret;
|
|
|
|
unsigned long l, m;
|
|
|
|
|
2019-05-15 07:42:44 +08:00
|
|
|
ret = pfn_array_alloc(&pa, iova, n);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
ret = pfn_array_pin(&pa, mdev);
|
|
|
|
if (ret < 0) {
|
|
|
|
pfn_array_unpin_free(&pa, mdev);
|
2017-03-17 11:17:32 +08:00
|
|
|
return ret;
|
2019-05-15 07:42:44 +08:00
|
|
|
}
|
2017-03-17 11:17:32 +08:00
|
|
|
|
|
|
|
l = n;
|
|
|
|
for (i = 0; i < pa.pa_nr; i++) {
|
|
|
|
from = pa.pa_pfn[i] << PAGE_SHIFT;
|
|
|
|
m = PAGE_SIZE;
|
|
|
|
if (i == 0) {
|
|
|
|
from += iova & (PAGE_SIZE - 1);
|
|
|
|
m -= iova & (PAGE_SIZE - 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
m = min(l, m);
|
|
|
|
memcpy(to + (n - l), (void *)from, m);
|
|
|
|
|
|
|
|
l -= m;
|
|
|
|
if (l == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
pfn_array_unpin_free(&pa, mdev);
|
|
|
|
|
|
|
|
return l;
|
|
|
|
}
|
|
|
|
|
|
|
|
static long copy_ccw_from_iova(struct channel_program *cp,
|
|
|
|
struct ccw1 *to, u64 iova,
|
|
|
|
unsigned long len)
|
|
|
|
{
|
2017-03-17 11:17:42 +08:00
|
|
|
struct ccw0 ccw0;
|
|
|
|
struct ccw1 *pccw1;
|
|
|
|
int ret;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
ret = copy_from_iova(cp->mdev, to, iova, len * sizeof(struct ccw1));
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
if (!cp->orb.cmd.fmt) {
|
|
|
|
pccw1 = to;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
ccw0 = *(struct ccw0 *)pccw1;
|
|
|
|
if ((pccw1->cmd_code & 0x0f) == CCW_CMD_TIC) {
|
|
|
|
pccw1->cmd_code = CCW_CMD_TIC;
|
|
|
|
pccw1->flags = 0;
|
|
|
|
pccw1->count = 0;
|
|
|
|
} else {
|
|
|
|
pccw1->cmd_code = ccw0.cmd_code;
|
|
|
|
pccw1->flags = ccw0.flags;
|
|
|
|
pccw1->count = ccw0.count;
|
|
|
|
}
|
|
|
|
pccw1->cda = ccw0.cda;
|
|
|
|
pccw1++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
2017-03-17 11:17:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Helpers to operate ccwchain.
|
|
|
|
*/
|
|
|
|
#define ccw_is_test(_ccw) (((_ccw)->cmd_code & 0x0F) == 0)
|
|
|
|
|
|
|
|
#define ccw_is_noop(_ccw) ((_ccw)->cmd_code == CCW_CMD_NOOP)
|
|
|
|
|
|
|
|
#define ccw_is_tic(_ccw) ((_ccw)->cmd_code == CCW_CMD_TIC)
|
|
|
|
|
|
|
|
#define ccw_is_idal(_ccw) ((_ccw)->flags & CCW_FLAG_IDA)
|
|
|
|
|
|
|
|
|
|
|
|
#define ccw_is_chain(_ccw) ((_ccw)->flags & (CCW_FLAG_CC | CCW_FLAG_DC))
|
|
|
|
|
s390/cio: Fix vfio-ccw handling of recursive TICs
The routine ccwchain_calc_length() is tasked with looking at a
channel program, seeing how many CCWs are chained together by
the presence of the Chain-Command flag, and returning a count
to the caller.
Previously, it also considered a Transfer-in-Channel CCW as being
an appropriate mechanism for chaining. The problem at the time
was that the TIC CCW will almost certainly not go to the next CCW
in memory (because the CC flag would be sufficient), and so
advancing to the next 8 bytes will cause us to read potentially
invalid memory. So that comparison was removed, and the target
of the TIC is processed as a new chain.
This is fine when a TIC goes to a new chain (consider a NOP+TIC to
a channel program that is being redriven), but there is another
scenario where this falls apart. A TIC can be used to "rewind"
a channel program, for example to find a particular record on a
disk with various orientation CCWs. In this case, we DO want to
consider the memory after the TIC since the TIC will be skipped
once the requested criteria is met. This is due to the Status
Modifier presented by the device, though software doesn't need to
operate on it beyond understanding the behavior change of how the
channel program is executed.
So to handle this, we will re-introduce the check for a TIC CCW
but limit it by examining the target of the TIC. If the TIC
doesn't go back into the current chain, then current behavior
applies; we should stop counting CCWs and let the target of the
TIC be handled as a new chain. But, if the TIC DOES go back into
the current chain, then we need to keep looking at the memory after
the TIC for when the channel breaks out of the TIC loop. We can't
use tic_target_chain_exists() because the chain in question hasn't
been built yet, so we will redefine that comparison with some small
functions to make it more readable and to permit refactoring later.
Fixes: 405d566f98ae ("vfio-ccw: Don't assume there are more ccws after a TIC")
Signed-off-by: Eric Farman <farman@linux.ibm.com>
Message-Id: <20190222183941.29596-2-farman@linux.ibm.com>
Reviewed-by: Halil Pasic <pasic@linux.ibm.com>
Reviewed-by: Farhan Ali <alifm@linux.ibm.com>
Signed-off-by: Cornelia Huck <cohuck@redhat.com>
2019-02-23 02:39:40 +08:00
|
|
|
/*
|
|
|
|
* is_cpa_within_range()
|
|
|
|
*
|
|
|
|
* @cpa: channel program address being questioned
|
|
|
|
* @head: address of the beginning of a CCW chain
|
|
|
|
* @len: number of CCWs within the chain
|
|
|
|
*
|
|
|
|
* Determine whether the address of a CCW (whether a new chain,
|
|
|
|
* or the target of a TIC) falls within a range (including the end points).
|
|
|
|
*
|
|
|
|
* Returns 1 if yes, 0 if no.
|
|
|
|
*/
|
|
|
|
static inline int is_cpa_within_range(u32 cpa, u32 head, int len)
|
|
|
|
{
|
|
|
|
u32 tail = head + (len - 1) * sizeof(struct ccw1);
|
|
|
|
|
|
|
|
return (head <= cpa && cpa <= tail);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int is_tic_within_range(struct ccw1 *ccw, u32 head, int len)
|
|
|
|
{
|
|
|
|
if (!ccw_is_tic(ccw))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return is_cpa_within_range(ccw->cda, head, len);
|
|
|
|
}
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
static struct ccwchain *ccwchain_alloc(struct channel_program *cp, int len)
|
|
|
|
{
|
|
|
|
struct ccwchain *chain;
|
|
|
|
void *data;
|
|
|
|
size_t size;
|
|
|
|
|
|
|
|
/* Make ccw address aligned to 8. */
|
|
|
|
size = ((sizeof(*chain) + 7L) & -8L) +
|
|
|
|
sizeof(*chain->ch_ccw) * len +
|
|
|
|
sizeof(*chain->ch_pat) * len;
|
|
|
|
chain = kzalloc(size, GFP_DMA | GFP_KERNEL);
|
|
|
|
if (!chain)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
data = (u8 *)chain + ((sizeof(*chain) + 7L) & -8L);
|
|
|
|
chain->ch_ccw = (struct ccw1 *)data;
|
|
|
|
|
|
|
|
data = (u8 *)(chain->ch_ccw) + sizeof(*chain->ch_ccw) * len;
|
|
|
|
chain->ch_pat = (struct pfn_array_table *)data;
|
|
|
|
|
|
|
|
chain->ch_len = len;
|
|
|
|
|
|
|
|
list_add_tail(&chain->next, &cp->ccwchain_list);
|
|
|
|
|
|
|
|
return chain;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ccwchain_free(struct ccwchain *chain)
|
|
|
|
{
|
|
|
|
list_del(&chain->next);
|
|
|
|
kfree(chain);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Free resource for a ccw that allocated memory for its cda. */
|
|
|
|
static void ccwchain_cda_free(struct ccwchain *chain, int idx)
|
|
|
|
{
|
|
|
|
struct ccw1 *ccw = chain->ch_ccw + idx;
|
|
|
|
|
2017-11-07 23:22:32 +08:00
|
|
|
if (ccw_is_test(ccw) || ccw_is_noop(ccw) || ccw_is_tic(ccw))
|
|
|
|
return;
|
2017-03-17 11:17:32 +08:00
|
|
|
if (!ccw->count)
|
|
|
|
return;
|
|
|
|
|
|
|
|
kfree((void *)(u64)ccw->cda);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Unpin the pages then free the memory resources. */
|
|
|
|
static void cp_unpin_free(struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccwchain *chain, *temp;
|
|
|
|
int i;
|
|
|
|
|
2019-01-21 16:55:18 +08:00
|
|
|
cp->initialized = false;
|
2017-03-17 11:17:32 +08:00
|
|
|
list_for_each_entry_safe(chain, temp, &cp->ccwchain_list, next) {
|
|
|
|
for (i = 0; i < chain->ch_len; i++) {
|
|
|
|
pfn_array_table_unpin_free(chain->ch_pat + i,
|
|
|
|
cp->mdev);
|
|
|
|
ccwchain_cda_free(chain, i);
|
|
|
|
}
|
|
|
|
ccwchain_free(chain);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* ccwchain_calc_length - calculate the length of the ccw chain.
|
|
|
|
* @iova: guest physical address of the target ccw chain
|
|
|
|
* @cp: channel_program on which to perform the operation
|
|
|
|
*
|
|
|
|
* This is the chain length not considering any TICs.
|
|
|
|
* You need to do a new round for each TIC target.
|
|
|
|
*
|
2018-05-17 01:33:42 +08:00
|
|
|
* The program is also validated for absence of not yet supported
|
|
|
|
* indirect data addressing scenarios.
|
|
|
|
*
|
2017-03-17 11:17:32 +08:00
|
|
|
* Returns: the length of the ccw chain or -errno.
|
|
|
|
*/
|
|
|
|
static int ccwchain_calc_length(u64 iova, struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccw1 *ccw, *p;
|
|
|
|
int cnt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy current chain from guest to host kernel.
|
|
|
|
* Currently the chain length is limited to CCWCHAIN_LEN_MAX (256).
|
|
|
|
* So copying 2K is enough (safe).
|
|
|
|
*/
|
|
|
|
p = ccw = kcalloc(CCWCHAIN_LEN_MAX, sizeof(*ccw), GFP_KERNEL);
|
|
|
|
if (!ccw)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
cnt = copy_ccw_from_iova(cp, ccw, iova, CCWCHAIN_LEN_MAX);
|
|
|
|
if (cnt) {
|
|
|
|
kfree(ccw);
|
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
cnt = 0;
|
|
|
|
do {
|
|
|
|
cnt++;
|
|
|
|
|
2018-05-17 01:33:42 +08:00
|
|
|
/*
|
|
|
|
* As we don't want to fail direct addressing even if the
|
|
|
|
* orb specified one of the unsupported formats, we defer
|
|
|
|
* checking for IDAWs in unsupported formats to here.
|
|
|
|
*/
|
2018-11-09 10:39:29 +08:00
|
|
|
if ((!cp->orb.cmd.c64 || cp->orb.cmd.i2k) && ccw_is_idal(ccw)) {
|
|
|
|
kfree(p);
|
2018-05-17 01:33:42 +08:00
|
|
|
return -EOPNOTSUPP;
|
2018-11-09 10:39:29 +08:00
|
|
|
}
|
2018-05-17 01:33:42 +08:00
|
|
|
|
s390/cio: Fix vfio-ccw handling of recursive TICs
The routine ccwchain_calc_length() is tasked with looking at a
channel program, seeing how many CCWs are chained together by
the presence of the Chain-Command flag, and returning a count
to the caller.
Previously, it also considered a Transfer-in-Channel CCW as being
an appropriate mechanism for chaining. The problem at the time
was that the TIC CCW will almost certainly not go to the next CCW
in memory (because the CC flag would be sufficient), and so
advancing to the next 8 bytes will cause us to read potentially
invalid memory. So that comparison was removed, and the target
of the TIC is processed as a new chain.
This is fine when a TIC goes to a new chain (consider a NOP+TIC to
a channel program that is being redriven), but there is another
scenario where this falls apart. A TIC can be used to "rewind"
a channel program, for example to find a particular record on a
disk with various orientation CCWs. In this case, we DO want to
consider the memory after the TIC since the TIC will be skipped
once the requested criteria is met. This is due to the Status
Modifier presented by the device, though software doesn't need to
operate on it beyond understanding the behavior change of how the
channel program is executed.
So to handle this, we will re-introduce the check for a TIC CCW
but limit it by examining the target of the TIC. If the TIC
doesn't go back into the current chain, then current behavior
applies; we should stop counting CCWs and let the target of the
TIC be handled as a new chain. But, if the TIC DOES go back into
the current chain, then we need to keep looking at the memory after
the TIC for when the channel breaks out of the TIC loop. We can't
use tic_target_chain_exists() because the chain in question hasn't
been built yet, so we will redefine that comparison with some small
functions to make it more readable and to permit refactoring later.
Fixes: 405d566f98ae ("vfio-ccw: Don't assume there are more ccws after a TIC")
Signed-off-by: Eric Farman <farman@linux.ibm.com>
Message-Id: <20190222183941.29596-2-farman@linux.ibm.com>
Reviewed-by: Halil Pasic <pasic@linux.ibm.com>
Reviewed-by: Farhan Ali <alifm@linux.ibm.com>
Signed-off-by: Cornelia Huck <cohuck@redhat.com>
2019-02-23 02:39:40 +08:00
|
|
|
/*
|
|
|
|
* We want to keep counting if the current CCW has the
|
|
|
|
* command-chaining flag enabled, or if it is a TIC CCW
|
|
|
|
* that loops back into the current chain. The latter
|
|
|
|
* is used for device orientation, where the CCW PRIOR to
|
|
|
|
* the TIC can either jump to the TIC or a CCW immediately
|
|
|
|
* after the TIC, depending on the results of its operation.
|
|
|
|
*/
|
|
|
|
if (!ccw_is_chain(ccw) && !is_tic_within_range(ccw, iova, cnt))
|
2017-03-17 11:17:32 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
ccw++;
|
|
|
|
} while (cnt < CCWCHAIN_LEN_MAX + 1);
|
|
|
|
|
|
|
|
if (cnt == CCWCHAIN_LEN_MAX + 1)
|
|
|
|
cnt = -EINVAL;
|
|
|
|
|
|
|
|
kfree(p);
|
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int tic_target_chain_exists(struct ccw1 *tic, struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccwchain *chain;
|
2019-02-23 02:39:41 +08:00
|
|
|
u32 ccw_head;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
|
|
|
list_for_each_entry(chain, &cp->ccwchain_list, next) {
|
|
|
|
ccw_head = chain->ch_iova;
|
2019-02-23 02:39:41 +08:00
|
|
|
if (is_cpa_within_range(tic->cda, ccw_head, chain->ch_len))
|
2017-03-17 11:17:32 +08:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ccwchain_loop_tic(struct ccwchain *chain,
|
|
|
|
struct channel_program *cp);
|
|
|
|
|
|
|
|
static int ccwchain_handle_tic(struct ccw1 *tic, struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccwchain *chain;
|
|
|
|
int len, ret;
|
|
|
|
|
|
|
|
/* May transfer to an existing chain. */
|
|
|
|
if (tic_target_chain_exists(tic, cp))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Get chain length. */
|
|
|
|
len = ccwchain_calc_length(tic->cda, cp);
|
|
|
|
if (len < 0)
|
|
|
|
return len;
|
|
|
|
|
|
|
|
/* Need alloc a new chain for this one. */
|
|
|
|
chain = ccwchain_alloc(cp, len);
|
|
|
|
if (!chain)
|
|
|
|
return -ENOMEM;
|
|
|
|
chain->ch_iova = tic->cda;
|
|
|
|
|
|
|
|
/* Copy the new chain from user. */
|
|
|
|
ret = copy_ccw_from_iova(cp, chain->ch_ccw, tic->cda, len);
|
|
|
|
if (ret) {
|
|
|
|
ccwchain_free(chain);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Loop for tics on this new chain. */
|
|
|
|
return ccwchain_loop_tic(chain, cp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Loop for TICs. */
|
|
|
|
static int ccwchain_loop_tic(struct ccwchain *chain, struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccw1 *tic;
|
|
|
|
int i, ret;
|
|
|
|
|
|
|
|
for (i = 0; i < chain->ch_len; i++) {
|
|
|
|
tic = chain->ch_ccw + i;
|
|
|
|
|
|
|
|
if (!ccw_is_tic(tic))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ret = ccwchain_handle_tic(tic, cp);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ccwchain_fetch_tic(struct ccwchain *chain,
|
|
|
|
int idx,
|
|
|
|
struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccw1 *ccw = chain->ch_ccw + idx;
|
|
|
|
struct ccwchain *iter;
|
2019-02-23 02:39:41 +08:00
|
|
|
u32 ccw_head;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
|
|
|
list_for_each_entry(iter, &cp->ccwchain_list, next) {
|
|
|
|
ccw_head = iter->ch_iova;
|
2019-02-23 02:39:41 +08:00
|
|
|
if (is_cpa_within_range(ccw->cda, ccw_head, iter->ch_len)) {
|
2017-07-21 09:14:36 +08:00
|
|
|
ccw->cda = (__u32) (addr_t) (((char *)iter->ch_ccw) +
|
2017-03-17 11:17:32 +08:00
|
|
|
(ccw->cda - ccw_head));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return -EFAULT;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ccwchain_fetch_direct(struct ccwchain *chain,
|
|
|
|
int idx,
|
|
|
|
struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccw1 *ccw;
|
|
|
|
struct pfn_array_table *pat;
|
|
|
|
unsigned long *idaws;
|
2018-05-23 10:56:44 +08:00
|
|
|
int ret;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
|
|
|
ccw = chain->ch_ccw + idx;
|
|
|
|
|
2017-10-11 10:38:22 +08:00
|
|
|
if (!ccw->count) {
|
|
|
|
/*
|
|
|
|
* We just want the translation result of any direct ccw
|
|
|
|
* to be an IDA ccw, so let's add the IDA flag for it.
|
|
|
|
* Although the flag will be ignored by firmware.
|
|
|
|
*/
|
|
|
|
ccw->flags |= CCW_FLAG_IDA;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
/*
|
|
|
|
* Pin data page(s) in memory.
|
|
|
|
* The number of pages actually is the count of the idaws which will be
|
|
|
|
* needed when translating a direct ccw to a idal ccw.
|
|
|
|
*/
|
|
|
|
pat = chain->ch_pat + idx;
|
2018-05-23 10:56:44 +08:00
|
|
|
ret = pfn_array_table_init(pat, 1);
|
|
|
|
if (ret)
|
|
|
|
goto out_init;
|
|
|
|
|
2019-05-15 07:42:44 +08:00
|
|
|
ret = pfn_array_alloc(pat->pat_pa, ccw->cda, ccw->count);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_unpin;
|
|
|
|
|
|
|
|
ret = pfn_array_pin(pat->pat_pa, cp->mdev);
|
2018-05-23 10:56:44 +08:00
|
|
|
if (ret < 0)
|
2018-11-09 10:39:28 +08:00
|
|
|
goto out_unpin;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
|
|
|
/* Translate this direct ccw to a idal ccw. */
|
2018-05-23 10:56:44 +08:00
|
|
|
idaws = kcalloc(ret, sizeof(*idaws), GFP_DMA | GFP_KERNEL);
|
2017-03-17 11:17:32 +08:00
|
|
|
if (!idaws) {
|
2018-05-23 10:56:44 +08:00
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out_unpin;
|
2017-03-17 11:17:32 +08:00
|
|
|
}
|
|
|
|
ccw->cda = (__u32) virt_to_phys(idaws);
|
|
|
|
ccw->flags |= CCW_FLAG_IDA;
|
|
|
|
|
|
|
|
pfn_array_table_idal_create_words(pat, idaws);
|
|
|
|
|
|
|
|
return 0;
|
2018-05-23 10:56:44 +08:00
|
|
|
|
|
|
|
out_unpin:
|
|
|
|
pfn_array_table_unpin_free(pat, cp->mdev);
|
|
|
|
out_init:
|
|
|
|
ccw->cda = 0;
|
|
|
|
return ret;
|
2017-03-17 11:17:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int ccwchain_fetch_idal(struct ccwchain *chain,
|
|
|
|
int idx,
|
|
|
|
struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccw1 *ccw;
|
|
|
|
struct pfn_array_table *pat;
|
2019-05-15 07:42:44 +08:00
|
|
|
struct pfn_array *pa;
|
2017-03-17 11:17:32 +08:00
|
|
|
unsigned long *idaws;
|
|
|
|
u64 idaw_iova;
|
|
|
|
unsigned int idaw_nr, idaw_len;
|
|
|
|
int i, ret;
|
|
|
|
|
|
|
|
ccw = chain->ch_ccw + idx;
|
|
|
|
|
2017-10-11 10:38:22 +08:00
|
|
|
if (!ccw->count)
|
|
|
|
return 0;
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
/* Calculate size of idaws. */
|
|
|
|
ret = copy_from_iova(cp->mdev, &idaw_iova, ccw->cda, sizeof(idaw_iova));
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
idaw_nr = idal_nr_words((void *)(idaw_iova), ccw->count);
|
|
|
|
idaw_len = idaw_nr * sizeof(*idaws);
|
|
|
|
|
|
|
|
/* Pin data page(s) in memory. */
|
|
|
|
pat = chain->ch_pat + idx;
|
|
|
|
ret = pfn_array_table_init(pat, idaw_nr);
|
|
|
|
if (ret)
|
2018-05-23 10:56:44 +08:00
|
|
|
goto out_init;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
|
|
|
/* Translate idal ccw to use new allocated idaws. */
|
|
|
|
idaws = kzalloc(idaw_len, GFP_DMA | GFP_KERNEL);
|
|
|
|
if (!idaws) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out_unpin;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = copy_from_iova(cp->mdev, idaws, ccw->cda, idaw_len);
|
|
|
|
if (ret)
|
|
|
|
goto out_free_idaws;
|
|
|
|
|
|
|
|
ccw->cda = virt_to_phys(idaws);
|
|
|
|
|
|
|
|
for (i = 0; i < idaw_nr; i++) {
|
|
|
|
idaw_iova = *(idaws + i);
|
2019-05-15 07:42:44 +08:00
|
|
|
pa = pat->pat_pa + i;
|
|
|
|
|
|
|
|
ret = pfn_array_alloc(pa, idaw_iova, 1);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_free_idaws;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
2019-05-15 07:42:44 +08:00
|
|
|
ret = pfn_array_pin(pa, cp->mdev);
|
2017-03-17 11:17:32 +08:00
|
|
|
if (ret < 0)
|
|
|
|
goto out_free_idaws;
|
|
|
|
}
|
|
|
|
|
|
|
|
pfn_array_table_idal_create_words(pat, idaws);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
out_free_idaws:
|
|
|
|
kfree(idaws);
|
|
|
|
out_unpin:
|
|
|
|
pfn_array_table_unpin_free(pat, cp->mdev);
|
2018-05-23 10:56:44 +08:00
|
|
|
out_init:
|
|
|
|
ccw->cda = 0;
|
2017-03-17 11:17:32 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fetch one ccw.
|
|
|
|
* To reduce memory copy, we'll pin the cda page in memory,
|
|
|
|
* and to get rid of the cda 2G limitiaion of ccw1, we'll translate
|
|
|
|
* direct ccws to idal ccws.
|
|
|
|
*/
|
|
|
|
static int ccwchain_fetch_one(struct ccwchain *chain,
|
|
|
|
int idx,
|
|
|
|
struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccw1 *ccw = chain->ch_ccw + idx;
|
|
|
|
|
|
|
|
if (ccw_is_test(ccw) || ccw_is_noop(ccw))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (ccw_is_tic(ccw))
|
|
|
|
return ccwchain_fetch_tic(chain, idx, cp);
|
|
|
|
|
|
|
|
if (ccw_is_idal(ccw))
|
|
|
|
return ccwchain_fetch_idal(chain, idx, cp);
|
|
|
|
|
|
|
|
return ccwchain_fetch_direct(chain, idx, cp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cp_init() - allocate ccwchains for a channel program.
|
|
|
|
* @cp: channel_program on which to perform the operation
|
|
|
|
* @mdev: the mediated device to perform pin/unpin operations
|
|
|
|
* @orb: control block for the channel program from the guest
|
|
|
|
*
|
|
|
|
* This creates one or more ccwchain(s), and copies the raw data of
|
|
|
|
* the target channel program from @orb->cmd.iova to the new ccwchain(s).
|
|
|
|
*
|
|
|
|
* Limitations:
|
|
|
|
* 1. Supports only prefetch enabled mode.
|
|
|
|
* 2. Supports idal(c64) ccw chaining.
|
|
|
|
* 3. Supports 4k idaw.
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* %0 on success and a negative error value on failure.
|
|
|
|
*/
|
|
|
|
int cp_init(struct channel_program *cp, struct device *mdev, union orb *orb)
|
|
|
|
{
|
|
|
|
u64 iova = orb->cmd.cpa;
|
|
|
|
struct ccwchain *chain;
|
|
|
|
int len, ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX:
|
|
|
|
* Only support prefetch enable mode now.
|
|
|
|
*/
|
2018-05-17 01:33:42 +08:00
|
|
|
if (!orb->cmd.pfch)
|
2017-03-17 11:17:32 +08:00
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&cp->ccwchain_list);
|
|
|
|
memcpy(&cp->orb, orb, sizeof(*orb));
|
|
|
|
cp->mdev = mdev;
|
|
|
|
|
|
|
|
/* Get chain length. */
|
|
|
|
len = ccwchain_calc_length(iova, cp);
|
|
|
|
if (len < 0)
|
|
|
|
return len;
|
|
|
|
|
|
|
|
/* Alloc mem for the head chain. */
|
|
|
|
chain = ccwchain_alloc(cp, len);
|
|
|
|
if (!chain)
|
|
|
|
return -ENOMEM;
|
|
|
|
chain->ch_iova = iova;
|
|
|
|
|
|
|
|
/* Copy the head chain from guest. */
|
|
|
|
ret = copy_ccw_from_iova(cp, chain->ch_ccw, iova, len);
|
|
|
|
if (ret) {
|
|
|
|
ccwchain_free(chain);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now loop for its TICs. */
|
|
|
|
ret = ccwchain_loop_tic(chain, cp);
|
|
|
|
if (ret)
|
|
|
|
cp_unpin_free(cp);
|
2018-05-17 01:33:42 +08:00
|
|
|
/* It is safe to force: if not set but idals used
|
|
|
|
* ccwchain_calc_length returns an error.
|
|
|
|
*/
|
|
|
|
cp->orb.cmd.c64 = 1;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
2019-01-21 16:55:18 +08:00
|
|
|
if (!ret)
|
|
|
|
cp->initialized = true;
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cp_free() - free resources for channel program.
|
|
|
|
* @cp: channel_program on which to perform the operation
|
|
|
|
*
|
|
|
|
* This unpins the memory pages and frees the memory space occupied by
|
|
|
|
* @cp, which must have been returned by a previous call to cp_init().
|
|
|
|
* Otherwise, undefined behavior occurs.
|
|
|
|
*/
|
|
|
|
void cp_free(struct channel_program *cp)
|
|
|
|
{
|
2019-01-21 16:55:18 +08:00
|
|
|
if (cp->initialized)
|
|
|
|
cp_unpin_free(cp);
|
2017-03-17 11:17:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cp_prefetch() - translate a guest physical address channel program to
|
|
|
|
* a real-device runnable channel program.
|
|
|
|
* @cp: channel_program on which to perform the operation
|
|
|
|
*
|
|
|
|
* This function translates the guest-physical-address channel program
|
|
|
|
* and stores the result to ccwchain list. @cp must have been
|
|
|
|
* initialized by a previous call with cp_init(). Otherwise, undefined
|
|
|
|
* behavior occurs.
|
2018-04-24 19:26:56 +08:00
|
|
|
* For each chain composing the channel program:
|
|
|
|
* - On entry ch_len holds the count of CCWs to be translated.
|
|
|
|
* - On exit ch_len is adjusted to the count of successfully translated CCWs.
|
|
|
|
* This allows cp_free to find in ch_len the count of CCWs to free in a chain.
|
2017-03-17 11:17:32 +08:00
|
|
|
*
|
|
|
|
* The S/390 CCW Translation APIS (prefixed by 'cp_') are introduced
|
|
|
|
* as helpers to do ccw chain translation inside the kernel. Basically
|
|
|
|
* they accept a channel program issued by a virtual machine, and
|
|
|
|
* translate the channel program to a real-device runnable channel
|
|
|
|
* program.
|
|
|
|
*
|
|
|
|
* These APIs will copy the ccws into kernel-space buffers, and update
|
|
|
|
* the guest phsical addresses with their corresponding host physical
|
|
|
|
* addresses. Then channel I/O device drivers could issue the
|
|
|
|
* translated channel program to real devices to perform an I/O
|
|
|
|
* operation.
|
|
|
|
*
|
|
|
|
* These interfaces are designed to support translation only for
|
|
|
|
* channel programs, which are generated and formatted by a
|
|
|
|
* guest. Thus this will make it possible for things like VFIO to
|
|
|
|
* leverage the interfaces to passthrough a channel I/O mediated
|
|
|
|
* device in QEMU.
|
|
|
|
*
|
|
|
|
* We support direct ccw chaining by translating them to idal ccws.
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* %0 on success and a negative error value on failure.
|
|
|
|
*/
|
|
|
|
int cp_prefetch(struct channel_program *cp)
|
|
|
|
{
|
|
|
|
struct ccwchain *chain;
|
|
|
|
int len, idx, ret;
|
|
|
|
|
2019-01-21 16:55:18 +08:00
|
|
|
/* this is an error in the caller */
|
|
|
|
if (!cp->initialized)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
list_for_each_entry(chain, &cp->ccwchain_list, next) {
|
|
|
|
len = chain->ch_len;
|
|
|
|
for (idx = 0; idx < len; idx++) {
|
|
|
|
ret = ccwchain_fetch_one(chain, idx, cp);
|
|
|
|
if (ret)
|
2018-04-24 19:26:56 +08:00
|
|
|
goto out_err;
|
2017-03-17 11:17:32 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
2018-04-24 19:26:56 +08:00
|
|
|
out_err:
|
|
|
|
/* Only cleanup the chain elements that were actually translated. */
|
|
|
|
chain->ch_len = idx;
|
|
|
|
list_for_each_entry_continue(chain, &cp->ccwchain_list, next) {
|
|
|
|
chain->ch_len = 0;
|
|
|
|
}
|
|
|
|
return ret;
|
2017-03-17 11:17:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cp_get_orb() - get the orb of the channel program
|
|
|
|
* @cp: channel_program on which to perform the operation
|
|
|
|
* @intparm: new intparm for the returned orb
|
|
|
|
* @lpm: candidate value of the logical-path mask for the returned orb
|
|
|
|
*
|
|
|
|
* This function returns the address of the updated orb of the channel
|
|
|
|
* program. Channel I/O device drivers could use this orb to issue a
|
|
|
|
* ssch.
|
|
|
|
*/
|
|
|
|
union orb *cp_get_orb(struct channel_program *cp, u32 intparm, u8 lpm)
|
|
|
|
{
|
|
|
|
union orb *orb;
|
|
|
|
struct ccwchain *chain;
|
|
|
|
struct ccw1 *cpa;
|
|
|
|
|
2019-01-21 16:55:18 +08:00
|
|
|
/* this is an error in the caller */
|
|
|
|
if (!cp->initialized)
|
|
|
|
return NULL;
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
orb = &cp->orb;
|
|
|
|
|
|
|
|
orb->cmd.intparm = intparm;
|
|
|
|
orb->cmd.fmt = 1;
|
|
|
|
orb->cmd.key = PAGE_DEFAULT_KEY >> 4;
|
|
|
|
|
|
|
|
if (orb->cmd.lpm == 0)
|
|
|
|
orb->cmd.lpm = lpm;
|
|
|
|
|
|
|
|
chain = list_first_entry(&cp->ccwchain_list, struct ccwchain, next);
|
|
|
|
cpa = chain->ch_ccw;
|
|
|
|
orb->cmd.cpa = (__u32) __pa(cpa);
|
|
|
|
|
|
|
|
return orb;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cp_update_scsw() - update scsw for a channel program.
|
|
|
|
* @cp: channel_program on which to perform the operation
|
|
|
|
* @scsw: I/O results of the channel program and also the target to be
|
|
|
|
* updated
|
|
|
|
*
|
|
|
|
* @scsw contains the I/O results of the channel program that pointed
|
|
|
|
* to by @cp. However what @scsw->cpa stores is a host physical
|
|
|
|
* address, which is meaningless for the guest, which is waiting for
|
|
|
|
* the I/O results.
|
|
|
|
*
|
|
|
|
* This function updates @scsw->cpa to its coressponding guest physical
|
|
|
|
* address.
|
|
|
|
*/
|
|
|
|
void cp_update_scsw(struct channel_program *cp, union scsw *scsw)
|
|
|
|
{
|
|
|
|
struct ccwchain *chain;
|
|
|
|
u32 cpa = scsw->cmd.cpa;
|
2019-02-23 02:39:41 +08:00
|
|
|
u32 ccw_head;
|
2017-03-17 11:17:32 +08:00
|
|
|
|
2019-01-21 16:55:18 +08:00
|
|
|
if (!cp->initialized)
|
|
|
|
return;
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
/*
|
|
|
|
* LATER:
|
|
|
|
* For now, only update the cmd.cpa part. We may need to deal with
|
|
|
|
* other portions of the schib as well, even if we don't return them
|
|
|
|
* in the ioctl directly. Path status changes etc.
|
|
|
|
*/
|
|
|
|
list_for_each_entry(chain, &cp->ccwchain_list, next) {
|
|
|
|
ccw_head = (u32)(u64)chain->ch_ccw;
|
2019-05-15 07:42:42 +08:00
|
|
|
/*
|
|
|
|
* On successful execution, cpa points just beyond the end
|
|
|
|
* of the chain.
|
|
|
|
*/
|
|
|
|
if (is_cpa_within_range(cpa, ccw_head, chain->ch_len + 1)) {
|
2017-03-17 11:17:32 +08:00
|
|
|
/*
|
|
|
|
* (cpa - ccw_head) is the offset value of the host
|
|
|
|
* physical ccw to its chain head.
|
|
|
|
* Adding this value to the guest physical ccw chain
|
|
|
|
* head gets us the guest cpa.
|
|
|
|
*/
|
|
|
|
cpa = chain->ch_iova + (cpa - ccw_head);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
scsw->cmd.cpa = cpa;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cp_iova_pinned() - check if an iova is pinned for a ccw chain.
|
2018-01-29 19:55:29 +08:00
|
|
|
* @cp: channel_program on which to perform the operation
|
2017-03-17 11:17:32 +08:00
|
|
|
* @iova: the iova to check
|
|
|
|
*
|
|
|
|
* If the @iova is currently pinned for the ccw chain, return true;
|
|
|
|
* else return false.
|
|
|
|
*/
|
|
|
|
bool cp_iova_pinned(struct channel_program *cp, u64 iova)
|
|
|
|
{
|
|
|
|
struct ccwchain *chain;
|
|
|
|
int i;
|
|
|
|
|
2019-01-21 16:55:18 +08:00
|
|
|
if (!cp->initialized)
|
|
|
|
return false;
|
|
|
|
|
2017-03-17 11:17:32 +08:00
|
|
|
list_for_each_entry(chain, &cp->ccwchain_list, next) {
|
|
|
|
for (i = 0; i < chain->ch_len; i++)
|
|
|
|
if (pfn_array_table_iova_pinned(chain->ch_pat + i,
|
|
|
|
iova))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|