xen_bus_dma.c revision 1.2 1 1.2 bouyer /* $NetBSD: xen_bus_dma.c,v 1.2 2005/08/20 20:06:24 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.2 bouyer __KERNEL_RCSID(0, "$NetBSD: xen_bus_dma.c,v 1.2 2005/08/20 20:06:24 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.1 bouyer 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.1 bouyer
81 1.1 bouyer TAILQ_INIT(&freelist);
82 1.1 bouyer
83 1.1 bouyer /*
84 1.1 bouyer * When requesting a contigous memory region, the hypervisor will
85 1.1 bouyer * return a memory range aligned on size. This will automagically
86 1.1 bouyer * handle "boundary", but the only way to enforce alignment
87 1.1 bouyer * is to request a memory region of size max(alignment, size).
88 1.1 bouyer */
89 1.1 bouyer order = max(get_order(size), get_order(alignment));
90 1.1 bouyer npages = (1 << order);
91 1.1 bouyer npagesreq = (size >> PAGE_SHIFT);
92 1.1 bouyer KASSERT(npages >= npagesreq);
93 1.1 bouyer
94 1.1 bouyer /* get npages from UWM, and give them back to the hypervisor */
95 1.1 bouyer error = uvm_pglistalloc(npages << PAGE_SHIFT, 0, avail_end, 0, 0,
96 1.1 bouyer mlistp, npages, (flags & BUS_DMA_NOWAIT) == 0);
97 1.1 bouyer if (error)
98 1.1 bouyer return (error);
99 1.1 bouyer
100 1.1 bouyer for (pg = mlistp->tqh_first; pg != NULL; pg = pg->pageq.tqe_next) {
101 1.1 bouyer pa = VM_PAGE_TO_PHYS(pg);
102 1.1 bouyer mfn = xpmap_ptom(pa) >> PAGE_SHIFT;
103 1.1 bouyer xpmap_phys_to_machine_mapping[
104 1.1 bouyer (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = INVALID_P2M_ENTRY;
105 1.1 bouyer if (HYPERVISOR_dom_mem_op(MEMOP_decrease_reservation,
106 1.1 bouyer &mfn, 1, 0) != 1) {
107 1.1 bouyer printf("xen_alloc_contig: MEMOP_decrease_reservation "
108 1.1 bouyer "failed!\n");
109 1.1 bouyer return ENOMEM;
110 1.1 bouyer }
111 1.1 bouyer }
112 1.1 bouyer /* Get the new contiguous memory extent */
113 1.1 bouyer if (HYPERVISOR_dom_mem_op(MEMOP_increase_reservation,
114 1.1 bouyer &mfn, 1, order) != 1) {
115 1.1 bouyer printf("xen_alloc_contig: MEMOP_increase_reservation "
116 1.1 bouyer "failed!\n");
117 1.1 bouyer return ENOMEM;
118 1.1 bouyer }
119 1.1 bouyer s = splvm();
120 1.1 bouyer /* Map the new extent in place of the old pages */
121 1.1 bouyer for (pg = mlistp->tqh_first, i = 0; pg != NULL; pg = pgnext, i++) {
122 1.1 bouyer pgnext = pg->pageq.tqe_next;
123 1.1 bouyer pa = VM_PAGE_TO_PHYS(pg);
124 1.1 bouyer xpmap_phys_to_machine_mapping[
125 1.1 bouyer (pa - XPMAP_OFFSET) >> PAGE_SHIFT] = mfn+i;
126 1.1 bouyer xpq_queue_machphys_update((mfn+i) << PAGE_SHIFT, pa);
127 1.1 bouyer /* while here, give extra pages back to UVM */
128 1.1 bouyer if (i >= npagesreq) {
129 1.1 bouyer TAILQ_REMOVE(mlistp, pg, pageq);
130 1.1 bouyer uvm_pagefree(pg);
131 1.1 bouyer }
132 1.1 bouyer
133 1.1 bouyer }
134 1.1 bouyer /* Flush updates through and flush the TLB */
135 1.1 bouyer xpq_queue_tlb_flush();
136 1.1 bouyer xpq_flush_queue();
137 1.1 bouyer splx(s);
138 1.1 bouyer return 0;
139 1.1 bouyer }
140 1.1 bouyer
141 1.1 bouyer
142 1.1 bouyer /*
143 1.1 bouyer * Allocate physical memory from the given physical address range.
144 1.1 bouyer * Called by DMA-safe memory allocation methods.
145 1.1 bouyer * We need our own version to deal with physical vs machine addresses.
146 1.1 bouyer */
147 1.1 bouyer int
148 1.1 bouyer _xen_bus_dmamem_alloc_range(bus_dma_tag_t t, bus_size_t size,
149 1.1 bouyer bus_size_t alignment, bus_size_t boundary, bus_dma_segment_t *segs,
150 1.1 bouyer int nsegs, int *rsegs, int flags, bus_addr_t low, bus_addr_t high)
151 1.1 bouyer {
152 1.1 bouyer paddr_t curaddr, lastaddr;
153 1.1 bouyer bus_addr_t bus_curaddr, bus_lastaddr;
154 1.1 bouyer struct vm_page *m;
155 1.1 bouyer struct pglist mlist;
156 1.1 bouyer int curseg, error;
157 1.1 bouyer int doingrealloc = 0;
158 1.1 bouyer
159 1.1 bouyer /* Always round the size. */
160 1.1 bouyer size = round_page(size);
161 1.1 bouyer
162 1.2 bouyer KASSERT((alignment & (alignment - 1)) == 0);
163 1.2 bouyer KASSERT((boundary & (boundary - 1)) == 0);
164 1.2 bouyer if (alignment < PAGE_SIZE)
165 1.2 bouyer alignment = PAGE_SIZE;
166 1.2 bouyer if (boundary != 0 && boundary < size)
167 1.2 bouyer return (EINVAL);
168 1.2 bouyer
169 1.1 bouyer /*
170 1.1 bouyer * Allocate pages from the VM system.
171 1.1 bouyer */
172 1.1 bouyer error = uvm_pglistalloc(size, 0, avail_end, alignment, boundary,
173 1.1 bouyer &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
174 1.1 bouyer if (error)
175 1.1 bouyer return (error);
176 1.1 bouyer again:
177 1.1 bouyer
178 1.1 bouyer /*
179 1.1 bouyer * Compute the location, size, and number of segments actually
180 1.1 bouyer * returned by the VM code.
181 1.1 bouyer */
182 1.1 bouyer m = mlist.tqh_first;
183 1.1 bouyer curseg = 0;
184 1.1 bouyer lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m);
185 1.1 bouyer segs[curseg].ds_len = PAGE_SIZE;
186 1.1 bouyer m = m->pageq.tqe_next;
187 1.2 bouyer if ((_BUS_PHYS_TO_BUS(segs[curseg].ds_addr) & (alignment - 1)) != 0)
188 1.2 bouyer goto dorealloc;
189 1.1 bouyer
190 1.1 bouyer for (; m != NULL; m = m->pageq.tqe_next) {
191 1.1 bouyer curaddr = VM_PAGE_TO_PHYS(m);
192 1.1 bouyer bus_curaddr = _BUS_PHYS_TO_BUS(curaddr);
193 1.1 bouyer bus_lastaddr = _BUS_PHYS_TO_BUS(lastaddr);
194 1.1 bouyer if ((bus_lastaddr < low || bus_lastaddr >= high) ||
195 1.1 bouyer (bus_curaddr < low || bus_curaddr >= high)) {
196 1.1 bouyer /*
197 1.1 bouyer * If machine addresses are outside the allowed
198 1.1 bouyer * range we have to bail. Xen2 doesn't offer an
199 1.1 bouyer * interface to get memory in a specific address
200 1.1 bouyer * range.
201 1.1 bouyer */
202 1.1 bouyer printf("_xen_bus_dmamem_alloc_range: no way to "
203 1.1 bouyer "enforce address range\n");
204 1.1 bouyer return EINVAL;
205 1.1 bouyer }
206 1.2 bouyer if (bus_curaddr == (bus_lastaddr + PAGE_SIZE)) {
207 1.1 bouyer segs[curseg].ds_len += PAGE_SIZE;
208 1.2 bouyer if ((bus_lastaddr & boundary) !=
209 1.2 bouyer (bus_curaddr & boundary))
210 1.2 bouyer goto dorealloc;
211 1.2 bouyer }
212 1.1 bouyer else {
213 1.1 bouyer curseg++;
214 1.2 bouyer if (curseg >= nsegs ||
215 1.2 bouyer (bus_curaddr & (alignment - 1)) != 0) {
216 1.2 bouyer dorealloc:
217 1.1 bouyer if (doingrealloc == 1)
218 1.1 bouyer panic("_xen_bus_dmamem_alloc_range: "
219 1.1 bouyer "xen_alloc_contig returned "
220 1.1 bouyer "too much segments");
221 1.1 bouyer doingrealloc = 1;
222 1.1 bouyer /*
223 1.1 bouyer * Too much segments. Free this memory and
224 1.1 bouyer * get a contigous segment from the hypervisor.
225 1.1 bouyer */
226 1.1 bouyer uvm_pglistfree(&mlist);
227 1.1 bouyer for (curseg = 0; curseg < nsegs; curseg++) {
228 1.1 bouyer segs[curseg].ds_addr = 0;
229 1.1 bouyer segs[curseg].ds_len = 0;
230 1.1 bouyer }
231 1.1 bouyer error = _xen_alloc_contig(size, alignment,
232 1.1 bouyer boundary, &mlist, flags);
233 1.1 bouyer if (error)
234 1.1 bouyer return error;
235 1.1 bouyer goto again;
236 1.1 bouyer }
237 1.1 bouyer segs[curseg].ds_addr = curaddr;
238 1.1 bouyer segs[curseg].ds_len = PAGE_SIZE;
239 1.1 bouyer }
240 1.1 bouyer lastaddr = curaddr;
241 1.1 bouyer }
242 1.1 bouyer
243 1.1 bouyer *rsegs = curseg + 1;
244 1.1 bouyer
245 1.1 bouyer return (0);
246 1.1 bouyer }
247