/* Copyright (c) 2016-2018, The Linux Foundation. All rights reserved. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 and * only version 2 as published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. */ #define pr_fmt(fmt) "sde_dbg:[%s] " fmt, __func__ #include #include #include #include #include #include #include #include "sde_dbg.h" #include "sde_trace.h" #if defined(CONFIG_DISPLAY_SAMSUNG_LEGO) #include #endif #define SDE_EVTLOG_FILTER_STRSIZE 64 struct sde_evtlog_filter { struct list_head list; char filter[SDE_EVTLOG_FILTER_STRSIZE]; }; static bool _sde_evtlog_is_filtered_no_lock( struct sde_dbg_evtlog *evtlog, const char *str) { struct sde_evtlog_filter *filter_node; size_t len; bool rc; if (!str) return true; len = strlen(str); /* * Filter the incoming string IFF the list is not empty AND * a matching entry is not in the list. */ rc = !list_empty(&evtlog->filter_list); list_for_each_entry(filter_node, &evtlog->filter_list, list) if (strnstr(str, filter_node->filter, len)) { rc = false; break; } return rc; } bool sde_evtlog_is_enabled(struct sde_dbg_evtlog *evtlog, u32 flag) { return evtlog && (evtlog->enable & flag); } void sde_evtlog_log(struct sde_dbg_evtlog *evtlog, const char *name, int line, int flag, ...) { unsigned long flags; int i, val = 0; va_list args; struct sde_dbg_evtlog_log *log; if (!evtlog) return; if (!sde_evtlog_is_enabled(evtlog, flag)) return; spin_lock_irqsave(&evtlog->spin_lock, flags); if (_sde_evtlog_is_filtered_no_lock(evtlog, name)) goto exit; log = &evtlog->logs[evtlog->curr]; log->time = ktime_to_us(ktime_get()); log->name = name; log->line = line; log->data_cnt = 0; log->pid = current->pid; va_start(args, flag); for (i = 0; i < SDE_EVTLOG_MAX_DATA; i++) { val = va_arg(args, int); if (val == SDE_EVTLOG_DATA_LIMITER) break; log->data[i] = val; } va_end(args); log->data_cnt = i; evtlog->curr = (evtlog->curr + 1) % SDE_EVTLOG_ENTRY; evtlog->last++; trace_sde_evtlog(name, line, log->data_cnt, log->data); exit: spin_unlock_irqrestore(&evtlog->spin_lock, flags); } /* always dump the last entries which are not dumped yet */ static bool _sde_evtlog_dump_calc_range(struct sde_dbg_evtlog *evtlog, bool update_last_entry, bool full_dump) { #if defined(CONFIG_DISPLAY_SAMSUNG_LEGO) int max_entries = full_dump ? SDE_EVTLOG_ENTRY : (SDE_EVTLOG_PRINT_ENTRY * 2); #else int max_entries = full_dump ? SDE_EVTLOG_ENTRY : SDE_EVTLOG_PRINT_ENTRY; #endif if (!evtlog) return false; evtlog->first = evtlog->next; if (update_last_entry) evtlog->last_dump = evtlog->last; if (evtlog->last_dump == evtlog->first) return false; if (evtlog->last_dump < evtlog->first) { evtlog->first %= SDE_EVTLOG_ENTRY; if (evtlog->last_dump < evtlog->first) evtlog->last_dump += SDE_EVTLOG_ENTRY; } if ((evtlog->last_dump - evtlog->first) > max_entries) { pr_info("evtlog skipping %d entries, last=%d\n", evtlog->last_dump - evtlog->first - max_entries, evtlog->last_dump - 1); evtlog->first = evtlog->last_dump - max_entries; } evtlog->next = evtlog->first + 1; return true; } ssize_t sde_evtlog_dump_to_buffer(struct sde_dbg_evtlog *evtlog, char *evtlog_buf, ssize_t evtlog_buf_size, bool update_last_entry, bool full_dump) { int i; ssize_t off = 0; struct sde_dbg_evtlog_log *log, *prev_log; unsigned long flags; if (!evtlog || !evtlog_buf) return 0; spin_lock_irqsave(&evtlog->spin_lock, flags); /* update markers, exit if nothing to print */ if (!_sde_evtlog_dump_calc_range(evtlog, update_last_entry, full_dump)) goto exit; log = &evtlog->logs[evtlog->first % SDE_EVTLOG_ENTRY]; prev_log = &evtlog->logs[(evtlog->first - 1) % SDE_EVTLOG_ENTRY]; off = snprintf((evtlog_buf + off), (evtlog_buf_size - off), "%s:%-4d", log->name, log->line); if (off < SDE_EVTLOG_BUF_ALIGN) { memset((evtlog_buf + off), 0x20, (SDE_EVTLOG_BUF_ALIGN - off)); off = SDE_EVTLOG_BUF_ALIGN; } off += snprintf((evtlog_buf + off), (evtlog_buf_size - off), "=>[%-8d:%-11llu:%9llu][%-4d]:", evtlog->first, log->time, (log->time - prev_log->time), log->pid); for (i = 0; i < log->data_cnt; i++) off += snprintf((evtlog_buf + off), (evtlog_buf_size - off), "%x ", log->data[i]); off += snprintf((evtlog_buf + off), (evtlog_buf_size - off), "\n"); exit: spin_unlock_irqrestore(&evtlog->spin_lock, flags); return off; } void sde_evtlog_dump_all(struct sde_dbg_evtlog *evtlog) { char buf[SDE_EVTLOG_BUF_MAX]; bool update_last_entry = true; if (!evtlog) return; while (sde_evtlog_dump_to_buffer(evtlog, buf, sizeof(buf), update_last_entry, false)) { pr_info("%s", buf); update_last_entry = false; } } struct sde_dbg_evtlog *sde_evtlog_init(void) { struct sde_dbg_evtlog *evtlog; evtlog = kzalloc(sizeof(*evtlog), GFP_KERNEL); if (!evtlog) return ERR_PTR(-ENOMEM); spin_lock_init(&evtlog->spin_lock); evtlog->enable = SDE_EVTLOG_DEFAULT_ENABLE; INIT_LIST_HEAD(&evtlog->filter_list); return evtlog; } int sde_evtlog_get_filter(struct sde_dbg_evtlog *evtlog, int index, char *buf, size_t bufsz) { struct sde_evtlog_filter *filter_node; unsigned long flags; int rc = -EFAULT; if (!evtlog || !buf || !bufsz || index < 0) return -EINVAL; spin_lock_irqsave(&evtlog->spin_lock, flags); list_for_each_entry(filter_node, &evtlog->filter_list, list) { if (index--) continue; /* don't care about return value */ (void)strlcpy(buf, filter_node->filter, bufsz); rc = 0; break; } spin_unlock_irqrestore(&evtlog->spin_lock, flags); return rc; } void sde_evtlog_set_filter(struct sde_dbg_evtlog *evtlog, char *filter) { struct sde_evtlog_filter *filter_node, *tmp; struct list_head free_list; unsigned long flags; char *flt; if (!evtlog) return; INIT_LIST_HEAD(&free_list); /* * Clear active filter list and cache filter_nodes locally * to reduce memory fragmentation. */ spin_lock_irqsave(&evtlog->spin_lock, flags); list_for_each_entry_safe(filter_node, tmp, &evtlog->filter_list, list) { list_del_init(&filter_node->list); list_add_tail(&filter_node->list, &free_list); } spin_unlock_irqrestore(&evtlog->spin_lock, flags); /* * Parse incoming filter request string and build up a new * filter list. New filter nodes are taken from the local * free list, if available, and allocated from the system * heap once the free list is empty. */ while (filter && (flt = strsep(&filter, "|\r\n\t ")) != NULL) { if (!*flt) continue; if (list_empty(&free_list)) { filter_node = kzalloc(sizeof(*filter_node), GFP_KERNEL); if (!filter_node) break; INIT_LIST_HEAD(&filter_node->list); } else { filter_node = list_first_entry(&free_list, struct sde_evtlog_filter, list); list_del_init(&filter_node->list); } /* don't care if copy truncated */ (void)strlcpy(filter_node->filter, flt, SDE_EVTLOG_FILTER_STRSIZE); spin_lock_irqsave(&evtlog->spin_lock, flags); list_add_tail(&filter_node->list, &evtlog->filter_list); spin_unlock_irqrestore(&evtlog->spin_lock, flags); } /* * Free any unused filter_nodes back to the system. */ list_for_each_entry_safe(filter_node, tmp, &free_list, list) { list_del(&filter_node->list); kfree(filter_node); } } void sde_evtlog_destroy(struct sde_dbg_evtlog *evtlog) { struct sde_evtlog_filter *filter_node, *tmp; if (!evtlog) return; list_for_each_entry_safe(filter_node, tmp, &evtlog->filter_list, list) { list_del(&filter_node->list); kfree(filter_node); } kfree(evtlog); }