drm_memory_debug.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449
  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. {
  47. [DRM_MEM_DMA] = {
  48. "dmabufs"},[DRM_MEM_SAREA] = {
  49. "sareas"},[DRM_MEM_DRIVER] = {
  50. "driver"},[DRM_MEM_MAGIC] = {
  51. "magic"},[DRM_MEM_IOCTLS] = {
  52. "ioctltab"},[DRM_MEM_MAPS] = {
  53. "maplist"},[DRM_MEM_VMAS] = {
  54. "vmalist"},[DRM_MEM_BUFS] = {
  55. "buflist"},[DRM_MEM_SEGS] = {
  56. "seglist"},[DRM_MEM_PAGES] = {
  57. "pagelist"},[DRM_MEM_FILES] = {
  58. "files"},[DRM_MEM_QUEUES] = {
  59. "queues"},[DRM_MEM_CMDS] = {
  60. "commands"},[DRM_MEM_MAPPINGS] = {
  61. "mappings"},[DRM_MEM_BUFLISTS] = {
  62. "buflists"},[DRM_MEM_AGPLISTS] = {
  63. "agplist"},[DRM_MEM_SGLISTS] = {
  64. "sglist"},[DRM_MEM_TOTALAGP] = {
  65. "totalagp"},[DRM_MEM_BOUNDAGP] = {
  66. "boundagp"},[DRM_MEM_CTXBITMAP] = {
  67. "ctxbitmap"},[DRM_MEM_CTXLIST] = {
  68. "ctxlist"},[DRM_MEM_STUB] = {
  69. "stub"}, {
  70. NULL, 0,} /* Last entry must be null */
  71. };
  72. void DRM(mem_init) (void) {
  73. drm_mem_stats_t *mem;
  74. struct sysinfo si;
  75. for (mem = DRM(mem_stats); mem->name; ++mem) {
  76. mem->succeed_count = 0;
  77. mem->free_count = 0;
  78. mem->fail_count = 0;
  79. mem->bytes_allocated = 0;
  80. mem->bytes_freed = 0;
  81. }
  82. si_meminfo(&si);
  83. DRM(ram_available) = si.totalram;
  84. DRM(ram_used) = 0;
  85. }
  86. /* drm_mem_info is called whenever a process reads /dev/drm/mem. */
  87. static int DRM(_mem_info) (char *buf, char **start, off_t offset,
  88. int request, int *eof, void *data) {
  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)
  120. return request;
  121. *eof = 1;
  122. return len - offset;
  123. }
  124. int DRM(mem_info) (char *buf, char **start, off_t offset,
  125. int len, int *eof, void *data) {
  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. void *pt;
  134. if (!size) {
  135. DRM_MEM_ERROR(area, "Allocating 0 bytes\n");
  136. return NULL;
  137. }
  138. if (!(pt = kmalloc(size, GFP_KERNEL))) {
  139. spin_lock(&DRM(mem_lock));
  140. ++DRM(mem_stats)[area].fail_count;
  141. spin_unlock(&DRM(mem_lock));
  142. return NULL;
  143. }
  144. spin_lock(&DRM(mem_lock));
  145. ++DRM(mem_stats)[area].succeed_count;
  146. DRM(mem_stats)[area].bytes_allocated += size;
  147. spin_unlock(&DRM(mem_lock));
  148. return pt;
  149. }
  150. void *DRM(calloc) (size_t nmemb, size_t size, int area) {
  151. void *addr;
  152. addr = DRM(alloc) (nmemb * size, area);
  153. if (addr != NULL)
  154. memset((void *)addr, 0, size * nmemb);
  155. return addr;
  156. }
  157. void *DRM(realloc) (void *oldpt, size_t oldsize, size_t size, int area) {
  158. void *pt;
  159. if (!(pt = DRM(alloc) (size, area)))
  160. return NULL;
  161. if (oldpt && oldsize) {
  162. memcpy(pt, oldpt, oldsize);
  163. DRM(free) (oldpt, oldsize, area);
  164. }
  165. return pt;
  166. }
  167. void DRM(free) (void *pt, size_t size, int area) {
  168. int alloc_count;
  169. int free_count;
  170. if (!pt)
  171. DRM_MEM_ERROR(area, "Attempt to free NULL pointer\n");
  172. else
  173. kfree(pt);
  174. spin_lock(&DRM(mem_lock));
  175. DRM(mem_stats)[area].bytes_freed += size;
  176. free_count = ++DRM(mem_stats)[area].free_count;
  177. alloc_count = DRM(mem_stats)[area].succeed_count;
  178. spin_unlock(&DRM(mem_lock));
  179. if (free_count > alloc_count) {
  180. DRM_MEM_ERROR(area, "Excess frees: %d frees, %d allocs\n",
  181. free_count, alloc_count);
  182. }
  183. }
  184. unsigned long DRM(alloc_pages) (int order, int area) {
  185. unsigned long address;
  186. unsigned long bytes = PAGE_SIZE << order;
  187. unsigned long addr;
  188. unsigned int sz;
  189. spin_lock(&DRM(mem_lock));
  190. if ((DRM(ram_used) >> PAGE_SHIFT)
  191. > (DRM_RAM_PERCENT * DRM(ram_available)) / 100) {
  192. spin_unlock(&DRM(mem_lock));
  193. return 0;
  194. }
  195. spin_unlock(&DRM(mem_lock));
  196. address = __get_free_pages(GFP_KERNEL|__GFP_COMP, order);
  197. if (!address) {
  198. spin_lock(&DRM(mem_lock));
  199. ++DRM(mem_stats)[area].fail_count;
  200. spin_unlock(&DRM(mem_lock));
  201. return 0;
  202. }
  203. spin_lock(&DRM(mem_lock));
  204. ++DRM(mem_stats)[area].succeed_count;
  205. DRM(mem_stats)[area].bytes_allocated += bytes;
  206. DRM(ram_used) += bytes;
  207. spin_unlock(&DRM(mem_lock));
  208. /* Zero outside the lock */
  209. memset((void *)address, 0, bytes);
  210. /* Reserve */
  211. for (addr = address, sz = bytes;
  212. sz > 0; addr += PAGE_SIZE, sz -= PAGE_SIZE) {
  213. SetPageReserved(virt_to_page(addr));
  214. }
  215. return address;
  216. }
  217. void DRM(free_pages) (unsigned long address, int order, int area) {
  218. unsigned long bytes = PAGE_SIZE << order;
  219. int alloc_count;
  220. int free_count;
  221. unsigned long addr;
  222. unsigned int sz;
  223. if (!address) {
  224. DRM_MEM_ERROR(area, "Attempt to free address 0\n");
  225. } else {
  226. /* Unreserve */
  227. for (addr = address, sz = bytes;
  228. sz > 0; addr += PAGE_SIZE, sz -= PAGE_SIZE) {
  229. ClearPageReserved(virt_to_page(addr));
  230. }
  231. free_pages(address, order);
  232. }
  233. spin_lock(&DRM(mem_lock));
  234. free_count = ++DRM(mem_stats)[area].free_count;
  235. alloc_count = DRM(mem_stats)[area].succeed_count;
  236. DRM(mem_stats)[area].bytes_freed += bytes;
  237. DRM(ram_used) -= bytes;
  238. spin_unlock(&DRM(mem_lock));
  239. if (free_count > alloc_count) {
  240. DRM_MEM_ERROR(area,
  241. "Excess frees: %d frees, %d allocs\n",
  242. free_count, alloc_count);
  243. }
  244. }
  245. void *DRM(ioremap) (unsigned long offset, unsigned long size,
  246. drm_device_t * dev) {
  247. void *pt;
  248. if (!size) {
  249. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  250. "Mapping 0 bytes at 0x%08lx\n", offset);
  251. return NULL;
  252. }
  253. if (!(pt = drm_ioremap(offset, size, dev))) {
  254. spin_lock(&DRM(mem_lock));
  255. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].fail_count;
  256. spin_unlock(&DRM(mem_lock));
  257. return NULL;
  258. }
  259. spin_lock(&DRM(mem_lock));
  260. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].succeed_count;
  261. DRM(mem_stats)[DRM_MEM_MAPPINGS].bytes_allocated += size;
  262. spin_unlock(&DRM(mem_lock));
  263. return pt;
  264. }
  265. void *DRM(ioremap_nocache) (unsigned long offset, unsigned long size,
  266. drm_device_t * dev) {
  267. void *pt;
  268. if (!size) {
  269. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  270. "Mapping 0 bytes at 0x%08lx\n", offset);
  271. return NULL;
  272. }
  273. if (!(pt = drm_ioremap_nocache(offset, size, dev))) {
  274. spin_lock(&DRM(mem_lock));
  275. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].fail_count;
  276. spin_unlock(&DRM(mem_lock));
  277. return NULL;
  278. }
  279. spin_lock(&DRM(mem_lock));
  280. ++DRM(mem_stats)[DRM_MEM_MAPPINGS].succeed_count;
  281. DRM(mem_stats)[DRM_MEM_MAPPINGS].bytes_allocated += size;
  282. spin_unlock(&DRM(mem_lock));
  283. return pt;
  284. }
  285. void DRM(ioremapfree) (void *pt, unsigned long size, drm_device_t * dev) {
  286. int alloc_count;
  287. int free_count;
  288. if (!pt)
  289. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  290. "Attempt to free NULL pointer\n");
  291. else
  292. drm_ioremapfree(pt, size, dev);
  293. spin_lock(&DRM(mem_lock));
  294. DRM(mem_stats)[DRM_MEM_MAPPINGS].bytes_freed += size;
  295. free_count = ++DRM(mem_stats)[DRM_MEM_MAPPINGS].free_count;
  296. alloc_count = DRM(mem_stats)[DRM_MEM_MAPPINGS].succeed_count;
  297. spin_unlock(&DRM(mem_lock));
  298. if (free_count > alloc_count) {
  299. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  300. "Excess frees: %d frees, %d allocs\n",
  301. free_count, alloc_count);
  302. }
  303. }
  304. #if __OS_HAS_AGP
  305. DRM_AGP_MEM *DRM(alloc_agp) (int pages, u32 type) {
  306. DRM_AGP_MEM *handle;
  307. if (!pages) {
  308. DRM_MEM_ERROR(DRM_MEM_TOTALAGP, "Allocating 0 pages\n");
  309. return NULL;
  310. }
  311. if ((handle = DRM(agp_allocate_memory) (pages, type))) {
  312. spin_lock(&DRM(mem_lock));
  313. ++DRM(mem_stats)[DRM_MEM_TOTALAGP].succeed_count;
  314. DRM(mem_stats)[DRM_MEM_TOTALAGP].bytes_allocated
  315. += pages << PAGE_SHIFT;
  316. spin_unlock(&DRM(mem_lock));
  317. return handle;
  318. }
  319. spin_lock(&DRM(mem_lock));
  320. ++DRM(mem_stats)[DRM_MEM_TOTALAGP].fail_count;
  321. spin_unlock(&DRM(mem_lock));
  322. return NULL;
  323. }
  324. int DRM(free_agp) (DRM_AGP_MEM * handle, int pages) {
  325. int alloc_count;
  326. int free_count;
  327. int retval = -EINVAL;
  328. if (!handle) {
  329. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  330. "Attempt to free NULL AGP handle\n");
  331. return retval;
  332. }
  333. if (DRM(agp_free_memory) (handle)) {
  334. spin_lock(&DRM(mem_lock));
  335. free_count = ++DRM(mem_stats)[DRM_MEM_TOTALAGP].free_count;
  336. alloc_count = DRM(mem_stats)[DRM_MEM_TOTALAGP].succeed_count;
  337. DRM(mem_stats)[DRM_MEM_TOTALAGP].bytes_freed
  338. += pages << PAGE_SHIFT;
  339. spin_unlock(&DRM(mem_lock));
  340. if (free_count > alloc_count) {
  341. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  342. "Excess frees: %d frees, %d allocs\n",
  343. free_count, alloc_count);
  344. }
  345. return 0;
  346. }
  347. return retval;
  348. }
  349. int DRM(bind_agp) (DRM_AGP_MEM * handle, unsigned int start) {
  350. int retcode = -EINVAL;
  351. if (!handle) {
  352. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  353. "Attempt to bind NULL AGP handle\n");
  354. return retcode;
  355. }
  356. if (!(retcode = DRM(agp_bind_memory) (handle, start))) {
  357. spin_lock(&DRM(mem_lock));
  358. ++DRM(mem_stats)[DRM_MEM_BOUNDAGP].succeed_count;
  359. DRM(mem_stats)[DRM_MEM_BOUNDAGP].bytes_allocated
  360. += handle->page_count << PAGE_SHIFT;
  361. spin_unlock(&DRM(mem_lock));
  362. return retcode;
  363. }
  364. spin_lock(&DRM(mem_lock));
  365. ++DRM(mem_stats)[DRM_MEM_BOUNDAGP].fail_count;
  366. spin_unlock(&DRM(mem_lock));
  367. return retcode;
  368. }
  369. int DRM(unbind_agp) (DRM_AGP_MEM * handle) {
  370. int alloc_count;
  371. int free_count;
  372. int retcode = -EINVAL;
  373. if (!handle) {
  374. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  375. "Attempt to unbind NULL AGP handle\n");
  376. return retcode;
  377. }
  378. if ((retcode = DRM(agp_unbind_memory) (handle)))
  379. return retcode;
  380. spin_lock(&DRM(mem_lock));
  381. free_count = ++DRM(mem_stats)[DRM_MEM_BOUNDAGP].free_count;
  382. alloc_count = DRM(mem_stats)[DRM_MEM_BOUNDAGP].succeed_count;
  383. DRM(mem_stats)[DRM_MEM_BOUNDAGP].bytes_freed
  384. += handle->page_count << PAGE_SHIFT;
  385. spin_unlock(&DRM(mem_lock));
  386. if (free_count > alloc_count) {
  387. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  388. "Excess frees: %d frees, %d allocs\n",
  389. free_count, alloc_count);
  390. }
  391. return retcode;
  392. }
  393. #endif