Home | History | Annotate | Line # | Download | only in x86
xen_shm_machdep.c revision 1.14
      1  1.14       chs /*      $NetBSD: xen_shm_machdep.c,v 1.14 2020/04/13 00:27:16 chs Exp $      */
      2   1.2    bouyer 
      3   1.2    bouyer /*
      4   1.2    bouyer  * Copyright (c) 2006 Manuel Bouyer.
      5   1.2    bouyer  *
      6   1.2    bouyer  * Redistribution and use in source and binary forms, with or without
      7   1.2    bouyer  * modification, are permitted provided that the following conditions
      8   1.2    bouyer  * are met:
      9   1.2    bouyer  * 1. Redistributions of source code must retain the above copyright
     10   1.2    bouyer  *    notice, this list of conditions and the following disclaimer.
     11   1.2    bouyer  * 2. Redistributions in binary form must reproduce the above copyright
     12   1.2    bouyer  *    notice, this list of conditions and the following disclaimer in the
     13   1.2    bouyer  *    documentation and/or other materials provided with the distribution.
     14   1.2    bouyer  *
     15   1.2    bouyer  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     16   1.2    bouyer  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     17   1.2    bouyer  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     18   1.2    bouyer  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     19   1.2    bouyer  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     20   1.2    bouyer  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     21   1.2    bouyer  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     22   1.2    bouyer  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     23   1.2    bouyer  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     24   1.2    bouyer  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     25   1.2    bouyer  */
     26   1.2    bouyer 
     27   1.3    bouyer #include <sys/cdefs.h>
     28  1.14       chs __KERNEL_RCSID(0, "$NetBSD: xen_shm_machdep.c,v 1.14 2020/04/13 00:27:16 chs Exp $");
     29   1.3    bouyer 
     30   1.2    bouyer #include <sys/types.h>
     31   1.2    bouyer #include <sys/param.h>
     32   1.2    bouyer #include <sys/systm.h>
     33   1.2    bouyer #include <sys/queue.h>
     34   1.2    bouyer #include <sys/vmem.h>
     35   1.2    bouyer #include <sys/kernel.h>
     36   1.2    bouyer #include <uvm/uvm.h>
     37   1.2    bouyer 
     38   1.2    bouyer #include <machine/pmap.h>
     39   1.2    bouyer #include <xen/hypervisor.h>
     40   1.2    bouyer #include <xen/xen.h>
     41   1.2    bouyer #include <xen/evtchn.h>
     42   1.2    bouyer #include <xen/xen_shm.h>
     43   1.2    bouyer 
     44   1.2    bouyer /*
     45  1.12      maxv  * Helper routines for the backend drivers. This implements the necessary
     46  1.12      maxv  * functions to map a bunch of pages from foreign domains into our kernel VM
     47   1.2    bouyer  * space, do I/O to it, and unmap it.
     48   1.2    bouyer  *
     49   1.9       jym  * At boot time, we grab some kernel VM space that we'll use to map the foreign
     50  1.12      maxv  * pages. We also maintain a virtual-to-machine mapping table to give back
     51   1.2    bouyer  * the appropriate address to bus_dma if requested.
     52  1.12      maxv  *
     53   1.2    bouyer  * If no more VM space is available, we return an error. The caller can then
     54   1.2    bouyer  * register a callback which will be called when the required VM space is
     55   1.2    bouyer  * available.
     56   1.2    bouyer  */
     57   1.2    bouyer 
     58   1.8       snj /* Grab enough VM space to map an entire vbd ring. */
     59   1.2    bouyer /* Xen3 linux guests seems to eat more pages, gives enough for 10 vbd rings */
     60   1.2    bouyer #define BLKIF_RING_SIZE __RING_SIZE((blkif_sring_t *)0, PAGE_SIZE)
     61   1.2    bouyer #define XENSHM_NPAGES (BLKIF_RING_SIZE * (BLKIF_MAX_SEGMENTS_PER_REQUEST + 1) * 10)
     62   1.2    bouyer 
     63   1.2    bouyer /* vm space management */
     64  1.12      maxv static vmem_t *xen_shm_arena __read_mostly;
     65   1.2    bouyer 
     66   1.2    bouyer /* callbacks are registered in a FIFO list. */
     67   1.2    bouyer static SIMPLEQ_HEAD(xen_shm_callback_head, xen_shm_callback_entry)
     68   1.2    bouyer     xen_shm_callbacks;
     69  1.12      maxv 
     70   1.2    bouyer struct xen_shm_callback_entry {
     71   1.2    bouyer 	SIMPLEQ_ENTRY(xen_shm_callback_entry) xshmc_entries;
     72   1.2    bouyer 	int (*xshmc_callback)(void *); /* our callback */
     73   1.2    bouyer 	void *xshmc_arg; /* cookie passed to the callback */
     74   1.2    bouyer };
     75  1.12      maxv 
     76   1.2    bouyer /* a pool of struct xen_shm_callback_entry */
     77   1.2    bouyer static struct pool xen_shm_callback_pool;
     78   1.2    bouyer 
     79   1.2    bouyer #ifdef DEBUG
     80   1.2    bouyer /* for ratecheck(9) */
     81   1.2    bouyer static struct timeval xen_shm_errintvl = { 60, 0 };  /* a minute, each */
     82   1.2    bouyer #endif
     83   1.2    bouyer 
     84   1.2    bouyer void
     85   1.5    cegger xen_shm_init(void)
     86   1.2    bouyer {
     87  1.12      maxv 	vaddr_t xen_shm_base_address;
     88  1.12      maxv 	vaddr_t xen_shm_end_address;
     89  1.12      maxv 	u_long xen_shm_base_address_pg;
     90  1.12      maxv 	vsize_t xen_shm_size;
     91  1.12      maxv 
     92   1.2    bouyer 	SIMPLEQ_INIT(&xen_shm_callbacks);
     93   1.2    bouyer 	pool_init(&xen_shm_callback_pool, sizeof(struct xen_shm_callback_entry),
     94   1.2    bouyer 	    0, 0, 0, "xshmc", NULL, IPL_VM);
     95   1.2    bouyer 	/* ensure we'll always get items */
     96  1.14       chs 	pool_prime(&xen_shm_callback_pool, 1);
     97   1.2    bouyer 
     98  1.12      maxv 	xen_shm_size = (XENSHM_NPAGES * PAGE_SIZE);
     99  1.12      maxv 
    100   1.2    bouyer 	xen_shm_base_address = uvm_km_alloc(kernel_map, xen_shm_size, 0,
    101   1.2    bouyer 	    UVM_KMF_VAONLY);
    102   1.2    bouyer 	xen_shm_end_address = xen_shm_base_address + xen_shm_size;
    103   1.2    bouyer 	xen_shm_base_address_pg = xen_shm_base_address >> PAGE_SHIFT;
    104   1.2    bouyer 	if (xen_shm_base_address == 0) {
    105   1.2    bouyer 		panic("xen_shm_init no VM space");
    106   1.2    bouyer 	}
    107  1.12      maxv 	xen_shm_arena = vmem_create("xen_shm", xen_shm_base_address_pg,
    108   1.2    bouyer 	    (xen_shm_end_address >> PAGE_SHIFT) - 1 - xen_shm_base_address_pg,
    109   1.2    bouyer 	    1, NULL, NULL, NULL, 1, VM_NOSLEEP, IPL_VM);
    110   1.2    bouyer 	if (xen_shm_arena == NULL) {
    111   1.2    bouyer 		panic("xen_shm_init no arena");
    112   1.2    bouyer 	}
    113   1.2    bouyer }
    114   1.2    bouyer 
    115   1.2    bouyer int
    116   1.2    bouyer xen_shm_map(int nentries, int domid, grant_ref_t *grefp, vaddr_t *vap,
    117   1.2    bouyer     grant_handle_t *handlep, int flags)
    118   1.2    bouyer {
    119  1.12      maxv 	gnttab_map_grant_ref_t op[XENSHM_MAX_PAGES_PER_REQUEST];
    120  1.12      maxv 	vmem_addr_t new_va_pg;
    121   1.2    bouyer 	vaddr_t new_va;
    122  1.12      maxv 	int ret, i, s;
    123   1.2    bouyer 
    124   1.2    bouyer #ifdef DIAGNOSTIC
    125   1.2    bouyer 	if (nentries > XENSHM_MAX_PAGES_PER_REQUEST) {
    126  1.12      maxv 		panic("xen_shm_map: %d entries", nentries);
    127   1.2    bouyer 	}
    128   1.2    bouyer #endif
    129  1.12      maxv 
    130  1.11  jdolecek 	/* XXXSMP */
    131   1.2    bouyer 	s = splvm(); /* splvm is the lowest level blocking disk and net IRQ */
    132  1.12      maxv 
    133   1.2    bouyer 	/*
    134  1.12      maxv 	 * If a driver is waiting for resources, don't try to allocate
    135   1.2    bouyer 	 * yet. This is to avoid a flood of small requests stalling large
    136   1.2    bouyer 	 * ones.
    137   1.2    bouyer 	 */
    138   1.2    bouyer 	if (__predict_false(SIMPLEQ_FIRST(&xen_shm_callbacks) != NULL) &&
    139   1.2    bouyer 	    (flags & XSHM_CALLBACK) == 0) {
    140  1.12      maxv 		splx(s);
    141   1.2    bouyer #ifdef DEBUG
    142   1.2    bouyer 		static struct timeval lasttime;
    143   1.2    bouyer 		if (ratecheck(&lasttime, &xen_shm_errintvl))
    144   1.2    bouyer 			printf("xen_shm_map: ENOMEM1\n");
    145   1.2    bouyer #endif
    146   1.2    bouyer 		return ENOMEM;
    147   1.2    bouyer 	}
    148  1.12      maxv 
    149  1.12      maxv 	/* Allocate the needed virtual space. */
    150  1.10    dyoung 	if (vmem_alloc(xen_shm_arena, nentries,
    151  1.10    dyoung 	    VM_INSTANTFIT | VM_NOSLEEP, &new_va_pg) != 0) {
    152  1.12      maxv 		splx(s);
    153   1.2    bouyer #ifdef DEBUG
    154   1.2    bouyer 		static struct timeval lasttime;
    155   1.2    bouyer 		if (ratecheck(&lasttime, &xen_shm_errintvl))
    156   1.2    bouyer 			printf("xen_shm_map: ENOMEM\n");
    157   1.2    bouyer #endif
    158   1.2    bouyer 		return ENOMEM;
    159   1.2    bouyer 	}
    160   1.2    bouyer 	splx(s);
    161   1.2    bouyer 
    162   1.2    bouyer 	new_va = new_va_pg << PAGE_SHIFT;
    163   1.2    bouyer 	for (i = 0; i < nentries; i++) {
    164   1.2    bouyer 		op[i].host_addr = new_va + i * PAGE_SIZE;
    165   1.2    bouyer 		op[i].dom = domid;
    166   1.2    bouyer 		op[i].ref = grefp[i];
    167   1.2    bouyer 		op[i].flags = GNTMAP_host_map |
    168   1.2    bouyer 		    ((flags & XSHM_RO) ? GNTMAP_readonly : 0);
    169   1.2    bouyer 	}
    170  1.12      maxv 
    171  1.12      maxv 	ret = HYPERVISOR_grant_table_op(GNTTABOP_map_grant_ref, op, nentries);
    172  1.12      maxv 	if (__predict_false(ret)) {
    173   1.2    bouyer 		panic("xen_shm_map: HYPERVISOR_grant_table_op failed");
    174  1.12      maxv 	}
    175  1.12      maxv 
    176   1.2    bouyer 	for (i = 0; i < nentries; i++) {
    177   1.2    bouyer 		if (__predict_false(op[i].status))
    178   1.2    bouyer 			return op[i].status;
    179   1.2    bouyer 		handlep[i] = op[i].handle;
    180   1.2    bouyer 	}
    181  1.12      maxv 
    182   1.2    bouyer 	*vap = new_va;
    183   1.2    bouyer 	return 0;
    184   1.2    bouyer }
    185   1.2    bouyer 
    186   1.2    bouyer void
    187   1.2    bouyer xen_shm_unmap(vaddr_t va, int nentries, grant_handle_t *handlep)
    188   1.2    bouyer {
    189   1.2    bouyer 	gnttab_unmap_grant_ref_t op[XENSHM_MAX_PAGES_PER_REQUEST];
    190   1.2    bouyer 	struct xen_shm_callback_entry *xshmc;
    191  1.12      maxv 	int ret, i, s;
    192   1.2    bouyer 
    193   1.2    bouyer #ifdef DIAGNOSTIC
    194   1.2    bouyer 	if (nentries > XENSHM_MAX_PAGES_PER_REQUEST) {
    195  1.12      maxv 		panic("xen_shm_unmap: %d entries", nentries);
    196   1.2    bouyer 	}
    197   1.2    bouyer #endif
    198   1.2    bouyer 
    199   1.2    bouyer 	for (i = 0; i < nentries; i++) {
    200   1.2    bouyer 		op[i].host_addr = va + i * PAGE_SIZE;
    201   1.2    bouyer 		op[i].dev_bus_addr = 0;
    202   1.2    bouyer 		op[i].handle = handlep[i];
    203   1.2    bouyer 	}
    204  1.12      maxv 
    205   1.2    bouyer 	ret = HYPERVISOR_grant_table_op(GNTTABOP_unmap_grant_ref,
    206   1.2    bouyer 	    op, nentries);
    207  1.12      maxv 	if (__predict_false(ret)) {
    208   1.2    bouyer 		panic("xen_shm_unmap: unmap failed");
    209  1.12      maxv 	}
    210  1.12      maxv 
    211   1.2    bouyer 	va = va >> PAGE_SHIFT;
    212  1.12      maxv 
    213  1.11  jdolecek 	/* XXXSMP */
    214   1.2    bouyer 	s = splvm(); /* splvm is the lowest level blocking disk and net IRQ */
    215  1.12      maxv 
    216   1.2    bouyer 	vmem_free(xen_shm_arena, va, nentries);
    217   1.2    bouyer 	while (__predict_false((xshmc = SIMPLEQ_FIRST(&xen_shm_callbacks))
    218   1.2    bouyer 	    != NULL)) {
    219   1.2    bouyer 		SIMPLEQ_REMOVE_HEAD(&xen_shm_callbacks, xshmc_entries);
    220   1.2    bouyer 		splx(s);
    221   1.2    bouyer 		if (xshmc->xshmc_callback(xshmc->xshmc_arg) == 0) {
    222   1.2    bouyer 			/* callback succeeded */
    223  1.11  jdolecek 			s = splvm(); /* XXXSMP */
    224   1.2    bouyer 			pool_put(&xen_shm_callback_pool, xshmc);
    225   1.2    bouyer 		} else {
    226  1.12      maxv 			/* callback failed, probably out of resources */
    227  1.11  jdolecek 			s = splvm(); /* XXXSMP */
    228   1.2    bouyer 			SIMPLEQ_INSERT_TAIL(&xen_shm_callbacks, xshmc,
    229  1.12      maxv 			    xshmc_entries);
    230   1.2    bouyer 			break;
    231   1.2    bouyer 		}
    232   1.2    bouyer 	}
    233  1.12      maxv 
    234   1.2    bouyer 	splx(s);
    235   1.2    bouyer }
    236   1.2    bouyer 
    237   1.2    bouyer int
    238   1.2    bouyer xen_shm_callback(int (*callback)(void *), void *arg)
    239   1.2    bouyer {
    240   1.2    bouyer 	struct xen_shm_callback_entry *xshmc;
    241   1.2    bouyer 	int s;
    242   1.2    bouyer 
    243  1.11  jdolecek 	s = splvm(); /* XXXSMP */
    244   1.2    bouyer 	xshmc = pool_get(&xen_shm_callback_pool, PR_NOWAIT);
    245   1.2    bouyer 	if (xshmc == NULL) {
    246   1.2    bouyer 		splx(s);
    247   1.2    bouyer 		return ENOMEM;
    248   1.2    bouyer 	}
    249   1.2    bouyer 	xshmc->xshmc_arg = arg;
    250   1.2    bouyer 	xshmc->xshmc_callback = callback;
    251   1.2    bouyer 	SIMPLEQ_INSERT_TAIL(&xen_shm_callbacks, xshmc, xshmc_entries);
    252   1.2    bouyer 	splx(s);
    253   1.2    bouyer 	return 0;
    254   1.2    bouyer }
    255