sde_dbg_evtlog.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (c) 2016-2020, 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. unsigned long flags;
  50. int i, val = 0;
  51. va_list args;
  52. struct sde_dbg_evtlog_log *log;
  53. if (!evtlog)
  54. return;
  55. if (!sde_evtlog_is_enabled(evtlog, flag))
  56. return;
  57. spin_lock_irqsave(&evtlog->spin_lock, flags);
  58. if (_sde_evtlog_is_filtered_no_lock(evtlog, name))
  59. goto exit;
  60. log = &evtlog->logs[evtlog->curr];
  61. log->time = local_clock();
  62. log->name = name;
  63. log->line = line;
  64. log->data_cnt = 0;
  65. log->pid = current->pid;
  66. log->cpu = raw_smp_processor_id();
  67. va_start(args, flag);
  68. for (i = 0; i < SDE_EVTLOG_MAX_DATA; i++) {
  69. val = va_arg(args, int);
  70. if (val == SDE_EVTLOG_DATA_LIMITER)
  71. break;
  72. log->data[i] = val;
  73. }
  74. va_end(args);
  75. log->data_cnt = i;
  76. evtlog->curr = (evtlog->curr + 1) % SDE_EVTLOG_ENTRY;
  77. evtlog->last++;
  78. trace_sde_evtlog(name, line, log->data_cnt, log->data);
  79. exit:
  80. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  81. }
  82. /* always dump the last entries which are not dumped yet */
  83. static bool _sde_evtlog_dump_calc_range(struct sde_dbg_evtlog *evtlog,
  84. bool update_last_entry, bool full_dump)
  85. {
  86. int max_entries = full_dump ? SDE_EVTLOG_ENTRY : SDE_EVTLOG_PRINT_ENTRY;
  87. if (!evtlog)
  88. return false;
  89. evtlog->first = evtlog->next;
  90. if (update_last_entry)
  91. evtlog->last_dump = evtlog->last;
  92. if (evtlog->last_dump == evtlog->first)
  93. return false;
  94. if (evtlog->last_dump < evtlog->first) {
  95. evtlog->first %= SDE_EVTLOG_ENTRY;
  96. if (evtlog->last_dump < evtlog->first)
  97. evtlog->last_dump += SDE_EVTLOG_ENTRY;
  98. }
  99. if ((evtlog->last_dump - evtlog->first) > max_entries) {
  100. pr_info("evtlog skipping %d entries, last=%d\n",
  101. evtlog->last_dump - evtlog->first -
  102. max_entries, evtlog->last_dump - 1);
  103. evtlog->first = evtlog->last_dump - max_entries;
  104. }
  105. evtlog->next = evtlog->first + 1;
  106. return true;
  107. }
  108. ssize_t sde_evtlog_dump_to_buffer(struct sde_dbg_evtlog *evtlog,
  109. char *evtlog_buf, ssize_t evtlog_buf_size,
  110. bool update_last_entry, bool full_dump)
  111. {
  112. int i;
  113. ssize_t off = 0;
  114. struct sde_dbg_evtlog_log *log, *prev_log;
  115. unsigned long flags;
  116. if (!evtlog || !evtlog_buf)
  117. return 0;
  118. spin_lock_irqsave(&evtlog->spin_lock, flags);
  119. /* update markers, exit if nothing to print */
  120. if (!_sde_evtlog_dump_calc_range(evtlog, update_last_entry, full_dump))
  121. goto exit;
  122. log = &evtlog->logs[evtlog->first % SDE_EVTLOG_ENTRY];
  123. prev_log = &evtlog->logs[(evtlog->first - 1) % SDE_EVTLOG_ENTRY];
  124. off = snprintf((evtlog_buf + off), (evtlog_buf_size - off), "%s:%-4d",
  125. log->name, log->line);
  126. if (off < SDE_EVTLOG_BUF_ALIGN) {
  127. memset((evtlog_buf + off), 0x20, (SDE_EVTLOG_BUF_ALIGN - off));
  128. off = SDE_EVTLOG_BUF_ALIGN;
  129. }
  130. off += snprintf((evtlog_buf + off), (evtlog_buf_size - off),
  131. "=>[%-8d:%-11llu:%9llu][%-4d]:[%-4d]:", evtlog->first,
  132. log->time, (log->time - prev_log->time), log->pid, log->cpu);
  133. for (i = 0; i < log->data_cnt; i++)
  134. off += snprintf((evtlog_buf + off), (evtlog_buf_size - off),
  135. "%x ", log->data[i]);
  136. off += snprintf((evtlog_buf + off), (evtlog_buf_size - off), "\n");
  137. exit:
  138. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  139. return off;
  140. }
  141. void sde_evtlog_dump_all(struct sde_dbg_evtlog *evtlog)
  142. {
  143. char buf[SDE_EVTLOG_BUF_MAX];
  144. bool update_last_entry = true;
  145. if (!evtlog)
  146. return;
  147. while (sde_evtlog_dump_to_buffer(evtlog, buf, sizeof(buf),
  148. update_last_entry, false)) {
  149. pr_info("%s\n", buf);
  150. update_last_entry = false;
  151. }
  152. }
  153. struct sde_dbg_evtlog *sde_evtlog_init(void)
  154. {
  155. struct sde_dbg_evtlog *evtlog;
  156. evtlog = kzalloc(sizeof(*evtlog), GFP_KERNEL);
  157. if (!evtlog)
  158. return ERR_PTR(-ENOMEM);
  159. spin_lock_init(&evtlog->spin_lock);
  160. evtlog->enable = SDE_EVTLOG_DEFAULT_ENABLE;
  161. INIT_LIST_HEAD(&evtlog->filter_list);
  162. return evtlog;
  163. }
  164. int sde_evtlog_get_filter(struct sde_dbg_evtlog *evtlog, int index,
  165. char *buf, size_t bufsz)
  166. {
  167. struct sde_evtlog_filter *filter_node;
  168. unsigned long flags;
  169. int rc = -EFAULT;
  170. if (!evtlog || !buf || !bufsz || index < 0)
  171. return -EINVAL;
  172. spin_lock_irqsave(&evtlog->spin_lock, flags);
  173. list_for_each_entry(filter_node, &evtlog->filter_list, list) {
  174. if (index--)
  175. continue;
  176. /* don't care about return value */
  177. (void)strlcpy(buf, filter_node->filter, bufsz);
  178. rc = 0;
  179. break;
  180. }
  181. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  182. return rc;
  183. }
  184. void sde_evtlog_set_filter(struct sde_dbg_evtlog *evtlog, char *filter)
  185. {
  186. struct sde_evtlog_filter *filter_node, *tmp;
  187. struct list_head free_list;
  188. unsigned long flags;
  189. char *flt;
  190. if (!evtlog)
  191. return;
  192. INIT_LIST_HEAD(&free_list);
  193. /*
  194. * Clear active filter list and cache filter_nodes locally
  195. * to reduce memory fragmentation.
  196. */
  197. spin_lock_irqsave(&evtlog->spin_lock, flags);
  198. list_for_each_entry_safe(filter_node, tmp, &evtlog->filter_list, list) {
  199. list_del_init(&filter_node->list);
  200. list_add_tail(&filter_node->list, &free_list);
  201. }
  202. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  203. /*
  204. * Parse incoming filter request string and build up a new
  205. * filter list. New filter nodes are taken from the local
  206. * free list, if available, and allocated from the system
  207. * heap once the free list is empty.
  208. */
  209. while (filter && (flt = strsep(&filter, "|\r\n\t ")) != NULL) {
  210. if (!*flt)
  211. continue;
  212. if (list_empty(&free_list)) {
  213. filter_node = kzalloc(sizeof(*filter_node), GFP_KERNEL);
  214. if (!filter_node)
  215. break;
  216. INIT_LIST_HEAD(&filter_node->list);
  217. } else {
  218. filter_node = list_first_entry(&free_list,
  219. struct sde_evtlog_filter, list);
  220. list_del_init(&filter_node->list);
  221. }
  222. /* don't care if copy truncated */
  223. (void)strlcpy(filter_node->filter, flt,
  224. SDE_EVTLOG_FILTER_STRSIZE);
  225. spin_lock_irqsave(&evtlog->spin_lock, flags);
  226. list_add_tail(&filter_node->list, &evtlog->filter_list);
  227. spin_unlock_irqrestore(&evtlog->spin_lock, flags);
  228. }
  229. /*
  230. * Free any unused filter_nodes back to the system.
  231. */
  232. list_for_each_entry_safe(filter_node, tmp, &free_list, list) {
  233. list_del(&filter_node->list);
  234. kfree(filter_node);
  235. }
  236. }
  237. void sde_evtlog_destroy(struct sde_dbg_evtlog *evtlog)
  238. {
  239. struct sde_evtlog_filter *filter_node, *tmp;
  240. if (!evtlog)
  241. return;
  242. list_for_each_entry_safe(filter_node, tmp, &evtlog->filter_list, list) {
  243. list_del(&filter_node->list);
  244. kfree(filter_node);
  245. }
  246. kfree(evtlog);
  247. }