2 * Copyright (c) 2015 Marcel Moolenaar
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 #include <sys/cdefs.h>
27 __FBSDID("$FreeBSD$");
29 #include <sys/param.h>
30 #include <sys/systm.h>
31 #include <machine/bus.h>
32 #include <machine/bus_dma.h>
33 #include <machine/resource.h>
36 #include <sys/kernel.h>
37 #include <sys/malloc.h>
38 #include <sys/module.h>
39 #include <sys/queue.h>
45 #include <dev/proto/proto.h>
46 #include <dev/proto/proto_dev.h>
47 #include <dev/proto/proto_busdma.h>
49 MALLOC_DEFINE(M_PROTO_BUSDMA, "proto_busdma", "DMA management data");
52 proto_busdma_tag_create(struct proto_busdma *busdma, struct proto_tag *parent,
53 struct proto_ioc_busdma *ioc)
55 struct proto_tag *tag;
58 * If nsegs is 1, ignore maxsegsz. What this means is that if we have
59 * just 1 segment, then maxsz should be equal to maxsegsz. To keep it
60 * simple for us, limit maxsegsz to maxsz in any case.
62 if (ioc->u.tag.maxsegsz > ioc->u.tag.maxsz || ioc->u.tag.nsegs == 1)
63 ioc->u.tag.maxsegsz = ioc->u.tag.maxsz;
65 /* A bndry of 0 really means ~0, or no boundary. */
66 if (ioc->u.tag.bndry == 0)
67 ioc->u.tag.bndry = ~0U;
69 tag = malloc(sizeof(*tag), M_PROTO_BUSDMA, M_WAITOK | M_ZERO);
72 LIST_INSERT_HEAD(&parent->children, tag, peers);
73 tag->align = MAX(ioc->u.tag.align, parent->align);
74 tag->bndry = MIN(ioc->u.tag.bndry, parent->bndry);
75 tag->maxaddr = MIN(ioc->u.tag.maxaddr, parent->maxaddr);
76 tag->maxsz = MIN(ioc->u.tag.maxsz, parent->maxsz);
77 tag->maxsegsz = MIN(ioc->u.tag.maxsegsz, parent->maxsegsz);
78 tag->nsegs = MIN(ioc->u.tag.nsegs, parent->nsegs);
79 tag->datarate = MIN(ioc->u.tag.datarate, parent->datarate);
80 /* Write constraints back */
81 ioc->u.tag.align = tag->align;
82 ioc->u.tag.bndry = tag->bndry;
83 ioc->u.tag.maxaddr = tag->maxaddr;
84 ioc->u.tag.maxsz = tag->maxsz;
85 ioc->u.tag.maxsegsz = tag->maxsegsz;
86 ioc->u.tag.nsegs = tag->nsegs;
87 ioc->u.tag.datarate = tag->datarate;
89 tag->align = ioc->u.tag.align;
90 tag->bndry = ioc->u.tag.bndry;
91 tag->maxaddr = ioc->u.tag.maxaddr;
92 tag->maxsz = ioc->u.tag.maxsz;
93 tag->maxsegsz = ioc->u.tag.maxsegsz;
94 tag->nsegs = ioc->u.tag.nsegs;
95 tag->datarate = ioc->u.tag.datarate;
97 LIST_INSERT_HEAD(&busdma->tags, tag, tags);
98 ioc->result = (uintptr_t)(void *)tag;
103 proto_busdma_tag_destroy(struct proto_busdma *busdma, struct proto_tag *tag)
106 if (!LIST_EMPTY(&tag->mds))
108 if (!LIST_EMPTY(&tag->children))
111 if (tag->parent != NULL) {
112 LIST_REMOVE(tag, peers);
115 LIST_REMOVE(tag, tags);
116 free(tag, M_PROTO_BUSDMA);
120 static struct proto_tag *
121 proto_busdma_tag_lookup(struct proto_busdma *busdma, u_long key)
123 struct proto_tag *tag;
125 LIST_FOREACH(tag, &busdma->tags, tags) {
126 if ((void *)tag == (void *)key)
133 proto_busdma_mem_alloc_callback(void *arg, bus_dma_segment_t *segs, int nseg,
136 struct proto_ioc_busdma *ioc = arg;
138 ioc->u.mem.bus_nsegs = nseg;
139 ioc->u.mem.bus_addr = segs[0].ds_addr;
143 proto_busdma_mem_alloc(struct proto_busdma *busdma, struct proto_tag *tag,
144 struct proto_ioc_busdma *ioc)
149 md = malloc(sizeof(*md), M_PROTO_BUSDMA, M_WAITOK | M_ZERO);
152 error = bus_dma_tag_create(busdma->bd_roottag, tag->align, tag->bndry,
153 tag->maxaddr, BUS_SPACE_MAXADDR, NULL, NULL, tag->maxsz,
154 tag->nsegs, tag->maxsegsz, 0, NULL, NULL, &md->bd_tag);
156 free(md, M_PROTO_BUSDMA);
159 error = bus_dmamem_alloc(md->bd_tag, &md->virtaddr, 0, &md->bd_map);
161 bus_dma_tag_destroy(md->bd_tag);
162 free(md, M_PROTO_BUSDMA);
165 md->physaddr = pmap_kextract((uintptr_t)(md->virtaddr));
166 error = bus_dmamap_load(md->bd_tag, md->bd_map, md->virtaddr,
167 tag->maxsz, proto_busdma_mem_alloc_callback, ioc, BUS_DMA_NOWAIT);
169 bus_dmamem_free(md->bd_tag, md->virtaddr, md->bd_map);
170 bus_dma_tag_destroy(md->bd_tag);
171 free(md, M_PROTO_BUSDMA);
174 LIST_INSERT_HEAD(&tag->mds, md, peers);
175 LIST_INSERT_HEAD(&busdma->mds, md, mds);
176 ioc->u.mem.phys_nsegs = 1;
177 ioc->u.mem.phys_addr = md->physaddr;
178 ioc->result = (uintptr_t)(void *)md;
183 proto_busdma_mem_free(struct proto_busdma *busdma, struct proto_md *md)
186 LIST_REMOVE(md, mds);
187 LIST_REMOVE(md, peers);
188 bus_dmamem_free(md->bd_tag, md->virtaddr, md->bd_map);
189 bus_dma_tag_destroy(md->bd_tag);
190 free(md, M_PROTO_BUSDMA);
194 static struct proto_md *
195 proto_busdma_md_lookup(struct proto_busdma *busdma, u_long key)
199 LIST_FOREACH(md, &busdma->mds, mds) {
200 if ((void *)md == (void *)key)
206 struct proto_busdma *
207 proto_busdma_attach(struct proto_softc *sc)
209 struct proto_busdma *busdma;
211 busdma = malloc(sizeof(*busdma), M_PROTO_BUSDMA, M_WAITOK | M_ZERO);
216 proto_busdma_detach(struct proto_softc *sc, struct proto_busdma *busdma)
219 proto_busdma_cleanup(sc, busdma);
220 free(busdma, M_PROTO_BUSDMA);
225 proto_busdma_cleanup(struct proto_softc *sc, struct proto_busdma *busdma)
227 struct proto_md *md, *md1;
228 struct proto_tag *tag, *tag1;
230 LIST_FOREACH_SAFE(md, &busdma->mds, mds, md1)
231 proto_busdma_mem_free(busdma, md);
232 LIST_FOREACH_SAFE(tag, &busdma->tags, tags, tag1)
233 proto_busdma_tag_destroy(busdma, tag);
238 proto_busdma_ioctl(struct proto_softc *sc, struct proto_busdma *busdma,
239 struct proto_ioc_busdma *ioc)
241 struct proto_tag *tag;
246 switch (ioc->request) {
247 case PROTO_IOC_BUSDMA_TAG_CREATE:
248 busdma->bd_roottag = bus_get_dma_tag(sc->sc_dev);
249 error = proto_busdma_tag_create(busdma, NULL, ioc);
251 case PROTO_IOC_BUSDMA_TAG_DERIVE:
252 tag = proto_busdma_tag_lookup(busdma, ioc->key);
257 error = proto_busdma_tag_create(busdma, tag, ioc);
259 case PROTO_IOC_BUSDMA_TAG_DESTROY:
260 tag = proto_busdma_tag_lookup(busdma, ioc->key);
265 error = proto_busdma_tag_destroy(busdma, tag);
267 case PROTO_IOC_BUSDMA_MEM_ALLOC:
268 tag = proto_busdma_tag_lookup(busdma, ioc->u.mem.tag);
273 error = proto_busdma_mem_alloc(busdma, tag, ioc);
275 case PROTO_IOC_BUSDMA_MEM_FREE:
276 md = proto_busdma_md_lookup(busdma, ioc->key);
281 error = proto_busdma_mem_free(busdma, md);
291 proto_busdma_mmap_allowed(struct proto_busdma *busdma, vm_paddr_t physaddr)
295 LIST_FOREACH(md, &busdma->mds, mds) {
296 if (physaddr >= trunc_page(md->physaddr) &&
297 physaddr <= trunc_page(md->physaddr + md->tag->maxsz))