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 fence
*fence
, bool show
)
77 struct sync_timeline
*parent
= fence_parent(fence
);
80 status
= fence_get_status_locked(fence
);
82 seq_printf(s
, " %s%sfence %s",
83 show
? parent
->name
: "",
85 sync_status_str(status
));
88 struct timespec64 ts64
=
89 ktime_to_timespec64(fence
->timestamp
);
91 seq_printf(s
, "@%lld.%09ld", (s64
)ts64
.tv_sec
, ts64
.tv_nsec
);
94 if (fence
->ops
->timeline_value_str
&&
95 fence
->ops
->fence_value_str
) {
99 fence
->ops
->fence_value_str(fence
, value
, sizeof(value
));
100 success
= strlen(value
);
103 seq_printf(s
, ": %s", value
);
105 fence
->ops
->timeline_value_str(fence
, value
,
109 seq_printf(s
, " / %s", value
);
116 static void sync_print_obj(struct seq_file
*s
, struct sync_timeline
*obj
)
118 struct list_head
*pos
;
120 seq_printf(s
, "%s: %d\n", obj
->name
, obj
->value
);
122 spin_lock_irq(&obj
->lock
);
123 list_for_each(pos
, &obj
->pt_list
) {
124 struct sync_pt
*pt
= container_of(pos
, struct sync_pt
, link
);
125 sync_print_fence(s
, &pt
->base
, false);
127 spin_unlock_irq(&obj
->lock
);
130 static void sync_print_sync_file(struct seq_file
*s
,
131 struct sync_file
*sync_file
)
135 seq_printf(s
, "[%p] %s: %s\n", sync_file
, sync_file
->name
,
136 sync_status_str(fence_get_status(sync_file
->fence
)));
138 if (fence_is_array(sync_file
->fence
)) {
139 struct fence_array
*array
= to_fence_array(sync_file
->fence
);
141 for (i
= 0; i
< array
->num_fences
; ++i
)
142 sync_print_fence(s
, array
->fences
[i
], true);
144 sync_print_fence(s
, sync_file
->fence
, true);
148 static int sync_debugfs_show(struct seq_file
*s
, void *unused
)
150 struct list_head
*pos
;
152 seq_puts(s
, "objs:\n--------------\n");
154 spin_lock_irq(&sync_timeline_list_lock
);
155 list_for_each(pos
, &sync_timeline_list_head
) {
156 struct sync_timeline
*obj
=
157 container_of(pos
, struct sync_timeline
,
160 sync_print_obj(s
, obj
);
163 spin_unlock_irq(&sync_timeline_list_lock
);
165 seq_puts(s
, "fences:\n--------------\n");
167 spin_lock_irq(&sync_file_list_lock
);
168 list_for_each(pos
, &sync_file_list_head
) {
169 struct sync_file
*sync_file
=
170 container_of(pos
, struct sync_file
, sync_file_list
);
172 sync_print_sync_file(s
, sync_file
);
175 spin_unlock_irq(&sync_file_list_lock
);
179 static int sync_info_debugfs_open(struct inode
*inode
, struct file
*file
)
181 return single_open(file
, sync_debugfs_show
, inode
->i_private
);
184 static const struct file_operations sync_info_debugfs_fops
= {
185 .open
= sync_info_debugfs_open
,
188 .release
= single_release
,
191 static __init
int sync_debugfs_init(void)
193 dbgfs
= debugfs_create_dir("sync", NULL
);
196 * The debugfs files won't ever get removed and thus, there is
197 * no need to protect it against removal races. The use of
198 * debugfs_create_file_unsafe() is actually safe here.
200 debugfs_create_file_unsafe("info", 0444, dbgfs
, NULL
,
201 &sync_info_debugfs_fops
);
202 debugfs_create_file_unsafe("sw_sync", 0644, dbgfs
, NULL
,
203 &sw_sync_debugfs_fops
);
207 late_initcall(sync_debugfs_init
);
209 #define DUMP_CHUNK 256
210 static char sync_dump_buf
[64 * 1024];
213 struct seq_file s
= {
214 .buf
= sync_dump_buf
,
215 .size
= sizeof(sync_dump_buf
) - 1,
219 sync_debugfs_show(&s
, NULL
);
221 for (i
= 0; i
< s
.count
; i
+= DUMP_CHUNK
) {
222 if ((s
.count
- i
) > DUMP_CHUNK
) {
223 char c
= s
.buf
[i
+ DUMP_CHUNK
];
225 s
.buf
[i
+ DUMP_CHUNK
] = 0;
226 pr_cont("%s", s
.buf
+ i
);
227 s
.buf
[i
+ DUMP_CHUNK
] = c
;
230 pr_cont("%s", s
.buf
+ i
);