2 * drivers/dma-buf/sync_file.c
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/export.h>
18 #include <linux/file.h>
20 #include <linux/kernel.h>
21 #include <linux/poll.h>
22 #include <linux/sched.h>
23 #include <linux/slab.h>
24 #include <linux/uaccess.h>
25 #include <linux/anon_inodes.h>
26 #include <linux/sync_file.h>
27 #include <uapi/linux/sync_file.h>
29 static const struct file_operations sync_file_fops;
31 static struct sync_file *sync_file_alloc(void)
33 struct sync_file *sync_file;
35 sync_file = kzalloc(sizeof(*sync_file), GFP_KERNEL);
39 sync_file->file = anon_inode_getfile("sync_file", &sync_file_fops,
41 if (IS_ERR(sync_file->file))
44 kref_init(&sync_file->kref);
46 init_waitqueue_head(&sync_file->wq);
48 INIT_LIST_HEAD(&sync_file->cb.node);
57 static void fence_check_cb_func(struct fence *f, struct fence_cb *cb)
59 struct sync_file *sync_file;
61 sync_file = container_of(cb, struct sync_file, cb);
63 wake_up_all(&sync_file->wq);
67 * sync_file_create() - creates a sync file
68 * @fence: fence to add to the sync_fence
70 * Creates a sync_file containg @fence. Once this is called, the sync_file
71 * takes ownership of @fence. The sync_file can be released with
72 * fput(sync_file->file). Returns the sync_file or NULL in case of error.
74 struct sync_file *sync_file_create(struct fence *fence)
76 struct sync_file *sync_file;
78 sync_file = sync_file_alloc();
82 sync_file->fence = fence;
84 snprintf(sync_file->name, sizeof(sync_file->name), "%s-%s%llu-%d",
85 fence->ops->get_driver_name(fence),
86 fence->ops->get_timeline_name(fence), fence->context,
91 EXPORT_SYMBOL(sync_file_create);
94 * sync_file_fdget() - get a sync_file from an fd
95 * @fd: fd referencing a fence
97 * Ensures @fd references a valid sync_file, increments the refcount of the
98 * backing file. Returns the sync_file or NULL in case of error.
100 static struct sync_file *sync_file_fdget(int fd)
102 struct file *file = fget(fd);
107 if (file->f_op != &sync_file_fops)
110 return file->private_data;
118 * sync_file_get_fence - get the fence related to the sync_file fd
119 * @fd: sync_file fd to get the fence from
121 * Ensures @fd references a valid sync_file and returns a fence that
122 * represents all fence in the sync_file. On error NULL is returned.
124 struct fence *sync_file_get_fence(int fd)
126 struct sync_file *sync_file;
129 sync_file = sync_file_fdget(fd);
133 fence = fence_get(sync_file->fence);
134 fput(sync_file->file);
138 EXPORT_SYMBOL(sync_file_get_fence);
140 static int sync_file_set_fence(struct sync_file *sync_file,
141 struct fence **fences, int num_fences)
143 struct fence_array *array;
146 * The reference for the fences in the new sync_file and held
147 * in add_fence() during the merge procedure, so for num_fences == 1
148 * we already own a new reference to the fence. For num_fence > 1
149 * we own the reference of the fence_array creation.
151 if (num_fences == 1) {
152 sync_file->fence = fences[0];
154 array = fence_array_create(num_fences, fences,
155 fence_context_alloc(1), 1, false);
159 sync_file->fence = &array->base;
165 static struct fence **get_fences(struct sync_file *sync_file, int *num_fences)
167 if (fence_is_array(sync_file->fence)) {
168 struct fence_array *array = to_fence_array(sync_file->fence);
170 *num_fences = array->num_fences;
171 return array->fences;
175 return &sync_file->fence;
178 static void add_fence(struct fence **fences, int *i, struct fence *fence)
182 if (!fence_is_signaled(fence)) {
189 * sync_file_merge() - merge two sync_files
190 * @name: name of new fence
194 * Creates a new sync_file which contains copies of all the fences in both
195 * @a and @b. @a and @b remain valid, independent sync_file. Returns the
196 * new merged sync_file or NULL in case of error.
198 static struct sync_file *sync_file_merge(const char *name, struct sync_file *a,
201 struct sync_file *sync_file;
202 struct fence **fences, **nfences, **a_fences, **b_fences;
203 int i, i_a, i_b, num_fences, a_num_fences, b_num_fences;
205 sync_file = sync_file_alloc();
209 a_fences = get_fences(a, &a_num_fences);
210 b_fences = get_fences(b, &b_num_fences);
211 if (a_num_fences > INT_MAX - b_num_fences)
214 num_fences = a_num_fences + b_num_fences;
216 fences = kcalloc(num_fences, sizeof(*fences), GFP_KERNEL);
221 * Assume sync_file a and b are both ordered and have no
222 * duplicates with the same context.
224 * If a sync_file can only be created with sync_file_merge
225 * and sync_file_create, this is a reasonable assumption.
227 for (i = i_a = i_b = 0; i_a < a_num_fences && i_b < b_num_fences; ) {
228 struct fence *pt_a = a_fences[i_a];
229 struct fence *pt_b = b_fences[i_b];
231 if (pt_a->context < pt_b->context) {
232 add_fence(fences, &i, pt_a);
235 } else if (pt_a->context > pt_b->context) {
236 add_fence(fences, &i, pt_b);
240 if (pt_a->seqno - pt_b->seqno <= INT_MAX)
241 add_fence(fences, &i, pt_a);
243 add_fence(fences, &i, pt_b);
250 for (; i_a < a_num_fences; i_a++)
251 add_fence(fences, &i, a_fences[i_a]);
253 for (; i_b < b_num_fences; i_b++)
254 add_fence(fences, &i, b_fences[i_b]);
257 fences[i++] = fence_get(a_fences[0]);
259 if (num_fences > i) {
260 nfences = krealloc(fences, i * sizeof(*fences),
268 if (sync_file_set_fence(sync_file, fences, i) < 0) {
273 strlcpy(sync_file->name, name, sizeof(sync_file->name));
277 fput(sync_file->file);
282 static void sync_file_free(struct kref *kref)
284 struct sync_file *sync_file = container_of(kref, struct sync_file,
287 if (test_bit(POLL_ENABLED, &sync_file->fence->flags))
288 fence_remove_callback(sync_file->fence, &sync_file->cb);
289 fence_put(sync_file->fence);
293 static int sync_file_release(struct inode *inode, struct file *file)
295 struct sync_file *sync_file = file->private_data;
297 kref_put(&sync_file->kref, sync_file_free);
301 static unsigned int sync_file_poll(struct file *file, poll_table *wait)
303 struct sync_file *sync_file = file->private_data;
305 poll_wait(file, &sync_file->wq, wait);
307 if (!poll_does_not_wait(wait) &&
308 !test_and_set_bit(POLL_ENABLED, &sync_file->fence->flags)) {
309 if (fence_add_callback(sync_file->fence, &sync_file->cb,
310 fence_check_cb_func) < 0)
311 wake_up_all(&sync_file->wq);
314 return fence_is_signaled(sync_file->fence) ? POLLIN : 0;
317 static long sync_file_ioctl_merge(struct sync_file *sync_file,
320 int fd = get_unused_fd_flags(O_CLOEXEC);
322 struct sync_file *fence2, *fence3;
323 struct sync_merge_data data;
328 if (copy_from_user(&data, (void __user *)arg, sizeof(data))) {
333 if (data.flags || data.pad) {
338 fence2 = sync_file_fdget(data.fd2);
344 data.name[sizeof(data.name) - 1] = '\0';
345 fence3 = sync_file_merge(data.name, sync_file, fence2);
352 if (copy_to_user((void __user *)arg, &data, sizeof(data))) {
357 fd_install(fd, fence3->file);
372 static void sync_fill_fence_info(struct fence *fence,
373 struct sync_fence_info *info)
375 strlcpy(info->obj_name, fence->ops->get_timeline_name(fence),
376 sizeof(info->obj_name));
377 strlcpy(info->driver_name, fence->ops->get_driver_name(fence),
378 sizeof(info->driver_name));
379 if (fence_is_signaled(fence))
380 info->status = fence->status >= 0 ? 1 : fence->status;
383 info->timestamp_ns = ktime_to_ns(fence->timestamp);
386 static long sync_file_ioctl_fence_info(struct sync_file *sync_file,
389 struct sync_file_info info;
390 struct sync_fence_info *fence_info = NULL;
391 struct fence **fences;
393 int num_fences, ret, i;
395 if (copy_from_user(&info, (void __user *)arg, sizeof(info)))
398 if (info.flags || info.pad)
401 fences = get_fences(sync_file, &num_fences);
404 * Passing num_fences = 0 means that userspace doesn't want to
405 * retrieve any sync_fence_info. If num_fences = 0 we skip filling
406 * sync_fence_info and return the actual number of fences on
409 if (!info.num_fences)
412 if (info.num_fences < num_fences)
415 size = num_fences * sizeof(*fence_info);
416 fence_info = kzalloc(size, GFP_KERNEL);
420 for (i = 0; i < num_fences; i++)
421 sync_fill_fence_info(fences[i], &fence_info[i]);
423 if (copy_to_user(u64_to_user_ptr(info.sync_fence_info), fence_info,
430 strlcpy(info.name, sync_file->name, sizeof(info.name));
431 info.status = fence_is_signaled(sync_file->fence);
432 info.num_fences = num_fences;
434 if (copy_to_user((void __user *)arg, &info, sizeof(info)))
445 static long sync_file_ioctl(struct file *file, unsigned int cmd,
448 struct sync_file *sync_file = file->private_data;
452 return sync_file_ioctl_merge(sync_file, arg);
454 case SYNC_IOC_FILE_INFO:
455 return sync_file_ioctl_fence_info(sync_file, arg);
462 static const struct file_operations sync_file_fops = {
463 .release = sync_file_release,
464 .poll = sync_file_poll,
465 .unlocked_ioctl = sync_file_ioctl,
466 .compat_ioctl = sync_file_ioctl,