2017-11-01 01:56:19 +08:00
|
|
|
/*
|
|
|
|
* Copyright 2017 Red Hat Inc.
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
|
|
* to deal in the Software without restriction, including without limitation
|
|
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
|
|
|
|
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
|
|
|
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
|
|
* OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
#include <nvif/vmm.h>
|
|
|
|
#include <nvif/mem.h>
|
|
|
|
|
|
|
|
#include <nvif/if000c.h>
|
|
|
|
|
|
|
|
int
|
|
|
|
nvif_vmm_unmap(struct nvif_vmm *vmm, u64 addr)
|
|
|
|
{
|
|
|
|
return nvif_object_mthd(&vmm->object, NVIF_VMM_V0_UNMAP,
|
|
|
|
&(struct nvif_vmm_unmap_v0) { .addr = addr },
|
|
|
|
sizeof(struct nvif_vmm_unmap_v0));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
nvif_vmm_map(struct nvif_vmm *vmm, u64 addr, u64 size, void *argv, u32 argc,
|
|
|
|
struct nvif_mem *mem, u64 offset)
|
|
|
|
{
|
|
|
|
struct nvif_vmm_map_v0 *args;
|
2018-02-02 23:27:31 +08:00
|
|
|
u8 stack[48];
|
2017-11-01 01:56:19 +08:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (sizeof(*args) + argc > sizeof(stack)) {
|
|
|
|
if (!(args = kmalloc(sizeof(*args) + argc, GFP_KERNEL)))
|
|
|
|
return -ENOMEM;
|
|
|
|
} else {
|
|
|
|
args = (void *)stack;
|
|
|
|
}
|
|
|
|
|
|
|
|
args->version = 0;
|
|
|
|
args->addr = addr;
|
|
|
|
args->size = size;
|
|
|
|
args->memory = nvif_handle(&mem->object);
|
|
|
|
args->offset = offset;
|
|
|
|
memcpy(args->data, argv, argc);
|
|
|
|
|
|
|
|
ret = nvif_object_mthd(&vmm->object, NVIF_VMM_V0_MAP,
|
|
|
|
args, sizeof(*args) + argc);
|
|
|
|
if (args != (void *)stack)
|
|
|
|
kfree(args);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
nvif_vmm_put(struct nvif_vmm *vmm, struct nvif_vma *vma)
|
|
|
|
{
|
|
|
|
if (vma->size) {
|
|
|
|
WARN_ON(nvif_object_mthd(&vmm->object, NVIF_VMM_V0_PUT,
|
|
|
|
&(struct nvif_vmm_put_v0) {
|
|
|
|
.addr = vma->addr,
|
|
|
|
}, sizeof(struct nvif_vmm_put_v0)));
|
|
|
|
vma->size = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
nvif_vmm_get(struct nvif_vmm *vmm, enum nvif_vmm_get type, bool sparse,
|
|
|
|
u8 page, u8 align, u64 size, struct nvif_vma *vma)
|
|
|
|
{
|
|
|
|
struct nvif_vmm_get_v0 args;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
args.version = vma->size = 0;
|
|
|
|
args.sparse = sparse;
|
|
|
|
args.page = page;
|
|
|
|
args.align = align;
|
|
|
|
args.size = size;
|
|
|
|
|
|
|
|
switch (type) {
|
|
|
|
case ADDR: args.type = NVIF_VMM_GET_V0_ADDR; break;
|
|
|
|
case PTES: args.type = NVIF_VMM_GET_V0_PTES; break;
|
|
|
|
case LAZY: args.type = NVIF_VMM_GET_V0_LAZY; break;
|
|
|
|
default:
|
|
|
|
WARN_ON(1);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = nvif_object_mthd(&vmm->object, NVIF_VMM_V0_GET,
|
|
|
|
&args, sizeof(args));
|
|
|
|
if (ret == 0) {
|
|
|
|
vma->addr = args.addr;
|
|
|
|
vma->size = args.size;
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
nvif_vmm_fini(struct nvif_vmm *vmm)
|
|
|
|
{
|
|
|
|
kfree(vmm->page);
|
|
|
|
nvif_object_fini(&vmm->object);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
nvif_vmm_init(struct nvif_mmu *mmu, s32 oclass, u64 addr, u64 size,
|
|
|
|
void *argv, u32 argc, struct nvif_vmm *vmm)
|
|
|
|
{
|
|
|
|
struct nvif_vmm_v0 *args;
|
|
|
|
u32 argn = sizeof(*args) + argc;
|
|
|
|
int ret = -ENOSYS, i;
|
|
|
|
|
|
|
|
vmm->object.client = NULL;
|
|
|
|
vmm->page = NULL;
|
|
|
|
|
|
|
|
if (!(args = kmalloc(argn, GFP_KERNEL)))
|
|
|
|
return -ENOMEM;
|
|
|
|
args->version = 0;
|
|
|
|
args->addr = addr;
|
|
|
|
args->size = size;
|
|
|
|
memcpy(args->data, argv, argc);
|
|
|
|
|
|
|
|
ret = nvif_object_init(&mmu->object, 0, oclass, args, argn,
|
|
|
|
&vmm->object);
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
vmm->start = args->addr;
|
|
|
|
vmm->limit = args->size;
|
|
|
|
|
|
|
|
vmm->page_nr = args->page_nr;
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 04:55:00 +08:00
|
|
|
vmm->page = kmalloc_array(vmm->page_nr, sizeof(*vmm->page),
|
|
|
|
GFP_KERNEL);
|
2017-11-01 01:56:19 +08:00
|
|
|
if (!vmm->page) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < vmm->page_nr; i++) {
|
|
|
|
struct nvif_vmm_page_v0 args = { .index = i };
|
|
|
|
|
|
|
|
ret = nvif_object_mthd(&vmm->object, NVIF_VMM_V0_PAGE,
|
|
|
|
&args, sizeof(args));
|
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
|
|
|
|
vmm->page[i].shift = args.shift;
|
|
|
|
vmm->page[i].sparse = args.sparse;
|
|
|
|
vmm->page[i].vram = args.vram;
|
|
|
|
vmm->page[i].host = args.host;
|
|
|
|
vmm->page[i].comp = args.comp;
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
if (ret)
|
|
|
|
nvif_vmm_fini(vmm);
|
|
|
|
kfree(args);
|
|
|
|
return ret;
|
|
|
|
}
|