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>
28 #include <linux/time64.h>
31 #ifdef CONFIG_DEBUG_FS
33 static LIST_HEAD(sync_timeline_list_head);
34 static DEFINE_SPINLOCK(sync_timeline_list_lock);
35 static LIST_HEAD(sync_fence_list_head);
36 static DEFINE_SPINLOCK(sync_fence_list_lock);
38 void sync_timeline_debug_add(struct sync_timeline *obj)
42 spin_lock_irqsave(&sync_timeline_list_lock, flags);
43 list_add_tail(&obj->sync_timeline_list, &sync_timeline_list_head);
44 spin_unlock_irqrestore(&sync_timeline_list_lock, flags);
47 void sync_timeline_debug_remove(struct sync_timeline *obj)
51 spin_lock_irqsave(&sync_timeline_list_lock, flags);
52 list_del(&obj->sync_timeline_list);
53 spin_unlock_irqrestore(&sync_timeline_list_lock, flags);
56 void sync_fence_debug_add(struct sync_fence *fence)
60 spin_lock_irqsave(&sync_fence_list_lock, flags);
61 list_add_tail(&fence->sync_fence_list, &sync_fence_list_head);
62 spin_unlock_irqrestore(&sync_fence_list_lock, flags);
65 void sync_fence_debug_remove(struct sync_fence *fence)
69 spin_lock_irqsave(&sync_fence_list_lock, flags);
70 list_del(&fence->sync_fence_list);
71 spin_unlock_irqrestore(&sync_fence_list_lock, flags);
74 static const char *sync_status_str(int status)
85 static void sync_print_pt(struct seq_file *s, struct fence *pt, bool fence)
89 if (fence_is_signaled_locked(pt))
92 seq_printf(s, " %s%spt %s",
93 fence && pt->ops->get_timeline_name ?
94 pt->ops->get_timeline_name(pt) : "",
96 sync_status_str(status));
99 struct timespec64 ts64 =
100 ktime_to_timespec64(pt->timestamp);
102 seq_printf(s, "@%lld.%09ld", (s64)ts64.tv_sec, ts64.tv_nsec);
105 if ((!fence || pt->ops->timeline_value_str) &&
106 pt->ops->fence_value_str) {
110 pt->ops->fence_value_str(pt, value, sizeof(value));
111 success = strlen(value);
114 seq_printf(s, ": %s", value);
116 if (success && fence) {
117 pt->ops->timeline_value_str(pt, value, sizeof(value));
120 seq_printf(s, " / %s", value);
127 static void sync_print_obj(struct seq_file *s, struct sync_timeline *obj)
129 struct list_head *pos;
132 seq_printf(s, "%s %s", obj->name, obj->ops->driver_name);
134 if (obj->ops->timeline_value_str) {
137 obj->ops->timeline_value_str(obj, value, sizeof(value));
138 seq_printf(s, ": %s", value);
143 spin_lock_irqsave(&obj->child_list_lock, flags);
144 list_for_each(pos, &obj->child_list_head) {
146 container_of(pos, struct sync_pt, child_list);
147 sync_print_pt(s, &pt->base, false);
149 spin_unlock_irqrestore(&obj->child_list_lock, flags);
152 static void sync_print_fence(struct seq_file *s, struct sync_fence *fence)
158 seq_printf(s, "[%p] %s: %s\n", fence, fence->name,
159 sync_status_str(atomic_read(&fence->status)));
161 for (i = 0; i < fence->num_fences; ++i) {
162 sync_print_pt(s, fence->cbs[i].sync_pt, true);
165 spin_lock_irqsave(&fence->wq.lock, flags);
166 list_for_each_entry(pos, &fence->wq.task_list, task_list) {
167 struct sync_fence_waiter *waiter;
169 if (pos->func != &sync_fence_wake_up_wq)
172 waiter = container_of(pos, struct sync_fence_waiter, work);
174 seq_printf(s, "waiter %pF\n", waiter->callback);
176 spin_unlock_irqrestore(&fence->wq.lock, flags);
179 static int sync_debugfs_show(struct seq_file *s, void *unused)
182 struct list_head *pos;
184 seq_puts(s, "objs:\n--------------\n");
186 spin_lock_irqsave(&sync_timeline_list_lock, flags);
187 list_for_each(pos, &sync_timeline_list_head) {
188 struct sync_timeline *obj =
189 container_of(pos, struct sync_timeline,
192 sync_print_obj(s, obj);
195 spin_unlock_irqrestore(&sync_timeline_list_lock, flags);
197 seq_puts(s, "fences:\n--------------\n");
199 spin_lock_irqsave(&sync_fence_list_lock, flags);
200 list_for_each(pos, &sync_fence_list_head) {
201 struct sync_fence *fence =
202 container_of(pos, struct sync_fence, sync_fence_list);
204 sync_print_fence(s, fence);
207 spin_unlock_irqrestore(&sync_fence_list_lock, flags);
211 static int sync_debugfs_open(struct inode *inode, struct file *file)
213 return single_open(file, sync_debugfs_show, inode->i_private);
216 static const struct file_operations sync_debugfs_fops = {
217 .open = sync_debugfs_open,
220 .release = single_release,
223 static __init int sync_debugfs_init(void)
225 debugfs_create_file("sync", S_IRUGO, NULL, NULL, &sync_debugfs_fops);
228 late_initcall(sync_debugfs_init);
230 #define DUMP_CHUNK 256
231 static char sync_dump_buf[64 * 1024];
234 struct seq_file s = {
235 .buf = sync_dump_buf,
236 .size = sizeof(sync_dump_buf) - 1,
240 sync_debugfs_show(&s, NULL);
242 for (i = 0; i < s.count; i += DUMP_CHUNK) {
243 if ((s.count - i) > DUMP_CHUNK) {
244 char c = s.buf[i + DUMP_CHUNK];
246 s.buf[i + DUMP_CHUNK] = 0;
247 pr_cont("%s", s.buf + i);
248 s.buf[i + DUMP_CHUNK] = c;
251 pr_cont("%s", s.buf + i);