Home | History | Annotate | Line # | Download | only in x86
xen_bus_dma.c revision 1.14
      1  1.14  bouyer /*	$NetBSD: xen_bus_dma.c,v 1.14 2009/01/24 19:03:12 bouyer Exp $	*/
      2   1.1  bouyer /*	NetBSD bus_dma.c,v 1.21 2005/04/16 07:53:35 yamt Exp */
      3   1.1  bouyer 
      4   1.1  bouyer /*-
      5   1.1  bouyer  * Copyright (c) 1996, 1997, 1998 The NetBSD Foundation, Inc.
      6   1.1  bouyer  * All rights reserved.
      7   1.1  bouyer  *
      8   1.1  bouyer  * This code is derived from software contributed to The NetBSD Foundation
      9   1.1  bouyer  * by Charles M. Hannum and by Jason R. Thorpe of the Numerical Aerospace
     10   1.1  bouyer  * Simulation Facility, NASA Ames Research Center.
     11   1.1  bouyer  *
     12   1.1  bouyer  * Redistribution and use in source and binary forms, with or without
     13   1.1  bouyer  * modification, are permitted provided that the following conditions
     14   1.1  bouyer  * are met:
     15   1.1  bouyer  * 1. Redistributions of source code must retain the above copyright
     16   1.1  bouyer  *    notice, this list of conditions and the following disclaimer.
     17   1.1  bouyer  * 2. Redistributions in binary form must reproduce the above copyright
     18   1.1  bouyer  *    notice, this list of conditions and the following disclaimer in the
     19   1.1  bouyer  *    documentation and/or other materials provided with the distribution.
     20   1.1  bouyer  *
     21   1.1  bouyer  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     22   1.1  bouyer  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     23   1.1  bouyer  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     24   1.1  bouyer  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     25   1.1  bouyer  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     26   1.1  bouyer  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     27   1.1  bouyer  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     28   1.1  bouyer  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     29   1.1  bouyer  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     30   1.1  bouyer  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     31   1.1  bouyer  * POSSIBILITY OF SUCH DAMAGE.
     32   1.1  bouyer  */
     33   1.1  bouyer 
     34   1.1  bouyer #include <sys/cdefs.h>
     35  1.14  bouyer __KERNEL_RCSID(0, "$NetBSD: xen_bus_dma.c,v 1.14 2009/01/24 19:03:12 bouyer Exp $");
     36   1.1  bouyer 
     37   1.1  bouyer #include <sys/param.h>
     38   1.1  bouyer #include <sys/systm.h>
     39   1.1  bouyer #include <sys/kernel.h>
     40   1.1  bouyer #include <sys/mbuf.h>
     41   1.1  bouyer #include <sys/proc.h>
     42   1.1  bouyer 
     43   1.1  bouyer #include <machine/bus.h>
     44   1.1  bouyer #include <machine/bus_private.h>
     45   1.1  bouyer 
     46   1.1  bouyer #include <uvm/uvm_extern.h>
     47   1.1  bouyer 
     48   1.1  bouyer extern paddr_t avail_end;
     49   1.1  bouyer 
     50   1.1  bouyer /* Pure 2^n version of get_order */
     51   1.5   perry static inline int get_order(unsigned long size)
     52   1.1  bouyer {
     53   1.1  bouyer 	int order = -1;
     54   1.1  bouyer 	size = (size - 1) >> (PAGE_SHIFT - 1);
     55   1.1  bouyer 	do {
     56   1.1  bouyer 		size >>= 1;
     57   1.1  bouyer 		order++;
     58   1.1  bouyer 	} while (size);
     59   1.1  bouyer 	return order;
     60   1.1  bouyer }
     61   1.1  bouyer 
     62   1.1  bouyer static int
     63   1.1  bouyer _xen_alloc_contig(bus_size_t size, bus_size_t alignment, bus_size_t boundary,
     64   1.9  bouyer     struct pglist *mlistp, int flags, bus_addr_t low, bus_addr_t high)
     65   1.1  bouyer {
     66   1.1  bouyer 	int order, i;
     67   1.1  bouyer 	unsigned long npagesreq, npages, mfn;
     68   1.1  bouyer 	bus_addr_t pa;
     69   1.1  bouyer 	struct vm_page *pg, *pgnext;
     70   1.1  bouyer 	int s, error;
     71   1.6  bouyer #ifdef XEN3
     72   1.6  bouyer 	struct xen_memory_reservation res;
     73   1.6  bouyer #endif
     74   1.1  bouyer 
     75   1.1  bouyer 	/*
     76   1.1  bouyer 	 * When requesting a contigous memory region, the hypervisor will
     77   1.1  bouyer 	 * return a memory range aligned on size. This will automagically
     78   1.1  bouyer 	 * handle "boundary", but the only way to enforce alignment
     79   1.1  bouyer 	 * is to request a memory region of size max(alignment, size).
     80   1.1  bouyer 	 */
     81   1.1  bouyer 	order = max(get_order(size), get_order(alignment));
     82   1.1  bouyer 	npages = (1 << order);
     83   1.1  bouyer 	npagesreq = (size >> PAGE_SHIFT);
     84   1.1  bouyer 	KASSERT(npages >= npagesreq);
     85   1.1  bouyer 
     86   1.1  bouyer 	/* get npages from UWM, and give them back to the hypervisor */
     87   1.1  bouyer 	error = uvm_pglistalloc(npages << PAGE_SHIFT, 0, avail_end, 0, 0,
     88   1.1  bouyer 	    mlistp, npages, (flags & BUS_DMA_NOWAIT) == 0);
     89   1.1  bouyer 	if (error)
     90   1.1  bouyer 		return (error);
     91   1.1  bouyer 
     92  1.11      ad 	for (pg = mlistp->tqh_first; pg != NULL; pg = pg->pageq.queue.tqe_next) {
     93   1.1  bouyer 		pa = VM_PAGE_TO_PHYS(pg);
     94   1.1  bouyer 		mfn = xpmap_ptom(pa) >> PAGE_SHIFT;
     95   1.1  bouyer 		xpmap_phys_to_machine_mapping[
     96   1.1  bouyer 		    (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = INVALID_P2M_ENTRY;
     97   1.6  bouyer #ifdef XEN3
     98  1.12  cegger 		xenguest_handle(res.extent_start) = &mfn;
     99   1.6  bouyer 		res.nr_extents = 1;
    100   1.6  bouyer 		res.extent_order = 0;
    101   1.6  bouyer 		res.domid = DOMID_SELF;
    102   1.6  bouyer 		if (HYPERVISOR_memory_op(XENMEM_decrease_reservation, &res)
    103  1.14  bouyer 		    != 1) {
    104   1.8  bouyer #ifdef DEBUG
    105   1.6  bouyer 			printf("xen_alloc_contig: XENMEM_decrease_reservation "
    106   1.6  bouyer 			    "failed!\n");
    107   1.8  bouyer #endif
    108   1.7  bouyer 			xpmap_phys_to_machine_mapping[
    109   1.7  bouyer 			    (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = mfn;
    110   1.7  bouyer 
    111   1.7  bouyer 			error = ENOMEM;
    112   1.7  bouyer 			goto failed;
    113   1.6  bouyer 		}
    114   1.6  bouyer #else
    115   1.1  bouyer 		if (HYPERVISOR_dom_mem_op(MEMOP_decrease_reservation,
    116   1.1  bouyer 		    &mfn, 1, 0) != 1) {
    117   1.8  bouyer #ifdef DEBUG
    118   1.1  bouyer 			printf("xen_alloc_contig: MEMOP_decrease_reservation "
    119   1.1  bouyer 			    "failed!\n");
    120   1.8  bouyer #endif
    121   1.7  bouyer 			xpmap_phys_to_machine_mapping[
    122   1.7  bouyer 			    (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = mfn;
    123   1.7  bouyer 			error = ENOMEM;
    124   1.7  bouyer 			goto failed;
    125   1.1  bouyer 		}
    126   1.6  bouyer #endif
    127   1.1  bouyer 	}
    128   1.1  bouyer 	/* Get the new contiguous memory extent */
    129   1.6  bouyer #ifdef XEN3
    130  1.12  cegger 	xenguest_handle(res.extent_start) = &mfn;
    131   1.6  bouyer 	res.nr_extents = 1;
    132   1.6  bouyer 	res.extent_order = order;
    133   1.9  bouyer 	res.address_bits = get_order(high) + PAGE_SHIFT;
    134   1.6  bouyer 	res.domid = DOMID_SELF;
    135  1.14  bouyer 	error = HYPERVISOR_memory_op(XENMEM_increase_reservation, &res);
    136  1.14  bouyer 	if (error != 1) {
    137   1.8  bouyer #ifdef DEBUG
    138   1.6  bouyer 		printf("xen_alloc_contig: XENMEM_increase_reservation "
    139  1.14  bouyer 		    "failed: %d (order %d address_bits %d)\n",
    140  1.14  bouyer 		    error, order, res.address_bits);
    141   1.8  bouyer #endif
    142   1.7  bouyer 		error = ENOMEM;
    143   1.7  bouyer 		pg = NULL;
    144   1.7  bouyer 		goto failed;
    145   1.6  bouyer 	}
    146   1.6  bouyer #else
    147   1.1  bouyer 	if (HYPERVISOR_dom_mem_op(MEMOP_increase_reservation,
    148   1.1  bouyer 	    &mfn, 1, order) != 1) {
    149   1.8  bouyer #ifdef DEBUG
    150   1.1  bouyer 		printf("xen_alloc_contig: MEMOP_increase_reservation "
    151   1.1  bouyer 		    "failed!\n");
    152   1.8  bouyer #endif
    153   1.7  bouyer 		error = ENOMEM;
    154   1.7  bouyer 		pg = NULL;
    155   1.7  bouyer 		goto failed;
    156   1.1  bouyer 	}
    157   1.6  bouyer #endif
    158   1.1  bouyer 	s = splvm();
    159   1.1  bouyer 	/* Map the new extent in place of the old pages */
    160   1.1  bouyer 	for (pg = mlistp->tqh_first, i = 0; pg != NULL; pg = pgnext, i++) {
    161  1.11      ad 		pgnext = pg->pageq.queue.tqe_next;
    162   1.1  bouyer 		pa = VM_PAGE_TO_PHYS(pg);
    163   1.1  bouyer 		xpmap_phys_to_machine_mapping[
    164   1.1  bouyer 		    (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = mfn+i;
    165   1.1  bouyer 		xpq_queue_machphys_update((mfn+i) << PAGE_SHIFT, pa);
    166   1.1  bouyer 		/* while here, give extra pages back to UVM */
    167   1.1  bouyer 		if (i >= npagesreq) {
    168  1.11      ad 			TAILQ_REMOVE(mlistp, pg, pageq.queue);
    169   1.1  bouyer 			uvm_pagefree(pg);
    170   1.1  bouyer 		}
    171   1.1  bouyer 	}
    172   1.1  bouyer 	/* Flush updates through and flush the TLB */
    173   1.1  bouyer 	xpq_queue_tlb_flush();
    174   1.1  bouyer 	xpq_flush_queue();
    175   1.1  bouyer 	splx(s);
    176   1.1  bouyer 	return 0;
    177   1.7  bouyer 
    178   1.7  bouyer failed:
    179   1.7  bouyer 	/*
    180   1.7  bouyer 	 * Attempt to recover from a failed decrease or increase reservation:
    181   1.7  bouyer 	 * if decrease_reservation failed, we don't have given all pages
    182   1.7  bouyer 	 * back to Xen; give them back to UVM, and get the missing pages
    183   1.7  bouyer 	 * from Xen.
    184   1.7  bouyer 	 * if increase_reservation failed, we expect pg to be NULL and we just
    185   1.7  bouyer 	 * get back the missing pages from Xen one by one.
    186   1.7  bouyer 	 */
    187   1.7  bouyer 	/* give back remaining pages to UVM */
    188   1.7  bouyer 	for (; pg != NULL; pg = pgnext) {
    189  1.11      ad 		pgnext = pg->pageq.queue.tqe_next;
    190  1.11      ad 		TAILQ_REMOVE(mlistp, pg, pageq.queue);
    191   1.7  bouyer 		uvm_pagefree(pg);
    192   1.7  bouyer 	}
    193   1.7  bouyer 	/* remplace the pages that we already gave to Xen */
    194   1.7  bouyer 	s = splvm();
    195   1.7  bouyer 	for (pg = mlistp->tqh_first; pg != NULL; pg = pgnext) {
    196  1.11      ad 		pgnext = pg->pageq.queue.tqe_next;
    197   1.7  bouyer #ifdef XEN3
    198  1.12  cegger 		xenguest_handle(res.extent_start) = &mfn;
    199   1.7  bouyer 		res.nr_extents = 1;
    200   1.7  bouyer 		res.extent_order = 0;
    201   1.9  bouyer 		res.address_bits = 32;
    202   1.7  bouyer 		res.domid = DOMID_SELF;
    203   1.7  bouyer 		if (HYPERVISOR_memory_op(XENMEM_increase_reservation, &res)
    204   1.7  bouyer 		    < 0) {
    205   1.7  bouyer 			printf("xen_alloc_contig: recovery "
    206   1.7  bouyer 			    "XENMEM_increase_reservation failed!\n");
    207   1.7  bouyer 			break;
    208   1.7  bouyer 		}
    209   1.7  bouyer #else
    210   1.7  bouyer 		if (HYPERVISOR_dom_mem_op(MEMOP_increase_reservation,
    211   1.7  bouyer 		    &mfn, 1, 0) != 1) {
    212   1.7  bouyer 			printf("xen_alloc_contig: recovery "
    213   1.7  bouyer 			    "MEMOP_increase_reservation failed!\n");
    214   1.7  bouyer 			break;
    215   1.7  bouyer 		}
    216   1.7  bouyer #endif
    217   1.7  bouyer 		pa = VM_PAGE_TO_PHYS(pg);
    218   1.7  bouyer 		xpmap_phys_to_machine_mapping[
    219   1.7  bouyer 		    (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = mfn;
    220   1.7  bouyer 		xpq_queue_machphys_update((mfn) << PAGE_SHIFT, pa);
    221  1.11      ad 		TAILQ_REMOVE(mlistp, pg, pageq.queue);
    222   1.7  bouyer 		uvm_pagefree(pg);
    223   1.7  bouyer 	}
    224   1.7  bouyer 	/* Flush updates through and flush the TLB */
    225   1.7  bouyer 	xpq_queue_tlb_flush();
    226   1.7  bouyer 	xpq_flush_queue();
    227   1.7  bouyer 	splx(s);
    228   1.7  bouyer 	return error;
    229   1.1  bouyer }
    230   1.1  bouyer 
    231   1.1  bouyer 
    232   1.1  bouyer /*
    233   1.1  bouyer  * Allocate physical memory from the given physical address range.
    234   1.1  bouyer  * Called by DMA-safe memory allocation methods.
    235   1.1  bouyer  * We need our own version to deal with physical vs machine addresses.
    236   1.1  bouyer  */
    237   1.1  bouyer int
    238   1.1  bouyer _xen_bus_dmamem_alloc_range(bus_dma_tag_t t, bus_size_t size,
    239   1.1  bouyer     bus_size_t alignment, bus_size_t boundary, bus_dma_segment_t *segs,
    240   1.1  bouyer     int nsegs, int *rsegs, int flags, bus_addr_t low, bus_addr_t high)
    241   1.1  bouyer {
    242   1.7  bouyer 	bus_addr_t curaddr, lastaddr;
    243   1.1  bouyer 	struct vm_page *m;
    244   1.1  bouyer 	struct pglist mlist;
    245   1.1  bouyer 	int curseg, error;
    246   1.1  bouyer 	int doingrealloc = 0;
    247   1.1  bouyer 
    248   1.1  bouyer 	/* Always round the size. */
    249   1.1  bouyer 	size = round_page(size);
    250   1.1  bouyer 
    251   1.2  bouyer 	KASSERT((alignment & (alignment - 1)) == 0);
    252   1.2  bouyer 	KASSERT((boundary & (boundary - 1)) == 0);
    253   1.2  bouyer 	if (alignment < PAGE_SIZE)
    254   1.2  bouyer 		alignment = PAGE_SIZE;
    255   1.2  bouyer 	if (boundary != 0 && boundary < size)
    256   1.2  bouyer 		return (EINVAL);
    257   1.2  bouyer 
    258   1.1  bouyer 	/*
    259   1.1  bouyer 	 * Allocate pages from the VM system.
    260   1.1  bouyer 	 */
    261   1.1  bouyer 	error = uvm_pglistalloc(size, 0, avail_end, alignment, boundary,
    262   1.1  bouyer 	    &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
    263   1.1  bouyer 	if (error)
    264   1.1  bouyer 		return (error);
    265   1.1  bouyer again:
    266   1.1  bouyer 
    267   1.1  bouyer 	/*
    268   1.1  bouyer 	 * Compute the location, size, and number of segments actually
    269   1.1  bouyer 	 * returned by the VM code.
    270   1.1  bouyer 	 */
    271   1.1  bouyer 	m = mlist.tqh_first;
    272   1.1  bouyer 	curseg = 0;
    273   1.9  bouyer 	curaddr = lastaddr = segs[curseg].ds_addr = _BUS_VM_PAGE_TO_BUS(m);
    274   1.9  bouyer 	if (curaddr < low || curaddr >= high)
    275   1.9  bouyer 		goto badaddr;
    276   1.1  bouyer 	segs[curseg].ds_len = PAGE_SIZE;
    277  1.11      ad 	m = m->pageq.queue.tqe_next;
    278   1.7  bouyer 	if ((segs[curseg].ds_addr & (alignment - 1)) != 0)
    279   1.2  bouyer 		goto dorealloc;
    280   1.1  bouyer 
    281  1.11      ad 	for (; m != NULL; m = m->pageq.queue.tqe_next) {
    282   1.7  bouyer 		curaddr = _BUS_VM_PAGE_TO_BUS(m);
    283   1.9  bouyer 		if (curaddr < low || curaddr >= high)
    284   1.9  bouyer 			goto badaddr;
    285   1.7  bouyer 		if (curaddr == (lastaddr + PAGE_SIZE)) {
    286   1.1  bouyer 			segs[curseg].ds_len += PAGE_SIZE;
    287   1.9  bouyer 			if ((lastaddr & boundary) != (curaddr & boundary))
    288   1.2  bouyer 				goto dorealloc;
    289   1.7  bouyer 		} else {
    290   1.1  bouyer 			curseg++;
    291   1.9  bouyer 			if (curseg >= nsegs || (curaddr & (alignment - 1)) != 0)
    292   1.9  bouyer 				goto dorealloc;
    293   1.1  bouyer 			segs[curseg].ds_addr = curaddr;
    294   1.1  bouyer 			segs[curseg].ds_len = PAGE_SIZE;
    295   1.1  bouyer 		}
    296   1.1  bouyer 		lastaddr = curaddr;
    297   1.1  bouyer 	}
    298   1.1  bouyer 
    299   1.1  bouyer 	*rsegs = curseg + 1;
    300   1.9  bouyer 	return (0);
    301   1.1  bouyer 
    302   1.9  bouyer badaddr:
    303   1.9  bouyer #ifdef XEN3
    304   1.9  bouyer 	if (doingrealloc == 0)
    305   1.9  bouyer 		goto dorealloc;
    306   1.9  bouyer 	if (curaddr < low) {
    307   1.9  bouyer 		/* no way to enforce this */
    308   1.9  bouyer 		printf("_xen_bus_dmamem_alloc_range: no way to "
    309  1.14  bouyer 		    "enforce address range (0x%" PRIx64 " - 0x%" PRIx64 ")\n",
    310  1.14  bouyer 		    (uint64_t)low, (uint64_t)high);
    311   1.9  bouyer 		uvm_pglistfree(&mlist);
    312   1.9  bouyer 		return EINVAL;
    313   1.9  bouyer 	}
    314   1.9  bouyer 	printf("xen_bus_dmamem_alloc_range: "
    315   1.9  bouyer 	    "curraddr=0x%lx > high=0x%lx\n",
    316   1.9  bouyer 	    (u_long)curaddr, (u_long)high);
    317   1.9  bouyer 	panic("xen_bus_dmamem_alloc_range 1");
    318   1.9  bouyer #else /* !XEN3 */
    319   1.9  bouyer 	/*
    320   1.9  bouyer 	 * If machine addresses are outside the allowed
    321   1.9  bouyer 	 * range we have to bail. Xen2 doesn't offer an
    322   1.9  bouyer 	 * interface to get memory in a specific address
    323   1.9  bouyer 	 * range.
    324   1.9  bouyer 	 */
    325   1.9  bouyer 	printf("_xen_bus_dmamem_alloc_range: no way to "
    326   1.9  bouyer 	    "enforce address range\n");
    327   1.9  bouyer 	uvm_pglistfree(&mlist);
    328   1.9  bouyer 	return EINVAL;
    329   1.9  bouyer #endif /* XEN3 */
    330   1.9  bouyer dorealloc:
    331   1.9  bouyer 	if (doingrealloc == 1)
    332   1.9  bouyer 		panic("_xen_bus_dmamem_alloc_range: "
    333   1.9  bouyer 		   "xen_alloc_contig returned "
    334   1.9  bouyer 		   "too much segments");
    335   1.9  bouyer 	doingrealloc = 1;
    336   1.9  bouyer 	/*
    337   1.9  bouyer 	 * Too much segments, or memory doesn't fit
    338   1.9  bouyer 	 * constraints. Free this memory and
    339   1.9  bouyer 	 * get a contigous segment from the hypervisor.
    340   1.9  bouyer 	 */
    341   1.9  bouyer 	uvm_pglistfree(&mlist);
    342   1.9  bouyer 	for (curseg = 0; curseg < nsegs; curseg++) {
    343   1.9  bouyer 		segs[curseg].ds_addr = 0;
    344   1.9  bouyer 		segs[curseg].ds_len = 0;
    345   1.9  bouyer 	}
    346   1.9  bouyer 	error = _xen_alloc_contig(size, alignment,
    347   1.9  bouyer 	    boundary, &mlist, flags, low, high);
    348   1.9  bouyer 	if (error)
    349   1.9  bouyer 		return error;
    350   1.9  bouyer 	goto again;
    351   1.1  bouyer }
    352