projects / deliverable / linux.git / blob
? search:


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