busdma: Utilize kmalloc_powerof2()
[dragonfly.git] / sys / platform / pc32 / i386 / busdma_machdep.c
CommitLineData
984263bc
MD
1/*
2 * Copyright (c) 1997, 1998 Justin T. Gibbs.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions, and the following disclaimer,
10 * without modification, immediately at the beginning of the file.
11 * 2. The name of the author may not be used to endorse or promote products
12 * derived from this software without specific prior written permission.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
18 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
497a413c 26 * $FreeBSD: src/sys/i386/i386/busdma_machdep.c,v 1.94 2008/08/15 20:51:31 kmacy Exp $
984263bc
MD
27 */
28
29#include <sys/param.h>
30#include <sys/systm.h>
31#include <sys/malloc.h>
32#include <sys/mbuf.h>
33#include <sys/uio.h>
1f7ab7c9 34#include <sys/bus_dma.h>
1fae3d5f
SZ
35#include <sys/kernel.h>
36#include <sys/sysctl.h>
78c79c21 37#include <sys/lock.h>
684a93c4
MD
38
39#include <sys/thread2.h>
78c79c21 40#include <sys/spinlock2.h>
684a93c4 41#include <sys/mplock2.h>
984263bc
MD
42
43#include <vm/vm.h>
44#include <vm/vm_page.h>
45
46/* XXX needed for to access pmap to convert per-proc virtual to physical */
47#include <sys/proc.h>
48#include <sys/lock.h>
49#include <vm/vm_map.h>
50
984263bc
MD
51#include <machine/md_var.h>
52
f3513319 53#define MAX_BPAGES 1024
984263bc 54
6eed46e7
MD
55/*
56 * 16 x N declared on stack.
57 */
58#define BUS_DMA_CACHE_SEGMENTS 8
59
5efcff53 60struct bounce_zone;
eec44d94 61struct bus_dmamap;
5efcff53 62
984263bc 63struct bus_dma_tag {
141ebb24
SZ
64 bus_dma_tag_t parent;
65 bus_size_t alignment;
66 bus_size_t boundary;
67 bus_addr_t lowaddr;
68 bus_addr_t highaddr;
984263bc 69 bus_dma_filter_t *filter;
141ebb24
SZ
70 void *filterarg;
71 bus_size_t maxsize;
72 u_int nsegments;
73 bus_size_t maxsegsz;
74 int flags;
75 int ref_count;
76 int map_count;
06577778 77 bus_dma_segment_t *segments;
5efcff53 78 struct bounce_zone *bounce_zone;
6eed46e7
MD
79#ifdef SMP
80 struct spinlock spin;
81#else
82 int unused0;
83#endif
984263bc
MD
84};
85
f3513319
SZ
86/*
87 * bus_dma_tag private flags
88 */
46fbe6c5
SZ
89#define BUS_DMA_BOUNCE_ALIGN BUS_DMA_BUS2
90#define BUS_DMA_BOUNCE_LOWADDR BUS_DMA_BUS3
f3513319
SZ
91#define BUS_DMA_MIN_ALLOC_COMP BUS_DMA_BUS4
92
46fbe6c5
SZ
93#define BUS_DMA_COULD_BOUNCE (BUS_DMA_BOUNCE_LOWADDR | BUS_DMA_BOUNCE_ALIGN)
94
95#define BUS_DMAMEM_KMALLOC(dmat) \
96 ((dmat)->maxsize <= PAGE_SIZE && \
97 (dmat)->alignment <= PAGE_SIZE && \
98 (dmat)->lowaddr >= ptoa(Maxmem))
99
984263bc
MD
100struct bounce_page {
101 vm_offset_t vaddr; /* kva of bounce buffer */
102 bus_addr_t busaddr; /* Physical address */
103 vm_offset_t datavaddr; /* kva of client data */
104 bus_size_t datacount; /* client data count */
105 STAILQ_ENTRY(bounce_page) links;
106};
107
5efcff53
SZ
108struct bounce_zone {
109 STAILQ_ENTRY(bounce_zone) links;
110 STAILQ_HEAD(bp_list, bounce_page) bounce_page_list;
eec44d94 111 STAILQ_HEAD(, bus_dmamap) bounce_map_waitinglist;
78c79c21
SZ
112#ifdef SMP
113 struct spinlock spin;
114#else
115 int unused0;
116#endif
5efcff53
SZ
117 int total_bpages;
118 int free_bpages;
119 int reserved_bpages;
120 int active_bpages;
121 int total_bounced;
122 int total_deferred;
63fbdfd2 123 int reserve_failed;
5efcff53 124 bus_size_t alignment;
5efcff53
SZ
125 bus_addr_t lowaddr;
126 char zoneid[8];
127 char lowaddrid[20];
128 struct sysctl_ctx_list sysctl_ctx;
129 struct sysctl_oid *sysctl_tree;
130};
131
78c79c21 132#ifdef SMP
287a8577
AH
133#define BZ_LOCK(bz) spin_lock(&(bz)->spin)
134#define BZ_UNLOCK(bz) spin_unlock(&(bz)->spin)
78c79c21
SZ
135#else
136#define BZ_LOCK(bz) crit_enter()
137#define BZ_UNLOCK(bz) crit_exit()
138#endif
139
12586b82 140static struct lwkt_token bounce_zone_tok =
a3c18566 141 LWKT_TOKEN_INITIALIZER(bounce_zone_tok);
5efcff53
SZ
142static int busdma_zonecount;
143static STAILQ_HEAD(, bounce_zone) bounce_zone_list =
144 STAILQ_HEAD_INITIALIZER(bounce_zone_list);
984263bc 145
7dbe273f
SZ
146static int busdma_priv_zonecount = -1;
147
5efcff53
SZ
148int busdma_swi_pending;
149static int total_bounce_pages;
854f18b2 150static int max_bounce_pages = MAX_BPAGES;
5eba2447 151static int bounce_alignment = 1; /* XXX temporary */
984263bc 152
854f18b2 153TUNABLE_INT("hw.busdma.max_bpages", &max_bounce_pages);
46fbe6c5 154TUNABLE_INT("hw.busdma.bounce_alignment", &bounce_alignment);
854f18b2 155
984263bc 156struct bus_dmamap {
141ebb24
SZ
157 struct bp_list bpages;
158 int pagesneeded;
159 int pagesreserved;
160 bus_dma_tag_t dmat;
161 void *buf; /* unmapped buffer pointer */
162 bus_size_t buflen; /* unmapped buffer length */
984263bc 163 bus_dmamap_callback_t *callback;
141ebb24 164 void *callback_arg;
984263bc
MD
165 STAILQ_ENTRY(bus_dmamap) links;
166};
167
5efcff53
SZ
168static STAILQ_HEAD(, bus_dmamap) bounce_map_callbacklist =
169 STAILQ_HEAD_INITIALIZER(bounce_map_callbacklist);
0d4f82f8
MD
170static struct spinlock bounce_map_list_spin =
171 SPINLOCK_INITIALIZER(&bounce_map_list_spin);
5efcff53 172
984263bc
MD
173static struct bus_dmamap nobounce_dmamap;
174
5efcff53 175static int alloc_bounce_zone(bus_dma_tag_t);
f3f55019 176static int alloc_bounce_pages(bus_dma_tag_t, u_int, int);
7dbe273f
SZ
177static void free_bounce_pages_all(bus_dma_tag_t);
178static void free_bounce_zone(bus_dma_tag_t);
46cbb173 179static int reserve_bounce_pages(bus_dma_tag_t, bus_dmamap_t, int);
65cf4e39 180static void return_bounce_pages(bus_dma_tag_t, bus_dmamap_t);
96bdebb8
SZ
181static bus_addr_t add_bounce_page(bus_dma_tag_t, bus_dmamap_t,
182 vm_offset_t, bus_size_t);
183static void free_bounce_page(bus_dma_tag_t, struct bounce_page *);
984263bc 184
65cf4e39
SZ
185static bus_dmamap_t get_map_waiting(bus_dma_tag_t);
186static void add_map_callback(bus_dmamap_t);
187
1fae3d5f 188SYSCTL_NODE(_hw, OID_AUTO, busdma, CTLFLAG_RD, 0, "Busdma parameters");
5efcff53
SZ
189SYSCTL_INT(_hw_busdma, OID_AUTO, total_bpages, CTLFLAG_RD, &total_bounce_pages,
190 0, "Total bounce pages");
854f18b2
SZ
191SYSCTL_INT(_hw_busdma, OID_AUTO, max_bpages, CTLFLAG_RD, &max_bounce_pages,
192 0, "Max bounce pages per bounce zone");
5eba2447
SZ
193SYSCTL_INT(_hw_busdma, OID_AUTO, bounce_alignment, CTLFLAG_RD,
194 &bounce_alignment, 0, "Obey alignment constraint");
1fae3d5f 195
984263bc
MD
196static __inline int
197run_filter(bus_dma_tag_t dmat, bus_addr_t paddr)
198{
199 int retval;
200
201 retval = 0;
202 do {
46fbe6c5
SZ
203 if (((paddr > dmat->lowaddr && paddr <= dmat->highaddr) ||
204 (bounce_alignment && (paddr & (dmat->alignment - 1)) != 0))
205 && (dmat->filter == NULL ||
206 dmat->filter(dmat->filterarg, paddr) != 0))
984263bc
MD
207 retval = 1;
208
141ebb24 209 dmat = dmat->parent;
984263bc
MD
210 } while (retval == 0 && dmat != NULL);
211 return (retval);
212}
213
6eed46e7
MD
214static __inline
215bus_dma_segment_t *
216bus_dma_tag_lock(bus_dma_tag_t tag, bus_dma_segment_t *cache)
217{
c26842b6
SZ
218 if (tag->flags & BUS_DMA_PROTECTED)
219 return(tag->segments);
220
6eed46e7
MD
221 if (tag->nsegments <= BUS_DMA_CACHE_SEGMENTS)
222 return(cache);
223#ifdef SMP
287a8577 224 spin_lock(&tag->spin);
6eed46e7
MD
225#endif
226 return(tag->segments);
227}
228
229static __inline
230void
231bus_dma_tag_unlock(bus_dma_tag_t tag)
232{
233#ifdef SMP
c26842b6
SZ
234 if (tag->flags & BUS_DMA_PROTECTED)
235 return;
236
6eed46e7 237 if (tag->nsegments > BUS_DMA_CACHE_SEGMENTS)
287a8577 238 spin_unlock(&tag->spin);
6eed46e7
MD
239#endif
240}
241
984263bc
MD
242/*
243 * Allocate a device specific dma_tag.
244 */
245int
246bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
247 bus_size_t boundary, bus_addr_t lowaddr,
248 bus_addr_t highaddr, bus_dma_filter_t *filter,
249 void *filterarg, bus_size_t maxsize, int nsegments,
250 bus_size_t maxsegsz, int flags, bus_dma_tag_t *dmat)
251{
252 bus_dma_tag_t newtag;
253 int error = 0;
254
f3f55019
SZ
255 /*
256 * Sanity checks
257 */
258
24d9d29b
SZ
259 if (alignment == 0)
260 alignment = 1;
f3f55019 261 if (alignment & (alignment - 1))
ed20d0e3 262 panic("alignment must be power of 2");
f3f55019
SZ
263
264 if (boundary != 0) {
265 if (boundary & (boundary - 1))
ed20d0e3 266 panic("boundary must be power of 2");
f3f55019
SZ
267 if (boundary < maxsegsz) {
268 kprintf("boundary < maxsegsz:\n");
7ce2998e 269 print_backtrace(-1);
f3f55019
SZ
270 maxsegsz = boundary;
271 }
272 }
24d9d29b 273
984263bc
MD
274 /* Return a NULL tag on failure */
275 *dmat = NULL;
276
6eed46e7 277 newtag = kmalloc(sizeof(*newtag), M_DEVBUF, M_INTWAIT | M_ZERO);
984263bc 278
bc2cd3f9 279#ifdef SMP
6eed46e7 280 spin_init(&newtag->spin);
bc2cd3f9 281#endif
984263bc
MD
282 newtag->parent = parent;
283 newtag->alignment = alignment;
284 newtag->boundary = boundary;
6ef943a3
MD
285 newtag->lowaddr = trunc_page((vm_paddr_t)lowaddr) + (PAGE_SIZE - 1);
286 newtag->highaddr = trunc_page((vm_paddr_t)highaddr) + (PAGE_SIZE - 1);
984263bc
MD
287 newtag->filter = filter;
288 newtag->filterarg = filterarg;
289 newtag->maxsize = maxsize;
290 newtag->nsegments = nsegments;
291 newtag->maxsegsz = maxsegsz;
292 newtag->flags = flags;
293 newtag->ref_count = 1; /* Count ourself */
294 newtag->map_count = 0;
3a2114c4 295 newtag->segments = NULL;
5efcff53 296 newtag->bounce_zone = NULL;
141ebb24 297
984263bc
MD
298 /* Take into account any restrictions imposed by our parent tag */
299 if (parent != NULL) {
300 newtag->lowaddr = MIN(parent->lowaddr, newtag->lowaddr);
301 newtag->highaddr = MAX(parent->highaddr, newtag->highaddr);
167a836d
SZ
302
303 if (newtag->boundary == 0) {
304 newtag->boundary = parent->boundary;
305 } else if (parent->boundary != 0) {
306 newtag->boundary = MIN(parent->boundary,
307 newtag->boundary);
308 }
309
24d9d29b
SZ
310#ifdef notyet
311 newtag->alignment = MAX(parent->alignment, newtag->alignment);
312#endif
313
984263bc
MD
314 if (newtag->filter == NULL) {
315 /*
316 * Short circuit looking at our parent directly
317 * since we have encapsulated all of its information
318 */
319 newtag->filter = parent->filter;
320 newtag->filterarg = parent->filterarg;
321 newtag->parent = parent->parent;
322 }
141ebb24 323 if (newtag->parent != NULL)
984263bc 324 parent->ref_count++;
984263bc 325 }
141ebb24 326
e7029048 327 if (newtag->lowaddr < ptoa(Maxmem))
46fbe6c5
SZ
328 newtag->flags |= BUS_DMA_BOUNCE_LOWADDR;
329 if (bounce_alignment && newtag->alignment > 1 &&
330 !(newtag->flags & BUS_DMA_ALIGNED))
331 newtag->flags |= BUS_DMA_BOUNCE_ALIGN;
e7029048
SZ
332
333 if ((newtag->flags & BUS_DMA_COULD_BOUNCE) &&
6ef943a3 334 (flags & BUS_DMA_ALLOCNOW) != 0) {
5efcff53
SZ
335 struct bounce_zone *bz;
336
984263bc
MD
337 /* Must bounce */
338
5efcff53
SZ
339 error = alloc_bounce_zone(newtag);
340 if (error)
341 goto back;
342 bz = newtag->bounce_zone;
343
7dbe273f
SZ
344 if ((newtag->flags & BUS_DMA_ALLOCALL) == 0 &&
345 ptoa(bz->total_bpages) < maxsize) {
984263bc
MD
346 int pages;
347
90a9e482 348 if (flags & BUS_DMA_ONEBPAGE) {
12aa407c
SZ
349 pages = 1;
350 } else {
351 pages = atop(round_page(maxsize)) -
352 bz->total_bpages;
353 pages = MAX(pages, 1);
354 }
984263bc
MD
355
356 /* Add pages to our bounce pool */
f3f55019 357 if (alloc_bounce_pages(newtag, pages, flags) < pages)
984263bc 358 error = ENOMEM;
88af19d8
SZ
359
360 /* Performed initial allocation */
361 newtag->flags |= BUS_DMA_MIN_ALLOC_COMP;
984263bc 362 }
984263bc 363 }
5efcff53 364back:
37111f9c
SZ
365 if (error) {
366 free_bounce_zone(newtag);
efda3bd0 367 kfree(newtag, M_DEVBUF);
37111f9c 368 } else {
984263bc 369 *dmat = newtag;
37111f9c 370 }
5efcff53 371 return error;
984263bc
MD
372}
373
374int
375bus_dma_tag_destroy(bus_dma_tag_t dmat)
376{
377 if (dmat != NULL) {
984263bc
MD
378 if (dmat->map_count != 0)
379 return (EBUSY);
380
381 while (dmat != NULL) {
382 bus_dma_tag_t parent;
383
384 parent = dmat->parent;
385 dmat->ref_count--;
386 if (dmat->ref_count == 0) {
7dbe273f 387 free_bounce_zone(dmat);
06577778 388 if (dmat->segments != NULL)
efda3bd0
MD
389 kfree(dmat->segments, M_DEVBUF);
390 kfree(dmat, M_DEVBUF);
984263bc
MD
391 /*
392 * Last reference count, so
393 * release our reference
394 * count on our parent.
395 */
396 dmat = parent;
397 } else
398 dmat = NULL;
399 }
400 }
401 return (0);
402}
403
6eed46e7
MD
404bus_size_t
405bus_dma_tag_getmaxsize(bus_dma_tag_t tag)
406{
407 return(tag->maxsize);
408}
409
984263bc
MD
410/*
411 * Allocate a handle for mapping from kva/uva/physical
412 * address space into bus device space.
413 */
414int
415bus_dmamap_create(bus_dma_tag_t dmat, int flags, bus_dmamap_t *mapp)
416{
417 int error;
418
419 error = 0;
420
3a2114c4
MD
421 if (dmat->segments == NULL) {
422 KKASSERT(dmat->nsegments && dmat->nsegments < 16384);
77652cad 423 dmat->segments = kmalloc(sizeof(bus_dma_segment_t) *
3a2114c4
MD
424 dmat->nsegments, M_DEVBUF, M_INTWAIT);
425 }
426
e7029048 427 if (dmat->flags & BUS_DMA_COULD_BOUNCE) {
5efcff53 428 struct bounce_zone *bz;
984263bc
MD
429 int maxpages;
430
5efcff53
SZ
431 /* Must bounce */
432
433 if (dmat->bounce_zone == NULL) {
434 error = alloc_bounce_zone(dmat);
435 if (error)
436 return error;
437 }
438 bz = dmat->bounce_zone;
439
e7b4468c 440 *mapp = kmalloc(sizeof(**mapp), M_DEVBUF, M_INTWAIT | M_ZERO);
58d9c764 441
e7b4468c
SW
442 /* Initialize the new map */
443 STAILQ_INIT(&((*mapp)->bpages));
46fbe6c5 444
984263bc
MD
445 /*
446 * Attempt to add pages to our pool on a per-instance
447 * basis up to a sane limit.
448 */
7dbe273f
SZ
449 if (dmat->flags & BUS_DMA_ALLOCALL) {
450 maxpages = Maxmem - atop(dmat->lowaddr);
451 } else if (dmat->flags & BUS_DMA_BOUNCE_ALIGN) {
46fbe6c5
SZ
452 maxpages = max_bounce_pages;
453 } else {
454 maxpages = MIN(max_bounce_pages,
455 Maxmem - atop(dmat->lowaddr));
456 }
7dbe273f
SZ
457 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0 ||
458 (dmat->map_count > 0 && bz->total_bpages < maxpages)) {
984263bc
MD
459 int pages;
460
90a9e482 461 if (flags & BUS_DMA_ONEBPAGE) {
12aa407c
SZ
462 pages = 1;
463 } else {
464 pages = atop(round_page(dmat->maxsize));
465 pages = MIN(maxpages - bz->total_bpages, pages);
466 pages = MAX(pages, 1);
467 }
f3f55019 468 if (alloc_bounce_pages(dmat, pages, flags) < pages)
4343fdc9 469 error = ENOMEM;
984263bc
MD
470
471 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0) {
7dbe273f
SZ
472 if (!error &&
473 (dmat->flags & BUS_DMA_ALLOCALL) == 0)
984263bc
MD
474 dmat->flags |= BUS_DMA_MIN_ALLOC_COMP;
475 } else {
476 error = 0;
477 }
478 }
479 } else {
480 *mapp = NULL;
481 }
0c3d5ef6 482 if (!error) {
984263bc 483 dmat->map_count++;
0c3d5ef6
SZ
484 } else {
485 kfree(*mapp, M_DEVBUF);
486 *mapp = NULL;
487 }
5efcff53 488 return error;
984263bc
MD
489}
490
491/*
492 * Destroy a handle for mapping from kva/uva/physical
493 * address space into bus device space.
494 */
495int
496bus_dmamap_destroy(bus_dma_tag_t dmat, bus_dmamap_t map)
497{
498 if (map != NULL) {
499 if (STAILQ_FIRST(&map->bpages) != NULL)
500 return (EBUSY);
efda3bd0 501 kfree(map, M_DEVBUF);
984263bc
MD
502 }
503 dmat->map_count--;
504 return (0);
505}
506
46fbe6c5
SZ
507static __inline bus_size_t
508check_kmalloc(bus_dma_tag_t dmat, const void *vaddr0, int verify)
509{
510 bus_size_t maxsize = 0;
511 uintptr_t vaddr = (uintptr_t)vaddr0;
512
513 if ((vaddr ^ (vaddr + dmat->maxsize - 1)) & ~PAGE_MASK) {
e94a9b8c
SZ
514 if (verify || bootverbose)
515 kprintf("boundary check failed\n");
46fbe6c5 516 if (verify)
7ce2998e 517 print_backtrace(-1); /* XXX panic */
46fbe6c5
SZ
518 maxsize = dmat->maxsize;
519 }
520 if (vaddr & (dmat->alignment - 1)) {
e94a9b8c
SZ
521 if (verify || bootverbose)
522 kprintf("alignment check failed\n");
46fbe6c5 523 if (verify)
7ce2998e 524 print_backtrace(-1); /* XXX panic */
46fbe6c5
SZ
525 if (dmat->maxsize < dmat->alignment)
526 maxsize = dmat->alignment;
527 else
528 maxsize = dmat->maxsize;
529 }
530 return maxsize;
531}
532
984263bc
MD
533/*
534 * Allocate a piece of memory that can be efficiently mapped into
535 * bus device space based on the constraints lited in the dma tag.
ff8e0d00
MD
536 *
537 * mapp is degenerate. By definition this allocation should not require
538 * bounce buffers so do not allocate a dma map.
984263bc
MD
539 */
540int
46fbe6c5 541bus_dmamem_alloc(bus_dma_tag_t dmat, void **vaddr, int flags,
984263bc
MD
542 bus_dmamap_t *mapp)
543{
ba0fefd4 544 int mflags;
141ebb24 545
984263bc
MD
546 /* If we succeed, no mapping/bouncing will be required */
547 *mapp = NULL;
548
3a2114c4
MD
549 if (dmat->segments == NULL) {
550 KKASSERT(dmat->nsegments < 16384);
77652cad 551 dmat->segments = kmalloc(sizeof(bus_dma_segment_t) *
3a2114c4
MD
552 dmat->nsegments, M_DEVBUF, M_INTWAIT);
553 }
554
ba0fefd4
JS
555 if (flags & BUS_DMA_NOWAIT)
556 mflags = M_NOWAIT;
557 else
558 mflags = M_WAITOK;
559 if (flags & BUS_DMA_ZERO)
560 mflags |= M_ZERO;
561
46fbe6c5
SZ
562 if (BUS_DMAMEM_KMALLOC(dmat)) {
563 bus_size_t maxsize;
564
efda3bd0 565 *vaddr = kmalloc(dmat->maxsize, M_DEVBUF, mflags);
46fbe6c5 566
68aa5c00 567 /*
46fbe6c5
SZ
568 * XXX
569 * Check whether the allocation
570 * - crossed a page boundary
571 * - was not aligned
572 * Retry with power-of-2 alignment in the above cases.
68aa5c00 573 */
46fbe6c5
SZ
574 maxsize = check_kmalloc(dmat, *vaddr, 0);
575 if (maxsize) {
efda3bd0 576 kfree(*vaddr, M_DEVBUF);
8e469b97 577 *vaddr = kmalloc_powerof2(maxsize, M_DEVBUF, mflags);
46fbe6c5 578 check_kmalloc(dmat, *vaddr, 1);
68aa5c00 579 }
984263bc
MD
580 } else {
581 /*
582 * XXX Use Contigmalloc until it is merged into this facility
583 * and handles multi-seg allocations. Nobody is doing
584 * multi-seg allocations yet though.
585 */
ba0fefd4 586 *vaddr = contigmalloc(dmat->maxsize, M_DEVBUF, mflags,
24d9d29b 587 0ul, dmat->lowaddr, dmat->alignment, dmat->boundary);
984263bc
MD
588 }
589 if (*vaddr == NULL)
590 return (ENOMEM);
591 return (0);
592}
593
594/*
595 * Free a piece of memory and it's allociated dmamap, that was allocated
596 * via bus_dmamem_alloc. Make the same choice for free/contigfree.
597 */
598void
599bus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map)
600{
601 /*
602 * dmamem does not need to be bounced, so the map should be
603 * NULL
604 */
605 if (map != NULL)
ed20d0e3 606 panic("bus_dmamem_free: Invalid map freed");
46fbe6c5 607 if (BUS_DMAMEM_KMALLOC(dmat))
efda3bd0 608 kfree(vaddr, M_DEVBUF);
984263bc
MD
609 else
610 contigfree(vaddr, dmat->maxsize, M_DEVBUF);
611}
612
070a7c5f
SZ
613static __inline vm_paddr_t
614_bus_dma_extract(pmap_t pmap, vm_offset_t vaddr)
615{
616 if (pmap)
617 return pmap_extract(pmap, vaddr);
618 else
619 return pmap_kextract(vaddr);
620}
621
622/*
623 * Utility function to load a linear buffer. lastaddrp holds state
624 * between invocations (for multiple-buffer loads). segp contains
625 * the segment following the starting one on entrace, and the ending
626 * segment on exit. first indicates if this is the first invocation
627 * of this function.
628 */
b2436634 629static int
1884d7c3 630_bus_dmamap_load_buffer(bus_dma_tag_t dmat,
b2436634
SZ
631 bus_dmamap_t map,
632 void *buf, bus_size_t buflen,
aa2d9ae8
SZ
633 bus_dma_segment_t *segments,
634 int nsegments,
070a7c5f 635 pmap_t pmap,
b2436634
SZ
636 int flags,
637 vm_paddr_t *lastpaddrp,
638 int *segp,
639 int first)
984263bc 640{
9d9878b7
SZ
641 vm_offset_t vaddr;
642 vm_paddr_t paddr, nextpaddr;
643 bus_dma_segment_t *sg;
644 bus_addr_t bmask;
b2436634 645 int seg, error = 0;
984263bc
MD
646
647 if (map == NULL)
648 map = &nobounce_dmamap;
649
46fbe6c5
SZ
650#ifdef INVARIANTS
651 if (dmat->flags & BUS_DMA_ALIGNED)
652 KKASSERT(((uintptr_t)buf & (dmat->alignment - 1)) == 0);
653#endif
654
984263bc
MD
655 /*
656 * If we are being called during a callback, pagesneeded will
657 * be non-zero, so we can avoid doing the work twice.
658 */
e7029048 659 if ((dmat->flags & BUS_DMA_COULD_BOUNCE) &&
60405791 660 map != &nobounce_dmamap && map->pagesneeded == 0) {
9d9878b7 661 vm_offset_t vendaddr;
984263bc
MD
662
663 /*
664 * Count the number of bounce pages
665 * needed in order to complete this transfer
666 */
60405791 667 vaddr = (vm_offset_t)buf;
984263bc
MD
668 vendaddr = (vm_offset_t)buf + buflen;
669
670 while (vaddr < vendaddr) {
070a7c5f 671 paddr = _bus_dma_extract(pmap, vaddr);
141ebb24 672 if (run_filter(dmat, paddr) != 0)
984263bc 673 map->pagesneeded++;
06bb314f 674 vaddr += (PAGE_SIZE - (vaddr & PAGE_MASK));
984263bc
MD
675 }
676 }
677
678 /* Reserve Necessary Bounce Pages */
679 if (map->pagesneeded != 0) {
78c79c21
SZ
680 struct bounce_zone *bz;
681
682 bz = dmat->bounce_zone;
683 BZ_LOCK(bz);
46cbb173
SZ
684 if (flags & BUS_DMA_NOWAIT) {
685 if (reserve_bounce_pages(dmat, map, 0) != 0) {
78c79c21 686 BZ_UNLOCK(bz);
eda6a747
SZ
687 error = ENOMEM;
688 goto free_bounce;
46cbb173
SZ
689 }
690 } else {
691 if (reserve_bounce_pages(dmat, map, 1) != 0) {
692 /* Queue us for resources */
693 map->dmat = dmat;
694 map->buf = buf;
695 map->buflen = buflen;
984263bc 696
eec44d94
SZ
697 STAILQ_INSERT_TAIL(
698 &dmat->bounce_zone->bounce_map_waitinglist,
699 map, links);
78c79c21 700 BZ_UNLOCK(bz);
984263bc 701
46cbb173
SZ
702 return (EINPROGRESS);
703 }
984263bc 704 }
78c79c21 705 BZ_UNLOCK(bz);
984263bc
MD
706 }
707
aa2d9ae8 708 KKASSERT(*segp >= 1 && *segp <= nsegments);
b2436634 709 seg = *segp;
aa2d9ae8 710 sg = &segments[seg - 1];
b2436634 711
984263bc 712 vaddr = (vm_offset_t)buf;
b2436634 713 nextpaddr = *lastpaddrp;
270d2794
MD
714 bmask = ~(dmat->boundary - 1); /* note: will be 0 if boundary is 0 */
715
716 /* force at least one segment */
984263bc 717 do {
9d9878b7 718 bus_size_t size;
984263bc 719
270d2794
MD
720 /*
721 * Per-page main loop
722 */
070a7c5f 723 paddr = _bus_dma_extract(pmap, vaddr);
984263bc
MD
724 size = PAGE_SIZE - (paddr & PAGE_MASK);
725 if (size > buflen)
726 size = buflen;
984263bc 727 if (map->pagesneeded != 0 && run_filter(dmat, paddr)) {
b2436634 728 /*
270d2794
MD
729 * note: this paddr has the same in-page offset
730 * as vaddr and thus the paddr above, so the
731 * size does not have to be recalculated
732 */
984263bc
MD
733 paddr = add_bounce_page(dmat, map, vaddr, size);
734 }
735
270d2794
MD
736 /*
737 * Fill in the bus_dma_segment
738 */
b2436634 739 if (first) {
984263bc
MD
740 sg->ds_addr = paddr;
741 sg->ds_len = size;
b2436634 742 first = 0;
984263bc
MD
743 } else if (paddr == nextpaddr) {
744 sg->ds_len += size;
745 } else {
984263bc
MD
746 sg++;
747 seg++;
aa2d9ae8 748 if (seg > nsegments)
984263bc
MD
749 break;
750 sg->ds_addr = paddr;
751 sg->ds_len = size;
752 }
984263bc 753 nextpaddr = paddr + size;
270d2794
MD
754
755 /*
756 * Handle maxsegsz and boundary issues with a nested loop
757 */
758 for (;;) {
9d9878b7 759 bus_size_t tmpsize;
270d2794
MD
760
761 /*
762 * Limit to the boundary and maximum segment size
763 */
6b02d9de 764 if (((nextpaddr - 1) ^ sg->ds_addr) & bmask) {
270d2794
MD
765 tmpsize = dmat->boundary -
766 (sg->ds_addr & ~bmask);
767 if (tmpsize > dmat->maxsegsz)
768 tmpsize = dmat->maxsegsz;
769 KKASSERT(tmpsize < sg->ds_len);
770 } else if (sg->ds_len > dmat->maxsegsz) {
771 tmpsize = dmat->maxsegsz;
772 } else {
773 break;
774 }
775
776 /*
777 * Futz, split the data into a new segment.
778 */
aa2d9ae8 779 if (seg >= nsegments)
270d2794
MD
780 goto fail;
781 sg[1].ds_len = sg[0].ds_len - tmpsize;
782 sg[1].ds_addr = sg[0].ds_addr + tmpsize;
783 sg[0].ds_len = tmpsize;
784 sg++;
785 seg++;
786 }
787
788 /*
789 * Adjust for loop
790 */
984263bc 791 buflen -= size;
270d2794 792 vaddr += size;
984263bc 793 } while (buflen > 0);
270d2794 794fail:
65cf4e39 795 if (buflen != 0)
984263bc 796 error = EFBIG;
984263bc 797
b2436634
SZ
798 *segp = seg;
799 *lastpaddrp = nextpaddr;
984263bc 800
eda6a747 801free_bounce:
65cf4e39
SZ
802 if (error && (dmat->flags & BUS_DMA_COULD_BOUNCE) &&
803 map != &nobounce_dmamap) {
804 _bus_dmamap_unload(dmat, map);
805 return_bounce_pages(dmat, map);
806 }
b2436634
SZ
807 return error;
808}
809
810/*
811 * Map the buffer buf into bus space using the dmamap map.
812 */
813int
814bus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
815 bus_size_t buflen, bus_dmamap_callback_t *callback,
816 void *callback_arg, int flags)
817{
6eed46e7
MD
818 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
819 bus_dma_segment_t *segments;
b2436634
SZ
820 vm_paddr_t lastaddr = 0;
821 int error, nsegs = 1;
822
823 if (map != NULL) {
46cbb173
SZ
824 /*
825 * XXX
826 * Follow old semantics. Once all of the callers are fixed,
827 * we should get rid of these internal flag "adjustment".
828 */
829 flags &= ~BUS_DMA_NOWAIT;
b2436634 830 flags |= BUS_DMA_WAITOK;
46cbb173 831
b2436634
SZ
832 map->callback = callback;
833 map->callback_arg = callback_arg;
834 }
835
6eed46e7 836 segments = bus_dma_tag_lock(dmat, cache_segments);
1884d7c3 837 error = _bus_dmamap_load_buffer(dmat, map, buf, buflen,
6eed46e7 838 segments, dmat->nsegments,
1884d7c3 839 NULL, flags, &lastaddr, &nsegs, 1);
6eed46e7 840 if (error == EINPROGRESS) {
7dbe273f
SZ
841 KKASSERT((dmat->flags &
842 (BUS_DMA_PRIVBZONE | BUS_DMA_ALLOCALL)) !=
843 (BUS_DMA_PRIVBZONE | BUS_DMA_ALLOCALL));
c26842b6
SZ
844
845 if (dmat->flags & BUS_DMA_PROTECTED)
ed20d0e3 846 panic("protected dmamap callback will be defered");
c26842b6 847
6eed46e7 848 bus_dma_tag_unlock(dmat);
b2436634 849 return error;
6eed46e7
MD
850 }
851 callback(callback_arg, segments, nsegs, error);
852 bus_dma_tag_unlock(dmat);
b2436634 853 return 0;
984263bc
MD
854}
855
856/*
984263bc
MD
857 * Like _bus_dmamap_load(), but for mbufs.
858 */
859int
860bus_dmamap_load_mbuf(bus_dma_tag_t dmat, bus_dmamap_t map,
861 struct mbuf *m0,
862 bus_dmamap_callback2_t *callback, void *callback_arg,
863 int flags)
864{
6eed46e7
MD
865 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
866 bus_dma_segment_t *segments;
984263bc
MD
867 int nsegs, error;
868
18d561ae
SZ
869 /*
870 * XXX
871 * Follow old semantics. Once all of the callers are fixed,
872 * we should get rid of these internal flag "adjustment".
873 */
874 flags &= ~BUS_DMA_WAITOK;
875 flags |= BUS_DMA_NOWAIT;
984263bc 876
6eed46e7 877 segments = bus_dma_tag_lock(dmat, cache_segments);
aa2d9ae8 878 error = bus_dmamap_load_mbuf_segment(dmat, map, m0,
6eed46e7 879 segments, dmat->nsegments, &nsegs, flags);
aa2d9ae8
SZ
880 if (error) {
881 /* force "no valid mappings" in callback */
6eed46e7
MD
882 callback(callback_arg, segments, 0,
883 0, error);
aa2d9ae8 884 } else {
6eed46e7 885 callback(callback_arg, segments, nsegs,
aa2d9ae8
SZ
886 m0->m_pkthdr.len, error);
887 }
6eed46e7 888 bus_dma_tag_unlock(dmat);
aa2d9ae8
SZ
889 return error;
890}
891
892int
893bus_dmamap_load_mbuf_segment(bus_dma_tag_t dmat, bus_dmamap_t map,
894 struct mbuf *m0,
895 bus_dma_segment_t *segs, int maxsegs,
896 int *nsegs, int flags)
897{
898 int error;
899
900 M_ASSERTPKTHDR(m0);
901
ed20d0e3 902 KASSERT(maxsegs >= 1, ("invalid maxsegs %d", maxsegs));
aa2d9ae8 903 KASSERT(maxsegs <= dmat->nsegments,
ed20d0e3 904 ("%d too many segments, dmat only supports %d segments",
aa2d9ae8
SZ
905 maxsegs, dmat->nsegments));
906 KASSERT(flags & BUS_DMA_NOWAIT,
ed20d0e3 907 ("only BUS_DMA_NOWAIT is supported"));
aa2d9ae8 908
984263bc
MD
909 if (m0->m_pkthdr.len <= dmat->maxsize) {
910 int first = 1;
18d561ae 911 vm_paddr_t lastaddr = 0;
984263bc
MD
912 struct mbuf *m;
913
aa2d9ae8 914 *nsegs = 1;
18d561ae 915 error = 0;
984263bc 916 for (m = m0; m != NULL && error == 0; m = m->m_next) {
18d561ae 917 if (m->m_len == 0)
485dcc96 918 continue;
18d561ae 919
1884d7c3 920 error = _bus_dmamap_load_buffer(dmat, map,
984263bc 921 m->m_data, m->m_len,
aa2d9ae8 922 segs, maxsegs,
18d561ae 923 NULL, flags, &lastaddr,
aa2d9ae8 924 nsegs, first);
eda6a747
SZ
925 if (error == ENOMEM && !first) {
926 /*
927 * Out of bounce pages due to too many
928 * fragments in the mbuf chain; return
929 * EFBIG instead.
930 */
931 error = EFBIG;
932 }
984263bc
MD
933 first = 0;
934 }
aa2d9ae8
SZ
935#ifdef INVARIANTS
936 if (!error)
937 KKASSERT(*nsegs <= maxsegs && *nsegs >= 1);
938#endif
984263bc 939 } else {
aa2d9ae8 940 *nsegs = 0;
984263bc
MD
941 error = EINVAL;
942 }
aa2d9ae8 943 KKASSERT(error != EINPROGRESS);
18d561ae 944 return error;
984263bc
MD
945}
946
947/*
948 * Like _bus_dmamap_load(), but for uios.
949 */
950int
951bus_dmamap_load_uio(bus_dma_tag_t dmat, bus_dmamap_t map,
952 struct uio *uio,
953 bus_dmamap_callback2_t *callback, void *callback_arg,
954 int flags)
955{
070a7c5f 956 vm_paddr_t lastaddr;
984263bc
MD
957 int nsegs, error, first, i;
958 bus_size_t resid;
959 struct iovec *iov;
070a7c5f 960 pmap_t pmap;
6eed46e7
MD
961 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
962 bus_dma_segment_t *segments;
963 bus_dma_segment_t *segs;
964 int nsegs_left;
965
966 if (dmat->nsegments <= BUS_DMA_CACHE_SEGMENTS)
967 segments = cache_segments;
968 else
969 segments = kmalloc(sizeof(bus_dma_segment_t) * dmat->nsegments,
970 M_DEVBUF, M_WAITOK | M_ZERO);
984263bc 971
070a7c5f
SZ
972 /*
973 * XXX
974 * Follow old semantics. Once all of the callers are fixed,
975 * we should get rid of these internal flag "adjustment".
976 */
977 flags &= ~BUS_DMA_WAITOK;
978 flags |= BUS_DMA_NOWAIT;
984263bc 979
e54488bb 980 resid = (bus_size_t)uio->uio_resid;
984263bc
MD
981 iov = uio->uio_iov;
982
6eed46e7
MD
983 segs = segments;
984 nsegs_left = dmat->nsegments;
985
984263bc 986 if (uio->uio_segflg == UIO_USERSPACE) {
070a7c5f
SZ
987 struct thread *td;
988
dadab5e9
MD
989 td = uio->uio_td;
990 KASSERT(td != NULL && td->td_proc != NULL,
984263bc 991 ("bus_dmamap_load_uio: USERSPACE but no proc"));
070a7c5f
SZ
992 pmap = vmspace_pmap(td->td_proc->p_vmspace);
993 } else {
994 pmap = NULL;
984263bc
MD
995 }
996
984263bc 997 error = 0;
070a7c5f 998 nsegs = 1;
984263bc 999 first = 1;
070a7c5f 1000 lastaddr = 0;
984263bc
MD
1001 for (i = 0; i < uio->uio_iovcnt && resid != 0 && !error; i++) {
1002 /*
1003 * Now at the first iovec to load. Load each iovec
1004 * until we have exhausted the residual count.
1005 */
1006 bus_size_t minlen =
1007 resid < iov[i].iov_len ? resid : iov[i].iov_len;
1008 caddr_t addr = (caddr_t) iov[i].iov_base;
1009
1884d7c3 1010 error = _bus_dmamap_load_buffer(dmat, map, addr, minlen,
6eed46e7 1011 segs, nsegs_left,
070a7c5f 1012 pmap, flags, &lastaddr, &nsegs, first);
984263bc
MD
1013 first = 0;
1014
1015 resid -= minlen;
6eed46e7
MD
1016 if (error == 0) {
1017 nsegs_left -= nsegs;
1018 segs += nsegs;
1019 }
984263bc
MD
1020 }
1021
6eed46e7
MD
1022 /*
1023 * Minimum one DMA segment, even if 0-length buffer.
1024 */
1025 if (nsegs_left == dmat->nsegments)
1026 --nsegs_left;
1027
984263bc
MD
1028 if (error) {
1029 /* force "no valid mappings" in callback */
bc2cd3f9
MD
1030 callback(callback_arg, segments, 0,
1031 0, error);
984263bc 1032 } else {
6eed46e7 1033 callback(callback_arg, segments, dmat->nsegments - nsegs_left,
e54488bb 1034 (bus_size_t)uio->uio_resid, error);
984263bc 1035 }
6eed46e7
MD
1036 if (dmat->nsegments > BUS_DMA_CACHE_SEGMENTS)
1037 kfree(segments, M_DEVBUF);
070a7c5f 1038 return error;
984263bc
MD
1039}
1040
1041/*
1042 * Release the mapping held by map.
1043 */
1044void
1045_bus_dmamap_unload(bus_dma_tag_t dmat, bus_dmamap_t map)
1046{
1047 struct bounce_page *bpage;
1048
1049 while ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
1050 STAILQ_REMOVE_HEAD(&map->bpages, links);
1051 free_bounce_page(dmat, bpage);
1052 }
1053}
1054
1055void
1056_bus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, bus_dmasync_op_t op)
1057{
1058 struct bounce_page *bpage;
1059
1060 if ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
984263bc
MD
1061 /*
1062 * Handle data bouncing. We might also
1063 * want to add support for invalidating
1064 * the caches on broken hardware
1065 */
1066 switch (op) {
1067 case BUS_DMASYNC_PREWRITE:
1068 while (bpage != NULL) {
1069 bcopy((void *)bpage->datavaddr,
1070 (void *)bpage->vaddr,
1071 bpage->datacount);
1072 bpage = STAILQ_NEXT(bpage, links);
1073 }
5efcff53 1074 dmat->bounce_zone->total_bounced++;
984263bc
MD
1075 break;
1076
1077 case BUS_DMASYNC_POSTREAD:
1078 while (bpage != NULL) {
1079 bcopy((void *)bpage->vaddr,
1080 (void *)bpage->datavaddr,
1081 bpage->datacount);
1082 bpage = STAILQ_NEXT(bpage, links);
1083 }
5efcff53 1084 dmat->bounce_zone->total_bounced++;
984263bc 1085 break;
141ebb24 1086
984263bc
MD
1087 case BUS_DMASYNC_PREREAD:
1088 case BUS_DMASYNC_POSTWRITE:
1089 /* No-ops */
1090 break;
1091 }
1092 }
1093}
1094
1095static int
5efcff53 1096alloc_bounce_zone(bus_dma_tag_t dmat)
984263bc 1097{
5a162f17 1098 struct bounce_zone *bz, *new_bz;
5efcff53
SZ
1099
1100 KASSERT(dmat->bounce_zone == NULL,
ed20d0e3 1101 ("bounce zone was already assigned"));
5efcff53 1102
5a162f17
SZ
1103 new_bz = kmalloc(sizeof(*new_bz), M_DEVBUF, M_INTWAIT | M_ZERO);
1104
3b998fa9 1105 lwkt_gettoken(&bounce_zone_tok);
5a162f17 1106
7dbe273f
SZ
1107 if ((dmat->flags & BUS_DMA_PRIVBZONE) == 0) {
1108 /*
1109 * For shared bounce zone, check to see
1110 * if we already have a suitable zone
1111 */
1112 STAILQ_FOREACH(bz, &bounce_zone_list, links) {
1113 if (dmat->alignment <= bz->alignment &&
1114 dmat->lowaddr >= bz->lowaddr) {
1115 lwkt_reltoken(&bounce_zone_tok);
1116
1117 dmat->bounce_zone = bz;
1118 kfree(new_bz, M_DEVBUF);
1119 return 0;
1120 }
5efcff53
SZ
1121 }
1122 }
5a162f17 1123 bz = new_bz;
5efcff53 1124
78c79c21
SZ
1125#ifdef SMP
1126 spin_init(&bz->spin);
1127#endif
5efcff53 1128 STAILQ_INIT(&bz->bounce_page_list);
eec44d94 1129 STAILQ_INIT(&bz->bounce_map_waitinglist);
5efcff53
SZ
1130 bz->free_bpages = 0;
1131 bz->reserved_bpages = 0;
1132 bz->active_bpages = 0;
1133 bz->lowaddr = dmat->lowaddr;
f3f55019 1134 bz->alignment = round_page(dmat->alignment);
5efcff53 1135 ksnprintf(bz->lowaddrid, 18, "%#jx", (uintmax_t)bz->lowaddr);
7dbe273f
SZ
1136
1137 if ((dmat->flags & BUS_DMA_PRIVBZONE) == 0) {
1138 ksnprintf(bz->zoneid, 8, "zone%d", busdma_zonecount);
1139 busdma_zonecount++;
1140 STAILQ_INSERT_TAIL(&bounce_zone_list, bz, links);
1141 } else {
1142 ksnprintf(bz->zoneid, 8, "zone%d", busdma_priv_zonecount);
1143 busdma_priv_zonecount--;
1144 }
5a162f17 1145
3b998fa9 1146 lwkt_reltoken(&bounce_zone_tok);
5a162f17 1147
5efcff53
SZ
1148 dmat->bounce_zone = bz;
1149
1150 sysctl_ctx_init(&bz->sysctl_ctx);
1151 bz->sysctl_tree = SYSCTL_ADD_NODE(&bz->sysctl_ctx,
1152 SYSCTL_STATIC_CHILDREN(_hw_busdma), OID_AUTO, bz->zoneid,
1153 CTLFLAG_RD, 0, "");
1154 if (bz->sysctl_tree == NULL) {
1155 sysctl_ctx_free(&bz->sysctl_ctx);
1156 return 0; /* XXX error code? */
984263bc 1157 }
141ebb24 1158
5efcff53
SZ
1159 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1160 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1161 "total_bpages", CTLFLAG_RD, &bz->total_bpages, 0,
1162 "Total bounce pages");
1163 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1164 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1165 "free_bpages", CTLFLAG_RD, &bz->free_bpages, 0,
1166 "Free bounce pages");
1167 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1168 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1169 "reserved_bpages", CTLFLAG_RD, &bz->reserved_bpages, 0,
1170 "Reserved bounce pages");
1171 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1172 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1173 "active_bpages", CTLFLAG_RD, &bz->active_bpages, 0,
1174 "Active bounce pages");
1175 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1176 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1177 "total_bounced", CTLFLAG_RD, &bz->total_bounced, 0,
1178 "Total bounce requests");
1179 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1180 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1181 "total_deferred", CTLFLAG_RD, &bz->total_deferred, 0,
1182 "Total bounce requests that were deferred");
63fbdfd2
SZ
1183 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1184 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1185 "reserve_failed", CTLFLAG_RD, &bz->reserve_failed, 0,
1186 "Total bounce page reservations that were failed");
5efcff53
SZ
1187 SYSCTL_ADD_STRING(&bz->sysctl_ctx,
1188 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1189 "lowaddr", CTLFLAG_RD, bz->lowaddrid, 0, "");
1190 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1191 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1192 "alignment", CTLFLAG_RD, &bz->alignment, 0, "");
5efcff53
SZ
1193
1194 return 0;
1195}
1196
1197static int
f3f55019 1198alloc_bounce_pages(bus_dma_tag_t dmat, u_int numpages, int flags)
5efcff53
SZ
1199{
1200 struct bounce_zone *bz = dmat->bounce_zone;
f3f55019
SZ
1201 int count = 0, mflags;
1202
1203 if (flags & BUS_DMA_NOWAIT)
1204 mflags = M_NOWAIT;
1205 else
1206 mflags = M_WAITOK;
5efcff53 1207
984263bc
MD
1208 while (numpages > 0) {
1209 struct bounce_page *bpage;
984263bc 1210
58d9c764 1211 bpage = kmalloc(sizeof(*bpage), M_DEVBUF, M_INTWAIT | M_ZERO);
984263bc 1212
984263bc 1213 bpage->vaddr = (vm_offset_t)contigmalloc(PAGE_SIZE, M_DEVBUF,
f3f55019
SZ
1214 mflags, 0ul,
1215 bz->lowaddr,
ca611aa8 1216 bz->alignment, 0);
3641b7ca 1217 if (bpage->vaddr == 0) {
efda3bd0 1218 kfree(bpage, M_DEVBUF);
984263bc
MD
1219 break;
1220 }
1221 bpage->busaddr = pmap_kextract(bpage->vaddr);
5efcff53 1222
78c79c21 1223 BZ_LOCK(bz);
5efcff53
SZ
1224 STAILQ_INSERT_TAIL(&bz->bounce_page_list, bpage, links);
1225 total_bounce_pages++;
1226 bz->total_bpages++;
1227 bz->free_bpages++;
78c79c21 1228 BZ_UNLOCK(bz);
5efcff53 1229
984263bc
MD
1230 count++;
1231 numpages--;
1232 }
5efcff53 1233 return count;
984263bc
MD
1234}
1235
7dbe273f
SZ
1236static void
1237free_bounce_pages_all(bus_dma_tag_t dmat)
1238{
1239 struct bounce_zone *bz = dmat->bounce_zone;
1240 struct bounce_page *bpage;
1241
1242 BZ_LOCK(bz);
1243
1244 while ((bpage = STAILQ_FIRST(&bz->bounce_page_list)) != NULL) {
1245 STAILQ_REMOVE_HEAD(&bz->bounce_page_list, links);
1246
1247 KKASSERT(total_bounce_pages > 0);
1248 total_bounce_pages--;
1249
1250 KKASSERT(bz->total_bpages > 0);
1251 bz->total_bpages--;
1252
1253 KKASSERT(bz->free_bpages > 0);
1254 bz->free_bpages--;
1255
3b264617 1256 BZ_UNLOCK(bz);
7dbe273f
SZ
1257 contigfree((void *)bpage->vaddr, PAGE_SIZE, M_DEVBUF);
1258 kfree(bpage, M_DEVBUF);
3b264617 1259 BZ_LOCK(bz);
7dbe273f
SZ
1260 }
1261 if (bz->total_bpages) {
1262 kprintf("#%d bounce pages are still in use\n",
1263 bz->total_bpages);
1264 print_backtrace(-1);
1265 }
1266
1267 BZ_UNLOCK(bz);
1268}
1269
1270static void
1271free_bounce_zone(bus_dma_tag_t dmat)
1272{
1273 struct bounce_zone *bz = dmat->bounce_zone;
1274
1275 if (bz == NULL)
1276 return;
1277
1278 if ((dmat->flags & BUS_DMA_PRIVBZONE) == 0)
1279 return;
1280
1281 free_bounce_pages_all(dmat);
1282 dmat->bounce_zone = NULL;
1283
08abe714
SZ
1284 if (bz->sysctl_tree != NULL)
1285 sysctl_ctx_free(&bz->sysctl_ctx);
7dbe273f
SZ
1286 kfree(bz, M_DEVBUF);
1287}
1288
65cf4e39 1289/* Assume caller holds bounce zone spinlock */
984263bc 1290static int
46cbb173 1291reserve_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map, int commit)
984263bc 1292{
5efcff53 1293 struct bounce_zone *bz = dmat->bounce_zone;
984263bc
MD
1294 int pages;
1295
5efcff53 1296 pages = MIN(bz->free_bpages, map->pagesneeded - map->pagesreserved);
63fbdfd2
SZ
1297 if (!commit && map->pagesneeded > (map->pagesreserved + pages)) {
1298 bz->reserve_failed++;
46cbb173 1299 return (map->pagesneeded - (map->pagesreserved + pages));
63fbdfd2 1300 }
ad196c46 1301
5efcff53 1302 bz->free_bpages -= pages;
ad196c46 1303
5efcff53 1304 bz->reserved_bpages += pages;
ad196c46
SZ
1305 KKASSERT(bz->reserved_bpages <= bz->total_bpages);
1306
984263bc
MD
1307 map->pagesreserved += pages;
1308 pages = map->pagesneeded - map->pagesreserved;
1309
5efcff53 1310 return pages;
984263bc
MD
1311}
1312
65cf4e39
SZ
1313static void
1314return_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map)
1315{
1316 struct bounce_zone *bz = dmat->bounce_zone;
1317 int reserved = map->pagesreserved;
1318 bus_dmamap_t wait_map;
1319
1320 map->pagesreserved = 0;
1321 map->pagesneeded = 0;
1322
1323 if (reserved == 0)
1324 return;
1325
1326 BZ_LOCK(bz);
ad196c46 1327
65cf4e39 1328 bz->free_bpages += reserved;
ad196c46
SZ
1329 KKASSERT(bz->free_bpages <= bz->total_bpages);
1330
1331 KKASSERT(bz->reserved_bpages >= reserved);
65cf4e39 1332 bz->reserved_bpages -= reserved;
ad196c46 1333
65cf4e39 1334 wait_map = get_map_waiting(dmat);
ad196c46 1335
65cf4e39
SZ
1336 BZ_UNLOCK(bz);
1337
1338 if (wait_map != NULL)
1339 add_map_callback(map);
1340}
1341
6ef943a3 1342static bus_addr_t
984263bc
MD
1343add_bounce_page(bus_dma_tag_t dmat, bus_dmamap_t map, vm_offset_t vaddr,
1344 bus_size_t size)
1345{
5efcff53 1346 struct bounce_zone *bz = dmat->bounce_zone;
984263bc
MD
1347 struct bounce_page *bpage;
1348
ad196c46 1349 KASSERT(map->pagesneeded > 0, ("map doesn't need any pages"));
984263bc
MD
1350 map->pagesneeded--;
1351
ad196c46 1352 KASSERT(map->pagesreserved > 0, ("map doesn't reserve any pages"));
984263bc
MD
1353 map->pagesreserved--;
1354
78c79c21 1355 BZ_LOCK(bz);
984263bc 1356
ad196c46
SZ
1357 bpage = STAILQ_FIRST(&bz->bounce_page_list);
1358 KASSERT(bpage != NULL, ("free page list is empty"));
5efcff53 1359 STAILQ_REMOVE_HEAD(&bz->bounce_page_list, links);
ad196c46
SZ
1360
1361 KKASSERT(bz->reserved_bpages > 0);
5efcff53 1362 bz->reserved_bpages--;
ad196c46 1363
5efcff53 1364 bz->active_bpages++;
ad196c46
SZ
1365 KKASSERT(bz->active_bpages <= bz->total_bpages);
1366
78c79c21 1367 BZ_UNLOCK(bz);
984263bc 1368
be46f3bf
MP
1369 if (dmat->flags & BUS_DMA_KEEP_PG_OFFSET) {
1370 /* Page offset needs to be preserved. */
1371 bpage->vaddr |= vaddr & PAGE_MASK;
1372 bpage->busaddr |= vaddr & PAGE_MASK;
1373 }
984263bc
MD
1374 bpage->datavaddr = vaddr;
1375 bpage->datacount = size;
5efcff53
SZ
1376 STAILQ_INSERT_TAIL(&map->bpages, bpage, links);
1377 return bpage->busaddr;
984263bc
MD
1378}
1379
1380static void
1381free_bounce_page(bus_dma_tag_t dmat, struct bounce_page *bpage)
1382{
5efcff53 1383 struct bounce_zone *bz = dmat->bounce_zone;
65cf4e39 1384 bus_dmamap_t map;
984263bc
MD
1385
1386 bpage->datavaddr = 0;
1387 bpage->datacount = 0;
1388
be46f3bf
MP
1389 if (dmat->flags & BUS_DMA_KEEP_PG_OFFSET) {
1390 /*
1391 * Reset the bounce page to start at offset 0. Other uses
1392 * of this bounce page may need to store a full page of
1393 * data and/or assume it starts on a page boundary.
1394 */
1395 bpage->vaddr &= ~PAGE_MASK;
1396 bpage->busaddr &= ~PAGE_MASK;
1397 }
1398
78c79c21 1399 BZ_LOCK(bz);
ad196c46 1400
5efcff53 1401 STAILQ_INSERT_HEAD(&bz->bounce_page_list, bpage, links);
ad196c46 1402
5efcff53 1403 bz->free_bpages++;
ad196c46
SZ
1404 KKASSERT(bz->free_bpages <= bz->total_bpages);
1405
1406 KKASSERT(bz->active_bpages > 0);
5efcff53 1407 bz->active_bpages--;
ad196c46 1408
65cf4e39 1409 map = get_map_waiting(dmat);
ad196c46 1410
65cf4e39
SZ
1411 BZ_UNLOCK(bz);
1412
1413 if (map != NULL)
1414 add_map_callback(map);
1415}
1416
1417/* Assume caller holds bounce zone spinlock */
1418static bus_dmamap_t
1419get_map_waiting(bus_dma_tag_t dmat)
1420{
1421 struct bounce_zone *bz = dmat->bounce_zone;
1422 bus_dmamap_t map;
1423
1424 map = STAILQ_FIRST(&bz->bounce_map_waitinglist);
1425 if (map != NULL) {
46cbb173 1426 if (reserve_bounce_pages(map->dmat, map, 1) == 0) {
eec44d94 1427 STAILQ_REMOVE_HEAD(&bz->bounce_map_waitinglist, links);
5efcff53 1428 bz->total_deferred++;
78c79c21
SZ
1429 } else {
1430 map = NULL;
984263bc
MD
1431 }
1432 }
65cf4e39
SZ
1433 return map;
1434}
78c79c21 1435
65cf4e39
SZ
1436static void
1437add_map_callback(bus_dmamap_t map)
1438{
0d4f82f8 1439 spin_lock(&bounce_map_list_spin);
65cf4e39
SZ
1440 STAILQ_INSERT_TAIL(&bounce_map_callbacklist, map, links);
1441 busdma_swi_pending = 1;
1442 setsoftvm();
0d4f82f8 1443 spin_unlock(&bounce_map_list_spin);
984263bc
MD
1444}
1445
1446void
f123d5a1 1447busdma_swi(void)
984263bc 1448{
65cf4e39 1449 bus_dmamap_t map;
984263bc 1450
0d4f82f8 1451 spin_lock(&bounce_map_list_spin);
984263bc
MD
1452 while ((map = STAILQ_FIRST(&bounce_map_callbacklist)) != NULL) {
1453 STAILQ_REMOVE_HEAD(&bounce_map_callbacklist, links);
0d4f82f8 1454 spin_unlock(&bounce_map_list_spin);
984263bc
MD
1455 bus_dmamap_load(map->dmat, map, map->buf, map->buflen,
1456 map->callback, map->callback_arg, /*flags*/0);
0d4f82f8 1457 spin_lock(&bounce_map_list_spin);
984263bc 1458 }
0d4f82f8 1459 spin_unlock(&bounce_map_list_spin);
984263bc 1460}