1 /* 2 * Sync File validation framework and debug information 3 * 4 * Copyright (C) 2012 Google, Inc. 5 * 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. 9 * 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. 14 * 15 */ 16 17 #include <linux/debugfs.h> 18 #include "sync_debug.h" 19 20 static struct dentry *dbgfs; 21 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); 26 27 void sync_timeline_debug_add(struct sync_timeline *obj) 28 { 29 unsigned long flags; 30 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); 34 } 35 36 void sync_timeline_debug_remove(struct sync_timeline *obj) 37 { 38 unsigned long flags; 39 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); 43 } 44 45 void sync_file_debug_add(struct sync_file *sync_file) 46 { 47 unsigned long flags; 48 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); 52 } 53 54 void sync_file_debug_remove(struct sync_file *sync_file) 55 { 56 unsigned long flags; 57 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); 61 } 62 63 static const char *sync_status_str(int status) 64 { 65 if (status == 0) 66 return "signaled"; 67 68 if (status > 0) 69 return "active"; 70 71 return "error"; 72 } 73 74 static void sync_print_fence(struct seq_file *s, struct fence *fence, bool show) 75 { 76 int status = 1; 77 struct sync_timeline *parent = fence_parent(fence); 78 79 if (fence_is_signaled_locked(fence)) 80 status = fence->status; 81 82 seq_printf(s, " %s%sfence %s", 83 show ? parent->name : "", 84 show ? "_" : "", 85 sync_status_str(status)); 86 87 if (status <= 0) { 88 struct timespec64 ts64 = 89 ktime_to_timespec64(fence->timestamp); 90 91 seq_printf(s, "@%lld.%09ld", (s64)ts64.tv_sec, ts64.tv_nsec); 92 } 93 94 if (fence->ops->timeline_value_str && 95 fence->ops->fence_value_str) { 96 char value[64]; 97 bool success; 98 99 fence->ops->fence_value_str(fence, value, sizeof(value)); 100 success = strlen(value); 101 102 if (success) { 103 seq_printf(s, ": %s", value); 104 105 fence->ops->timeline_value_str(fence, value, 106 sizeof(value)); 107 108 if (strlen(value)) 109 seq_printf(s, " / %s", value); 110 } 111 } 112 113 seq_puts(s, "\n"); 114 } 115 116 static void sync_print_obj(struct seq_file *s, struct sync_timeline *obj) 117 { 118 struct list_head *pos; 119 unsigned long flags; 120 121 seq_printf(s, "%s: %d\n", obj->name, obj->value); 122 123 spin_lock_irqsave(&obj->child_list_lock, flags); 124 list_for_each(pos, &obj->child_list_head) { 125 struct sync_pt *pt = 126 container_of(pos, struct sync_pt, child_list); 127 sync_print_fence(s, &pt->base, false); 128 } 129 spin_unlock_irqrestore(&obj->child_list_lock, flags); 130 } 131 132 static void sync_print_sync_file(struct seq_file *s, 133 struct sync_file *sync_file) 134 { 135 int i; 136 137 seq_printf(s, "[%p] %s: %s\n", sync_file, sync_file->name, 138 sync_status_str(!fence_is_signaled(sync_file->fence))); 139 140 if (fence_is_array(sync_file->fence)) { 141 struct fence_array *array = to_fence_array(sync_file->fence); 142 143 for (i = 0; i < array->num_fences; ++i) 144 sync_print_fence(s, array->fences[i], true); 145 } else { 146 sync_print_fence(s, sync_file->fence, true); 147 } 148 } 149 150 static int sync_debugfs_show(struct seq_file *s, void *unused) 151 { 152 unsigned long flags; 153 struct list_head *pos; 154 155 seq_puts(s, "objs:\n--------------\n"); 156 157 spin_lock_irqsave(&sync_timeline_list_lock, flags); 158 list_for_each(pos, &sync_timeline_list_head) { 159 struct sync_timeline *obj = 160 container_of(pos, struct sync_timeline, 161 sync_timeline_list); 162 163 sync_print_obj(s, obj); 164 seq_puts(s, "\n"); 165 } 166 spin_unlock_irqrestore(&sync_timeline_list_lock, flags); 167 168 seq_puts(s, "fences:\n--------------\n"); 169 170 spin_lock_irqsave(&sync_file_list_lock, flags); 171 list_for_each(pos, &sync_file_list_head) { 172 struct sync_file *sync_file = 173 container_of(pos, struct sync_file, sync_file_list); 174 175 sync_print_sync_file(s, sync_file); 176 seq_puts(s, "\n"); 177 } 178 spin_unlock_irqrestore(&sync_file_list_lock, flags); 179 return 0; 180 } 181 182 static int sync_info_debugfs_open(struct inode *inode, struct file *file) 183 { 184 return single_open(file, sync_debugfs_show, inode->i_private); 185 } 186 187 static const struct file_operations sync_info_debugfs_fops = { 188 .open = sync_info_debugfs_open, 189 .read = seq_read, 190 .llseek = seq_lseek, 191 .release = single_release, 192 }; 193 194 static __init int sync_debugfs_init(void) 195 { 196 dbgfs = debugfs_create_dir("sync", NULL); 197 198 /* 199 * The debugfs files won't ever get removed and thus, there is 200 * no need to protect it against removal races. The use of 201 * debugfs_create_file_unsafe() is actually safe here. 202 */ 203 debugfs_create_file_unsafe("info", 0444, dbgfs, NULL, 204 &sync_info_debugfs_fops); 205 debugfs_create_file_unsafe("sw_sync", 0644, dbgfs, NULL, 206 &sw_sync_debugfs_fops); 207 208 return 0; 209 } 210 late_initcall(sync_debugfs_init); 211 212 #define DUMP_CHUNK 256 213 static char sync_dump_buf[64 * 1024]; 214 void sync_dump(void) 215 { 216 struct seq_file s = { 217 .buf = sync_dump_buf, 218 .size = sizeof(sync_dump_buf) - 1, 219 }; 220 int i; 221 222 sync_debugfs_show(&s, NULL); 223 224 for (i = 0; i < s.count; i += DUMP_CHUNK) { 225 if ((s.count - i) > DUMP_CHUNK) { 226 char c = s.buf[i + DUMP_CHUNK]; 227 228 s.buf[i + DUMP_CHUNK] = 0; 229 pr_cont("%s", s.buf + i); 230 s.buf[i + DUMP_CHUNK] = c; 231 } else { 232 s.buf[s.count] = 0; 233 pr_cont("%s", s.buf + i); 234 } 235 } 236 } 237