drm_bufs.c 41 KB

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