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.
24 #include <sys/cdefs.h>
25 __FBSDID("$FreeBSD$");
28 * Support code for mmaping of DRM maps.
31 #include "dev/drm/drmP.h"
32 #include "dev/drm/drm.h"
34 int drm_mmap(struct cdev *kdev, vm_ooffset_t offset, vm_paddr_t *paddr,
35 int prot, vm_memattr_t *memattr)
37 struct drm_device *dev = drm_get_device_from_kdev(kdev);
38 struct drm_file *file_priv = NULL;
40 enum drm_map_type type;
44 /* d_mmap gets called twice, we can only reference file_priv during
45 * the first call. We need to assume that if error is EBADF the
46 * call was successful and the client is authenticated.
48 error = devfs_get_cdevpriv((void **)&file_priv);
49 if (error == ENOENT) {
50 DRM_ERROR("Could not find authenticator!\n");
54 if (file_priv && !file_priv->authenticated)
57 DRM_DEBUG("called with offset %016jx\n", offset);
58 if (dev->dma && offset < ptoa(dev->dma->page_count)) {
59 drm_device_dma_t *dma = dev->dma;
61 DRM_SPINLOCK(&dev->dma_lock);
63 if (dma->pagelist != NULL) {
64 unsigned long page = offset >> PAGE_SHIFT;
65 unsigned long phys = dma->pagelist[page];
67 DRM_SPINUNLOCK(&dev->dma_lock);
71 DRM_SPINUNLOCK(&dev->dma_lock);
76 /* A sequential search of a linked list is
77 fine here because: 1) there will only be
78 about 5-10 entries in the list and, 2) a
79 DRI client only has to do this mapping
80 once, so it doesn't have to be optimized
81 for performance, even if the list was a
85 TAILQ_FOREACH(map, &dev->maplist, link) {
86 if (offset >> DRM_MAP_HANDLE_SHIFT ==
87 (unsigned long)map->handle >> DRM_MAP_HANDLE_SHIFT)
92 DRM_DEBUG("Can't find map, request offset = %016jx\n", offset);
93 TAILQ_FOREACH(map, &dev->maplist, link) {
94 DRM_DEBUG("map offset = %016lx, handle = %016lx\n",
95 map->offset, (unsigned long)map->handle);
100 if (((map->flags & _DRM_RESTRICTED) && !DRM_SUSER(DRM_CURPROC))) {
102 DRM_DEBUG("restricted map\n");
108 offset = offset & ((1ULL << DRM_MAP_HANDLE_SHIFT) - 1);
111 case _DRM_FRAME_BUFFER:
113 *memattr = VM_MEMATTR_WRITE_COMBINING;
116 phys = map->offset + offset;
118 case _DRM_SCATTER_GATHER:
119 *memattr = VM_MEMATTR_WRITE_COMBINING;
121 case _DRM_CONSISTENT:
123 phys = vtophys((char *)map->virtual + offset);
126 DRM_ERROR("bad map type %d\n", type);
127 return -1; /* This should never happen. */