drivers/dma-buf/sw_sync.c

154 	struct sync_pt *pt = dma_fence_to_sync_pt(fence);
159 	if (!list_empty(&pt->link)) {
160 		list_del(&pt->link);
161 		rb_erase(&pt->node, &parent->pt_tree);
197 	struct sync_pt *pt = dma_fence_to_sync_pt(fence);
202 		if (ktime_before(deadline, pt->deadline))
203 			pt->deadline = deadline;
205 		pt->deadline = deadline;
233 	struct sync_pt *pt, *next;
241 	list_for_each_entry_safe(pt, next, &obj->pt_list, link) {
242 		if (!timeline_fence_signaled(&pt->base))
245 		dma_fence_get(&pt->base);
247 		list_move_tail(&pt->link, &signalled);
248 		rb_erase(&pt->node, &obj->pt_tree);
250 		dma_fence_signal_locked(&pt->base);
255 	list_for_each_entry_safe(pt, next, &signalled, link) {
256 		list_del_init(&pt->link);
257 		dma_fence_put(&pt->base);
262  * sync_pt_create() - creates a sync pt
274 	struct sync_pt *pt;
276 	pt = kzalloc(sizeof(*pt), GFP_KERNEL);
277 	if (!pt)
281 	dma_fence_init(&pt->base, &timeline_fence_ops, &obj->lock,
283 	INIT_LIST_HEAD(&pt->link);
286 	if (!dma_fence_is_signaled_locked(&pt->base)) {
295 			other = rb_entry(parent, typeof(*pt), node);
304 					kfree(pt);
305 					pt = other;
311 		rb_link_node(&pt->node, parent, p);
312 		rb_insert_color(&pt->node, &obj->pt_tree);
314 		parent = rb_next(&pt->node);
315 		list_add_tail(&pt->link,
316 			      parent ? &rb_entry(parent, typeof(*pt), node)->link : &obj->pt_list);
321 	return pt;
350 	struct sync_pt *pt, *next;
354 	list_for_each_entry_safe(pt, next, &obj->pt_list, link) {
355 		dma_fence_set_error(&pt->base, -ENOENT);
356 		dma_fence_signal_locked(&pt->base);
370 	struct sync_pt *pt;
382 	pt = sync_pt_create(obj, data.value);
383 	if (!pt) {
388 	sync_file = sync_file_create(&pt->base);
389 	dma_fence_put(&pt->base);
433 	struct sync_pt *pt;
446 	pt = dma_fence_to_sync_pt(fence);
447 	if (!pt)
452 		data.deadline_ns = ktime_to_ns(pt->deadline);