bus_machdep.c revision 167308
1/*-
2 * Copyright (c) 1996, 1997, 1998 The NetBSD Foundation, Inc.
3 * All rights reserved.
4 *
5 * This code is derived from software contributed to The NetBSD Foundation
6 * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
7 * NASA Ames Research Center.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 *    notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 *    notice, this list of conditions and the following disclaimer in the
16 *    documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 *    must display the following acknowledgement:
19 *	This product includes software developed by the NetBSD
20 *	Foundation, Inc. and its contributors.
21 * 4. Neither the name of The NetBSD Foundation nor the names of its
22 *    contributors may be used to endorse or promote products derived
23 *    from this software without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
26 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
27 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
29 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
36 */
37/*-
38 * Copyright (c) 1992, 1993
39 *	The Regents of the University of California.  All rights reserved.
40 *
41 * This software was developed by the Computer Systems Engineering group
42 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
43 * contributed to Berkeley.
44 *
45 * Redistribution and use in source and binary forms, with or without
46 * modification, are permitted provided that the following conditions
47 * are met:
48 * 1. Redistributions of source code must retain the above copyright
49 *    notice, this list of conditions and the following disclaimer.
50 * 2. Redistributions in binary form must reproduce the above copyright
51 *    notice, this list of conditions and the following disclaimer in the
52 *    documentation and/or other materials provided with the distribution.
53 * 4. Neither the name of the University nor the names of its contributors
54 *    may be used to endorse or promote products derived from this software
55 *    without specific prior written permission.
56 *
57 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
58 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
59 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
60 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
61 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
62 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
63 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
64 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
65 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
66 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
67 * SUCH DAMAGE.
68 */
69/*-
70 * Copyright (c) 1997, 1998 Justin T. Gibbs.
71 * All rights reserved.
72 * Copyright 2001 by Thomas Moestl <tmm@FreeBSD.org>.  All rights reserved.
73 *
74 * Redistribution and use in source and binary forms, with or without
75 * modification, are permitted provided that the following conditions
76 * are met:
77 * 1. Redistributions of source code must retain the above copyright
78 *    notice, this list of conditions, and the following disclaimer,
79 *    without modification, immediately at the beginning of the file.
80 * 2. The name of the author may not be used to endorse or promote products
81 *    derived from this software without specific prior written permission.
82 *
83 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
84 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
85 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
86 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
87 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
88 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
89 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
90 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
91 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
92 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
93 * SUCH DAMAGE.
94 *
95 *	from: @(#)machdep.c	8.6 (Berkeley) 1/14/94
96 *	from: NetBSD: machdep.c,v 1.111 2001/09/15 07:13:40 eeh Exp
97 *	and
98 * 	from: FreeBSD: src/sys/i386/i386/busdma_machdep.c,v 1.24 2001/08/15
99 */
100
101#include <sys/cdefs.h>
102__FBSDID("$FreeBSD: head/sys/sparc64/sparc64/bus_machdep.c 167308 2007-03-07 21:13:51Z marius $");
103
104#include <sys/param.h>
105#include <sys/bus.h>
106#include <sys/lock.h>
107#include <sys/malloc.h>
108#include <sys/mbuf.h>
109#include <sys/mutex.h>
110#include <sys/proc.h>
111#include <sys/smp.h>
112#include <sys/systm.h>
113#include <sys/uio.h>
114
115#include <vm/vm.h>
116#include <vm/vm_extern.h>
117#include <vm/vm_kern.h>
118#include <vm/vm_page.h>
119#include <vm/vm_param.h>
120#include <vm/vm_map.h>
121
122#include <machine/asi.h>
123#include <machine/atomic.h>
124#include <machine/bus.h>
125#include <machine/bus_private.h>
126#include <machine/cache.h>
127#include <machine/smp.h>
128#include <machine/tlb.h>
129
130static void nexus_bus_barrier(bus_space_tag_t, bus_space_handle_t,
131    bus_size_t, bus_size_t, int);
132
133/* ASI's for bus access. */
134int bus_type_asi[] = {
135	ASI_PHYS_BYPASS_EC_WITH_EBIT,		/* nexus */
136	ASI_PHYS_BYPASS_EC_WITH_EBIT,		/* SBus */
137	ASI_PHYS_BYPASS_EC_WITH_EBIT_L,		/* PCI configuration space */
138	ASI_PHYS_BYPASS_EC_WITH_EBIT_L,		/* PCI memory space */
139	ASI_PHYS_BYPASS_EC_WITH_EBIT_L,		/* PCI I/O space */
140	0
141};
142
143int bus_stream_asi[] = {
144	ASI_PHYS_BYPASS_EC_WITH_EBIT,		/* nexus */
145	ASI_PHYS_BYPASS_EC_WITH_EBIT,		/* SBus */
146	ASI_PHYS_BYPASS_EC_WITH_EBIT,		/* PCI configuration space */
147	ASI_PHYS_BYPASS_EC_WITH_EBIT,		/* PCI memory space */
148	ASI_PHYS_BYPASS_EC_WITH_EBIT,		/* PCI I/O space */
149	0
150};
151
152/*
153 * Convenience function for manipulating driver locks from busdma (during
154 * busdma_swi, for example).  Drivers that don't provide their own locks
155 * should specify &Giant to dmat->lockfuncarg.  Drivers that use their own
156 * non-mutex locking scheme don't have to use this at all.
157 */
158void
159busdma_lock_mutex(void *arg, bus_dma_lock_op_t op)
160{
161	struct mtx *dmtx;
162
163	dmtx = (struct mtx *)arg;
164	switch (op) {
165	case BUS_DMA_LOCK:
166		mtx_lock(dmtx);
167		break;
168	case BUS_DMA_UNLOCK:
169		mtx_unlock(dmtx);
170		break;
171	default:
172		panic("Unknown operation 0x%x for busdma_lock_mutex!", op);
173	}
174}
175
176/*
177 * dflt_lock should never get called.  It gets put into the dma tag when
178 * lockfunc == NULL, which is only valid if the maps that are associated
179 * with the tag are meant to never be defered.
180 * XXX Should have a way to identify which driver is responsible here.
181 */
182static void
183dflt_lock(void *arg, bus_dma_lock_op_t op)
184{
185#ifdef INVARIANTS
186	panic("driver error: busdma dflt_lock called");
187#else
188	printf("DRIVER_ERROR: busdma dflt_lock called\n");
189#endif
190}
191
192/*
193 * Allocate a device specific dma_tag.
194 */
195int
196bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
197    bus_size_t boundary, bus_addr_t lowaddr, bus_addr_t highaddr,
198    bus_dma_filter_t *filter, void *filterarg, bus_size_t maxsize,
199    int nsegments, bus_size_t maxsegsz, int flags, bus_dma_lock_t *lockfunc,
200    void *lockfuncarg, bus_dma_tag_t *dmat)
201{
202	bus_dma_tag_t newtag;
203
204	/* Return a NULL tag on failure */
205	*dmat = NULL;
206
207	/* Enforce the usage of BUS_GET_DMA_TAG(). */
208	if (parent == NULL)
209		panic("%s: parent DMA tag NULL", __func__);
210
211	newtag = (bus_dma_tag_t)malloc(sizeof(*newtag), M_DEVBUF, M_NOWAIT);
212	if (newtag == NULL)
213		return (ENOMEM);
214
215	/*
216	 * The method table pointer and the cookie need to be taken over from
217	 * the parent.
218	 */
219	newtag->dt_cookie = parent->dt_cookie;
220	newtag->dt_mt = parent->dt_mt;
221
222	newtag->dt_parent = parent;
223	newtag->dt_alignment = alignment;
224	newtag->dt_boundary = boundary;
225	newtag->dt_lowaddr = trunc_page((vm_offset_t)lowaddr) + (PAGE_SIZE - 1);
226	newtag->dt_highaddr = trunc_page((vm_offset_t)highaddr) +
227	    (PAGE_SIZE - 1);
228	newtag->dt_filter = filter;
229	newtag->dt_filterarg = filterarg;
230	newtag->dt_maxsize = maxsize;
231	newtag->dt_nsegments = nsegments;
232	newtag->dt_maxsegsz = maxsegsz;
233	newtag->dt_flags = flags;
234	newtag->dt_ref_count = 1; /* Count ourselves */
235	newtag->dt_map_count = 0;
236
237	if (lockfunc != NULL) {
238		newtag->dt_lockfunc = lockfunc;
239		newtag->dt_lockfuncarg = lockfuncarg;
240	} else {
241		newtag->dt_lockfunc = dflt_lock;
242		newtag->dt_lockfuncarg = NULL;
243	}
244
245	newtag->dt_segments = NULL;
246
247	/* Take into account any restrictions imposed by our parent tag */
248	newtag->dt_lowaddr = ulmin(parent->dt_lowaddr, newtag->dt_lowaddr);
249	newtag->dt_highaddr = ulmax(parent->dt_highaddr, newtag->dt_highaddr);
250	if (newtag->dt_boundary == 0)
251		newtag->dt_boundary = parent->dt_boundary;
252	else if (parent->dt_boundary != 0)
253		newtag->dt_boundary = ulmin(parent->dt_boundary,
254		    newtag->dt_boundary);
255	atomic_add_int(&parent->dt_ref_count, 1);
256
257	if (newtag->dt_boundary > 0)
258		newtag->dt_maxsegsz = ulmin(newtag->dt_maxsegsz,
259		    newtag->dt_boundary);
260
261	*dmat = newtag;
262	return (0);
263}
264
265int
266bus_dma_tag_destroy(bus_dma_tag_t dmat)
267{
268	bus_dma_tag_t parent;
269
270	if (dmat != NULL) {
271		if (dmat->dt_map_count != 0)
272			return (EBUSY);
273		while (dmat != NULL) {
274			parent = dmat->dt_parent;
275			atomic_subtract_int(&dmat->dt_ref_count, 1);
276			if (dmat->dt_ref_count == 0) {
277				if (dmat->dt_segments != NULL)
278					free(dmat->dt_segments, M_DEVBUF);
279				free(dmat, M_DEVBUF);
280				/*
281				 * Last reference count, so
282				 * release our reference
283				 * count on our parent.
284				 */
285				dmat = parent;
286			} else
287				dmat = NULL;
288		}
289	}
290	return (0);
291}
292
293/* Allocate/free a tag, and do the necessary management work. */
294int
295sparc64_dma_alloc_map(bus_dma_tag_t dmat, bus_dmamap_t *mapp)
296{
297
298	if (dmat->dt_segments == NULL) {
299		dmat->dt_segments = (bus_dma_segment_t *)malloc(
300		    sizeof(bus_dma_segment_t) * dmat->dt_nsegments, M_DEVBUF,
301		    M_NOWAIT);
302		if (dmat->dt_segments == NULL)
303			return (ENOMEM);
304	}
305	*mapp = malloc(sizeof(**mapp), M_DEVBUF, M_NOWAIT | M_ZERO);
306	if (*mapp == NULL)
307		return (ENOMEM);
308
309	SLIST_INIT(&(*mapp)->dm_reslist);
310	dmat->dt_map_count++;
311	return (0);
312}
313
314void
315sparc64_dma_free_map(bus_dma_tag_t dmat, bus_dmamap_t map)
316{
317
318	free(map, M_DEVBUF);
319	dmat->dt_map_count--;
320}
321
322static int
323nexus_dmamap_create(bus_dma_tag_t dmat, int flags, bus_dmamap_t *mapp)
324{
325
326	return (sparc64_dma_alloc_map(dmat, mapp));
327}
328
329static int
330nexus_dmamap_destroy(bus_dma_tag_t dmat, bus_dmamap_t map)
331{
332
333	sparc64_dma_free_map(dmat, map);
334	return (0);
335}
336
337/*
338 * Utility function to load a linear buffer.  lastaddrp holds state
339 * between invocations (for multiple-buffer loads).  segp contains
340 * the starting segment on entrace, and the ending segment on exit.
341 * first indicates if this is the first invocation of this function.
342 */
343static int
344_nexus_dmamap_load_buffer(bus_dma_tag_t dmat, void *buf, bus_size_t buflen,
345    struct thread *td, int flags, bus_addr_t *lastaddrp,
346    bus_dma_segment_t *segs, int *segp, int first)
347{
348	bus_size_t sgsize;
349	bus_addr_t curaddr, lastaddr, baddr, bmask;
350	vm_offset_t vaddr = (vm_offset_t)buf;
351	int seg;
352	pmap_t pmap;
353
354	if (td != NULL)
355		pmap = vmspace_pmap(td->td_proc->p_vmspace);
356	else
357		pmap = NULL;
358
359	lastaddr = *lastaddrp;
360	bmask  = ~(dmat->dt_boundary - 1);
361
362	for (seg = *segp; buflen > 0 ; ) {
363		/*
364		 * Get the physical address for this segment.
365		 */
366		if (pmap)
367			curaddr = pmap_extract(pmap, vaddr);
368		else
369			curaddr = pmap_kextract(vaddr);
370
371		/*
372		 * Compute the segment size, and adjust counts.
373		 */
374		sgsize = PAGE_SIZE - ((u_long)curaddr & PAGE_MASK);
375		if (buflen < sgsize)
376			sgsize = buflen;
377
378		/*
379		 * Make sure we don't cross any boundaries.
380		 */
381		if (dmat->dt_boundary > 0) {
382			baddr = (curaddr + dmat->dt_boundary) & bmask;
383			if (sgsize > (baddr - curaddr))
384				sgsize = (baddr - curaddr);
385		}
386
387		/*
388		 * Insert chunk into a segment, coalescing with
389		 * previous segment if possible.
390		 */
391		if (first) {
392			segs[seg].ds_addr = curaddr;
393			segs[seg].ds_len = sgsize;
394			first = 0;
395		} else {
396			if (curaddr == lastaddr &&
397			    (segs[seg].ds_len + sgsize) <= dmat->dt_maxsegsz &&
398			    (dmat->dt_boundary == 0 ||
399			    (segs[seg].ds_addr & bmask) == (curaddr & bmask)))
400				segs[seg].ds_len += sgsize;
401			else {
402				if (++seg >= dmat->dt_nsegments)
403					break;
404				segs[seg].ds_addr = curaddr;
405				segs[seg].ds_len = sgsize;
406			}
407		}
408
409		lastaddr = curaddr + sgsize;
410		vaddr += sgsize;
411		buflen -= sgsize;
412	}
413
414	*segp = seg;
415	*lastaddrp = lastaddr;
416
417	/*
418	 * Did we fit?
419	 */
420	return (buflen != 0 ? EFBIG : 0); /* XXX better return value here? */
421}
422
423/*
424 * Common function for loading a DMA map with a linear buffer.  May
425 * be called by bus-specific DMA map load functions.
426 *
427 * Most SPARCs have IOMMUs in the bus controllers.  In those cases
428 * they only need one segment and will use virtual addresses for DVMA.
429 * Those bus controllers should intercept these vectors and should
430 * *NEVER* call nexus_dmamap_load() which is used only by devices that
431 * bypass DVMA.
432 */
433static int
434nexus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
435    bus_size_t buflen, bus_dmamap_callback_t *callback, void *callback_arg,
436    int flags)
437{
438	bus_addr_t lastaddr;
439	int error, nsegs;
440
441	error = _nexus_dmamap_load_buffer(dmat, buf, buflen, NULL, flags,
442	    &lastaddr, dmat->dt_segments, &nsegs, 1);
443
444	if (error == 0) {
445		(*callback)(callback_arg, dmat->dt_segments, nsegs + 1, 0);
446		map->dm_flags |= DMF_LOADED;
447	} else
448		(*callback)(callback_arg, NULL, 0, error);
449
450	return (0);
451}
452
453/*
454 * Like nexus_dmamap_load(), but for mbufs.
455 */
456static int
457nexus_dmamap_load_mbuf(bus_dma_tag_t dmat, bus_dmamap_t map, struct mbuf *m0,
458    bus_dmamap_callback2_t *callback, void *callback_arg, int flags)
459{
460	int nsegs, error;
461
462	M_ASSERTPKTHDR(m0);
463
464	nsegs = 0;
465	error = 0;
466	if (m0->m_pkthdr.len <= dmat->dt_maxsize) {
467		int first = 1;
468		bus_addr_t lastaddr = 0;
469		struct mbuf *m;
470
471		for (m = m0; m != NULL && error == 0; m = m->m_next) {
472			if (m->m_len > 0) {
473				error = _nexus_dmamap_load_buffer(dmat,
474				    m->m_data, m->m_len,NULL, flags, &lastaddr,
475				    dmat->dt_segments, &nsegs, first);
476				first = 0;
477			}
478		}
479	} else {
480		error = EINVAL;
481	}
482
483	if (error) {
484		/* force "no valid mappings" in callback */
485		(*callback)(callback_arg, dmat->dt_segments, 0, 0, error);
486	} else {
487		map->dm_flags |= DMF_LOADED;
488		(*callback)(callback_arg, dmat->dt_segments, nsegs + 1,
489		    m0->m_pkthdr.len, error);
490	}
491	return (error);
492}
493
494static int
495nexus_dmamap_load_mbuf_sg(bus_dma_tag_t dmat, bus_dmamap_t map, struct mbuf *m0,
496    bus_dma_segment_t *segs, int *nsegs, int flags)
497{
498	int error;
499
500	M_ASSERTPKTHDR(m0);
501
502	*nsegs = 0;
503	error = 0;
504	if (m0->m_pkthdr.len <= dmat->dt_maxsize) {
505		int first = 1;
506		bus_addr_t lastaddr = 0;
507		struct mbuf *m;
508
509		for (m = m0; m != NULL && error == 0; m = m->m_next) {
510			if (m->m_len > 0) {
511				error = _nexus_dmamap_load_buffer(dmat,
512				    m->m_data, m->m_len,NULL, flags, &lastaddr,
513				    segs, nsegs, first);
514				first = 0;
515			}
516		}
517	} else {
518		error = EINVAL;
519	}
520
521	++*nsegs;
522	return (error);
523}
524
525/*
526 * Like nexus_dmamap_load(), but for uios.
527 */
528static int
529nexus_dmamap_load_uio(bus_dma_tag_t dmat, bus_dmamap_t map, struct uio *uio,
530    bus_dmamap_callback2_t *callback, void *callback_arg, int flags)
531{
532	bus_addr_t lastaddr;
533	int nsegs, error, first, i;
534	bus_size_t resid;
535	struct iovec *iov;
536	struct thread *td = NULL;
537
538	resid = uio->uio_resid;
539	iov = uio->uio_iov;
540
541	if (uio->uio_segflg == UIO_USERSPACE) {
542		td = uio->uio_td;
543		KASSERT(td != NULL,
544			("nexus_dmamap_load_uio: USERSPACE but no proc"));
545	}
546
547	nsegs = 0;
548	error = 0;
549	first = 1;
550	for (i = 0; i < uio->uio_iovcnt && resid != 0 && !error; i++) {
551		/*
552		 * Now at the first iovec to load.  Load each iovec
553		 * until we have exhausted the residual count.
554		 */
555		bus_size_t minlen =
556			resid < iov[i].iov_len ? resid : iov[i].iov_len;
557		caddr_t addr = (caddr_t) iov[i].iov_base;
558
559		if (minlen > 0) {
560			error = _nexus_dmamap_load_buffer(dmat, addr, minlen,
561			    td, flags, &lastaddr, dmat->dt_segments, &nsegs,
562			    first);
563			first = 0;
564
565			resid -= minlen;
566		}
567	}
568
569	if (error) {
570		/* force "no valid mappings" in callback */
571		(*callback)(callback_arg, dmat->dt_segments, 0, 0, error);
572	} else {
573		map->dm_flags |= DMF_LOADED;
574		(*callback)(callback_arg, dmat->dt_segments, nsegs + 1,
575		    uio->uio_resid, error);
576	}
577	return (error);
578}
579
580/*
581 * Common function for unloading a DMA map.  May be called by
582 * bus-specific DMA map unload functions.
583 */
584static void
585nexus_dmamap_unload(bus_dma_tag_t dmat, bus_dmamap_t map)
586{
587
588	map->dm_flags &= ~DMF_LOADED;
589}
590
591/*
592 * Common function for DMA map synchronization.  May be called
593 * by bus-specific DMA map synchronization functions.
594 */
595static void
596nexus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, bus_dmasync_op_t op)
597{
598
599	/*
600	 * We sync out our caches, but the bus must do the same.
601	 *
602	 * Actually a #Sync is expensive.  We should optimize.
603	 */
604	if ((op & BUS_DMASYNC_PREREAD) || (op & BUS_DMASYNC_PREWRITE)) {
605		/*
606		 * Don't really need to do anything, but flush any pending
607		 * writes anyway.
608		 */
609		membar(Sync);
610	}
611#if 0
612	/* Should not be needed. */
613	if (op & BUS_DMASYNC_POSTREAD) {
614		ecache_flush((vm_offset_t)map->buf,
615		    (vm_offset_t)map->buf + map->buflen - 1);
616	}
617#endif
618	if (op & BUS_DMASYNC_POSTWRITE) {
619		/* Nothing to do.  Handled by the bus controller. */
620	}
621}
622
623/*
624 * Common function for DMA-safe memory allocation.  May be called
625 * by bus-specific DMA memory allocation functions.
626 */
627static int
628nexus_dmamem_alloc(bus_dma_tag_t dmat, void **vaddr, int flags,
629    bus_dmamap_t *mapp)
630{
631	int mflags;
632
633	if (flags & BUS_DMA_NOWAIT)
634		mflags = M_NOWAIT;
635	else
636		mflags = M_WAITOK;
637	if (flags & BUS_DMA_ZERO)
638		mflags |= M_ZERO;
639
640	if ((dmat->dt_maxsize <= PAGE_SIZE)) {
641		*vaddr = malloc(dmat->dt_maxsize, M_DEVBUF, mflags);
642	} else {
643		/*
644		 * XXX: Use contigmalloc until it is merged into this facility
645		 * and handles multi-seg allocations.  Nobody is doing multi-seg
646		 * allocations yet though.
647		 */
648		*vaddr = contigmalloc(dmat->dt_maxsize, M_DEVBUF, mflags,
649		    0ul, dmat->dt_lowaddr,
650		    dmat->dt_alignment ? dmat->dt_alignment : 1UL,
651		    dmat->dt_boundary);
652	}
653	if (*vaddr == NULL)
654		return (ENOMEM);
655	return (0);
656}
657
658/*
659 * Common function for freeing DMA-safe memory.  May be called by
660 * bus-specific DMA memory free functions.
661 */
662static void
663nexus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map)
664{
665
666	if ((dmat->dt_maxsize <= PAGE_SIZE))
667		free(vaddr, M_DEVBUF);
668	else {
669		contigfree(vaddr, dmat->dt_maxsize, M_DEVBUF);
670	}
671}
672
673struct bus_dma_methods nexus_dma_methods = {
674	nexus_dmamap_create,
675	nexus_dmamap_destroy,
676	nexus_dmamap_load,
677	nexus_dmamap_load_mbuf,
678	nexus_dmamap_load_mbuf_sg,
679	nexus_dmamap_load_uio,
680	nexus_dmamap_unload,
681	nexus_dmamap_sync,
682	nexus_dmamem_alloc,
683	nexus_dmamem_free,
684};
685
686struct bus_dma_tag nexus_dmatag = {
687	NULL,
688	NULL,
689	1,
690	0,
691	~0,
692	~0,
693	NULL,		/* XXX */
694	NULL,
695	~0,
696	~0,
697	~0,
698	0,
699	0,
700	0,
701	NULL,
702	NULL,
703	NULL,
704	&nexus_dma_methods,
705};
706
707/*
708 * Helpers to map/unmap bus memory
709 */
710int
711sparc64_bus_mem_map(bus_space_tag_t tag, bus_space_handle_t handle,
712    bus_size_t size, int flags, vm_offset_t vaddr, void **hp)
713{
714	vm_offset_t addr;
715	vm_offset_t sva;
716	vm_offset_t va;
717	vm_paddr_t pa;
718	vm_size_t vsz;
719	u_long pm_flags;
720
721	addr = (vm_offset_t)handle;
722	size = round_page(size);
723	if (size == 0) {
724		printf("%s: zero size\n", __func__);
725		return (EINVAL);
726	}
727	switch (tag->bst_type) {
728	case PCI_CONFIG_BUS_SPACE:
729	case PCI_IO_BUS_SPACE:
730	case PCI_MEMORY_BUS_SPACE:
731		pm_flags = TD_IE;
732		break;
733	default:
734		pm_flags = 0;
735		break;
736	}
737
738	if (!(flags & BUS_SPACE_MAP_CACHEABLE))
739		pm_flags |= TD_E;
740
741	if (vaddr != 0L)
742		sva = trunc_page(vaddr);
743	else {
744		if ((sva = kmem_alloc_nofault(kernel_map, size)) == 0)
745			panic("%s: cannot allocate virtual memory", __func__);
746	}
747
748	/* Preserve page offset. */
749	*hp = (void *)(sva | ((u_long)addr & PAGE_MASK));
750
751	pa = trunc_page(addr);
752	if ((flags & BUS_SPACE_MAP_READONLY) == 0)
753		pm_flags |= TD_W;
754
755	va = sva;
756	vsz = size;
757	do {
758		pmap_kenter_flags(va, pa, pm_flags);
759		va += PAGE_SIZE;
760		pa += PAGE_SIZE;
761	} while ((vsz -= PAGE_SIZE) > 0);
762	tlb_range_demap(kernel_pmap, sva, sva + size - 1);
763	return (0);
764}
765
766int
767sparc64_bus_mem_unmap(void *bh, bus_size_t size)
768{
769	vm_offset_t sva;
770	vm_offset_t va;
771	vm_offset_t endva;
772
773	sva = trunc_page((vm_offset_t)bh);
774	endva = sva + round_page(size);
775	for (va = sva; va < endva; va += PAGE_SIZE)
776		pmap_kremove_flags(va);
777	tlb_range_demap(kernel_pmap, sva, sva + size - 1);
778	kmem_free(kernel_map, sva, size);
779	return (0);
780}
781
782/*
783 * Fake up a bus tag, for use by console drivers in early boot when the regular
784 * means to allocate resources are not yet available.
785 * Addr is the physical address of the desired start of the handle.
786 */
787bus_space_handle_t
788sparc64_fake_bustag(int space, bus_addr_t addr, struct bus_space_tag *ptag)
789{
790
791	ptag->bst_cookie = NULL;
792	ptag->bst_parent = NULL;
793	ptag->bst_type = space;
794	ptag->bst_bus_barrier = nexus_bus_barrier;
795	return (addr);
796}
797
798/*
799 * Base bus space handlers.
800 */
801
802static void
803nexus_bus_barrier(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset,
804    bus_size_t size, int flags)
805{
806
807	/*
808	 * We have lots of alternatives depending on whether we're
809	 * synchronizing loads with loads, loads with stores, stores
810	 * with loads, or stores with stores.  The only ones that seem
811	 * generic are #Sync and #MemIssue.  I'll use #Sync for safety.
812	 */
813	switch(flags) {
814	case BUS_SPACE_BARRIER_READ | BUS_SPACE_BARRIER_WRITE:
815	case BUS_SPACE_BARRIER_READ:
816	case BUS_SPACE_BARRIER_WRITE:
817		membar(Sync);
818		break;
819	default:
820		panic("%s: unknown flags", __func__);
821	}
822	return;
823}
824
825struct bus_space_tag nexus_bustag = {
826	NULL,				/* cookie */
827	NULL,				/* parent bus tag */
828	NEXUS_BUS_SPACE,		/* type */
829	nexus_bus_barrier,		/* bus_space_barrier */
830};
831