2 * Sync File validation framework and debug information
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 "sync_debug.h"
20 static struct dentry
*dbgfs
;
22 static LIST_HEAD(sync_timeline_list_head
);
23 static DEFINE_SPINLOCK(sync_timeline_list_lock
);
24 static LIST_HEAD(sync_file_list_head
);
25 static DEFINE_SPINLOCK(sync_file_list_lock
);
27 void sync_timeline_debug_add(struct sync_timeline
*obj
)
31 spin_lock_irqsave(&sync_timeline_list_lock
, flags
);
32 list_add_tail(&obj
->sync_timeline_list
, &sync_timeline_list_head
);
33 spin_unlock_irqrestore(&sync_timeline_list_lock
, flags
);
36 void sync_timeline_debug_remove(struct sync_timeline
*obj
)
40 spin_lock_irqsave(&sync_timeline_list_lock
, flags
);
41 list_del(&obj
->sync_timeline_list
);
42 spin_unlock_irqrestore(&sync_timeline_list_lock
, flags
);
45 void sync_file_debug_add(struct sync_file
*sync_file
)
49 spin_lock_irqsave(&sync_file_list_lock
, flags
);
50 list_add_tail(&sync_file
->sync_file_list
, &sync_file_list_head
);
51 spin_unlock_irqrestore(&sync_file_list_lock
, flags
);
54 void sync_file_debug_remove(struct sync_file
*sync_file
)
58 spin_lock_irqsave(&sync_file_list_lock
, flags
);
59 list_del(&sync_file
->sync_file_list
);
60 spin_unlock_irqrestore(&sync_file_list_lock
, flags
);
63 static const char *sync_status_str(int status
)
74 static void sync_print_fence(struct seq_file
*s
,
75 struct dma_fence
*fence
, bool show
)
78 struct sync_timeline
*parent
= dma_fence_parent(fence
);
80 if (dma_fence_is_signaled_locked(fence
))
81 status
= fence
->status
;
83 seq_printf(s
, " %s%sfence %s",
84 show
? parent
->name
: "",
86 sync_status_str(status
));
89 struct timespec64 ts64
=
90 ktime_to_timespec64(fence
->timestamp
);
92 seq_printf(s
, "@%lld.%09ld", (s64
)ts64
.tv_sec
, ts64
.tv_nsec
);
95 if (fence
->ops
->timeline_value_str
&&
96 fence
->ops
->fence_value_str
) {
100 fence
->ops
->fence_value_str(fence
, value
, sizeof(value
));
101 success
= strlen(value
);
104 seq_printf(s
, ": %s", value
);
106 fence
->ops
->timeline_value_str(fence
, value
,
110 seq_printf(s
, " / %s", value
);
117 static void sync_print_obj(struct seq_file
*s
, struct sync_timeline
*obj
)
119 struct list_head
*pos
;
122 seq_printf(s
, "%s: %d\n", obj
->name
, obj
->value
);
124 spin_lock_irqsave(&obj
->child_list_lock
, flags
);
125 list_for_each(pos
, &obj
->child_list_head
) {
127 container_of(pos
, struct sync_pt
, child_list
);
128 sync_print_fence(s
, &pt
->base
, false);
130 spin_unlock_irqrestore(&obj
->child_list_lock
, flags
);
133 static void sync_print_sync_file(struct seq_file
*s
,
134 struct sync_file
*sync_file
)
138 seq_printf(s
, "[%p] %s: %s\n", sync_file
, sync_file
->name
,
139 sync_status_str(!dma_fence_is_signaled(sync_file
->fence
)));
141 if (dma_fence_is_array(sync_file
->fence
)) {
142 struct dma_fence_array
*array
= to_dma_fence_array(sync_file
->fence
);
144 for (i
= 0; i
< array
->num_fences
; ++i
)
145 sync_print_fence(s
, array
->fences
[i
], true);
147 sync_print_fence(s
, sync_file
->fence
, true);
151 static int sync_debugfs_show(struct seq_file
*s
, void *unused
)
154 struct list_head
*pos
;
156 seq_puts(s
, "objs:\n--------------\n");
158 spin_lock_irqsave(&sync_timeline_list_lock
, flags
);
159 list_for_each(pos
, &sync_timeline_list_head
) {
160 struct sync_timeline
*obj
=
161 container_of(pos
, struct sync_timeline
,
164 sync_print_obj(s
, obj
);
167 spin_unlock_irqrestore(&sync_timeline_list_lock
, flags
);
169 seq_puts(s
, "fences:\n--------------\n");
171 spin_lock_irqsave(&sync_file_list_lock
, flags
);
172 list_for_each(pos
, &sync_file_list_head
) {
173 struct sync_file
*sync_file
=
174 container_of(pos
, struct sync_file
, sync_file_list
);
176 sync_print_sync_file(s
, sync_file
);
179 spin_unlock_irqrestore(&sync_file_list_lock
, flags
);
183 static int sync_info_debugfs_open(struct inode
*inode
, struct file
*file
)
185 return single_open(file
, sync_debugfs_show
, inode
->i_private
);
188 static const struct file_operations sync_info_debugfs_fops
= {
189 .open
= sync_info_debugfs_open
,
192 .release
= single_release
,
195 static __init
int sync_debugfs_init(void)
197 dbgfs
= debugfs_create_dir("sync", NULL
);
200 * The debugfs files won't ever get removed and thus, there is
201 * no need to protect it against removal races. The use of
202 * debugfs_create_file_unsafe() is actually safe here.
204 debugfs_create_file_unsafe("info", 0444, dbgfs
, NULL
,
205 &sync_info_debugfs_fops
);
206 debugfs_create_file_unsafe("sw_sync", 0644, dbgfs
, NULL
,
207 &sw_sync_debugfs_fops
);
211 late_initcall(sync_debugfs_init
);
213 #define DUMP_CHUNK 256
214 static char sync_dump_buf
[64 * 1024];
217 struct seq_file s
= {
218 .buf
= sync_dump_buf
,
219 .size
= sizeof(sync_dump_buf
) - 1,
223 sync_debugfs_show(&s
, NULL
);
225 for (i
= 0; i
< s
.count
; i
+= DUMP_CHUNK
) {
226 if ((s
.count
- i
) > DUMP_CHUNK
) {
227 char c
= s
.buf
[i
+ DUMP_CHUNK
];
229 s
.buf
[i
+ DUMP_CHUNK
] = 0;
230 pr_cont("%s", s
.buf
+ i
);
231 s
.buf
[i
+ DUMP_CHUNK
] = c
;
234 pr_cont("%s", s
.buf
+ i
);