sde_dbg_evtlog.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (c) 2016-2021, The Linux Foundation. All rights reserved.
  4. */
  5. #define pr_fmt(fmt) "sde_dbg:[%s] " fmt, __func__
  6. #include <linux/delay.h>
  7. #include <linux/spinlock.h>
  8. #include <linux/ktime.h>
  9. #include <linux/debugfs.h>
  10. #include <linux/uaccess.h>
  11. #include <linux/dma-buf.h>
  12. #include <linux/slab.h>
  13. #include <linux/sched/clock.h>
  14. #include "sde_dbg.h"
  15. #include "sde_trace.h"
  16. #define SDE_EVTLOG_FILTER_STRSIZE 64
  17. struct sde_evtlog_filter {
  18. struct list_head list;
  19. char filter[SDE_EVTLOG_FILTER_STRSIZE];
  20. };
  21. static bool _sde_evtlog_is_filtered_no_lock(
  22. struct sde_dbg_evtlog *evtlog, const char *str)
  23. {
  24. struct sde_evtlog_filter *filter_node;
  25. size_t len;
  26. bool rc;
  27. if (!str)
  28. return true;
  29. len = strlen(str);
  30. /*
  31. * Filter the incoming string IFF the list is not empty AND
  32. * a matching entry is not in the list.
  33. */
  34. rc = !list_empty(&evtlog->filter_list);
  35. list_for_each_entry(filter_node, &evtlog->filter_list, list)
  36. if (strnstr(str, filter_node->filter, len)) {
  37. rc = false;
  38. break;
  39. }
  40. return rc;
  41. }
  42. bool sde_evtlog_is_enabled(struct sde_dbg_evtlog *evtlog, u32 flag)
  43. {
  44. return evtlog && (evtlog->enable & flag);
  45. }
  46. void sde_evtlog_log(struct sde_dbg_evtlog *evtlog, const char *name, int line,
  47. int flag, ...)
  48. {
  49. int i, val = 0;
  50. va_list args;
  51. struct sde_dbg_evtlog_log *log;
  52. u32 index;
  53. if (!evtlog || !sde_evtlog_is_enabled(evtlog, flag) ||
  54. _sde_evtlog_is_filtered_no_lock(evtlog, name))
  55. return;
  56. index = abs(atomic_inc_return(&evtlog->curr) % SDE_EVTLOG_ENTRY);
  57. log = &evtlog->logs[index];
  58. log->time = local_clock();
  59. log->name = name;
  60. log->line = line;
  61. log->data_cnt = 0;
  62. log->pid = current->pid;
  63. log->cpu = raw_smp_processor_id();
  64. va_start(args, flag);
  65. for (i = 0; i < SDE_EVTLOG_MAX_DATA; i++) {
  66. val = va_arg(args, int);
  67. if (val == SDE_EVTLOG_DATA_LIMITER)
  68. break;
  69. log->data[i] = val;
  70. }
  71. va_end(args);
  72. log->data_cnt = i;
  73. evtlog->last++;
  74. trace_sde_evtlog(name, line, log->data_cnt, log->data);
  75. }
  76. void sde_reglog_log(u8 blk_id, u32 val, u32 addr)
  77. {
  78. struct sde_dbg_reglog_log *log;
  79. struct sde_dbg_reglog *reglog = sde_dbg_base_reglog;
  80. int index;
  81. if (!reglog)
  82. return;
  83. index = abs(atomic64_inc_return(&reglog->curr) % SDE_REGLOG_ENTRY);
  84. log = &reglog->logs[index];
  85. log->blk_id = blk_id;
  86. log->val = val;
  87. log->addr = addr;
  88. log->time = local_clock();
  89. log->pid = current->pid;
  90. reglog->last++;
  91. }
  92. /* always dump the last entries which are not dumped yet */
  93. static bool _sde_evtlog_dump_calc_range(struct sde_dbg_evtlog *evtlog,
  94. bool update_last_entry, bool full_dump)
  95. {
  96. int max_entries = full_dump ? SDE_EVTLOG_ENTRY : SDE_EVTLOG_PRINT_ENTRY;
  97. if (!evtlog)
  98. return false;
  99. evtlog->first = evtlog->next;
  100. if (update_last_entry)
  101. evtlog->last_dump = evtlog->last;
  102. if (evtlog->last_dump == evtlog->first)
  103. return false;
  104. if (evtlog->last_dump < evtlog->first) {
  105. evtlog->first %= SDE_EVTLOG_ENTRY;
  106. if (evtlog->last_dump < evtlog->first)
  107. evtlog->last_dump += SDE_EVTLOG_ENTRY;
  108. }
  109. if ((evtlog->last_dump - evtlog->first) > max_entries) {
  110. pr_info("evtlog skipping %d entries, last=%d\n",
  111. evtlog->last_dump - evtlog->first -
  112. max_entries, evtlog->last_dump - 1);
  113. evtlog->first = evtlog->last_dump - max_entries;
  114. }
  115. evtlog->next = evtlog->first + 1;
  116. return true;
  117. }
  118. ssize_t sde_evtlog_dump_to_buffer(struct sde_dbg_evtlog *evtlog,
  119. char *evtlog_buf, ssize_t evtlog_buf_size,
  120. bool update_last_entry, bool full_dump)
  121. {
  122. int i;
  123. ssize_t off = 0;
  124. struct sde_dbg_evtlog_log *log, *prev_log;
  125. unsigned long flags;
  126. if (!evtlog || !evtlog_buf)
  127. return 0;
  128. spin_lock_irqsave(&evtlog->spin_lock, flags);
  129. /* update markers, exit if nothing to print */
  130. if (!_sde_evtlog_dump_calc_range(evtlog, update_last_entry, full_dump))
  131. goto exit;
  132. log = &evtlog->logs[evtlog->first % SDE_EVTLOG_ENTRY];
  133. prev_log = &evtlog->logs[(evtlog->first - 1) % SDE_EVTLOG_ENTRY];
  134. off = snprintf((evtlog_buf + off), (evtlog_buf_size - off), "%s:%-4d",
  135. log->name, log->line);
  136. if (off < SDE_EVTLOG_BUF_ALIGN) {
  137. memset((evtlog_buf + off), 0x20, (SDE_EVTLOG_BUF_ALIGN - off));
  138. off = SDE_EVTLOG_BUF_ALIGN;
  139. }
  140. off += snprintf((evtlog_buf + off), (evtlog_buf_size - off),
  141. "=>[%-8d:%-11llu:%9llu][%-4d]:[%-4d]:", evtlog->first,
  142. log->time, (log->time - prev_log->time), log->pid, log->cpu);
  143. for (i = 0; i < log->data_cnt; i++)
  144. off += snprintf((evtlog_buf + off), (evtlog_buf_size - off),
  145. "%x ", log->data[i]);
  146. off += snprintf((evtlog_buf + off), (evtlog_buf_size - off), "\n");
  147. exit:
  148. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  149. return off;
  150. }
  151. void sde_evtlog_dump_all(struct sde_dbg_evtlog *evtlog)
  152. {
  153. char buf[SDE_EVTLOG_BUF_MAX];
  154. bool update_last_entry = true;
  155. if (!evtlog || !(evtlog->dump_mode & (SDE_DBG_DUMP_IN_LOG | SDE_DBG_DUMP_IN_LOG_LIMITED)))
  156. return;
  157. while (sde_evtlog_dump_to_buffer(evtlog, buf, sizeof(buf),
  158. update_last_entry, false)) {
  159. pr_info("%s\n", buf);
  160. update_last_entry = false;
  161. }
  162. }
  163. struct sde_dbg_evtlog *sde_evtlog_init(void)
  164. {
  165. struct sde_dbg_evtlog *evtlog;
  166. evtlog = kvzalloc(sizeof(*evtlog), GFP_KERNEL);
  167. if (!evtlog)
  168. return ERR_PTR(-ENOMEM);
  169. spin_lock_init(&evtlog->spin_lock);
  170. atomic_set(&evtlog->curr, 0);
  171. evtlog->enable = SDE_EVTLOG_DEFAULT_ENABLE;
  172. evtlog->dump_mode = SDE_DBG_DEFAULT_DUMP_MODE;
  173. INIT_LIST_HEAD(&evtlog->filter_list);
  174. return evtlog;
  175. }
  176. struct sde_dbg_reglog *sde_reglog_init(void)
  177. {
  178. struct sde_dbg_reglog *reglog;
  179. reglog = kvzalloc(sizeof(*reglog), GFP_KERNEL);
  180. if (!reglog)
  181. return ERR_PTR(-ENOMEM);
  182. atomic64_set(&reglog->curr, 0);
  183. return reglog;
  184. }
  185. int sde_evtlog_get_filter(struct sde_dbg_evtlog *evtlog, int index,
  186. char *buf, size_t bufsz)
  187. {
  188. struct sde_evtlog_filter *filter_node;
  189. unsigned long flags;
  190. int rc = -EFAULT;
  191. if (!evtlog || !buf || !bufsz || index < 0)
  192. return -EINVAL;
  193. spin_lock_irqsave(&evtlog->spin_lock, flags);
  194. list_for_each_entry(filter_node, &evtlog->filter_list, list) {
  195. if (index--)
  196. continue;
  197. /* don't care about return value */
  198. (void)strlcpy(buf, filter_node->filter, bufsz);
  199. rc = 0;
  200. break;
  201. }
  202. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  203. return rc;
  204. }
  205. void sde_evtlog_set_filter(struct sde_dbg_evtlog *evtlog, char *filter)
  206. {
  207. struct sde_evtlog_filter *filter_node, *tmp;
  208. struct list_head free_list;
  209. unsigned long flags;
  210. char *flt;
  211. if (!evtlog)
  212. return;
  213. INIT_LIST_HEAD(&free_list);
  214. /*
  215. * Clear active filter list and cache filter_nodes locally
  216. * to reduce memory fragmentation.
  217. */
  218. spin_lock_irqsave(&evtlog->spin_lock, flags);
  219. list_for_each_entry_safe(filter_node, tmp, &evtlog->filter_list, list) {
  220. list_del_init(&filter_node->list);
  221. list_add_tail(&filter_node->list, &free_list);
  222. }
  223. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  224. /*
  225. * Parse incoming filter request string and build up a new
  226. * filter list. New filter nodes are taken from the local
  227. * free list, if available, and allocated from the system
  228. * heap once the free list is empty.
  229. */
  230. while (filter && (flt = strsep(&filter, "|\r\n\t ")) != NULL) {
  231. if (!*flt)
  232. continue;
  233. if (list_empty(&free_list)) {
  234. filter_node = kzalloc(sizeof(*filter_node), GFP_KERNEL);
  235. if (!filter_node)
  236. break;
  237. INIT_LIST_HEAD(&filter_node->list);
  238. } else {
  239. filter_node = list_first_entry(&free_list,
  240. struct sde_evtlog_filter, list);
  241. list_del_init(&filter_node->list);
  242. }
  243. /* don't care if copy truncated */
  244. (void)strlcpy(filter_node->filter, flt,
  245. SDE_EVTLOG_FILTER_STRSIZE);
  246. spin_lock_irqsave(&evtlog->spin_lock, flags);
  247. list_add_tail(&filter_node->list, &evtlog->filter_list);
  248. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  249. }
  250. /*
  251. * Free any unused filter_nodes back to the system.
  252. */
  253. list_for_each_entry_safe(filter_node, tmp, &free_list, list) {
  254. list_del(&filter_node->list);
  255. kfree(filter_node);
  256. }
  257. }
  258. void sde_evtlog_destroy(struct sde_dbg_evtlog *evtlog)
  259. {
  260. struct sde_evtlog_filter *filter_node, *tmp;
  261. if (!evtlog)
  262. return;
  263. list_for_each_entry_safe(filter_node, tmp, &evtlog->filter_list, list) {
  264. list_del(&filter_node->list);
  265. kfree(filter_node);
  266. }
  267. kvfree(evtlog);
  268. }
  269. void sde_reglog_destroy(struct sde_dbg_reglog *reglog)
  270. {
  271. if (!reglog)
  272. return;
  273. kvfree(reglog);
  274. }