1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*-
* Copyright 2003 Eric Anholt
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* ERIC ANHOLT BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/** @file drm_vm.c
* Support code for mmaping of DRM maps.
*/
#include "drmP.h"
#include "drm.h"
paddr_t
drmmmap(dev_t kdev, off_t offset, int prot)
{
struct drm_device *dev = drm_get_device_from_kdev(kdev);
drm_local_map_t *map;
struct drm_file *priv;
drm_map_type_t type;
paddr_t phys;
DRM_LOCK();
priv = drm_find_file_by_minor(dev, minor(kdev));
DRM_UNLOCK();
if (priv == NULL) {
DRM_ERROR("can't find authenticator\n");
return (EINVAL);
}
if (!priv->authenticated)
return (EACCES);
if (dev->dma && offset >= 0 && offset < ptoa(dev->dma->page_count)) {
drm_device_dma_t *dma = dev->dma;
DRM_SPINLOCK(&dev->dma_lock);
if (dma->pagelist != NULL) {
unsigned long page = offset >> PAGE_SHIFT;
unsigned long phys = dma->pagelist[page];
DRM_SPINUNLOCK(&dev->dma_lock);
return (atop(phys));
} else {
DRM_SPINUNLOCK(&dev->dma_lock);
return (-1);
}
}
/*
* A sequential search of a linked list is
* fine here because: 1) there will only be
* about 5-10 entries in the list and, 2) a
* DRI client only has to do this mapping
* once, so it doesn't have to be optimized
* for performance, even if the list was a
* bit longer.
*/
DRM_LOCK();
TAILQ_FOREACH(map, &dev->maplist, link) {
if (offset >= map->ext &&
offset < map->ext + map->size) {
offset -= map->ext;
break;
}
}
if (map == NULL) {
DRM_UNLOCK();
DRM_DEBUG("can't find map\n");
return (-1);
}
if (((map->flags & _DRM_RESTRICTED) && priv->master == 0)) {
DRM_UNLOCK();
DRM_DEBUG("restricted map\n");
return (-1);
}
type = map->type;
DRM_UNLOCK();
switch (type) {
case _DRM_FRAME_BUFFER:
case _DRM_REGISTERS:
case _DRM_AGP:
phys = offset + map->offset;
break;
/* XXX unify all the bus_dmamem_mmap bits */
case _DRM_SCATTER_GATHER:
return (bus_dmamem_mmap(dev->pa.pa_dmat, dev->sg->mem->sg_segs,
dev->sg->mem->sg_nsegs, map->offset - dev->sg->handle +
offset, prot, BUS_DMA_NOWAIT));
case _DRM_SHM:
case _DRM_CONSISTENT:
return (bus_dmamem_mmap(dev->pa.pa_dmat, &map->dmah->seg, 1,
offset, prot, BUS_DMA_NOWAIT));
default:
DRM_ERROR("bad map type %d\n", type);
return (-1); /* This should never happen. */
}
return (atop(phys));
}
|
