drm_bufs.c 41 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561
  1. /**
  2. * \file drm_bufs.h
  3. * Generic buffer template
  4. *
  5. * \author Rickard E. (Rik) Faith <faith@valinux.com>
  6. * \author Gareth Hughes <gareth@valinux.com>
  7. */
  8. /*
  9. * Created: Thu Nov 23 03:10:50 2000 by gareth@valinux.com
  10. *
  11. * Copyright 1999, 2000 Precision Insight, Inc., Cedar Park, Texas.
  12. * Copyright 2000 VA Linux Systems, Inc., Sunnyvale, California.
  13. * All Rights Reserved.
  14. *
  15. * Permission is hereby granted, free of charge, to any person obtaining a
  16. * copy of this software and associated documentation files (the "Software"),
  17. * to deal in the Software without restriction, including without limitation
  18. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  19. * and/or sell copies of the Software, and to permit persons to whom the
  20. * Software is furnished to do so, subject to the following conditions:
  21. *
  22. * The above copyright notice and this permission notice (including the next
  23. * paragraph) shall be included in all copies or substantial portions of the
  24. * Software.
  25. *
  26. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  27. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  28. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  29. * VA LINUX SYSTEMS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
  30. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  31. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  32. * OTHER DEALINGS IN THE SOFTWARE.
  33. */
  34. #include <linux/vmalloc.h>
  35. #include "drmP.h"
  36. unsigned long drm_get_resource_start(drm_device_t *dev, unsigned int resource)
  37. {
  38. return pci_resource_start(dev->pdev, resource);
  39. }
  40. EXPORT_SYMBOL(drm_get_resource_start);
  41. unsigned long drm_get_resource_len(drm_device_t *dev, unsigned int resource)
  42. {
  43. return pci_resource_len(dev->pdev, resource);
  44. }
  45. EXPORT_SYMBOL(drm_get_resource_len);
  46. static drm_local_map_t *drm_find_matching_map(drm_device_t *dev,
  47. drm_local_map_t *map)
  48. {
  49. struct list_head *list;
  50. list_for_each(list, &dev->maplist->head) {
  51. drm_map_list_t *entry = list_entry(list, drm_map_list_t, head);
  52. if (entry->map && map->type == entry->map->type &&
  53. entry->map->offset == map->offset) {
  54. return entry->map;
  55. }
  56. }
  57. return NULL;
  58. }
  59. #ifdef CONFIG_COMPAT
  60. /*
  61. * Used to allocate 32-bit handles for _DRM_SHM regions
  62. * The 0x10000000 value is chosen to be out of the way of
  63. * FB/register and GART physical addresses.
  64. */
  65. static unsigned int map32_handle = 0x10000000;
  66. #endif
  67. /**
  68. * Ioctl to specify a range of memory that is available for mapping by a non-root process.
  69. *
  70. * \param inode device inode.
  71. * \param filp file pointer.
  72. * \param cmd command.
  73. * \param arg pointer to a drm_map structure.
  74. * \return zero on success or a negative value on error.
  75. *
  76. * Adjusts the memory offset to its absolute value according to the mapping
  77. * type. Adds the map to the map list drm_device::maplist. Adds MTRR's where
  78. * applicable and if supported by the kernel.
  79. */
  80. int drm_addmap(drm_device_t * dev, unsigned int offset,
  81. unsigned int size, drm_map_type_t type,
  82. drm_map_flags_t flags, drm_local_map_t ** map_ptr)
  83. {
  84. drm_map_t *map;
  85. drm_map_list_t *list;
  86. drm_dma_handle_t *dmah;
  87. drm_local_map_t *found_map;
  88. map = drm_alloc( sizeof(*map), DRM_MEM_MAPS );
  89. if ( !map )
  90. return -ENOMEM;
  91. map->offset = offset;
  92. map->size = size;
  93. map->flags = flags;
  94. map->type = type;
  95. /* Only allow shared memory to be removable since we only keep enough
  96. * book keeping information about shared memory to allow for removal
  97. * when processes fork.
  98. */
  99. if ( (map->flags & _DRM_REMOVABLE) && map->type != _DRM_SHM ) {
  100. drm_free( map, sizeof(*map), DRM_MEM_MAPS );
  101. return -EINVAL;
  102. }
  103. DRM_DEBUG( "offset = 0x%08lx, size = 0x%08lx, type = %d\n",
  104. map->offset, map->size, map->type );
  105. if ( (map->offset & (~PAGE_MASK)) || (map->size & (~PAGE_MASK)) ) {
  106. drm_free( map, sizeof(*map), DRM_MEM_MAPS );
  107. return -EINVAL;
  108. }
  109. map->mtrr = -1;
  110. map->handle = NULL;
  111. switch ( map->type ) {
  112. case _DRM_REGISTERS:
  113. case _DRM_FRAME_BUFFER:
  114. #if !defined(__sparc__) && !defined(__alpha__) && !defined(__ia64__)
  115. if ( map->offset + map->size < map->offset ||
  116. map->offset < virt_to_phys(high_memory) ) {
  117. drm_free( map, sizeof(*map), DRM_MEM_MAPS );
  118. return -EINVAL;
  119. }
  120. #endif
  121. #ifdef __alpha__
  122. map->offset += dev->hose->mem_space->start;
  123. #endif
  124. /* Some drivers preinitialize some maps, without the X Server
  125. * needing to be aware of it. Therefore, we just return success
  126. * when the server tries to create a duplicate map.
  127. */
  128. found_map = drm_find_matching_map(dev, map);
  129. if (found_map != NULL) {
  130. if (found_map->size != map->size) {
  131. DRM_DEBUG("Matching maps of type %d with "
  132. "mismatched sizes, (%ld vs %ld)\n",
  133. map->type, map->size, found_map->size);
  134. found_map->size = map->size;
  135. }
  136. drm_free(map, sizeof(*map), DRM_MEM_MAPS);
  137. *map_ptr = found_map;
  138. return 0;
  139. }
  140. if (drm_core_has_MTRR(dev)) {
  141. if ( map->type == _DRM_FRAME_BUFFER ||
  142. (map->flags & _DRM_WRITE_COMBINING) ) {
  143. map->mtrr = mtrr_add( map->offset, map->size,
  144. MTRR_TYPE_WRCOMB, 1 );
  145. }
  146. }
  147. if (map->type == _DRM_REGISTERS)
  148. map->handle = drm_ioremap( map->offset, map->size,
  149. dev );
  150. break;
  151. case _DRM_SHM:
  152. map->handle = vmalloc_32(map->size);
  153. DRM_DEBUG( "%lu %d %p\n",
  154. map->size, drm_order( map->size ), map->handle );
  155. if ( !map->handle ) {
  156. drm_free( map, sizeof(*map), DRM_MEM_MAPS );
  157. return -ENOMEM;
  158. }
  159. map->offset = (unsigned long)map->handle;
  160. if ( map->flags & _DRM_CONTAINS_LOCK ) {
  161. /* Prevent a 2nd X Server from creating a 2nd lock */
  162. if (dev->lock.hw_lock != NULL) {
  163. vfree( map->handle );
  164. drm_free( map, sizeof(*map), DRM_MEM_MAPS );
  165. return -EBUSY;
  166. }
  167. dev->sigdata.lock =
  168. dev->lock.hw_lock = map->handle; /* Pointer to lock */
  169. }
  170. break;
  171. case _DRM_AGP:
  172. if (drm_core_has_AGP(dev)) {
  173. #ifdef __alpha__
  174. map->offset += dev->hose->mem_space->start;
  175. #endif
  176. map->offset += dev->agp->base;
  177. map->mtrr = dev->agp->agp_mtrr; /* for getmap */
  178. }
  179. break;
  180. case _DRM_SCATTER_GATHER:
  181. if (!dev->sg) {
  182. drm_free(map, sizeof(*map), DRM_MEM_MAPS);
  183. return -EINVAL;
  184. }
  185. map->offset += dev->sg->handle;
  186. break;
  187. case _DRM_CONSISTENT:
  188. /* dma_addr_t is 64bit on i386 with CONFIG_HIGHMEM64G,
  189. * As we're limiting the address to 2^32-1 (or less),
  190. * casting it down to 32 bits is no problem, but we
  191. * need to point to a 64bit variable first. */
  192. dmah = drm_pci_alloc(dev, map->size, map->size, 0xffffffffUL);
  193. if (!dmah) {
  194. drm_free(map, sizeof(*map), DRM_MEM_MAPS);
  195. return -ENOMEM;
  196. }
  197. map->handle = dmah->vaddr;
  198. map->offset = (unsigned long)dmah->busaddr;
  199. kfree(dmah);
  200. break;
  201. default:
  202. drm_free( map, sizeof(*map), DRM_MEM_MAPS );
  203. return -EINVAL;
  204. }
  205. list = drm_alloc(sizeof(*list), DRM_MEM_MAPS);
  206. if(!list) {
  207. drm_free(map, sizeof(*map), DRM_MEM_MAPS);
  208. return -EINVAL;
  209. }
  210. memset(list, 0, sizeof(*list));
  211. list->map = map;
  212. down(&dev->struct_sem);
  213. list_add(&list->head, &dev->maplist->head);
  214. #ifdef CONFIG_COMPAT
  215. /* Assign a 32-bit handle for _DRM_SHM mappings */
  216. /* We do it here so that dev->struct_sem protects the increment */
  217. if (map->type == _DRM_SHM)
  218. map->offset = map32_handle += PAGE_SIZE;
  219. #endif
  220. up(&dev->struct_sem);
  221. *map_ptr = map;
  222. return 0;
  223. }
  224. EXPORT_SYMBOL(drm_addmap);
  225. int drm_addmap_ioctl(struct inode *inode, struct file *filp,
  226. unsigned int cmd, unsigned long arg)
  227. {
  228. drm_file_t *priv = filp->private_data;
  229. drm_device_t *dev = priv->head->dev;
  230. drm_map_t map;
  231. drm_map_t *map_ptr;
  232. drm_map_t __user *argp = (void __user *)arg;
  233. int err;
  234. if (!(filp->f_mode & 3))
  235. return -EACCES; /* Require read/write */
  236. if (copy_from_user(& map, argp, sizeof(map))) {
  237. return -EFAULT;
  238. }
  239. err = drm_addmap( dev, map.offset, map.size, map.type, map.flags,
  240. &map_ptr );
  241. if (err) {
  242. return err;
  243. }
  244. if (copy_to_user(argp, map_ptr, sizeof(*map_ptr)))
  245. return -EFAULT;
  246. if (map_ptr->type != _DRM_SHM) {
  247. if (copy_to_user(&argp->handle, &map_ptr->offset,
  248. sizeof(map_ptr->offset)))
  249. return -EFAULT;
  250. }
  251. return 0;
  252. }
  253. /**
  254. * Remove a map private from list and deallocate resources if the mapping
  255. * isn't in use.
  256. *
  257. * \param inode device inode.
  258. * \param filp file pointer.
  259. * \param cmd command.
  260. * \param arg pointer to a drm_map_t structure.
  261. * \return zero on success or a negative value on error.
  262. *
  263. * Searches the map on drm_device::maplist, removes it from the list, see if
  264. * its being used, and free any associate resource (such as MTRR's) if it's not
  265. * being on use.
  266. *
  267. * \sa drm_addmap
  268. */
  269. int drm_rmmap_locked(drm_device_t *dev, drm_local_map_t *map)
  270. {
  271. struct list_head *list;
  272. drm_map_list_t *r_list = NULL;
  273. drm_dma_handle_t dmah;
  274. /* Find the list entry for the map and remove it */
  275. list_for_each(list, &dev->maplist->head) {
  276. r_list = list_entry(list, drm_map_list_t, head);
  277. if (r_list->map == map) {
  278. list_del(list);
  279. drm_free(list, sizeof(*list), DRM_MEM_MAPS);
  280. break;
  281. }
  282. }
  283. /* List has wrapped around to the head pointer, or it's empty and we
  284. * didn't find anything.
  285. */
  286. if (list == (&dev->maplist->head)) {
  287. return -EINVAL;
  288. }
  289. switch (map->type) {
  290. case _DRM_REGISTERS:
  291. drm_ioremapfree(map->handle, map->size, dev);
  292. /* FALLTHROUGH */
  293. case _DRM_FRAME_BUFFER:
  294. if (drm_core_has_MTRR(dev) && map->mtrr >= 0) {
  295. int retcode;
  296. retcode = mtrr_del(map->mtrr, map->offset,
  297. map->size);
  298. DRM_DEBUG ("mtrr_del=%d\n", retcode);
  299. }
  300. break;
  301. case _DRM_SHM:
  302. vfree(map->handle);
  303. break;
  304. case _DRM_AGP:
  305. case _DRM_SCATTER_GATHER:
  306. break;
  307. case _DRM_CONSISTENT:
  308. dmah.vaddr = map->handle;
  309. dmah.busaddr = map->offset;
  310. dmah.size = map->size;
  311. __drm_pci_free(dev, &dmah);
  312. break;
  313. }
  314. drm_free(map, sizeof(*map), DRM_MEM_MAPS);
  315. return 0;
  316. }
  317. EXPORT_SYMBOL(drm_rmmap_locked);
  318. int drm_rmmap(drm_device_t *dev, drm_local_map_t *map)
  319. {
  320. int ret;
  321. down(&dev->struct_sem);
  322. ret = drm_rmmap_locked(dev, map);
  323. up(&dev->struct_sem);
  324. return ret;
  325. }
  326. EXPORT_SYMBOL(drm_rmmap);
  327. /* The rmmap ioctl appears to be unnecessary. All mappings are torn down on
  328. * the last close of the device, and this is necessary for cleanup when things
  329. * exit uncleanly. Therefore, having userland manually remove mappings seems
  330. * like a pointless exercise since they're going away anyway.
  331. *
  332. * One use case might be after addmap is allowed for normal users for SHM and
  333. * gets used by drivers that the server doesn't need to care about. This seems
  334. * unlikely.
  335. */
  336. int drm_rmmap_ioctl(struct inode *inode, struct file *filp,
  337. unsigned int cmd, unsigned long arg)
  338. {
  339. drm_file_t *priv = filp->private_data;
  340. drm_device_t *dev = priv->head->dev;
  341. drm_map_t request;
  342. drm_local_map_t *map = NULL;
  343. struct list_head *list;
  344. int ret;
  345. if (copy_from_user(&request, (drm_map_t __user *)arg, sizeof(request))) {
  346. return -EFAULT;
  347. }
  348. down(&dev->struct_sem);
  349. list_for_each(list, &dev->maplist->head) {
  350. drm_map_list_t *r_list = list_entry(list, drm_map_list_t, head);
  351. if (r_list->map &&
  352. r_list->map->handle == request.handle &&
  353. r_list->map->flags & _DRM_REMOVABLE) {
  354. map = r_list->map;
  355. break;
  356. }
  357. }
  358. /* List has wrapped around to the head pointer, or its empty we didn't
  359. * find anything.
  360. */
  361. if (list == (&dev->maplist->head)) {
  362. up(&dev->struct_sem);
  363. return -EINVAL;
  364. }
  365. if (!map)
  366. return -EINVAL;
  367. /* Register and framebuffer maps are permanent */
  368. if ((map->type == _DRM_REGISTERS) || (map->type == _DRM_FRAME_BUFFER)) {
  369. up(&dev->struct_sem);
  370. return 0;
  371. }
  372. ret = drm_rmmap_locked(dev, map);
  373. up(&dev->struct_sem);
  374. return ret;
  375. }
  376. /**
  377. * Cleanup after an error on one of the addbufs() functions.
  378. *
  379. * \param dev DRM device.
  380. * \param entry buffer entry where the error occurred.
  381. *
  382. * Frees any pages and buffers associated with the given entry.
  383. */
  384. static void drm_cleanup_buf_error(drm_device_t *dev, drm_buf_entry_t *entry)
  385. {
  386. int i;
  387. if (entry->seg_count) {
  388. for (i = 0; i < entry->seg_count; i++) {
  389. if (entry->seglist[i]) {
  390. drm_free_pages(entry->seglist[i],
  391. entry->page_order,
  392. DRM_MEM_DMA);
  393. }
  394. }
  395. drm_free(entry->seglist,
  396. entry->seg_count *
  397. sizeof(*entry->seglist),
  398. DRM_MEM_SEGS);
  399. entry->seg_count = 0;
  400. }
  401. if (entry->buf_count) {
  402. for (i = 0; i < entry->buf_count; i++) {
  403. if (entry->buflist[i].dev_private) {
  404. drm_free(entry->buflist[i].dev_private,
  405. entry->buflist[i].dev_priv_size,
  406. DRM_MEM_BUFS);
  407. }
  408. }
  409. drm_free(entry->buflist,
  410. entry->buf_count *
  411. sizeof(*entry->buflist),
  412. DRM_MEM_BUFS);
  413. entry->buf_count = 0;
  414. }
  415. }
  416. #if __OS_HAS_AGP
  417. /**
  418. * Add AGP buffers for DMA transfers.
  419. *
  420. * \param dev drm_device_t to which the buffers are to be added.
  421. * \param request pointer to a drm_buf_desc_t describing the request.
  422. * \return zero on success or a negative number on failure.
  423. *
  424. * After some sanity checks creates a drm_buf structure for each buffer and
  425. * reallocates the buffer list of the same size order to accommodate the new
  426. * buffers.
  427. */
  428. int drm_addbufs_agp(drm_device_t *dev, drm_buf_desc_t *request)
  429. {
  430. drm_device_dma_t *dma = dev->dma;
  431. drm_buf_entry_t *entry;
  432. drm_buf_t *buf;
  433. unsigned long offset;
  434. unsigned long agp_offset;
  435. int count;
  436. int order;
  437. int size;
  438. int alignment;
  439. int page_order;
  440. int total;
  441. int byte_count;
  442. int i;
  443. drm_buf_t **temp_buflist;
  444. if ( !dma ) return -EINVAL;
  445. count = request->count;
  446. order = drm_order(request->size);
  447. size = 1 << order;
  448. alignment = (request->flags & _DRM_PAGE_ALIGN)
  449. ? PAGE_ALIGN(size) : size;
  450. page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
  451. total = PAGE_SIZE << page_order;
  452. byte_count = 0;
  453. agp_offset = dev->agp->base + request->agp_start;
  454. DRM_DEBUG( "count: %d\n", count );
  455. DRM_DEBUG( "order: %d\n", order );
  456. DRM_DEBUG( "size: %d\n", size );
  457. DRM_DEBUG( "agp_offset: %lu\n", agp_offset );
  458. DRM_DEBUG( "alignment: %d\n", alignment );
  459. DRM_DEBUG( "page_order: %d\n", page_order );
  460. DRM_DEBUG( "total: %d\n", total );
  461. if ( order < DRM_MIN_ORDER || order > DRM_MAX_ORDER ) return -EINVAL;
  462. if ( dev->queue_count ) return -EBUSY; /* Not while in use */
  463. spin_lock( &dev->count_lock );
  464. if ( dev->buf_use ) {
  465. spin_unlock( &dev->count_lock );
  466. return -EBUSY;
  467. }
  468. atomic_inc( &dev->buf_alloc );
  469. spin_unlock( &dev->count_lock );
  470. down( &dev->struct_sem );
  471. entry = &dma->bufs[order];
  472. if ( entry->buf_count ) {
  473. up( &dev->struct_sem );
  474. atomic_dec( &dev->buf_alloc );
  475. return -ENOMEM; /* May only call once for each order */
  476. }
  477. if (count < 0 || count > 4096) {
  478. up( &dev->struct_sem );
  479. atomic_dec( &dev->buf_alloc );
  480. return -EINVAL;
  481. }
  482. entry->buflist = drm_alloc( count * sizeof(*entry->buflist),
  483. DRM_MEM_BUFS );
  484. if ( !entry->buflist ) {
  485. up( &dev->struct_sem );
  486. atomic_dec( &dev->buf_alloc );
  487. return -ENOMEM;
  488. }
  489. memset( entry->buflist, 0, count * sizeof(*entry->buflist) );
  490. entry->buf_size = size;
  491. entry->page_order = page_order;
  492. offset = 0;
  493. while ( entry->buf_count < count ) {
  494. buf = &entry->buflist[entry->buf_count];
  495. buf->idx = dma->buf_count + entry->buf_count;
  496. buf->total = alignment;
  497. buf->order = order;
  498. buf->used = 0;
  499. buf->offset = (dma->byte_count + offset);
  500. buf->bus_address = agp_offset + offset;
  501. buf->address = (void *)(agp_offset + offset);
  502. buf->next = NULL;
  503. buf->waiting = 0;
  504. buf->pending = 0;
  505. init_waitqueue_head( &buf->dma_wait );
  506. buf->filp = NULL;
  507. buf->dev_priv_size = dev->driver->dev_priv_size;
  508. buf->dev_private = drm_alloc( buf->dev_priv_size,
  509. DRM_MEM_BUFS );
  510. if(!buf->dev_private) {
  511. /* Set count correctly so we free the proper amount. */
  512. entry->buf_count = count;
  513. drm_cleanup_buf_error(dev,entry);
  514. up( &dev->struct_sem );
  515. atomic_dec( &dev->buf_alloc );
  516. return -ENOMEM;
  517. }
  518. memset( buf->dev_private, 0, buf->dev_priv_size );
  519. DRM_DEBUG( "buffer %d @ %p\n",
  520. entry->buf_count, buf->address );
  521. offset += alignment;
  522. entry->buf_count++;
  523. byte_count += PAGE_SIZE << page_order;
  524. }
  525. DRM_DEBUG( "byte_count: %d\n", byte_count );
  526. temp_buflist = drm_realloc( dma->buflist,
  527. dma->buf_count * sizeof(*dma->buflist),
  528. (dma->buf_count + entry->buf_count)
  529. * sizeof(*dma->buflist),
  530. DRM_MEM_BUFS );
  531. if(!temp_buflist) {
  532. /* Free the entry because it isn't valid */
  533. drm_cleanup_buf_error(dev,entry);
  534. up( &dev->struct_sem );
  535. atomic_dec( &dev->buf_alloc );
  536. return -ENOMEM;
  537. }
  538. dma->buflist = temp_buflist;
  539. for ( i = 0 ; i < entry->buf_count ; i++ ) {
  540. dma->buflist[i + dma->buf_count] = &entry->buflist[i];
  541. }
  542. dma->buf_count += entry->buf_count;
  543. dma->byte_count += byte_count;
  544. DRM_DEBUG( "dma->buf_count : %d\n", dma->buf_count );
  545. DRM_DEBUG( "entry->buf_count : %d\n", entry->buf_count );
  546. up( &dev->struct_sem );
  547. request->count = entry->buf_count;
  548. request->size = size;
  549. dma->flags = _DRM_DMA_USE_AGP;
  550. atomic_dec( &dev->buf_alloc );
  551. return 0;
  552. }
  553. EXPORT_SYMBOL(drm_addbufs_agp);
  554. #endif /* __OS_HAS_AGP */
  555. int drm_addbufs_pci(drm_device_t *dev, drm_buf_desc_t *request)
  556. {
  557. drm_device_dma_t *dma = dev->dma;
  558. int count;
  559. int order;
  560. int size;
  561. int total;
  562. int page_order;
  563. drm_buf_entry_t *entry;
  564. unsigned long page;
  565. drm_buf_t *buf;
  566. int alignment;
  567. unsigned long offset;
  568. int i;
  569. int byte_count;
  570. int page_count;
  571. unsigned long *temp_pagelist;
  572. drm_buf_t **temp_buflist;
  573. if (!drm_core_check_feature(dev, DRIVER_PCI_DMA)) return -EINVAL;
  574. if ( !dma ) return -EINVAL;
  575. count = request->count;
  576. order = drm_order(request->size);
  577. size = 1 << order;
  578. DRM_DEBUG( "count=%d, size=%d (%d), order=%d, queue_count=%d\n",
  579. request->count, request->size, size,
  580. order, dev->queue_count );
  581. if ( order < DRM_MIN_ORDER || order > DRM_MAX_ORDER ) return -EINVAL;
  582. if ( dev->queue_count ) return -EBUSY; /* Not while in use */
  583. alignment = (request->flags & _DRM_PAGE_ALIGN)
  584. ? PAGE_ALIGN(size) : size;
  585. page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
  586. total = PAGE_SIZE << page_order;
  587. spin_lock( &dev->count_lock );
  588. if ( dev->buf_use ) {
  589. spin_unlock( &dev->count_lock );
  590. return -EBUSY;
  591. }
  592. atomic_inc( &dev->buf_alloc );
  593. spin_unlock( &dev->count_lock );
  594. down( &dev->struct_sem );
  595. entry = &dma->bufs[order];
  596. if ( entry->buf_count ) {
  597. up( &dev->struct_sem );
  598. atomic_dec( &dev->buf_alloc );
  599. return -ENOMEM; /* May only call once for each order */
  600. }
  601. if (count < 0 || count > 4096) {
  602. up( &dev->struct_sem );
  603. atomic_dec( &dev->buf_alloc );
  604. return -EINVAL;
  605. }
  606. entry->buflist = drm_alloc( count * sizeof(*entry->buflist),
  607. DRM_MEM_BUFS );
  608. if ( !entry->buflist ) {
  609. up( &dev->struct_sem );
  610. atomic_dec( &dev->buf_alloc );
  611. return -ENOMEM;
  612. }
  613. memset( entry->buflist, 0, count * sizeof(*entry->buflist) );
  614. entry->seglist = drm_alloc( count * sizeof(*entry->seglist),
  615. DRM_MEM_SEGS );
  616. if ( !entry->seglist ) {
  617. drm_free( entry->buflist,
  618. count * sizeof(*entry->buflist),
  619. DRM_MEM_BUFS );
  620. up( &dev->struct_sem );
  621. atomic_dec( &dev->buf_alloc );
  622. return -ENOMEM;
  623. }
  624. memset( entry->seglist, 0, count * sizeof(*entry->seglist) );
  625. /* Keep the original pagelist until we know all the allocations
  626. * have succeeded
  627. */
  628. temp_pagelist = drm_alloc( (dma->page_count + (count << page_order))
  629. * sizeof(*dma->pagelist),
  630. DRM_MEM_PAGES );
  631. if (!temp_pagelist) {
  632. drm_free( entry->buflist,
  633. count * sizeof(*entry->buflist),
  634. DRM_MEM_BUFS );
  635. drm_free( entry->seglist,
  636. count * sizeof(*entry->seglist),
  637. DRM_MEM_SEGS );
  638. up( &dev->struct_sem );
  639. atomic_dec( &dev->buf_alloc );
  640. return -ENOMEM;
  641. }
  642. memcpy(temp_pagelist,
  643. dma->pagelist,
  644. dma->page_count * sizeof(*dma->pagelist));
  645. DRM_DEBUG( "pagelist: %d entries\n",
  646. dma->page_count + (count << page_order) );
  647. entry->buf_size = size;
  648. entry->page_order = page_order;
  649. byte_count = 0;
  650. page_count = 0;
  651. while ( entry->buf_count < count ) {
  652. page = drm_alloc_pages( page_order, DRM_MEM_DMA );
  653. if ( !page ) {
  654. /* Set count correctly so we free the proper amount. */
  655. entry->buf_count = count;
  656. entry->seg_count = count;
  657. drm_cleanup_buf_error(dev, entry);
  658. drm_free( temp_pagelist,
  659. (dma->page_count + (count << page_order))
  660. * sizeof(*dma->pagelist),
  661. DRM_MEM_PAGES );
  662. up( &dev->struct_sem );
  663. atomic_dec( &dev->buf_alloc );
  664. return -ENOMEM;
  665. }
  666. entry->seglist[entry->seg_count++] = page;
  667. for ( i = 0 ; i < (1 << page_order) ; i++ ) {
  668. DRM_DEBUG( "page %d @ 0x%08lx\n",
  669. dma->page_count + page_count,
  670. page + PAGE_SIZE * i );
  671. temp_pagelist[dma->page_count + page_count++]
  672. = page + PAGE_SIZE * i;
  673. }
  674. for ( offset = 0 ;
  675. offset + size <= total && entry->buf_count < count ;
  676. offset += alignment, ++entry->buf_count ) {
  677. buf = &entry->buflist[entry->buf_count];
  678. buf->idx = dma->buf_count + entry->buf_count;
  679. buf->total = alignment;
  680. buf->order = order;
  681. buf->used = 0;
  682. buf->offset = (dma->byte_count + byte_count + offset);
  683. buf->address = (void *)(page + offset);
  684. buf->next = NULL;
  685. buf->waiting = 0;
  686. buf->pending = 0;
  687. init_waitqueue_head( &buf->dma_wait );
  688. buf->filp = NULL;
  689. buf->dev_priv_size = dev->driver->dev_priv_size;
  690. buf->dev_private = drm_alloc( buf->dev_priv_size,
  691. DRM_MEM_BUFS );
  692. if(!buf->dev_private) {
  693. /* Set count correctly so we free the proper amount. */
  694. entry->buf_count = count;
  695. entry->seg_count = count;
  696. drm_cleanup_buf_error(dev,entry);
  697. drm_free( temp_pagelist,
  698. (dma->page_count + (count << page_order))
  699. * sizeof(*dma->pagelist),
  700. DRM_MEM_PAGES );
  701. up( &dev->struct_sem );
  702. atomic_dec( &dev->buf_alloc );
  703. return -ENOMEM;
  704. }
  705. memset( buf->dev_private, 0, buf->dev_priv_size );
  706. DRM_DEBUG( "buffer %d @ %p\n",
  707. entry->buf_count, buf->address );
  708. }
  709. byte_count += PAGE_SIZE << page_order;
  710. }
  711. temp_buflist = drm_realloc( dma->buflist,
  712. dma->buf_count * sizeof(*dma->buflist),
  713. (dma->buf_count + entry->buf_count)
  714. * sizeof(*dma->buflist),
  715. DRM_MEM_BUFS );
  716. if (!temp_buflist) {
  717. /* Free the entry because it isn't valid */
  718. drm_cleanup_buf_error(dev,entry);
  719. drm_free( temp_pagelist,
  720. (dma->page_count + (count << page_order))
  721. * sizeof(*dma->pagelist),
  722. DRM_MEM_PAGES );
  723. up( &dev->struct_sem );
  724. atomic_dec( &dev->buf_alloc );
  725. return -ENOMEM;
  726. }
  727. dma->buflist = temp_buflist;
  728. for ( i = 0 ; i < entry->buf_count ; i++ ) {
  729. dma->buflist[i + dma->buf_count] = &entry->buflist[i];
  730. }
  731. /* No allocations failed, so now we can replace the orginal pagelist
  732. * with the new one.
  733. */
  734. if (dma->page_count) {
  735. drm_free(dma->pagelist,
  736. dma->page_count * sizeof(*dma->pagelist),
  737. DRM_MEM_PAGES);
  738. }
  739. dma->pagelist = temp_pagelist;
  740. dma->buf_count += entry->buf_count;
  741. dma->seg_count += entry->seg_count;
  742. dma->page_count += entry->seg_count << page_order;
  743. dma->byte_count += PAGE_SIZE * (entry->seg_count << page_order);
  744. up( &dev->struct_sem );
  745. request->count = entry->buf_count;
  746. request->size = size;
  747. atomic_dec( &dev->buf_alloc );
  748. return 0;
  749. }
  750. EXPORT_SYMBOL(drm_addbufs_pci);
  751. static int drm_addbufs_sg(drm_device_t *dev, drm_buf_desc_t *request)
  752. {
  753. drm_device_dma_t *dma = dev->dma;
  754. drm_buf_entry_t *entry;
  755. drm_buf_t *buf;
  756. unsigned long offset;
  757. unsigned long agp_offset;
  758. int count;
  759. int order;
  760. int size;
  761. int alignment;
  762. int page_order;
  763. int total;
  764. int byte_count;
  765. int i;
  766. drm_buf_t **temp_buflist;
  767. if (!drm_core_check_feature(dev, DRIVER_SG)) return -EINVAL;
  768. if ( !dma ) return -EINVAL;
  769. count = request->count;
  770. order = drm_order(request->size);
  771. size = 1 << order;
  772. alignment = (request->flags & _DRM_PAGE_ALIGN)
  773. ? PAGE_ALIGN(size) : size;
  774. page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
  775. total = PAGE_SIZE << page_order;
  776. byte_count = 0;
  777. agp_offset = request->agp_start;
  778. DRM_DEBUG( "count: %d\n", count );
  779. DRM_DEBUG( "order: %d\n", order );
  780. DRM_DEBUG( "size: %d\n", size );
  781. DRM_DEBUG( "agp_offset: %lu\n", agp_offset );
  782. DRM_DEBUG( "alignment: %d\n", alignment );
  783. DRM_DEBUG( "page_order: %d\n", page_order );
  784. DRM_DEBUG( "total: %d\n", total );
  785. if ( order < DRM_MIN_ORDER || order > DRM_MAX_ORDER ) return -EINVAL;
  786. if ( dev->queue_count ) return -EBUSY; /* Not while in use */
  787. spin_lock( &dev->count_lock );
  788. if ( dev->buf_use ) {
  789. spin_unlock( &dev->count_lock );
  790. return -EBUSY;
  791. }
  792. atomic_inc( &dev->buf_alloc );
  793. spin_unlock( &dev->count_lock );
  794. down( &dev->struct_sem );
  795. entry = &dma->bufs[order];
  796. if ( entry->buf_count ) {
  797. up( &dev->struct_sem );
  798. atomic_dec( &dev->buf_alloc );
  799. return -ENOMEM; /* May only call once for each order */
  800. }
  801. if (count < 0 || count > 4096) {
  802. up( &dev->struct_sem );
  803. atomic_dec( &dev->buf_alloc );
  804. return -EINVAL;
  805. }
  806. entry->buflist = drm_alloc( count * sizeof(*entry->buflist),
  807. DRM_MEM_BUFS );
  808. if ( !entry->buflist ) {
  809. up( &dev->struct_sem );
  810. atomic_dec( &dev->buf_alloc );
  811. return -ENOMEM;
  812. }
  813. memset( entry->buflist, 0, count * sizeof(*entry->buflist) );
  814. entry->buf_size = size;
  815. entry->page_order = page_order;
  816. offset = 0;
  817. while ( entry->buf_count < count ) {
  818. buf = &entry->buflist[entry->buf_count];
  819. buf->idx = dma->buf_count + entry->buf_count;
  820. buf->total = alignment;
  821. buf->order = order;
  822. buf->used = 0;
  823. buf->offset = (dma->byte_count + offset);
  824. buf->bus_address = agp_offset + offset;
  825. buf->address = (void *)(agp_offset + offset + dev->sg->handle);
  826. buf->next = NULL;
  827. buf->waiting = 0;
  828. buf->pending = 0;
  829. init_waitqueue_head( &buf->dma_wait );
  830. buf->filp = NULL;
  831. buf->dev_priv_size = dev->driver->dev_priv_size;
  832. buf->dev_private = drm_alloc( buf->dev_priv_size,
  833. DRM_MEM_BUFS );
  834. if(!buf->dev_private) {
  835. /* Set count correctly so we free the proper amount. */
  836. entry->buf_count = count;
  837. drm_cleanup_buf_error(dev,entry);
  838. up( &dev->struct_sem );
  839. atomic_dec( &dev->buf_alloc );
  840. return -ENOMEM;
  841. }
  842. memset( buf->dev_private, 0, buf->dev_priv_size );
  843. DRM_DEBUG( "buffer %d @ %p\n",
  844. entry->buf_count, buf->address );
  845. offset += alignment;
  846. entry->buf_count++;
  847. byte_count += PAGE_SIZE << page_order;
  848. }
  849. DRM_DEBUG( "byte_count: %d\n", byte_count );
  850. temp_buflist = drm_realloc( dma->buflist,
  851. dma->buf_count * sizeof(*dma->buflist),
  852. (dma->buf_count + entry->buf_count)
  853. * sizeof(*dma->buflist),
  854. DRM_MEM_BUFS );
  855. if(!temp_buflist) {
  856. /* Free the entry because it isn't valid */
  857. drm_cleanup_buf_error(dev,entry);
  858. up( &dev->struct_sem );
  859. atomic_dec( &dev->buf_alloc );
  860. return -ENOMEM;
  861. }
  862. dma->buflist = temp_buflist;
  863. for ( i = 0 ; i < entry->buf_count ; i++ ) {
  864. dma->buflist[i + dma->buf_count] = &entry->buflist[i];
  865. }
  866. dma->buf_count += entry->buf_count;
  867. dma->byte_count += byte_count;
  868. DRM_DEBUG( "dma->buf_count : %d\n", dma->buf_count );
  869. DRM_DEBUG( "entry->buf_count : %d\n", entry->buf_count );
  870. up( &dev->struct_sem );
  871. request->count = entry->buf_count;
  872. request->size = size;
  873. dma->flags = _DRM_DMA_USE_SG;
  874. atomic_dec( &dev->buf_alloc );
  875. return 0;
  876. }
  877. int drm_addbufs_fb(drm_device_t *dev, drm_buf_desc_t *request)
  878. {
  879. drm_device_dma_t *dma = dev->dma;
  880. drm_buf_entry_t *entry;
  881. drm_buf_t *buf;
  882. unsigned long offset;
  883. unsigned long agp_offset;
  884. int count;
  885. int order;
  886. int size;
  887. int alignment;
  888. int page_order;
  889. int total;
  890. int byte_count;
  891. int i;
  892. drm_buf_t **temp_buflist;
  893. if (!drm_core_check_feature(dev, DRIVER_FB_DMA))
  894. return -EINVAL;
  895. if (!dma)
  896. return -EINVAL;
  897. count = request->count;
  898. order = drm_order(request->size);
  899. size = 1 << order;
  900. alignment = (request->flags & _DRM_PAGE_ALIGN)
  901. ? PAGE_ALIGN(size) : size;
  902. page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
  903. total = PAGE_SIZE << page_order;
  904. byte_count = 0;
  905. agp_offset = request->agp_start;
  906. DRM_DEBUG("count: %d\n", count);
  907. DRM_DEBUG("order: %d\n", order);
  908. DRM_DEBUG("size: %d\n", size);
  909. DRM_DEBUG("agp_offset: %lu\n", agp_offset);
  910. DRM_DEBUG("alignment: %d\n", alignment);
  911. DRM_DEBUG("page_order: %d\n", page_order);
  912. DRM_DEBUG("total: %d\n", total);
  913. if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
  914. return -EINVAL;
  915. if (dev->queue_count)
  916. return -EBUSY; /* Not while in use */
  917. spin_lock(&dev->count_lock);
  918. if (dev->buf_use) {
  919. spin_unlock(&dev->count_lock);
  920. return -EBUSY;
  921. }
  922. atomic_inc(&dev->buf_alloc);
  923. spin_unlock(&dev->count_lock);
  924. down(&dev->struct_sem);
  925. entry = &dma->bufs[order];
  926. if (entry->buf_count) {
  927. up(&dev->struct_sem);
  928. atomic_dec(&dev->buf_alloc);
  929. return -ENOMEM; /* May only call once for each order */
  930. }
  931. if (count < 0 || count > 4096) {
  932. up(&dev->struct_sem);
  933. atomic_dec(&dev->buf_alloc);
  934. return -EINVAL;
  935. }
  936. entry->buflist = drm_alloc(count * sizeof(*entry->buflist),
  937. DRM_MEM_BUFS);
  938. if (!entry->buflist) {
  939. up(&dev->struct_sem);
  940. atomic_dec(&dev->buf_alloc);
  941. return -ENOMEM;
  942. }
  943. memset(entry->buflist, 0, count * sizeof(*entry->buflist));
  944. entry->buf_size = size;
  945. entry->page_order = page_order;
  946. offset = 0;
  947. while (entry->buf_count < count) {
  948. buf = &entry->buflist[entry->buf_count];
  949. buf->idx = dma->buf_count + entry->buf_count;
  950. buf->total = alignment;
  951. buf->order = order;
  952. buf->used = 0;
  953. buf->offset = (dma->byte_count + offset);
  954. buf->bus_address = agp_offset + offset;
  955. buf->address = (void *)(agp_offset + offset);
  956. buf->next = NULL;
  957. buf->waiting = 0;
  958. buf->pending = 0;
  959. init_waitqueue_head(&buf->dma_wait);
  960. buf->filp = NULL;
  961. buf->dev_priv_size = dev->driver->dev_priv_size;
  962. buf->dev_private = drm_alloc(buf->dev_priv_size, DRM_MEM_BUFS);
  963. if (!buf->dev_private) {
  964. /* Set count correctly so we free the proper amount. */
  965. entry->buf_count = count;
  966. drm_cleanup_buf_error(dev, entry);
  967. up(&dev->struct_sem);
  968. atomic_dec(&dev->buf_alloc);
  969. return -ENOMEM;
  970. }
  971. memset(buf->dev_private, 0, buf->dev_priv_size);
  972. DRM_DEBUG("buffer %d @ %p\n", entry->buf_count, buf->address);
  973. offset += alignment;
  974. entry->buf_count++;
  975. byte_count += PAGE_SIZE << page_order;
  976. }
  977. DRM_DEBUG("byte_count: %d\n", byte_count);
  978. temp_buflist = drm_realloc(dma->buflist,
  979. dma->buf_count * sizeof(*dma->buflist),
  980. (dma->buf_count + entry->buf_count)
  981. * sizeof(*dma->buflist), DRM_MEM_BUFS);
  982. if (!temp_buflist) {
  983. /* Free the entry because it isn't valid */
  984. drm_cleanup_buf_error(dev, entry);
  985. up(&dev->struct_sem);
  986. atomic_dec(&dev->buf_alloc);
  987. return -ENOMEM;
  988. }
  989. dma->buflist = temp_buflist;
  990. for (i = 0; i < entry->buf_count; i++) {
  991. dma->buflist[i + dma->buf_count] = &entry->buflist[i];
  992. }
  993. dma->buf_count += entry->buf_count;
  994. dma->byte_count += byte_count;
  995. DRM_DEBUG("dma->buf_count : %d\n", dma->buf_count);
  996. DRM_DEBUG("entry->buf_count : %d\n", entry->buf_count);
  997. up(&dev->struct_sem);
  998. request->count = entry->buf_count;
  999. request->size = size;
  1000. dma->flags = _DRM_DMA_USE_FB;
  1001. atomic_dec(&dev->buf_alloc);
  1002. return 0;
  1003. }
  1004. /**
  1005. * Add buffers for DMA transfers (ioctl).
  1006. *
  1007. * \param inode device inode.
  1008. * \param filp file pointer.
  1009. * \param cmd command.
  1010. * \param arg pointer to a drm_buf_desc_t request.
  1011. * \return zero on success or a negative number on failure.
  1012. *
  1013. * According with the memory type specified in drm_buf_desc::flags and the
  1014. * build options, it dispatches the call either to addbufs_agp(),
  1015. * addbufs_sg() or addbufs_pci() for AGP, scatter-gather or consistent
  1016. * PCI memory respectively.
  1017. */
  1018. int drm_addbufs( struct inode *inode, struct file *filp,
  1019. unsigned int cmd, unsigned long arg )
  1020. {
  1021. drm_buf_desc_t request;
  1022. drm_file_t *priv = filp->private_data;
  1023. drm_device_t *dev = priv->head->dev;
  1024. int ret;
  1025. if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
  1026. return -EINVAL;
  1027. if ( copy_from_user( &request, (drm_buf_desc_t __user *)arg,
  1028. sizeof(request) ) )
  1029. return -EFAULT;
  1030. #if __OS_HAS_AGP
  1031. if ( request.flags & _DRM_AGP_BUFFER )
  1032. ret=drm_addbufs_agp(dev, &request);
  1033. else
  1034. #endif
  1035. if ( request.flags & _DRM_SG_BUFFER )
  1036. ret=drm_addbufs_sg(dev, &request);
  1037. else if ( request.flags & _DRM_FB_BUFFER)
  1038. ret=drm_addbufs_fb(dev, &request);
  1039. else
  1040. ret=drm_addbufs_pci(dev, &request);
  1041. if (ret==0) {
  1042. if (copy_to_user((void __user *)arg, &request,
  1043. sizeof(request))) {
  1044. ret = -EFAULT;
  1045. }
  1046. }
  1047. return ret;
  1048. }
  1049. /**
  1050. * Get information about the buffer mappings.
  1051. *
  1052. * This was originally mean for debugging purposes, or by a sophisticated
  1053. * client library to determine how best to use the available buffers (e.g.,
  1054. * large buffers can be used for image transfer).
  1055. *
  1056. * \param inode device inode.
  1057. * \param filp file pointer.
  1058. * \param cmd command.
  1059. * \param arg pointer to a drm_buf_info structure.
  1060. * \return zero on success or a negative number on failure.
  1061. *
  1062. * Increments drm_device::buf_use while holding the drm_device::count_lock
  1063. * lock, preventing of allocating more buffers after this call. Information
  1064. * about each requested buffer is then copied into user space.
  1065. */
  1066. int drm_infobufs( struct inode *inode, struct file *filp,
  1067. unsigned int cmd, unsigned long arg )
  1068. {
  1069. drm_file_t *priv = filp->private_data;
  1070. drm_device_t *dev = priv->head->dev;
  1071. drm_device_dma_t *dma = dev->dma;
  1072. drm_buf_info_t request;
  1073. drm_buf_info_t __user *argp = (void __user *)arg;
  1074. int i;
  1075. int count;
  1076. if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
  1077. return -EINVAL;
  1078. if ( !dma ) return -EINVAL;
  1079. spin_lock( &dev->count_lock );
  1080. if ( atomic_read( &dev->buf_alloc ) ) {
  1081. spin_unlock( &dev->count_lock );
  1082. return -EBUSY;
  1083. }
  1084. ++dev->buf_use; /* Can't allocate more after this call */
  1085. spin_unlock( &dev->count_lock );
  1086. if ( copy_from_user( &request, argp, sizeof(request) ) )
  1087. return -EFAULT;
  1088. for ( i = 0, count = 0 ; i < DRM_MAX_ORDER + 1 ; i++ ) {
  1089. if ( dma->bufs[i].buf_count ) ++count;
  1090. }
  1091. DRM_DEBUG( "count = %d\n", count );
  1092. if ( request.count >= count ) {
  1093. for ( i = 0, count = 0 ; i < DRM_MAX_ORDER + 1 ; i++ ) {
  1094. if ( dma->bufs[i].buf_count ) {
  1095. drm_buf_desc_t __user *to = &request.list[count];
  1096. drm_buf_entry_t *from = &dma->bufs[i];
  1097. drm_freelist_t *list = &dma->bufs[i].freelist;
  1098. if ( copy_to_user( &to->count,
  1099. &from->buf_count,
  1100. sizeof(from->buf_count) ) ||
  1101. copy_to_user( &to->size,
  1102. &from->buf_size,
  1103. sizeof(from->buf_size) ) ||
  1104. copy_to_user( &to->low_mark,
  1105. &list->low_mark,
  1106. sizeof(list->low_mark) ) ||
  1107. copy_to_user( &to->high_mark,
  1108. &list->high_mark,
  1109. sizeof(list->high_mark) ) )
  1110. return -EFAULT;
  1111. DRM_DEBUG( "%d %d %d %d %d\n",
  1112. i,
  1113. dma->bufs[i].buf_count,
  1114. dma->bufs[i].buf_size,
  1115. dma->bufs[i].freelist.low_mark,
  1116. dma->bufs[i].freelist.high_mark );
  1117. ++count;
  1118. }
  1119. }
  1120. }
  1121. request.count = count;
  1122. if ( copy_to_user( argp, &request, sizeof(request) ) )
  1123. return -EFAULT;
  1124. return 0;
  1125. }
  1126. /**
  1127. * Specifies a low and high water mark for buffer allocation
  1128. *
  1129. * \param inode device inode.
  1130. * \param filp file pointer.
  1131. * \param cmd command.
  1132. * \param arg a pointer to a drm_buf_desc structure.
  1133. * \return zero on success or a negative number on failure.
  1134. *
  1135. * Verifies that the size order is bounded between the admissible orders and
  1136. * updates the respective drm_device_dma::bufs entry low and high water mark.
  1137. *
  1138. * \note This ioctl is deprecated and mostly never used.
  1139. */
  1140. int drm_markbufs( struct inode *inode, struct file *filp,
  1141. unsigned int cmd, unsigned long arg )
  1142. {
  1143. drm_file_t *priv = filp->private_data;
  1144. drm_device_t *dev = priv->head->dev;
  1145. drm_device_dma_t *dma = dev->dma;
  1146. drm_buf_desc_t request;
  1147. int order;
  1148. drm_buf_entry_t *entry;
  1149. if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
  1150. return -EINVAL;
  1151. if ( !dma ) return -EINVAL;
  1152. if ( copy_from_user( &request,
  1153. (drm_buf_desc_t __user *)arg,
  1154. sizeof(request) ) )
  1155. return -EFAULT;
  1156. DRM_DEBUG( "%d, %d, %d\n",
  1157. request.size, request.low_mark, request.high_mark );
  1158. order = drm_order( request.size );
  1159. if ( order < DRM_MIN_ORDER || order > DRM_MAX_ORDER ) return -EINVAL;
  1160. entry = &dma->bufs[order];
  1161. if ( request.low_mark < 0 || request.low_mark > entry->buf_count )
  1162. return -EINVAL;
  1163. if ( request.high_mark < 0 || request.high_mark > entry->buf_count )
  1164. return -EINVAL;
  1165. entry->freelist.low_mark = request.low_mark;
  1166. entry->freelist.high_mark = request.high_mark;
  1167. return 0;
  1168. }
  1169. /**
  1170. * Unreserve the buffers in list, previously reserved using drmDMA.
  1171. *
  1172. * \param inode device inode.
  1173. * \param filp file pointer.
  1174. * \param cmd command.
  1175. * \param arg pointer to a drm_buf_free structure.
  1176. * \return zero on success or a negative number on failure.
  1177. *
  1178. * Calls free_buffer() for each used buffer.
  1179. * This function is primarily used for debugging.
  1180. */
  1181. int drm_freebufs( struct inode *inode, struct file *filp,
  1182. unsigned int cmd, unsigned long arg )
  1183. {
  1184. drm_file_t *priv = filp->private_data;
  1185. drm_device_t *dev = priv->head->dev;
  1186. drm_device_dma_t *dma = dev->dma;
  1187. drm_buf_free_t request;
  1188. int i;
  1189. int idx;
  1190. drm_buf_t *buf;
  1191. if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
  1192. return -EINVAL;
  1193. if ( !dma ) return -EINVAL;
  1194. if ( copy_from_user( &request,
  1195. (drm_buf_free_t __user *)arg,
  1196. sizeof(request) ) )
  1197. return -EFAULT;
  1198. DRM_DEBUG( "%d\n", request.count );
  1199. for ( i = 0 ; i < request.count ; i++ ) {
  1200. if ( copy_from_user( &idx,
  1201. &request.list[i],
  1202. sizeof(idx) ) )
  1203. return -EFAULT;
  1204. if ( idx < 0 || idx >= dma->buf_count ) {
  1205. DRM_ERROR( "Index %d (of %d max)\n",
  1206. idx, dma->buf_count - 1 );
  1207. return -EINVAL;
  1208. }
  1209. buf = dma->buflist[idx];
  1210. if ( buf->filp != filp ) {
  1211. DRM_ERROR( "Process %d freeing buffer not owned\n",
  1212. current->pid );
  1213. return -EINVAL;
  1214. }
  1215. drm_free_buffer( dev, buf );
  1216. }
  1217. return 0;
  1218. }
  1219. /**
  1220. * Maps all of the DMA buffers into client-virtual space (ioctl).
  1221. *
  1222. * \param inode device inode.
  1223. * \param filp file pointer.
  1224. * \param cmd command.
  1225. * \param arg pointer to a drm_buf_map structure.
  1226. * \return zero on success or a negative number on failure.
  1227. *
  1228. * Maps the AGP or SG buffer region with do_mmap(), and copies information
  1229. * about each buffer into user space. The PCI buffers are already mapped on the
  1230. * addbufs_pci() call.
  1231. */
  1232. int drm_mapbufs( struct inode *inode, struct file *filp,
  1233. unsigned int cmd, unsigned long arg )
  1234. {
  1235. drm_file_t *priv = filp->private_data;
  1236. drm_device_t *dev = priv->head->dev;
  1237. drm_device_dma_t *dma = dev->dma;
  1238. drm_buf_map_t __user *argp = (void __user *)arg;
  1239. int retcode = 0;
  1240. const int zero = 0;
  1241. unsigned long virtual;
  1242. unsigned long address;
  1243. drm_buf_map_t request;
  1244. int i;
  1245. if (!drm_core_check_feature(dev, DRIVER_HAVE_DMA))
  1246. return -EINVAL;
  1247. if ( !dma ) return -EINVAL;
  1248. spin_lock( &dev->count_lock );
  1249. if ( atomic_read( &dev->buf_alloc ) ) {
  1250. spin_unlock( &dev->count_lock );
  1251. return -EBUSY;
  1252. }
  1253. dev->buf_use++; /* Can't allocate more after this call */
  1254. spin_unlock( &dev->count_lock );
  1255. if ( copy_from_user( &request, argp, sizeof(request) ) )
  1256. return -EFAULT;
  1257. if ( request.count >= dma->buf_count ) {
  1258. if ((drm_core_has_AGP(dev) && (dma->flags & _DRM_DMA_USE_AGP))
  1259. || (drm_core_check_feature(dev, DRIVER_SG)
  1260. && (dma->flags & _DRM_DMA_USE_SG))
  1261. || (drm_core_check_feature(dev, DRIVER_FB_DMA)
  1262. && (dma->flags & _DRM_DMA_USE_FB))) {
  1263. drm_map_t *map = dev->agp_buffer_map;
  1264. if ( !map ) {
  1265. retcode = -EINVAL;
  1266. goto done;
  1267. }
  1268. #if LINUX_VERSION_CODE <= 0x020402
  1269. down( &current->mm->mmap_sem );
  1270. #else
  1271. down_write( &current->mm->mmap_sem );
  1272. #endif
  1273. virtual = do_mmap( filp, 0, map->size,
  1274. PROT_READ | PROT_WRITE,
  1275. MAP_SHARED,
  1276. (unsigned long)map->offset );
  1277. #if LINUX_VERSION_CODE <= 0x020402
  1278. up( &current->mm->mmap_sem );
  1279. #else
  1280. up_write( &current->mm->mmap_sem );
  1281. #endif
  1282. } else {
  1283. #if LINUX_VERSION_CODE <= 0x020402
  1284. down( &current->mm->mmap_sem );
  1285. #else
  1286. down_write( &current->mm->mmap_sem );
  1287. #endif
  1288. virtual = do_mmap( filp, 0, dma->byte_count,
  1289. PROT_READ | PROT_WRITE,
  1290. MAP_SHARED, 0 );
  1291. #if LINUX_VERSION_CODE <= 0x020402
  1292. up( &current->mm->mmap_sem );
  1293. #else
  1294. up_write( &current->mm->mmap_sem );
  1295. #endif
  1296. }
  1297. if ( virtual > -1024UL ) {
  1298. /* Real error */
  1299. retcode = (signed long)virtual;
  1300. goto done;
  1301. }
  1302. request.virtual = (void __user *)virtual;
  1303. for ( i = 0 ; i < dma->buf_count ; i++ ) {
  1304. if ( copy_to_user( &request.list[i].idx,
  1305. &dma->buflist[i]->idx,
  1306. sizeof(request.list[0].idx) ) ) {
  1307. retcode = -EFAULT;
  1308. goto done;
  1309. }
  1310. if ( copy_to_user( &request.list[i].total,
  1311. &dma->buflist[i]->total,
  1312. sizeof(request.list[0].total) ) ) {
  1313. retcode = -EFAULT;
  1314. goto done;
  1315. }
  1316. if ( copy_to_user( &request.list[i].used,
  1317. &zero,
  1318. sizeof(zero) ) ) {
  1319. retcode = -EFAULT;
  1320. goto done;
  1321. }
  1322. address = virtual + dma->buflist[i]->offset; /* *** */
  1323. if ( copy_to_user( &request.list[i].address,
  1324. &address,
  1325. sizeof(address) ) ) {
  1326. retcode = -EFAULT;
  1327. goto done;
  1328. }
  1329. }
  1330. }
  1331. done:
  1332. request.count = dma->buf_count;
  1333. DRM_DEBUG( "%d buffers, retcode = %d\n", request.count, retcode );
  1334. if ( copy_to_user( argp, &request, sizeof(request) ) )
  1335. return -EFAULT;
  1336. return retcode;
  1337. }
  1338. /**
  1339. * Compute size order. Returns the exponent of the smaller power of two which
  1340. * is greater or equal to given number.
  1341. *
  1342. * \param size size.
  1343. * \return order.
  1344. *
  1345. * \todo Can be made faster.
  1346. */
  1347. int drm_order( unsigned long size )
  1348. {
  1349. int order;
  1350. unsigned long tmp;
  1351. for (order = 0, tmp = size >> 1; tmp; tmp >>= 1, order++)
  1352. ;
  1353. if (size & (size - 1))
  1354. ++order;
  1355. return order;
  1356. }
  1357. EXPORT_SYMBOL(drm_order);