Home | History | Annotate | Line # | Download | only in x86
xen_bus_dma.c revision 1.6
      1  1.6  bouyer /*	$NetBSD: xen_bus_dma.c,v 1.6 2006/01/15 22:09:52 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  * 3. All advertising materials mentioning features or use of this software
     21  1.1  bouyer  *    must display the following acknowledgement:
     22  1.1  bouyer  *	This product includes software developed by the NetBSD
     23  1.1  bouyer  *	Foundation, Inc. and its contributors.
     24  1.1  bouyer  * 4. Neither the name of The NetBSD Foundation nor the names of its
     25  1.1  bouyer  *    contributors may be used to endorse or promote products derived
     26  1.1  bouyer  *    from this software without specific prior written permission.
     27  1.1  bouyer  *
     28  1.1  bouyer  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     29  1.1  bouyer  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     30  1.1  bouyer  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     31  1.1  bouyer  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     32  1.1  bouyer  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     33  1.1  bouyer  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     34  1.1  bouyer  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     35  1.1  bouyer  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     36  1.1  bouyer  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     37  1.1  bouyer  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     38  1.1  bouyer  * POSSIBILITY OF SUCH DAMAGE.
     39  1.1  bouyer  */
     40  1.1  bouyer 
     41  1.1  bouyer #include <sys/cdefs.h>
     42  1.6  bouyer __KERNEL_RCSID(0, "$NetBSD: xen_bus_dma.c,v 1.6 2006/01/15 22:09:52 bouyer Exp $");
     43  1.1  bouyer 
     44  1.1  bouyer #include <sys/param.h>
     45  1.1  bouyer #include <sys/systm.h>
     46  1.1  bouyer #include <sys/kernel.h>
     47  1.1  bouyer #include <sys/malloc.h>
     48  1.1  bouyer #include <sys/mbuf.h>
     49  1.1  bouyer #include <sys/proc.h>
     50  1.1  bouyer 
     51  1.1  bouyer #include <machine/bus.h>
     52  1.1  bouyer #include <machine/bus_private.h>
     53  1.1  bouyer 
     54  1.1  bouyer #include <uvm/uvm_extern.h>
     55  1.1  bouyer 
     56  1.1  bouyer extern paddr_t avail_end;
     57  1.1  bouyer 
     58  1.1  bouyer /* Pure 2^n version of get_order */
     59  1.5   perry static inline int get_order(unsigned long size)
     60  1.1  bouyer {
     61  1.1  bouyer 	int order = -1;
     62  1.1  bouyer 	size = (size - 1) >> (PAGE_SHIFT - 1);
     63  1.1  bouyer 	do {
     64  1.1  bouyer 		size >>= 1;
     65  1.1  bouyer 		order++;
     66  1.1  bouyer 	} while (size);
     67  1.1  bouyer 	return order;
     68  1.1  bouyer }
     69  1.1  bouyer 
     70  1.1  bouyer static int
     71  1.1  bouyer _xen_alloc_contig(bus_size_t size, bus_size_t alignment, bus_size_t boundary,
     72  1.1  bouyer     struct pglist *mlistp, int flags)
     73  1.1  bouyer {
     74  1.1  bouyer 	int order, i;
     75  1.1  bouyer 	unsigned long npagesreq, npages, mfn;
     76  1.1  bouyer 	bus_addr_t pa;
     77  1.1  bouyer 	struct vm_page *pg, *pgnext;
     78  1.1  bouyer 	struct pglist freelist;
     79  1.1  bouyer 	int s, error;
     80  1.6  bouyer #ifdef XEN3
     81  1.6  bouyer 	struct xen_memory_reservation res;
     82  1.6  bouyer #endif
     83  1.1  bouyer 
     84  1.1  bouyer 	TAILQ_INIT(&freelist);
     85  1.1  bouyer 
     86  1.1  bouyer 	/*
     87  1.1  bouyer 	 * When requesting a contigous memory region, the hypervisor will
     88  1.1  bouyer 	 * return a memory range aligned on size. This will automagically
     89  1.1  bouyer 	 * handle "boundary", but the only way to enforce alignment
     90  1.1  bouyer 	 * is to request a memory region of size max(alignment, size).
     91  1.1  bouyer 	 */
     92  1.1  bouyer 	order = max(get_order(size), get_order(alignment));
     93  1.1  bouyer 	npages = (1 << order);
     94  1.1  bouyer 	npagesreq = (size >> PAGE_SHIFT);
     95  1.1  bouyer 	KASSERT(npages >= npagesreq);
     96  1.1  bouyer 
     97  1.1  bouyer 	/* get npages from UWM, and give them back to the hypervisor */
     98  1.1  bouyer 	error = uvm_pglistalloc(npages << PAGE_SHIFT, 0, avail_end, 0, 0,
     99  1.1  bouyer 	    mlistp, npages, (flags & BUS_DMA_NOWAIT) == 0);
    100  1.1  bouyer 	if (error)
    101  1.1  bouyer 		return (error);
    102  1.1  bouyer 
    103  1.1  bouyer 	for (pg = mlistp->tqh_first; pg != NULL; pg = pg->pageq.tqe_next) {
    104  1.1  bouyer 		pa = VM_PAGE_TO_PHYS(pg);
    105  1.1  bouyer 		mfn = xpmap_ptom(pa) >> PAGE_SHIFT;
    106  1.1  bouyer 		xpmap_phys_to_machine_mapping[
    107  1.1  bouyer 		    (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = INVALID_P2M_ENTRY;
    108  1.6  bouyer #ifdef XEN3
    109  1.6  bouyer 		res.extent_start = &mfn;
    110  1.6  bouyer 		res.nr_extents = 1;
    111  1.6  bouyer 		res.extent_order = 0;
    112  1.6  bouyer 		res.domid = DOMID_SELF;
    113  1.6  bouyer 		if (HYPERVISOR_memory_op(XENMEM_decrease_reservation, &res)
    114  1.6  bouyer 		    < 0) {
    115  1.6  bouyer 			printf("xen_alloc_contig: XENMEM_decrease_reservation "
    116  1.6  bouyer 			    "failed!\n");
    117  1.6  bouyer 			return ENOMEM;
    118  1.6  bouyer 		}
    119  1.6  bouyer #else
    120  1.1  bouyer 		if (HYPERVISOR_dom_mem_op(MEMOP_decrease_reservation,
    121  1.1  bouyer 		    &mfn, 1, 0) != 1) {
    122  1.1  bouyer 			printf("xen_alloc_contig: MEMOP_decrease_reservation "
    123  1.1  bouyer 			    "failed!\n");
    124  1.1  bouyer 			return ENOMEM;
    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.6  bouyer 	res.extent_start = &mfn;
    131  1.6  bouyer 	res.nr_extents = 1;
    132  1.6  bouyer 	res.extent_order = order;
    133  1.6  bouyer 	res.address_bits = 31;
    134  1.6  bouyer 	res.domid = DOMID_SELF;
    135  1.6  bouyer 	if (HYPERVISOR_memory_op(XENMEM_increase_reservation, &res) < 0) {
    136  1.6  bouyer 		printf("xen_alloc_contig: XENMEM_increase_reservation "
    137  1.6  bouyer 		    "failed!\n");
    138  1.6  bouyer 		return ENOMEM;
    139  1.6  bouyer 	}
    140  1.6  bouyer #else
    141  1.1  bouyer 	if (HYPERVISOR_dom_mem_op(MEMOP_increase_reservation,
    142  1.1  bouyer 	    &mfn, 1, order) != 1) {
    143  1.1  bouyer 		printf("xen_alloc_contig: MEMOP_increase_reservation "
    144  1.1  bouyer 		    "failed!\n");
    145  1.1  bouyer 		return ENOMEM;
    146  1.1  bouyer 	}
    147  1.6  bouyer #endif
    148  1.1  bouyer 	s = splvm();
    149  1.1  bouyer 	/* Map the new extent in place of the old pages */
    150  1.1  bouyer 	for (pg = mlistp->tqh_first, i = 0; pg != NULL; pg = pgnext, i++) {
    151  1.1  bouyer 		pgnext = pg->pageq.tqe_next;
    152  1.1  bouyer 		pa = VM_PAGE_TO_PHYS(pg);
    153  1.1  bouyer 		xpmap_phys_to_machine_mapping[
    154  1.1  bouyer 		    (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = mfn+i;
    155  1.1  bouyer 		xpq_queue_machphys_update((mfn+i) << PAGE_SHIFT, pa);
    156  1.1  bouyer 		/* while here, give extra pages back to UVM */
    157  1.1  bouyer 		if (i >= npagesreq) {
    158  1.1  bouyer 			TAILQ_REMOVE(mlistp, pg, pageq);
    159  1.1  bouyer 			uvm_pagefree(pg);
    160  1.1  bouyer 		}
    161  1.1  bouyer 
    162  1.1  bouyer 	}
    163  1.1  bouyer 	/* Flush updates through and flush the TLB */
    164  1.1  bouyer 	xpq_queue_tlb_flush();
    165  1.1  bouyer 	xpq_flush_queue();
    166  1.1  bouyer 	splx(s);
    167  1.1  bouyer 	return 0;
    168  1.1  bouyer }
    169  1.1  bouyer 
    170  1.1  bouyer 
    171  1.1  bouyer /*
    172  1.1  bouyer  * Allocate physical memory from the given physical address range.
    173  1.1  bouyer  * Called by DMA-safe memory allocation methods.
    174  1.1  bouyer  * We need our own version to deal with physical vs machine addresses.
    175  1.1  bouyer  */
    176  1.1  bouyer int
    177  1.1  bouyer _xen_bus_dmamem_alloc_range(bus_dma_tag_t t, bus_size_t size,
    178  1.1  bouyer     bus_size_t alignment, bus_size_t boundary, bus_dma_segment_t *segs,
    179  1.1  bouyer     int nsegs, int *rsegs, int flags, bus_addr_t low, bus_addr_t high)
    180  1.1  bouyer {
    181  1.1  bouyer 	paddr_t curaddr, lastaddr;
    182  1.1  bouyer 	bus_addr_t bus_curaddr, bus_lastaddr;
    183  1.1  bouyer 	struct vm_page *m;
    184  1.1  bouyer 	struct pglist mlist;
    185  1.1  bouyer 	int curseg, error;
    186  1.1  bouyer 	int doingrealloc = 0;
    187  1.1  bouyer 
    188  1.1  bouyer 	/* Always round the size. */
    189  1.1  bouyer 	size = round_page(size);
    190  1.1  bouyer 
    191  1.2  bouyer 	KASSERT((alignment & (alignment - 1)) == 0);
    192  1.2  bouyer 	KASSERT((boundary & (boundary - 1)) == 0);
    193  1.2  bouyer 	if (alignment < PAGE_SIZE)
    194  1.2  bouyer 		alignment = PAGE_SIZE;
    195  1.2  bouyer 	if (boundary != 0 && boundary < size)
    196  1.2  bouyer 		return (EINVAL);
    197  1.2  bouyer 
    198  1.1  bouyer 	/*
    199  1.1  bouyer 	 * Allocate pages from the VM system.
    200  1.1  bouyer 	 */
    201  1.1  bouyer 	error = uvm_pglistalloc(size, 0, avail_end, alignment, boundary,
    202  1.1  bouyer 	    &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
    203  1.1  bouyer 	if (error)
    204  1.1  bouyer 		return (error);
    205  1.1  bouyer again:
    206  1.1  bouyer 
    207  1.1  bouyer 	/*
    208  1.1  bouyer 	 * Compute the location, size, and number of segments actually
    209  1.1  bouyer 	 * returned by the VM code.
    210  1.1  bouyer 	 */
    211  1.1  bouyer 	m = mlist.tqh_first;
    212  1.1  bouyer 	curseg = 0;
    213  1.1  bouyer 	lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m);
    214  1.1  bouyer 	segs[curseg].ds_len = PAGE_SIZE;
    215  1.1  bouyer 	m = m->pageq.tqe_next;
    216  1.2  bouyer 	if ((_BUS_PHYS_TO_BUS(segs[curseg].ds_addr) & (alignment - 1)) != 0)
    217  1.2  bouyer 		goto dorealloc;
    218  1.1  bouyer 
    219  1.1  bouyer 	for (; m != NULL; m = m->pageq.tqe_next) {
    220  1.1  bouyer 		curaddr = VM_PAGE_TO_PHYS(m);
    221  1.1  bouyer 		bus_curaddr = _BUS_PHYS_TO_BUS(curaddr);
    222  1.1  bouyer 		bus_lastaddr = _BUS_PHYS_TO_BUS(lastaddr);
    223  1.1  bouyer 		if ((bus_lastaddr < low || bus_lastaddr >= high) ||
    224  1.1  bouyer 		    (bus_curaddr < low || bus_curaddr >= high)) {
    225  1.1  bouyer 			/*
    226  1.1  bouyer 			 * If machine addresses are outside the allowed
    227  1.1  bouyer 			 * range we have to bail. Xen2 doesn't offer an
    228  1.1  bouyer 			 * interface to get memory in a specific address
    229  1.1  bouyer 			 * range.
    230  1.1  bouyer 			 */
    231  1.1  bouyer 			printf("_xen_bus_dmamem_alloc_range: no way to "
    232  1.1  bouyer 			    "enforce address range\n");
    233  1.3  bouyer 			uvm_pglistfree(&mlist);
    234  1.1  bouyer 			return EINVAL;
    235  1.1  bouyer 		}
    236  1.2  bouyer 		if (bus_curaddr == (bus_lastaddr + PAGE_SIZE)) {
    237  1.1  bouyer 			segs[curseg].ds_len += PAGE_SIZE;
    238  1.2  bouyer 			if ((bus_lastaddr & boundary) !=
    239  1.2  bouyer 			    (bus_curaddr & boundary))
    240  1.2  bouyer 				goto dorealloc;
    241  1.2  bouyer 		}
    242  1.1  bouyer 		else {
    243  1.1  bouyer 			curseg++;
    244  1.2  bouyer 			if (curseg >= nsegs ||
    245  1.2  bouyer 			    (bus_curaddr & (alignment - 1)) != 0) {
    246  1.2  bouyer dorealloc:
    247  1.1  bouyer 				if (doingrealloc == 1)
    248  1.1  bouyer 					panic("_xen_bus_dmamem_alloc_range: "
    249  1.1  bouyer 					   "xen_alloc_contig returned "
    250  1.1  bouyer 					   "too much segments");
    251  1.1  bouyer 				doingrealloc = 1;
    252  1.1  bouyer 				/*
    253  1.1  bouyer 				 * Too much segments. Free this memory and
    254  1.1  bouyer 				 * get a contigous segment from the hypervisor.
    255  1.1  bouyer 				 */
    256  1.1  bouyer 				uvm_pglistfree(&mlist);
    257  1.1  bouyer 				for (curseg = 0; curseg < nsegs; curseg++) {
    258  1.1  bouyer 					segs[curseg].ds_addr = 0;
    259  1.1  bouyer 					segs[curseg].ds_len = 0;
    260  1.1  bouyer 				}
    261  1.1  bouyer 				error = _xen_alloc_contig(size, alignment,
    262  1.1  bouyer 				    boundary, &mlist, flags);
    263  1.1  bouyer 				if (error)
    264  1.1  bouyer 					return error;
    265  1.1  bouyer 				goto again;
    266  1.1  bouyer 			}
    267  1.1  bouyer 			segs[curseg].ds_addr = curaddr;
    268  1.1  bouyer 			segs[curseg].ds_len = PAGE_SIZE;
    269  1.1  bouyer 		}
    270  1.1  bouyer 		lastaddr = curaddr;
    271  1.1  bouyer 	}
    272  1.1  bouyer 
    273  1.1  bouyer 	*rsegs = curseg + 1;
    274  1.1  bouyer 
    275  1.1  bouyer 	return (0);
    276  1.1  bouyer }
    277