4 * Copyright (C) 2012 Google, Inc.
6 * This software is licensed under the terms of the GNU General Public
7 * License version 2, as published by the Free Software Foundation, and
8 * may be copied, distributed, and modified under those terms.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
17 #include <linux/debugfs.h>
18 #include <linux/export.h>
19 #include <linux/file.h>
21 #include <linux/kernel.h>
22 #include <linux/poll.h>
23 #include <linux/sched.h>
24 #include <linux/seq_file.h>
25 #include <linux/slab.h>
26 #include <linux/uaccess.h>
27 #include <linux/anon_inodes.h>
30 #ifdef CONFIG_DEBUG_FS
32 static LIST_HEAD(sync_timeline_list_head);
33 static DEFINE_SPINLOCK(sync_timeline_list_lock);
34 static LIST_HEAD(sync_fence_list_head);
35 static DEFINE_SPINLOCK(sync_fence_list_lock);
37 void sync_timeline_debug_add(struct sync_timeline *obj)
41 spin_lock_irqsave(&sync_timeline_list_lock, flags);
42 list_add_tail(&obj->sync_timeline_list, &sync_timeline_list_head);
43 spin_unlock_irqrestore(&sync_timeline_list_lock, flags);
46 void sync_timeline_debug_remove(struct sync_timeline *obj)
50 spin_lock_irqsave(&sync_timeline_list_lock, flags);
51 list_del(&obj->sync_timeline_list);
52 spin_unlock_irqrestore(&sync_timeline_list_lock, flags);
55 void sync_fence_debug_add(struct sync_fence *fence)
59 spin_lock_irqsave(&sync_fence_list_lock, flags);
60 list_add_tail(&fence->sync_fence_list, &sync_fence_list_head);
61 spin_unlock_irqrestore(&sync_fence_list_lock, flags);
64 void sync_fence_debug_remove(struct sync_fence *fence)
68 spin_lock_irqsave(&sync_fence_list_lock, flags);
69 list_del(&fence->sync_fence_list);
70 spin_unlock_irqrestore(&sync_fence_list_lock, flags);
73 static const char *sync_status_str(int status)
84 static void sync_print_pt(struct seq_file *s, struct sync_pt *pt, bool fence)
87 struct sync_timeline *parent = sync_pt_parent(pt);
89 if (fence_is_signaled_locked(&pt->base))
90 status = pt->base.status;
92 seq_printf(s, " %s%spt %s",
93 fence ? parent->name : "",
95 sync_status_str(status));
98 struct timeval tv = ktime_to_timeval(pt->base.timestamp);
100 seq_printf(s, "@%ld.%06ld", tv.tv_sec, tv.tv_usec);
103 if (parent->ops->timeline_value_str &&
104 parent->ops->pt_value_str) {
107 parent->ops->pt_value_str(pt, value, sizeof(value));
108 seq_printf(s, ": %s", value);
110 parent->ops->timeline_value_str(parent, value,
112 seq_printf(s, " / %s", value);
119 static void sync_print_obj(struct seq_file *s, struct sync_timeline *obj)
121 struct list_head *pos;
124 seq_printf(s, "%s %s", obj->name, obj->ops->driver_name);
126 if (obj->ops->timeline_value_str) {
129 obj->ops->timeline_value_str(obj, value, sizeof(value));
130 seq_printf(s, ": %s", value);
135 spin_lock_irqsave(&obj->child_list_lock, flags);
136 list_for_each(pos, &obj->child_list_head) {
138 container_of(pos, struct sync_pt, child_list);
139 sync_print_pt(s, pt, false);
141 spin_unlock_irqrestore(&obj->child_list_lock, flags);
144 static void sync_print_fence(struct seq_file *s, struct sync_fence *fence)
150 seq_printf(s, "[%p] %s: %s\n", fence, fence->name,
151 sync_status_str(atomic_read(&fence->status)));
153 for (i = 0; i < fence->num_fences; ++i) {
155 container_of(fence->cbs[i].sync_pt,
156 struct sync_pt, base);
158 sync_print_pt(s, pt, true);
161 spin_lock_irqsave(&fence->wq.lock, flags);
162 list_for_each_entry(pos, &fence->wq.task_list, task_list) {
163 struct sync_fence_waiter *waiter;
165 if (pos->func != &sync_fence_wake_up_wq)
168 waiter = container_of(pos, struct sync_fence_waiter, work);
170 seq_printf(s, "waiter %pF\n", waiter->callback);
172 spin_unlock_irqrestore(&fence->wq.lock, flags);
175 static int sync_debugfs_show(struct seq_file *s, void *unused)
178 struct list_head *pos;
180 seq_puts(s, "objs:\n--------------\n");
182 spin_lock_irqsave(&sync_timeline_list_lock, flags);
183 list_for_each(pos, &sync_timeline_list_head) {
184 struct sync_timeline *obj =
185 container_of(pos, struct sync_timeline,
188 sync_print_obj(s, obj);
191 spin_unlock_irqrestore(&sync_timeline_list_lock, flags);
193 seq_puts(s, "fences:\n--------------\n");
195 spin_lock_irqsave(&sync_fence_list_lock, flags);
196 list_for_each(pos, &sync_fence_list_head) {
197 struct sync_fence *fence =
198 container_of(pos, struct sync_fence, sync_fence_list);
200 sync_print_fence(s, fence);
203 spin_unlock_irqrestore(&sync_fence_list_lock, flags);
207 static int sync_debugfs_open(struct inode *inode, struct file *file)
209 return single_open(file, sync_debugfs_show, inode->i_private);
212 static const struct file_operations sync_debugfs_fops = {
213 .open = sync_debugfs_open,
216 .release = single_release,
219 static __init int sync_debugfs_init(void)
221 debugfs_create_file("sync", S_IRUGO, NULL, NULL, &sync_debugfs_fops);
224 late_initcall(sync_debugfs_init);
226 #define DUMP_CHUNK 256
227 static char sync_dump_buf[64 * 1024];
230 struct seq_file s = {
231 .buf = sync_dump_buf,
232 .size = sizeof(sync_dump_buf) - 1,
236 sync_debugfs_show(&s, NULL);
238 for (i = 0; i < s.count; i += DUMP_CHUNK) {
239 if ((s.count - i) > DUMP_CHUNK) {
240 char c = s.buf[i + DUMP_CHUNK];
242 s.buf[i + DUMP_CHUNK] = 0;
243 pr_cont("%s", s.buf + i);
244 s.buf[i + DUMP_CHUNK] = c;
247 pr_cont("%s", s.buf + i);