sw_sync.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421
  1. /*
  2. * Sync File validation framework
  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. #include <linux/file.h>
  17. #include <linux/fs.h>
  18. #include <linux/uaccess.h>
  19. #include <linux/slab.h>
  20. #include <linux/sync_file.h>
  21. #include "sync_debug.h"
  22. #define CREATE_TRACE_POINTS
  23. #include "sync_trace.h"
  24. /*
  25. * SW SYNC validation framework
  26. *
  27. * A sync object driver that uses a 32bit counter to coordinate
  28. * synchronization. Useful when there is no hardware primitive backing
  29. * the synchronization.
  30. *
  31. * To start the framework just open:
  32. *
  33. * <debugfs>/sync/sw_sync
  34. *
  35. * That will create a sync timeline, all fences created under this timeline
  36. * file descriptor will belong to the this timeline.
  37. *
  38. * The 'sw_sync' file can be opened many times as to create different
  39. * timelines.
  40. *
  41. * Fences can be created with SW_SYNC_IOC_CREATE_FENCE ioctl with struct
  42. * sw_sync_create_fence_data as parameter.
  43. *
  44. * To increment the timeline counter, SW_SYNC_IOC_INC ioctl should be used
  45. * with the increment as u32. This will update the last signaled value
  46. * from the timeline and signal any fence that has a seqno smaller or equal
  47. * to it.
  48. *
  49. * struct sw_sync_create_fence_data
  50. * @value: the seqno to initialise the fence with
  51. * @name: the name of the new sync point
  52. * @fence: return the fd of the new sync_file with the created fence
  53. */
  54. struct sw_sync_create_fence_data {
  55. __u32 value;
  56. char name[32];
  57. __s32 fence; /* fd of new fence */
  58. };
  59. #define SW_SYNC_IOC_MAGIC 'W'
  60. #define SW_SYNC_IOC_CREATE_FENCE _IOWR(SW_SYNC_IOC_MAGIC, 0,\
  61. struct sw_sync_create_fence_data)
  62. #define SW_SYNC_IOC_INC _IOW(SW_SYNC_IOC_MAGIC, 1, __u32)
  63. static const struct dma_fence_ops timeline_fence_ops;
  64. static inline struct sync_pt *dma_fence_to_sync_pt(struct dma_fence *fence)
  65. {
  66. if (fence->ops != &timeline_fence_ops)
  67. return NULL;
  68. return container_of(fence, struct sync_pt, base);
  69. }
  70. /**
  71. * sync_timeline_create() - creates a sync object
  72. * @name: sync_timeline name
  73. *
  74. * Creates a new sync_timeline. Returns the sync_timeline object or NULL in
  75. * case of error.
  76. */
  77. static struct sync_timeline *sync_timeline_create(const char *name)
  78. {
  79. struct sync_timeline *obj;
  80. obj = kzalloc(sizeof(*obj), GFP_KERNEL);
  81. if (!obj)
  82. return NULL;
  83. kref_init(&obj->kref);
  84. obj->context = dma_fence_context_alloc(1);
  85. strlcpy(obj->name, name, sizeof(obj->name));
  86. obj->pt_tree = RB_ROOT;
  87. INIT_LIST_HEAD(&obj->pt_list);
  88. spin_lock_init(&obj->lock);
  89. sync_timeline_debug_add(obj);
  90. return obj;
  91. }
  92. static void sync_timeline_free(struct kref *kref)
  93. {
  94. struct sync_timeline *obj =
  95. container_of(kref, struct sync_timeline, kref);
  96. sync_timeline_debug_remove(obj);
  97. kfree(obj);
  98. }
  99. static void sync_timeline_get(struct sync_timeline *obj)
  100. {
  101. kref_get(&obj->kref);
  102. }
  103. static void sync_timeline_put(struct sync_timeline *obj)
  104. {
  105. kref_put(&obj->kref, sync_timeline_free);
  106. }
  107. static const char *timeline_fence_get_driver_name(struct dma_fence *fence)
  108. {
  109. return "sw_sync";
  110. }
  111. static const char *timeline_fence_get_timeline_name(struct dma_fence *fence)
  112. {
  113. struct sync_timeline *parent = dma_fence_parent(fence);
  114. return parent->name;
  115. }
  116. static void timeline_fence_release(struct dma_fence *fence)
  117. {
  118. struct sync_pt *pt = dma_fence_to_sync_pt(fence);
  119. struct sync_timeline *parent = dma_fence_parent(fence);
  120. unsigned long flags;
  121. spin_lock_irqsave(fence->lock, flags);
  122. if (!list_empty(&pt->link)) {
  123. list_del(&pt->link);
  124. rb_erase(&pt->node, &parent->pt_tree);
  125. }
  126. spin_unlock_irqrestore(fence->lock, flags);
  127. sync_timeline_put(parent);
  128. dma_fence_free(fence);
  129. }
  130. static bool timeline_fence_signaled(struct dma_fence *fence)
  131. {
  132. struct sync_timeline *parent = dma_fence_parent(fence);
  133. return !__dma_fence_is_later(fence->seqno, parent->value);
  134. }
  135. static bool timeline_fence_enable_signaling(struct dma_fence *fence)
  136. {
  137. return true;
  138. }
  139. static void timeline_fence_value_str(struct dma_fence *fence,
  140. char *str, int size)
  141. {
  142. snprintf(str, size, "%d", fence->seqno);
  143. }
  144. static void timeline_fence_timeline_value_str(struct dma_fence *fence,
  145. char *str, int size)
  146. {
  147. struct sync_timeline *parent = dma_fence_parent(fence);
  148. snprintf(str, size, "%d", parent->value);
  149. }
  150. static const struct dma_fence_ops timeline_fence_ops = {
  151. .get_driver_name = timeline_fence_get_driver_name,
  152. .get_timeline_name = timeline_fence_get_timeline_name,
  153. .enable_signaling = timeline_fence_enable_signaling,
  154. .signaled = timeline_fence_signaled,
  155. .release = timeline_fence_release,
  156. .fence_value_str = timeline_fence_value_str,
  157. .timeline_value_str = timeline_fence_timeline_value_str,
  158. };
  159. /**
  160. * sync_timeline_signal() - signal a status change on a sync_timeline
  161. * @obj: sync_timeline to signal
  162. * @inc: num to increment on timeline->value
  163. *
  164. * A sync implementation should call this any time one of it's fences
  165. * has signaled or has an error condition.
  166. */
  167. static void sync_timeline_signal(struct sync_timeline *obj, unsigned int inc)
  168. {
  169. struct sync_pt *pt, *next;
  170. trace_sync_timeline(obj);
  171. spin_lock_irq(&obj->lock);
  172. obj->value += inc;
  173. list_for_each_entry_safe(pt, next, &obj->pt_list, link) {
  174. if (!timeline_fence_signaled(&pt->base))
  175. break;
  176. list_del_init(&pt->link);
  177. rb_erase(&pt->node, &obj->pt_tree);
  178. /*
  179. * A signal callback may release the last reference to this
  180. * fence, causing it to be freed. That operation has to be
  181. * last to avoid a use after free inside this loop, and must
  182. * be after we remove the fence from the timeline in order to
  183. * prevent deadlocking on timeline->lock inside
  184. * timeline_fence_release().
  185. */
  186. dma_fence_signal_locked(&pt->base);
  187. }
  188. spin_unlock_irq(&obj->lock);
  189. }
  190. /**
  191. * sync_pt_create() - creates a sync pt
  192. * @obj: parent sync_timeline
  193. * @value: value of the fence
  194. *
  195. * Creates a new sync_pt (fence) as a child of @parent. @size bytes will be
  196. * allocated allowing for implementation specific data to be kept after
  197. * the generic sync_timeline struct. Returns the sync_pt object or
  198. * NULL in case of error.
  199. */
  200. static struct sync_pt *sync_pt_create(struct sync_timeline *obj,
  201. unsigned int value)
  202. {
  203. struct sync_pt *pt;
  204. pt = kzalloc(sizeof(*pt), GFP_KERNEL);
  205. if (!pt)
  206. return NULL;
  207. sync_timeline_get(obj);
  208. dma_fence_init(&pt->base, &timeline_fence_ops, &obj->lock,
  209. obj->context, value);
  210. INIT_LIST_HEAD(&pt->link);
  211. spin_lock_irq(&obj->lock);
  212. if (!dma_fence_is_signaled_locked(&pt->base)) {
  213. struct rb_node **p = &obj->pt_tree.rb_node;
  214. struct rb_node *parent = NULL;
  215. while (*p) {
  216. struct sync_pt *other;
  217. int cmp;
  218. parent = *p;
  219. other = rb_entry(parent, typeof(*pt), node);
  220. cmp = value - other->base.seqno;
  221. if (cmp > 0) {
  222. p = &parent->rb_right;
  223. } else if (cmp < 0) {
  224. p = &parent->rb_left;
  225. } else {
  226. if (dma_fence_get_rcu(&other->base)) {
  227. sync_timeline_put(obj);
  228. kfree(pt);
  229. pt = other;
  230. goto unlock;
  231. }
  232. p = &parent->rb_left;
  233. }
  234. }
  235. rb_link_node(&pt->node, parent, p);
  236. rb_insert_color(&pt->node, &obj->pt_tree);
  237. parent = rb_next(&pt->node);
  238. list_add_tail(&pt->link,
  239. parent ? &rb_entry(parent, typeof(*pt), node)->link : &obj->pt_list);
  240. }
  241. unlock:
  242. spin_unlock_irq(&obj->lock);
  243. return pt;
  244. }
  245. /*
  246. * *WARNING*
  247. *
  248. * improper use of this can result in deadlocking kernel drivers from userspace.
  249. */
  250. /* opening sw_sync create a new sync obj */
  251. static int sw_sync_debugfs_open(struct inode *inode, struct file *file)
  252. {
  253. struct sync_timeline *obj;
  254. char task_comm[TASK_COMM_LEN];
  255. get_task_comm(task_comm, current);
  256. obj = sync_timeline_create(task_comm);
  257. if (!obj)
  258. return -ENOMEM;
  259. file->private_data = obj;
  260. return 0;
  261. }
  262. static int sw_sync_debugfs_release(struct inode *inode, struct file *file)
  263. {
  264. struct sync_timeline *obj = file->private_data;
  265. struct sync_pt *pt, *next;
  266. spin_lock_irq(&obj->lock);
  267. list_for_each_entry_safe(pt, next, &obj->pt_list, link) {
  268. dma_fence_set_error(&pt->base, -ENOENT);
  269. dma_fence_signal_locked(&pt->base);
  270. }
  271. spin_unlock_irq(&obj->lock);
  272. sync_timeline_put(obj);
  273. return 0;
  274. }
  275. static long sw_sync_ioctl_create_fence(struct sync_timeline *obj,
  276. unsigned long arg)
  277. {
  278. int fd = get_unused_fd_flags(O_CLOEXEC);
  279. int err;
  280. struct sync_pt *pt;
  281. struct sync_file *sync_file;
  282. struct sw_sync_create_fence_data data;
  283. if (fd < 0)
  284. return fd;
  285. if (copy_from_user(&data, (void __user *)arg, sizeof(data))) {
  286. err = -EFAULT;
  287. goto err;
  288. }
  289. pt = sync_pt_create(obj, data.value);
  290. if (!pt) {
  291. err = -ENOMEM;
  292. goto err;
  293. }
  294. sync_file = sync_file_create(&pt->base);
  295. dma_fence_put(&pt->base);
  296. if (!sync_file) {
  297. err = -ENOMEM;
  298. goto err;
  299. }
  300. data.fence = fd;
  301. if (copy_to_user((void __user *)arg, &data, sizeof(data))) {
  302. fput(sync_file->file);
  303. err = -EFAULT;
  304. goto err;
  305. }
  306. fd_install(fd, sync_file->file);
  307. return 0;
  308. err:
  309. put_unused_fd(fd);
  310. return err;
  311. }
  312. static long sw_sync_ioctl_inc(struct sync_timeline *obj, unsigned long arg)
  313. {
  314. u32 value;
  315. if (copy_from_user(&value, (void __user *)arg, sizeof(value)))
  316. return -EFAULT;
  317. while (value > INT_MAX) {
  318. sync_timeline_signal(obj, INT_MAX);
  319. value -= INT_MAX;
  320. }
  321. sync_timeline_signal(obj, value);
  322. return 0;
  323. }
  324. static long sw_sync_ioctl(struct file *file, unsigned int cmd,
  325. unsigned long arg)
  326. {
  327. struct sync_timeline *obj = file->private_data;
  328. switch (cmd) {
  329. case SW_SYNC_IOC_CREATE_FENCE:
  330. return sw_sync_ioctl_create_fence(obj, arg);
  331. case SW_SYNC_IOC_INC:
  332. return sw_sync_ioctl_inc(obj, arg);
  333. default:
  334. return -ENOTTY;
  335. }
  336. }
  337. const struct file_operations sw_sync_debugfs_fops = {
  338. .open = sw_sync_debugfs_open,
  339. .release = sw_sync_debugfs_release,
  340. .unlocked_ioctl = sw_sync_ioctl,
  341. .compat_ioctl = sw_sync_ioctl,
  342. };