drm_memory_debug.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459
  1. /**
  2. * \file drm_memory.h
  3. * Memory management wrappers for DRM.
  4. *
  5. * \author Rickard E. (Rik) Faith <faith@valinux.com>
  6. * \author Gareth Hughes <gareth@valinux.com>
  7. */
  8. /*
  9. * Copyright 1999 Precision Insight, Inc., Cedar Park, Texas.
  10. * Copyright 2000 VA Linux Systems, Inc., Sunnyvale, California.
  11. * All Rights Reserved.
  12. *
  13. * Permission is hereby granted, free of charge, to any person obtaining a
  14. * copy of this software and associated documentation files (the "Software"),
  15. * to deal in the Software without restriction, including without limitation
  16. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  17. * and/or sell copies of the Software, and to permit persons to whom the
  18. * Software is furnished to do so, subject to the following conditions:
  19. *
  20. * The above copyright notice and this permission notice (including the next
  21. * paragraph) shall be included in all copies or substantial portions of the
  22. * Software.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  25. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  26. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  27. * VA LINUX SYSTEMS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
  28. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  29. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  30. * OTHER DEALINGS IN THE SOFTWARE.
  31. */
  32. #include <linux/config.h>
  33. #include "drmP.h"
  34. typedef struct drm_mem_stats {
  35. const char *name;
  36. int succeed_count;
  37. int free_count;
  38. int fail_count;
  39. unsigned long bytes_allocated;
  40. unsigned long bytes_freed;
  41. } drm_mem_stats_t;
  42. static DEFINE_SPINLOCK(DRM(mem_lock));
  43. static unsigned long DRM(ram_available) = 0; /* In pages */
  44. static unsigned long DRM(ram_used) = 0;
  45. static drm_mem_stats_t DRM(mem_stats)[] = {
  46. [DRM_MEM_DMA] = { "dmabufs" },
  47. [DRM_MEM_SAREA] = { "sareas" },
  48. [DRM_MEM_DRIVER] = { "driver" },
  49. [DRM_MEM_MAGIC] = { "magic" },
  50. [DRM_MEM_IOCTLS] = { "ioctltab" },
  51. [DRM_MEM_MAPS] = { "maplist" },
  52. [DRM_MEM_VMAS] = { "vmalist" },
  53. [DRM_MEM_BUFS] = { "buflist" },
  54. [DRM_MEM_SEGS] = { "seglist" },
  55. [DRM_MEM_PAGES] = { "pagelist" },
  56. [DRM_MEM_FILES] = { "files" },
  57. [DRM_MEM_QUEUES] = { "queues" },
  58. [DRM_MEM_CMDS] = { "commands" },
  59. [DRM_MEM_MAPPINGS] = { "mappings" },
  60. [DRM_MEM_BUFLISTS] = { "buflists" },
  61. [DRM_MEM_AGPLISTS] = { "agplist" },
  62. [DRM_MEM_SGLISTS] = { "sglist" },
  63. [DRM_MEM_TOTALAGP] = { "totalagp" },
  64. [DRM_MEM_BOUNDAGP] = { "boundagp" },
  65. [DRM_MEM_CTXBITMAP] = { "ctxbitmap"},
  66. [DRM_MEM_CTXLIST] = { "ctxlist" },
  67. [DRM_MEM_STUB] = { "stub" },
  68. { NULL, 0, } /* Last entry must be null */
  69. };
  70. void DRM(mem_init)(void)
  71. {
  72. drm_mem_stats_t *mem;
  73. struct sysinfo si;
  74. for (mem = DRM(mem_stats); mem->name; ++mem) {
  75. mem->succeed_count = 0;
  76. mem->free_count = 0;
  77. mem->fail_count = 0;
  78. mem->bytes_allocated = 0;
  79. mem->bytes_freed = 0;
  80. }
  81. si_meminfo(&si);
  82. DRM(ram_available) = si.totalram;
  83. DRM(ram_used) = 0;
  84. }
  85. /* drm_mem_info is called whenever a process reads /dev/drm/mem. */
  86. static int DRM(_mem_info)(char *buf, char **start, off_t offset,
  87. int request, int *eof, void *data)
  88. {
  89. drm_mem_stats_t *pt;
  90. int len = 0;
  91. if (offset > DRM_PROC_LIMIT) {
  92. *eof = 1;
  93. return 0;
  94. }
  95. *eof = 0;
  96. *start = &buf[offset];
  97. DRM_PROC_PRINT(" total counts "
  98. " | outstanding \n");
  99. DRM_PROC_PRINT("type alloc freed fail bytes freed"
  100. " | allocs bytes\n\n");
  101. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu kB |\n",
  102. "system", 0, 0, 0,
  103. DRM(ram_available) << (PAGE_SHIFT - 10));
  104. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu kB |\n",
  105. "locked", 0, 0, 0, DRM(ram_used) >> 10);
  106. DRM_PROC_PRINT("\n");
  107. for (pt = DRM(mem_stats); pt->name; pt++) {
  108. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu %10lu | %6d %10ld\n",
  109. pt->name,
  110. pt->succeed_count,
  111. pt->free_count,
  112. pt->fail_count,
  113. pt->bytes_allocated,
  114. pt->bytes_freed,
  115. pt->succeed_count - pt->free_count,
  116. (long)pt->bytes_allocated
  117. - (long)pt->bytes_freed);
  118. }
  119. if (len > request + offset) return request;
  120. *eof = 1;
  121. return len - offset;
  122. }
  123. int DRM(mem_info)(char *buf, char **start, off_t offset,
  124. int len, int *eof, void *data)
  125. {
  126. int ret;
  127. spin_lock(&DRM(mem_lock));
  128. ret = DRM(_mem_info)(buf, start, offset, len, eof, data);
  129. spin_unlock(&DRM(mem_lock));
  130. return ret;
  131. }
  132. void *DRM(alloc)(size_t size, int area)
  133. {
  134. void *pt;
  135. if (!size) {
  136. DRM_MEM_ERROR(area, "Allocating 0 bytes\n");
  137. return NULL;
  138. }
  139. if (!(pt = kmalloc(size, GFP_KERNEL))) {
  140. spin_lock(&DRM(mem_lock));
  141. ++DRM(mem_stats)[area].fail_count;
  142. spin_unlock(&DRM(mem_lock));
  143. return NULL;
  144. }
  145. spin_lock(&DRM(mem_lock));
  146. ++DRM(mem_stats)[area].succeed_count;
  147. DRM(mem_stats)[area].bytes_allocated += size;
  148. spin_unlock(&DRM(mem_lock));
  149. return pt;
  150. }
  151. void *DRM(calloc)(size_t nmemb, size_t size, int area)
  152. {
  153. void *addr;
  154. addr = DRM(alloc)(nmemb * size, area);
  155. if (addr != NULL)
  156. memset((void *)addr, 0, size * nmemb);
  157. return addr;
  158. }
  159. void *DRM(realloc)(void *oldpt, size_t oldsize, size_t size, int area)
  160. {
  161. void *pt;
  162. if (!(pt = DRM(alloc)(size, area))) return NULL;
  163. if (oldpt && oldsize) {
  164. memcpy(pt, oldpt, oldsize);
  165. DRM(free)(oldpt, oldsize, area);
  166. }
  167. return pt;
  168. }
  169. void DRM(free)(void *pt, size_t size, int area)
  170. {
  171. int alloc_count;
  172. int free_count;
  173. if (!pt) DRM_MEM_ERROR(area, "Attempt to free NULL pointer\n");
  174. else kfree(pt);
  175. spin_lock(&DRM(mem_lock));
  176. DRM(mem_stats)[area].bytes_freed += size;
  177. free_count = ++DRM(mem_stats)[area].free_count;
  178. alloc_count = DRM(mem_stats)[area].succeed_count;
  179. spin_unlock(&DRM(mem_lock));
  180. if (free_count > alloc_count) {
  181. DRM_MEM_ERROR(area, "Excess frees: %d frees, %d allocs\n",
  182. free_count, alloc_count);
  183. }
  184. }
  185. unsigned long DRM(alloc_pages)(int order, int area)
  186. {
  187. unsigned long address;
  188. unsigned long bytes = PAGE_SIZE << order;
  189. unsigned long addr;
  190. unsigned int sz;
  191. spin_lock(&DRM(mem_lock));
  192. if ((DRM(ram_used) >> PAGE_SHIFT)
  193. > (DRM_RAM_PERCENT * DRM(ram_available)) / 100) {
  194. spin_unlock(&DRM(mem_lock));
  195. return 0;
  196. }
  197. spin_unlock(&DRM(mem_lock));
  198. address = __get_free_pages(GFP_KERNEL, order);
  199. if (!address) {
  200. spin_lock(&DRM(mem_lock));
  201. ++DRM(mem_stats)[area].fail_count;
  202. spin_unlock(&DRM(mem_lock));
  203. return 0;
  204. }
  205. spin_lock(&DRM(mem_lock));
  206. ++DRM(mem_stats)[area].succeed_count;
  207. DRM(mem_stats)[area].bytes_allocated += bytes;
  208. DRM(ram_used) += bytes;
  209. spin_unlock(&DRM(mem_lock));
  210. /* Zero outside the lock */
  211. memset((void *)address, 0, bytes);
  212. /* Reserve */
  213. for (addr = address, sz = bytes;
  214. sz > 0;
  215. addr += PAGE_SIZE, sz -= PAGE_SIZE) {
  216. SetPageReserved(virt_to_page(addr));
  217. }
  218. return address;
  219. }
  220. void DRM(free_pages)(unsigned long address, int order, int area)
  221. {
  222. unsigned long bytes = PAGE_SIZE << order;
  223. int alloc_count;
  224. int free_count;
  225. unsigned long addr;
  226. unsigned int sz;
  227. if (!address) {
  228. DRM_MEM_ERROR(area, "Attempt to free address 0\n");
  229. } else {
  230. /* Unreserve */
  231. for (addr = address, sz = bytes;
  232. sz > 0;
  233. addr += PAGE_SIZE, sz -= PAGE_SIZE) {
  234. ClearPageReserved(virt_to_page(addr));
  235. }
  236. free_pages(address, order);
  237. }
  238. spin_lock(&DRM(mem_lock));
  239. free_count = ++DRM(mem_stats)[area].free_count;
  240. alloc_count = DRM(mem_stats)[area].succeed_count;
  241. DRM(mem_stats)[area].bytes_freed += bytes;
  242. DRM(ram_used) -= bytes;
  243. spin_unlock(&DRM(mem_lock));
  244. if (free_count > alloc_count) {
  245. DRM_MEM_ERROR(area,
  246. "Excess frees: %d frees, %d allocs\n",
  247. free_count, alloc_count);
  248. }
  249. }
  250. void *DRM(ioremap)(unsigned long offset, unsigned long size, drm_device_t *dev)
  251. {
  252. void *pt;
  253. if (!size) {
  254. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  255. "Mapping 0 bytes at 0x%08lx\n", offset);
  256. return NULL;
  257. }
  258. if (!(pt = drm_ioremap(offset, size, dev))) {
  259. spin_lock(&DRM(mem_lock));
  260. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].fail_count;
  261. spin_unlock(&DRM(mem_lock));
  262. return NULL;
  263. }
  264. spin_lock(&DRM(mem_lock));
  265. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].succeed_count;
  266. DRM(mem_stats)[DRM_MEM_MAPPINGS].bytes_allocated += size;
  267. spin_unlock(&DRM(mem_lock));
  268. return pt;
  269. }
  270. void *DRM(ioremap_nocache)(unsigned long offset, unsigned long size, drm_device_t *dev)
  271. {
  272. void *pt;
  273. if (!size) {
  274. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  275. "Mapping 0 bytes at 0x%08lx\n", offset);
  276. return NULL;
  277. }
  278. if (!(pt = drm_ioremap_nocache(offset, size, dev))) {
  279. spin_lock(&DRM(mem_lock));
  280. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].fail_count;
  281. spin_unlock(&DRM(mem_lock));
  282. return NULL;
  283. }
  284. spin_lock(&DRM(mem_lock));
  285. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].succeed_count;
  286. DRM(mem_stats)[DRM_MEM_MAPPINGS].bytes_allocated += size;
  287. spin_unlock(&DRM(mem_lock));
  288. return pt;
  289. }
  290. void DRM(ioremapfree)(void *pt, unsigned long size, drm_device_t *dev)
  291. {
  292. int alloc_count;
  293. int free_count;
  294. if (!pt)
  295. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  296. "Attempt to free NULL pointer\n");
  297. else
  298. drm_ioremapfree(pt, size, dev);
  299. spin_lock(&DRM(mem_lock));
  300. DRM(mem_stats)[DRM_MEM_MAPPINGS].bytes_freed += size;
  301. free_count = ++DRM(mem_stats)[DRM_MEM_MAPPINGS].free_count;
  302. alloc_count = DRM(mem_stats)[DRM_MEM_MAPPINGS].succeed_count;
  303. spin_unlock(&DRM(mem_lock));
  304. if (free_count > alloc_count) {
  305. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  306. "Excess frees: %d frees, %d allocs\n",
  307. free_count, alloc_count);
  308. }
  309. }
  310. #if __OS_HAS_AGP
  311. DRM_AGP_MEM *DRM(alloc_agp)(int pages, u32 type)
  312. {
  313. DRM_AGP_MEM *handle;
  314. if (!pages) {
  315. DRM_MEM_ERROR(DRM_MEM_TOTALAGP, "Allocating 0 pages\n");
  316. return NULL;
  317. }
  318. if ((handle = DRM(agp_allocate_memory)(pages, type))) {
  319. spin_lock(&DRM(mem_lock));
  320. ++DRM(mem_stats)[DRM_MEM_TOTALAGP].succeed_count;
  321. DRM(mem_stats)[DRM_MEM_TOTALAGP].bytes_allocated
  322. += pages << PAGE_SHIFT;
  323. spin_unlock(&DRM(mem_lock));
  324. return handle;
  325. }
  326. spin_lock(&DRM(mem_lock));
  327. ++DRM(mem_stats)[DRM_MEM_TOTALAGP].fail_count;
  328. spin_unlock(&DRM(mem_lock));
  329. return NULL;
  330. }
  331. int DRM(free_agp)(DRM_AGP_MEM *handle, int pages)
  332. {
  333. int alloc_count;
  334. int free_count;
  335. int retval = -EINVAL;
  336. if (!handle) {
  337. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  338. "Attempt to free NULL AGP handle\n");
  339. return retval;
  340. }
  341. if (DRM(agp_free_memory)(handle)) {
  342. spin_lock(&DRM(mem_lock));
  343. free_count = ++DRM(mem_stats)[DRM_MEM_TOTALAGP].free_count;
  344. alloc_count = DRM(mem_stats)[DRM_MEM_TOTALAGP].succeed_count;
  345. DRM(mem_stats)[DRM_MEM_TOTALAGP].bytes_freed
  346. += pages << PAGE_SHIFT;
  347. spin_unlock(&DRM(mem_lock));
  348. if (free_count > alloc_count) {
  349. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  350. "Excess frees: %d frees, %d allocs\n",
  351. free_count, alloc_count);
  352. }
  353. return 0;
  354. }
  355. return retval;
  356. }
  357. int DRM(bind_agp)(DRM_AGP_MEM *handle, unsigned int start)
  358. {
  359. int retcode = -EINVAL;
  360. if (!handle) {
  361. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  362. "Attempt to bind NULL AGP handle\n");
  363. return retcode;
  364. }
  365. if (!(retcode = DRM(agp_bind_memory)(handle, start))) {
  366. spin_lock(&DRM(mem_lock));
  367. ++DRM(mem_stats)[DRM_MEM_BOUNDAGP].succeed_count;
  368. DRM(mem_stats)[DRM_MEM_BOUNDAGP].bytes_allocated
  369. += handle->page_count << PAGE_SHIFT;
  370. spin_unlock(&DRM(mem_lock));
  371. return retcode;
  372. }
  373. spin_lock(&DRM(mem_lock));
  374. ++DRM(mem_stats)[DRM_MEM_BOUNDAGP].fail_count;
  375. spin_unlock(&DRM(mem_lock));
  376. return retcode;
  377. }
  378. int DRM(unbind_agp)(DRM_AGP_MEM *handle)
  379. {
  380. int alloc_count;
  381. int free_count;
  382. int retcode = -EINVAL;
  383. if (!handle) {
  384. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  385. "Attempt to unbind NULL AGP handle\n");
  386. return retcode;
  387. }
  388. if ((retcode = DRM(agp_unbind_memory)(handle))) return retcode;
  389. spin_lock(&DRM(mem_lock));
  390. free_count = ++DRM(mem_stats)[DRM_MEM_BOUNDAGP].free_count;
  391. alloc_count = DRM(mem_stats)[DRM_MEM_BOUNDAGP].succeed_count;
  392. DRM(mem_stats)[DRM_MEM_BOUNDAGP].bytes_freed
  393. += handle->page_count << PAGE_SHIFT;
  394. spin_unlock(&DRM(mem_lock));
  395. if (free_count > alloc_count) {
  396. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  397. "Excess frees: %d frees, %d allocs\n",
  398. free_count, alloc_count);
  399. }
  400. return retcode;
  401. }
  402. #endif