drm_memory_debug.h 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  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 "drmP.h"
  33. typedef struct drm_mem_stats {
  34. const char *name;
  35. int succeed_count;
  36. int free_count;
  37. int fail_count;
  38. unsigned long bytes_allocated;
  39. unsigned long bytes_freed;
  40. } drm_mem_stats_t;
  41. static DEFINE_SPINLOCK(drm_mem_lock);
  42. static unsigned long drm_ram_available = 0; /* In pages */
  43. static unsigned long drm_ram_used = 0;
  44. static drm_mem_stats_t drm_mem_stats[] =
  45. {
  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. drm_mem_stats_t *mem;
  72. struct sysinfo si;
  73. for (mem = drm_mem_stats; mem->name; ++mem) {
  74. mem->succeed_count = 0;
  75. mem->free_count = 0;
  76. mem->fail_count = 0;
  77. mem->bytes_allocated = 0;
  78. mem->bytes_freed = 0;
  79. }
  80. si_meminfo(&si);
  81. drm_ram_available = si.totalram;
  82. drm_ram_used = 0;
  83. }
  84. /* drm_mem_info is called whenever a process reads /dev/drm/mem. */
  85. static int drm__mem_info (char *buf, char **start, off_t offset,
  86. int request, int *eof, void *data) {
  87. drm_mem_stats_t *pt;
  88. int len = 0;
  89. if (offset > DRM_PROC_LIMIT) {
  90. *eof = 1;
  91. return 0;
  92. }
  93. *eof = 0;
  94. *start = &buf[offset];
  95. DRM_PROC_PRINT(" total counts "
  96. " | outstanding \n");
  97. DRM_PROC_PRINT("type alloc freed fail bytes freed"
  98. " | allocs bytes\n\n");
  99. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu kB |\n",
  100. "system", 0, 0, 0,
  101. drm_ram_available << (PAGE_SHIFT - 10));
  102. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu kB |\n",
  103. "locked", 0, 0, 0, drm_ram_used >> 10);
  104. DRM_PROC_PRINT("\n");
  105. for (pt = drm_mem_stats; pt->name; pt++) {
  106. DRM_PROC_PRINT("%-9.9s %5d %5d %4d %10lu %10lu | %6d %10ld\n",
  107. pt->name,
  108. pt->succeed_count,
  109. pt->free_count,
  110. pt->fail_count,
  111. pt->bytes_allocated,
  112. pt->bytes_freed,
  113. pt->succeed_count - pt->free_count,
  114. (long)pt->bytes_allocated
  115. - (long)pt->bytes_freed);
  116. }
  117. if (len > request + offset)
  118. return request;
  119. *eof = 1;
  120. return len - offset;
  121. }
  122. int drm_mem_info (char *buf, char **start, off_t offset,
  123. int len, int *eof, void *data) {
  124. int ret;
  125. spin_lock(&drm_mem_lock);
  126. ret = drm__mem_info (buf, start, offset, len, eof, data);
  127. spin_unlock(&drm_mem_lock);
  128. return ret;
  129. }
  130. void *drm_alloc (size_t size, int area) {
  131. void *pt;
  132. if (!size) {
  133. DRM_MEM_ERROR(area, "Allocating 0 bytes\n");
  134. return NULL;
  135. }
  136. if (!(pt = kmalloc(size, GFP_KERNEL))) {
  137. spin_lock(&drm_mem_lock);
  138. ++drm_mem_stats[area].fail_count;
  139. spin_unlock(&drm_mem_lock);
  140. return NULL;
  141. }
  142. spin_lock(&drm_mem_lock);
  143. ++drm_mem_stats[area].succeed_count;
  144. drm_mem_stats[area].bytes_allocated += size;
  145. spin_unlock(&drm_mem_lock);
  146. return pt;
  147. }
  148. void *drm_calloc (size_t nmemb, size_t size, int area) {
  149. void *addr;
  150. addr = drm_alloc (nmemb * size, area);
  151. if (addr != NULL)
  152. memset((void *)addr, 0, size * nmemb);
  153. return addr;
  154. }
  155. void *drm_realloc (void *oldpt, size_t oldsize, size_t size, int area) {
  156. void *pt;
  157. if (!(pt = drm_alloc (size, area)))
  158. return NULL;
  159. if (oldpt && oldsize) {
  160. memcpy(pt, oldpt, oldsize);
  161. drm_free (oldpt, oldsize, area);
  162. }
  163. return pt;
  164. }
  165. void drm_free (void *pt, size_t size, int area) {
  166. int alloc_count;
  167. int free_count;
  168. if (!pt)
  169. DRM_MEM_ERROR(area, "Attempt to free NULL pointer\n");
  170. else
  171. kfree(pt);
  172. spin_lock(&drm_mem_lock);
  173. drm_mem_stats[area].bytes_freed += size;
  174. free_count = ++drm_mem_stats[area].free_count;
  175. alloc_count = drm_mem_stats[area].succeed_count;
  176. spin_unlock(&drm_mem_lock);
  177. if (free_count > alloc_count) {
  178. DRM_MEM_ERROR(area, "Excess frees: %d frees, %d allocs\n",
  179. free_count, alloc_count);
  180. }
  181. }
  182. #if __OS_HAS_AGP
  183. DRM_AGP_MEM *drm_alloc_agp (drm_device_t *dev, int pages, u32 type) {
  184. DRM_AGP_MEM *handle;
  185. if (!pages) {
  186. DRM_MEM_ERROR(DRM_MEM_TOTALAGP, "Allocating 0 pages\n");
  187. return NULL;
  188. }
  189. if ((handle = drm_agp_allocate_memory (pages, type))) {
  190. spin_lock(&drm_mem_lock);
  191. ++drm_mem_stats[DRM_MEM_TOTALAGP].succeed_count;
  192. drm_mem_stats[DRM_MEM_TOTALAGP].bytes_allocated
  193. += pages << PAGE_SHIFT;
  194. spin_unlock(&drm_mem_lock);
  195. return handle;
  196. }
  197. spin_lock(&drm_mem_lock);
  198. ++drm_mem_stats[DRM_MEM_TOTALAGP].fail_count;
  199. spin_unlock(&drm_mem_lock);
  200. return NULL;
  201. }
  202. int drm_free_agp (DRM_AGP_MEM * handle, int pages) {
  203. int alloc_count;
  204. int free_count;
  205. int retval = -EINVAL;
  206. if (!handle) {
  207. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  208. "Attempt to free NULL AGP handle\n");
  209. return retval;
  210. }
  211. if (drm_agp_free_memory (handle)) {
  212. spin_lock(&drm_mem_lock);
  213. free_count = ++drm_mem_stats[DRM_MEM_TOTALAGP].free_count;
  214. alloc_count = drm_mem_stats[DRM_MEM_TOTALAGP].succeed_count;
  215. drm_mem_stats[DRM_MEM_TOTALAGP].bytes_freed
  216. += pages << PAGE_SHIFT;
  217. spin_unlock(&drm_mem_lock);
  218. if (free_count > alloc_count) {
  219. DRM_MEM_ERROR(DRM_MEM_TOTALAGP,
  220. "Excess frees: %d frees, %d allocs\n",
  221. free_count, alloc_count);
  222. }
  223. return 0;
  224. }
  225. return retval;
  226. }
  227. int drm_bind_agp (DRM_AGP_MEM * handle, unsigned int start) {
  228. int retcode = -EINVAL;
  229. if (!handle) {
  230. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  231. "Attempt to bind NULL AGP handle\n");
  232. return retcode;
  233. }
  234. if (!(retcode = drm_agp_bind_memory (handle, start))) {
  235. spin_lock(&drm_mem_lock);
  236. ++drm_mem_stats[DRM_MEM_BOUNDAGP].succeed_count;
  237. drm_mem_stats[DRM_MEM_BOUNDAGP].bytes_allocated
  238. += handle->page_count << PAGE_SHIFT;
  239. spin_unlock(&drm_mem_lock);
  240. return retcode;
  241. }
  242. spin_lock(&drm_mem_lock);
  243. ++drm_mem_stats[DRM_MEM_BOUNDAGP].fail_count;
  244. spin_unlock(&drm_mem_lock);
  245. return retcode;
  246. }
  247. int drm_unbind_agp (DRM_AGP_MEM * handle) {
  248. int alloc_count;
  249. int free_count;
  250. int retcode = -EINVAL;
  251. if (!handle) {
  252. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  253. "Attempt to unbind NULL AGP handle\n");
  254. return retcode;
  255. }
  256. if ((retcode = drm_agp_unbind_memory (handle)))
  257. return retcode;
  258. spin_lock(&drm_mem_lock);
  259. free_count = ++drm_mem_stats[DRM_MEM_BOUNDAGP].free_count;
  260. alloc_count = drm_mem_stats[DRM_MEM_BOUNDAGP].succeed_count;
  261. drm_mem_stats[DRM_MEM_BOUNDAGP].bytes_freed
  262. += handle->page_count << PAGE_SHIFT;
  263. spin_unlock(&drm_mem_lock);
  264. if (free_count > alloc_count) {
  265. DRM_MEM_ERROR(DRM_MEM_BOUNDAGP,
  266. "Excess frees: %d frees, %d allocs\n",
  267. free_count, alloc_count);
  268. }
  269. return retcode;
  270. }
  271. #endif