sde_dbg_evtlog.c 8.4 KB

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