2011-05-13 04:54:01 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 2011 NetApp, Inc.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY NETAPP, INC ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL NETAPP, INC OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* $FreeBSD$
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/linker_set.h>
|
|
|
|
|
2014-05-23 05:15:17 +00:00
|
|
|
#include <x86/psl.h>
|
|
|
|
|
|
|
|
#include <machine/vmm.h>
|
|
|
|
#include <vmmapi.h>
|
|
|
|
|
2011-05-13 04:54:01 +00:00
|
|
|
#include <stdio.h>
|
2013-04-10 02:12:39 +00:00
|
|
|
#include <string.h>
|
2011-05-13 04:54:01 +00:00
|
|
|
#include <assert.h>
|
|
|
|
|
2014-05-23 05:15:17 +00:00
|
|
|
#include "bhyverun.h"
|
2011-05-13 04:54:01 +00:00
|
|
|
#include "inout.h"
|
|
|
|
|
|
|
|
SET_DECLARE(inout_port_set, struct inout_port);
|
|
|
|
|
|
|
|
#define MAX_IOPORTS (1 << 16)
|
|
|
|
|
2013-04-10 02:12:39 +00:00
|
|
|
#define VERIFY_IOPORT(port, size) \
|
|
|
|
assert((port) >= 0 && (size) > 0 && ((port) + (size)) <= MAX_IOPORTS)
|
|
|
|
|
2011-05-13 04:54:01 +00:00
|
|
|
static struct {
|
|
|
|
const char *name;
|
|
|
|
int flags;
|
|
|
|
inout_func_t handler;
|
|
|
|
void *arg;
|
|
|
|
} inout_handlers[MAX_IOPORTS];
|
|
|
|
|
2011-05-19 21:53:25 +00:00
|
|
|
static int
|
|
|
|
default_inout(struct vmctx *ctx, int vcpu, int in, int port, int bytes,
|
|
|
|
uint32_t *eax, void *arg)
|
|
|
|
{
|
|
|
|
if (in) {
|
|
|
|
switch (bytes) {
|
|
|
|
case 4:
|
|
|
|
*eax = 0xffffffff;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
*eax = 0xffff;
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
*eax = 0xff;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2013-04-10 02:12:39 +00:00
|
|
|
static void
|
|
|
|
register_default_iohandler(int start, int size)
|
|
|
|
{
|
|
|
|
struct inout_port iop;
|
|
|
|
|
|
|
|
VERIFY_IOPORT(start, size);
|
|
|
|
|
|
|
|
bzero(&iop, sizeof(iop));
|
|
|
|
iop.name = "default";
|
|
|
|
iop.port = start;
|
|
|
|
iop.size = size;
|
2013-10-29 00:18:11 +00:00
|
|
|
iop.flags = IOPORT_F_INOUT | IOPORT_F_DEFAULT;
|
2013-04-10 02:12:39 +00:00
|
|
|
iop.handler = default_inout;
|
|
|
|
|
|
|
|
register_inout(&iop);
|
|
|
|
}
|
|
|
|
|
2011-05-13 04:54:01 +00:00
|
|
|
int
|
2014-05-23 05:15:17 +00:00
|
|
|
emulate_inout(struct vmctx *ctx, int vcpu, struct vm_exit *vmexit, int strict)
|
2011-05-13 04:54:01 +00:00
|
|
|
{
|
2014-05-23 05:15:17 +00:00
|
|
|
int addrsize, bytes, flags, in, port, rep;
|
|
|
|
uint64_t gpa, gpaend;
|
|
|
|
uint32_t val;
|
2011-05-13 04:54:01 +00:00
|
|
|
inout_func_t handler;
|
|
|
|
void *arg;
|
2014-05-23 05:15:17 +00:00
|
|
|
char *gva;
|
|
|
|
int error, retval;
|
|
|
|
enum vm_reg_name idxreg;
|
|
|
|
uint64_t index, count;
|
|
|
|
struct vm_inout_str *vis;
|
|
|
|
|
|
|
|
static uint64_t size2mask[] = {
|
|
|
|
[1] = 0xff,
|
|
|
|
[2] = 0xffff,
|
|
|
|
[4] = 0xffffffff,
|
|
|
|
[8] = 0xffffffffffffffff,
|
|
|
|
};
|
|
|
|
|
|
|
|
bytes = vmexit->u.inout.bytes;
|
|
|
|
in = vmexit->u.inout.in;
|
|
|
|
port = vmexit->u.inout.port;
|
2011-05-13 04:54:01 +00:00
|
|
|
|
|
|
|
assert(port < MAX_IOPORTS);
|
2014-05-23 05:15:17 +00:00
|
|
|
assert(bytes == 1 || bytes == 2 || bytes == 4);
|
2011-05-13 04:54:01 +00:00
|
|
|
|
2011-05-19 21:53:25 +00:00
|
|
|
handler = inout_handlers[port].handler;
|
|
|
|
|
|
|
|
if (strict && handler == default_inout)
|
2011-05-13 04:54:01 +00:00
|
|
|
return (-1);
|
|
|
|
|
|
|
|
flags = inout_handlers[port].flags;
|
|
|
|
arg = inout_handlers[port].arg;
|
|
|
|
|
2014-05-23 05:15:17 +00:00
|
|
|
if (in) {
|
|
|
|
if (!(flags & IOPORT_F_IN))
|
|
|
|
return (-1);
|
|
|
|
} else {
|
|
|
|
if (!(flags & IOPORT_F_OUT))
|
|
|
|
return (-1);
|
2014-04-18 15:22:56 +00:00
|
|
|
}
|
|
|
|
|
2014-05-23 05:15:17 +00:00
|
|
|
retval = 0;
|
|
|
|
if (vmexit->u.inout.string) {
|
|
|
|
vis = &vmexit->u.inout_str;
|
|
|
|
rep = vis->inout.rep;
|
|
|
|
addrsize = vis->addrsize;
|
|
|
|
assert(addrsize == 2 || addrsize == 4 || addrsize == 8);
|
|
|
|
|
|
|
|
/* Index register */
|
|
|
|
idxreg = in ? VM_REG_GUEST_RDI : VM_REG_GUEST_RSI;
|
|
|
|
index = vis->index & size2mask[addrsize];
|
|
|
|
|
|
|
|
/* Count register */
|
|
|
|
count = vis->count & size2mask[addrsize];
|
|
|
|
|
|
|
|
gpa = vis->gpa;
|
|
|
|
gpaend = rounddown(gpa + PAGE_SIZE, PAGE_SIZE);
|
|
|
|
gva = paddr_guest2host(ctx, gpa, gpaend - gpa);
|
|
|
|
|
|
|
|
while (count != 0 && gpa < gpaend) {
|
|
|
|
/*
|
|
|
|
* XXX this may not work for unaligned accesses because
|
|
|
|
* the last access on the page may spill over into the
|
|
|
|
* adjacent page in the linear address space. This is a
|
|
|
|
* problem because we don't have a gla2gpa() mapping of
|
|
|
|
* this adjacent page.
|
|
|
|
*/
|
|
|
|
assert(gpaend - gpa >= bytes);
|
|
|
|
|
|
|
|
val = 0;
|
|
|
|
if (!in)
|
|
|
|
bcopy(gva, &val, bytes);
|
|
|
|
|
|
|
|
retval = handler(ctx, vcpu, in, port, bytes, &val, arg);
|
|
|
|
if (retval != 0)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (in)
|
|
|
|
bcopy(&val, gva, bytes);
|
|
|
|
|
|
|
|
/* Update index */
|
|
|
|
if (vis->rflags & PSL_D)
|
|
|
|
index -= bytes;
|
|
|
|
else
|
|
|
|
index += bytes;
|
|
|
|
|
|
|
|
count--;
|
|
|
|
gva += bytes;
|
|
|
|
gpa += bytes;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Update index register */
|
|
|
|
error = vie_update_register(ctx, vcpu, idxreg, index, addrsize);
|
|
|
|
assert(error == 0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update count register only if the instruction had a repeat
|
|
|
|
* prefix.
|
|
|
|
*/
|
|
|
|
if (rep) {
|
|
|
|
error = vie_update_register(ctx, vcpu, VM_REG_GUEST_RCX,
|
|
|
|
count, addrsize);
|
|
|
|
assert(error == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Restart the instruction if more iterations remain */
|
|
|
|
if (retval == INOUT_OK && count != 0)
|
|
|
|
retval = INOUT_RESTART;
|
|
|
|
} else {
|
|
|
|
if (!in) {
|
|
|
|
val = vmexit->u.inout.eax & size2mask[bytes];
|
|
|
|
}
|
|
|
|
retval = handler(ctx, vcpu, in, port, bytes, &val, arg);
|
|
|
|
if (retval == 0 && in) {
|
|
|
|
vmexit->u.inout.eax &= ~size2mask[bytes];
|
|
|
|
vmexit->u.inout.eax |= val & size2mask[bytes];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (retval);
|
2011-05-13 04:54:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
init_inout(void)
|
|
|
|
{
|
|
|
|
struct inout_port **iopp, *iop;
|
2011-05-19 21:53:25 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up the default handler for all ports
|
|
|
|
*/
|
2013-04-10 02:12:39 +00:00
|
|
|
register_default_iohandler(0, MAX_IOPORTS);
|
2011-05-13 04:54:01 +00:00
|
|
|
|
2011-05-19 21:53:25 +00:00
|
|
|
/*
|
|
|
|
* Overwrite with specified handlers
|
|
|
|
*/
|
2011-05-13 04:54:01 +00:00
|
|
|
SET_FOREACH(iopp, inout_port_set) {
|
|
|
|
iop = *iopp;
|
|
|
|
assert(iop->port < MAX_IOPORTS);
|
|
|
|
inout_handlers[iop->port].name = iop->name;
|
|
|
|
inout_handlers[iop->port].flags = iop->flags;
|
|
|
|
inout_handlers[iop->port].handler = iop->handler;
|
|
|
|
inout_handlers[iop->port].arg = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
register_inout(struct inout_port *iop)
|
|
|
|
{
|
2013-04-10 02:12:39 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
VERIFY_IOPORT(iop->port, iop->size);
|
2013-10-29 00:18:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Verify that the new registration is not overwriting an already
|
|
|
|
* allocated i/o range.
|
|
|
|
*/
|
|
|
|
if ((iop->flags & IOPORT_F_DEFAULT) == 0) {
|
|
|
|
for (i = iop->port; i < iop->port + iop->size; i++) {
|
|
|
|
if ((inout_handlers[i].flags & IOPORT_F_DEFAULT) == 0)
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-10 02:12:39 +00:00
|
|
|
for (i = iop->port; i < iop->port + iop->size; i++) {
|
|
|
|
inout_handlers[i].name = iop->name;
|
|
|
|
inout_handlers[i].flags = iop->flags;
|
|
|
|
inout_handlers[i].handler = iop->handler;
|
|
|
|
inout_handlers[i].arg = iop->arg;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
unregister_inout(struct inout_port *iop)
|
|
|
|
{
|
|
|
|
|
|
|
|
VERIFY_IOPORT(iop->port, iop->size);
|
|
|
|
assert(inout_handlers[iop->port].name == iop->name);
|
|
|
|
|
|
|
|
register_default_iohandler(iop->port, iop->size);
|
2011-05-13 04:54:01 +00:00
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|