drm_bufs.c revision 1.1 1 1.1 riastrad /**
2 1.1 riastrad * \file drm_bufs.c
3 1.1 riastrad * Generic buffer template
4 1.1 riastrad *
5 1.1 riastrad * \author Rickard E. (Rik) Faith <faith (at) valinux.com>
6 1.1 riastrad * \author Gareth Hughes <gareth (at) valinux.com>
7 1.1 riastrad */
8 1.1 riastrad
9 1.1 riastrad /*
10 1.1 riastrad * Created: Thu Nov 23 03:10:50 2000 by gareth (at) valinux.com
11 1.1 riastrad *
12 1.1 riastrad * Copyright 1999, 2000 Precision Insight, Inc., Cedar Park, Texas.
13 1.1 riastrad * Copyright 2000 VA Linux Systems, Inc., Sunnyvale, California.
14 1.1 riastrad * All Rights Reserved.
15 1.1 riastrad *
16 1.1 riastrad * Permission is hereby granted, free of charge, to any person obtaining a
17 1.1 riastrad * copy of this software and associated documentation files (the "Software"),
18 1.1 riastrad * to deal in the Software without restriction, including without limitation
19 1.1 riastrad * the rights to use, copy, modify, merge, publish, distribute, sublicense,
20 1.1 riastrad * and/or sell copies of the Software, and to permit persons to whom the
21 1.1 riastrad * Software is furnished to do so, subject to the following conditions:
22 1.1 riastrad *
23 1.1 riastrad * The above copyright notice and this permission notice (including the next
24 1.1 riastrad * paragraph) shall be included in all copies or substantial portions of the
25 1.1 riastrad * Software.
26 1.1 riastrad *
27 1.1 riastrad * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
28 1.1 riastrad * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
29 1.1 riastrad * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
30 1.1 riastrad * VA LINUX SYSTEMS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
31 1.1 riastrad * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
32 1.1 riastrad * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
33 1.1 riastrad * OTHER DEALINGS IN THE SOFTWARE.
34 1.1 riastrad */
35 1.1 riastrad
36 1.1 riastrad #include <linux/vmalloc.h>
37 1.1 riastrad #include <linux/slab.h>
38 1.1 riastrad #include <linux/log2.h>
39 1.1 riastrad #include <linux/export.h>
40 1.1 riastrad #include <asm/shmparam.h>
41 1.1 riastrad #include <drm/drmP.h>
42 1.1 riastrad
43 1.1 riastrad static struct drm_map_list *drm_find_matching_map(struct drm_device *dev,
44 1.1 riastrad struct drm_local_map *map)
45 1.1 riastrad {
46 1.1 riastrad struct drm_map_list *entry;
47 1.1 riastrad list_for_each_entry(entry, &dev->maplist, head) {
48 1.1 riastrad /*
49 1.1 riastrad * Because the kernel-userspace ABI is fixed at a 32-bit offset
50 1.1 riastrad * while PCI resources may live above that, we only compare the
51 1.1 riastrad * lower 32 bits of the map offset for maps of type
52 1.1 riastrad * _DRM_FRAMEBUFFER or _DRM_REGISTERS.
53 1.1 riastrad * It is assumed that if a driver have more than one resource
54 1.1 riastrad * of each type, the lower 32 bits are different.
55 1.1 riastrad */
56 1.1 riastrad if (!entry->map ||
57 1.1 riastrad map->type != entry->map->type ||
58 1.1 riastrad entry->master != dev->primary->master)
59 1.1 riastrad continue;
60 1.1 riastrad switch (map->type) {
61 1.1 riastrad case _DRM_SHM:
62 1.1 riastrad if (map->flags != _DRM_CONTAINS_LOCK)
63 1.1 riastrad break;
64 1.1 riastrad return entry;
65 1.1 riastrad case _DRM_REGISTERS:
66 1.1 riastrad case _DRM_FRAME_BUFFER:
67 1.1 riastrad if ((entry->map->offset & 0xffffffff) ==
68 1.1 riastrad (map->offset & 0xffffffff))
69 1.1 riastrad return entry;
70 1.1 riastrad default: /* Make gcc happy */
71 1.1 riastrad ;
72 1.1 riastrad }
73 1.1 riastrad if (entry->map->offset == map->offset)
74 1.1 riastrad return entry;
75 1.1 riastrad }
76 1.1 riastrad
77 1.1 riastrad return NULL;
78 1.1 riastrad }
79 1.1 riastrad
80 1.1 riastrad static int drm_map_handle(struct drm_device *dev, struct drm_hash_item *hash,
81 1.1 riastrad unsigned long user_token, int hashed_handle, int shm)
82 1.1 riastrad {
83 1.1 riastrad int use_hashed_handle, shift;
84 1.1 riastrad unsigned long add;
85 1.1 riastrad
86 1.1 riastrad #if (BITS_PER_LONG == 64)
87 1.1 riastrad use_hashed_handle = ((user_token & 0xFFFFFFFF00000000UL) || hashed_handle);
88 1.1 riastrad #elif (BITS_PER_LONG == 32)
89 1.1 riastrad use_hashed_handle = hashed_handle;
90 1.1 riastrad #else
91 1.1 riastrad #error Unsupported long size. Neither 64 nor 32 bits.
92 1.1 riastrad #endif
93 1.1 riastrad
94 1.1 riastrad if (!use_hashed_handle) {
95 1.1 riastrad int ret;
96 1.1 riastrad hash->key = user_token >> PAGE_SHIFT;
97 1.1 riastrad ret = drm_ht_insert_item(&dev->map_hash, hash);
98 1.1 riastrad if (ret != -EINVAL)
99 1.1 riastrad return ret;
100 1.1 riastrad }
101 1.1 riastrad
102 1.1 riastrad shift = 0;
103 1.1 riastrad add = DRM_MAP_HASH_OFFSET >> PAGE_SHIFT;
104 1.1 riastrad if (shm && (SHMLBA > PAGE_SIZE)) {
105 1.1 riastrad int bits = ilog2(SHMLBA >> PAGE_SHIFT) + 1;
106 1.1 riastrad
107 1.1 riastrad /* For shared memory, we have to preserve the SHMLBA
108 1.1 riastrad * bits of the eventual vma->vm_pgoff value during
109 1.1 riastrad * mmap(). Otherwise we run into cache aliasing problems
110 1.1 riastrad * on some platforms. On these platforms, the pgoff of
111 1.1 riastrad * a mmap() request is used to pick a suitable virtual
112 1.1 riastrad * address for the mmap() region such that it will not
113 1.1 riastrad * cause cache aliasing problems.
114 1.1 riastrad *
115 1.1 riastrad * Therefore, make sure the SHMLBA relevant bits of the
116 1.1 riastrad * hash value we use are equal to those in the original
117 1.1 riastrad * kernel virtual address.
118 1.1 riastrad */
119 1.1 riastrad shift = bits;
120 1.1 riastrad add |= ((user_token >> PAGE_SHIFT) & ((1UL << bits) - 1UL));
121 1.1 riastrad }
122 1.1 riastrad
123 1.1 riastrad return drm_ht_just_insert_please(&dev->map_hash, hash,
124 1.1 riastrad user_token, 32 - PAGE_SHIFT - 3,
125 1.1 riastrad shift, add);
126 1.1 riastrad }
127 1.1 riastrad
128 1.1 riastrad /**
129 1.1 riastrad * Core function to create a range of memory available for mapping by a
130 1.1 riastrad * non-root process.
131 1.1 riastrad *
132 1.1 riastrad * Adjusts the memory offset to its absolute value according to the mapping
133 1.1 riastrad * type. Adds the map to the map list drm_device::maplist. Adds MTRR's where
134 1.1 riastrad * applicable and if supported by the kernel.
135 1.1 riastrad */
136 1.1 riastrad static int drm_addmap_core(struct drm_device * dev, resource_size_t offset,
137 1.1 riastrad unsigned int size, enum drm_map_type type,
138 1.1 riastrad enum drm_map_flags flags,
139 1.1 riastrad struct drm_map_list ** maplist)
140 1.1 riastrad {
141 1.1 riastrad struct drm_local_map *map;
142 1.1 riastrad struct drm_map_list *list;
143 1.1 riastrad drm_dma_handle_t *dmah;
144 1.1 riastrad unsigned long user_token;
145 1.1 riastrad int ret;
146 1.1 riastrad
147 1.1 riastrad map = kmalloc(sizeof(*map), GFP_KERNEL);
148 1.1 riastrad if (!map)
149 1.1 riastrad return -ENOMEM;
150 1.1 riastrad
151 1.1 riastrad map->offset = offset;
152 1.1 riastrad map->size = size;
153 1.1 riastrad map->flags = flags;
154 1.1 riastrad map->type = type;
155 1.1 riastrad
156 1.1 riastrad /* Only allow shared memory to be removable since we only keep enough
157 1.1 riastrad * book keeping information about shared memory to allow for removal
158 1.1 riastrad * when processes fork.
159 1.1 riastrad */
160 1.1 riastrad if ((map->flags & _DRM_REMOVABLE) && map->type != _DRM_SHM) {
161 1.1 riastrad kfree(map);
162 1.1 riastrad return -EINVAL;
163 1.1 riastrad }
164 1.1 riastrad DRM_DEBUG("offset = 0x%08llx, size = 0x%08lx, type = %d\n",
165 1.1 riastrad (unsigned long long)map->offset, map->size, map->type);
166 1.1 riastrad
167 1.1 riastrad /* page-align _DRM_SHM maps. They are allocated here so there is no security
168 1.1 riastrad * hole created by that and it works around various broken drivers that use
169 1.1 riastrad * a non-aligned quantity to map the SAREA. --BenH
170 1.1 riastrad */
171 1.1 riastrad if (map->type == _DRM_SHM)
172 1.1 riastrad map->size = PAGE_ALIGN(map->size);
173 1.1 riastrad
174 1.1 riastrad if ((map->offset & (~(resource_size_t)PAGE_MASK)) || (map->size & (~PAGE_MASK))) {
175 1.1 riastrad kfree(map);
176 1.1 riastrad return -EINVAL;
177 1.1 riastrad }
178 1.1 riastrad map->mtrr = -1;
179 1.1 riastrad map->handle = NULL;
180 1.1 riastrad
181 1.1 riastrad switch (map->type) {
182 1.1 riastrad case _DRM_REGISTERS:
183 1.1 riastrad case _DRM_FRAME_BUFFER:
184 1.1 riastrad #if !defined(__sparc__) && !defined(__alpha__) && !defined(__ia64__) && !defined(__powerpc64__) && !defined(__x86_64__) && !defined(__arm__)
185 1.1 riastrad if (map->offset + (map->size-1) < map->offset ||
186 1.1 riastrad map->offset < virt_to_phys(high_memory)) {
187 1.1 riastrad kfree(map);
188 1.1 riastrad return -EINVAL;
189 1.1 riastrad }
190 1.1 riastrad #endif
191 1.1 riastrad /* Some drivers preinitialize some maps, without the X Server
192 1.1 riastrad * needing to be aware of it. Therefore, we just return success
193 1.1 riastrad * when the server tries to create a duplicate map.
194 1.1 riastrad */
195 1.1 riastrad list = drm_find_matching_map(dev, map);
196 1.1 riastrad if (list != NULL) {
197 1.1 riastrad if (list->map->size != map->size) {
198 1.1 riastrad DRM_DEBUG("Matching maps of type %d with "
199 1.1 riastrad "mismatched sizes, (%ld vs %ld)\n",
200 1.1 riastrad map->type, map->size,
201 1.1 riastrad list->map->size);
202 1.1 riastrad list->map->size = map->size;
203 1.1 riastrad }
204 1.1 riastrad
205 1.1 riastrad kfree(map);
206 1.1 riastrad *maplist = list;
207 1.1 riastrad return 0;
208 1.1 riastrad }
209 1.1 riastrad
210 1.1 riastrad if (drm_core_has_MTRR(dev)) {
211 1.1 riastrad if (map->type == _DRM_FRAME_BUFFER ||
212 1.1 riastrad (map->flags & _DRM_WRITE_COMBINING)) {
213 1.1 riastrad map->mtrr = mtrr_add(map->offset, map->size,
214 1.1 riastrad MTRR_TYPE_WRCOMB, 1);
215 1.1 riastrad }
216 1.1 riastrad }
217 1.1 riastrad if (map->type == _DRM_REGISTERS) {
218 1.1 riastrad map->handle = ioremap(map->offset, map->size);
219 1.1 riastrad if (!map->handle) {
220 1.1 riastrad kfree(map);
221 1.1 riastrad return -ENOMEM;
222 1.1 riastrad }
223 1.1 riastrad }
224 1.1 riastrad
225 1.1 riastrad break;
226 1.1 riastrad case _DRM_SHM:
227 1.1 riastrad list = drm_find_matching_map(dev, map);
228 1.1 riastrad if (list != NULL) {
229 1.1 riastrad if(list->map->size != map->size) {
230 1.1 riastrad DRM_DEBUG("Matching maps of type %d with "
231 1.1 riastrad "mismatched sizes, (%ld vs %ld)\n",
232 1.1 riastrad map->type, map->size, list->map->size);
233 1.1 riastrad list->map->size = map->size;
234 1.1 riastrad }
235 1.1 riastrad
236 1.1 riastrad kfree(map);
237 1.1 riastrad *maplist = list;
238 1.1 riastrad return 0;
239 1.1 riastrad }
240 1.1 riastrad map->handle = vmalloc_user(map->size);
241 1.1 riastrad DRM_DEBUG("%lu %d %p\n",
242 1.1 riastrad map->size, drm_order(map->size), map->handle);
243 1.1 riastrad if (!map->handle) {
244 1.1 riastrad kfree(map);
245 1.1 riastrad return -ENOMEM;
246 1.1 riastrad }
247 1.1 riastrad map->offset = (unsigned long)map->handle;
248 1.1 riastrad if (map->flags & _DRM_CONTAINS_LOCK) {
249 1.1 riastrad /* Prevent a 2nd X Server from creating a 2nd lock */
250 1.1 riastrad if (dev->primary->master->lock.hw_lock != NULL) {
251 1.1 riastrad vfree(map->handle);
252 1.1 riastrad kfree(map);
253 1.1 riastrad return -EBUSY;
254 1.1 riastrad }
255 1.1 riastrad dev->sigdata.lock = dev->primary->master->lock.hw_lock = map->handle; /* Pointer to lock */
256 1.1 riastrad }
257 1.1 riastrad break;
258 1.1 riastrad case _DRM_AGP: {
259 1.1 riastrad struct drm_agp_mem *entry;
260 1.1 riastrad int valid = 0;
261 1.1 riastrad
262 1.1 riastrad if (!drm_core_has_AGP(dev)) {
263 1.1 riastrad kfree(map);
264 1.1 riastrad return -EINVAL;
265 1.1 riastrad }
266 1.1 riastrad #ifdef __alpha__
267 1.1 riastrad map->offset += dev->hose->mem_space->start;
268 1.1 riastrad #endif
269 1.1 riastrad /* In some cases (i810 driver), user space may have already
270 1.1 riastrad * added the AGP base itself, because dev->agp->base previously
271 1.1 riastrad * only got set during AGP enable. So, only add the base
272 1.1 riastrad * address if the map's offset isn't already within the
273 1.1 riastrad * aperture.
274 1.1 riastrad */
275 1.1 riastrad if (map->offset < dev->agp->base ||
276 1.1 riastrad map->offset > dev->agp->base +
277 1.1 riastrad dev->agp->agp_info.aper_size * 1024 * 1024 - 1) {
278 1.1 riastrad map->offset += dev->agp->base;
279 1.1 riastrad }
280 1.1 riastrad map->mtrr = dev->agp->agp_mtrr; /* for getmap */
281 1.1 riastrad
282 1.1 riastrad /* This assumes the DRM is in total control of AGP space.
283 1.1 riastrad * It's not always the case as AGP can be in the control
284 1.1 riastrad * of user space (i.e. i810 driver). So this loop will get
285 1.1 riastrad * skipped and we double check that dev->agp->memory is
286 1.1 riastrad * actually set as well as being invalid before EPERM'ing
287 1.1 riastrad */
288 1.1 riastrad list_for_each_entry(entry, &dev->agp->memory, head) {
289 1.1 riastrad if ((map->offset >= entry->bound) &&
290 1.1 riastrad (map->offset + map->size <= entry->bound + entry->pages * PAGE_SIZE)) {
291 1.1 riastrad valid = 1;
292 1.1 riastrad break;
293 1.1 riastrad }
294 1.1 riastrad }
295 1.1 riastrad if (!list_empty(&dev->agp->memory) && !valid) {
296 1.1 riastrad kfree(map);
297 1.1 riastrad return -EPERM;
298 1.1 riastrad }
299 1.1 riastrad DRM_DEBUG("AGP offset = 0x%08llx, size = 0x%08lx\n",
300 1.1 riastrad (unsigned long long)map->offset, map->size);
301 1.1 riastrad
302 1.1 riastrad break;
303 1.1 riastrad }
304 1.1 riastrad case _DRM_GEM:
305 1.1 riastrad DRM_ERROR("tried to addmap GEM object\n");
306 1.1 riastrad break;
307 1.1 riastrad case _DRM_SCATTER_GATHER:
308 1.1 riastrad if (!dev->sg) {
309 1.1 riastrad kfree(map);
310 1.1 riastrad return -EINVAL;
311 1.1 riastrad }
312 1.1 riastrad map->offset += (unsigned long)dev->sg->virtual;
313 1.1 riastrad break;
314 1.1 riastrad case _DRM_CONSISTENT:
315 1.1 riastrad /* dma_addr_t is 64bit on i386 with CONFIG_HIGHMEM64G,
316 1.1 riastrad * As we're limiting the address to 2^32-1 (or less),
317 1.1 riastrad * casting it down to 32 bits is no problem, but we
318 1.1 riastrad * need to point to a 64bit variable first. */
319 1.1 riastrad dmah = drm_pci_alloc(dev, map->size, map->size);
320 1.1 riastrad if (!dmah) {
321 1.1 riastrad kfree(map);
322 1.1 riastrad return -ENOMEM;
323 1.1 riastrad }
324 1.1 riastrad map->handle = dmah->vaddr;
325 1.1 riastrad map->offset = (unsigned long)dmah->busaddr;
326 1.1 riastrad kfree(dmah);
327 1.1 riastrad break;
328 1.1 riastrad default:
329 1.1 riastrad kfree(map);
330 1.1 riastrad return -EINVAL;
331 1.1 riastrad }
332 1.1 riastrad
333 1.1 riastrad list = kzalloc(sizeof(*list), GFP_KERNEL);
334 1.1 riastrad if (!list) {
335 1.1 riastrad if (map->type == _DRM_REGISTERS)
336 1.1 riastrad iounmap(map->handle);
337 1.1 riastrad kfree(map);
338 1.1 riastrad return -EINVAL;
339 1.1 riastrad }
340 1.1 riastrad list->map = map;
341 1.1 riastrad
342 1.1 riastrad mutex_lock(&dev->struct_mutex);
343 1.1 riastrad list_add(&list->head, &dev->maplist);
344 1.1 riastrad
345 1.1 riastrad /* Assign a 32-bit handle */
346 1.1 riastrad /* We do it here so that dev->struct_mutex protects the increment */
347 1.1 riastrad user_token = (map->type == _DRM_SHM) ? (unsigned long)map->handle :
348 1.1 riastrad map->offset;
349 1.1 riastrad ret = drm_map_handle(dev, &list->hash, user_token, 0,
350 1.1 riastrad (map->type == _DRM_SHM));
351 1.1 riastrad if (ret) {
352 1.1 riastrad if (map->type == _DRM_REGISTERS)
353 1.1 riastrad iounmap(map->handle);
354 1.1 riastrad kfree(map);
355 1.1 riastrad kfree(list);
356 1.1 riastrad mutex_unlock(&dev->struct_mutex);
357 1.1 riastrad return ret;
358 1.1 riastrad }
359 1.1 riastrad
360 1.1 riastrad list->user_token = list->hash.key << PAGE_SHIFT;
361 1.1 riastrad mutex_unlock(&dev->struct_mutex);
362 1.1 riastrad
363 1.1 riastrad if (!(map->flags & _DRM_DRIVER))
364 1.1 riastrad list->master = dev->primary->master;
365 1.1 riastrad *maplist = list;
366 1.1 riastrad return 0;
367 1.1 riastrad }
368 1.1 riastrad
369 1.1 riastrad int drm_addmap(struct drm_device * dev, resource_size_t offset,
370 1.1 riastrad unsigned int size, enum drm_map_type type,
371 1.1 riastrad enum drm_map_flags flags, struct drm_local_map ** map_ptr)
372 1.1 riastrad {
373 1.1 riastrad struct drm_map_list *list;
374 1.1 riastrad int rc;
375 1.1 riastrad
376 1.1 riastrad rc = drm_addmap_core(dev, offset, size, type, flags, &list);
377 1.1 riastrad if (!rc)
378 1.1 riastrad *map_ptr = list->map;
379 1.1 riastrad return rc;
380 1.1 riastrad }
381 1.1 riastrad
382 1.1 riastrad EXPORT_SYMBOL(drm_addmap);
383 1.1 riastrad
384 1.1 riastrad /**
385 1.1 riastrad * Ioctl to specify a range of memory that is available for mapping by a
386 1.1 riastrad * non-root process.
387 1.1 riastrad *
388 1.1 riastrad * \param inode device inode.
389 1.1 riastrad * \param file_priv DRM file private.
390 1.1 riastrad * \param cmd command.
391 1.1 riastrad * \param arg pointer to a drm_map structure.
392 1.1 riastrad * \return zero on success or a negative value on error.
393 1.1 riastrad *
394 1.1 riastrad */
395 1.1 riastrad int drm_addmap_ioctl(struct drm_device *dev, void *data,
396 1.1 riastrad struct drm_file *file_priv)
397 1.1 riastrad {
398 1.1 riastrad struct drm_map *map = data;
399 1.1 riastrad struct drm_map_list *maplist;
400 1.1 riastrad int err;
401 1.1 riastrad
402 1.1 riastrad if (!(capable(CAP_SYS_ADMIN) || map->type == _DRM_AGP || map->type == _DRM_SHM))
403 1.1 riastrad return -EPERM;
404 1.1 riastrad
405 1.1 riastrad err = drm_addmap_core(dev, map->offset, map->size, map->type,
406 1.1 riastrad map->flags, &maplist);
407 1.1 riastrad
408 1.1 riastrad if (err)
409 1.1 riastrad return err;
410 1.1 riastrad
411 1.1 riastrad /* avoid a warning on 64-bit, this casting isn't very nice, but the API is set so too late */
412 1.1 riastrad map->handle = (void *)(unsigned long)maplist->user_token;
413 1.1 riastrad return 0;
414 1.1 riastrad }
415 1.1 riastrad
416 1.1 riastrad /**
417 1.1 riastrad * Remove a map private from list and deallocate resources if the mapping
418 1.1 riastrad * isn't in use.
419 1.1 riastrad *
420 1.1 riastrad * Searches the map on drm_device::maplist, removes it from the list, see if
421 1.1 riastrad * its being used, and free any associate resource (such as MTRR's) if it's not
422 1.1 riastrad * being on use.
423 1.1 riastrad *
424 1.1 riastrad * \sa drm_addmap
425 1.1 riastrad */
426 1.1 riastrad int drm_rmmap_locked(struct drm_device *dev, struct drm_local_map *map)
427 1.1 riastrad {
428 1.1 riastrad struct drm_map_list *r_list = NULL, *list_t;
429 1.1 riastrad drm_dma_handle_t dmah;
430 1.1 riastrad int found = 0;
431 1.1 riastrad struct drm_master *master;
432 1.1 riastrad
433 1.1 riastrad /* Find the list entry for the map and remove it */
434 1.1 riastrad list_for_each_entry_safe(r_list, list_t, &dev->maplist, head) {
435 1.1 riastrad if (r_list->map == map) {
436 1.1 riastrad master = r_list->master;
437 1.1 riastrad list_del(&r_list->head);
438 1.1 riastrad drm_ht_remove_key(&dev->map_hash,
439 1.1 riastrad r_list->user_token >> PAGE_SHIFT);
440 1.1 riastrad kfree(r_list);
441 1.1 riastrad found = 1;
442 1.1 riastrad break;
443 1.1 riastrad }
444 1.1 riastrad }
445 1.1 riastrad
446 1.1 riastrad if (!found)
447 1.1 riastrad return -EINVAL;
448 1.1 riastrad
449 1.1 riastrad switch (map->type) {
450 1.1 riastrad case _DRM_REGISTERS:
451 1.1 riastrad iounmap(map->handle);
452 1.1 riastrad /* FALLTHROUGH */
453 1.1 riastrad case _DRM_FRAME_BUFFER:
454 1.1 riastrad if (drm_core_has_MTRR(dev) && map->mtrr >= 0) {
455 1.1 riastrad int retcode;
456 1.1 riastrad retcode = mtrr_del(map->mtrr, map->offset, map->size);
457 1.1 riastrad DRM_DEBUG("mtrr_del=%d\n", retcode);
458 1.1 riastrad }
459 1.1 riastrad break;
460 1.1 riastrad case _DRM_SHM:
461 1.1 riastrad vfree(map->handle);
462 1.1 riastrad if (master) {
463 1.1 riastrad if (dev->sigdata.lock == master->lock.hw_lock)
464 1.1 riastrad dev->sigdata.lock = NULL;
465 1.1 riastrad master->lock.hw_lock = NULL; /* SHM removed */
466 1.1 riastrad master->lock.file_priv = NULL;
467 1.1 riastrad wake_up_interruptible_all(&master->lock.lock_queue);
468 1.1 riastrad }
469 1.1 riastrad break;
470 1.1 riastrad case _DRM_AGP:
471 1.1 riastrad case _DRM_SCATTER_GATHER:
472 1.1 riastrad break;
473 1.1 riastrad case _DRM_CONSISTENT:
474 1.1 riastrad dmah.vaddr = map->handle;
475 1.1 riastrad dmah.busaddr = map->offset;
476 1.1 riastrad dmah.size = map->size;
477 1.1 riastrad __drm_pci_free(dev, &dmah);
478 1.1 riastrad break;
479 1.1 riastrad case _DRM_GEM:
480 1.1 riastrad DRM_ERROR("tried to rmmap GEM object\n");
481 1.1 riastrad break;
482 1.1 riastrad }
483 1.1 riastrad kfree(map);
484 1.1 riastrad
485 1.1 riastrad return 0;
486 1.1 riastrad }
487 1.1 riastrad EXPORT_SYMBOL(drm_rmmap_locked);
488 1.1 riastrad
489 1.1 riastrad int drm_rmmap(struct drm_device *dev, struct drm_local_map *map)
490 1.1 riastrad {
491 1.1 riastrad int ret;
492 1.1 riastrad
493 1.1 riastrad mutex_lock(&dev->struct_mutex);
494 1.1 riastrad ret = drm_rmmap_locked(dev, map);
495 1.1 riastrad mutex_unlock(&dev->struct_mutex);
496 1.1 riastrad
497 1.1 riastrad return ret;
498 1.1 riastrad }
499 1.1 riastrad EXPORT_SYMBOL(drm_rmmap);
500 1.1 riastrad
501 1.1 riastrad /* The rmmap ioctl appears to be unnecessary. All mappings are torn down on
502 1.1 riastrad * the last close of the device, and this is necessary for cleanup when things
503 1.1 riastrad * exit uncleanly. Therefore, having userland manually remove mappings seems
504 1.1 riastrad * like a pointless exercise since they're going away anyway.
505 1.1 riastrad *
506 1.1 riastrad * One use case might be after addmap is allowed for normal users for SHM and
507 1.1 riastrad * gets used by drivers that the server doesn't need to care about. This seems
508 1.1 riastrad * unlikely.
509 1.1 riastrad *
510 1.1 riastrad * \param inode device inode.
511 1.1 riastrad * \param file_priv DRM file private.
512 1.1 riastrad * \param cmd command.
513 1.1 riastrad * \param arg pointer to a struct drm_map structure.
514 1.1 riastrad * \return zero on success or a negative value on error.
515 1.1 riastrad */
516 1.1 riastrad int drm_rmmap_ioctl(struct drm_device *dev, void *data,
517 1.1 riastrad struct drm_file *file_priv)
518 1.1 riastrad {
519 1.1 riastrad struct drm_map *request = data;
520 1.1 riastrad struct drm_local_map *map = NULL;
521 1.1 riastrad struct drm_map_list *r_list;
522 1.1 riastrad int ret;
523 1.1 riastrad
524 1.1 riastrad mutex_lock(&dev->struct_mutex);
525 1.1 riastrad list_for_each_entry(r_list, &dev->maplist, head) {
526 1.1 riastrad if (r_list->map &&
527 1.1 riastrad r_list->user_token == (unsigned long)request->handle &&
528 1.1 riastrad r_list->map->flags & _DRM_REMOVABLE) {
529 1.1 riastrad map = r_list->map;
530 1.1 riastrad break;
531 1.1 riastrad }
532 1.1 riastrad }
533 1.1 riastrad
534 1.1 riastrad /* List has wrapped around to the head pointer, or its empty we didn't
535 1.1 riastrad * find anything.
536 1.1 riastrad */
537 1.1 riastrad if (list_empty(&dev->maplist) || !map) {
538 1.1 riastrad mutex_unlock(&dev->struct_mutex);
539 1.1 riastrad return -EINVAL;
540 1.1 riastrad }
541 1.1 riastrad
542 1.1 riastrad /* Register and framebuffer maps are permanent */
543 1.1 riastrad if ((map->type == _DRM_REGISTERS) || (map->type == _DRM_FRAME_BUFFER)) {
544 1.1 riastrad mutex_unlock(&dev->struct_mutex);
545 1.1 riastrad return 0;
546 1.1 riastrad }
547 1.1 riastrad
548 1.1 riastrad ret = drm_rmmap_locked(dev, map);
549 1.1 riastrad
550 1.1 riastrad mutex_unlock(&dev->struct_mutex);
551 1.1 riastrad
552 1.1 riastrad return ret;
553 1.1 riastrad }
554 1.1 riastrad
555 1.1 riastrad /**
556 1.1 riastrad * Cleanup after an error on one of the addbufs() functions.
557 1.1 riastrad *
558 1.1 riastrad * \param dev DRM device.
559 1.1 riastrad * \param entry buffer entry where the error occurred.
560 1.1 riastrad *
561 1.1 riastrad * Frees any pages and buffers associated with the given entry.
562 1.1 riastrad */
563 1.1 riastrad static void drm_cleanup_buf_error(struct drm_device * dev,
564 1.1 riastrad struct drm_buf_entry * entry)
565 1.1 riastrad {
566 1.1 riastrad int i;
567 1.1 riastrad
568 1.1 riastrad if (entry->seg_count) {
569 1.1 riastrad for (i = 0; i < entry->seg_count; i++) {
570 1.1 riastrad if (entry->seglist[i]) {
571 1.1 riastrad drm_pci_free(dev, entry->seglist[i]);
572 1.1 riastrad }
573 1.1 riastrad }
574 1.1 riastrad kfree(entry->seglist);
575 1.1 riastrad
576 1.1 riastrad entry->seg_count = 0;
577 1.1 riastrad }
578 1.1 riastrad
579 1.1 riastrad if (entry->buf_count) {
580 1.1 riastrad for (i = 0; i < entry->buf_count; i++) {
581 1.1 riastrad kfree(entry->buflist[i].dev_private);
582 1.1 riastrad }
583 1.1 riastrad kfree(entry->buflist);
584 1.1 riastrad
585 1.1 riastrad entry->buf_count = 0;
586 1.1 riastrad }
587 1.1 riastrad }
588 1.1 riastrad
589 1.1 riastrad #if __OS_HAS_AGP
590 1.1 riastrad /**
591 1.1 riastrad * Add AGP buffers for DMA transfers.
592 1.1 riastrad *
593 1.1 riastrad * \param dev struct drm_device to which the buffers are to be added.
594 1.1 riastrad * \param request pointer to a struct drm_buf_desc describing the request.
595 1.1 riastrad * \return zero on success or a negative number on failure.
596 1.1 riastrad *
597 1.1 riastrad * After some sanity checks creates a drm_buf structure for each buffer and
598 1.1 riastrad * reallocates the buffer list of the same size order to accommodate the new
599 1.1 riastrad * buffers.
600 1.1 riastrad */
601 1.1 riastrad int drm_addbufs_agp(struct drm_device * dev, struct drm_buf_desc * request)
602 1.1 riastrad {
603 1.1 riastrad struct drm_device_dma *dma = dev->dma;
604 1.1 riastrad struct drm_buf_entry *entry;
605 1.1 riastrad struct drm_agp_mem *agp_entry;
606 1.1 riastrad struct drm_buf *buf;
607 1.1 riastrad unsigned long offset;
608 1.1 riastrad unsigned long agp_offset;
609 1.1 riastrad int count;
610 1.1 riastrad int order;
611 1.1 riastrad int size;
612 1.1 riastrad int alignment;
613 1.1 riastrad int page_order;
614 1.1 riastrad int total;
615 1.1 riastrad int byte_count;
616 1.1 riastrad int i, valid;
617 1.1 riastrad struct drm_buf **temp_buflist;
618 1.1 riastrad
619 1.1 riastrad if (!dma)
620 1.1 riastrad return -EINVAL;
621 1.1 riastrad
622 1.1 riastrad count = request->count;
623 1.1 riastrad order = drm_order(request->size);
624 1.1 riastrad size = 1 << order;
625 1.1 riastrad
626 1.1 riastrad alignment = (request->flags & _DRM_PAGE_ALIGN)
627 1.1 riastrad ? PAGE_ALIGN(size) : size;
628 1.1 riastrad page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
629 1.1 riastrad total = PAGE_SIZE << page_order;
630 1.1 riastrad
631 1.1 riastrad byte_count = 0;
632 1.1 riastrad agp_offset = dev->agp->base + request->agp_start;
633 1.1 riastrad
634 1.1 riastrad DRM_DEBUG("count: %d\n", count);
635 1.1 riastrad DRM_DEBUG("order: %d\n", order);
636 1.1 riastrad DRM_DEBUG("size: %d\n", size);
637 1.1 riastrad DRM_DEBUG("agp_offset: %lx\n", agp_offset);
638 1.1 riastrad DRM_DEBUG("alignment: %d\n", alignment);
639 1.1 riastrad DRM_DEBUG("page_order: %d\n", page_order);
640 1.1 riastrad DRM_DEBUG("total: %d\n", total);
641 1.1 riastrad
642 1.1 riastrad if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
643 1.1 riastrad return -EINVAL;
644 1.1 riastrad
645 1.1 riastrad /* Make sure buffers are located in AGP memory that we own */
646 1.1 riastrad valid = 0;
647 1.1 riastrad list_for_each_entry(agp_entry, &dev->agp->memory, head) {
648 1.1 riastrad if ((agp_offset >= agp_entry->bound) &&
649 1.1 riastrad (agp_offset + total * count <= agp_entry->bound + agp_entry->pages * PAGE_SIZE)) {
650 1.1 riastrad valid = 1;
651 1.1 riastrad break;
652 1.1 riastrad }
653 1.1 riastrad }
654 1.1 riastrad if (!list_empty(&dev->agp->memory) && !valid) {
655 1.1 riastrad DRM_DEBUG("zone invalid\n");
656 1.1 riastrad return -EINVAL;
657 1.1 riastrad }
658 1.1 riastrad spin_lock(&dev->count_lock);
659 1.1 riastrad if (dev->buf_use) {
660 1.1 riastrad spin_unlock(&dev->count_lock);
661 1.1 riastrad return -EBUSY;
662 1.1 riastrad }
663 1.1 riastrad atomic_inc(&dev->buf_alloc);
664 1.1 riastrad spin_unlock(&dev->count_lock);
665 1.1 riastrad
666 1.1 riastrad mutex_lock(&dev->struct_mutex);
667 1.1 riastrad entry = &dma->bufs[order];
668 1.1 riastrad if (entry->buf_count) {
669 1.1 riastrad mutex_unlock(&dev->struct_mutex);
670 1.1 riastrad atomic_dec(&dev->buf_alloc);
671 1.1 riastrad return -ENOMEM; /* May only call once for each order */
672 1.1 riastrad }
673 1.1 riastrad
674 1.1 riastrad if (count < 0 || count > 4096) {
675 1.1 riastrad mutex_unlock(&dev->struct_mutex);
676 1.1 riastrad atomic_dec(&dev->buf_alloc);
677 1.1 riastrad return -EINVAL;
678 1.1 riastrad }
679 1.1 riastrad
680 1.1 riastrad entry->buflist = kzalloc(count * sizeof(*entry->buflist), GFP_KERNEL);
681 1.1 riastrad if (!entry->buflist) {
682 1.1 riastrad mutex_unlock(&dev->struct_mutex);
683 1.1 riastrad atomic_dec(&dev->buf_alloc);
684 1.1 riastrad return -ENOMEM;
685 1.1 riastrad }
686 1.1 riastrad
687 1.1 riastrad entry->buf_size = size;
688 1.1 riastrad entry->page_order = page_order;
689 1.1 riastrad
690 1.1 riastrad offset = 0;
691 1.1 riastrad
692 1.1 riastrad while (entry->buf_count < count) {
693 1.1 riastrad buf = &entry->buflist[entry->buf_count];
694 1.1 riastrad buf->idx = dma->buf_count + entry->buf_count;
695 1.1 riastrad buf->total = alignment;
696 1.1 riastrad buf->order = order;
697 1.1 riastrad buf->used = 0;
698 1.1 riastrad
699 1.1 riastrad buf->offset = (dma->byte_count + offset);
700 1.1 riastrad buf->bus_address = agp_offset + offset;
701 1.1 riastrad buf->address = (void *)(agp_offset + offset);
702 1.1 riastrad buf->next = NULL;
703 1.1 riastrad buf->waiting = 0;
704 1.1 riastrad buf->pending = 0;
705 1.1 riastrad buf->file_priv = NULL;
706 1.1 riastrad
707 1.1 riastrad buf->dev_priv_size = dev->driver->dev_priv_size;
708 1.1 riastrad buf->dev_private = kzalloc(buf->dev_priv_size, GFP_KERNEL);
709 1.1 riastrad if (!buf->dev_private) {
710 1.1 riastrad /* Set count correctly so we free the proper amount. */
711 1.1 riastrad entry->buf_count = count;
712 1.1 riastrad drm_cleanup_buf_error(dev, entry);
713 1.1 riastrad mutex_unlock(&dev->struct_mutex);
714 1.1 riastrad atomic_dec(&dev->buf_alloc);
715 1.1 riastrad return -ENOMEM;
716 1.1 riastrad }
717 1.1 riastrad
718 1.1 riastrad DRM_DEBUG("buffer %d @ %p\n", entry->buf_count, buf->address);
719 1.1 riastrad
720 1.1 riastrad offset += alignment;
721 1.1 riastrad entry->buf_count++;
722 1.1 riastrad byte_count += PAGE_SIZE << page_order;
723 1.1 riastrad }
724 1.1 riastrad
725 1.1 riastrad DRM_DEBUG("byte_count: %d\n", byte_count);
726 1.1 riastrad
727 1.1 riastrad temp_buflist = krealloc(dma->buflist,
728 1.1 riastrad (dma->buf_count + entry->buf_count) *
729 1.1 riastrad sizeof(*dma->buflist), GFP_KERNEL);
730 1.1 riastrad if (!temp_buflist) {
731 1.1 riastrad /* Free the entry because it isn't valid */
732 1.1 riastrad drm_cleanup_buf_error(dev, entry);
733 1.1 riastrad mutex_unlock(&dev->struct_mutex);
734 1.1 riastrad atomic_dec(&dev->buf_alloc);
735 1.1 riastrad return -ENOMEM;
736 1.1 riastrad }
737 1.1 riastrad dma->buflist = temp_buflist;
738 1.1 riastrad
739 1.1 riastrad for (i = 0; i < entry->buf_count; i++) {
740 1.1 riastrad dma->buflist[i + dma->buf_count] = &entry->buflist[i];
741 1.1 riastrad }
742 1.1 riastrad
743 1.1 riastrad dma->buf_count += entry->buf_count;
744 1.1 riastrad dma->seg_count += entry->seg_count;
745 1.1 riastrad dma->page_count += byte_count >> PAGE_SHIFT;
746 1.1 riastrad dma->byte_count += byte_count;
747 1.1 riastrad
748 1.1 riastrad DRM_DEBUG("dma->buf_count : %d\n", dma->buf_count);
749 1.1 riastrad DRM_DEBUG("entry->buf_count : %d\n", entry->buf_count);
750 1.1 riastrad
751 1.1 riastrad mutex_unlock(&dev->struct_mutex);
752 1.1 riastrad
753 1.1 riastrad request->count = entry->buf_count;
754 1.1 riastrad request->size = size;
755 1.1 riastrad
756 1.1 riastrad dma->flags = _DRM_DMA_USE_AGP;
757 1.1 riastrad
758 1.1 riastrad atomic_dec(&dev->buf_alloc);
759 1.1 riastrad return 0;
760 1.1 riastrad }
761 1.1 riastrad EXPORT_SYMBOL(drm_addbufs_agp);
762 1.1 riastrad #endif /* __OS_HAS_AGP */
763 1.1 riastrad
764 1.1 riastrad int drm_addbufs_pci(struct drm_device * dev, struct drm_buf_desc * request)
765 1.1 riastrad {
766 1.1 riastrad struct drm_device_dma *dma = dev->dma;
767 1.1 riastrad int count;
768 1.1 riastrad int order;
769 1.1 riastrad int size;
770 1.1 riastrad int total;
771 1.1 riastrad int page_order;
772 1.1 riastrad struct drm_buf_entry *entry;
773 1.1 riastrad drm_dma_handle_t *dmah;
774 1.1 riastrad struct drm_buf *buf;
775 1.1 riastrad int alignment;
776 1.1 riastrad unsigned long offset;
777 1.1 riastrad int i;
778 1.1 riastrad int byte_count;
779 1.1 riastrad int page_count;
780 1.1 riastrad unsigned long *temp_pagelist;
781 1.1 riastrad struct drm_buf **temp_buflist;
782 1.1 riastrad
783 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_PCI_DMA))
784 1.1 riastrad return -EINVAL;
785 1.1 riastrad
786 1.1 riastrad if (!dma)
787 1.1 riastrad return -EINVAL;
788 1.1 riastrad
789 1.1 riastrad if (!capable(CAP_SYS_ADMIN))
790 1.1 riastrad return -EPERM;
791 1.1 riastrad
792 1.1 riastrad count = request->count;
793 1.1 riastrad order = drm_order(request->size);
794 1.1 riastrad size = 1 << order;
795 1.1 riastrad
796 1.1 riastrad DRM_DEBUG("count=%d, size=%d (%d), order=%d\n",
797 1.1 riastrad request->count, request->size, size, order);
798 1.1 riastrad
799 1.1 riastrad if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
800 1.1 riastrad return -EINVAL;
801 1.1 riastrad
802 1.1 riastrad alignment = (request->flags & _DRM_PAGE_ALIGN)
803 1.1 riastrad ? PAGE_ALIGN(size) : size;
804 1.1 riastrad page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
805 1.1 riastrad total = PAGE_SIZE << page_order;
806 1.1 riastrad
807 1.1 riastrad spin_lock(&dev->count_lock);
808 1.1 riastrad if (dev->buf_use) {
809 1.1 riastrad spin_unlock(&dev->count_lock);
810 1.1 riastrad return -EBUSY;
811 1.1 riastrad }
812 1.1 riastrad atomic_inc(&dev->buf_alloc);
813 1.1 riastrad spin_unlock(&dev->count_lock);
814 1.1 riastrad
815 1.1 riastrad mutex_lock(&dev->struct_mutex);
816 1.1 riastrad entry = &dma->bufs[order];
817 1.1 riastrad if (entry->buf_count) {
818 1.1 riastrad mutex_unlock(&dev->struct_mutex);
819 1.1 riastrad atomic_dec(&dev->buf_alloc);
820 1.1 riastrad return -ENOMEM; /* May only call once for each order */
821 1.1 riastrad }
822 1.1 riastrad
823 1.1 riastrad if (count < 0 || count > 4096) {
824 1.1 riastrad mutex_unlock(&dev->struct_mutex);
825 1.1 riastrad atomic_dec(&dev->buf_alloc);
826 1.1 riastrad return -EINVAL;
827 1.1 riastrad }
828 1.1 riastrad
829 1.1 riastrad entry->buflist = kzalloc(count * sizeof(*entry->buflist), GFP_KERNEL);
830 1.1 riastrad if (!entry->buflist) {
831 1.1 riastrad mutex_unlock(&dev->struct_mutex);
832 1.1 riastrad atomic_dec(&dev->buf_alloc);
833 1.1 riastrad return -ENOMEM;
834 1.1 riastrad }
835 1.1 riastrad
836 1.1 riastrad entry->seglist = kzalloc(count * sizeof(*entry->seglist), GFP_KERNEL);
837 1.1 riastrad if (!entry->seglist) {
838 1.1 riastrad kfree(entry->buflist);
839 1.1 riastrad mutex_unlock(&dev->struct_mutex);
840 1.1 riastrad atomic_dec(&dev->buf_alloc);
841 1.1 riastrad return -ENOMEM;
842 1.1 riastrad }
843 1.1 riastrad
844 1.1 riastrad /* Keep the original pagelist until we know all the allocations
845 1.1 riastrad * have succeeded
846 1.1 riastrad */
847 1.1 riastrad temp_pagelist = kmalloc((dma->page_count + (count << page_order)) *
848 1.1 riastrad sizeof(*dma->pagelist), GFP_KERNEL);
849 1.1 riastrad if (!temp_pagelist) {
850 1.1 riastrad kfree(entry->buflist);
851 1.1 riastrad kfree(entry->seglist);
852 1.1 riastrad mutex_unlock(&dev->struct_mutex);
853 1.1 riastrad atomic_dec(&dev->buf_alloc);
854 1.1 riastrad return -ENOMEM;
855 1.1 riastrad }
856 1.1 riastrad memcpy(temp_pagelist,
857 1.1 riastrad dma->pagelist, dma->page_count * sizeof(*dma->pagelist));
858 1.1 riastrad DRM_DEBUG("pagelist: %d entries\n",
859 1.1 riastrad dma->page_count + (count << page_order));
860 1.1 riastrad
861 1.1 riastrad entry->buf_size = size;
862 1.1 riastrad entry->page_order = page_order;
863 1.1 riastrad byte_count = 0;
864 1.1 riastrad page_count = 0;
865 1.1 riastrad
866 1.1 riastrad while (entry->buf_count < count) {
867 1.1 riastrad
868 1.1 riastrad dmah = drm_pci_alloc(dev, PAGE_SIZE << page_order, 0x1000);
869 1.1 riastrad
870 1.1 riastrad if (!dmah) {
871 1.1 riastrad /* Set count correctly so we free the proper amount. */
872 1.1 riastrad entry->buf_count = count;
873 1.1 riastrad entry->seg_count = count;
874 1.1 riastrad drm_cleanup_buf_error(dev, entry);
875 1.1 riastrad kfree(temp_pagelist);
876 1.1 riastrad mutex_unlock(&dev->struct_mutex);
877 1.1 riastrad atomic_dec(&dev->buf_alloc);
878 1.1 riastrad return -ENOMEM;
879 1.1 riastrad }
880 1.1 riastrad entry->seglist[entry->seg_count++] = dmah;
881 1.1 riastrad for (i = 0; i < (1 << page_order); i++) {
882 1.1 riastrad DRM_DEBUG("page %d @ 0x%08lx\n",
883 1.1 riastrad dma->page_count + page_count,
884 1.1 riastrad (unsigned long)dmah->vaddr + PAGE_SIZE * i);
885 1.1 riastrad temp_pagelist[dma->page_count + page_count++]
886 1.1 riastrad = (unsigned long)dmah->vaddr + PAGE_SIZE * i;
887 1.1 riastrad }
888 1.1 riastrad for (offset = 0;
889 1.1 riastrad offset + size <= total && entry->buf_count < count;
890 1.1 riastrad offset += alignment, ++entry->buf_count) {
891 1.1 riastrad buf = &entry->buflist[entry->buf_count];
892 1.1 riastrad buf->idx = dma->buf_count + entry->buf_count;
893 1.1 riastrad buf->total = alignment;
894 1.1 riastrad buf->order = order;
895 1.1 riastrad buf->used = 0;
896 1.1 riastrad buf->offset = (dma->byte_count + byte_count + offset);
897 1.1 riastrad buf->address = (void *)(dmah->vaddr + offset);
898 1.1 riastrad buf->bus_address = dmah->busaddr + offset;
899 1.1 riastrad buf->next = NULL;
900 1.1 riastrad buf->waiting = 0;
901 1.1 riastrad buf->pending = 0;
902 1.1 riastrad buf->file_priv = NULL;
903 1.1 riastrad
904 1.1 riastrad buf->dev_priv_size = dev->driver->dev_priv_size;
905 1.1 riastrad buf->dev_private = kzalloc(buf->dev_priv_size,
906 1.1 riastrad GFP_KERNEL);
907 1.1 riastrad if (!buf->dev_private) {
908 1.1 riastrad /* Set count correctly so we free the proper amount. */
909 1.1 riastrad entry->buf_count = count;
910 1.1 riastrad entry->seg_count = count;
911 1.1 riastrad drm_cleanup_buf_error(dev, entry);
912 1.1 riastrad kfree(temp_pagelist);
913 1.1 riastrad mutex_unlock(&dev->struct_mutex);
914 1.1 riastrad atomic_dec(&dev->buf_alloc);
915 1.1 riastrad return -ENOMEM;
916 1.1 riastrad }
917 1.1 riastrad
918 1.1 riastrad DRM_DEBUG("buffer %d @ %p\n",
919 1.1 riastrad entry->buf_count, buf->address);
920 1.1 riastrad }
921 1.1 riastrad byte_count += PAGE_SIZE << page_order;
922 1.1 riastrad }
923 1.1 riastrad
924 1.1 riastrad temp_buflist = krealloc(dma->buflist,
925 1.1 riastrad (dma->buf_count + entry->buf_count) *
926 1.1 riastrad sizeof(*dma->buflist), GFP_KERNEL);
927 1.1 riastrad if (!temp_buflist) {
928 1.1 riastrad /* Free the entry because it isn't valid */
929 1.1 riastrad drm_cleanup_buf_error(dev, entry);
930 1.1 riastrad kfree(temp_pagelist);
931 1.1 riastrad mutex_unlock(&dev->struct_mutex);
932 1.1 riastrad atomic_dec(&dev->buf_alloc);
933 1.1 riastrad return -ENOMEM;
934 1.1 riastrad }
935 1.1 riastrad dma->buflist = temp_buflist;
936 1.1 riastrad
937 1.1 riastrad for (i = 0; i < entry->buf_count; i++) {
938 1.1 riastrad dma->buflist[i + dma->buf_count] = &entry->buflist[i];
939 1.1 riastrad }
940 1.1 riastrad
941 1.1 riastrad /* No allocations failed, so now we can replace the original pagelist
942 1.1 riastrad * with the new one.
943 1.1 riastrad */
944 1.1 riastrad if (dma->page_count) {
945 1.1 riastrad kfree(dma->pagelist);
946 1.1 riastrad }
947 1.1 riastrad dma->pagelist = temp_pagelist;
948 1.1 riastrad
949 1.1 riastrad dma->buf_count += entry->buf_count;
950 1.1 riastrad dma->seg_count += entry->seg_count;
951 1.1 riastrad dma->page_count += entry->seg_count << page_order;
952 1.1 riastrad dma->byte_count += PAGE_SIZE * (entry->seg_count << page_order);
953 1.1 riastrad
954 1.1 riastrad mutex_unlock(&dev->struct_mutex);
955 1.1 riastrad
956 1.1 riastrad request->count = entry->buf_count;
957 1.1 riastrad request->size = size;
958 1.1 riastrad
959 1.1 riastrad if (request->flags & _DRM_PCI_BUFFER_RO)
960 1.1 riastrad dma->flags = _DRM_DMA_USE_PCI_RO;
961 1.1 riastrad
962 1.1 riastrad atomic_dec(&dev->buf_alloc);
963 1.1 riastrad return 0;
964 1.1 riastrad
965 1.1 riastrad }
966 1.1 riastrad EXPORT_SYMBOL(drm_addbufs_pci);
967 1.1 riastrad
968 1.1 riastrad static int drm_addbufs_sg(struct drm_device * dev, struct drm_buf_desc * request)
969 1.1 riastrad {
970 1.1 riastrad struct drm_device_dma *dma = dev->dma;
971 1.1 riastrad struct drm_buf_entry *entry;
972 1.1 riastrad struct drm_buf *buf;
973 1.1 riastrad unsigned long offset;
974 1.1 riastrad unsigned long agp_offset;
975 1.1 riastrad int count;
976 1.1 riastrad int order;
977 1.1 riastrad int size;
978 1.1 riastrad int alignment;
979 1.1 riastrad int page_order;
980 1.1 riastrad int total;
981 1.1 riastrad int byte_count;
982 1.1 riastrad int i;
983 1.1 riastrad struct drm_buf **temp_buflist;
984 1.1 riastrad
985 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_SG))
986 1.1 riastrad return -EINVAL;
987 1.1 riastrad
988 1.1 riastrad if (!dma)
989 1.1 riastrad return -EINVAL;
990 1.1 riastrad
991 1.1 riastrad if (!capable(CAP_SYS_ADMIN))
992 1.1 riastrad return -EPERM;
993 1.1 riastrad
994 1.1 riastrad count = request->count;
995 1.1 riastrad order = drm_order(request->size);
996 1.1 riastrad size = 1 << order;
997 1.1 riastrad
998 1.1 riastrad alignment = (request->flags & _DRM_PAGE_ALIGN)
999 1.1 riastrad ? PAGE_ALIGN(size) : size;
1000 1.1 riastrad page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
1001 1.1 riastrad total = PAGE_SIZE << page_order;
1002 1.1 riastrad
1003 1.1 riastrad byte_count = 0;
1004 1.1 riastrad agp_offset = request->agp_start;
1005 1.1 riastrad
1006 1.1 riastrad DRM_DEBUG("count: %d\n", count);
1007 1.1 riastrad DRM_DEBUG("order: %d\n", order);
1008 1.1 riastrad DRM_DEBUG("size: %d\n", size);
1009 1.1 riastrad DRM_DEBUG("agp_offset: %lu\n", agp_offset);
1010 1.1 riastrad DRM_DEBUG("alignment: %d\n", alignment);
1011 1.1 riastrad DRM_DEBUG("page_order: %d\n", page_order);
1012 1.1 riastrad DRM_DEBUG("total: %d\n", total);
1013 1.1 riastrad
1014 1.1 riastrad if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
1015 1.1 riastrad return -EINVAL;
1016 1.1 riastrad
1017 1.1 riastrad spin_lock(&dev->count_lock);
1018 1.1 riastrad if (dev->buf_use) {
1019 1.1 riastrad spin_unlock(&dev->count_lock);
1020 1.1 riastrad return -EBUSY;
1021 1.1 riastrad }
1022 1.1 riastrad atomic_inc(&dev->buf_alloc);
1023 1.1 riastrad spin_unlock(&dev->count_lock);
1024 1.1 riastrad
1025 1.1 riastrad mutex_lock(&dev->struct_mutex);
1026 1.1 riastrad entry = &dma->bufs[order];
1027 1.1 riastrad if (entry->buf_count) {
1028 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1029 1.1 riastrad atomic_dec(&dev->buf_alloc);
1030 1.1 riastrad return -ENOMEM; /* May only call once for each order */
1031 1.1 riastrad }
1032 1.1 riastrad
1033 1.1 riastrad if (count < 0 || count > 4096) {
1034 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1035 1.1 riastrad atomic_dec(&dev->buf_alloc);
1036 1.1 riastrad return -EINVAL;
1037 1.1 riastrad }
1038 1.1 riastrad
1039 1.1 riastrad entry->buflist = kzalloc(count * sizeof(*entry->buflist),
1040 1.1 riastrad GFP_KERNEL);
1041 1.1 riastrad if (!entry->buflist) {
1042 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1043 1.1 riastrad atomic_dec(&dev->buf_alloc);
1044 1.1 riastrad return -ENOMEM;
1045 1.1 riastrad }
1046 1.1 riastrad
1047 1.1 riastrad entry->buf_size = size;
1048 1.1 riastrad entry->page_order = page_order;
1049 1.1 riastrad
1050 1.1 riastrad offset = 0;
1051 1.1 riastrad
1052 1.1 riastrad while (entry->buf_count < count) {
1053 1.1 riastrad buf = &entry->buflist[entry->buf_count];
1054 1.1 riastrad buf->idx = dma->buf_count + entry->buf_count;
1055 1.1 riastrad buf->total = alignment;
1056 1.1 riastrad buf->order = order;
1057 1.1 riastrad buf->used = 0;
1058 1.1 riastrad
1059 1.1 riastrad buf->offset = (dma->byte_count + offset);
1060 1.1 riastrad buf->bus_address = agp_offset + offset;
1061 1.1 riastrad buf->address = (void *)(agp_offset + offset
1062 1.1 riastrad + (unsigned long)dev->sg->virtual);
1063 1.1 riastrad buf->next = NULL;
1064 1.1 riastrad buf->waiting = 0;
1065 1.1 riastrad buf->pending = 0;
1066 1.1 riastrad buf->file_priv = NULL;
1067 1.1 riastrad
1068 1.1 riastrad buf->dev_priv_size = dev->driver->dev_priv_size;
1069 1.1 riastrad buf->dev_private = kzalloc(buf->dev_priv_size, GFP_KERNEL);
1070 1.1 riastrad if (!buf->dev_private) {
1071 1.1 riastrad /* Set count correctly so we free the proper amount. */
1072 1.1 riastrad entry->buf_count = count;
1073 1.1 riastrad drm_cleanup_buf_error(dev, entry);
1074 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1075 1.1 riastrad atomic_dec(&dev->buf_alloc);
1076 1.1 riastrad return -ENOMEM;
1077 1.1 riastrad }
1078 1.1 riastrad
1079 1.1 riastrad DRM_DEBUG("buffer %d @ %p\n", entry->buf_count, buf->address);
1080 1.1 riastrad
1081 1.1 riastrad offset += alignment;
1082 1.1 riastrad entry->buf_count++;
1083 1.1 riastrad byte_count += PAGE_SIZE << page_order;
1084 1.1 riastrad }
1085 1.1 riastrad
1086 1.1 riastrad DRM_DEBUG("byte_count: %d\n", byte_count);
1087 1.1 riastrad
1088 1.1 riastrad temp_buflist = krealloc(dma->buflist,
1089 1.1 riastrad (dma->buf_count + entry->buf_count) *
1090 1.1 riastrad sizeof(*dma->buflist), GFP_KERNEL);
1091 1.1 riastrad if (!temp_buflist) {
1092 1.1 riastrad /* Free the entry because it isn't valid */
1093 1.1 riastrad drm_cleanup_buf_error(dev, entry);
1094 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1095 1.1 riastrad atomic_dec(&dev->buf_alloc);
1096 1.1 riastrad return -ENOMEM;
1097 1.1 riastrad }
1098 1.1 riastrad dma->buflist = temp_buflist;
1099 1.1 riastrad
1100 1.1 riastrad for (i = 0; i < entry->buf_count; i++) {
1101 1.1 riastrad dma->buflist[i + dma->buf_count] = &entry->buflist[i];
1102 1.1 riastrad }
1103 1.1 riastrad
1104 1.1 riastrad dma->buf_count += entry->buf_count;
1105 1.1 riastrad dma->seg_count += entry->seg_count;
1106 1.1 riastrad dma->page_count += byte_count >> PAGE_SHIFT;
1107 1.1 riastrad dma->byte_count += byte_count;
1108 1.1 riastrad
1109 1.1 riastrad DRM_DEBUG("dma->buf_count : %d\n", dma->buf_count);
1110 1.1 riastrad DRM_DEBUG("entry->buf_count : %d\n", entry->buf_count);
1111 1.1 riastrad
1112 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1113 1.1 riastrad
1114 1.1 riastrad request->count = entry->buf_count;
1115 1.1 riastrad request->size = size;
1116 1.1 riastrad
1117 1.1 riastrad dma->flags = _DRM_DMA_USE_SG;
1118 1.1 riastrad
1119 1.1 riastrad atomic_dec(&dev->buf_alloc);
1120 1.1 riastrad return 0;
1121 1.1 riastrad }
1122 1.1 riastrad
1123 1.1 riastrad static int drm_addbufs_fb(struct drm_device * dev, struct drm_buf_desc * request)
1124 1.1 riastrad {
1125 1.1 riastrad struct drm_device_dma *dma = dev->dma;
1126 1.1 riastrad struct drm_buf_entry *entry;
1127 1.1 riastrad struct drm_buf *buf;
1128 1.1 riastrad unsigned long offset;
1129 1.1 riastrad unsigned long agp_offset;
1130 1.1 riastrad int count;
1131 1.1 riastrad int order;
1132 1.1 riastrad int size;
1133 1.1 riastrad int alignment;
1134 1.1 riastrad int page_order;
1135 1.1 riastrad int total;
1136 1.1 riastrad int byte_count;
1137 1.1 riastrad int i;
1138 1.1 riastrad struct drm_buf **temp_buflist;
1139 1.1 riastrad
1140 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_FB_DMA))
1141 1.1 riastrad return -EINVAL;
1142 1.1 riastrad
1143 1.1 riastrad if (!dma)
1144 1.1 riastrad return -EINVAL;
1145 1.1 riastrad
1146 1.1 riastrad if (!capable(CAP_SYS_ADMIN))
1147 1.1 riastrad return -EPERM;
1148 1.1 riastrad
1149 1.1 riastrad count = request->count;
1150 1.1 riastrad order = drm_order(request->size);
1151 1.1 riastrad size = 1 << order;
1152 1.1 riastrad
1153 1.1 riastrad alignment = (request->flags & _DRM_PAGE_ALIGN)
1154 1.1 riastrad ? PAGE_ALIGN(size) : size;
1155 1.1 riastrad page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
1156 1.1 riastrad total = PAGE_SIZE << page_order;
1157 1.1 riastrad
1158 1.1 riastrad byte_count = 0;
1159 1.1 riastrad agp_offset = request->agp_start;
1160 1.1 riastrad
1161 1.1 riastrad DRM_DEBUG("count: %d\n", count);
1162 1.1 riastrad DRM_DEBUG("order: %d\n", order);
1163 1.1 riastrad DRM_DEBUG("size: %d\n", size);
1164 1.1 riastrad DRM_DEBUG("agp_offset: %lu\n", agp_offset);
1165 1.1 riastrad DRM_DEBUG("alignment: %d\n", alignment);
1166 1.1 riastrad DRM_DEBUG("page_order: %d\n", page_order);
1167 1.1 riastrad DRM_DEBUG("total: %d\n", total);
1168 1.1 riastrad
1169 1.1 riastrad if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
1170 1.1 riastrad return -EINVAL;
1171 1.1 riastrad
1172 1.1 riastrad spin_lock(&dev->count_lock);
1173 1.1 riastrad if (dev->buf_use) {
1174 1.1 riastrad spin_unlock(&dev->count_lock);
1175 1.1 riastrad return -EBUSY;
1176 1.1 riastrad }
1177 1.1 riastrad atomic_inc(&dev->buf_alloc);
1178 1.1 riastrad spin_unlock(&dev->count_lock);
1179 1.1 riastrad
1180 1.1 riastrad mutex_lock(&dev->struct_mutex);
1181 1.1 riastrad entry = &dma->bufs[order];
1182 1.1 riastrad if (entry->buf_count) {
1183 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1184 1.1 riastrad atomic_dec(&dev->buf_alloc);
1185 1.1 riastrad return -ENOMEM; /* May only call once for each order */
1186 1.1 riastrad }
1187 1.1 riastrad
1188 1.1 riastrad if (count < 0 || count > 4096) {
1189 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1190 1.1 riastrad atomic_dec(&dev->buf_alloc);
1191 1.1 riastrad return -EINVAL;
1192 1.1 riastrad }
1193 1.1 riastrad
1194 1.1 riastrad entry->buflist = kzalloc(count * sizeof(*entry->buflist),
1195 1.1 riastrad GFP_KERNEL);
1196 1.1 riastrad if (!entry->buflist) {
1197 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1198 1.1 riastrad atomic_dec(&dev->buf_alloc);
1199 1.1 riastrad return -ENOMEM;
1200 1.1 riastrad }
1201 1.1 riastrad
1202 1.1 riastrad entry->buf_size = size;
1203 1.1 riastrad entry->page_order = page_order;
1204 1.1 riastrad
1205 1.1 riastrad offset = 0;
1206 1.1 riastrad
1207 1.1 riastrad while (entry->buf_count < count) {
1208 1.1 riastrad buf = &entry->buflist[entry->buf_count];
1209 1.1 riastrad buf->idx = dma->buf_count + entry->buf_count;
1210 1.1 riastrad buf->total = alignment;
1211 1.1 riastrad buf->order = order;
1212 1.1 riastrad buf->used = 0;
1213 1.1 riastrad
1214 1.1 riastrad buf->offset = (dma->byte_count + offset);
1215 1.1 riastrad buf->bus_address = agp_offset + offset;
1216 1.1 riastrad buf->address = (void *)(agp_offset + offset);
1217 1.1 riastrad buf->next = NULL;
1218 1.1 riastrad buf->waiting = 0;
1219 1.1 riastrad buf->pending = 0;
1220 1.1 riastrad buf->file_priv = NULL;
1221 1.1 riastrad
1222 1.1 riastrad buf->dev_priv_size = dev->driver->dev_priv_size;
1223 1.1 riastrad buf->dev_private = kzalloc(buf->dev_priv_size, GFP_KERNEL);
1224 1.1 riastrad if (!buf->dev_private) {
1225 1.1 riastrad /* Set count correctly so we free the proper amount. */
1226 1.1 riastrad entry->buf_count = count;
1227 1.1 riastrad drm_cleanup_buf_error(dev, entry);
1228 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1229 1.1 riastrad atomic_dec(&dev->buf_alloc);
1230 1.1 riastrad return -ENOMEM;
1231 1.1 riastrad }
1232 1.1 riastrad
1233 1.1 riastrad DRM_DEBUG("buffer %d @ %p\n", entry->buf_count, buf->address);
1234 1.1 riastrad
1235 1.1 riastrad offset += alignment;
1236 1.1 riastrad entry->buf_count++;
1237 1.1 riastrad byte_count += PAGE_SIZE << page_order;
1238 1.1 riastrad }
1239 1.1 riastrad
1240 1.1 riastrad DRM_DEBUG("byte_count: %d\n", byte_count);
1241 1.1 riastrad
1242 1.1 riastrad temp_buflist = krealloc(dma->buflist,
1243 1.1 riastrad (dma->buf_count + entry->buf_count) *
1244 1.1 riastrad sizeof(*dma->buflist), GFP_KERNEL);
1245 1.1 riastrad if (!temp_buflist) {
1246 1.1 riastrad /* Free the entry because it isn't valid */
1247 1.1 riastrad drm_cleanup_buf_error(dev, entry);
1248 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1249 1.1 riastrad atomic_dec(&dev->buf_alloc);
1250 1.1 riastrad return -ENOMEM;
1251 1.1 riastrad }
1252 1.1 riastrad dma->buflist = temp_buflist;
1253 1.1 riastrad
1254 1.1 riastrad for (i = 0; i < entry->buf_count; i++) {
1255 1.1 riastrad dma->buflist[i + dma->buf_count] = &entry->buflist[i];
1256 1.1 riastrad }
1257 1.1 riastrad
1258 1.1 riastrad dma->buf_count += entry->buf_count;
1259 1.1 riastrad dma->seg_count += entry->seg_count;
1260 1.1 riastrad dma->page_count += byte_count >> PAGE_SHIFT;
1261 1.1 riastrad dma->byte_count += byte_count;
1262 1.1 riastrad
1263 1.1 riastrad DRM_DEBUG("dma->buf_count : %d\n", dma->buf_count);
1264 1.1 riastrad DRM_DEBUG("entry->buf_count : %d\n", entry->buf_count);
1265 1.1 riastrad
1266 1.1 riastrad mutex_unlock(&dev->struct_mutex);
1267 1.1 riastrad
1268 1.1 riastrad request->count = entry->buf_count;
1269 1.1 riastrad request->size = size;
1270 1.1 riastrad
1271 1.1 riastrad dma->flags = _DRM_DMA_USE_FB;
1272 1.1 riastrad
1273 1.1 riastrad atomic_dec(&dev->buf_alloc);
1274 1.1 riastrad return 0;
1275 1.1 riastrad }
1276 1.1 riastrad
1277 1.1 riastrad
1278 1.1 riastrad /**
1279 1.1 riastrad * Add buffers for DMA transfers (ioctl).
1280 1.1 riastrad *
1281 1.1 riastrad * \param inode device inode.
1282 1.1 riastrad * \param file_priv DRM file private.
1283 1.1 riastrad * \param cmd command.
1284 1.1 riastrad * \param arg pointer to a struct drm_buf_desc request.
1285 1.1 riastrad * \return zero on success or a negative number on failure.
1286 1.1 riastrad *
1287 1.1 riastrad * According with the memory type specified in drm_buf_desc::flags and the
1288 1.1 riastrad * build options, it dispatches the call either to addbufs_agp(),
1289 1.1 riastrad * addbufs_sg() or addbufs_pci() for AGP, scatter-gather or consistent
1290 1.1 riastrad * PCI memory respectively.
1291 1.1 riastrad */
1292 1.1 riastrad int drm_addbufs(struct drm_device *dev, void *data,
1293 1.1 riastrad struct drm_file *file_priv)
1294 1.1 riastrad {
1295 1.1 riastrad struct drm_buf_desc *request = data;
1296 1.1 riastrad int ret;
1297 1.1 riastrad
1298 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
1299 1.1 riastrad return -EINVAL;
1300 1.1 riastrad
1301 1.1 riastrad #if __OS_HAS_AGP
1302 1.1 riastrad if (request->flags & _DRM_AGP_BUFFER)
1303 1.1 riastrad ret = drm_addbufs_agp(dev, request);
1304 1.1 riastrad else
1305 1.1 riastrad #endif
1306 1.1 riastrad if (request->flags & _DRM_SG_BUFFER)
1307 1.1 riastrad ret = drm_addbufs_sg(dev, request);
1308 1.1 riastrad else if (request->flags & _DRM_FB_BUFFER)
1309 1.1 riastrad ret = drm_addbufs_fb(dev, request);
1310 1.1 riastrad else
1311 1.1 riastrad ret = drm_addbufs_pci(dev, request);
1312 1.1 riastrad
1313 1.1 riastrad return ret;
1314 1.1 riastrad }
1315 1.1 riastrad
1316 1.1 riastrad /**
1317 1.1 riastrad * Get information about the buffer mappings.
1318 1.1 riastrad *
1319 1.1 riastrad * This was originally mean for debugging purposes, or by a sophisticated
1320 1.1 riastrad * client library to determine how best to use the available buffers (e.g.,
1321 1.1 riastrad * large buffers can be used for image transfer).
1322 1.1 riastrad *
1323 1.1 riastrad * \param inode device inode.
1324 1.1 riastrad * \param file_priv DRM file private.
1325 1.1 riastrad * \param cmd command.
1326 1.1 riastrad * \param arg pointer to a drm_buf_info structure.
1327 1.1 riastrad * \return zero on success or a negative number on failure.
1328 1.1 riastrad *
1329 1.1 riastrad * Increments drm_device::buf_use while holding the drm_device::count_lock
1330 1.1 riastrad * lock, preventing of allocating more buffers after this call. Information
1331 1.1 riastrad * about each requested buffer is then copied into user space.
1332 1.1 riastrad */
1333 1.1 riastrad int drm_infobufs(struct drm_device *dev, void *data,
1334 1.1 riastrad struct drm_file *file_priv)
1335 1.1 riastrad {
1336 1.1 riastrad struct drm_device_dma *dma = dev->dma;
1337 1.1 riastrad struct drm_buf_info *request = data;
1338 1.1 riastrad int i;
1339 1.1 riastrad int count;
1340 1.1 riastrad
1341 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
1342 1.1 riastrad return -EINVAL;
1343 1.1 riastrad
1344 1.1 riastrad if (!dma)
1345 1.1 riastrad return -EINVAL;
1346 1.1 riastrad
1347 1.1 riastrad spin_lock(&dev->count_lock);
1348 1.1 riastrad if (atomic_read(&dev->buf_alloc)) {
1349 1.1 riastrad spin_unlock(&dev->count_lock);
1350 1.1 riastrad return -EBUSY;
1351 1.1 riastrad }
1352 1.1 riastrad ++dev->buf_use; /* Can't allocate more after this call */
1353 1.1 riastrad spin_unlock(&dev->count_lock);
1354 1.1 riastrad
1355 1.1 riastrad for (i = 0, count = 0; i < DRM_MAX_ORDER + 1; i++) {
1356 1.1 riastrad if (dma->bufs[i].buf_count)
1357 1.1 riastrad ++count;
1358 1.1 riastrad }
1359 1.1 riastrad
1360 1.1 riastrad DRM_DEBUG("count = %d\n", count);
1361 1.1 riastrad
1362 1.1 riastrad if (request->count >= count) {
1363 1.1 riastrad for (i = 0, count = 0; i < DRM_MAX_ORDER + 1; i++) {
1364 1.1 riastrad if (dma->bufs[i].buf_count) {
1365 1.1 riastrad struct drm_buf_desc __user *to =
1366 1.1 riastrad &request->list[count];
1367 1.1 riastrad struct drm_buf_entry *from = &dma->bufs[i];
1368 1.1 riastrad struct drm_freelist *list = &dma->bufs[i].freelist;
1369 1.1 riastrad if (copy_to_user(&to->count,
1370 1.1 riastrad &from->buf_count,
1371 1.1 riastrad sizeof(from->buf_count)) ||
1372 1.1 riastrad copy_to_user(&to->size,
1373 1.1 riastrad &from->buf_size,
1374 1.1 riastrad sizeof(from->buf_size)) ||
1375 1.1 riastrad copy_to_user(&to->low_mark,
1376 1.1 riastrad &list->low_mark,
1377 1.1 riastrad sizeof(list->low_mark)) ||
1378 1.1 riastrad copy_to_user(&to->high_mark,
1379 1.1 riastrad &list->high_mark,
1380 1.1 riastrad sizeof(list->high_mark)))
1381 1.1 riastrad return -EFAULT;
1382 1.1 riastrad
1383 1.1 riastrad DRM_DEBUG("%d %d %d %d %d\n",
1384 1.1 riastrad i,
1385 1.1 riastrad dma->bufs[i].buf_count,
1386 1.1 riastrad dma->bufs[i].buf_size,
1387 1.1 riastrad dma->bufs[i].freelist.low_mark,
1388 1.1 riastrad dma->bufs[i].freelist.high_mark);
1389 1.1 riastrad ++count;
1390 1.1 riastrad }
1391 1.1 riastrad }
1392 1.1 riastrad }
1393 1.1 riastrad request->count = count;
1394 1.1 riastrad
1395 1.1 riastrad return 0;
1396 1.1 riastrad }
1397 1.1 riastrad
1398 1.1 riastrad /**
1399 1.1 riastrad * Specifies a low and high water mark for buffer allocation
1400 1.1 riastrad *
1401 1.1 riastrad * \param inode device inode.
1402 1.1 riastrad * \param file_priv DRM file private.
1403 1.1 riastrad * \param cmd command.
1404 1.1 riastrad * \param arg a pointer to a drm_buf_desc structure.
1405 1.1 riastrad * \return zero on success or a negative number on failure.
1406 1.1 riastrad *
1407 1.1 riastrad * Verifies that the size order is bounded between the admissible orders and
1408 1.1 riastrad * updates the respective drm_device_dma::bufs entry low and high water mark.
1409 1.1 riastrad *
1410 1.1 riastrad * \note This ioctl is deprecated and mostly never used.
1411 1.1 riastrad */
1412 1.1 riastrad int drm_markbufs(struct drm_device *dev, void *data,
1413 1.1 riastrad struct drm_file *file_priv)
1414 1.1 riastrad {
1415 1.1 riastrad struct drm_device_dma *dma = dev->dma;
1416 1.1 riastrad struct drm_buf_desc *request = data;
1417 1.1 riastrad int order;
1418 1.1 riastrad struct drm_buf_entry *entry;
1419 1.1 riastrad
1420 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
1421 1.1 riastrad return -EINVAL;
1422 1.1 riastrad
1423 1.1 riastrad if (!dma)
1424 1.1 riastrad return -EINVAL;
1425 1.1 riastrad
1426 1.1 riastrad DRM_DEBUG("%d, %d, %d\n",
1427 1.1 riastrad request->size, request->low_mark, request->high_mark);
1428 1.1 riastrad order = drm_order(request->size);
1429 1.1 riastrad if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
1430 1.1 riastrad return -EINVAL;
1431 1.1 riastrad entry = &dma->bufs[order];
1432 1.1 riastrad
1433 1.1 riastrad if (request->low_mark < 0 || request->low_mark > entry->buf_count)
1434 1.1 riastrad return -EINVAL;
1435 1.1 riastrad if (request->high_mark < 0 || request->high_mark > entry->buf_count)
1436 1.1 riastrad return -EINVAL;
1437 1.1 riastrad
1438 1.1 riastrad entry->freelist.low_mark = request->low_mark;
1439 1.1 riastrad entry->freelist.high_mark = request->high_mark;
1440 1.1 riastrad
1441 1.1 riastrad return 0;
1442 1.1 riastrad }
1443 1.1 riastrad
1444 1.1 riastrad /**
1445 1.1 riastrad * Unreserve the buffers in list, previously reserved using drmDMA.
1446 1.1 riastrad *
1447 1.1 riastrad * \param inode device inode.
1448 1.1 riastrad * \param file_priv DRM file private.
1449 1.1 riastrad * \param cmd command.
1450 1.1 riastrad * \param arg pointer to a drm_buf_free structure.
1451 1.1 riastrad * \return zero on success or a negative number on failure.
1452 1.1 riastrad *
1453 1.1 riastrad * Calls free_buffer() for each used buffer.
1454 1.1 riastrad * This function is primarily used for debugging.
1455 1.1 riastrad */
1456 1.1 riastrad int drm_freebufs(struct drm_device *dev, void *data,
1457 1.1 riastrad struct drm_file *file_priv)
1458 1.1 riastrad {
1459 1.1 riastrad struct drm_device_dma *dma = dev->dma;
1460 1.1 riastrad struct drm_buf_free *request = data;
1461 1.1 riastrad int i;
1462 1.1 riastrad int idx;
1463 1.1 riastrad struct drm_buf *buf;
1464 1.1 riastrad
1465 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
1466 1.1 riastrad return -EINVAL;
1467 1.1 riastrad
1468 1.1 riastrad if (!dma)
1469 1.1 riastrad return -EINVAL;
1470 1.1 riastrad
1471 1.1 riastrad DRM_DEBUG("%d\n", request->count);
1472 1.1 riastrad for (i = 0; i < request->count; i++) {
1473 1.1 riastrad if (copy_from_user(&idx, &request->list[i], sizeof(idx)))
1474 1.1 riastrad return -EFAULT;
1475 1.1 riastrad if (idx < 0 || idx >= dma->buf_count) {
1476 1.1 riastrad DRM_ERROR("Index %d (of %d max)\n",
1477 1.1 riastrad idx, dma->buf_count - 1);
1478 1.1 riastrad return -EINVAL;
1479 1.1 riastrad }
1480 1.1 riastrad buf = dma->buflist[idx];
1481 1.1 riastrad if (buf->file_priv != file_priv) {
1482 1.1 riastrad DRM_ERROR("Process %d freeing buffer not owned\n",
1483 1.1 riastrad task_pid_nr(current));
1484 1.1 riastrad return -EINVAL;
1485 1.1 riastrad }
1486 1.1 riastrad drm_free_buffer(dev, buf);
1487 1.1 riastrad }
1488 1.1 riastrad
1489 1.1 riastrad return 0;
1490 1.1 riastrad }
1491 1.1 riastrad
1492 1.1 riastrad /**
1493 1.1 riastrad * Maps all of the DMA buffers into client-virtual space (ioctl).
1494 1.1 riastrad *
1495 1.1 riastrad * \param inode device inode.
1496 1.1 riastrad * \param file_priv DRM file private.
1497 1.1 riastrad * \param cmd command.
1498 1.1 riastrad * \param arg pointer to a drm_buf_map structure.
1499 1.1 riastrad * \return zero on success or a negative number on failure.
1500 1.1 riastrad *
1501 1.1 riastrad * Maps the AGP, SG or PCI buffer region with vm_mmap(), and copies information
1502 1.1 riastrad * about each buffer into user space. For PCI buffers, it calls vm_mmap() with
1503 1.1 riastrad * offset equal to 0, which drm_mmap() interpretes as PCI buffers and calls
1504 1.1 riastrad * drm_mmap_dma().
1505 1.1 riastrad */
1506 1.1 riastrad int drm_mapbufs(struct drm_device *dev, void *data,
1507 1.1 riastrad struct drm_file *file_priv)
1508 1.1 riastrad {
1509 1.1 riastrad struct drm_device_dma *dma = dev->dma;
1510 1.1 riastrad int retcode = 0;
1511 1.1 riastrad const int zero = 0;
1512 1.1 riastrad unsigned long virtual;
1513 1.1 riastrad unsigned long address;
1514 1.1 riastrad struct drm_buf_map *request = data;
1515 1.1 riastrad int i;
1516 1.1 riastrad
1517 1.1 riastrad if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
1518 1.1 riastrad return -EINVAL;
1519 1.1 riastrad
1520 1.1 riastrad if (!dma)
1521 1.1 riastrad return -EINVAL;
1522 1.1 riastrad
1523 1.1 riastrad spin_lock(&dev->count_lock);
1524 1.1 riastrad if (atomic_read(&dev->buf_alloc)) {
1525 1.1 riastrad spin_unlock(&dev->count_lock);
1526 1.1 riastrad return -EBUSY;
1527 1.1 riastrad }
1528 1.1 riastrad dev->buf_use++; /* Can't allocate more after this call */
1529 1.1 riastrad spin_unlock(&dev->count_lock);
1530 1.1 riastrad
1531 1.1 riastrad if (request->count >= dma->buf_count) {
1532 1.1 riastrad if ((drm_core_has_AGP(dev) && (dma->flags & _DRM_DMA_USE_AGP))
1533 1.1 riastrad || (drm_core_check_feature(dev, DRIVER_SG)
1534 1.1 riastrad && (dma->flags & _DRM_DMA_USE_SG))
1535 1.1 riastrad || (drm_core_check_feature(dev, DRIVER_FB_DMA)
1536 1.1 riastrad && (dma->flags & _DRM_DMA_USE_FB))) {
1537 1.1 riastrad struct drm_local_map *map = dev->agp_buffer_map;
1538 1.1 riastrad unsigned long token = dev->agp_buffer_token;
1539 1.1 riastrad
1540 1.1 riastrad if (!map) {
1541 1.1 riastrad retcode = -EINVAL;
1542 1.1 riastrad goto done;
1543 1.1 riastrad }
1544 1.1 riastrad virtual = vm_mmap(file_priv->filp, 0, map->size,
1545 1.1 riastrad PROT_READ | PROT_WRITE,
1546 1.1 riastrad MAP_SHARED,
1547 1.1 riastrad token);
1548 1.1 riastrad } else {
1549 1.1 riastrad virtual = vm_mmap(file_priv->filp, 0, dma->byte_count,
1550 1.1 riastrad PROT_READ | PROT_WRITE,
1551 1.1 riastrad MAP_SHARED, 0);
1552 1.1 riastrad }
1553 1.1 riastrad if (virtual > -1024UL) {
1554 1.1 riastrad /* Real error */
1555 1.1 riastrad retcode = (signed long)virtual;
1556 1.1 riastrad goto done;
1557 1.1 riastrad }
1558 1.1 riastrad request->virtual = (void __user *)virtual;
1559 1.1 riastrad
1560 1.1 riastrad for (i = 0; i < dma->buf_count; i++) {
1561 1.1 riastrad if (copy_to_user(&request->list[i].idx,
1562 1.1 riastrad &dma->buflist[i]->idx,
1563 1.1 riastrad sizeof(request->list[0].idx))) {
1564 1.1 riastrad retcode = -EFAULT;
1565 1.1 riastrad goto done;
1566 1.1 riastrad }
1567 1.1 riastrad if (copy_to_user(&request->list[i].total,
1568 1.1 riastrad &dma->buflist[i]->total,
1569 1.1 riastrad sizeof(request->list[0].total))) {
1570 1.1 riastrad retcode = -EFAULT;
1571 1.1 riastrad goto done;
1572 1.1 riastrad }
1573 1.1 riastrad if (copy_to_user(&request->list[i].used,
1574 1.1 riastrad &zero, sizeof(zero))) {
1575 1.1 riastrad retcode = -EFAULT;
1576 1.1 riastrad goto done;
1577 1.1 riastrad }
1578 1.1 riastrad address = virtual + dma->buflist[i]->offset; /* *** */
1579 1.1 riastrad if (copy_to_user(&request->list[i].address,
1580 1.1 riastrad &address, sizeof(address))) {
1581 1.1 riastrad retcode = -EFAULT;
1582 1.1 riastrad goto done;
1583 1.1 riastrad }
1584 1.1 riastrad }
1585 1.1 riastrad }
1586 1.1 riastrad done:
1587 1.1 riastrad request->count = dma->buf_count;
1588 1.1 riastrad DRM_DEBUG("%d buffers, retcode = %d\n", request->count, retcode);
1589 1.1 riastrad
1590 1.1 riastrad return retcode;
1591 1.1 riastrad }
1592 1.1 riastrad
1593 1.1 riastrad /**
1594 1.1 riastrad * Compute size order. Returns the exponent of the smaller power of two which
1595 1.1 riastrad * is greater or equal to given number.
1596 1.1 riastrad *
1597 1.1 riastrad * \param size size.
1598 1.1 riastrad * \return order.
1599 1.1 riastrad *
1600 1.1 riastrad * \todo Can be made faster.
1601 1.1 riastrad */
1602 1.1 riastrad int drm_order(unsigned long size)
1603 1.1 riastrad {
1604 1.1 riastrad int order;
1605 1.1 riastrad unsigned long tmp;
1606 1.1 riastrad
1607 1.1 riastrad for (order = 0, tmp = size >> 1; tmp; tmp >>= 1, order++) ;
1608 1.1 riastrad
1609 1.1 riastrad if (size & (size - 1))
1610 1.1 riastrad ++order;
1611 1.1 riastrad
1612 1.1 riastrad return order;
1613 1.1 riastrad }
1614 1.1 riastrad EXPORT_SYMBOL(drm_order);
1615