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