2 * Copyright 2003 Eric Anholt
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
12 * The above copyright notice and this permission notice (including the next
13 * paragraph) shall be included in all copies or substantial portions of the
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * ERIC ANHOLT BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
20 * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
21 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
23 * $FreeBSD: head/sys/dev/drm2/drm_vm.c 235783 2012-05-22 11:07:44Z kib $"
27 * Support code for mmaping of DRM maps.
31 #include <sys/mutex2.h>
32 #include <vm/vm_page.h>
33 #include <vm/vm_pager.h>
37 int drm_mmap(struct dev_mmap_args *ap)
39 struct cdev *kdev = ap->a_head.a_dev;
40 vm_offset_t offset = ap->a_offset;
41 struct drm_device *dev = drm_get_device_from_kdev(kdev);
42 struct drm_file *file_priv = NULL;
43 struct drm_local_map *map = NULL;
44 struct drm_map_list *r_list;
47 enum drm_map_type type;
50 /* d_mmap gets called twice, we can only reference file_priv during
51 * the first call. We need to assume that if error is EBADF the
52 * call was succesful and the client is authenticated.
54 error = devfs_get_cdevpriv((void **)&file_priv);
55 if (error == ENOENT) {
56 DRM_ERROR("Could not find authenticator!\n");
60 if (file_priv && !file_priv->authenticated)
63 DRM_DEBUG("called with offset %016jx\n", (uintmax_t)offset);
64 if (dev->dma && offset < ptoa(dev->dma->page_count)) {
65 drm_device_dma_t *dma = dev->dma;
67 spin_lock(&dev->dma_lock);
69 if (dma->pagelist != NULL) {
70 unsigned long page = offset >> PAGE_SHIFT;
71 unsigned long phys = dma->pagelist[page];
73 spin_unlock(&dev->dma_lock);
78 spin_unlock(&dev->dma_lock);
83 /* A sequential search of a linked list is
84 fine here because: 1) there will only be
85 about 5-10 entries in the list and, 2) a
86 DRI client only has to do this mapping
87 once, so it doesn't have to be optimized
88 for performance, even if the list was a
92 list_for_each_entry(r_list, &dev->maplist, head) {
93 if (r_list->map && r_list->map->offset >> DRM_MAP_HANDLE_SHIFT ==
94 (unsigned long)r_list->map->handle >> DRM_MAP_HANDLE_SHIFT) {
101 DRM_DEBUG("Can't find map, request offset = %016jx\n",
103 list_for_each_entry(r_list, &dev->maplist, head) {
104 DRM_DEBUG("map offset = %016lx, handle = %016lx\n",
105 r_list->map->offset, (unsigned long)r_list->map->handle);
110 if (((map->flags & _DRM_RESTRICTED) && !DRM_SUSER(DRM_CURPROC))) {
112 DRM_DEBUG("restricted map\n");
118 offset = offset & ((1ULL << DRM_MAP_HANDLE_SHIFT) - 1);
121 case _DRM_FRAME_BUFFER:
124 *memattr = VM_MEMATTR_WRITE_COMBINING;
128 phys = map->offset + offset;
130 case _DRM_SCATTER_GATHER:
132 *memattr = VM_MEMATTR_WRITE_COMBINING;
135 case _DRM_CONSISTENT:
137 phys = vtophys((char *)map->virtual + offset);
140 DRM_ERROR("bad map type %d\n", type);
141 return -1; /* This should never happen. */
144 ap->a_result = atop(phys);
148 /* XXX The following is just temporary hack to replace the
149 * vm_phys_fictitious functions available on FreeBSD
151 #define VM_PHYS_FICTITIOUS_NSEGS 8
152 static struct vm_phys_fictitious_seg {
155 vm_page_t first_page;
156 } vm_phys_fictitious_segs[VM_PHYS_FICTITIOUS_NSEGS];
157 static struct mtx vm_phys_fictitious_reg_mtx = MTX_INITIALIZER;
159 MALLOC_DEFINE(M_FICT_PAGES, "", "");
162 vm_phys_fictitious_to_vm_page(vm_paddr_t pa)
164 struct vm_phys_fictitious_seg *seg;
169 for (segind = 0; segind < VM_PHYS_FICTITIOUS_NSEGS; segind++) {
170 seg = &vm_phys_fictitious_segs[segind];
171 if (pa >= seg->start && pa < seg->end) {
172 m = &seg->first_page[atop(pa - seg->start)];
173 KASSERT((m->flags & PG_FICTITIOUS) != 0,
174 ("%p not fictitious", m));
182 vm_phys_fictitious_reg_range(vm_paddr_t start, vm_paddr_t end,
183 vm_memattr_t memattr)
185 struct vm_phys_fictitious_seg *seg;
190 page_count = (end - start) / PAGE_SIZE;
192 fp = kmalloc(page_count * sizeof(struct vm_page), M_FICT_PAGES,
195 for (i = 0; i < page_count; i++) {
196 vm_page_initfake(&fp[i], start + PAGE_SIZE * i, memattr);
197 fp[i].flags &= ~(PG_BUSY | PG_UNMANAGED);
199 mtx_lock(&vm_phys_fictitious_reg_mtx);
200 for (segind = 0; segind < VM_PHYS_FICTITIOUS_NSEGS; segind++) {
201 seg = &vm_phys_fictitious_segs[segind];
202 if (seg->start == 0 && seg->end == 0) {
205 seg->first_page = fp;
206 mtx_unlock(&vm_phys_fictitious_reg_mtx);
210 mtx_unlock(&vm_phys_fictitious_reg_mtx);
211 kfree(fp, M_FICT_PAGES);
216 vm_phys_fictitious_unreg_range(vm_paddr_t start, vm_paddr_t end)
218 struct vm_phys_fictitious_seg *seg;
222 mtx_lock(&vm_phys_fictitious_reg_mtx);
223 for (segind = 0; segind < VM_PHYS_FICTITIOUS_NSEGS; segind++) {
224 seg = &vm_phys_fictitious_segs[segind];
225 if (seg->start == start && seg->end == end) {
226 seg->start = seg->end = 0;
227 fp = seg->first_page;
228 seg->first_page = NULL;
229 mtx_unlock(&vm_phys_fictitious_reg_mtx);
230 kfree(fp, M_FICT_PAGES);
234 mtx_unlock(&vm_phys_fictitious_reg_mtx);
235 KASSERT(0, ("Unregistering not registered fictitious range"));