drm_memory_debug.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448
  1. /**
  2. * \file drm_memory_debug.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 spinlock_t drm_mem_lock = SPIN_LOCK_UNLOCKED;
  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] = {"dmabufs"},
  48. [DRM_MEM_SAREA] = {"sareas"},
  49. [DRM_MEM_DRIVER] = {"driver"},
  50. [DRM_MEM_MAGIC] = {"magic"},
  51. [DRM_MEM_IOCTLS] = {"ioctltab"},
  52. [DRM_MEM_MAPS] = {"maplist"},
  53. [DRM_MEM_VMAS] = {"vmalist"},
  54. [DRM_MEM_BUFS] = {"buflist"},
  55. [DRM_MEM_SEGS] = {"seglist"},
  56. [DRM_MEM_PAGES] = {"pagelist"},
  57. [DRM_MEM_FILES] = {"files"},
  58. [DRM_MEM_QUEUES] = {"queues"},
  59. [DRM_MEM_CMDS] = {"commands"},
  60. [DRM_MEM_MAPPINGS] = {"mappings"},
  61. [DRM_MEM_BUFLISTS] = {"buflists"},
  62. [DRM_MEM_AGPLISTS] = {"agplist"},
  63. [DRM_MEM_SGLISTS] = {"sglist"},
  64. [DRM_MEM_TOTALAGP] = {"totalagp"},
  65. [DRM_MEM_BOUNDAGP] = {"boundagp"},
  66. [DRM_MEM_CTXBITMAP] = {"ctxbitmap"},
  67. [DRM_MEM_CTXLIST] = {"ctxlist"},
  68. [DRM_MEM_STUB] = {"stub"},
  69. {NULL, 0,} /* Last entry must be null */
  70. };
  71. void drm_mem_init (void) {
  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. drm_mem_stats_t *pt;
  89. int len = 0;
  90. if (offset > DRM_PROC_LIMIT) {
  91. *eof = 1;
  92. return 0;
  93. }
  94. *eof = 0;
  95. *start = &buf[offset];
  96. DRM_PROC_PRINT(" total counts "
  97. " | outstanding \n");
  98. DRM_PROC_PRINT("type alloc freed fail bytes freed"
  99. " | allocs bytes\n\n");
  100. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu kB |\n",
  101. "system", 0, 0, 0,
  102. drm_ram_available << (PAGE_SHIFT - 10));
  103. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu kB |\n",
  104. "locked", 0, 0, 0, drm_ram_used >> 10);
  105. DRM_PROC_PRINT("\n");
  106. for (pt = drm_mem_stats; pt->name; pt++) {
  107. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu %10lu | %6d %10ld\n",
  108. pt->name,
  109. pt->succeed_count,
  110. pt->free_count,
  111. pt->fail_count,
  112. pt->bytes_allocated,
  113. pt->bytes_freed,
  114. pt->succeed_count - pt->free_count,
  115. (long)pt->bytes_allocated
  116. - (long)pt->bytes_freed);
  117. }
  118. if (len > request + offset)
  119. 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. int ret;
  126. spin_lock(&drm_mem_lock);
  127. ret = drm__mem_info (buf, start, offset, len, eof, data);
  128. spin_unlock(&drm_mem_lock);
  129. return ret;
  130. }
  131. void *drm_alloc (size_t size, int area) {
  132. void *pt;
  133. if (!size) {
  134. DRM_MEM_ERROR(area, "Allocating 0 bytes\n");
  135. return NULL;
  136. }
  137. if (!(pt = kmalloc(size, GFP_KERNEL))) {
  138. spin_lock(&drm_mem_lock);
  139. ++drm_mem_stats[area].fail_count;
  140. spin_unlock(&drm_mem_lock);
  141. return NULL;
  142. }
  143. spin_lock(&drm_mem_lock);
  144. ++drm_mem_stats[area].succeed_count;
  145. drm_mem_stats[area].bytes_allocated += size;
  146. spin_unlock(&drm_mem_lock);
  147. return pt;
  148. }
  149. void *drm_calloc (size_t nmemb, size_t size, int area) {
  150. void *addr;
  151. addr = drm_alloc (nmemb * size, area);
  152. if (addr != NULL)
  153. memset((void *)addr, 0, size * nmemb);
  154. return addr;
  155. }
  156. void *drm_realloc (void *oldpt, size_t oldsize, size_t size, int area) {
  157. void *pt;
  158. if (!(pt = drm_alloc (size, area)))
  159. return NULL;
  160. if (oldpt && oldsize) {
  161. memcpy(pt, oldpt, oldsize);
  162. drm_free (oldpt, oldsize, area);
  163. }
  164. return pt;
  165. }
  166. void drm_free (void *pt, size_t size, int area) {
  167. int alloc_count;
  168. int free_count;
  169. if (!pt)
  170. DRM_MEM_ERROR(area, "Attempt to free NULL pointer\n");
  171. else
  172. kfree(pt);
  173. spin_lock(&drm_mem_lock);
  174. drm_mem_stats[area].bytes_freed += size;
  175. free_count = ++drm_mem_stats[area].free_count;
  176. alloc_count = drm_mem_stats[area].succeed_count;
  177. spin_unlock(&drm_mem_lock);
  178. if (free_count > alloc_count) {
  179. DRM_MEM_ERROR(area, "Excess frees: %d frees, %d allocs\n",
  180. free_count, alloc_count);
  181. }
  182. }
  183. unsigned long drm_alloc_pages (int order, int area) {
  184. unsigned long address;
  185. unsigned long bytes = PAGE_SIZE << order;
  186. unsigned long addr;
  187. unsigned int sz;
  188. spin_lock(&drm_mem_lock);
  189. if ((drm_ram_used >> PAGE_SHIFT)
  190. > (DRM_RAM_PERCENT * drm_ram_available) / 100) {
  191. spin_unlock(&drm_mem_lock);
  192. return 0;
  193. }
  194. spin_unlock(&drm_mem_lock);
  195. address = __get_free_pages(GFP_KERNEL|__GFP_COMP, order);
  196. if (!address) {
  197. spin_lock(&drm_mem_lock);
  198. ++drm_mem_stats[area].fail_count;
  199. spin_unlock(&drm_mem_lock);
  200. return 0;
  201. }
  202. spin_lock(&drm_mem_lock);
  203. ++drm_mem_stats[area].succeed_count;
  204. drm_mem_stats[area].bytes_allocated += bytes;
  205. drm_ram_used += bytes;
  206. spin_unlock(&drm_mem_lock);
  207. /* Zero outside the lock */
  208. memset((void *)address, 0, bytes);
  209. /* Reserve */
  210. for (addr = address, sz = bytes;
  211. sz > 0; addr += PAGE_SIZE, sz -= PAGE_SIZE) {
  212. SetPageReserved(virt_to_page(addr));
  213. }
  214. return address;
  215. }
  216. void drm_free_pages (unsigned long address, int order, int area) {
  217. unsigned long bytes = PAGE_SIZE << order;
  218. int alloc_count;
  219. int free_count;
  220. unsigned long addr;
  221. unsigned int sz;
  222. if (!address) {
  223. DRM_MEM_ERROR(area, "Attempt to free address 0\n");
  224. } else {
  225. /* Unreserve */
  226. for (addr = address, sz = bytes;
  227. sz > 0; addr += PAGE_SIZE, sz -= PAGE_SIZE) {
  228. ClearPageReserved(virt_to_page(addr));
  229. }
  230. free_pages(address, order);
  231. }
  232. spin_lock(&drm_mem_lock);
  233. free_count = ++drm_mem_stats[area].free_count;
  234. alloc_count = drm_mem_stats[area].succeed_count;
  235. drm_mem_stats[area].bytes_freed += bytes;
  236. drm_ram_used -= bytes;
  237. spin_unlock(&drm_mem_lock);
  238. if (free_count > alloc_count) {
  239. DRM_MEM_ERROR(area,
  240. "Excess frees: %d frees, %d allocs\n",
  241. free_count, alloc_count);
  242. }
  243. }
  244. void *drm_ioremap (unsigned long offset, unsigned long size,
  245. drm_device_t * dev) {
  246. void *pt;
  247. if (!size) {
  248. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  249. "Mapping 0 bytes at 0x%08lx\n", offset);
  250. return NULL;
  251. }
  252. if (!(pt = drm_ioremap(offset, size, dev))) {
  253. spin_lock(&drm_mem_lock);
  254. ++drm_mem_stats[DRM_MEM_MAPPINGS].fail_count;
  255. spin_unlock(&drm_mem_lock);
  256. return NULL;
  257. }
  258. spin_lock(&drm_mem_lock);
  259. ++drm_mem_stats[DRM_MEM_MAPPINGS].succeed_count;
  260. drm_mem_stats[DRM_MEM_MAPPINGS].bytes_allocated += size;
  261. spin_unlock(&drm_mem_lock);
  262. return pt;
  263. }
  264. void *drm_ioremap_nocache (unsigned long offset, unsigned long size,
  265. drm_device_t * dev) {
  266. void *pt;
  267. if (!size) {
  268. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  269. "Mapping 0 bytes at 0x%08lx\n", offset);
  270. return NULL;
  271. }
  272. if (!(pt = drm_ioremap_nocache(offset, size, dev))) {
  273. spin_lock(&drm_mem_lock);
  274. ++drm_mem_stats[DRM_MEM_MAPPINGS].fail_count;
  275. spin_unlock(&drm_mem_lock);
  276. return NULL;
  277. }
  278. spin_lock(&drm_mem_lock);
  279. ++drm_mem_stats[DRM_MEM_MAPPINGS].succeed_count;
  280. drm_mem_stats[DRM_MEM_MAPPINGS].bytes_allocated += size;
  281. spin_unlock(&drm_mem_lock);
  282. return pt;
  283. }
  284. void drm_ioremapfree (void *pt, unsigned long size, drm_device_t * dev) {
  285. int alloc_count;
  286. int free_count;
  287. if (!pt)
  288. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  289. "Attempt to free NULL pointer\n");
  290. else
  291. drm_ioremapfree(pt, size, dev);
  292. spin_lock(&drm_mem_lock);
  293. drm_mem_stats[DRM_MEM_MAPPINGS].bytes_freed += size;
  294. free_count = ++drm_mem_stats[DRM_MEM_MAPPINGS].free_count;
  295. alloc_count = drm_mem_stats[DRM_MEM_MAPPINGS].succeed_count;
  296. spin_unlock(&drm_mem_lock);
  297. if (free_count > alloc_count) {
  298. DRM_MEM_ERROR(DRM_MEM_MAPPINGS,
  299. "Excess frees: %d frees, %d allocs\n",
  300. free_count, alloc_count);
  301. }
  302. }
  303. #if __OS_HAS_AGP
  304. DRM_AGP_MEM *drm_alloc_agp (drm_device_t *dev, int pages, u32 type) {
  305. DRM_AGP_MEM *handle;
  306. if (!pages) {
  307. DRM_MEM_ERROR(DRM_MEM_TOTALAGP, "Allocating 0 pages\n");
  308. return NULL;
  309. }
  310. if ((handle = drm_agp_allocate_memory (pages, type))) {
  311. spin_lock(&drm_mem_lock);
  312. ++drm_mem_stats[DRM_MEM_TOTALAGP].succeed_count;
  313. drm_mem_stats[DRM_MEM_TOTALAGP].bytes_allocated
  314. += pages << PAGE_SHIFT;
  315. spin_unlock(&drm_mem_lock);
  316. return handle;
  317. }
  318. spin_lock(&drm_mem_lock);
  319. ++drm_mem_stats[DRM_MEM_TOTALAGP].fail_count;
  320. spin_unlock(&drm_mem_lock);
  321. return NULL;
  322. }
  323. int drm_free_agp (DRM_AGP_MEM * handle, int pages) {
  324. int alloc_count;
  325. int free_count;
  326. int retval = -EINVAL;
  327. if (!handle) {
  328. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  329. "Attempt to free NULL AGP handle\n");
  330. return retval;
  331. }
  332. if (drm_agp_free_memory (handle)) {
  333. spin_lock(&drm_mem_lock);
  334. free_count = ++drm_mem_stats[DRM_MEM_TOTALAGP].free_count;
  335. alloc_count = drm_mem_stats[DRM_MEM_TOTALAGP].succeed_count;
  336. drm_mem_stats[DRM_MEM_TOTALAGP].bytes_freed
  337. += pages << PAGE_SHIFT;
  338. spin_unlock(&drm_mem_lock);
  339. if (free_count > alloc_count) {
  340. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  341. "Excess frees: %d frees, %d allocs\n",
  342. free_count, alloc_count);
  343. }
  344. return 0;
  345. }
  346. return retval;
  347. }
  348. int drm_bind_agp (DRM_AGP_MEM * handle, unsigned int start) {
  349. int retcode = -EINVAL;
  350. if (!handle) {
  351. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  352. "Attempt to bind NULL AGP handle\n");
  353. return retcode;
  354. }
  355. if (!(retcode = drm_agp_bind_memory (handle, start))) {
  356. spin_lock(&drm_mem_lock);
  357. ++drm_mem_stats[DRM_MEM_BOUNDAGP].succeed_count;
  358. drm_mem_stats[DRM_MEM_BOUNDAGP].bytes_allocated
  359. += handle->page_count << PAGE_SHIFT;
  360. spin_unlock(&drm_mem_lock);
  361. return retcode;
  362. }
  363. spin_lock(&drm_mem_lock);
  364. ++drm_mem_stats[DRM_MEM_BOUNDAGP].fail_count;
  365. spin_unlock(&drm_mem_lock);
  366. return retcode;
  367. }
  368. int drm_unbind_agp (DRM_AGP_MEM * handle) {
  369. int alloc_count;
  370. int free_count;
  371. int retcode = -EINVAL;
  372. if (!handle) {
  373. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  374. "Attempt to unbind NULL AGP handle\n");
  375. return retcode;
  376. }
  377. if ((retcode = drm_agp_unbind_memory (handle)))
  378. return retcode;
  379. spin_lock(&drm_mem_lock);
  380. free_count = ++drm_mem_stats[DRM_MEM_BOUNDAGP].free_count;
  381. alloc_count = drm_mem_stats[DRM_MEM_BOUNDAGP].succeed_count;
  382. drm_mem_stats[DRM_MEM_BOUNDAGP].bytes_freed
  383. += handle->page_count << PAGE_SHIFT;
  384. spin_unlock(&drm_mem_lock);
  385. if (free_count > alloc_count) {
  386. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  387. "Excess frees: %d frees, %d allocs\n",
  388. free_count, alloc_count);
  389. }
  390. return retcode;
  391. }
  392. #endif